maxmustermann/TypeScript
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity
TypeScript/lib/typingsInstaller.js
TypeScript Bot 01de6ff2ec Bump version to 4.4.4 and LKG
2021-10-06 23:30:48 +00:00

121186 lines
7 MiB
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

/*! *****************************************************************************
Copyright (c) Microsoft Corporation. All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License"); you may not use
this file except in compliance with the License. You may obtain a copy of the
License at http://www.apache.org/licenses/LICENSE-2.0
THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
MERCHANTABLITY OR NON-INFRINGEMENT.
See the Apache Version 2.0 License for specific language governing permissions
and limitations under the License.
***************************************************************************** */
"use strict";
var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
if (ar || !(i in from)) {
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
ar[i] = from[i];
}
}
return to.concat(ar || Array.prototype.slice.call(from));
};
var __assign = (this && this.__assign) || function () {
__assign = Object.assign || function(t) {
for (var s, i = 1, n = arguments.length; i < n; i++) {
s = arguments[i];
for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
t[p] = s[p];
}
return t;
};
return __assign.apply(this, arguments);
};
var __makeTemplateObject = (this && this.__makeTemplateObject) || function (cooked, raw) {
if (Object.defineProperty) { Object.defineProperty(cooked, "raw", { value: raw }); } else { cooked.raw = raw; }
return cooked;
};
var __generator = (this && this.__generator) || function (thisArg, body) {
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
function verb(n) { return function (v) { return step([n, v]); }; }
function step(op) {
if (f) throw new TypeError("Generator is already executing.");
while (_) try {
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
if (y = 0, t) op = [op[0] & 2, t.value];
switch (op[0]) {
case 0: case 1: t = op; break;
case 4: _.label++; return { value: op[1], done: false };
case 5: _.label++; y = op[1]; op = [0]; continue;
case 7: op = _.ops.pop(); _.trys.pop(); continue;
default:
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
if (t[2]) _.ops.pop();
_.trys.pop(); continue;
}
op = body.call(thisArg, _);
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
}
};
var __extends = (this && this.__extends) || (function () {
var extendStatics = function (d, b) {
extendStatics = Object.setPrototypeOf ||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
return extendStatics(d, b);
};
return function (d, b) {
if (typeof b !== "function" && b !== null)
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
extendStatics(d, b);
function __() { this.constructor = d; }
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
};
})();
var ts;
(function (ts) {
// WARNING: The script `configurePrerelease.ts` uses a regexp to parse out these values.
// If changing the text in this section, be sure to test `configurePrerelease` too.
ts.versionMajorMinor = "4.4";
// The following is baselined as a literal template type without intervention
/** The version of the TypeScript compiler release */
// eslint-disable-next-line @typescript-eslint/no-inferrable-types
ts.version = "4.4.4";
/* @internal */
var Comparison;
(function (Comparison) {
Comparison[Comparison["LessThan"] = -1] = "LessThan";
Comparison[Comparison["EqualTo"] = 0] = "EqualTo";
Comparison[Comparison["GreaterThan"] = 1] = "GreaterThan";
})(Comparison = ts.Comparison || (ts.Comparison = {}));
/* @internal */
var NativeCollections;
(function (NativeCollections) {
/**
* Returns the native Map implementation if it is available and compatible (i.e. supports iteration).
*/
function tryGetNativeMap() {
// Internet Explorer's Map doesn't support iteration, so don't use it.
// eslint-disable-next-line no-in-operator
return typeof Map !== "undefined" && "entries" in Map.prototype && new Map([[0, 0]]).size === 1 ? Map : undefined;
}
NativeCollections.tryGetNativeMap = tryGetNativeMap;
/**
* Returns the native Set implementation if it is available and compatible (i.e. supports iteration).
*/
function tryGetNativeSet() {
// Internet Explorer's Set doesn't support iteration, so don't use it.
// eslint-disable-next-line no-in-operator
return typeof Set !== "undefined" && "entries" in Set.prototype && new Set([0]).size === 1 ? Set : undefined;
}
NativeCollections.tryGetNativeSet = tryGetNativeSet;
})(NativeCollections = ts.NativeCollections || (ts.NativeCollections = {}));
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
function getCollectionImplementation(name, nativeFactory, shimFactory) {
var _a;
// NOTE: ts.ShimCollections will be defined for typescriptServices.js but not for tsc.js, so we must test for it.
var constructor = (_a = ts.NativeCollections[nativeFactory]()) !== null && _a !== void 0 ? _a : ts.ShimCollections === null || ts.ShimCollections === void 0 ? void 0 : ts.ShimCollections[shimFactory](getIterator);
if (constructor)
return constructor;
throw new Error("TypeScript requires an environment that provides a compatible native " + name + " implementation.");
}
ts.Map = getCollectionImplementation("Map", "tryGetNativeMap", "createMapShim");
ts.Set = getCollectionImplementation("Set", "tryGetNativeSet", "createSetShim");
function getIterator(iterable) {
if (iterable) {
if (isArray(iterable))
return arrayIterator(iterable);
if (iterable instanceof ts.Map)
return iterable.entries();
if (iterable instanceof ts.Set)
return iterable.values();
throw new Error("Iteration not supported.");
}
}
ts.getIterator = getIterator;
ts.emptyArray = [];
ts.emptyMap = new ts.Map();
ts.emptySet = new ts.Set();
function createMap() {
return new ts.Map();
}
ts.createMap = createMap;
/**
* Create a new map from a template object is provided, the map will copy entries from it.
* @deprecated Use `new Map(getEntries(template))` instead.
*/
function createMapFromTemplate(template) {
var map = new ts.Map();
// Copies keys/values from template. Note that for..in will not throw if
// template is undefined, and instead will just exit the loop.
for (var key in template) {
if (hasOwnProperty.call(template, key)) {
map.set(key, template[key]);
}
}
return map;
}
ts.createMapFromTemplate = createMapFromTemplate;
function length(array) {
return array ? array.length : 0;
}
ts.length = length;
/**
* Iterates through 'array' by index and performs the callback on each element of array until the callback
* returns a truthy value, then returns that value.
* If no such value is found, the callback is applied to each element of array and undefined is returned.
*/
function forEach(array, callback) {
if (array) {
for (var i = 0; i < array.length; i++) {
var result = callback(array[i], i);
if (result) {
return result;
}
}
}
return undefined;
}
ts.forEach = forEach;
/**
* Like `forEach`, but iterates in reverse order.
*/
function forEachRight(array, callback) {
if (array) {
for (var i = array.length - 1; i >= 0; i--) {
var result = callback(array[i], i);
if (result) {
return result;
}
}
}
return undefined;
}
ts.forEachRight = forEachRight;
/** Like `forEach`, but suitable for use with numbers and strings (which may be falsy). */
function firstDefined(array, callback) {
if (array === undefined) {
return undefined;
}
for (var i = 0; i < array.length; i++) {
var result = callback(array[i], i);
if (result !== undefined) {
return result;
}
}
return undefined;
}
ts.firstDefined = firstDefined;
function firstDefinedIterator(iter, callback) {
while (true) {
var iterResult = iter.next();
if (iterResult.done) {
return undefined;
}
var result = callback(iterResult.value);
if (result !== undefined) {
return result;
}
}
}
ts.firstDefinedIterator = firstDefinedIterator;
function reduceLeftIterator(iterator, f, initial) {
var result = initial;
if (iterator) {
for (var step = iterator.next(), pos = 0; !step.done; step = iterator.next(), pos++) {
result = f(result, step.value, pos);
}
}
return result;
}
ts.reduceLeftIterator = reduceLeftIterator;
function zipWith(arrayA, arrayB, callback) {
var result = [];
ts.Debug.assertEqual(arrayA.length, arrayB.length);
for (var i = 0; i < arrayA.length; i++) {
result.push(callback(arrayA[i], arrayB[i], i));
}
return result;
}
ts.zipWith = zipWith;
function zipToIterator(arrayA, arrayB) {
ts.Debug.assertEqual(arrayA.length, arrayB.length);
var i = 0;
return {
next: function () {
if (i === arrayA.length) {
return { value: undefined, done: true };
}
i++;
return { value: [arrayA[i - 1], arrayB[i - 1]], done: false };
}
};
}
ts.zipToIterator = zipToIterator;
function zipToMap(keys, values) {
ts.Debug.assert(keys.length === values.length);
var map = new ts.Map();
for (var i = 0; i < keys.length; ++i) {
map.set(keys[i], values[i]);
}
return map;
}
ts.zipToMap = zipToMap;
/**
* Creates a new array with `element` interspersed in between each element of `input`
* if there is more than 1 value in `input`. Otherwise, returns the existing array.
*/
function intersperse(input, element) {
if (input.length <= 1) {
return input;
}
var result = [];
for (var i = 0, n = input.length; i < n; i++) {
if (i)
result.push(element);
result.push(input[i]);
}
return result;
}
ts.intersperse = intersperse;
/**
* Iterates through `array` by index and performs the callback on each element of array until the callback
* returns a falsey value, then returns false.
* If no such value is found, the callback is applied to each element of array and `true` is returned.
*/
function every(array, callback) {
if (array) {
for (var i = 0; i < array.length; i++) {
if (!callback(array[i], i)) {
return false;
}
}
}
return true;
}
ts.every = every;
function find(array, predicate) {
for (var i = 0; i < array.length; i++) {
var value = array[i];
if (predicate(value, i)) {
return value;
}
}
return undefined;
}
ts.find = find;
function findLast(array, predicate) {
for (var i = array.length - 1; i >= 0; i--) {
var value = array[i];
if (predicate(value, i)) {
return value;
}
}
return undefined;
}
ts.findLast = findLast;
/** Works like Array.prototype.findIndex, returning `-1` if no element satisfying the predicate is found. */
function findIndex(array, predicate, startIndex) {
for (var i = startIndex || 0; i < array.length; i++) {
if (predicate(array[i], i)) {
return i;
}
}
return -1;
}
ts.findIndex = findIndex;
function findLastIndex(array, predicate, startIndex) {
for (var i = startIndex === undefined ? array.length - 1 : startIndex; i >= 0; i--) {
if (predicate(array[i], i)) {
return i;
}
}
return -1;
}
ts.findLastIndex = findLastIndex;
/**
* Returns the first truthy result of `callback`, or else fails.
* This is like `forEach`, but never returns undefined.
*/
function findMap(array, callback) {
for (var i = 0; i < array.length; i++) {
var result = callback(array[i], i);
if (result) {
return result;
}
}
return ts.Debug.fail();
}
ts.findMap = findMap;
function contains(array, value, equalityComparer) {
if (equalityComparer === void 0) { equalityComparer = equateValues; }
if (array) {
for (var _i = 0, array_1 = array; _i < array_1.length; _i++) {
var v = array_1[_i];
if (equalityComparer(v, value)) {
return true;
}
}
}
return false;
}
ts.contains = contains;
function arraysEqual(a, b, equalityComparer) {
if (equalityComparer === void 0) { equalityComparer = equateValues; }
return a.length === b.length && a.every(function (x, i) { return equalityComparer(x, b[i]); });
}
ts.arraysEqual = arraysEqual;
function indexOfAnyCharCode(text, charCodes, start) {
for (var i = start || 0; i < text.length; i++) {
if (contains(charCodes, text.charCodeAt(i))) {
return i;
}
}
return -1;
}
ts.indexOfAnyCharCode = indexOfAnyCharCode;
function countWhere(array, predicate) {
var count = 0;
if (array) {
for (var i = 0; i < array.length; i++) {
var v = array[i];
if (predicate(v, i)) {
count++;
}
}
}
return count;
}
ts.countWhere = countWhere;
function filter(array, f) {
if (array) {
var len = array.length;
var i = 0;
while (i < len && f(array[i]))
i++;
if (i < len) {
var result = array.slice(0, i);
i++;
while (i < len) {
var item = array[i];
if (f(item)) {
result.push(item);
}
i++;
}
return result;
}
}
return array;
}
ts.filter = filter;
function filterMutate(array, f) {
var outIndex = 0;
for (var i = 0; i < array.length; i++) {
if (f(array[i], i, array)) {
array[outIndex] = array[i];
outIndex++;
}
}
array.length = outIndex;
}
ts.filterMutate = filterMutate;
function clear(array) {
array.length = 0;
}
ts.clear = clear;
function map(array, f) {
var result;
if (array) {
result = [];
for (var i = 0; i < array.length; i++) {
result.push(f(array[i], i));
}
}
return result;
}
ts.map = map;
function mapIterator(iter, mapFn) {
return {
next: function () {
var iterRes = iter.next();
return iterRes.done ? iterRes : { value: mapFn(iterRes.value), done: false };
}
};
}
ts.mapIterator = mapIterator;
function sameMap(array, f) {
if (array) {
for (var i = 0; i < array.length; i++) {
var item = array[i];
var mapped = f(item, i);
if (item !== mapped) {
var result = array.slice(0, i);
result.push(mapped);
for (i++; i < array.length; i++) {
result.push(f(array[i], i));
}
return result;
}
}
}
return array;
}
ts.sameMap = sameMap;
/**
* Flattens an array containing a mix of array or non-array elements.
*
* @param array The array to flatten.
*/
function flatten(array) {
var result = [];
for (var _i = 0, array_2 = array; _i < array_2.length; _i++) {
var v = array_2[_i];
if (v) {
if (isArray(v)) {
addRange(result, v);
}
else {
result.push(v);
}
}
}
return result;
}
ts.flatten = flatten;
/**
* Maps an array. If the mapped value is an array, it is spread into the result.
*
* @param array The array to map.
* @param mapfn The callback used to map the result into one or more values.
*/
function flatMap(array, mapfn) {
var result;
if (array) {
for (var i = 0; i < array.length; i++) {
var v = mapfn(array[i], i);
if (v) {
if (isArray(v)) {
result = addRange(result, v);
}
else {
result = append(result, v);
}
}
}
}
return result || ts.emptyArray;
}
ts.flatMap = flatMap;
function flatMapToMutable(array, mapfn) {
var result = [];
if (array) {
for (var i = 0; i < array.length; i++) {
var v = mapfn(array[i], i);
if (v) {
if (isArray(v)) {
addRange(result, v);
}
else {
result.push(v);
}
}
}
}
return result;
}
ts.flatMapToMutable = flatMapToMutable;
function flatMapIterator(iter, mapfn) {
var first = iter.next();
if (first.done) {
return ts.emptyIterator;
}
var currentIter = getIterator(first.value);
return {
next: function () {
while (true) {
var currentRes = currentIter.next();
if (!currentRes.done) {
return currentRes;
}
var iterRes = iter.next();
if (iterRes.done) {
return iterRes;
}
currentIter = getIterator(iterRes.value);
}
},
};
function getIterator(x) {
var res = mapfn(x);
return res === undefined ? ts.emptyIterator : isArray(res) ? arrayIterator(res) : res;
}
}
ts.flatMapIterator = flatMapIterator;
function sameFlatMap(array, mapfn) {
var result;
if (array) {
for (var i = 0; i < array.length; i++) {
var item = array[i];
var mapped = mapfn(item, i);
if (result || item !== mapped || isArray(mapped)) {
if (!result) {
result = array.slice(0, i);
}
if (isArray(mapped)) {
addRange(result, mapped);
}
else {
result.push(mapped);
}
}
}
}
return result || array;
}
ts.sameFlatMap = sameFlatMap;
function mapAllOrFail(array, mapFn) {
var result = [];
for (var i = 0; i < array.length; i++) {
var mapped = mapFn(array[i], i);
if (mapped === undefined) {
return undefined;
}
result.push(mapped);
}
return result;
}
ts.mapAllOrFail = mapAllOrFail;
function mapDefined(array, mapFn) {
var result = [];
if (array) {
for (var i = 0; i < array.length; i++) {
var mapped = mapFn(array[i], i);
if (mapped !== undefined) {
result.push(mapped);
}
}
}
return result;
}
ts.mapDefined = mapDefined;
function mapDefinedIterator(iter, mapFn) {
return {
next: function () {
while (true) {
var res = iter.next();
if (res.done) {
return res;
}
var value = mapFn(res.value);
if (value !== undefined) {
return { value: value, done: false };
}
}
}
};
}
ts.mapDefinedIterator = mapDefinedIterator;
function mapDefinedEntries(map, f) {
if (!map) {
return undefined;
}
var result = new ts.Map();
map.forEach(function (value, key) {
var entry = f(key, value);
if (entry !== undefined) {
var newKey = entry[0], newValue = entry[1];
if (newKey !== undefined && newValue !== undefined) {
result.set(newKey, newValue);
}
}
});
return result;
}
ts.mapDefinedEntries = mapDefinedEntries;
function mapDefinedValues(set, f) {
if (set) {
var result_1 = new ts.Set();
set.forEach(function (value) {
var newValue = f(value);
if (newValue !== undefined) {
result_1.add(newValue);
}
});
return result_1;
}
}
ts.mapDefinedValues = mapDefinedValues;
function getOrUpdate(map, key, callback) {
if (map.has(key)) {
return map.get(key);
}
var value = callback();
map.set(key, value);
return value;
}
ts.getOrUpdate = getOrUpdate;
function tryAddToSet(set, value) {
if (!set.has(value)) {
set.add(value);
return true;
}
return false;
}
ts.tryAddToSet = tryAddToSet;
ts.emptyIterator = { next: function () { return ({ value: undefined, done: true }); } };
function singleIterator(value) {
var done = false;
return {
next: function () {
var wasDone = done;
done = true;
return wasDone ? { value: undefined, done: true } : { value: value, done: false };
}
};
}
ts.singleIterator = singleIterator;
function spanMap(array, keyfn, mapfn) {
var result;
if (array) {
result = [];
var len = array.length;
var previousKey = void 0;
var key = void 0;
var start = 0;
var pos = 0;
while (start < len) {
while (pos < len) {
var value = array[pos];
key = keyfn(value, pos);
if (pos === 0) {
previousKey = key;
}
else if (key !== previousKey) {
break;
}
pos++;
}
if (start < pos) {
var v = mapfn(array.slice(start, pos), previousKey, start, pos);
if (v) {
result.push(v);
}
start = pos;
}
previousKey = key;
pos++;
}
}
return result;
}
ts.spanMap = spanMap;
function mapEntries(map, f) {
if (!map) {
return undefined;
}
var result = new ts.Map();
map.forEach(function (value, key) {
var _a = f(key, value), newKey = _a[0], newValue = _a[1];
result.set(newKey, newValue);
});
return result;
}
ts.mapEntries = mapEntries;
function some(array, predicate) {
if (array) {
if (predicate) {
for (var _i = 0, array_3 = array; _i < array_3.length; _i++) {
var v = array_3[_i];
if (predicate(v)) {
return true;
}
}
}
else {
return array.length > 0;
}
}
return false;
}
ts.some = some;
/** Calls the callback with (start, afterEnd) index pairs for each range where 'pred' is true. */
function getRangesWhere(arr, pred, cb) {
var start;
for (var i = 0; i < arr.length; i++) {
if (pred(arr[i])) {
start = start === undefined ? i : start;
}
else {
if (start !== undefined) {
cb(start, i);
start = undefined;
}
}
}
if (start !== undefined)
cb(start, arr.length);
}
ts.getRangesWhere = getRangesWhere;
function concatenate(array1, array2) {
if (!some(array2))
return array1;
if (!some(array1))
return array2;
return __spreadArray(__spreadArray([], array1, true), array2, true);
}
ts.concatenate = concatenate;
function selectIndex(_, i) {
return i;
}
function indicesOf(array) {
return array.map(selectIndex);
}
ts.indicesOf = indicesOf;
function deduplicateRelational(array, equalityComparer, comparer) {
// Perform a stable sort of the array. This ensures the first entry in a list of
// duplicates remains the first entry in the result.
var indices = indicesOf(array);
stableSortIndices(array, indices, comparer);
var last = array[indices[0]];
var deduplicated = [indices[0]];
for (var i = 1; i < indices.length; i++) {
var index = indices[i];
var item = array[index];
if (!equalityComparer(last, item)) {
deduplicated.push(index);
last = item;
}
}
// restore original order
deduplicated.sort();
return deduplicated.map(function (i) { return array[i]; });
}
function deduplicateEquality(array, equalityComparer) {
var result = [];
for (var _i = 0, array_4 = array; _i < array_4.length; _i++) {
var item = array_4[_i];
pushIfUnique(result, item, equalityComparer);
}
return result;
}
/**
* Deduplicates an unsorted array.
* @param equalityComparer An `EqualityComparer` used to determine if two values are duplicates.
* @param comparer An optional `Comparer` used to sort entries before comparison, though the
* result will remain in the original order in `array`.
*/
function deduplicate(array, equalityComparer, comparer) {
return array.length === 0 ? [] :
array.length === 1 ? array.slice() :
comparer ? deduplicateRelational(array, equalityComparer, comparer) :
deduplicateEquality(array, equalityComparer);
}
ts.deduplicate = deduplicate;
/**
* Deduplicates an array that has already been sorted.
*/
function deduplicateSorted(array, comparer) {
if (array.length === 0)
return ts.emptyArray;
var last = array[0];
var deduplicated = [last];
for (var i = 1; i < array.length; i++) {
var next = array[i];
switch (comparer(next, last)) {
// equality comparison
case true:
// relational comparison
// falls through
case 0 /* EqualTo */:
continue;
case -1 /* LessThan */:
// If `array` is sorted, `next` should **never** be less than `last`.
return ts.Debug.fail("Array is unsorted.");
}
deduplicated.push(last = next);
}
return deduplicated;
}
function insertSorted(array, insert, compare) {
if (array.length === 0) {
array.push(insert);
return;
}
var insertIndex = binarySearch(array, insert, identity, compare);
if (insertIndex < 0) {
array.splice(~insertIndex, 0, insert);
}
}
ts.insertSorted = insertSorted;
function sortAndDeduplicate(array, comparer, equalityComparer) {
return deduplicateSorted(sort(array, comparer), equalityComparer || comparer || compareStringsCaseSensitive);
}
ts.sortAndDeduplicate = sortAndDeduplicate;
function arrayIsSorted(array, comparer) {
if (array.length < 2)
return true;
var prevElement = array[0];
for (var _i = 0, _a = array.slice(1); _i < _a.length; _i++) {
var element = _a[_i];
if (comparer(prevElement, element) === 1 /* GreaterThan */) {
return false;
}
prevElement = element;
}
return true;
}
ts.arrayIsSorted = arrayIsSorted;
function arrayIsEqualTo(array1, array2, equalityComparer) {
if (equalityComparer === void 0) { equalityComparer = equateValues; }
if (!array1 || !array2) {
return array1 === array2;
}
if (array1.length !== array2.length) {
return false;
}
for (var i = 0; i < array1.length; i++) {
if (!equalityComparer(array1[i], array2[i], i)) {
return false;
}
}
return true;
}
ts.arrayIsEqualTo = arrayIsEqualTo;
function compact(array) {
var result;
if (array) {
for (var i = 0; i < array.length; i++) {
var v = array[i];
if (result || !v) {
if (!result) {
result = array.slice(0, i);
}
if (v) {
result.push(v);
}
}
}
}
return result || array;
}
ts.compact = compact;
/**
* Gets the relative complement of `arrayA` with respect to `arrayB`, returning the elements that
* are not present in `arrayA` but are present in `arrayB`. Assumes both arrays are sorted
* based on the provided comparer.
*/
function relativeComplement(arrayA, arrayB, comparer) {
if (!arrayB || !arrayA || arrayB.length === 0 || arrayA.length === 0)
return arrayB;
var result = [];
loopB: for (var offsetA = 0, offsetB = 0; offsetB < arrayB.length; offsetB++) {
if (offsetB > 0) {
// Ensure `arrayB` is properly sorted.
ts.Debug.assertGreaterThanOrEqual(comparer(arrayB[offsetB], arrayB[offsetB - 1]), 0 /* EqualTo */);
}
loopA: for (var startA = offsetA; offsetA < arrayA.length; offsetA++) {
if (offsetA > startA) {
// Ensure `arrayA` is properly sorted. We only need to perform this check if
// `offsetA` has changed since we entered the loop.
ts.Debug.assertGreaterThanOrEqual(comparer(arrayA[offsetA], arrayA[offsetA - 1]), 0 /* EqualTo */);
}
switch (comparer(arrayB[offsetB], arrayA[offsetA])) {
case -1 /* LessThan */:
// If B is less than A, B does not exist in arrayA. Add B to the result and
// move to the next element in arrayB without changing the current position
// in arrayA.
result.push(arrayB[offsetB]);
continue loopB;
case 0 /* EqualTo */:
// If B is equal to A, B exists in arrayA. Move to the next element in
// arrayB without adding B to the result or changing the current position
// in arrayA.
continue loopB;
case 1 /* GreaterThan */:
// If B is greater than A, we need to keep looking for B in arrayA. Move to
// the next element in arrayA and recheck.
continue loopA;
}
}
}
return result;
}
ts.relativeComplement = relativeComplement;
function sum(array, prop) {
var result = 0;
for (var _i = 0, array_5 = array; _i < array_5.length; _i++) {
var v = array_5[_i];
result += v[prop];
}
return result;
}
ts.sum = sum;
function append(to, value) {
if (value === undefined)
return to;
if (to === undefined)
return [value];
to.push(value);
return to;
}
ts.append = append;
function combine(xs, ys) {
if (xs === undefined)
return ys;
if (ys === undefined)
return xs;
if (isArray(xs))
return isArray(ys) ? concatenate(xs, ys) : append(xs, ys);
if (isArray(ys))
return append(ys, xs);
return [xs, ys];
}
ts.combine = combine;
/**
* Gets the actual offset into an array for a relative offset. Negative offsets indicate a
* position offset from the end of the array.
*/
function toOffset(array, offset) {
return offset < 0 ? array.length + offset : offset;
}
function addRange(to, from, start, end) {
if (from === undefined || from.length === 0)
return to;
if (to === undefined)
return from.slice(start, end);
start = start === undefined ? 0 : toOffset(from, start);
end = end === undefined ? from.length : toOffset(from, end);
for (var i = start; i < end && i < from.length; i++) {
if (from[i] !== undefined) {
to.push(from[i]);
}
}
return to;
}
ts.addRange = addRange;
/**
* @return Whether the value was added.
*/
function pushIfUnique(array, toAdd, equalityComparer) {
if (contains(array, toAdd, equalityComparer)) {
return false;
}
else {
array.push(toAdd);
return true;
}
}
ts.pushIfUnique = pushIfUnique;
/**
* Unlike `pushIfUnique`, this can take `undefined` as an input, and returns a new array.
*/
function appendIfUnique(array, toAdd, equalityComparer) {
if (array) {
pushIfUnique(array, toAdd, equalityComparer);
return array;
}
else {
return [toAdd];
}
}
ts.appendIfUnique = appendIfUnique;
function stableSortIndices(array, indices, comparer) {
// sort indices by value then position
indices.sort(function (x, y) { return comparer(array[x], array[y]) || compareValues(x, y); });
}
/**
* Returns a new sorted array.
*/
function sort(array, comparer) {
return (array.length === 0 ? array : array.slice().sort(comparer));
}
ts.sort = sort;
function arrayIterator(array) {
var i = 0;
return { next: function () {
if (i === array.length) {
return { value: undefined, done: true };
}
else {
i++;
return { value: array[i - 1], done: false };
}
} };
}
ts.arrayIterator = arrayIterator;
function arrayReverseIterator(array) {
var i = array.length;
return {
next: function () {
if (i === 0) {
return { value: undefined, done: true };
}
else {
i--;
return { value: array[i], done: false };
}
}
};
}
ts.arrayReverseIterator = arrayReverseIterator;
/**
* Stable sort of an array. Elements equal to each other maintain their relative position in the array.
*/
function stableSort(array, comparer) {
var indices = indicesOf(array);
stableSortIndices(array, indices, comparer);
return indices.map(function (i) { return array[i]; });
}
ts.stableSort = stableSort;
function rangeEquals(array1, array2, pos, end) {
while (pos < end) {
if (array1[pos] !== array2[pos]) {
return false;
}
pos++;
}
return true;
}
ts.rangeEquals = rangeEquals;
/**
* Returns the element at a specific offset in an array if non-empty, `undefined` otherwise.
* A negative offset indicates the element should be retrieved from the end of the array.
*/
function elementAt(array, offset) {
if (array) {
offset = toOffset(array, offset);
if (offset < array.length) {
return array[offset];
}
}
return undefined;
}
ts.elementAt = elementAt;
/**
* Returns the first element of an array if non-empty, `undefined` otherwise.
*/
function firstOrUndefined(array) {
return array.length === 0 ? undefined : array[0];
}
ts.firstOrUndefined = firstOrUndefined;
function first(array) {
ts.Debug.assert(array.length !== 0);
return array[0];
}
ts.first = first;
/**
* Returns the last element of an array if non-empty, `undefined` otherwise.
*/
function lastOrUndefined(array) {
return array.length === 0 ? undefined : array[array.length - 1];
}
ts.lastOrUndefined = lastOrUndefined;
function last(array) {
ts.Debug.assert(array.length !== 0);
return array[array.length - 1];
}
ts.last = last;
/**
* Returns the only element of an array if it contains only one element, `undefined` otherwise.
*/
function singleOrUndefined(array) {
return array && array.length === 1
? array[0]
: undefined;
}
ts.singleOrUndefined = singleOrUndefined;
function singleOrMany(array) {
return array && array.length === 1
? array[0]
: array;
}
ts.singleOrMany = singleOrMany;
function replaceElement(array, index, value) {
var result = array.slice(0);
result[index] = value;
return result;
}
ts.replaceElement = replaceElement;
/**
* Performs a binary search, finding the index at which `value` occurs in `array`.
* If no such index is found, returns the 2's-complement of first index at which
* `array[index]` exceeds `value`.
* @param array A sorted array whose first element must be no larger than number
* @param value The value to be searched for in the array.
* @param keySelector A callback used to select the search key from `value` and each element of
* `array`.
* @param keyComparer A callback used to compare two keys in a sorted array.
* @param offset An offset into `array` at which to start the search.
*/
function binarySearch(array, value, keySelector, keyComparer, offset) {
return binarySearchKey(array, keySelector(value), keySelector, keyComparer, offset);
}
ts.binarySearch = binarySearch;
/**
* Performs a binary search, finding the index at which an object with `key` occurs in `array`.
* If no such index is found, returns the 2's-complement of first index at which
* `array[index]` exceeds `key`.
* @param array A sorted array whose first element must be no larger than number
* @param key The key to be searched for in the array.
* @param keySelector A callback used to select the search key from each element of `array`.
* @param keyComparer A callback used to compare two keys in a sorted array.
* @param offset An offset into `array` at which to start the search.
*/
function binarySearchKey(array, key, keySelector, keyComparer, offset) {
if (!some(array)) {
return -1;
}
var low = offset || 0;
var high = array.length - 1;
while (low <= high) {
var middle = low + ((high - low) >> 1);
var midKey = keySelector(array[middle], middle);
switch (keyComparer(midKey, key)) {
case -1 /* LessThan */:
low = middle + 1;
break;
case 0 /* EqualTo */:
return middle;
case 1 /* GreaterThan */:
high = middle - 1;
break;
}
}
return ~low;
}
ts.binarySearchKey = binarySearchKey;
function reduceLeft(array, f, initial, start, count) {
if (array && array.length > 0) {
var size = array.length;
if (size > 0) {
var pos = start === undefined || start < 0 ? 0 : start;
var end = count === undefined || pos + count > size - 1 ? size - 1 : pos + count;
var result = void 0;
if (arguments.length <= 2) {
result = array[pos];
pos++;
}
else {
result = initial;
}
while (pos <= end) {
result = f(result, array[pos], pos);
pos++;
}
return result;
}
}
return initial;
}
ts.reduceLeft = reduceLeft;
var hasOwnProperty = Object.prototype.hasOwnProperty;
/**
* Indicates whether a map-like contains an own property with the specified key.
*
* @param map A map-like.
* @param key A property key.
*/
function hasProperty(map, key) {
return hasOwnProperty.call(map, key);
}
ts.hasProperty = hasProperty;
/**
* Gets the value of an owned property in a map-like.
*
* @param map A map-like.
* @param key A property key.
*/
function getProperty(map, key) {
return hasOwnProperty.call(map, key) ? map[key] : undefined;
}
ts.getProperty = getProperty;
/**
* Gets the owned, enumerable property keys of a map-like.
*/
function getOwnKeys(map) {
var keys = [];
for (var key in map) {
if (hasOwnProperty.call(map, key)) {
keys.push(key);
}
}
return keys;
}
ts.getOwnKeys = getOwnKeys;
function getAllKeys(obj) {
var result = [];
do {
var names = Object.getOwnPropertyNames(obj);
for (var _i = 0, names_1 = names; _i < names_1.length; _i++) {
var name = names_1[_i];
pushIfUnique(result, name);
}
} while (obj = Object.getPrototypeOf(obj));
return result;
}
ts.getAllKeys = getAllKeys;
function getOwnValues(sparseArray) {
var values = [];
for (var key in sparseArray) {
if (hasOwnProperty.call(sparseArray, key)) {
values.push(sparseArray[key]);
}
}
return values;
}
ts.getOwnValues = getOwnValues;
var _entries = Object.entries || (function (obj) {
var keys = getOwnKeys(obj);
var result = Array(keys.length);
for (var i = 0; i < keys.length; i++) {
result[i] = [keys[i], obj[keys[i]]];
}
return result;
});
function getEntries(obj) {
return obj ? _entries(obj) : [];
}
ts.getEntries = getEntries;
function arrayOf(count, f) {
var result = new Array(count);
for (var i = 0; i < count; i++) {
result[i] = f(i);
}
return result;
}
ts.arrayOf = arrayOf;
function arrayFrom(iterator, map) {
var result = [];
for (var iterResult = iterator.next(); !iterResult.done; iterResult = iterator.next()) {
result.push(map ? map(iterResult.value) : iterResult.value);
}
return result;
}
ts.arrayFrom = arrayFrom;
function assign(t) {
var args = [];
for (var _i = 1; _i < arguments.length; _i++) {
args[_i - 1] = arguments[_i];
}
for (var _a = 0, args_1 = args; _a < args_1.length; _a++) {
var arg = args_1[_a];
if (arg === undefined)
continue;
for (var p in arg) {
if (hasProperty(arg, p)) {
t[p] = arg[p];
}
}
}
return t;
}
ts.assign = assign;
/**
* Performs a shallow equality comparison of the contents of two map-likes.
*
* @param left A map-like whose properties should be compared.
* @param right A map-like whose properties should be compared.
*/
function equalOwnProperties(left, right, equalityComparer) {
if (equalityComparer === void 0) { equalityComparer = equateValues; }
if (left === right)
return true;
if (!left || !right)
return false;
for (var key in left) {
if (hasOwnProperty.call(left, key)) {
if (!hasOwnProperty.call(right, key))
return false;
if (!equalityComparer(left[key], right[key]))
return false;
}
}
for (var key in right) {
if (hasOwnProperty.call(right, key)) {
if (!hasOwnProperty.call(left, key))
return false;
}
}
return true;
}
ts.equalOwnProperties = equalOwnProperties;
function arrayToMap(array, makeKey, makeValue) {
if (makeValue === void 0) { makeValue = identity; }
var result = new ts.Map();
for (var _i = 0, array_6 = array; _i < array_6.length; _i++) {
var value = array_6[_i];
var key = makeKey(value);
if (key !== undefined)
result.set(key, makeValue(value));
}
return result;
}
ts.arrayToMap = arrayToMap;
function arrayToNumericMap(array, makeKey, makeValue) {
if (makeValue === void 0) { makeValue = identity; }
var result = [];
for (var _i = 0, array_7 = array; _i < array_7.length; _i++) {
var value = array_7[_i];
result[makeKey(value)] = makeValue(value);
}
return result;
}
ts.arrayToNumericMap = arrayToNumericMap;
function arrayToMultiMap(values, makeKey, makeValue) {
if (makeValue === void 0) { makeValue = identity; }
var result = createMultiMap();
for (var _i = 0, values_1 = values; _i < values_1.length; _i++) {
var value = values_1[_i];
result.add(makeKey(value), makeValue(value));
}
return result;
}
ts.arrayToMultiMap = arrayToMultiMap;
function group(values, getGroupId, resultSelector) {
if (resultSelector === void 0) { resultSelector = identity; }
return arrayFrom(arrayToMultiMap(values, getGroupId).values(), resultSelector);
}
ts.group = group;
function clone(object) {
var result = {};
for (var id in object) {
if (hasOwnProperty.call(object, id)) {
result[id] = object[id];
}
}
return result;
}
ts.clone = clone;
/**
* Creates a new object by adding the own properties of `second`, then the own properties of `first`.
*
* NOTE: This means that if a property exists in both `first` and `second`, the property in `first` will be chosen.
*/
function extend(first, second) {
var result = {};
for (var id in second) {
if (hasOwnProperty.call(second, id)) {
result[id] = second[id];
}
}
for (var id in first) {
if (hasOwnProperty.call(first, id)) {
result[id] = first[id];
}
}
return result;
}
ts.extend = extend;
function copyProperties(first, second) {
for (var id in second) {
if (hasOwnProperty.call(second, id)) {
first[id] = second[id];
}
}
}
ts.copyProperties = copyProperties;
function maybeBind(obj, fn) {
return fn ? fn.bind(obj) : undefined;
}
ts.maybeBind = maybeBind;
function createMultiMap() {
var map = new ts.Map();
map.add = multiMapAdd;
map.remove = multiMapRemove;
return map;
}
ts.createMultiMap = createMultiMap;
function multiMapAdd(key, value) {
var values = this.get(key);
if (values) {
values.push(value);
}
else {
this.set(key, values = [value]);
}
return values;
}
function multiMapRemove(key, value) {
var values = this.get(key);
if (values) {
unorderedRemoveItem(values, value);
if (!values.length) {
this.delete(key);
}
}
}
function createUnderscoreEscapedMultiMap() {
return createMultiMap();
}
ts.createUnderscoreEscapedMultiMap = createUnderscoreEscapedMultiMap;
/**
* Tests whether a value is an array.
*/
function isArray(value) {
return Array.isArray ? Array.isArray(value) : value instanceof Array;
}
ts.isArray = isArray;
function toArray(value) {
return isArray(value) ? value : [value];
}
ts.toArray = toArray;
/**
* Tests whether a value is string
*/
function isString(text) {
return typeof text === "string";
}
ts.isString = isString;
function isNumber(x) {
return typeof x === "number";
}
ts.isNumber = isNumber;
function tryCast(value, test) {
return value !== undefined && test(value) ? value : undefined;
}
ts.tryCast = tryCast;
function cast(value, test) {
if (value !== undefined && test(value))
return value;
return ts.Debug.fail("Invalid cast. The supplied value " + value + " did not pass the test '" + ts.Debug.getFunctionName(test) + "'.");
}
ts.cast = cast;
/** Does nothing. */
function noop(_) { }
ts.noop = noop;
/** Do nothing and return false */
function returnFalse() { return false; }
ts.returnFalse = returnFalse;
/** Do nothing and return true */
function returnTrue() { return true; }
ts.returnTrue = returnTrue;
/** Do nothing and return undefined */
function returnUndefined() { return undefined; }
ts.returnUndefined = returnUndefined;
/** Returns its argument. */
function identity(x) { return x; }
ts.identity = identity;
/** Returns lower case string */
function toLowerCase(x) { return x.toLowerCase(); }
ts.toLowerCase = toLowerCase;
// We convert the file names to lower case as key for file name on case insensitive file system
// While doing so we need to handle special characters (eg \u0130) to ensure that we dont convert
// it to lower case, fileName with its lowercase form can exist along side it.
// Handle special characters and make those case sensitive instead
//
// |-#--|-Unicode--|-Char code-|-Desc-------------------------------------------------------------------|
// | 1. | i | 105 | Ascii i |
// | 2. | I | 73 | Ascii I |
// |-------- Special characters ------------------------------------------------------------------------|
// | 3. | \u0130 | 304 | Upper case I with dot above |
// | 4. | i,\u0307 | 105,775 | i, followed by 775: Lower case of (3rd item) |
// | 5. | I,\u0307 | 73,775 | I, followed by 775: Upper case of (4th item), lower case is (4th item) |
// | 6. | \u0131 | 305 | Lower case i without dot, upper case is I (2nd item) |
// | 7. | \u00DF | 223 | Lower case sharp s |
//
// Because item 3 is special where in its lowercase character has its own
// upper case form we cant convert its case.
// Rest special characters are either already in lower case format or
// they have corresponding upper case character so they dont need special handling
//
// But to avoid having to do string building for most common cases, also ignore
// a-z, 0-9, \u0131, \u00DF, \, /, ., : and space
var fileNameLowerCaseRegExp = /[^\u0130\u0131\u00DFa-z0-9\\/:\-_\. ]+/g;
/**
* Case insensitive file systems have descripencies in how they handle some characters (eg. turkish Upper case I with dot on top - \u0130)
* This function is used in places where we want to make file name as a key on these systems
* It is possible on mac to be able to refer to file name with I with dot on top as a fileName with its lower case form
* But on windows we cannot. Windows can have fileName with I with dot on top next to its lower case and they can not each be referred with the lowercase forms
* Technically we would want this function to be platform sepcific as well but
* our api has till now only taken caseSensitive as the only input and just for some characters we dont want to update API and ensure all customers use those api
* We could use upper case and we would still need to deal with the descripencies but
* we want to continue using lower case since in most cases filenames are lowercasewe and wont need any case changes and avoid having to store another string for the key
* So for this function purpose, we go ahead and assume character I with dot on top it as case sensitive since its very unlikely to use lower case form of that special character
*/
function toFileNameLowerCase(x) {
return fileNameLowerCaseRegExp.test(x) ?
x.replace(fileNameLowerCaseRegExp, toLowerCase) :
x;
}
ts.toFileNameLowerCase = toFileNameLowerCase;
/** Throws an error because a function is not implemented. */
function notImplemented() {
throw new Error("Not implemented");
}
ts.notImplemented = notImplemented;
function memoize(callback) {
var value;
return function () {
if (callback) {
value = callback();
callback = undefined;
}
return value;
};
}
ts.memoize = memoize;
/** A version of `memoize` that supports a single primitive argument */
function memoizeOne(callback) {
var map = new ts.Map();
return function (arg) {
var key = typeof arg + ":" + arg;
var value = map.get(key);
if (value === undefined && !map.has(key)) {
value = callback(arg);
map.set(key, value);
}
return value;
};
}
ts.memoizeOne = memoizeOne;
function compose(a, b, c, d, e) {
if (!!e) {
var args_2 = [];
for (var i = 0; i < arguments.length; i++) {
args_2[i] = arguments[i];
}
return function (t) { return reduceLeft(args_2, function (u, f) { return f(u); }, t); };
}
else if (d) {
return function (t) { return d(c(b(a(t)))); };
}
else if (c) {
return function (t) { return c(b(a(t))); };
}
else if (b) {
return function (t) { return b(a(t)); };
}
else if (a) {
return function (t) { return a(t); };
}
else {
return function (t) { return t; };
}
}
ts.compose = compose;
var AssertionLevel;
(function (AssertionLevel) {
AssertionLevel[AssertionLevel["None"] = 0] = "None";
AssertionLevel[AssertionLevel["Normal"] = 1] = "Normal";
AssertionLevel[AssertionLevel["Aggressive"] = 2] = "Aggressive";
AssertionLevel[AssertionLevel["VeryAggressive"] = 3] = "VeryAggressive";
})(AssertionLevel = ts.AssertionLevel || (ts.AssertionLevel = {}));
function equateValues(a, b) {
return a === b;
}
ts.equateValues = equateValues;
/**
* Compare the equality of two strings using a case-sensitive ordinal comparison.
*
* Case-sensitive comparisons compare both strings one code-point at a time using the integer
* value of each code-point after applying `toUpperCase` to each string. We always map both
* strings to their upper-case form as some unicode characters do not properly round-trip to
* lowercase (such as `ẞ` (German sharp capital s)).
*/
function equateStringsCaseInsensitive(a, b) {
return a === b
|| a !== undefined
&& b !== undefined
&& a.toUpperCase() === b.toUpperCase();
}
ts.equateStringsCaseInsensitive = equateStringsCaseInsensitive;
/**
* Compare the equality of two strings using a case-sensitive ordinal comparison.
*
* Case-sensitive comparisons compare both strings one code-point at a time using the
* integer value of each code-point.
*/
function equateStringsCaseSensitive(a, b) {
return equateValues(a, b);
}
ts.equateStringsCaseSensitive = equateStringsCaseSensitive;
function compareComparableValues(a, b) {
return a === b ? 0 /* EqualTo */ :
a === undefined ? -1 /* LessThan */ :
b === undefined ? 1 /* GreaterThan */ :
a < b ? -1 /* LessThan */ :
1 /* GreaterThan */;
}
/**
* Compare two numeric values for their order relative to each other.
* To compare strings, use any of the `compareStrings` functions.
*/
function compareValues(a, b) {
return compareComparableValues(a, b);
}
ts.compareValues = compareValues;
/**
* Compare two TextSpans, first by `start`, then by `length`.
*/
function compareTextSpans(a, b) {
return compareValues(a === null || a === void 0 ? void 0 : a.start, b === null || b === void 0 ? void 0 : b.start) || compareValues(a === null || a === void 0 ? void 0 : a.length, b === null || b === void 0 ? void 0 : b.length);
}
ts.compareTextSpans = compareTextSpans;
function min(a, b, compare) {
return compare(a, b) === -1 /* LessThan */ ? a : b;
}
ts.min = min;
/**
* Compare two strings using a case-insensitive ordinal comparison.
*
* Ordinal comparisons are based on the difference between the unicode code points of both
* strings. Characters with multiple unicode representations are considered unequal. Ordinal
* comparisons provide predictable ordering, but place "a" after "B".
*
* Case-insensitive comparisons compare both strings one code-point at a time using the integer
* value of each code-point after applying `toUpperCase` to each string. We always map both
* strings to their upper-case form as some unicode characters do not properly round-trip to
* lowercase (such as `ẞ` (German sharp capital s)).
*/
function compareStringsCaseInsensitive(a, b) {
if (a === b)
return 0 /* EqualTo */;
if (a === undefined)
return -1 /* LessThan */;
if (b === undefined)
return 1 /* GreaterThan */;
a = a.toUpperCase();
b = b.toUpperCase();
return a < b ? -1 /* LessThan */ : a > b ? 1 /* GreaterThan */ : 0 /* EqualTo */;
}
ts.compareStringsCaseInsensitive = compareStringsCaseInsensitive;
/**
* Compare two strings using a case-sensitive ordinal comparison.
*
* Ordinal comparisons are based on the difference between the unicode code points of both
* strings. Characters with multiple unicode representations are considered unequal. Ordinal
* comparisons provide predictable ordering, but place "a" after "B".
*
* Case-sensitive comparisons compare both strings one code-point at a time using the integer
* value of each code-point.
*/
function compareStringsCaseSensitive(a, b) {
return compareComparableValues(a, b);
}
ts.compareStringsCaseSensitive = compareStringsCaseSensitive;
function getStringComparer(ignoreCase) {
return ignoreCase ? compareStringsCaseInsensitive : compareStringsCaseSensitive;
}
ts.getStringComparer = getStringComparer;
/**
* Creates a string comparer for use with string collation in the UI.
*/
var createUIStringComparer = (function () {
var defaultComparer;
var enUSComparer;
var stringComparerFactory = getStringComparerFactory();
return createStringComparer;
function compareWithCallback(a, b, comparer) {
if (a === b)
return 0 /* EqualTo */;
if (a === undefined)
return -1 /* LessThan */;
if (b === undefined)
return 1 /* GreaterThan */;
var value = comparer(a, b);
return value < 0 ? -1 /* LessThan */ : value > 0 ? 1 /* GreaterThan */ : 0 /* EqualTo */;
}
function createIntlCollatorStringComparer(locale) {
// Intl.Collator.prototype.compare is bound to the collator. See NOTE in
// http://www.ecma-international.org/ecma-402/2.0/#sec-Intl.Collator.prototype.compare
var comparer = new Intl.Collator(locale, { usage: "sort", sensitivity: "variant" }).compare;
return function (a, b) { return compareWithCallback(a, b, comparer); };
}
function createLocaleCompareStringComparer(locale) {
// if the locale is not the default locale (`undefined`), use the fallback comparer.
if (locale !== undefined)
return createFallbackStringComparer();
return function (a, b) { return compareWithCallback(a, b, compareStrings); };
function compareStrings(a, b) {
return a.localeCompare(b);
}
}
function createFallbackStringComparer() {
// An ordinal comparison puts "A" after "b", but for the UI we want "A" before "b".
// We first sort case insensitively. So "Aaa" will come before "baa".
// Then we sort case sensitively, so "aaa" will come before "Aaa".
//
// For case insensitive comparisons we always map both strings to their
// upper-case form as some unicode characters do not properly round-trip to
// lowercase (such as `ẞ` (German sharp capital s)).
return function (a, b) { return compareWithCallback(a, b, compareDictionaryOrder); };
function compareDictionaryOrder(a, b) {
return compareStrings(a.toUpperCase(), b.toUpperCase()) || compareStrings(a, b);
}
function compareStrings(a, b) {
return a < b ? -1 /* LessThan */ : a > b ? 1 /* GreaterThan */ : 0 /* EqualTo */;
}
}
function getStringComparerFactory() {
// If the host supports Intl, we use it for comparisons using the default locale.
if (typeof Intl === "object" && typeof Intl.Collator === "function") {
return createIntlCollatorStringComparer;
}
// If the host does not support Intl, we fall back to localeCompare.
// localeCompare in Node v0.10 is just an ordinal comparison, so don't use it.
if (typeof String.prototype.localeCompare === "function" &&
typeof String.prototype.toLocaleUpperCase === "function" &&
"a".localeCompare("B") < 0) {
return createLocaleCompareStringComparer;
}
// Otherwise, fall back to ordinal comparison:
return createFallbackStringComparer;
}
function createStringComparer(locale) {
// Hold onto common string comparers. This avoids constantly reallocating comparers during
// tests.
if (locale === undefined) {
return defaultComparer || (defaultComparer = stringComparerFactory(locale));
}
else if (locale === "en-US") {
return enUSComparer || (enUSComparer = stringComparerFactory(locale));
}
else {
return stringComparerFactory(locale);
}
}
})();
var uiComparerCaseSensitive;
var uiLocale;
function getUILocale() {
return uiLocale;
}
ts.getUILocale = getUILocale;
function setUILocale(value) {
if (uiLocale !== value) {
uiLocale = value;
uiComparerCaseSensitive = undefined;
}
}
ts.setUILocale = setUILocale;
/**
* Compare two strings in a using the case-sensitive sort behavior of the UI locale.
*
* Ordering is not predictable between different host locales, but is best for displaying
* ordered data for UI presentation. Characters with multiple unicode representations may
* be considered equal.
*
* Case-sensitive comparisons compare strings that differ in base characters, or
* accents/diacritic marks, or case as unequal.
*/
function compareStringsCaseSensitiveUI(a, b) {
var comparer = uiComparerCaseSensitive || (uiComparerCaseSensitive = createUIStringComparer(uiLocale));
return comparer(a, b);
}
ts.compareStringsCaseSensitiveUI = compareStringsCaseSensitiveUI;
function compareProperties(a, b, key, comparer) {
return a === b ? 0 /* EqualTo */ :
a === undefined ? -1 /* LessThan */ :
b === undefined ? 1 /* GreaterThan */ :
comparer(a[key], b[key]);
}
ts.compareProperties = compareProperties;
/** True is greater than false. */
function compareBooleans(a, b) {
return compareValues(a ? 1 : 0, b ? 1 : 0);
}
ts.compareBooleans = compareBooleans;
/**
* Given a name and a list of names that are *not* equal to the name, return a spelling suggestion if there is one that is close enough.
* Names less than length 3 only check for case-insensitive equality.
*
* find the candidate with the smallest Levenshtein distance,
* except for candidates:
* * With no name
* * Whose length differs from the target name by more than 0.34 of the length of the name.
* * Whose levenshtein distance is more than 0.4 of the length of the name
* (0.4 allows 1 substitution/transposition for every 5 characters,
* and 1 insertion/deletion at 3 characters)
*/
function getSpellingSuggestion(name, candidates, getName) {
var maximumLengthDifference = Math.min(2, Math.floor(name.length * 0.34));
var bestDistance = Math.floor(name.length * 0.4) + 1; // If the best result is worse than this, don't bother.
var bestCandidate;
for (var _i = 0, candidates_1 = candidates; _i < candidates_1.length; _i++) {
var candidate = candidates_1[_i];
var candidateName = getName(candidate);
if (candidateName !== undefined && Math.abs(candidateName.length - name.length) <= maximumLengthDifference) {
if (candidateName === name) {
continue;
}
// Only consider candidates less than 3 characters long when they differ by case.
// Otherwise, don't bother, since a user would usually notice differences of a 2-character name.
if (candidateName.length < 3 && candidateName.toLowerCase() !== name.toLowerCase()) {
continue;
}
var distance = levenshteinWithMax(name, candidateName, bestDistance - 0.1);
if (distance === undefined) {
continue;
}
ts.Debug.assert(distance < bestDistance); // Else `levenshteinWithMax` should return undefined
bestDistance = distance;
bestCandidate = candidate;
}
}
return bestCandidate;
}
ts.getSpellingSuggestion = getSpellingSuggestion;
function levenshteinWithMax(s1, s2, max) {
var previous = new Array(s2.length + 1);
var current = new Array(s2.length + 1);
/** Represents any value > max. We don't care about the particular value. */
var big = max + 0.01;
for (var i = 0; i <= s2.length; i++) {
previous[i] = i;
}
for (var i = 1; i <= s1.length; i++) {
var c1 = s1.charCodeAt(i - 1);
var minJ = Math.ceil(i > max ? i - max : 1);
var maxJ = Math.floor(s2.length > max + i ? max + i : s2.length);
current[0] = i;
/** Smallest value of the matrix in the ith column. */
var colMin = i;
for (var j = 1; j < minJ; j++) {
current[j] = big;
}
for (var j = minJ; j <= maxJ; j++) {
// case difference should be significantly cheaper than other differences
var substitutionDistance = s1[i - 1].toLowerCase() === s2[j - 1].toLowerCase()
? (previous[j - 1] + 0.1)
: (previous[j - 1] + 2);
var dist = c1 === s2.charCodeAt(j - 1)
? previous[j - 1]
: Math.min(/*delete*/ previous[j] + 1, /*insert*/ current[j - 1] + 1, /*substitute*/ substitutionDistance);
current[j] = dist;
colMin = Math.min(colMin, dist);
}
for (var j = maxJ + 1; j <= s2.length; j++) {
current[j] = big;
}
if (colMin > max) {
// Give up -- everything in this column is > max and it can't get better in future columns.
return undefined;
}
var temp = previous;
previous = current;
current = temp;
}
var res = previous[s2.length];
return res > max ? undefined : res;
}
function endsWith(str, suffix) {
var expectedPos = str.length - suffix.length;
return expectedPos >= 0 && str.indexOf(suffix, expectedPos) === expectedPos;
}
ts.endsWith = endsWith;
function removeSuffix(str, suffix) {
return endsWith(str, suffix) ? str.slice(0, str.length - suffix.length) : str;
}
ts.removeSuffix = removeSuffix;
function tryRemoveSuffix(str, suffix) {
return endsWith(str, suffix) ? str.slice(0, str.length - suffix.length) : undefined;
}
ts.tryRemoveSuffix = tryRemoveSuffix;
function stringContains(str, substring) {
return str.indexOf(substring) !== -1;
}
ts.stringContains = stringContains;
/**
* Takes a string like "jquery-min.4.2.3" and returns "jquery"
*/
function removeMinAndVersionNumbers(fileName) {
// We used to use the regex /[.-]((min)|(\d+(\.\d+)*))$/ and would just .replace it twice.
// Unfortunately, that regex has O(n^2) performance because v8 doesn't match from the end of the string.
// Instead, we now essentially scan the filename (backwards) ourselves.
var end = fileName.length;
for (var pos = end - 1; pos > 0; pos--) {
var ch = fileName.charCodeAt(pos);
if (ch >= 48 /* _0 */ && ch <= 57 /* _9 */) {
// Match a \d+ segment
do {
--pos;
ch = fileName.charCodeAt(pos);
} while (pos > 0 && ch >= 48 /* _0 */ && ch <= 57 /* _9 */);
}
else if (pos > 4 && (ch === 110 /* n */ || ch === 78 /* N */)) {
// Looking for "min" or "min"
// Already matched the 'n'
--pos;
ch = fileName.charCodeAt(pos);
if (ch !== 105 /* i */ && ch !== 73 /* I */) {
break;
}
--pos;
ch = fileName.charCodeAt(pos);
if (ch !== 109 /* m */ && ch !== 77 /* M */) {
break;
}
--pos;
ch = fileName.charCodeAt(pos);
}
else {
// This character is not part of either suffix pattern
break;
}
if (ch !== 45 /* minus */ && ch !== 46 /* dot */) {
break;
}
end = pos;
}
// end might be fileName.length, in which case this should internally no-op
return end === fileName.length ? fileName : fileName.slice(0, end);
}
ts.removeMinAndVersionNumbers = removeMinAndVersionNumbers;
/** Remove an item from an array, moving everything to its right one space left. */
function orderedRemoveItem(array, item) {
for (var i = 0; i < array.length; i++) {
if (array[i] === item) {
orderedRemoveItemAt(array, i);
return true;
}
}
return false;
}
ts.orderedRemoveItem = orderedRemoveItem;
/** Remove an item by index from an array, moving everything to its right one space left. */
function orderedRemoveItemAt(array, index) {
// This seems to be faster than either `array.splice(i, 1)` or `array.copyWithin(i, i+ 1)`.
for (var i = index; i < array.length - 1; i++) {
array[i] = array[i + 1];
}
array.pop();
}
ts.orderedRemoveItemAt = orderedRemoveItemAt;
function unorderedRemoveItemAt(array, index) {
// Fill in the "hole" left at `index`.
array[index] = array[array.length - 1];
array.pop();
}
ts.unorderedRemoveItemAt = unorderedRemoveItemAt;
/** Remove the *first* occurrence of `item` from the array. */
function unorderedRemoveItem(array, item) {
return unorderedRemoveFirstItemWhere(array, function (element) { return element === item; });
}
ts.unorderedRemoveItem = unorderedRemoveItem;
/** Remove the *first* element satisfying `predicate`. */
function unorderedRemoveFirstItemWhere(array, predicate) {
for (var i = 0; i < array.length; i++) {
if (predicate(array[i])) {
unorderedRemoveItemAt(array, i);
return true;
}
}
return false;
}
function createGetCanonicalFileName(useCaseSensitiveFileNames) {
return useCaseSensitiveFileNames ? identity : toFileNameLowerCase;
}
ts.createGetCanonicalFileName = createGetCanonicalFileName;
function patternText(_a) {
var prefix = _a.prefix, suffix = _a.suffix;
return prefix + "*" + suffix;
}
ts.patternText = patternText;
/**
* Given that candidate matches pattern, returns the text matching the '*'.
* E.g.: matchedText(tryParsePattern("foo*baz"), "foobarbaz") === "bar"
*/
function matchedText(pattern, candidate) {
ts.Debug.assert(isPatternMatch(pattern, candidate));
return candidate.substring(pattern.prefix.length, candidate.length - pattern.suffix.length);
}
ts.matchedText = matchedText;
/** Return the object corresponding to the best pattern to match `candidate`. */
function findBestPatternMatch(values, getPattern, candidate) {
var matchedValue;
// use length of prefix as betterness criteria
var longestMatchPrefixLength = -1;
for (var _i = 0, values_2 = values; _i < values_2.length; _i++) {
var v = values_2[_i];
var pattern = getPattern(v);
if (isPatternMatch(pattern, candidate) && pattern.prefix.length > longestMatchPrefixLength) {
longestMatchPrefixLength = pattern.prefix.length;
matchedValue = v;
}
}
return matchedValue;
}
ts.findBestPatternMatch = findBestPatternMatch;
function startsWith(str, prefix) {
return str.lastIndexOf(prefix, 0) === 0;
}
ts.startsWith = startsWith;
function removePrefix(str, prefix) {
return startsWith(str, prefix) ? str.substr(prefix.length) : str;
}
ts.removePrefix = removePrefix;
function tryRemovePrefix(str, prefix, getCanonicalFileName) {
if (getCanonicalFileName === void 0) { getCanonicalFileName = identity; }
return startsWith(getCanonicalFileName(str), getCanonicalFileName(prefix)) ? str.substring(prefix.length) : undefined;
}
ts.tryRemovePrefix = tryRemovePrefix;
function isPatternMatch(_a, candidate) {
var prefix = _a.prefix, suffix = _a.suffix;
return candidate.length >= prefix.length + suffix.length &&
startsWith(candidate, prefix) &&
endsWith(candidate, suffix);
}
function and(f, g) {
return function (arg) { return f(arg) && g(arg); };
}
ts.and = and;
function or() {
var fs = [];
for (var _i = 0; _i < arguments.length; _i++) {
fs[_i] = arguments[_i];
}
return function () {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
for (var _a = 0, fs_1 = fs; _a < fs_1.length; _a++) {
var f = fs_1[_a];
if (f.apply(void 0, args)) {
return true;
}
}
return false;
};
}
ts.or = or;
function not(fn) {
return function () {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
return !fn.apply(void 0, args);
};
}
ts.not = not;
function assertType(_) { }
ts.assertType = assertType;
function singleElementArray(t) {
return t === undefined ? undefined : [t];
}
ts.singleElementArray = singleElementArray;
function enumerateInsertsAndDeletes(newItems, oldItems, comparer, inserted, deleted, unchanged) {
unchanged = unchanged || noop;
var newIndex = 0;
var oldIndex = 0;
var newLen = newItems.length;
var oldLen = oldItems.length;
var hasChanges = false;
while (newIndex < newLen && oldIndex < oldLen) {
var newItem = newItems[newIndex];
var oldItem = oldItems[oldIndex];
var compareResult = comparer(newItem, oldItem);
if (compareResult === -1 /* LessThan */) {
inserted(newItem);
newIndex++;
hasChanges = true;
}
else if (compareResult === 1 /* GreaterThan */) {
deleted(oldItem);
oldIndex++;
hasChanges = true;
}
else {
unchanged(oldItem, newItem);
newIndex++;
oldIndex++;
}
}
while (newIndex < newLen) {
inserted(newItems[newIndex++]);
hasChanges = true;
}
while (oldIndex < oldLen) {
deleted(oldItems[oldIndex++]);
hasChanges = true;
}
return hasChanges;
}
ts.enumerateInsertsAndDeletes = enumerateInsertsAndDeletes;
function fill(length, cb) {
var result = Array(length);
for (var i = 0; i < length; i++) {
result[i] = cb(i);
}
return result;
}
ts.fill = fill;
function cartesianProduct(arrays) {
var result = [];
cartesianProductWorker(arrays, result, /*outer*/ undefined, 0);
return result;
}
ts.cartesianProduct = cartesianProduct;
function cartesianProductWorker(arrays, result, outer, index) {
for (var _i = 0, _a = arrays[index]; _i < _a.length; _i++) {
var element = _a[_i];
var inner = void 0;
if (outer) {
inner = outer.slice();
inner.push(element);
}
else {
inner = [element];
}
if (index === arrays.length - 1) {
result.push(inner);
}
else {
cartesianProductWorker(arrays, result, inner, index + 1);
}
}
}
/**
* Returns string left-padded with spaces or zeros until it reaches the given length.
*
* @param s String to pad.
* @param length Final padded length. If less than or equal to 's.length', returns 's' unchanged.
* @param padString Character to use as padding (default " ").
*/
function padLeft(s, length, padString) {
if (padString === void 0) { padString = " "; }
return length <= s.length ? s : padString.repeat(length - s.length) + s;
}
ts.padLeft = padLeft;
/**
* Returns string right-padded with spaces until it reaches the given length.
*
* @param s String to pad.
* @param length Final padded length. If less than or equal to 's.length', returns 's' unchanged.
* @param padString Character to use as padding (default " ").
*/
function padRight(s, length, padString) {
if (padString === void 0) { padString = " "; }
return length <= s.length ? s : s + padString.repeat(length - s.length);
}
ts.padRight = padRight;
function takeWhile(array, predicate) {
var len = array.length;
var index = 0;
while (index < len && predicate(array[index])) {
index++;
}
return array.slice(0, index);
}
ts.takeWhile = takeWhile;
/**
* Removes the leading and trailing white space and line terminator characters from a string.
*/
ts.trimString = !!String.prototype.trim ? (function (s) { return s.trim(); }) : function (s) { return ts.trimStringEnd(ts.trimStringStart(s)); };
/**
* Returns a copy with trailing whitespace removed.
*/
ts.trimStringEnd = !!String.prototype.trimEnd ? (function (s) { return s.trimEnd(); }) : trimEndImpl;
/**
* Returns a copy with leading whitespace removed.
*/
ts.trimStringStart = !!String.prototype.trimStart ? (function (s) { return s.trimStart(); }) : function (s) { return s.replace(/^\s+/g, ""); };
/**
* https://jsbench.me/gjkoxld4au/1
* The simple regex for this, /\s+$/g is O(n^2) in v8.
* The native .trimEnd method is by far best, but since that's technically ES2019,
* we provide a (still much faster than the simple regex) fallback.
*/
function trimEndImpl(s) {
var end = s.length - 1;
while (end >= 0) {
if (!ts.isWhiteSpaceLike(s.charCodeAt(end)))
break;
end--;
}
return s.slice(0, end + 1);
}
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
var LogLevel;
(function (LogLevel) {
LogLevel[LogLevel["Off"] = 0] = "Off";
LogLevel[LogLevel["Error"] = 1] = "Error";
LogLevel[LogLevel["Warning"] = 2] = "Warning";
LogLevel[LogLevel["Info"] = 3] = "Info";
LogLevel[LogLevel["Verbose"] = 4] = "Verbose";
})(LogLevel = ts.LogLevel || (ts.LogLevel = {}));
var Debug;
(function (Debug) {
var typeScriptVersion;
/* eslint-disable prefer-const */
var currentAssertionLevel = 0 /* None */;
Debug.currentLogLevel = LogLevel.Warning;
Debug.isDebugging = false;
function getTypeScriptVersion() {
return typeScriptVersion !== null && typeScriptVersion !== void 0 ? typeScriptVersion : (typeScriptVersion = new ts.Version(ts.version));
}
Debug.getTypeScriptVersion = getTypeScriptVersion;
function shouldLog(level) {
return Debug.currentLogLevel <= level;
}
Debug.shouldLog = shouldLog;
function logMessage(level, s) {
if (Debug.loggingHost && shouldLog(level)) {
Debug.loggingHost.log(level, s);
}
}
function log(s) {
logMessage(LogLevel.Info, s);
}
Debug.log = log;
(function (log_1) {
function error(s) {
logMessage(LogLevel.Error, s);
}
log_1.error = error;
function warn(s) {
logMessage(LogLevel.Warning, s);
}
log_1.warn = warn;
function log(s) {
logMessage(LogLevel.Info, s);
}
log_1.log = log;
function trace(s) {
logMessage(LogLevel.Verbose, s);
}
log_1.trace = trace;
})(log = Debug.log || (Debug.log = {}));
var assertionCache = {};
function getAssertionLevel() {
return currentAssertionLevel;
}
Debug.getAssertionLevel = getAssertionLevel;
function setAssertionLevel(level) {
var prevAssertionLevel = currentAssertionLevel;
currentAssertionLevel = level;
if (level > prevAssertionLevel) {
// restore assertion functions for the current assertion level (see `shouldAssertFunction`).
for (var _i = 0, _a = ts.getOwnKeys(assertionCache); _i < _a.length; _i++) {
var key = _a[_i];
var cachedFunc = assertionCache[key];
if (cachedFunc !== undefined && Debug[key] !== cachedFunc.assertion && level >= cachedFunc.level) {
Debug[key] = cachedFunc;
assertionCache[key] = undefined;
}
}
}
}
Debug.setAssertionLevel = setAssertionLevel;
function shouldAssert(level) {
return currentAssertionLevel >= level;
}
Debug.shouldAssert = shouldAssert;
/**
* Tests whether an assertion function should be executed. If it shouldn't, it is cached and replaced with `ts.noop`.
* Replaced assertion functions are restored when `Debug.setAssertionLevel` is set to a high enough level.
* @param level The minimum assertion level required.
* @param name The name of the current assertion function.
*/
function shouldAssertFunction(level, name) {
if (!shouldAssert(level)) {
assertionCache[name] = { level: level, assertion: Debug[name] };
Debug[name] = ts.noop;
return false;
}
return true;
}
function fail(message, stackCrawlMark) {
debugger;
var e = new Error(message ? "Debug Failure. " + message : "Debug Failure.");
if (Error.captureStackTrace) {
Error.captureStackTrace(e, stackCrawlMark || fail);
}
throw e;
}
Debug.fail = fail;
function failBadSyntaxKind(node, message, stackCrawlMark) {
return fail((message || "Unexpected node.") + "\r\nNode " + formatSyntaxKind(node.kind) + " was unexpected.", stackCrawlMark || failBadSyntaxKind);
}
Debug.failBadSyntaxKind = failBadSyntaxKind;
function assert(expression, message, verboseDebugInfo, stackCrawlMark) {
if (!expression) {
message = message ? "False expression: " + message : "False expression.";
if (verboseDebugInfo) {
message += "\r\nVerbose Debug Information: " + (typeof verboseDebugInfo === "string" ? verboseDebugInfo : verboseDebugInfo());
}
fail(message, stackCrawlMark || assert);
}
}
Debug.assert = assert;
function assertEqual(a, b, msg, msg2, stackCrawlMark) {
if (a !== b) {
var message = msg ? msg2 ? msg + " " + msg2 : msg : "";
fail("Expected " + a + " === " + b + ". " + message, stackCrawlMark || assertEqual);
}
}
Debug.assertEqual = assertEqual;
function assertLessThan(a, b, msg, stackCrawlMark) {
if (a >= b) {
fail("Expected " + a + " < " + b + ". " + (msg || ""), stackCrawlMark || assertLessThan);
}
}
Debug.assertLessThan = assertLessThan;
function assertLessThanOrEqual(a, b, stackCrawlMark) {
if (a > b) {
fail("Expected " + a + " <= " + b, stackCrawlMark || assertLessThanOrEqual);
}
}
Debug.assertLessThanOrEqual = assertLessThanOrEqual;
function assertGreaterThanOrEqual(a, b, stackCrawlMark) {
if (a < b) {
fail("Expected " + a + " >= " + b, stackCrawlMark || assertGreaterThanOrEqual);
}
}
Debug.assertGreaterThanOrEqual = assertGreaterThanOrEqual;
function assertIsDefined(value, message, stackCrawlMark) {
// eslint-disable-next-line no-null/no-null
if (value === undefined || value === null) {
fail(message, stackCrawlMark || assertIsDefined);
}
}
Debug.assertIsDefined = assertIsDefined;
function checkDefined(value, message, stackCrawlMark) {
assertIsDefined(value, message, stackCrawlMark || checkDefined);
return value;
}
Debug.checkDefined = checkDefined;
/**
* @deprecated Use `checkDefined` to check whether a value is defined inline. Use `assertIsDefined` to check whether
* a value is defined at the statement level.
*/
Debug.assertDefined = checkDefined;
function assertEachIsDefined(value, message, stackCrawlMark) {
for (var _i = 0, value_1 = value; _i < value_1.length; _i++) {
var v = value_1[_i];
assertIsDefined(v, message, stackCrawlMark || assertEachIsDefined);
}
}
Debug.assertEachIsDefined = assertEachIsDefined;
function checkEachDefined(value, message, stackCrawlMark) {
assertEachIsDefined(value, message, stackCrawlMark || checkEachDefined);
return value;
}
Debug.checkEachDefined = checkEachDefined;
/**
* @deprecated Use `checkEachDefined` to check whether the elements of an array are defined inline. Use `assertEachIsDefined` to check whether
* the elements of an array are defined at the statement level.
*/
Debug.assertEachDefined = checkEachDefined;
function assertNever(member, message, stackCrawlMark) {
if (message === void 0) { message = "Illegal value:"; }
var detail = typeof member === "object" && ts.hasProperty(member, "kind") && ts.hasProperty(member, "pos") && formatSyntaxKind ? "SyntaxKind: " + formatSyntaxKind(member.kind) : JSON.stringify(member);
return fail(message + " " + detail, stackCrawlMark || assertNever);
}
Debug.assertNever = assertNever;
function assertEachNode(nodes, test, message, stackCrawlMark) {
if (shouldAssertFunction(1 /* Normal */, "assertEachNode")) {
assert(test === undefined || ts.every(nodes, test), message || "Unexpected node.", function () { return "Node array did not pass test '" + getFunctionName(test) + "'."; }, stackCrawlMark || assertEachNode);
}
}
Debug.assertEachNode = assertEachNode;
function assertNode(node, test, message, stackCrawlMark) {
if (shouldAssertFunction(1 /* Normal */, "assertNode")) {
assert(node !== undefined && (test === undefined || test(node)), message || "Unexpected node.", function () { return "Node " + formatSyntaxKind(node === null || node === void 0 ? void 0 : node.kind) + " did not pass test '" + getFunctionName(test) + "'."; }, stackCrawlMark || assertNode);
}
}
Debug.assertNode = assertNode;
function assertNotNode(node, test, message, stackCrawlMark) {
if (shouldAssertFunction(1 /* Normal */, "assertNotNode")) {
assert(node === undefined || test === undefined || !test(node), message || "Unexpected node.", function () { return "Node " + formatSyntaxKind(node.kind) + " should not have passed test '" + getFunctionName(test) + "'."; }, stackCrawlMark || assertNotNode);
}
}
Debug.assertNotNode = assertNotNode;
function assertOptionalNode(node, test, message, stackCrawlMark) {
if (shouldAssertFunction(1 /* Normal */, "assertOptionalNode")) {
assert(test === undefined || node === undefined || test(node), message || "Unexpected node.", function () { return "Node " + formatSyntaxKind(node === null || node === void 0 ? void 0 : node.kind) + " did not pass test '" + getFunctionName(test) + "'."; }, stackCrawlMark || assertOptionalNode);
}
}
Debug.assertOptionalNode = assertOptionalNode;
function assertOptionalToken(node, kind, message, stackCrawlMark) {
if (shouldAssertFunction(1 /* Normal */, "assertOptionalToken")) {
assert(kind === undefined || node === undefined || node.kind === kind, message || "Unexpected node.", function () { return "Node " + formatSyntaxKind(node === null || node === void 0 ? void 0 : node.kind) + " was not a '" + formatSyntaxKind(kind) + "' token."; }, stackCrawlMark || assertOptionalToken);
}
}
Debug.assertOptionalToken = assertOptionalToken;
function assertMissingNode(node, message, stackCrawlMark) {
if (shouldAssertFunction(1 /* Normal */, "assertMissingNode")) {
assert(node === undefined, message || "Unexpected node.", function () { return "Node " + formatSyntaxKind(node.kind) + " was unexpected'."; }, stackCrawlMark || assertMissingNode);
}
}
Debug.assertMissingNode = assertMissingNode;
function type(_value) { }
Debug.type = type;
function getFunctionName(func) {
if (typeof func !== "function") {
return "";
}
else if (func.hasOwnProperty("name")) {
return func.name;
}
else {
var text = Function.prototype.toString.call(func);
var match = /^function\s+([\w\$]+)\s*\(/.exec(text);
return match ? match[1] : "";
}
}
Debug.getFunctionName = getFunctionName;
function formatSymbol(symbol) {
return "{ name: " + ts.unescapeLeadingUnderscores(symbol.escapedName) + "; flags: " + formatSymbolFlags(symbol.flags) + "; declarations: " + ts.map(symbol.declarations, function (node) { return formatSyntaxKind(node.kind); }) + " }";
}
Debug.formatSymbol = formatSymbol;
/**
* Formats an enum value as a string for debugging and debug assertions.
*/
function formatEnum(value, enumObject, isFlags) {
if (value === void 0) { value = 0; }
var members = getEnumMembers(enumObject);
if (value === 0) {
return members.length > 0 && members[0][0] === 0 ? members[0][1] : "0";
}
if (isFlags) {
var result = "";
var remainingFlags = value;
for (var _i = 0, members_1 = members; _i < members_1.length; _i++) {
var _a = members_1[_i], enumValue = _a[0], enumName = _a[1];
if (enumValue > value) {
break;
}
if (enumValue !== 0 && enumValue & value) {
result = "" + result + (result ? "|" : "") + enumName;
remainingFlags &= ~enumValue;
}
}
if (remainingFlags === 0) {
return result;
}
}
else {
for (var _b = 0, members_2 = members; _b < members_2.length; _b++) {
var _c = members_2[_b], enumValue = _c[0], enumName = _c[1];
if (enumValue === value) {
return enumName;
}
}
}
return value.toString();
}
Debug.formatEnum = formatEnum;
function getEnumMembers(enumObject) {
var result = [];
for (var name in enumObject) {
var value = enumObject[name];
if (typeof value === "number") {
result.push([value, name]);
}
}
return ts.stableSort(result, function (x, y) { return ts.compareValues(x[0], y[0]); });
}
function formatSyntaxKind(kind) {
return formatEnum(kind, ts.SyntaxKind, /*isFlags*/ false);
}
Debug.formatSyntaxKind = formatSyntaxKind;
function formatNodeFlags(flags) {
return formatEnum(flags, ts.NodeFlags, /*isFlags*/ true);
}
Debug.formatNodeFlags = formatNodeFlags;
function formatModifierFlags(flags) {
return formatEnum(flags, ts.ModifierFlags, /*isFlags*/ true);
}
Debug.formatModifierFlags = formatModifierFlags;
function formatTransformFlags(flags) {
return formatEnum(flags, ts.TransformFlags, /*isFlags*/ true);
}
Debug.formatTransformFlags = formatTransformFlags;
function formatEmitFlags(flags) {
return formatEnum(flags, ts.EmitFlags, /*isFlags*/ true);
}
Debug.formatEmitFlags = formatEmitFlags;
function formatSymbolFlags(flags) {
return formatEnum(flags, ts.SymbolFlags, /*isFlags*/ true);
}
Debug.formatSymbolFlags = formatSymbolFlags;
function formatTypeFlags(flags) {
return formatEnum(flags, ts.TypeFlags, /*isFlags*/ true);
}
Debug.formatTypeFlags = formatTypeFlags;
function formatSignatureFlags(flags) {
return formatEnum(flags, ts.SignatureFlags, /*isFlags*/ true);
}
Debug.formatSignatureFlags = formatSignatureFlags;
function formatObjectFlags(flags) {
return formatEnum(flags, ts.ObjectFlags, /*isFlags*/ true);
}
Debug.formatObjectFlags = formatObjectFlags;
function formatFlowFlags(flags) {
return formatEnum(flags, ts.FlowFlags, /*isFlags*/ true);
}
Debug.formatFlowFlags = formatFlowFlags;
var isDebugInfoEnabled = false;
var extendedDebugModule;
function extendedDebug() {
enableDebugInfo();
if (!extendedDebugModule) {
throw new Error("Debugging helpers could not be loaded.");
}
return extendedDebugModule;
}
function printControlFlowGraph(flowNode) {
return console.log(formatControlFlowGraph(flowNode));
}
Debug.printControlFlowGraph = printControlFlowGraph;
function formatControlFlowGraph(flowNode) {
return extendedDebug().formatControlFlowGraph(flowNode);
}
Debug.formatControlFlowGraph = formatControlFlowGraph;
var flowNodeProto;
function attachFlowNodeDebugInfoWorker(flowNode) {
if (!("__debugFlowFlags" in flowNode)) { // eslint-disable-line no-in-operator
Object.defineProperties(flowNode, {
// for use with vscode-js-debug's new customDescriptionGenerator in launch.json
__tsDebuggerDisplay: {
value: function () {
var flowHeader = this.flags & 2 /* Start */ ? "FlowStart" :
this.flags & 4 /* BranchLabel */ ? "FlowBranchLabel" :
this.flags & 8 /* LoopLabel */ ? "FlowLoopLabel" :
this.flags & 16 /* Assignment */ ? "FlowAssignment" :
this.flags & 32 /* TrueCondition */ ? "FlowTrueCondition" :
this.flags & 64 /* FalseCondition */ ? "FlowFalseCondition" :
this.flags & 128 /* SwitchClause */ ? "FlowSwitchClause" :
this.flags & 256 /* ArrayMutation */ ? "FlowArrayMutation" :
this.flags & 512 /* Call */ ? "FlowCall" :
this.flags & 1024 /* ReduceLabel */ ? "FlowReduceLabel" :
this.flags & 1 /* Unreachable */ ? "FlowUnreachable" :
"UnknownFlow";
var remainingFlags = this.flags & ~(2048 /* Referenced */ - 1);
return "" + flowHeader + (remainingFlags ? " (" + formatFlowFlags(remainingFlags) + ")" : "");
}
},
__debugFlowFlags: { get: function () { return formatEnum(this.flags, ts.FlowFlags, /*isFlags*/ true); } },
__debugToString: { value: function () { return formatControlFlowGraph(this); } }
});
}
}
function attachFlowNodeDebugInfo(flowNode) {
if (isDebugInfoEnabled) {
if (typeof Object.setPrototypeOf === "function") {
// if we're in es2015, attach the method to a shared prototype for `FlowNode`
// so the method doesn't show up in the watch window.
if (!flowNodeProto) {
flowNodeProto = Object.create(Object.prototype);
attachFlowNodeDebugInfoWorker(flowNodeProto);
}
Object.setPrototypeOf(flowNode, flowNodeProto);
}
else {
// not running in an es2015 environment, attach the method directly.
attachFlowNodeDebugInfoWorker(flowNode);
}
}
}
Debug.attachFlowNodeDebugInfo = attachFlowNodeDebugInfo;
var nodeArrayProto;
function attachNodeArrayDebugInfoWorker(array) {
if (!("__tsDebuggerDisplay" in array)) { // eslint-disable-line no-in-operator
Object.defineProperties(array, {
__tsDebuggerDisplay: {
value: function (defaultValue) {
// An `Array` with extra properties is rendered as `[A, B, prop1: 1, prop2: 2]`. Most of
// these aren't immediately useful so we trim off the `prop1: ..., prop2: ...` part from the
// formatted string.
// This regex can trigger slow backtracking because of overlapping potential captures.
// We don't care, this is debug code that's only enabled with a debugger attached -
// we're just taking note of it for anyone checking regex performance in the future.
defaultValue = String(defaultValue).replace(/(?:,[\s\w\d_]+:[^,]+)+\]$/, "]");
return "NodeArray " + defaultValue;
}
}
});
}
}
function attachNodeArrayDebugInfo(array) {
if (isDebugInfoEnabled) {
if (typeof Object.setPrototypeOf === "function") {
// if we're in es2015, attach the method to a shared prototype for `NodeArray`
// so the method doesn't show up in the watch window.
if (!nodeArrayProto) {
nodeArrayProto = Object.create(Array.prototype);
attachNodeArrayDebugInfoWorker(nodeArrayProto);
}
Object.setPrototypeOf(array, nodeArrayProto);
}
else {
// not running in an es2015 environment, attach the method directly.
attachNodeArrayDebugInfoWorker(array);
}
}
}
Debug.attachNodeArrayDebugInfo = attachNodeArrayDebugInfo;
/**
* Injects debug information into frequently used types.
*/
function enableDebugInfo() {
if (isDebugInfoEnabled)
return;
// avoid recomputing
var weakTypeTextMap;
var weakNodeTextMap;
function getWeakTypeTextMap() {
if (weakTypeTextMap === undefined) {
if (typeof WeakMap === "function")
weakTypeTextMap = new WeakMap();
}
return weakTypeTextMap;
}
function getWeakNodeTextMap() {
if (weakNodeTextMap === undefined) {
if (typeof WeakMap === "function")
weakNodeTextMap = new WeakMap();
}
return weakNodeTextMap;
}
// Add additional properties in debug mode to assist with debugging.
Object.defineProperties(ts.objectAllocator.getSymbolConstructor().prototype, {
// for use with vscode-js-debug's new customDescriptionGenerator in launch.json
__tsDebuggerDisplay: {
value: function () {
var symbolHeader = this.flags & 33554432 /* Transient */ ? "TransientSymbol" :
"Symbol";
var remainingSymbolFlags = this.flags & ~33554432 /* Transient */;
return symbolHeader + " '" + ts.symbolName(this) + "'" + (remainingSymbolFlags ? " (" + formatSymbolFlags(remainingSymbolFlags) + ")" : "");
}
},
__debugFlags: { get: function () { return formatSymbolFlags(this.flags); } }
});
Object.defineProperties(ts.objectAllocator.getTypeConstructor().prototype, {
// for use with vscode-js-debug's new customDescriptionGenerator in launch.json
__tsDebuggerDisplay: {
value: function () {
var typeHeader = this.flags & 98304 /* Nullable */ ? "NullableType" :
this.flags & 384 /* StringOrNumberLiteral */ ? "LiteralType " + JSON.stringify(this.value) :
this.flags & 2048 /* BigIntLiteral */ ? "LiteralType " + (this.value.negative ? "-" : "") + this.value.base10Value + "n" :
this.flags & 8192 /* UniqueESSymbol */ ? "UniqueESSymbolType" :
this.flags & 32 /* Enum */ ? "EnumType" :
this.flags & 67359327 /* Intrinsic */ ? "IntrinsicType " + this.intrinsicName :
this.flags & 1048576 /* Union */ ? "UnionType" :
this.flags & 2097152 /* Intersection */ ? "IntersectionType" :
this.flags & 4194304 /* Index */ ? "IndexType" :
this.flags & 8388608 /* IndexedAccess */ ? "IndexedAccessType" :
this.flags & 16777216 /* Conditional */ ? "ConditionalType" :
this.flags & 33554432 /* Substitution */ ? "SubstitutionType" :
this.flags & 262144 /* TypeParameter */ ? "TypeParameter" :
this.flags & 524288 /* Object */ ?
this.objectFlags & 3 /* ClassOrInterface */ ? "InterfaceType" :
this.objectFlags & 4 /* Reference */ ? "TypeReference" :
this.objectFlags & 8 /* Tuple */ ? "TupleType" :
this.objectFlags & 16 /* Anonymous */ ? "AnonymousType" :
this.objectFlags & 32 /* Mapped */ ? "MappedType" :
this.objectFlags & 1024 /* ReverseMapped */ ? "ReverseMappedType" :
this.objectFlags & 256 /* EvolvingArray */ ? "EvolvingArrayType" :
"ObjectType" :
"Type";
var remainingObjectFlags = this.flags & 524288 /* Object */ ? this.objectFlags & ~1343 /* ObjectTypeKindMask */ : 0;
return "" + typeHeader + (this.symbol ? " '" + ts.symbolName(this.symbol) + "'" : "") + (remainingObjectFlags ? " (" + formatObjectFlags(remainingObjectFlags) + ")" : "");
}
},
__debugFlags: { get: function () { return formatTypeFlags(this.flags); } },
__debugObjectFlags: { get: function () { return this.flags & 524288 /* Object */ ? formatObjectFlags(this.objectFlags) : ""; } },
__debugTypeToString: {
value: function () {
// avoid recomputing
var map = getWeakTypeTextMap();
var text = map === null || map === void 0 ? void 0 : map.get(this);
if (text === undefined) {
text = this.checker.typeToString(this);
map === null || map === void 0 ? void 0 : map.set(this, text);
}
return text;
}
},
});
Object.defineProperties(ts.objectAllocator.getSignatureConstructor().prototype, {
__debugFlags: { get: function () { return formatSignatureFlags(this.flags); } },
__debugSignatureToString: { value: function () { var _a; return (_a = this.checker) === null || _a === void 0 ? void 0 : _a.signatureToString(this); } }
});
var nodeConstructors = [
ts.objectAllocator.getNodeConstructor(),
ts.objectAllocator.getIdentifierConstructor(),
ts.objectAllocator.getTokenConstructor(),
ts.objectAllocator.getSourceFileConstructor()
];
for (var _i = 0, nodeConstructors_1 = nodeConstructors; _i < nodeConstructors_1.length; _i++) {
var ctor = nodeConstructors_1[_i];
if (!ctor.prototype.hasOwnProperty("__debugKind")) {
Object.defineProperties(ctor.prototype, {
// for use with vscode-js-debug's new customDescriptionGenerator in launch.json
__tsDebuggerDisplay: {
value: function () {
var nodeHeader = ts.isGeneratedIdentifier(this) ? "GeneratedIdentifier" :
ts.isIdentifier(this) ? "Identifier '" + ts.idText(this) + "'" :
ts.isPrivateIdentifier(this) ? "PrivateIdentifier '" + ts.idText(this) + "'" :
ts.isStringLiteral(this) ? "StringLiteral " + JSON.stringify(this.text.length < 10 ? this.text : this.text.slice(10) + "...") :
ts.isNumericLiteral(this) ? "NumericLiteral " + this.text :
ts.isBigIntLiteral(this) ? "BigIntLiteral " + this.text + "n" :
ts.isTypeParameterDeclaration(this) ? "TypeParameterDeclaration" :
ts.isParameter(this) ? "ParameterDeclaration" :
ts.isConstructorDeclaration(this) ? "ConstructorDeclaration" :
ts.isGetAccessorDeclaration(this) ? "GetAccessorDeclaration" :
ts.isSetAccessorDeclaration(this) ? "SetAccessorDeclaration" :
ts.isCallSignatureDeclaration(this) ? "CallSignatureDeclaration" :
ts.isConstructSignatureDeclaration(this) ? "ConstructSignatureDeclaration" :
ts.isIndexSignatureDeclaration(this) ? "IndexSignatureDeclaration" :
ts.isTypePredicateNode(this) ? "TypePredicateNode" :
ts.isTypeReferenceNode(this) ? "TypeReferenceNode" :
ts.isFunctionTypeNode(this) ? "FunctionTypeNode" :
ts.isConstructorTypeNode(this) ? "ConstructorTypeNode" :
ts.isTypeQueryNode(this) ? "TypeQueryNode" :
ts.isTypeLiteralNode(this) ? "TypeLiteralNode" :
ts.isArrayTypeNode(this) ? "ArrayTypeNode" :
ts.isTupleTypeNode(this) ? "TupleTypeNode" :
ts.isOptionalTypeNode(this) ? "OptionalTypeNode" :
ts.isRestTypeNode(this) ? "RestTypeNode" :
ts.isUnionTypeNode(this) ? "UnionTypeNode" :
ts.isIntersectionTypeNode(this) ? "IntersectionTypeNode" :
ts.isConditionalTypeNode(this) ? "ConditionalTypeNode" :
ts.isInferTypeNode(this) ? "InferTypeNode" :
ts.isParenthesizedTypeNode(this) ? "ParenthesizedTypeNode" :
ts.isThisTypeNode(this) ? "ThisTypeNode" :
ts.isTypeOperatorNode(this) ? "TypeOperatorNode" :
ts.isIndexedAccessTypeNode(this) ? "IndexedAccessTypeNode" :
ts.isMappedTypeNode(this) ? "MappedTypeNode" :
ts.isLiteralTypeNode(this) ? "LiteralTypeNode" :
ts.isNamedTupleMember(this) ? "NamedTupleMember" :
ts.isImportTypeNode(this) ? "ImportTypeNode" :
formatSyntaxKind(this.kind);
return "" + nodeHeader + (this.flags ? " (" + formatNodeFlags(this.flags) + ")" : "");
}
},
__debugKind: { get: function () { return formatSyntaxKind(this.kind); } },
__debugNodeFlags: { get: function () { return formatNodeFlags(this.flags); } },
__debugModifierFlags: { get: function () { return formatModifierFlags(ts.getEffectiveModifierFlagsNoCache(this)); } },
__debugTransformFlags: { get: function () { return formatTransformFlags(this.transformFlags); } },
__debugIsParseTreeNode: { get: function () { return ts.isParseTreeNode(this); } },
__debugEmitFlags: { get: function () { return formatEmitFlags(ts.getEmitFlags(this)); } },
__debugGetText: {
value: function (includeTrivia) {
if (ts.nodeIsSynthesized(this))
return "";
// avoid recomputing
var map = getWeakNodeTextMap();
var text = map === null || map === void 0 ? void 0 : map.get(this);
if (text === undefined) {
var parseNode = ts.getParseTreeNode(this);
var sourceFile = parseNode && ts.getSourceFileOfNode(parseNode);
text = sourceFile ? ts.getSourceTextOfNodeFromSourceFile(sourceFile, parseNode, includeTrivia) : "";
map === null || map === void 0 ? void 0 : map.set(this, text);
}
return text;
}
}
});
}
}
// attempt to load extended debugging information
try {
if (ts.sys && ts.sys.require) {
var basePath = ts.getDirectoryPath(ts.resolvePath(ts.sys.getExecutingFilePath()));
var result = ts.sys.require(basePath, "./compiler-debug");
if (!result.error) {
result.module.init(ts);
extendedDebugModule = result.module;
}
}
}
catch (_a) {
// do nothing
}
isDebugInfoEnabled = true;
}
Debug.enableDebugInfo = enableDebugInfo;
function formatDeprecationMessage(name, error, errorAfter, since, message) {
var deprecationMessage = error ? "DeprecationError: " : "DeprecationWarning: ";
deprecationMessage += "'" + name + "' ";
deprecationMessage += since ? "has been deprecated since v" + since : "is deprecated";
deprecationMessage += error ? " and can no longer be used." : errorAfter ? " and will no longer be usable after v" + errorAfter + "." : ".";
deprecationMessage += message ? " " + ts.formatStringFromArgs(message, [name], 0) : "";
return deprecationMessage;
}
function createErrorDeprecation(name, errorAfter, since, message) {
var deprecationMessage = formatDeprecationMessage(name, /*error*/ true, errorAfter, since, message);
return function () {
throw new TypeError(deprecationMessage);
};
}
function createWarningDeprecation(name, errorAfter, since, message) {
var hasWrittenDeprecation = false;
return function () {
if (!hasWrittenDeprecation) {
log.warn(formatDeprecationMessage(name, /*error*/ false, errorAfter, since, message));
hasWrittenDeprecation = true;
}
};
}
function createDeprecation(name, options) {
var _a, _b;
if (options === void 0) { options = {}; }
var version = typeof options.typeScriptVersion === "string" ? new ts.Version(options.typeScriptVersion) : (_a = options.typeScriptVersion) !== null && _a !== void 0 ? _a : getTypeScriptVersion();
var errorAfter = typeof options.errorAfter === "string" ? new ts.Version(options.errorAfter) : options.errorAfter;
var warnAfter = typeof options.warnAfter === "string" ? new ts.Version(options.warnAfter) : options.warnAfter;
var since = typeof options.since === "string" ? new ts.Version(options.since) : (_b = options.since) !== null && _b !== void 0 ? _b : warnAfter;
var error = options.error || errorAfter && version.compareTo(errorAfter) <= 0;
var warn = !warnAfter || version.compareTo(warnAfter) >= 0;
return error ? createErrorDeprecation(name, errorAfter, since, options.message) :
warn ? createWarningDeprecation(name, errorAfter, since, options.message) :
ts.noop;
}
function wrapFunction(deprecation, func) {
return function () {
deprecation();
return func.apply(this, arguments);
};
}
function deprecate(func, options) {
var deprecation = createDeprecation(getFunctionName(func), options);
return wrapFunction(deprecation, func);
}
Debug.deprecate = deprecate;
})(Debug = ts.Debug || (ts.Debug = {}));
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
// https://semver.org/#spec-item-2
// > A normal version number MUST take the form X.Y.Z where X, Y, and Z are non-negative
// > integers, and MUST NOT contain leading zeroes. X is the major version, Y is the minor
// > version, and Z is the patch version. Each element MUST increase numerically.
//
// NOTE: We differ here in that we allow X and X.Y, with missing parts having the default
// value of `0`.
var versionRegExp = /^(0|[1-9]\d*)(?:\.(0|[1-9]\d*)(?:\.(0|[1-9]\d*)(?:\-([a-z0-9-.]+))?(?:\+([a-z0-9-.]+))?)?)?$/i;
// https://semver.org/#spec-item-9
// > A pre-release version MAY be denoted by appending a hyphen and a series of dot separated
// > identifiers immediately following the patch version. Identifiers MUST comprise only ASCII
// > alphanumerics and hyphen [0-9A-Za-z-]. Identifiers MUST NOT be empty. Numeric identifiers
// > MUST NOT include leading zeroes.
var prereleaseRegExp = /^(?:0|[1-9]\d*|[a-z-][a-z0-9-]*)(?:\.(?:0|[1-9]\d*|[a-z-][a-z0-9-]*))*$/i;
// https://semver.org/#spec-item-10
// > Build metadata MAY be denoted by appending a plus sign and a series of dot separated
// > identifiers immediately following the patch or pre-release version. Identifiers MUST
// > comprise only ASCII alphanumerics and hyphen [0-9A-Za-z-]. Identifiers MUST NOT be empty.
var buildRegExp = /^[a-z0-9-]+(?:\.[a-z0-9-]+)*$/i;
// https://semver.org/#spec-item-9
// > Numeric identifiers MUST NOT include leading zeroes.
var numericIdentifierRegExp = /^(0|[1-9]\d*)$/;
/**
* Describes a precise semantic version number, https://semver.org
*/
var Version = /** @class */ (function () {
function Version(major, minor, patch, prerelease, build) {
if (minor === void 0) { minor = 0; }
if (patch === void 0) { patch = 0; }
if (prerelease === void 0) { prerelease = ""; }
if (build === void 0) { build = ""; }
if (typeof major === "string") {
var result = ts.Debug.checkDefined(tryParseComponents(major), "Invalid version");
(major = result.major, minor = result.minor, patch = result.patch, prerelease = result.prerelease, build = result.build);
}
ts.Debug.assert(major >= 0, "Invalid argument: major");
ts.Debug.assert(minor >= 0, "Invalid argument: minor");
ts.Debug.assert(patch >= 0, "Invalid argument: patch");
ts.Debug.assert(!prerelease || prereleaseRegExp.test(prerelease), "Invalid argument: prerelease");
ts.Debug.assert(!build || buildRegExp.test(build), "Invalid argument: build");
this.major = major;
this.minor = minor;
this.patch = patch;
this.prerelease = prerelease ? prerelease.split(".") : ts.emptyArray;
this.build = build ? build.split(".") : ts.emptyArray;
}
Version.tryParse = function (text) {
var result = tryParseComponents(text);
if (!result)
return undefined;
var major = result.major, minor = result.minor, patch = result.patch, prerelease = result.prerelease, build = result.build;
return new Version(major, minor, patch, prerelease, build);
};
Version.prototype.compareTo = function (other) {
// https://semver.org/#spec-item-11
// > Precedence is determined by the first difference when comparing each of these
// > identifiers from left to right as follows: Major, minor, and patch versions are
// > always compared numerically.
//
// https://semver.org/#spec-item-11
// > Precedence for two pre-release versions with the same major, minor, and patch version
// > MUST be determined by comparing each dot separated identifier from left to right until
// > a difference is found [...]
//
// https://semver.org/#spec-item-11
// > Build metadata does not figure into precedence
if (this === other)
return 0 /* EqualTo */;
if (other === undefined)
return 1 /* GreaterThan */;
return ts.compareValues(this.major, other.major)
|| ts.compareValues(this.minor, other.minor)
|| ts.compareValues(this.patch, other.patch)
|| comparePrereleaseIdentifiers(this.prerelease, other.prerelease);
};
Version.prototype.increment = function (field) {
switch (field) {
case "major": return new Version(this.major + 1, 0, 0);
case "minor": return new Version(this.major, this.minor + 1, 0);
case "patch": return new Version(this.major, this.minor, this.patch + 1);
default: return ts.Debug.assertNever(field);
}
};
Version.prototype.toString = function () {
var result = this.major + "." + this.minor + "." + this.patch;
if (ts.some(this.prerelease))
result += "-" + this.prerelease.join(".");
if (ts.some(this.build))
result += "+" + this.build.join(".");
return result;
};
Version.zero = new Version(0, 0, 0);
return Version;
}());
ts.Version = Version;
function tryParseComponents(text) {
var match = versionRegExp.exec(text);
if (!match)
return undefined;
var major = match[1], _a = match[2], minor = _a === void 0 ? "0" : _a, _b = match[3], patch = _b === void 0 ? "0" : _b, _c = match[4], prerelease = _c === void 0 ? "" : _c, _d = match[5], build = _d === void 0 ? "" : _d;
if (prerelease && !prereleaseRegExp.test(prerelease))
return undefined;
if (build && !buildRegExp.test(build))
return undefined;
return {
major: parseInt(major, 10),
minor: parseInt(minor, 10),
patch: parseInt(patch, 10),
prerelease: prerelease,
build: build
};
}
function comparePrereleaseIdentifiers(left, right) {
// https://semver.org/#spec-item-11
// > When major, minor, and patch are equal, a pre-release version has lower precedence
// > than a normal version.
if (left === right)
return 0 /* EqualTo */;
if (left.length === 0)
return right.length === 0 ? 0 /* EqualTo */ : 1 /* GreaterThan */;
if (right.length === 0)
return -1 /* LessThan */;
// https://semver.org/#spec-item-11
// > Precedence for two pre-release versions with the same major, minor, and patch version
// > MUST be determined by comparing each dot separated identifier from left to right until
// > a difference is found [...]
var length = Math.min(left.length, right.length);
for (var i = 0; i < length; i++) {
var leftIdentifier = left[i];
var rightIdentifier = right[i];
if (leftIdentifier === rightIdentifier)
continue;
var leftIsNumeric = numericIdentifierRegExp.test(leftIdentifier);
var rightIsNumeric = numericIdentifierRegExp.test(rightIdentifier);
if (leftIsNumeric || rightIsNumeric) {
// https://semver.org/#spec-item-11
// > Numeric identifiers always have lower precedence than non-numeric identifiers.
if (leftIsNumeric !== rightIsNumeric)
return leftIsNumeric ? -1 /* LessThan */ : 1 /* GreaterThan */;
// https://semver.org/#spec-item-11
// > identifiers consisting of only digits are compared numerically
var result = ts.compareValues(+leftIdentifier, +rightIdentifier);
if (result)
return result;
}
else {
// https://semver.org/#spec-item-11
// > identifiers with letters or hyphens are compared lexically in ASCII sort order.
var result = ts.compareStringsCaseSensitive(leftIdentifier, rightIdentifier);
if (result)
return result;
}
}
// https://semver.org/#spec-item-11
// > A larger set of pre-release fields has a higher precedence than a smaller set, if all
// > of the preceding identifiers are equal.
return ts.compareValues(left.length, right.length);
}
/**
* Describes a semantic version range, per https://github.com/npm/node-semver#ranges
*/
var VersionRange = /** @class */ (function () {
function VersionRange(spec) {
this._alternatives = spec ? ts.Debug.checkDefined(parseRange(spec), "Invalid range spec.") : ts.emptyArray;
}
VersionRange.tryParse = function (text) {
var sets = parseRange(text);
if (sets) {
var range = new VersionRange("");
range._alternatives = sets;
return range;
}
return undefined;
};
VersionRange.prototype.test = function (version) {
if (typeof version === "string")
version = new Version(version);
return testDisjunction(version, this._alternatives);
};
VersionRange.prototype.toString = function () {
return formatDisjunction(this._alternatives);
};
return VersionRange;
}());
ts.VersionRange = VersionRange;
// https://github.com/npm/node-semver#range-grammar
//
// range-set ::= range ( logical-or range ) *
// range ::= hyphen | simple ( ' ' simple ) * | ''
// logical-or ::= ( ' ' ) * '||' ( ' ' ) *
var logicalOrRegExp = /\|\|/g;
var whitespaceRegExp = /\s+/g;
// https://github.com/npm/node-semver#range-grammar
//
// partial ::= xr ( '.' xr ( '.' xr qualifier ? )? )?
// xr ::= 'x' | 'X' | '*' | nr
// nr ::= '0' | ['1'-'9'] ( ['0'-'9'] ) *
// qualifier ::= ( '-' pre )? ( '+' build )?
// pre ::= parts
// build ::= parts
// parts ::= part ( '.' part ) *
// part ::= nr | [-0-9A-Za-z]+
var partialRegExp = /^([xX*0]|[1-9]\d*)(?:\.([xX*0]|[1-9]\d*)(?:\.([xX*0]|[1-9]\d*)(?:-([a-z0-9-.]+))?(?:\+([a-z0-9-.]+))?)?)?$/i;
// https://github.com/npm/node-semver#range-grammar
//
// hyphen ::= partial ' - ' partial
var hyphenRegExp = /^\s*([a-z0-9-+.*]+)\s+-\s+([a-z0-9-+.*]+)\s*$/i;
// https://github.com/npm/node-semver#range-grammar
//
// simple ::= primitive | partial | tilde | caret
// primitive ::= ( '<' | '>' | '>=' | '<=' | '=' ) partial
// tilde ::= '~' partial
// caret ::= '^' partial
var rangeRegExp = /^(~|\^|<|<=|>|>=|=)?\s*([a-z0-9-+.*]+)$/i;
function parseRange(text) {
var alternatives = [];
for (var _i = 0, _a = ts.trimString(text).split(logicalOrRegExp); _i < _a.length; _i++) {
var range = _a[_i];
if (!range)
continue;
var comparators = [];
range = ts.trimString(range);
var match = hyphenRegExp.exec(range);
if (match) {
if (!parseHyphen(match[1], match[2], comparators))
return undefined;
}
else {
for (var _b = 0, _c = range.split(whitespaceRegExp); _b < _c.length; _b++) {
var simple = _c[_b];
var match_1 = rangeRegExp.exec(ts.trimString(simple));
if (!match_1 || !parseComparator(match_1[1], match_1[2], comparators))
return undefined;
}
}
alternatives.push(comparators);
}
return alternatives;
}
function parsePartial(text) {
var match = partialRegExp.exec(text);
if (!match)
return undefined;
var major = match[1], _a = match[2], minor = _a === void 0 ? "*" : _a, _b = match[3], patch = _b === void 0 ? "*" : _b, prerelease = match[4], build = match[5];
var version = new Version(isWildcard(major) ? 0 : parseInt(major, 10), isWildcard(major) || isWildcard(minor) ? 0 : parseInt(minor, 10), isWildcard(major) || isWildcard(minor) || isWildcard(patch) ? 0 : parseInt(patch, 10), prerelease, build);
return { version: version, major: major, minor: minor, patch: patch };
}
function parseHyphen(left, right, comparators) {
var leftResult = parsePartial(left);
if (!leftResult)
return false;
var rightResult = parsePartial(right);
if (!rightResult)
return false;
if (!isWildcard(leftResult.major)) {
comparators.push(createComparator(">=", leftResult.version));
}
if (!isWildcard(rightResult.major)) {
comparators.push(isWildcard(rightResult.minor) ? createComparator("<", rightResult.version.increment("major")) :
isWildcard(rightResult.patch) ? createComparator("<", rightResult.version.increment("minor")) :
createComparator("<=", rightResult.version));
}
return true;
}
function parseComparator(operator, text, comparators) {
var result = parsePartial(text);
if (!result)
return false;
var version = result.version, major = result.major, minor = result.minor, patch = result.patch;
if (!isWildcard(major)) {
switch (operator) {
case "~":
comparators.push(createComparator(">=", version));
comparators.push(createComparator("<", version.increment(isWildcard(minor) ? "major" :
"minor")));
break;
case "^":
comparators.push(createComparator(">=", version));
comparators.push(createComparator("<", version.increment(version.major > 0 || isWildcard(minor) ? "major" :
version.minor > 0 || isWildcard(patch) ? "minor" :
"patch")));
break;
case "<":
case ">=":
comparators.push(createComparator(operator, version));
break;
case "<=":
case ">":
comparators.push(isWildcard(minor) ? createComparator(operator === "<=" ? "<" : ">=", version.increment("major")) :
isWildcard(patch) ? createComparator(operator === "<=" ? "<" : ">=", version.increment("minor")) :
createComparator(operator, version));
break;
case "=":
case undefined:
if (isWildcard(minor) || isWildcard(patch)) {
comparators.push(createComparator(">=", version));
comparators.push(createComparator("<", version.increment(isWildcard(minor) ? "major" : "minor")));
}
else {
comparators.push(createComparator("=", version));
}
break;
default:
// unrecognized
return false;
}
}
else if (operator === "<" || operator === ">") {
comparators.push(createComparator("<", Version.zero));
}
return true;
}
function isWildcard(part) {
return part === "*" || part === "x" || part === "X";
}
function createComparator(operator, operand) {
return { operator: operator, operand: operand };
}
function testDisjunction(version, alternatives) {
// an empty disjunction is treated as "*" (all versions)
if (alternatives.length === 0)
return true;
for (var _i = 0, alternatives_1 = alternatives; _i < alternatives_1.length; _i++) {
var alternative = alternatives_1[_i];
if (testAlternative(version, alternative))
return true;
}
return false;
}
function testAlternative(version, comparators) {
for (var _i = 0, comparators_1 = comparators; _i < comparators_1.length; _i++) {
var comparator = comparators_1[_i];
if (!testComparator(version, comparator.operator, comparator.operand))
return false;
}
return true;
}
function testComparator(version, operator, operand) {
var cmp = version.compareTo(operand);
switch (operator) {
case "<": return cmp < 0;
case "<=": return cmp <= 0;
case ">": return cmp > 0;
case ">=": return cmp >= 0;
case "=": return cmp === 0;
default: return ts.Debug.assertNever(operator);
}
}
function formatDisjunction(alternatives) {
return ts.map(alternatives, formatAlternative).join(" || ") || "*";
}
function formatAlternative(comparators) {
return ts.map(comparators, formatComparator).join(" ");
}
function formatComparator(comparator) {
return "" + comparator.operator + comparator.operand;
}
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
// The following definitions provide the minimum compatible support for the Web Performance User Timings API
// between browsers and NodeJS:
// eslint-disable-next-line @typescript-eslint/naming-convention
function hasRequiredAPI(performance, PerformanceObserver) {
return typeof performance === "object" &&
typeof performance.timeOrigin === "number" &&
typeof performance.mark === "function" &&
typeof performance.measure === "function" &&
typeof performance.now === "function" &&
typeof PerformanceObserver === "function";
}
function tryGetWebPerformanceHooks() {
if (typeof performance === "object" &&
typeof PerformanceObserver === "function" &&
hasRequiredAPI(performance, PerformanceObserver)) {
return {
// For now we always write native performance events when running in the browser. We may
// make this conditional in the future if we find that native web performance hooks
// in the browser also slow down compilation.
shouldWriteNativeEvents: true,
performance: performance,
PerformanceObserver: PerformanceObserver
};
}
}
function tryGetNodePerformanceHooks() {
if (typeof process !== "undefined" && process.nextTick && !process.browser && typeof module === "object" && typeof require === "function") {
try {
var performance_1;
var _a = require("perf_hooks"), nodePerformance_1 = _a.performance, PerformanceObserver_1 = _a.PerformanceObserver;
if (hasRequiredAPI(nodePerformance_1, PerformanceObserver_1)) {
performance_1 = nodePerformance_1;
// There is a bug in Node's performance.measure prior to 12.16.3/13.13.0 that does not
// match the Web Performance API specification. Node's implementation did not allow
// optional `start` and `end` arguments for `performance.measure`.
// See https://github.com/nodejs/node/pull/32651 for more information.
var version_1 = new ts.Version(process.versions.node);
var range = new ts.VersionRange("<12.16.3 || 13 <13.13");
if (range.test(version_1)) {
performance_1 = {
get timeOrigin() { return nodePerformance_1.timeOrigin; },
now: function () { return nodePerformance_1.now(); },
mark: function (name) { return nodePerformance_1.mark(name); },
measure: function (name, start, end) {
if (start === void 0) { start = "nodeStart"; }
if (end === undefined) {
end = "__performance.measure-fix__";
nodePerformance_1.mark(end);
}
nodePerformance_1.measure(name, start, end);
if (end === "__performance.measure-fix__") {
nodePerformance_1.clearMarks("__performance.measure-fix__");
}
}
};
}
return {
// By default, only write native events when generating a cpu profile or using the v8 profiler.
shouldWriteNativeEvents: false,
performance: performance_1,
PerformanceObserver: PerformanceObserver_1
};
}
}
catch (_b) {
// ignore errors
}
}
}
// Unlike with the native Map/Set 'tryGet' functions in corePublic.ts, we eagerly evaluate these
// since we will need them for `timestamp`, below.
var nativePerformanceHooks = tryGetWebPerformanceHooks() || tryGetNodePerformanceHooks();
var nativePerformance = nativePerformanceHooks === null || nativePerformanceHooks === void 0 ? void 0 : nativePerformanceHooks.performance;
function tryGetNativePerformanceHooks() {
return nativePerformanceHooks;
}
ts.tryGetNativePerformanceHooks = tryGetNativePerformanceHooks;
/** Gets a timestamp with (at least) ms resolution */
ts.timestamp = nativePerformance ? function () { return nativePerformance.now(); } :
Date.now ? Date.now :
function () { return +(new Date()); };
})(ts || (ts = {}));
/*@internal*/
/** Performance measurements for the compiler. */
var ts;
(function (ts) {
var performance;
(function (performance) {
var perfHooks;
// when set, indicates the implementation of `Performance` to use for user timing.
// when unset, indicates user timing is unavailable or disabled.
var performanceImpl;
function createTimerIf(condition, measureName, startMarkName, endMarkName) {
return condition ? createTimer(measureName, startMarkName, endMarkName) : performance.nullTimer;
}
performance.createTimerIf = createTimerIf;
function createTimer(measureName, startMarkName, endMarkName) {
var enterCount = 0;
return {
enter: enter,
exit: exit
};
function enter() {
if (++enterCount === 1) {
mark(startMarkName);
}
}
function exit() {
if (--enterCount === 0) {
mark(endMarkName);
measure(measureName, startMarkName, endMarkName);
}
else if (enterCount < 0) {
ts.Debug.fail("enter/exit count does not match.");
}
}
}
performance.createTimer = createTimer;
performance.nullTimer = { enter: ts.noop, exit: ts.noop };
var enabled = false;
var timeorigin = ts.timestamp();
var marks = new ts.Map();
var counts = new ts.Map();
var durations = new ts.Map();
/**
* Marks a performance event.
*
* @param markName The name of the mark.
*/
function mark(markName) {
var _a;
if (enabled) {
var count = (_a = counts.get(markName)) !== null && _a !== void 0 ? _a : 0;
counts.set(markName, count + 1);
marks.set(markName, ts.timestamp());
performanceImpl === null || performanceImpl === void 0 ? void 0 : performanceImpl.mark(markName);
}
}
performance.mark = mark;
/**
* Adds a performance measurement with the specified name.
*
* @param measureName The name of the performance measurement.
* @param startMarkName The name of the starting mark. If not supplied, the point at which the
* profiler was enabled is used.
* @param endMarkName The name of the ending mark. If not supplied, the current timestamp is
* used.
*/
function measure(measureName, startMarkName, endMarkName) {
var _a, _b;
if (enabled) {
var end = (_a = (endMarkName !== undefined ? marks.get(endMarkName) : undefined)) !== null && _a !== void 0 ? _a : ts.timestamp();
var start = (_b = (startMarkName !== undefined ? marks.get(startMarkName) : undefined)) !== null && _b !== void 0 ? _b : timeorigin;
var previousDuration = durations.get(measureName) || 0;
durations.set(measureName, previousDuration + (end - start));
performanceImpl === null || performanceImpl === void 0 ? void 0 : performanceImpl.measure(measureName, startMarkName, endMarkName);
}
}
performance.measure = measure;
/**
* Gets the number of times a marker was encountered.
*
* @param markName The name of the mark.
*/
function getCount(markName) {
return counts.get(markName) || 0;
}
performance.getCount = getCount;
/**
* Gets the total duration of all measurements with the supplied name.
*
* @param measureName The name of the measure whose durations should be accumulated.
*/
function getDuration(measureName) {
return durations.get(measureName) || 0;
}
performance.getDuration = getDuration;
/**
* Iterate over each measure, performing some action
*
* @param cb The action to perform for each measure
*/
function forEachMeasure(cb) {
durations.forEach(function (duration, measureName) { return cb(measureName, duration); });
}
performance.forEachMeasure = forEachMeasure;
/**
* Indicates whether the performance API is enabled.
*/
function isEnabled() {
return enabled;
}
performance.isEnabled = isEnabled;
/** Enables (and resets) performance measurements for the compiler. */
function enable(system) {
var _a;
if (system === void 0) { system = ts.sys; }
if (!enabled) {
enabled = true;
perfHooks || (perfHooks = ts.tryGetNativePerformanceHooks());
if (perfHooks) {
timeorigin = perfHooks.performance.timeOrigin;
// NodeJS's Web Performance API is currently slower than expected, but we'd still like
// to be able to leverage native trace events when node is run with either `--cpu-prof`
// or `--prof`, if we're running with our own `--generateCpuProfile` flag, or when
// running in debug mode (since its possible to generate a cpu profile while debugging).
if (perfHooks.shouldWriteNativeEvents || ((_a = system === null || system === void 0 ? void 0 : system.cpuProfilingEnabled) === null || _a === void 0 ? void 0 : _a.call(system)) || (system === null || system === void 0 ? void 0 : system.debugMode)) {
performanceImpl = perfHooks.performance;
}
}
}
return true;
}
performance.enable = enable;
/** Disables performance measurements for the compiler. */
function disable() {
if (enabled) {
marks.clear();
counts.clear();
durations.clear();
performanceImpl = undefined;
enabled = false;
}
}
performance.disable = disable;
})(performance = ts.performance || (ts.performance = {}));
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
var _a;
var nullLogger = {
logEvent: ts.noop,
logErrEvent: ts.noop,
logPerfEvent: ts.noop,
logInfoEvent: ts.noop,
logStartCommand: ts.noop,
logStopCommand: ts.noop,
logStartUpdateProgram: ts.noop,
logStopUpdateProgram: ts.noop,
logStartUpdateGraph: ts.noop,
logStopUpdateGraph: ts.noop,
logStartResolveModule: ts.noop,
logStopResolveModule: ts.noop,
logStartParseSourceFile: ts.noop,
logStopParseSourceFile: ts.noop,
logStartReadFile: ts.noop,
logStopReadFile: ts.noop,
logStartBindFile: ts.noop,
logStopBindFile: ts.noop,
logStartScheduledOperation: ts.noop,
logStopScheduledOperation: ts.noop,
};
// Load optional module to enable Event Tracing for Windows
// See https://github.com/microsoft/typescript-etw for more information
var etwModule;
try {
var etwModulePath = (_a = process.env.TS_ETW_MODULE_PATH) !== null && _a !== void 0 ? _a : "./node_modules/@microsoft/typescript-etw";
// require() will throw an exception if the module is not found
// It may also return undefined if not installed properly
etwModule = require(etwModulePath);
}
catch (e) {
etwModule = undefined;
}
/** Performance logger that will generate ETW events if possible - check for `logEvent` member, as `etwModule` will be `{}` when browserified */
ts.perfLogger = etwModule && etwModule.logEvent ? etwModule : nullLogger;
})(ts || (ts = {}));
/* Tracing events for the compiler. */
/*@internal*/
var ts;
(function (ts) {
// enable the above using startTracing()
// `tracingEnabled` should never be used directly, only through the above
var tracingEnabled;
(function (tracingEnabled) {
var fs;
var traceCount = 0;
var traceFd = 0;
var mode;
var typeCatalog = []; // NB: id is index + 1
var legendPath;
var legend = [];
;
/** Starts tracing for the given project. */
function startTracing(tracingMode, traceDir, configFilePath) {
ts.Debug.assert(!ts.tracing, "Tracing already started");
if (fs === undefined) {
try {
fs = require("fs");
}
catch (e) {
throw new Error("tracing requires having fs\n(original error: " + (e.message || e) + ")");
}
}
mode = tracingMode;
typeCatalog.length = 0;
if (legendPath === undefined) {
legendPath = ts.combinePaths(traceDir, "legend.json");
}
// Note that writing will fail later on if it exists and is not a directory
if (!fs.existsSync(traceDir)) {
fs.mkdirSync(traceDir, { recursive: true });
}
var countPart = mode === "build" ? "." + process.pid + "-" + ++traceCount
: mode === "server" ? "." + process.pid
: "";
var tracePath = ts.combinePaths(traceDir, "trace" + countPart + ".json");
var typesPath = ts.combinePaths(traceDir, "types" + countPart + ".json");
legend.push({
configFilePath: configFilePath,
tracePath: tracePath,
typesPath: typesPath,
});
traceFd = fs.openSync(tracePath, "w");
ts.tracing = tracingEnabled; // only when traceFd is properly set
// Start with a prefix that contains some metadata that the devtools profiler expects (also avoids a warning on import)
var meta = { cat: "__metadata", ph: "M", ts: 1000 * ts.timestamp(), pid: 1, tid: 1 };
fs.writeSync(traceFd, "[\n"
+ [__assign({ name: "process_name", args: { name: "tsc" } }, meta), __assign({ name: "thread_name", args: { name: "Main" } }, meta), __assign(__assign({ name: "TracingStartedInBrowser" }, meta), { cat: "disabled-by-default-devtools.timeline" })]
.map(function (v) { return JSON.stringify(v); }).join(",\n"));
}
tracingEnabled.startTracing = startTracing;
/** Stops tracing for the in-progress project and dumps the type catalog. */
function stopTracing() {
ts.Debug.assert(ts.tracing, "Tracing is not in progress");
ts.Debug.assert(!!typeCatalog.length === (mode !== "server")); // Have a type catalog iff not in server mode
fs.writeSync(traceFd, "\n]\n");
fs.closeSync(traceFd);
ts.tracing = undefined;
if (typeCatalog.length) {
dumpTypes(typeCatalog);
}
else {
// We pre-computed this path for convenience, but clear it
// now that the file won't be created.
legend[legend.length - 1].typesPath = undefined;
}
}
tracingEnabled.stopTracing = stopTracing;
function recordType(type) {
if (mode !== "server") {
typeCatalog.push(type);
}
}
tracingEnabled.recordType = recordType;
var Phase;
(function (Phase) {
Phase["Parse"] = "parse";
Phase["Program"] = "program";
Phase["Bind"] = "bind";
Phase["Check"] = "check";
Phase["CheckTypes"] = "checkTypes";
Phase["Emit"] = "emit";
Phase["Session"] = "session";
})(Phase = tracingEnabled.Phase || (tracingEnabled.Phase = {}));
function instant(phase, name, args) {
writeEvent("I", phase, name, args, "\"s\":\"g\"");
}
tracingEnabled.instant = instant;
var eventStack = [];
/**
* @param separateBeginAndEnd - used for special cases where we need the trace point even if the event
* never terminates (typically for reducing a scenario too big to trace to one that can be completed).
* In the future we might implement an exit handler to dump unfinished events which would deprecate
* these operations.
*/
function push(phase, name, args, separateBeginAndEnd) {
if (separateBeginAndEnd === void 0) { separateBeginAndEnd = false; }
if (separateBeginAndEnd) {
writeEvent("B", phase, name, args);
}
eventStack.push({ phase: phase, name: name, args: args, time: 1000 * ts.timestamp(), separateBeginAndEnd: separateBeginAndEnd });
}
tracingEnabled.push = push;
function pop() {
ts.Debug.assert(eventStack.length > 0);
writeStackEvent(eventStack.length - 1, 1000 * ts.timestamp());
eventStack.length--;
}
tracingEnabled.pop = pop;
function popAll() {
var endTime = 1000 * ts.timestamp();
for (var i = eventStack.length - 1; i >= 0; i--) {
writeStackEvent(i, endTime);
}
eventStack.length = 0;
}
tracingEnabled.popAll = popAll;
// sample every 10ms
var sampleInterval = 1000 * 10;
function writeStackEvent(index, endTime) {
var _a = eventStack[index], phase = _a.phase, name = _a.name, args = _a.args, time = _a.time, separateBeginAndEnd = _a.separateBeginAndEnd;
if (separateBeginAndEnd) {
writeEvent("E", phase, name, args, /*extras*/ undefined, endTime);
}
// test if [time,endTime) straddles a sampling point
else if (sampleInterval - (time % sampleInterval) <= endTime - time) {
writeEvent("X", phase, name, args, "\"dur\":" + (endTime - time), time);
}
}
function writeEvent(eventType, phase, name, args, extras, time) {
if (time === void 0) { time = 1000 * ts.timestamp(); }
// In server mode, there's no easy way to dump type information, so we drop events that would require it.
if (mode === "server" && phase === "checkTypes" /* CheckTypes */)
return;
ts.performance.mark("beginTracing");
fs.writeSync(traceFd, ",\n{\"pid\":1,\"tid\":1,\"ph\":\"" + eventType + "\",\"cat\":\"" + phase + "\",\"ts\":" + time + ",\"name\":\"" + name + "\"");
if (extras)
fs.writeSync(traceFd, "," + extras);
if (args)
fs.writeSync(traceFd, ",\"args\":" + JSON.stringify(args));
fs.writeSync(traceFd, "}");
ts.performance.mark("endTracing");
ts.performance.measure("Tracing", "beginTracing", "endTracing");
}
function getLocation(node) {
var file = ts.getSourceFileOfNode(node);
return !file
? undefined
: {
path: file.path,
start: indexFromOne(ts.getLineAndCharacterOfPosition(file, node.pos)),
end: indexFromOne(ts.getLineAndCharacterOfPosition(file, node.end)),
};
function indexFromOne(lc) {
return {
line: lc.line + 1,
character: lc.character + 1,
};
}
}
function dumpTypes(types) {
var _a, _b, _c, _d, _e, _f, _g, _h, _j, _k, _l, _m, _o, _p, _q, _r, _s, _t, _u, _v, _w, _x;
ts.performance.mark("beginDumpTypes");
var typesPath = legend[legend.length - 1].typesPath;
var typesFd = fs.openSync(typesPath, "w");
var recursionIdentityMap = new ts.Map();
// Cleverness: no line break here so that the type ID will match the line number
fs.writeSync(typesFd, "[");
var numTypes = types.length;
for (var i = 0; i < numTypes; i++) {
var type = types[i];
var objectFlags = type.objectFlags;
var symbol = (_a = type.aliasSymbol) !== null && _a !== void 0 ? _a : type.symbol;
// It's slow to compute the display text, so skip it unless it's really valuable (or cheap)
var display = void 0;
if ((objectFlags & 16 /* Anonymous */) | (type.flags & 2944 /* Literal */)) {
try {
display = (_b = type.checker) === null || _b === void 0 ? void 0 : _b.typeToString(type);
}
catch (_y) {
display = undefined;
}
}
var indexedAccessProperties = {};
if (type.flags & 8388608 /* IndexedAccess */) {
var indexedAccessType = type;
indexedAccessProperties = {
indexedAccessObjectType: (_c = indexedAccessType.objectType) === null || _c === void 0 ? void 0 : _c.id,
indexedAccessIndexType: (_d = indexedAccessType.indexType) === null || _d === void 0 ? void 0 : _d.id,
};
}
var referenceProperties = {};
if (objectFlags & 4 /* Reference */) {
var referenceType = type;
referenceProperties = {
instantiatedType: (_e = referenceType.target) === null || _e === void 0 ? void 0 : _e.id,
typeArguments: (_f = referenceType.resolvedTypeArguments) === null || _f === void 0 ? void 0 : _f.map(function (t) { return t.id; }),
referenceLocation: getLocation(referenceType.node),
};
}
var conditionalProperties = {};
if (type.flags & 16777216 /* Conditional */) {
var conditionalType = type;
conditionalProperties = {
conditionalCheckType: (_g = conditionalType.checkType) === null || _g === void 0 ? void 0 : _g.id,
conditionalExtendsType: (_h = conditionalType.extendsType) === null || _h === void 0 ? void 0 : _h.id,
conditionalTrueType: (_k = (_j = conditionalType.resolvedTrueType) === null || _j === void 0 ? void 0 : _j.id) !== null && _k !== void 0 ? _k : -1,
conditionalFalseType: (_m = (_l = conditionalType.resolvedFalseType) === null || _l === void 0 ? void 0 : _l.id) !== null && _m !== void 0 ? _m : -1,
};
}
var substitutionProperties = {};
if (type.flags & 33554432 /* Substitution */) {
var substitutionType = type;
substitutionProperties = {
substitutionBaseType: (_o = substitutionType.baseType) === null || _o === void 0 ? void 0 : _o.id,
substituteType: (_p = substitutionType.substitute) === null || _p === void 0 ? void 0 : _p.id,
};
}
var reverseMappedProperties = {};
if (objectFlags & 1024 /* ReverseMapped */) {
var reverseMappedType = type;
reverseMappedProperties = {
reverseMappedSourceType: (_q = reverseMappedType.source) === null || _q === void 0 ? void 0 : _q.id,
reverseMappedMappedType: (_r = reverseMappedType.mappedType) === null || _r === void 0 ? void 0 : _r.id,
reverseMappedConstraintType: (_s = reverseMappedType.constraintType) === null || _s === void 0 ? void 0 : _s.id,
};
}
var evolvingArrayProperties = {};
if (objectFlags & 256 /* EvolvingArray */) {
var evolvingArrayType = type;
evolvingArrayProperties = {
evolvingArrayElementType: evolvingArrayType.elementType.id,
evolvingArrayFinalType: (_t = evolvingArrayType.finalArrayType) === null || _t === void 0 ? void 0 : _t.id,
};
}
// We can't print out an arbitrary object, so just assign each one a unique number.
// Don't call it an "id" so people don't treat it as a type id.
var recursionToken = void 0;
var recursionIdentity = type.checker.getRecursionIdentity(type);
if (recursionIdentity) {
recursionToken = recursionIdentityMap.get(recursionIdentity);
if (!recursionToken) {
recursionToken = recursionIdentityMap.size;
recursionIdentityMap.set(recursionIdentity, recursionToken);
}
}
var descriptor = __assign(__assign(__assign(__assign(__assign(__assign(__assign({ id: type.id, intrinsicName: type.intrinsicName, symbolName: (symbol === null || symbol === void 0 ? void 0 : symbol.escapedName) && ts.unescapeLeadingUnderscores(symbol.escapedName), recursionId: recursionToken, isTuple: objectFlags & 8 /* Tuple */ ? true : undefined, unionTypes: (type.flags & 1048576 /* Union */) ? (_u = type.types) === null || _u === void 0 ? void 0 : _u.map(function (t) { return t.id; }) : undefined, intersectionTypes: (type.flags & 2097152 /* Intersection */) ? type.types.map(function (t) { return t.id; }) : undefined, aliasTypeArguments: (_v = type.aliasTypeArguments) === null || _v === void 0 ? void 0 : _v.map(function (t) { return t.id; }), keyofType: (type.flags & 4194304 /* Index */) ? (_w = type.type) === null || _w === void 0 ? void 0 : _w.id : undefined }, indexedAccessProperties), referenceProperties), conditionalProperties), substitutionProperties), reverseMappedProperties), evolvingArrayProperties), { destructuringPattern: getLocation(type.pattern), firstDeclaration: getLocation((_x = symbol === null || symbol === void 0 ? void 0 : symbol.declarations) === null || _x === void 0 ? void 0 : _x[0]), flags: ts.Debug.formatTypeFlags(type.flags).split("|"), display: display });
fs.writeSync(typesFd, JSON.stringify(descriptor));
if (i < numTypes - 1) {
fs.writeSync(typesFd, ",\n");
}
}
fs.writeSync(typesFd, "]\n");
fs.closeSync(typesFd);
ts.performance.mark("endDumpTypes");
ts.performance.measure("Dump types", "beginDumpTypes", "endDumpTypes");
}
function dumpLegend() {
if (!legendPath) {
return;
}
fs.writeFileSync(legendPath, JSON.stringify(legend));
}
tracingEnabled.dumpLegend = dumpLegend;
})(tracingEnabled || (tracingEnabled = {}));
// define after tracingEnabled is initialized
ts.startTracing = tracingEnabled.startTracing;
ts.dumpTracingLegend = tracingEnabled.dumpLegend;
})(ts || (ts = {}));
var ts;
(function (ts) {
// token > SyntaxKind.Identifier => token is a keyword
// Also, If you add a new SyntaxKind be sure to keep the `Markers` section at the bottom in sync
var SyntaxKind;
(function (SyntaxKind) {
SyntaxKind[SyntaxKind["Unknown"] = 0] = "Unknown";
SyntaxKind[SyntaxKind["EndOfFileToken"] = 1] = "EndOfFileToken";
SyntaxKind[SyntaxKind["SingleLineCommentTrivia"] = 2] = "SingleLineCommentTrivia";
SyntaxKind[SyntaxKind["MultiLineCommentTrivia"] = 3] = "MultiLineCommentTrivia";
SyntaxKind[SyntaxKind["NewLineTrivia"] = 4] = "NewLineTrivia";
SyntaxKind[SyntaxKind["WhitespaceTrivia"] = 5] = "WhitespaceTrivia";
// We detect and preserve #! on the first line
SyntaxKind[SyntaxKind["ShebangTrivia"] = 6] = "ShebangTrivia";
// We detect and provide better error recovery when we encounter a git merge marker. This
// allows us to edit files with git-conflict markers in them in a much more pleasant manner.
SyntaxKind[SyntaxKind["ConflictMarkerTrivia"] = 7] = "ConflictMarkerTrivia";
// Literals
SyntaxKind[SyntaxKind["NumericLiteral"] = 8] = "NumericLiteral";
SyntaxKind[SyntaxKind["BigIntLiteral"] = 9] = "BigIntLiteral";
SyntaxKind[SyntaxKind["StringLiteral"] = 10] = "StringLiteral";
SyntaxKind[SyntaxKind["JsxText"] = 11] = "JsxText";
SyntaxKind[SyntaxKind["JsxTextAllWhiteSpaces"] = 12] = "JsxTextAllWhiteSpaces";
SyntaxKind[SyntaxKind["RegularExpressionLiteral"] = 13] = "RegularExpressionLiteral";
SyntaxKind[SyntaxKind["NoSubstitutionTemplateLiteral"] = 14] = "NoSubstitutionTemplateLiteral";
// Pseudo-literals
SyntaxKind[SyntaxKind["TemplateHead"] = 15] = "TemplateHead";
SyntaxKind[SyntaxKind["TemplateMiddle"] = 16] = "TemplateMiddle";
SyntaxKind[SyntaxKind["TemplateTail"] = 17] = "TemplateTail";
// Punctuation
SyntaxKind[SyntaxKind["OpenBraceToken"] = 18] = "OpenBraceToken";
SyntaxKind[SyntaxKind["CloseBraceToken"] = 19] = "CloseBraceToken";
SyntaxKind[SyntaxKind["OpenParenToken"] = 20] = "OpenParenToken";
SyntaxKind[SyntaxKind["CloseParenToken"] = 21] = "CloseParenToken";
SyntaxKind[SyntaxKind["OpenBracketToken"] = 22] = "OpenBracketToken";
SyntaxKind[SyntaxKind["CloseBracketToken"] = 23] = "CloseBracketToken";
SyntaxKind[SyntaxKind["DotToken"] = 24] = "DotToken";
SyntaxKind[SyntaxKind["DotDotDotToken"] = 25] = "DotDotDotToken";
SyntaxKind[SyntaxKind["SemicolonToken"] = 26] = "SemicolonToken";
SyntaxKind[SyntaxKind["CommaToken"] = 27] = "CommaToken";
SyntaxKind[SyntaxKind["QuestionDotToken"] = 28] = "QuestionDotToken";
SyntaxKind[SyntaxKind["LessThanToken"] = 29] = "LessThanToken";
SyntaxKind[SyntaxKind["LessThanSlashToken"] = 30] = "LessThanSlashToken";
SyntaxKind[SyntaxKind["GreaterThanToken"] = 31] = "GreaterThanToken";
SyntaxKind[SyntaxKind["LessThanEqualsToken"] = 32] = "LessThanEqualsToken";
SyntaxKind[SyntaxKind["GreaterThanEqualsToken"] = 33] = "GreaterThanEqualsToken";
SyntaxKind[SyntaxKind["EqualsEqualsToken"] = 34] = "EqualsEqualsToken";
SyntaxKind[SyntaxKind["ExclamationEqualsToken"] = 35] = "ExclamationEqualsToken";
SyntaxKind[SyntaxKind["EqualsEqualsEqualsToken"] = 36] = "EqualsEqualsEqualsToken";
SyntaxKind[SyntaxKind["ExclamationEqualsEqualsToken"] = 37] = "ExclamationEqualsEqualsToken";
SyntaxKind[SyntaxKind["EqualsGreaterThanToken"] = 38] = "EqualsGreaterThanToken";
SyntaxKind[SyntaxKind["PlusToken"] = 39] = "PlusToken";
SyntaxKind[SyntaxKind["MinusToken"] = 40] = "MinusToken";
SyntaxKind[SyntaxKind["AsteriskToken"] = 41] = "AsteriskToken";
SyntaxKind[SyntaxKind["AsteriskAsteriskToken"] = 42] = "AsteriskAsteriskToken";
SyntaxKind[SyntaxKind["SlashToken"] = 43] = "SlashToken";
SyntaxKind[SyntaxKind["PercentToken"] = 44] = "PercentToken";
SyntaxKind[SyntaxKind["PlusPlusToken"] = 45] = "PlusPlusToken";
SyntaxKind[SyntaxKind["MinusMinusToken"] = 46] = "MinusMinusToken";
SyntaxKind[SyntaxKind["LessThanLessThanToken"] = 47] = "LessThanLessThanToken";
SyntaxKind[SyntaxKind["GreaterThanGreaterThanToken"] = 48] = "GreaterThanGreaterThanToken";
SyntaxKind[SyntaxKind["GreaterThanGreaterThanGreaterThanToken"] = 49] = "GreaterThanGreaterThanGreaterThanToken";
SyntaxKind[SyntaxKind["AmpersandToken"] = 50] = "AmpersandToken";
SyntaxKind[SyntaxKind["BarToken"] = 51] = "BarToken";
SyntaxKind[SyntaxKind["CaretToken"] = 52] = "CaretToken";
SyntaxKind[SyntaxKind["ExclamationToken"] = 53] = "ExclamationToken";
SyntaxKind[SyntaxKind["TildeToken"] = 54] = "TildeToken";
SyntaxKind[SyntaxKind["AmpersandAmpersandToken"] = 55] = "AmpersandAmpersandToken";
SyntaxKind[SyntaxKind["BarBarToken"] = 56] = "BarBarToken";
SyntaxKind[SyntaxKind["QuestionToken"] = 57] = "QuestionToken";
SyntaxKind[SyntaxKind["ColonToken"] = 58] = "ColonToken";
SyntaxKind[SyntaxKind["AtToken"] = 59] = "AtToken";
SyntaxKind[SyntaxKind["QuestionQuestionToken"] = 60] = "QuestionQuestionToken";
/** Only the JSDoc scanner produces BacktickToken. The normal scanner produces NoSubstitutionTemplateLiteral and related kinds. */
SyntaxKind[SyntaxKind["BacktickToken"] = 61] = "BacktickToken";
/** Only the JSDoc scanner produces HashToken. The normal scanner produces PrivateIdentifier. */
SyntaxKind[SyntaxKind["HashToken"] = 62] = "HashToken";
// Assignments
SyntaxKind[SyntaxKind["EqualsToken"] = 63] = "EqualsToken";
SyntaxKind[SyntaxKind["PlusEqualsToken"] = 64] = "PlusEqualsToken";
SyntaxKind[SyntaxKind["MinusEqualsToken"] = 65] = "MinusEqualsToken";
SyntaxKind[SyntaxKind["AsteriskEqualsToken"] = 66] = "AsteriskEqualsToken";
SyntaxKind[SyntaxKind["AsteriskAsteriskEqualsToken"] = 67] = "AsteriskAsteriskEqualsToken";
SyntaxKind[SyntaxKind["SlashEqualsToken"] = 68] = "SlashEqualsToken";
SyntaxKind[SyntaxKind["PercentEqualsToken"] = 69] = "PercentEqualsToken";
SyntaxKind[SyntaxKind["LessThanLessThanEqualsToken"] = 70] = "LessThanLessThanEqualsToken";
SyntaxKind[SyntaxKind["GreaterThanGreaterThanEqualsToken"] = 71] = "GreaterThanGreaterThanEqualsToken";
SyntaxKind[SyntaxKind["GreaterThanGreaterThanGreaterThanEqualsToken"] = 72] = "GreaterThanGreaterThanGreaterThanEqualsToken";
SyntaxKind[SyntaxKind["AmpersandEqualsToken"] = 73] = "AmpersandEqualsToken";
SyntaxKind[SyntaxKind["BarEqualsToken"] = 74] = "BarEqualsToken";
SyntaxKind[SyntaxKind["BarBarEqualsToken"] = 75] = "BarBarEqualsToken";
SyntaxKind[SyntaxKind["AmpersandAmpersandEqualsToken"] = 76] = "AmpersandAmpersandEqualsToken";
SyntaxKind[SyntaxKind["QuestionQuestionEqualsToken"] = 77] = "QuestionQuestionEqualsToken";
SyntaxKind[SyntaxKind["CaretEqualsToken"] = 78] = "CaretEqualsToken";
// Identifiers and PrivateIdentifiers
SyntaxKind[SyntaxKind["Identifier"] = 79] = "Identifier";
SyntaxKind[SyntaxKind["PrivateIdentifier"] = 80] = "PrivateIdentifier";
// Reserved words
SyntaxKind[SyntaxKind["BreakKeyword"] = 81] = "BreakKeyword";
SyntaxKind[SyntaxKind["CaseKeyword"] = 82] = "CaseKeyword";
SyntaxKind[SyntaxKind["CatchKeyword"] = 83] = "CatchKeyword";
SyntaxKind[SyntaxKind["ClassKeyword"] = 84] = "ClassKeyword";
SyntaxKind[SyntaxKind["ConstKeyword"] = 85] = "ConstKeyword";
SyntaxKind[SyntaxKind["ContinueKeyword"] = 86] = "ContinueKeyword";
SyntaxKind[SyntaxKind["DebuggerKeyword"] = 87] = "DebuggerKeyword";
SyntaxKind[SyntaxKind["DefaultKeyword"] = 88] = "DefaultKeyword";
SyntaxKind[SyntaxKind["DeleteKeyword"] = 89] = "DeleteKeyword";
SyntaxKind[SyntaxKind["DoKeyword"] = 90] = "DoKeyword";
SyntaxKind[SyntaxKind["ElseKeyword"] = 91] = "ElseKeyword";
SyntaxKind[SyntaxKind["EnumKeyword"] = 92] = "EnumKeyword";
SyntaxKind[SyntaxKind["ExportKeyword"] = 93] = "ExportKeyword";
SyntaxKind[SyntaxKind["ExtendsKeyword"] = 94] = "ExtendsKeyword";
SyntaxKind[SyntaxKind["FalseKeyword"] = 95] = "FalseKeyword";
SyntaxKind[SyntaxKind["FinallyKeyword"] = 96] = "FinallyKeyword";
SyntaxKind[SyntaxKind["ForKeyword"] = 97] = "ForKeyword";
SyntaxKind[SyntaxKind["FunctionKeyword"] = 98] = "FunctionKeyword";
SyntaxKind[SyntaxKind["IfKeyword"] = 99] = "IfKeyword";
SyntaxKind[SyntaxKind["ImportKeyword"] = 100] = "ImportKeyword";
SyntaxKind[SyntaxKind["InKeyword"] = 101] = "InKeyword";
SyntaxKind[SyntaxKind["InstanceOfKeyword"] = 102] = "InstanceOfKeyword";
SyntaxKind[SyntaxKind["NewKeyword"] = 103] = "NewKeyword";
SyntaxKind[SyntaxKind["NullKeyword"] = 104] = "NullKeyword";
SyntaxKind[SyntaxKind["ReturnKeyword"] = 105] = "ReturnKeyword";
SyntaxKind[SyntaxKind["SuperKeyword"] = 106] = "SuperKeyword";
SyntaxKind[SyntaxKind["SwitchKeyword"] = 107] = "SwitchKeyword";
SyntaxKind[SyntaxKind["ThisKeyword"] = 108] = "ThisKeyword";
SyntaxKind[SyntaxKind["ThrowKeyword"] = 109] = "ThrowKeyword";
SyntaxKind[SyntaxKind["TrueKeyword"] = 110] = "TrueKeyword";
SyntaxKind[SyntaxKind["TryKeyword"] = 111] = "TryKeyword";
SyntaxKind[SyntaxKind["TypeOfKeyword"] = 112] = "TypeOfKeyword";
SyntaxKind[SyntaxKind["VarKeyword"] = 113] = "VarKeyword";
SyntaxKind[SyntaxKind["VoidKeyword"] = 114] = "VoidKeyword";
SyntaxKind[SyntaxKind["WhileKeyword"] = 115] = "WhileKeyword";
SyntaxKind[SyntaxKind["WithKeyword"] = 116] = "WithKeyword";
// Strict mode reserved words
SyntaxKind[SyntaxKind["ImplementsKeyword"] = 117] = "ImplementsKeyword";
SyntaxKind[SyntaxKind["InterfaceKeyword"] = 118] = "InterfaceKeyword";
SyntaxKind[SyntaxKind["LetKeyword"] = 119] = "LetKeyword";
SyntaxKind[SyntaxKind["PackageKeyword"] = 120] = "PackageKeyword";
SyntaxKind[SyntaxKind["PrivateKeyword"] = 121] = "PrivateKeyword";
SyntaxKind[SyntaxKind["ProtectedKeyword"] = 122] = "ProtectedKeyword";
SyntaxKind[SyntaxKind["PublicKeyword"] = 123] = "PublicKeyword";
SyntaxKind[SyntaxKind["StaticKeyword"] = 124] = "StaticKeyword";
SyntaxKind[SyntaxKind["YieldKeyword"] = 125] = "YieldKeyword";
// Contextual keywords
SyntaxKind[SyntaxKind["AbstractKeyword"] = 126] = "AbstractKeyword";
SyntaxKind[SyntaxKind["AsKeyword"] = 127] = "AsKeyword";
SyntaxKind[SyntaxKind["AssertsKeyword"] = 128] = "AssertsKeyword";
SyntaxKind[SyntaxKind["AnyKeyword"] = 129] = "AnyKeyword";
SyntaxKind[SyntaxKind["AsyncKeyword"] = 130] = "AsyncKeyword";
SyntaxKind[SyntaxKind["AwaitKeyword"] = 131] = "AwaitKeyword";
SyntaxKind[SyntaxKind["BooleanKeyword"] = 132] = "BooleanKeyword";
SyntaxKind[SyntaxKind["ConstructorKeyword"] = 133] = "ConstructorKeyword";
SyntaxKind[SyntaxKind["DeclareKeyword"] = 134] = "DeclareKeyword";
SyntaxKind[SyntaxKind["GetKeyword"] = 135] = "GetKeyword";
SyntaxKind[SyntaxKind["InferKeyword"] = 136] = "InferKeyword";
SyntaxKind[SyntaxKind["IntrinsicKeyword"] = 137] = "IntrinsicKeyword";
SyntaxKind[SyntaxKind["IsKeyword"] = 138] = "IsKeyword";
SyntaxKind[SyntaxKind["KeyOfKeyword"] = 139] = "KeyOfKeyword";
SyntaxKind[SyntaxKind["ModuleKeyword"] = 140] = "ModuleKeyword";
SyntaxKind[SyntaxKind["NamespaceKeyword"] = 141] = "NamespaceKeyword";
SyntaxKind[SyntaxKind["NeverKeyword"] = 142] = "NeverKeyword";
SyntaxKind[SyntaxKind["ReadonlyKeyword"] = 143] = "ReadonlyKeyword";
SyntaxKind[SyntaxKind["RequireKeyword"] = 144] = "RequireKeyword";
SyntaxKind[SyntaxKind["NumberKeyword"] = 145] = "NumberKeyword";
SyntaxKind[SyntaxKind["ObjectKeyword"] = 146] = "ObjectKeyword";
SyntaxKind[SyntaxKind["SetKeyword"] = 147] = "SetKeyword";
SyntaxKind[SyntaxKind["StringKeyword"] = 148] = "StringKeyword";
SyntaxKind[SyntaxKind["SymbolKeyword"] = 149] = "SymbolKeyword";
SyntaxKind[SyntaxKind["TypeKeyword"] = 150] = "TypeKeyword";
SyntaxKind[SyntaxKind["UndefinedKeyword"] = 151] = "UndefinedKeyword";
SyntaxKind[SyntaxKind["UniqueKeyword"] = 152] = "UniqueKeyword";
SyntaxKind[SyntaxKind["UnknownKeyword"] = 153] = "UnknownKeyword";
SyntaxKind[SyntaxKind["FromKeyword"] = 154] = "FromKeyword";
SyntaxKind[SyntaxKind["GlobalKeyword"] = 155] = "GlobalKeyword";
SyntaxKind[SyntaxKind["BigIntKeyword"] = 156] = "BigIntKeyword";
SyntaxKind[SyntaxKind["OverrideKeyword"] = 157] = "OverrideKeyword";
SyntaxKind[SyntaxKind["OfKeyword"] = 158] = "OfKeyword";
// Parse tree nodes
// Names
SyntaxKind[SyntaxKind["QualifiedName"] = 159] = "QualifiedName";
SyntaxKind[SyntaxKind["ComputedPropertyName"] = 160] = "ComputedPropertyName";
// Signature elements
SyntaxKind[SyntaxKind["TypeParameter"] = 161] = "TypeParameter";
SyntaxKind[SyntaxKind["Parameter"] = 162] = "Parameter";
SyntaxKind[SyntaxKind["Decorator"] = 163] = "Decorator";
// TypeMember
SyntaxKind[SyntaxKind["PropertySignature"] = 164] = "PropertySignature";
SyntaxKind[SyntaxKind["PropertyDeclaration"] = 165] = "PropertyDeclaration";
SyntaxKind[SyntaxKind["MethodSignature"] = 166] = "MethodSignature";
SyntaxKind[SyntaxKind["MethodDeclaration"] = 167] = "MethodDeclaration";
SyntaxKind[SyntaxKind["ClassStaticBlockDeclaration"] = 168] = "ClassStaticBlockDeclaration";
SyntaxKind[SyntaxKind["Constructor"] = 169] = "Constructor";
SyntaxKind[SyntaxKind["GetAccessor"] = 170] = "GetAccessor";
SyntaxKind[SyntaxKind["SetAccessor"] = 171] = "SetAccessor";
SyntaxKind[SyntaxKind["CallSignature"] = 172] = "CallSignature";
SyntaxKind[SyntaxKind["ConstructSignature"] = 173] = "ConstructSignature";
SyntaxKind[SyntaxKind["IndexSignature"] = 174] = "IndexSignature";
// Type
SyntaxKind[SyntaxKind["TypePredicate"] = 175] = "TypePredicate";
SyntaxKind[SyntaxKind["TypeReference"] = 176] = "TypeReference";
SyntaxKind[SyntaxKind["FunctionType"] = 177] = "FunctionType";
SyntaxKind[SyntaxKind["ConstructorType"] = 178] = "ConstructorType";
SyntaxKind[SyntaxKind["TypeQuery"] = 179] = "TypeQuery";
SyntaxKind[SyntaxKind["TypeLiteral"] = 180] = "TypeLiteral";
SyntaxKind[SyntaxKind["ArrayType"] = 181] = "ArrayType";
SyntaxKind[SyntaxKind["TupleType"] = 182] = "TupleType";
SyntaxKind[SyntaxKind["OptionalType"] = 183] = "OptionalType";
SyntaxKind[SyntaxKind["RestType"] = 184] = "RestType";
SyntaxKind[SyntaxKind["UnionType"] = 185] = "UnionType";
SyntaxKind[SyntaxKind["IntersectionType"] = 186] = "IntersectionType";
SyntaxKind[SyntaxKind["ConditionalType"] = 187] = "ConditionalType";
SyntaxKind[SyntaxKind["InferType"] = 188] = "InferType";
SyntaxKind[SyntaxKind["ParenthesizedType"] = 189] = "ParenthesizedType";
SyntaxKind[SyntaxKind["ThisType"] = 190] = "ThisType";
SyntaxKind[SyntaxKind["TypeOperator"] = 191] = "TypeOperator";
SyntaxKind[SyntaxKind["IndexedAccessType"] = 192] = "IndexedAccessType";
SyntaxKind[SyntaxKind["MappedType"] = 193] = "MappedType";
SyntaxKind[SyntaxKind["LiteralType"] = 194] = "LiteralType";
SyntaxKind[SyntaxKind["NamedTupleMember"] = 195] = "NamedTupleMember";
SyntaxKind[SyntaxKind["TemplateLiteralType"] = 196] = "TemplateLiteralType";
SyntaxKind[SyntaxKind["TemplateLiteralTypeSpan"] = 197] = "TemplateLiteralTypeSpan";
SyntaxKind[SyntaxKind["ImportType"] = 198] = "ImportType";
// Binding patterns
SyntaxKind[SyntaxKind["ObjectBindingPattern"] = 199] = "ObjectBindingPattern";
SyntaxKind[SyntaxKind["ArrayBindingPattern"] = 200] = "ArrayBindingPattern";
SyntaxKind[SyntaxKind["BindingElement"] = 201] = "BindingElement";
// Expression
SyntaxKind[SyntaxKind["ArrayLiteralExpression"] = 202] = "ArrayLiteralExpression";
SyntaxKind[SyntaxKind["ObjectLiteralExpression"] = 203] = "ObjectLiteralExpression";
SyntaxKind[SyntaxKind["PropertyAccessExpression"] = 204] = "PropertyAccessExpression";
SyntaxKind[SyntaxKind["ElementAccessExpression"] = 205] = "ElementAccessExpression";
SyntaxKind[SyntaxKind["CallExpression"] = 206] = "CallExpression";
SyntaxKind[SyntaxKind["NewExpression"] = 207] = "NewExpression";
SyntaxKind[SyntaxKind["TaggedTemplateExpression"] = 208] = "TaggedTemplateExpression";
SyntaxKind[SyntaxKind["TypeAssertionExpression"] = 209] = "TypeAssertionExpression";
SyntaxKind[SyntaxKind["ParenthesizedExpression"] = 210] = "ParenthesizedExpression";
SyntaxKind[SyntaxKind["FunctionExpression"] = 211] = "FunctionExpression";
SyntaxKind[SyntaxKind["ArrowFunction"] = 212] = "ArrowFunction";
SyntaxKind[SyntaxKind["DeleteExpression"] = 213] = "DeleteExpression";
SyntaxKind[SyntaxKind["TypeOfExpression"] = 214] = "TypeOfExpression";
SyntaxKind[SyntaxKind["VoidExpression"] = 215] = "VoidExpression";
SyntaxKind[SyntaxKind["AwaitExpression"] = 216] = "AwaitExpression";
SyntaxKind[SyntaxKind["PrefixUnaryExpression"] = 217] = "PrefixUnaryExpression";
SyntaxKind[SyntaxKind["PostfixUnaryExpression"] = 218] = "PostfixUnaryExpression";
SyntaxKind[SyntaxKind["BinaryExpression"] = 219] = "BinaryExpression";
SyntaxKind[SyntaxKind["ConditionalExpression"] = 220] = "ConditionalExpression";
SyntaxKind[SyntaxKind["TemplateExpression"] = 221] = "TemplateExpression";
SyntaxKind[SyntaxKind["YieldExpression"] = 222] = "YieldExpression";
SyntaxKind[SyntaxKind["SpreadElement"] = 223] = "SpreadElement";
SyntaxKind[SyntaxKind["ClassExpression"] = 224] = "ClassExpression";
SyntaxKind[SyntaxKind["OmittedExpression"] = 225] = "OmittedExpression";
SyntaxKind[SyntaxKind["ExpressionWithTypeArguments"] = 226] = "ExpressionWithTypeArguments";
SyntaxKind[SyntaxKind["AsExpression"] = 227] = "AsExpression";
SyntaxKind[SyntaxKind["NonNullExpression"] = 228] = "NonNullExpression";
SyntaxKind[SyntaxKind["MetaProperty"] = 229] = "MetaProperty";
SyntaxKind[SyntaxKind["SyntheticExpression"] = 230] = "SyntheticExpression";
// Misc
SyntaxKind[SyntaxKind["TemplateSpan"] = 231] = "TemplateSpan";
SyntaxKind[SyntaxKind["SemicolonClassElement"] = 232] = "SemicolonClassElement";
// Element
SyntaxKind[SyntaxKind["Block"] = 233] = "Block";
SyntaxKind[SyntaxKind["EmptyStatement"] = 234] = "EmptyStatement";
SyntaxKind[SyntaxKind["VariableStatement"] = 235] = "VariableStatement";
SyntaxKind[SyntaxKind["ExpressionStatement"] = 236] = "ExpressionStatement";
SyntaxKind[SyntaxKind["IfStatement"] = 237] = "IfStatement";
SyntaxKind[SyntaxKind["DoStatement"] = 238] = "DoStatement";
SyntaxKind[SyntaxKind["WhileStatement"] = 239] = "WhileStatement";
SyntaxKind[SyntaxKind["ForStatement"] = 240] = "ForStatement";
SyntaxKind[SyntaxKind["ForInStatement"] = 241] = "ForInStatement";
SyntaxKind[SyntaxKind["ForOfStatement"] = 242] = "ForOfStatement";
SyntaxKind[SyntaxKind["ContinueStatement"] = 243] = "ContinueStatement";
SyntaxKind[SyntaxKind["BreakStatement"] = 244] = "BreakStatement";
SyntaxKind[SyntaxKind["ReturnStatement"] = 245] = "ReturnStatement";
SyntaxKind[SyntaxKind["WithStatement"] = 246] = "WithStatement";
SyntaxKind[SyntaxKind["SwitchStatement"] = 247] = "SwitchStatement";
SyntaxKind[SyntaxKind["LabeledStatement"] = 248] = "LabeledStatement";
SyntaxKind[SyntaxKind["ThrowStatement"] = 249] = "ThrowStatement";
SyntaxKind[SyntaxKind["TryStatement"] = 250] = "TryStatement";
SyntaxKind[SyntaxKind["DebuggerStatement"] = 251] = "DebuggerStatement";
SyntaxKind[SyntaxKind["VariableDeclaration"] = 252] = "VariableDeclaration";
SyntaxKind[SyntaxKind["VariableDeclarationList"] = 253] = "VariableDeclarationList";
SyntaxKind[SyntaxKind["FunctionDeclaration"] = 254] = "FunctionDeclaration";
SyntaxKind[SyntaxKind["ClassDeclaration"] = 255] = "ClassDeclaration";
SyntaxKind[SyntaxKind["InterfaceDeclaration"] = 256] = "InterfaceDeclaration";
SyntaxKind[SyntaxKind["TypeAliasDeclaration"] = 257] = "TypeAliasDeclaration";
SyntaxKind[SyntaxKind["EnumDeclaration"] = 258] = "EnumDeclaration";
SyntaxKind[SyntaxKind["ModuleDeclaration"] = 259] = "ModuleDeclaration";
SyntaxKind[SyntaxKind["ModuleBlock"] = 260] = "ModuleBlock";
SyntaxKind[SyntaxKind["CaseBlock"] = 261] = "CaseBlock";
SyntaxKind[SyntaxKind["NamespaceExportDeclaration"] = 262] = "NamespaceExportDeclaration";
SyntaxKind[SyntaxKind["ImportEqualsDeclaration"] = 263] = "ImportEqualsDeclaration";
SyntaxKind[SyntaxKind["ImportDeclaration"] = 264] = "ImportDeclaration";
SyntaxKind[SyntaxKind["ImportClause"] = 265] = "ImportClause";
SyntaxKind[SyntaxKind["NamespaceImport"] = 266] = "NamespaceImport";
SyntaxKind[SyntaxKind["NamedImports"] = 267] = "NamedImports";
SyntaxKind[SyntaxKind["ImportSpecifier"] = 268] = "ImportSpecifier";
SyntaxKind[SyntaxKind["ExportAssignment"] = 269] = "ExportAssignment";
SyntaxKind[SyntaxKind["ExportDeclaration"] = 270] = "ExportDeclaration";
SyntaxKind[SyntaxKind["NamedExports"] = 271] = "NamedExports";
SyntaxKind[SyntaxKind["NamespaceExport"] = 272] = "NamespaceExport";
SyntaxKind[SyntaxKind["ExportSpecifier"] = 273] = "ExportSpecifier";
SyntaxKind[SyntaxKind["MissingDeclaration"] = 274] = "MissingDeclaration";
// Module references
SyntaxKind[SyntaxKind["ExternalModuleReference"] = 275] = "ExternalModuleReference";
// JSX
SyntaxKind[SyntaxKind["JsxElement"] = 276] = "JsxElement";
SyntaxKind[SyntaxKind["JsxSelfClosingElement"] = 277] = "JsxSelfClosingElement";
SyntaxKind[SyntaxKind["JsxOpeningElement"] = 278] = "JsxOpeningElement";
SyntaxKind[SyntaxKind["JsxClosingElement"] = 279] = "JsxClosingElement";
SyntaxKind[SyntaxKind["JsxFragment"] = 280] = "JsxFragment";
SyntaxKind[SyntaxKind["JsxOpeningFragment"] = 281] = "JsxOpeningFragment";
SyntaxKind[SyntaxKind["JsxClosingFragment"] = 282] = "JsxClosingFragment";
SyntaxKind[SyntaxKind["JsxAttribute"] = 283] = "JsxAttribute";
SyntaxKind[SyntaxKind["JsxAttributes"] = 284] = "JsxAttributes";
SyntaxKind[SyntaxKind["JsxSpreadAttribute"] = 285] = "JsxSpreadAttribute";
SyntaxKind[SyntaxKind["JsxExpression"] = 286] = "JsxExpression";
// Clauses
SyntaxKind[SyntaxKind["CaseClause"] = 287] = "CaseClause";
SyntaxKind[SyntaxKind["DefaultClause"] = 288] = "DefaultClause";
SyntaxKind[SyntaxKind["HeritageClause"] = 289] = "HeritageClause";
SyntaxKind[SyntaxKind["CatchClause"] = 290] = "CatchClause";
// Property assignments
SyntaxKind[SyntaxKind["PropertyAssignment"] = 291] = "PropertyAssignment";
SyntaxKind[SyntaxKind["ShorthandPropertyAssignment"] = 292] = "ShorthandPropertyAssignment";
SyntaxKind[SyntaxKind["SpreadAssignment"] = 293] = "SpreadAssignment";
// Enum
SyntaxKind[SyntaxKind["EnumMember"] = 294] = "EnumMember";
// Unparsed
SyntaxKind[SyntaxKind["UnparsedPrologue"] = 295] = "UnparsedPrologue";
SyntaxKind[SyntaxKind["UnparsedPrepend"] = 296] = "UnparsedPrepend";
SyntaxKind[SyntaxKind["UnparsedText"] = 297] = "UnparsedText";
SyntaxKind[SyntaxKind["UnparsedInternalText"] = 298] = "UnparsedInternalText";
SyntaxKind[SyntaxKind["UnparsedSyntheticReference"] = 299] = "UnparsedSyntheticReference";
// Top-level nodes
SyntaxKind[SyntaxKind["SourceFile"] = 300] = "SourceFile";
SyntaxKind[SyntaxKind["Bundle"] = 301] = "Bundle";
SyntaxKind[SyntaxKind["UnparsedSource"] = 302] = "UnparsedSource";
SyntaxKind[SyntaxKind["InputFiles"] = 303] = "InputFiles";
// JSDoc nodes
SyntaxKind[SyntaxKind["JSDocTypeExpression"] = 304] = "JSDocTypeExpression";
SyntaxKind[SyntaxKind["JSDocNameReference"] = 305] = "JSDocNameReference";
SyntaxKind[SyntaxKind["JSDocMemberName"] = 306] = "JSDocMemberName";
SyntaxKind[SyntaxKind["JSDocAllType"] = 307] = "JSDocAllType";
SyntaxKind[SyntaxKind["JSDocUnknownType"] = 308] = "JSDocUnknownType";
SyntaxKind[SyntaxKind["JSDocNullableType"] = 309] = "JSDocNullableType";
SyntaxKind[SyntaxKind["JSDocNonNullableType"] = 310] = "JSDocNonNullableType";
SyntaxKind[SyntaxKind["JSDocOptionalType"] = 311] = "JSDocOptionalType";
SyntaxKind[SyntaxKind["JSDocFunctionType"] = 312] = "JSDocFunctionType";
SyntaxKind[SyntaxKind["JSDocVariadicType"] = 313] = "JSDocVariadicType";
SyntaxKind[SyntaxKind["JSDocNamepathType"] = 314] = "JSDocNamepathType";
SyntaxKind[SyntaxKind["JSDocComment"] = 315] = "JSDocComment";
SyntaxKind[SyntaxKind["JSDocText"] = 316] = "JSDocText";
SyntaxKind[SyntaxKind["JSDocTypeLiteral"] = 317] = "JSDocTypeLiteral";
SyntaxKind[SyntaxKind["JSDocSignature"] = 318] = "JSDocSignature";
SyntaxKind[SyntaxKind["JSDocLink"] = 319] = "JSDocLink";
SyntaxKind[SyntaxKind["JSDocLinkCode"] = 320] = "JSDocLinkCode";
SyntaxKind[SyntaxKind["JSDocLinkPlain"] = 321] = "JSDocLinkPlain";
SyntaxKind[SyntaxKind["JSDocTag"] = 322] = "JSDocTag";
SyntaxKind[SyntaxKind["JSDocAugmentsTag"] = 323] = "JSDocAugmentsTag";
SyntaxKind[SyntaxKind["JSDocImplementsTag"] = 324] = "JSDocImplementsTag";
SyntaxKind[SyntaxKind["JSDocAuthorTag"] = 325] = "JSDocAuthorTag";
SyntaxKind[SyntaxKind["JSDocDeprecatedTag"] = 326] = "JSDocDeprecatedTag";
SyntaxKind[SyntaxKind["JSDocClassTag"] = 327] = "JSDocClassTag";
SyntaxKind[SyntaxKind["JSDocPublicTag"] = 328] = "JSDocPublicTag";
SyntaxKind[SyntaxKind["JSDocPrivateTag"] = 329] = "JSDocPrivateTag";
SyntaxKind[SyntaxKind["JSDocProtectedTag"] = 330] = "JSDocProtectedTag";
SyntaxKind[SyntaxKind["JSDocReadonlyTag"] = 331] = "JSDocReadonlyTag";
SyntaxKind[SyntaxKind["JSDocOverrideTag"] = 332] = "JSDocOverrideTag";
SyntaxKind[SyntaxKind["JSDocCallbackTag"] = 333] = "JSDocCallbackTag";
SyntaxKind[SyntaxKind["JSDocEnumTag"] = 334] = "JSDocEnumTag";
SyntaxKind[SyntaxKind["JSDocParameterTag"] = 335] = "JSDocParameterTag";
SyntaxKind[SyntaxKind["JSDocReturnTag"] = 336] = "JSDocReturnTag";
SyntaxKind[SyntaxKind["JSDocThisTag"] = 337] = "JSDocThisTag";
SyntaxKind[SyntaxKind["JSDocTypeTag"] = 338] = "JSDocTypeTag";
SyntaxKind[SyntaxKind["JSDocTemplateTag"] = 339] = "JSDocTemplateTag";
SyntaxKind[SyntaxKind["JSDocTypedefTag"] = 340] = "JSDocTypedefTag";
SyntaxKind[SyntaxKind["JSDocSeeTag"] = 341] = "JSDocSeeTag";
SyntaxKind[SyntaxKind["JSDocPropertyTag"] = 342] = "JSDocPropertyTag";
// Synthesized list
SyntaxKind[SyntaxKind["SyntaxList"] = 343] = "SyntaxList";
// Transformation nodes
SyntaxKind[SyntaxKind["NotEmittedStatement"] = 344] = "NotEmittedStatement";
SyntaxKind[SyntaxKind["PartiallyEmittedExpression"] = 345] = "PartiallyEmittedExpression";
SyntaxKind[SyntaxKind["CommaListExpression"] = 346] = "CommaListExpression";
SyntaxKind[SyntaxKind["MergeDeclarationMarker"] = 347] = "MergeDeclarationMarker";
SyntaxKind[SyntaxKind["EndOfDeclarationMarker"] = 348] = "EndOfDeclarationMarker";
SyntaxKind[SyntaxKind["SyntheticReferenceExpression"] = 349] = "SyntheticReferenceExpression";
// Enum value count
SyntaxKind[SyntaxKind["Count"] = 350] = "Count";
// Markers
SyntaxKind[SyntaxKind["FirstAssignment"] = 63] = "FirstAssignment";
SyntaxKind[SyntaxKind["LastAssignment"] = 78] = "LastAssignment";
SyntaxKind[SyntaxKind["FirstCompoundAssignment"] = 64] = "FirstCompoundAssignment";
SyntaxKind[SyntaxKind["LastCompoundAssignment"] = 78] = "LastCompoundAssignment";
SyntaxKind[SyntaxKind["FirstReservedWord"] = 81] = "FirstReservedWord";
SyntaxKind[SyntaxKind["LastReservedWord"] = 116] = "LastReservedWord";
SyntaxKind[SyntaxKind["FirstKeyword"] = 81] = "FirstKeyword";
SyntaxKind[SyntaxKind["LastKeyword"] = 158] = "LastKeyword";
SyntaxKind[SyntaxKind["FirstFutureReservedWord"] = 117] = "FirstFutureReservedWord";
SyntaxKind[SyntaxKind["LastFutureReservedWord"] = 125] = "LastFutureReservedWord";
SyntaxKind[SyntaxKind["FirstTypeNode"] = 175] = "FirstTypeNode";
SyntaxKind[SyntaxKind["LastTypeNode"] = 198] = "LastTypeNode";
SyntaxKind[SyntaxKind["FirstPunctuation"] = 18] = "FirstPunctuation";
SyntaxKind[SyntaxKind["LastPunctuation"] = 78] = "LastPunctuation";
SyntaxKind[SyntaxKind["FirstToken"] = 0] = "FirstToken";
SyntaxKind[SyntaxKind["LastToken"] = 158] = "LastToken";
SyntaxKind[SyntaxKind["FirstTriviaToken"] = 2] = "FirstTriviaToken";
SyntaxKind[SyntaxKind["LastTriviaToken"] = 7] = "LastTriviaToken";
SyntaxKind[SyntaxKind["FirstLiteralToken"] = 8] = "FirstLiteralToken";
SyntaxKind[SyntaxKind["LastLiteralToken"] = 14] = "LastLiteralToken";
SyntaxKind[SyntaxKind["FirstTemplateToken"] = 14] = "FirstTemplateToken";
SyntaxKind[SyntaxKind["LastTemplateToken"] = 17] = "LastTemplateToken";
SyntaxKind[SyntaxKind["FirstBinaryOperator"] = 29] = "FirstBinaryOperator";
SyntaxKind[SyntaxKind["LastBinaryOperator"] = 78] = "LastBinaryOperator";
SyntaxKind[SyntaxKind["FirstStatement"] = 235] = "FirstStatement";
SyntaxKind[SyntaxKind["LastStatement"] = 251] = "LastStatement";
SyntaxKind[SyntaxKind["FirstNode"] = 159] = "FirstNode";
SyntaxKind[SyntaxKind["FirstJSDocNode"] = 304] = "FirstJSDocNode";
SyntaxKind[SyntaxKind["LastJSDocNode"] = 342] = "LastJSDocNode";
SyntaxKind[SyntaxKind["FirstJSDocTagNode"] = 322] = "FirstJSDocTagNode";
SyntaxKind[SyntaxKind["LastJSDocTagNode"] = 342] = "LastJSDocTagNode";
/* @internal */ SyntaxKind[SyntaxKind["FirstContextualKeyword"] = 126] = "FirstContextualKeyword";
/* @internal */ SyntaxKind[SyntaxKind["LastContextualKeyword"] = 158] = "LastContextualKeyword";
})(SyntaxKind = ts.SyntaxKind || (ts.SyntaxKind = {}));
var NodeFlags;
(function (NodeFlags) {
NodeFlags[NodeFlags["None"] = 0] = "None";
NodeFlags[NodeFlags["Let"] = 1] = "Let";
NodeFlags[NodeFlags["Const"] = 2] = "Const";
NodeFlags[NodeFlags["NestedNamespace"] = 4] = "NestedNamespace";
NodeFlags[NodeFlags["Synthesized"] = 8] = "Synthesized";
NodeFlags[NodeFlags["Namespace"] = 16] = "Namespace";
NodeFlags[NodeFlags["OptionalChain"] = 32] = "OptionalChain";
NodeFlags[NodeFlags["ExportContext"] = 64] = "ExportContext";
NodeFlags[NodeFlags["ContainsThis"] = 128] = "ContainsThis";
NodeFlags[NodeFlags["HasImplicitReturn"] = 256] = "HasImplicitReturn";
NodeFlags[NodeFlags["HasExplicitReturn"] = 512] = "HasExplicitReturn";
NodeFlags[NodeFlags["GlobalAugmentation"] = 1024] = "GlobalAugmentation";
NodeFlags[NodeFlags["HasAsyncFunctions"] = 2048] = "HasAsyncFunctions";
NodeFlags[NodeFlags["DisallowInContext"] = 4096] = "DisallowInContext";
NodeFlags[NodeFlags["YieldContext"] = 8192] = "YieldContext";
NodeFlags[NodeFlags["DecoratorContext"] = 16384] = "DecoratorContext";
NodeFlags[NodeFlags["AwaitContext"] = 32768] = "AwaitContext";
NodeFlags[NodeFlags["ThisNodeHasError"] = 65536] = "ThisNodeHasError";
NodeFlags[NodeFlags["JavaScriptFile"] = 131072] = "JavaScriptFile";
NodeFlags[NodeFlags["ThisNodeOrAnySubNodesHasError"] = 262144] = "ThisNodeOrAnySubNodesHasError";
NodeFlags[NodeFlags["HasAggregatedChildData"] = 524288] = "HasAggregatedChildData";
// These flags will be set when the parser encounters a dynamic import expression or 'import.meta' to avoid
// walking the tree if the flags are not set. However, these flags are just a approximation
// (hence why it's named "PossiblyContainsDynamicImport") because once set, the flags never get cleared.
// During editing, if a dynamic import is removed, incremental parsing will *NOT* clear this flag.
// This means that the tree will always be traversed during module resolution, or when looking for external module indicators.
// However, the removal operation should not occur often and in the case of the
// removal, it is likely that users will add the import anyway.
// The advantage of this approach is its simplicity. For the case of batch compilation,
// we guarantee that users won't have to pay the price of walking the tree if a dynamic import isn't used.
/* @internal */ NodeFlags[NodeFlags["PossiblyContainsDynamicImport"] = 1048576] = "PossiblyContainsDynamicImport";
/* @internal */ NodeFlags[NodeFlags["PossiblyContainsImportMeta"] = 2097152] = "PossiblyContainsImportMeta";
NodeFlags[NodeFlags["JSDoc"] = 4194304] = "JSDoc";
/* @internal */ NodeFlags[NodeFlags["Ambient"] = 8388608] = "Ambient";
/* @internal */ NodeFlags[NodeFlags["InWithStatement"] = 16777216] = "InWithStatement";
NodeFlags[NodeFlags["JsonFile"] = 33554432] = "JsonFile";
/* @internal */ NodeFlags[NodeFlags["TypeCached"] = 67108864] = "TypeCached";
/* @internal */ NodeFlags[NodeFlags["Deprecated"] = 134217728] = "Deprecated";
NodeFlags[NodeFlags["BlockScoped"] = 3] = "BlockScoped";
NodeFlags[NodeFlags["ReachabilityCheckFlags"] = 768] = "ReachabilityCheckFlags";
NodeFlags[NodeFlags["ReachabilityAndEmitFlags"] = 2816] = "ReachabilityAndEmitFlags";
// Parsing context flags
NodeFlags[NodeFlags["ContextFlags"] = 25358336] = "ContextFlags";
// Exclude these flags when parsing a Type
NodeFlags[NodeFlags["TypeExcludesFlags"] = 40960] = "TypeExcludesFlags";
// Represents all flags that are potentially set once and
// never cleared on SourceFiles which get re-used in between incremental parses.
// See the comment above on `PossiblyContainsDynamicImport` and `PossiblyContainsImportMeta`.
/* @internal */ NodeFlags[NodeFlags["PermanentlySetIncrementalFlags"] = 3145728] = "PermanentlySetIncrementalFlags";
})(NodeFlags = ts.NodeFlags || (ts.NodeFlags = {}));
var ModifierFlags;
(function (ModifierFlags) {
ModifierFlags[ModifierFlags["None"] = 0] = "None";
ModifierFlags[ModifierFlags["Export"] = 1] = "Export";
ModifierFlags[ModifierFlags["Ambient"] = 2] = "Ambient";
ModifierFlags[ModifierFlags["Public"] = 4] = "Public";
ModifierFlags[ModifierFlags["Private"] = 8] = "Private";
ModifierFlags[ModifierFlags["Protected"] = 16] = "Protected";
ModifierFlags[ModifierFlags["Static"] = 32] = "Static";
ModifierFlags[ModifierFlags["Readonly"] = 64] = "Readonly";
ModifierFlags[ModifierFlags["Abstract"] = 128] = "Abstract";
ModifierFlags[ModifierFlags["Async"] = 256] = "Async";
ModifierFlags[ModifierFlags["Default"] = 512] = "Default";
ModifierFlags[ModifierFlags["Const"] = 2048] = "Const";
ModifierFlags[ModifierFlags["HasComputedJSDocModifiers"] = 4096] = "HasComputedJSDocModifiers";
ModifierFlags[ModifierFlags["Deprecated"] = 8192] = "Deprecated";
ModifierFlags[ModifierFlags["Override"] = 16384] = "Override";
ModifierFlags[ModifierFlags["HasComputedFlags"] = 536870912] = "HasComputedFlags";
ModifierFlags[ModifierFlags["AccessibilityModifier"] = 28] = "AccessibilityModifier";
// Accessibility modifiers and 'readonly' can be attached to a parameter in a constructor to make it a property.
ModifierFlags[ModifierFlags["ParameterPropertyModifier"] = 16476] = "ParameterPropertyModifier";
ModifierFlags[ModifierFlags["NonPublicAccessibilityModifier"] = 24] = "NonPublicAccessibilityModifier";
ModifierFlags[ModifierFlags["TypeScriptModifier"] = 18654] = "TypeScriptModifier";
ModifierFlags[ModifierFlags["ExportDefault"] = 513] = "ExportDefault";
ModifierFlags[ModifierFlags["All"] = 27647] = "All";
})(ModifierFlags = ts.ModifierFlags || (ts.ModifierFlags = {}));
var JsxFlags;
(function (JsxFlags) {
JsxFlags[JsxFlags["None"] = 0] = "None";
/** An element from a named property of the JSX.IntrinsicElements interface */
JsxFlags[JsxFlags["IntrinsicNamedElement"] = 1] = "IntrinsicNamedElement";
/** An element inferred from the string index signature of the JSX.IntrinsicElements interface */
JsxFlags[JsxFlags["IntrinsicIndexedElement"] = 2] = "IntrinsicIndexedElement";
JsxFlags[JsxFlags["IntrinsicElement"] = 3] = "IntrinsicElement";
})(JsxFlags = ts.JsxFlags || (ts.JsxFlags = {}));
/* @internal */
var RelationComparisonResult;
(function (RelationComparisonResult) {
RelationComparisonResult[RelationComparisonResult["Succeeded"] = 1] = "Succeeded";
RelationComparisonResult[RelationComparisonResult["Failed"] = 2] = "Failed";
RelationComparisonResult[RelationComparisonResult["Reported"] = 4] = "Reported";
RelationComparisonResult[RelationComparisonResult["ReportsUnmeasurable"] = 8] = "ReportsUnmeasurable";
RelationComparisonResult[RelationComparisonResult["ReportsUnreliable"] = 16] = "ReportsUnreliable";
RelationComparisonResult[RelationComparisonResult["ReportsMask"] = 24] = "ReportsMask";
})(RelationComparisonResult = ts.RelationComparisonResult || (ts.RelationComparisonResult = {}));
var GeneratedIdentifierFlags;
(function (GeneratedIdentifierFlags) {
// Kinds
GeneratedIdentifierFlags[GeneratedIdentifierFlags["None"] = 0] = "None";
/*@internal*/ GeneratedIdentifierFlags[GeneratedIdentifierFlags["Auto"] = 1] = "Auto";
/*@internal*/ GeneratedIdentifierFlags[GeneratedIdentifierFlags["Loop"] = 2] = "Loop";
/*@internal*/ GeneratedIdentifierFlags[GeneratedIdentifierFlags["Unique"] = 3] = "Unique";
/*@internal*/ GeneratedIdentifierFlags[GeneratedIdentifierFlags["Node"] = 4] = "Node";
/*@internal*/ GeneratedIdentifierFlags[GeneratedIdentifierFlags["KindMask"] = 7] = "KindMask";
// Flags
GeneratedIdentifierFlags[GeneratedIdentifierFlags["ReservedInNestedScopes"] = 8] = "ReservedInNestedScopes";
GeneratedIdentifierFlags[GeneratedIdentifierFlags["Optimistic"] = 16] = "Optimistic";
GeneratedIdentifierFlags[GeneratedIdentifierFlags["FileLevel"] = 32] = "FileLevel";
GeneratedIdentifierFlags[GeneratedIdentifierFlags["AllowNameSubstitution"] = 64] = "AllowNameSubstitution";
})(GeneratedIdentifierFlags = ts.GeneratedIdentifierFlags || (ts.GeneratedIdentifierFlags = {}));
var TokenFlags;
(function (TokenFlags) {
TokenFlags[TokenFlags["None"] = 0] = "None";
/* @internal */
TokenFlags[TokenFlags["PrecedingLineBreak"] = 1] = "PrecedingLineBreak";
/* @internal */
TokenFlags[TokenFlags["PrecedingJSDocComment"] = 2] = "PrecedingJSDocComment";
/* @internal */
TokenFlags[TokenFlags["Unterminated"] = 4] = "Unterminated";
/* @internal */
TokenFlags[TokenFlags["ExtendedUnicodeEscape"] = 8] = "ExtendedUnicodeEscape";
TokenFlags[TokenFlags["Scientific"] = 16] = "Scientific";
TokenFlags[TokenFlags["Octal"] = 32] = "Octal";
TokenFlags[TokenFlags["HexSpecifier"] = 64] = "HexSpecifier";
TokenFlags[TokenFlags["BinarySpecifier"] = 128] = "BinarySpecifier";
TokenFlags[TokenFlags["OctalSpecifier"] = 256] = "OctalSpecifier";
/* @internal */
TokenFlags[TokenFlags["ContainsSeparator"] = 512] = "ContainsSeparator";
/* @internal */
TokenFlags[TokenFlags["UnicodeEscape"] = 1024] = "UnicodeEscape";
/* @internal */
TokenFlags[TokenFlags["ContainsInvalidEscape"] = 2048] = "ContainsInvalidEscape";
/* @internal */
TokenFlags[TokenFlags["BinaryOrOctalSpecifier"] = 384] = "BinaryOrOctalSpecifier";
/* @internal */
TokenFlags[TokenFlags["NumericLiteralFlags"] = 1008] = "NumericLiteralFlags";
/* @internal */
TokenFlags[TokenFlags["TemplateLiteralLikeFlags"] = 2048] = "TemplateLiteralLikeFlags";
})(TokenFlags = ts.TokenFlags || (ts.TokenFlags = {}));
// NOTE: Ensure this is up-to-date with src/debug/debug.ts
var FlowFlags;
(function (FlowFlags) {
FlowFlags[FlowFlags["Unreachable"] = 1] = "Unreachable";
FlowFlags[FlowFlags["Start"] = 2] = "Start";
FlowFlags[FlowFlags["BranchLabel"] = 4] = "BranchLabel";
FlowFlags[FlowFlags["LoopLabel"] = 8] = "LoopLabel";
FlowFlags[FlowFlags["Assignment"] = 16] = "Assignment";
FlowFlags[FlowFlags["TrueCondition"] = 32] = "TrueCondition";
FlowFlags[FlowFlags["FalseCondition"] = 64] = "FalseCondition";
FlowFlags[FlowFlags["SwitchClause"] = 128] = "SwitchClause";
FlowFlags[FlowFlags["ArrayMutation"] = 256] = "ArrayMutation";
FlowFlags[FlowFlags["Call"] = 512] = "Call";
FlowFlags[FlowFlags["ReduceLabel"] = 1024] = "ReduceLabel";
FlowFlags[FlowFlags["Referenced"] = 2048] = "Referenced";
FlowFlags[FlowFlags["Shared"] = 4096] = "Shared";
FlowFlags[FlowFlags["Label"] = 12] = "Label";
FlowFlags[FlowFlags["Condition"] = 96] = "Condition";
})(FlowFlags = ts.FlowFlags || (ts.FlowFlags = {}));
/* @internal */
var CommentDirectiveType;
(function (CommentDirectiveType) {
CommentDirectiveType[CommentDirectiveType["ExpectError"] = 0] = "ExpectError";
CommentDirectiveType[CommentDirectiveType["Ignore"] = 1] = "Ignore";
})(CommentDirectiveType = ts.CommentDirectiveType || (ts.CommentDirectiveType = {}));
var OperationCanceledException = /** @class */ (function () {
function OperationCanceledException() {
}
return OperationCanceledException;
}());
ts.OperationCanceledException = OperationCanceledException;
/*@internal*/
var FileIncludeKind;
(function (FileIncludeKind) {
FileIncludeKind[FileIncludeKind["RootFile"] = 0] = "RootFile";
FileIncludeKind[FileIncludeKind["SourceFromProjectReference"] = 1] = "SourceFromProjectReference";
FileIncludeKind[FileIncludeKind["OutputFromProjectReference"] = 2] = "OutputFromProjectReference";
FileIncludeKind[FileIncludeKind["Import"] = 3] = "Import";
FileIncludeKind[FileIncludeKind["ReferenceFile"] = 4] = "ReferenceFile";
FileIncludeKind[FileIncludeKind["TypeReferenceDirective"] = 5] = "TypeReferenceDirective";
FileIncludeKind[FileIncludeKind["LibFile"] = 6] = "LibFile";
FileIncludeKind[FileIncludeKind["LibReferenceDirective"] = 7] = "LibReferenceDirective";
FileIncludeKind[FileIncludeKind["AutomaticTypeDirectiveFile"] = 8] = "AutomaticTypeDirectiveFile";
})(FileIncludeKind = ts.FileIncludeKind || (ts.FileIncludeKind = {}));
/*@internal*/
var FilePreprocessingDiagnosticsKind;
(function (FilePreprocessingDiagnosticsKind) {
FilePreprocessingDiagnosticsKind[FilePreprocessingDiagnosticsKind["FilePreprocessingReferencedDiagnostic"] = 0] = "FilePreprocessingReferencedDiagnostic";
FilePreprocessingDiagnosticsKind[FilePreprocessingDiagnosticsKind["FilePreprocessingFileExplainingDiagnostic"] = 1] = "FilePreprocessingFileExplainingDiagnostic";
})(FilePreprocessingDiagnosticsKind = ts.FilePreprocessingDiagnosticsKind || (ts.FilePreprocessingDiagnosticsKind = {}));
/* @internal */
var StructureIsReused;
(function (StructureIsReused) {
StructureIsReused[StructureIsReused["Not"] = 0] = "Not";
StructureIsReused[StructureIsReused["SafeModules"] = 1] = "SafeModules";
StructureIsReused[StructureIsReused["Completely"] = 2] = "Completely";
})(StructureIsReused = ts.StructureIsReused || (ts.StructureIsReused = {}));
/** Return code used by getEmitOutput function to indicate status of the function */
var ExitStatus;
(function (ExitStatus) {
// Compiler ran successfully. Either this was a simple do-nothing compilation (for example,
// when -version or -help was provided, or this was a normal compilation, no diagnostics
// were produced, and all outputs were generated successfully.
ExitStatus[ExitStatus["Success"] = 0] = "Success";
// Diagnostics were produced and because of them no code was generated.
ExitStatus[ExitStatus["DiagnosticsPresent_OutputsSkipped"] = 1] = "DiagnosticsPresent_OutputsSkipped";
// Diagnostics were produced and outputs were generated in spite of them.
ExitStatus[ExitStatus["DiagnosticsPresent_OutputsGenerated"] = 2] = "DiagnosticsPresent_OutputsGenerated";
// When build skipped because passed in project is invalid
ExitStatus[ExitStatus["InvalidProject_OutputsSkipped"] = 3] = "InvalidProject_OutputsSkipped";
// When build is skipped because project references form cycle
ExitStatus[ExitStatus["ProjectReferenceCycle_OutputsSkipped"] = 4] = "ProjectReferenceCycle_OutputsSkipped";
/** @deprecated Use ProjectReferenceCycle_OutputsSkipped instead. */
ExitStatus[ExitStatus["ProjectReferenceCycle_OutputsSkupped"] = 4] = "ProjectReferenceCycle_OutputsSkupped";
})(ExitStatus = ts.ExitStatus || (ts.ExitStatus = {}));
/* @internal */
var UnionReduction;
(function (UnionReduction) {
UnionReduction[UnionReduction["None"] = 0] = "None";
UnionReduction[UnionReduction["Literal"] = 1] = "Literal";
UnionReduction[UnionReduction["Subtype"] = 2] = "Subtype";
})(UnionReduction = ts.UnionReduction || (ts.UnionReduction = {}));
/* @internal */
var ContextFlags;
(function (ContextFlags) {
ContextFlags[ContextFlags["None"] = 0] = "None";
ContextFlags[ContextFlags["Signature"] = 1] = "Signature";
ContextFlags[ContextFlags["NoConstraints"] = 2] = "NoConstraints";
ContextFlags[ContextFlags["Completions"] = 4] = "Completions";
ContextFlags[ContextFlags["SkipBindingPatterns"] = 8] = "SkipBindingPatterns";
})(ContextFlags = ts.ContextFlags || (ts.ContextFlags = {}));
// NOTE: If modifying this enum, must modify `TypeFormatFlags` too!
var NodeBuilderFlags;
(function (NodeBuilderFlags) {
NodeBuilderFlags[NodeBuilderFlags["None"] = 0] = "None";
// Options
NodeBuilderFlags[NodeBuilderFlags["NoTruncation"] = 1] = "NoTruncation";
NodeBuilderFlags[NodeBuilderFlags["WriteArrayAsGenericType"] = 2] = "WriteArrayAsGenericType";
NodeBuilderFlags[NodeBuilderFlags["GenerateNamesForShadowedTypeParams"] = 4] = "GenerateNamesForShadowedTypeParams";
NodeBuilderFlags[NodeBuilderFlags["UseStructuralFallback"] = 8] = "UseStructuralFallback";
NodeBuilderFlags[NodeBuilderFlags["ForbidIndexedAccessSymbolReferences"] = 16] = "ForbidIndexedAccessSymbolReferences";
NodeBuilderFlags[NodeBuilderFlags["WriteTypeArgumentsOfSignature"] = 32] = "WriteTypeArgumentsOfSignature";
NodeBuilderFlags[NodeBuilderFlags["UseFullyQualifiedType"] = 64] = "UseFullyQualifiedType";
NodeBuilderFlags[NodeBuilderFlags["UseOnlyExternalAliasing"] = 128] = "UseOnlyExternalAliasing";
NodeBuilderFlags[NodeBuilderFlags["SuppressAnyReturnType"] = 256] = "SuppressAnyReturnType";
NodeBuilderFlags[NodeBuilderFlags["WriteTypeParametersInQualifiedName"] = 512] = "WriteTypeParametersInQualifiedName";
NodeBuilderFlags[NodeBuilderFlags["MultilineObjectLiterals"] = 1024] = "MultilineObjectLiterals";
NodeBuilderFlags[NodeBuilderFlags["WriteClassExpressionAsTypeLiteral"] = 2048] = "WriteClassExpressionAsTypeLiteral";
NodeBuilderFlags[NodeBuilderFlags["UseTypeOfFunction"] = 4096] = "UseTypeOfFunction";
NodeBuilderFlags[NodeBuilderFlags["OmitParameterModifiers"] = 8192] = "OmitParameterModifiers";
NodeBuilderFlags[NodeBuilderFlags["UseAliasDefinedOutsideCurrentScope"] = 16384] = "UseAliasDefinedOutsideCurrentScope";
NodeBuilderFlags[NodeBuilderFlags["UseSingleQuotesForStringLiteralType"] = 268435456] = "UseSingleQuotesForStringLiteralType";
NodeBuilderFlags[NodeBuilderFlags["NoTypeReduction"] = 536870912] = "NoTypeReduction";
NodeBuilderFlags[NodeBuilderFlags["NoUndefinedOptionalParameterType"] = 1073741824] = "NoUndefinedOptionalParameterType";
// Error handling
NodeBuilderFlags[NodeBuilderFlags["AllowThisInObjectLiteral"] = 32768] = "AllowThisInObjectLiteral";
NodeBuilderFlags[NodeBuilderFlags["AllowQualifiedNameInPlaceOfIdentifier"] = 65536] = "AllowQualifiedNameInPlaceOfIdentifier";
/** @deprecated AllowQualifedNameInPlaceOfIdentifier. Use AllowQualifiedNameInPlaceOfIdentifier instead. */
NodeBuilderFlags[NodeBuilderFlags["AllowQualifedNameInPlaceOfIdentifier"] = 65536] = "AllowQualifedNameInPlaceOfIdentifier";
NodeBuilderFlags[NodeBuilderFlags["AllowAnonymousIdentifier"] = 131072] = "AllowAnonymousIdentifier";
NodeBuilderFlags[NodeBuilderFlags["AllowEmptyUnionOrIntersection"] = 262144] = "AllowEmptyUnionOrIntersection";
NodeBuilderFlags[NodeBuilderFlags["AllowEmptyTuple"] = 524288] = "AllowEmptyTuple";
NodeBuilderFlags[NodeBuilderFlags["AllowUniqueESSymbolType"] = 1048576] = "AllowUniqueESSymbolType";
NodeBuilderFlags[NodeBuilderFlags["AllowEmptyIndexInfoType"] = 2097152] = "AllowEmptyIndexInfoType";
// Errors (cont.)
NodeBuilderFlags[NodeBuilderFlags["AllowNodeModulesRelativePaths"] = 67108864] = "AllowNodeModulesRelativePaths";
/* @internal */ NodeBuilderFlags[NodeBuilderFlags["DoNotIncludeSymbolChain"] = 134217728] = "DoNotIncludeSymbolChain";
NodeBuilderFlags[NodeBuilderFlags["IgnoreErrors"] = 70221824] = "IgnoreErrors";
// State
NodeBuilderFlags[NodeBuilderFlags["InObjectTypeLiteral"] = 4194304] = "InObjectTypeLiteral";
NodeBuilderFlags[NodeBuilderFlags["InTypeAlias"] = 8388608] = "InTypeAlias";
NodeBuilderFlags[NodeBuilderFlags["InInitialEntityName"] = 16777216] = "InInitialEntityName";
})(NodeBuilderFlags = ts.NodeBuilderFlags || (ts.NodeBuilderFlags = {}));
// Ensure the shared flags between this and `NodeBuilderFlags` stay in alignment
var TypeFormatFlags;
(function (TypeFormatFlags) {
TypeFormatFlags[TypeFormatFlags["None"] = 0] = "None";
TypeFormatFlags[TypeFormatFlags["NoTruncation"] = 1] = "NoTruncation";
TypeFormatFlags[TypeFormatFlags["WriteArrayAsGenericType"] = 2] = "WriteArrayAsGenericType";
// hole because there's a hole in node builder flags
TypeFormatFlags[TypeFormatFlags["UseStructuralFallback"] = 8] = "UseStructuralFallback";
// hole because there's a hole in node builder flags
TypeFormatFlags[TypeFormatFlags["WriteTypeArgumentsOfSignature"] = 32] = "WriteTypeArgumentsOfSignature";
TypeFormatFlags[TypeFormatFlags["UseFullyQualifiedType"] = 64] = "UseFullyQualifiedType";
// hole because `UseOnlyExternalAliasing` is here in node builder flags, but functions which take old flags use `SymbolFormatFlags` instead
TypeFormatFlags[TypeFormatFlags["SuppressAnyReturnType"] = 256] = "SuppressAnyReturnType";
// hole because `WriteTypeParametersInQualifiedName` is here in node builder flags, but functions which take old flags use `SymbolFormatFlags` for this instead
TypeFormatFlags[TypeFormatFlags["MultilineObjectLiterals"] = 1024] = "MultilineObjectLiterals";
TypeFormatFlags[TypeFormatFlags["WriteClassExpressionAsTypeLiteral"] = 2048] = "WriteClassExpressionAsTypeLiteral";
TypeFormatFlags[TypeFormatFlags["UseTypeOfFunction"] = 4096] = "UseTypeOfFunction";
TypeFormatFlags[TypeFormatFlags["OmitParameterModifiers"] = 8192] = "OmitParameterModifiers";
TypeFormatFlags[TypeFormatFlags["UseAliasDefinedOutsideCurrentScope"] = 16384] = "UseAliasDefinedOutsideCurrentScope";
TypeFormatFlags[TypeFormatFlags["UseSingleQuotesForStringLiteralType"] = 268435456] = "UseSingleQuotesForStringLiteralType";
TypeFormatFlags[TypeFormatFlags["NoTypeReduction"] = 536870912] = "NoTypeReduction";
// Error Handling
TypeFormatFlags[TypeFormatFlags["AllowUniqueESSymbolType"] = 1048576] = "AllowUniqueESSymbolType";
// TypeFormatFlags exclusive
TypeFormatFlags[TypeFormatFlags["AddUndefined"] = 131072] = "AddUndefined";
TypeFormatFlags[TypeFormatFlags["WriteArrowStyleSignature"] = 262144] = "WriteArrowStyleSignature";
// State
TypeFormatFlags[TypeFormatFlags["InArrayType"] = 524288] = "InArrayType";
TypeFormatFlags[TypeFormatFlags["InElementType"] = 2097152] = "InElementType";
TypeFormatFlags[TypeFormatFlags["InFirstTypeArgument"] = 4194304] = "InFirstTypeArgument";
TypeFormatFlags[TypeFormatFlags["InTypeAlias"] = 8388608] = "InTypeAlias";
/** @deprecated */ TypeFormatFlags[TypeFormatFlags["WriteOwnNameForAnyLike"] = 0] = "WriteOwnNameForAnyLike";
TypeFormatFlags[TypeFormatFlags["NodeBuilderFlagsMask"] = 814775659] = "NodeBuilderFlagsMask";
})(TypeFormatFlags = ts.TypeFormatFlags || (ts.TypeFormatFlags = {}));
var SymbolFormatFlags;
(function (SymbolFormatFlags) {
SymbolFormatFlags[SymbolFormatFlags["None"] = 0] = "None";
// Write symbols's type argument if it is instantiated symbol
// eg. class C<T> { p: T } <-- Show p as C<T>.p here
// var a: C<number>;
// var p = a.p; <--- Here p is property of C<number> so show it as C<number>.p instead of just C.p
SymbolFormatFlags[SymbolFormatFlags["WriteTypeParametersOrArguments"] = 1] = "WriteTypeParametersOrArguments";
// Use only external alias information to get the symbol name in the given context
// eg. module m { export class c { } } import x = m.c;
// When this flag is specified m.c will be used to refer to the class instead of alias symbol x
SymbolFormatFlags[SymbolFormatFlags["UseOnlyExternalAliasing"] = 2] = "UseOnlyExternalAliasing";
// Build symbol name using any nodes needed, instead of just components of an entity name
SymbolFormatFlags[SymbolFormatFlags["AllowAnyNodeKind"] = 4] = "AllowAnyNodeKind";
// Prefer aliases which are not directly visible
SymbolFormatFlags[SymbolFormatFlags["UseAliasDefinedOutsideCurrentScope"] = 8] = "UseAliasDefinedOutsideCurrentScope";
// Skip building an accessible symbol chain
/* @internal */ SymbolFormatFlags[SymbolFormatFlags["DoNotIncludeSymbolChain"] = 16] = "DoNotIncludeSymbolChain";
})(SymbolFormatFlags = ts.SymbolFormatFlags || (ts.SymbolFormatFlags = {}));
/* @internal */
var SymbolAccessibility;
(function (SymbolAccessibility) {
SymbolAccessibility[SymbolAccessibility["Accessible"] = 0] = "Accessible";
SymbolAccessibility[SymbolAccessibility["NotAccessible"] = 1] = "NotAccessible";
SymbolAccessibility[SymbolAccessibility["CannotBeNamed"] = 2] = "CannotBeNamed";
})(SymbolAccessibility = ts.SymbolAccessibility || (ts.SymbolAccessibility = {}));
/* @internal */
var SyntheticSymbolKind;
(function (SyntheticSymbolKind) {
SyntheticSymbolKind[SyntheticSymbolKind["UnionOrIntersection"] = 0] = "UnionOrIntersection";
SyntheticSymbolKind[SyntheticSymbolKind["Spread"] = 1] = "Spread";
})(SyntheticSymbolKind = ts.SyntheticSymbolKind || (ts.SyntheticSymbolKind = {}));
var TypePredicateKind;
(function (TypePredicateKind) {
TypePredicateKind[TypePredicateKind["This"] = 0] = "This";
TypePredicateKind[TypePredicateKind["Identifier"] = 1] = "Identifier";
TypePredicateKind[TypePredicateKind["AssertsThis"] = 2] = "AssertsThis";
TypePredicateKind[TypePredicateKind["AssertsIdentifier"] = 3] = "AssertsIdentifier";
})(TypePredicateKind = ts.TypePredicateKind || (ts.TypePredicateKind = {}));
/** Indicates how to serialize the name for a TypeReferenceNode when emitting decorator metadata */
/* @internal */
var TypeReferenceSerializationKind;
(function (TypeReferenceSerializationKind) {
// The TypeReferenceNode could not be resolved.
// The type name should be emitted using a safe fallback.
TypeReferenceSerializationKind[TypeReferenceSerializationKind["Unknown"] = 0] = "Unknown";
// The TypeReferenceNode resolves to a type with a constructor
// function that can be reached at runtime (e.g. a `class`
// declaration or a `var` declaration for the static side
// of a type, such as the global `Promise` type in lib.d.ts).
TypeReferenceSerializationKind[TypeReferenceSerializationKind["TypeWithConstructSignatureAndValue"] = 1] = "TypeWithConstructSignatureAndValue";
// The TypeReferenceNode resolves to a Void-like, Nullable, or Never type.
TypeReferenceSerializationKind[TypeReferenceSerializationKind["VoidNullableOrNeverType"] = 2] = "VoidNullableOrNeverType";
// The TypeReferenceNode resolves to a Number-like type.
TypeReferenceSerializationKind[TypeReferenceSerializationKind["NumberLikeType"] = 3] = "NumberLikeType";
// The TypeReferenceNode resolves to a BigInt-like type.
TypeReferenceSerializationKind[TypeReferenceSerializationKind["BigIntLikeType"] = 4] = "BigIntLikeType";
// The TypeReferenceNode resolves to a String-like type.
TypeReferenceSerializationKind[TypeReferenceSerializationKind["StringLikeType"] = 5] = "StringLikeType";
// The TypeReferenceNode resolves to a Boolean-like type.
TypeReferenceSerializationKind[TypeReferenceSerializationKind["BooleanType"] = 6] = "BooleanType";
// The TypeReferenceNode resolves to an Array-like type.
TypeReferenceSerializationKind[TypeReferenceSerializationKind["ArrayLikeType"] = 7] = "ArrayLikeType";
// The TypeReferenceNode resolves to the ESSymbol type.
TypeReferenceSerializationKind[TypeReferenceSerializationKind["ESSymbolType"] = 8] = "ESSymbolType";
// The TypeReferenceNode resolved to the global Promise constructor symbol.
TypeReferenceSerializationKind[TypeReferenceSerializationKind["Promise"] = 9] = "Promise";
// The TypeReferenceNode resolves to a Function type or a type with call signatures.
TypeReferenceSerializationKind[TypeReferenceSerializationKind["TypeWithCallSignature"] = 10] = "TypeWithCallSignature";
// The TypeReferenceNode resolves to any other type.
TypeReferenceSerializationKind[TypeReferenceSerializationKind["ObjectType"] = 11] = "ObjectType";
})(TypeReferenceSerializationKind = ts.TypeReferenceSerializationKind || (ts.TypeReferenceSerializationKind = {}));
var SymbolFlags;
(function (SymbolFlags) {
SymbolFlags[SymbolFlags["None"] = 0] = "None";
SymbolFlags[SymbolFlags["FunctionScopedVariable"] = 1] = "FunctionScopedVariable";
SymbolFlags[SymbolFlags["BlockScopedVariable"] = 2] = "BlockScopedVariable";
SymbolFlags[SymbolFlags["Property"] = 4] = "Property";
SymbolFlags[SymbolFlags["EnumMember"] = 8] = "EnumMember";
SymbolFlags[SymbolFlags["Function"] = 16] = "Function";
SymbolFlags[SymbolFlags["Class"] = 32] = "Class";
SymbolFlags[SymbolFlags["Interface"] = 64] = "Interface";
SymbolFlags[SymbolFlags["ConstEnum"] = 128] = "ConstEnum";
SymbolFlags[SymbolFlags["RegularEnum"] = 256] = "RegularEnum";
SymbolFlags[SymbolFlags["ValueModule"] = 512] = "ValueModule";
SymbolFlags[SymbolFlags["NamespaceModule"] = 1024] = "NamespaceModule";
SymbolFlags[SymbolFlags["TypeLiteral"] = 2048] = "TypeLiteral";
SymbolFlags[SymbolFlags["ObjectLiteral"] = 4096] = "ObjectLiteral";
SymbolFlags[SymbolFlags["Method"] = 8192] = "Method";
SymbolFlags[SymbolFlags["Constructor"] = 16384] = "Constructor";
SymbolFlags[SymbolFlags["GetAccessor"] = 32768] = "GetAccessor";
SymbolFlags[SymbolFlags["SetAccessor"] = 65536] = "SetAccessor";
SymbolFlags[SymbolFlags["Signature"] = 131072] = "Signature";
SymbolFlags[SymbolFlags["TypeParameter"] = 262144] = "TypeParameter";
SymbolFlags[SymbolFlags["TypeAlias"] = 524288] = "TypeAlias";
SymbolFlags[SymbolFlags["ExportValue"] = 1048576] = "ExportValue";
SymbolFlags[SymbolFlags["Alias"] = 2097152] = "Alias";
SymbolFlags[SymbolFlags["Prototype"] = 4194304] = "Prototype";
SymbolFlags[SymbolFlags["ExportStar"] = 8388608] = "ExportStar";
SymbolFlags[SymbolFlags["Optional"] = 16777216] = "Optional";
SymbolFlags[SymbolFlags["Transient"] = 33554432] = "Transient";
SymbolFlags[SymbolFlags["Assignment"] = 67108864] = "Assignment";
SymbolFlags[SymbolFlags["ModuleExports"] = 134217728] = "ModuleExports";
/* @internal */
SymbolFlags[SymbolFlags["All"] = 67108863] = "All";
SymbolFlags[SymbolFlags["Enum"] = 384] = "Enum";
SymbolFlags[SymbolFlags["Variable"] = 3] = "Variable";
SymbolFlags[SymbolFlags["Value"] = 111551] = "Value";
SymbolFlags[SymbolFlags["Type"] = 788968] = "Type";
SymbolFlags[SymbolFlags["Namespace"] = 1920] = "Namespace";
SymbolFlags[SymbolFlags["Module"] = 1536] = "Module";
SymbolFlags[SymbolFlags["Accessor"] = 98304] = "Accessor";
// Variables can be redeclared, but can not redeclare a block-scoped declaration with the
// same name, or any other value that is not a variable, e.g. ValueModule or Class
SymbolFlags[SymbolFlags["FunctionScopedVariableExcludes"] = 111550] = "FunctionScopedVariableExcludes";
// Block-scoped declarations are not allowed to be re-declared
// they can not merge with anything in the value space
SymbolFlags[SymbolFlags["BlockScopedVariableExcludes"] = 111551] = "BlockScopedVariableExcludes";
SymbolFlags[SymbolFlags["ParameterExcludes"] = 111551] = "ParameterExcludes";
SymbolFlags[SymbolFlags["PropertyExcludes"] = 0] = "PropertyExcludes";
SymbolFlags[SymbolFlags["EnumMemberExcludes"] = 900095] = "EnumMemberExcludes";
SymbolFlags[SymbolFlags["FunctionExcludes"] = 110991] = "FunctionExcludes";
SymbolFlags[SymbolFlags["ClassExcludes"] = 899503] = "ClassExcludes";
SymbolFlags[SymbolFlags["InterfaceExcludes"] = 788872] = "InterfaceExcludes";
SymbolFlags[SymbolFlags["RegularEnumExcludes"] = 899327] = "RegularEnumExcludes";
SymbolFlags[SymbolFlags["ConstEnumExcludes"] = 899967] = "ConstEnumExcludes";
SymbolFlags[SymbolFlags["ValueModuleExcludes"] = 110735] = "ValueModuleExcludes";
SymbolFlags[SymbolFlags["NamespaceModuleExcludes"] = 0] = "NamespaceModuleExcludes";
SymbolFlags[SymbolFlags["MethodExcludes"] = 103359] = "MethodExcludes";
SymbolFlags[SymbolFlags["GetAccessorExcludes"] = 46015] = "GetAccessorExcludes";
SymbolFlags[SymbolFlags["SetAccessorExcludes"] = 78783] = "SetAccessorExcludes";
SymbolFlags[SymbolFlags["TypeParameterExcludes"] = 526824] = "TypeParameterExcludes";
SymbolFlags[SymbolFlags["TypeAliasExcludes"] = 788968] = "TypeAliasExcludes";
SymbolFlags[SymbolFlags["AliasExcludes"] = 2097152] = "AliasExcludes";
SymbolFlags[SymbolFlags["ModuleMember"] = 2623475] = "ModuleMember";
SymbolFlags[SymbolFlags["ExportHasLocal"] = 944] = "ExportHasLocal";
SymbolFlags[SymbolFlags["BlockScoped"] = 418] = "BlockScoped";
SymbolFlags[SymbolFlags["PropertyOrAccessor"] = 98308] = "PropertyOrAccessor";
SymbolFlags[SymbolFlags["ClassMember"] = 106500] = "ClassMember";
/* @internal */
SymbolFlags[SymbolFlags["ExportSupportsDefaultModifier"] = 112] = "ExportSupportsDefaultModifier";
/* @internal */
SymbolFlags[SymbolFlags["ExportDoesNotSupportDefaultModifier"] = -113] = "ExportDoesNotSupportDefaultModifier";
/* @internal */
// The set of things we consider semantically classifiable. Used to speed up the LS during
// classification.
SymbolFlags[SymbolFlags["Classifiable"] = 2885600] = "Classifiable";
/* @internal */
SymbolFlags[SymbolFlags["LateBindingContainer"] = 6256] = "LateBindingContainer";
})(SymbolFlags = ts.SymbolFlags || (ts.SymbolFlags = {}));
/* @internal */
var EnumKind;
(function (EnumKind) {
EnumKind[EnumKind["Numeric"] = 0] = "Numeric";
EnumKind[EnumKind["Literal"] = 1] = "Literal"; // Literal enum (each member has a TypeFlags.EnumLiteral type)
})(EnumKind = ts.EnumKind || (ts.EnumKind = {}));
/* @internal */
var CheckFlags;
(function (CheckFlags) {
CheckFlags[CheckFlags["Instantiated"] = 1] = "Instantiated";
CheckFlags[CheckFlags["SyntheticProperty"] = 2] = "SyntheticProperty";
CheckFlags[CheckFlags["SyntheticMethod"] = 4] = "SyntheticMethod";
CheckFlags[CheckFlags["Readonly"] = 8] = "Readonly";
CheckFlags[CheckFlags["ReadPartial"] = 16] = "ReadPartial";
CheckFlags[CheckFlags["WritePartial"] = 32] = "WritePartial";
CheckFlags[CheckFlags["HasNonUniformType"] = 64] = "HasNonUniformType";
CheckFlags[CheckFlags["HasLiteralType"] = 128] = "HasLiteralType";
CheckFlags[CheckFlags["ContainsPublic"] = 256] = "ContainsPublic";
CheckFlags[CheckFlags["ContainsProtected"] = 512] = "ContainsProtected";
CheckFlags[CheckFlags["ContainsPrivate"] = 1024] = "ContainsPrivate";
CheckFlags[CheckFlags["ContainsStatic"] = 2048] = "ContainsStatic";
CheckFlags[CheckFlags["Late"] = 4096] = "Late";
CheckFlags[CheckFlags["ReverseMapped"] = 8192] = "ReverseMapped";
CheckFlags[CheckFlags["OptionalParameter"] = 16384] = "OptionalParameter";
CheckFlags[CheckFlags["RestParameter"] = 32768] = "RestParameter";
CheckFlags[CheckFlags["DeferredType"] = 65536] = "DeferredType";
CheckFlags[CheckFlags["HasNeverType"] = 131072] = "HasNeverType";
CheckFlags[CheckFlags["Mapped"] = 262144] = "Mapped";
CheckFlags[CheckFlags["StripOptional"] = 524288] = "StripOptional";
CheckFlags[CheckFlags["Synthetic"] = 6] = "Synthetic";
CheckFlags[CheckFlags["Discriminant"] = 192] = "Discriminant";
CheckFlags[CheckFlags["Partial"] = 48] = "Partial";
})(CheckFlags = ts.CheckFlags || (ts.CheckFlags = {}));
var InternalSymbolName;
(function (InternalSymbolName) {
InternalSymbolName["Call"] = "__call";
InternalSymbolName["Constructor"] = "__constructor";
InternalSymbolName["New"] = "__new";
InternalSymbolName["Index"] = "__index";
InternalSymbolName["ExportStar"] = "__export";
InternalSymbolName["Global"] = "__global";
InternalSymbolName["Missing"] = "__missing";
InternalSymbolName["Type"] = "__type";
InternalSymbolName["Object"] = "__object";
InternalSymbolName["JSXAttributes"] = "__jsxAttributes";
InternalSymbolName["Class"] = "__class";
InternalSymbolName["Function"] = "__function";
InternalSymbolName["Computed"] = "__computed";
InternalSymbolName["Resolving"] = "__resolving__";
InternalSymbolName["ExportEquals"] = "export=";
InternalSymbolName["Default"] = "default";
InternalSymbolName["This"] = "this";
})(InternalSymbolName = ts.InternalSymbolName || (ts.InternalSymbolName = {}));
/* @internal */
var NodeCheckFlags;
(function (NodeCheckFlags) {
NodeCheckFlags[NodeCheckFlags["TypeChecked"] = 1] = "TypeChecked";
NodeCheckFlags[NodeCheckFlags["LexicalThis"] = 2] = "LexicalThis";
NodeCheckFlags[NodeCheckFlags["CaptureThis"] = 4] = "CaptureThis";
NodeCheckFlags[NodeCheckFlags["CaptureNewTarget"] = 8] = "CaptureNewTarget";
NodeCheckFlags[NodeCheckFlags["SuperInstance"] = 256] = "SuperInstance";
NodeCheckFlags[NodeCheckFlags["SuperStatic"] = 512] = "SuperStatic";
NodeCheckFlags[NodeCheckFlags["ContextChecked"] = 1024] = "ContextChecked";
NodeCheckFlags[NodeCheckFlags["AsyncMethodWithSuper"] = 2048] = "AsyncMethodWithSuper";
NodeCheckFlags[NodeCheckFlags["AsyncMethodWithSuperBinding"] = 4096] = "AsyncMethodWithSuperBinding";
NodeCheckFlags[NodeCheckFlags["CaptureArguments"] = 8192] = "CaptureArguments";
NodeCheckFlags[NodeCheckFlags["EnumValuesComputed"] = 16384] = "EnumValuesComputed";
NodeCheckFlags[NodeCheckFlags["LexicalModuleMergesWithClass"] = 32768] = "LexicalModuleMergesWithClass";
NodeCheckFlags[NodeCheckFlags["LoopWithCapturedBlockScopedBinding"] = 65536] = "LoopWithCapturedBlockScopedBinding";
NodeCheckFlags[NodeCheckFlags["ContainsCapturedBlockScopeBinding"] = 131072] = "ContainsCapturedBlockScopeBinding";
NodeCheckFlags[NodeCheckFlags["CapturedBlockScopedBinding"] = 262144] = "CapturedBlockScopedBinding";
NodeCheckFlags[NodeCheckFlags["BlockScopedBindingInLoop"] = 524288] = "BlockScopedBindingInLoop";
NodeCheckFlags[NodeCheckFlags["ClassWithBodyScopedClassBinding"] = 1048576] = "ClassWithBodyScopedClassBinding";
NodeCheckFlags[NodeCheckFlags["BodyScopedClassBinding"] = 2097152] = "BodyScopedClassBinding";
NodeCheckFlags[NodeCheckFlags["NeedsLoopOutParameter"] = 4194304] = "NeedsLoopOutParameter";
NodeCheckFlags[NodeCheckFlags["AssignmentsMarked"] = 8388608] = "AssignmentsMarked";
NodeCheckFlags[NodeCheckFlags["ClassWithConstructorReference"] = 16777216] = "ClassWithConstructorReference";
NodeCheckFlags[NodeCheckFlags["ConstructorReferenceInClass"] = 33554432] = "ConstructorReferenceInClass";
NodeCheckFlags[NodeCheckFlags["ContainsClassWithPrivateIdentifiers"] = 67108864] = "ContainsClassWithPrivateIdentifiers";
NodeCheckFlags[NodeCheckFlags["ContainsSuperPropertyInStaticInitializer"] = 134217728] = "ContainsSuperPropertyInStaticInitializer";
})(NodeCheckFlags = ts.NodeCheckFlags || (ts.NodeCheckFlags = {}));
var TypeFlags;
(function (TypeFlags) {
TypeFlags[TypeFlags["Any"] = 1] = "Any";
TypeFlags[TypeFlags["Unknown"] = 2] = "Unknown";
TypeFlags[TypeFlags["String"] = 4] = "String";
TypeFlags[TypeFlags["Number"] = 8] = "Number";
TypeFlags[TypeFlags["Boolean"] = 16] = "Boolean";
TypeFlags[TypeFlags["Enum"] = 32] = "Enum";
TypeFlags[TypeFlags["BigInt"] = 64] = "BigInt";
TypeFlags[TypeFlags["StringLiteral"] = 128] = "StringLiteral";
TypeFlags[TypeFlags["NumberLiteral"] = 256] = "NumberLiteral";
TypeFlags[TypeFlags["BooleanLiteral"] = 512] = "BooleanLiteral";
TypeFlags[TypeFlags["EnumLiteral"] = 1024] = "EnumLiteral";
TypeFlags[TypeFlags["BigIntLiteral"] = 2048] = "BigIntLiteral";
TypeFlags[TypeFlags["ESSymbol"] = 4096] = "ESSymbol";
TypeFlags[TypeFlags["UniqueESSymbol"] = 8192] = "UniqueESSymbol";
TypeFlags[TypeFlags["Void"] = 16384] = "Void";
TypeFlags[TypeFlags["Undefined"] = 32768] = "Undefined";
TypeFlags[TypeFlags["Null"] = 65536] = "Null";
TypeFlags[TypeFlags["Never"] = 131072] = "Never";
TypeFlags[TypeFlags["TypeParameter"] = 262144] = "TypeParameter";
TypeFlags[TypeFlags["Object"] = 524288] = "Object";
TypeFlags[TypeFlags["Union"] = 1048576] = "Union";
TypeFlags[TypeFlags["Intersection"] = 2097152] = "Intersection";
TypeFlags[TypeFlags["Index"] = 4194304] = "Index";
TypeFlags[TypeFlags["IndexedAccess"] = 8388608] = "IndexedAccess";
TypeFlags[TypeFlags["Conditional"] = 16777216] = "Conditional";
TypeFlags[TypeFlags["Substitution"] = 33554432] = "Substitution";
TypeFlags[TypeFlags["NonPrimitive"] = 67108864] = "NonPrimitive";
TypeFlags[TypeFlags["TemplateLiteral"] = 134217728] = "TemplateLiteral";
TypeFlags[TypeFlags["StringMapping"] = 268435456] = "StringMapping";
/* @internal */
TypeFlags[TypeFlags["AnyOrUnknown"] = 3] = "AnyOrUnknown";
/* @internal */
TypeFlags[TypeFlags["Nullable"] = 98304] = "Nullable";
TypeFlags[TypeFlags["Literal"] = 2944] = "Literal";
TypeFlags[TypeFlags["Unit"] = 109440] = "Unit";
TypeFlags[TypeFlags["StringOrNumberLiteral"] = 384] = "StringOrNumberLiteral";
/* @internal */
TypeFlags[TypeFlags["StringOrNumberLiteralOrUnique"] = 8576] = "StringOrNumberLiteralOrUnique";
/* @internal */
TypeFlags[TypeFlags["DefinitelyFalsy"] = 117632] = "DefinitelyFalsy";
TypeFlags[TypeFlags["PossiblyFalsy"] = 117724] = "PossiblyFalsy";
/* @internal */
TypeFlags[TypeFlags["Intrinsic"] = 67359327] = "Intrinsic";
/* @internal */
TypeFlags[TypeFlags["Primitive"] = 131068] = "Primitive";
TypeFlags[TypeFlags["StringLike"] = 402653316] = "StringLike";
TypeFlags[TypeFlags["NumberLike"] = 296] = "NumberLike";
TypeFlags[TypeFlags["BigIntLike"] = 2112] = "BigIntLike";
TypeFlags[TypeFlags["BooleanLike"] = 528] = "BooleanLike";
TypeFlags[TypeFlags["EnumLike"] = 1056] = "EnumLike";
TypeFlags[TypeFlags["ESSymbolLike"] = 12288] = "ESSymbolLike";
TypeFlags[TypeFlags["VoidLike"] = 49152] = "VoidLike";
/* @internal */
TypeFlags[TypeFlags["DisjointDomains"] = 469892092] = "DisjointDomains";
TypeFlags[TypeFlags["UnionOrIntersection"] = 3145728] = "UnionOrIntersection";
TypeFlags[TypeFlags["StructuredType"] = 3670016] = "StructuredType";
TypeFlags[TypeFlags["TypeVariable"] = 8650752] = "TypeVariable";
TypeFlags[TypeFlags["InstantiableNonPrimitive"] = 58982400] = "InstantiableNonPrimitive";
TypeFlags[TypeFlags["InstantiablePrimitive"] = 406847488] = "InstantiablePrimitive";
TypeFlags[TypeFlags["Instantiable"] = 465829888] = "Instantiable";
TypeFlags[TypeFlags["StructuredOrInstantiable"] = 469499904] = "StructuredOrInstantiable";
/* @internal */
TypeFlags[TypeFlags["ObjectFlagsType"] = 3899393] = "ObjectFlagsType";
/* @internal */
TypeFlags[TypeFlags["Simplifiable"] = 25165824] = "Simplifiable";
/* @internal */
TypeFlags[TypeFlags["Singleton"] = 67358815] = "Singleton";
// 'Narrowable' types are types where narrowing actually narrows.
// This *should* be every type other than null, undefined, void, and never
TypeFlags[TypeFlags["Narrowable"] = 536624127] = "Narrowable";
/* @internal */
TypeFlags[TypeFlags["NotPrimitiveUnion"] = 468598819] = "NotPrimitiveUnion";
// The following flags are aggregated during union and intersection type construction
/* @internal */
TypeFlags[TypeFlags["IncludesMask"] = 205258751] = "IncludesMask";
// The following flags are used for different purposes during union and intersection type construction
/* @internal */
TypeFlags[TypeFlags["IncludesStructuredOrInstantiable"] = 262144] = "IncludesStructuredOrInstantiable";
/* @internal */
TypeFlags[TypeFlags["IncludesNonWideningType"] = 4194304] = "IncludesNonWideningType";
/* @internal */
TypeFlags[TypeFlags["IncludesWildcard"] = 8388608] = "IncludesWildcard";
/* @internal */
TypeFlags[TypeFlags["IncludesEmptyObject"] = 16777216] = "IncludesEmptyObject";
})(TypeFlags = ts.TypeFlags || (ts.TypeFlags = {}));
// Types included in TypeFlags.ObjectFlagsType have an objectFlags property. Some ObjectFlags
// are specific to certain types and reuse the same bit position. Those ObjectFlags require a check
// for a certain TypeFlags value to determine their meaning.
var ObjectFlags;
(function (ObjectFlags) {
ObjectFlags[ObjectFlags["Class"] = 1] = "Class";
ObjectFlags[ObjectFlags["Interface"] = 2] = "Interface";
ObjectFlags[ObjectFlags["Reference"] = 4] = "Reference";
ObjectFlags[ObjectFlags["Tuple"] = 8] = "Tuple";
ObjectFlags[ObjectFlags["Anonymous"] = 16] = "Anonymous";
ObjectFlags[ObjectFlags["Mapped"] = 32] = "Mapped";
ObjectFlags[ObjectFlags["Instantiated"] = 64] = "Instantiated";
ObjectFlags[ObjectFlags["ObjectLiteral"] = 128] = "ObjectLiteral";
ObjectFlags[ObjectFlags["EvolvingArray"] = 256] = "EvolvingArray";
ObjectFlags[ObjectFlags["ObjectLiteralPatternWithComputedProperties"] = 512] = "ObjectLiteralPatternWithComputedProperties";
ObjectFlags[ObjectFlags["ReverseMapped"] = 1024] = "ReverseMapped";
ObjectFlags[ObjectFlags["JsxAttributes"] = 2048] = "JsxAttributes";
ObjectFlags[ObjectFlags["MarkerType"] = 4096] = "MarkerType";
ObjectFlags[ObjectFlags["JSLiteral"] = 8192] = "JSLiteral";
ObjectFlags[ObjectFlags["FreshLiteral"] = 16384] = "FreshLiteral";
ObjectFlags[ObjectFlags["ArrayLiteral"] = 32768] = "ArrayLiteral";
/* @internal */
ObjectFlags[ObjectFlags["PrimitiveUnion"] = 65536] = "PrimitiveUnion";
/* @internal */
ObjectFlags[ObjectFlags["ContainsWideningType"] = 131072] = "ContainsWideningType";
/* @internal */
ObjectFlags[ObjectFlags["ContainsObjectOrArrayLiteral"] = 262144] = "ContainsObjectOrArrayLiteral";
/* @internal */
ObjectFlags[ObjectFlags["NonInferrableType"] = 524288] = "NonInferrableType";
/* @internal */
ObjectFlags[ObjectFlags["CouldContainTypeVariablesComputed"] = 1048576] = "CouldContainTypeVariablesComputed";
/* @internal */
ObjectFlags[ObjectFlags["CouldContainTypeVariables"] = 2097152] = "CouldContainTypeVariables";
ObjectFlags[ObjectFlags["ClassOrInterface"] = 3] = "ClassOrInterface";
/* @internal */
ObjectFlags[ObjectFlags["RequiresWidening"] = 393216] = "RequiresWidening";
/* @internal */
ObjectFlags[ObjectFlags["PropagatingFlags"] = 917504] = "PropagatingFlags";
// Object flags that uniquely identify the kind of ObjectType
/* @internal */
ObjectFlags[ObjectFlags["ObjectTypeKindMask"] = 1343] = "ObjectTypeKindMask";
// Flags that require TypeFlags.Object
ObjectFlags[ObjectFlags["ContainsSpread"] = 4194304] = "ContainsSpread";
ObjectFlags[ObjectFlags["ObjectRestType"] = 8388608] = "ObjectRestType";
/* @internal */
ObjectFlags[ObjectFlags["IsClassInstanceClone"] = 16777216] = "IsClassInstanceClone";
// Flags that require TypeFlags.Object and ObjectFlags.Reference
/* @internal */
ObjectFlags[ObjectFlags["IdenticalBaseTypeCalculated"] = 33554432] = "IdenticalBaseTypeCalculated";
/* @internal */
ObjectFlags[ObjectFlags["IdenticalBaseTypeExists"] = 67108864] = "IdenticalBaseTypeExists";
// Flags that require TypeFlags.UnionOrIntersection or TypeFlags.Substitution
/* @internal */
ObjectFlags[ObjectFlags["IsGenericTypeComputed"] = 4194304] = "IsGenericTypeComputed";
/* @internal */
ObjectFlags[ObjectFlags["IsGenericObjectType"] = 8388608] = "IsGenericObjectType";
/* @internal */
ObjectFlags[ObjectFlags["IsGenericIndexType"] = 16777216] = "IsGenericIndexType";
/* @internal */
ObjectFlags[ObjectFlags["IsGenericType"] = 25165824] = "IsGenericType";
// Flags that require TypeFlags.Union
/* @internal */
ObjectFlags[ObjectFlags["ContainsIntersections"] = 33554432] = "ContainsIntersections";
// Flags that require TypeFlags.Intersection
/* @internal */
ObjectFlags[ObjectFlags["IsNeverIntersectionComputed"] = 33554432] = "IsNeverIntersectionComputed";
/* @internal */
ObjectFlags[ObjectFlags["IsNeverIntersection"] = 67108864] = "IsNeverIntersection";
})(ObjectFlags = ts.ObjectFlags || (ts.ObjectFlags = {}));
/* @internal */
var VarianceFlags;
(function (VarianceFlags) {
VarianceFlags[VarianceFlags["Invariant"] = 0] = "Invariant";
VarianceFlags[VarianceFlags["Covariant"] = 1] = "Covariant";
VarianceFlags[VarianceFlags["Contravariant"] = 2] = "Contravariant";
VarianceFlags[VarianceFlags["Bivariant"] = 3] = "Bivariant";
VarianceFlags[VarianceFlags["Independent"] = 4] = "Independent";
VarianceFlags[VarianceFlags["VarianceMask"] = 7] = "VarianceMask";
VarianceFlags[VarianceFlags["Unmeasurable"] = 8] = "Unmeasurable";
VarianceFlags[VarianceFlags["Unreliable"] = 16] = "Unreliable";
VarianceFlags[VarianceFlags["AllowsStructuralFallback"] = 24] = "AllowsStructuralFallback";
})(VarianceFlags = ts.VarianceFlags || (ts.VarianceFlags = {}));
var ElementFlags;
(function (ElementFlags) {
ElementFlags[ElementFlags["Required"] = 1] = "Required";
ElementFlags[ElementFlags["Optional"] = 2] = "Optional";
ElementFlags[ElementFlags["Rest"] = 4] = "Rest";
ElementFlags[ElementFlags["Variadic"] = 8] = "Variadic";
ElementFlags[ElementFlags["Fixed"] = 3] = "Fixed";
ElementFlags[ElementFlags["Variable"] = 12] = "Variable";
ElementFlags[ElementFlags["NonRequired"] = 14] = "NonRequired";
ElementFlags[ElementFlags["NonRest"] = 11] = "NonRest";
})(ElementFlags = ts.ElementFlags || (ts.ElementFlags = {}));
/* @internal */
var AccessFlags;
(function (AccessFlags) {
AccessFlags[AccessFlags["None"] = 0] = "None";
AccessFlags[AccessFlags["IncludeUndefined"] = 1] = "IncludeUndefined";
AccessFlags[AccessFlags["NoIndexSignatures"] = 2] = "NoIndexSignatures";
AccessFlags[AccessFlags["Writing"] = 4] = "Writing";
AccessFlags[AccessFlags["CacheSymbol"] = 8] = "CacheSymbol";
AccessFlags[AccessFlags["NoTupleBoundsCheck"] = 16] = "NoTupleBoundsCheck";
AccessFlags[AccessFlags["ExpressionPosition"] = 32] = "ExpressionPosition";
AccessFlags[AccessFlags["ReportDeprecated"] = 64] = "ReportDeprecated";
AccessFlags[AccessFlags["SuppressNoImplicitAnyError"] = 128] = "SuppressNoImplicitAnyError";
AccessFlags[AccessFlags["Contextual"] = 256] = "Contextual";
AccessFlags[AccessFlags["Persistent"] = 1] = "Persistent";
})(AccessFlags = ts.AccessFlags || (ts.AccessFlags = {}));
/* @internal */
var JsxReferenceKind;
(function (JsxReferenceKind) {
JsxReferenceKind[JsxReferenceKind["Component"] = 0] = "Component";
JsxReferenceKind[JsxReferenceKind["Function"] = 1] = "Function";
JsxReferenceKind[JsxReferenceKind["Mixed"] = 2] = "Mixed";
})(JsxReferenceKind = ts.JsxReferenceKind || (ts.JsxReferenceKind = {}));
var SignatureKind;
(function (SignatureKind) {
SignatureKind[SignatureKind["Call"] = 0] = "Call";
SignatureKind[SignatureKind["Construct"] = 1] = "Construct";
})(SignatureKind = ts.SignatureKind || (ts.SignatureKind = {}));
/* @internal */
var SignatureFlags;
(function (SignatureFlags) {
SignatureFlags[SignatureFlags["None"] = 0] = "None";
// Propagating flags
SignatureFlags[SignatureFlags["HasRestParameter"] = 1] = "HasRestParameter";
SignatureFlags[SignatureFlags["HasLiteralTypes"] = 2] = "HasLiteralTypes";
SignatureFlags[SignatureFlags["Abstract"] = 4] = "Abstract";
// Non-propagating flags
SignatureFlags[SignatureFlags["IsInnerCallChain"] = 8] = "IsInnerCallChain";
SignatureFlags[SignatureFlags["IsOuterCallChain"] = 16] = "IsOuterCallChain";
SignatureFlags[SignatureFlags["IsUntypedSignatureInJSFile"] = 32] = "IsUntypedSignatureInJSFile";
// We do not propagate `IsInnerCallChain` or `IsOuterCallChain` to instantiated signatures, as that would result in us
// attempting to add `| undefined` on each recursive call to `getReturnTypeOfSignature` when
// instantiating the return type.
SignatureFlags[SignatureFlags["PropagatingFlags"] = 39] = "PropagatingFlags";
SignatureFlags[SignatureFlags["CallChainFlags"] = 24] = "CallChainFlags";
})(SignatureFlags = ts.SignatureFlags || (ts.SignatureFlags = {}));
var IndexKind;
(function (IndexKind) {
IndexKind[IndexKind["String"] = 0] = "String";
IndexKind[IndexKind["Number"] = 1] = "Number";
})(IndexKind = ts.IndexKind || (ts.IndexKind = {}));
/* @internal */
var TypeMapKind;
(function (TypeMapKind) {
TypeMapKind[TypeMapKind["Simple"] = 0] = "Simple";
TypeMapKind[TypeMapKind["Array"] = 1] = "Array";
TypeMapKind[TypeMapKind["Function"] = 2] = "Function";
TypeMapKind[TypeMapKind["Composite"] = 3] = "Composite";
TypeMapKind[TypeMapKind["Merged"] = 4] = "Merged";
})(TypeMapKind = ts.TypeMapKind || (ts.TypeMapKind = {}));
var InferencePriority;
(function (InferencePriority) {
InferencePriority[InferencePriority["NakedTypeVariable"] = 1] = "NakedTypeVariable";
InferencePriority[InferencePriority["SpeculativeTuple"] = 2] = "SpeculativeTuple";
InferencePriority[InferencePriority["SubstituteSource"] = 4] = "SubstituteSource";
InferencePriority[InferencePriority["HomomorphicMappedType"] = 8] = "HomomorphicMappedType";
InferencePriority[InferencePriority["PartialHomomorphicMappedType"] = 16] = "PartialHomomorphicMappedType";
InferencePriority[InferencePriority["MappedTypeConstraint"] = 32] = "MappedTypeConstraint";
InferencePriority[InferencePriority["ContravariantConditional"] = 64] = "ContravariantConditional";
InferencePriority[InferencePriority["ReturnType"] = 128] = "ReturnType";
InferencePriority[InferencePriority["LiteralKeyof"] = 256] = "LiteralKeyof";
InferencePriority[InferencePriority["NoConstraints"] = 512] = "NoConstraints";
InferencePriority[InferencePriority["AlwaysStrict"] = 1024] = "AlwaysStrict";
InferencePriority[InferencePriority["MaxValue"] = 2048] = "MaxValue";
InferencePriority[InferencePriority["PriorityImpliesCombination"] = 416] = "PriorityImpliesCombination";
InferencePriority[InferencePriority["Circularity"] = -1] = "Circularity";
})(InferencePriority = ts.InferencePriority || (ts.InferencePriority = {}));
/* @internal */
var InferenceFlags;
(function (InferenceFlags) {
InferenceFlags[InferenceFlags["None"] = 0] = "None";
InferenceFlags[InferenceFlags["NoDefault"] = 1] = "NoDefault";
InferenceFlags[InferenceFlags["AnyDefault"] = 2] = "AnyDefault";
InferenceFlags[InferenceFlags["SkippedGenericFunction"] = 4] = "SkippedGenericFunction";
})(InferenceFlags = ts.InferenceFlags || (ts.InferenceFlags = {}));
/**
* Ternary values are defined such that
* x & y picks the lesser in the order False < Unknown < Maybe < True, and
* x | y picks the greater in the order False < Unknown < Maybe < True.
* Generally, Ternary.Maybe is used as the result of a relation that depends on itself, and
* Ternary.Unknown is used as the result of a variance check that depends on itself. We make
* a distinction because we don't want to cache circular variance check results.
*/
/* @internal */
var Ternary;
(function (Ternary) {
Ternary[Ternary["False"] = 0] = "False";
Ternary[Ternary["Unknown"] = 1] = "Unknown";
Ternary[Ternary["Maybe"] = 3] = "Maybe";
Ternary[Ternary["True"] = -1] = "True";
})(Ternary = ts.Ternary || (ts.Ternary = {}));
/* @internal */
var AssignmentDeclarationKind;
(function (AssignmentDeclarationKind) {
AssignmentDeclarationKind[AssignmentDeclarationKind["None"] = 0] = "None";
/// exports.name = expr
/// module.exports.name = expr
AssignmentDeclarationKind[AssignmentDeclarationKind["ExportsProperty"] = 1] = "ExportsProperty";
/// module.exports = expr
AssignmentDeclarationKind[AssignmentDeclarationKind["ModuleExports"] = 2] = "ModuleExports";
/// className.prototype.name = expr
AssignmentDeclarationKind[AssignmentDeclarationKind["PrototypeProperty"] = 3] = "PrototypeProperty";
/// this.name = expr
AssignmentDeclarationKind[AssignmentDeclarationKind["ThisProperty"] = 4] = "ThisProperty";
// F.name = expr
AssignmentDeclarationKind[AssignmentDeclarationKind["Property"] = 5] = "Property";
// F.prototype = { ... }
AssignmentDeclarationKind[AssignmentDeclarationKind["Prototype"] = 6] = "Prototype";
// Object.defineProperty(x, 'name', { value: any, writable?: boolean (false by default) });
// Object.defineProperty(x, 'name', { get: Function, set: Function });
// Object.defineProperty(x, 'name', { get: Function });
// Object.defineProperty(x, 'name', { set: Function });
AssignmentDeclarationKind[AssignmentDeclarationKind["ObjectDefinePropertyValue"] = 7] = "ObjectDefinePropertyValue";
// Object.defineProperty(exports || module.exports, 'name', ...);
AssignmentDeclarationKind[AssignmentDeclarationKind["ObjectDefinePropertyExports"] = 8] = "ObjectDefinePropertyExports";
// Object.defineProperty(Foo.prototype, 'name', ...);
AssignmentDeclarationKind[AssignmentDeclarationKind["ObjectDefinePrototypeProperty"] = 9] = "ObjectDefinePrototypeProperty";
})(AssignmentDeclarationKind = ts.AssignmentDeclarationKind || (ts.AssignmentDeclarationKind = {}));
var DiagnosticCategory;
(function (DiagnosticCategory) {
DiagnosticCategory[DiagnosticCategory["Warning"] = 0] = "Warning";
DiagnosticCategory[DiagnosticCategory["Error"] = 1] = "Error";
DiagnosticCategory[DiagnosticCategory["Suggestion"] = 2] = "Suggestion";
DiagnosticCategory[DiagnosticCategory["Message"] = 3] = "Message";
})(DiagnosticCategory = ts.DiagnosticCategory || (ts.DiagnosticCategory = {}));
/* @internal */
function diagnosticCategoryName(d, lowerCase) {
if (lowerCase === void 0) { lowerCase = true; }
var name = DiagnosticCategory[d.category];
return lowerCase ? name.toLowerCase() : name;
}
ts.diagnosticCategoryName = diagnosticCategoryName;
var ModuleResolutionKind;
(function (ModuleResolutionKind) {
ModuleResolutionKind[ModuleResolutionKind["Classic"] = 1] = "Classic";
ModuleResolutionKind[ModuleResolutionKind["NodeJs"] = 2] = "NodeJs";
})(ModuleResolutionKind = ts.ModuleResolutionKind || (ts.ModuleResolutionKind = {}));
var WatchFileKind;
(function (WatchFileKind) {
WatchFileKind[WatchFileKind["FixedPollingInterval"] = 0] = "FixedPollingInterval";
WatchFileKind[WatchFileKind["PriorityPollingInterval"] = 1] = "PriorityPollingInterval";
WatchFileKind[WatchFileKind["DynamicPriorityPolling"] = 2] = "DynamicPriorityPolling";
WatchFileKind[WatchFileKind["FixedChunkSizePolling"] = 3] = "FixedChunkSizePolling";
WatchFileKind[WatchFileKind["UseFsEvents"] = 4] = "UseFsEvents";
WatchFileKind[WatchFileKind["UseFsEventsOnParentDirectory"] = 5] = "UseFsEventsOnParentDirectory";
})(WatchFileKind = ts.WatchFileKind || (ts.WatchFileKind = {}));
var WatchDirectoryKind;
(function (WatchDirectoryKind) {
WatchDirectoryKind[WatchDirectoryKind["UseFsEvents"] = 0] = "UseFsEvents";
WatchDirectoryKind[WatchDirectoryKind["FixedPollingInterval"] = 1] = "FixedPollingInterval";
WatchDirectoryKind[WatchDirectoryKind["DynamicPriorityPolling"] = 2] = "DynamicPriorityPolling";
WatchDirectoryKind[WatchDirectoryKind["FixedChunkSizePolling"] = 3] = "FixedChunkSizePolling";
})(WatchDirectoryKind = ts.WatchDirectoryKind || (ts.WatchDirectoryKind = {}));
var PollingWatchKind;
(function (PollingWatchKind) {
PollingWatchKind[PollingWatchKind["FixedInterval"] = 0] = "FixedInterval";
PollingWatchKind[PollingWatchKind["PriorityInterval"] = 1] = "PriorityInterval";
PollingWatchKind[PollingWatchKind["DynamicPriority"] = 2] = "DynamicPriority";
PollingWatchKind[PollingWatchKind["FixedChunkSize"] = 3] = "FixedChunkSize";
})(PollingWatchKind = ts.PollingWatchKind || (ts.PollingWatchKind = {}));
var ModuleKind;
(function (ModuleKind) {
ModuleKind[ModuleKind["None"] = 0] = "None";
ModuleKind[ModuleKind["CommonJS"] = 1] = "CommonJS";
ModuleKind[ModuleKind["AMD"] = 2] = "AMD";
ModuleKind[ModuleKind["UMD"] = 3] = "UMD";
ModuleKind[ModuleKind["System"] = 4] = "System";
// NOTE: ES module kinds should be contiguous to more easily check whether a module kind is *any* ES module kind.
// Non-ES module kinds should not come between ES2015 (the earliest ES module kind) and ESNext (the last ES
// module kind).
ModuleKind[ModuleKind["ES2015"] = 5] = "ES2015";
ModuleKind[ModuleKind["ES2020"] = 6] = "ES2020";
ModuleKind[ModuleKind["ESNext"] = 99] = "ESNext";
})(ModuleKind = ts.ModuleKind || (ts.ModuleKind = {}));
var JsxEmit;
(function (JsxEmit) {
JsxEmit[JsxEmit["None"] = 0] = "None";
JsxEmit[JsxEmit["Preserve"] = 1] = "Preserve";
JsxEmit[JsxEmit["React"] = 2] = "React";
JsxEmit[JsxEmit["ReactNative"] = 3] = "ReactNative";
JsxEmit[JsxEmit["ReactJSX"] = 4] = "ReactJSX";
JsxEmit[JsxEmit["ReactJSXDev"] = 5] = "ReactJSXDev";
})(JsxEmit = ts.JsxEmit || (ts.JsxEmit = {}));
var ImportsNotUsedAsValues;
(function (ImportsNotUsedAsValues) {
ImportsNotUsedAsValues[ImportsNotUsedAsValues["Remove"] = 0] = "Remove";
ImportsNotUsedAsValues[ImportsNotUsedAsValues["Preserve"] = 1] = "Preserve";
ImportsNotUsedAsValues[ImportsNotUsedAsValues["Error"] = 2] = "Error";
})(ImportsNotUsedAsValues = ts.ImportsNotUsedAsValues || (ts.ImportsNotUsedAsValues = {}));
var NewLineKind;
(function (NewLineKind) {
NewLineKind[NewLineKind["CarriageReturnLineFeed"] = 0] = "CarriageReturnLineFeed";
NewLineKind[NewLineKind["LineFeed"] = 1] = "LineFeed";
})(NewLineKind = ts.NewLineKind || (ts.NewLineKind = {}));
var ScriptKind;
(function (ScriptKind) {
ScriptKind[ScriptKind["Unknown"] = 0] = "Unknown";
ScriptKind[ScriptKind["JS"] = 1] = "JS";
ScriptKind[ScriptKind["JSX"] = 2] = "JSX";
ScriptKind[ScriptKind["TS"] = 3] = "TS";
ScriptKind[ScriptKind["TSX"] = 4] = "TSX";
ScriptKind[ScriptKind["External"] = 5] = "External";
ScriptKind[ScriptKind["JSON"] = 6] = "JSON";
/**
* Used on extensions that doesn't define the ScriptKind but the content defines it.
* Deferred extensions are going to be included in all project contexts.
*/
ScriptKind[ScriptKind["Deferred"] = 7] = "Deferred";
})(ScriptKind = ts.ScriptKind || (ts.ScriptKind = {}));
var ScriptTarget;
(function (ScriptTarget) {
ScriptTarget[ScriptTarget["ES3"] = 0] = "ES3";
ScriptTarget[ScriptTarget["ES5"] = 1] = "ES5";
ScriptTarget[ScriptTarget["ES2015"] = 2] = "ES2015";
ScriptTarget[ScriptTarget["ES2016"] = 3] = "ES2016";
ScriptTarget[ScriptTarget["ES2017"] = 4] = "ES2017";
ScriptTarget[ScriptTarget["ES2018"] = 5] = "ES2018";
ScriptTarget[ScriptTarget["ES2019"] = 6] = "ES2019";
ScriptTarget[ScriptTarget["ES2020"] = 7] = "ES2020";
ScriptTarget[ScriptTarget["ES2021"] = 8] = "ES2021";
ScriptTarget[ScriptTarget["ESNext"] = 99] = "ESNext";
ScriptTarget[ScriptTarget["JSON"] = 100] = "JSON";
ScriptTarget[ScriptTarget["Latest"] = 99] = "Latest";
})(ScriptTarget = ts.ScriptTarget || (ts.ScriptTarget = {}));
var LanguageVariant;
(function (LanguageVariant) {
LanguageVariant[LanguageVariant["Standard"] = 0] = "Standard";
LanguageVariant[LanguageVariant["JSX"] = 1] = "JSX";
})(LanguageVariant = ts.LanguageVariant || (ts.LanguageVariant = {}));
var WatchDirectoryFlags;
(function (WatchDirectoryFlags) {
WatchDirectoryFlags[WatchDirectoryFlags["None"] = 0] = "None";
WatchDirectoryFlags[WatchDirectoryFlags["Recursive"] = 1] = "Recursive";
})(WatchDirectoryFlags = ts.WatchDirectoryFlags || (ts.WatchDirectoryFlags = {}));
/* @internal */
var CharacterCodes;
(function (CharacterCodes) {
CharacterCodes[CharacterCodes["nullCharacter"] = 0] = "nullCharacter";
CharacterCodes[CharacterCodes["maxAsciiCharacter"] = 127] = "maxAsciiCharacter";
CharacterCodes[CharacterCodes["lineFeed"] = 10] = "lineFeed";
CharacterCodes[CharacterCodes["carriageReturn"] = 13] = "carriageReturn";
CharacterCodes[CharacterCodes["lineSeparator"] = 8232] = "lineSeparator";
CharacterCodes[CharacterCodes["paragraphSeparator"] = 8233] = "paragraphSeparator";
CharacterCodes[CharacterCodes["nextLine"] = 133] = "nextLine";
// Unicode 3.0 space characters
CharacterCodes[CharacterCodes["space"] = 32] = "space";
CharacterCodes[CharacterCodes["nonBreakingSpace"] = 160] = "nonBreakingSpace";
CharacterCodes[CharacterCodes["enQuad"] = 8192] = "enQuad";
CharacterCodes[CharacterCodes["emQuad"] = 8193] = "emQuad";
CharacterCodes[CharacterCodes["enSpace"] = 8194] = "enSpace";
CharacterCodes[CharacterCodes["emSpace"] = 8195] = "emSpace";
CharacterCodes[CharacterCodes["threePerEmSpace"] = 8196] = "threePerEmSpace";
CharacterCodes[CharacterCodes["fourPerEmSpace"] = 8197] = "fourPerEmSpace";
CharacterCodes[CharacterCodes["sixPerEmSpace"] = 8198] = "sixPerEmSpace";
CharacterCodes[CharacterCodes["figureSpace"] = 8199] = "figureSpace";
CharacterCodes[CharacterCodes["punctuationSpace"] = 8200] = "punctuationSpace";
CharacterCodes[CharacterCodes["thinSpace"] = 8201] = "thinSpace";
CharacterCodes[CharacterCodes["hairSpace"] = 8202] = "hairSpace";
CharacterCodes[CharacterCodes["zeroWidthSpace"] = 8203] = "zeroWidthSpace";
CharacterCodes[CharacterCodes["narrowNoBreakSpace"] = 8239] = "narrowNoBreakSpace";
CharacterCodes[CharacterCodes["ideographicSpace"] = 12288] = "ideographicSpace";
CharacterCodes[CharacterCodes["mathematicalSpace"] = 8287] = "mathematicalSpace";
CharacterCodes[CharacterCodes["ogham"] = 5760] = "ogham";
CharacterCodes[CharacterCodes["_"] = 95] = "_";
CharacterCodes[CharacterCodes["$"] = 36] = "$";
CharacterCodes[CharacterCodes["_0"] = 48] = "_0";
CharacterCodes[CharacterCodes["_1"] = 49] = "_1";
CharacterCodes[CharacterCodes["_2"] = 50] = "_2";
CharacterCodes[CharacterCodes["_3"] = 51] = "_3";
CharacterCodes[CharacterCodes["_4"] = 52] = "_4";
CharacterCodes[CharacterCodes["_5"] = 53] = "_5";
CharacterCodes[CharacterCodes["_6"] = 54] = "_6";
CharacterCodes[CharacterCodes["_7"] = 55] = "_7";
CharacterCodes[CharacterCodes["_8"] = 56] = "_8";
CharacterCodes[CharacterCodes["_9"] = 57] = "_9";
CharacterCodes[CharacterCodes["a"] = 97] = "a";
CharacterCodes[CharacterCodes["b"] = 98] = "b";
CharacterCodes[CharacterCodes["c"] = 99] = "c";
CharacterCodes[CharacterCodes["d"] = 100] = "d";
CharacterCodes[CharacterCodes["e"] = 101] = "e";
CharacterCodes[CharacterCodes["f"] = 102] = "f";
CharacterCodes[CharacterCodes["g"] = 103] = "g";
CharacterCodes[CharacterCodes["h"] = 104] = "h";
CharacterCodes[CharacterCodes["i"] = 105] = "i";
CharacterCodes[CharacterCodes["j"] = 106] = "j";
CharacterCodes[CharacterCodes["k"] = 107] = "k";
CharacterCodes[CharacterCodes["l"] = 108] = "l";
CharacterCodes[CharacterCodes["m"] = 109] = "m";
CharacterCodes[CharacterCodes["n"] = 110] = "n";
CharacterCodes[CharacterCodes["o"] = 111] = "o";
CharacterCodes[CharacterCodes["p"] = 112] = "p";
CharacterCodes[CharacterCodes["q"] = 113] = "q";
CharacterCodes[CharacterCodes["r"] = 114] = "r";
CharacterCodes[CharacterCodes["s"] = 115] = "s";
CharacterCodes[CharacterCodes["t"] = 116] = "t";
CharacterCodes[CharacterCodes["u"] = 117] = "u";
CharacterCodes[CharacterCodes["v"] = 118] = "v";
CharacterCodes[CharacterCodes["w"] = 119] = "w";
CharacterCodes[CharacterCodes["x"] = 120] = "x";
CharacterCodes[CharacterCodes["y"] = 121] = "y";
CharacterCodes[CharacterCodes["z"] = 122] = "z";
CharacterCodes[CharacterCodes["A"] = 65] = "A";
CharacterCodes[CharacterCodes["B"] = 66] = "B";
CharacterCodes[CharacterCodes["C"] = 67] = "C";
CharacterCodes[CharacterCodes["D"] = 68] = "D";
CharacterCodes[CharacterCodes["E"] = 69] = "E";
CharacterCodes[CharacterCodes["F"] = 70] = "F";
CharacterCodes[CharacterCodes["G"] = 71] = "G";
CharacterCodes[CharacterCodes["H"] = 72] = "H";
CharacterCodes[CharacterCodes["I"] = 73] = "I";
CharacterCodes[CharacterCodes["J"] = 74] = "J";
CharacterCodes[CharacterCodes["K"] = 75] = "K";
CharacterCodes[CharacterCodes["L"] = 76] = "L";
CharacterCodes[CharacterCodes["M"] = 77] = "M";
CharacterCodes[CharacterCodes["N"] = 78] = "N";
CharacterCodes[CharacterCodes["O"] = 79] = "O";
CharacterCodes[CharacterCodes["P"] = 80] = "P";
CharacterCodes[CharacterCodes["Q"] = 81] = "Q";
CharacterCodes[CharacterCodes["R"] = 82] = "R";
CharacterCodes[CharacterCodes["S"] = 83] = "S";
CharacterCodes[CharacterCodes["T"] = 84] = "T";
CharacterCodes[CharacterCodes["U"] = 85] = "U";
CharacterCodes[CharacterCodes["V"] = 86] = "V";
CharacterCodes[CharacterCodes["W"] = 87] = "W";
CharacterCodes[CharacterCodes["X"] = 88] = "X";
CharacterCodes[CharacterCodes["Y"] = 89] = "Y";
CharacterCodes[CharacterCodes["Z"] = 90] = "Z";
CharacterCodes[CharacterCodes["ampersand"] = 38] = "ampersand";
CharacterCodes[CharacterCodes["asterisk"] = 42] = "asterisk";
CharacterCodes[CharacterCodes["at"] = 64] = "at";
CharacterCodes[CharacterCodes["backslash"] = 92] = "backslash";
CharacterCodes[CharacterCodes["backtick"] = 96] = "backtick";
CharacterCodes[CharacterCodes["bar"] = 124] = "bar";
CharacterCodes[CharacterCodes["caret"] = 94] = "caret";
CharacterCodes[CharacterCodes["closeBrace"] = 125] = "closeBrace";
CharacterCodes[CharacterCodes["closeBracket"] = 93] = "closeBracket";
CharacterCodes[CharacterCodes["closeParen"] = 41] = "closeParen";
CharacterCodes[CharacterCodes["colon"] = 58] = "colon";
CharacterCodes[CharacterCodes["comma"] = 44] = "comma";
CharacterCodes[CharacterCodes["dot"] = 46] = "dot";
CharacterCodes[CharacterCodes["doubleQuote"] = 34] = "doubleQuote";
CharacterCodes[CharacterCodes["equals"] = 61] = "equals";
CharacterCodes[CharacterCodes["exclamation"] = 33] = "exclamation";
CharacterCodes[CharacterCodes["greaterThan"] = 62] = "greaterThan";
CharacterCodes[CharacterCodes["hash"] = 35] = "hash";
CharacterCodes[CharacterCodes["lessThan"] = 60] = "lessThan";
CharacterCodes[CharacterCodes["minus"] = 45] = "minus";
CharacterCodes[CharacterCodes["openBrace"] = 123] = "openBrace";
CharacterCodes[CharacterCodes["openBracket"] = 91] = "openBracket";
CharacterCodes[CharacterCodes["openParen"] = 40] = "openParen";
CharacterCodes[CharacterCodes["percent"] = 37] = "percent";
CharacterCodes[CharacterCodes["plus"] = 43] = "plus";
CharacterCodes[CharacterCodes["question"] = 63] = "question";
CharacterCodes[CharacterCodes["semicolon"] = 59] = "semicolon";
CharacterCodes[CharacterCodes["singleQuote"] = 39] = "singleQuote";
CharacterCodes[CharacterCodes["slash"] = 47] = "slash";
CharacterCodes[CharacterCodes["tilde"] = 126] = "tilde";
CharacterCodes[CharacterCodes["backspace"] = 8] = "backspace";
CharacterCodes[CharacterCodes["formFeed"] = 12] = "formFeed";
CharacterCodes[CharacterCodes["byteOrderMark"] = 65279] = "byteOrderMark";
CharacterCodes[CharacterCodes["tab"] = 9] = "tab";
CharacterCodes[CharacterCodes["verticalTab"] = 11] = "verticalTab";
})(CharacterCodes = ts.CharacterCodes || (ts.CharacterCodes = {}));
var Extension;
(function (Extension) {
Extension["Ts"] = ".ts";
Extension["Tsx"] = ".tsx";
Extension["Dts"] = ".d.ts";
Extension["Js"] = ".js";
Extension["Jsx"] = ".jsx";
Extension["Json"] = ".json";
Extension["TsBuildInfo"] = ".tsbuildinfo";
})(Extension = ts.Extension || (ts.Extension = {}));
/* @internal */
var TransformFlags;
(function (TransformFlags) {
TransformFlags[TransformFlags["None"] = 0] = "None";
// Facts
// - Flags used to indicate that a node or subtree contains syntax that requires transformation.
TransformFlags[TransformFlags["ContainsTypeScript"] = 1] = "ContainsTypeScript";
TransformFlags[TransformFlags["ContainsJsx"] = 2] = "ContainsJsx";
TransformFlags[TransformFlags["ContainsESNext"] = 4] = "ContainsESNext";
TransformFlags[TransformFlags["ContainsES2021"] = 8] = "ContainsES2021";
TransformFlags[TransformFlags["ContainsES2020"] = 16] = "ContainsES2020";
TransformFlags[TransformFlags["ContainsES2019"] = 32] = "ContainsES2019";
TransformFlags[TransformFlags["ContainsES2018"] = 64] = "ContainsES2018";
TransformFlags[TransformFlags["ContainsES2017"] = 128] = "ContainsES2017";
TransformFlags[TransformFlags["ContainsES2016"] = 256] = "ContainsES2016";
TransformFlags[TransformFlags["ContainsES2015"] = 512] = "ContainsES2015";
TransformFlags[TransformFlags["ContainsGenerator"] = 1024] = "ContainsGenerator";
TransformFlags[TransformFlags["ContainsDestructuringAssignment"] = 2048] = "ContainsDestructuringAssignment";
// Markers
// - Flags used to indicate that a subtree contains a specific transformation.
TransformFlags[TransformFlags["ContainsTypeScriptClassSyntax"] = 4096] = "ContainsTypeScriptClassSyntax";
TransformFlags[TransformFlags["ContainsLexicalThis"] = 8192] = "ContainsLexicalThis";
TransformFlags[TransformFlags["ContainsRestOrSpread"] = 16384] = "ContainsRestOrSpread";
TransformFlags[TransformFlags["ContainsObjectRestOrSpread"] = 32768] = "ContainsObjectRestOrSpread";
TransformFlags[TransformFlags["ContainsComputedPropertyName"] = 65536] = "ContainsComputedPropertyName";
TransformFlags[TransformFlags["ContainsBlockScopedBinding"] = 131072] = "ContainsBlockScopedBinding";
TransformFlags[TransformFlags["ContainsBindingPattern"] = 262144] = "ContainsBindingPattern";
TransformFlags[TransformFlags["ContainsYield"] = 524288] = "ContainsYield";
TransformFlags[TransformFlags["ContainsAwait"] = 1048576] = "ContainsAwait";
TransformFlags[TransformFlags["ContainsHoistedDeclarationOrCompletion"] = 2097152] = "ContainsHoistedDeclarationOrCompletion";
TransformFlags[TransformFlags["ContainsDynamicImport"] = 4194304] = "ContainsDynamicImport";
TransformFlags[TransformFlags["ContainsClassFields"] = 8388608] = "ContainsClassFields";
TransformFlags[TransformFlags["ContainsPossibleTopLevelAwait"] = 16777216] = "ContainsPossibleTopLevelAwait";
TransformFlags[TransformFlags["ContainsLexicalSuper"] = 33554432] = "ContainsLexicalSuper";
TransformFlags[TransformFlags["ContainsUpdateExpressionForIdentifier"] = 67108864] = "ContainsUpdateExpressionForIdentifier";
// Please leave this as 1 << 29.
// It is the maximum bit we can set before we outgrow the size of a v8 small integer (SMI) on an x86 system.
// It is a good reminder of how much room we have left
TransformFlags[TransformFlags["HasComputedFlags"] = 536870912] = "HasComputedFlags";
// Assertions
// - Bitmasks that are used to assert facts about the syntax of a node and its subtree.
TransformFlags[TransformFlags["AssertTypeScript"] = 1] = "AssertTypeScript";
TransformFlags[TransformFlags["AssertJsx"] = 2] = "AssertJsx";
TransformFlags[TransformFlags["AssertESNext"] = 4] = "AssertESNext";
TransformFlags[TransformFlags["AssertES2021"] = 8] = "AssertES2021";
TransformFlags[TransformFlags["AssertES2020"] = 16] = "AssertES2020";
TransformFlags[TransformFlags["AssertES2019"] = 32] = "AssertES2019";
TransformFlags[TransformFlags["AssertES2018"] = 64] = "AssertES2018";
TransformFlags[TransformFlags["AssertES2017"] = 128] = "AssertES2017";
TransformFlags[TransformFlags["AssertES2016"] = 256] = "AssertES2016";
TransformFlags[TransformFlags["AssertES2015"] = 512] = "AssertES2015";
TransformFlags[TransformFlags["AssertGenerator"] = 1024] = "AssertGenerator";
TransformFlags[TransformFlags["AssertDestructuringAssignment"] = 2048] = "AssertDestructuringAssignment";
// Scope Exclusions
// - Bitmasks that exclude flags from propagating out of a specific context
// into the subtree flags of their container.
TransformFlags[TransformFlags["OuterExpressionExcludes"] = 536870912] = "OuterExpressionExcludes";
TransformFlags[TransformFlags["PropertyAccessExcludes"] = 536870912] = "PropertyAccessExcludes";
TransformFlags[TransformFlags["NodeExcludes"] = 536870912] = "NodeExcludes";
TransformFlags[TransformFlags["ArrowFunctionExcludes"] = 557748224] = "ArrowFunctionExcludes";
TransformFlags[TransformFlags["FunctionExcludes"] = 591310848] = "FunctionExcludes";
TransformFlags[TransformFlags["ConstructorExcludes"] = 591306752] = "ConstructorExcludes";
TransformFlags[TransformFlags["MethodOrAccessorExcludes"] = 574529536] = "MethodOrAccessorExcludes";
TransformFlags[TransformFlags["PropertyExcludes"] = 570433536] = "PropertyExcludes";
TransformFlags[TransformFlags["ClassExcludes"] = 536940544] = "ClassExcludes";
TransformFlags[TransformFlags["ModuleExcludes"] = 589443072] = "ModuleExcludes";
TransformFlags[TransformFlags["TypeExcludes"] = -2] = "TypeExcludes";
TransformFlags[TransformFlags["ObjectLiteralExcludes"] = 536973312] = "ObjectLiteralExcludes";
TransformFlags[TransformFlags["ArrayLiteralOrCallOrNewExcludes"] = 536887296] = "ArrayLiteralOrCallOrNewExcludes";
TransformFlags[TransformFlags["VariableDeclarationListExcludes"] = 537165824] = "VariableDeclarationListExcludes";
TransformFlags[TransformFlags["ParameterExcludes"] = 536870912] = "ParameterExcludes";
TransformFlags[TransformFlags["CatchClauseExcludes"] = 536903680] = "CatchClauseExcludes";
TransformFlags[TransformFlags["BindingPatternExcludes"] = 536887296] = "BindingPatternExcludes";
TransformFlags[TransformFlags["ContainsLexicalThisOrSuper"] = 33562624] = "ContainsLexicalThisOrSuper";
// Propagating flags
// - Bitmasks for flags that should propagate from a child
TransformFlags[TransformFlags["PropertyNamePropagatingFlags"] = 33562624] = "PropertyNamePropagatingFlags";
// Masks
// - Additional bitmasks
})(TransformFlags = ts.TransformFlags || (ts.TransformFlags = {}));
var EmitFlags;
(function (EmitFlags) {
EmitFlags[EmitFlags["None"] = 0] = "None";
EmitFlags[EmitFlags["SingleLine"] = 1] = "SingleLine";
EmitFlags[EmitFlags["AdviseOnEmitNode"] = 2] = "AdviseOnEmitNode";
EmitFlags[EmitFlags["NoSubstitution"] = 4] = "NoSubstitution";
EmitFlags[EmitFlags["CapturesThis"] = 8] = "CapturesThis";
EmitFlags[EmitFlags["NoLeadingSourceMap"] = 16] = "NoLeadingSourceMap";
EmitFlags[EmitFlags["NoTrailingSourceMap"] = 32] = "NoTrailingSourceMap";
EmitFlags[EmitFlags["NoSourceMap"] = 48] = "NoSourceMap";
EmitFlags[EmitFlags["NoNestedSourceMaps"] = 64] = "NoNestedSourceMaps";
EmitFlags[EmitFlags["NoTokenLeadingSourceMaps"] = 128] = "NoTokenLeadingSourceMaps";
EmitFlags[EmitFlags["NoTokenTrailingSourceMaps"] = 256] = "NoTokenTrailingSourceMaps";
EmitFlags[EmitFlags["NoTokenSourceMaps"] = 384] = "NoTokenSourceMaps";
EmitFlags[EmitFlags["NoLeadingComments"] = 512] = "NoLeadingComments";
EmitFlags[EmitFlags["NoTrailingComments"] = 1024] = "NoTrailingComments";
EmitFlags[EmitFlags["NoComments"] = 1536] = "NoComments";
EmitFlags[EmitFlags["NoNestedComments"] = 2048] = "NoNestedComments";
EmitFlags[EmitFlags["HelperName"] = 4096] = "HelperName";
EmitFlags[EmitFlags["ExportName"] = 8192] = "ExportName";
EmitFlags[EmitFlags["LocalName"] = 16384] = "LocalName";
EmitFlags[EmitFlags["InternalName"] = 32768] = "InternalName";
EmitFlags[EmitFlags["Indented"] = 65536] = "Indented";
EmitFlags[EmitFlags["NoIndentation"] = 131072] = "NoIndentation";
EmitFlags[EmitFlags["AsyncFunctionBody"] = 262144] = "AsyncFunctionBody";
EmitFlags[EmitFlags["ReuseTempVariableScope"] = 524288] = "ReuseTempVariableScope";
EmitFlags[EmitFlags["CustomPrologue"] = 1048576] = "CustomPrologue";
EmitFlags[EmitFlags["NoHoisting"] = 2097152] = "NoHoisting";
EmitFlags[EmitFlags["HasEndOfDeclarationMarker"] = 4194304] = "HasEndOfDeclarationMarker";
EmitFlags[EmitFlags["Iterator"] = 8388608] = "Iterator";
EmitFlags[EmitFlags["NoAsciiEscaping"] = 16777216] = "NoAsciiEscaping";
/*@internal*/ EmitFlags[EmitFlags["TypeScriptClassWrapper"] = 33554432] = "TypeScriptClassWrapper";
/*@internal*/ EmitFlags[EmitFlags["NeverApplyImportHelper"] = 67108864] = "NeverApplyImportHelper";
/*@internal*/ EmitFlags[EmitFlags["IgnoreSourceNewlines"] = 134217728] = "IgnoreSourceNewlines";
/*@internal*/ EmitFlags[EmitFlags["Immutable"] = 268435456] = "Immutable";
/*@internal*/ EmitFlags[EmitFlags["IndirectCall"] = 536870912] = "IndirectCall";
})(EmitFlags = ts.EmitFlags || (ts.EmitFlags = {}));
/**
* Used by the checker, this enum keeps track of external emit helpers that should be type
* checked.
*/
/* @internal */
var ExternalEmitHelpers;
(function (ExternalEmitHelpers) {
ExternalEmitHelpers[ExternalEmitHelpers["Extends"] = 1] = "Extends";
ExternalEmitHelpers[ExternalEmitHelpers["Assign"] = 2] = "Assign";
ExternalEmitHelpers[ExternalEmitHelpers["Rest"] = 4] = "Rest";
ExternalEmitHelpers[ExternalEmitHelpers["Decorate"] = 8] = "Decorate";
ExternalEmitHelpers[ExternalEmitHelpers["Metadata"] = 16] = "Metadata";
ExternalEmitHelpers[ExternalEmitHelpers["Param"] = 32] = "Param";
ExternalEmitHelpers[ExternalEmitHelpers["Awaiter"] = 64] = "Awaiter";
ExternalEmitHelpers[ExternalEmitHelpers["Generator"] = 128] = "Generator";
ExternalEmitHelpers[ExternalEmitHelpers["Values"] = 256] = "Values";
ExternalEmitHelpers[ExternalEmitHelpers["Read"] = 512] = "Read";
ExternalEmitHelpers[ExternalEmitHelpers["SpreadArray"] = 1024] = "SpreadArray";
ExternalEmitHelpers[ExternalEmitHelpers["Await"] = 2048] = "Await";
ExternalEmitHelpers[ExternalEmitHelpers["AsyncGenerator"] = 4096] = "AsyncGenerator";
ExternalEmitHelpers[ExternalEmitHelpers["AsyncDelegator"] = 8192] = "AsyncDelegator";
ExternalEmitHelpers[ExternalEmitHelpers["AsyncValues"] = 16384] = "AsyncValues";
ExternalEmitHelpers[ExternalEmitHelpers["ExportStar"] = 32768] = "ExportStar";
ExternalEmitHelpers[ExternalEmitHelpers["ImportStar"] = 65536] = "ImportStar";
ExternalEmitHelpers[ExternalEmitHelpers["ImportDefault"] = 131072] = "ImportDefault";
ExternalEmitHelpers[ExternalEmitHelpers["MakeTemplateObject"] = 262144] = "MakeTemplateObject";
ExternalEmitHelpers[ExternalEmitHelpers["ClassPrivateFieldGet"] = 524288] = "ClassPrivateFieldGet";
ExternalEmitHelpers[ExternalEmitHelpers["ClassPrivateFieldSet"] = 1048576] = "ClassPrivateFieldSet";
ExternalEmitHelpers[ExternalEmitHelpers["CreateBinding"] = 2097152] = "CreateBinding";
ExternalEmitHelpers[ExternalEmitHelpers["FirstEmitHelper"] = 1] = "FirstEmitHelper";
ExternalEmitHelpers[ExternalEmitHelpers["LastEmitHelper"] = 2097152] = "LastEmitHelper";
// Helpers included by ES2015 for..of
ExternalEmitHelpers[ExternalEmitHelpers["ForOfIncludes"] = 256] = "ForOfIncludes";
// Helpers included by ES2017 for..await..of
ExternalEmitHelpers[ExternalEmitHelpers["ForAwaitOfIncludes"] = 16384] = "ForAwaitOfIncludes";
// Helpers included by ES2017 async generators
ExternalEmitHelpers[ExternalEmitHelpers["AsyncGeneratorIncludes"] = 6144] = "AsyncGeneratorIncludes";
// Helpers included by yield* in ES2017 async generators
ExternalEmitHelpers[ExternalEmitHelpers["AsyncDelegatorIncludes"] = 26624] = "AsyncDelegatorIncludes";
// Helpers included by ES2015 spread
ExternalEmitHelpers[ExternalEmitHelpers["SpreadIncludes"] = 1536] = "SpreadIncludes";
})(ExternalEmitHelpers = ts.ExternalEmitHelpers || (ts.ExternalEmitHelpers = {}));
var EmitHint;
(function (EmitHint) {
EmitHint[EmitHint["SourceFile"] = 0] = "SourceFile";
EmitHint[EmitHint["Expression"] = 1] = "Expression";
EmitHint[EmitHint["IdentifierName"] = 2] = "IdentifierName";
EmitHint[EmitHint["MappedTypeParameter"] = 3] = "MappedTypeParameter";
EmitHint[EmitHint["Unspecified"] = 4] = "Unspecified";
EmitHint[EmitHint["EmbeddedStatement"] = 5] = "EmbeddedStatement";
EmitHint[EmitHint["JsxAttributeValue"] = 6] = "JsxAttributeValue";
})(EmitHint = ts.EmitHint || (ts.EmitHint = {}));
var OuterExpressionKinds;
(function (OuterExpressionKinds) {
OuterExpressionKinds[OuterExpressionKinds["Parentheses"] = 1] = "Parentheses";
OuterExpressionKinds[OuterExpressionKinds["TypeAssertions"] = 2] = "TypeAssertions";
OuterExpressionKinds[OuterExpressionKinds["NonNullAssertions"] = 4] = "NonNullAssertions";
OuterExpressionKinds[OuterExpressionKinds["PartiallyEmittedExpressions"] = 8] = "PartiallyEmittedExpressions";
OuterExpressionKinds[OuterExpressionKinds["Assertions"] = 6] = "Assertions";
OuterExpressionKinds[OuterExpressionKinds["All"] = 15] = "All";
})(OuterExpressionKinds = ts.OuterExpressionKinds || (ts.OuterExpressionKinds = {}));
/* @internal */
var LexicalEnvironmentFlags;
(function (LexicalEnvironmentFlags) {
LexicalEnvironmentFlags[LexicalEnvironmentFlags["None"] = 0] = "None";
LexicalEnvironmentFlags[LexicalEnvironmentFlags["InParameters"] = 1] = "InParameters";
LexicalEnvironmentFlags[LexicalEnvironmentFlags["VariablesHoistedInParameters"] = 2] = "VariablesHoistedInParameters"; // a temp variable was hoisted while visiting a parameter list
})(LexicalEnvironmentFlags = ts.LexicalEnvironmentFlags || (ts.LexicalEnvironmentFlags = {}));
/*@internal*/
var BundleFileSectionKind;
(function (BundleFileSectionKind) {
BundleFileSectionKind["Prologue"] = "prologue";
BundleFileSectionKind["EmitHelpers"] = "emitHelpers";
BundleFileSectionKind["NoDefaultLib"] = "no-default-lib";
BundleFileSectionKind["Reference"] = "reference";
BundleFileSectionKind["Type"] = "type";
BundleFileSectionKind["Lib"] = "lib";
BundleFileSectionKind["Prepend"] = "prepend";
BundleFileSectionKind["Text"] = "text";
BundleFileSectionKind["Internal"] = "internal";
// comments?
})(BundleFileSectionKind = ts.BundleFileSectionKind || (ts.BundleFileSectionKind = {}));
var ListFormat;
(function (ListFormat) {
ListFormat[ListFormat["None"] = 0] = "None";
// Line separators
ListFormat[ListFormat["SingleLine"] = 0] = "SingleLine";
ListFormat[ListFormat["MultiLine"] = 1] = "MultiLine";
ListFormat[ListFormat["PreserveLines"] = 2] = "PreserveLines";
ListFormat[ListFormat["LinesMask"] = 3] = "LinesMask";
// Delimiters
ListFormat[ListFormat["NotDelimited"] = 0] = "NotDelimited";
ListFormat[ListFormat["BarDelimited"] = 4] = "BarDelimited";
ListFormat[ListFormat["AmpersandDelimited"] = 8] = "AmpersandDelimited";
ListFormat[ListFormat["CommaDelimited"] = 16] = "CommaDelimited";
ListFormat[ListFormat["AsteriskDelimited"] = 32] = "AsteriskDelimited";
ListFormat[ListFormat["DelimitersMask"] = 60] = "DelimitersMask";
ListFormat[ListFormat["AllowTrailingComma"] = 64] = "AllowTrailingComma";
// Whitespace
ListFormat[ListFormat["Indented"] = 128] = "Indented";
ListFormat[ListFormat["SpaceBetweenBraces"] = 256] = "SpaceBetweenBraces";
ListFormat[ListFormat["SpaceBetweenSiblings"] = 512] = "SpaceBetweenSiblings";
// Brackets/Braces
ListFormat[ListFormat["Braces"] = 1024] = "Braces";
ListFormat[ListFormat["Parenthesis"] = 2048] = "Parenthesis";
ListFormat[ListFormat["AngleBrackets"] = 4096] = "AngleBrackets";
ListFormat[ListFormat["SquareBrackets"] = 8192] = "SquareBrackets";
ListFormat[ListFormat["BracketsMask"] = 15360] = "BracketsMask";
ListFormat[ListFormat["OptionalIfUndefined"] = 16384] = "OptionalIfUndefined";
ListFormat[ListFormat["OptionalIfEmpty"] = 32768] = "OptionalIfEmpty";
ListFormat[ListFormat["Optional"] = 49152] = "Optional";
// Other
ListFormat[ListFormat["PreferNewLine"] = 65536] = "PreferNewLine";
ListFormat[ListFormat["NoTrailingNewLine"] = 131072] = "NoTrailingNewLine";
ListFormat[ListFormat["NoInterveningComments"] = 262144] = "NoInterveningComments";
ListFormat[ListFormat["NoSpaceIfEmpty"] = 524288] = "NoSpaceIfEmpty";
ListFormat[ListFormat["SingleElement"] = 1048576] = "SingleElement";
ListFormat[ListFormat["SpaceAfterList"] = 2097152] = "SpaceAfterList";
// Precomputed Formats
ListFormat[ListFormat["Modifiers"] = 262656] = "Modifiers";
ListFormat[ListFormat["HeritageClauses"] = 512] = "HeritageClauses";
ListFormat[ListFormat["SingleLineTypeLiteralMembers"] = 768] = "SingleLineTypeLiteralMembers";
ListFormat[ListFormat["MultiLineTypeLiteralMembers"] = 32897] = "MultiLineTypeLiteralMembers";
ListFormat[ListFormat["SingleLineTupleTypeElements"] = 528] = "SingleLineTupleTypeElements";
ListFormat[ListFormat["MultiLineTupleTypeElements"] = 657] = "MultiLineTupleTypeElements";
ListFormat[ListFormat["UnionTypeConstituents"] = 516] = "UnionTypeConstituents";
ListFormat[ListFormat["IntersectionTypeConstituents"] = 520] = "IntersectionTypeConstituents";
ListFormat[ListFormat["ObjectBindingPatternElements"] = 525136] = "ObjectBindingPatternElements";
ListFormat[ListFormat["ArrayBindingPatternElements"] = 524880] = "ArrayBindingPatternElements";
ListFormat[ListFormat["ObjectLiteralExpressionProperties"] = 526226] = "ObjectLiteralExpressionProperties";
ListFormat[ListFormat["ArrayLiteralExpressionElements"] = 8914] = "ArrayLiteralExpressionElements";
ListFormat[ListFormat["CommaListElements"] = 528] = "CommaListElements";
ListFormat[ListFormat["CallExpressionArguments"] = 2576] = "CallExpressionArguments";
ListFormat[ListFormat["NewExpressionArguments"] = 18960] = "NewExpressionArguments";
ListFormat[ListFormat["TemplateExpressionSpans"] = 262144] = "TemplateExpressionSpans";
ListFormat[ListFormat["SingleLineBlockStatements"] = 768] = "SingleLineBlockStatements";
ListFormat[ListFormat["MultiLineBlockStatements"] = 129] = "MultiLineBlockStatements";
ListFormat[ListFormat["VariableDeclarationList"] = 528] = "VariableDeclarationList";
ListFormat[ListFormat["SingleLineFunctionBodyStatements"] = 768] = "SingleLineFunctionBodyStatements";
ListFormat[ListFormat["MultiLineFunctionBodyStatements"] = 1] = "MultiLineFunctionBodyStatements";
ListFormat[ListFormat["ClassHeritageClauses"] = 0] = "ClassHeritageClauses";
ListFormat[ListFormat["ClassMembers"] = 129] = "ClassMembers";
ListFormat[ListFormat["InterfaceMembers"] = 129] = "InterfaceMembers";
ListFormat[ListFormat["EnumMembers"] = 145] = "EnumMembers";
ListFormat[ListFormat["CaseBlockClauses"] = 129] = "CaseBlockClauses";
ListFormat[ListFormat["NamedImportsOrExportsElements"] = 525136] = "NamedImportsOrExportsElements";
ListFormat[ListFormat["JsxElementOrFragmentChildren"] = 262144] = "JsxElementOrFragmentChildren";
ListFormat[ListFormat["JsxElementAttributes"] = 262656] = "JsxElementAttributes";
ListFormat[ListFormat["CaseOrDefaultClauseStatements"] = 163969] = "CaseOrDefaultClauseStatements";
ListFormat[ListFormat["HeritageClauseTypes"] = 528] = "HeritageClauseTypes";
ListFormat[ListFormat["SourceFileStatements"] = 131073] = "SourceFileStatements";
ListFormat[ListFormat["Decorators"] = 2146305] = "Decorators";
ListFormat[ListFormat["TypeArguments"] = 53776] = "TypeArguments";
ListFormat[ListFormat["TypeParameters"] = 53776] = "TypeParameters";
ListFormat[ListFormat["Parameters"] = 2576] = "Parameters";
ListFormat[ListFormat["IndexSignatureParameters"] = 8848] = "IndexSignatureParameters";
ListFormat[ListFormat["JSDocComment"] = 33] = "JSDocComment";
})(ListFormat = ts.ListFormat || (ts.ListFormat = {}));
/* @internal */
var PragmaKindFlags;
(function (PragmaKindFlags) {
PragmaKindFlags[PragmaKindFlags["None"] = 0] = "None";
/**
* Triple slash comment of the form
* /// <pragma-name argname="value" />
*/
PragmaKindFlags[PragmaKindFlags["TripleSlashXML"] = 1] = "TripleSlashXML";
/**
* Single line comment of the form
* // @pragma-name argval1 argval2
* or
* /// @pragma-name argval1 argval2
*/
PragmaKindFlags[PragmaKindFlags["SingleLine"] = 2] = "SingleLine";
/**
* Multiline non-jsdoc pragma of the form
* /* @pragma-name argval1 argval2 * /
*/
PragmaKindFlags[PragmaKindFlags["MultiLine"] = 4] = "MultiLine";
PragmaKindFlags[PragmaKindFlags["All"] = 7] = "All";
PragmaKindFlags[PragmaKindFlags["Default"] = 7] = "Default";
})(PragmaKindFlags = ts.PragmaKindFlags || (ts.PragmaKindFlags = {}));
// While not strictly a type, this is here because `PragmaMap` needs to be here to be used with `SourceFile`, and we don't
// fancy effectively defining it twice, once in value-space and once in type-space
/* @internal */
ts.commentPragmas = {
"reference": {
args: [
{ name: "types", optional: true, captureSpan: true },
{ name: "lib", optional: true, captureSpan: true },
{ name: "path", optional: true, captureSpan: true },
{ name: "no-default-lib", optional: true }
],
kind: 1 /* TripleSlashXML */
},
"amd-dependency": {
args: [{ name: "path" }, { name: "name", optional: true }],
kind: 1 /* TripleSlashXML */
},
"amd-module": {
args: [{ name: "name" }],
kind: 1 /* TripleSlashXML */
},
"ts-check": {
kind: 2 /* SingleLine */
},
"ts-nocheck": {
kind: 2 /* SingleLine */
},
"jsx": {
args: [{ name: "factory" }],
kind: 4 /* MultiLine */
},
"jsxfrag": {
args: [{ name: "factory" }],
kind: 4 /* MultiLine */
},
"jsximportsource": {
args: [{ name: "factory" }],
kind: 4 /* MultiLine */
},
"jsxruntime": {
args: [{ name: "factory" }],
kind: 4 /* MultiLine */
},
};
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
/**
* Internally, we represent paths as strings with '/' as the directory separator.
* When we make system calls (eg: LanguageServiceHost.getDirectory()),
* we expect the host to correctly handle paths in our specified format.
*/
ts.directorySeparator = "/";
ts.altDirectorySeparator = "\\";
var urlSchemeSeparator = "://";
var backslashRegExp = /\\/g;
//// Path Tests
/**
* Determines whether a charCode corresponds to `/` or `\`.
*/
function isAnyDirectorySeparator(charCode) {
return charCode === 47 /* slash */ || charCode === 92 /* backslash */;
}
ts.isAnyDirectorySeparator = isAnyDirectorySeparator;
/**
* Determines whether a path starts with a URL scheme (e.g. starts with `http://`, `ftp://`, `file://`, etc.).
*/
function isUrl(path) {
return getEncodedRootLength(path) < 0;
}
ts.isUrl = isUrl;
/**
* Determines whether a path is an absolute disk path (e.g. starts with `/`, or a dos path
* like `c:`, `c:\` or `c:/`).
*/
function isRootedDiskPath(path) {
return getEncodedRootLength(path) > 0;
}
ts.isRootedDiskPath = isRootedDiskPath;
/**
* Determines whether a path consists only of a path root.
*/
function isDiskPathRoot(path) {
var rootLength = getEncodedRootLength(path);
return rootLength > 0 && rootLength === path.length;
}
ts.isDiskPathRoot = isDiskPathRoot;
/**
* Determines whether a path starts with an absolute path component (i.e. `/`, `c:/`, `file://`, etc.).
*
* ```ts
* // POSIX
* pathIsAbsolute("/path/to/file.ext") === true
* // DOS
* pathIsAbsolute("c:/path/to/file.ext") === true
* // URL
* pathIsAbsolute("file:///path/to/file.ext") === true
* // Non-absolute
* pathIsAbsolute("path/to/file.ext") === false
* pathIsAbsolute("./path/to/file.ext") === false
* ```
*/
function pathIsAbsolute(path) {
return getEncodedRootLength(path) !== 0;
}
ts.pathIsAbsolute = pathIsAbsolute;
/**
* Determines whether a path starts with a relative path component (i.e. `.` or `..`).
*/
function pathIsRelative(path) {
return /^\.\.?($|[\\/])/.test(path);
}
ts.pathIsRelative = pathIsRelative;
/**
* Determines whether a path is neither relative nor absolute, e.g. "path/to/file".
* Also known misleadingly as "non-relative".
*/
function pathIsBareSpecifier(path) {
return !pathIsAbsolute(path) && !pathIsRelative(path);
}
ts.pathIsBareSpecifier = pathIsBareSpecifier;
function hasExtension(fileName) {
return ts.stringContains(getBaseFileName(fileName), ".");
}
ts.hasExtension = hasExtension;
function fileExtensionIs(path, extension) {
return path.length > extension.length && ts.endsWith(path, extension);
}
ts.fileExtensionIs = fileExtensionIs;
function fileExtensionIsOneOf(path, extensions) {
for (var _i = 0, extensions_1 = extensions; _i < extensions_1.length; _i++) {
var extension = extensions_1[_i];
if (fileExtensionIs(path, extension)) {
return true;
}
}
return false;
}
ts.fileExtensionIsOneOf = fileExtensionIsOneOf;
/**
* Determines whether a path has a trailing separator (`/` or `\\`).
*/
function hasTrailingDirectorySeparator(path) {
return path.length > 0 && isAnyDirectorySeparator(path.charCodeAt(path.length - 1));
}
ts.hasTrailingDirectorySeparator = hasTrailingDirectorySeparator;
//// Path Parsing
function isVolumeCharacter(charCode) {
return (charCode >= 97 /* a */ && charCode <= 122 /* z */) ||
(charCode >= 65 /* A */ && charCode <= 90 /* Z */);
}
function getFileUrlVolumeSeparatorEnd(url, start) {
var ch0 = url.charCodeAt(start);
if (ch0 === 58 /* colon */)
return start + 1;
if (ch0 === 37 /* percent */ && url.charCodeAt(start + 1) === 51 /* _3 */) {
var ch2 = url.charCodeAt(start + 2);
if (ch2 === 97 /* a */ || ch2 === 65 /* A */)
return start + 3;
}
return -1;
}
/**
* Returns length of the root part of a path or URL (i.e. length of "/", "x:/", "//server/share/, file:///user/files").
* If the root is part of a URL, the twos-complement of the root length is returned.
*/
function getEncodedRootLength(path) {
if (!path)
return 0;
var ch0 = path.charCodeAt(0);
// POSIX or UNC
if (ch0 === 47 /* slash */ || ch0 === 92 /* backslash */) {
if (path.charCodeAt(1) !== ch0)
return 1; // POSIX: "/" (or non-normalized "\")
var p1 = path.indexOf(ch0 === 47 /* slash */ ? ts.directorySeparator : ts.altDirectorySeparator, 2);
if (p1 < 0)
return path.length; // UNC: "//server" or "\\server"
return p1 + 1; // UNC: "//server/" or "\\server\"
}
// DOS
if (isVolumeCharacter(ch0) && path.charCodeAt(1) === 58 /* colon */) {
var ch2 = path.charCodeAt(2);
if (ch2 === 47 /* slash */ || ch2 === 92 /* backslash */)
return 3; // DOS: "c:/" or "c:\"
if (path.length === 2)
return 2; // DOS: "c:" (but not "c:d")
}
// URL
var schemeEnd = path.indexOf(urlSchemeSeparator);
if (schemeEnd !== -1) {
var authorityStart = schemeEnd + urlSchemeSeparator.length;
var authorityEnd = path.indexOf(ts.directorySeparator, authorityStart);
if (authorityEnd !== -1) { // URL: "file:///", "file://server/", "file://server/path"
// For local "file" URLs, include the leading DOS volume (if present).
// Per https://www.ietf.org/rfc/rfc1738.txt, a host of "" or "localhost" is a
// special case interpreted as "the machine from which the URL is being interpreted".
var scheme = path.slice(0, schemeEnd);
var authority = path.slice(authorityStart, authorityEnd);
if (scheme === "file" && (authority === "" || authority === "localhost") &&
isVolumeCharacter(path.charCodeAt(authorityEnd + 1))) {
var volumeSeparatorEnd = getFileUrlVolumeSeparatorEnd(path, authorityEnd + 2);
if (volumeSeparatorEnd !== -1) {
if (path.charCodeAt(volumeSeparatorEnd) === 47 /* slash */) {
// URL: "file:///c:/", "file://localhost/c:/", "file:///c%3a/", "file://localhost/c%3a/"
return ~(volumeSeparatorEnd + 1);
}
if (volumeSeparatorEnd === path.length) {
// URL: "file:///c:", "file://localhost/c:", "file:///c$3a", "file://localhost/c%3a"
// but not "file:///c:d" or "file:///c%3ad"
return ~volumeSeparatorEnd;
}
}
}
return ~(authorityEnd + 1); // URL: "file://server/", "http://server/"
}
return ~path.length; // URL: "file://server", "http://server"
}
// relative
return 0;
}
/**
* Returns length of the root part of a path or URL (i.e. length of "/", "x:/", "//server/share/, file:///user/files").
*
* For example:
* ```ts
* getRootLength("a") === 0 // ""
* getRootLength("/") === 1 // "/"
* getRootLength("c:") === 2 // "c:"
* getRootLength("c:d") === 0 // ""
* getRootLength("c:/") === 3 // "c:/"
* getRootLength("c:\\") === 3 // "c:\\"
* getRootLength("//server") === 7 // "//server"
* getRootLength("//server/share") === 8 // "//server/"
* getRootLength("\\\\server") === 7 // "\\\\server"
* getRootLength("\\\\server\\share") === 8 // "\\\\server\\"
* getRootLength("file:///path") === 8 // "file:///"
* getRootLength("file:///c:") === 10 // "file:///c:"
* getRootLength("file:///c:d") === 8 // "file:///"
* getRootLength("file:///c:/path") === 11 // "file:///c:/"
* getRootLength("file://server") === 13 // "file://server"
* getRootLength("file://server/path") === 14 // "file://server/"
* getRootLength("http://server") === 13 // "http://server"
* getRootLength("http://server/path") === 14 // "http://server/"
* ```
*/
function getRootLength(path) {
var rootLength = getEncodedRootLength(path);
return rootLength < 0 ? ~rootLength : rootLength;
}
ts.getRootLength = getRootLength;
function getDirectoryPath(path) {
path = normalizeSlashes(path);
// If the path provided is itself the root, then return it.
var rootLength = getRootLength(path);
if (rootLength === path.length)
return path;
// return the leading portion of the path up to the last (non-terminal) directory separator
// but not including any trailing directory separator.
path = removeTrailingDirectorySeparator(path);
return path.slice(0, Math.max(rootLength, path.lastIndexOf(ts.directorySeparator)));
}
ts.getDirectoryPath = getDirectoryPath;
function getBaseFileName(path, extensions, ignoreCase) {
path = normalizeSlashes(path);
// if the path provided is itself the root, then it has not file name.
var rootLength = getRootLength(path);
if (rootLength === path.length)
return "";
// return the trailing portion of the path starting after the last (non-terminal) directory
// separator but not including any trailing directory separator.
path = removeTrailingDirectorySeparator(path);
var name = path.slice(Math.max(getRootLength(path), path.lastIndexOf(ts.directorySeparator) + 1));
var extension = extensions !== undefined && ignoreCase !== undefined ? getAnyExtensionFromPath(name, extensions, ignoreCase) : undefined;
return extension ? name.slice(0, name.length - extension.length) : name;
}
ts.getBaseFileName = getBaseFileName;
function tryGetExtensionFromPath(path, extension, stringEqualityComparer) {
if (!ts.startsWith(extension, "."))
extension = "." + extension;
if (path.length >= extension.length && path.charCodeAt(path.length - extension.length) === 46 /* dot */) {
var pathExtension = path.slice(path.length - extension.length);
if (stringEqualityComparer(pathExtension, extension)) {
return pathExtension;
}
}
}
function getAnyExtensionFromPathWorker(path, extensions, stringEqualityComparer) {
if (typeof extensions === "string") {
return tryGetExtensionFromPath(path, extensions, stringEqualityComparer) || "";
}
for (var _i = 0, extensions_2 = extensions; _i < extensions_2.length; _i++) {
var extension = extensions_2[_i];
var result = tryGetExtensionFromPath(path, extension, stringEqualityComparer);
if (result)
return result;
}
return "";
}
function getAnyExtensionFromPath(path, extensions, ignoreCase) {
// Retrieves any string from the final "." onwards from a base file name.
// Unlike extensionFromPath, which throws an exception on unrecognized extensions.
if (extensions) {
return getAnyExtensionFromPathWorker(removeTrailingDirectorySeparator(path), extensions, ignoreCase ? ts.equateStringsCaseInsensitive : ts.equateStringsCaseSensitive);
}
var baseFileName = getBaseFileName(path);
var extensionIndex = baseFileName.lastIndexOf(".");
if (extensionIndex >= 0) {
return baseFileName.substring(extensionIndex);
}
return "";
}
ts.getAnyExtensionFromPath = getAnyExtensionFromPath;
function pathComponents(path, rootLength) {
var root = path.substring(0, rootLength);
var rest = path.substring(rootLength).split(ts.directorySeparator);
if (rest.length && !ts.lastOrUndefined(rest))
rest.pop();
return __spreadArray([root], rest, true);
}
/**
* Parse a path into an array containing a root component (at index 0) and zero or more path
* components (at indices > 0). The result is not normalized.
* If the path is relative, the root component is `""`.
* If the path is absolute, the root component includes the first path separator (`/`).
*
* ```ts
* // POSIX
* getPathComponents("/path/to/file.ext") === ["/", "path", "to", "file.ext"]
* getPathComponents("/path/to/") === ["/", "path", "to"]
* getPathComponents("/") === ["/"]
* // DOS
* getPathComponents("c:/path/to/file.ext") === ["c:/", "path", "to", "file.ext"]
* getPathComponents("c:/path/to/") === ["c:/", "path", "to"]
* getPathComponents("c:/") === ["c:/"]
* getPathComponents("c:") === ["c:"]
* // URL
* getPathComponents("http://typescriptlang.org/path/to/file.ext") === ["http://typescriptlang.org/", "path", "to", "file.ext"]
* getPathComponents("http://typescriptlang.org/path/to/") === ["http://typescriptlang.org/", "path", "to"]
* getPathComponents("http://typescriptlang.org/") === ["http://typescriptlang.org/"]
* getPathComponents("http://typescriptlang.org") === ["http://typescriptlang.org"]
* getPathComponents("file://server/path/to/file.ext") === ["file://server/", "path", "to", "file.ext"]
* getPathComponents("file://server/path/to/") === ["file://server/", "path", "to"]
* getPathComponents("file://server/") === ["file://server/"]
* getPathComponents("file://server") === ["file://server"]
* getPathComponents("file:///path/to/file.ext") === ["file:///", "path", "to", "file.ext"]
* getPathComponents("file:///path/to/") === ["file:///", "path", "to"]
* getPathComponents("file:///") === ["file:///"]
* getPathComponents("file://") === ["file://"]
*/
function getPathComponents(path, currentDirectory) {
if (currentDirectory === void 0) { currentDirectory = ""; }
path = combinePaths(currentDirectory, path);
return pathComponents(path, getRootLength(path));
}
ts.getPathComponents = getPathComponents;
//// Path Formatting
/**
* Formats a parsed path consisting of a root component (at index 0) and zero or more path
* segments (at indices > 0).
*
* ```ts
* getPathFromPathComponents(["/", "path", "to", "file.ext"]) === "/path/to/file.ext"
* ```
*/
function getPathFromPathComponents(pathComponents) {
if (pathComponents.length === 0)
return "";
var root = pathComponents[0] && ensureTrailingDirectorySeparator(pathComponents[0]);
return root + pathComponents.slice(1).join(ts.directorySeparator);
}
ts.getPathFromPathComponents = getPathFromPathComponents;
//// Path Normalization
/**
* Normalize path separators, converting `\` into `/`.
*/
function normalizeSlashes(path) {
var index = path.indexOf("\\");
if (index === -1) {
return path;
}
backslashRegExp.lastIndex = index; // prime regex with known position
return path.replace(backslashRegExp, ts.directorySeparator);
}
ts.normalizeSlashes = normalizeSlashes;
/**
* Reduce an array of path components to a more simplified path by navigating any
* `"."` or `".."` entries in the path.
*/
function reducePathComponents(components) {
if (!ts.some(components))
return [];
var reduced = [components[0]];
for (var i = 1; i < components.length; i++) {
var component = components[i];
if (!component)
continue;
if (component === ".")
continue;
if (component === "..") {
if (reduced.length > 1) {
if (reduced[reduced.length - 1] !== "..") {
reduced.pop();
continue;
}
}
else if (reduced[0])
continue;
}
reduced.push(component);
}
return reduced;
}
ts.reducePathComponents = reducePathComponents;
/**
* Combines paths. If a path is absolute, it replaces any previous path. Relative paths are not simplified.
*
* ```ts
* // Non-rooted
* combinePaths("path", "to", "file.ext") === "path/to/file.ext"
* combinePaths("path", "dir", "..", "to", "file.ext") === "path/dir/../to/file.ext"
* // POSIX
* combinePaths("/path", "to", "file.ext") === "/path/to/file.ext"
* combinePaths("/path", "/to", "file.ext") === "/to/file.ext"
* // DOS
* combinePaths("c:/path", "to", "file.ext") === "c:/path/to/file.ext"
* combinePaths("c:/path", "c:/to", "file.ext") === "c:/to/file.ext"
* // URL
* combinePaths("file:///path", "to", "file.ext") === "file:///path/to/file.ext"
* combinePaths("file:///path", "file:///to", "file.ext") === "file:///to/file.ext"
* ```
*/
function combinePaths(path) {
var paths = [];
for (var _i = 1; _i < arguments.length; _i++) {
paths[_i - 1] = arguments[_i];
}
if (path)
path = normalizeSlashes(path);
for (var _a = 0, paths_1 = paths; _a < paths_1.length; _a++) {
var relativePath = paths_1[_a];
if (!relativePath)
continue;
relativePath = normalizeSlashes(relativePath);
if (!path || getRootLength(relativePath) !== 0) {
path = relativePath;
}
else {
path = ensureTrailingDirectorySeparator(path) + relativePath;
}
}
return path;
}
ts.combinePaths = combinePaths;
/**
* Combines and resolves paths. If a path is absolute, it replaces any previous path. Any
* `.` and `..` path components are resolved. Trailing directory separators are preserved.
*
* ```ts
* resolvePath("/path", "to", "file.ext") === "path/to/file.ext"
* resolvePath("/path", "to", "file.ext/") === "path/to/file.ext/"
* resolvePath("/path", "dir", "..", "to", "file.ext") === "path/to/file.ext"
* ```
*/
function resolvePath(path) {
var paths = [];
for (var _i = 1; _i < arguments.length; _i++) {
paths[_i - 1] = arguments[_i];
}
return normalizePath(ts.some(paths) ? combinePaths.apply(void 0, __spreadArray([path], paths, false)) : normalizeSlashes(path));
}
ts.resolvePath = resolvePath;
/**
* Parse a path into an array containing a root component (at index 0) and zero or more path
* components (at indices > 0). The result is normalized.
* If the path is relative, the root component is `""`.
* If the path is absolute, the root component includes the first path separator (`/`).
*
* ```ts
* getNormalizedPathComponents("to/dir/../file.ext", "/path/") === ["/", "path", "to", "file.ext"]
* ```
*/
function getNormalizedPathComponents(path, currentDirectory) {
return reducePathComponents(getPathComponents(path, currentDirectory));
}
ts.getNormalizedPathComponents = getNormalizedPathComponents;
function getNormalizedAbsolutePath(fileName, currentDirectory) {
return getPathFromPathComponents(getNormalizedPathComponents(fileName, currentDirectory));
}
ts.getNormalizedAbsolutePath = getNormalizedAbsolutePath;
function normalizePath(path) {
path = normalizeSlashes(path);
// Most paths don't require normalization
if (!relativePathSegmentRegExp.test(path)) {
return path;
}
// Some paths only require cleanup of `/./` or leading `./`
var simplified = path.replace(/\/\.\//g, "/").replace(/^\.\//, "");
if (simplified !== path) {
path = simplified;
if (!relativePathSegmentRegExp.test(path)) {
return path;
}
}
// Other paths require full normalization
var normalized = getPathFromPathComponents(reducePathComponents(getPathComponents(path)));
return normalized && hasTrailingDirectorySeparator(path) ? ensureTrailingDirectorySeparator(normalized) : normalized;
}
ts.normalizePath = normalizePath;
function getPathWithoutRoot(pathComponents) {
if (pathComponents.length === 0)
return "";
return pathComponents.slice(1).join(ts.directorySeparator);
}
function getNormalizedAbsolutePathWithoutRoot(fileName, currentDirectory) {
return getPathWithoutRoot(getNormalizedPathComponents(fileName, currentDirectory));
}
ts.getNormalizedAbsolutePathWithoutRoot = getNormalizedAbsolutePathWithoutRoot;
function toPath(fileName, basePath, getCanonicalFileName) {
var nonCanonicalizedPath = isRootedDiskPath(fileName)
? normalizePath(fileName)
: getNormalizedAbsolutePath(fileName, basePath);
return getCanonicalFileName(nonCanonicalizedPath);
}
ts.toPath = toPath;
function normalizePathAndParts(path) {
path = normalizeSlashes(path);
var _a = reducePathComponents(getPathComponents(path)), root = _a[0], parts = _a.slice(1);
if (parts.length) {
var joinedParts = root + parts.join(ts.directorySeparator);
return { path: hasTrailingDirectorySeparator(path) ? ensureTrailingDirectorySeparator(joinedParts) : joinedParts, parts: parts };
}
else {
return { path: root, parts: parts };
}
}
ts.normalizePathAndParts = normalizePathAndParts;
function removeTrailingDirectorySeparator(path) {
if (hasTrailingDirectorySeparator(path)) {
return path.substr(0, path.length - 1);
}
return path;
}
ts.removeTrailingDirectorySeparator = removeTrailingDirectorySeparator;
function ensureTrailingDirectorySeparator(path) {
if (!hasTrailingDirectorySeparator(path)) {
return path + ts.directorySeparator;
}
return path;
}
ts.ensureTrailingDirectorySeparator = ensureTrailingDirectorySeparator;
/**
* Ensures a path is either absolute (prefixed with `/` or `c:`) or dot-relative (prefixed
* with `./` or `../`) so as not to be confused with an unprefixed module name.
*
* ```ts
* ensurePathIsNonModuleName("/path/to/file.ext") === "/path/to/file.ext"
* ensurePathIsNonModuleName("./path/to/file.ext") === "./path/to/file.ext"
* ensurePathIsNonModuleName("../path/to/file.ext") === "../path/to/file.ext"
* ensurePathIsNonModuleName("path/to/file.ext") === "./path/to/file.ext"
* ```
*/
function ensurePathIsNonModuleName(path) {
return !pathIsAbsolute(path) && !pathIsRelative(path) ? "./" + path : path;
}
ts.ensurePathIsNonModuleName = ensurePathIsNonModuleName;
function changeAnyExtension(path, ext, extensions, ignoreCase) {
var pathext = extensions !== undefined && ignoreCase !== undefined ? getAnyExtensionFromPath(path, extensions, ignoreCase) : getAnyExtensionFromPath(path);
return pathext ? path.slice(0, path.length - pathext.length) + (ts.startsWith(ext, ".") ? ext : "." + ext) : path;
}
ts.changeAnyExtension = changeAnyExtension;
//// Path Comparisons
// check path for these segments: '', '.'. '..'
var relativePathSegmentRegExp = /(?:\/\/)|(?:^|\/)\.\.?(?:$|\/)/;
function comparePathsWorker(a, b, componentComparer) {
if (a === b)
return 0 /* EqualTo */;
if (a === undefined)
return -1 /* LessThan */;
if (b === undefined)
return 1 /* GreaterThan */;
// NOTE: Performance optimization - shortcut if the root segments differ as there would be no
// need to perform path reduction.
var aRoot = a.substring(0, getRootLength(a));
var bRoot = b.substring(0, getRootLength(b));
var result = ts.compareStringsCaseInsensitive(aRoot, bRoot);
if (result !== 0 /* EqualTo */) {
return result;
}
// NOTE: Performance optimization - shortcut if there are no relative path segments in
// the non-root portion of the path
var aRest = a.substring(aRoot.length);
var bRest = b.substring(bRoot.length);
if (!relativePathSegmentRegExp.test(aRest) && !relativePathSegmentRegExp.test(bRest)) {
return componentComparer(aRest, bRest);
}
// The path contains a relative path segment. Normalize the paths and perform a slower component
// by component comparison.
var aComponents = reducePathComponents(getPathComponents(a));
var bComponents = reducePathComponents(getPathComponents(b));
var sharedLength = Math.min(aComponents.length, bComponents.length);
for (var i = 1; i < sharedLength; i++) {
var result_2 = componentComparer(aComponents[i], bComponents[i]);
if (result_2 !== 0 /* EqualTo */) {
return result_2;
}
}
return ts.compareValues(aComponents.length, bComponents.length);
}
/**
* Performs a case-sensitive comparison of two paths. Path roots are always compared case-insensitively.
*/
function comparePathsCaseSensitive(a, b) {
return comparePathsWorker(a, b, ts.compareStringsCaseSensitive);
}
ts.comparePathsCaseSensitive = comparePathsCaseSensitive;
/**
* Performs a case-insensitive comparison of two paths.
*/
function comparePathsCaseInsensitive(a, b) {
return comparePathsWorker(a, b, ts.compareStringsCaseInsensitive);
}
ts.comparePathsCaseInsensitive = comparePathsCaseInsensitive;
function comparePaths(a, b, currentDirectory, ignoreCase) {
if (typeof currentDirectory === "string") {
a = combinePaths(currentDirectory, a);
b = combinePaths(currentDirectory, b);
}
else if (typeof currentDirectory === "boolean") {
ignoreCase = currentDirectory;
}
return comparePathsWorker(a, b, ts.getStringComparer(ignoreCase));
}
ts.comparePaths = comparePaths;
function containsPath(parent, child, currentDirectory, ignoreCase) {
if (typeof currentDirectory === "string") {
parent = combinePaths(currentDirectory, parent);
child = combinePaths(currentDirectory, child);
}
else if (typeof currentDirectory === "boolean") {
ignoreCase = currentDirectory;
}
if (parent === undefined || child === undefined)
return false;
if (parent === child)
return true;
var parentComponents = reducePathComponents(getPathComponents(parent));
var childComponents = reducePathComponents(getPathComponents(child));
if (childComponents.length < parentComponents.length) {
return false;
}
var componentEqualityComparer = ignoreCase ? ts.equateStringsCaseInsensitive : ts.equateStringsCaseSensitive;
for (var i = 0; i < parentComponents.length; i++) {
var equalityComparer = i === 0 ? ts.equateStringsCaseInsensitive : componentEqualityComparer;
if (!equalityComparer(parentComponents[i], childComponents[i])) {
return false;
}
}
return true;
}
ts.containsPath = containsPath;
/**
* Determines whether `fileName` starts with the specified `directoryName` using the provided path canonicalization callback.
* Comparison is case-sensitive between the canonical paths.
*
* Use `containsPath` if file names are not already reduced and absolute.
*/
function startsWithDirectory(fileName, directoryName, getCanonicalFileName) {
var canonicalFileName = getCanonicalFileName(fileName);
var canonicalDirectoryName = getCanonicalFileName(directoryName);
return ts.startsWith(canonicalFileName, canonicalDirectoryName + "/") || ts.startsWith(canonicalFileName, canonicalDirectoryName + "\\");
}
ts.startsWithDirectory = startsWithDirectory;
//// Relative Paths
function getPathComponentsRelativeTo(from, to, stringEqualityComparer, getCanonicalFileName) {
var fromComponents = reducePathComponents(getPathComponents(from));
var toComponents = reducePathComponents(getPathComponents(to));
var start;
for (start = 0; start < fromComponents.length && start < toComponents.length; start++) {
var fromComponent = getCanonicalFileName(fromComponents[start]);
var toComponent = getCanonicalFileName(toComponents[start]);
var comparer = start === 0 ? ts.equateStringsCaseInsensitive : stringEqualityComparer;
if (!comparer(fromComponent, toComponent))
break;
}
if (start === 0) {
return toComponents;
}
var components = toComponents.slice(start);
var relative = [];
for (; start < fromComponents.length; start++) {
relative.push("..");
}
return __spreadArray(__spreadArray([""], relative, true), components, true);
}
ts.getPathComponentsRelativeTo = getPathComponentsRelativeTo;
function getRelativePathFromDirectory(fromDirectory, to, getCanonicalFileNameOrIgnoreCase) {
ts.Debug.assert((getRootLength(fromDirectory) > 0) === (getRootLength(to) > 0), "Paths must either both be absolute or both be relative");
var getCanonicalFileName = typeof getCanonicalFileNameOrIgnoreCase === "function" ? getCanonicalFileNameOrIgnoreCase : ts.identity;
var ignoreCase = typeof getCanonicalFileNameOrIgnoreCase === "boolean" ? getCanonicalFileNameOrIgnoreCase : false;
var pathComponents = getPathComponentsRelativeTo(fromDirectory, to, ignoreCase ? ts.equateStringsCaseInsensitive : ts.equateStringsCaseSensitive, getCanonicalFileName);
return getPathFromPathComponents(pathComponents);
}
ts.getRelativePathFromDirectory = getRelativePathFromDirectory;
function convertToRelativePath(absoluteOrRelativePath, basePath, getCanonicalFileName) {
return !isRootedDiskPath(absoluteOrRelativePath)
? absoluteOrRelativePath
: getRelativePathToDirectoryOrUrl(basePath, absoluteOrRelativePath, basePath, getCanonicalFileName, /*isAbsolutePathAnUrl*/ false);
}
ts.convertToRelativePath = convertToRelativePath;
function getRelativePathFromFile(from, to, getCanonicalFileName) {
return ensurePathIsNonModuleName(getRelativePathFromDirectory(getDirectoryPath(from), to, getCanonicalFileName));
}
ts.getRelativePathFromFile = getRelativePathFromFile;
function getRelativePathToDirectoryOrUrl(directoryPathOrUrl, relativeOrAbsolutePath, currentDirectory, getCanonicalFileName, isAbsolutePathAnUrl) {
var pathComponents = getPathComponentsRelativeTo(resolvePath(currentDirectory, directoryPathOrUrl), resolvePath(currentDirectory, relativeOrAbsolutePath), ts.equateStringsCaseSensitive, getCanonicalFileName);
var firstComponent = pathComponents[0];
if (isAbsolutePathAnUrl && isRootedDiskPath(firstComponent)) {
var prefix = firstComponent.charAt(0) === ts.directorySeparator ? "file://" : "file:///";
pathComponents[0] = prefix + firstComponent;
}
return getPathFromPathComponents(pathComponents);
}
ts.getRelativePathToDirectoryOrUrl = getRelativePathToDirectoryOrUrl;
function forEachAncestorDirectory(directory, callback) {
while (true) {
var result = callback(directory);
if (result !== undefined) {
return result;
}
var parentPath = getDirectoryPath(directory);
if (parentPath === directory) {
return undefined;
}
directory = parentPath;
}
}
ts.forEachAncestorDirectory = forEachAncestorDirectory;
function isNodeModulesDirectory(dirPath) {
return ts.endsWith(dirPath, "/node_modules");
}
ts.isNodeModulesDirectory = isNodeModulesDirectory;
})(ts || (ts = {}));
var ts;
(function (ts) {
/**
* djb2 hashing algorithm
* http://www.cse.yorku.ca/~oz/hash.html
*/
/* @internal */
function generateDjb2Hash(data) {
var acc = 5381;
for (var i = 0; i < data.length; i++) {
acc = ((acc << 5) + acc) + data.charCodeAt(i);
}
return acc.toString();
}
ts.generateDjb2Hash = generateDjb2Hash;
/**
* Set a high stack trace limit to provide more information in case of an error.
* Called for command-line and server use cases.
* Not called if TypeScript is used as a library.
*/
/* @internal */
function setStackTraceLimit() {
if (Error.stackTraceLimit < 100) { // Also tests that we won't set the property if it doesn't exist.
Error.stackTraceLimit = 100;
}
}
ts.setStackTraceLimit = setStackTraceLimit;
var FileWatcherEventKind;
(function (FileWatcherEventKind) {
FileWatcherEventKind[FileWatcherEventKind["Created"] = 0] = "Created";
FileWatcherEventKind[FileWatcherEventKind["Changed"] = 1] = "Changed";
FileWatcherEventKind[FileWatcherEventKind["Deleted"] = 2] = "Deleted";
})(FileWatcherEventKind = ts.FileWatcherEventKind || (ts.FileWatcherEventKind = {}));
/* @internal */
var PollingInterval;
(function (PollingInterval) {
PollingInterval[PollingInterval["High"] = 2000] = "High";
PollingInterval[PollingInterval["Medium"] = 500] = "Medium";
PollingInterval[PollingInterval["Low"] = 250] = "Low";
})(PollingInterval = ts.PollingInterval || (ts.PollingInterval = {}));
/* @internal */
ts.missingFileModifiedTime = new Date(0); // Any subsequent modification will occur after this time
/* @internal */
function getModifiedTime(host, fileName) {
return host.getModifiedTime(fileName) || ts.missingFileModifiedTime;
}
ts.getModifiedTime = getModifiedTime;
function createPollingIntervalBasedLevels(levels) {
var _a;
return _a = {},
_a[PollingInterval.Low] = levels.Low,
_a[PollingInterval.Medium] = levels.Medium,
_a[PollingInterval.High] = levels.High,
_a;
}
var defaultChunkLevels = { Low: 32, Medium: 64, High: 256 };
var pollingChunkSize = createPollingIntervalBasedLevels(defaultChunkLevels);
/* @internal */
ts.unchangedPollThresholds = createPollingIntervalBasedLevels(defaultChunkLevels);
/* @internal */
function setCustomPollingValues(system) {
if (!system.getEnvironmentVariable) {
return;
}
var pollingIntervalChanged = setCustomLevels("TSC_WATCH_POLLINGINTERVAL", PollingInterval);
pollingChunkSize = getCustomPollingBasedLevels("TSC_WATCH_POLLINGCHUNKSIZE", defaultChunkLevels) || pollingChunkSize;
ts.unchangedPollThresholds = getCustomPollingBasedLevels("TSC_WATCH_UNCHANGEDPOLLTHRESHOLDS", defaultChunkLevels) || ts.unchangedPollThresholds;
function getLevel(envVar, level) {
return system.getEnvironmentVariable(envVar + "_" + level.toUpperCase());
}
function getCustomLevels(baseVariable) {
var customLevels;
setCustomLevel("Low");
setCustomLevel("Medium");
setCustomLevel("High");
return customLevels;
function setCustomLevel(level) {
var customLevel = getLevel(baseVariable, level);
if (customLevel) {
(customLevels || (customLevels = {}))[level] = Number(customLevel);
}
}
}
function setCustomLevels(baseVariable, levels) {
var customLevels = getCustomLevels(baseVariable);
if (customLevels) {
setLevel("Low");
setLevel("Medium");
setLevel("High");
return true;
}
return false;
function setLevel(level) {
levels[level] = customLevels[level] || levels[level];
}
}
function getCustomPollingBasedLevels(baseVariable, defaultLevels) {
var customLevels = getCustomLevels(baseVariable);
return (pollingIntervalChanged || customLevels) &&
createPollingIntervalBasedLevels(customLevels ? __assign(__assign({}, defaultLevels), customLevels) : defaultLevels);
}
}
ts.setCustomPollingValues = setCustomPollingValues;
function pollWatchedFileQueue(host, queue, pollIndex, chunkSize, callbackOnWatchFileStat) {
var definedValueCopyToIndex = pollIndex;
// Max visit would be all elements of the queue
for (var canVisit = queue.length; chunkSize && canVisit; nextPollIndex(), canVisit--) {
var watchedFile = queue[pollIndex];
if (!watchedFile) {
continue;
}
else if (watchedFile.isClosed) {
queue[pollIndex] = undefined;
continue;
}
// Only files polled count towards chunkSize
chunkSize--;
var fileChanged = onWatchedFileStat(watchedFile, getModifiedTime(host, watchedFile.fileName));
if (watchedFile.isClosed) {
// Closed watcher as part of callback
queue[pollIndex] = undefined;
continue;
}
callbackOnWatchFileStat === null || callbackOnWatchFileStat === void 0 ? void 0 : callbackOnWatchFileStat(watchedFile, pollIndex, fileChanged);
// Defragment the queue while we are at it
if (queue[pollIndex]) {
// Copy this file to the non hole location
if (definedValueCopyToIndex < pollIndex) {
queue[definedValueCopyToIndex] = watchedFile;
queue[pollIndex] = undefined;
}
definedValueCopyToIndex++;
}
}
// Return next poll index
return pollIndex;
function nextPollIndex() {
pollIndex++;
if (pollIndex === queue.length) {
if (definedValueCopyToIndex < pollIndex) {
// There are holes from definedValueCopyToIndex to end of queue, change queue size
queue.length = definedValueCopyToIndex;
}
pollIndex = 0;
definedValueCopyToIndex = 0;
}
}
}
/* @internal */
function createDynamicPriorityPollingWatchFile(host) {
var watchedFiles = [];
var changedFilesInLastPoll = [];
var lowPollingIntervalQueue = createPollingIntervalQueue(PollingInterval.Low);
var mediumPollingIntervalQueue = createPollingIntervalQueue(PollingInterval.Medium);
var highPollingIntervalQueue = createPollingIntervalQueue(PollingInterval.High);
return watchFile;
function watchFile(fileName, callback, defaultPollingInterval) {
var file = {
fileName: fileName,
callback: callback,
unchangedPolls: 0,
mtime: getModifiedTime(host, fileName)
};
watchedFiles.push(file);
addToPollingIntervalQueue(file, defaultPollingInterval);
return {
close: function () {
file.isClosed = true;
// Remove from watchedFiles
ts.unorderedRemoveItem(watchedFiles, file);
// Do not update polling interval queue since that will happen as part of polling
}
};
}
function createPollingIntervalQueue(pollingInterval) {
var queue = [];
queue.pollingInterval = pollingInterval;
queue.pollIndex = 0;
queue.pollScheduled = false;
return queue;
}
function pollPollingIntervalQueue(queue) {
queue.pollIndex = pollQueue(queue, queue.pollingInterval, queue.pollIndex, pollingChunkSize[queue.pollingInterval]);
// Set the next polling index and timeout
if (queue.length) {
scheduleNextPoll(queue.pollingInterval);
}
else {
ts.Debug.assert(queue.pollIndex === 0);
queue.pollScheduled = false;
}
}
function pollLowPollingIntervalQueue(queue) {
// Always poll complete list of changedFilesInLastPoll
pollQueue(changedFilesInLastPoll, PollingInterval.Low, /*pollIndex*/ 0, changedFilesInLastPoll.length);
// Finally do the actual polling of the queue
pollPollingIntervalQueue(queue);
// Schedule poll if there are files in changedFilesInLastPoll but no files in the actual queue
// as pollPollingIntervalQueue wont schedule for next poll
if (!queue.pollScheduled && changedFilesInLastPoll.length) {
scheduleNextPoll(PollingInterval.Low);
}
}
function pollQueue(queue, pollingInterval, pollIndex, chunkSize) {
return pollWatchedFileQueue(host, queue, pollIndex, chunkSize, onWatchFileStat);
function onWatchFileStat(watchedFile, pollIndex, fileChanged) {
if (fileChanged) {
watchedFile.unchangedPolls = 0;
// Changed files go to changedFilesInLastPoll queue
if (queue !== changedFilesInLastPoll) {
queue[pollIndex] = undefined;
addChangedFileToLowPollingIntervalQueue(watchedFile);
}
}
else if (watchedFile.unchangedPolls !== ts.unchangedPollThresholds[pollingInterval]) {
watchedFile.unchangedPolls++;
}
else if (queue === changedFilesInLastPoll) {
// Restart unchangedPollCount for unchanged file and move to low polling interval queue
watchedFile.unchangedPolls = 1;
queue[pollIndex] = undefined;
addToPollingIntervalQueue(watchedFile, PollingInterval.Low);
}
else if (pollingInterval !== PollingInterval.High) {
watchedFile.unchangedPolls++;
queue[pollIndex] = undefined;
addToPollingIntervalQueue(watchedFile, pollingInterval === PollingInterval.Low ? PollingInterval.Medium : PollingInterval.High);
}
}
}
function pollingIntervalQueue(pollingInterval) {
switch (pollingInterval) {
case PollingInterval.Low:
return lowPollingIntervalQueue;
case PollingInterval.Medium:
return mediumPollingIntervalQueue;
case PollingInterval.High:
return highPollingIntervalQueue;
}
}
function addToPollingIntervalQueue(file, pollingInterval) {
pollingIntervalQueue(pollingInterval).push(file);
scheduleNextPollIfNotAlreadyScheduled(pollingInterval);
}
function addChangedFileToLowPollingIntervalQueue(file) {
changedFilesInLastPoll.push(file);
scheduleNextPollIfNotAlreadyScheduled(PollingInterval.Low);
}
function scheduleNextPollIfNotAlreadyScheduled(pollingInterval) {
if (!pollingIntervalQueue(pollingInterval).pollScheduled) {
scheduleNextPoll(pollingInterval);
}
}
function scheduleNextPoll(pollingInterval) {
pollingIntervalQueue(pollingInterval).pollScheduled = host.setTimeout(pollingInterval === PollingInterval.Low ? pollLowPollingIntervalQueue : pollPollingIntervalQueue, pollingInterval, pollingIntervalQueue(pollingInterval));
}
}
ts.createDynamicPriorityPollingWatchFile = createDynamicPriorityPollingWatchFile;
function createUseFsEventsOnParentDirectoryWatchFile(fsWatch, useCaseSensitiveFileNames) {
// One file can have multiple watchers
var fileWatcherCallbacks = ts.createMultiMap();
var dirWatchers = new ts.Map();
var toCanonicalName = ts.createGetCanonicalFileName(useCaseSensitiveFileNames);
return nonPollingWatchFile;
function nonPollingWatchFile(fileName, callback, _pollingInterval, fallbackOptions) {
var filePath = toCanonicalName(fileName);
fileWatcherCallbacks.add(filePath, callback);
var dirPath = ts.getDirectoryPath(filePath) || ".";
var watcher = dirWatchers.get(dirPath) ||
createDirectoryWatcher(ts.getDirectoryPath(fileName) || ".", dirPath, fallbackOptions);
watcher.referenceCount++;
return {
close: function () {
if (watcher.referenceCount === 1) {
watcher.close();
dirWatchers.delete(dirPath);
}
else {
watcher.referenceCount--;
}
fileWatcherCallbacks.remove(filePath, callback);
}
};
}
function createDirectoryWatcher(dirName, dirPath, fallbackOptions) {
var watcher = fsWatch(dirName, 1 /* Directory */, function (_eventName, relativeFileName) {
// When files are deleted from disk, the triggered "rename" event would have a relativefileName of "undefined"
if (!ts.isString(relativeFileName)) {
return;
}
var fileName = ts.getNormalizedAbsolutePath(relativeFileName, dirName);
// Some applications save a working file via rename operations
var callbacks = fileName && fileWatcherCallbacks.get(toCanonicalName(fileName));
if (callbacks) {
for (var _i = 0, callbacks_1 = callbacks; _i < callbacks_1.length; _i++) {
var fileCallback = callbacks_1[_i];
fileCallback(fileName, FileWatcherEventKind.Changed);
}
}
},
/*recursive*/ false, PollingInterval.Medium, fallbackOptions);
watcher.referenceCount = 0;
dirWatchers.set(dirPath, watcher);
return watcher;
}
}
function createFixedChunkSizePollingWatchFile(host) {
var watchedFiles = [];
var pollIndex = 0;
var pollScheduled;
return watchFile;
function watchFile(fileName, callback) {
var file = {
fileName: fileName,
callback: callback,
mtime: getModifiedTime(host, fileName)
};
watchedFiles.push(file);
scheduleNextPoll();
return {
close: function () {
file.isClosed = true;
ts.unorderedRemoveItem(watchedFiles, file);
}
};
}
function pollQueue() {
pollScheduled = undefined;
pollIndex = pollWatchedFileQueue(host, watchedFiles, pollIndex, pollingChunkSize[PollingInterval.Low]);
scheduleNextPoll();
}
function scheduleNextPoll() {
if (!watchedFiles.length || pollScheduled)
return;
pollScheduled = host.setTimeout(pollQueue, PollingInterval.High);
}
}
/* @internal */
function createSingleFileWatcherPerName(watchFile, useCaseSensitiveFileNames) {
var cache = new ts.Map();
var callbacksCache = ts.createMultiMap();
var toCanonicalFileName = ts.createGetCanonicalFileName(useCaseSensitiveFileNames);
return function (fileName, callback, pollingInterval, options) {
var path = toCanonicalFileName(fileName);
var existing = cache.get(path);
if (existing) {
existing.refCount++;
}
else {
cache.set(path, {
watcher: watchFile(fileName, function (fileName, eventKind) { return ts.forEach(callbacksCache.get(path), function (cb) { return cb(fileName, eventKind); }); }, pollingInterval, options),
refCount: 1
});
}
callbacksCache.add(path, callback);
return {
close: function () {
var watcher = ts.Debug.checkDefined(cache.get(path));
callbacksCache.remove(path, callback);
watcher.refCount--;
if (watcher.refCount)
return;
cache.delete(path);
ts.closeFileWatcherOf(watcher);
}
};
};
}
ts.createSingleFileWatcherPerName = createSingleFileWatcherPerName;
/**
* Returns true if file status changed
*/
/*@internal*/
function onWatchedFileStat(watchedFile, modifiedTime) {
var oldTime = watchedFile.mtime.getTime();
var newTime = modifiedTime.getTime();
if (oldTime !== newTime) {
watchedFile.mtime = modifiedTime;
watchedFile.callback(watchedFile.fileName, getFileWatcherEventKind(oldTime, newTime));
return true;
}
return false;
}
ts.onWatchedFileStat = onWatchedFileStat;
/*@internal*/
function getFileWatcherEventKind(oldTime, newTime) {
return oldTime === 0
? FileWatcherEventKind.Created
: newTime === 0
? FileWatcherEventKind.Deleted
: FileWatcherEventKind.Changed;
}
ts.getFileWatcherEventKind = getFileWatcherEventKind;
/*@internal*/
ts.ignoredPaths = ["/node_modules/.", "/.git", "/.#"];
/*@internal*/
ts.sysLog = ts.noop; // eslint-disable-line prefer-const
/*@internal*/
function setSysLog(logger) {
ts.sysLog = logger;
}
ts.setSysLog = setSysLog;
/**
* Watch the directory recursively using host provided method to watch child directories
* that means if this is recursive watcher, watch the children directories as well
* (eg on OS that dont support recursive watch using fs.watch use fs.watchFile)
*/
/*@internal*/
function createDirectoryWatcherSupportingRecursive(_a) {
var watchDirectory = _a.watchDirectory, useCaseSensitiveFileNames = _a.useCaseSensitiveFileNames, getCurrentDirectory = _a.getCurrentDirectory, getAccessibleSortedChildDirectories = _a.getAccessibleSortedChildDirectories, directoryExists = _a.directoryExists, realpath = _a.realpath, setTimeout = _a.setTimeout, clearTimeout = _a.clearTimeout;
var cache = new ts.Map();
var callbackCache = ts.createMultiMap();
var cacheToUpdateChildWatches = new ts.Map();
var timerToUpdateChildWatches;
var filePathComparer = ts.getStringComparer(!useCaseSensitiveFileNames);
var toCanonicalFilePath = ts.createGetCanonicalFileName(useCaseSensitiveFileNames);
return function (dirName, callback, recursive, options) { return recursive ?
createDirectoryWatcher(dirName, options, callback) :
watchDirectory(dirName, callback, recursive, options); };
/**
* Create the directory watcher for the dirPath.
*/
function createDirectoryWatcher(dirName, options, callback) {
var dirPath = toCanonicalFilePath(dirName);
var directoryWatcher = cache.get(dirPath);
if (directoryWatcher) {
directoryWatcher.refCount++;
}
else {
directoryWatcher = {
watcher: watchDirectory(dirName, function (fileName) {
if (isIgnoredPath(fileName, options))
return;
if (options === null || options === void 0 ? void 0 : options.synchronousWatchDirectory) {
// Call the actual callback
invokeCallbacks(dirPath, fileName);
// Iterate through existing children and update the watches if needed
updateChildWatches(dirName, dirPath, options);
}
else {
nonSyncUpdateChildWatches(dirName, dirPath, fileName, options);
}
}, /*recursive*/ false, options),
refCount: 1,
childWatches: ts.emptyArray
};
cache.set(dirPath, directoryWatcher);
updateChildWatches(dirName, dirPath, options);
}
var callbackToAdd = callback && { dirName: dirName, callback: callback };
if (callbackToAdd) {
callbackCache.add(dirPath, callbackToAdd);
}
return {
dirName: dirName,
close: function () {
var directoryWatcher = ts.Debug.checkDefined(cache.get(dirPath));
if (callbackToAdd)
callbackCache.remove(dirPath, callbackToAdd);
directoryWatcher.refCount--;
if (directoryWatcher.refCount)
return;
cache.delete(dirPath);
ts.closeFileWatcherOf(directoryWatcher);
directoryWatcher.childWatches.forEach(ts.closeFileWatcher);
}
};
}
function invokeCallbacks(dirPath, fileNameOrInvokeMap, fileNames) {
var fileName;
var invokeMap;
if (ts.isString(fileNameOrInvokeMap)) {
fileName = fileNameOrInvokeMap;
}
else {
invokeMap = fileNameOrInvokeMap;
}
// Call the actual callback
callbackCache.forEach(function (callbacks, rootDirName) {
var _a;
if (invokeMap && invokeMap.get(rootDirName) === true)
return;
if (rootDirName === dirPath || (ts.startsWith(dirPath, rootDirName) && dirPath[rootDirName.length] === ts.directorySeparator)) {
if (invokeMap) {
if (fileNames) {
var existing = invokeMap.get(rootDirName);
if (existing) {
(_a = existing).push.apply(_a, fileNames);
}
else {
invokeMap.set(rootDirName, fileNames.slice());
}
}
else {
invokeMap.set(rootDirName, true);
}
}
else {
callbacks.forEach(function (_a) {
var callback = _a.callback;
return callback(fileName);
});
}
}
});
}
function nonSyncUpdateChildWatches(dirName, dirPath, fileName, options) {
// Iterate through existing children and update the watches if needed
var parentWatcher = cache.get(dirPath);
if (parentWatcher && directoryExists(dirName)) {
// Schedule the update and postpone invoke for callbacks
scheduleUpdateChildWatches(dirName, dirPath, fileName, options);
return;
}
// Call the actual callbacks and remove child watches
invokeCallbacks(dirPath, fileName);
removeChildWatches(parentWatcher);
}
function scheduleUpdateChildWatches(dirName, dirPath, fileName, options) {
var existing = cacheToUpdateChildWatches.get(dirPath);
if (existing) {
existing.fileNames.push(fileName);
}
else {
cacheToUpdateChildWatches.set(dirPath, { dirName: dirName, options: options, fileNames: [fileName] });
}
if (timerToUpdateChildWatches) {
clearTimeout(timerToUpdateChildWatches);
timerToUpdateChildWatches = undefined;
}
timerToUpdateChildWatches = setTimeout(onTimerToUpdateChildWatches, 1000);
}
function onTimerToUpdateChildWatches() {
timerToUpdateChildWatches = undefined;
ts.sysLog("sysLog:: onTimerToUpdateChildWatches:: " + cacheToUpdateChildWatches.size);
var start = ts.timestamp();
var invokeMap = new ts.Map();
while (!timerToUpdateChildWatches && cacheToUpdateChildWatches.size) {
var result = cacheToUpdateChildWatches.entries().next();
ts.Debug.assert(!result.done);
var _a = result.value, dirPath = _a[0], _b = _a[1], dirName = _b.dirName, options = _b.options, fileNames = _b.fileNames;
cacheToUpdateChildWatches.delete(dirPath);
// Because the child refresh is fresh, we would need to invalidate whole root directory being watched
// to ensure that all the changes are reflected at this time
var hasChanges = updateChildWatches(dirName, dirPath, options);
invokeCallbacks(dirPath, invokeMap, hasChanges ? undefined : fileNames);
}
ts.sysLog("sysLog:: invokingWatchers:: Elapsed:: " + (ts.timestamp() - start) + "ms:: " + cacheToUpdateChildWatches.size);
callbackCache.forEach(function (callbacks, rootDirName) {
var existing = invokeMap.get(rootDirName);
if (existing) {
callbacks.forEach(function (_a) {
var callback = _a.callback, dirName = _a.dirName;
if (ts.isArray(existing)) {
existing.forEach(callback);
}
else {
callback(dirName);
}
});
}
});
var elapsed = ts.timestamp() - start;
ts.sysLog("sysLog:: Elapsed:: " + elapsed + "ms:: onTimerToUpdateChildWatches:: " + cacheToUpdateChildWatches.size + " " + timerToUpdateChildWatches);
}
function removeChildWatches(parentWatcher) {
if (!parentWatcher)
return;
var existingChildWatches = parentWatcher.childWatches;
parentWatcher.childWatches = ts.emptyArray;
for (var _i = 0, existingChildWatches_1 = existingChildWatches; _i < existingChildWatches_1.length; _i++) {
var childWatcher = existingChildWatches_1[_i];
childWatcher.close();
removeChildWatches(cache.get(toCanonicalFilePath(childWatcher.dirName)));
}
}
function updateChildWatches(parentDir, parentDirPath, options) {
// Iterate through existing children and update the watches if needed
var parentWatcher = cache.get(parentDirPath);
if (!parentWatcher)
return false;
var newChildWatches;
var hasChanges = ts.enumerateInsertsAndDeletes(directoryExists(parentDir) ? ts.mapDefined(getAccessibleSortedChildDirectories(parentDir), function (child) {
var childFullName = ts.getNormalizedAbsolutePath(child, parentDir);
// Filter our the symbolic link directories since those arent included in recursive watch
// which is same behaviour when recursive: true is passed to fs.watch
return !isIgnoredPath(childFullName, options) && filePathComparer(childFullName, ts.normalizePath(realpath(childFullName))) === 0 /* EqualTo */ ? childFullName : undefined;
}) : ts.emptyArray, parentWatcher.childWatches, function (child, childWatcher) { return filePathComparer(child, childWatcher.dirName); }, createAndAddChildDirectoryWatcher, ts.closeFileWatcher, addChildDirectoryWatcher);
parentWatcher.childWatches = newChildWatches || ts.emptyArray;
return hasChanges;
/**
* Create new childDirectoryWatcher and add it to the new ChildDirectoryWatcher list
*/
function createAndAddChildDirectoryWatcher(childName) {
var result = createDirectoryWatcher(childName, options);
addChildDirectoryWatcher(result);
}
/**
* Add child directory watcher to the new ChildDirectoryWatcher list
*/
function addChildDirectoryWatcher(childWatcher) {
(newChildWatches || (newChildWatches = [])).push(childWatcher);
}
}
function isIgnoredPath(path, options) {
return ts.some(ts.ignoredPaths, function (searchPath) { return isInPath(path, searchPath); }) ||
isIgnoredByWatchOptions(path, options, useCaseSensitiveFileNames, getCurrentDirectory);
}
function isInPath(path, searchPath) {
if (ts.stringContains(path, searchPath))
return true;
if (useCaseSensitiveFileNames)
return false;
return ts.stringContains(toCanonicalFilePath(path), searchPath);
}
}
ts.createDirectoryWatcherSupportingRecursive = createDirectoryWatcherSupportingRecursive;
/*@internal*/
var FileSystemEntryKind;
(function (FileSystemEntryKind) {
FileSystemEntryKind[FileSystemEntryKind["File"] = 0] = "File";
FileSystemEntryKind[FileSystemEntryKind["Directory"] = 1] = "Directory";
})(FileSystemEntryKind = ts.FileSystemEntryKind || (ts.FileSystemEntryKind = {}));
/*@internal*/
function createFileWatcherCallback(callback) {
return function (_fileName, eventKind) { return callback(eventKind === FileWatcherEventKind.Changed ? "change" : "rename", ""); };
}
ts.createFileWatcherCallback = createFileWatcherCallback;
function createFsWatchCallbackForFileWatcherCallback(fileName, callback, fileExists) {
return function (eventName) {
if (eventName === "rename") {
callback(fileName, fileExists(fileName) ? FileWatcherEventKind.Created : FileWatcherEventKind.Deleted);
}
else {
// Change
callback(fileName, FileWatcherEventKind.Changed);
}
};
}
function isIgnoredByWatchOptions(pathToCheck, options, useCaseSensitiveFileNames, getCurrentDirectory) {
return ((options === null || options === void 0 ? void 0 : options.excludeDirectories) || (options === null || options === void 0 ? void 0 : options.excludeFiles)) && (ts.matchesExclude(pathToCheck, options === null || options === void 0 ? void 0 : options.excludeFiles, useCaseSensitiveFileNames, getCurrentDirectory()) ||
ts.matchesExclude(pathToCheck, options === null || options === void 0 ? void 0 : options.excludeDirectories, useCaseSensitiveFileNames, getCurrentDirectory()));
}
function createFsWatchCallbackForDirectoryWatcherCallback(directoryName, callback, options, useCaseSensitiveFileNames, getCurrentDirectory) {
return function (eventName, relativeFileName) {
// In watchDirectory we only care about adding and removing files (when event name is
// "rename"); changes made within files are handled by corresponding fileWatchers (when
// event name is "change")
if (eventName === "rename") {
// When deleting a file, the passed baseFileName is null
var fileName = !relativeFileName ? directoryName : ts.normalizePath(ts.combinePaths(directoryName, relativeFileName));
if (!relativeFileName || !isIgnoredByWatchOptions(fileName, options, useCaseSensitiveFileNames, getCurrentDirectory)) {
callback(fileName);
}
}
};
}
/*@internal*/
function createSystemWatchFunctions(_a) {
var pollingWatchFile = _a.pollingWatchFile, getModifiedTime = _a.getModifiedTime, setTimeout = _a.setTimeout, clearTimeout = _a.clearTimeout, fsWatch = _a.fsWatch, fileExists = _a.fileExists, useCaseSensitiveFileNames = _a.useCaseSensitiveFileNames, getCurrentDirectory = _a.getCurrentDirectory, fsSupportsRecursiveFsWatch = _a.fsSupportsRecursiveFsWatch, directoryExists = _a.directoryExists, getAccessibleSortedChildDirectories = _a.getAccessibleSortedChildDirectories, realpath = _a.realpath, tscWatchFile = _a.tscWatchFile, useNonPollingWatchers = _a.useNonPollingWatchers, tscWatchDirectory = _a.tscWatchDirectory, defaultWatchFileKind = _a.defaultWatchFileKind;
var dynamicPollingWatchFile;
var fixedChunkSizePollingWatchFile;
var nonPollingWatchFile;
var hostRecursiveDirectoryWatcher;
return {
watchFile: watchFile,
watchDirectory: watchDirectory
};
function watchFile(fileName, callback, pollingInterval, options) {
options = updateOptionsForWatchFile(options, useNonPollingWatchers);
var watchFileKind = ts.Debug.checkDefined(options.watchFile);
switch (watchFileKind) {
case ts.WatchFileKind.FixedPollingInterval:
return pollingWatchFile(fileName, callback, PollingInterval.Low, /*options*/ undefined);
case ts.WatchFileKind.PriorityPollingInterval:
return pollingWatchFile(fileName, callback, pollingInterval, /*options*/ undefined);
case ts.WatchFileKind.DynamicPriorityPolling:
return ensureDynamicPollingWatchFile()(fileName, callback, pollingInterval, /*options*/ undefined);
case ts.WatchFileKind.FixedChunkSizePolling:
return ensureFixedChunkSizePollingWatchFile()(fileName, callback, /* pollingInterval */ undefined, /*options*/ undefined);
case ts.WatchFileKind.UseFsEvents:
return fsWatch(fileName, 0 /* File */, createFsWatchCallbackForFileWatcherCallback(fileName, callback, fileExists),
/*recursive*/ false, pollingInterval, ts.getFallbackOptions(options));
case ts.WatchFileKind.UseFsEventsOnParentDirectory:
if (!nonPollingWatchFile) {
nonPollingWatchFile = createUseFsEventsOnParentDirectoryWatchFile(fsWatch, useCaseSensitiveFileNames);
}
return nonPollingWatchFile(fileName, callback, pollingInterval, ts.getFallbackOptions(options));
default:
ts.Debug.assertNever(watchFileKind);
}
}
function ensureDynamicPollingWatchFile() {
return dynamicPollingWatchFile || (dynamicPollingWatchFile = createDynamicPriorityPollingWatchFile({ getModifiedTime: getModifiedTime, setTimeout: setTimeout }));
}
function ensureFixedChunkSizePollingWatchFile() {
return fixedChunkSizePollingWatchFile || (fixedChunkSizePollingWatchFile = createFixedChunkSizePollingWatchFile({ getModifiedTime: getModifiedTime, setTimeout: setTimeout }));
}
function updateOptionsForWatchFile(options, useNonPollingWatchers) {
if (options && options.watchFile !== undefined)
return options;
switch (tscWatchFile) {
case "PriorityPollingInterval":
// Use polling interval based on priority when create watch using host.watchFile
return { watchFile: ts.WatchFileKind.PriorityPollingInterval };
case "DynamicPriorityPolling":
// Use polling interval but change the interval depending on file changes and their default polling interval
return { watchFile: ts.WatchFileKind.DynamicPriorityPolling };
case "UseFsEvents":
// Use notifications from FS to watch with falling back to fs.watchFile
return generateWatchFileOptions(ts.WatchFileKind.UseFsEvents, ts.PollingWatchKind.PriorityInterval, options);
case "UseFsEventsWithFallbackDynamicPolling":
// Use notifications from FS to watch with falling back to dynamic watch file
return generateWatchFileOptions(ts.WatchFileKind.UseFsEvents, ts.PollingWatchKind.DynamicPriority, options);
case "UseFsEventsOnParentDirectory":
useNonPollingWatchers = true;
// fall through
default:
return useNonPollingWatchers ?
// Use notifications from FS to watch with falling back to fs.watchFile
generateWatchFileOptions(ts.WatchFileKind.UseFsEventsOnParentDirectory, ts.PollingWatchKind.PriorityInterval, options) :
// Default to do not use fixed polling interval
{ watchFile: (defaultWatchFileKind === null || defaultWatchFileKind === void 0 ? void 0 : defaultWatchFileKind()) || ts.WatchFileKind.FixedPollingInterval };
}
}
function generateWatchFileOptions(watchFile, fallbackPolling, options) {
var defaultFallbackPolling = options === null || options === void 0 ? void 0 : options.fallbackPolling;
return {
watchFile: watchFile,
fallbackPolling: defaultFallbackPolling === undefined ?
fallbackPolling :
defaultFallbackPolling
};
}
function watchDirectory(directoryName, callback, recursive, options) {
if (fsSupportsRecursiveFsWatch) {
return fsWatch(directoryName, 1 /* Directory */, createFsWatchCallbackForDirectoryWatcherCallback(directoryName, callback, options, useCaseSensitiveFileNames, getCurrentDirectory), recursive, PollingInterval.Medium, ts.getFallbackOptions(options));
}
if (!hostRecursiveDirectoryWatcher) {
hostRecursiveDirectoryWatcher = createDirectoryWatcherSupportingRecursive({
useCaseSensitiveFileNames: useCaseSensitiveFileNames,
getCurrentDirectory: getCurrentDirectory,
directoryExists: directoryExists,
getAccessibleSortedChildDirectories: getAccessibleSortedChildDirectories,
watchDirectory: nonRecursiveWatchDirectory,
realpath: realpath,
setTimeout: setTimeout,
clearTimeout: clearTimeout
});
}
return hostRecursiveDirectoryWatcher(directoryName, callback, recursive, options);
}
function nonRecursiveWatchDirectory(directoryName, callback, recursive, options) {
ts.Debug.assert(!recursive);
var watchDirectoryOptions = updateOptionsForWatchDirectory(options);
var watchDirectoryKind = ts.Debug.checkDefined(watchDirectoryOptions.watchDirectory);
switch (watchDirectoryKind) {
case ts.WatchDirectoryKind.FixedPollingInterval:
return pollingWatchFile(directoryName, function () { return callback(directoryName); }, PollingInterval.Medium,
/*options*/ undefined);
case ts.WatchDirectoryKind.DynamicPriorityPolling:
return ensureDynamicPollingWatchFile()(directoryName, function () { return callback(directoryName); }, PollingInterval.Medium,
/*options*/ undefined);
case ts.WatchDirectoryKind.FixedChunkSizePolling:
return ensureFixedChunkSizePollingWatchFile()(directoryName, function () { return callback(directoryName); },
/* pollingInterval */ undefined,
/*options*/ undefined);
case ts.WatchDirectoryKind.UseFsEvents:
return fsWatch(directoryName, 1 /* Directory */, createFsWatchCallbackForDirectoryWatcherCallback(directoryName, callback, options, useCaseSensitiveFileNames, getCurrentDirectory), recursive, PollingInterval.Medium, ts.getFallbackOptions(watchDirectoryOptions));
default:
ts.Debug.assertNever(watchDirectoryKind);
}
}
function updateOptionsForWatchDirectory(options) {
if (options && options.watchDirectory !== undefined)
return options;
switch (tscWatchDirectory) {
case "RecursiveDirectoryUsingFsWatchFile":
// Use polling interval based on priority when create watch using host.watchFile
return { watchDirectory: ts.WatchDirectoryKind.FixedPollingInterval };
case "RecursiveDirectoryUsingDynamicPriorityPolling":
// Use polling interval but change the interval depending on file changes and their default polling interval
return { watchDirectory: ts.WatchDirectoryKind.DynamicPriorityPolling };
default:
var defaultFallbackPolling = options === null || options === void 0 ? void 0 : options.fallbackPolling;
return {
watchDirectory: ts.WatchDirectoryKind.UseFsEvents,
fallbackPolling: defaultFallbackPolling !== undefined ?
defaultFallbackPolling :
undefined
};
}
}
}
ts.createSystemWatchFunctions = createSystemWatchFunctions;
/**
* patch writefile to create folder before writing the file
*/
/*@internal*/
function patchWriteFileEnsuringDirectory(sys) {
// patch writefile to create folder before writing the file
var originalWriteFile = sys.writeFile;
sys.writeFile = function (path, data, writeBom) {
return ts.writeFileEnsuringDirectories(path, data, !!writeBom, function (path, data, writeByteOrderMark) { return originalWriteFile.call(sys, path, data, writeByteOrderMark); }, function (path) { return sys.createDirectory(path); }, function (path) { return sys.directoryExists(path); });
};
}
ts.patchWriteFileEnsuringDirectory = patchWriteFileEnsuringDirectory;
function getNodeMajorVersion() {
if (typeof process === "undefined") {
return undefined;
}
var version = process.version;
if (!version) {
return undefined;
}
var dot = version.indexOf(".");
if (dot === -1) {
return undefined;
}
return parseInt(version.substring(1, dot));
}
ts.getNodeMajorVersion = getNodeMajorVersion;
// TODO: GH#18217 this is used as if it's certainly defined in many places.
// eslint-disable-next-line prefer-const
ts.sys = (function () {
// NodeJS detects "\uFEFF" at the start of the string and *replaces* it with the actual
// byte order mark from the specified encoding. Using any other byte order mark does
// not actually work.
var byteOrderMarkIndicator = "\uFEFF";
function getNodeSystem() {
var _a;
var nativePattern = /^native |^\([^)]+\)$|^(internal[\\/]|[a-zA-Z0-9_\s]+(\.js)?$)/;
var _fs = require("fs");
var _path = require("path");
var _os = require("os");
// crypto can be absent on reduced node installations
var _crypto;
try {
_crypto = require("crypto");
}
catch (_b) {
_crypto = undefined;
}
var activeSession;
var profilePath = "./profile.cpuprofile";
var hitSystemWatcherLimit = false;
var Buffer = require("buffer").Buffer;
var nodeVersion = getNodeMajorVersion();
var isNode4OrLater = nodeVersion >= 4;
var isLinuxOrMacOs = process.platform === "linux" || process.platform === "darwin";
var platform = _os.platform();
var useCaseSensitiveFileNames = isFileSystemCaseSensitive();
var realpathSync = useCaseSensitiveFileNames ? ((_a = _fs.realpathSync.native) !== null && _a !== void 0 ? _a : _fs.realpathSync) : _fs.realpathSync;
var fsSupportsRecursiveFsWatch = isNode4OrLater && (process.platform === "win32" || process.platform === "darwin");
var getCurrentDirectory = ts.memoize(function () { return process.cwd(); });
var _c = createSystemWatchFunctions({
pollingWatchFile: createSingleFileWatcherPerName(fsWatchFileWorker, useCaseSensitiveFileNames),
getModifiedTime: getModifiedTime,
setTimeout: setTimeout,
clearTimeout: clearTimeout,
fsWatch: fsWatch,
useCaseSensitiveFileNames: useCaseSensitiveFileNames,
getCurrentDirectory: getCurrentDirectory,
fileExists: fileExists,
// Node 4.0 `fs.watch` function supports the "recursive" option on both OSX and Windows
// (ref: https://github.com/nodejs/node/pull/2649 and https://github.com/Microsoft/TypeScript/issues/4643)
fsSupportsRecursiveFsWatch: fsSupportsRecursiveFsWatch,
directoryExists: directoryExists,
getAccessibleSortedChildDirectories: function (path) { return getAccessibleFileSystemEntries(path).directories; },
realpath: realpath,
tscWatchFile: process.env.TSC_WATCHFILE,
useNonPollingWatchers: process.env.TSC_NONPOLLING_WATCHER,
tscWatchDirectory: process.env.TSC_WATCHDIRECTORY,
defaultWatchFileKind: function () { var _a, _b; return (_b = (_a = sys).defaultWatchFileKind) === null || _b === void 0 ? void 0 : _b.call(_a); },
}), watchFile = _c.watchFile, watchDirectory = _c.watchDirectory;
var nodeSystem = {
args: process.argv.slice(2),
newLine: _os.EOL,
useCaseSensitiveFileNames: useCaseSensitiveFileNames,
write: function (s) {
process.stdout.write(s);
},
getWidthOfTerminal: function () {
return process.stdout.columns;
},
writeOutputIsTTY: function () {
return process.stdout.isTTY;
},
readFile: readFile,
writeFile: writeFile,
watchFile: watchFile,
watchDirectory: watchDirectory,
resolvePath: function (path) { return _path.resolve(path); },
fileExists: fileExists,
directoryExists: directoryExists,
createDirectory: function (directoryName) {
if (!nodeSystem.directoryExists(directoryName)) {
// Wrapped in a try-catch to prevent crashing if we are in a race
// with another copy of ourselves to create the same directory
try {
_fs.mkdirSync(directoryName);
}
catch (e) {
if (e.code !== "EEXIST") {
// Failed for some other reason (access denied?); still throw
throw e;
}
}
}
},
getExecutingFilePath: function () {
return __filename;
},
getCurrentDirectory: getCurrentDirectory,
getDirectories: getDirectories,
getEnvironmentVariable: function (name) {
return process.env[name] || "";
},
readDirectory: readDirectory,
getModifiedTime: getModifiedTime,
setModifiedTime: setModifiedTime,
deleteFile: deleteFile,
createHash: _crypto ? createSHA256Hash : generateDjb2Hash,
createSHA256Hash: _crypto ? createSHA256Hash : undefined,
getMemoryUsage: function () {
if (global.gc) {
global.gc();
}
return process.memoryUsage().heapUsed;
},
getFileSize: function (path) {
try {
var stat = statSync(path);
if (stat === null || stat === void 0 ? void 0 : stat.isFile()) {
return stat.size;
}
}
catch ( /*ignore*/_a) { /*ignore*/ }
return 0;
},
exit: function (exitCode) {
disableCPUProfiler(function () { return process.exit(exitCode); });
},
enableCPUProfiler: enableCPUProfiler,
disableCPUProfiler: disableCPUProfiler,
cpuProfilingEnabled: function () { return !!activeSession || ts.contains(process.execArgv, "--cpu-prof") || ts.contains(process.execArgv, "--prof"); },
realpath: realpath,
debugMode: !!process.env.NODE_INSPECTOR_IPC || !!process.env.VSCODE_INSPECTOR_OPTIONS || ts.some(process.execArgv, function (arg) { return /^--(inspect|debug)(-brk)?(=\d+)?$/i.test(arg); }),
tryEnableSourceMapsForHost: function () {
try {
require("source-map-support").install();
}
catch (_a) {
// Could not enable source maps.
}
},
setTimeout: setTimeout,
clearTimeout: clearTimeout,
clearScreen: function () {
process.stdout.write("\x1Bc");
},
setBlocking: function () {
if (process.stdout && process.stdout._handle && process.stdout._handle.setBlocking) {
process.stdout._handle.setBlocking(true);
}
},
bufferFrom: bufferFrom,
base64decode: function (input) { return bufferFrom(input, "base64").toString("utf8"); },
base64encode: function (input) { return bufferFrom(input).toString("base64"); },
require: function (baseDir, moduleName) {
try {
var modulePath = ts.resolveJSModule(moduleName, baseDir, nodeSystem);
return { module: require(modulePath), modulePath: modulePath, error: undefined };
}
catch (error) {
return { module: undefined, modulePath: undefined, error: error };
}
}
};
return nodeSystem;
/**
* `throwIfNoEntry` was added so recently that it's not in the node types.
* This helper encapsulates the mitigating usage of `any`.
* See https://github.com/nodejs/node/pull/33716
*/
function statSync(path) {
// throwIfNoEntry will be ignored by older versions of node
return _fs.statSync(path, { throwIfNoEntry: false });
}
/**
* Uses the builtin inspector APIs to capture a CPU profile
* See https://nodejs.org/api/inspector.html#inspector_example_usage for details
*/
function enableCPUProfiler(path, cb) {
if (activeSession) {
cb();
return false;
}
var inspector = require("inspector");
if (!inspector || !inspector.Session) {
cb();
return false;
}
var session = new inspector.Session();
session.connect();
session.post("Profiler.enable", function () {
session.post("Profiler.start", function () {
activeSession = session;
profilePath = path;
cb();
});
});
return true;
}
/**
* Strips non-TS paths from the profile, so users with private projects shouldn't
* need to worry about leaking paths by submitting a cpu profile to us
*/
function cleanupPaths(profile) {
var externalFileCounter = 0;
var remappedPaths = new ts.Map();
var normalizedDir = ts.normalizeSlashes(__dirname);
// Windows rooted dir names need an extra `/` prepended to be valid file:/// urls
var fileUrlRoot = "file://" + (ts.getRootLength(normalizedDir) === 1 ? "" : "/") + normalizedDir;
for (var _i = 0, _a = profile.nodes; _i < _a.length; _i++) {
var node = _a[_i];
if (node.callFrame.url) {
var url = ts.normalizeSlashes(node.callFrame.url);
if (ts.containsPath(fileUrlRoot, url, useCaseSensitiveFileNames)) {
node.callFrame.url = ts.getRelativePathToDirectoryOrUrl(fileUrlRoot, url, fileUrlRoot, ts.createGetCanonicalFileName(useCaseSensitiveFileNames), /*isAbsolutePathAnUrl*/ true);
}
else if (!nativePattern.test(url)) {
node.callFrame.url = (remappedPaths.has(url) ? remappedPaths : remappedPaths.set(url, "external" + externalFileCounter + ".js")).get(url);
externalFileCounter++;
}
}
}
return profile;
}
function disableCPUProfiler(cb) {
if (activeSession && activeSession !== "stopping") {
var s_1 = activeSession;
activeSession.post("Profiler.stop", function (err, _a) {
var _b;
var profile = _a.profile;
if (!err) {
try {
if ((_b = statSync(profilePath)) === null || _b === void 0 ? void 0 : _b.isDirectory()) {
profilePath = _path.join(profilePath, (new Date()).toISOString().replace(/:/g, "-") + "+P" + process.pid + ".cpuprofile");
}
}
catch (_c) {
// do nothing and ignore fallible fs operation
}
try {
_fs.mkdirSync(_path.dirname(profilePath), { recursive: true });
}
catch (_d) {
// do nothing and ignore fallible fs operation
}
_fs.writeFileSync(profilePath, JSON.stringify(cleanupPaths(profile)));
}
activeSession = undefined;
s_1.disconnect();
cb();
});
activeSession = "stopping";
return true;
}
else {
cb();
return false;
}
}
function bufferFrom(input, encoding) {
// See https://github.com/Microsoft/TypeScript/issues/25652
return Buffer.from && Buffer.from !== Int8Array.from
? Buffer.from(input, encoding)
: new Buffer(input, encoding);
}
function isFileSystemCaseSensitive() {
// win32\win64 are case insensitive platforms
if (platform === "win32" || platform === "win64") {
return false;
}
// If this file exists under a different case, we must be case-insensitve.
return !fileExists(swapCase(__filename));
}
/** Convert all lowercase chars to uppercase, and vice-versa */
function swapCase(s) {
return s.replace(/\w/g, function (ch) {
var up = ch.toUpperCase();
return ch === up ? ch.toLowerCase() : up;
});
}
function fsWatchFileWorker(fileName, callback, pollingInterval) {
_fs.watchFile(fileName, { persistent: true, interval: pollingInterval }, fileChanged);
var eventKind;
return {
close: function () { return _fs.unwatchFile(fileName, fileChanged); }
};
function fileChanged(curr, prev) {
// previous event kind check is to ensure we recongnize the file as previously also missing when it is restored or renamed twice (that is it disappears and reappears)
// In such case, prevTime returned is same as prev time of event when file was deleted as per node documentation
var isPreviouslyDeleted = +prev.mtime === 0 || eventKind === FileWatcherEventKind.Deleted;
if (+curr.mtime === 0) {
if (isPreviouslyDeleted) {
// Already deleted file, no need to callback again
return;
}
eventKind = FileWatcherEventKind.Deleted;
}
else if (isPreviouslyDeleted) {
eventKind = FileWatcherEventKind.Created;
}
// If there is no change in modified time, ignore the event
else if (+curr.mtime === +prev.mtime) {
return;
}
else {
// File changed
eventKind = FileWatcherEventKind.Changed;
}
callback(fileName, eventKind);
}
}
function fsWatch(fileOrDirectory, entryKind, callback, recursive, fallbackPollingInterval, fallbackOptions) {
var options;
var lastDirectoryPartWithDirectorySeparator;
var lastDirectoryPart;
if (isLinuxOrMacOs) {
lastDirectoryPartWithDirectorySeparator = fileOrDirectory.substr(fileOrDirectory.lastIndexOf(ts.directorySeparator));
lastDirectoryPart = lastDirectoryPartWithDirectorySeparator.slice(ts.directorySeparator.length);
}
/** Watcher for the file system entry depending on whether it is missing or present */
var watcher = !fileSystemEntryExists(fileOrDirectory, entryKind) ?
watchMissingFileSystemEntry() :
watchPresentFileSystemEntry();
return {
close: function () {
// Close the watcher (either existing file system entry watcher or missing file system entry watcher)
watcher.close();
watcher = undefined;
}
};
/**
* Invoke the callback with rename and update the watcher if not closed
* @param createWatcher
*/
function invokeCallbackAndUpdateWatcher(createWatcher) {
ts.sysLog("sysLog:: " + fileOrDirectory + ":: Changing watcher to " + (createWatcher === watchPresentFileSystemEntry ? "Present" : "Missing") + "FileSystemEntryWatcher");
// Call the callback for current directory
callback("rename", "");
// If watcher is not closed, update it
if (watcher) {
watcher.close();
watcher = createWatcher();
}
}
/**
* Watch the file or directory that is currently present
* and when the watched file or directory is deleted, switch to missing file system entry watcher
*/
function watchPresentFileSystemEntry() {
// Node 4.0 `fs.watch` function supports the "recursive" option on both OSX and Windows
// (ref: https://github.com/nodejs/node/pull/2649 and https://github.com/Microsoft/TypeScript/issues/4643)
if (options === undefined) {
if (fsSupportsRecursiveFsWatch) {
options = { persistent: true, recursive: !!recursive };
}
else {
options = { persistent: true };
}
}
if (hitSystemWatcherLimit) {
ts.sysLog("sysLog:: " + fileOrDirectory + ":: Defaulting to fsWatchFile");
return watchPresentFileSystemEntryWithFsWatchFile();
}
try {
var presentWatcher = _fs.watch(fileOrDirectory, options, isLinuxOrMacOs ?
callbackChangingToMissingFileSystemEntry :
callback);
// Watch the missing file or directory or error
presentWatcher.on("error", function () { return invokeCallbackAndUpdateWatcher(watchMissingFileSystemEntry); });
return presentWatcher;
}
catch (e) {
// Catch the exception and use polling instead
// Eg. on linux the number of watches are limited and one could easily exhaust watches and the exception ENOSPC is thrown when creating watcher at that point
// so instead of throwing error, use fs.watchFile
hitSystemWatcherLimit || (hitSystemWatcherLimit = e.code === "ENOSPC");
ts.sysLog("sysLog:: " + fileOrDirectory + ":: Changing to fsWatchFile");
return watchPresentFileSystemEntryWithFsWatchFile();
}
}
function callbackChangingToMissingFileSystemEntry(event, relativeName) {
// because relativeName is not guaranteed to be correct we need to check on each rename with few combinations
// Eg on ubuntu while watching app/node_modules the relativeName is "node_modules" which is neither relative nor full path
return event === "rename" &&
(!relativeName ||
relativeName === lastDirectoryPart ||
(relativeName.lastIndexOf(lastDirectoryPartWithDirectorySeparator) !== -1 && relativeName.lastIndexOf(lastDirectoryPartWithDirectorySeparator) === relativeName.length - lastDirectoryPartWithDirectorySeparator.length)) &&
!fileSystemEntryExists(fileOrDirectory, entryKind) ?
invokeCallbackAndUpdateWatcher(watchMissingFileSystemEntry) :
callback(event, relativeName);
}
/**
* Watch the file or directory using fs.watchFile since fs.watch threw exception
* Eg. on linux the number of watches are limited and one could easily exhaust watches and the exception ENOSPC is thrown when creating watcher at that point
*/
function watchPresentFileSystemEntryWithFsWatchFile() {
return watchFile(fileOrDirectory, createFileWatcherCallback(callback), fallbackPollingInterval, fallbackOptions);
}
/**
* Watch the file or directory that is missing
* and switch to existing file or directory when the missing filesystem entry is created
*/
function watchMissingFileSystemEntry() {
return watchFile(fileOrDirectory, function (_fileName, eventKind) {
if (eventKind === FileWatcherEventKind.Created && fileSystemEntryExists(fileOrDirectory, entryKind)) {
// Call the callback for current file or directory
// For now it could be callback for the inner directory creation,
// but just return current directory, better than current no-op
invokeCallbackAndUpdateWatcher(watchPresentFileSystemEntry);
}
}, fallbackPollingInterval, fallbackOptions);
}
}
function readFileWorker(fileName, _encoding) {
var buffer;
try {
buffer = _fs.readFileSync(fileName);
}
catch (e) {
return undefined;
}
var len = buffer.length;
if (len >= 2 && buffer[0] === 0xFE && buffer[1] === 0xFF) {
// Big endian UTF-16 byte order mark detected. Since big endian is not supported by node.js,
// flip all byte pairs and treat as little endian.
len &= ~1; // Round down to a multiple of 2
for (var i = 0; i < len; i += 2) {
var temp = buffer[i];
buffer[i] = buffer[i + 1];
buffer[i + 1] = temp;
}
return buffer.toString("utf16le", 2);
}
if (len >= 2 && buffer[0] === 0xFF && buffer[1] === 0xFE) {
// Little endian UTF-16 byte order mark detected
return buffer.toString("utf16le", 2);
}
if (len >= 3 && buffer[0] === 0xEF && buffer[1] === 0xBB && buffer[2] === 0xBF) {
// UTF-8 byte order mark detected
return buffer.toString("utf8", 3);
}
// Default is UTF-8 with no byte order mark
return buffer.toString("utf8");
}
function readFile(fileName, _encoding) {
ts.perfLogger.logStartReadFile(fileName);
var file = readFileWorker(fileName, _encoding);
ts.perfLogger.logStopReadFile();
return file;
}
function writeFile(fileName, data, writeByteOrderMark) {
ts.perfLogger.logEvent("WriteFile: " + fileName);
// If a BOM is required, emit one
if (writeByteOrderMark) {
data = byteOrderMarkIndicator + data;
}
var fd;
try {
fd = _fs.openSync(fileName, "w");
_fs.writeSync(fd, data, /*position*/ undefined, "utf8");
}
finally {
if (fd !== undefined) {
_fs.closeSync(fd);
}
}
}
function getAccessibleFileSystemEntries(path) {
ts.perfLogger.logEvent("ReadDir: " + (path || "."));
try {
var entries = _fs.readdirSync(path || ".", { withFileTypes: true });
var files = [];
var directories = [];
for (var _i = 0, entries_1 = entries; _i < entries_1.length; _i++) {
var dirent = entries_1[_i];
// withFileTypes is not supported before Node 10.10.
var entry = typeof dirent === "string" ? dirent : dirent.name;
// This is necessary because on some file system node fails to exclude
// "." and "..". See https://github.com/nodejs/node/issues/4002
if (entry === "." || entry === "..") {
continue;
}
var stat = void 0;
if (typeof dirent === "string" || dirent.isSymbolicLink()) {
var name = ts.combinePaths(path, entry);
try {
stat = statSync(name);
if (!stat) {
continue;
}
}
catch (e) {
continue;
}
}
else {
stat = dirent;
}
if (stat.isFile()) {
files.push(entry);
}
else if (stat.isDirectory()) {
directories.push(entry);
}
}
files.sort();
directories.sort();
return { files: files, directories: directories };
}
catch (e) {
return ts.emptyFileSystemEntries;
}
}
function readDirectory(path, extensions, excludes, includes, depth) {
return ts.matchFiles(path, extensions, excludes, includes, useCaseSensitiveFileNames, process.cwd(), depth, getAccessibleFileSystemEntries, realpath, directoryExists);
}
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 {
var stat = statSync(path);
if (!stat) {
return false;
}
switch (entryKind) {
case 0 /* File */: return stat.isFile();
case 1 /* Directory */: return stat.isDirectory();
default: return false;
}
}
catch (e) {
return false;
}
finally {
Error.stackTraceLimit = originalStackTraceLimit;
}
}
function fileExists(path) {
return fileSystemEntryExists(path, 0 /* File */);
}
function directoryExists(path) {
return fileSystemEntryExists(path, 1 /* Directory */);
}
function getDirectories(path) {
return getAccessibleFileSystemEntries(path).directories.slice();
}
function realpath(path) {
try {
return realpathSync(path);
}
catch (_a) {
return path;
}
}
function getModifiedTime(path) {
var _a;
try {
return (_a = statSync(path)) === null || _a === void 0 ? void 0 : _a.mtime;
}
catch (e) {
return undefined;
}
}
function setModifiedTime(path, time) {
try {
_fs.utimesSync(path, time, time);
}
catch (e) {
return;
}
}
function deleteFile(path) {
try {
return _fs.unlinkSync(path);
}
catch (e) {
return;
}
}
function createSHA256Hash(data) {
var hash = _crypto.createHash("sha256");
hash.update(data);
return hash.digest("hex");
}
}
var sys;
if (typeof process !== "undefined" && process.nextTick && !process.browser && typeof require !== "undefined") {
// process and process.nextTick checks if current environment is node-like
// process.browser check excludes webpack and browserify
sys = getNodeSystem();
}
if (sys) {
// patch writefile to create folder before writing the file
patchWriteFileEnsuringDirectory(sys);
}
return sys;
})();
if (ts.sys && ts.sys.getEnvironmentVariable) {
setCustomPollingValues(ts.sys);
ts.Debug.setAssertionLevel(/^development$/i.test(ts.sys.getEnvironmentVariable("NODE_ENV"))
? 1 /* Normal */
: 0 /* None */);
}
if (ts.sys && ts.sys.debugMode) {
ts.Debug.isDebugging = true;
}
})(ts || (ts = {}));
// <auto-generated />
// generated from './diagnosticInformationMap.generated.ts' by 'src/compiler'
/* @internal */
var ts;
(function (ts) {
function diag(code, category, key, message, reportsUnnecessary, elidedInCompatabilityPyramid, reportsDeprecated) {
return { code: code, category: category, key: key, message: message, reportsUnnecessary: reportsUnnecessary, elidedInCompatabilityPyramid: elidedInCompatabilityPyramid, reportsDeprecated: reportsDeprecated };
}
ts.Diagnostics = {
Unterminated_string_literal: diag(1002, ts.DiagnosticCategory.Error, "Unterminated_string_literal_1002", "Unterminated string literal."),
Identifier_expected: diag(1003, ts.DiagnosticCategory.Error, "Identifier_expected_1003", "Identifier expected."),
_0_expected: diag(1005, ts.DiagnosticCategory.Error, "_0_expected_1005", "'{0}' expected."),
A_file_cannot_have_a_reference_to_itself: diag(1006, ts.DiagnosticCategory.Error, "A_file_cannot_have_a_reference_to_itself_1006", "A file cannot have a reference to itself."),
The_parser_expected_to_find_a_to_match_the_token_here: diag(1007, ts.DiagnosticCategory.Error, "The_parser_expected_to_find_a_to_match_the_token_here_1007", "The parser expected to find a '}' to match the '{' token here."),
Trailing_comma_not_allowed: diag(1009, ts.DiagnosticCategory.Error, "Trailing_comma_not_allowed_1009", "Trailing comma not allowed."),
Asterisk_Slash_expected: diag(1010, ts.DiagnosticCategory.Error, "Asterisk_Slash_expected_1010", "'*/' expected."),
An_element_access_expression_should_take_an_argument: diag(1011, ts.DiagnosticCategory.Error, "An_element_access_expression_should_take_an_argument_1011", "An element access expression should take an argument."),
Unexpected_token: diag(1012, ts.DiagnosticCategory.Error, "Unexpected_token_1012", "Unexpected token."),
A_rest_parameter_or_binding_pattern_may_not_have_a_trailing_comma: diag(1013, ts.DiagnosticCategory.Error, "A_rest_parameter_or_binding_pattern_may_not_have_a_trailing_comma_1013", "A rest parameter or binding pattern may not have a trailing comma."),
A_rest_parameter_must_be_last_in_a_parameter_list: diag(1014, ts.DiagnosticCategory.Error, "A_rest_parameter_must_be_last_in_a_parameter_list_1014", "A rest parameter must be last in a parameter list."),
Parameter_cannot_have_question_mark_and_initializer: diag(1015, ts.DiagnosticCategory.Error, "Parameter_cannot_have_question_mark_and_initializer_1015", "Parameter cannot have question mark and initializer."),
A_required_parameter_cannot_follow_an_optional_parameter: diag(1016, ts.DiagnosticCategory.Error, "A_required_parameter_cannot_follow_an_optional_parameter_1016", "A required parameter cannot follow an optional parameter."),
An_index_signature_cannot_have_a_rest_parameter: diag(1017, ts.DiagnosticCategory.Error, "An_index_signature_cannot_have_a_rest_parameter_1017", "An index signature cannot have a rest parameter."),
An_index_signature_parameter_cannot_have_an_accessibility_modifier: diag(1018, ts.DiagnosticCategory.Error, "An_index_signature_parameter_cannot_have_an_accessibility_modifier_1018", "An index signature parameter cannot have an accessibility modifier."),
An_index_signature_parameter_cannot_have_a_question_mark: diag(1019, ts.DiagnosticCategory.Error, "An_index_signature_parameter_cannot_have_a_question_mark_1019", "An index signature parameter cannot have a question mark."),
An_index_signature_parameter_cannot_have_an_initializer: diag(1020, ts.DiagnosticCategory.Error, "An_index_signature_parameter_cannot_have_an_initializer_1020", "An index signature parameter cannot have an initializer."),
An_index_signature_must_have_a_type_annotation: diag(1021, ts.DiagnosticCategory.Error, "An_index_signature_must_have_a_type_annotation_1021", "An index signature must have a type annotation."),
An_index_signature_parameter_must_have_a_type_annotation: diag(1022, ts.DiagnosticCategory.Error, "An_index_signature_parameter_must_have_a_type_annotation_1022", "An index signature parameter must have a type annotation."),
readonly_modifier_can_only_appear_on_a_property_declaration_or_index_signature: diag(1024, ts.DiagnosticCategory.Error, "readonly_modifier_can_only_appear_on_a_property_declaration_or_index_signature_1024", "'readonly' modifier can only appear on a property declaration or index signature."),
An_index_signature_cannot_have_a_trailing_comma: diag(1025, ts.DiagnosticCategory.Error, "An_index_signature_cannot_have_a_trailing_comma_1025", "An index signature cannot have a trailing comma."),
Accessibility_modifier_already_seen: diag(1028, ts.DiagnosticCategory.Error, "Accessibility_modifier_already_seen_1028", "Accessibility modifier already seen."),
_0_modifier_must_precede_1_modifier: diag(1029, ts.DiagnosticCategory.Error, "_0_modifier_must_precede_1_modifier_1029", "'{0}' modifier must precede '{1}' modifier."),
_0_modifier_already_seen: diag(1030, ts.DiagnosticCategory.Error, "_0_modifier_already_seen_1030", "'{0}' modifier already seen."),
_0_modifier_cannot_appear_on_class_elements_of_this_kind: diag(1031, ts.DiagnosticCategory.Error, "_0_modifier_cannot_appear_on_class_elements_of_this_kind_1031", "'{0}' modifier cannot appear on class elements of this kind."),
super_must_be_followed_by_an_argument_list_or_member_access: diag(1034, ts.DiagnosticCategory.Error, "super_must_be_followed_by_an_argument_list_or_member_access_1034", "'super' must be followed by an argument list or member access."),
Only_ambient_modules_can_use_quoted_names: diag(1035, ts.DiagnosticCategory.Error, "Only_ambient_modules_can_use_quoted_names_1035", "Only ambient modules can use quoted names."),
Statements_are_not_allowed_in_ambient_contexts: diag(1036, ts.DiagnosticCategory.Error, "Statements_are_not_allowed_in_ambient_contexts_1036", "Statements are not allowed in ambient contexts."),
A_declare_modifier_cannot_be_used_in_an_already_ambient_context: diag(1038, ts.DiagnosticCategory.Error, "A_declare_modifier_cannot_be_used_in_an_already_ambient_context_1038", "A 'declare' modifier cannot be used in an already ambient context."),
Initializers_are_not_allowed_in_ambient_contexts: diag(1039, ts.DiagnosticCategory.Error, "Initializers_are_not_allowed_in_ambient_contexts_1039", "Initializers are not allowed in ambient contexts."),
_0_modifier_cannot_be_used_in_an_ambient_context: diag(1040, ts.DiagnosticCategory.Error, "_0_modifier_cannot_be_used_in_an_ambient_context_1040", "'{0}' modifier cannot be used in an ambient context."),
_0_modifier_cannot_be_used_with_a_class_declaration: diag(1041, ts.DiagnosticCategory.Error, "_0_modifier_cannot_be_used_with_a_class_declaration_1041", "'{0}' modifier cannot be used with a class declaration."),
_0_modifier_cannot_be_used_here: diag(1042, ts.DiagnosticCategory.Error, "_0_modifier_cannot_be_used_here_1042", "'{0}' modifier cannot be used here."),
_0_modifier_cannot_appear_on_a_data_property: diag(1043, ts.DiagnosticCategory.Error, "_0_modifier_cannot_appear_on_a_data_property_1043", "'{0}' modifier cannot appear on a data property."),
_0_modifier_cannot_appear_on_a_module_or_namespace_element: diag(1044, ts.DiagnosticCategory.Error, "_0_modifier_cannot_appear_on_a_module_or_namespace_element_1044", "'{0}' modifier cannot appear on a module or namespace element."),
A_0_modifier_cannot_be_used_with_an_interface_declaration: diag(1045, ts.DiagnosticCategory.Error, "A_0_modifier_cannot_be_used_with_an_interface_declaration_1045", "A '{0}' modifier cannot be used with an interface declaration."),
Top_level_declarations_in_d_ts_files_must_start_with_either_a_declare_or_export_modifier: diag(1046, ts.DiagnosticCategory.Error, "Top_level_declarations_in_d_ts_files_must_start_with_either_a_declare_or_export_modifier_1046", "Top-level declarations in .d.ts files must start with either a 'declare' or 'export' modifier."),
A_rest_parameter_cannot_be_optional: diag(1047, ts.DiagnosticCategory.Error, "A_rest_parameter_cannot_be_optional_1047", "A rest parameter cannot be optional."),
A_rest_parameter_cannot_have_an_initializer: diag(1048, ts.DiagnosticCategory.Error, "A_rest_parameter_cannot_have_an_initializer_1048", "A rest parameter cannot have an initializer."),
A_set_accessor_must_have_exactly_one_parameter: diag(1049, ts.DiagnosticCategory.Error, "A_set_accessor_must_have_exactly_one_parameter_1049", "A 'set' accessor must have exactly one parameter."),
A_set_accessor_cannot_have_an_optional_parameter: diag(1051, ts.DiagnosticCategory.Error, "A_set_accessor_cannot_have_an_optional_parameter_1051", "A 'set' accessor cannot have an optional parameter."),
A_set_accessor_parameter_cannot_have_an_initializer: diag(1052, ts.DiagnosticCategory.Error, "A_set_accessor_parameter_cannot_have_an_initializer_1052", "A 'set' accessor parameter cannot have an initializer."),
A_set_accessor_cannot_have_rest_parameter: diag(1053, ts.DiagnosticCategory.Error, "A_set_accessor_cannot_have_rest_parameter_1053", "A 'set' accessor cannot have rest parameter."),
A_get_accessor_cannot_have_parameters: diag(1054, ts.DiagnosticCategory.Error, "A_get_accessor_cannot_have_parameters_1054", "A 'get' accessor cannot have parameters."),
Type_0_is_not_a_valid_async_function_return_type_in_ES5_SlashES3_because_it_does_not_refer_to_a_Promise_compatible_constructor_value: diag(1055, ts.DiagnosticCategory.Error, "Type_0_is_not_a_valid_async_function_return_type_in_ES5_SlashES3_because_it_does_not_refer_to_a_Prom_1055", "Type '{0}' is not a valid async function return type in ES5/ES3 because it does not refer to a Promise-compatible constructor value."),
Accessors_are_only_available_when_targeting_ECMAScript_5_and_higher: diag(1056, ts.DiagnosticCategory.Error, "Accessors_are_only_available_when_targeting_ECMAScript_5_and_higher_1056", "Accessors are only available when targeting ECMAScript 5 and higher."),
An_async_function_or_method_must_have_a_valid_awaitable_return_type: diag(1057, ts.DiagnosticCategory.Error, "An_async_function_or_method_must_have_a_valid_awaitable_return_type_1057", "An async function or method must have a valid awaitable return type."),
The_return_type_of_an_async_function_must_either_be_a_valid_promise_or_must_not_contain_a_callable_then_member: diag(1058, ts.DiagnosticCategory.Error, "The_return_type_of_an_async_function_must_either_be_a_valid_promise_or_must_not_contain_a_callable_t_1058", "The return type of an async function must either be a valid promise or must not contain a callable 'then' member."),
A_promise_must_have_a_then_method: diag(1059, ts.DiagnosticCategory.Error, "A_promise_must_have_a_then_method_1059", "A promise must have a 'then' method."),
The_first_parameter_of_the_then_method_of_a_promise_must_be_a_callback: diag(1060, ts.DiagnosticCategory.Error, "The_first_parameter_of_the_then_method_of_a_promise_must_be_a_callback_1060", "The first parameter of the 'then' method of a promise must be a callback."),
Enum_member_must_have_initializer: diag(1061, ts.DiagnosticCategory.Error, "Enum_member_must_have_initializer_1061", "Enum member must have initializer."),
Type_is_referenced_directly_or_indirectly_in_the_fulfillment_callback_of_its_own_then_method: diag(1062, ts.DiagnosticCategory.Error, "Type_is_referenced_directly_or_indirectly_in_the_fulfillment_callback_of_its_own_then_method_1062", "Type is referenced directly or indirectly in the fulfillment callback of its own 'then' method."),
An_export_assignment_cannot_be_used_in_a_namespace: diag(1063, ts.DiagnosticCategory.Error, "An_export_assignment_cannot_be_used_in_a_namespace_1063", "An export assignment cannot be used in a namespace."),
The_return_type_of_an_async_function_or_method_must_be_the_global_Promise_T_type_Did_you_mean_to_write_Promise_0: diag(1064, ts.DiagnosticCategory.Error, "The_return_type_of_an_async_function_or_method_must_be_the_global_Promise_T_type_Did_you_mean_to_wri_1064", "The return type of an async function or method must be the global Promise<T> type. Did you mean to write 'Promise<{0}>'?"),
In_ambient_enum_declarations_member_initializer_must_be_constant_expression: diag(1066, ts.DiagnosticCategory.Error, "In_ambient_enum_declarations_member_initializer_must_be_constant_expression_1066", "In ambient enum declarations member initializer must be constant expression."),
Unexpected_token_A_constructor_method_accessor_or_property_was_expected: diag(1068, ts.DiagnosticCategory.Error, "Unexpected_token_A_constructor_method_accessor_or_property_was_expected_1068", "Unexpected token. A constructor, method, accessor, or property was expected."),
Unexpected_token_A_type_parameter_name_was_expected_without_curly_braces: diag(1069, ts.DiagnosticCategory.Error, "Unexpected_token_A_type_parameter_name_was_expected_without_curly_braces_1069", "Unexpected token. A type parameter name was expected without curly braces."),
_0_modifier_cannot_appear_on_a_type_member: diag(1070, ts.DiagnosticCategory.Error, "_0_modifier_cannot_appear_on_a_type_member_1070", "'{0}' modifier cannot appear on a type member."),
_0_modifier_cannot_appear_on_an_index_signature: diag(1071, ts.DiagnosticCategory.Error, "_0_modifier_cannot_appear_on_an_index_signature_1071", "'{0}' modifier cannot appear on an index signature."),
A_0_modifier_cannot_be_used_with_an_import_declaration: diag(1079, ts.DiagnosticCategory.Error, "A_0_modifier_cannot_be_used_with_an_import_declaration_1079", "A '{0}' modifier cannot be used with an import declaration."),
Invalid_reference_directive_syntax: diag(1084, ts.DiagnosticCategory.Error, "Invalid_reference_directive_syntax_1084", "Invalid 'reference' directive syntax."),
Octal_literals_are_not_available_when_targeting_ECMAScript_5_and_higher_Use_the_syntax_0: diag(1085, ts.DiagnosticCategory.Error, "Octal_literals_are_not_available_when_targeting_ECMAScript_5_and_higher_Use_the_syntax_0_1085", "Octal literals are not available when targeting ECMAScript 5 and higher. Use the syntax '{0}'."),
_0_modifier_cannot_appear_on_a_constructor_declaration: diag(1089, ts.DiagnosticCategory.Error, "_0_modifier_cannot_appear_on_a_constructor_declaration_1089", "'{0}' modifier cannot appear on a constructor declaration."),
_0_modifier_cannot_appear_on_a_parameter: diag(1090, ts.DiagnosticCategory.Error, "_0_modifier_cannot_appear_on_a_parameter_1090", "'{0}' modifier cannot appear on a parameter."),
Only_a_single_variable_declaration_is_allowed_in_a_for_in_statement: diag(1091, ts.DiagnosticCategory.Error, "Only_a_single_variable_declaration_is_allowed_in_a_for_in_statement_1091", "Only a single variable declaration is allowed in a 'for...in' statement."),
Type_parameters_cannot_appear_on_a_constructor_declaration: diag(1092, ts.DiagnosticCategory.Error, "Type_parameters_cannot_appear_on_a_constructor_declaration_1092", "Type parameters cannot appear on a constructor declaration."),
Type_annotation_cannot_appear_on_a_constructor_declaration: diag(1093, ts.DiagnosticCategory.Error, "Type_annotation_cannot_appear_on_a_constructor_declaration_1093", "Type annotation cannot appear on a constructor declaration."),
An_accessor_cannot_have_type_parameters: diag(1094, ts.DiagnosticCategory.Error, "An_accessor_cannot_have_type_parameters_1094", "An accessor cannot have type parameters."),
A_set_accessor_cannot_have_a_return_type_annotation: diag(1095, ts.DiagnosticCategory.Error, "A_set_accessor_cannot_have_a_return_type_annotation_1095", "A 'set' accessor cannot have a return type annotation."),
An_index_signature_must_have_exactly_one_parameter: diag(1096, ts.DiagnosticCategory.Error, "An_index_signature_must_have_exactly_one_parameter_1096", "An index signature must have exactly one parameter."),
_0_list_cannot_be_empty: diag(1097, ts.DiagnosticCategory.Error, "_0_list_cannot_be_empty_1097", "'{0}' list cannot be empty."),
Type_parameter_list_cannot_be_empty: diag(1098, ts.DiagnosticCategory.Error, "Type_parameter_list_cannot_be_empty_1098", "Type parameter list cannot be empty."),
Type_argument_list_cannot_be_empty: diag(1099, ts.DiagnosticCategory.Error, "Type_argument_list_cannot_be_empty_1099", "Type argument list cannot be empty."),
Invalid_use_of_0_in_strict_mode: diag(1100, ts.DiagnosticCategory.Error, "Invalid_use_of_0_in_strict_mode_1100", "Invalid use of '{0}' in strict mode."),
with_statements_are_not_allowed_in_strict_mode: diag(1101, ts.DiagnosticCategory.Error, "with_statements_are_not_allowed_in_strict_mode_1101", "'with' statements are not allowed in strict mode."),
delete_cannot_be_called_on_an_identifier_in_strict_mode: diag(1102, ts.DiagnosticCategory.Error, "delete_cannot_be_called_on_an_identifier_in_strict_mode_1102", "'delete' cannot be called on an identifier in strict mode."),
for_await_loops_are_only_allowed_within_async_functions_and_at_the_top_levels_of_modules: diag(1103, ts.DiagnosticCategory.Error, "for_await_loops_are_only_allowed_within_async_functions_and_at_the_top_levels_of_modules_1103", "'for await' loops are only allowed within async functions and at the top levels of modules."),
A_continue_statement_can_only_be_used_within_an_enclosing_iteration_statement: diag(1104, ts.DiagnosticCategory.Error, "A_continue_statement_can_only_be_used_within_an_enclosing_iteration_statement_1104", "A 'continue' statement can only be used within an enclosing iteration statement."),
A_break_statement_can_only_be_used_within_an_enclosing_iteration_or_switch_statement: diag(1105, ts.DiagnosticCategory.Error, "A_break_statement_can_only_be_used_within_an_enclosing_iteration_or_switch_statement_1105", "A 'break' statement can only be used within an enclosing iteration or switch statement."),
The_left_hand_side_of_a_for_of_statement_may_not_be_async: diag(1106, ts.DiagnosticCategory.Error, "The_left_hand_side_of_a_for_of_statement_may_not_be_async_1106", "The left-hand side of a 'for...of' statement may not be 'async'."),
Jump_target_cannot_cross_function_boundary: diag(1107, ts.DiagnosticCategory.Error, "Jump_target_cannot_cross_function_boundary_1107", "Jump target cannot cross function boundary."),
A_return_statement_can_only_be_used_within_a_function_body: diag(1108, ts.DiagnosticCategory.Error, "A_return_statement_can_only_be_used_within_a_function_body_1108", "A 'return' statement can only be used within a function body."),
Expression_expected: diag(1109, ts.DiagnosticCategory.Error, "Expression_expected_1109", "Expression expected."),
Type_expected: diag(1110, ts.DiagnosticCategory.Error, "Type_expected_1110", "Type expected."),
A_default_clause_cannot_appear_more_than_once_in_a_switch_statement: diag(1113, ts.DiagnosticCategory.Error, "A_default_clause_cannot_appear_more_than_once_in_a_switch_statement_1113", "A 'default' clause cannot appear more than once in a 'switch' statement."),
Duplicate_label_0: diag(1114, ts.DiagnosticCategory.Error, "Duplicate_label_0_1114", "Duplicate label '{0}'."),
A_continue_statement_can_only_jump_to_a_label_of_an_enclosing_iteration_statement: diag(1115, ts.DiagnosticCategory.Error, "A_continue_statement_can_only_jump_to_a_label_of_an_enclosing_iteration_statement_1115", "A 'continue' statement can only jump to a label of an enclosing iteration statement."),
A_break_statement_can_only_jump_to_a_label_of_an_enclosing_statement: diag(1116, ts.DiagnosticCategory.Error, "A_break_statement_can_only_jump_to_a_label_of_an_enclosing_statement_1116", "A 'break' statement can only jump to a label of an enclosing statement."),
An_object_literal_cannot_have_multiple_properties_with_the_same_name_in_strict_mode: diag(1117, ts.DiagnosticCategory.Error, "An_object_literal_cannot_have_multiple_properties_with_the_same_name_in_strict_mode_1117", "An object literal cannot have multiple properties with the same name in strict mode."),
An_object_literal_cannot_have_multiple_get_Slashset_accessors_with_the_same_name: diag(1118, ts.DiagnosticCategory.Error, "An_object_literal_cannot_have_multiple_get_Slashset_accessors_with_the_same_name_1118", "An object literal cannot have multiple get/set accessors with the same name."),
An_object_literal_cannot_have_property_and_accessor_with_the_same_name: diag(1119, ts.DiagnosticCategory.Error, "An_object_literal_cannot_have_property_and_accessor_with_the_same_name_1119", "An object literal cannot have property and accessor with the same name."),
An_export_assignment_cannot_have_modifiers: diag(1120, ts.DiagnosticCategory.Error, "An_export_assignment_cannot_have_modifiers_1120", "An export assignment cannot have modifiers."),
Octal_literals_are_not_allowed_in_strict_mode: diag(1121, ts.DiagnosticCategory.Error, "Octal_literals_are_not_allowed_in_strict_mode_1121", "Octal literals are not allowed in strict mode."),
Variable_declaration_list_cannot_be_empty: diag(1123, ts.DiagnosticCategory.Error, "Variable_declaration_list_cannot_be_empty_1123", "Variable declaration list cannot be empty."),
Digit_expected: diag(1124, ts.DiagnosticCategory.Error, "Digit_expected_1124", "Digit expected."),
Hexadecimal_digit_expected: diag(1125, ts.DiagnosticCategory.Error, "Hexadecimal_digit_expected_1125", "Hexadecimal digit expected."),
Unexpected_end_of_text: diag(1126, ts.DiagnosticCategory.Error, "Unexpected_end_of_text_1126", "Unexpected end of text."),
Invalid_character: diag(1127, ts.DiagnosticCategory.Error, "Invalid_character_1127", "Invalid character."),
Declaration_or_statement_expected: diag(1128, ts.DiagnosticCategory.Error, "Declaration_or_statement_expected_1128", "Declaration or statement expected."),
Statement_expected: diag(1129, ts.DiagnosticCategory.Error, "Statement_expected_1129", "Statement expected."),
case_or_default_expected: diag(1130, ts.DiagnosticCategory.Error, "case_or_default_expected_1130", "'case' or 'default' expected."),
Property_or_signature_expected: diag(1131, ts.DiagnosticCategory.Error, "Property_or_signature_expected_1131", "Property or signature expected."),
Enum_member_expected: diag(1132, ts.DiagnosticCategory.Error, "Enum_member_expected_1132", "Enum member expected."),
Variable_declaration_expected: diag(1134, ts.DiagnosticCategory.Error, "Variable_declaration_expected_1134", "Variable declaration expected."),
Argument_expression_expected: diag(1135, ts.DiagnosticCategory.Error, "Argument_expression_expected_1135", "Argument expression expected."),
Property_assignment_expected: diag(1136, ts.DiagnosticCategory.Error, "Property_assignment_expected_1136", "Property assignment expected."),
Expression_or_comma_expected: diag(1137, ts.DiagnosticCategory.Error, "Expression_or_comma_expected_1137", "Expression or comma expected."),
Parameter_declaration_expected: diag(1138, ts.DiagnosticCategory.Error, "Parameter_declaration_expected_1138", "Parameter declaration expected."),
Type_parameter_declaration_expected: diag(1139, ts.DiagnosticCategory.Error, "Type_parameter_declaration_expected_1139", "Type parameter declaration expected."),
Type_argument_expected: diag(1140, ts.DiagnosticCategory.Error, "Type_argument_expected_1140", "Type argument expected."),
String_literal_expected: diag(1141, ts.DiagnosticCategory.Error, "String_literal_expected_1141", "String literal expected."),
Line_break_not_permitted_here: diag(1142, ts.DiagnosticCategory.Error, "Line_break_not_permitted_here_1142", "Line break not permitted here."),
or_expected: diag(1144, ts.DiagnosticCategory.Error, "or_expected_1144", "'{' or ';' expected."),
Declaration_expected: diag(1146, ts.DiagnosticCategory.Error, "Declaration_expected_1146", "Declaration expected."),
Import_declarations_in_a_namespace_cannot_reference_a_module: diag(1147, ts.DiagnosticCategory.Error, "Import_declarations_in_a_namespace_cannot_reference_a_module_1147", "Import declarations in a namespace cannot reference a module."),
Cannot_use_imports_exports_or_module_augmentations_when_module_is_none: diag(1148, ts.DiagnosticCategory.Error, "Cannot_use_imports_exports_or_module_augmentations_when_module_is_none_1148", "Cannot use imports, exports, or module augmentations when '--module' is 'none'."),
File_name_0_differs_from_already_included_file_name_1_only_in_casing: diag(1149, ts.DiagnosticCategory.Error, "File_name_0_differs_from_already_included_file_name_1_only_in_casing_1149", "File name '{0}' differs from already included file name '{1}' only in casing."),
const_declarations_must_be_initialized: diag(1155, ts.DiagnosticCategory.Error, "const_declarations_must_be_initialized_1155", "'const' declarations must be initialized."),
const_declarations_can_only_be_declared_inside_a_block: diag(1156, ts.DiagnosticCategory.Error, "const_declarations_can_only_be_declared_inside_a_block_1156", "'const' declarations can only be declared inside a block."),
let_declarations_can_only_be_declared_inside_a_block: diag(1157, ts.DiagnosticCategory.Error, "let_declarations_can_only_be_declared_inside_a_block_1157", "'let' declarations can only be declared inside a block."),
Unterminated_template_literal: diag(1160, ts.DiagnosticCategory.Error, "Unterminated_template_literal_1160", "Unterminated template literal."),
Unterminated_regular_expression_literal: diag(1161, ts.DiagnosticCategory.Error, "Unterminated_regular_expression_literal_1161", "Unterminated regular expression literal."),
An_object_member_cannot_be_declared_optional: diag(1162, ts.DiagnosticCategory.Error, "An_object_member_cannot_be_declared_optional_1162", "An object member cannot be declared optional."),
A_yield_expression_is_only_allowed_in_a_generator_body: diag(1163, ts.DiagnosticCategory.Error, "A_yield_expression_is_only_allowed_in_a_generator_body_1163", "A 'yield' expression is only allowed in a generator body."),
Computed_property_names_are_not_allowed_in_enums: diag(1164, ts.DiagnosticCategory.Error, "Computed_property_names_are_not_allowed_in_enums_1164", "Computed property names are not allowed in enums."),
A_computed_property_name_in_an_ambient_context_must_refer_to_an_expression_whose_type_is_a_literal_type_or_a_unique_symbol_type: diag(1165, ts.DiagnosticCategory.Error, "A_computed_property_name_in_an_ambient_context_must_refer_to_an_expression_whose_type_is_a_literal_t_1165", "A computed property name in an ambient context must refer to an expression whose type is a literal type or a 'unique symbol' type."),
A_computed_property_name_in_a_class_property_declaration_must_have_a_simple_literal_type_or_a_unique_symbol_type: diag(1166, ts.DiagnosticCategory.Error, "A_computed_property_name_in_a_class_property_declaration_must_have_a_simple_literal_type_or_a_unique_1166", "A computed property name in a class property declaration must have a simple literal type or a 'unique symbol' type."),
A_computed_property_name_in_a_method_overload_must_refer_to_an_expression_whose_type_is_a_literal_type_or_a_unique_symbol_type: diag(1168, ts.DiagnosticCategory.Error, "A_computed_property_name_in_a_method_overload_must_refer_to_an_expression_whose_type_is_a_literal_ty_1168", "A computed property name in a method overload must refer to an expression whose type is a literal type or a 'unique symbol' type."),
A_computed_property_name_in_an_interface_must_refer_to_an_expression_whose_type_is_a_literal_type_or_a_unique_symbol_type: diag(1169, ts.DiagnosticCategory.Error, "A_computed_property_name_in_an_interface_must_refer_to_an_expression_whose_type_is_a_literal_type_or_1169", "A computed property name in an interface must refer to an expression whose type is a literal type or a 'unique symbol' type."),
A_computed_property_name_in_a_type_literal_must_refer_to_an_expression_whose_type_is_a_literal_type_or_a_unique_symbol_type: diag(1170, ts.DiagnosticCategory.Error, "A_computed_property_name_in_a_type_literal_must_refer_to_an_expression_whose_type_is_a_literal_type__1170", "A computed property name in a type literal must refer to an expression whose type is a literal type or a 'unique symbol' type."),
A_comma_expression_is_not_allowed_in_a_computed_property_name: diag(1171, ts.DiagnosticCategory.Error, "A_comma_expression_is_not_allowed_in_a_computed_property_name_1171", "A comma expression is not allowed in a computed property name."),
extends_clause_already_seen: diag(1172, ts.DiagnosticCategory.Error, "extends_clause_already_seen_1172", "'extends' clause already seen."),
extends_clause_must_precede_implements_clause: diag(1173, ts.DiagnosticCategory.Error, "extends_clause_must_precede_implements_clause_1173", "'extends' clause must precede 'implements' clause."),
Classes_can_only_extend_a_single_class: diag(1174, ts.DiagnosticCategory.Error, "Classes_can_only_extend_a_single_class_1174", "Classes can only extend a single class."),
implements_clause_already_seen: diag(1175, ts.DiagnosticCategory.Error, "implements_clause_already_seen_1175", "'implements' clause already seen."),
Interface_declaration_cannot_have_implements_clause: diag(1176, ts.DiagnosticCategory.Error, "Interface_declaration_cannot_have_implements_clause_1176", "Interface declaration cannot have 'implements' clause."),
Binary_digit_expected: diag(1177, ts.DiagnosticCategory.Error, "Binary_digit_expected_1177", "Binary digit expected."),
Octal_digit_expected: diag(1178, ts.DiagnosticCategory.Error, "Octal_digit_expected_1178", "Octal digit expected."),
Unexpected_token_expected: diag(1179, ts.DiagnosticCategory.Error, "Unexpected_token_expected_1179", "Unexpected token. '{' expected."),
Property_destructuring_pattern_expected: diag(1180, ts.DiagnosticCategory.Error, "Property_destructuring_pattern_expected_1180", "Property destructuring pattern expected."),
Array_element_destructuring_pattern_expected: diag(1181, ts.DiagnosticCategory.Error, "Array_element_destructuring_pattern_expected_1181", "Array element destructuring pattern expected."),
A_destructuring_declaration_must_have_an_initializer: diag(1182, ts.DiagnosticCategory.Error, "A_destructuring_declaration_must_have_an_initializer_1182", "A destructuring declaration must have an initializer."),
An_implementation_cannot_be_declared_in_ambient_contexts: diag(1183, ts.DiagnosticCategory.Error, "An_implementation_cannot_be_declared_in_ambient_contexts_1183", "An implementation cannot be declared in ambient contexts."),
Modifiers_cannot_appear_here: diag(1184, ts.DiagnosticCategory.Error, "Modifiers_cannot_appear_here_1184", "Modifiers cannot appear here."),
Merge_conflict_marker_encountered: diag(1185, ts.DiagnosticCategory.Error, "Merge_conflict_marker_encountered_1185", "Merge conflict marker encountered."),
A_rest_element_cannot_have_an_initializer: diag(1186, ts.DiagnosticCategory.Error, "A_rest_element_cannot_have_an_initializer_1186", "A rest element cannot have an initializer."),
A_parameter_property_may_not_be_declared_using_a_binding_pattern: diag(1187, ts.DiagnosticCategory.Error, "A_parameter_property_may_not_be_declared_using_a_binding_pattern_1187", "A parameter property may not be declared using a binding pattern."),
Only_a_single_variable_declaration_is_allowed_in_a_for_of_statement: diag(1188, ts.DiagnosticCategory.Error, "Only_a_single_variable_declaration_is_allowed_in_a_for_of_statement_1188", "Only a single variable declaration is allowed in a 'for...of' statement."),
The_variable_declaration_of_a_for_in_statement_cannot_have_an_initializer: diag(1189, ts.DiagnosticCategory.Error, "The_variable_declaration_of_a_for_in_statement_cannot_have_an_initializer_1189", "The variable declaration of a 'for...in' statement cannot have an initializer."),
The_variable_declaration_of_a_for_of_statement_cannot_have_an_initializer: diag(1190, ts.DiagnosticCategory.Error, "The_variable_declaration_of_a_for_of_statement_cannot_have_an_initializer_1190", "The variable declaration of a 'for...of' statement cannot have an initializer."),
An_import_declaration_cannot_have_modifiers: diag(1191, ts.DiagnosticCategory.Error, "An_import_declaration_cannot_have_modifiers_1191", "An import declaration cannot have modifiers."),
Module_0_has_no_default_export: diag(1192, ts.DiagnosticCategory.Error, "Module_0_has_no_default_export_1192", "Module '{0}' has no default export."),
An_export_declaration_cannot_have_modifiers: diag(1193, ts.DiagnosticCategory.Error, "An_export_declaration_cannot_have_modifiers_1193", "An export declaration cannot have modifiers."),
Export_declarations_are_not_permitted_in_a_namespace: diag(1194, ts.DiagnosticCategory.Error, "Export_declarations_are_not_permitted_in_a_namespace_1194", "Export declarations are not permitted in a namespace."),
export_Asterisk_does_not_re_export_a_default: diag(1195, ts.DiagnosticCategory.Error, "export_Asterisk_does_not_re_export_a_default_1195", "'export *' does not re-export a default."),
Catch_clause_variable_type_annotation_must_be_any_or_unknown_if_specified: diag(1196, ts.DiagnosticCategory.Error, "Catch_clause_variable_type_annotation_must_be_any_or_unknown_if_specified_1196", "Catch clause variable type annotation must be 'any' or 'unknown' if specified."),
Catch_clause_variable_cannot_have_an_initializer: diag(1197, ts.DiagnosticCategory.Error, "Catch_clause_variable_cannot_have_an_initializer_1197", "Catch clause variable cannot have an initializer."),
An_extended_Unicode_escape_value_must_be_between_0x0_and_0x10FFFF_inclusive: diag(1198, ts.DiagnosticCategory.Error, "An_extended_Unicode_escape_value_must_be_between_0x0_and_0x10FFFF_inclusive_1198", "An extended Unicode escape value must be between 0x0 and 0x10FFFF inclusive."),
Unterminated_Unicode_escape_sequence: diag(1199, ts.DiagnosticCategory.Error, "Unterminated_Unicode_escape_sequence_1199", "Unterminated Unicode escape sequence."),
Line_terminator_not_permitted_before_arrow: diag(1200, ts.DiagnosticCategory.Error, "Line_terminator_not_permitted_before_arrow_1200", "Line terminator not permitted before arrow."),
Import_assignment_cannot_be_used_when_targeting_ECMAScript_modules_Consider_using_import_Asterisk_as_ns_from_mod_import_a_from_mod_import_d_from_mod_or_another_module_format_instead: diag(1202, ts.DiagnosticCategory.Error, "Import_assignment_cannot_be_used_when_targeting_ECMAScript_modules_Consider_using_import_Asterisk_as_1202", "Import assignment cannot be used when targeting ECMAScript modules. Consider using 'import * as ns from \"mod\"', 'import {a} from \"mod\"', 'import d from \"mod\"', or another module format instead."),
Export_assignment_cannot_be_used_when_targeting_ECMAScript_modules_Consider_using_export_default_or_another_module_format_instead: diag(1203, ts.DiagnosticCategory.Error, "Export_assignment_cannot_be_used_when_targeting_ECMAScript_modules_Consider_using_export_default_or__1203", "Export assignment cannot be used when targeting ECMAScript modules. Consider using 'export default' or another module format instead."),
Re_exporting_a_type_when_the_isolatedModules_flag_is_provided_requires_using_export_type: diag(1205, ts.DiagnosticCategory.Error, "Re_exporting_a_type_when_the_isolatedModules_flag_is_provided_requires_using_export_type_1205", "Re-exporting a type when the '--isolatedModules' flag is provided requires using 'export type'."),
Decorators_are_not_valid_here: diag(1206, ts.DiagnosticCategory.Error, "Decorators_are_not_valid_here_1206", "Decorators are not valid here."),
Decorators_cannot_be_applied_to_multiple_get_Slashset_accessors_of_the_same_name: diag(1207, ts.DiagnosticCategory.Error, "Decorators_cannot_be_applied_to_multiple_get_Slashset_accessors_of_the_same_name_1207", "Decorators cannot be applied to multiple get/set accessors of the same name."),
_0_cannot_be_compiled_under_isolatedModules_because_it_is_considered_a_global_script_file_Add_an_import_export_or_an_empty_export_statement_to_make_it_a_module: diag(1208, ts.DiagnosticCategory.Error, "_0_cannot_be_compiled_under_isolatedModules_because_it_is_considered_a_global_script_file_Add_an_imp_1208", "'{0}' cannot be compiled under '--isolatedModules' because it is considered a global script file. Add an import, export, or an empty 'export {}' statement to make it a module."),
Code_contained_in_a_class_is_evaluated_in_JavaScript_s_strict_mode_which_does_not_allow_this_use_of_0_For_more_information_see_https_Colon_Slash_Slashdeveloper_mozilla_org_Slashen_US_Slashdocs_SlashWeb_SlashJavaScript_SlashReference_SlashStrict_mode: diag(1210, ts.DiagnosticCategory.Error, "Code_contained_in_a_class_is_evaluated_in_JavaScript_s_strict_mode_which_does_not_allow_this_use_of__1210", "Code contained in a class is evaluated in JavaScript's strict mode which does not allow this use of '{0}'. For more information, see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Strict_mode."),
A_class_declaration_without_the_default_modifier_must_have_a_name: diag(1211, ts.DiagnosticCategory.Error, "A_class_declaration_without_the_default_modifier_must_have_a_name_1211", "A class declaration without the 'default' modifier must have a name."),
Identifier_expected_0_is_a_reserved_word_in_strict_mode: diag(1212, ts.DiagnosticCategory.Error, "Identifier_expected_0_is_a_reserved_word_in_strict_mode_1212", "Identifier expected. '{0}' is a reserved word in strict mode."),
Identifier_expected_0_is_a_reserved_word_in_strict_mode_Class_definitions_are_automatically_in_strict_mode: diag(1213, ts.DiagnosticCategory.Error, "Identifier_expected_0_is_a_reserved_word_in_strict_mode_Class_definitions_are_automatically_in_stric_1213", "Identifier expected. '{0}' is a reserved word in strict mode. Class definitions are automatically in strict mode."),
Identifier_expected_0_is_a_reserved_word_in_strict_mode_Modules_are_automatically_in_strict_mode: diag(1214, ts.DiagnosticCategory.Error, "Identifier_expected_0_is_a_reserved_word_in_strict_mode_Modules_are_automatically_in_strict_mode_1214", "Identifier expected. '{0}' is a reserved word in strict mode. Modules are automatically in strict mode."),
Invalid_use_of_0_Modules_are_automatically_in_strict_mode: diag(1215, ts.DiagnosticCategory.Error, "Invalid_use_of_0_Modules_are_automatically_in_strict_mode_1215", "Invalid use of '{0}'. Modules are automatically in strict mode."),
Identifier_expected_esModule_is_reserved_as_an_exported_marker_when_transforming_ECMAScript_modules: diag(1216, ts.DiagnosticCategory.Error, "Identifier_expected_esModule_is_reserved_as_an_exported_marker_when_transforming_ECMAScript_modules_1216", "Identifier expected. '__esModule' is reserved as an exported marker when transforming ECMAScript modules."),
Export_assignment_is_not_supported_when_module_flag_is_system: diag(1218, ts.DiagnosticCategory.Error, "Export_assignment_is_not_supported_when_module_flag_is_system_1218", "Export assignment is not supported when '--module' flag is 'system'."),
Experimental_support_for_decorators_is_a_feature_that_is_subject_to_change_in_a_future_release_Set_the_experimentalDecorators_option_in_your_tsconfig_or_jsconfig_to_remove_this_warning: diag(1219, ts.DiagnosticCategory.Error, "Experimental_support_for_decorators_is_a_feature_that_is_subject_to_change_in_a_future_release_Set_t_1219", "Experimental support for decorators is a feature that is subject to change in a future release. Set the 'experimentalDecorators' option in your 'tsconfig' or 'jsconfig' to remove this warning."),
Generators_are_only_available_when_targeting_ECMAScript_2015_or_higher: diag(1220, ts.DiagnosticCategory.Error, "Generators_are_only_available_when_targeting_ECMAScript_2015_or_higher_1220", "Generators are only available when targeting ECMAScript 2015 or higher."),
Generators_are_not_allowed_in_an_ambient_context: diag(1221, ts.DiagnosticCategory.Error, "Generators_are_not_allowed_in_an_ambient_context_1221", "Generators are not allowed in an ambient context."),
An_overload_signature_cannot_be_declared_as_a_generator: diag(1222, ts.DiagnosticCategory.Error, "An_overload_signature_cannot_be_declared_as_a_generator_1222", "An overload signature cannot be declared as a generator."),
_0_tag_already_specified: diag(1223, ts.DiagnosticCategory.Error, "_0_tag_already_specified_1223", "'{0}' tag already specified."),
Signature_0_must_be_a_type_predicate: diag(1224, ts.DiagnosticCategory.Error, "Signature_0_must_be_a_type_predicate_1224", "Signature '{0}' must be a type predicate."),
Cannot_find_parameter_0: diag(1225, ts.DiagnosticCategory.Error, "Cannot_find_parameter_0_1225", "Cannot find parameter '{0}'."),
Type_predicate_0_is_not_assignable_to_1: diag(1226, ts.DiagnosticCategory.Error, "Type_predicate_0_is_not_assignable_to_1_1226", "Type predicate '{0}' is not assignable to '{1}'."),
Parameter_0_is_not_in_the_same_position_as_parameter_1: diag(1227, ts.DiagnosticCategory.Error, "Parameter_0_is_not_in_the_same_position_as_parameter_1_1227", "Parameter '{0}' is not in the same position as parameter '{1}'."),
A_type_predicate_is_only_allowed_in_return_type_position_for_functions_and_methods: diag(1228, ts.DiagnosticCategory.Error, "A_type_predicate_is_only_allowed_in_return_type_position_for_functions_and_methods_1228", "A type predicate is only allowed in return type position for functions and methods."),
A_type_predicate_cannot_reference_a_rest_parameter: diag(1229, ts.DiagnosticCategory.Error, "A_type_predicate_cannot_reference_a_rest_parameter_1229", "A type predicate cannot reference a rest parameter."),
A_type_predicate_cannot_reference_element_0_in_a_binding_pattern: diag(1230, ts.DiagnosticCategory.Error, "A_type_predicate_cannot_reference_element_0_in_a_binding_pattern_1230", "A type predicate cannot reference element '{0}' in a binding pattern."),
An_export_assignment_must_be_at_the_top_level_of_a_file_or_module_declaration: diag(1231, ts.DiagnosticCategory.Error, "An_export_assignment_must_be_at_the_top_level_of_a_file_or_module_declaration_1231", "An export assignment must be at the top level of a file or module declaration."),
An_import_declaration_can_only_be_used_in_a_namespace_or_module: diag(1232, ts.DiagnosticCategory.Error, "An_import_declaration_can_only_be_used_in_a_namespace_or_module_1232", "An import declaration can only be used in a namespace or module."),
An_export_declaration_can_only_be_used_in_a_module: diag(1233, ts.DiagnosticCategory.Error, "An_export_declaration_can_only_be_used_in_a_module_1233", "An export declaration can only be used in a module."),
An_ambient_module_declaration_is_only_allowed_at_the_top_level_in_a_file: diag(1234, ts.DiagnosticCategory.Error, "An_ambient_module_declaration_is_only_allowed_at_the_top_level_in_a_file_1234", "An ambient module declaration is only allowed at the top level in a file."),
A_namespace_declaration_is_only_allowed_in_a_namespace_or_module: diag(1235, ts.DiagnosticCategory.Error, "A_namespace_declaration_is_only_allowed_in_a_namespace_or_module_1235", "A namespace declaration is only allowed in a namespace or module."),
The_return_type_of_a_property_decorator_function_must_be_either_void_or_any: diag(1236, ts.DiagnosticCategory.Error, "The_return_type_of_a_property_decorator_function_must_be_either_void_or_any_1236", "The return type of a property decorator function must be either 'void' or 'any'."),
The_return_type_of_a_parameter_decorator_function_must_be_either_void_or_any: diag(1237, ts.DiagnosticCategory.Error, "The_return_type_of_a_parameter_decorator_function_must_be_either_void_or_any_1237", "The return type of a parameter decorator function must be either 'void' or 'any'."),
Unable_to_resolve_signature_of_class_decorator_when_called_as_an_expression: diag(1238, ts.DiagnosticCategory.Error, "Unable_to_resolve_signature_of_class_decorator_when_called_as_an_expression_1238", "Unable to resolve signature of class decorator when called as an expression."),
Unable_to_resolve_signature_of_parameter_decorator_when_called_as_an_expression: diag(1239, ts.DiagnosticCategory.Error, "Unable_to_resolve_signature_of_parameter_decorator_when_called_as_an_expression_1239", "Unable to resolve signature of parameter decorator when called as an expression."),
Unable_to_resolve_signature_of_property_decorator_when_called_as_an_expression: diag(1240, ts.DiagnosticCategory.Error, "Unable_to_resolve_signature_of_property_decorator_when_called_as_an_expression_1240", "Unable to resolve signature of property decorator when called as an expression."),
Unable_to_resolve_signature_of_method_decorator_when_called_as_an_expression: diag(1241, ts.DiagnosticCategory.Error, "Unable_to_resolve_signature_of_method_decorator_when_called_as_an_expression_1241", "Unable to resolve signature of method decorator when called as an expression."),
abstract_modifier_can_only_appear_on_a_class_method_or_property_declaration: diag(1242, ts.DiagnosticCategory.Error, "abstract_modifier_can_only_appear_on_a_class_method_or_property_declaration_1242", "'abstract' modifier can only appear on a class, method, or property declaration."),
_0_modifier_cannot_be_used_with_1_modifier: diag(1243, ts.DiagnosticCategory.Error, "_0_modifier_cannot_be_used_with_1_modifier_1243", "'{0}' modifier cannot be used with '{1}' modifier."),
Abstract_methods_can_only_appear_within_an_abstract_class: diag(1244, ts.DiagnosticCategory.Error, "Abstract_methods_can_only_appear_within_an_abstract_class_1244", "Abstract methods can only appear within an abstract class."),
Method_0_cannot_have_an_implementation_because_it_is_marked_abstract: diag(1245, ts.DiagnosticCategory.Error, "Method_0_cannot_have_an_implementation_because_it_is_marked_abstract_1245", "Method '{0}' cannot have an implementation because it is marked abstract."),
An_interface_property_cannot_have_an_initializer: diag(1246, ts.DiagnosticCategory.Error, "An_interface_property_cannot_have_an_initializer_1246", "An interface property cannot have an initializer."),
A_type_literal_property_cannot_have_an_initializer: diag(1247, ts.DiagnosticCategory.Error, "A_type_literal_property_cannot_have_an_initializer_1247", "A type literal property cannot have an initializer."),
A_class_member_cannot_have_the_0_keyword: diag(1248, ts.DiagnosticCategory.Error, "A_class_member_cannot_have_the_0_keyword_1248", "A class member cannot have the '{0}' keyword."),
A_decorator_can_only_decorate_a_method_implementation_not_an_overload: diag(1249, ts.DiagnosticCategory.Error, "A_decorator_can_only_decorate_a_method_implementation_not_an_overload_1249", "A decorator can only decorate a method implementation, not an overload."),
Function_declarations_are_not_allowed_inside_blocks_in_strict_mode_when_targeting_ES3_or_ES5: diag(1250, ts.DiagnosticCategory.Error, "Function_declarations_are_not_allowed_inside_blocks_in_strict_mode_when_targeting_ES3_or_ES5_1250", "Function declarations are not allowed inside blocks in strict mode when targeting 'ES3' or 'ES5'."),
Function_declarations_are_not_allowed_inside_blocks_in_strict_mode_when_targeting_ES3_or_ES5_Class_definitions_are_automatically_in_strict_mode: diag(1251, ts.DiagnosticCategory.Error, "Function_declarations_are_not_allowed_inside_blocks_in_strict_mode_when_targeting_ES3_or_ES5_Class_d_1251", "Function declarations are not allowed inside blocks in strict mode when targeting 'ES3' or 'ES5'. Class definitions are automatically in strict mode."),
Function_declarations_are_not_allowed_inside_blocks_in_strict_mode_when_targeting_ES3_or_ES5_Modules_are_automatically_in_strict_mode: diag(1252, ts.DiagnosticCategory.Error, "Function_declarations_are_not_allowed_inside_blocks_in_strict_mode_when_targeting_ES3_or_ES5_Modules_1252", "Function declarations are not allowed inside blocks in strict mode when targeting 'ES3' or 'ES5'. Modules are automatically in strict mode."),
_0_tag_cannot_be_used_independently_as_a_top_level_JSDoc_tag: diag(1253, ts.DiagnosticCategory.Error, "_0_tag_cannot_be_used_independently_as_a_top_level_JSDoc_tag_1253", "'{0}' tag cannot be used independently as a top level JSDoc tag."),
A_const_initializer_in_an_ambient_context_must_be_a_string_or_numeric_literal_or_literal_enum_reference: diag(1254, ts.DiagnosticCategory.Error, "A_const_initializer_in_an_ambient_context_must_be_a_string_or_numeric_literal_or_literal_enum_refere_1254", "A 'const' initializer in an ambient context must be a string or numeric literal or literal enum reference."),
A_definite_assignment_assertion_is_not_permitted_in_this_context: diag(1255, ts.DiagnosticCategory.Error, "A_definite_assignment_assertion_is_not_permitted_in_this_context_1255", "A definite assignment assertion '!' is not permitted in this context."),
A_required_element_cannot_follow_an_optional_element: diag(1257, ts.DiagnosticCategory.Error, "A_required_element_cannot_follow_an_optional_element_1257", "A required element cannot follow an optional element."),
A_default_export_must_be_at_the_top_level_of_a_file_or_module_declaration: diag(1258, ts.DiagnosticCategory.Error, "A_default_export_must_be_at_the_top_level_of_a_file_or_module_declaration_1258", "A default export must be at the top level of a file or module declaration."),
Module_0_can_only_be_default_imported_using_the_1_flag: diag(1259, ts.DiagnosticCategory.Error, "Module_0_can_only_be_default_imported_using_the_1_flag_1259", "Module '{0}' can only be default-imported using the '{1}' flag"),
Keywords_cannot_contain_escape_characters: diag(1260, ts.DiagnosticCategory.Error, "Keywords_cannot_contain_escape_characters_1260", "Keywords cannot contain escape characters."),
Already_included_file_name_0_differs_from_file_name_1_only_in_casing: diag(1261, ts.DiagnosticCategory.Error, "Already_included_file_name_0_differs_from_file_name_1_only_in_casing_1261", "Already included file name '{0}' differs from file name '{1}' only in casing."),
Identifier_expected_0_is_a_reserved_word_at_the_top_level_of_a_module: diag(1262, ts.DiagnosticCategory.Error, "Identifier_expected_0_is_a_reserved_word_at_the_top_level_of_a_module_1262", "Identifier expected. '{0}' is a reserved word at the top-level of a module."),
Declarations_with_initializers_cannot_also_have_definite_assignment_assertions: diag(1263, ts.DiagnosticCategory.Error, "Declarations_with_initializers_cannot_also_have_definite_assignment_assertions_1263", "Declarations with initializers cannot also have definite assignment assertions."),
Declarations_with_definite_assignment_assertions_must_also_have_type_annotations: diag(1264, ts.DiagnosticCategory.Error, "Declarations_with_definite_assignment_assertions_must_also_have_type_annotations_1264", "Declarations with definite assignment assertions must also have type annotations."),
A_rest_element_cannot_follow_another_rest_element: diag(1265, ts.DiagnosticCategory.Error, "A_rest_element_cannot_follow_another_rest_element_1265", "A rest element cannot follow another rest element."),
An_optional_element_cannot_follow_a_rest_element: diag(1266, ts.DiagnosticCategory.Error, "An_optional_element_cannot_follow_a_rest_element_1266", "An optional element cannot follow a rest element."),
Property_0_cannot_have_an_initializer_because_it_is_marked_abstract: diag(1267, ts.DiagnosticCategory.Error, "Property_0_cannot_have_an_initializer_because_it_is_marked_abstract_1267", "Property '{0}' cannot have an initializer because it is marked abstract."),
An_index_signature_parameter_type_must_be_string_number_symbol_or_a_template_literal_type: diag(1268, ts.DiagnosticCategory.Error, "An_index_signature_parameter_type_must_be_string_number_symbol_or_a_template_literal_type_1268", "An index signature parameter type must be 'string', 'number', 'symbol', or a template literal type."),
with_statements_are_not_allowed_in_an_async_function_block: diag(1300, ts.DiagnosticCategory.Error, "with_statements_are_not_allowed_in_an_async_function_block_1300", "'with' statements are not allowed in an async function block."),
await_expressions_are_only_allowed_within_async_functions_and_at_the_top_levels_of_modules: diag(1308, ts.DiagnosticCategory.Error, "await_expressions_are_only_allowed_within_async_functions_and_at_the_top_levels_of_modules_1308", "'await' expressions are only allowed within async functions and at the top levels of modules."),
Did_you_mean_to_use_a_Colon_An_can_only_follow_a_property_name_when_the_containing_object_literal_is_part_of_a_destructuring_pattern: diag(1312, ts.DiagnosticCategory.Error, "Did_you_mean_to_use_a_Colon_An_can_only_follow_a_property_name_when_the_containing_object_literal_is_1312", "Did you mean to use a ':'? An '=' can only follow a property name when the containing object literal is part of a destructuring pattern."),
The_body_of_an_if_statement_cannot_be_the_empty_statement: diag(1313, ts.DiagnosticCategory.Error, "The_body_of_an_if_statement_cannot_be_the_empty_statement_1313", "The body of an 'if' statement cannot be the empty statement."),
Global_module_exports_may_only_appear_in_module_files: diag(1314, ts.DiagnosticCategory.Error, "Global_module_exports_may_only_appear_in_module_files_1314", "Global module exports may only appear in module files."),
Global_module_exports_may_only_appear_in_declaration_files: diag(1315, ts.DiagnosticCategory.Error, "Global_module_exports_may_only_appear_in_declaration_files_1315", "Global module exports may only appear in declaration files."),
Global_module_exports_may_only_appear_at_top_level: diag(1316, ts.DiagnosticCategory.Error, "Global_module_exports_may_only_appear_at_top_level_1316", "Global module exports may only appear at top level."),
A_parameter_property_cannot_be_declared_using_a_rest_parameter: diag(1317, ts.DiagnosticCategory.Error, "A_parameter_property_cannot_be_declared_using_a_rest_parameter_1317", "A parameter property cannot be declared using a rest parameter."),
An_abstract_accessor_cannot_have_an_implementation: diag(1318, ts.DiagnosticCategory.Error, "An_abstract_accessor_cannot_have_an_implementation_1318", "An abstract accessor cannot have an implementation."),
A_default_export_can_only_be_used_in_an_ECMAScript_style_module: diag(1319, ts.DiagnosticCategory.Error, "A_default_export_can_only_be_used_in_an_ECMAScript_style_module_1319", "A default export can only be used in an ECMAScript-style module."),
Type_of_await_operand_must_either_be_a_valid_promise_or_must_not_contain_a_callable_then_member: diag(1320, ts.DiagnosticCategory.Error, "Type_of_await_operand_must_either_be_a_valid_promise_or_must_not_contain_a_callable_then_member_1320", "Type of 'await' operand must either be a valid promise or must not contain a callable 'then' member."),
Type_of_yield_operand_in_an_async_generator_must_either_be_a_valid_promise_or_must_not_contain_a_callable_then_member: diag(1321, ts.DiagnosticCategory.Error, "Type_of_yield_operand_in_an_async_generator_must_either_be_a_valid_promise_or_must_not_contain_a_cal_1321", "Type of 'yield' operand in an async generator must either be a valid promise or must not contain a callable 'then' member."),
Type_of_iterated_elements_of_a_yield_Asterisk_operand_must_either_be_a_valid_promise_or_must_not_contain_a_callable_then_member: diag(1322, ts.DiagnosticCategory.Error, "Type_of_iterated_elements_of_a_yield_Asterisk_operand_must_either_be_a_valid_promise_or_must_not_con_1322", "Type of iterated elements of a 'yield*' operand must either be a valid promise or must not contain a callable 'then' member."),
Dynamic_imports_are_only_supported_when_the_module_flag_is_set_to_es2020_esnext_commonjs_amd_system_or_umd: diag(1323, ts.DiagnosticCategory.Error, "Dynamic_imports_are_only_supported_when_the_module_flag_is_set_to_es2020_esnext_commonjs_amd_system__1323", "Dynamic imports are only supported when the '--module' flag is set to 'es2020', 'esnext', 'commonjs', 'amd', 'system', or 'umd'."),
Dynamic_import_must_have_one_specifier_as_an_argument: diag(1324, ts.DiagnosticCategory.Error, "Dynamic_import_must_have_one_specifier_as_an_argument_1324", "Dynamic import must have one specifier as an argument."),
Specifier_of_dynamic_import_cannot_be_spread_element: diag(1325, ts.DiagnosticCategory.Error, "Specifier_of_dynamic_import_cannot_be_spread_element_1325", "Specifier of dynamic import cannot be spread element."),
Dynamic_import_cannot_have_type_arguments: diag(1326, ts.DiagnosticCategory.Error, "Dynamic_import_cannot_have_type_arguments_1326", "Dynamic import cannot have type arguments."),
String_literal_with_double_quotes_expected: diag(1327, ts.DiagnosticCategory.Error, "String_literal_with_double_quotes_expected_1327", "String literal with double quotes expected."),
Property_value_can_only_be_string_literal_numeric_literal_true_false_null_object_literal_or_array_literal: diag(1328, ts.DiagnosticCategory.Error, "Property_value_can_only_be_string_literal_numeric_literal_true_false_null_object_literal_or_array_li_1328", "Property value can only be string literal, numeric literal, 'true', 'false', 'null', object literal or array literal."),
_0_accepts_too_few_arguments_to_be_used_as_a_decorator_here_Did_you_mean_to_call_it_first_and_write_0: diag(1329, ts.DiagnosticCategory.Error, "_0_accepts_too_few_arguments_to_be_used_as_a_decorator_here_Did_you_mean_to_call_it_first_and_write__1329", "'{0}' accepts too few arguments to be used as a decorator here. Did you mean to call it first and write '@{0}()'?"),
A_property_of_an_interface_or_type_literal_whose_type_is_a_unique_symbol_type_must_be_readonly: diag(1330, ts.DiagnosticCategory.Error, "A_property_of_an_interface_or_type_literal_whose_type_is_a_unique_symbol_type_must_be_readonly_1330", "A property of an interface or type literal whose type is a 'unique symbol' type must be 'readonly'."),
A_property_of_a_class_whose_type_is_a_unique_symbol_type_must_be_both_static_and_readonly: diag(1331, ts.DiagnosticCategory.Error, "A_property_of_a_class_whose_type_is_a_unique_symbol_type_must_be_both_static_and_readonly_1331", "A property of a class whose type is a 'unique symbol' type must be both 'static' and 'readonly'."),
A_variable_whose_type_is_a_unique_symbol_type_must_be_const: diag(1332, ts.DiagnosticCategory.Error, "A_variable_whose_type_is_a_unique_symbol_type_must_be_const_1332", "A variable whose type is a 'unique symbol' type must be 'const'."),
unique_symbol_types_may_not_be_used_on_a_variable_declaration_with_a_binding_name: diag(1333, ts.DiagnosticCategory.Error, "unique_symbol_types_may_not_be_used_on_a_variable_declaration_with_a_binding_name_1333", "'unique symbol' types may not be used on a variable declaration with a binding name."),
unique_symbol_types_are_only_allowed_on_variables_in_a_variable_statement: diag(1334, ts.DiagnosticCategory.Error, "unique_symbol_types_are_only_allowed_on_variables_in_a_variable_statement_1334", "'unique symbol' types are only allowed on variables in a variable statement."),
unique_symbol_types_are_not_allowed_here: diag(1335, ts.DiagnosticCategory.Error, "unique_symbol_types_are_not_allowed_here_1335", "'unique symbol' types are not allowed here."),
An_index_signature_parameter_type_cannot_be_a_literal_type_or_generic_type_Consider_using_a_mapped_object_type_instead: diag(1337, ts.DiagnosticCategory.Error, "An_index_signature_parameter_type_cannot_be_a_literal_type_or_generic_type_Consider_using_a_mapped_o_1337", "An index signature parameter type cannot be a literal type or generic type. Consider using a mapped object type instead."),
infer_declarations_are_only_permitted_in_the_extends_clause_of_a_conditional_type: diag(1338, ts.DiagnosticCategory.Error, "infer_declarations_are_only_permitted_in_the_extends_clause_of_a_conditional_type_1338", "'infer' declarations are only permitted in the 'extends' clause of a conditional type."),
Module_0_does_not_refer_to_a_value_but_is_used_as_a_value_here: diag(1339, ts.DiagnosticCategory.Error, "Module_0_does_not_refer_to_a_value_but_is_used_as_a_value_here_1339", "Module '{0}' does not refer to a value, but is used as a value here."),
Module_0_does_not_refer_to_a_type_but_is_used_as_a_type_here_Did_you_mean_typeof_import_0: diag(1340, ts.DiagnosticCategory.Error, "Module_0_does_not_refer_to_a_type_but_is_used_as_a_type_here_Did_you_mean_typeof_import_0_1340", "Module '{0}' does not refer to a type, but is used as a type here. Did you mean 'typeof import('{0}')'?"),
Type_arguments_cannot_be_used_here: diag(1342, ts.DiagnosticCategory.Error, "Type_arguments_cannot_be_used_here_1342", "Type arguments cannot be used here."),
The_import_meta_meta_property_is_only_allowed_when_the_module_option_is_es2020_esnext_or_system: diag(1343, ts.DiagnosticCategory.Error, "The_import_meta_meta_property_is_only_allowed_when_the_module_option_is_es2020_esnext_or_system_1343", "The 'import.meta' meta-property is only allowed when the '--module' option is 'es2020', 'esnext', or 'system'."),
A_label_is_not_allowed_here: diag(1344, ts.DiagnosticCategory.Error, "A_label_is_not_allowed_here_1344", "'A label is not allowed here."),
An_expression_of_type_void_cannot_be_tested_for_truthiness: diag(1345, ts.DiagnosticCategory.Error, "An_expression_of_type_void_cannot_be_tested_for_truthiness_1345", "An expression of type 'void' cannot be tested for truthiness."),
This_parameter_is_not_allowed_with_use_strict_directive: diag(1346, ts.DiagnosticCategory.Error, "This_parameter_is_not_allowed_with_use_strict_directive_1346", "This parameter is not allowed with 'use strict' directive."),
use_strict_directive_cannot_be_used_with_non_simple_parameter_list: diag(1347, ts.DiagnosticCategory.Error, "use_strict_directive_cannot_be_used_with_non_simple_parameter_list_1347", "'use strict' directive cannot be used with non-simple parameter list."),
Non_simple_parameter_declared_here: diag(1348, ts.DiagnosticCategory.Error, "Non_simple_parameter_declared_here_1348", "Non-simple parameter declared here."),
use_strict_directive_used_here: diag(1349, ts.DiagnosticCategory.Error, "use_strict_directive_used_here_1349", "'use strict' directive used here."),
Print_the_final_configuration_instead_of_building: diag(1350, ts.DiagnosticCategory.Message, "Print_the_final_configuration_instead_of_building_1350", "Print the final configuration instead of building."),
An_identifier_or_keyword_cannot_immediately_follow_a_numeric_literal: diag(1351, ts.DiagnosticCategory.Error, "An_identifier_or_keyword_cannot_immediately_follow_a_numeric_literal_1351", "An identifier or keyword cannot immediately follow a numeric literal."),
A_bigint_literal_cannot_use_exponential_notation: diag(1352, ts.DiagnosticCategory.Error, "A_bigint_literal_cannot_use_exponential_notation_1352", "A bigint literal cannot use exponential notation."),
A_bigint_literal_must_be_an_integer: diag(1353, ts.DiagnosticCategory.Error, "A_bigint_literal_must_be_an_integer_1353", "A bigint literal must be an integer."),
readonly_type_modifier_is_only_permitted_on_array_and_tuple_literal_types: diag(1354, ts.DiagnosticCategory.Error, "readonly_type_modifier_is_only_permitted_on_array_and_tuple_literal_types_1354", "'readonly' type modifier is only permitted on array and tuple literal types."),
A_const_assertions_can_only_be_applied_to_references_to_enum_members_or_string_number_boolean_array_or_object_literals: diag(1355, ts.DiagnosticCategory.Error, "A_const_assertions_can_only_be_applied_to_references_to_enum_members_or_string_number_boolean_array__1355", "A 'const' assertions can only be applied to references to enum members, or string, number, boolean, array, or object literals."),
Did_you_mean_to_mark_this_function_as_async: diag(1356, ts.DiagnosticCategory.Error, "Did_you_mean_to_mark_this_function_as_async_1356", "Did you mean to mark this function as 'async'?"),
An_enum_member_name_must_be_followed_by_a_or: diag(1357, ts.DiagnosticCategory.Error, "An_enum_member_name_must_be_followed_by_a_or_1357", "An enum member name must be followed by a ',', '=', or '}'."),
Tagged_template_expressions_are_not_permitted_in_an_optional_chain: diag(1358, ts.DiagnosticCategory.Error, "Tagged_template_expressions_are_not_permitted_in_an_optional_chain_1358", "Tagged template expressions are not permitted in an optional chain."),
Identifier_expected_0_is_a_reserved_word_that_cannot_be_used_here: diag(1359, ts.DiagnosticCategory.Error, "Identifier_expected_0_is_a_reserved_word_that_cannot_be_used_here_1359", "Identifier expected. '{0}' is a reserved word that cannot be used here."),
Did_you_mean_to_parenthesize_this_function_type: diag(1360, ts.DiagnosticCategory.Error, "Did_you_mean_to_parenthesize_this_function_type_1360", "Did you mean to parenthesize this function type?"),
_0_cannot_be_used_as_a_value_because_it_was_imported_using_import_type: diag(1361, ts.DiagnosticCategory.Error, "_0_cannot_be_used_as_a_value_because_it_was_imported_using_import_type_1361", "'{0}' cannot be used as a value because it was imported using 'import type'."),
_0_cannot_be_used_as_a_value_because_it_was_exported_using_export_type: diag(1362, ts.DiagnosticCategory.Error, "_0_cannot_be_used_as_a_value_because_it_was_exported_using_export_type_1362", "'{0}' cannot be used as a value because it was exported using 'export type'."),
A_type_only_import_can_specify_a_default_import_or_named_bindings_but_not_both: diag(1363, ts.DiagnosticCategory.Error, "A_type_only_import_can_specify_a_default_import_or_named_bindings_but_not_both_1363", "A type-only import can specify a default import or named bindings, but not both."),
Convert_to_type_only_export: diag(1364, ts.DiagnosticCategory.Message, "Convert_to_type_only_export_1364", "Convert to type-only export"),
Convert_all_re_exported_types_to_type_only_exports: diag(1365, ts.DiagnosticCategory.Message, "Convert_all_re_exported_types_to_type_only_exports_1365", "Convert all re-exported types to type-only exports"),
Split_into_two_separate_import_declarations: diag(1366, ts.DiagnosticCategory.Message, "Split_into_two_separate_import_declarations_1366", "Split into two separate import declarations"),
Split_all_invalid_type_only_imports: diag(1367, ts.DiagnosticCategory.Message, "Split_all_invalid_type_only_imports_1367", "Split all invalid type-only imports"),
Did_you_mean_0: diag(1369, ts.DiagnosticCategory.Message, "Did_you_mean_0_1369", "Did you mean '{0}'?"),
This_import_is_never_used_as_a_value_and_must_use_import_type_because_importsNotUsedAsValues_is_set_to_error: diag(1371, ts.DiagnosticCategory.Error, "This_import_is_never_used_as_a_value_and_must_use_import_type_because_importsNotUsedAsValues_is_set__1371", "This import is never used as a value and must use 'import type' because 'importsNotUsedAsValues' is set to 'error'."),
Convert_to_type_only_import: diag(1373, ts.DiagnosticCategory.Message, "Convert_to_type_only_import_1373", "Convert to type-only import"),
Convert_all_imports_not_used_as_a_value_to_type_only_imports: diag(1374, ts.DiagnosticCategory.Message, "Convert_all_imports_not_used_as_a_value_to_type_only_imports_1374", "Convert all imports not used as a value to type-only imports"),
await_expressions_are_only_allowed_at_the_top_level_of_a_file_when_that_file_is_a_module_but_this_file_has_no_imports_or_exports_Consider_adding_an_empty_export_to_make_this_file_a_module: diag(1375, ts.DiagnosticCategory.Error, "await_expressions_are_only_allowed_at_the_top_level_of_a_file_when_that_file_is_a_module_but_this_fi_1375", "'await' expressions are only allowed at the top level of a file when that file is a module, but this file has no imports or exports. Consider adding an empty 'export {}' to make this file a module."),
_0_was_imported_here: diag(1376, ts.DiagnosticCategory.Message, "_0_was_imported_here_1376", "'{0}' was imported here."),
_0_was_exported_here: diag(1377, ts.DiagnosticCategory.Message, "_0_was_exported_here_1377", "'{0}' was exported here."),
Top_level_await_expressions_are_only_allowed_when_the_module_option_is_set_to_esnext_or_system_and_the_target_option_is_set_to_es2017_or_higher: diag(1378, ts.DiagnosticCategory.Error, "Top_level_await_expressions_are_only_allowed_when_the_module_option_is_set_to_esnext_or_system_and_t_1378", "Top-level 'await' expressions are only allowed when the 'module' option is set to 'esnext' or 'system', and the 'target' option is set to 'es2017' or higher."),
An_import_alias_cannot_reference_a_declaration_that_was_exported_using_export_type: diag(1379, ts.DiagnosticCategory.Error, "An_import_alias_cannot_reference_a_declaration_that_was_exported_using_export_type_1379", "An import alias cannot reference a declaration that was exported using 'export type'."),
An_import_alias_cannot_reference_a_declaration_that_was_imported_using_import_type: diag(1380, ts.DiagnosticCategory.Error, "An_import_alias_cannot_reference_a_declaration_that_was_imported_using_import_type_1380", "An import alias cannot reference a declaration that was imported using 'import type'."),
Unexpected_token_Did_you_mean_or_rbrace: diag(1381, ts.DiagnosticCategory.Error, "Unexpected_token_Did_you_mean_or_rbrace_1381", "Unexpected token. Did you mean `{'}'}` or `&rbrace;`?"),
Unexpected_token_Did_you_mean_or_gt: diag(1382, ts.DiagnosticCategory.Error, "Unexpected_token_Did_you_mean_or_gt_1382", "Unexpected token. Did you mean `{'>'}` or `&gt;`?"),
Only_named_exports_may_use_export_type: diag(1383, ts.DiagnosticCategory.Error, "Only_named_exports_may_use_export_type_1383", "Only named exports may use 'export type'."),
A_new_expression_with_type_arguments_must_always_be_followed_by_a_parenthesized_argument_list: diag(1384, ts.DiagnosticCategory.Error, "A_new_expression_with_type_arguments_must_always_be_followed_by_a_parenthesized_argument_list_1384", "A 'new' expression with type arguments must always be followed by a parenthesized argument list."),
Function_type_notation_must_be_parenthesized_when_used_in_a_union_type: diag(1385, ts.DiagnosticCategory.Error, "Function_type_notation_must_be_parenthesized_when_used_in_a_union_type_1385", "Function type notation must be parenthesized when used in a union type."),
Constructor_type_notation_must_be_parenthesized_when_used_in_a_union_type: diag(1386, ts.DiagnosticCategory.Error, "Constructor_type_notation_must_be_parenthesized_when_used_in_a_union_type_1386", "Constructor type notation must be parenthesized when used in a union type."),
Function_type_notation_must_be_parenthesized_when_used_in_an_intersection_type: diag(1387, ts.DiagnosticCategory.Error, "Function_type_notation_must_be_parenthesized_when_used_in_an_intersection_type_1387", "Function type notation must be parenthesized when used in an intersection type."),
Constructor_type_notation_must_be_parenthesized_when_used_in_an_intersection_type: diag(1388, ts.DiagnosticCategory.Error, "Constructor_type_notation_must_be_parenthesized_when_used_in_an_intersection_type_1388", "Constructor type notation must be parenthesized when used in an intersection type."),
_0_is_not_allowed_as_a_variable_declaration_name: diag(1389, ts.DiagnosticCategory.Error, "_0_is_not_allowed_as_a_variable_declaration_name_1389", "'{0}' is not allowed as a variable declaration name."),
Provides_a_root_package_name_when_using_outFile_with_declarations: diag(1390, ts.DiagnosticCategory.Message, "Provides_a_root_package_name_when_using_outFile_with_declarations_1390", "Provides a root package name when using outFile with declarations."),
The_bundledPackageName_option_must_be_provided_when_using_outFile_and_node_module_resolution_with_declaration_emit: diag(1391, ts.DiagnosticCategory.Error, "The_bundledPackageName_option_must_be_provided_when_using_outFile_and_node_module_resolution_with_de_1391", "The 'bundledPackageName' option must be provided when using outFile and node module resolution with declaration emit."),
An_import_alias_cannot_use_import_type: diag(1392, ts.DiagnosticCategory.Error, "An_import_alias_cannot_use_import_type_1392", "An import alias cannot use 'import type'"),
Imported_via_0_from_file_1: diag(1393, ts.DiagnosticCategory.Message, "Imported_via_0_from_file_1_1393", "Imported via {0} from file '{1}'"),
Imported_via_0_from_file_1_with_packageId_2: diag(1394, ts.DiagnosticCategory.Message, "Imported_via_0_from_file_1_with_packageId_2_1394", "Imported via {0} from file '{1}' with packageId '{2}'"),
Imported_via_0_from_file_1_to_import_importHelpers_as_specified_in_compilerOptions: diag(1395, ts.DiagnosticCategory.Message, "Imported_via_0_from_file_1_to_import_importHelpers_as_specified_in_compilerOptions_1395", "Imported via {0} from file '{1}' to import 'importHelpers' as specified in compilerOptions"),
Imported_via_0_from_file_1_with_packageId_2_to_import_importHelpers_as_specified_in_compilerOptions: diag(1396, ts.DiagnosticCategory.Message, "Imported_via_0_from_file_1_with_packageId_2_to_import_importHelpers_as_specified_in_compilerOptions_1396", "Imported via {0} from file '{1}' with packageId '{2}' to import 'importHelpers' as specified in compilerOptions"),
Imported_via_0_from_file_1_to_import_jsx_and_jsxs_factory_functions: diag(1397, ts.DiagnosticCategory.Message, "Imported_via_0_from_file_1_to_import_jsx_and_jsxs_factory_functions_1397", "Imported via {0} from file '{1}' to import 'jsx' and 'jsxs' factory functions"),
Imported_via_0_from_file_1_with_packageId_2_to_import_jsx_and_jsxs_factory_functions: diag(1398, ts.DiagnosticCategory.Message, "Imported_via_0_from_file_1_with_packageId_2_to_import_jsx_and_jsxs_factory_functions_1398", "Imported via {0} from file '{1}' with packageId '{2}' to import 'jsx' and 'jsxs' factory functions"),
File_is_included_via_import_here: diag(1399, ts.DiagnosticCategory.Message, "File_is_included_via_import_here_1399", "File is included via import here."),
Referenced_via_0_from_file_1: diag(1400, ts.DiagnosticCategory.Message, "Referenced_via_0_from_file_1_1400", "Referenced via '{0}' from file '{1}'"),
File_is_included_via_reference_here: diag(1401, ts.DiagnosticCategory.Message, "File_is_included_via_reference_here_1401", "File is included via reference here."),
Type_library_referenced_via_0_from_file_1: diag(1402, ts.DiagnosticCategory.Message, "Type_library_referenced_via_0_from_file_1_1402", "Type library referenced via '{0}' from file '{1}'"),
Type_library_referenced_via_0_from_file_1_with_packageId_2: diag(1403, ts.DiagnosticCategory.Message, "Type_library_referenced_via_0_from_file_1_with_packageId_2_1403", "Type library referenced via '{0}' from file '{1}' with packageId '{2}'"),
File_is_included_via_type_library_reference_here: diag(1404, ts.DiagnosticCategory.Message, "File_is_included_via_type_library_reference_here_1404", "File is included via type library reference here."),
Library_referenced_via_0_from_file_1: diag(1405, ts.DiagnosticCategory.Message, "Library_referenced_via_0_from_file_1_1405", "Library referenced via '{0}' from file '{1}'"),
File_is_included_via_library_reference_here: diag(1406, ts.DiagnosticCategory.Message, "File_is_included_via_library_reference_here_1406", "File is included via library reference here."),
Matched_by_include_pattern_0_in_1: diag(1407, ts.DiagnosticCategory.Message, "Matched_by_include_pattern_0_in_1_1407", "Matched by include pattern '{0}' in '{1}'"),
File_is_matched_by_include_pattern_specified_here: diag(1408, ts.DiagnosticCategory.Message, "File_is_matched_by_include_pattern_specified_here_1408", "File is matched by include pattern specified here."),
Part_of_files_list_in_tsconfig_json: diag(1409, ts.DiagnosticCategory.Message, "Part_of_files_list_in_tsconfig_json_1409", "Part of 'files' list in tsconfig.json"),
File_is_matched_by_files_list_specified_here: diag(1410, ts.DiagnosticCategory.Message, "File_is_matched_by_files_list_specified_here_1410", "File is matched by 'files' list specified here."),
Output_from_referenced_project_0_included_because_1_specified: diag(1411, ts.DiagnosticCategory.Message, "Output_from_referenced_project_0_included_because_1_specified_1411", "Output from referenced project '{0}' included because '{1}' specified"),
Output_from_referenced_project_0_included_because_module_is_specified_as_none: diag(1412, ts.DiagnosticCategory.Message, "Output_from_referenced_project_0_included_because_module_is_specified_as_none_1412", "Output from referenced project '{0}' included because '--module' is specified as 'none'"),
File_is_output_from_referenced_project_specified_here: diag(1413, ts.DiagnosticCategory.Message, "File_is_output_from_referenced_project_specified_here_1413", "File is output from referenced project specified here."),
Source_from_referenced_project_0_included_because_1_specified: diag(1414, ts.DiagnosticCategory.Message, "Source_from_referenced_project_0_included_because_1_specified_1414", "Source from referenced project '{0}' included because '{1}' specified"),
Source_from_referenced_project_0_included_because_module_is_specified_as_none: diag(1415, ts.DiagnosticCategory.Message, "Source_from_referenced_project_0_included_because_module_is_specified_as_none_1415", "Source from referenced project '{0}' included because '--module' is specified as 'none'"),
File_is_source_from_referenced_project_specified_here: diag(1416, ts.DiagnosticCategory.Message, "File_is_source_from_referenced_project_specified_here_1416", "File is source from referenced project specified here."),
Entry_point_of_type_library_0_specified_in_compilerOptions: diag(1417, ts.DiagnosticCategory.Message, "Entry_point_of_type_library_0_specified_in_compilerOptions_1417", "Entry point of type library '{0}' specified in compilerOptions"),
Entry_point_of_type_library_0_specified_in_compilerOptions_with_packageId_1: diag(1418, ts.DiagnosticCategory.Message, "Entry_point_of_type_library_0_specified_in_compilerOptions_with_packageId_1_1418", "Entry point of type library '{0}' specified in compilerOptions with packageId '{1}'"),
File_is_entry_point_of_type_library_specified_here: diag(1419, ts.DiagnosticCategory.Message, "File_is_entry_point_of_type_library_specified_here_1419", "File is entry point of type library specified here."),
Entry_point_for_implicit_type_library_0: diag(1420, ts.DiagnosticCategory.Message, "Entry_point_for_implicit_type_library_0_1420", "Entry point for implicit type library '{0}'"),
Entry_point_for_implicit_type_library_0_with_packageId_1: diag(1421, ts.DiagnosticCategory.Message, "Entry_point_for_implicit_type_library_0_with_packageId_1_1421", "Entry point for implicit type library '{0}' with packageId '{1}'"),
Library_0_specified_in_compilerOptions: diag(1422, ts.DiagnosticCategory.Message, "Library_0_specified_in_compilerOptions_1422", "Library '{0}' specified in compilerOptions"),
File_is_library_specified_here: diag(1423, ts.DiagnosticCategory.Message, "File_is_library_specified_here_1423", "File is library specified here."),
Default_library: diag(1424, ts.DiagnosticCategory.Message, "Default_library_1424", "Default library"),
Default_library_for_target_0: diag(1425, ts.DiagnosticCategory.Message, "Default_library_for_target_0_1425", "Default library for target '{0}'"),
File_is_default_library_for_target_specified_here: diag(1426, ts.DiagnosticCategory.Message, "File_is_default_library_for_target_specified_here_1426", "File is default library for target specified here."),
Root_file_specified_for_compilation: diag(1427, ts.DiagnosticCategory.Message, "Root_file_specified_for_compilation_1427", "Root file specified for compilation"),
File_is_output_of_project_reference_source_0: diag(1428, ts.DiagnosticCategory.Message, "File_is_output_of_project_reference_source_0_1428", "File is output of project reference source '{0}'"),
File_redirects_to_file_0: diag(1429, ts.DiagnosticCategory.Message, "File_redirects_to_file_0_1429", "File redirects to file '{0}'"),
The_file_is_in_the_program_because_Colon: diag(1430, ts.DiagnosticCategory.Message, "The_file_is_in_the_program_because_Colon_1430", "The file is in the program because:"),
for_await_loops_are_only_allowed_at_the_top_level_of_a_file_when_that_file_is_a_module_but_this_file_has_no_imports_or_exports_Consider_adding_an_empty_export_to_make_this_file_a_module: diag(1431, ts.DiagnosticCategory.Error, "for_await_loops_are_only_allowed_at_the_top_level_of_a_file_when_that_file_is_a_module_but_this_file_1431", "'for await' loops are only allowed at the top level of a file when that file is a module, but this file has no imports or exports. Consider adding an empty 'export {}' to make this file a module."),
Top_level_for_await_loops_are_only_allowed_when_the_module_option_is_set_to_esnext_or_system_and_the_target_option_is_set_to_es2017_or_higher: diag(1432, ts.DiagnosticCategory.Error, "Top_level_for_await_loops_are_only_allowed_when_the_module_option_is_set_to_esnext_or_system_and_the_1432", "Top-level 'for await' loops are only allowed when the 'module' option is set to 'esnext' or 'system', and the 'target' option is set to 'es2017' or higher."),
Decorators_may_not_be_applied_to_this_parameters: diag(1433, ts.DiagnosticCategory.Error, "Decorators_may_not_be_applied_to_this_parameters_1433", "Decorators may not be applied to 'this' parameters."),
Unexpected_keyword_or_identifier: diag(1434, ts.DiagnosticCategory.Error, "Unexpected_keyword_or_identifier_1434", "Unexpected keyword or identifier."),
Unknown_keyword_or_identifier_Did_you_mean_0: diag(1435, ts.DiagnosticCategory.Error, "Unknown_keyword_or_identifier_Did_you_mean_0_1435", "Unknown keyword or identifier. Did you mean '{0}'?"),
Decorators_must_precede_the_name_and_all_keywords_of_property_declarations: diag(1436, ts.DiagnosticCategory.Error, "Decorators_must_precede_the_name_and_all_keywords_of_property_declarations_1436", "Decorators must precede the name and all keywords of property declarations."),
Namespace_must_be_given_a_name: diag(1437, ts.DiagnosticCategory.Error, "Namespace_must_be_given_a_name_1437", "Namespace must be given a name."),
Interface_must_be_given_a_name: diag(1438, ts.DiagnosticCategory.Error, "Interface_must_be_given_a_name_1438", "Interface must be given a name."),
Type_alias_must_be_given_a_name: diag(1439, ts.DiagnosticCategory.Error, "Type_alias_must_be_given_a_name_1439", "Type alias must be given a name."),
Variable_declaration_not_allowed_at_this_location: diag(1440, ts.DiagnosticCategory.Error, "Variable_declaration_not_allowed_at_this_location_1440", "Variable declaration not allowed at this location."),
Cannot_start_a_function_call_in_a_type_annotation: diag(1441, ts.DiagnosticCategory.Error, "Cannot_start_a_function_call_in_a_type_annotation_1441", "Cannot start a function call in a type annotation."),
Expected_for_property_initializer: diag(1442, ts.DiagnosticCategory.Error, "Expected_for_property_initializer_1442", "Expected '=' for property initializer."),
Module_declaration_names_may_only_use_or_quoted_strings: diag(1443, ts.DiagnosticCategory.Error, "Module_declaration_names_may_only_use_or_quoted_strings_1443", "Module declaration names may only use ' or \" quoted strings."),
The_types_of_0_are_incompatible_between_these_types: diag(2200, ts.DiagnosticCategory.Error, "The_types_of_0_are_incompatible_between_these_types_2200", "The types of '{0}' are incompatible between these types."),
The_types_returned_by_0_are_incompatible_between_these_types: diag(2201, ts.DiagnosticCategory.Error, "The_types_returned_by_0_are_incompatible_between_these_types_2201", "The types returned by '{0}' are incompatible between these types."),
Call_signature_return_types_0_and_1_are_incompatible: diag(2202, ts.DiagnosticCategory.Error, "Call_signature_return_types_0_and_1_are_incompatible_2202", "Call signature return types '{0}' and '{1}' are incompatible.", /*reportsUnnecessary*/ undefined, /*elidedInCompatabilityPyramid*/ true),
Construct_signature_return_types_0_and_1_are_incompatible: diag(2203, ts.DiagnosticCategory.Error, "Construct_signature_return_types_0_and_1_are_incompatible_2203", "Construct signature return types '{0}' and '{1}' are incompatible.", /*reportsUnnecessary*/ undefined, /*elidedInCompatabilityPyramid*/ true),
Call_signatures_with_no_arguments_have_incompatible_return_types_0_and_1: diag(2204, ts.DiagnosticCategory.Error, "Call_signatures_with_no_arguments_have_incompatible_return_types_0_and_1_2204", "Call signatures with no arguments have incompatible return types '{0}' and '{1}'.", /*reportsUnnecessary*/ undefined, /*elidedInCompatabilityPyramid*/ true),
Construct_signatures_with_no_arguments_have_incompatible_return_types_0_and_1: diag(2205, ts.DiagnosticCategory.Error, "Construct_signatures_with_no_arguments_have_incompatible_return_types_0_and_1_2205", "Construct signatures with no arguments have incompatible return types '{0}' and '{1}'.", /*reportsUnnecessary*/ undefined, /*elidedInCompatabilityPyramid*/ true),
Duplicate_identifier_0: diag(2300, ts.DiagnosticCategory.Error, "Duplicate_identifier_0_2300", "Duplicate identifier '{0}'."),
Initializer_of_instance_member_variable_0_cannot_reference_identifier_1_declared_in_the_constructor: diag(2301, ts.DiagnosticCategory.Error, "Initializer_of_instance_member_variable_0_cannot_reference_identifier_1_declared_in_the_constructor_2301", "Initializer of instance member variable '{0}' cannot reference identifier '{1}' declared in the constructor."),
Static_members_cannot_reference_class_type_parameters: diag(2302, ts.DiagnosticCategory.Error, "Static_members_cannot_reference_class_type_parameters_2302", "Static members cannot reference class type parameters."),
Circular_definition_of_import_alias_0: diag(2303, ts.DiagnosticCategory.Error, "Circular_definition_of_import_alias_0_2303", "Circular definition of import alias '{0}'."),
Cannot_find_name_0: diag(2304, ts.DiagnosticCategory.Error, "Cannot_find_name_0_2304", "Cannot find name '{0}'."),
Module_0_has_no_exported_member_1: diag(2305, ts.DiagnosticCategory.Error, "Module_0_has_no_exported_member_1_2305", "Module '{0}' has no exported member '{1}'."),
File_0_is_not_a_module: diag(2306, ts.DiagnosticCategory.Error, "File_0_is_not_a_module_2306", "File '{0}' is not a module."),
Cannot_find_module_0_or_its_corresponding_type_declarations: diag(2307, ts.DiagnosticCategory.Error, "Cannot_find_module_0_or_its_corresponding_type_declarations_2307", "Cannot find module '{0}' or its corresponding type declarations."),
Module_0_has_already_exported_a_member_named_1_Consider_explicitly_re_exporting_to_resolve_the_ambiguity: diag(2308, ts.DiagnosticCategory.Error, "Module_0_has_already_exported_a_member_named_1_Consider_explicitly_re_exporting_to_resolve_the_ambig_2308", "Module {0} has already exported a member named '{1}'. Consider explicitly re-exporting to resolve the ambiguity."),
An_export_assignment_cannot_be_used_in_a_module_with_other_exported_elements: diag(2309, ts.DiagnosticCategory.Error, "An_export_assignment_cannot_be_used_in_a_module_with_other_exported_elements_2309", "An export assignment cannot be used in a module with other exported elements."),
Type_0_recursively_references_itself_as_a_base_type: diag(2310, ts.DiagnosticCategory.Error, "Type_0_recursively_references_itself_as_a_base_type_2310", "Type '{0}' recursively references itself as a base type."),
A_class_may_only_extend_another_class: diag(2311, ts.DiagnosticCategory.Error, "A_class_may_only_extend_another_class_2311", "A class may only extend another class."),
An_interface_can_only_extend_an_object_type_or_intersection_of_object_types_with_statically_known_members: diag(2312, ts.DiagnosticCategory.Error, "An_interface_can_only_extend_an_object_type_or_intersection_of_object_types_with_statically_known_me_2312", "An interface can only extend an object type or intersection of object types with statically known members."),
Type_parameter_0_has_a_circular_constraint: diag(2313, ts.DiagnosticCategory.Error, "Type_parameter_0_has_a_circular_constraint_2313", "Type parameter '{0}' has a circular constraint."),
Generic_type_0_requires_1_type_argument_s: diag(2314, ts.DiagnosticCategory.Error, "Generic_type_0_requires_1_type_argument_s_2314", "Generic type '{0}' requires {1} type argument(s)."),
Type_0_is_not_generic: diag(2315, ts.DiagnosticCategory.Error, "Type_0_is_not_generic_2315", "Type '{0}' is not generic."),
Global_type_0_must_be_a_class_or_interface_type: diag(2316, ts.DiagnosticCategory.Error, "Global_type_0_must_be_a_class_or_interface_type_2316", "Global type '{0}' must be a class or interface type."),
Global_type_0_must_have_1_type_parameter_s: diag(2317, ts.DiagnosticCategory.Error, "Global_type_0_must_have_1_type_parameter_s_2317", "Global type '{0}' must have {1} type parameter(s)."),
Cannot_find_global_type_0: diag(2318, ts.DiagnosticCategory.Error, "Cannot_find_global_type_0_2318", "Cannot find global type '{0}'."),
Named_property_0_of_types_1_and_2_are_not_identical: diag(2319, ts.DiagnosticCategory.Error, "Named_property_0_of_types_1_and_2_are_not_identical_2319", "Named property '{0}' of types '{1}' and '{2}' are not identical."),
Interface_0_cannot_simultaneously_extend_types_1_and_2: diag(2320, ts.DiagnosticCategory.Error, "Interface_0_cannot_simultaneously_extend_types_1_and_2_2320", "Interface '{0}' cannot simultaneously extend types '{1}' and '{2}'."),
Excessive_stack_depth_comparing_types_0_and_1: diag(2321, ts.DiagnosticCategory.Error, "Excessive_stack_depth_comparing_types_0_and_1_2321", "Excessive stack depth comparing types '{0}' and '{1}'."),
Type_0_is_not_assignable_to_type_1: diag(2322, ts.DiagnosticCategory.Error, "Type_0_is_not_assignable_to_type_1_2322", "Type '{0}' is not assignable to type '{1}'."),
Cannot_redeclare_exported_variable_0: diag(2323, ts.DiagnosticCategory.Error, "Cannot_redeclare_exported_variable_0_2323", "Cannot redeclare exported variable '{0}'."),
Property_0_is_missing_in_type_1: diag(2324, ts.DiagnosticCategory.Error, "Property_0_is_missing_in_type_1_2324", "Property '{0}' is missing in type '{1}'."),
Property_0_is_private_in_type_1_but_not_in_type_2: diag(2325, ts.DiagnosticCategory.Error, "Property_0_is_private_in_type_1_but_not_in_type_2_2325", "Property '{0}' is private in type '{1}' but not in type '{2}'."),
Types_of_property_0_are_incompatible: diag(2326, ts.DiagnosticCategory.Error, "Types_of_property_0_are_incompatible_2326", "Types of property '{0}' are incompatible."),
Property_0_is_optional_in_type_1_but_required_in_type_2: diag(2327, ts.DiagnosticCategory.Error, "Property_0_is_optional_in_type_1_but_required_in_type_2_2327", "Property '{0}' is optional in type '{1}' but required in type '{2}'."),
Types_of_parameters_0_and_1_are_incompatible: diag(2328, ts.DiagnosticCategory.Error, "Types_of_parameters_0_and_1_are_incompatible_2328", "Types of parameters '{0}' and '{1}' are incompatible."),
Index_signature_for_type_0_is_missing_in_type_1: diag(2329, ts.DiagnosticCategory.Error, "Index_signature_for_type_0_is_missing_in_type_1_2329", "Index signature for type '{0}' is missing in type '{1}'."),
_0_and_1_index_signatures_are_incompatible: diag(2330, ts.DiagnosticCategory.Error, "_0_and_1_index_signatures_are_incompatible_2330", "'{0}' and '{1}' index signatures are incompatible."),
this_cannot_be_referenced_in_a_module_or_namespace_body: diag(2331, ts.DiagnosticCategory.Error, "this_cannot_be_referenced_in_a_module_or_namespace_body_2331", "'this' cannot be referenced in a module or namespace body."),
this_cannot_be_referenced_in_current_location: diag(2332, ts.DiagnosticCategory.Error, "this_cannot_be_referenced_in_current_location_2332", "'this' cannot be referenced in current location."),
this_cannot_be_referenced_in_constructor_arguments: diag(2333, ts.DiagnosticCategory.Error, "this_cannot_be_referenced_in_constructor_arguments_2333", "'this' cannot be referenced in constructor arguments."),
this_cannot_be_referenced_in_a_static_property_initializer: diag(2334, ts.DiagnosticCategory.Error, "this_cannot_be_referenced_in_a_static_property_initializer_2334", "'this' cannot be referenced in a static property initializer."),
super_can_only_be_referenced_in_a_derived_class: diag(2335, ts.DiagnosticCategory.Error, "super_can_only_be_referenced_in_a_derived_class_2335", "'super' can only be referenced in a derived class."),
super_cannot_be_referenced_in_constructor_arguments: diag(2336, ts.DiagnosticCategory.Error, "super_cannot_be_referenced_in_constructor_arguments_2336", "'super' cannot be referenced in constructor arguments."),
Super_calls_are_not_permitted_outside_constructors_or_in_nested_functions_inside_constructors: diag(2337, ts.DiagnosticCategory.Error, "Super_calls_are_not_permitted_outside_constructors_or_in_nested_functions_inside_constructors_2337", "Super calls are not permitted outside constructors or in nested functions inside constructors."),
super_property_access_is_permitted_only_in_a_constructor_member_function_or_member_accessor_of_a_derived_class: diag(2338, ts.DiagnosticCategory.Error, "super_property_access_is_permitted_only_in_a_constructor_member_function_or_member_accessor_of_a_der_2338", "'super' property access is permitted only in a constructor, member function, or member accessor of a derived class."),
Property_0_does_not_exist_on_type_1: diag(2339, ts.DiagnosticCategory.Error, "Property_0_does_not_exist_on_type_1_2339", "Property '{0}' does not exist on type '{1}'."),
Only_public_and_protected_methods_of_the_base_class_are_accessible_via_the_super_keyword: diag(2340, ts.DiagnosticCategory.Error, "Only_public_and_protected_methods_of_the_base_class_are_accessible_via_the_super_keyword_2340", "Only public and protected methods of the base class are accessible via the 'super' keyword."),
Property_0_is_private_and_only_accessible_within_class_1: diag(2341, ts.DiagnosticCategory.Error, "Property_0_is_private_and_only_accessible_within_class_1_2341", "Property '{0}' is private and only accessible within class '{1}'."),
An_index_expression_argument_must_be_of_type_string_number_symbol_or_any: diag(2342, ts.DiagnosticCategory.Error, "An_index_expression_argument_must_be_of_type_string_number_symbol_or_any_2342", "An index expression argument must be of type 'string', 'number', 'symbol', or 'any'."),
This_syntax_requires_an_imported_helper_named_1_which_does_not_exist_in_0_Consider_upgrading_your_version_of_0: diag(2343, ts.DiagnosticCategory.Error, "This_syntax_requires_an_imported_helper_named_1_which_does_not_exist_in_0_Consider_upgrading_your_ve_2343", "This syntax requires an imported helper named '{1}' which does not exist in '{0}'. Consider upgrading your version of '{0}'."),
Type_0_does_not_satisfy_the_constraint_1: diag(2344, ts.DiagnosticCategory.Error, "Type_0_does_not_satisfy_the_constraint_1_2344", "Type '{0}' does not satisfy the constraint '{1}'."),
Argument_of_type_0_is_not_assignable_to_parameter_of_type_1: diag(2345, ts.DiagnosticCategory.Error, "Argument_of_type_0_is_not_assignable_to_parameter_of_type_1_2345", "Argument of type '{0}' is not assignable to parameter of type '{1}'."),
Call_target_does_not_contain_any_signatures: diag(2346, ts.DiagnosticCategory.Error, "Call_target_does_not_contain_any_signatures_2346", "Call target does not contain any signatures."),
Untyped_function_calls_may_not_accept_type_arguments: diag(2347, ts.DiagnosticCategory.Error, "Untyped_function_calls_may_not_accept_type_arguments_2347", "Untyped function calls may not accept type arguments."),
Value_of_type_0_is_not_callable_Did_you_mean_to_include_new: diag(2348, ts.DiagnosticCategory.Error, "Value_of_type_0_is_not_callable_Did_you_mean_to_include_new_2348", "Value of type '{0}' is not callable. Did you mean to include 'new'?"),
This_expression_is_not_callable: diag(2349, ts.DiagnosticCategory.Error, "This_expression_is_not_callable_2349", "This expression is not callable."),
Only_a_void_function_can_be_called_with_the_new_keyword: diag(2350, ts.DiagnosticCategory.Error, "Only_a_void_function_can_be_called_with_the_new_keyword_2350", "Only a void function can be called with the 'new' keyword."),
This_expression_is_not_constructable: diag(2351, ts.DiagnosticCategory.Error, "This_expression_is_not_constructable_2351", "This expression is not constructable."),
Conversion_of_type_0_to_type_1_may_be_a_mistake_because_neither_type_sufficiently_overlaps_with_the_other_If_this_was_intentional_convert_the_expression_to_unknown_first: diag(2352, ts.DiagnosticCategory.Error, "Conversion_of_type_0_to_type_1_may_be_a_mistake_because_neither_type_sufficiently_overlaps_with_the__2352", "Conversion of type '{0}' to type '{1}' may be a mistake because neither type sufficiently overlaps with the other. If this was intentional, convert the expression to 'unknown' first."),
Object_literal_may_only_specify_known_properties_and_0_does_not_exist_in_type_1: diag(2353, ts.DiagnosticCategory.Error, "Object_literal_may_only_specify_known_properties_and_0_does_not_exist_in_type_1_2353", "Object literal may only specify known properties, and '{0}' does not exist in type '{1}'."),
This_syntax_requires_an_imported_helper_but_module_0_cannot_be_found: diag(2354, ts.DiagnosticCategory.Error, "This_syntax_requires_an_imported_helper_but_module_0_cannot_be_found_2354", "This syntax requires an imported helper but module '{0}' cannot be found."),
A_function_whose_declared_type_is_neither_void_nor_any_must_return_a_value: diag(2355, ts.DiagnosticCategory.Error, "A_function_whose_declared_type_is_neither_void_nor_any_must_return_a_value_2355", "A function whose declared type is neither 'void' nor 'any' must return a value."),
An_arithmetic_operand_must_be_of_type_any_number_bigint_or_an_enum_type: diag(2356, ts.DiagnosticCategory.Error, "An_arithmetic_operand_must_be_of_type_any_number_bigint_or_an_enum_type_2356", "An arithmetic operand must be of type 'any', 'number', 'bigint' or an enum type."),
The_operand_of_an_increment_or_decrement_operator_must_be_a_variable_or_a_property_access: diag(2357, ts.DiagnosticCategory.Error, "The_operand_of_an_increment_or_decrement_operator_must_be_a_variable_or_a_property_access_2357", "The operand of an increment or decrement operator must be a variable or a property access."),
The_left_hand_side_of_an_instanceof_expression_must_be_of_type_any_an_object_type_or_a_type_parameter: diag(2358, ts.DiagnosticCategory.Error, "The_left_hand_side_of_an_instanceof_expression_must_be_of_type_any_an_object_type_or_a_type_paramete_2358", "The left-hand side of an 'instanceof' expression must be of type 'any', an object type or a type parameter."),
The_right_hand_side_of_an_instanceof_expression_must_be_of_type_any_or_of_a_type_assignable_to_the_Function_interface_type: diag(2359, ts.DiagnosticCategory.Error, "The_right_hand_side_of_an_instanceof_expression_must_be_of_type_any_or_of_a_type_assignable_to_the_F_2359", "The right-hand side of an 'instanceof' expression must be of type 'any' or of a type assignable to the 'Function' interface type."),
The_left_hand_side_of_an_in_expression_must_be_of_type_any_string_number_or_symbol: diag(2360, ts.DiagnosticCategory.Error, "The_left_hand_side_of_an_in_expression_must_be_of_type_any_string_number_or_symbol_2360", "The left-hand side of an 'in' expression must be of type 'any', 'string', 'number', or 'symbol'."),
The_right_hand_side_of_an_in_expression_must_not_be_a_primitive: diag(2361, ts.DiagnosticCategory.Error, "The_right_hand_side_of_an_in_expression_must_not_be_a_primitive_2361", "The right-hand side of an 'in' expression must not be a primitive."),
The_left_hand_side_of_an_arithmetic_operation_must_be_of_type_any_number_bigint_or_an_enum_type: diag(2362, ts.DiagnosticCategory.Error, "The_left_hand_side_of_an_arithmetic_operation_must_be_of_type_any_number_bigint_or_an_enum_type_2362", "The left-hand side of an arithmetic operation must be of type 'any', 'number', 'bigint' or an enum type."),
The_right_hand_side_of_an_arithmetic_operation_must_be_of_type_any_number_bigint_or_an_enum_type: diag(2363, ts.DiagnosticCategory.Error, "The_right_hand_side_of_an_arithmetic_operation_must_be_of_type_any_number_bigint_or_an_enum_type_2363", "The right-hand side of an arithmetic operation must be of type 'any', 'number', 'bigint' or an enum type."),
The_left_hand_side_of_an_assignment_expression_must_be_a_variable_or_a_property_access: diag(2364, ts.DiagnosticCategory.Error, "The_left_hand_side_of_an_assignment_expression_must_be_a_variable_or_a_property_access_2364", "The left-hand side of an assignment expression must be a variable or a property access."),
Operator_0_cannot_be_applied_to_types_1_and_2: diag(2365, ts.DiagnosticCategory.Error, "Operator_0_cannot_be_applied_to_types_1_and_2_2365", "Operator '{0}' cannot be applied to types '{1}' and '{2}'."),
Function_lacks_ending_return_statement_and_return_type_does_not_include_undefined: diag(2366, ts.DiagnosticCategory.Error, "Function_lacks_ending_return_statement_and_return_type_does_not_include_undefined_2366", "Function lacks ending return statement and return type does not include 'undefined'."),
This_condition_will_always_return_0_since_the_types_1_and_2_have_no_overlap: diag(2367, ts.DiagnosticCategory.Error, "This_condition_will_always_return_0_since_the_types_1_and_2_have_no_overlap_2367", "This condition will always return '{0}' since the types '{1}' and '{2}' have no overlap."),
Type_parameter_name_cannot_be_0: diag(2368, ts.DiagnosticCategory.Error, "Type_parameter_name_cannot_be_0_2368", "Type parameter name cannot be '{0}'."),
A_parameter_property_is_only_allowed_in_a_constructor_implementation: diag(2369, ts.DiagnosticCategory.Error, "A_parameter_property_is_only_allowed_in_a_constructor_implementation_2369", "A parameter property is only allowed in a constructor implementation."),
A_rest_parameter_must_be_of_an_array_type: diag(2370, ts.DiagnosticCategory.Error, "A_rest_parameter_must_be_of_an_array_type_2370", "A rest parameter must be of an array type."),
A_parameter_initializer_is_only_allowed_in_a_function_or_constructor_implementation: diag(2371, ts.DiagnosticCategory.Error, "A_parameter_initializer_is_only_allowed_in_a_function_or_constructor_implementation_2371", "A parameter initializer is only allowed in a function or constructor implementation."),
Parameter_0_cannot_reference_itself: diag(2372, ts.DiagnosticCategory.Error, "Parameter_0_cannot_reference_itself_2372", "Parameter '{0}' cannot reference itself."),
Parameter_0_cannot_reference_identifier_1_declared_after_it: diag(2373, ts.DiagnosticCategory.Error, "Parameter_0_cannot_reference_identifier_1_declared_after_it_2373", "Parameter '{0}' cannot reference identifier '{1}' declared after it."),
Duplicate_index_signature_for_type_0: diag(2374, ts.DiagnosticCategory.Error, "Duplicate_index_signature_for_type_0_2374", "Duplicate index signature for type '{0}'."),
A_super_call_must_be_the_first_statement_in_the_constructor_when_a_class_contains_initialized_properties_parameter_properties_or_private_identifiers: diag(2376, ts.DiagnosticCategory.Error, "A_super_call_must_be_the_first_statement_in_the_constructor_when_a_class_contains_initialized_proper_2376", "A 'super' call must be the first statement in the constructor when a class contains initialized properties, parameter properties, or private identifiers."),
Constructors_for_derived_classes_must_contain_a_super_call: diag(2377, ts.DiagnosticCategory.Error, "Constructors_for_derived_classes_must_contain_a_super_call_2377", "Constructors for derived classes must contain a 'super' call."),
A_get_accessor_must_return_a_value: diag(2378, ts.DiagnosticCategory.Error, "A_get_accessor_must_return_a_value_2378", "A 'get' accessor must return a value."),
The_return_type_of_a_get_accessor_must_be_assignable_to_its_set_accessor_type: diag(2380, ts.DiagnosticCategory.Error, "The_return_type_of_a_get_accessor_must_be_assignable_to_its_set_accessor_type_2380", "The return type of a 'get' accessor must be assignable to its 'set' accessor type"),
A_signature_with_an_implementation_cannot_use_a_string_literal_type: diag(2381, ts.DiagnosticCategory.Error, "A_signature_with_an_implementation_cannot_use_a_string_literal_type_2381", "A signature with an implementation cannot use a string literal type."),
Specialized_overload_signature_is_not_assignable_to_any_non_specialized_signature: diag(2382, ts.DiagnosticCategory.Error, "Specialized_overload_signature_is_not_assignable_to_any_non_specialized_signature_2382", "Specialized overload signature is not assignable to any non-specialized signature."),
Overload_signatures_must_all_be_exported_or_non_exported: diag(2383, ts.DiagnosticCategory.Error, "Overload_signatures_must_all_be_exported_or_non_exported_2383", "Overload signatures must all be exported or non-exported."),
Overload_signatures_must_all_be_ambient_or_non_ambient: diag(2384, ts.DiagnosticCategory.Error, "Overload_signatures_must_all_be_ambient_or_non_ambient_2384", "Overload signatures must all be ambient or non-ambient."),
Overload_signatures_must_all_be_public_private_or_protected: diag(2385, ts.DiagnosticCategory.Error, "Overload_signatures_must_all_be_public_private_or_protected_2385", "Overload signatures must all be public, private or protected."),
Overload_signatures_must_all_be_optional_or_required: diag(2386, ts.DiagnosticCategory.Error, "Overload_signatures_must_all_be_optional_or_required_2386", "Overload signatures must all be optional or required."),
Function_overload_must_be_static: diag(2387, ts.DiagnosticCategory.Error, "Function_overload_must_be_static_2387", "Function overload must be static."),
Function_overload_must_not_be_static: diag(2388, ts.DiagnosticCategory.Error, "Function_overload_must_not_be_static_2388", "Function overload must not be static."),
Function_implementation_name_must_be_0: diag(2389, ts.DiagnosticCategory.Error, "Function_implementation_name_must_be_0_2389", "Function implementation name must be '{0}'."),
Constructor_implementation_is_missing: diag(2390, ts.DiagnosticCategory.Error, "Constructor_implementation_is_missing_2390", "Constructor implementation is missing."),
Function_implementation_is_missing_or_not_immediately_following_the_declaration: diag(2391, ts.DiagnosticCategory.Error, "Function_implementation_is_missing_or_not_immediately_following_the_declaration_2391", "Function implementation is missing or not immediately following the declaration."),
Multiple_constructor_implementations_are_not_allowed: diag(2392, ts.DiagnosticCategory.Error, "Multiple_constructor_implementations_are_not_allowed_2392", "Multiple constructor implementations are not allowed."),
Duplicate_function_implementation: diag(2393, ts.DiagnosticCategory.Error, "Duplicate_function_implementation_2393", "Duplicate function implementation."),
This_overload_signature_is_not_compatible_with_its_implementation_signature: diag(2394, ts.DiagnosticCategory.Error, "This_overload_signature_is_not_compatible_with_its_implementation_signature_2394", "This overload signature is not compatible with its implementation signature."),
Individual_declarations_in_merged_declaration_0_must_be_all_exported_or_all_local: diag(2395, ts.DiagnosticCategory.Error, "Individual_declarations_in_merged_declaration_0_must_be_all_exported_or_all_local_2395", "Individual declarations in merged declaration '{0}' must be all exported or all local."),
Duplicate_identifier_arguments_Compiler_uses_arguments_to_initialize_rest_parameters: diag(2396, ts.DiagnosticCategory.Error, "Duplicate_identifier_arguments_Compiler_uses_arguments_to_initialize_rest_parameters_2396", "Duplicate identifier 'arguments'. Compiler uses 'arguments' to initialize rest parameters."),
Declaration_name_conflicts_with_built_in_global_identifier_0: diag(2397, ts.DiagnosticCategory.Error, "Declaration_name_conflicts_with_built_in_global_identifier_0_2397", "Declaration name conflicts with built-in global identifier '{0}'."),
constructor_cannot_be_used_as_a_parameter_property_name: diag(2398, ts.DiagnosticCategory.Error, "constructor_cannot_be_used_as_a_parameter_property_name_2398", "'constructor' cannot be used as a parameter property name."),
Duplicate_identifier_this_Compiler_uses_variable_declaration_this_to_capture_this_reference: diag(2399, ts.DiagnosticCategory.Error, "Duplicate_identifier_this_Compiler_uses_variable_declaration_this_to_capture_this_reference_2399", "Duplicate identifier '_this'. Compiler uses variable declaration '_this' to capture 'this' reference."),
Expression_resolves_to_variable_declaration_this_that_compiler_uses_to_capture_this_reference: diag(2400, ts.DiagnosticCategory.Error, "Expression_resolves_to_variable_declaration_this_that_compiler_uses_to_capture_this_reference_2400", "Expression resolves to variable declaration '_this' that compiler uses to capture 'this' reference."),
Duplicate_identifier_super_Compiler_uses_super_to_capture_base_class_reference: diag(2401, ts.DiagnosticCategory.Error, "Duplicate_identifier_super_Compiler_uses_super_to_capture_base_class_reference_2401", "Duplicate identifier '_super'. Compiler uses '_super' to capture base class reference."),
Expression_resolves_to_super_that_compiler_uses_to_capture_base_class_reference: diag(2402, ts.DiagnosticCategory.Error, "Expression_resolves_to_super_that_compiler_uses_to_capture_base_class_reference_2402", "Expression resolves to '_super' that compiler uses to capture base class reference."),
Subsequent_variable_declarations_must_have_the_same_type_Variable_0_must_be_of_type_1_but_here_has_type_2: diag(2403, ts.DiagnosticCategory.Error, "Subsequent_variable_declarations_must_have_the_same_type_Variable_0_must_be_of_type_1_but_here_has_t_2403", "Subsequent variable declarations must have the same type. Variable '{0}' must be of type '{1}', but here has type '{2}'."),
The_left_hand_side_of_a_for_in_statement_cannot_use_a_type_annotation: diag(2404, ts.DiagnosticCategory.Error, "The_left_hand_side_of_a_for_in_statement_cannot_use_a_type_annotation_2404", "The left-hand side of a 'for...in' statement cannot use a type annotation."),
The_left_hand_side_of_a_for_in_statement_must_be_of_type_string_or_any: diag(2405, ts.DiagnosticCategory.Error, "The_left_hand_side_of_a_for_in_statement_must_be_of_type_string_or_any_2405", "The left-hand side of a 'for...in' statement must be of type 'string' or 'any'."),
The_left_hand_side_of_a_for_in_statement_must_be_a_variable_or_a_property_access: diag(2406, ts.DiagnosticCategory.Error, "The_left_hand_side_of_a_for_in_statement_must_be_a_variable_or_a_property_access_2406", "The left-hand side of a 'for...in' statement must be a variable or a property access."),
The_right_hand_side_of_a_for_in_statement_must_be_of_type_any_an_object_type_or_a_type_parameter_but_here_has_type_0: diag(2407, ts.DiagnosticCategory.Error, "The_right_hand_side_of_a_for_in_statement_must_be_of_type_any_an_object_type_or_a_type_parameter_but_2407", "The right-hand side of a 'for...in' statement must be of type 'any', an object type or a type parameter, but here has type '{0}'."),
Setters_cannot_return_a_value: diag(2408, ts.DiagnosticCategory.Error, "Setters_cannot_return_a_value_2408", "Setters cannot return a value."),
Return_type_of_constructor_signature_must_be_assignable_to_the_instance_type_of_the_class: diag(2409, ts.DiagnosticCategory.Error, "Return_type_of_constructor_signature_must_be_assignable_to_the_instance_type_of_the_class_2409", "Return type of constructor signature must be assignable to the instance type of the class."),
The_with_statement_is_not_supported_All_symbols_in_a_with_block_will_have_type_any: diag(2410, ts.DiagnosticCategory.Error, "The_with_statement_is_not_supported_All_symbols_in_a_with_block_will_have_type_any_2410", "The 'with' statement is not supported. All symbols in a 'with' block will have type 'any'."),
Property_0_of_type_1_is_not_assignable_to_2_index_type_3: diag(2411, ts.DiagnosticCategory.Error, "Property_0_of_type_1_is_not_assignable_to_2_index_type_3_2411", "Property '{0}' of type '{1}' is not assignable to '{2}' index type '{3}'."),
_0_index_type_1_is_not_assignable_to_2_index_type_3: diag(2413, ts.DiagnosticCategory.Error, "_0_index_type_1_is_not_assignable_to_2_index_type_3_2413", "'{0}' index type '{1}' is not assignable to '{2}' index type '{3}'."),
Class_name_cannot_be_0: diag(2414, ts.DiagnosticCategory.Error, "Class_name_cannot_be_0_2414", "Class name cannot be '{0}'."),
Class_0_incorrectly_extends_base_class_1: diag(2415, ts.DiagnosticCategory.Error, "Class_0_incorrectly_extends_base_class_1_2415", "Class '{0}' incorrectly extends base class '{1}'."),
Property_0_in_type_1_is_not_assignable_to_the_same_property_in_base_type_2: diag(2416, ts.DiagnosticCategory.Error, "Property_0_in_type_1_is_not_assignable_to_the_same_property_in_base_type_2_2416", "Property '{0}' in type '{1}' is not assignable to the same property in base type '{2}'."),
Class_static_side_0_incorrectly_extends_base_class_static_side_1: diag(2417, ts.DiagnosticCategory.Error, "Class_static_side_0_incorrectly_extends_base_class_static_side_1_2417", "Class static side '{0}' incorrectly extends base class static side '{1}'."),
Type_of_computed_property_s_value_is_0_which_is_not_assignable_to_type_1: diag(2418, ts.DiagnosticCategory.Error, "Type_of_computed_property_s_value_is_0_which_is_not_assignable_to_type_1_2418", "Type of computed property's value is '{0}', which is not assignable to type '{1}'."),
Types_of_construct_signatures_are_incompatible: diag(2419, ts.DiagnosticCategory.Error, "Types_of_construct_signatures_are_incompatible_2419", "Types of construct signatures are incompatible."),
Class_0_incorrectly_implements_interface_1: diag(2420, ts.DiagnosticCategory.Error, "Class_0_incorrectly_implements_interface_1_2420", "Class '{0}' incorrectly implements interface '{1}'."),
A_class_can_only_implement_an_object_type_or_intersection_of_object_types_with_statically_known_members: diag(2422, ts.DiagnosticCategory.Error, "A_class_can_only_implement_an_object_type_or_intersection_of_object_types_with_statically_known_memb_2422", "A class can only implement an object type or intersection of object types with statically known members."),
Class_0_defines_instance_member_function_1_but_extended_class_2_defines_it_as_instance_member_accessor: diag(2423, ts.DiagnosticCategory.Error, "Class_0_defines_instance_member_function_1_but_extended_class_2_defines_it_as_instance_member_access_2423", "Class '{0}' defines instance member function '{1}', but extended class '{2}' defines it as instance member accessor."),
Class_0_defines_instance_member_property_1_but_extended_class_2_defines_it_as_instance_member_function: diag(2425, ts.DiagnosticCategory.Error, "Class_0_defines_instance_member_property_1_but_extended_class_2_defines_it_as_instance_member_functi_2425", "Class '{0}' defines instance member property '{1}', but extended class '{2}' defines it as instance member function."),
Class_0_defines_instance_member_accessor_1_but_extended_class_2_defines_it_as_instance_member_function: diag(2426, ts.DiagnosticCategory.Error, "Class_0_defines_instance_member_accessor_1_but_extended_class_2_defines_it_as_instance_member_functi_2426", "Class '{0}' defines instance member accessor '{1}', but extended class '{2}' defines it as instance member function."),
Interface_name_cannot_be_0: diag(2427, ts.DiagnosticCategory.Error, "Interface_name_cannot_be_0_2427", "Interface name cannot be '{0}'."),
All_declarations_of_0_must_have_identical_type_parameters: diag(2428, ts.DiagnosticCategory.Error, "All_declarations_of_0_must_have_identical_type_parameters_2428", "All declarations of '{0}' must have identical type parameters."),
Interface_0_incorrectly_extends_interface_1: diag(2430, ts.DiagnosticCategory.Error, "Interface_0_incorrectly_extends_interface_1_2430", "Interface '{0}' incorrectly extends interface '{1}'."),
Enum_name_cannot_be_0: diag(2431, ts.DiagnosticCategory.Error, "Enum_name_cannot_be_0_2431", "Enum name cannot be '{0}'."),
In_an_enum_with_multiple_declarations_only_one_declaration_can_omit_an_initializer_for_its_first_enum_element: diag(2432, ts.DiagnosticCategory.Error, "In_an_enum_with_multiple_declarations_only_one_declaration_can_omit_an_initializer_for_its_first_enu_2432", "In an enum with multiple declarations, only one declaration can omit an initializer for its first enum element."),
A_namespace_declaration_cannot_be_in_a_different_file_from_a_class_or_function_with_which_it_is_merged: diag(2433, ts.DiagnosticCategory.Error, "A_namespace_declaration_cannot_be_in_a_different_file_from_a_class_or_function_with_which_it_is_merg_2433", "A namespace declaration cannot be in a different file from a class or function with which it is merged."),
A_namespace_declaration_cannot_be_located_prior_to_a_class_or_function_with_which_it_is_merged: diag(2434, ts.DiagnosticCategory.Error, "A_namespace_declaration_cannot_be_located_prior_to_a_class_or_function_with_which_it_is_merged_2434", "A namespace declaration cannot be located prior to a class or function with which it is merged."),
Ambient_modules_cannot_be_nested_in_other_modules_or_namespaces: diag(2435, ts.DiagnosticCategory.Error, "Ambient_modules_cannot_be_nested_in_other_modules_or_namespaces_2435", "Ambient modules cannot be nested in other modules or namespaces."),
Ambient_module_declaration_cannot_specify_relative_module_name: diag(2436, ts.DiagnosticCategory.Error, "Ambient_module_declaration_cannot_specify_relative_module_name_2436", "Ambient module declaration cannot specify relative module name."),
Module_0_is_hidden_by_a_local_declaration_with_the_same_name: diag(2437, ts.DiagnosticCategory.Error, "Module_0_is_hidden_by_a_local_declaration_with_the_same_name_2437", "Module '{0}' is hidden by a local declaration with the same name."),
Import_name_cannot_be_0: diag(2438, ts.DiagnosticCategory.Error, "Import_name_cannot_be_0_2438", "Import name cannot be '{0}'."),
Import_or_export_declaration_in_an_ambient_module_declaration_cannot_reference_module_through_relative_module_name: diag(2439, ts.DiagnosticCategory.Error, "Import_or_export_declaration_in_an_ambient_module_declaration_cannot_reference_module_through_relati_2439", "Import or export declaration in an ambient module declaration cannot reference module through relative module name."),
Import_declaration_conflicts_with_local_declaration_of_0: diag(2440, ts.DiagnosticCategory.Error, "Import_declaration_conflicts_with_local_declaration_of_0_2440", "Import declaration conflicts with local declaration of '{0}'."),
Duplicate_identifier_0_Compiler_reserves_name_1_in_top_level_scope_of_a_module: diag(2441, ts.DiagnosticCategory.Error, "Duplicate_identifier_0_Compiler_reserves_name_1_in_top_level_scope_of_a_module_2441", "Duplicate identifier '{0}'. Compiler reserves name '{1}' in top level scope of a module."),
Types_have_separate_declarations_of_a_private_property_0: diag(2442, ts.DiagnosticCategory.Error, "Types_have_separate_declarations_of_a_private_property_0_2442", "Types have separate declarations of a private property '{0}'."),
Property_0_is_protected_but_type_1_is_not_a_class_derived_from_2: diag(2443, ts.DiagnosticCategory.Error, "Property_0_is_protected_but_type_1_is_not_a_class_derived_from_2_2443", "Property '{0}' is protected but type '{1}' is not a class derived from '{2}'."),
Property_0_is_protected_in_type_1_but_public_in_type_2: diag(2444, ts.DiagnosticCategory.Error, "Property_0_is_protected_in_type_1_but_public_in_type_2_2444", "Property '{0}' is protected in type '{1}' but public in type '{2}'."),
Property_0_is_protected_and_only_accessible_within_class_1_and_its_subclasses: diag(2445, ts.DiagnosticCategory.Error, "Property_0_is_protected_and_only_accessible_within_class_1_and_its_subclasses_2445", "Property '{0}' is protected and only accessible within class '{1}' and its subclasses."),
Property_0_is_protected_and_only_accessible_through_an_instance_of_class_1_This_is_an_instance_of_class_2: diag(2446, ts.DiagnosticCategory.Error, "Property_0_is_protected_and_only_accessible_through_an_instance_of_class_1_This_is_an_instance_of_cl_2446", "Property '{0}' is protected and only accessible through an instance of class '{1}'. This is an instance of class '{2}'."),
The_0_operator_is_not_allowed_for_boolean_types_Consider_using_1_instead: diag(2447, ts.DiagnosticCategory.Error, "The_0_operator_is_not_allowed_for_boolean_types_Consider_using_1_instead_2447", "The '{0}' operator is not allowed for boolean types. Consider using '{1}' instead."),
Block_scoped_variable_0_used_before_its_declaration: diag(2448, ts.DiagnosticCategory.Error, "Block_scoped_variable_0_used_before_its_declaration_2448", "Block-scoped variable '{0}' used before its declaration."),
Class_0_used_before_its_declaration: diag(2449, ts.DiagnosticCategory.Error, "Class_0_used_before_its_declaration_2449", "Class '{0}' used before its declaration."),
Enum_0_used_before_its_declaration: diag(2450, ts.DiagnosticCategory.Error, "Enum_0_used_before_its_declaration_2450", "Enum '{0}' used before its declaration."),
Cannot_redeclare_block_scoped_variable_0: diag(2451, ts.DiagnosticCategory.Error, "Cannot_redeclare_block_scoped_variable_0_2451", "Cannot redeclare block-scoped variable '{0}'."),
An_enum_member_cannot_have_a_numeric_name: diag(2452, ts.DiagnosticCategory.Error, "An_enum_member_cannot_have_a_numeric_name_2452", "An enum member cannot have a numeric name."),
The_type_argument_for_type_parameter_0_cannot_be_inferred_from_the_usage_Consider_specifying_the_type_arguments_explicitly: diag(2453, ts.DiagnosticCategory.Error, "The_type_argument_for_type_parameter_0_cannot_be_inferred_from_the_usage_Consider_specifying_the_typ_2453", "The type argument for type parameter '{0}' cannot be inferred from the usage. Consider specifying the type arguments explicitly."),
Variable_0_is_used_before_being_assigned: diag(2454, ts.DiagnosticCategory.Error, "Variable_0_is_used_before_being_assigned_2454", "Variable '{0}' is used before being assigned."),
Type_argument_candidate_1_is_not_a_valid_type_argument_because_it_is_not_a_supertype_of_candidate_0: diag(2455, ts.DiagnosticCategory.Error, "Type_argument_candidate_1_is_not_a_valid_type_argument_because_it_is_not_a_supertype_of_candidate_0_2455", "Type argument candidate '{1}' is not a valid type argument because it is not a supertype of candidate '{0}'."),
Type_alias_0_circularly_references_itself: diag(2456, ts.DiagnosticCategory.Error, "Type_alias_0_circularly_references_itself_2456", "Type alias '{0}' circularly references itself."),
Type_alias_name_cannot_be_0: diag(2457, ts.DiagnosticCategory.Error, "Type_alias_name_cannot_be_0_2457", "Type alias name cannot be '{0}'."),
An_AMD_module_cannot_have_multiple_name_assignments: diag(2458, ts.DiagnosticCategory.Error, "An_AMD_module_cannot_have_multiple_name_assignments_2458", "An AMD module cannot have multiple name assignments."),
Module_0_declares_1_locally_but_it_is_not_exported: diag(2459, ts.DiagnosticCategory.Error, "Module_0_declares_1_locally_but_it_is_not_exported_2459", "Module '{0}' declares '{1}' locally, but it is not exported."),
Module_0_declares_1_locally_but_it_is_exported_as_2: diag(2460, ts.DiagnosticCategory.Error, "Module_0_declares_1_locally_but_it_is_exported_as_2_2460", "Module '{0}' declares '{1}' locally, but it is exported as '{2}'."),
Type_0_is_not_an_array_type: diag(2461, ts.DiagnosticCategory.Error, "Type_0_is_not_an_array_type_2461", "Type '{0}' is not an array type."),
A_rest_element_must_be_last_in_a_destructuring_pattern: diag(2462, ts.DiagnosticCategory.Error, "A_rest_element_must_be_last_in_a_destructuring_pattern_2462", "A rest element must be last in a destructuring pattern."),
A_binding_pattern_parameter_cannot_be_optional_in_an_implementation_signature: diag(2463, ts.DiagnosticCategory.Error, "A_binding_pattern_parameter_cannot_be_optional_in_an_implementation_signature_2463", "A binding pattern parameter cannot be optional in an implementation signature."),
A_computed_property_name_must_be_of_type_string_number_symbol_or_any: diag(2464, ts.DiagnosticCategory.Error, "A_computed_property_name_must_be_of_type_string_number_symbol_or_any_2464", "A computed property name must be of type 'string', 'number', 'symbol', or 'any'."),
this_cannot_be_referenced_in_a_computed_property_name: diag(2465, ts.DiagnosticCategory.Error, "this_cannot_be_referenced_in_a_computed_property_name_2465", "'this' cannot be referenced in a computed property name."),
super_cannot_be_referenced_in_a_computed_property_name: diag(2466, ts.DiagnosticCategory.Error, "super_cannot_be_referenced_in_a_computed_property_name_2466", "'super' cannot be referenced in a computed property name."),
A_computed_property_name_cannot_reference_a_type_parameter_from_its_containing_type: diag(2467, ts.DiagnosticCategory.Error, "A_computed_property_name_cannot_reference_a_type_parameter_from_its_containing_type_2467", "A computed property name cannot reference a type parameter from its containing type."),
Cannot_find_global_value_0: diag(2468, ts.DiagnosticCategory.Error, "Cannot_find_global_value_0_2468", "Cannot find global value '{0}'."),
The_0_operator_cannot_be_applied_to_type_symbol: diag(2469, ts.DiagnosticCategory.Error, "The_0_operator_cannot_be_applied_to_type_symbol_2469", "The '{0}' operator cannot be applied to type 'symbol'."),
Symbol_reference_does_not_refer_to_the_global_Symbol_constructor_object: diag(2470, ts.DiagnosticCategory.Error, "Symbol_reference_does_not_refer_to_the_global_Symbol_constructor_object_2470", "'Symbol' reference does not refer to the global Symbol constructor object."),
A_computed_property_name_of_the_form_0_must_be_of_type_symbol: diag(2471, ts.DiagnosticCategory.Error, "A_computed_property_name_of_the_form_0_must_be_of_type_symbol_2471", "A computed property name of the form '{0}' must be of type 'symbol'."),
Spread_operator_in_new_expressions_is_only_available_when_targeting_ECMAScript_5_and_higher: diag(2472, ts.DiagnosticCategory.Error, "Spread_operator_in_new_expressions_is_only_available_when_targeting_ECMAScript_5_and_higher_2472", "Spread operator in 'new' expressions is only available when targeting ECMAScript 5 and higher."),
Enum_declarations_must_all_be_const_or_non_const: diag(2473, ts.DiagnosticCategory.Error, "Enum_declarations_must_all_be_const_or_non_const_2473", "Enum declarations must all be const or non-const."),
const_enum_member_initializers_can_only_contain_literal_values_and_other_computed_enum_values: diag(2474, ts.DiagnosticCategory.Error, "const_enum_member_initializers_can_only_contain_literal_values_and_other_computed_enum_values_2474", "const enum member initializers can only contain literal values and other computed enum values."),
const_enums_can_only_be_used_in_property_or_index_access_expressions_or_the_right_hand_side_of_an_import_declaration_or_export_assignment_or_type_query: diag(2475, ts.DiagnosticCategory.Error, "const_enums_can_only_be_used_in_property_or_index_access_expressions_or_the_right_hand_side_of_an_im_2475", "'const' enums can only be used in property or index access expressions or the right hand side of an import declaration or export assignment or type query."),
A_const_enum_member_can_only_be_accessed_using_a_string_literal: diag(2476, ts.DiagnosticCategory.Error, "A_const_enum_member_can_only_be_accessed_using_a_string_literal_2476", "A const enum member can only be accessed using a string literal."),
const_enum_member_initializer_was_evaluated_to_a_non_finite_value: diag(2477, ts.DiagnosticCategory.Error, "const_enum_member_initializer_was_evaluated_to_a_non_finite_value_2477", "'const' enum member initializer was evaluated to a non-finite value."),
const_enum_member_initializer_was_evaluated_to_disallowed_value_NaN: diag(2478, ts.DiagnosticCategory.Error, "const_enum_member_initializer_was_evaluated_to_disallowed_value_NaN_2478", "'const' enum member initializer was evaluated to disallowed value 'NaN'."),
Property_0_does_not_exist_on_const_enum_1: diag(2479, ts.DiagnosticCategory.Error, "Property_0_does_not_exist_on_const_enum_1_2479", "Property '{0}' does not exist on 'const' enum '{1}'."),
let_is_not_allowed_to_be_used_as_a_name_in_let_or_const_declarations: diag(2480, ts.DiagnosticCategory.Error, "let_is_not_allowed_to_be_used_as_a_name_in_let_or_const_declarations_2480", "'let' is not allowed to be used as a name in 'let' or 'const' declarations."),
Cannot_initialize_outer_scoped_variable_0_in_the_same_scope_as_block_scoped_declaration_1: diag(2481, ts.DiagnosticCategory.Error, "Cannot_initialize_outer_scoped_variable_0_in_the_same_scope_as_block_scoped_declaration_1_2481", "Cannot initialize outer scoped variable '{0}' in the same scope as block scoped declaration '{1}'."),
The_left_hand_side_of_a_for_of_statement_cannot_use_a_type_annotation: diag(2483, ts.DiagnosticCategory.Error, "The_left_hand_side_of_a_for_of_statement_cannot_use_a_type_annotation_2483", "The left-hand side of a 'for...of' statement cannot use a type annotation."),
Export_declaration_conflicts_with_exported_declaration_of_0: diag(2484, ts.DiagnosticCategory.Error, "Export_declaration_conflicts_with_exported_declaration_of_0_2484", "Export declaration conflicts with exported declaration of '{0}'."),
The_left_hand_side_of_a_for_of_statement_must_be_a_variable_or_a_property_access: diag(2487, ts.DiagnosticCategory.Error, "The_left_hand_side_of_a_for_of_statement_must_be_a_variable_or_a_property_access_2487", "The left-hand side of a 'for...of' statement must be a variable or a property access."),
Type_0_must_have_a_Symbol_iterator_method_that_returns_an_iterator: diag(2488, ts.DiagnosticCategory.Error, "Type_0_must_have_a_Symbol_iterator_method_that_returns_an_iterator_2488", "Type '{0}' must have a '[Symbol.iterator]()' method that returns an iterator."),
An_iterator_must_have_a_next_method: diag(2489, ts.DiagnosticCategory.Error, "An_iterator_must_have_a_next_method_2489", "An iterator must have a 'next()' method."),
The_type_returned_by_the_0_method_of_an_iterator_must_have_a_value_property: diag(2490, ts.DiagnosticCategory.Error, "The_type_returned_by_the_0_method_of_an_iterator_must_have_a_value_property_2490", "The type returned by the '{0}()' method of an iterator must have a 'value' property."),
The_left_hand_side_of_a_for_in_statement_cannot_be_a_destructuring_pattern: diag(2491, ts.DiagnosticCategory.Error, "The_left_hand_side_of_a_for_in_statement_cannot_be_a_destructuring_pattern_2491", "The left-hand side of a 'for...in' statement cannot be a destructuring pattern."),
Cannot_redeclare_identifier_0_in_catch_clause: diag(2492, ts.DiagnosticCategory.Error, "Cannot_redeclare_identifier_0_in_catch_clause_2492", "Cannot redeclare identifier '{0}' in catch clause."),
Tuple_type_0_of_length_1_has_no_element_at_index_2: diag(2493, ts.DiagnosticCategory.Error, "Tuple_type_0_of_length_1_has_no_element_at_index_2_2493", "Tuple type '{0}' of length '{1}' has no element at index '{2}'."),
Using_a_string_in_a_for_of_statement_is_only_supported_in_ECMAScript_5_and_higher: diag(2494, ts.DiagnosticCategory.Error, "Using_a_string_in_a_for_of_statement_is_only_supported_in_ECMAScript_5_and_higher_2494", "Using a string in a 'for...of' statement is only supported in ECMAScript 5 and higher."),
Type_0_is_not_an_array_type_or_a_string_type: diag(2495, ts.DiagnosticCategory.Error, "Type_0_is_not_an_array_type_or_a_string_type_2495", "Type '{0}' is not an array type or a string type."),
The_arguments_object_cannot_be_referenced_in_an_arrow_function_in_ES3_and_ES5_Consider_using_a_standard_function_expression: diag(2496, ts.DiagnosticCategory.Error, "The_arguments_object_cannot_be_referenced_in_an_arrow_function_in_ES3_and_ES5_Consider_using_a_stand_2496", "The 'arguments' object cannot be referenced in an arrow function in ES3 and ES5. Consider using a standard function expression."),
This_module_can_only_be_referenced_with_ECMAScript_imports_Slashexports_by_turning_on_the_0_flag_and_referencing_its_default_export: diag(2497, ts.DiagnosticCategory.Error, "This_module_can_only_be_referenced_with_ECMAScript_imports_Slashexports_by_turning_on_the_0_flag_and_2497", "This module can only be referenced with ECMAScript imports/exports by turning on the '{0}' flag and referencing its default export."),
Module_0_uses_export_and_cannot_be_used_with_export_Asterisk: diag(2498, ts.DiagnosticCategory.Error, "Module_0_uses_export_and_cannot_be_used_with_export_Asterisk_2498", "Module '{0}' uses 'export =' and cannot be used with 'export *'."),
An_interface_can_only_extend_an_identifier_Slashqualified_name_with_optional_type_arguments: diag(2499, ts.DiagnosticCategory.Error, "An_interface_can_only_extend_an_identifier_Slashqualified_name_with_optional_type_arguments_2499", "An interface can only extend an identifier/qualified-name with optional type arguments."),
A_class_can_only_implement_an_identifier_Slashqualified_name_with_optional_type_arguments: diag(2500, ts.DiagnosticCategory.Error, "A_class_can_only_implement_an_identifier_Slashqualified_name_with_optional_type_arguments_2500", "A class can only implement an identifier/qualified-name with optional type arguments."),
A_rest_element_cannot_contain_a_binding_pattern: diag(2501, ts.DiagnosticCategory.Error, "A_rest_element_cannot_contain_a_binding_pattern_2501", "A rest element cannot contain a binding pattern."),
_0_is_referenced_directly_or_indirectly_in_its_own_type_annotation: diag(2502, ts.DiagnosticCategory.Error, "_0_is_referenced_directly_or_indirectly_in_its_own_type_annotation_2502", "'{0}' is referenced directly or indirectly in its own type annotation."),
Cannot_find_namespace_0: diag(2503, ts.DiagnosticCategory.Error, "Cannot_find_namespace_0_2503", "Cannot find namespace '{0}'."),
Type_0_must_have_a_Symbol_asyncIterator_method_that_returns_an_async_iterator: diag(2504, ts.DiagnosticCategory.Error, "Type_0_must_have_a_Symbol_asyncIterator_method_that_returns_an_async_iterator_2504", "Type '{0}' must have a '[Symbol.asyncIterator]()' method that returns an async iterator."),
A_generator_cannot_have_a_void_type_annotation: diag(2505, ts.DiagnosticCategory.Error, "A_generator_cannot_have_a_void_type_annotation_2505", "A generator cannot have a 'void' type annotation."),
_0_is_referenced_directly_or_indirectly_in_its_own_base_expression: diag(2506, ts.DiagnosticCategory.Error, "_0_is_referenced_directly_or_indirectly_in_its_own_base_expression_2506", "'{0}' is referenced directly or indirectly in its own base expression."),
Type_0_is_not_a_constructor_function_type: diag(2507, ts.DiagnosticCategory.Error, "Type_0_is_not_a_constructor_function_type_2507", "Type '{0}' is not a constructor function type."),
No_base_constructor_has_the_specified_number_of_type_arguments: diag(2508, ts.DiagnosticCategory.Error, "No_base_constructor_has_the_specified_number_of_type_arguments_2508", "No base constructor has the specified number of type arguments."),
Base_constructor_return_type_0_is_not_an_object_type_or_intersection_of_object_types_with_statically_known_members: diag(2509, ts.DiagnosticCategory.Error, "Base_constructor_return_type_0_is_not_an_object_type_or_intersection_of_object_types_with_statically_2509", "Base constructor return type '{0}' is not an object type or intersection of object types with statically known members."),
Base_constructors_must_all_have_the_same_return_type: diag(2510, ts.DiagnosticCategory.Error, "Base_constructors_must_all_have_the_same_return_type_2510", "Base constructors must all have the same return type."),
Cannot_create_an_instance_of_an_abstract_class: diag(2511, ts.DiagnosticCategory.Error, "Cannot_create_an_instance_of_an_abstract_class_2511", "Cannot create an instance of an abstract class."),
Overload_signatures_must_all_be_abstract_or_non_abstract: diag(2512, ts.DiagnosticCategory.Error, "Overload_signatures_must_all_be_abstract_or_non_abstract_2512", "Overload signatures must all be abstract or non-abstract."),
Abstract_method_0_in_class_1_cannot_be_accessed_via_super_expression: diag(2513, ts.DiagnosticCategory.Error, "Abstract_method_0_in_class_1_cannot_be_accessed_via_super_expression_2513", "Abstract method '{0}' in class '{1}' cannot be accessed via super expression."),
Classes_containing_abstract_methods_must_be_marked_abstract: diag(2514, ts.DiagnosticCategory.Error, "Classes_containing_abstract_methods_must_be_marked_abstract_2514", "Classes containing abstract methods must be marked abstract."),
Non_abstract_class_0_does_not_implement_inherited_abstract_member_1_from_class_2: diag(2515, ts.DiagnosticCategory.Error, "Non_abstract_class_0_does_not_implement_inherited_abstract_member_1_from_class_2_2515", "Non-abstract class '{0}' does not implement inherited abstract member '{1}' from class '{2}'."),
All_declarations_of_an_abstract_method_must_be_consecutive: diag(2516, ts.DiagnosticCategory.Error, "All_declarations_of_an_abstract_method_must_be_consecutive_2516", "All declarations of an abstract method must be consecutive."),
Cannot_assign_an_abstract_constructor_type_to_a_non_abstract_constructor_type: diag(2517, ts.DiagnosticCategory.Error, "Cannot_assign_an_abstract_constructor_type_to_a_non_abstract_constructor_type_2517", "Cannot assign an abstract constructor type to a non-abstract constructor type."),
A_this_based_type_guard_is_not_compatible_with_a_parameter_based_type_guard: diag(2518, ts.DiagnosticCategory.Error, "A_this_based_type_guard_is_not_compatible_with_a_parameter_based_type_guard_2518", "A 'this'-based type guard is not compatible with a parameter-based type guard."),
An_async_iterator_must_have_a_next_method: diag(2519, ts.DiagnosticCategory.Error, "An_async_iterator_must_have_a_next_method_2519", "An async iterator must have a 'next()' method."),
Duplicate_identifier_0_Compiler_uses_declaration_1_to_support_async_functions: diag(2520, ts.DiagnosticCategory.Error, "Duplicate_identifier_0_Compiler_uses_declaration_1_to_support_async_functions_2520", "Duplicate identifier '{0}'. Compiler uses declaration '{1}' to support async functions."),
Expression_resolves_to_variable_declaration_0_that_compiler_uses_to_support_async_functions: diag(2521, ts.DiagnosticCategory.Error, "Expression_resolves_to_variable_declaration_0_that_compiler_uses_to_support_async_functions_2521", "Expression resolves to variable declaration '{0}' that compiler uses to support async functions."),
The_arguments_object_cannot_be_referenced_in_an_async_function_or_method_in_ES3_and_ES5_Consider_using_a_standard_function_or_method: diag(2522, ts.DiagnosticCategory.Error, "The_arguments_object_cannot_be_referenced_in_an_async_function_or_method_in_ES3_and_ES5_Consider_usi_2522", "The 'arguments' object cannot be referenced in an async function or method in ES3 and ES5. Consider using a standard function or method."),
yield_expressions_cannot_be_used_in_a_parameter_initializer: diag(2523, ts.DiagnosticCategory.Error, "yield_expressions_cannot_be_used_in_a_parameter_initializer_2523", "'yield' expressions cannot be used in a parameter initializer."),
await_expressions_cannot_be_used_in_a_parameter_initializer: diag(2524, ts.DiagnosticCategory.Error, "await_expressions_cannot_be_used_in_a_parameter_initializer_2524", "'await' expressions cannot be used in a parameter initializer."),
Initializer_provides_no_value_for_this_binding_element_and_the_binding_element_has_no_default_value: diag(2525, ts.DiagnosticCategory.Error, "Initializer_provides_no_value_for_this_binding_element_and_the_binding_element_has_no_default_value_2525", "Initializer provides no value for this binding element and the binding element has no default value."),
A_this_type_is_available_only_in_a_non_static_member_of_a_class_or_interface: diag(2526, ts.DiagnosticCategory.Error, "A_this_type_is_available_only_in_a_non_static_member_of_a_class_or_interface_2526", "A 'this' type is available only in a non-static member of a class or interface."),
The_inferred_type_of_0_references_an_inaccessible_1_type_A_type_annotation_is_necessary: diag(2527, ts.DiagnosticCategory.Error, "The_inferred_type_of_0_references_an_inaccessible_1_type_A_type_annotation_is_necessary_2527", "The inferred type of '{0}' references an inaccessible '{1}' type. A type annotation is necessary."),
A_module_cannot_have_multiple_default_exports: diag(2528, ts.DiagnosticCategory.Error, "A_module_cannot_have_multiple_default_exports_2528", "A module cannot have multiple default exports."),
Duplicate_identifier_0_Compiler_reserves_name_1_in_top_level_scope_of_a_module_containing_async_functions: diag(2529, ts.DiagnosticCategory.Error, "Duplicate_identifier_0_Compiler_reserves_name_1_in_top_level_scope_of_a_module_containing_async_func_2529", "Duplicate identifier '{0}'. Compiler reserves name '{1}' in top level scope of a module containing async functions."),
Property_0_is_incompatible_with_index_signature: diag(2530, ts.DiagnosticCategory.Error, "Property_0_is_incompatible_with_index_signature_2530", "Property '{0}' is incompatible with index signature."),
Object_is_possibly_null: diag(2531, ts.DiagnosticCategory.Error, "Object_is_possibly_null_2531", "Object is possibly 'null'."),
Object_is_possibly_undefined: diag(2532, ts.DiagnosticCategory.Error, "Object_is_possibly_undefined_2532", "Object is possibly 'undefined'."),
Object_is_possibly_null_or_undefined: diag(2533, ts.DiagnosticCategory.Error, "Object_is_possibly_null_or_undefined_2533", "Object is possibly 'null' or 'undefined'."),
A_function_returning_never_cannot_have_a_reachable_end_point: diag(2534, ts.DiagnosticCategory.Error, "A_function_returning_never_cannot_have_a_reachable_end_point_2534", "A function returning 'never' cannot have a reachable end point."),
Enum_type_0_has_members_with_initializers_that_are_not_literals: diag(2535, ts.DiagnosticCategory.Error, "Enum_type_0_has_members_with_initializers_that_are_not_literals_2535", "Enum type '{0}' has members with initializers that are not literals."),
Type_0_cannot_be_used_to_index_type_1: diag(2536, ts.DiagnosticCategory.Error, "Type_0_cannot_be_used_to_index_type_1_2536", "Type '{0}' cannot be used to index type '{1}'."),
Type_0_has_no_matching_index_signature_for_type_1: diag(2537, ts.DiagnosticCategory.Error, "Type_0_has_no_matching_index_signature_for_type_1_2537", "Type '{0}' has no matching index signature for type '{1}'."),
Type_0_cannot_be_used_as_an_index_type: diag(2538, ts.DiagnosticCategory.Error, "Type_0_cannot_be_used_as_an_index_type_2538", "Type '{0}' cannot be used as an index type."),
Cannot_assign_to_0_because_it_is_not_a_variable: diag(2539, ts.DiagnosticCategory.Error, "Cannot_assign_to_0_because_it_is_not_a_variable_2539", "Cannot assign to '{0}' because it is not a variable."),
Cannot_assign_to_0_because_it_is_a_read_only_property: diag(2540, ts.DiagnosticCategory.Error, "Cannot_assign_to_0_because_it_is_a_read_only_property_2540", "Cannot assign to '{0}' because it is a read-only property."),
The_target_of_an_assignment_must_be_a_variable_or_a_property_access: diag(2541, ts.DiagnosticCategory.Error, "The_target_of_an_assignment_must_be_a_variable_or_a_property_access_2541", "The target of an assignment must be a variable or a property access."),
Index_signature_in_type_0_only_permits_reading: diag(2542, ts.DiagnosticCategory.Error, "Index_signature_in_type_0_only_permits_reading_2542", "Index signature in type '{0}' only permits reading."),
Duplicate_identifier_newTarget_Compiler_uses_variable_declaration_newTarget_to_capture_new_target_meta_property_reference: diag(2543, ts.DiagnosticCategory.Error, "Duplicate_identifier_newTarget_Compiler_uses_variable_declaration_newTarget_to_capture_new_target_me_2543", "Duplicate identifier '_newTarget'. Compiler uses variable declaration '_newTarget' to capture 'new.target' meta-property reference."),
Expression_resolves_to_variable_declaration_newTarget_that_compiler_uses_to_capture_new_target_meta_property_reference: diag(2544, ts.DiagnosticCategory.Error, "Expression_resolves_to_variable_declaration_newTarget_that_compiler_uses_to_capture_new_target_meta__2544", "Expression resolves to variable declaration '_newTarget' that compiler uses to capture 'new.target' meta-property reference."),
A_mixin_class_must_have_a_constructor_with_a_single_rest_parameter_of_type_any: diag(2545, ts.DiagnosticCategory.Error, "A_mixin_class_must_have_a_constructor_with_a_single_rest_parameter_of_type_any_2545", "A mixin class must have a constructor with a single rest parameter of type 'any[]'."),
The_type_returned_by_the_0_method_of_an_async_iterator_must_be_a_promise_for_a_type_with_a_value_property: diag(2547, ts.DiagnosticCategory.Error, "The_type_returned_by_the_0_method_of_an_async_iterator_must_be_a_promise_for_a_type_with_a_value_pro_2547", "The type returned by the '{0}()' method of an async iterator must be a promise for a type with a 'value' property."),
Type_0_is_not_an_array_type_or_does_not_have_a_Symbol_iterator_method_that_returns_an_iterator: diag(2548, ts.DiagnosticCategory.Error, "Type_0_is_not_an_array_type_or_does_not_have_a_Symbol_iterator_method_that_returns_an_iterator_2548", "Type '{0}' is not an array type or does not have a '[Symbol.iterator]()' method that returns an iterator."),
Type_0_is_not_an_array_type_or_a_string_type_or_does_not_have_a_Symbol_iterator_method_that_returns_an_iterator: diag(2549, ts.DiagnosticCategory.Error, "Type_0_is_not_an_array_type_or_a_string_type_or_does_not_have_a_Symbol_iterator_method_that_returns__2549", "Type '{0}' is not an array type or a string type or does not have a '[Symbol.iterator]()' method that returns an iterator."),
Property_0_does_not_exist_on_type_1_Do_you_need_to_change_your_target_library_Try_changing_the_lib_compiler_option_to_2_or_later: diag(2550, ts.DiagnosticCategory.Error, "Property_0_does_not_exist_on_type_1_Do_you_need_to_change_your_target_library_Try_changing_the_lib_c_2550", "Property '{0}' does not exist on type '{1}'. Do you need to change your target library? Try changing the 'lib' compiler option to '{2}' or later."),
Property_0_does_not_exist_on_type_1_Did_you_mean_2: diag(2551, ts.DiagnosticCategory.Error, "Property_0_does_not_exist_on_type_1_Did_you_mean_2_2551", "Property '{0}' does not exist on type '{1}'. Did you mean '{2}'?"),
Cannot_find_name_0_Did_you_mean_1: diag(2552, ts.DiagnosticCategory.Error, "Cannot_find_name_0_Did_you_mean_1_2552", "Cannot find name '{0}'. Did you mean '{1}'?"),
Computed_values_are_not_permitted_in_an_enum_with_string_valued_members: diag(2553, ts.DiagnosticCategory.Error, "Computed_values_are_not_permitted_in_an_enum_with_string_valued_members_2553", "Computed values are not permitted in an enum with string valued members."),
Expected_0_arguments_but_got_1: diag(2554, ts.DiagnosticCategory.Error, "Expected_0_arguments_but_got_1_2554", "Expected {0} arguments, but got {1}."),
Expected_at_least_0_arguments_but_got_1: diag(2555, ts.DiagnosticCategory.Error, "Expected_at_least_0_arguments_but_got_1_2555", "Expected at least {0} arguments, but got {1}."),
A_spread_argument_must_either_have_a_tuple_type_or_be_passed_to_a_rest_parameter: diag(2556, ts.DiagnosticCategory.Error, "A_spread_argument_must_either_have_a_tuple_type_or_be_passed_to_a_rest_parameter_2556", "A spread argument must either have a tuple type or be passed to a rest parameter."),
Expected_0_type_arguments_but_got_1: diag(2558, ts.DiagnosticCategory.Error, "Expected_0_type_arguments_but_got_1_2558", "Expected {0} type arguments, but got {1}."),
Type_0_has_no_properties_in_common_with_type_1: diag(2559, ts.DiagnosticCategory.Error, "Type_0_has_no_properties_in_common_with_type_1_2559", "Type '{0}' has no properties in common with type '{1}'."),
Value_of_type_0_has_no_properties_in_common_with_type_1_Did_you_mean_to_call_it: diag(2560, ts.DiagnosticCategory.Error, "Value_of_type_0_has_no_properties_in_common_with_type_1_Did_you_mean_to_call_it_2560", "Value of type '{0}' has no properties in common with type '{1}'. Did you mean to call it?"),
Object_literal_may_only_specify_known_properties_but_0_does_not_exist_in_type_1_Did_you_mean_to_write_2: diag(2561, ts.DiagnosticCategory.Error, "Object_literal_may_only_specify_known_properties_but_0_does_not_exist_in_type_1_Did_you_mean_to_writ_2561", "Object literal may only specify known properties, but '{0}' does not exist in type '{1}'. Did you mean to write '{2}'?"),
Base_class_expressions_cannot_reference_class_type_parameters: diag(2562, ts.DiagnosticCategory.Error, "Base_class_expressions_cannot_reference_class_type_parameters_2562", "Base class expressions cannot reference class type parameters."),
The_containing_function_or_module_body_is_too_large_for_control_flow_analysis: diag(2563, ts.DiagnosticCategory.Error, "The_containing_function_or_module_body_is_too_large_for_control_flow_analysis_2563", "The containing function or module body is too large for control flow analysis."),
Property_0_has_no_initializer_and_is_not_definitely_assigned_in_the_constructor: diag(2564, ts.DiagnosticCategory.Error, "Property_0_has_no_initializer_and_is_not_definitely_assigned_in_the_constructor_2564", "Property '{0}' has no initializer and is not definitely assigned in the constructor."),
Property_0_is_used_before_being_assigned: diag(2565, ts.DiagnosticCategory.Error, "Property_0_is_used_before_being_assigned_2565", "Property '{0}' is used before being assigned."),
A_rest_element_cannot_have_a_property_name: diag(2566, ts.DiagnosticCategory.Error, "A_rest_element_cannot_have_a_property_name_2566", "A rest element cannot have a property name."),
Enum_declarations_can_only_merge_with_namespace_or_other_enum_declarations: diag(2567, ts.DiagnosticCategory.Error, "Enum_declarations_can_only_merge_with_namespace_or_other_enum_declarations_2567", "Enum declarations can only merge with namespace or other enum declarations."),
Property_0_may_not_exist_on_type_1_Did_you_mean_2: diag(2568, ts.DiagnosticCategory.Error, "Property_0_may_not_exist_on_type_1_Did_you_mean_2_2568", "Property '{0}' may not exist on type '{1}'. Did you mean '{2}'?"),
Type_0_is_not_an_array_type_or_a_string_type_Use_compiler_option_downlevelIteration_to_allow_iterating_of_iterators: diag(2569, ts.DiagnosticCategory.Error, "Type_0_is_not_an_array_type_or_a_string_type_Use_compiler_option_downlevelIteration_to_allow_iterati_2569", "Type '{0}' is not an array type or a string type. Use compiler option '--downlevelIteration' to allow iterating of iterators."),
Could_not_find_name_0_Did_you_mean_1: diag(2570, ts.DiagnosticCategory.Error, "Could_not_find_name_0_Did_you_mean_1_2570", "Could not find name '{0}'. Did you mean '{1}'?"),
Object_is_of_type_unknown: diag(2571, ts.DiagnosticCategory.Error, "Object_is_of_type_unknown_2571", "Object is of type 'unknown'."),
Rest_signatures_are_incompatible: diag(2572, ts.DiagnosticCategory.Error, "Rest_signatures_are_incompatible_2572", "Rest signatures are incompatible."),
Property_0_is_incompatible_with_rest_element_type: diag(2573, ts.DiagnosticCategory.Error, "Property_0_is_incompatible_with_rest_element_type_2573", "Property '{0}' is incompatible with rest element type."),
A_rest_element_type_must_be_an_array_type: diag(2574, ts.DiagnosticCategory.Error, "A_rest_element_type_must_be_an_array_type_2574", "A rest element type must be an array type."),
No_overload_expects_0_arguments_but_overloads_do_exist_that_expect_either_1_or_2_arguments: diag(2575, ts.DiagnosticCategory.Error, "No_overload_expects_0_arguments_but_overloads_do_exist_that_expect_either_1_or_2_arguments_2575", "No overload expects {0} arguments, but overloads do exist that expect either {1} or {2} arguments."),
Property_0_does_not_exist_on_type_1_Did_you_mean_to_access_the_static_member_2_instead: diag(2576, ts.DiagnosticCategory.Error, "Property_0_does_not_exist_on_type_1_Did_you_mean_to_access_the_static_member_2_instead_2576", "Property '{0}' does not exist on type '{1}'. Did you mean to access the static member '{2}' instead?"),
Return_type_annotation_circularly_references_itself: diag(2577, ts.DiagnosticCategory.Error, "Return_type_annotation_circularly_references_itself_2577", "Return type annotation circularly references itself."),
Unused_ts_expect_error_directive: diag(2578, ts.DiagnosticCategory.Error, "Unused_ts_expect_error_directive_2578", "Unused '@ts-expect-error' directive."),
Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_node_Try_npm_i_save_dev_types_Slashnode: diag(2580, ts.DiagnosticCategory.Error, "Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_node_Try_npm_i_save_dev_types_Slashno_2580", "Cannot find name '{0}'. Do you need to install type definitions for node? Try `npm i --save-dev @types/node`."),
Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_jQuery_Try_npm_i_save_dev_types_Slashjquery: diag(2581, ts.DiagnosticCategory.Error, "Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_jQuery_Try_npm_i_save_dev_types_Slash_2581", "Cannot find name '{0}'. Do you need to install type definitions for jQuery? Try `npm i --save-dev @types/jquery`."),
Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_a_test_runner_Try_npm_i_save_dev_types_Slashjest_or_npm_i_save_dev_types_Slashmocha: diag(2582, ts.DiagnosticCategory.Error, "Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_a_test_runner_Try_npm_i_save_dev_type_2582", "Cannot find name '{0}'. Do you need to install type definitions for a test runner? Try `npm i --save-dev @types/jest` or `npm i --save-dev @types/mocha`."),
Cannot_find_name_0_Do_you_need_to_change_your_target_library_Try_changing_the_lib_compiler_option_to_1_or_later: diag(2583, ts.DiagnosticCategory.Error, "Cannot_find_name_0_Do_you_need_to_change_your_target_library_Try_changing_the_lib_compiler_option_to_2583", "Cannot find name '{0}'. Do you need to change your target library? Try changing the 'lib' compiler option to '{1}' or later."),
Cannot_find_name_0_Do_you_need_to_change_your_target_library_Try_changing_the_lib_compiler_option_to_include_dom: diag(2584, ts.DiagnosticCategory.Error, "Cannot_find_name_0_Do_you_need_to_change_your_target_library_Try_changing_the_lib_compiler_option_to_2584", "Cannot find name '{0}'. Do you need to change your target library? Try changing the 'lib' compiler option to include 'dom'."),
_0_only_refers_to_a_type_but_is_being_used_as_a_value_here_Do_you_need_to_change_your_target_library_Try_changing_the_lib_compiler_option_to_es2015_or_later: diag(2585, ts.DiagnosticCategory.Error, "_0_only_refers_to_a_type_but_is_being_used_as_a_value_here_Do_you_need_to_change_your_target_library_2585", "'{0}' only refers to a type, but is being used as a value here. Do you need to change your target library? Try changing the 'lib' compiler option to es2015 or later."),
Enum_type_0_circularly_references_itself: diag(2586, ts.DiagnosticCategory.Error, "Enum_type_0_circularly_references_itself_2586", "Enum type '{0}' circularly references itself."),
JSDoc_type_0_circularly_references_itself: diag(2587, ts.DiagnosticCategory.Error, "JSDoc_type_0_circularly_references_itself_2587", "JSDoc type '{0}' circularly references itself."),
Cannot_assign_to_0_because_it_is_a_constant: diag(2588, ts.DiagnosticCategory.Error, "Cannot_assign_to_0_because_it_is_a_constant_2588", "Cannot assign to '{0}' because it is a constant."),
Type_instantiation_is_excessively_deep_and_possibly_infinite: diag(2589, ts.DiagnosticCategory.Error, "Type_instantiation_is_excessively_deep_and_possibly_infinite_2589", "Type instantiation is excessively deep and possibly infinite."),
Expression_produces_a_union_type_that_is_too_complex_to_represent: diag(2590, ts.DiagnosticCategory.Error, "Expression_produces_a_union_type_that_is_too_complex_to_represent_2590", "Expression produces a union type that is too complex to represent."),
Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_node_Try_npm_i_save_dev_types_Slashnode_and_then_add_node_to_the_types_field_in_your_tsconfig: diag(2591, ts.DiagnosticCategory.Error, "Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_node_Try_npm_i_save_dev_types_Slashno_2591", "Cannot find name '{0}'. Do you need to install type definitions for node? Try `npm i --save-dev @types/node` and then add 'node' to the types field in your tsconfig."),
Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_jQuery_Try_npm_i_save_dev_types_Slashjquery_and_then_add_jquery_to_the_types_field_in_your_tsconfig: diag(2592, ts.DiagnosticCategory.Error, "Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_jQuery_Try_npm_i_save_dev_types_Slash_2592", "Cannot find name '{0}'. Do you need to install type definitions for jQuery? Try `npm i --save-dev @types/jquery` and then add 'jquery' to the types field in your tsconfig."),
Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_a_test_runner_Try_npm_i_save_dev_types_Slashjest_or_npm_i_save_dev_types_Slashmocha_and_then_add_jest_or_mocha_to_the_types_field_in_your_tsconfig: diag(2593, ts.DiagnosticCategory.Error, "Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_a_test_runner_Try_npm_i_save_dev_type_2593", "Cannot find name '{0}'. Do you need to install type definitions for a test runner? Try `npm i --save-dev @types/jest` or `npm i --save-dev @types/mocha` and then add 'jest' or 'mocha' to the types field in your tsconfig."),
This_module_is_declared_with_using_export_and_can_only_be_used_with_a_default_import_when_using_the_0_flag: diag(2594, ts.DiagnosticCategory.Error, "This_module_is_declared_with_using_export_and_can_only_be_used_with_a_default_import_when_using_the__2594", "This module is declared with using 'export =', and can only be used with a default import when using the '{0}' flag."),
_0_can_only_be_imported_by_using_a_default_import: diag(2595, ts.DiagnosticCategory.Error, "_0_can_only_be_imported_by_using_a_default_import_2595", "'{0}' can only be imported by using a default import."),
_0_can_only_be_imported_by_turning_on_the_esModuleInterop_flag_and_using_a_default_import: diag(2596, ts.DiagnosticCategory.Error, "_0_can_only_be_imported_by_turning_on_the_esModuleInterop_flag_and_using_a_default_import_2596", "'{0}' can only be imported by turning on the 'esModuleInterop' flag and using a default import."),
_0_can_only_be_imported_by_using_a_require_call_or_by_using_a_default_import: diag(2597, ts.DiagnosticCategory.Error, "_0_can_only_be_imported_by_using_a_require_call_or_by_using_a_default_import_2597", "'{0}' can only be imported by using a 'require' call or by using a default import."),
_0_can_only_be_imported_by_using_a_require_call_or_by_turning_on_the_esModuleInterop_flag_and_using_a_default_import: diag(2598, ts.DiagnosticCategory.Error, "_0_can_only_be_imported_by_using_a_require_call_or_by_turning_on_the_esModuleInterop_flag_and_using__2598", "'{0}' can only be imported by using a 'require' call or by turning on the 'esModuleInterop' flag and using a default import."),
JSX_element_attributes_type_0_may_not_be_a_union_type: diag(2600, ts.DiagnosticCategory.Error, "JSX_element_attributes_type_0_may_not_be_a_union_type_2600", "JSX element attributes type '{0}' may not be a union type."),
The_return_type_of_a_JSX_element_constructor_must_return_an_object_type: diag(2601, ts.DiagnosticCategory.Error, "The_return_type_of_a_JSX_element_constructor_must_return_an_object_type_2601", "The return type of a JSX element constructor must return an object type."),
JSX_element_implicitly_has_type_any_because_the_global_type_JSX_Element_does_not_exist: diag(2602, ts.DiagnosticCategory.Error, "JSX_element_implicitly_has_type_any_because_the_global_type_JSX_Element_does_not_exist_2602", "JSX element implicitly has type 'any' because the global type 'JSX.Element' does not exist."),
Property_0_in_type_1_is_not_assignable_to_type_2: diag(2603, ts.DiagnosticCategory.Error, "Property_0_in_type_1_is_not_assignable_to_type_2_2603", "Property '{0}' in type '{1}' is not assignable to type '{2}'."),
JSX_element_type_0_does_not_have_any_construct_or_call_signatures: diag(2604, ts.DiagnosticCategory.Error, "JSX_element_type_0_does_not_have_any_construct_or_call_signatures_2604", "JSX element type '{0}' does not have any construct or call signatures."),
JSX_element_type_0_is_not_a_constructor_function_for_JSX_elements: diag(2605, ts.DiagnosticCategory.Error, "JSX_element_type_0_is_not_a_constructor_function_for_JSX_elements_2605", "JSX element type '{0}' is not a constructor function for JSX elements."),
Property_0_of_JSX_spread_attribute_is_not_assignable_to_target_property: diag(2606, ts.DiagnosticCategory.Error, "Property_0_of_JSX_spread_attribute_is_not_assignable_to_target_property_2606", "Property '{0}' of JSX spread attribute is not assignable to target property."),
JSX_element_class_does_not_support_attributes_because_it_does_not_have_a_0_property: diag(2607, ts.DiagnosticCategory.Error, "JSX_element_class_does_not_support_attributes_because_it_does_not_have_a_0_property_2607", "JSX element class does not support attributes because it does not have a '{0}' property."),
The_global_type_JSX_0_may_not_have_more_than_one_property: diag(2608, ts.DiagnosticCategory.Error, "The_global_type_JSX_0_may_not_have_more_than_one_property_2608", "The global type 'JSX.{0}' may not have more than one property."),
JSX_spread_child_must_be_an_array_type: diag(2609, ts.DiagnosticCategory.Error, "JSX_spread_child_must_be_an_array_type_2609", "JSX spread child must be an array type."),
_0_is_defined_as_an_accessor_in_class_1_but_is_overridden_here_in_2_as_an_instance_property: diag(2610, ts.DiagnosticCategory.Error, "_0_is_defined_as_an_accessor_in_class_1_but_is_overridden_here_in_2_as_an_instance_property_2610", "'{0}' is defined as an accessor in class '{1}', but is overridden here in '{2}' as an instance property."),
_0_is_defined_as_a_property_in_class_1_but_is_overridden_here_in_2_as_an_accessor: diag(2611, ts.DiagnosticCategory.Error, "_0_is_defined_as_a_property_in_class_1_but_is_overridden_here_in_2_as_an_accessor_2611", "'{0}' is defined as a property in class '{1}', but is overridden here in '{2}' as an accessor."),
Property_0_will_overwrite_the_base_property_in_1_If_this_is_intentional_add_an_initializer_Otherwise_add_a_declare_modifier_or_remove_the_redundant_declaration: diag(2612, ts.DiagnosticCategory.Error, "Property_0_will_overwrite_the_base_property_in_1_If_this_is_intentional_add_an_initializer_Otherwise_2612", "Property '{0}' will overwrite the base property in '{1}'. If this is intentional, add an initializer. Otherwise, add a 'declare' modifier or remove the redundant declaration."),
Module_0_has_no_default_export_Did_you_mean_to_use_import_1_from_0_instead: diag(2613, ts.DiagnosticCategory.Error, "Module_0_has_no_default_export_Did_you_mean_to_use_import_1_from_0_instead_2613", "Module '{0}' has no default export. Did you mean to use 'import { {1} } from {0}' instead?"),
Module_0_has_no_exported_member_1_Did_you_mean_to_use_import_1_from_0_instead: diag(2614, ts.DiagnosticCategory.Error, "Module_0_has_no_exported_member_1_Did_you_mean_to_use_import_1_from_0_instead_2614", "Module '{0}' has no exported member '{1}'. Did you mean to use 'import {1} from {0}' instead?"),
Type_of_property_0_circularly_references_itself_in_mapped_type_1: diag(2615, ts.DiagnosticCategory.Error, "Type_of_property_0_circularly_references_itself_in_mapped_type_1_2615", "Type of property '{0}' circularly references itself in mapped type '{1}'."),
_0_can_only_be_imported_by_using_import_1_require_2_or_a_default_import: diag(2616, ts.DiagnosticCategory.Error, "_0_can_only_be_imported_by_using_import_1_require_2_or_a_default_import_2616", "'{0}' can only be imported by using 'import {1} = require({2})' or a default import."),
_0_can_only_be_imported_by_using_import_1_require_2_or_by_turning_on_the_esModuleInterop_flag_and_using_a_default_import: diag(2617, ts.DiagnosticCategory.Error, "_0_can_only_be_imported_by_using_import_1_require_2_or_by_turning_on_the_esModuleInterop_flag_and_us_2617", "'{0}' can only be imported by using 'import {1} = require({2})' or by turning on the 'esModuleInterop' flag and using a default import."),
Source_has_0_element_s_but_target_requires_1: diag(2618, ts.DiagnosticCategory.Error, "Source_has_0_element_s_but_target_requires_1_2618", "Source has {0} element(s) but target requires {1}."),
Source_has_0_element_s_but_target_allows_only_1: diag(2619, ts.DiagnosticCategory.Error, "Source_has_0_element_s_but_target_allows_only_1_2619", "Source has {0} element(s) but target allows only {1}."),
Target_requires_0_element_s_but_source_may_have_fewer: diag(2620, ts.DiagnosticCategory.Error, "Target_requires_0_element_s_but_source_may_have_fewer_2620", "Target requires {0} element(s) but source may have fewer."),
Target_allows_only_0_element_s_but_source_may_have_more: diag(2621, ts.DiagnosticCategory.Error, "Target_allows_only_0_element_s_but_source_may_have_more_2621", "Target allows only {0} element(s) but source may have more."),
Source_provides_no_match_for_required_element_at_position_0_in_target: diag(2623, ts.DiagnosticCategory.Error, "Source_provides_no_match_for_required_element_at_position_0_in_target_2623", "Source provides no match for required element at position {0} in target."),
Source_provides_no_match_for_variadic_element_at_position_0_in_target: diag(2624, ts.DiagnosticCategory.Error, "Source_provides_no_match_for_variadic_element_at_position_0_in_target_2624", "Source provides no match for variadic element at position {0} in target."),
Variadic_element_at_position_0_in_source_does_not_match_element_at_position_1_in_target: diag(2625, ts.DiagnosticCategory.Error, "Variadic_element_at_position_0_in_source_does_not_match_element_at_position_1_in_target_2625", "Variadic element at position {0} in source does not match element at position {1} in target."),
Type_at_position_0_in_source_is_not_compatible_with_type_at_position_1_in_target: diag(2626, ts.DiagnosticCategory.Error, "Type_at_position_0_in_source_is_not_compatible_with_type_at_position_1_in_target_2626", "Type at position {0} in source is not compatible with type at position {1} in target."),
Type_at_positions_0_through_1_in_source_is_not_compatible_with_type_at_position_2_in_target: diag(2627, ts.DiagnosticCategory.Error, "Type_at_positions_0_through_1_in_source_is_not_compatible_with_type_at_position_2_in_target_2627", "Type at positions {0} through {1} in source is not compatible with type at position {2} in target."),
Cannot_assign_to_0_because_it_is_an_enum: diag(2628, ts.DiagnosticCategory.Error, "Cannot_assign_to_0_because_it_is_an_enum_2628", "Cannot assign to '{0}' because it is an enum."),
Cannot_assign_to_0_because_it_is_a_class: diag(2629, ts.DiagnosticCategory.Error, "Cannot_assign_to_0_because_it_is_a_class_2629", "Cannot assign to '{0}' because it is a class."),
Cannot_assign_to_0_because_it_is_a_function: diag(2630, ts.DiagnosticCategory.Error, "Cannot_assign_to_0_because_it_is_a_function_2630", "Cannot assign to '{0}' because it is a function."),
Cannot_assign_to_0_because_it_is_a_namespace: diag(2631, ts.DiagnosticCategory.Error, "Cannot_assign_to_0_because_it_is_a_namespace_2631", "Cannot assign to '{0}' because it is a namespace."),
Cannot_assign_to_0_because_it_is_an_import: diag(2632, ts.DiagnosticCategory.Error, "Cannot_assign_to_0_because_it_is_an_import_2632", "Cannot assign to '{0}' because it is an import."),
JSX_property_access_expressions_cannot_include_JSX_namespace_names: diag(2633, ts.DiagnosticCategory.Error, "JSX_property_access_expressions_cannot_include_JSX_namespace_names_2633", "JSX property access expressions cannot include JSX namespace names"),
_0_index_signatures_are_incompatible: diag(2634, ts.DiagnosticCategory.Error, "_0_index_signatures_are_incompatible_2634", "'{0}' index signatures are incompatible."),
Cannot_augment_module_0_with_value_exports_because_it_resolves_to_a_non_module_entity: diag(2649, ts.DiagnosticCategory.Error, "Cannot_augment_module_0_with_value_exports_because_it_resolves_to_a_non_module_entity_2649", "Cannot augment module '{0}' with value exports because it resolves to a non-module entity."),
A_member_initializer_in_a_enum_declaration_cannot_reference_members_declared_after_it_including_members_defined_in_other_enums: diag(2651, ts.DiagnosticCategory.Error, "A_member_initializer_in_a_enum_declaration_cannot_reference_members_declared_after_it_including_memb_2651", "A member initializer in a enum declaration cannot reference members declared after it, including members defined in other enums."),
Merged_declaration_0_cannot_include_a_default_export_declaration_Consider_adding_a_separate_export_default_0_declaration_instead: diag(2652, ts.DiagnosticCategory.Error, "Merged_declaration_0_cannot_include_a_default_export_declaration_Consider_adding_a_separate_export_d_2652", "Merged declaration '{0}' cannot include a default export declaration. Consider adding a separate 'export default {0}' declaration instead."),
Non_abstract_class_expression_does_not_implement_inherited_abstract_member_0_from_class_1: diag(2653, ts.DiagnosticCategory.Error, "Non_abstract_class_expression_does_not_implement_inherited_abstract_member_0_from_class_1_2653", "Non-abstract class expression does not implement inherited abstract member '{0}' from class '{1}'."),
Exported_external_package_typings_file_cannot_contain_tripleslash_references_Please_contact_the_package_author_to_update_the_package_definition: diag(2654, ts.DiagnosticCategory.Error, "Exported_external_package_typings_file_cannot_contain_tripleslash_references_Please_contact_the_pack_2654", "Exported external package typings file cannot contain tripleslash references. Please contact the package author to update the package definition."),
Exported_external_package_typings_file_0_is_not_a_module_Please_contact_the_package_author_to_update_the_package_definition: diag(2656, ts.DiagnosticCategory.Error, "Exported_external_package_typings_file_0_is_not_a_module_Please_contact_the_package_author_to_update_2656", "Exported external package typings file '{0}' is not a module. Please contact the package author to update the package definition."),
JSX_expressions_must_have_one_parent_element: diag(2657, ts.DiagnosticCategory.Error, "JSX_expressions_must_have_one_parent_element_2657", "JSX expressions must have one parent element."),
Type_0_provides_no_match_for_the_signature_1: diag(2658, ts.DiagnosticCategory.Error, "Type_0_provides_no_match_for_the_signature_1_2658", "Type '{0}' provides no match for the signature '{1}'."),
super_is_only_allowed_in_members_of_object_literal_expressions_when_option_target_is_ES2015_or_higher: diag(2659, ts.DiagnosticCategory.Error, "super_is_only_allowed_in_members_of_object_literal_expressions_when_option_target_is_ES2015_or_highe_2659", "'super' is only allowed in members of object literal expressions when option 'target' is 'ES2015' or higher."),
super_can_only_be_referenced_in_members_of_derived_classes_or_object_literal_expressions: diag(2660, ts.DiagnosticCategory.Error, "super_can_only_be_referenced_in_members_of_derived_classes_or_object_literal_expressions_2660", "'super' can only be referenced in members of derived classes or object literal expressions."),
Cannot_export_0_Only_local_declarations_can_be_exported_from_a_module: diag(2661, ts.DiagnosticCategory.Error, "Cannot_export_0_Only_local_declarations_can_be_exported_from_a_module_2661", "Cannot export '{0}'. Only local declarations can be exported from a module."),
Cannot_find_name_0_Did_you_mean_the_static_member_1_0: diag(2662, ts.DiagnosticCategory.Error, "Cannot_find_name_0_Did_you_mean_the_static_member_1_0_2662", "Cannot find name '{0}'. Did you mean the static member '{1}.{0}'?"),
Cannot_find_name_0_Did_you_mean_the_instance_member_this_0: diag(2663, ts.DiagnosticCategory.Error, "Cannot_find_name_0_Did_you_mean_the_instance_member_this_0_2663", "Cannot find name '{0}'. Did you mean the instance member 'this.{0}'?"),
Invalid_module_name_in_augmentation_module_0_cannot_be_found: diag(2664, ts.DiagnosticCategory.Error, "Invalid_module_name_in_augmentation_module_0_cannot_be_found_2664", "Invalid module name in augmentation, module '{0}' cannot be found."),
Invalid_module_name_in_augmentation_Module_0_resolves_to_an_untyped_module_at_1_which_cannot_be_augmented: diag(2665, ts.DiagnosticCategory.Error, "Invalid_module_name_in_augmentation_Module_0_resolves_to_an_untyped_module_at_1_which_cannot_be_augm_2665", "Invalid module name in augmentation. Module '{0}' resolves to an untyped module at '{1}', which cannot be augmented."),
Exports_and_export_assignments_are_not_permitted_in_module_augmentations: diag(2666, ts.DiagnosticCategory.Error, "Exports_and_export_assignments_are_not_permitted_in_module_augmentations_2666", "Exports and export assignments are not permitted in module augmentations."),
Imports_are_not_permitted_in_module_augmentations_Consider_moving_them_to_the_enclosing_external_module: diag(2667, ts.DiagnosticCategory.Error, "Imports_are_not_permitted_in_module_augmentations_Consider_moving_them_to_the_enclosing_external_mod_2667", "Imports are not permitted in module augmentations. Consider moving them to the enclosing external module."),
export_modifier_cannot_be_applied_to_ambient_modules_and_module_augmentations_since_they_are_always_visible: diag(2668, ts.DiagnosticCategory.Error, "export_modifier_cannot_be_applied_to_ambient_modules_and_module_augmentations_since_they_are_always__2668", "'export' modifier cannot be applied to ambient modules and module augmentations since they are always visible."),
Augmentations_for_the_global_scope_can_only_be_directly_nested_in_external_modules_or_ambient_module_declarations: diag(2669, ts.DiagnosticCategory.Error, "Augmentations_for_the_global_scope_can_only_be_directly_nested_in_external_modules_or_ambient_module_2669", "Augmentations for the global scope can only be directly nested in external modules or ambient module declarations."),
Augmentations_for_the_global_scope_should_have_declare_modifier_unless_they_appear_in_already_ambient_context: diag(2670, ts.DiagnosticCategory.Error, "Augmentations_for_the_global_scope_should_have_declare_modifier_unless_they_appear_in_already_ambien_2670", "Augmentations for the global scope should have 'declare' modifier unless they appear in already ambient context."),
Cannot_augment_module_0_because_it_resolves_to_a_non_module_entity: diag(2671, ts.DiagnosticCategory.Error, "Cannot_augment_module_0_because_it_resolves_to_a_non_module_entity_2671", "Cannot augment module '{0}' because it resolves to a non-module entity."),
Cannot_assign_a_0_constructor_type_to_a_1_constructor_type: diag(2672, ts.DiagnosticCategory.Error, "Cannot_assign_a_0_constructor_type_to_a_1_constructor_type_2672", "Cannot assign a '{0}' constructor type to a '{1}' constructor type."),
Constructor_of_class_0_is_private_and_only_accessible_within_the_class_declaration: diag(2673, ts.DiagnosticCategory.Error, "Constructor_of_class_0_is_private_and_only_accessible_within_the_class_declaration_2673", "Constructor of class '{0}' is private and only accessible within the class declaration."),
Constructor_of_class_0_is_protected_and_only_accessible_within_the_class_declaration: diag(2674, ts.DiagnosticCategory.Error, "Constructor_of_class_0_is_protected_and_only_accessible_within_the_class_declaration_2674", "Constructor of class '{0}' is protected and only accessible within the class declaration."),
Cannot_extend_a_class_0_Class_constructor_is_marked_as_private: diag(2675, ts.DiagnosticCategory.Error, "Cannot_extend_a_class_0_Class_constructor_is_marked_as_private_2675", "Cannot extend a class '{0}'. Class constructor is marked as private."),
Accessors_must_both_be_abstract_or_non_abstract: diag(2676, ts.DiagnosticCategory.Error, "Accessors_must_both_be_abstract_or_non_abstract_2676", "Accessors must both be abstract or non-abstract."),
A_type_predicate_s_type_must_be_assignable_to_its_parameter_s_type: diag(2677, ts.DiagnosticCategory.Error, "A_type_predicate_s_type_must_be_assignable_to_its_parameter_s_type_2677", "A type predicate's type must be assignable to its parameter's type."),
Type_0_is_not_comparable_to_type_1: diag(2678, ts.DiagnosticCategory.Error, "Type_0_is_not_comparable_to_type_1_2678", "Type '{0}' is not comparable to type '{1}'."),
A_function_that_is_called_with_the_new_keyword_cannot_have_a_this_type_that_is_void: diag(2679, ts.DiagnosticCategory.Error, "A_function_that_is_called_with_the_new_keyword_cannot_have_a_this_type_that_is_void_2679", "A function that is called with the 'new' keyword cannot have a 'this' type that is 'void'."),
A_0_parameter_must_be_the_first_parameter: diag(2680, ts.DiagnosticCategory.Error, "A_0_parameter_must_be_the_first_parameter_2680", "A '{0}' parameter must be the first parameter."),
A_constructor_cannot_have_a_this_parameter: diag(2681, ts.DiagnosticCategory.Error, "A_constructor_cannot_have_a_this_parameter_2681", "A constructor cannot have a 'this' parameter."),
get_and_set_accessor_must_have_the_same_this_type: diag(2682, ts.DiagnosticCategory.Error, "get_and_set_accessor_must_have_the_same_this_type_2682", "'get' and 'set' accessor must have the same 'this' type."),
this_implicitly_has_type_any_because_it_does_not_have_a_type_annotation: diag(2683, ts.DiagnosticCategory.Error, "this_implicitly_has_type_any_because_it_does_not_have_a_type_annotation_2683", "'this' implicitly has type 'any' because it does not have a type annotation."),
The_this_context_of_type_0_is_not_assignable_to_method_s_this_of_type_1: diag(2684, ts.DiagnosticCategory.Error, "The_this_context_of_type_0_is_not_assignable_to_method_s_this_of_type_1_2684", "The 'this' context of type '{0}' is not assignable to method's 'this' of type '{1}'."),
The_this_types_of_each_signature_are_incompatible: diag(2685, ts.DiagnosticCategory.Error, "The_this_types_of_each_signature_are_incompatible_2685", "The 'this' types of each signature are incompatible."),
_0_refers_to_a_UMD_global_but_the_current_file_is_a_module_Consider_adding_an_import_instead: diag(2686, ts.DiagnosticCategory.Error, "_0_refers_to_a_UMD_global_but_the_current_file_is_a_module_Consider_adding_an_import_instead_2686", "'{0}' refers to a UMD global, but the current file is a module. Consider adding an import instead."),
All_declarations_of_0_must_have_identical_modifiers: diag(2687, ts.DiagnosticCategory.Error, "All_declarations_of_0_must_have_identical_modifiers_2687", "All declarations of '{0}' must have identical modifiers."),
Cannot_find_type_definition_file_for_0: diag(2688, ts.DiagnosticCategory.Error, "Cannot_find_type_definition_file_for_0_2688", "Cannot find type definition file for '{0}'."),
Cannot_extend_an_interface_0_Did_you_mean_implements: diag(2689, ts.DiagnosticCategory.Error, "Cannot_extend_an_interface_0_Did_you_mean_implements_2689", "Cannot extend an interface '{0}'. Did you mean 'implements'?"),
_0_only_refers_to_a_type_but_is_being_used_as_a_value_here_Did_you_mean_to_use_1_in_0: diag(2690, ts.DiagnosticCategory.Error, "_0_only_refers_to_a_type_but_is_being_used_as_a_value_here_Did_you_mean_to_use_1_in_0_2690", "'{0}' only refers to a type, but is being used as a value here. Did you mean to use '{1} in {0}'?"),
An_import_path_cannot_end_with_a_0_extension_Consider_importing_1_instead: diag(2691, ts.DiagnosticCategory.Error, "An_import_path_cannot_end_with_a_0_extension_Consider_importing_1_instead_2691", "An import path cannot end with a '{0}' extension. Consider importing '{1}' instead."),
_0_is_a_primitive_but_1_is_a_wrapper_object_Prefer_using_0_when_possible: diag(2692, ts.DiagnosticCategory.Error, "_0_is_a_primitive_but_1_is_a_wrapper_object_Prefer_using_0_when_possible_2692", "'{0}' is a primitive, but '{1}' is a wrapper object. Prefer using '{0}' when possible."),
_0_only_refers_to_a_type_but_is_being_used_as_a_value_here: diag(2693, ts.DiagnosticCategory.Error, "_0_only_refers_to_a_type_but_is_being_used_as_a_value_here_2693", "'{0}' only refers to a type, but is being used as a value here."),
Namespace_0_has_no_exported_member_1: diag(2694, ts.DiagnosticCategory.Error, "Namespace_0_has_no_exported_member_1_2694", "Namespace '{0}' has no exported member '{1}'."),
Left_side_of_comma_operator_is_unused_and_has_no_side_effects: diag(2695, ts.DiagnosticCategory.Error, "Left_side_of_comma_operator_is_unused_and_has_no_side_effects_2695", "Left side of comma operator is unused and has no side effects.", /*reportsUnnecessary*/ true),
The_Object_type_is_assignable_to_very_few_other_types_Did_you_mean_to_use_the_any_type_instead: diag(2696, ts.DiagnosticCategory.Error, "The_Object_type_is_assignable_to_very_few_other_types_Did_you_mean_to_use_the_any_type_instead_2696", "The 'Object' type is assignable to very few other types. Did you mean to use the 'any' type instead?"),
An_async_function_or_method_must_return_a_Promise_Make_sure_you_have_a_declaration_for_Promise_or_include_ES2015_in_your_lib_option: diag(2697, ts.DiagnosticCategory.Error, "An_async_function_or_method_must_return_a_Promise_Make_sure_you_have_a_declaration_for_Promise_or_in_2697", "An async function or method must return a 'Promise'. Make sure you have a declaration for 'Promise' or include 'ES2015' in your '--lib' option."),
Spread_types_may_only_be_created_from_object_types: diag(2698, ts.DiagnosticCategory.Error, "Spread_types_may_only_be_created_from_object_types_2698", "Spread types may only be created from object types."),
Static_property_0_conflicts_with_built_in_property_Function_0_of_constructor_function_1: diag(2699, ts.DiagnosticCategory.Error, "Static_property_0_conflicts_with_built_in_property_Function_0_of_constructor_function_1_2699", "Static property '{0}' conflicts with built-in property 'Function.{0}' of constructor function '{1}'."),
Rest_types_may_only_be_created_from_object_types: diag(2700, ts.DiagnosticCategory.Error, "Rest_types_may_only_be_created_from_object_types_2700", "Rest types may only be created from object types."),
The_target_of_an_object_rest_assignment_must_be_a_variable_or_a_property_access: diag(2701, ts.DiagnosticCategory.Error, "The_target_of_an_object_rest_assignment_must_be_a_variable_or_a_property_access_2701", "The target of an object rest assignment must be a variable or a property access."),
_0_only_refers_to_a_type_but_is_being_used_as_a_namespace_here: diag(2702, ts.DiagnosticCategory.Error, "_0_only_refers_to_a_type_but_is_being_used_as_a_namespace_here_2702", "'{0}' only refers to a type, but is being used as a namespace here."),
The_operand_of_a_delete_operator_must_be_a_property_reference: diag(2703, ts.DiagnosticCategory.Error, "The_operand_of_a_delete_operator_must_be_a_property_reference_2703", "The operand of a 'delete' operator must be a property reference."),
The_operand_of_a_delete_operator_cannot_be_a_read_only_property: diag(2704, ts.DiagnosticCategory.Error, "The_operand_of_a_delete_operator_cannot_be_a_read_only_property_2704", "The operand of a 'delete' operator cannot be a read-only property."),
An_async_function_or_method_in_ES5_SlashES3_requires_the_Promise_constructor_Make_sure_you_have_a_declaration_for_the_Promise_constructor_or_include_ES2015_in_your_lib_option: diag(2705, ts.DiagnosticCategory.Error, "An_async_function_or_method_in_ES5_SlashES3_requires_the_Promise_constructor_Make_sure_you_have_a_de_2705", "An async function or method in ES5/ES3 requires the 'Promise' constructor. Make sure you have a declaration for the 'Promise' constructor or include 'ES2015' in your '--lib' option."),
Required_type_parameters_may_not_follow_optional_type_parameters: diag(2706, ts.DiagnosticCategory.Error, "Required_type_parameters_may_not_follow_optional_type_parameters_2706", "Required type parameters may not follow optional type parameters."),
Generic_type_0_requires_between_1_and_2_type_arguments: diag(2707, ts.DiagnosticCategory.Error, "Generic_type_0_requires_between_1_and_2_type_arguments_2707", "Generic type '{0}' requires between {1} and {2} type arguments."),
Cannot_use_namespace_0_as_a_value: diag(2708, ts.DiagnosticCategory.Error, "Cannot_use_namespace_0_as_a_value_2708", "Cannot use namespace '{0}' as a value."),
Cannot_use_namespace_0_as_a_type: diag(2709, ts.DiagnosticCategory.Error, "Cannot_use_namespace_0_as_a_type_2709", "Cannot use namespace '{0}' as a type."),
_0_are_specified_twice_The_attribute_named_0_will_be_overwritten: diag(2710, ts.DiagnosticCategory.Error, "_0_are_specified_twice_The_attribute_named_0_will_be_overwritten_2710", "'{0}' are specified twice. The attribute named '{0}' will be overwritten."),
A_dynamic_import_call_returns_a_Promise_Make_sure_you_have_a_declaration_for_Promise_or_include_ES2015_in_your_lib_option: diag(2711, ts.DiagnosticCategory.Error, "A_dynamic_import_call_returns_a_Promise_Make_sure_you_have_a_declaration_for_Promise_or_include_ES20_2711", "A dynamic import call returns a 'Promise'. Make sure you have a declaration for 'Promise' or include 'ES2015' in your '--lib' option."),
A_dynamic_import_call_in_ES5_SlashES3_requires_the_Promise_constructor_Make_sure_you_have_a_declaration_for_the_Promise_constructor_or_include_ES2015_in_your_lib_option: diag(2712, ts.DiagnosticCategory.Error, "A_dynamic_import_call_in_ES5_SlashES3_requires_the_Promise_constructor_Make_sure_you_have_a_declarat_2712", "A dynamic import call in ES5/ES3 requires the 'Promise' constructor. Make sure you have a declaration for the 'Promise' constructor or include 'ES2015' in your '--lib' option."),
Cannot_access_0_1_because_0_is_a_type_but_not_a_namespace_Did_you_mean_to_retrieve_the_type_of_the_property_1_in_0_with_0_1: diag(2713, ts.DiagnosticCategory.Error, "Cannot_access_0_1_because_0_is_a_type_but_not_a_namespace_Did_you_mean_to_retrieve_the_type_of_the_p_2713", "Cannot access '{0}.{1}' because '{0}' is a type, but not a namespace. Did you mean to retrieve the type of the property '{1}' in '{0}' with '{0}[\"{1}\"]'?"),
The_expression_of_an_export_assignment_must_be_an_identifier_or_qualified_name_in_an_ambient_context: diag(2714, ts.DiagnosticCategory.Error, "The_expression_of_an_export_assignment_must_be_an_identifier_or_qualified_name_in_an_ambient_context_2714", "The expression of an export assignment must be an identifier or qualified name in an ambient context."),
Abstract_property_0_in_class_1_cannot_be_accessed_in_the_constructor: diag(2715, ts.DiagnosticCategory.Error, "Abstract_property_0_in_class_1_cannot_be_accessed_in_the_constructor_2715", "Abstract property '{0}' in class '{1}' cannot be accessed in the constructor."),
Type_parameter_0_has_a_circular_default: diag(2716, ts.DiagnosticCategory.Error, "Type_parameter_0_has_a_circular_default_2716", "Type parameter '{0}' has a circular default."),
Subsequent_property_declarations_must_have_the_same_type_Property_0_must_be_of_type_1_but_here_has_type_2: diag(2717, ts.DiagnosticCategory.Error, "Subsequent_property_declarations_must_have_the_same_type_Property_0_must_be_of_type_1_but_here_has_t_2717", "Subsequent property declarations must have the same type. Property '{0}' must be of type '{1}', but here has type '{2}'."),
Duplicate_property_0: diag(2718, ts.DiagnosticCategory.Error, "Duplicate_property_0_2718", "Duplicate property '{0}'."),
Type_0_is_not_assignable_to_type_1_Two_different_types_with_this_name_exist_but_they_are_unrelated: diag(2719, ts.DiagnosticCategory.Error, "Type_0_is_not_assignable_to_type_1_Two_different_types_with_this_name_exist_but_they_are_unrelated_2719", "Type '{0}' is not assignable to type '{1}'. Two different types with this name exist, but they are unrelated."),
Class_0_incorrectly_implements_class_1_Did_you_mean_to_extend_1_and_inherit_its_members_as_a_subclass: diag(2720, ts.DiagnosticCategory.Error, "Class_0_incorrectly_implements_class_1_Did_you_mean_to_extend_1_and_inherit_its_members_as_a_subclas_2720", "Class '{0}' incorrectly implements class '{1}'. Did you mean to extend '{1}' and inherit its members as a subclass?"),
Cannot_invoke_an_object_which_is_possibly_null: diag(2721, ts.DiagnosticCategory.Error, "Cannot_invoke_an_object_which_is_possibly_null_2721", "Cannot invoke an object which is possibly 'null'."),
Cannot_invoke_an_object_which_is_possibly_undefined: diag(2722, ts.DiagnosticCategory.Error, "Cannot_invoke_an_object_which_is_possibly_undefined_2722", "Cannot invoke an object which is possibly 'undefined'."),
Cannot_invoke_an_object_which_is_possibly_null_or_undefined: diag(2723, ts.DiagnosticCategory.Error, "Cannot_invoke_an_object_which_is_possibly_null_or_undefined_2723", "Cannot invoke an object which is possibly 'null' or 'undefined'."),
_0_has_no_exported_member_named_1_Did_you_mean_2: diag(2724, ts.DiagnosticCategory.Error, "_0_has_no_exported_member_named_1_Did_you_mean_2_2724", "'{0}' has no exported member named '{1}'. Did you mean '{2}'?"),
Class_name_cannot_be_Object_when_targeting_ES5_with_module_0: diag(2725, ts.DiagnosticCategory.Error, "Class_name_cannot_be_Object_when_targeting_ES5_with_module_0_2725", "Class name cannot be 'Object' when targeting ES5 with module {0}."),
Cannot_find_lib_definition_for_0: diag(2726, ts.DiagnosticCategory.Error, "Cannot_find_lib_definition_for_0_2726", "Cannot find lib definition for '{0}'."),
Cannot_find_lib_definition_for_0_Did_you_mean_1: diag(2727, ts.DiagnosticCategory.Error, "Cannot_find_lib_definition_for_0_Did_you_mean_1_2727", "Cannot find lib definition for '{0}'. Did you mean '{1}'?"),
_0_is_declared_here: diag(2728, ts.DiagnosticCategory.Message, "_0_is_declared_here_2728", "'{0}' is declared here."),
Property_0_is_used_before_its_initialization: diag(2729, ts.DiagnosticCategory.Error, "Property_0_is_used_before_its_initialization_2729", "Property '{0}' is used before its initialization."),
An_arrow_function_cannot_have_a_this_parameter: diag(2730, ts.DiagnosticCategory.Error, "An_arrow_function_cannot_have_a_this_parameter_2730", "An arrow function cannot have a 'this' parameter."),
Implicit_conversion_of_a_symbol_to_a_string_will_fail_at_runtime_Consider_wrapping_this_expression_in_String: diag(2731, ts.DiagnosticCategory.Error, "Implicit_conversion_of_a_symbol_to_a_string_will_fail_at_runtime_Consider_wrapping_this_expression_i_2731", "Implicit conversion of a 'symbol' to a 'string' will fail at runtime. Consider wrapping this expression in 'String(...)'."),
Cannot_find_module_0_Consider_using_resolveJsonModule_to_import_module_with_json_extension: diag(2732, ts.DiagnosticCategory.Error, "Cannot_find_module_0_Consider_using_resolveJsonModule_to_import_module_with_json_extension_2732", "Cannot find module '{0}'. Consider using '--resolveJsonModule' to import module with '.json' extension."),
Property_0_was_also_declared_here: diag(2733, ts.DiagnosticCategory.Error, "Property_0_was_also_declared_here_2733", "Property '{0}' was also declared here."),
Are_you_missing_a_semicolon: diag(2734, ts.DiagnosticCategory.Error, "Are_you_missing_a_semicolon_2734", "Are you missing a semicolon?"),
Did_you_mean_for_0_to_be_constrained_to_type_new_args_Colon_any_1: diag(2735, ts.DiagnosticCategory.Error, "Did_you_mean_for_0_to_be_constrained_to_type_new_args_Colon_any_1_2735", "Did you mean for '{0}' to be constrained to type 'new (...args: any[]) => {1}'?"),
Operator_0_cannot_be_applied_to_type_1: diag(2736, ts.DiagnosticCategory.Error, "Operator_0_cannot_be_applied_to_type_1_2736", "Operator '{0}' cannot be applied to type '{1}'."),
BigInt_literals_are_not_available_when_targeting_lower_than_ES2020: diag(2737, ts.DiagnosticCategory.Error, "BigInt_literals_are_not_available_when_targeting_lower_than_ES2020_2737", "BigInt literals are not available when targeting lower than ES2020."),
An_outer_value_of_this_is_shadowed_by_this_container: diag(2738, ts.DiagnosticCategory.Message, "An_outer_value_of_this_is_shadowed_by_this_container_2738", "An outer value of 'this' is shadowed by this container."),
Type_0_is_missing_the_following_properties_from_type_1_Colon_2: diag(2739, ts.DiagnosticCategory.Error, "Type_0_is_missing_the_following_properties_from_type_1_Colon_2_2739", "Type '{0}' is missing the following properties from type '{1}': {2}"),
Type_0_is_missing_the_following_properties_from_type_1_Colon_2_and_3_more: diag(2740, ts.DiagnosticCategory.Error, "Type_0_is_missing_the_following_properties_from_type_1_Colon_2_and_3_more_2740", "Type '{0}' is missing the following properties from type '{1}': {2}, and {3} more."),
Property_0_is_missing_in_type_1_but_required_in_type_2: diag(2741, ts.DiagnosticCategory.Error, "Property_0_is_missing_in_type_1_but_required_in_type_2_2741", "Property '{0}' is missing in type '{1}' but required in type '{2}'."),
The_inferred_type_of_0_cannot_be_named_without_a_reference_to_1_This_is_likely_not_portable_A_type_annotation_is_necessary: diag(2742, ts.DiagnosticCategory.Error, "The_inferred_type_of_0_cannot_be_named_without_a_reference_to_1_This_is_likely_not_portable_A_type_a_2742", "The inferred type of '{0}' cannot be named without a reference to '{1}'. This is likely not portable. A type annotation is necessary."),
No_overload_expects_0_type_arguments_but_overloads_do_exist_that_expect_either_1_or_2_type_arguments: diag(2743, ts.DiagnosticCategory.Error, "No_overload_expects_0_type_arguments_but_overloads_do_exist_that_expect_either_1_or_2_type_arguments_2743", "No overload expects {0} type arguments, but overloads do exist that expect either {1} or {2} type arguments."),
Type_parameter_defaults_can_only_reference_previously_declared_type_parameters: diag(2744, ts.DiagnosticCategory.Error, "Type_parameter_defaults_can_only_reference_previously_declared_type_parameters_2744", "Type parameter defaults can only reference previously declared type parameters."),
This_JSX_tag_s_0_prop_expects_type_1_which_requires_multiple_children_but_only_a_single_child_was_provided: diag(2745, ts.DiagnosticCategory.Error, "This_JSX_tag_s_0_prop_expects_type_1_which_requires_multiple_children_but_only_a_single_child_was_pr_2745", "This JSX tag's '{0}' prop expects type '{1}' which requires multiple children, but only a single child was provided."),
This_JSX_tag_s_0_prop_expects_a_single_child_of_type_1_but_multiple_children_were_provided: diag(2746, ts.DiagnosticCategory.Error, "This_JSX_tag_s_0_prop_expects_a_single_child_of_type_1_but_multiple_children_were_provided_2746", "This JSX tag's '{0}' prop expects a single child of type '{1}', but multiple children were provided."),
_0_components_don_t_accept_text_as_child_elements_Text_in_JSX_has_the_type_string_but_the_expected_type_of_1_is_2: diag(2747, ts.DiagnosticCategory.Error, "_0_components_don_t_accept_text_as_child_elements_Text_in_JSX_has_the_type_string_but_the_expected_t_2747", "'{0}' components don't accept text as child elements. Text in JSX has the type 'string', but the expected type of '{1}' is '{2}'."),
Cannot_access_ambient_const_enums_when_the_isolatedModules_flag_is_provided: diag(2748, ts.DiagnosticCategory.Error, "Cannot_access_ambient_const_enums_when_the_isolatedModules_flag_is_provided_2748", "Cannot access ambient const enums when the '--isolatedModules' flag is provided."),
_0_refers_to_a_value_but_is_being_used_as_a_type_here_Did_you_mean_typeof_0: diag(2749, ts.DiagnosticCategory.Error, "_0_refers_to_a_value_but_is_being_used_as_a_type_here_Did_you_mean_typeof_0_2749", "'{0}' refers to a value, but is being used as a type here. Did you mean 'typeof {0}'?"),
The_implementation_signature_is_declared_here: diag(2750, ts.DiagnosticCategory.Error, "The_implementation_signature_is_declared_here_2750", "The implementation signature is declared here."),
Circularity_originates_in_type_at_this_location: diag(2751, ts.DiagnosticCategory.Error, "Circularity_originates_in_type_at_this_location_2751", "Circularity originates in type at this location."),
The_first_export_default_is_here: diag(2752, ts.DiagnosticCategory.Error, "The_first_export_default_is_here_2752", "The first export default is here."),
Another_export_default_is_here: diag(2753, ts.DiagnosticCategory.Error, "Another_export_default_is_here_2753", "Another export default is here."),
super_may_not_use_type_arguments: diag(2754, ts.DiagnosticCategory.Error, "super_may_not_use_type_arguments_2754", "'super' may not use type arguments."),
No_constituent_of_type_0_is_callable: diag(2755, ts.DiagnosticCategory.Error, "No_constituent_of_type_0_is_callable_2755", "No constituent of type '{0}' is callable."),
Not_all_constituents_of_type_0_are_callable: diag(2756, ts.DiagnosticCategory.Error, "Not_all_constituents_of_type_0_are_callable_2756", "Not all constituents of type '{0}' are callable."),
Type_0_has_no_call_signatures: diag(2757, ts.DiagnosticCategory.Error, "Type_0_has_no_call_signatures_2757", "Type '{0}' has no call signatures."),
Each_member_of_the_union_type_0_has_signatures_but_none_of_those_signatures_are_compatible_with_each_other: diag(2758, ts.DiagnosticCategory.Error, "Each_member_of_the_union_type_0_has_signatures_but_none_of_those_signatures_are_compatible_with_each_2758", "Each member of the union type '{0}' has signatures, but none of those signatures are compatible with each other."),
No_constituent_of_type_0_is_constructable: diag(2759, ts.DiagnosticCategory.Error, "No_constituent_of_type_0_is_constructable_2759", "No constituent of type '{0}' is constructable."),
Not_all_constituents_of_type_0_are_constructable: diag(2760, ts.DiagnosticCategory.Error, "Not_all_constituents_of_type_0_are_constructable_2760", "Not all constituents of type '{0}' are constructable."),
Type_0_has_no_construct_signatures: diag(2761, ts.DiagnosticCategory.Error, "Type_0_has_no_construct_signatures_2761", "Type '{0}' has no construct signatures."),
Each_member_of_the_union_type_0_has_construct_signatures_but_none_of_those_signatures_are_compatible_with_each_other: diag(2762, ts.DiagnosticCategory.Error, "Each_member_of_the_union_type_0_has_construct_signatures_but_none_of_those_signatures_are_compatible_2762", "Each member of the union type '{0}' has construct signatures, but none of those signatures are compatible with each other."),
Cannot_iterate_value_because_the_next_method_of_its_iterator_expects_type_1_but_for_of_will_always_send_0: diag(2763, ts.DiagnosticCategory.Error, "Cannot_iterate_value_because_the_next_method_of_its_iterator_expects_type_1_but_for_of_will_always_s_2763", "Cannot iterate value because the 'next' method of its iterator expects type '{1}', but for-of will always send '{0}'."),
Cannot_iterate_value_because_the_next_method_of_its_iterator_expects_type_1_but_array_spread_will_always_send_0: diag(2764, ts.DiagnosticCategory.Error, "Cannot_iterate_value_because_the_next_method_of_its_iterator_expects_type_1_but_array_spread_will_al_2764", "Cannot iterate value because the 'next' method of its iterator expects type '{1}', but array spread will always send '{0}'."),
Cannot_iterate_value_because_the_next_method_of_its_iterator_expects_type_1_but_array_destructuring_will_always_send_0: diag(2765, ts.DiagnosticCategory.Error, "Cannot_iterate_value_because_the_next_method_of_its_iterator_expects_type_1_but_array_destructuring__2765", "Cannot iterate value because the 'next' method of its iterator expects type '{1}', but array destructuring will always send '{0}'."),
Cannot_delegate_iteration_to_value_because_the_next_method_of_its_iterator_expects_type_1_but_the_containing_generator_will_always_send_0: diag(2766, ts.DiagnosticCategory.Error, "Cannot_delegate_iteration_to_value_because_the_next_method_of_its_iterator_expects_type_1_but_the_co_2766", "Cannot delegate iteration to value because the 'next' method of its iterator expects type '{1}', but the containing generator will always send '{0}'."),
The_0_property_of_an_iterator_must_be_a_method: diag(2767, ts.DiagnosticCategory.Error, "The_0_property_of_an_iterator_must_be_a_method_2767", "The '{0}' property of an iterator must be a method."),
The_0_property_of_an_async_iterator_must_be_a_method: diag(2768, ts.DiagnosticCategory.Error, "The_0_property_of_an_async_iterator_must_be_a_method_2768", "The '{0}' property of an async iterator must be a method."),
No_overload_matches_this_call: diag(2769, ts.DiagnosticCategory.Error, "No_overload_matches_this_call_2769", "No overload matches this call."),
The_last_overload_gave_the_following_error: diag(2770, ts.DiagnosticCategory.Error, "The_last_overload_gave_the_following_error_2770", "The last overload gave the following error."),
The_last_overload_is_declared_here: diag(2771, ts.DiagnosticCategory.Error, "The_last_overload_is_declared_here_2771", "The last overload is declared here."),
Overload_0_of_1_2_gave_the_following_error: diag(2772, ts.DiagnosticCategory.Error, "Overload_0_of_1_2_gave_the_following_error_2772", "Overload {0} of {1}, '{2}', gave the following error."),
Did_you_forget_to_use_await: diag(2773, ts.DiagnosticCategory.Error, "Did_you_forget_to_use_await_2773", "Did you forget to use 'await'?"),
This_condition_will_always_return_true_since_this_function_is_always_defined_Did_you_mean_to_call_it_instead: diag(2774, ts.DiagnosticCategory.Error, "This_condition_will_always_return_true_since_this_function_is_always_defined_Did_you_mean_to_call_it_2774", "This condition will always return true since this function is always defined. Did you mean to call it instead?"),
Assertions_require_every_name_in_the_call_target_to_be_declared_with_an_explicit_type_annotation: diag(2775, ts.DiagnosticCategory.Error, "Assertions_require_every_name_in_the_call_target_to_be_declared_with_an_explicit_type_annotation_2775", "Assertions require every name in the call target to be declared with an explicit type annotation."),
Assertions_require_the_call_target_to_be_an_identifier_or_qualified_name: diag(2776, ts.DiagnosticCategory.Error, "Assertions_require_the_call_target_to_be_an_identifier_or_qualified_name_2776", "Assertions require the call target to be an identifier or qualified name."),
The_operand_of_an_increment_or_decrement_operator_may_not_be_an_optional_property_access: diag(2777, ts.DiagnosticCategory.Error, "The_operand_of_an_increment_or_decrement_operator_may_not_be_an_optional_property_access_2777", "The operand of an increment or decrement operator may not be an optional property access."),
The_target_of_an_object_rest_assignment_may_not_be_an_optional_property_access: diag(2778, ts.DiagnosticCategory.Error, "The_target_of_an_object_rest_assignment_may_not_be_an_optional_property_access_2778", "The target of an object rest assignment may not be an optional property access."),
The_left_hand_side_of_an_assignment_expression_may_not_be_an_optional_property_access: diag(2779, ts.DiagnosticCategory.Error, "The_left_hand_side_of_an_assignment_expression_may_not_be_an_optional_property_access_2779", "The left-hand side of an assignment expression may not be an optional property access."),
The_left_hand_side_of_a_for_in_statement_may_not_be_an_optional_property_access: diag(2780, ts.DiagnosticCategory.Error, "The_left_hand_side_of_a_for_in_statement_may_not_be_an_optional_property_access_2780", "The left-hand side of a 'for...in' statement may not be an optional property access."),
The_left_hand_side_of_a_for_of_statement_may_not_be_an_optional_property_access: diag(2781, ts.DiagnosticCategory.Error, "The_left_hand_side_of_a_for_of_statement_may_not_be_an_optional_property_access_2781", "The left-hand side of a 'for...of' statement may not be an optional property access."),
_0_needs_an_explicit_type_annotation: diag(2782, ts.DiagnosticCategory.Message, "_0_needs_an_explicit_type_annotation_2782", "'{0}' needs an explicit type annotation."),
_0_is_specified_more_than_once_so_this_usage_will_be_overwritten: diag(2783, ts.DiagnosticCategory.Error, "_0_is_specified_more_than_once_so_this_usage_will_be_overwritten_2783", "'{0}' is specified more than once, so this usage will be overwritten."),
get_and_set_accessors_cannot_declare_this_parameters: diag(2784, ts.DiagnosticCategory.Error, "get_and_set_accessors_cannot_declare_this_parameters_2784", "'get' and 'set' accessors cannot declare 'this' parameters."),
This_spread_always_overwrites_this_property: diag(2785, ts.DiagnosticCategory.Error, "This_spread_always_overwrites_this_property_2785", "This spread always overwrites this property."),
_0_cannot_be_used_as_a_JSX_component: diag(2786, ts.DiagnosticCategory.Error, "_0_cannot_be_used_as_a_JSX_component_2786", "'{0}' cannot be used as a JSX component."),
Its_return_type_0_is_not_a_valid_JSX_element: diag(2787, ts.DiagnosticCategory.Error, "Its_return_type_0_is_not_a_valid_JSX_element_2787", "Its return type '{0}' is not a valid JSX element."),
Its_instance_type_0_is_not_a_valid_JSX_element: diag(2788, ts.DiagnosticCategory.Error, "Its_instance_type_0_is_not_a_valid_JSX_element_2788", "Its instance type '{0}' is not a valid JSX element."),
Its_element_type_0_is_not_a_valid_JSX_element: diag(2789, ts.DiagnosticCategory.Error, "Its_element_type_0_is_not_a_valid_JSX_element_2789", "Its element type '{0}' is not a valid JSX element."),
The_operand_of_a_delete_operator_must_be_optional: diag(2790, ts.DiagnosticCategory.Error, "The_operand_of_a_delete_operator_must_be_optional_2790", "The operand of a 'delete' operator must be optional."),
Exponentiation_cannot_be_performed_on_bigint_values_unless_the_target_option_is_set_to_es2016_or_later: diag(2791, ts.DiagnosticCategory.Error, "Exponentiation_cannot_be_performed_on_bigint_values_unless_the_target_option_is_set_to_es2016_or_lat_2791", "Exponentiation cannot be performed on 'bigint' values unless the 'target' option is set to 'es2016' or later."),
Cannot_find_module_0_Did_you_mean_to_set_the_moduleResolution_option_to_node_or_to_add_aliases_to_the_paths_option: diag(2792, ts.DiagnosticCategory.Error, "Cannot_find_module_0_Did_you_mean_to_set_the_moduleResolution_option_to_node_or_to_add_aliases_to_th_2792", "Cannot find module '{0}'. Did you mean to set the 'moduleResolution' option to 'node', or to add aliases to the 'paths' option?"),
The_call_would_have_succeeded_against_this_implementation_but_implementation_signatures_of_overloads_are_not_externally_visible: diag(2793, ts.DiagnosticCategory.Error, "The_call_would_have_succeeded_against_this_implementation_but_implementation_signatures_of_overloads_2793", "The call would have succeeded against this implementation, but implementation signatures of overloads are not externally visible."),
Expected_0_arguments_but_got_1_Did_you_forget_to_include_void_in_your_type_argument_to_Promise: diag(2794, ts.DiagnosticCategory.Error, "Expected_0_arguments_but_got_1_Did_you_forget_to_include_void_in_your_type_argument_to_Promise_2794", "Expected {0} arguments, but got {1}. Did you forget to include 'void' in your type argument to 'Promise'?"),
The_intrinsic_keyword_can_only_be_used_to_declare_compiler_provided_intrinsic_types: diag(2795, ts.DiagnosticCategory.Error, "The_intrinsic_keyword_can_only_be_used_to_declare_compiler_provided_intrinsic_types_2795", "The 'intrinsic' keyword can only be used to declare compiler provided intrinsic types."),
It_is_likely_that_you_are_missing_a_comma_to_separate_these_two_template_expressions_They_form_a_tagged_template_expression_which_cannot_be_invoked: diag(2796, ts.DiagnosticCategory.Error, "It_is_likely_that_you_are_missing_a_comma_to_separate_these_two_template_expressions_They_form_a_tag_2796", "It is likely that you are missing a comma to separate these two template expressions. They form a tagged template expression which cannot be invoked."),
A_mixin_class_that_extends_from_a_type_variable_containing_an_abstract_construct_signature_must_also_be_declared_abstract: diag(2797, ts.DiagnosticCategory.Error, "A_mixin_class_that_extends_from_a_type_variable_containing_an_abstract_construct_signature_must_also_2797", "A mixin class that extends from a type variable containing an abstract construct signature must also be declared 'abstract'."),
The_declaration_was_marked_as_deprecated_here: diag(2798, ts.DiagnosticCategory.Error, "The_declaration_was_marked_as_deprecated_here_2798", "The declaration was marked as deprecated here."),
Type_produces_a_tuple_type_that_is_too_large_to_represent: diag(2799, ts.DiagnosticCategory.Error, "Type_produces_a_tuple_type_that_is_too_large_to_represent_2799", "Type produces a tuple type that is too large to represent."),
Expression_produces_a_tuple_type_that_is_too_large_to_represent: diag(2800, ts.DiagnosticCategory.Error, "Expression_produces_a_tuple_type_that_is_too_large_to_represent_2800", "Expression produces a tuple type that is too large to represent."),
This_condition_will_always_return_true_since_this_0_is_always_defined: diag(2801, ts.DiagnosticCategory.Error, "This_condition_will_always_return_true_since_this_0_is_always_defined_2801", "This condition will always return true since this '{0}' is always defined."),
Type_0_can_only_be_iterated_through_when_using_the_downlevelIteration_flag_or_with_a_target_of_es2015_or_higher: diag(2802, ts.DiagnosticCategory.Error, "Type_0_can_only_be_iterated_through_when_using_the_downlevelIteration_flag_or_with_a_target_of_es201_2802", "Type '{0}' can only be iterated through when using the '--downlevelIteration' flag or with a '--target' of 'es2015' or higher."),
Cannot_assign_to_private_method_0_Private_methods_are_not_writable: diag(2803, ts.DiagnosticCategory.Error, "Cannot_assign_to_private_method_0_Private_methods_are_not_writable_2803", "Cannot assign to private method '{0}'. Private methods are not writable."),
Duplicate_identifier_0_Static_and_instance_elements_cannot_share_the_same_private_name: diag(2804, ts.DiagnosticCategory.Error, "Duplicate_identifier_0_Static_and_instance_elements_cannot_share_the_same_private_name_2804", "Duplicate identifier '{0}'. Static and instance elements cannot share the same private name."),
Static_fields_with_private_names_can_t_have_initializers_when_the_useDefineForClassFields_flag_is_not_specified_with_a_target_of_esnext_Consider_adding_the_useDefineForClassFields_flag: diag(2805, ts.DiagnosticCategory.Error, "Static_fields_with_private_names_can_t_have_initializers_when_the_useDefineForClassFields_flag_is_no_2805", "Static fields with private names can't have initializers when the '--useDefineForClassFields' flag is not specified with a '--target' of 'esnext'. Consider adding the '--useDefineForClassFields' flag."),
Private_accessor_was_defined_without_a_getter: diag(2806, ts.DiagnosticCategory.Error, "Private_accessor_was_defined_without_a_getter_2806", "Private accessor was defined without a getter."),
This_syntax_requires_an_imported_helper_named_1_with_2_parameters_which_is_not_compatible_with_the_one_in_0_Consider_upgrading_your_version_of_0: diag(2807, ts.DiagnosticCategory.Error, "This_syntax_requires_an_imported_helper_named_1_with_2_parameters_which_is_not_compatible_with_the_o_2807", "This syntax requires an imported helper named '{1}' with {2} parameters, which is not compatible with the one in '{0}'. Consider upgrading your version of '{0}'."),
A_get_accessor_must_be_at_least_as_accessible_as_the_setter: diag(2808, ts.DiagnosticCategory.Error, "A_get_accessor_must_be_at_least_as_accessible_as_the_setter_2808", "A get accessor must be at least as accessible as the setter"),
Declaration_or_statement_expected_This_follows_a_block_of_statements_so_if_you_intended_to_write_a_destructuring_assignment_you_might_need_to_wrap_the_the_whole_assignment_in_parentheses: diag(2809, ts.DiagnosticCategory.Error, "Declaration_or_statement_expected_This_follows_a_block_of_statements_so_if_you_intended_to_write_a_d_2809", "Declaration or statement expected. This '=' follows a block of statements, so if you intended to write a destructuring assignment, you might need to wrap the the whole assignment in parentheses."),
Property_0_may_not_be_used_in_a_static_property_s_initializer_in_the_same_class_when_target_is_esnext_and_useDefineForClassFields_is_false: diag(2810, ts.DiagnosticCategory.Error, "Property_0_may_not_be_used_in_a_static_property_s_initializer_in_the_same_class_when_target_is_esnex_2810", "Property '{0}' may not be used in a static property's initializer in the same class when 'target' is 'esnext' and 'useDefineForClassFields' is 'false'."),
Initializer_for_property_0: diag(2811, ts.DiagnosticCategory.Error, "Initializer_for_property_0_2811", "Initializer for property '{0}'"),
Property_0_does_not_exist_on_type_1_Try_changing_the_lib_compiler_option_to_include_dom: diag(2812, ts.DiagnosticCategory.Error, "Property_0_does_not_exist_on_type_1_Try_changing_the_lib_compiler_option_to_include_dom_2812", "Property '{0}' does not exist on type '{1}'. Try changing the 'lib' compiler option to include 'dom'."),
Class_declaration_cannot_implement_overload_list_for_0: diag(2813, ts.DiagnosticCategory.Error, "Class_declaration_cannot_implement_overload_list_for_0_2813", "Class declaration cannot implement overload list for '{0}'."),
Function_with_bodies_can_only_merge_with_classes_that_are_ambient: diag(2814, ts.DiagnosticCategory.Error, "Function_with_bodies_can_only_merge_with_classes_that_are_ambient_2814", "Function with bodies can only merge with classes that are ambient."),
arguments_cannot_be_referenced_in_property_initializers: diag(2815, ts.DiagnosticCategory.Error, "arguments_cannot_be_referenced_in_property_initializers_2815", "'arguments' cannot be referenced in property initializers."),
Cannot_use_this_in_a_static_property_initializer_of_a_decorated_class: diag(2816, ts.DiagnosticCategory.Error, "Cannot_use_this_in_a_static_property_initializer_of_a_decorated_class_2816", "Cannot use 'this' in a static property initializer of a decorated class."),
Property_0_has_no_initializer_and_is_not_definitely_assigned_in_a_class_static_block: diag(2817, ts.DiagnosticCategory.Error, "Property_0_has_no_initializer_and_is_not_definitely_assigned_in_a_class_static_block_2817", "Property '{0}' has no initializer and is not definitely assigned in a class static block."),
Duplicate_identifier_0_Compiler_reserves_name_1_when_emitting_super_references_in_static_initializers: diag(2818, ts.DiagnosticCategory.Error, "Duplicate_identifier_0_Compiler_reserves_name_1_when_emitting_super_references_in_static_initializer_2818", "Duplicate identifier '{0}'. Compiler reserves name '{1}' when emitting 'super' references in static initializers."),
Namespace_name_cannot_be_0: diag(2819, ts.DiagnosticCategory.Error, "Namespace_name_cannot_be_0_2819", "Namespace name cannot be '{0}'."),
Import_declaration_0_is_using_private_name_1: diag(4000, ts.DiagnosticCategory.Error, "Import_declaration_0_is_using_private_name_1_4000", "Import declaration '{0}' is using private name '{1}'."),
Type_parameter_0_of_exported_class_has_or_is_using_private_name_1: diag(4002, ts.DiagnosticCategory.Error, "Type_parameter_0_of_exported_class_has_or_is_using_private_name_1_4002", "Type parameter '{0}' of exported class has or is using private name '{1}'."),
Type_parameter_0_of_exported_interface_has_or_is_using_private_name_1: diag(4004, ts.DiagnosticCategory.Error, "Type_parameter_0_of_exported_interface_has_or_is_using_private_name_1_4004", "Type parameter '{0}' of exported interface has or is using private name '{1}'."),
Type_parameter_0_of_constructor_signature_from_exported_interface_has_or_is_using_private_name_1: diag(4006, ts.DiagnosticCategory.Error, "Type_parameter_0_of_constructor_signature_from_exported_interface_has_or_is_using_private_name_1_4006", "Type parameter '{0}' of constructor signature from exported interface has or is using private name '{1}'."),
Type_parameter_0_of_call_signature_from_exported_interface_has_or_is_using_private_name_1: diag(4008, ts.DiagnosticCategory.Error, "Type_parameter_0_of_call_signature_from_exported_interface_has_or_is_using_private_name_1_4008", "Type parameter '{0}' of call signature from exported interface has or is using private name '{1}'."),
Type_parameter_0_of_public_static_method_from_exported_class_has_or_is_using_private_name_1: diag(4010, ts.DiagnosticCategory.Error, "Type_parameter_0_of_public_static_method_from_exported_class_has_or_is_using_private_name_1_4010", "Type parameter '{0}' of public static method from exported class has or is using private name '{1}'."),
Type_parameter_0_of_public_method_from_exported_class_has_or_is_using_private_name_1: diag(4012, ts.DiagnosticCategory.Error, "Type_parameter_0_of_public_method_from_exported_class_has_or_is_using_private_name_1_4012", "Type parameter '{0}' of public method from exported class has or is using private name '{1}'."),
Type_parameter_0_of_method_from_exported_interface_has_or_is_using_private_name_1: diag(4014, ts.DiagnosticCategory.Error, "Type_parameter_0_of_method_from_exported_interface_has_or_is_using_private_name_1_4014", "Type parameter '{0}' of method from exported interface has or is using private name '{1}'."),
Type_parameter_0_of_exported_function_has_or_is_using_private_name_1: diag(4016, ts.DiagnosticCategory.Error, "Type_parameter_0_of_exported_function_has_or_is_using_private_name_1_4016", "Type parameter '{0}' of exported function has or is using private name '{1}'."),
Implements_clause_of_exported_class_0_has_or_is_using_private_name_1: diag(4019, ts.DiagnosticCategory.Error, "Implements_clause_of_exported_class_0_has_or_is_using_private_name_1_4019", "Implements clause of exported class '{0}' has or is using private name '{1}'."),
extends_clause_of_exported_class_0_has_or_is_using_private_name_1: diag(4020, ts.DiagnosticCategory.Error, "extends_clause_of_exported_class_0_has_or_is_using_private_name_1_4020", "'extends' clause of exported class '{0}' has or is using private name '{1}'."),
extends_clause_of_exported_class_has_or_is_using_private_name_0: diag(4021, ts.DiagnosticCategory.Error, "extends_clause_of_exported_class_has_or_is_using_private_name_0_4021", "'extends' clause of exported class has or is using private name '{0}'."),
extends_clause_of_exported_interface_0_has_or_is_using_private_name_1: diag(4022, ts.DiagnosticCategory.Error, "extends_clause_of_exported_interface_0_has_or_is_using_private_name_1_4022", "'extends' clause of exported interface '{0}' has or is using private name '{1}'."),
Exported_variable_0_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named: diag(4023, ts.DiagnosticCategory.Error, "Exported_variable_0_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named_4023", "Exported variable '{0}' has or is using name '{1}' from external module {2} but cannot be named."),
Exported_variable_0_has_or_is_using_name_1_from_private_module_2: diag(4024, ts.DiagnosticCategory.Error, "Exported_variable_0_has_or_is_using_name_1_from_private_module_2_4024", "Exported variable '{0}' has or is using name '{1}' from private module '{2}'."),
Exported_variable_0_has_or_is_using_private_name_1: diag(4025, ts.DiagnosticCategory.Error, "Exported_variable_0_has_or_is_using_private_name_1_4025", "Exported variable '{0}' has or is using private name '{1}'."),
Public_static_property_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named: diag(4026, ts.DiagnosticCategory.Error, "Public_static_property_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot__4026", "Public static property '{0}' of exported class has or is using name '{1}' from external module {2} but cannot be named."),
Public_static_property_0_of_exported_class_has_or_is_using_name_1_from_private_module_2: diag(4027, ts.DiagnosticCategory.Error, "Public_static_property_0_of_exported_class_has_or_is_using_name_1_from_private_module_2_4027", "Public static property '{0}' of exported class has or is using name '{1}' from private module '{2}'."),
Public_static_property_0_of_exported_class_has_or_is_using_private_name_1: diag(4028, ts.DiagnosticCategory.Error, "Public_static_property_0_of_exported_class_has_or_is_using_private_name_1_4028", "Public static property '{0}' of exported class has or is using private name '{1}'."),
Public_property_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named: diag(4029, ts.DiagnosticCategory.Error, "Public_property_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_name_4029", "Public property '{0}' of exported class has or is using name '{1}' from external module {2} but cannot be named."),
Public_property_0_of_exported_class_has_or_is_using_name_1_from_private_module_2: diag(4030, ts.DiagnosticCategory.Error, "Public_property_0_of_exported_class_has_or_is_using_name_1_from_private_module_2_4030", "Public property '{0}' of exported class has or is using name '{1}' from private module '{2}'."),
Public_property_0_of_exported_class_has_or_is_using_private_name_1: diag(4031, ts.DiagnosticCategory.Error, "Public_property_0_of_exported_class_has_or_is_using_private_name_1_4031", "Public property '{0}' of exported class has or is using private name '{1}'."),
Property_0_of_exported_interface_has_or_is_using_name_1_from_private_module_2: diag(4032, ts.DiagnosticCategory.Error, "Property_0_of_exported_interface_has_or_is_using_name_1_from_private_module_2_4032", "Property '{0}' of exported interface has or is using name '{1}' from private module '{2}'."),
Property_0_of_exported_interface_has_or_is_using_private_name_1: diag(4033, ts.DiagnosticCategory.Error, "Property_0_of_exported_interface_has_or_is_using_private_name_1_4033", "Property '{0}' of exported interface has or is using private name '{1}'."),
Parameter_type_of_public_static_setter_0_from_exported_class_has_or_is_using_name_1_from_private_module_2: diag(4034, ts.DiagnosticCategory.Error, "Parameter_type_of_public_static_setter_0_from_exported_class_has_or_is_using_name_1_from_private_mod_4034", "Parameter type of public static setter '{0}' from exported class has or is using name '{1}' from private module '{2}'."),
Parameter_type_of_public_static_setter_0_from_exported_class_has_or_is_using_private_name_1: diag(4035, ts.DiagnosticCategory.Error, "Parameter_type_of_public_static_setter_0_from_exported_class_has_or_is_using_private_name_1_4035", "Parameter type of public static setter '{0}' from exported class has or is using private name '{1}'."),
Parameter_type_of_public_setter_0_from_exported_class_has_or_is_using_name_1_from_private_module_2: diag(4036, ts.DiagnosticCategory.Error, "Parameter_type_of_public_setter_0_from_exported_class_has_or_is_using_name_1_from_private_module_2_4036", "Parameter type of public setter '{0}' from exported class has or is using name '{1}' from private module '{2}'."),
Parameter_type_of_public_setter_0_from_exported_class_has_or_is_using_private_name_1: diag(4037, ts.DiagnosticCategory.Error, "Parameter_type_of_public_setter_0_from_exported_class_has_or_is_using_private_name_1_4037", "Parameter type of public setter '{0}' from exported class has or is using private name '{1}'."),
Return_type_of_public_static_getter_0_from_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named: diag(4038, ts.DiagnosticCategory.Error, "Return_type_of_public_static_getter_0_from_exported_class_has_or_is_using_name_1_from_external_modul_4038", "Return type of public static getter '{0}' from exported class has or is using name '{1}' from external module {2} but cannot be named."),
Return_type_of_public_static_getter_0_from_exported_class_has_or_is_using_name_1_from_private_module_2: diag(4039, ts.DiagnosticCategory.Error, "Return_type_of_public_static_getter_0_from_exported_class_has_or_is_using_name_1_from_private_module_4039", "Return type of public static getter '{0}' from exported class has or is using name '{1}' from private module '{2}'."),
Return_type_of_public_static_getter_0_from_exported_class_has_or_is_using_private_name_1: diag(4040, ts.DiagnosticCategory.Error, "Return_type_of_public_static_getter_0_from_exported_class_has_or_is_using_private_name_1_4040", "Return type of public static getter '{0}' from exported class has or is using private name '{1}'."),
Return_type_of_public_getter_0_from_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named: diag(4041, ts.DiagnosticCategory.Error, "Return_type_of_public_getter_0_from_exported_class_has_or_is_using_name_1_from_external_module_2_but_4041", "Return type of public getter '{0}' from exported class has or is using name '{1}' from external module {2} but cannot be named."),
Return_type_of_public_getter_0_from_exported_class_has_or_is_using_name_1_from_private_module_2: diag(4042, ts.DiagnosticCategory.Error, "Return_type_of_public_getter_0_from_exported_class_has_or_is_using_name_1_from_private_module_2_4042", "Return type of public getter '{0}' from exported class has or is using name '{1}' from private module '{2}'."),
Return_type_of_public_getter_0_from_exported_class_has_or_is_using_private_name_1: diag(4043, ts.DiagnosticCategory.Error, "Return_type_of_public_getter_0_from_exported_class_has_or_is_using_private_name_1_4043", "Return type of public getter '{0}' from exported class has or is using private name '{1}'."),
Return_type_of_constructor_signature_from_exported_interface_has_or_is_using_name_0_from_private_module_1: diag(4044, ts.DiagnosticCategory.Error, "Return_type_of_constructor_signature_from_exported_interface_has_or_is_using_name_0_from_private_mod_4044", "Return type of constructor signature from exported interface has or is using name '{0}' from private module '{1}'."),
Return_type_of_constructor_signature_from_exported_interface_has_or_is_using_private_name_0: diag(4045, ts.DiagnosticCategory.Error, "Return_type_of_constructor_signature_from_exported_interface_has_or_is_using_private_name_0_4045", "Return type of constructor signature from exported interface has or is using private name '{0}'."),
Return_type_of_call_signature_from_exported_interface_has_or_is_using_name_0_from_private_module_1: diag(4046, ts.DiagnosticCategory.Error, "Return_type_of_call_signature_from_exported_interface_has_or_is_using_name_0_from_private_module_1_4046", "Return type of call signature from exported interface has or is using name '{0}' from private module '{1}'."),
Return_type_of_call_signature_from_exported_interface_has_or_is_using_private_name_0: diag(4047, ts.DiagnosticCategory.Error, "Return_type_of_call_signature_from_exported_interface_has_or_is_using_private_name_0_4047", "Return type of call signature from exported interface has or is using private name '{0}'."),
Return_type_of_index_signature_from_exported_interface_has_or_is_using_name_0_from_private_module_1: diag(4048, ts.DiagnosticCategory.Error, "Return_type_of_index_signature_from_exported_interface_has_or_is_using_name_0_from_private_module_1_4048", "Return type of index signature from exported interface has or is using name '{0}' from private module '{1}'."),
Return_type_of_index_signature_from_exported_interface_has_or_is_using_private_name_0: diag(4049, ts.DiagnosticCategory.Error, "Return_type_of_index_signature_from_exported_interface_has_or_is_using_private_name_0_4049", "Return type of index signature from exported interface has or is using private name '{0}'."),
Return_type_of_public_static_method_from_exported_class_has_or_is_using_name_0_from_external_module_1_but_cannot_be_named: diag(4050, ts.DiagnosticCategory.Error, "Return_type_of_public_static_method_from_exported_class_has_or_is_using_name_0_from_external_module__4050", "Return type of public static method from exported class has or is using name '{0}' from external module {1} but cannot be named."),
Return_type_of_public_static_method_from_exported_class_has_or_is_using_name_0_from_private_module_1: diag(4051, ts.DiagnosticCategory.Error, "Return_type_of_public_static_method_from_exported_class_has_or_is_using_name_0_from_private_module_1_4051", "Return type of public static method from exported class has or is using name '{0}' from private module '{1}'."),
Return_type_of_public_static_method_from_exported_class_has_or_is_using_private_name_0: diag(4052, ts.DiagnosticCategory.Error, "Return_type_of_public_static_method_from_exported_class_has_or_is_using_private_name_0_4052", "Return type of public static method from exported class has or is using private name '{0}'."),
Return_type_of_public_method_from_exported_class_has_or_is_using_name_0_from_external_module_1_but_cannot_be_named: diag(4053, ts.DiagnosticCategory.Error, "Return_type_of_public_method_from_exported_class_has_or_is_using_name_0_from_external_module_1_but_c_4053", "Return type of public method from exported class has or is using name '{0}' from external module {1} but cannot be named."),
Return_type_of_public_method_from_exported_class_has_or_is_using_name_0_from_private_module_1: diag(4054, ts.DiagnosticCategory.Error, "Return_type_of_public_method_from_exported_class_has_or_is_using_name_0_from_private_module_1_4054", "Return type of public method from exported class has or is using name '{0}' from private module '{1}'."),
Return_type_of_public_method_from_exported_class_has_or_is_using_private_name_0: diag(4055, ts.DiagnosticCategory.Error, "Return_type_of_public_method_from_exported_class_has_or_is_using_private_name_0_4055", "Return type of public method from exported class has or is using private name '{0}'."),
Return_type_of_method_from_exported_interface_has_or_is_using_name_0_from_private_module_1: diag(4056, ts.DiagnosticCategory.Error, "Return_type_of_method_from_exported_interface_has_or_is_using_name_0_from_private_module_1_4056", "Return type of method from exported interface has or is using name '{0}' from private module '{1}'."),
Return_type_of_method_from_exported_interface_has_or_is_using_private_name_0: diag(4057, ts.DiagnosticCategory.Error, "Return_type_of_method_from_exported_interface_has_or_is_using_private_name_0_4057", "Return type of method from exported interface has or is using private name '{0}'."),
Return_type_of_exported_function_has_or_is_using_name_0_from_external_module_1_but_cannot_be_named: diag(4058, ts.DiagnosticCategory.Error, "Return_type_of_exported_function_has_or_is_using_name_0_from_external_module_1_but_cannot_be_named_4058", "Return type of exported function has or is using name '{0}' from external module {1} but cannot be named."),
Return_type_of_exported_function_has_or_is_using_name_0_from_private_module_1: diag(4059, ts.DiagnosticCategory.Error, "Return_type_of_exported_function_has_or_is_using_name_0_from_private_module_1_4059", "Return type of exported function has or is using name '{0}' from private module '{1}'."),
Return_type_of_exported_function_has_or_is_using_private_name_0: diag(4060, ts.DiagnosticCategory.Error, "Return_type_of_exported_function_has_or_is_using_private_name_0_4060", "Return type of exported function has or is using private name '{0}'."),
Parameter_0_of_constructor_from_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named: diag(4061, ts.DiagnosticCategory.Error, "Parameter_0_of_constructor_from_exported_class_has_or_is_using_name_1_from_external_module_2_but_can_4061", "Parameter '{0}' of constructor from exported class has or is using name '{1}' from external module {2} but cannot be named."),
Parameter_0_of_constructor_from_exported_class_has_or_is_using_name_1_from_private_module_2: diag(4062, ts.DiagnosticCategory.Error, "Parameter_0_of_constructor_from_exported_class_has_or_is_using_name_1_from_private_module_2_4062", "Parameter '{0}' of constructor from exported class has or is using name '{1}' from private module '{2}'."),
Parameter_0_of_constructor_from_exported_class_has_or_is_using_private_name_1: diag(4063, ts.DiagnosticCategory.Error, "Parameter_0_of_constructor_from_exported_class_has_or_is_using_private_name_1_4063", "Parameter '{0}' of constructor from exported class has or is using private name '{1}'."),
Parameter_0_of_constructor_signature_from_exported_interface_has_or_is_using_name_1_from_private_module_2: diag(4064, ts.DiagnosticCategory.Error, "Parameter_0_of_constructor_signature_from_exported_interface_has_or_is_using_name_1_from_private_mod_4064", "Parameter '{0}' of constructor signature from exported interface has or is using name '{1}' from private module '{2}'."),
Parameter_0_of_constructor_signature_from_exported_interface_has_or_is_using_private_name_1: diag(4065, ts.DiagnosticCategory.Error, "Parameter_0_of_constructor_signature_from_exported_interface_has_or_is_using_private_name_1_4065", "Parameter '{0}' of constructor signature from exported interface has or is using private name '{1}'."),
Parameter_0_of_call_signature_from_exported_interface_has_or_is_using_name_1_from_private_module_2: diag(4066, ts.DiagnosticCategory.Error, "Parameter_0_of_call_signature_from_exported_interface_has_or_is_using_name_1_from_private_module_2_4066", "Parameter '{0}' of call signature from exported interface has or is using name '{1}' from private module '{2}'."),
Parameter_0_of_call_signature_from_exported_interface_has_or_is_using_private_name_1: diag(4067, ts.DiagnosticCategory.Error, "Parameter_0_of_call_signature_from_exported_interface_has_or_is_using_private_name_1_4067", "Parameter '{0}' of call signature from exported interface has or is using private name '{1}'."),
Parameter_0_of_public_static_method_from_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named: diag(4068, ts.DiagnosticCategory.Error, "Parameter_0_of_public_static_method_from_exported_class_has_or_is_using_name_1_from_external_module__4068", "Parameter '{0}' of public static method from exported class has or is using name '{1}' from external module {2} but cannot be named."),
Parameter_0_of_public_static_method_from_exported_class_has_or_is_using_name_1_from_private_module_2: diag(4069, ts.DiagnosticCategory.Error, "Parameter_0_of_public_static_method_from_exported_class_has_or_is_using_name_1_from_private_module_2_4069", "Parameter '{0}' of public static method from exported class has or is using name '{1}' from private module '{2}'."),
Parameter_0_of_public_static_method_from_exported_class_has_or_is_using_private_name_1: diag(4070, ts.DiagnosticCategory.Error, "Parameter_0_of_public_static_method_from_exported_class_has_or_is_using_private_name_1_4070", "Parameter '{0}' of public static method from exported class has or is using private name '{1}'."),
Parameter_0_of_public_method_from_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named: diag(4071, ts.DiagnosticCategory.Error, "Parameter_0_of_public_method_from_exported_class_has_or_is_using_name_1_from_external_module_2_but_c_4071", "Parameter '{0}' of public method from exported class has or is using name '{1}' from external module {2} but cannot be named."),
Parameter_0_of_public_method_from_exported_class_has_or_is_using_name_1_from_private_module_2: diag(4072, ts.DiagnosticCategory.Error, "Parameter_0_of_public_method_from_exported_class_has_or_is_using_name_1_from_private_module_2_4072", "Parameter '{0}' of public method from exported class has or is using name '{1}' from private module '{2}'."),
Parameter_0_of_public_method_from_exported_class_has_or_is_using_private_name_1: diag(4073, ts.DiagnosticCategory.Error, "Parameter_0_of_public_method_from_exported_class_has_or_is_using_private_name_1_4073", "Parameter '{0}' of public method from exported class has or is using private name '{1}'."),
Parameter_0_of_method_from_exported_interface_has_or_is_using_name_1_from_private_module_2: diag(4074, ts.DiagnosticCategory.Error, "Parameter_0_of_method_from_exported_interface_has_or_is_using_name_1_from_private_module_2_4074", "Parameter '{0}' of method from exported interface has or is using name '{1}' from private module '{2}'."),
Parameter_0_of_method_from_exported_interface_has_or_is_using_private_name_1: diag(4075, ts.DiagnosticCategory.Error, "Parameter_0_of_method_from_exported_interface_has_or_is_using_private_name_1_4075", "Parameter '{0}' of method from exported interface has or is using private name '{1}'."),
Parameter_0_of_exported_function_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named: diag(4076, ts.DiagnosticCategory.Error, "Parameter_0_of_exported_function_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named_4076", "Parameter '{0}' of exported function has or is using name '{1}' from external module {2} but cannot be named."),
Parameter_0_of_exported_function_has_or_is_using_name_1_from_private_module_2: diag(4077, ts.DiagnosticCategory.Error, "Parameter_0_of_exported_function_has_or_is_using_name_1_from_private_module_2_4077", "Parameter '{0}' of exported function has or is using name '{1}' from private module '{2}'."),
Parameter_0_of_exported_function_has_or_is_using_private_name_1: diag(4078, ts.DiagnosticCategory.Error, "Parameter_0_of_exported_function_has_or_is_using_private_name_1_4078", "Parameter '{0}' of exported function has or is using private name '{1}'."),
Exported_type_alias_0_has_or_is_using_private_name_1: diag(4081, ts.DiagnosticCategory.Error, "Exported_type_alias_0_has_or_is_using_private_name_1_4081", "Exported type alias '{0}' has or is using private name '{1}'."),
Default_export_of_the_module_has_or_is_using_private_name_0: diag(4082, ts.DiagnosticCategory.Error, "Default_export_of_the_module_has_or_is_using_private_name_0_4082", "Default export of the module has or is using private name '{0}'."),
Type_parameter_0_of_exported_type_alias_has_or_is_using_private_name_1: diag(4083, ts.DiagnosticCategory.Error, "Type_parameter_0_of_exported_type_alias_has_or_is_using_private_name_1_4083", "Type parameter '{0}' of exported type alias has or is using private name '{1}'."),
Exported_type_alias_0_has_or_is_using_private_name_1_from_module_2: diag(4084, ts.DiagnosticCategory.Error, "Exported_type_alias_0_has_or_is_using_private_name_1_from_module_2_4084", "Exported type alias '{0}' has or is using private name '{1}' from module {2}."),
Conflicting_definitions_for_0_found_at_1_and_2_Consider_installing_a_specific_version_of_this_library_to_resolve_the_conflict: diag(4090, ts.DiagnosticCategory.Error, "Conflicting_definitions_for_0_found_at_1_and_2_Consider_installing_a_specific_version_of_this_librar_4090", "Conflicting definitions for '{0}' found at '{1}' and '{2}'. Consider installing a specific version of this library to resolve the conflict."),
Parameter_0_of_index_signature_from_exported_interface_has_or_is_using_name_1_from_private_module_2: diag(4091, ts.DiagnosticCategory.Error, "Parameter_0_of_index_signature_from_exported_interface_has_or_is_using_name_1_from_private_module_2_4091", "Parameter '{0}' of index signature from exported interface has or is using name '{1}' from private module '{2}'."),
Parameter_0_of_index_signature_from_exported_interface_has_or_is_using_private_name_1: diag(4092, ts.DiagnosticCategory.Error, "Parameter_0_of_index_signature_from_exported_interface_has_or_is_using_private_name_1_4092", "Parameter '{0}' of index signature from exported interface has or is using private name '{1}'."),
Property_0_of_exported_class_expression_may_not_be_private_or_protected: diag(4094, ts.DiagnosticCategory.Error, "Property_0_of_exported_class_expression_may_not_be_private_or_protected_4094", "Property '{0}' of exported class expression may not be private or protected."),
Public_static_method_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named: diag(4095, ts.DiagnosticCategory.Error, "Public_static_method_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_4095", "Public static method '{0}' of exported class has or is using name '{1}' from external module {2} but cannot be named."),
Public_static_method_0_of_exported_class_has_or_is_using_name_1_from_private_module_2: diag(4096, ts.DiagnosticCategory.Error, "Public_static_method_0_of_exported_class_has_or_is_using_name_1_from_private_module_2_4096", "Public static method '{0}' of exported class has or is using name '{1}' from private module '{2}'."),
Public_static_method_0_of_exported_class_has_or_is_using_private_name_1: diag(4097, ts.DiagnosticCategory.Error, "Public_static_method_0_of_exported_class_has_or_is_using_private_name_1_4097", "Public static method '{0}' of exported class has or is using private name '{1}'."),
Public_method_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named: diag(4098, ts.DiagnosticCategory.Error, "Public_method_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named_4098", "Public method '{0}' of exported class has or is using name '{1}' from external module {2} but cannot be named."),
Public_method_0_of_exported_class_has_or_is_using_name_1_from_private_module_2: diag(4099, ts.DiagnosticCategory.Error, "Public_method_0_of_exported_class_has_or_is_using_name_1_from_private_module_2_4099", "Public method '{0}' of exported class has or is using name '{1}' from private module '{2}'."),
Public_method_0_of_exported_class_has_or_is_using_private_name_1: diag(4100, ts.DiagnosticCategory.Error, "Public_method_0_of_exported_class_has_or_is_using_private_name_1_4100", "Public method '{0}' of exported class has or is using private name '{1}'."),
Method_0_of_exported_interface_has_or_is_using_name_1_from_private_module_2: diag(4101, ts.DiagnosticCategory.Error, "Method_0_of_exported_interface_has_or_is_using_name_1_from_private_module_2_4101", "Method '{0}' of exported interface has or is using name '{1}' from private module '{2}'."),
Method_0_of_exported_interface_has_or_is_using_private_name_1: diag(4102, ts.DiagnosticCategory.Error, "Method_0_of_exported_interface_has_or_is_using_private_name_1_4102", "Method '{0}' of exported interface has or is using private name '{1}'."),
Type_parameter_0_of_exported_mapped_object_type_is_using_private_name_1: diag(4103, ts.DiagnosticCategory.Error, "Type_parameter_0_of_exported_mapped_object_type_is_using_private_name_1_4103", "Type parameter '{0}' of exported mapped object type is using private name '{1}'."),
The_type_0_is_readonly_and_cannot_be_assigned_to_the_mutable_type_1: diag(4104, ts.DiagnosticCategory.Error, "The_type_0_is_readonly_and_cannot_be_assigned_to_the_mutable_type_1_4104", "The type '{0}' is 'readonly' and cannot be assigned to the mutable type '{1}'."),
Private_or_protected_member_0_cannot_be_accessed_on_a_type_parameter: diag(4105, ts.DiagnosticCategory.Error, "Private_or_protected_member_0_cannot_be_accessed_on_a_type_parameter_4105", "Private or protected member '{0}' cannot be accessed on a type parameter."),
Parameter_0_of_accessor_has_or_is_using_private_name_1: diag(4106, ts.DiagnosticCategory.Error, "Parameter_0_of_accessor_has_or_is_using_private_name_1_4106", "Parameter '{0}' of accessor has or is using private name '{1}'."),
Parameter_0_of_accessor_has_or_is_using_name_1_from_private_module_2: diag(4107, ts.DiagnosticCategory.Error, "Parameter_0_of_accessor_has_or_is_using_name_1_from_private_module_2_4107", "Parameter '{0}' of accessor has or is using name '{1}' from private module '{2}'."),
Parameter_0_of_accessor_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named: diag(4108, ts.DiagnosticCategory.Error, "Parameter_0_of_accessor_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named_4108", "Parameter '{0}' of accessor has or is using name '{1}' from external module '{2}' but cannot be named."),
Type_arguments_for_0_circularly_reference_themselves: diag(4109, ts.DiagnosticCategory.Error, "Type_arguments_for_0_circularly_reference_themselves_4109", "Type arguments for '{0}' circularly reference themselves."),
Tuple_type_arguments_circularly_reference_themselves: diag(4110, ts.DiagnosticCategory.Error, "Tuple_type_arguments_circularly_reference_themselves_4110", "Tuple type arguments circularly reference themselves."),
Property_0_comes_from_an_index_signature_so_it_must_be_accessed_with_0: diag(4111, ts.DiagnosticCategory.Error, "Property_0_comes_from_an_index_signature_so_it_must_be_accessed_with_0_4111", "Property '{0}' comes from an index signature, so it must be accessed with ['{0}']."),
This_member_cannot_have_an_override_modifier_because_its_containing_class_0_does_not_extend_another_class: diag(4112, ts.DiagnosticCategory.Error, "This_member_cannot_have_an_override_modifier_because_its_containing_class_0_does_not_extend_another__4112", "This member cannot have an 'override' modifier because its containing class '{0}' does not extend another class."),
This_member_cannot_have_an_override_modifier_because_it_is_not_declared_in_the_base_class_0: diag(4113, ts.DiagnosticCategory.Error, "This_member_cannot_have_an_override_modifier_because_it_is_not_declared_in_the_base_class_0_4113", "This member cannot have an 'override' modifier because it is not declared in the base class '{0}'."),
This_member_must_have_an_override_modifier_because_it_overrides_a_member_in_the_base_class_0: diag(4114, ts.DiagnosticCategory.Error, "This_member_must_have_an_override_modifier_because_it_overrides_a_member_in_the_base_class_0_4114", "This member must have an 'override' modifier because it overrides a member in the base class '{0}'."),
This_parameter_property_must_have_an_override_modifier_because_it_overrides_a_member_in_base_class_0: diag(4115, ts.DiagnosticCategory.Error, "This_parameter_property_must_have_an_override_modifier_because_it_overrides_a_member_in_base_class_0_4115", "This parameter property must have an 'override' modifier because it overrides a member in base class '{0}'."),
This_member_must_have_an_override_modifier_because_it_overrides_an_abstract_method_that_is_declared_in_the_base_class_0: diag(4116, ts.DiagnosticCategory.Error, "This_member_must_have_an_override_modifier_because_it_overrides_an_abstract_method_that_is_declared__4116", "This member must have an 'override' modifier because it overrides an abstract method that is declared in the base class '{0}'."),
This_member_cannot_have_an_override_modifier_because_it_is_not_declared_in_the_base_class_0_Did_you_mean_1: diag(4117, ts.DiagnosticCategory.Error, "This_member_cannot_have_an_override_modifier_because_it_is_not_declared_in_the_base_class_0_Did_you__4117", "This member cannot have an 'override' modifier because it is not declared in the base class '{0}'. Did you mean '{1}'?"),
The_type_of_this_node_cannot_be_serialized_because_its_property_0_cannot_be_serialized: diag(4118, ts.DiagnosticCategory.Error, "The_type_of_this_node_cannot_be_serialized_because_its_property_0_cannot_be_serialized_4118", "The type of this node cannot be serialized because its property '{0}' cannot be serialized."),
The_current_host_does_not_support_the_0_option: diag(5001, ts.DiagnosticCategory.Error, "The_current_host_does_not_support_the_0_option_5001", "The current host does not support the '{0}' option."),
Cannot_find_the_common_subdirectory_path_for_the_input_files: diag(5009, ts.DiagnosticCategory.Error, "Cannot_find_the_common_subdirectory_path_for_the_input_files_5009", "Cannot find the common subdirectory path for the input files."),
File_specification_cannot_end_in_a_recursive_directory_wildcard_Asterisk_Asterisk_Colon_0: diag(5010, ts.DiagnosticCategory.Error, "File_specification_cannot_end_in_a_recursive_directory_wildcard_Asterisk_Asterisk_Colon_0_5010", "File specification cannot end in a recursive directory wildcard ('**'): '{0}'."),
Cannot_read_file_0_Colon_1: diag(5012, ts.DiagnosticCategory.Error, "Cannot_read_file_0_Colon_1_5012", "Cannot read file '{0}': {1}."),
Failed_to_parse_file_0_Colon_1: diag(5014, ts.DiagnosticCategory.Error, "Failed_to_parse_file_0_Colon_1_5014", "Failed to parse file '{0}': {1}."),
Unknown_compiler_option_0: diag(5023, ts.DiagnosticCategory.Error, "Unknown_compiler_option_0_5023", "Unknown compiler option '{0}'."),
Compiler_option_0_requires_a_value_of_type_1: diag(5024, ts.DiagnosticCategory.Error, "Compiler_option_0_requires_a_value_of_type_1_5024", "Compiler option '{0}' requires a value of type {1}."),
Unknown_compiler_option_0_Did_you_mean_1: diag(5025, ts.DiagnosticCategory.Error, "Unknown_compiler_option_0_Did_you_mean_1_5025", "Unknown compiler option '{0}'. Did you mean '{1}'?"),
Could_not_write_file_0_Colon_1: diag(5033, ts.DiagnosticCategory.Error, "Could_not_write_file_0_Colon_1_5033", "Could not write file '{0}': {1}."),
Option_project_cannot_be_mixed_with_source_files_on_a_command_line: diag(5042, ts.DiagnosticCategory.Error, "Option_project_cannot_be_mixed_with_source_files_on_a_command_line_5042", "Option 'project' cannot be mixed with source files on a command line."),
Option_isolatedModules_can_only_be_used_when_either_option_module_is_provided_or_option_target_is_ES2015_or_higher: diag(5047, ts.DiagnosticCategory.Error, "Option_isolatedModules_can_only_be_used_when_either_option_module_is_provided_or_option_target_is_ES_5047", "Option 'isolatedModules' can only be used when either option '--module' is provided or option 'target' is 'ES2015' or higher."),
Option_0_cannot_be_specified_when_option_target_is_ES3: diag(5048, ts.DiagnosticCategory.Error, "Option_0_cannot_be_specified_when_option_target_is_ES3_5048", "Option '{0}' cannot be specified when option 'target' is 'ES3'."),
Option_0_can_only_be_used_when_either_option_inlineSourceMap_or_option_sourceMap_is_provided: diag(5051, ts.DiagnosticCategory.Error, "Option_0_can_only_be_used_when_either_option_inlineSourceMap_or_option_sourceMap_is_provided_5051", "Option '{0} can only be used when either option '--inlineSourceMap' or option '--sourceMap' is provided."),
Option_0_cannot_be_specified_without_specifying_option_1: diag(5052, ts.DiagnosticCategory.Error, "Option_0_cannot_be_specified_without_specifying_option_1_5052", "Option '{0}' cannot be specified without specifying option '{1}'."),
Option_0_cannot_be_specified_with_option_1: diag(5053, ts.DiagnosticCategory.Error, "Option_0_cannot_be_specified_with_option_1_5053", "Option '{0}' cannot be specified with option '{1}'."),
A_tsconfig_json_file_is_already_defined_at_Colon_0: diag(5054, ts.DiagnosticCategory.Error, "A_tsconfig_json_file_is_already_defined_at_Colon_0_5054", "A 'tsconfig.json' file is already defined at: '{0}'."),
Cannot_write_file_0_because_it_would_overwrite_input_file: diag(5055, ts.DiagnosticCategory.Error, "Cannot_write_file_0_because_it_would_overwrite_input_file_5055", "Cannot write file '{0}' because it would overwrite input file."),
Cannot_write_file_0_because_it_would_be_overwritten_by_multiple_input_files: diag(5056, ts.DiagnosticCategory.Error, "Cannot_write_file_0_because_it_would_be_overwritten_by_multiple_input_files_5056", "Cannot write file '{0}' because it would be overwritten by multiple input files."),
Cannot_find_a_tsconfig_json_file_at_the_specified_directory_Colon_0: diag(5057, ts.DiagnosticCategory.Error, "Cannot_find_a_tsconfig_json_file_at_the_specified_directory_Colon_0_5057", "Cannot find a tsconfig.json file at the specified directory: '{0}'."),
The_specified_path_does_not_exist_Colon_0: diag(5058, ts.DiagnosticCategory.Error, "The_specified_path_does_not_exist_Colon_0_5058", "The specified path does not exist: '{0}'."),
Invalid_value_for_reactNamespace_0_is_not_a_valid_identifier: diag(5059, ts.DiagnosticCategory.Error, "Invalid_value_for_reactNamespace_0_is_not_a_valid_identifier_5059", "Invalid value for '--reactNamespace'. '{0}' is not a valid identifier."),
Pattern_0_can_have_at_most_one_Asterisk_character: diag(5061, ts.DiagnosticCategory.Error, "Pattern_0_can_have_at_most_one_Asterisk_character_5061", "Pattern '{0}' can have at most one '*' character."),
Substitution_0_in_pattern_1_can_have_at_most_one_Asterisk_character: diag(5062, ts.DiagnosticCategory.Error, "Substitution_0_in_pattern_1_can_have_at_most_one_Asterisk_character_5062", "Substitution '{0}' in pattern '{1}' can have at most one '*' character."),
Substitutions_for_pattern_0_should_be_an_array: diag(5063, ts.DiagnosticCategory.Error, "Substitutions_for_pattern_0_should_be_an_array_5063", "Substitutions for pattern '{0}' should be an array."),
Substitution_0_for_pattern_1_has_incorrect_type_expected_string_got_2: diag(5064, ts.DiagnosticCategory.Error, "Substitution_0_for_pattern_1_has_incorrect_type_expected_string_got_2_5064", "Substitution '{0}' for pattern '{1}' has incorrect type, expected 'string', got '{2}'."),
File_specification_cannot_contain_a_parent_directory_that_appears_after_a_recursive_directory_wildcard_Asterisk_Asterisk_Colon_0: diag(5065, ts.DiagnosticCategory.Error, "File_specification_cannot_contain_a_parent_directory_that_appears_after_a_recursive_directory_wildca_5065", "File specification cannot contain a parent directory ('..') that appears after a recursive directory wildcard ('**'): '{0}'."),
Substitutions_for_pattern_0_shouldn_t_be_an_empty_array: diag(5066, ts.DiagnosticCategory.Error, "Substitutions_for_pattern_0_shouldn_t_be_an_empty_array_5066", "Substitutions for pattern '{0}' shouldn't be an empty array."),
Invalid_value_for_jsxFactory_0_is_not_a_valid_identifier_or_qualified_name: diag(5067, ts.DiagnosticCategory.Error, "Invalid_value_for_jsxFactory_0_is_not_a_valid_identifier_or_qualified_name_5067", "Invalid value for 'jsxFactory'. '{0}' is not a valid identifier or qualified-name."),
Adding_a_tsconfig_json_file_will_help_organize_projects_that_contain_both_TypeScript_and_JavaScript_files_Learn_more_at_https_Colon_Slash_Slashaka_ms_Slashtsconfig: diag(5068, ts.DiagnosticCategory.Error, "Adding_a_tsconfig_json_file_will_help_organize_projects_that_contain_both_TypeScript_and_JavaScript__5068", "Adding a tsconfig.json file will help organize projects that contain both TypeScript and JavaScript files. Learn more at https://aka.ms/tsconfig."),
Option_0_cannot_be_specified_without_specifying_option_1_or_option_2: diag(5069, ts.DiagnosticCategory.Error, "Option_0_cannot_be_specified_without_specifying_option_1_or_option_2_5069", "Option '{0}' cannot be specified without specifying option '{1}' or option '{2}'."),
Option_resolveJsonModule_cannot_be_specified_without_node_module_resolution_strategy: diag(5070, ts.DiagnosticCategory.Error, "Option_resolveJsonModule_cannot_be_specified_without_node_module_resolution_strategy_5070", "Option '--resolveJsonModule' cannot be specified without 'node' module resolution strategy."),
Option_resolveJsonModule_can_only_be_specified_when_module_code_generation_is_commonjs_amd_es2015_or_esNext: diag(5071, ts.DiagnosticCategory.Error, "Option_resolveJsonModule_can_only_be_specified_when_module_code_generation_is_commonjs_amd_es2015_or_5071", "Option '--resolveJsonModule' can only be specified when module code generation is 'commonjs', 'amd', 'es2015' or 'esNext'."),
Unknown_build_option_0: diag(5072, ts.DiagnosticCategory.Error, "Unknown_build_option_0_5072", "Unknown build option '{0}'."),
Build_option_0_requires_a_value_of_type_1: diag(5073, ts.DiagnosticCategory.Error, "Build_option_0_requires_a_value_of_type_1_5073", "Build option '{0}' requires a value of type {1}."),
Option_incremental_can_only_be_specified_using_tsconfig_emitting_to_single_file_or_when_option_tsBuildInfoFile_is_specified: diag(5074, ts.DiagnosticCategory.Error, "Option_incremental_can_only_be_specified_using_tsconfig_emitting_to_single_file_or_when_option_tsBui_5074", "Option '--incremental' can only be specified using tsconfig, emitting to single file or when option '--tsBuildInfoFile' is specified."),
_0_is_assignable_to_the_constraint_of_type_1_but_1_could_be_instantiated_with_a_different_subtype_of_constraint_2: diag(5075, ts.DiagnosticCategory.Error, "_0_is_assignable_to_the_constraint_of_type_1_but_1_could_be_instantiated_with_a_different_subtype_of_5075", "'{0}' is assignable to the constraint of type '{1}', but '{1}' could be instantiated with a different subtype of constraint '{2}'."),
_0_and_1_operations_cannot_be_mixed_without_parentheses: diag(5076, ts.DiagnosticCategory.Error, "_0_and_1_operations_cannot_be_mixed_without_parentheses_5076", "'{0}' and '{1}' operations cannot be mixed without parentheses."),
Unknown_build_option_0_Did_you_mean_1: diag(5077, ts.DiagnosticCategory.Error, "Unknown_build_option_0_Did_you_mean_1_5077", "Unknown build option '{0}'. Did you mean '{1}'?"),
Unknown_watch_option_0: diag(5078, ts.DiagnosticCategory.Error, "Unknown_watch_option_0_5078", "Unknown watch option '{0}'."),
Unknown_watch_option_0_Did_you_mean_1: diag(5079, ts.DiagnosticCategory.Error, "Unknown_watch_option_0_Did_you_mean_1_5079", "Unknown watch option '{0}'. Did you mean '{1}'?"),
Watch_option_0_requires_a_value_of_type_1: diag(5080, ts.DiagnosticCategory.Error, "Watch_option_0_requires_a_value_of_type_1_5080", "Watch option '{0}' requires a value of type {1}."),
Cannot_find_a_tsconfig_json_file_at_the_current_directory_Colon_0: diag(5081, ts.DiagnosticCategory.Error, "Cannot_find_a_tsconfig_json_file_at_the_current_directory_Colon_0_5081", "Cannot find a tsconfig.json file at the current directory: {0}."),
_0_could_be_instantiated_with_an_arbitrary_type_which_could_be_unrelated_to_1: diag(5082, ts.DiagnosticCategory.Error, "_0_could_be_instantiated_with_an_arbitrary_type_which_could_be_unrelated_to_1_5082", "'{0}' could be instantiated with an arbitrary type which could be unrelated to '{1}'."),
Cannot_read_file_0: diag(5083, ts.DiagnosticCategory.Error, "Cannot_read_file_0_5083", "Cannot read file '{0}'."),
Tuple_members_must_all_have_names_or_all_not_have_names: diag(5084, ts.DiagnosticCategory.Error, "Tuple_members_must_all_have_names_or_all_not_have_names_5084", "Tuple members must all have names or all not have names."),
A_tuple_member_cannot_be_both_optional_and_rest: diag(5085, ts.DiagnosticCategory.Error, "A_tuple_member_cannot_be_both_optional_and_rest_5085", "A tuple member cannot be both optional and rest."),
A_labeled_tuple_element_is_declared_as_optional_with_a_question_mark_after_the_name_and_before_the_colon_rather_than_after_the_type: diag(5086, ts.DiagnosticCategory.Error, "A_labeled_tuple_element_is_declared_as_optional_with_a_question_mark_after_the_name_and_before_the_c_5086", "A labeled tuple element is declared as optional with a question mark after the name and before the colon, rather than after the type."),
A_labeled_tuple_element_is_declared_as_rest_with_a_before_the_name_rather_than_before_the_type: diag(5087, ts.DiagnosticCategory.Error, "A_labeled_tuple_element_is_declared_as_rest_with_a_before_the_name_rather_than_before_the_type_5087", "A labeled tuple element is declared as rest with a '...' before the name, rather than before the type."),
The_inferred_type_of_0_references_a_type_with_a_cyclic_structure_which_cannot_be_trivially_serialized_A_type_annotation_is_necessary: diag(5088, ts.DiagnosticCategory.Error, "The_inferred_type_of_0_references_a_type_with_a_cyclic_structure_which_cannot_be_trivially_serialize_5088", "The inferred type of '{0}' references a type with a cyclic structure which cannot be trivially serialized. A type annotation is necessary."),
Option_0_cannot_be_specified_when_option_jsx_is_1: diag(5089, ts.DiagnosticCategory.Error, "Option_0_cannot_be_specified_when_option_jsx_is_1_5089", "Option '{0}' cannot be specified when option 'jsx' is '{1}'."),
Non_relative_paths_are_not_allowed_when_baseUrl_is_not_set_Did_you_forget_a_leading_Slash: diag(5090, ts.DiagnosticCategory.Error, "Non_relative_paths_are_not_allowed_when_baseUrl_is_not_set_Did_you_forget_a_leading_Slash_5090", "Non-relative paths are not allowed when 'baseUrl' is not set. Did you forget a leading './'?"),
Option_preserveConstEnums_cannot_be_disabled_when_isolatedModules_is_enabled: diag(5091, ts.DiagnosticCategory.Error, "Option_preserveConstEnums_cannot_be_disabled_when_isolatedModules_is_enabled_5091", "Option 'preserveConstEnums' cannot be disabled when 'isolatedModules' is enabled."),
The_root_value_of_a_0_file_must_be_an_object: diag(5092, ts.DiagnosticCategory.Error, "The_root_value_of_a_0_file_must_be_an_object_5092", "The root value of a '{0}' file must be an object."),
Compiler_option_0_may_only_be_used_with_build: diag(5093, ts.DiagnosticCategory.Error, "Compiler_option_0_may_only_be_used_with_build_5093", "Compiler option '--{0}' may only be used with '--build'."),
Compiler_option_0_may_not_be_used_with_build: diag(5094, ts.DiagnosticCategory.Error, "Compiler_option_0_may_not_be_used_with_build_5094", "Compiler option '--{0}' may not be used with '--build'."),
Generates_a_sourcemap_for_each_corresponding_d_ts_file: diag(6000, ts.DiagnosticCategory.Message, "Generates_a_sourcemap_for_each_corresponding_d_ts_file_6000", "Generates a sourcemap for each corresponding '.d.ts' file."),
Concatenate_and_emit_output_to_single_file: diag(6001, ts.DiagnosticCategory.Message, "Concatenate_and_emit_output_to_single_file_6001", "Concatenate and emit output to single file."),
Generates_corresponding_d_ts_file: diag(6002, ts.DiagnosticCategory.Message, "Generates_corresponding_d_ts_file_6002", "Generates corresponding '.d.ts' file."),
Specify_the_location_where_debugger_should_locate_map_files_instead_of_generated_locations: diag(6655, ts.DiagnosticCategory.Message, "Specify_the_location_where_debugger_should_locate_map_files_instead_of_generated_locations_6655", "Specify the location where debugger should locate map files instead of generated locations."),
Specify_the_location_where_debugger_should_locate_TypeScript_files_instead_of_source_locations: diag(6004, ts.DiagnosticCategory.Message, "Specify_the_location_where_debugger_should_locate_TypeScript_files_instead_of_source_locations_6004", "Specify the location where debugger should locate TypeScript files instead of source locations."),
Watch_input_files: diag(6005, ts.DiagnosticCategory.Message, "Watch_input_files_6005", "Watch input files."),
Redirect_output_structure_to_the_directory: diag(6006, ts.DiagnosticCategory.Message, "Redirect_output_structure_to_the_directory_6006", "Redirect output structure to the directory."),
Do_not_erase_const_enum_declarations_in_generated_code: diag(6007, ts.DiagnosticCategory.Message, "Do_not_erase_const_enum_declarations_in_generated_code_6007", "Do not erase const enum declarations in generated code."),
Do_not_emit_outputs_if_any_errors_were_reported: diag(6008, ts.DiagnosticCategory.Message, "Do_not_emit_outputs_if_any_errors_were_reported_6008", "Do not emit outputs if any errors were reported."),
Do_not_emit_comments_to_output: diag(6009, ts.DiagnosticCategory.Message, "Do_not_emit_comments_to_output_6009", "Do not emit comments to output."),
Do_not_emit_outputs: diag(6010, ts.DiagnosticCategory.Message, "Do_not_emit_outputs_6010", "Do not emit outputs."),
Allow_default_imports_from_modules_with_no_default_export_This_does_not_affect_code_emit_just_typechecking: diag(6011, ts.DiagnosticCategory.Message, "Allow_default_imports_from_modules_with_no_default_export_This_does_not_affect_code_emit_just_typech_6011", "Allow default imports from modules with no default export. This does not affect code emit, just typechecking."),
Skip_type_checking_of_declaration_files: diag(6012, ts.DiagnosticCategory.Message, "Skip_type_checking_of_declaration_files_6012", "Skip type checking of declaration files."),
Do_not_resolve_the_real_path_of_symlinks: diag(6013, ts.DiagnosticCategory.Message, "Do_not_resolve_the_real_path_of_symlinks_6013", "Do not resolve the real path of symlinks."),
Only_emit_d_ts_declaration_files: diag(6014, ts.DiagnosticCategory.Message, "Only_emit_d_ts_declaration_files_6014", "Only emit '.d.ts' declaration files."),
Specify_ECMAScript_target_version: diag(6015, ts.DiagnosticCategory.Message, "Specify_ECMAScript_target_version_6015", "Specify ECMAScript target version."),
Specify_module_code_generation: diag(6016, ts.DiagnosticCategory.Message, "Specify_module_code_generation_6016", "Specify module code generation."),
Print_this_message: diag(6017, ts.DiagnosticCategory.Message, "Print_this_message_6017", "Print this message."),
Print_the_compiler_s_version: diag(6019, ts.DiagnosticCategory.Message, "Print_the_compiler_s_version_6019", "Print the compiler's version."),
Compile_the_project_given_the_path_to_its_configuration_file_or_to_a_folder_with_a_tsconfig_json: diag(6020, ts.DiagnosticCategory.Message, "Compile_the_project_given_the_path_to_its_configuration_file_or_to_a_folder_with_a_tsconfig_json_6020", "Compile the project given the path to its configuration file, or to a folder with a 'tsconfig.json'."),
Syntax_Colon_0: diag(6023, ts.DiagnosticCategory.Message, "Syntax_Colon_0_6023", "Syntax: {0}"),
options: diag(6024, ts.DiagnosticCategory.Message, "options_6024", "options"),
file: diag(6025, ts.DiagnosticCategory.Message, "file_6025", "file"),
Examples_Colon_0: diag(6026, ts.DiagnosticCategory.Message, "Examples_Colon_0_6026", "Examples: {0}"),
Options_Colon: diag(6027, ts.DiagnosticCategory.Message, "Options_Colon_6027", "Options:"),
Version_0: diag(6029, ts.DiagnosticCategory.Message, "Version_0_6029", "Version {0}"),
Insert_command_line_options_and_files_from_a_file: diag(6030, ts.DiagnosticCategory.Message, "Insert_command_line_options_and_files_from_a_file_6030", "Insert command line options and files from a file."),
Starting_compilation_in_watch_mode: diag(6031, ts.DiagnosticCategory.Message, "Starting_compilation_in_watch_mode_6031", "Starting compilation in watch mode..."),
File_change_detected_Starting_incremental_compilation: diag(6032, ts.DiagnosticCategory.Message, "File_change_detected_Starting_incremental_compilation_6032", "File change detected. Starting incremental compilation..."),
KIND: diag(6034, ts.DiagnosticCategory.Message, "KIND_6034", "KIND"),
FILE: diag(6035, ts.DiagnosticCategory.Message, "FILE_6035", "FILE"),
VERSION: diag(6036, ts.DiagnosticCategory.Message, "VERSION_6036", "VERSION"),
LOCATION: diag(6037, ts.DiagnosticCategory.Message, "LOCATION_6037", "LOCATION"),
DIRECTORY: diag(6038, ts.DiagnosticCategory.Message, "DIRECTORY_6038", "DIRECTORY"),
STRATEGY: diag(6039, ts.DiagnosticCategory.Message, "STRATEGY_6039", "STRATEGY"),
FILE_OR_DIRECTORY: diag(6040, ts.DiagnosticCategory.Message, "FILE_OR_DIRECTORY_6040", "FILE OR DIRECTORY"),
Generates_corresponding_map_file: diag(6043, ts.DiagnosticCategory.Message, "Generates_corresponding_map_file_6043", "Generates corresponding '.map' file."),
Compiler_option_0_expects_an_argument: diag(6044, ts.DiagnosticCategory.Error, "Compiler_option_0_expects_an_argument_6044", "Compiler option '{0}' expects an argument."),
Unterminated_quoted_string_in_response_file_0: diag(6045, ts.DiagnosticCategory.Error, "Unterminated_quoted_string_in_response_file_0_6045", "Unterminated quoted string in response file '{0}'."),
Argument_for_0_option_must_be_Colon_1: diag(6046, ts.DiagnosticCategory.Error, "Argument_for_0_option_must_be_Colon_1_6046", "Argument for '{0}' option must be: {1}."),
Locale_must_be_of_the_form_language_or_language_territory_For_example_0_or_1: diag(6048, ts.DiagnosticCategory.Error, "Locale_must_be_of_the_form_language_or_language_territory_For_example_0_or_1_6048", "Locale must be of the form <language> or <language>-<territory>. For example '{0}' or '{1}'."),
Unsupported_locale_0: diag(6049, ts.DiagnosticCategory.Error, "Unsupported_locale_0_6049", "Unsupported locale '{0}'."),
Unable_to_open_file_0: diag(6050, ts.DiagnosticCategory.Error, "Unable_to_open_file_0_6050", "Unable to open file '{0}'."),
Corrupted_locale_file_0: diag(6051, ts.DiagnosticCategory.Error, "Corrupted_locale_file_0_6051", "Corrupted locale file {0}."),
Raise_error_on_expressions_and_declarations_with_an_implied_any_type: diag(6052, ts.DiagnosticCategory.Message, "Raise_error_on_expressions_and_declarations_with_an_implied_any_type_6052", "Raise error on expressions and declarations with an implied 'any' type."),
File_0_not_found: diag(6053, ts.DiagnosticCategory.Error, "File_0_not_found_6053", "File '{0}' not found."),
File_0_has_an_unsupported_extension_The_only_supported_extensions_are_1: diag(6054, ts.DiagnosticCategory.Error, "File_0_has_an_unsupported_extension_The_only_supported_extensions_are_1_6054", "File '{0}' has an unsupported extension. The only supported extensions are {1}."),
Suppress_noImplicitAny_errors_for_indexing_objects_lacking_index_signatures: diag(6055, ts.DiagnosticCategory.Message, "Suppress_noImplicitAny_errors_for_indexing_objects_lacking_index_signatures_6055", "Suppress noImplicitAny errors for indexing objects lacking index signatures."),
Do_not_emit_declarations_for_code_that_has_an_internal_annotation: diag(6056, ts.DiagnosticCategory.Message, "Do_not_emit_declarations_for_code_that_has_an_internal_annotation_6056", "Do not emit declarations for code that has an '@internal' annotation."),
Specify_the_root_directory_of_input_files_Use_to_control_the_output_directory_structure_with_outDir: diag(6058, ts.DiagnosticCategory.Message, "Specify_the_root_directory_of_input_files_Use_to_control_the_output_directory_structure_with_outDir_6058", "Specify the root directory of input files. Use to control the output directory structure with --outDir."),
File_0_is_not_under_rootDir_1_rootDir_is_expected_to_contain_all_source_files: diag(6059, ts.DiagnosticCategory.Error, "File_0_is_not_under_rootDir_1_rootDir_is_expected_to_contain_all_source_files_6059", "File '{0}' is not under 'rootDir' '{1}'. 'rootDir' is expected to contain all source files."),
Specify_the_end_of_line_sequence_to_be_used_when_emitting_files_Colon_CRLF_dos_or_LF_unix: diag(6060, ts.DiagnosticCategory.Message, "Specify_the_end_of_line_sequence_to_be_used_when_emitting_files_Colon_CRLF_dos_or_LF_unix_6060", "Specify the end of line sequence to be used when emitting files: 'CRLF' (dos) or 'LF' (unix)."),
NEWLINE: diag(6061, ts.DiagnosticCategory.Message, "NEWLINE_6061", "NEWLINE"),
Option_0_can_only_be_specified_in_tsconfig_json_file_or_set_to_null_on_command_line: diag(6064, ts.DiagnosticCategory.Error, "Option_0_can_only_be_specified_in_tsconfig_json_file_or_set_to_null_on_command_line_6064", "Option '{0}' can only be specified in 'tsconfig.json' file or set to 'null' on command line."),
Enables_experimental_support_for_ES7_decorators: diag(6065, ts.DiagnosticCategory.Message, "Enables_experimental_support_for_ES7_decorators_6065", "Enables experimental support for ES7 decorators."),
Enables_experimental_support_for_emitting_type_metadata_for_decorators: diag(6066, ts.DiagnosticCategory.Message, "Enables_experimental_support_for_emitting_type_metadata_for_decorators_6066", "Enables experimental support for emitting type metadata for decorators."),
Enables_experimental_support_for_ES7_async_functions: diag(6068, ts.DiagnosticCategory.Message, "Enables_experimental_support_for_ES7_async_functions_6068", "Enables experimental support for ES7 async functions."),
Specify_module_resolution_strategy_Colon_node_Node_js_or_classic_TypeScript_pre_1_6: diag(6069, ts.DiagnosticCategory.Message, "Specify_module_resolution_strategy_Colon_node_Node_js_or_classic_TypeScript_pre_1_6_6069", "Specify module resolution strategy: 'node' (Node.js) or 'classic' (TypeScript pre-1.6)."),
Initializes_a_TypeScript_project_and_creates_a_tsconfig_json_file: diag(6070, ts.DiagnosticCategory.Message, "Initializes_a_TypeScript_project_and_creates_a_tsconfig_json_file_6070", "Initializes a TypeScript project and creates a tsconfig.json file."),
Successfully_created_a_tsconfig_json_file: diag(6071, ts.DiagnosticCategory.Message, "Successfully_created_a_tsconfig_json_file_6071", "Successfully created a tsconfig.json file."),
Suppress_excess_property_checks_for_object_literals: diag(6072, ts.DiagnosticCategory.Message, "Suppress_excess_property_checks_for_object_literals_6072", "Suppress excess property checks for object literals."),
Stylize_errors_and_messages_using_color_and_context_experimental: diag(6073, ts.DiagnosticCategory.Message, "Stylize_errors_and_messages_using_color_and_context_experimental_6073", "Stylize errors and messages using color and context (experimental)."),
Do_not_report_errors_on_unused_labels: diag(6074, ts.DiagnosticCategory.Message, "Do_not_report_errors_on_unused_labels_6074", "Do not report errors on unused labels."),
Report_error_when_not_all_code_paths_in_function_return_a_value: diag(6075, ts.DiagnosticCategory.Message, "Report_error_when_not_all_code_paths_in_function_return_a_value_6075", "Report error when not all code paths in function return a value."),
Report_errors_for_fallthrough_cases_in_switch_statement: diag(6076, ts.DiagnosticCategory.Message, "Report_errors_for_fallthrough_cases_in_switch_statement_6076", "Report errors for fallthrough cases in switch statement."),
Do_not_report_errors_on_unreachable_code: diag(6077, ts.DiagnosticCategory.Message, "Do_not_report_errors_on_unreachable_code_6077", "Do not report errors on unreachable code."),
Disallow_inconsistently_cased_references_to_the_same_file: diag(6078, ts.DiagnosticCategory.Message, "Disallow_inconsistently_cased_references_to_the_same_file_6078", "Disallow inconsistently-cased references to the same file."),
Specify_library_files_to_be_included_in_the_compilation: diag(6079, ts.DiagnosticCategory.Message, "Specify_library_files_to_be_included_in_the_compilation_6079", "Specify library files to be included in the compilation."),
Specify_JSX_code_generation: diag(6080, ts.DiagnosticCategory.Message, "Specify_JSX_code_generation_6080", "Specify JSX code generation."),
File_0_has_an_unsupported_extension_so_skipping_it: diag(6081, ts.DiagnosticCategory.Message, "File_0_has_an_unsupported_extension_so_skipping_it_6081", "File '{0}' has an unsupported extension, so skipping it."),
Only_amd_and_system_modules_are_supported_alongside_0: diag(6082, ts.DiagnosticCategory.Error, "Only_amd_and_system_modules_are_supported_alongside_0_6082", "Only 'amd' and 'system' modules are supported alongside --{0}."),
Base_directory_to_resolve_non_absolute_module_names: diag(6083, ts.DiagnosticCategory.Message, "Base_directory_to_resolve_non_absolute_module_names_6083", "Base directory to resolve non-absolute module names."),
Deprecated_Use_jsxFactory_instead_Specify_the_object_invoked_for_createElement_when_targeting_react_JSX_emit: diag(6084, ts.DiagnosticCategory.Message, "Deprecated_Use_jsxFactory_instead_Specify_the_object_invoked_for_createElement_when_targeting_react__6084", "[Deprecated] Use '--jsxFactory' instead. Specify the object invoked for createElement when targeting 'react' JSX emit"),
Enable_tracing_of_the_name_resolution_process: diag(6085, ts.DiagnosticCategory.Message, "Enable_tracing_of_the_name_resolution_process_6085", "Enable tracing of the name resolution process."),
Resolving_module_0_from_1: diag(6086, ts.DiagnosticCategory.Message, "Resolving_module_0_from_1_6086", "======== Resolving module '{0}' from '{1}'. ========"),
Explicitly_specified_module_resolution_kind_Colon_0: diag(6087, ts.DiagnosticCategory.Message, "Explicitly_specified_module_resolution_kind_Colon_0_6087", "Explicitly specified module resolution kind: '{0}'."),
Module_resolution_kind_is_not_specified_using_0: diag(6088, ts.DiagnosticCategory.Message, "Module_resolution_kind_is_not_specified_using_0_6088", "Module resolution kind is not specified, using '{0}'."),
Module_name_0_was_successfully_resolved_to_1: diag(6089, ts.DiagnosticCategory.Message, "Module_name_0_was_successfully_resolved_to_1_6089", "======== Module name '{0}' was successfully resolved to '{1}'. ========"),
Module_name_0_was_not_resolved: diag(6090, ts.DiagnosticCategory.Message, "Module_name_0_was_not_resolved_6090", "======== Module name '{0}' was not resolved. ========"),
paths_option_is_specified_looking_for_a_pattern_to_match_module_name_0: diag(6091, ts.DiagnosticCategory.Message, "paths_option_is_specified_looking_for_a_pattern_to_match_module_name_0_6091", "'paths' option is specified, looking for a pattern to match module name '{0}'."),
Module_name_0_matched_pattern_1: diag(6092, ts.DiagnosticCategory.Message, "Module_name_0_matched_pattern_1_6092", "Module name '{0}', matched pattern '{1}'."),
Trying_substitution_0_candidate_module_location_Colon_1: diag(6093, ts.DiagnosticCategory.Message, "Trying_substitution_0_candidate_module_location_Colon_1_6093", "Trying substitution '{0}', candidate module location: '{1}'."),
Resolving_module_name_0_relative_to_base_url_1_2: diag(6094, ts.DiagnosticCategory.Message, "Resolving_module_name_0_relative_to_base_url_1_2_6094", "Resolving module name '{0}' relative to base url '{1}' - '{2}'."),
Loading_module_as_file_Slash_folder_candidate_module_location_0_target_file_type_1: diag(6095, ts.DiagnosticCategory.Message, "Loading_module_as_file_Slash_folder_candidate_module_location_0_target_file_type_1_6095", "Loading module as file / folder, candidate module location '{0}', target file type '{1}'."),
File_0_does_not_exist: diag(6096, ts.DiagnosticCategory.Message, "File_0_does_not_exist_6096", "File '{0}' does not exist."),
File_0_exist_use_it_as_a_name_resolution_result: diag(6097, ts.DiagnosticCategory.Message, "File_0_exist_use_it_as_a_name_resolution_result_6097", "File '{0}' exist - use it as a name resolution result."),
Loading_module_0_from_node_modules_folder_target_file_type_1: diag(6098, ts.DiagnosticCategory.Message, "Loading_module_0_from_node_modules_folder_target_file_type_1_6098", "Loading module '{0}' from 'node_modules' folder, target file type '{1}'."),
Found_package_json_at_0: diag(6099, ts.DiagnosticCategory.Message, "Found_package_json_at_0_6099", "Found 'package.json' at '{0}'."),
package_json_does_not_have_a_0_field: diag(6100, ts.DiagnosticCategory.Message, "package_json_does_not_have_a_0_field_6100", "'package.json' does not have a '{0}' field."),
package_json_has_0_field_1_that_references_2: diag(6101, ts.DiagnosticCategory.Message, "package_json_has_0_field_1_that_references_2_6101", "'package.json' has '{0}' field '{1}' that references '{2}'."),
Allow_javascript_files_to_be_compiled: diag(6102, ts.DiagnosticCategory.Message, "Allow_javascript_files_to_be_compiled_6102", "Allow javascript files to be compiled."),
Option_0_should_have_array_of_strings_as_a_value: diag(6103, ts.DiagnosticCategory.Error, "Option_0_should_have_array_of_strings_as_a_value_6103", "Option '{0}' should have array of strings as a value."),
Checking_if_0_is_the_longest_matching_prefix_for_1_2: diag(6104, ts.DiagnosticCategory.Message, "Checking_if_0_is_the_longest_matching_prefix_for_1_2_6104", "Checking if '{0}' is the longest matching prefix for '{1}' - '{2}'."),
Expected_type_of_0_field_in_package_json_to_be_1_got_2: diag(6105, ts.DiagnosticCategory.Message, "Expected_type_of_0_field_in_package_json_to_be_1_got_2_6105", "Expected type of '{0}' field in 'package.json' to be '{1}', got '{2}'."),
baseUrl_option_is_set_to_0_using_this_value_to_resolve_non_relative_module_name_1: diag(6106, ts.DiagnosticCategory.Message, "baseUrl_option_is_set_to_0_using_this_value_to_resolve_non_relative_module_name_1_6106", "'baseUrl' option is set to '{0}', using this value to resolve non-relative module name '{1}'."),
rootDirs_option_is_set_using_it_to_resolve_relative_module_name_0: diag(6107, ts.DiagnosticCategory.Message, "rootDirs_option_is_set_using_it_to_resolve_relative_module_name_0_6107", "'rootDirs' option is set, using it to resolve relative module name '{0}'."),
Longest_matching_prefix_for_0_is_1: diag(6108, ts.DiagnosticCategory.Message, "Longest_matching_prefix_for_0_is_1_6108", "Longest matching prefix for '{0}' is '{1}'."),
Loading_0_from_the_root_dir_1_candidate_location_2: diag(6109, ts.DiagnosticCategory.Message, "Loading_0_from_the_root_dir_1_candidate_location_2_6109", "Loading '{0}' from the root dir '{1}', candidate location '{2}'."),
Trying_other_entries_in_rootDirs: diag(6110, ts.DiagnosticCategory.Message, "Trying_other_entries_in_rootDirs_6110", "Trying other entries in 'rootDirs'."),
Module_resolution_using_rootDirs_has_failed: diag(6111, ts.DiagnosticCategory.Message, "Module_resolution_using_rootDirs_has_failed_6111", "Module resolution using 'rootDirs' has failed."),
Do_not_emit_use_strict_directives_in_module_output: diag(6112, ts.DiagnosticCategory.Message, "Do_not_emit_use_strict_directives_in_module_output_6112", "Do not emit 'use strict' directives in module output."),
Enable_strict_null_checks: diag(6113, ts.DiagnosticCategory.Message, "Enable_strict_null_checks_6113", "Enable strict null checks."),
Unknown_option_excludes_Did_you_mean_exclude: diag(6114, ts.DiagnosticCategory.Error, "Unknown_option_excludes_Did_you_mean_exclude_6114", "Unknown option 'excludes'. Did you mean 'exclude'?"),
Raise_error_on_this_expressions_with_an_implied_any_type: diag(6115, ts.DiagnosticCategory.Message, "Raise_error_on_this_expressions_with_an_implied_any_type_6115", "Raise error on 'this' expressions with an implied 'any' type."),
Resolving_type_reference_directive_0_containing_file_1_root_directory_2: diag(6116, ts.DiagnosticCategory.Message, "Resolving_type_reference_directive_0_containing_file_1_root_directory_2_6116", "======== Resolving type reference directive '{0}', containing file '{1}', root directory '{2}'. ========"),
Resolving_using_primary_search_paths: diag(6117, ts.DiagnosticCategory.Message, "Resolving_using_primary_search_paths_6117", "Resolving using primary search paths..."),
Resolving_from_node_modules_folder: diag(6118, ts.DiagnosticCategory.Message, "Resolving_from_node_modules_folder_6118", "Resolving from node_modules folder..."),
Type_reference_directive_0_was_successfully_resolved_to_1_primary_Colon_2: diag(6119, ts.DiagnosticCategory.Message, "Type_reference_directive_0_was_successfully_resolved_to_1_primary_Colon_2_6119", "======== Type reference directive '{0}' was successfully resolved to '{1}', primary: {2}. ========"),
Type_reference_directive_0_was_not_resolved: diag(6120, ts.DiagnosticCategory.Message, "Type_reference_directive_0_was_not_resolved_6120", "======== Type reference directive '{0}' was not resolved. ========"),
Resolving_with_primary_search_path_0: diag(6121, ts.DiagnosticCategory.Message, "Resolving_with_primary_search_path_0_6121", "Resolving with primary search path '{0}'."),
Root_directory_cannot_be_determined_skipping_primary_search_paths: diag(6122, ts.DiagnosticCategory.Message, "Root_directory_cannot_be_determined_skipping_primary_search_paths_6122", "Root directory cannot be determined, skipping primary search paths."),
Resolving_type_reference_directive_0_containing_file_1_root_directory_not_set: diag(6123, ts.DiagnosticCategory.Message, "Resolving_type_reference_directive_0_containing_file_1_root_directory_not_set_6123", "======== Resolving type reference directive '{0}', containing file '{1}', root directory not set. ========"),
Type_declaration_files_to_be_included_in_compilation: diag(6124, ts.DiagnosticCategory.Message, "Type_declaration_files_to_be_included_in_compilation_6124", "Type declaration files to be included in compilation."),
Looking_up_in_node_modules_folder_initial_location_0: diag(6125, ts.DiagnosticCategory.Message, "Looking_up_in_node_modules_folder_initial_location_0_6125", "Looking up in 'node_modules' folder, initial location '{0}'."),
Containing_file_is_not_specified_and_root_directory_cannot_be_determined_skipping_lookup_in_node_modules_folder: diag(6126, ts.DiagnosticCategory.Message, "Containing_file_is_not_specified_and_root_directory_cannot_be_determined_skipping_lookup_in_node_mod_6126", "Containing file is not specified and root directory cannot be determined, skipping lookup in 'node_modules' folder."),
Resolving_type_reference_directive_0_containing_file_not_set_root_directory_1: diag(6127, ts.DiagnosticCategory.Message, "Resolving_type_reference_directive_0_containing_file_not_set_root_directory_1_6127", "======== Resolving type reference directive '{0}', containing file not set, root directory '{1}'. ========"),
Resolving_type_reference_directive_0_containing_file_not_set_root_directory_not_set: diag(6128, ts.DiagnosticCategory.Message, "Resolving_type_reference_directive_0_containing_file_not_set_root_directory_not_set_6128", "======== Resolving type reference directive '{0}', containing file not set, root directory not set. ========"),
Resolving_real_path_for_0_result_1: diag(6130, ts.DiagnosticCategory.Message, "Resolving_real_path_for_0_result_1_6130", "Resolving real path for '{0}', result '{1}'."),
Cannot_compile_modules_using_option_0_unless_the_module_flag_is_amd_or_system: diag(6131, ts.DiagnosticCategory.Error, "Cannot_compile_modules_using_option_0_unless_the_module_flag_is_amd_or_system_6131", "Cannot compile modules using option '{0}' unless the '--module' flag is 'amd' or 'system'."),
File_name_0_has_a_1_extension_stripping_it: diag(6132, ts.DiagnosticCategory.Message, "File_name_0_has_a_1_extension_stripping_it_6132", "File name '{0}' has a '{1}' extension - stripping it."),
_0_is_declared_but_its_value_is_never_read: diag(6133, ts.DiagnosticCategory.Error, "_0_is_declared_but_its_value_is_never_read_6133", "'{0}' is declared but its value is never read.", /*reportsUnnecessary*/ true),
Report_errors_on_unused_locals: diag(6134, ts.DiagnosticCategory.Message, "Report_errors_on_unused_locals_6134", "Report errors on unused locals."),
Report_errors_on_unused_parameters: diag(6135, ts.DiagnosticCategory.Message, "Report_errors_on_unused_parameters_6135", "Report errors on unused parameters."),
The_maximum_dependency_depth_to_search_under_node_modules_and_load_JavaScript_files: diag(6136, ts.DiagnosticCategory.Message, "The_maximum_dependency_depth_to_search_under_node_modules_and_load_JavaScript_files_6136", "The maximum dependency depth to search under node_modules and load JavaScript files."),
Cannot_import_type_declaration_files_Consider_importing_0_instead_of_1: diag(6137, ts.DiagnosticCategory.Error, "Cannot_import_type_declaration_files_Consider_importing_0_instead_of_1_6137", "Cannot import type declaration files. Consider importing '{0}' instead of '{1}'."),
Property_0_is_declared_but_its_value_is_never_read: diag(6138, ts.DiagnosticCategory.Error, "Property_0_is_declared_but_its_value_is_never_read_6138", "Property '{0}' is declared but its value is never read.", /*reportsUnnecessary*/ true),
Import_emit_helpers_from_tslib: diag(6139, ts.DiagnosticCategory.Message, "Import_emit_helpers_from_tslib_6139", "Import emit helpers from 'tslib'."),
Auto_discovery_for_typings_is_enabled_in_project_0_Running_extra_resolution_pass_for_module_1_using_cache_location_2: diag(6140, ts.DiagnosticCategory.Error, "Auto_discovery_for_typings_is_enabled_in_project_0_Running_extra_resolution_pass_for_module_1_using__6140", "Auto discovery for typings is enabled in project '{0}'. Running extra resolution pass for module '{1}' using cache location '{2}'."),
Parse_in_strict_mode_and_emit_use_strict_for_each_source_file: diag(6141, ts.DiagnosticCategory.Message, "Parse_in_strict_mode_and_emit_use_strict_for_each_source_file_6141", "Parse in strict mode and emit \"use strict\" for each source file."),
Module_0_was_resolved_to_1_but_jsx_is_not_set: diag(6142, ts.DiagnosticCategory.Error, "Module_0_was_resolved_to_1_but_jsx_is_not_set_6142", "Module '{0}' was resolved to '{1}', but '--jsx' is not set."),
Module_0_was_resolved_as_locally_declared_ambient_module_in_file_1: diag(6144, ts.DiagnosticCategory.Message, "Module_0_was_resolved_as_locally_declared_ambient_module_in_file_1_6144", "Module '{0}' was resolved as locally declared ambient module in file '{1}'."),
Module_0_was_resolved_as_ambient_module_declared_in_1_since_this_file_was_not_modified: diag(6145, ts.DiagnosticCategory.Message, "Module_0_was_resolved_as_ambient_module_declared_in_1_since_this_file_was_not_modified_6145", "Module '{0}' was resolved as ambient module declared in '{1}' since this file was not modified."),
Specify_the_JSX_factory_function_to_use_when_targeting_react_JSX_emit_e_g_React_createElement_or_h: diag(6146, ts.DiagnosticCategory.Message, "Specify_the_JSX_factory_function_to_use_when_targeting_react_JSX_emit_e_g_React_createElement_or_h_6146", "Specify the JSX factory function to use when targeting 'react' JSX emit, e.g. 'React.createElement' or 'h'."),
Resolution_for_module_0_was_found_in_cache_from_location_1: diag(6147, ts.DiagnosticCategory.Message, "Resolution_for_module_0_was_found_in_cache_from_location_1_6147", "Resolution for module '{0}' was found in cache from location '{1}'."),
Directory_0_does_not_exist_skipping_all_lookups_in_it: diag(6148, ts.DiagnosticCategory.Message, "Directory_0_does_not_exist_skipping_all_lookups_in_it_6148", "Directory '{0}' does not exist, skipping all lookups in it."),
Show_diagnostic_information: diag(6149, ts.DiagnosticCategory.Message, "Show_diagnostic_information_6149", "Show diagnostic information."),
Show_verbose_diagnostic_information: diag(6150, ts.DiagnosticCategory.Message, "Show_verbose_diagnostic_information_6150", "Show verbose diagnostic information."),
Emit_a_single_file_with_source_maps_instead_of_having_a_separate_file: diag(6151, ts.DiagnosticCategory.Message, "Emit_a_single_file_with_source_maps_instead_of_having_a_separate_file_6151", "Emit a single file with source maps instead of having a separate file."),
Emit_the_source_alongside_the_sourcemaps_within_a_single_file_requires_inlineSourceMap_or_sourceMap_to_be_set: diag(6152, ts.DiagnosticCategory.Message, "Emit_the_source_alongside_the_sourcemaps_within_a_single_file_requires_inlineSourceMap_or_sourceMap__6152", "Emit the source alongside the sourcemaps within a single file; requires '--inlineSourceMap' or '--sourceMap' to be set."),
Transpile_each_file_as_a_separate_module_similar_to_ts_transpileModule: diag(6153, ts.DiagnosticCategory.Message, "Transpile_each_file_as_a_separate_module_similar_to_ts_transpileModule_6153", "Transpile each file as a separate module (similar to 'ts.transpileModule')."),
Print_names_of_generated_files_part_of_the_compilation: diag(6154, ts.DiagnosticCategory.Message, "Print_names_of_generated_files_part_of_the_compilation_6154", "Print names of generated files part of the compilation."),
Print_names_of_files_part_of_the_compilation: diag(6155, ts.DiagnosticCategory.Message, "Print_names_of_files_part_of_the_compilation_6155", "Print names of files part of the compilation."),
The_locale_used_when_displaying_messages_to_the_user_e_g_en_us: diag(6156, ts.DiagnosticCategory.Message, "The_locale_used_when_displaying_messages_to_the_user_e_g_en_us_6156", "The locale used when displaying messages to the user (e.g. 'en-us')"),
Do_not_generate_custom_helper_functions_like_extends_in_compiled_output: diag(6157, ts.DiagnosticCategory.Message, "Do_not_generate_custom_helper_functions_like_extends_in_compiled_output_6157", "Do not generate custom helper functions like '__extends' in compiled output."),
Do_not_include_the_default_library_file_lib_d_ts: diag(6158, ts.DiagnosticCategory.Message, "Do_not_include_the_default_library_file_lib_d_ts_6158", "Do not include the default library file (lib.d.ts)."),
Do_not_add_triple_slash_references_or_imported_modules_to_the_list_of_compiled_files: diag(6159, ts.DiagnosticCategory.Message, "Do_not_add_triple_slash_references_or_imported_modules_to_the_list_of_compiled_files_6159", "Do not add triple-slash references or imported modules to the list of compiled files."),
Deprecated_Use_skipLibCheck_instead_Skip_type_checking_of_default_library_declaration_files: diag(6160, ts.DiagnosticCategory.Message, "Deprecated_Use_skipLibCheck_instead_Skip_type_checking_of_default_library_declaration_files_6160", "[Deprecated] Use '--skipLibCheck' instead. Skip type checking of default library declaration files."),
List_of_folders_to_include_type_definitions_from: diag(6161, ts.DiagnosticCategory.Message, "List_of_folders_to_include_type_definitions_from_6161", "List of folders to include type definitions from."),
Disable_size_limitations_on_JavaScript_projects: diag(6162, ts.DiagnosticCategory.Message, "Disable_size_limitations_on_JavaScript_projects_6162", "Disable size limitations on JavaScript projects."),
The_character_set_of_the_input_files: diag(6163, ts.DiagnosticCategory.Message, "The_character_set_of_the_input_files_6163", "The character set of the input files."),
Emit_a_UTF_8_Byte_Order_Mark_BOM_in_the_beginning_of_output_files: diag(6622, ts.DiagnosticCategory.Message, "Emit_a_UTF_8_Byte_Order_Mark_BOM_in_the_beginning_of_output_files_6622", "Emit a UTF-8 Byte Order Mark (BOM) in the beginning of output files."),
Do_not_truncate_error_messages: diag(6165, ts.DiagnosticCategory.Message, "Do_not_truncate_error_messages_6165", "Do not truncate error messages."),
Output_directory_for_generated_declaration_files: diag(6166, ts.DiagnosticCategory.Message, "Output_directory_for_generated_declaration_files_6166", "Output directory for generated declaration files."),
A_series_of_entries_which_re_map_imports_to_lookup_locations_relative_to_the_baseUrl: diag(6167, ts.DiagnosticCategory.Message, "A_series_of_entries_which_re_map_imports_to_lookup_locations_relative_to_the_baseUrl_6167", "A series of entries which re-map imports to lookup locations relative to the 'baseUrl'."),
List_of_root_folders_whose_combined_content_represents_the_structure_of_the_project_at_runtime: diag(6168, ts.DiagnosticCategory.Message, "List_of_root_folders_whose_combined_content_represents_the_structure_of_the_project_at_runtime_6168", "List of root folders whose combined content represents the structure of the project at runtime."),
Show_all_compiler_options: diag(6169, ts.DiagnosticCategory.Message, "Show_all_compiler_options_6169", "Show all compiler options."),
Deprecated_Use_outFile_instead_Concatenate_and_emit_output_to_single_file: diag(6170, ts.DiagnosticCategory.Message, "Deprecated_Use_outFile_instead_Concatenate_and_emit_output_to_single_file_6170", "[Deprecated] Use '--outFile' instead. Concatenate and emit output to single file"),
Command_line_Options: diag(6171, ts.DiagnosticCategory.Message, "Command_line_Options_6171", "Command-line Options"),
Provide_full_support_for_iterables_in_for_of_spread_and_destructuring_when_targeting_ES5_or_ES3: diag(6179, ts.DiagnosticCategory.Message, "Provide_full_support_for_iterables_in_for_of_spread_and_destructuring_when_targeting_ES5_or_ES3_6179", "Provide full support for iterables in 'for-of', spread, and destructuring when targeting 'ES5' or 'ES3'."),
Enable_all_strict_type_checking_options: diag(6180, ts.DiagnosticCategory.Message, "Enable_all_strict_type_checking_options_6180", "Enable all strict type-checking options."),
List_of_language_service_plugins: diag(6181, ts.DiagnosticCategory.Message, "List_of_language_service_plugins_6181", "List of language service plugins."),
Scoped_package_detected_looking_in_0: diag(6182, ts.DiagnosticCategory.Message, "Scoped_package_detected_looking_in_0_6182", "Scoped package detected, looking in '{0}'"),
Reusing_resolution_of_module_0_from_1_of_old_program_it_was_successfully_resolved_to_2: diag(6183, ts.DiagnosticCategory.Message, "Reusing_resolution_of_module_0_from_1_of_old_program_it_was_successfully_resolved_to_2_6183", "Reusing resolution of module '{0}' from '{1}' of old program, it was successfully resolved to '{2}'."),
Reusing_resolution_of_module_0_from_1_of_old_program_it_was_successfully_resolved_to_2_with_Package_ID_3: diag(6184, ts.DiagnosticCategory.Message, "Reusing_resolution_of_module_0_from_1_of_old_program_it_was_successfully_resolved_to_2_with_Package__6184", "Reusing resolution of module '{0}' from '{1}' of old program, it was successfully resolved to '{2}' with Package ID '{3}'."),
Enable_strict_checking_of_function_types: diag(6186, ts.DiagnosticCategory.Message, "Enable_strict_checking_of_function_types_6186", "Enable strict checking of function types."),
Enable_strict_checking_of_property_initialization_in_classes: diag(6187, ts.DiagnosticCategory.Message, "Enable_strict_checking_of_property_initialization_in_classes_6187", "Enable strict checking of property initialization in classes."),
Numeric_separators_are_not_allowed_here: diag(6188, ts.DiagnosticCategory.Error, "Numeric_separators_are_not_allowed_here_6188", "Numeric separators are not allowed here."),
Multiple_consecutive_numeric_separators_are_not_permitted: diag(6189, ts.DiagnosticCategory.Error, "Multiple_consecutive_numeric_separators_are_not_permitted_6189", "Multiple consecutive numeric separators are not permitted."),
Whether_to_keep_outdated_console_output_in_watch_mode_instead_of_clearing_the_screen: diag(6191, ts.DiagnosticCategory.Message, "Whether_to_keep_outdated_console_output_in_watch_mode_instead_of_clearing_the_screen_6191", "Whether to keep outdated console output in watch mode instead of clearing the screen."),
All_imports_in_import_declaration_are_unused: diag(6192, ts.DiagnosticCategory.Error, "All_imports_in_import_declaration_are_unused_6192", "All imports in import declaration are unused.", /*reportsUnnecessary*/ true),
Found_1_error_Watching_for_file_changes: diag(6193, ts.DiagnosticCategory.Message, "Found_1_error_Watching_for_file_changes_6193", "Found 1 error. Watching for file changes."),
Found_0_errors_Watching_for_file_changes: diag(6194, ts.DiagnosticCategory.Message, "Found_0_errors_Watching_for_file_changes_6194", "Found {0} errors. Watching for file changes."),
Resolve_keyof_to_string_valued_property_names_only_no_numbers_or_symbols: diag(6195, ts.DiagnosticCategory.Message, "Resolve_keyof_to_string_valued_property_names_only_no_numbers_or_symbols_6195", "Resolve 'keyof' to string valued property names only (no numbers or symbols)."),
_0_is_declared_but_never_used: diag(6196, ts.DiagnosticCategory.Error, "_0_is_declared_but_never_used_6196", "'{0}' is declared but never used.", /*reportsUnnecessary*/ true),
Include_modules_imported_with_json_extension: diag(6197, ts.DiagnosticCategory.Message, "Include_modules_imported_with_json_extension_6197", "Include modules imported with '.json' extension"),
All_destructured_elements_are_unused: diag(6198, ts.DiagnosticCategory.Error, "All_destructured_elements_are_unused_6198", "All destructured elements are unused.", /*reportsUnnecessary*/ true),
All_variables_are_unused: diag(6199, ts.DiagnosticCategory.Error, "All_variables_are_unused_6199", "All variables are unused.", /*reportsUnnecessary*/ true),
Definitions_of_the_following_identifiers_conflict_with_those_in_another_file_Colon_0: diag(6200, ts.DiagnosticCategory.Error, "Definitions_of_the_following_identifiers_conflict_with_those_in_another_file_Colon_0_6200", "Definitions of the following identifiers conflict with those in another file: {0}"),
Conflicts_are_in_this_file: diag(6201, ts.DiagnosticCategory.Message, "Conflicts_are_in_this_file_6201", "Conflicts are in this file."),
Project_references_may_not_form_a_circular_graph_Cycle_detected_Colon_0: diag(6202, ts.DiagnosticCategory.Error, "Project_references_may_not_form_a_circular_graph_Cycle_detected_Colon_0_6202", "Project references may not form a circular graph. Cycle detected: {0}"),
_0_was_also_declared_here: diag(6203, ts.DiagnosticCategory.Message, "_0_was_also_declared_here_6203", "'{0}' was also declared here."),
and_here: diag(6204, ts.DiagnosticCategory.Message, "and_here_6204", "and here."),
All_type_parameters_are_unused: diag(6205, ts.DiagnosticCategory.Error, "All_type_parameters_are_unused_6205", "All type parameters are unused."),
package_json_has_a_typesVersions_field_with_version_specific_path_mappings: diag(6206, ts.DiagnosticCategory.Message, "package_json_has_a_typesVersions_field_with_version_specific_path_mappings_6206", "'package.json' has a 'typesVersions' field with version-specific path mappings."),
package_json_does_not_have_a_typesVersions_entry_that_matches_version_0: diag(6207, ts.DiagnosticCategory.Message, "package_json_does_not_have_a_typesVersions_entry_that_matches_version_0_6207", "'package.json' does not have a 'typesVersions' entry that matches version '{0}'."),
package_json_has_a_typesVersions_entry_0_that_matches_compiler_version_1_looking_for_a_pattern_to_match_module_name_2: diag(6208, ts.DiagnosticCategory.Message, "package_json_has_a_typesVersions_entry_0_that_matches_compiler_version_1_looking_for_a_pattern_to_ma_6208", "'package.json' has a 'typesVersions' entry '{0}' that matches compiler version '{1}', looking for a pattern to match module name '{2}'."),
package_json_has_a_typesVersions_entry_0_that_is_not_a_valid_semver_range: diag(6209, ts.DiagnosticCategory.Message, "package_json_has_a_typesVersions_entry_0_that_is_not_a_valid_semver_range_6209", "'package.json' has a 'typesVersions' entry '{0}' that is not a valid semver range."),
An_argument_for_0_was_not_provided: diag(6210, ts.DiagnosticCategory.Message, "An_argument_for_0_was_not_provided_6210", "An argument for '{0}' was not provided."),
An_argument_matching_this_binding_pattern_was_not_provided: diag(6211, ts.DiagnosticCategory.Message, "An_argument_matching_this_binding_pattern_was_not_provided_6211", "An argument matching this binding pattern was not provided."),
Did_you_mean_to_call_this_expression: diag(6212, ts.DiagnosticCategory.Message, "Did_you_mean_to_call_this_expression_6212", "Did you mean to call this expression?"),
Did_you_mean_to_use_new_with_this_expression: diag(6213, ts.DiagnosticCategory.Message, "Did_you_mean_to_use_new_with_this_expression_6213", "Did you mean to use 'new' with this expression?"),
Enable_strict_bind_call_and_apply_methods_on_functions: diag(6214, ts.DiagnosticCategory.Message, "Enable_strict_bind_call_and_apply_methods_on_functions_6214", "Enable strict 'bind', 'call', and 'apply' methods on functions."),
Using_compiler_options_of_project_reference_redirect_0: diag(6215, ts.DiagnosticCategory.Message, "Using_compiler_options_of_project_reference_redirect_0_6215", "Using compiler options of project reference redirect '{0}'."),
Found_1_error: diag(6216, ts.DiagnosticCategory.Message, "Found_1_error_6216", "Found 1 error."),
Found_0_errors: diag(6217, ts.DiagnosticCategory.Message, "Found_0_errors_6217", "Found {0} errors."),
Module_name_0_was_successfully_resolved_to_1_with_Package_ID_2: diag(6218, ts.DiagnosticCategory.Message, "Module_name_0_was_successfully_resolved_to_1_with_Package_ID_2_6218", "======== Module name '{0}' was successfully resolved to '{1}' with Package ID '{2}'. ========"),
Type_reference_directive_0_was_successfully_resolved_to_1_with_Package_ID_2_primary_Colon_3: diag(6219, ts.DiagnosticCategory.Message, "Type_reference_directive_0_was_successfully_resolved_to_1_with_Package_ID_2_primary_Colon_3_6219", "======== Type reference directive '{0}' was successfully resolved to '{1}' with Package ID '{2}', primary: {3}. ========"),
package_json_had_a_falsy_0_field: diag(6220, ts.DiagnosticCategory.Message, "package_json_had_a_falsy_0_field_6220", "'package.json' had a falsy '{0}' field."),
Disable_use_of_source_files_instead_of_declaration_files_from_referenced_projects: diag(6221, ts.DiagnosticCategory.Message, "Disable_use_of_source_files_instead_of_declaration_files_from_referenced_projects_6221", "Disable use of source files instead of declaration files from referenced projects."),
Emit_class_fields_with_Define_instead_of_Set: diag(6222, ts.DiagnosticCategory.Message, "Emit_class_fields_with_Define_instead_of_Set_6222", "Emit class fields with Define instead of Set."),
Generates_a_CPU_profile: diag(6223, ts.DiagnosticCategory.Message, "Generates_a_CPU_profile_6223", "Generates a CPU profile."),
Disable_solution_searching_for_this_project: diag(6224, ts.DiagnosticCategory.Message, "Disable_solution_searching_for_this_project_6224", "Disable solution searching for this project."),
Specify_strategy_for_watching_file_Colon_FixedPollingInterval_default_PriorityPollingInterval_DynamicPriorityPolling_FixedChunkSizePolling_UseFsEvents_UseFsEventsOnParentDirectory: diag(6225, ts.DiagnosticCategory.Message, "Specify_strategy_for_watching_file_Colon_FixedPollingInterval_default_PriorityPollingInterval_Dynami_6225", "Specify strategy for watching file: 'FixedPollingInterval' (default), 'PriorityPollingInterval', 'DynamicPriorityPolling', 'FixedChunkSizePolling', 'UseFsEvents', 'UseFsEventsOnParentDirectory'."),
Specify_strategy_for_watching_directory_on_platforms_that_don_t_support_recursive_watching_natively_Colon_UseFsEvents_default_FixedPollingInterval_DynamicPriorityPolling_FixedChunkSizePolling: diag(6226, ts.DiagnosticCategory.Message, "Specify_strategy_for_watching_directory_on_platforms_that_don_t_support_recursive_watching_natively__6226", "Specify strategy for watching directory on platforms that don't support recursive watching natively: 'UseFsEvents' (default), 'FixedPollingInterval', 'DynamicPriorityPolling', 'FixedChunkSizePolling'."),
Specify_strategy_for_creating_a_polling_watch_when_it_fails_to_create_using_file_system_events_Colon_FixedInterval_default_PriorityInterval_DynamicPriority_FixedChunkSize: diag(6227, ts.DiagnosticCategory.Message, "Specify_strategy_for_creating_a_polling_watch_when_it_fails_to_create_using_file_system_events_Colon_6227", "Specify strategy for creating a polling watch when it fails to create using file system events: 'FixedInterval' (default), 'PriorityInterval', 'DynamicPriority', 'FixedChunkSize'."),
Tag_0_expects_at_least_1_arguments_but_the_JSX_factory_2_provides_at_most_3: diag(6229, ts.DiagnosticCategory.Error, "Tag_0_expects_at_least_1_arguments_but_the_JSX_factory_2_provides_at_most_3_6229", "Tag '{0}' expects at least '{1}' arguments, but the JSX factory '{2}' provides at most '{3}'."),
Option_0_can_only_be_specified_in_tsconfig_json_file_or_set_to_false_or_null_on_command_line: diag(6230, ts.DiagnosticCategory.Error, "Option_0_can_only_be_specified_in_tsconfig_json_file_or_set_to_false_or_null_on_command_line_6230", "Option '{0}' can only be specified in 'tsconfig.json' file or set to 'false' or 'null' on command line."),
Could_not_resolve_the_path_0_with_the_extensions_Colon_1: diag(6231, ts.DiagnosticCategory.Error, "Could_not_resolve_the_path_0_with_the_extensions_Colon_1_6231", "Could not resolve the path '{0}' with the extensions: {1}."),
Declaration_augments_declaration_in_another_file_This_cannot_be_serialized: diag(6232, ts.DiagnosticCategory.Error, "Declaration_augments_declaration_in_another_file_This_cannot_be_serialized_6232", "Declaration augments declaration in another file. This cannot be serialized."),
This_is_the_declaration_being_augmented_Consider_moving_the_augmenting_declaration_into_the_same_file: diag(6233, ts.DiagnosticCategory.Error, "This_is_the_declaration_being_augmented_Consider_moving_the_augmenting_declaration_into_the_same_fil_6233", "This is the declaration being augmented. Consider moving the augmenting declaration into the same file."),
This_expression_is_not_callable_because_it_is_a_get_accessor_Did_you_mean_to_use_it_without: diag(6234, ts.DiagnosticCategory.Error, "This_expression_is_not_callable_because_it_is_a_get_accessor_Did_you_mean_to_use_it_without_6234", "This expression is not callable because it is a 'get' accessor. Did you mean to use it without '()'?"),
Disable_loading_referenced_projects: diag(6235, ts.DiagnosticCategory.Message, "Disable_loading_referenced_projects_6235", "Disable loading referenced projects."),
Arguments_for_the_rest_parameter_0_were_not_provided: diag(6236, ts.DiagnosticCategory.Error, "Arguments_for_the_rest_parameter_0_were_not_provided_6236", "Arguments for the rest parameter '{0}' were not provided."),
Generates_an_event_trace_and_a_list_of_types: diag(6237, ts.DiagnosticCategory.Message, "Generates_an_event_trace_and_a_list_of_types_6237", "Generates an event trace and a list of types."),
Specify_the_module_specifier_to_be_used_to_import_the_jsx_and_jsxs_factory_functions_from_eg_react: diag(6238, ts.DiagnosticCategory.Error, "Specify_the_module_specifier_to_be_used_to_import_the_jsx_and_jsxs_factory_functions_from_eg_react_6238", "Specify the module specifier to be used to import the 'jsx' and 'jsxs' factory functions from. eg, react"),
File_0_exists_according_to_earlier_cached_lookups: diag(6239, ts.DiagnosticCategory.Message, "File_0_exists_according_to_earlier_cached_lookups_6239", "File '{0}' exists according to earlier cached lookups."),
File_0_does_not_exist_according_to_earlier_cached_lookups: diag(6240, ts.DiagnosticCategory.Message, "File_0_does_not_exist_according_to_earlier_cached_lookups_6240", "File '{0}' does not exist according to earlier cached lookups."),
Resolution_for_type_reference_directive_0_was_found_in_cache_from_location_1: diag(6241, ts.DiagnosticCategory.Message, "Resolution_for_type_reference_directive_0_was_found_in_cache_from_location_1_6241", "Resolution for type reference directive '{0}' was found in cache from location '{1}'."),
Resolving_type_reference_directive_0_containing_file_1: diag(6242, ts.DiagnosticCategory.Message, "Resolving_type_reference_directive_0_containing_file_1_6242", "======== Resolving type reference directive '{0}', containing file '{1}'. ========"),
Interpret_optional_property_types_as_written_rather_than_adding_undefined: diag(6243, ts.DiagnosticCategory.Message, "Interpret_optional_property_types_as_written_rather_than_adding_undefined_6243", "Interpret optional property types as written, rather than adding 'undefined'."),
Modules: diag(6244, ts.DiagnosticCategory.Message, "Modules_6244", "Modules"),
File_Management: diag(6245, ts.DiagnosticCategory.Message, "File_Management_6245", "File Management"),
Emit: diag(6246, ts.DiagnosticCategory.Message, "Emit_6246", "Emit"),
JavaScript_Support: diag(6247, ts.DiagnosticCategory.Message, "JavaScript_Support_6247", "JavaScript Support"),
Type_Checking: diag(6248, ts.DiagnosticCategory.Message, "Type_Checking_6248", "Type Checking"),
Editor_Support: diag(6249, ts.DiagnosticCategory.Message, "Editor_Support_6249", "Editor Support"),
Watch_and_Build_Modes: diag(6250, ts.DiagnosticCategory.Message, "Watch_and_Build_Modes_6250", "Watch and Build Modes"),
Compiler_Diagnostics: diag(6251, ts.DiagnosticCategory.Message, "Compiler_Diagnostics_6251", "Compiler Diagnostics"),
Interop_Constraints: diag(6252, ts.DiagnosticCategory.Message, "Interop_Constraints_6252", "Interop Constraints"),
Backwards_Compatibility: diag(6253, ts.DiagnosticCategory.Message, "Backwards_Compatibility_6253", "Backwards Compatibility"),
Language_and_Environment: diag(6254, ts.DiagnosticCategory.Message, "Language_and_Environment_6254", "Language and Environment"),
Projects: diag(6255, ts.DiagnosticCategory.Message, "Projects_6255", "Projects"),
Output_Formatting: diag(6256, ts.DiagnosticCategory.Message, "Output_Formatting_6256", "Output Formatting"),
Completeness: diag(6257, ts.DiagnosticCategory.Message, "Completeness_6257", "Completeness"),
Projects_to_reference: diag(6300, ts.DiagnosticCategory.Message, "Projects_to_reference_6300", "Projects to reference"),
Enable_project_compilation: diag(6302, ts.DiagnosticCategory.Message, "Enable_project_compilation_6302", "Enable project compilation"),
Composite_projects_may_not_disable_declaration_emit: diag(6304, ts.DiagnosticCategory.Error, "Composite_projects_may_not_disable_declaration_emit_6304", "Composite projects may not disable declaration emit."),
Output_file_0_has_not_been_built_from_source_file_1: diag(6305, ts.DiagnosticCategory.Error, "Output_file_0_has_not_been_built_from_source_file_1_6305", "Output file '{0}' has not been built from source file '{1}'."),
Referenced_project_0_must_have_setting_composite_Colon_true: diag(6306, ts.DiagnosticCategory.Error, "Referenced_project_0_must_have_setting_composite_Colon_true_6306", "Referenced project '{0}' must have setting \"composite\": true."),
File_0_is_not_listed_within_the_file_list_of_project_1_Projects_must_list_all_files_or_use_an_include_pattern: diag(6307, ts.DiagnosticCategory.Error, "File_0_is_not_listed_within_the_file_list_of_project_1_Projects_must_list_all_files_or_use_an_includ_6307", "File '{0}' is not listed within the file list of project '{1}'. Projects must list all files or use an 'include' pattern."),
Cannot_prepend_project_0_because_it_does_not_have_outFile_set: diag(6308, ts.DiagnosticCategory.Error, "Cannot_prepend_project_0_because_it_does_not_have_outFile_set_6308", "Cannot prepend project '{0}' because it does not have 'outFile' set"),
Output_file_0_from_project_1_does_not_exist: diag(6309, ts.DiagnosticCategory.Error, "Output_file_0_from_project_1_does_not_exist_6309", "Output file '{0}' from project '{1}' does not exist"),
Referenced_project_0_may_not_disable_emit: diag(6310, ts.DiagnosticCategory.Error, "Referenced_project_0_may_not_disable_emit_6310", "Referenced project '{0}' may not disable emit."),
Project_0_is_out_of_date_because_oldest_output_1_is_older_than_newest_input_2: diag(6350, ts.DiagnosticCategory.Message, "Project_0_is_out_of_date_because_oldest_output_1_is_older_than_newest_input_2_6350", "Project '{0}' is out of date because oldest output '{1}' is older than newest input '{2}'"),
Project_0_is_up_to_date_because_newest_input_1_is_older_than_oldest_output_2: diag(6351, ts.DiagnosticCategory.Message, "Project_0_is_up_to_date_because_newest_input_1_is_older_than_oldest_output_2_6351", "Project '{0}' is up to date because newest input '{1}' is older than oldest output '{2}'"),
Project_0_is_out_of_date_because_output_file_1_does_not_exist: diag(6352, ts.DiagnosticCategory.Message, "Project_0_is_out_of_date_because_output_file_1_does_not_exist_6352", "Project '{0}' is out of date because output file '{1}' does not exist"),
Project_0_is_out_of_date_because_its_dependency_1_is_out_of_date: diag(6353, ts.DiagnosticCategory.Message, "Project_0_is_out_of_date_because_its_dependency_1_is_out_of_date_6353", "Project '{0}' is out of date because its dependency '{1}' is out of date"),
Project_0_is_up_to_date_with_d_ts_files_from_its_dependencies: diag(6354, ts.DiagnosticCategory.Message, "Project_0_is_up_to_date_with_d_ts_files_from_its_dependencies_6354", "Project '{0}' is up to date with .d.ts files from its dependencies"),
Projects_in_this_build_Colon_0: diag(6355, ts.DiagnosticCategory.Message, "Projects_in_this_build_Colon_0_6355", "Projects in this build: {0}"),
A_non_dry_build_would_delete_the_following_files_Colon_0: diag(6356, ts.DiagnosticCategory.Message, "A_non_dry_build_would_delete_the_following_files_Colon_0_6356", "A non-dry build would delete the following files: {0}"),
A_non_dry_build_would_build_project_0: diag(6357, ts.DiagnosticCategory.Message, "A_non_dry_build_would_build_project_0_6357", "A non-dry build would build project '{0}'"),
Building_project_0: diag(6358, ts.DiagnosticCategory.Message, "Building_project_0_6358", "Building project '{0}'..."),
Updating_output_timestamps_of_project_0: diag(6359, ts.DiagnosticCategory.Message, "Updating_output_timestamps_of_project_0_6359", "Updating output timestamps of project '{0}'..."),
delete_this_Project_0_is_up_to_date_because_it_was_previously_built: diag(6360, ts.DiagnosticCategory.Message, "delete_this_Project_0_is_up_to_date_because_it_was_previously_built_6360", "delete this - Project '{0}' is up to date because it was previously built"),
Project_0_is_up_to_date: diag(6361, ts.DiagnosticCategory.Message, "Project_0_is_up_to_date_6361", "Project '{0}' is up to date"),
Skipping_build_of_project_0_because_its_dependency_1_has_errors: diag(6362, ts.DiagnosticCategory.Message, "Skipping_build_of_project_0_because_its_dependency_1_has_errors_6362", "Skipping build of project '{0}' because its dependency '{1}' has errors"),
Project_0_can_t_be_built_because_its_dependency_1_has_errors: diag(6363, ts.DiagnosticCategory.Message, "Project_0_can_t_be_built_because_its_dependency_1_has_errors_6363", "Project '{0}' can't be built because its dependency '{1}' has errors"),
Build_one_or_more_projects_and_their_dependencies_if_out_of_date: diag(6364, ts.DiagnosticCategory.Message, "Build_one_or_more_projects_and_their_dependencies_if_out_of_date_6364", "Build one or more projects and their dependencies, if out of date"),
Delete_the_outputs_of_all_projects: diag(6365, ts.DiagnosticCategory.Message, "Delete_the_outputs_of_all_projects_6365", "Delete the outputs of all projects"),
Show_what_would_be_built_or_deleted_if_specified_with_clean: diag(6367, ts.DiagnosticCategory.Message, "Show_what_would_be_built_or_deleted_if_specified_with_clean_6367", "Show what would be built (or deleted, if specified with '--clean')"),
Option_build_must_be_the_first_command_line_argument: diag(6369, ts.DiagnosticCategory.Error, "Option_build_must_be_the_first_command_line_argument_6369", "Option '--build' must be the first command line argument."),
Options_0_and_1_cannot_be_combined: diag(6370, ts.DiagnosticCategory.Error, "Options_0_and_1_cannot_be_combined_6370", "Options '{0}' and '{1}' cannot be combined."),
Updating_unchanged_output_timestamps_of_project_0: diag(6371, ts.DiagnosticCategory.Message, "Updating_unchanged_output_timestamps_of_project_0_6371", "Updating unchanged output timestamps of project '{0}'..."),
Project_0_is_out_of_date_because_output_of_its_dependency_1_has_changed: diag(6372, ts.DiagnosticCategory.Message, "Project_0_is_out_of_date_because_output_of_its_dependency_1_has_changed_6372", "Project '{0}' is out of date because output of its dependency '{1}' has changed"),
Updating_output_of_project_0: diag(6373, ts.DiagnosticCategory.Message, "Updating_output_of_project_0_6373", "Updating output of project '{0}'..."),
A_non_dry_build_would_update_timestamps_for_output_of_project_0: diag(6374, ts.DiagnosticCategory.Message, "A_non_dry_build_would_update_timestamps_for_output_of_project_0_6374", "A non-dry build would update timestamps for output of project '{0}'"),
A_non_dry_build_would_update_output_of_project_0: diag(6375, ts.DiagnosticCategory.Message, "A_non_dry_build_would_update_output_of_project_0_6375", "A non-dry build would update output of project '{0}'"),
Cannot_update_output_of_project_0_because_there_was_error_reading_file_1: diag(6376, ts.DiagnosticCategory.Message, "Cannot_update_output_of_project_0_because_there_was_error_reading_file_1_6376", "Cannot update output of project '{0}' because there was error reading file '{1}'"),
Cannot_write_file_0_because_it_will_overwrite_tsbuildinfo_file_generated_by_referenced_project_1: diag(6377, ts.DiagnosticCategory.Error, "Cannot_write_file_0_because_it_will_overwrite_tsbuildinfo_file_generated_by_referenced_project_1_6377", "Cannot write file '{0}' because it will overwrite '.tsbuildinfo' file generated by referenced project '{1}'"),
Enable_incremental_compilation: diag(6378, ts.DiagnosticCategory.Message, "Enable_incremental_compilation_6378", "Enable incremental compilation"),
Composite_projects_may_not_disable_incremental_compilation: diag(6379, ts.DiagnosticCategory.Error, "Composite_projects_may_not_disable_incremental_compilation_6379", "Composite projects may not disable incremental compilation."),
Specify_file_to_store_incremental_compilation_information: diag(6380, ts.DiagnosticCategory.Message, "Specify_file_to_store_incremental_compilation_information_6380", "Specify file to store incremental compilation information"),
Project_0_is_out_of_date_because_output_for_it_was_generated_with_version_1_that_differs_with_current_version_2: diag(6381, ts.DiagnosticCategory.Message, "Project_0_is_out_of_date_because_output_for_it_was_generated_with_version_1_that_differs_with_curren_6381", "Project '{0}' is out of date because output for it was generated with version '{1}' that differs with current version '{2}'"),
Skipping_build_of_project_0_because_its_dependency_1_was_not_built: diag(6382, ts.DiagnosticCategory.Message, "Skipping_build_of_project_0_because_its_dependency_1_was_not_built_6382", "Skipping build of project '{0}' because its dependency '{1}' was not built"),
Project_0_can_t_be_built_because_its_dependency_1_was_not_built: diag(6383, ts.DiagnosticCategory.Message, "Project_0_can_t_be_built_because_its_dependency_1_was_not_built_6383", "Project '{0}' can't be built because its dependency '{1}' was not built"),
Have_recompiles_in_incremental_and_watch_assume_that_changes_within_a_file_will_only_affect_files_directly_depending_on_it: diag(6384, ts.DiagnosticCategory.Message, "Have_recompiles_in_incremental_and_watch_assume_that_changes_within_a_file_will_only_affect_files_di_6384", "Have recompiles in '--incremental' and '--watch' assume that changes within a file will only affect files directly depending on it."),
_0_is_deprecated: diag(6385, ts.DiagnosticCategory.Suggestion, "_0_is_deprecated_6385", "'{0}' is deprecated.", /*reportsUnnecessary*/ undefined, /*elidedInCompatabilityPyramid*/ undefined, /*reportsDeprecated*/ true),
Performance_timings_for_diagnostics_or_extendedDiagnostics_are_not_available_in_this_session_A_native_implementation_of_the_Web_Performance_API_could_not_be_found: diag(6386, ts.DiagnosticCategory.Message, "Performance_timings_for_diagnostics_or_extendedDiagnostics_are_not_available_in_this_session_A_nativ_6386", "Performance timings for '--diagnostics' or '--extendedDiagnostics' are not available in this session. A native implementation of the Web Performance API could not be found."),
The_signature_0_of_1_is_deprecated: diag(6387, ts.DiagnosticCategory.Suggestion, "The_signature_0_of_1_is_deprecated_6387", "The signature '{0}' of '{1}' is deprecated.", /*reportsUnnecessary*/ undefined, /*elidedInCompatabilityPyramid*/ undefined, /*reportsDeprecated*/ true),
Project_0_is_being_forcibly_rebuilt: diag(6388, ts.DiagnosticCategory.Message, "Project_0_is_being_forcibly_rebuilt_6388", "Project '{0}' is being forcibly rebuilt"),
Reusing_resolution_of_module_0_from_1_of_old_program_it_was_not_resolved: diag(6389, ts.DiagnosticCategory.Message, "Reusing_resolution_of_module_0_from_1_of_old_program_it_was_not_resolved_6389", "Reusing resolution of module '{0}' from '{1}' of old program, it was not resolved."),
Reusing_resolution_of_type_reference_directive_0_from_1_of_old_program_it_was_successfully_resolved_to_2: diag(6390, ts.DiagnosticCategory.Message, "Reusing_resolution_of_type_reference_directive_0_from_1_of_old_program_it_was_successfully_resolved__6390", "Reusing resolution of type reference directive '{0}' from '{1}' of old program, it was successfully resolved to '{2}'."),
Reusing_resolution_of_type_reference_directive_0_from_1_of_old_program_it_was_successfully_resolved_to_2_with_Package_ID_3: diag(6391, ts.DiagnosticCategory.Message, "Reusing_resolution_of_type_reference_directive_0_from_1_of_old_program_it_was_successfully_resolved__6391", "Reusing resolution of type reference directive '{0}' from '{1}' of old program, it was successfully resolved to '{2}' with Package ID '{3}'."),
Reusing_resolution_of_type_reference_directive_0_from_1_of_old_program_it_was_not_resolved: diag(6392, ts.DiagnosticCategory.Message, "Reusing_resolution_of_type_reference_directive_0_from_1_of_old_program_it_was_not_resolved_6392", "Reusing resolution of type reference directive '{0}' from '{1}' of old program, it was not resolved."),
Reusing_resolution_of_module_0_from_1_found_in_cache_from_location_2_it_was_successfully_resolved_to_3: diag(6393, ts.DiagnosticCategory.Message, "Reusing_resolution_of_module_0_from_1_found_in_cache_from_location_2_it_was_successfully_resolved_to_6393", "Reusing resolution of module '{0}' from '{1}' found in cache from location '{2}', it was successfully resolved to '{3}'."),
Reusing_resolution_of_module_0_from_1_found_in_cache_from_location_2_it_was_successfully_resolved_to_3_with_Package_ID_4: diag(6394, ts.DiagnosticCategory.Message, "Reusing_resolution_of_module_0_from_1_found_in_cache_from_location_2_it_was_successfully_resolved_to_6394", "Reusing resolution of module '{0}' from '{1}' found in cache from location '{2}', it was successfully resolved to '{3}' with Package ID '{4}'."),
Reusing_resolution_of_module_0_from_1_found_in_cache_from_location_2_it_was_not_resolved: diag(6395, ts.DiagnosticCategory.Message, "Reusing_resolution_of_module_0_from_1_found_in_cache_from_location_2_it_was_not_resolved_6395", "Reusing resolution of module '{0}' from '{1}' found in cache from location '{2}', it was not resolved."),
Reusing_resolution_of_type_reference_directive_0_from_1_found_in_cache_from_location_2_it_was_successfully_resolved_to_3: diag(6396, ts.DiagnosticCategory.Message, "Reusing_resolution_of_type_reference_directive_0_from_1_found_in_cache_from_location_2_it_was_succes_6396", "Reusing resolution of type reference directive '{0}' from '{1}' found in cache from location '{2}', it was successfully resolved to '{3}'."),
Reusing_resolution_of_type_reference_directive_0_from_1_found_in_cache_from_location_2_it_was_successfully_resolved_to_3_with_Package_ID_4: diag(6397, ts.DiagnosticCategory.Message, "Reusing_resolution_of_type_reference_directive_0_from_1_found_in_cache_from_location_2_it_was_succes_6397", "Reusing resolution of type reference directive '{0}' from '{1}' found in cache from location '{2}', it was successfully resolved to '{3}' with Package ID '{4}'."),
Reusing_resolution_of_type_reference_directive_0_from_1_found_in_cache_from_location_2_it_was_not_resolved: diag(6398, ts.DiagnosticCategory.Message, "Reusing_resolution_of_type_reference_directive_0_from_1_found_in_cache_from_location_2_it_was_not_re_6398", "Reusing resolution of type reference directive '{0}' from '{1}' found in cache from location '{2}', it was not resolved."),
The_expected_type_comes_from_property_0_which_is_declared_here_on_type_1: diag(6500, ts.DiagnosticCategory.Message, "The_expected_type_comes_from_property_0_which_is_declared_here_on_type_1_6500", "The expected type comes from property '{0}' which is declared here on type '{1}'"),
The_expected_type_comes_from_this_index_signature: diag(6501, ts.DiagnosticCategory.Message, "The_expected_type_comes_from_this_index_signature_6501", "The expected type comes from this index signature."),
The_expected_type_comes_from_the_return_type_of_this_signature: diag(6502, ts.DiagnosticCategory.Message, "The_expected_type_comes_from_the_return_type_of_this_signature_6502", "The expected type comes from the return type of this signature."),
Print_names_of_files_that_are_part_of_the_compilation_and_then_stop_processing: diag(6503, ts.DiagnosticCategory.Message, "Print_names_of_files_that_are_part_of_the_compilation_and_then_stop_processing_6503", "Print names of files that are part of the compilation and then stop processing."),
File_0_is_a_JavaScript_file_Did_you_mean_to_enable_the_allowJs_option: diag(6504, ts.DiagnosticCategory.Error, "File_0_is_a_JavaScript_file_Did_you_mean_to_enable_the_allowJs_option_6504", "File '{0}' is a JavaScript file. Did you mean to enable the 'allowJs' option?"),
Print_names_of_files_and_the_reason_they_are_part_of_the_compilation: diag(6505, ts.DiagnosticCategory.Message, "Print_names_of_files_and_the_reason_they_are_part_of_the_compilation_6505", "Print names of files and the reason they are part of the compilation."),
Consider_adding_a_declare_modifier_to_this_class: diag(6506, ts.DiagnosticCategory.Message, "Consider_adding_a_declare_modifier_to_this_class_6506", "Consider adding a 'declare' modifier to this class."),
Allow_JavaScript_files_to_be_a_part_of_your_program_Use_the_checkJS_option_to_get_errors_from_these_files: diag(6600, ts.DiagnosticCategory.Message, "Allow_JavaScript_files_to_be_a_part_of_your_program_Use_the_checkJS_option_to_get_errors_from_these__6600", "Allow JavaScript files to be a part of your program. Use the `checkJS` option to get errors from these files."),
Allow_import_x_from_y_when_a_module_doesn_t_have_a_default_export: diag(6601, ts.DiagnosticCategory.Message, "Allow_import_x_from_y_when_a_module_doesn_t_have_a_default_export_6601", "Allow 'import x from y' when a module doesn't have a default export."),
Allow_accessing_UMD_globals_from_modules: diag(6602, ts.DiagnosticCategory.Message, "Allow_accessing_UMD_globals_from_modules_6602", "Allow accessing UMD globals from modules."),
Disable_error_reporting_for_unreachable_code: diag(6603, ts.DiagnosticCategory.Message, "Disable_error_reporting_for_unreachable_code_6603", "Disable error reporting for unreachable code."),
Disable_error_reporting_for_unused_labels: diag(6604, ts.DiagnosticCategory.Message, "Disable_error_reporting_for_unused_labels_6604", "Disable error reporting for unused labels."),
Ensure_use_strict_is_always_emitted: diag(6605, ts.DiagnosticCategory.Message, "Ensure_use_strict_is_always_emitted_6605", "Ensure 'use strict' is always emitted."),
Have_recompiles_in_projects_that_use_incremental_and_watch_mode_assume_that_changes_within_a_file_will_only_affect_files_directly_depending_on_it: diag(6606, ts.DiagnosticCategory.Message, "Have_recompiles_in_projects_that_use_incremental_and_watch_mode_assume_that_changes_within_a_file_wi_6606", "Have recompiles in projects that use `incremental` and `watch` mode assume that changes within a file will only affect files directly depending on it."),
Specify_the_base_directory_to_resolve_non_relative_module_names: diag(6607, ts.DiagnosticCategory.Message, "Specify_the_base_directory_to_resolve_non_relative_module_names_6607", "Specify the base directory to resolve non-relative module names."),
No_longer_supported_In_early_versions_manually_set_the_text_encoding_for_reading_files: diag(6608, ts.DiagnosticCategory.Message, "No_longer_supported_In_early_versions_manually_set_the_text_encoding_for_reading_files_6608", "No longer supported. In early versions, manually set the text encoding for reading files."),
Enable_error_reporting_in_type_checked_JavaScript_files: diag(6609, ts.DiagnosticCategory.Message, "Enable_error_reporting_in_type_checked_JavaScript_files_6609", "Enable error reporting in type-checked JavaScript files."),
Enable_constraints_that_allow_a_TypeScript_project_to_be_used_with_project_references: diag(6611, ts.DiagnosticCategory.Message, "Enable_constraints_that_allow_a_TypeScript_project_to_be_used_with_project_references_6611", "Enable constraints that allow a TypeScript project to be used with project references."),
Generate_d_ts_files_from_TypeScript_and_JavaScript_files_in_your_project: diag(6612, ts.DiagnosticCategory.Message, "Generate_d_ts_files_from_TypeScript_and_JavaScript_files_in_your_project_6612", "Generate .d.ts files from TypeScript and JavaScript files in your project."),
Specify_the_output_directory_for_generated_declaration_files: diag(6613, ts.DiagnosticCategory.Message, "Specify_the_output_directory_for_generated_declaration_files_6613", "Specify the output directory for generated declaration files."),
Create_sourcemaps_for_d_ts_files: diag(6614, ts.DiagnosticCategory.Message, "Create_sourcemaps_for_d_ts_files_6614", "Create sourcemaps for d.ts files."),
Output_compiler_performance_information_after_building: diag(6615, ts.DiagnosticCategory.Message, "Output_compiler_performance_information_after_building_6615", "Output compiler performance information after building."),
Disables_inference_for_type_acquisition_by_looking_at_filenames_in_a_project: diag(6616, ts.DiagnosticCategory.Message, "Disables_inference_for_type_acquisition_by_looking_at_filenames_in_a_project_6616", "Disables inference for type acquisition by looking at filenames in a project."),
Reduce_the_number_of_projects_loaded_automatically_by_TypeScript: diag(6617, ts.DiagnosticCategory.Message, "Reduce_the_number_of_projects_loaded_automatically_by_TypeScript_6617", "Reduce the number of projects loaded automatically by TypeScript."),
Remove_the_20mb_cap_on_total_source_code_size_for_JavaScript_files_in_the_TypeScript_language_server: diag(6618, ts.DiagnosticCategory.Message, "Remove_the_20mb_cap_on_total_source_code_size_for_JavaScript_files_in_the_TypeScript_language_server_6618", "Remove the 20mb cap on total source code size for JavaScript files in the TypeScript language server."),
Opt_a_project_out_of_multi_project_reference_checking_when_editing: diag(6619, ts.DiagnosticCategory.Message, "Opt_a_project_out_of_multi_project_reference_checking_when_editing_6619", "Opt a project out of multi-project reference checking when editing."),
Disable_preferring_source_files_instead_of_declaration_files_when_referencing_composite_projects: diag(6620, ts.DiagnosticCategory.Message, "Disable_preferring_source_files_instead_of_declaration_files_when_referencing_composite_projects_6620", "Disable preferring source files instead of declaration files when referencing composite projects"),
Emit_more_compliant_but_verbose_and_less_performant_JavaScript_for_iteration: diag(6621, ts.DiagnosticCategory.Message, "Emit_more_compliant_but_verbose_and_less_performant_JavaScript_for_iteration_6621", "Emit more compliant, but verbose and less performant JavaScript for iteration."),
Only_output_d_ts_files_and_not_JavaScript_files: diag(6623, ts.DiagnosticCategory.Message, "Only_output_d_ts_files_and_not_JavaScript_files_6623", "Only output d.ts files and not JavaScript files."),
Emit_design_type_metadata_for_decorated_declarations_in_source_files: diag(6624, ts.DiagnosticCategory.Message, "Emit_design_type_metadata_for_decorated_declarations_in_source_files_6624", "Emit design-type metadata for decorated declarations in source files."),
Disable_the_type_acquisition_for_JavaScript_projects: diag(6625, ts.DiagnosticCategory.Message, "Disable_the_type_acquisition_for_JavaScript_projects_6625", "Disable the type acquisition for JavaScript projects"),
Emit_additional_JavaScript_to_ease_support_for_importing_CommonJS_modules_This_enables_allowSyntheticDefaultImports_for_type_compatibility: diag(6626, ts.DiagnosticCategory.Message, "Emit_additional_JavaScript_to_ease_support_for_importing_CommonJS_modules_This_enables_allowSyntheti_6626", "Emit additional JavaScript to ease support for importing CommonJS modules. This enables `allowSyntheticDefaultImports` for type compatibility."),
Filters_results_from_the_include_option: diag(6627, ts.DiagnosticCategory.Message, "Filters_results_from_the_include_option_6627", "Filters results from the `include` option."),
Remove_a_list_of_directories_from_the_watch_process: diag(6628, ts.DiagnosticCategory.Message, "Remove_a_list_of_directories_from_the_watch_process_6628", "Remove a list of directories from the watch process."),
Remove_a_list_of_files_from_the_watch_mode_s_processing: diag(6629, ts.DiagnosticCategory.Message, "Remove_a_list_of_files_from_the_watch_mode_s_processing_6629", "Remove a list of files from the watch mode's processing."),
Enable_experimental_support_for_TC39_stage_2_draft_decorators: diag(6630, ts.DiagnosticCategory.Message, "Enable_experimental_support_for_TC39_stage_2_draft_decorators_6630", "Enable experimental support for TC39 stage 2 draft decorators."),
Print_files_read_during_the_compilation_including_why_it_was_included: diag(6631, ts.DiagnosticCategory.Message, "Print_files_read_during_the_compilation_including_why_it_was_included_6631", "Print files read during the compilation including why it was included."),
Output_more_detailed_compiler_performance_information_after_building: diag(6632, ts.DiagnosticCategory.Message, "Output_more_detailed_compiler_performance_information_after_building_6632", "Output more detailed compiler performance information after building."),
Specify_one_or_more_path_or_node_module_references_to_base_configuration_files_from_which_settings_are_inherited: diag(6633, ts.DiagnosticCategory.Message, "Specify_one_or_more_path_or_node_module_references_to_base_configuration_files_from_which_settings_a_6633", "Specify one or more path or node module references to base configuration files from which settings are inherited."),
Specify_what_approach_the_watcher_should_use_if_the_system_runs_out_of_native_file_watchers: diag(6634, ts.DiagnosticCategory.Message, "Specify_what_approach_the_watcher_should_use_if_the_system_runs_out_of_native_file_watchers_6634", "Specify what approach the watcher should use if the system runs out of native file watchers."),
Include_a_list_of_files_This_does_not_support_glob_patterns_as_opposed_to_include: diag(6635, ts.DiagnosticCategory.Message, "Include_a_list_of_files_This_does_not_support_glob_patterns_as_opposed_to_include_6635", "Include a list of files. This does not support glob patterns, as opposed to `include`."),
Build_all_projects_including_those_that_appear_to_be_up_to_date: diag(6636, ts.DiagnosticCategory.Message, "Build_all_projects_including_those_that_appear_to_be_up_to_date_6636", "Build all projects, including those that appear to be up to date"),
Ensure_that_casing_is_correct_in_imports: diag(6637, ts.DiagnosticCategory.Message, "Ensure_that_casing_is_correct_in_imports_6637", "Ensure that casing is correct in imports."),
Emit_a_v8_CPU_profile_of_the_compiler_run_for_debugging: diag(6638, ts.DiagnosticCategory.Message, "Emit_a_v8_CPU_profile_of_the_compiler_run_for_debugging_6638", "Emit a v8 CPU profile of the compiler run for debugging."),
Allow_importing_helper_functions_from_tslib_once_per_project_instead_of_including_them_per_file: diag(6639, ts.DiagnosticCategory.Message, "Allow_importing_helper_functions_from_tslib_once_per_project_instead_of_including_them_per_file_6639", "Allow importing helper functions from tslib once per project, instead of including them per-file."),
Specify_a_list_of_glob_patterns_that_match_files_to_be_included_in_compilation: diag(6641, ts.DiagnosticCategory.Message, "Specify_a_list_of_glob_patterns_that_match_files_to_be_included_in_compilation_6641", "Specify a list of glob patterns that match files to be included in compilation."),
Save_tsbuildinfo_files_to_allow_for_incremental_compilation_of_projects: diag(6642, ts.DiagnosticCategory.Message, "Save_tsbuildinfo_files_to_allow_for_incremental_compilation_of_projects_6642", "Save .tsbuildinfo files to allow for incremental compilation of projects."),
Include_sourcemap_files_inside_the_emitted_JavaScript: diag(6643, ts.DiagnosticCategory.Message, "Include_sourcemap_files_inside_the_emitted_JavaScript_6643", "Include sourcemap files inside the emitted JavaScript."),
Include_source_code_in_the_sourcemaps_inside_the_emitted_JavaScript: diag(6644, ts.DiagnosticCategory.Message, "Include_source_code_in_the_sourcemaps_inside_the_emitted_JavaScript_6644", "Include source code in the sourcemaps inside the emitted JavaScript."),
Ensure_that_each_file_can_be_safely_transpiled_without_relying_on_other_imports: diag(6645, ts.DiagnosticCategory.Message, "Ensure_that_each_file_can_be_safely_transpiled_without_relying_on_other_imports_6645", "Ensure that each file can be safely transpiled without relying on other imports."),
Specify_what_JSX_code_is_generated: diag(6646, ts.DiagnosticCategory.Message, "Specify_what_JSX_code_is_generated_6646", "Specify what JSX code is generated."),
Specify_the_JSX_factory_function_used_when_targeting_React_JSX_emit_e_g_React_createElement_or_h: diag(6647, ts.DiagnosticCategory.Message, "Specify_the_JSX_factory_function_used_when_targeting_React_JSX_emit_e_g_React_createElement_or_h_6647", "Specify the JSX factory function used when targeting React JSX emit, e.g. 'React.createElement' or 'h'"),
Specify_the_JSX_Fragment_reference_used_for_fragments_when_targeting_React_JSX_emit_e_g_React_Fragment_or_Fragment: diag(6648, ts.DiagnosticCategory.Message, "Specify_the_JSX_Fragment_reference_used_for_fragments_when_targeting_React_JSX_emit_e_g_React_Fragme_6648", "Specify the JSX Fragment reference used for fragments when targeting React JSX emit e.g. 'React.Fragment' or 'Fragment'."),
Specify_module_specifier_used_to_import_the_JSX_factory_functions_when_using_jsx_Colon_react_jsx_Asterisk: diag(6649, ts.DiagnosticCategory.Message, "Specify_module_specifier_used_to_import_the_JSX_factory_functions_when_using_jsx_Colon_react_jsx_Ast_6649", "Specify module specifier used to import the JSX factory functions when using `jsx: react-jsx*`.`"),
Make_keyof_only_return_strings_instead_of_string_numbers_or_symbols_Legacy_option: diag(6650, ts.DiagnosticCategory.Message, "Make_keyof_only_return_strings_instead_of_string_numbers_or_symbols_Legacy_option_6650", "Make keyof only return strings instead of string, numbers or symbols. Legacy option."),
Specify_a_set_of_bundled_library_declaration_files_that_describe_the_target_runtime_environment: diag(6651, ts.DiagnosticCategory.Message, "Specify_a_set_of_bundled_library_declaration_files_that_describe_the_target_runtime_environment_6651", "Specify a set of bundled library declaration files that describe the target runtime environment."),
Print_the_names_of_emitted_files_after_a_compilation: diag(6652, ts.DiagnosticCategory.Message, "Print_the_names_of_emitted_files_after_a_compilation_6652", "Print the names of emitted files after a compilation."),
Print_all_of_the_files_read_during_the_compilation: diag(6653, ts.DiagnosticCategory.Message, "Print_all_of_the_files_read_during_the_compilation_6653", "Print all of the files read during the compilation."),
Set_the_language_of_the_messaging_from_TypeScript_This_does_not_affect_emit: diag(6654, ts.DiagnosticCategory.Message, "Set_the_language_of_the_messaging_from_TypeScript_This_does_not_affect_emit_6654", "Set the language of the messaging from TypeScript. This does not affect emit."),
Specify_the_maximum_folder_depth_used_for_checking_JavaScript_files_from_node_modules_Only_applicable_with_allowJs: diag(6656, ts.DiagnosticCategory.Message, "Specify_the_maximum_folder_depth_used_for_checking_JavaScript_files_from_node_modules_Only_applicabl_6656", "Specify the maximum folder depth used for checking JavaScript files from `node_modules`. Only applicable with `allowJs`."),
Specify_what_module_code_is_generated: diag(6657, ts.DiagnosticCategory.Message, "Specify_what_module_code_is_generated_6657", "Specify what module code is generated."),
Specify_how_TypeScript_looks_up_a_file_from_a_given_module_specifier: diag(6658, ts.DiagnosticCategory.Message, "Specify_how_TypeScript_looks_up_a_file_from_a_given_module_specifier_6658", "Specify how TypeScript looks up a file from a given module specifier."),
Set_the_newline_character_for_emitting_files: diag(6659, ts.DiagnosticCategory.Message, "Set_the_newline_character_for_emitting_files_6659", "Set the newline character for emitting files."),
Disable_emitting_files_from_a_compilation: diag(6660, ts.DiagnosticCategory.Message, "Disable_emitting_files_from_a_compilation_6660", "Disable emitting files from a compilation."),
Disable_generating_custom_helper_functions_like_extends_in_compiled_output: diag(6661, ts.DiagnosticCategory.Message, "Disable_generating_custom_helper_functions_like_extends_in_compiled_output_6661", "Disable generating custom helper functions like `__extends` in compiled output."),
Disable_emitting_files_if_any_type_checking_errors_are_reported: diag(6662, ts.DiagnosticCategory.Message, "Disable_emitting_files_if_any_type_checking_errors_are_reported_6662", "Disable emitting files if any type checking errors are reported."),
Disable_truncating_types_in_error_messages: diag(6663, ts.DiagnosticCategory.Message, "Disable_truncating_types_in_error_messages_6663", "Disable truncating types in error messages."),
Enable_error_reporting_for_fallthrough_cases_in_switch_statements: diag(6664, ts.DiagnosticCategory.Message, "Enable_error_reporting_for_fallthrough_cases_in_switch_statements_6664", "Enable error reporting for fallthrough cases in switch statements."),
Enable_error_reporting_for_expressions_and_declarations_with_an_implied_any_type: diag(6665, ts.DiagnosticCategory.Message, "Enable_error_reporting_for_expressions_and_declarations_with_an_implied_any_type_6665", "Enable error reporting for expressions and declarations with an implied `any` type.."),
Ensure_overriding_members_in_derived_classes_are_marked_with_an_override_modifier: diag(6666, ts.DiagnosticCategory.Message, "Ensure_overriding_members_in_derived_classes_are_marked_with_an_override_modifier_6666", "Ensure overriding members in derived classes are marked with an override modifier."),
Enable_error_reporting_for_codepaths_that_do_not_explicitly_return_in_a_function: diag(6667, ts.DiagnosticCategory.Message, "Enable_error_reporting_for_codepaths_that_do_not_explicitly_return_in_a_function_6667", "Enable error reporting for codepaths that do not explicitly return in a function."),
Enable_error_reporting_when_this_is_given_the_type_any: diag(6668, ts.DiagnosticCategory.Message, "Enable_error_reporting_when_this_is_given_the_type_any_6668", "Enable error reporting when `this` is given the type `any`."),
Disable_adding_use_strict_directives_in_emitted_JavaScript_files: diag(6669, ts.DiagnosticCategory.Message, "Disable_adding_use_strict_directives_in_emitted_JavaScript_files_6669", "Disable adding 'use strict' directives in emitted JavaScript files."),
Disable_including_any_library_files_including_the_default_lib_d_ts: diag(6670, ts.DiagnosticCategory.Message, "Disable_including_any_library_files_including_the_default_lib_d_ts_6670", "Disable including any library files, including the default lib.d.ts."),
Enforces_using_indexed_accessors_for_keys_declared_using_an_indexed_type: diag(6671, ts.DiagnosticCategory.Message, "Enforces_using_indexed_accessors_for_keys_declared_using_an_indexed_type_6671", "Enforces using indexed accessors for keys declared using an indexed type"),
Disallow_import_s_require_s_or_reference_s_from_expanding_the_number_of_files_TypeScript_should_add_to_a_project: diag(6672, ts.DiagnosticCategory.Message, "Disallow_import_s_require_s_or_reference_s_from_expanding_the_number_of_files_TypeScript_should_add__6672", "Disallow `import`s, `require`s or `<reference>`s from expanding the number of files TypeScript should add to a project."),
Disable_strict_checking_of_generic_signatures_in_function_types: diag(6673, ts.DiagnosticCategory.Message, "Disable_strict_checking_of_generic_signatures_in_function_types_6673", "Disable strict checking of generic signatures in function types."),
Add_undefined_to_a_type_when_accessed_using_an_index: diag(6674, ts.DiagnosticCategory.Message, "Add_undefined_to_a_type_when_accessed_using_an_index_6674", "Add `undefined` to a type when accessed using an index."),
Enable_error_reporting_when_a_local_variables_aren_t_read: diag(6675, ts.DiagnosticCategory.Message, "Enable_error_reporting_when_a_local_variables_aren_t_read_6675", "Enable error reporting when a local variables aren't read."),
Raise_an_error_when_a_function_parameter_isn_t_read: diag(6676, ts.DiagnosticCategory.Message, "Raise_an_error_when_a_function_parameter_isn_t_read_6676", "Raise an error when a function parameter isn't read"),
Deprecated_setting_Use_outFile_instead: diag(6677, ts.DiagnosticCategory.Message, "Deprecated_setting_Use_outFile_instead_6677", "Deprecated setting. Use `outFile` instead."),
Specify_an_output_folder_for_all_emitted_files: diag(6678, ts.DiagnosticCategory.Message, "Specify_an_output_folder_for_all_emitted_files_6678", "Specify an output folder for all emitted files."),
Specify_a_file_that_bundles_all_outputs_into_one_JavaScript_file_If_declaration_is_true_also_designates_a_file_that_bundles_all_d_ts_output: diag(6679, ts.DiagnosticCategory.Message, "Specify_a_file_that_bundles_all_outputs_into_one_JavaScript_file_If_declaration_is_true_also_designa_6679", "Specify a file that bundles all outputs into one JavaScript file. If `declaration` is true, also designates a file that bundles all .d.ts output."),
Specify_a_set_of_entries_that_re_map_imports_to_additional_lookup_locations: diag(6680, ts.DiagnosticCategory.Message, "Specify_a_set_of_entries_that_re_map_imports_to_additional_lookup_locations_6680", "Specify a set of entries that re-map imports to additional lookup locations."),
Specify_a_list_of_language_service_plugins_to_include: diag(6681, ts.DiagnosticCategory.Message, "Specify_a_list_of_language_service_plugins_to_include_6681", "Specify a list of language service plugins to include."),
Disable_erasing_const_enum_declarations_in_generated_code: diag(6682, ts.DiagnosticCategory.Message, "Disable_erasing_const_enum_declarations_in_generated_code_6682", "Disable erasing `const enum` declarations in generated code."),
Disable_resolving_symlinks_to_their_realpath_This_correlates_to_the_same_flag_in_node: diag(6683, ts.DiagnosticCategory.Message, "Disable_resolving_symlinks_to_their_realpath_This_correlates_to_the_same_flag_in_node_6683", "Disable resolving symlinks to their realpath. This correlates to the same flag in node."),
Disable_wiping_the_console_in_watch_mode: diag(6684, ts.DiagnosticCategory.Message, "Disable_wiping_the_console_in_watch_mode_6684", "Disable wiping the console in watch mode"),
Enable_color_and_formatting_in_TypeScript_s_output_to_make_compiler_errors_easier_to_read: diag(6685, ts.DiagnosticCategory.Message, "Enable_color_and_formatting_in_TypeScript_s_output_to_make_compiler_errors_easier_to_read_6685", "Enable color and formatting in TypeScript's output to make compiler errors easier to read"),
Specify_the_object_invoked_for_createElement_This_only_applies_when_targeting_react_JSX_emit: diag(6686, ts.DiagnosticCategory.Message, "Specify_the_object_invoked_for_createElement_This_only_applies_when_targeting_react_JSX_emit_6686", "Specify the object invoked for `createElement`. This only applies when targeting `react` JSX emit."),
Specify_an_array_of_objects_that_specify_paths_for_projects_Used_in_project_references: diag(6687, ts.DiagnosticCategory.Message, "Specify_an_array_of_objects_that_specify_paths_for_projects_Used_in_project_references_6687", "Specify an array of objects that specify paths for projects. Used in project references."),
Disable_emitting_comments: diag(6688, ts.DiagnosticCategory.Message, "Disable_emitting_comments_6688", "Disable emitting comments."),
Enable_importing_json_files: diag(6689, ts.DiagnosticCategory.Message, "Enable_importing_json_files_6689", "Enable importing .json files"),
Specify_the_root_folder_within_your_source_files: diag(6690, ts.DiagnosticCategory.Message, "Specify_the_root_folder_within_your_source_files_6690", "Specify the root folder within your source files."),
Allow_multiple_folders_to_be_treated_as_one_when_resolving_modules: diag(6691, ts.DiagnosticCategory.Message, "Allow_multiple_folders_to_be_treated_as_one_when_resolving_modules_6691", "Allow multiple folders to be treated as one when resolving modules."),
Skip_type_checking_d_ts_files_that_are_included_with_TypeScript: diag(6692, ts.DiagnosticCategory.Message, "Skip_type_checking_d_ts_files_that_are_included_with_TypeScript_6692", "Skip type checking .d.ts files that are included with TypeScript."),
Skip_type_checking_all_d_ts_files: diag(6693, ts.DiagnosticCategory.Message, "Skip_type_checking_all_d_ts_files_6693", "Skip type checking all .d.ts files."),
Create_source_map_files_for_emitted_JavaScript_files: diag(6694, ts.DiagnosticCategory.Message, "Create_source_map_files_for_emitted_JavaScript_files_6694", "Create source map files for emitted JavaScript files."),
Specify_the_root_path_for_debuggers_to_find_the_reference_source_code: diag(6695, ts.DiagnosticCategory.Message, "Specify_the_root_path_for_debuggers_to_find_the_reference_source_code_6695", "Specify the root path for debuggers to find the reference source code."),
Check_that_the_arguments_for_bind_call_and_apply_methods_match_the_original_function: diag(6697, ts.DiagnosticCategory.Message, "Check_that_the_arguments_for_bind_call_and_apply_methods_match_the_original_function_6697", "Check that the arguments for `bind`, `call`, and `apply` methods match the original function."),
When_assigning_functions_check_to_ensure_parameters_and_the_return_values_are_subtype_compatible: diag(6698, ts.DiagnosticCategory.Message, "When_assigning_functions_check_to_ensure_parameters_and_the_return_values_are_subtype_compatible_6698", "When assigning functions, check to ensure parameters and the return values are subtype-compatible."),
When_type_checking_take_into_account_null_and_undefined: diag(6699, ts.DiagnosticCategory.Message, "When_type_checking_take_into_account_null_and_undefined_6699", "When type checking, take into account `null` and `undefined`."),
Check_for_class_properties_that_are_declared_but_not_set_in_the_constructor: diag(6700, ts.DiagnosticCategory.Message, "Check_for_class_properties_that_are_declared_but_not_set_in_the_constructor_6700", "Check for class properties that are declared but not set in the constructor."),
Disable_emitting_declarations_that_have_internal_in_their_JSDoc_comments: diag(6701, ts.DiagnosticCategory.Message, "Disable_emitting_declarations_that_have_internal_in_their_JSDoc_comments_6701", "Disable emitting declarations that have `@internal` in their JSDoc comments."),
Disable_reporting_of_excess_property_errors_during_the_creation_of_object_literals: diag(6702, ts.DiagnosticCategory.Message, "Disable_reporting_of_excess_property_errors_during_the_creation_of_object_literals_6702", "Disable reporting of excess property errors during the creation of object literals."),
Suppress_noImplicitAny_errors_when_indexing_objects_that_lack_index_signatures: diag(6703, ts.DiagnosticCategory.Message, "Suppress_noImplicitAny_errors_when_indexing_objects_that_lack_index_signatures_6703", "Suppress `noImplicitAny` errors when indexing objects that lack index signatures."),
Synchronously_call_callbacks_and_update_the_state_of_directory_watchers_on_platforms_that_don_t_support_recursive_watching_natively: diag(6704, ts.DiagnosticCategory.Message, "Synchronously_call_callbacks_and_update_the_state_of_directory_watchers_on_platforms_that_don_t_supp_6704", "Synchronously call callbacks and update the state of directory watchers on platforms that don`t support recursive watching natively."),
Set_the_JavaScript_language_version_for_emitted_JavaScript_and_include_compatible_library_declarations: diag(6705, ts.DiagnosticCategory.Message, "Set_the_JavaScript_language_version_for_emitted_JavaScript_and_include_compatible_library_declaratio_6705", "Set the JavaScript language version for emitted JavaScript and include compatible library declarations."),
Log_paths_used_during_the_moduleResolution_process: diag(6706, ts.DiagnosticCategory.Message, "Log_paths_used_during_the_moduleResolution_process_6706", "Log paths used during the `moduleResolution` process."),
Specify_the_folder_for_tsbuildinfo_incremental_compilation_files: diag(6707, ts.DiagnosticCategory.Message, "Specify_the_folder_for_tsbuildinfo_incremental_compilation_files_6707", "Specify the folder for .tsbuildinfo incremental compilation files."),
Specify_options_for_automatic_acquisition_of_declaration_files: diag(6709, ts.DiagnosticCategory.Message, "Specify_options_for_automatic_acquisition_of_declaration_files_6709", "Specify options for automatic acquisition of declaration files."),
Specify_multiple_folders_that_act_like_Slashnode_modules_Slash_types: diag(6710, ts.DiagnosticCategory.Message, "Specify_multiple_folders_that_act_like_Slashnode_modules_Slash_types_6710", "Specify multiple folders that act like `./node_modules/@types`."),
Specify_type_package_names_to_be_included_without_being_referenced_in_a_source_file: diag(6711, ts.DiagnosticCategory.Message, "Specify_type_package_names_to_be_included_without_being_referenced_in_a_source_file_6711", "Specify type package names to be included without being referenced in a source file."),
Emit_ECMAScript_standard_compliant_class_fields: diag(6712, ts.DiagnosticCategory.Message, "Emit_ECMAScript_standard_compliant_class_fields_6712", "Emit ECMAScript-standard-compliant class fields."),
Enable_verbose_logging: diag(6713, ts.DiagnosticCategory.Message, "Enable_verbose_logging_6713", "Enable verbose logging"),
Specify_how_directories_are_watched_on_systems_that_lack_recursive_file_watching_functionality: diag(6714, ts.DiagnosticCategory.Message, "Specify_how_directories_are_watched_on_systems_that_lack_recursive_file_watching_functionality_6714", "Specify how directories are watched on systems that lack recursive file-watching functionality."),
Specify_how_the_TypeScript_watch_mode_works: diag(6715, ts.DiagnosticCategory.Message, "Specify_how_the_TypeScript_watch_mode_works_6715", "Specify how the TypeScript watch mode works."),
Include_undefined_in_index_signature_results: diag(6716, ts.DiagnosticCategory.Message, "Include_undefined_in_index_signature_results_6716", "Include 'undefined' in index signature results"),
Require_undeclared_properties_from_index_signatures_to_use_element_accesses: diag(6717, ts.DiagnosticCategory.Message, "Require_undeclared_properties_from_index_signatures_to_use_element_accesses_6717", "Require undeclared properties from index signatures to use element accesses."),
Specify_emit_Slashchecking_behavior_for_imports_that_are_only_used_for_types: diag(6718, ts.DiagnosticCategory.Message, "Specify_emit_Slashchecking_behavior_for_imports_that_are_only_used_for_types_6718", "Specify emit/checking behavior for imports that are only used for types"),
Type_catch_clause_variables_as_unknown_instead_of_any: diag(6803, ts.DiagnosticCategory.Message, "Type_catch_clause_variables_as_unknown_instead_of_any_6803", "Type catch clause variables as 'unknown' instead of 'any'."),
one_of_Colon: diag(6900, ts.DiagnosticCategory.Message, "one_of_Colon_6900", "one of:"),
one_or_more_Colon: diag(6901, ts.DiagnosticCategory.Message, "one_or_more_Colon_6901", "one or more:"),
type_Colon: diag(6902, ts.DiagnosticCategory.Message, "type_Colon_6902", "type:"),
default_Colon: diag(6903, ts.DiagnosticCategory.Message, "default_Colon_6903", "default:"),
module_system_or_esModuleInterop: diag(6904, ts.DiagnosticCategory.Message, "module_system_or_esModuleInterop_6904", "module === \"system\" or esModuleInterop"),
false_unless_strict_is_set: diag(6905, ts.DiagnosticCategory.Message, "false_unless_strict_is_set_6905", "`false`, unless `strict` is set"),
false_unless_composite_is_set: diag(6906, ts.DiagnosticCategory.Message, "false_unless_composite_is_set_6906", "`false`, unless `composite` is set"),
node_modules_bower_components_jspm_packages_plus_the_value_of_outDir_if_one_is_specified: diag(6907, ts.DiagnosticCategory.Message, "node_modules_bower_components_jspm_packages_plus_the_value_of_outDir_if_one_is_specified_6907", "`[\"node_modules\", \"bower_components\", \"jspm_packages\"]`, plus the value of `outDir` if one is specified."),
if_files_is_specified_otherwise_Asterisk_Asterisk_Slash_Asterisk: diag(6908, ts.DiagnosticCategory.Message, "if_files_is_specified_otherwise_Asterisk_Asterisk_Slash_Asterisk_6908", "`[]` if `files` is specified, otherwise `[\"**/*\"]`"),
true_if_composite_false_otherwise: diag(6909, ts.DiagnosticCategory.Message, "true_if_composite_false_otherwise_6909", "`true` if `composite`, `false` otherwise"),
module_AMD_or_UMD_or_System_or_ES6_then_Classic_Otherwise_Node: diag(69010, ts.DiagnosticCategory.Message, "module_AMD_or_UMD_or_System_or_ES6_then_Classic_Otherwise_Node_69010", "module === `AMD` or `UMD` or `System` or `ES6`, then `Classic`, Otherwise `Node`"),
Computed_from_the_list_of_input_files: diag(6911, ts.DiagnosticCategory.Message, "Computed_from_the_list_of_input_files_6911", "Computed from the list of input files"),
Platform_specific: diag(6912, ts.DiagnosticCategory.Message, "Platform_specific_6912", "Platform specific"),
You_can_learn_about_all_of_the_compiler_options_at_0: diag(6913, ts.DiagnosticCategory.Message, "You_can_learn_about_all_of_the_compiler_options_at_0_6913", "You can learn about all of the compiler options at {0}"),
Including_watch_w_will_start_watching_the_current_project_for_the_file_changes_Once_set_you_can_config_watch_mode_with_Colon: diag(6914, ts.DiagnosticCategory.Message, "Including_watch_w_will_start_watching_the_current_project_for_the_file_changes_Once_set_you_can_conf_6914", "Including --watch, -w will start watching the current project for the file changes. Once set, you can config watch mode with:"),
Using_build_b_will_make_tsc_behave_more_like_a_build_orchestrator_than_a_compiler_This_is_used_to_trigger_building_composite_projects_which_you_can_learn_more_about_at_0: diag(6915, ts.DiagnosticCategory.Message, "Using_build_b_will_make_tsc_behave_more_like_a_build_orchestrator_than_a_compiler_This_is_used_to_tr_6915", "Using --build, -b will make tsc behave more like a build orchestrator than a compiler. This is used to trigger building composite projects which you can learn more about at {0}"),
COMMON_COMMANDS: diag(6916, ts.DiagnosticCategory.Message, "COMMON_COMMANDS_6916", "COMMON COMMANDS"),
ALL_COMPILER_OPTIONS: diag(6917, ts.DiagnosticCategory.Message, "ALL_COMPILER_OPTIONS_6917", "ALL COMPILER OPTIONS"),
WATCH_OPTIONS: diag(6918, ts.DiagnosticCategory.Message, "WATCH_OPTIONS_6918", "WATCH OPTIONS"),
BUILD_OPTIONS: diag(6919, ts.DiagnosticCategory.Message, "BUILD_OPTIONS_6919", "BUILD OPTIONS"),
COMMON_COMPILER_OPTIONS: diag(6920, ts.DiagnosticCategory.Message, "COMMON_COMPILER_OPTIONS_6920", "COMMON COMPILER OPTIONS"),
COMMAND_LINE_FLAGS: diag(6921, ts.DiagnosticCategory.Message, "COMMAND_LINE_FLAGS_6921", "COMMAND LINE FLAGS"),
tsc_Colon_The_TypeScript_Compiler: diag(6922, ts.DiagnosticCategory.Message, "tsc_Colon_The_TypeScript_Compiler_6922", "tsc: The TypeScript Compiler"),
Compiles_the_current_project_tsconfig_json_in_the_working_directory: diag(6923, ts.DiagnosticCategory.Message, "Compiles_the_current_project_tsconfig_json_in_the_working_directory_6923", "Compiles the current project (tsconfig.json in the working directory.)"),
Ignoring_tsconfig_json_compiles_the_specified_files_with_default_compiler_options: diag(6924, ts.DiagnosticCategory.Message, "Ignoring_tsconfig_json_compiles_the_specified_files_with_default_compiler_options_6924", "Ignoring tsconfig.json, compiles the specified files with default compiler options."),
Build_a_composite_project_in_the_working_directory: diag(6925, ts.DiagnosticCategory.Message, "Build_a_composite_project_in_the_working_directory_6925", "Build a composite project in the working directory."),
Creates_a_tsconfig_json_with_the_recommended_settings_in_the_working_directory: diag(6926, ts.DiagnosticCategory.Message, "Creates_a_tsconfig_json_with_the_recommended_settings_in_the_working_directory_6926", "Creates a tsconfig.json with the recommended settings in the working directory."),
Compiles_the_TypeScript_project_located_at_the_specified_path: diag(6927, ts.DiagnosticCategory.Message, "Compiles_the_TypeScript_project_located_at_the_specified_path_6927", "Compiles the TypeScript project located at the specified path."),
An_expanded_version_of_this_information_showing_all_possible_compiler_options: diag(6928, ts.DiagnosticCategory.Message, "An_expanded_version_of_this_information_showing_all_possible_compiler_options_6928", "An expanded version of this information, showing all possible compiler options"),
Compiles_the_current_project_with_additional_settings: diag(6929, ts.DiagnosticCategory.Message, "Compiles_the_current_project_with_additional_settings_6929", "Compiles the current project, with additional settings."),
Variable_0_implicitly_has_an_1_type: diag(7005, ts.DiagnosticCategory.Error, "Variable_0_implicitly_has_an_1_type_7005", "Variable '{0}' implicitly has an '{1}' type."),
Parameter_0_implicitly_has_an_1_type: diag(7006, ts.DiagnosticCategory.Error, "Parameter_0_implicitly_has_an_1_type_7006", "Parameter '{0}' implicitly has an '{1}' type."),
Member_0_implicitly_has_an_1_type: diag(7008, ts.DiagnosticCategory.Error, "Member_0_implicitly_has_an_1_type_7008", "Member '{0}' implicitly has an '{1}' type."),
new_expression_whose_target_lacks_a_construct_signature_implicitly_has_an_any_type: diag(7009, ts.DiagnosticCategory.Error, "new_expression_whose_target_lacks_a_construct_signature_implicitly_has_an_any_type_7009", "'new' expression, whose target lacks a construct signature, implicitly has an 'any' type."),
_0_which_lacks_return_type_annotation_implicitly_has_an_1_return_type: diag(7010, ts.DiagnosticCategory.Error, "_0_which_lacks_return_type_annotation_implicitly_has_an_1_return_type_7010", "'{0}', which lacks return-type annotation, implicitly has an '{1}' return type."),
Function_expression_which_lacks_return_type_annotation_implicitly_has_an_0_return_type: diag(7011, ts.DiagnosticCategory.Error, "Function_expression_which_lacks_return_type_annotation_implicitly_has_an_0_return_type_7011", "Function expression, which lacks return-type annotation, implicitly has an '{0}' return type."),
Construct_signature_which_lacks_return_type_annotation_implicitly_has_an_any_return_type: diag(7013, ts.DiagnosticCategory.Error, "Construct_signature_which_lacks_return_type_annotation_implicitly_has_an_any_return_type_7013", "Construct signature, which lacks return-type annotation, implicitly has an 'any' return type."),
Function_type_which_lacks_return_type_annotation_implicitly_has_an_0_return_type: diag(7014, ts.DiagnosticCategory.Error, "Function_type_which_lacks_return_type_annotation_implicitly_has_an_0_return_type_7014", "Function type, which lacks return-type annotation, implicitly has an '{0}' return type."),
Element_implicitly_has_an_any_type_because_index_expression_is_not_of_type_number: diag(7015, ts.DiagnosticCategory.Error, "Element_implicitly_has_an_any_type_because_index_expression_is_not_of_type_number_7015", "Element implicitly has an 'any' type because index expression is not of type 'number'."),
Could_not_find_a_declaration_file_for_module_0_1_implicitly_has_an_any_type: diag(7016, ts.DiagnosticCategory.Error, "Could_not_find_a_declaration_file_for_module_0_1_implicitly_has_an_any_type_7016", "Could not find a declaration file for module '{0}'. '{1}' implicitly has an 'any' type."),
Element_implicitly_has_an_any_type_because_type_0_has_no_index_signature: diag(7017, ts.DiagnosticCategory.Error, "Element_implicitly_has_an_any_type_because_type_0_has_no_index_signature_7017", "Element implicitly has an 'any' type because type '{0}' has no index signature."),
Object_literal_s_property_0_implicitly_has_an_1_type: diag(7018, ts.DiagnosticCategory.Error, "Object_literal_s_property_0_implicitly_has_an_1_type_7018", "Object literal's property '{0}' implicitly has an '{1}' type."),
Rest_parameter_0_implicitly_has_an_any_type: diag(7019, ts.DiagnosticCategory.Error, "Rest_parameter_0_implicitly_has_an_any_type_7019", "Rest parameter '{0}' implicitly has an 'any[]' type."),
Call_signature_which_lacks_return_type_annotation_implicitly_has_an_any_return_type: diag(7020, ts.DiagnosticCategory.Error, "Call_signature_which_lacks_return_type_annotation_implicitly_has_an_any_return_type_7020", "Call signature, which lacks return-type annotation, implicitly has an 'any' return type."),
_0_implicitly_has_type_any_because_it_does_not_have_a_type_annotation_and_is_referenced_directly_or_indirectly_in_its_own_initializer: diag(7022, ts.DiagnosticCategory.Error, "_0_implicitly_has_type_any_because_it_does_not_have_a_type_annotation_and_is_referenced_directly_or__7022", "'{0}' implicitly has type 'any' because it does not have a type annotation and is referenced directly or indirectly in its own initializer."),
_0_implicitly_has_return_type_any_because_it_does_not_have_a_return_type_annotation_and_is_referenced_directly_or_indirectly_in_one_of_its_return_expressions: diag(7023, ts.DiagnosticCategory.Error, "_0_implicitly_has_return_type_any_because_it_does_not_have_a_return_type_annotation_and_is_reference_7023", "'{0}' implicitly has return type 'any' because it does not have a return type annotation and is referenced directly or indirectly in one of its return expressions."),
Function_implicitly_has_return_type_any_because_it_does_not_have_a_return_type_annotation_and_is_referenced_directly_or_indirectly_in_one_of_its_return_expressions: diag(7024, ts.DiagnosticCategory.Error, "Function_implicitly_has_return_type_any_because_it_does_not_have_a_return_type_annotation_and_is_ref_7024", "Function implicitly has return type 'any' because it does not have a return type annotation and is referenced directly or indirectly in one of its return expressions."),
Generator_implicitly_has_yield_type_0_because_it_does_not_yield_any_values_Consider_supplying_a_return_type_annotation: diag(7025, ts.DiagnosticCategory.Error, "Generator_implicitly_has_yield_type_0_because_it_does_not_yield_any_values_Consider_supplying_a_retu_7025", "Generator implicitly has yield type '{0}' because it does not yield any values. Consider supplying a return type annotation."),
JSX_element_implicitly_has_type_any_because_no_interface_JSX_0_exists: diag(7026, ts.DiagnosticCategory.Error, "JSX_element_implicitly_has_type_any_because_no_interface_JSX_0_exists_7026", "JSX element implicitly has type 'any' because no interface 'JSX.{0}' exists."),
Unreachable_code_detected: diag(7027, ts.DiagnosticCategory.Error, "Unreachable_code_detected_7027", "Unreachable code detected.", /*reportsUnnecessary*/ true),
Unused_label: diag(7028, ts.DiagnosticCategory.Error, "Unused_label_7028", "Unused label.", /*reportsUnnecessary*/ true),
Fallthrough_case_in_switch: diag(7029, ts.DiagnosticCategory.Error, "Fallthrough_case_in_switch_7029", "Fallthrough case in switch."),
Not_all_code_paths_return_a_value: diag(7030, ts.DiagnosticCategory.Error, "Not_all_code_paths_return_a_value_7030", "Not all code paths return a value."),
Binding_element_0_implicitly_has_an_1_type: diag(7031, ts.DiagnosticCategory.Error, "Binding_element_0_implicitly_has_an_1_type_7031", "Binding element '{0}' implicitly has an '{1}' type."),
Property_0_implicitly_has_type_any_because_its_set_accessor_lacks_a_parameter_type_annotation: diag(7032, ts.DiagnosticCategory.Error, "Property_0_implicitly_has_type_any_because_its_set_accessor_lacks_a_parameter_type_annotation_7032", "Property '{0}' implicitly has type 'any', because its set accessor lacks a parameter type annotation."),
Property_0_implicitly_has_type_any_because_its_get_accessor_lacks_a_return_type_annotation: diag(7033, ts.DiagnosticCategory.Error, "Property_0_implicitly_has_type_any_because_its_get_accessor_lacks_a_return_type_annotation_7033", "Property '{0}' implicitly has type 'any', because its get accessor lacks a return type annotation."),
Variable_0_implicitly_has_type_1_in_some_locations_where_its_type_cannot_be_determined: diag(7034, ts.DiagnosticCategory.Error, "Variable_0_implicitly_has_type_1_in_some_locations_where_its_type_cannot_be_determined_7034", "Variable '{0}' implicitly has type '{1}' in some locations where its type cannot be determined."),
Try_npm_i_save_dev_types_Slash_1_if_it_exists_or_add_a_new_declaration_d_ts_file_containing_declare_module_0: diag(7035, ts.DiagnosticCategory.Error, "Try_npm_i_save_dev_types_Slash_1_if_it_exists_or_add_a_new_declaration_d_ts_file_containing_declare__7035", "Try `npm i --save-dev @types/{1}` if it exists or add a new declaration (.d.ts) file containing `declare module '{0}';`"),
Dynamic_import_s_specifier_must_be_of_type_string_but_here_has_type_0: diag(7036, ts.DiagnosticCategory.Error, "Dynamic_import_s_specifier_must_be_of_type_string_but_here_has_type_0_7036", "Dynamic import's specifier must be of type 'string', but here has type '{0}'."),
Enables_emit_interoperability_between_CommonJS_and_ES_Modules_via_creation_of_namespace_objects_for_all_imports_Implies_allowSyntheticDefaultImports: diag(7037, ts.DiagnosticCategory.Message, "Enables_emit_interoperability_between_CommonJS_and_ES_Modules_via_creation_of_namespace_objects_for__7037", "Enables emit interoperability between CommonJS and ES Modules via creation of namespace objects for all imports. Implies 'allowSyntheticDefaultImports'."),
Type_originates_at_this_import_A_namespace_style_import_cannot_be_called_or_constructed_and_will_cause_a_failure_at_runtime_Consider_using_a_default_import_or_import_require_here_instead: diag(7038, ts.DiagnosticCategory.Message, "Type_originates_at_this_import_A_namespace_style_import_cannot_be_called_or_constructed_and_will_cau_7038", "Type originates at this import. A namespace-style import cannot be called or constructed, and will cause a failure at runtime. Consider using a default import or import require here instead."),
Mapped_object_type_implicitly_has_an_any_template_type: diag(7039, ts.DiagnosticCategory.Error, "Mapped_object_type_implicitly_has_an_any_template_type_7039", "Mapped object type implicitly has an 'any' template type."),
If_the_0_package_actually_exposes_this_module_consider_sending_a_pull_request_to_amend_https_Colon_Slash_Slashgithub_com_SlashDefinitelyTyped_SlashDefinitelyTyped_Slashtree_Slashmaster_Slashtypes_Slash_1: diag(7040, ts.DiagnosticCategory.Error, "If_the_0_package_actually_exposes_this_module_consider_sending_a_pull_request_to_amend_https_Colon_S_7040", "If the '{0}' package actually exposes this module, consider sending a pull request to amend 'https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/{1}'"),
The_containing_arrow_function_captures_the_global_value_of_this: diag(7041, ts.DiagnosticCategory.Error, "The_containing_arrow_function_captures_the_global_value_of_this_7041", "The containing arrow function captures the global value of 'this'."),
Module_0_was_resolved_to_1_but_resolveJsonModule_is_not_used: diag(7042, ts.DiagnosticCategory.Error, "Module_0_was_resolved_to_1_but_resolveJsonModule_is_not_used_7042", "Module '{0}' was resolved to '{1}', but '--resolveJsonModule' is not used."),
Variable_0_implicitly_has_an_1_type_but_a_better_type_may_be_inferred_from_usage: diag(7043, ts.DiagnosticCategory.Suggestion, "Variable_0_implicitly_has_an_1_type_but_a_better_type_may_be_inferred_from_usage_7043", "Variable '{0}' implicitly has an '{1}' type, but a better type may be inferred from usage."),
Parameter_0_implicitly_has_an_1_type_but_a_better_type_may_be_inferred_from_usage: diag(7044, ts.DiagnosticCategory.Suggestion, "Parameter_0_implicitly_has_an_1_type_but_a_better_type_may_be_inferred_from_usage_7044", "Parameter '{0}' implicitly has an '{1}' type, but a better type may be inferred from usage."),
Member_0_implicitly_has_an_1_type_but_a_better_type_may_be_inferred_from_usage: diag(7045, ts.DiagnosticCategory.Suggestion, "Member_0_implicitly_has_an_1_type_but_a_better_type_may_be_inferred_from_usage_7045", "Member '{0}' implicitly has an '{1}' type, but a better type may be inferred from usage."),
Variable_0_implicitly_has_type_1_in_some_locations_but_a_better_type_may_be_inferred_from_usage: diag(7046, ts.DiagnosticCategory.Suggestion, "Variable_0_implicitly_has_type_1_in_some_locations_but_a_better_type_may_be_inferred_from_usage_7046", "Variable '{0}' implicitly has type '{1}' in some locations, but a better type may be inferred from usage."),
Rest_parameter_0_implicitly_has_an_any_type_but_a_better_type_may_be_inferred_from_usage: diag(7047, ts.DiagnosticCategory.Suggestion, "Rest_parameter_0_implicitly_has_an_any_type_but_a_better_type_may_be_inferred_from_usage_7047", "Rest parameter '{0}' implicitly has an 'any[]' type, but a better type may be inferred from usage."),
Property_0_implicitly_has_type_any_but_a_better_type_for_its_get_accessor_may_be_inferred_from_usage: diag(7048, ts.DiagnosticCategory.Suggestion, "Property_0_implicitly_has_type_any_but_a_better_type_for_its_get_accessor_may_be_inferred_from_usage_7048", "Property '{0}' implicitly has type 'any', but a better type for its get accessor may be inferred from usage."),
Property_0_implicitly_has_type_any_but_a_better_type_for_its_set_accessor_may_be_inferred_from_usage: diag(7049, ts.DiagnosticCategory.Suggestion, "Property_0_implicitly_has_type_any_but_a_better_type_for_its_set_accessor_may_be_inferred_from_usage_7049", "Property '{0}' implicitly has type 'any', but a better type for its set accessor may be inferred from usage."),
_0_implicitly_has_an_1_return_type_but_a_better_type_may_be_inferred_from_usage: diag(7050, ts.DiagnosticCategory.Suggestion, "_0_implicitly_has_an_1_return_type_but_a_better_type_may_be_inferred_from_usage_7050", "'{0}' implicitly has an '{1}' return type, but a better type may be inferred from usage."),
Parameter_has_a_name_but_no_type_Did_you_mean_0_Colon_1: diag(7051, ts.DiagnosticCategory.Error, "Parameter_has_a_name_but_no_type_Did_you_mean_0_Colon_1_7051", "Parameter has a name but no type. Did you mean '{0}: {1}'?"),
Element_implicitly_has_an_any_type_because_type_0_has_no_index_signature_Did_you_mean_to_call_1: diag(7052, ts.DiagnosticCategory.Error, "Element_implicitly_has_an_any_type_because_type_0_has_no_index_signature_Did_you_mean_to_call_1_7052", "Element implicitly has an 'any' type because type '{0}' has no index signature. Did you mean to call '{1}'?"),
Element_implicitly_has_an_any_type_because_expression_of_type_0_can_t_be_used_to_index_type_1: diag(7053, ts.DiagnosticCategory.Error, "Element_implicitly_has_an_any_type_because_expression_of_type_0_can_t_be_used_to_index_type_1_7053", "Element implicitly has an 'any' type because expression of type '{0}' can't be used to index type '{1}'."),
No_index_signature_with_a_parameter_of_type_0_was_found_on_type_1: diag(7054, ts.DiagnosticCategory.Error, "No_index_signature_with_a_parameter_of_type_0_was_found_on_type_1_7054", "No index signature with a parameter of type '{0}' was found on type '{1}'."),
_0_which_lacks_return_type_annotation_implicitly_has_an_1_yield_type: diag(7055, ts.DiagnosticCategory.Error, "_0_which_lacks_return_type_annotation_implicitly_has_an_1_yield_type_7055", "'{0}', which lacks return-type annotation, implicitly has an '{1}' yield type."),
The_inferred_type_of_this_node_exceeds_the_maximum_length_the_compiler_will_serialize_An_explicit_type_annotation_is_needed: diag(7056, ts.DiagnosticCategory.Error, "The_inferred_type_of_this_node_exceeds_the_maximum_length_the_compiler_will_serialize_An_explicit_ty_7056", "The inferred type of this node exceeds the maximum length the compiler will serialize. An explicit type annotation is needed."),
yield_expression_implicitly_results_in_an_any_type_because_its_containing_generator_lacks_a_return_type_annotation: diag(7057, ts.DiagnosticCategory.Error, "yield_expression_implicitly_results_in_an_any_type_because_its_containing_generator_lacks_a_return_t_7057", "'yield' expression implicitly results in an 'any' type because its containing generator lacks a return-type annotation."),
You_cannot_rename_this_element: diag(8000, ts.DiagnosticCategory.Error, "You_cannot_rename_this_element_8000", "You cannot rename this element."),
You_cannot_rename_elements_that_are_defined_in_the_standard_TypeScript_library: diag(8001, ts.DiagnosticCategory.Error, "You_cannot_rename_elements_that_are_defined_in_the_standard_TypeScript_library_8001", "You cannot rename elements that are defined in the standard TypeScript library."),
import_can_only_be_used_in_TypeScript_files: diag(8002, ts.DiagnosticCategory.Error, "import_can_only_be_used_in_TypeScript_files_8002", "'import ... =' can only be used in TypeScript files."),
export_can_only_be_used_in_TypeScript_files: diag(8003, ts.DiagnosticCategory.Error, "export_can_only_be_used_in_TypeScript_files_8003", "'export =' can only be used in TypeScript files."),
Type_parameter_declarations_can_only_be_used_in_TypeScript_files: diag(8004, ts.DiagnosticCategory.Error, "Type_parameter_declarations_can_only_be_used_in_TypeScript_files_8004", "Type parameter declarations can only be used in TypeScript files."),
implements_clauses_can_only_be_used_in_TypeScript_files: diag(8005, ts.DiagnosticCategory.Error, "implements_clauses_can_only_be_used_in_TypeScript_files_8005", "'implements' clauses can only be used in TypeScript files."),
_0_declarations_can_only_be_used_in_TypeScript_files: diag(8006, ts.DiagnosticCategory.Error, "_0_declarations_can_only_be_used_in_TypeScript_files_8006", "'{0}' declarations can only be used in TypeScript files."),
Type_aliases_can_only_be_used_in_TypeScript_files: diag(8008, ts.DiagnosticCategory.Error, "Type_aliases_can_only_be_used_in_TypeScript_files_8008", "Type aliases can only be used in TypeScript files."),
The_0_modifier_can_only_be_used_in_TypeScript_files: diag(8009, ts.DiagnosticCategory.Error, "The_0_modifier_can_only_be_used_in_TypeScript_files_8009", "The '{0}' modifier can only be used in TypeScript files."),
Type_annotations_can_only_be_used_in_TypeScript_files: diag(8010, ts.DiagnosticCategory.Error, "Type_annotations_can_only_be_used_in_TypeScript_files_8010", "Type annotations can only be used in TypeScript files."),
Type_arguments_can_only_be_used_in_TypeScript_files: diag(8011, ts.DiagnosticCategory.Error, "Type_arguments_can_only_be_used_in_TypeScript_files_8011", "Type arguments can only be used in TypeScript files."),
Parameter_modifiers_can_only_be_used_in_TypeScript_files: diag(8012, ts.DiagnosticCategory.Error, "Parameter_modifiers_can_only_be_used_in_TypeScript_files_8012", "Parameter modifiers can only be used in TypeScript files."),
Non_null_assertions_can_only_be_used_in_TypeScript_files: diag(8013, ts.DiagnosticCategory.Error, "Non_null_assertions_can_only_be_used_in_TypeScript_files_8013", "Non-null assertions can only be used in TypeScript files."),
Type_assertion_expressions_can_only_be_used_in_TypeScript_files: diag(8016, ts.DiagnosticCategory.Error, "Type_assertion_expressions_can_only_be_used_in_TypeScript_files_8016", "Type assertion expressions can only be used in TypeScript files."),
Octal_literal_types_must_use_ES2015_syntax_Use_the_syntax_0: diag(8017, ts.DiagnosticCategory.Error, "Octal_literal_types_must_use_ES2015_syntax_Use_the_syntax_0_8017", "Octal literal types must use ES2015 syntax. Use the syntax '{0}'."),
Octal_literals_are_not_allowed_in_enums_members_initializer_Use_the_syntax_0: diag(8018, ts.DiagnosticCategory.Error, "Octal_literals_are_not_allowed_in_enums_members_initializer_Use_the_syntax_0_8018", "Octal literals are not allowed in enums members initializer. Use the syntax '{0}'."),
Report_errors_in_js_files: diag(8019, ts.DiagnosticCategory.Message, "Report_errors_in_js_files_8019", "Report errors in .js files."),
JSDoc_types_can_only_be_used_inside_documentation_comments: diag(8020, ts.DiagnosticCategory.Error, "JSDoc_types_can_only_be_used_inside_documentation_comments_8020", "JSDoc types can only be used inside documentation comments."),
JSDoc_typedef_tag_should_either_have_a_type_annotation_or_be_followed_by_property_or_member_tags: diag(8021, ts.DiagnosticCategory.Error, "JSDoc_typedef_tag_should_either_have_a_type_annotation_or_be_followed_by_property_or_member_tags_8021", "JSDoc '@typedef' tag should either have a type annotation or be followed by '@property' or '@member' tags."),
JSDoc_0_is_not_attached_to_a_class: diag(8022, ts.DiagnosticCategory.Error, "JSDoc_0_is_not_attached_to_a_class_8022", "JSDoc '@{0}' is not attached to a class."),
JSDoc_0_1_does_not_match_the_extends_2_clause: diag(8023, ts.DiagnosticCategory.Error, "JSDoc_0_1_does_not_match_the_extends_2_clause_8023", "JSDoc '@{0} {1}' does not match the 'extends {2}' clause."),
JSDoc_param_tag_has_name_0_but_there_is_no_parameter_with_that_name: diag(8024, ts.DiagnosticCategory.Error, "JSDoc_param_tag_has_name_0_but_there_is_no_parameter_with_that_name_8024", "JSDoc '@param' tag has name '{0}', but there is no parameter with that name."),
Class_declarations_cannot_have_more_than_one_augments_or_extends_tag: diag(8025, ts.DiagnosticCategory.Error, "Class_declarations_cannot_have_more_than_one_augments_or_extends_tag_8025", "Class declarations cannot have more than one '@augments' or '@extends' tag."),
Expected_0_type_arguments_provide_these_with_an_extends_tag: diag(8026, ts.DiagnosticCategory.Error, "Expected_0_type_arguments_provide_these_with_an_extends_tag_8026", "Expected {0} type arguments; provide these with an '@extends' tag."),
Expected_0_1_type_arguments_provide_these_with_an_extends_tag: diag(8027, ts.DiagnosticCategory.Error, "Expected_0_1_type_arguments_provide_these_with_an_extends_tag_8027", "Expected {0}-{1} type arguments; provide these with an '@extends' tag."),
JSDoc_may_only_appear_in_the_last_parameter_of_a_signature: diag(8028, ts.DiagnosticCategory.Error, "JSDoc_may_only_appear_in_the_last_parameter_of_a_signature_8028", "JSDoc '...' may only appear in the last parameter of a signature."),
JSDoc_param_tag_has_name_0_but_there_is_no_parameter_with_that_name_It_would_match_arguments_if_it_had_an_array_type: diag(8029, ts.DiagnosticCategory.Error, "JSDoc_param_tag_has_name_0_but_there_is_no_parameter_with_that_name_It_would_match_arguments_if_it_h_8029", "JSDoc '@param' tag has name '{0}', but there is no parameter with that name. It would match 'arguments' if it had an array type."),
The_type_of_a_function_declaration_must_match_the_function_s_signature: diag(8030, ts.DiagnosticCategory.Error, "The_type_of_a_function_declaration_must_match_the_function_s_signature_8030", "The type of a function declaration must match the function's signature."),
You_cannot_rename_a_module_via_a_global_import: diag(8031, ts.DiagnosticCategory.Error, "You_cannot_rename_a_module_via_a_global_import_8031", "You cannot rename a module via a global import."),
Qualified_name_0_is_not_allowed_without_a_leading_param_object_1: diag(8032, ts.DiagnosticCategory.Error, "Qualified_name_0_is_not_allowed_without_a_leading_param_object_1_8032", "Qualified name '{0}' is not allowed without a leading '@param {object} {1}'."),
A_JSDoc_typedef_comment_may_not_contain_multiple_type_tags: diag(8033, ts.DiagnosticCategory.Error, "A_JSDoc_typedef_comment_may_not_contain_multiple_type_tags_8033", "A JSDoc '@typedef' comment may not contain multiple '@type' tags."),
The_tag_was_first_specified_here: diag(8034, ts.DiagnosticCategory.Error, "The_tag_was_first_specified_here_8034", "The tag was first specified here."),
Only_identifiers_Slashqualified_names_with_optional_type_arguments_are_currently_supported_in_a_class_extends_clause: diag(9002, ts.DiagnosticCategory.Error, "Only_identifiers_Slashqualified_names_with_optional_type_arguments_are_currently_supported_in_a_clas_9002", "Only identifiers/qualified-names with optional type arguments are currently supported in a class 'extends' clause."),
class_expressions_are_not_currently_supported: diag(9003, ts.DiagnosticCategory.Error, "class_expressions_are_not_currently_supported_9003", "'class' expressions are not currently supported."),
Language_service_is_disabled: diag(9004, ts.DiagnosticCategory.Error, "Language_service_is_disabled_9004", "Language service is disabled."),
Declaration_emit_for_this_file_requires_using_private_name_0_An_explicit_type_annotation_may_unblock_declaration_emit: diag(9005, ts.DiagnosticCategory.Error, "Declaration_emit_for_this_file_requires_using_private_name_0_An_explicit_type_annotation_may_unblock_9005", "Declaration emit for this file requires using private name '{0}'. An explicit type annotation may unblock declaration emit."),
Declaration_emit_for_this_file_requires_using_private_name_0_from_module_1_An_explicit_type_annotation_may_unblock_declaration_emit: diag(9006, ts.DiagnosticCategory.Error, "Declaration_emit_for_this_file_requires_using_private_name_0_from_module_1_An_explicit_type_annotati_9006", "Declaration emit for this file requires using private name '{0}' from module '{1}'. An explicit type annotation may unblock declaration emit."),
JSX_attributes_must_only_be_assigned_a_non_empty_expression: diag(17000, ts.DiagnosticCategory.Error, "JSX_attributes_must_only_be_assigned_a_non_empty_expression_17000", "JSX attributes must only be assigned a non-empty 'expression'."),
JSX_elements_cannot_have_multiple_attributes_with_the_same_name: diag(17001, ts.DiagnosticCategory.Error, "JSX_elements_cannot_have_multiple_attributes_with_the_same_name_17001", "JSX elements cannot have multiple attributes with the same name."),
Expected_corresponding_JSX_closing_tag_for_0: diag(17002, ts.DiagnosticCategory.Error, "Expected_corresponding_JSX_closing_tag_for_0_17002", "Expected corresponding JSX closing tag for '{0}'."),
JSX_attribute_expected: diag(17003, ts.DiagnosticCategory.Error, "JSX_attribute_expected_17003", "JSX attribute expected."),
Cannot_use_JSX_unless_the_jsx_flag_is_provided: diag(17004, ts.DiagnosticCategory.Error, "Cannot_use_JSX_unless_the_jsx_flag_is_provided_17004", "Cannot use JSX unless the '--jsx' flag is provided."),
A_constructor_cannot_contain_a_super_call_when_its_class_extends_null: diag(17005, ts.DiagnosticCategory.Error, "A_constructor_cannot_contain_a_super_call_when_its_class_extends_null_17005", "A constructor cannot contain a 'super' call when its class extends 'null'."),
An_unary_expression_with_the_0_operator_is_not_allowed_in_the_left_hand_side_of_an_exponentiation_expression_Consider_enclosing_the_expression_in_parentheses: diag(17006, ts.DiagnosticCategory.Error, "An_unary_expression_with_the_0_operator_is_not_allowed_in_the_left_hand_side_of_an_exponentiation_ex_17006", "An unary expression with the '{0}' operator is not allowed in the left-hand side of an exponentiation expression. Consider enclosing the expression in parentheses."),
A_type_assertion_expression_is_not_allowed_in_the_left_hand_side_of_an_exponentiation_expression_Consider_enclosing_the_expression_in_parentheses: diag(17007, ts.DiagnosticCategory.Error, "A_type_assertion_expression_is_not_allowed_in_the_left_hand_side_of_an_exponentiation_expression_Con_17007", "A type assertion expression is not allowed in the left-hand side of an exponentiation expression. Consider enclosing the expression in parentheses."),
JSX_element_0_has_no_corresponding_closing_tag: diag(17008, ts.DiagnosticCategory.Error, "JSX_element_0_has_no_corresponding_closing_tag_17008", "JSX element '{0}' has no corresponding closing tag."),
super_must_be_called_before_accessing_this_in_the_constructor_of_a_derived_class: diag(17009, ts.DiagnosticCategory.Error, "super_must_be_called_before_accessing_this_in_the_constructor_of_a_derived_class_17009", "'super' must be called before accessing 'this' in the constructor of a derived class."),
Unknown_type_acquisition_option_0: diag(17010, ts.DiagnosticCategory.Error, "Unknown_type_acquisition_option_0_17010", "Unknown type acquisition option '{0}'."),
super_must_be_called_before_accessing_a_property_of_super_in_the_constructor_of_a_derived_class: diag(17011, ts.DiagnosticCategory.Error, "super_must_be_called_before_accessing_a_property_of_super_in_the_constructor_of_a_derived_class_17011", "'super' must be called before accessing a property of 'super' in the constructor of a derived class."),
_0_is_not_a_valid_meta_property_for_keyword_1_Did_you_mean_2: diag(17012, ts.DiagnosticCategory.Error, "_0_is_not_a_valid_meta_property_for_keyword_1_Did_you_mean_2_17012", "'{0}' is not a valid meta-property for keyword '{1}'. Did you mean '{2}'?"),
Meta_property_0_is_only_allowed_in_the_body_of_a_function_declaration_function_expression_or_constructor: diag(17013, ts.DiagnosticCategory.Error, "Meta_property_0_is_only_allowed_in_the_body_of_a_function_declaration_function_expression_or_constru_17013", "Meta-property '{0}' is only allowed in the body of a function declaration, function expression, or constructor."),
JSX_fragment_has_no_corresponding_closing_tag: diag(17014, ts.DiagnosticCategory.Error, "JSX_fragment_has_no_corresponding_closing_tag_17014", "JSX fragment has no corresponding closing tag."),
Expected_corresponding_closing_tag_for_JSX_fragment: diag(17015, ts.DiagnosticCategory.Error, "Expected_corresponding_closing_tag_for_JSX_fragment_17015", "Expected corresponding closing tag for JSX fragment."),
The_jsxFragmentFactory_compiler_option_must_be_provided_to_use_JSX_fragments_with_the_jsxFactory_compiler_option: diag(17016, ts.DiagnosticCategory.Error, "The_jsxFragmentFactory_compiler_option_must_be_provided_to_use_JSX_fragments_with_the_jsxFactory_com_17016", "The 'jsxFragmentFactory' compiler option must be provided to use JSX fragments with the 'jsxFactory' compiler option."),
An_jsxFrag_pragma_is_required_when_using_an_jsx_pragma_with_JSX_fragments: diag(17017, ts.DiagnosticCategory.Error, "An_jsxFrag_pragma_is_required_when_using_an_jsx_pragma_with_JSX_fragments_17017", "An @jsxFrag pragma is required when using an @jsx pragma with JSX fragments."),
Unknown_type_acquisition_option_0_Did_you_mean_1: diag(17018, ts.DiagnosticCategory.Error, "Unknown_type_acquisition_option_0_Did_you_mean_1_17018", "Unknown type acquisition option '{0}'. Did you mean '{1}'?"),
Circularity_detected_while_resolving_configuration_Colon_0: diag(18000, ts.DiagnosticCategory.Error, "Circularity_detected_while_resolving_configuration_Colon_0_18000", "Circularity detected while resolving configuration: {0}"),
A_path_in_an_extends_option_must_be_relative_or_rooted_but_0_is_not: diag(18001, ts.DiagnosticCategory.Error, "A_path_in_an_extends_option_must_be_relative_or_rooted_but_0_is_not_18001", "A path in an 'extends' option must be relative or rooted, but '{0}' is not."),
The_files_list_in_config_file_0_is_empty: diag(18002, ts.DiagnosticCategory.Error, "The_files_list_in_config_file_0_is_empty_18002", "The 'files' list in config file '{0}' is empty."),
No_inputs_were_found_in_config_file_0_Specified_include_paths_were_1_and_exclude_paths_were_2: diag(18003, ts.DiagnosticCategory.Error, "No_inputs_were_found_in_config_file_0_Specified_include_paths_were_1_and_exclude_paths_were_2_18003", "No inputs were found in config file '{0}'. Specified 'include' paths were '{1}' and 'exclude' paths were '{2}'."),
File_is_a_CommonJS_module_it_may_be_converted_to_an_ES6_module: diag(80001, ts.DiagnosticCategory.Suggestion, "File_is_a_CommonJS_module_it_may_be_converted_to_an_ES6_module_80001", "File is a CommonJS module; it may be converted to an ES6 module."),
This_constructor_function_may_be_converted_to_a_class_declaration: diag(80002, ts.DiagnosticCategory.Suggestion, "This_constructor_function_may_be_converted_to_a_class_declaration_80002", "This constructor function may be converted to a class declaration."),
Import_may_be_converted_to_a_default_import: diag(80003, ts.DiagnosticCategory.Suggestion, "Import_may_be_converted_to_a_default_import_80003", "Import may be converted to a default import."),
JSDoc_types_may_be_moved_to_TypeScript_types: diag(80004, ts.DiagnosticCategory.Suggestion, "JSDoc_types_may_be_moved_to_TypeScript_types_80004", "JSDoc types may be moved to TypeScript types."),
require_call_may_be_converted_to_an_import: diag(80005, ts.DiagnosticCategory.Suggestion, "require_call_may_be_converted_to_an_import_80005", "'require' call may be converted to an import."),
This_may_be_converted_to_an_async_function: diag(80006, ts.DiagnosticCategory.Suggestion, "This_may_be_converted_to_an_async_function_80006", "This may be converted to an async function."),
await_has_no_effect_on_the_type_of_this_expression: diag(80007, ts.DiagnosticCategory.Suggestion, "await_has_no_effect_on_the_type_of_this_expression_80007", "'await' has no effect on the type of this expression."),
Numeric_literals_with_absolute_values_equal_to_2_53_or_greater_are_too_large_to_be_represented_accurately_as_integers: diag(80008, ts.DiagnosticCategory.Suggestion, "Numeric_literals_with_absolute_values_equal_to_2_53_or_greater_are_too_large_to_be_represented_accur_80008", "Numeric literals with absolute values equal to 2^53 or greater are too large to be represented accurately as integers."),
Add_missing_super_call: diag(90001, ts.DiagnosticCategory.Message, "Add_missing_super_call_90001", "Add missing 'super()' call"),
Make_super_call_the_first_statement_in_the_constructor: diag(90002, ts.DiagnosticCategory.Message, "Make_super_call_the_first_statement_in_the_constructor_90002", "Make 'super()' call the first statement in the constructor"),
Change_extends_to_implements: diag(90003, ts.DiagnosticCategory.Message, "Change_extends_to_implements_90003", "Change 'extends' to 'implements'"),
Remove_unused_declaration_for_Colon_0: diag(90004, ts.DiagnosticCategory.Message, "Remove_unused_declaration_for_Colon_0_90004", "Remove unused declaration for: '{0}'"),
Remove_import_from_0: diag(90005, ts.DiagnosticCategory.Message, "Remove_import_from_0_90005", "Remove import from '{0}'"),
Implement_interface_0: diag(90006, ts.DiagnosticCategory.Message, "Implement_interface_0_90006", "Implement interface '{0}'"),
Implement_inherited_abstract_class: diag(90007, ts.DiagnosticCategory.Message, "Implement_inherited_abstract_class_90007", "Implement inherited abstract class"),
Add_0_to_unresolved_variable: diag(90008, ts.DiagnosticCategory.Message, "Add_0_to_unresolved_variable_90008", "Add '{0}.' to unresolved variable"),
Remove_variable_statement: diag(90010, ts.DiagnosticCategory.Message, "Remove_variable_statement_90010", "Remove variable statement"),
Remove_template_tag: diag(90011, ts.DiagnosticCategory.Message, "Remove_template_tag_90011", "Remove template tag"),
Remove_type_parameters: diag(90012, ts.DiagnosticCategory.Message, "Remove_type_parameters_90012", "Remove type parameters"),
Import_0_from_module_1: diag(90013, ts.DiagnosticCategory.Message, "Import_0_from_module_1_90013", "Import '{0}' from module \"{1}\""),
Change_0_to_1: diag(90014, ts.DiagnosticCategory.Message, "Change_0_to_1_90014", "Change '{0}' to '{1}'"),
Add_0_to_existing_import_declaration_from_1: diag(90015, ts.DiagnosticCategory.Message, "Add_0_to_existing_import_declaration_from_1_90015", "Add '{0}' to existing import declaration from \"{1}\""),
Declare_property_0: diag(90016, ts.DiagnosticCategory.Message, "Declare_property_0_90016", "Declare property '{0}'"),
Add_index_signature_for_property_0: diag(90017, ts.DiagnosticCategory.Message, "Add_index_signature_for_property_0_90017", "Add index signature for property '{0}'"),
Disable_checking_for_this_file: diag(90018, ts.DiagnosticCategory.Message, "Disable_checking_for_this_file_90018", "Disable checking for this file"),
Ignore_this_error_message: diag(90019, ts.DiagnosticCategory.Message, "Ignore_this_error_message_90019", "Ignore this error message"),
Initialize_property_0_in_the_constructor: diag(90020, ts.DiagnosticCategory.Message, "Initialize_property_0_in_the_constructor_90020", "Initialize property '{0}' in the constructor"),
Initialize_static_property_0: diag(90021, ts.DiagnosticCategory.Message, "Initialize_static_property_0_90021", "Initialize static property '{0}'"),
Change_spelling_to_0: diag(90022, ts.DiagnosticCategory.Message, "Change_spelling_to_0_90022", "Change spelling to '{0}'"),
Declare_method_0: diag(90023, ts.DiagnosticCategory.Message, "Declare_method_0_90023", "Declare method '{0}'"),
Declare_static_method_0: diag(90024, ts.DiagnosticCategory.Message, "Declare_static_method_0_90024", "Declare static method '{0}'"),
Prefix_0_with_an_underscore: diag(90025, ts.DiagnosticCategory.Message, "Prefix_0_with_an_underscore_90025", "Prefix '{0}' with an underscore"),
Rewrite_as_the_indexed_access_type_0: diag(90026, ts.DiagnosticCategory.Message, "Rewrite_as_the_indexed_access_type_0_90026", "Rewrite as the indexed access type '{0}'"),
Declare_static_property_0: diag(90027, ts.DiagnosticCategory.Message, "Declare_static_property_0_90027", "Declare static property '{0}'"),
Call_decorator_expression: diag(90028, ts.DiagnosticCategory.Message, "Call_decorator_expression_90028", "Call decorator expression"),
Add_async_modifier_to_containing_function: diag(90029, ts.DiagnosticCategory.Message, "Add_async_modifier_to_containing_function_90029", "Add async modifier to containing function"),
Replace_infer_0_with_unknown: diag(90030, ts.DiagnosticCategory.Message, "Replace_infer_0_with_unknown_90030", "Replace 'infer {0}' with 'unknown'"),
Replace_all_unused_infer_with_unknown: diag(90031, ts.DiagnosticCategory.Message, "Replace_all_unused_infer_with_unknown_90031", "Replace all unused 'infer' with 'unknown'"),
Import_default_0_from_module_1: diag(90032, ts.DiagnosticCategory.Message, "Import_default_0_from_module_1_90032", "Import default '{0}' from module \"{1}\""),
Add_default_import_0_to_existing_import_declaration_from_1: diag(90033, ts.DiagnosticCategory.Message, "Add_default_import_0_to_existing_import_declaration_from_1_90033", "Add default import '{0}' to existing import declaration from \"{1}\""),
Add_parameter_name: diag(90034, ts.DiagnosticCategory.Message, "Add_parameter_name_90034", "Add parameter name"),
Declare_private_property_0: diag(90035, ts.DiagnosticCategory.Message, "Declare_private_property_0_90035", "Declare private property '{0}'"),
Replace_0_with_Promise_1: diag(90036, ts.DiagnosticCategory.Message, "Replace_0_with_Promise_1_90036", "Replace '{0}' with 'Promise<{1}>'"),
Fix_all_incorrect_return_type_of_an_async_functions: diag(90037, ts.DiagnosticCategory.Message, "Fix_all_incorrect_return_type_of_an_async_functions_90037", "Fix all incorrect return type of an async functions"),
Declare_private_method_0: diag(90038, ts.DiagnosticCategory.Message, "Declare_private_method_0_90038", "Declare private method '{0}'"),
Remove_unused_destructuring_declaration: diag(90039, ts.DiagnosticCategory.Message, "Remove_unused_destructuring_declaration_90039", "Remove unused destructuring declaration"),
Remove_unused_declarations_for_Colon_0: diag(90041, ts.DiagnosticCategory.Message, "Remove_unused_declarations_for_Colon_0_90041", "Remove unused declarations for: '{0}'"),
Declare_a_private_field_named_0: diag(90053, ts.DiagnosticCategory.Message, "Declare_a_private_field_named_0_90053", "Declare a private field named '{0}'."),
Convert_function_to_an_ES2015_class: diag(95001, ts.DiagnosticCategory.Message, "Convert_function_to_an_ES2015_class_95001", "Convert function to an ES2015 class"),
Convert_function_0_to_class: diag(95002, ts.DiagnosticCategory.Message, "Convert_function_0_to_class_95002", "Convert function '{0}' to class"),
Convert_0_to_1_in_0: diag(95003, ts.DiagnosticCategory.Message, "Convert_0_to_1_in_0_95003", "Convert '{0}' to '{1} in {0}'"),
Extract_to_0_in_1: diag(95004, ts.DiagnosticCategory.Message, "Extract_to_0_in_1_95004", "Extract to {0} in {1}"),
Extract_function: diag(95005, ts.DiagnosticCategory.Message, "Extract_function_95005", "Extract function"),
Extract_constant: diag(95006, ts.DiagnosticCategory.Message, "Extract_constant_95006", "Extract constant"),
Extract_to_0_in_enclosing_scope: diag(95007, ts.DiagnosticCategory.Message, "Extract_to_0_in_enclosing_scope_95007", "Extract to {0} in enclosing scope"),
Extract_to_0_in_1_scope: diag(95008, ts.DiagnosticCategory.Message, "Extract_to_0_in_1_scope_95008", "Extract to {0} in {1} scope"),
Annotate_with_type_from_JSDoc: diag(95009, ts.DiagnosticCategory.Message, "Annotate_with_type_from_JSDoc_95009", "Annotate with type from JSDoc"),
Annotate_with_types_from_JSDoc: diag(95010, ts.DiagnosticCategory.Message, "Annotate_with_types_from_JSDoc_95010", "Annotate with types from JSDoc"),
Infer_type_of_0_from_usage: diag(95011, ts.DiagnosticCategory.Message, "Infer_type_of_0_from_usage_95011", "Infer type of '{0}' from usage"),
Infer_parameter_types_from_usage: diag(95012, ts.DiagnosticCategory.Message, "Infer_parameter_types_from_usage_95012", "Infer parameter types from usage"),
Convert_to_default_import: diag(95013, ts.DiagnosticCategory.Message, "Convert_to_default_import_95013", "Convert to default import"),
Install_0: diag(95014, ts.DiagnosticCategory.Message, "Install_0_95014", "Install '{0}'"),
Replace_import_with_0: diag(95015, ts.DiagnosticCategory.Message, "Replace_import_with_0_95015", "Replace import with '{0}'."),
Use_synthetic_default_member: diag(95016, ts.DiagnosticCategory.Message, "Use_synthetic_default_member_95016", "Use synthetic 'default' member."),
Convert_to_ES6_module: diag(95017, ts.DiagnosticCategory.Message, "Convert_to_ES6_module_95017", "Convert to ES6 module"),
Add_undefined_type_to_property_0: diag(95018, ts.DiagnosticCategory.Message, "Add_undefined_type_to_property_0_95018", "Add 'undefined' type to property '{0}'"),
Add_initializer_to_property_0: diag(95019, ts.DiagnosticCategory.Message, "Add_initializer_to_property_0_95019", "Add initializer to property '{0}'"),
Add_definite_assignment_assertion_to_property_0: diag(95020, ts.DiagnosticCategory.Message, "Add_definite_assignment_assertion_to_property_0_95020", "Add definite assignment assertion to property '{0}'"),
Convert_all_type_literals_to_mapped_type: diag(95021, ts.DiagnosticCategory.Message, "Convert_all_type_literals_to_mapped_type_95021", "Convert all type literals to mapped type"),
Add_all_missing_members: diag(95022, ts.DiagnosticCategory.Message, "Add_all_missing_members_95022", "Add all missing members"),
Infer_all_types_from_usage: diag(95023, ts.DiagnosticCategory.Message, "Infer_all_types_from_usage_95023", "Infer all types from usage"),
Delete_all_unused_declarations: diag(95024, ts.DiagnosticCategory.Message, "Delete_all_unused_declarations_95024", "Delete all unused declarations"),
Prefix_all_unused_declarations_with_where_possible: diag(95025, ts.DiagnosticCategory.Message, "Prefix_all_unused_declarations_with_where_possible_95025", "Prefix all unused declarations with '_' where possible"),
Fix_all_detected_spelling_errors: diag(95026, ts.DiagnosticCategory.Message, "Fix_all_detected_spelling_errors_95026", "Fix all detected spelling errors"),
Add_initializers_to_all_uninitialized_properties: diag(95027, ts.DiagnosticCategory.Message, "Add_initializers_to_all_uninitialized_properties_95027", "Add initializers to all uninitialized properties"),
Add_definite_assignment_assertions_to_all_uninitialized_properties: diag(95028, ts.DiagnosticCategory.Message, "Add_definite_assignment_assertions_to_all_uninitialized_properties_95028", "Add definite assignment assertions to all uninitialized properties"),
Add_undefined_type_to_all_uninitialized_properties: diag(95029, ts.DiagnosticCategory.Message, "Add_undefined_type_to_all_uninitialized_properties_95029", "Add undefined type to all uninitialized properties"),
Change_all_jsdoc_style_types_to_TypeScript: diag(95030, ts.DiagnosticCategory.Message, "Change_all_jsdoc_style_types_to_TypeScript_95030", "Change all jsdoc-style types to TypeScript"),
Change_all_jsdoc_style_types_to_TypeScript_and_add_undefined_to_nullable_types: diag(95031, ts.DiagnosticCategory.Message, "Change_all_jsdoc_style_types_to_TypeScript_and_add_undefined_to_nullable_types_95031", "Change all jsdoc-style types to TypeScript (and add '| undefined' to nullable types)"),
Implement_all_unimplemented_interfaces: diag(95032, ts.DiagnosticCategory.Message, "Implement_all_unimplemented_interfaces_95032", "Implement all unimplemented interfaces"),
Install_all_missing_types_packages: diag(95033, ts.DiagnosticCategory.Message, "Install_all_missing_types_packages_95033", "Install all missing types packages"),
Rewrite_all_as_indexed_access_types: diag(95034, ts.DiagnosticCategory.Message, "Rewrite_all_as_indexed_access_types_95034", "Rewrite all as indexed access types"),
Convert_all_to_default_imports: diag(95035, ts.DiagnosticCategory.Message, "Convert_all_to_default_imports_95035", "Convert all to default imports"),
Make_all_super_calls_the_first_statement_in_their_constructor: diag(95036, ts.DiagnosticCategory.Message, "Make_all_super_calls_the_first_statement_in_their_constructor_95036", "Make all 'super()' calls the first statement in their constructor"),
Add_qualifier_to_all_unresolved_variables_matching_a_member_name: diag(95037, ts.DiagnosticCategory.Message, "Add_qualifier_to_all_unresolved_variables_matching_a_member_name_95037", "Add qualifier to all unresolved variables matching a member name"),
Change_all_extended_interfaces_to_implements: diag(95038, ts.DiagnosticCategory.Message, "Change_all_extended_interfaces_to_implements_95038", "Change all extended interfaces to 'implements'"),
Add_all_missing_super_calls: diag(95039, ts.DiagnosticCategory.Message, "Add_all_missing_super_calls_95039", "Add all missing super calls"),
Implement_all_inherited_abstract_classes: diag(95040, ts.DiagnosticCategory.Message, "Implement_all_inherited_abstract_classes_95040", "Implement all inherited abstract classes"),
Add_all_missing_async_modifiers: diag(95041, ts.DiagnosticCategory.Message, "Add_all_missing_async_modifiers_95041", "Add all missing 'async' modifiers"),
Add_ts_ignore_to_all_error_messages: diag(95042, ts.DiagnosticCategory.Message, "Add_ts_ignore_to_all_error_messages_95042", "Add '@ts-ignore' to all error messages"),
Annotate_everything_with_types_from_JSDoc: diag(95043, ts.DiagnosticCategory.Message, "Annotate_everything_with_types_from_JSDoc_95043", "Annotate everything with types from JSDoc"),
Add_to_all_uncalled_decorators: diag(95044, ts.DiagnosticCategory.Message, "Add_to_all_uncalled_decorators_95044", "Add '()' to all uncalled decorators"),
Convert_all_constructor_functions_to_classes: diag(95045, ts.DiagnosticCategory.Message, "Convert_all_constructor_functions_to_classes_95045", "Convert all constructor functions to classes"),
Generate_get_and_set_accessors: diag(95046, ts.DiagnosticCategory.Message, "Generate_get_and_set_accessors_95046", "Generate 'get' and 'set' accessors"),
Convert_require_to_import: diag(95047, ts.DiagnosticCategory.Message, "Convert_require_to_import_95047", "Convert 'require' to 'import'"),
Convert_all_require_to_import: diag(95048, ts.DiagnosticCategory.Message, "Convert_all_require_to_import_95048", "Convert all 'require' to 'import'"),
Move_to_a_new_file: diag(95049, ts.DiagnosticCategory.Message, "Move_to_a_new_file_95049", "Move to a new file"),
Remove_unreachable_code: diag(95050, ts.DiagnosticCategory.Message, "Remove_unreachable_code_95050", "Remove unreachable code"),
Remove_all_unreachable_code: diag(95051, ts.DiagnosticCategory.Message, "Remove_all_unreachable_code_95051", "Remove all unreachable code"),
Add_missing_typeof: diag(95052, ts.DiagnosticCategory.Message, "Add_missing_typeof_95052", "Add missing 'typeof'"),
Remove_unused_label: diag(95053, ts.DiagnosticCategory.Message, "Remove_unused_label_95053", "Remove unused label"),
Remove_all_unused_labels: diag(95054, ts.DiagnosticCategory.Message, "Remove_all_unused_labels_95054", "Remove all unused labels"),
Convert_0_to_mapped_object_type: diag(95055, ts.DiagnosticCategory.Message, "Convert_0_to_mapped_object_type_95055", "Convert '{0}' to mapped object type"),
Convert_namespace_import_to_named_imports: diag(95056, ts.DiagnosticCategory.Message, "Convert_namespace_import_to_named_imports_95056", "Convert namespace import to named imports"),
Convert_named_imports_to_namespace_import: diag(95057, ts.DiagnosticCategory.Message, "Convert_named_imports_to_namespace_import_95057", "Convert named imports to namespace import"),
Add_or_remove_braces_in_an_arrow_function: diag(95058, ts.DiagnosticCategory.Message, "Add_or_remove_braces_in_an_arrow_function_95058", "Add or remove braces in an arrow function"),
Add_braces_to_arrow_function: diag(95059, ts.DiagnosticCategory.Message, "Add_braces_to_arrow_function_95059", "Add braces to arrow function"),
Remove_braces_from_arrow_function: diag(95060, ts.DiagnosticCategory.Message, "Remove_braces_from_arrow_function_95060", "Remove braces from arrow function"),
Convert_default_export_to_named_export: diag(95061, ts.DiagnosticCategory.Message, "Convert_default_export_to_named_export_95061", "Convert default export to named export"),
Convert_named_export_to_default_export: diag(95062, ts.DiagnosticCategory.Message, "Convert_named_export_to_default_export_95062", "Convert named export to default export"),
Add_missing_enum_member_0: diag(95063, ts.DiagnosticCategory.Message, "Add_missing_enum_member_0_95063", "Add missing enum member '{0}'"),
Add_all_missing_imports: diag(95064, ts.DiagnosticCategory.Message, "Add_all_missing_imports_95064", "Add all missing imports"),
Convert_to_async_function: diag(95065, ts.DiagnosticCategory.Message, "Convert_to_async_function_95065", "Convert to async function"),
Convert_all_to_async_functions: diag(95066, ts.DiagnosticCategory.Message, "Convert_all_to_async_functions_95066", "Convert all to async functions"),
Add_missing_call_parentheses: diag(95067, ts.DiagnosticCategory.Message, "Add_missing_call_parentheses_95067", "Add missing call parentheses"),
Add_all_missing_call_parentheses: diag(95068, ts.DiagnosticCategory.Message, "Add_all_missing_call_parentheses_95068", "Add all missing call parentheses"),
Add_unknown_conversion_for_non_overlapping_types: diag(95069, ts.DiagnosticCategory.Message, "Add_unknown_conversion_for_non_overlapping_types_95069", "Add 'unknown' conversion for non-overlapping types"),
Add_unknown_to_all_conversions_of_non_overlapping_types: diag(95070, ts.DiagnosticCategory.Message, "Add_unknown_to_all_conversions_of_non_overlapping_types_95070", "Add 'unknown' to all conversions of non-overlapping types"),
Add_missing_new_operator_to_call: diag(95071, ts.DiagnosticCategory.Message, "Add_missing_new_operator_to_call_95071", "Add missing 'new' operator to call"),
Add_missing_new_operator_to_all_calls: diag(95072, ts.DiagnosticCategory.Message, "Add_missing_new_operator_to_all_calls_95072", "Add missing 'new' operator to all calls"),
Add_names_to_all_parameters_without_names: diag(95073, ts.DiagnosticCategory.Message, "Add_names_to_all_parameters_without_names_95073", "Add names to all parameters without names"),
Enable_the_experimentalDecorators_option_in_your_configuration_file: diag(95074, ts.DiagnosticCategory.Message, "Enable_the_experimentalDecorators_option_in_your_configuration_file_95074", "Enable the 'experimentalDecorators' option in your configuration file"),
Convert_parameters_to_destructured_object: diag(95075, ts.DiagnosticCategory.Message, "Convert_parameters_to_destructured_object_95075", "Convert parameters to destructured object"),
Extract_type: diag(95077, ts.DiagnosticCategory.Message, "Extract_type_95077", "Extract type"),
Extract_to_type_alias: diag(95078, ts.DiagnosticCategory.Message, "Extract_to_type_alias_95078", "Extract to type alias"),
Extract_to_typedef: diag(95079, ts.DiagnosticCategory.Message, "Extract_to_typedef_95079", "Extract to typedef"),
Infer_this_type_of_0_from_usage: diag(95080, ts.DiagnosticCategory.Message, "Infer_this_type_of_0_from_usage_95080", "Infer 'this' type of '{0}' from usage"),
Add_const_to_unresolved_variable: diag(95081, ts.DiagnosticCategory.Message, "Add_const_to_unresolved_variable_95081", "Add 'const' to unresolved variable"),
Add_const_to_all_unresolved_variables: diag(95082, ts.DiagnosticCategory.Message, "Add_const_to_all_unresolved_variables_95082", "Add 'const' to all unresolved variables"),
Add_await: diag(95083, ts.DiagnosticCategory.Message, "Add_await_95083", "Add 'await'"),
Add_await_to_initializer_for_0: diag(95084, ts.DiagnosticCategory.Message, "Add_await_to_initializer_for_0_95084", "Add 'await' to initializer for '{0}'"),
Fix_all_expressions_possibly_missing_await: diag(95085, ts.DiagnosticCategory.Message, "Fix_all_expressions_possibly_missing_await_95085", "Fix all expressions possibly missing 'await'"),
Remove_unnecessary_await: diag(95086, ts.DiagnosticCategory.Message, "Remove_unnecessary_await_95086", "Remove unnecessary 'await'"),
Remove_all_unnecessary_uses_of_await: diag(95087, ts.DiagnosticCategory.Message, "Remove_all_unnecessary_uses_of_await_95087", "Remove all unnecessary uses of 'await'"),
Enable_the_jsx_flag_in_your_configuration_file: diag(95088, ts.DiagnosticCategory.Message, "Enable_the_jsx_flag_in_your_configuration_file_95088", "Enable the '--jsx' flag in your configuration file"),
Add_await_to_initializers: diag(95089, ts.DiagnosticCategory.Message, "Add_await_to_initializers_95089", "Add 'await' to initializers"),
Extract_to_interface: diag(95090, ts.DiagnosticCategory.Message, "Extract_to_interface_95090", "Extract to interface"),
Convert_to_a_bigint_numeric_literal: diag(95091, ts.DiagnosticCategory.Message, "Convert_to_a_bigint_numeric_literal_95091", "Convert to a bigint numeric literal"),
Convert_all_to_bigint_numeric_literals: diag(95092, ts.DiagnosticCategory.Message, "Convert_all_to_bigint_numeric_literals_95092", "Convert all to bigint numeric literals"),
Convert_const_to_let: diag(95093, ts.DiagnosticCategory.Message, "Convert_const_to_let_95093", "Convert 'const' to 'let'"),
Prefix_with_declare: diag(95094, ts.DiagnosticCategory.Message, "Prefix_with_declare_95094", "Prefix with 'declare'"),
Prefix_all_incorrect_property_declarations_with_declare: diag(95095, ts.DiagnosticCategory.Message, "Prefix_all_incorrect_property_declarations_with_declare_95095", "Prefix all incorrect property declarations with 'declare'"),
Convert_to_template_string: diag(95096, ts.DiagnosticCategory.Message, "Convert_to_template_string_95096", "Convert to template string"),
Add_export_to_make_this_file_into_a_module: diag(95097, ts.DiagnosticCategory.Message, "Add_export_to_make_this_file_into_a_module_95097", "Add 'export {}' to make this file into a module"),
Set_the_target_option_in_your_configuration_file_to_0: diag(95098, ts.DiagnosticCategory.Message, "Set_the_target_option_in_your_configuration_file_to_0_95098", "Set the 'target' option in your configuration file to '{0}'"),
Set_the_module_option_in_your_configuration_file_to_0: diag(95099, ts.DiagnosticCategory.Message, "Set_the_module_option_in_your_configuration_file_to_0_95099", "Set the 'module' option in your configuration file to '{0}'"),
Convert_invalid_character_to_its_html_entity_code: diag(95100, ts.DiagnosticCategory.Message, "Convert_invalid_character_to_its_html_entity_code_95100", "Convert invalid character to its html entity code"),
Convert_all_invalid_characters_to_HTML_entity_code: diag(95101, ts.DiagnosticCategory.Message, "Convert_all_invalid_characters_to_HTML_entity_code_95101", "Convert all invalid characters to HTML entity code"),
Add_class_tag: diag(95102, ts.DiagnosticCategory.Message, "Add_class_tag_95102", "Add '@class' tag"),
Add_this_tag: diag(95103, ts.DiagnosticCategory.Message, "Add_this_tag_95103", "Add '@this' tag"),
Add_this_parameter: diag(95104, ts.DiagnosticCategory.Message, "Add_this_parameter_95104", "Add 'this' parameter."),
Convert_function_expression_0_to_arrow_function: diag(95105, ts.DiagnosticCategory.Message, "Convert_function_expression_0_to_arrow_function_95105", "Convert function expression '{0}' to arrow function"),
Convert_function_declaration_0_to_arrow_function: diag(95106, ts.DiagnosticCategory.Message, "Convert_function_declaration_0_to_arrow_function_95106", "Convert function declaration '{0}' to arrow function"),
Fix_all_implicit_this_errors: diag(95107, ts.DiagnosticCategory.Message, "Fix_all_implicit_this_errors_95107", "Fix all implicit-'this' errors"),
Wrap_invalid_character_in_an_expression_container: diag(95108, ts.DiagnosticCategory.Message, "Wrap_invalid_character_in_an_expression_container_95108", "Wrap invalid character in an expression container"),
Wrap_all_invalid_characters_in_an_expression_container: diag(95109, ts.DiagnosticCategory.Message, "Wrap_all_invalid_characters_in_an_expression_container_95109", "Wrap all invalid characters in an expression container"),
Visit_https_Colon_Slash_Slashaka_ms_Slashtsconfig_json_to_read_more_about_this_file: diag(95110, ts.DiagnosticCategory.Message, "Visit_https_Colon_Slash_Slashaka_ms_Slashtsconfig_json_to_read_more_about_this_file_95110", "Visit https://aka.ms/tsconfig.json to read more about this file"),
Add_a_return_statement: diag(95111, ts.DiagnosticCategory.Message, "Add_a_return_statement_95111", "Add a return statement"),
Remove_braces_from_arrow_function_body: diag(95112, ts.DiagnosticCategory.Message, "Remove_braces_from_arrow_function_body_95112", "Remove braces from arrow function body"),
Wrap_the_following_body_with_parentheses_which_should_be_an_object_literal: diag(95113, ts.DiagnosticCategory.Message, "Wrap_the_following_body_with_parentheses_which_should_be_an_object_literal_95113", "Wrap the following body with parentheses which should be an object literal"),
Add_all_missing_return_statement: diag(95114, ts.DiagnosticCategory.Message, "Add_all_missing_return_statement_95114", "Add all missing return statement"),
Remove_braces_from_all_arrow_function_bodies_with_relevant_issues: diag(95115, ts.DiagnosticCategory.Message, "Remove_braces_from_all_arrow_function_bodies_with_relevant_issues_95115", "Remove braces from all arrow function bodies with relevant issues"),
Wrap_all_object_literal_with_parentheses: diag(95116, ts.DiagnosticCategory.Message, "Wrap_all_object_literal_with_parentheses_95116", "Wrap all object literal with parentheses"),
Move_labeled_tuple_element_modifiers_to_labels: diag(95117, ts.DiagnosticCategory.Message, "Move_labeled_tuple_element_modifiers_to_labels_95117", "Move labeled tuple element modifiers to labels"),
Convert_overload_list_to_single_signature: diag(95118, ts.DiagnosticCategory.Message, "Convert_overload_list_to_single_signature_95118", "Convert overload list to single signature"),
Generate_get_and_set_accessors_for_all_overriding_properties: diag(95119, ts.DiagnosticCategory.Message, "Generate_get_and_set_accessors_for_all_overriding_properties_95119", "Generate 'get' and 'set' accessors for all overriding properties"),
Wrap_in_JSX_fragment: diag(95120, ts.DiagnosticCategory.Message, "Wrap_in_JSX_fragment_95120", "Wrap in JSX fragment"),
Wrap_all_unparented_JSX_in_JSX_fragment: diag(95121, ts.DiagnosticCategory.Message, "Wrap_all_unparented_JSX_in_JSX_fragment_95121", "Wrap all unparented JSX in JSX fragment"),
Convert_arrow_function_or_function_expression: diag(95122, ts.DiagnosticCategory.Message, "Convert_arrow_function_or_function_expression_95122", "Convert arrow function or function expression"),
Convert_to_anonymous_function: diag(95123, ts.DiagnosticCategory.Message, "Convert_to_anonymous_function_95123", "Convert to anonymous function"),
Convert_to_named_function: diag(95124, ts.DiagnosticCategory.Message, "Convert_to_named_function_95124", "Convert to named function"),
Convert_to_arrow_function: diag(95125, ts.DiagnosticCategory.Message, "Convert_to_arrow_function_95125", "Convert to arrow function"),
Remove_parentheses: diag(95126, ts.DiagnosticCategory.Message, "Remove_parentheses_95126", "Remove parentheses"),
Could_not_find_a_containing_arrow_function: diag(95127, ts.DiagnosticCategory.Message, "Could_not_find_a_containing_arrow_function_95127", "Could not find a containing arrow function"),
Containing_function_is_not_an_arrow_function: diag(95128, ts.DiagnosticCategory.Message, "Containing_function_is_not_an_arrow_function_95128", "Containing function is not an arrow function"),
Could_not_find_export_statement: diag(95129, ts.DiagnosticCategory.Message, "Could_not_find_export_statement_95129", "Could not find export statement"),
This_file_already_has_a_default_export: diag(95130, ts.DiagnosticCategory.Message, "This_file_already_has_a_default_export_95130", "This file already has a default export"),
Could_not_find_import_clause: diag(95131, ts.DiagnosticCategory.Message, "Could_not_find_import_clause_95131", "Could not find import clause"),
Could_not_find_namespace_import_or_named_imports: diag(95132, ts.DiagnosticCategory.Message, "Could_not_find_namespace_import_or_named_imports_95132", "Could not find namespace import or named imports"),
Selection_is_not_a_valid_type_node: diag(95133, ts.DiagnosticCategory.Message, "Selection_is_not_a_valid_type_node_95133", "Selection is not a valid type node"),
No_type_could_be_extracted_from_this_type_node: diag(95134, ts.DiagnosticCategory.Message, "No_type_could_be_extracted_from_this_type_node_95134", "No type could be extracted from this type node"),
Could_not_find_property_for_which_to_generate_accessor: diag(95135, ts.DiagnosticCategory.Message, "Could_not_find_property_for_which_to_generate_accessor_95135", "Could not find property for which to generate accessor"),
Name_is_not_valid: diag(95136, ts.DiagnosticCategory.Message, "Name_is_not_valid_95136", "Name is not valid"),
Can_only_convert_property_with_modifier: diag(95137, ts.DiagnosticCategory.Message, "Can_only_convert_property_with_modifier_95137", "Can only convert property with modifier"),
Switch_each_misused_0_to_1: diag(95138, ts.DiagnosticCategory.Message, "Switch_each_misused_0_to_1_95138", "Switch each misused '{0}' to '{1}'"),
Convert_to_optional_chain_expression: diag(95139, ts.DiagnosticCategory.Message, "Convert_to_optional_chain_expression_95139", "Convert to optional chain expression"),
Could_not_find_convertible_access_expression: diag(95140, ts.DiagnosticCategory.Message, "Could_not_find_convertible_access_expression_95140", "Could not find convertible access expression"),
Could_not_find_matching_access_expressions: diag(95141, ts.DiagnosticCategory.Message, "Could_not_find_matching_access_expressions_95141", "Could not find matching access expressions"),
Can_only_convert_logical_AND_access_chains: diag(95142, ts.DiagnosticCategory.Message, "Can_only_convert_logical_AND_access_chains_95142", "Can only convert logical AND access chains"),
Add_void_to_Promise_resolved_without_a_value: diag(95143, ts.DiagnosticCategory.Message, "Add_void_to_Promise_resolved_without_a_value_95143", "Add 'void' to Promise resolved without a value"),
Add_void_to_all_Promises_resolved_without_a_value: diag(95144, ts.DiagnosticCategory.Message, "Add_void_to_all_Promises_resolved_without_a_value_95144", "Add 'void' to all Promises resolved without a value"),
Use_element_access_for_0: diag(95145, ts.DiagnosticCategory.Message, "Use_element_access_for_0_95145", "Use element access for '{0}'"),
Use_element_access_for_all_undeclared_properties: diag(95146, ts.DiagnosticCategory.Message, "Use_element_access_for_all_undeclared_properties_95146", "Use element access for all undeclared properties."),
Delete_all_unused_imports: diag(95147, ts.DiagnosticCategory.Message, "Delete_all_unused_imports_95147", "Delete all unused imports"),
Infer_function_return_type: diag(95148, ts.DiagnosticCategory.Message, "Infer_function_return_type_95148", "Infer function return type"),
Return_type_must_be_inferred_from_a_function: diag(95149, ts.DiagnosticCategory.Message, "Return_type_must_be_inferred_from_a_function_95149", "Return type must be inferred from a function"),
Could_not_determine_function_return_type: diag(95150, ts.DiagnosticCategory.Message, "Could_not_determine_function_return_type_95150", "Could not determine function return type"),
Could_not_convert_to_arrow_function: diag(95151, ts.DiagnosticCategory.Message, "Could_not_convert_to_arrow_function_95151", "Could not convert to arrow function"),
Could_not_convert_to_named_function: diag(95152, ts.DiagnosticCategory.Message, "Could_not_convert_to_named_function_95152", "Could not convert to named function"),
Could_not_convert_to_anonymous_function: diag(95153, ts.DiagnosticCategory.Message, "Could_not_convert_to_anonymous_function_95153", "Could not convert to anonymous function"),
Can_only_convert_string_concatenation: diag(95154, ts.DiagnosticCategory.Message, "Can_only_convert_string_concatenation_95154", "Can only convert string concatenation"),
Selection_is_not_a_valid_statement_or_statements: diag(95155, ts.DiagnosticCategory.Message, "Selection_is_not_a_valid_statement_or_statements_95155", "Selection is not a valid statement or statements"),
Add_missing_function_declaration_0: diag(95156, ts.DiagnosticCategory.Message, "Add_missing_function_declaration_0_95156", "Add missing function declaration '{0}'"),
Add_all_missing_function_declarations: diag(95157, ts.DiagnosticCategory.Message, "Add_all_missing_function_declarations_95157", "Add all missing function declarations"),
Method_not_implemented: diag(95158, ts.DiagnosticCategory.Message, "Method_not_implemented_95158", "Method not implemented."),
Function_not_implemented: diag(95159, ts.DiagnosticCategory.Message, "Function_not_implemented_95159", "Function not implemented."),
Add_override_modifier: diag(95160, ts.DiagnosticCategory.Message, "Add_override_modifier_95160", "Add 'override' modifier"),
Remove_override_modifier: diag(95161, ts.DiagnosticCategory.Message, "Remove_override_modifier_95161", "Remove 'override' modifier"),
Add_all_missing_override_modifiers: diag(95162, ts.DiagnosticCategory.Message, "Add_all_missing_override_modifiers_95162", "Add all missing 'override' modifiers"),
Remove_all_unnecessary_override_modifiers: diag(95163, ts.DiagnosticCategory.Message, "Remove_all_unnecessary_override_modifiers_95163", "Remove all unnecessary 'override' modifiers"),
Can_only_convert_named_export: diag(95164, ts.DiagnosticCategory.Message, "Can_only_convert_named_export_95164", "Can only convert named export"),
Add_missing_properties: diag(95165, ts.DiagnosticCategory.Message, "Add_missing_properties_95165", "Add missing properties"),
Add_all_missing_properties: diag(95166, ts.DiagnosticCategory.Message, "Add_all_missing_properties_95166", "Add all missing properties"),
Add_missing_attributes: diag(95167, ts.DiagnosticCategory.Message, "Add_missing_attributes_95167", "Add missing attributes"),
Add_all_missing_attributes: diag(95168, ts.DiagnosticCategory.Message, "Add_all_missing_attributes_95168", "Add all missing attributes"),
No_value_exists_in_scope_for_the_shorthand_property_0_Either_declare_one_or_provide_an_initializer: diag(18004, ts.DiagnosticCategory.Error, "No_value_exists_in_scope_for_the_shorthand_property_0_Either_declare_one_or_provide_an_initializer_18004", "No value exists in scope for the shorthand property '{0}'. Either declare one or provide an initializer."),
Classes_may_not_have_a_field_named_constructor: diag(18006, ts.DiagnosticCategory.Error, "Classes_may_not_have_a_field_named_constructor_18006", "Classes may not have a field named 'constructor'."),
JSX_expressions_may_not_use_the_comma_operator_Did_you_mean_to_write_an_array: diag(18007, ts.DiagnosticCategory.Error, "JSX_expressions_may_not_use_the_comma_operator_Did_you_mean_to_write_an_array_18007", "JSX expressions may not use the comma operator. Did you mean to write an array?"),
Private_identifiers_cannot_be_used_as_parameters: diag(18009, ts.DiagnosticCategory.Error, "Private_identifiers_cannot_be_used_as_parameters_18009", "Private identifiers cannot be used as parameters."),
An_accessibility_modifier_cannot_be_used_with_a_private_identifier: diag(18010, ts.DiagnosticCategory.Error, "An_accessibility_modifier_cannot_be_used_with_a_private_identifier_18010", "An accessibility modifier cannot be used with a private identifier."),
The_operand_of_a_delete_operator_cannot_be_a_private_identifier: diag(18011, ts.DiagnosticCategory.Error, "The_operand_of_a_delete_operator_cannot_be_a_private_identifier_18011", "The operand of a 'delete' operator cannot be a private identifier."),
constructor_is_a_reserved_word: diag(18012, ts.DiagnosticCategory.Error, "constructor_is_a_reserved_word_18012", "'#constructor' is a reserved word."),
Property_0_is_not_accessible_outside_class_1_because_it_has_a_private_identifier: diag(18013, ts.DiagnosticCategory.Error, "Property_0_is_not_accessible_outside_class_1_because_it_has_a_private_identifier_18013", "Property '{0}' is not accessible outside class '{1}' because it has a private identifier."),
The_property_0_cannot_be_accessed_on_type_1_within_this_class_because_it_is_shadowed_by_another_private_identifier_with_the_same_spelling: diag(18014, ts.DiagnosticCategory.Error, "The_property_0_cannot_be_accessed_on_type_1_within_this_class_because_it_is_shadowed_by_another_priv_18014", "The property '{0}' cannot be accessed on type '{1}' within this class because it is shadowed by another private identifier with the same spelling."),
Property_0_in_type_1_refers_to_a_different_member_that_cannot_be_accessed_from_within_type_2: diag(18015, ts.DiagnosticCategory.Error, "Property_0_in_type_1_refers_to_a_different_member_that_cannot_be_accessed_from_within_type_2_18015", "Property '{0}' in type '{1}' refers to a different member that cannot be accessed from within type '{2}'."),
Private_identifiers_are_not_allowed_outside_class_bodies: diag(18016, ts.DiagnosticCategory.Error, "Private_identifiers_are_not_allowed_outside_class_bodies_18016", "Private identifiers are not allowed outside class bodies."),
The_shadowing_declaration_of_0_is_defined_here: diag(18017, ts.DiagnosticCategory.Error, "The_shadowing_declaration_of_0_is_defined_here_18017", "The shadowing declaration of '{0}' is defined here"),
The_declaration_of_0_that_you_probably_intended_to_use_is_defined_here: diag(18018, ts.DiagnosticCategory.Error, "The_declaration_of_0_that_you_probably_intended_to_use_is_defined_here_18018", "The declaration of '{0}' that you probably intended to use is defined here"),
_0_modifier_cannot_be_used_with_a_private_identifier: diag(18019, ts.DiagnosticCategory.Error, "_0_modifier_cannot_be_used_with_a_private_identifier_18019", "'{0}' modifier cannot be used with a private identifier."),
An_enum_member_cannot_be_named_with_a_private_identifier: diag(18024, ts.DiagnosticCategory.Error, "An_enum_member_cannot_be_named_with_a_private_identifier_18024", "An enum member cannot be named with a private identifier."),
can_only_be_used_at_the_start_of_a_file: diag(18026, ts.DiagnosticCategory.Error, "can_only_be_used_at_the_start_of_a_file_18026", "'#!' can only be used at the start of a file."),
Compiler_reserves_name_0_when_emitting_private_identifier_downlevel: diag(18027, ts.DiagnosticCategory.Error, "Compiler_reserves_name_0_when_emitting_private_identifier_downlevel_18027", "Compiler reserves name '{0}' when emitting private identifier downlevel."),
Private_identifiers_are_only_available_when_targeting_ECMAScript_2015_and_higher: diag(18028, ts.DiagnosticCategory.Error, "Private_identifiers_are_only_available_when_targeting_ECMAScript_2015_and_higher_18028", "Private identifiers are only available when targeting ECMAScript 2015 and higher."),
Private_identifiers_are_not_allowed_in_variable_declarations: diag(18029, ts.DiagnosticCategory.Error, "Private_identifiers_are_not_allowed_in_variable_declarations_18029", "Private identifiers are not allowed in variable declarations."),
An_optional_chain_cannot_contain_private_identifiers: diag(18030, ts.DiagnosticCategory.Error, "An_optional_chain_cannot_contain_private_identifiers_18030", "An optional chain cannot contain private identifiers."),
The_intersection_0_was_reduced_to_never_because_property_1_has_conflicting_types_in_some_constituents: diag(18031, ts.DiagnosticCategory.Error, "The_intersection_0_was_reduced_to_never_because_property_1_has_conflicting_types_in_some_constituent_18031", "The intersection '{0}' was reduced to 'never' because property '{1}' has conflicting types in some constituents."),
The_intersection_0_was_reduced_to_never_because_property_1_exists_in_multiple_constituents_and_is_private_in_some: diag(18032, ts.DiagnosticCategory.Error, "The_intersection_0_was_reduced_to_never_because_property_1_exists_in_multiple_constituents_and_is_pr_18032", "The intersection '{0}' was reduced to 'never' because property '{1}' exists in multiple constituents and is private in some."),
Only_numeric_enums_can_have_computed_members_but_this_expression_has_type_0_If_you_do_not_need_exhaustiveness_checks_consider_using_an_object_literal_instead: diag(18033, ts.DiagnosticCategory.Error, "Only_numeric_enums_can_have_computed_members_but_this_expression_has_type_0_If_you_do_not_need_exhau_18033", "Only numeric enums can have computed members, but this expression has type '{0}'. If you do not need exhaustiveness checks, consider using an object literal instead."),
Specify_the_JSX_fragment_factory_function_to_use_when_targeting_react_JSX_emit_with_jsxFactory_compiler_option_is_specified_e_g_Fragment: diag(18034, ts.DiagnosticCategory.Message, "Specify_the_JSX_fragment_factory_function_to_use_when_targeting_react_JSX_emit_with_jsxFactory_compi_18034", "Specify the JSX fragment factory function to use when targeting 'react' JSX emit with 'jsxFactory' compiler option is specified, e.g. 'Fragment'."),
Invalid_value_for_jsxFragmentFactory_0_is_not_a_valid_identifier_or_qualified_name: diag(18035, ts.DiagnosticCategory.Error, "Invalid_value_for_jsxFragmentFactory_0_is_not_a_valid_identifier_or_qualified_name_18035", "Invalid value for 'jsxFragmentFactory'. '{0}' is not a valid identifier or qualified-name."),
Class_decorators_can_t_be_used_with_static_private_identifier_Consider_removing_the_experimental_decorator: diag(18036, ts.DiagnosticCategory.Error, "Class_decorators_can_t_be_used_with_static_private_identifier_Consider_removing_the_experimental_dec_18036", "Class decorators can't be used with static private identifier. Consider removing the experimental decorator."),
Await_expression_cannot_be_used_inside_a_class_static_block: diag(18037, ts.DiagnosticCategory.Error, "Await_expression_cannot_be_used_inside_a_class_static_block_18037", "Await expression cannot be used inside a class static block."),
For_await_loops_cannot_be_used_inside_a_class_static_block: diag(18038, ts.DiagnosticCategory.Error, "For_await_loops_cannot_be_used_inside_a_class_static_block_18038", "'For await' loops cannot be used inside a class static block."),
Invalid_use_of_0_It_cannot_be_used_inside_a_class_static_block: diag(18039, ts.DiagnosticCategory.Error, "Invalid_use_of_0_It_cannot_be_used_inside_a_class_static_block_18039", "Invalid use of '{0}'. It cannot be used inside a class static block."),
A_return_statement_cannot_be_used_inside_a_class_static_block: diag(18041, ts.DiagnosticCategory.Error, "A_return_statement_cannot_be_used_inside_a_class_static_block_18041", "A 'return' statement cannot be used inside a class static block."),
};
})(ts || (ts = {}));
var ts;
(function (ts) {
var _a;
/* @internal */
function tokenIsIdentifierOrKeyword(token) {
return token >= 79 /* Identifier */;
}
ts.tokenIsIdentifierOrKeyword = tokenIsIdentifierOrKeyword;
/* @internal */
function tokenIsIdentifierOrKeywordOrGreaterThan(token) {
return token === 31 /* GreaterThanToken */ || tokenIsIdentifierOrKeyword(token);
}
ts.tokenIsIdentifierOrKeywordOrGreaterThan = tokenIsIdentifierOrKeywordOrGreaterThan;
/** @internal */
ts.textToKeywordObj = (_a = {
abstract: 126 /* AbstractKeyword */,
any: 129 /* AnyKeyword */,
as: 127 /* AsKeyword */,
asserts: 128 /* AssertsKeyword */,
bigint: 156 /* BigIntKeyword */,
boolean: 132 /* BooleanKeyword */,
break: 81 /* BreakKeyword */,
case: 82 /* CaseKeyword */,
catch: 83 /* CatchKeyword */,
class: 84 /* ClassKeyword */,
continue: 86 /* ContinueKeyword */,
const: 85 /* ConstKeyword */
},
_a["" + "constructor"] = 133 /* ConstructorKeyword */,
_a.debugger = 87 /* DebuggerKeyword */,
_a.declare = 134 /* DeclareKeyword */,
_a.default = 88 /* DefaultKeyword */,
_a.delete = 89 /* DeleteKeyword */,
_a.do = 90 /* DoKeyword */,
_a.else = 91 /* ElseKeyword */,
_a.enum = 92 /* EnumKeyword */,
_a.export = 93 /* ExportKeyword */,
_a.extends = 94 /* ExtendsKeyword */,
_a.false = 95 /* FalseKeyword */,
_a.finally = 96 /* FinallyKeyword */,
_a.for = 97 /* ForKeyword */,
_a.from = 154 /* FromKeyword */,
_a.function = 98 /* FunctionKeyword */,
_a.get = 135 /* GetKeyword */,
_a.if = 99 /* IfKeyword */,
_a.implements = 117 /* ImplementsKeyword */,
_a.import = 100 /* ImportKeyword */,
_a.in = 101 /* InKeyword */,
_a.infer = 136 /* InferKeyword */,
_a.instanceof = 102 /* InstanceOfKeyword */,
_a.interface = 118 /* InterfaceKeyword */,
_a.intrinsic = 137 /* IntrinsicKeyword */,
_a.is = 138 /* IsKeyword */,
_a.keyof = 139 /* KeyOfKeyword */,
_a.let = 119 /* LetKeyword */,
_a.module = 140 /* ModuleKeyword */,
_a.namespace = 141 /* NamespaceKeyword */,
_a.never = 142 /* NeverKeyword */,
_a.new = 103 /* NewKeyword */,
_a.null = 104 /* NullKeyword */,
_a.number = 145 /* NumberKeyword */,
_a.object = 146 /* ObjectKeyword */,
_a.package = 120 /* PackageKeyword */,
_a.private = 121 /* PrivateKeyword */,
_a.protected = 122 /* ProtectedKeyword */,
_a.public = 123 /* PublicKeyword */,
_a.override = 157 /* OverrideKeyword */,
_a.readonly = 143 /* ReadonlyKeyword */,
_a.require = 144 /* RequireKeyword */,
_a.global = 155 /* GlobalKeyword */,
_a.return = 105 /* ReturnKeyword */,
_a.set = 147 /* SetKeyword */,
_a.static = 124 /* StaticKeyword */,
_a.string = 148 /* StringKeyword */,
_a.super = 106 /* SuperKeyword */,
_a.switch = 107 /* SwitchKeyword */,
_a.symbol = 149 /* SymbolKeyword */,
_a.this = 108 /* ThisKeyword */,
_a.throw = 109 /* ThrowKeyword */,
_a.true = 110 /* TrueKeyword */,
_a.try = 111 /* TryKeyword */,
_a.type = 150 /* TypeKeyword */,
_a.typeof = 112 /* TypeOfKeyword */,
_a.undefined = 151 /* UndefinedKeyword */,
_a.unique = 152 /* UniqueKeyword */,
_a.unknown = 153 /* UnknownKeyword */,
_a.var = 113 /* VarKeyword */,
_a.void = 114 /* VoidKeyword */,
_a.while = 115 /* WhileKeyword */,
_a.with = 116 /* WithKeyword */,
_a.yield = 125 /* YieldKeyword */,
_a.async = 130 /* AsyncKeyword */,
_a.await = 131 /* AwaitKeyword */,
_a.of = 158 /* OfKeyword */,
_a);
var textToKeyword = new ts.Map(ts.getEntries(ts.textToKeywordObj));
var textToToken = new ts.Map(ts.getEntries(__assign(__assign({}, ts.textToKeywordObj), { "{": 18 /* OpenBraceToken */, "}": 19 /* CloseBraceToken */, "(": 20 /* OpenParenToken */, ")": 21 /* CloseParenToken */, "[": 22 /* OpenBracketToken */, "]": 23 /* CloseBracketToken */, ".": 24 /* DotToken */, "...": 25 /* DotDotDotToken */, ";": 26 /* SemicolonToken */, ",": 27 /* CommaToken */, "<": 29 /* LessThanToken */, ">": 31 /* GreaterThanToken */, "<=": 32 /* LessThanEqualsToken */, ">=": 33 /* GreaterThanEqualsToken */, "==": 34 /* EqualsEqualsToken */, "!=": 35 /* ExclamationEqualsToken */, "===": 36 /* EqualsEqualsEqualsToken */, "!==": 37 /* ExclamationEqualsEqualsToken */, "=>": 38 /* EqualsGreaterThanToken */, "+": 39 /* PlusToken */, "-": 40 /* MinusToken */, "**": 42 /* AsteriskAsteriskToken */, "*": 41 /* AsteriskToken */, "/": 43 /* SlashToken */, "%": 44 /* PercentToken */, "++": 45 /* PlusPlusToken */, "--": 46 /* MinusMinusToken */, "<<": 47 /* LessThanLessThanToken */, "</": 30 /* LessThanSlashToken */, ">>": 48 /* GreaterThanGreaterThanToken */, ">>>": 49 /* GreaterThanGreaterThanGreaterThanToken */, "&": 50 /* AmpersandToken */, "|": 51 /* BarToken */, "^": 52 /* CaretToken */, "!": 53 /* ExclamationToken */, "~": 54 /* TildeToken */, "&&": 55 /* AmpersandAmpersandToken */, "||": 56 /* BarBarToken */, "?": 57 /* QuestionToken */, "??": 60 /* QuestionQuestionToken */, "?.": 28 /* QuestionDotToken */, ":": 58 /* ColonToken */, "=": 63 /* EqualsToken */, "+=": 64 /* PlusEqualsToken */, "-=": 65 /* MinusEqualsToken */, "*=": 66 /* AsteriskEqualsToken */, "**=": 67 /* AsteriskAsteriskEqualsToken */, "/=": 68 /* SlashEqualsToken */, "%=": 69 /* PercentEqualsToken */, "<<=": 70 /* LessThanLessThanEqualsToken */, ">>=": 71 /* GreaterThanGreaterThanEqualsToken */, ">>>=": 72 /* GreaterThanGreaterThanGreaterThanEqualsToken */, "&=": 73 /* AmpersandEqualsToken */, "|=": 74 /* BarEqualsToken */, "^=": 78 /* CaretEqualsToken */, "||=": 75 /* BarBarEqualsToken */, "&&=": 76 /* AmpersandAmpersandEqualsToken */, "??=": 77 /* QuestionQuestionEqualsToken */, "@": 59 /* AtToken */, "#": 62 /* HashToken */, "`": 61 /* BacktickToken */ })));
/*
As per ECMAScript Language Specification 3th Edition, Section 7.6: Identifiers
IdentifierStart ::
Can contain Unicode 3.0.0 categories:
Uppercase letter (Lu),
Lowercase letter (Ll),
Titlecase letter (Lt),
Modifier letter (Lm),
Other letter (Lo), or
Letter number (Nl).
IdentifierPart :: =
Can contain IdentifierStart + Unicode 3.0.0 categories:
Non-spacing mark (Mn),
Combining spacing mark (Mc),
Decimal number (Nd), or
Connector punctuation (Pc).
Codepoint ranges for ES3 Identifiers are extracted from the Unicode 3.0.0 specification at:
http://www.unicode.org/Public/3.0-Update/UnicodeData-3.0.0.txt
*/
var unicodeES3IdentifierStart = [170, 170, 181, 181, 186, 186, 192, 214, 216, 246, 248, 543, 546, 563, 592, 685, 688, 696, 699, 705, 720, 721, 736, 740, 750, 750, 890, 890, 902, 902, 904, 906, 908, 908, 910, 929, 931, 974, 976, 983, 986, 1011, 1024, 1153, 1164, 1220, 1223, 1224, 1227, 1228, 1232, 1269, 1272, 1273, 1329, 1366, 1369, 1369, 1377, 1415, 1488, 1514, 1520, 1522, 1569, 1594, 1600, 1610, 1649, 1747, 1749, 1749, 1765, 1766, 1786, 1788, 1808, 1808, 1810, 1836, 1920, 1957, 2309, 2361, 2365, 2365, 2384, 2384, 2392, 2401, 2437, 2444, 2447, 2448, 2451, 2472, 2474, 2480, 2482, 2482, 2486, 2489, 2524, 2525, 2527, 2529, 2544, 2545, 2565, 2570, 2575, 2576, 2579, 2600, 2602, 2608, 2610, 2611, 2613, 2614, 2616, 2617, 2649, 2652, 2654, 2654, 2674, 2676, 2693, 2699, 2701, 2701, 2703, 2705, 2707, 2728, 2730, 2736, 2738, 2739, 2741, 2745, 2749, 2749, 2768, 2768, 2784, 2784, 2821, 2828, 2831, 2832, 2835, 2856, 2858, 2864, 2866, 2867, 2870, 2873, 2877, 2877, 2908, 2909, 2911, 2913, 2949, 2954, 2958, 2960, 2962, 2965, 2969, 2970, 2972, 2972, 2974, 2975, 2979, 2980, 2984, 2986, 2990, 2997, 2999, 3001, 3077, 3084, 3086, 3088, 3090, 3112, 3114, 3123, 3125, 3129, 3168, 3169, 3205, 3212, 3214, 3216, 3218, 3240, 3242, 3251, 3253, 3257, 3294, 3294, 3296, 3297, 3333, 3340, 3342, 3344, 3346, 3368, 3370, 3385, 3424, 3425, 3461, 3478, 3482, 3505, 3507, 3515, 3517, 3517, 3520, 3526, 3585, 3632, 3634, 3635, 3648, 3654, 3713, 3714, 3716, 3716, 3719, 3720, 3722, 3722, 3725, 3725, 3732, 3735, 3737, 3743, 3745, 3747, 3749, 3749, 3751, 3751, 3754, 3755, 3757, 3760, 3762, 3763, 3773, 3773, 3776, 3780, 3782, 3782, 3804, 3805, 3840, 3840, 3904, 3911, 3913, 3946, 3976, 3979, 4096, 4129, 4131, 4135, 4137, 4138, 4176, 4181, 4256, 4293, 4304, 4342, 4352, 4441, 4447, 4514, 4520, 4601, 4608, 4614, 4616, 4678, 4680, 4680, 4682, 4685, 4688, 4694, 4696, 4696, 4698, 4701, 4704, 4742, 4744, 4744, 4746, 4749, 4752, 4782, 4784, 4784, 4786, 4789, 4792, 4798, 4800, 4800, 4802, 4805, 4808, 4814, 4816, 4822, 4824, 4846, 4848, 4878, 4880, 4880, 4882, 4885, 4888, 4894, 4896, 4934, 4936, 4954, 5024, 5108, 5121, 5740, 5743, 5750, 5761, 5786, 5792, 5866, 6016, 6067, 6176, 6263, 6272, 6312, 7680, 7835, 7840, 7929, 7936, 7957, 7960, 7965, 7968, 8005, 8008, 8013, 8016, 8023, 8025, 8025, 8027, 8027, 8029, 8029, 8031, 8061, 8064, 8116, 8118, 8124, 8126, 8126, 8130, 8132, 8134, 8140, 8144, 8147, 8150, 8155, 8160, 8172, 8178, 8180, 8182, 8188, 8319, 8319, 8450, 8450, 8455, 8455, 8458, 8467, 8469, 8469, 8473, 8477, 8484, 8484, 8486, 8486, 8488, 8488, 8490, 8493, 8495, 8497, 8499, 8505, 8544, 8579, 12293, 12295, 12321, 12329, 12337, 12341, 12344, 12346, 12353, 12436, 12445, 12446, 12449, 12538, 12540, 12542, 12549, 12588, 12593, 12686, 12704, 12727, 13312, 19893, 19968, 40869, 40960, 42124, 44032, 55203, 63744, 64045, 64256, 64262, 64275, 64279, 64285, 64285, 64287, 64296, 64298, 64310, 64312, 64316, 64318, 64318, 64320, 64321, 64323, 64324, 64326, 64433, 64467, 64829, 64848, 64911, 64914, 64967, 65008, 65019, 65136, 65138, 65140, 65140, 65142, 65276, 65313, 65338, 65345, 65370, 65382, 65470, 65474, 65479, 65482, 65487, 65490, 65495, 65498, 65500,];
var unicodeES3IdentifierPart = [170, 170, 181, 181, 186, 186, 192, 214, 216, 246, 248, 543, 546, 563, 592, 685, 688, 696, 699, 705, 720, 721, 736, 740, 750, 750, 768, 846, 864, 866, 890, 890, 902, 902, 904, 906, 908, 908, 910, 929, 931, 974, 976, 983, 986, 1011, 1024, 1153, 1155, 1158, 1164, 1220, 1223, 1224, 1227, 1228, 1232, 1269, 1272, 1273, 1329, 1366, 1369, 1369, 1377, 1415, 1425, 1441, 1443, 1465, 1467, 1469, 1471, 1471, 1473, 1474, 1476, 1476, 1488, 1514, 1520, 1522, 1569, 1594, 1600, 1621, 1632, 1641, 1648, 1747, 1749, 1756, 1759, 1768, 1770, 1773, 1776, 1788, 1808, 1836, 1840, 1866, 1920, 1968, 2305, 2307, 2309, 2361, 2364, 2381, 2384, 2388, 2392, 2403, 2406, 2415, 2433, 2435, 2437, 2444, 2447, 2448, 2451, 2472, 2474, 2480, 2482, 2482, 2486, 2489, 2492, 2492, 2494, 2500, 2503, 2504, 2507, 2509, 2519, 2519, 2524, 2525, 2527, 2531, 2534, 2545, 2562, 2562, 2565, 2570, 2575, 2576, 2579, 2600, 2602, 2608, 2610, 2611, 2613, 2614, 2616, 2617, 2620, 2620, 2622, 2626, 2631, 2632, 2635, 2637, 2649, 2652, 2654, 2654, 2662, 2676, 2689, 2691, 2693, 2699, 2701, 2701, 2703, 2705, 2707, 2728, 2730, 2736, 2738, 2739, 2741, 2745, 2748, 2757, 2759, 2761, 2763, 2765, 2768, 2768, 2784, 2784, 2790, 2799, 2817, 2819, 2821, 2828, 2831, 2832, 2835, 2856, 2858, 2864, 2866, 2867, 2870, 2873, 2876, 2883, 2887, 2888, 2891, 2893, 2902, 2903, 2908, 2909, 2911, 2913, 2918, 2927, 2946, 2947, 2949, 2954, 2958, 2960, 2962, 2965, 2969, 2970, 2972, 2972, 2974, 2975, 2979, 2980, 2984, 2986, 2990, 2997, 2999, 3001, 3006, 3010, 3014, 3016, 3018, 3021, 3031, 3031, 3047, 3055, 3073, 3075, 3077, 3084, 3086, 3088, 3090, 3112, 3114, 3123, 3125, 3129, 3134, 3140, 3142, 3144, 3146, 3149, 3157, 3158, 3168, 3169, 3174, 3183, 3202, 3203, 3205, 3212, 3214, 3216, 3218, 3240, 3242, 3251, 3253, 3257, 3262, 3268, 3270, 3272, 3274, 3277, 3285, 3286, 3294, 3294, 3296, 3297, 3302, 3311, 3330, 3331, 3333, 3340, 3342, 3344, 3346, 3368, 3370, 3385, 3390, 3395, 3398, 3400, 3402, 3405, 3415, 3415, 3424, 3425, 3430, 3439, 3458, 3459, 3461, 3478, 3482, 3505, 3507, 3515, 3517, 3517, 3520, 3526, 3530, 3530, 3535, 3540, 3542, 3542, 3544, 3551, 3570, 3571, 3585, 3642, 3648, 3662, 3664, 3673, 3713, 3714, 3716, 3716, 3719, 3720, 3722, 3722, 3725, 3725, 3732, 3735, 3737, 3743, 3745, 3747, 3749, 3749, 3751, 3751, 3754, 3755, 3757, 3769, 3771, 3773, 3776, 3780, 3782, 3782, 3784, 3789, 3792, 3801, 3804, 3805, 3840, 3840, 3864, 3865, 3872, 3881, 3893, 3893, 3895, 3895, 3897, 3897, 3902, 3911, 3913, 3946, 3953, 3972, 3974, 3979, 3984, 3991, 3993, 4028, 4038, 4038, 4096, 4129, 4131, 4135, 4137, 4138, 4140, 4146, 4150, 4153, 4160, 4169, 4176, 4185, 4256, 4293, 4304, 4342, 4352, 4441, 4447, 4514, 4520, 4601, 4608, 4614, 4616, 4678, 4680, 4680, 4682, 4685, 4688, 4694, 4696, 4696, 4698, 4701, 4704, 4742, 4744, 4744, 4746, 4749, 4752, 4782, 4784, 4784, 4786, 4789, 4792, 4798, 4800, 4800, 4802, 4805, 4808, 4814, 4816, 4822, 4824, 4846, 4848, 4878, 4880, 4880, 4882, 4885, 4888, 4894, 4896, 4934, 4936, 4954, 4969, 4977, 5024, 5108, 5121, 5740, 5743, 5750, 5761, 5786, 5792, 5866, 6016, 6099, 6112, 6121, 6160, 6169, 6176, 6263, 6272, 6313, 7680, 7835, 7840, 7929, 7936, 7957, 7960, 7965, 7968, 8005, 8008, 8013, 8016, 8023, 8025, 8025, 8027, 8027, 8029, 8029, 8031, 8061, 8064, 8116, 8118, 8124, 8126, 8126, 8130, 8132, 8134, 8140, 8144, 8147, 8150, 8155, 8160, 8172, 8178, 8180, 8182, 8188, 8255, 8256, 8319, 8319, 8400, 8412, 8417, 8417, 8450, 8450, 8455, 8455, 8458, 8467, 8469, 8469, 8473, 8477, 8484, 8484, 8486, 8486, 8488, 8488, 8490, 8493, 8495, 8497, 8499, 8505, 8544, 8579, 12293, 12295, 12321, 12335, 12337, 12341, 12344, 12346, 12353, 12436, 12441, 12442, 12445, 12446, 12449, 12542, 12549, 12588, 12593, 12686, 12704, 12727, 13312, 19893, 19968, 40869, 40960, 42124, 44032, 55203, 63744, 64045, 64256, 64262, 64275, 64279, 64285, 64296, 64298, 64310, 64312, 64316, 64318, 64318, 64320, 64321, 64323, 64324, 64326, 64433, 64467, 64829, 64848, 64911, 64914, 64967, 65008, 65019, 65056, 65059, 65075, 65076, 65101, 65103, 65136, 65138, 65140, 65140, 65142, 65276, 65296, 65305, 65313, 65338, 65343, 65343, 65345, 65370, 65381, 65470, 65474, 65479, 65482, 65487, 65490, 65495, 65498, 65500,];
/*
As per ECMAScript Language Specification 5th Edition, Section 7.6: ISyntaxToken Names and Identifiers
IdentifierStart ::
Can contain Unicode 6.2 categories:
Uppercase letter (Lu),
Lowercase letter (Ll),
Titlecase letter (Lt),
Modifier letter (Lm),
Other letter (Lo), or
Letter number (Nl).
IdentifierPart ::
Can contain IdentifierStart + Unicode 6.2 categories:
Non-spacing mark (Mn),
Combining spacing mark (Mc),
Decimal number (Nd),
Connector punctuation (Pc),
<ZWNJ>, or
<ZWJ>.
Codepoint ranges for ES5 Identifiers are extracted from the Unicode 6.2 specification at:
http://www.unicode.org/Public/6.2.0/ucd/UnicodeData.txt
*/
var unicodeES5IdentifierStart = [170, 170, 181, 181, 186, 186, 192, 214, 216, 246, 248, 705, 710, 721, 736, 740, 748, 748, 750, 750, 880, 884, 886, 887, 890, 893, 902, 902, 904, 906, 908, 908, 910, 929, 931, 1013, 1015, 1153, 1162, 1319, 1329, 1366, 1369, 1369, 1377, 1415, 1488, 1514, 1520, 1522, 1568, 1610, 1646, 1647, 1649, 1747, 1749, 1749, 1765, 1766, 1774, 1775, 1786, 1788, 1791, 1791, 1808, 1808, 1810, 1839, 1869, 1957, 1969, 1969, 1994, 2026, 2036, 2037, 2042, 2042, 2048, 2069, 2074, 2074, 2084, 2084, 2088, 2088, 2112, 2136, 2208, 2208, 2210, 2220, 2308, 2361, 2365, 2365, 2384, 2384, 2392, 2401, 2417, 2423, 2425, 2431, 2437, 2444, 2447, 2448, 2451, 2472, 2474, 2480, 2482, 2482, 2486, 2489, 2493, 2493, 2510, 2510, 2524, 2525, 2527, 2529, 2544, 2545, 2565, 2570, 2575, 2576, 2579, 2600, 2602, 2608, 2610, 2611, 2613, 2614, 2616, 2617, 2649, 2652, 2654, 2654, 2674, 2676, 2693, 2701, 2703, 2705, 2707, 2728, 2730, 2736, 2738, 2739, 2741, 2745, 2749, 2749, 2768, 2768, 2784, 2785, 2821, 2828, 2831, 2832, 2835, 2856, 2858, 2864, 2866, 2867, 2869, 2873, 2877, 2877, 2908, 2909, 2911, 2913, 2929, 2929, 2947, 2947, 2949, 2954, 2958, 2960, 2962, 2965, 2969, 2970, 2972, 2972, 2974, 2975, 2979, 2980, 2984, 2986, 2990, 3001, 3024, 3024, 3077, 3084, 3086, 3088, 3090, 3112, 3114, 3123, 3125, 3129, 3133, 3133, 3160, 3161, 3168, 3169, 3205, 3212, 3214, 3216, 3218, 3240, 3242, 3251, 3253, 3257, 3261, 3261, 3294, 3294, 3296, 3297, 3313, 3314, 3333, 3340, 3342, 3344, 3346, 3386, 3389, 3389, 3406, 3406, 3424, 3425, 3450, 3455, 3461, 3478, 3482, 3505, 3507, 3515, 3517, 3517, 3520, 3526, 3585, 3632, 3634, 3635, 3648, 3654, 3713, 3714, 3716, 3716, 3719, 3720, 3722, 3722, 3725, 3725, 3732, 3735, 3737, 3743, 3745, 3747, 3749, 3749, 3751, 3751, 3754, 3755, 3757, 3760, 3762, 3763, 3773, 3773, 3776, 3780, 3782, 3782, 3804, 3807, 3840, 3840, 3904, 3911, 3913, 3948, 3976, 3980, 4096, 4138, 4159, 4159, 4176, 4181, 4186, 4189, 4193, 4193, 4197, 4198, 4206, 4208, 4213, 4225, 4238, 4238, 4256, 4293, 4295, 4295, 4301, 4301, 4304, 4346, 4348, 4680, 4682, 4685, 4688, 4694, 4696, 4696, 4698, 4701, 4704, 4744, 4746, 4749, 4752, 4784, 4786, 4789, 4792, 4798, 4800, 4800, 4802, 4805, 4808, 4822, 4824, 4880, 4882, 4885, 4888, 4954, 4992, 5007, 5024, 5108, 5121, 5740, 5743, 5759, 5761, 5786, 5792, 5866, 5870, 5872, 5888, 5900, 5902, 5905, 5920, 5937, 5952, 5969, 5984, 5996, 5998, 6000, 6016, 6067, 6103, 6103, 6108, 6108, 6176, 6263, 6272, 6312, 6314, 6314, 6320, 6389, 6400, 6428, 6480, 6509, 6512, 6516, 6528, 6571, 6593, 6599, 6656, 6678, 6688, 6740, 6823, 6823, 6917, 6963, 6981, 6987, 7043, 7072, 7086, 7087, 7098, 7141, 7168, 7203, 7245, 7247, 7258, 7293, 7401, 7404, 7406, 7409, 7413, 7414, 7424, 7615, 7680, 7957, 7960, 7965, 7968, 8005, 8008, 8013, 8016, 8023, 8025, 8025, 8027, 8027, 8029, 8029, 8031, 8061, 8064, 8116, 8118, 8124, 8126, 8126, 8130, 8132, 8134, 8140, 8144, 8147, 8150, 8155, 8160, 8172, 8178, 8180, 8182, 8188, 8305, 8305, 8319, 8319, 8336, 8348, 8450, 8450, 8455, 8455, 8458, 8467, 8469, 8469, 8473, 8477, 8484, 8484, 8486, 8486, 8488, 8488, 8490, 8493, 8495, 8505, 8508, 8511, 8517, 8521, 8526, 8526, 8544, 8584, 11264, 11310, 11312, 11358, 11360, 11492, 11499, 11502, 11506, 11507, 11520, 11557, 11559, 11559, 11565, 11565, 11568, 11623, 11631, 11631, 11648, 11670, 11680, 11686, 11688, 11694, 11696, 11702, 11704, 11710, 11712, 11718, 11720, 11726, 11728, 11734, 11736, 11742, 11823, 11823, 12293, 12295, 12321, 12329, 12337, 12341, 12344, 12348, 12353, 12438, 12445, 12447, 12449, 12538, 12540, 12543, 12549, 12589, 12593, 12686, 12704, 12730, 12784, 12799, 13312, 19893, 19968, 40908, 40960, 42124, 42192, 42237, 42240, 42508, 42512, 42527, 42538, 42539, 42560, 42606, 42623, 42647, 42656, 42735, 42775, 42783, 42786, 42888, 42891, 42894, 42896, 42899, 42912, 42922, 43000, 43009, 43011, 43013, 43015, 43018, 43020, 43042, 43072, 43123, 43138, 43187, 43250, 43255, 43259, 43259, 43274, 43301, 43312, 43334, 43360, 43388, 43396, 43442, 43471, 43471, 43520, 43560, 43584, 43586, 43588, 43595, 43616, 43638, 43642, 43642, 43648, 43695, 43697, 43697, 43701, 43702, 43705, 43709, 43712, 43712, 43714, 43714, 43739, 43741, 43744, 43754, 43762, 43764, 43777, 43782, 43785, 43790, 43793, 43798, 43808, 43814, 43816, 43822, 43968, 44002, 44032, 55203, 55216, 55238, 55243, 55291, 63744, 64109, 64112, 64217, 64256, 64262, 64275, 64279, 64285, 64285, 64287, 64296, 64298, 64310, 64312, 64316, 64318, 64318, 64320, 64321, 64323, 64324, 64326, 64433, 64467, 64829, 64848, 64911, 64914, 64967, 65008, 65019, 65136, 65140, 65142, 65276, 65313, 65338, 65345, 65370, 65382, 65470, 65474, 65479, 65482, 65487, 65490, 65495, 65498, 65500,];
var unicodeES5IdentifierPart = [170, 170, 181, 181, 186, 186, 192, 214, 216, 246, 248, 705, 710, 721, 736, 740, 748, 748, 750, 750, 768, 884, 886, 887, 890, 893, 902, 902, 904, 906, 908, 908, 910, 929, 931, 1013, 1015, 1153, 1155, 1159, 1162, 1319, 1329, 1366, 1369, 1369, 1377, 1415, 1425, 1469, 1471, 1471, 1473, 1474, 1476, 1477, 1479, 1479, 1488, 1514, 1520, 1522, 1552, 1562, 1568, 1641, 1646, 1747, 1749, 1756, 1759, 1768, 1770, 1788, 1791, 1791, 1808, 1866, 1869, 1969, 1984, 2037, 2042, 2042, 2048, 2093, 2112, 2139, 2208, 2208, 2210, 2220, 2276, 2302, 2304, 2403, 2406, 2415, 2417, 2423, 2425, 2431, 2433, 2435, 2437, 2444, 2447, 2448, 2451, 2472, 2474, 2480, 2482, 2482, 2486, 2489, 2492, 2500, 2503, 2504, 2507, 2510, 2519, 2519, 2524, 2525, 2527, 2531, 2534, 2545, 2561, 2563, 2565, 2570, 2575, 2576, 2579, 2600, 2602, 2608, 2610, 2611, 2613, 2614, 2616, 2617, 2620, 2620, 2622, 2626, 2631, 2632, 2635, 2637, 2641, 2641, 2649, 2652, 2654, 2654, 2662, 2677, 2689, 2691, 2693, 2701, 2703, 2705, 2707, 2728, 2730, 2736, 2738, 2739, 2741, 2745, 2748, 2757, 2759, 2761, 2763, 2765, 2768, 2768, 2784, 2787, 2790, 2799, 2817, 2819, 2821, 2828, 2831, 2832, 2835, 2856, 2858, 2864, 2866, 2867, 2869, 2873, 2876, 2884, 2887, 2888, 2891, 2893, 2902, 2903, 2908, 2909, 2911, 2915, 2918, 2927, 2929, 2929, 2946, 2947, 2949, 2954, 2958, 2960, 2962, 2965, 2969, 2970, 2972, 2972, 2974, 2975, 2979, 2980, 2984, 2986, 2990, 3001, 3006, 3010, 3014, 3016, 3018, 3021, 3024, 3024, 3031, 3031, 3046, 3055, 3073, 3075, 3077, 3084, 3086, 3088, 3090, 3112, 3114, 3123, 3125, 3129, 3133, 3140, 3142, 3144, 3146, 3149, 3157, 3158, 3160, 3161, 3168, 3171, 3174, 3183, 3202, 3203, 3205, 3212, 3214, 3216, 3218, 3240, 3242, 3251, 3253, 3257, 3260, 3268, 3270, 3272, 3274, 3277, 3285, 3286, 3294, 3294, 3296, 3299, 3302, 3311, 3313, 3314, 3330, 3331, 3333, 3340, 3342, 3344, 3346, 3386, 3389, 3396, 3398, 3400, 3402, 3406, 3415, 3415, 3424, 3427, 3430, 3439, 3450, 3455, 3458, 3459, 3461, 3478, 3482, 3505, 3507, 3515, 3517, 3517, 3520, 3526, 3530, 3530, 3535, 3540, 3542, 3542, 3544, 3551, 3570, 3571, 3585, 3642, 3648, 3662, 3664, 3673, 3713, 3714, 3716, 3716, 3719, 3720, 3722, 3722, 3725, 3725, 3732, 3735, 3737, 3743, 3745, 3747, 3749, 3749, 3751, 3751, 3754, 3755, 3757, 3769, 3771, 3773, 3776, 3780, 3782, 3782, 3784, 3789, 3792, 3801, 3804, 3807, 3840, 3840, 3864, 3865, 3872, 3881, 3893, 3893, 3895, 3895, 3897, 3897, 3902, 3911, 3913, 3948, 3953, 3972, 3974, 3991, 3993, 4028, 4038, 4038, 4096, 4169, 4176, 4253, 4256, 4293, 4295, 4295, 4301, 4301, 4304, 4346, 4348, 4680, 4682, 4685, 4688, 4694, 4696, 4696, 4698, 4701, 4704, 4744, 4746, 4749, 4752, 4784, 4786, 4789, 4792, 4798, 4800, 4800, 4802, 4805, 4808, 4822, 4824, 4880, 4882, 4885, 4888, 4954, 4957, 4959, 4992, 5007, 5024, 5108, 5121, 5740, 5743, 5759, 5761, 5786, 5792, 5866, 5870, 5872, 5888, 5900, 5902, 5908, 5920, 5940, 5952, 5971, 5984, 5996, 5998, 6000, 6002, 6003, 6016, 6099, 6103, 6103, 6108, 6109, 6112, 6121, 6155, 6157, 6160, 6169, 6176, 6263, 6272, 6314, 6320, 6389, 6400, 6428, 6432, 6443, 6448, 6459, 6470, 6509, 6512, 6516, 6528, 6571, 6576, 6601, 6608, 6617, 6656, 6683, 6688, 6750, 6752, 6780, 6783, 6793, 6800, 6809, 6823, 6823, 6912, 6987, 6992, 7001, 7019, 7027, 7040, 7155, 7168, 7223, 7232, 7241, 7245, 7293, 7376, 7378, 7380, 7414, 7424, 7654, 7676, 7957, 7960, 7965, 7968, 8005, 8008, 8013, 8016, 8023, 8025, 8025, 8027, 8027, 8029, 8029, 8031, 8061, 8064, 8116, 8118, 8124, 8126, 8126, 8130, 8132, 8134, 8140, 8144, 8147, 8150, 8155, 8160, 8172, 8178, 8180, 8182, 8188, 8204, 8205, 8255, 8256, 8276, 8276, 8305, 8305, 8319, 8319, 8336, 8348, 8400, 8412, 8417, 8417, 8421, 8432, 8450, 8450, 8455, 8455, 8458, 8467, 8469, 8469, 8473, 8477, 8484, 8484, 8486, 8486, 8488, 8488, 8490, 8493, 8495, 8505, 8508, 8511, 8517, 8521, 8526, 8526, 8544, 8584, 11264, 11310, 11312, 11358, 11360, 11492, 11499, 11507, 11520, 11557, 11559, 11559, 11565, 11565, 11568, 11623, 11631, 11631, 11647, 11670, 11680, 11686, 11688, 11694, 11696, 11702, 11704, 11710, 11712, 11718, 11720, 11726, 11728, 11734, 11736, 11742, 11744, 11775, 11823, 11823, 12293, 12295, 12321, 12335, 12337, 12341, 12344, 12348, 12353, 12438, 12441, 12442, 12445, 12447, 12449, 12538, 12540, 12543, 12549, 12589, 12593, 12686, 12704, 12730, 12784, 12799, 13312, 19893, 19968, 40908, 40960, 42124, 42192, 42237, 42240, 42508, 42512, 42539, 42560, 42607, 42612, 42621, 42623, 42647, 42655, 42737, 42775, 42783, 42786, 42888, 42891, 42894, 42896, 42899, 42912, 42922, 43000, 43047, 43072, 43123, 43136, 43204, 43216, 43225, 43232, 43255, 43259, 43259, 43264, 43309, 43312, 43347, 43360, 43388, 43392, 43456, 43471, 43481, 43520, 43574, 43584, 43597, 43600, 43609, 43616, 43638, 43642, 43643, 43648, 43714, 43739, 43741, 43744, 43759, 43762, 43766, 43777, 43782, 43785, 43790, 43793, 43798, 43808, 43814, 43816, 43822, 43968, 44010, 44012, 44013, 44016, 44025, 44032, 55203, 55216, 55238, 55243, 55291, 63744, 64109, 64112, 64217, 64256, 64262, 64275, 64279, 64285, 64296, 64298, 64310, 64312, 64316, 64318, 64318, 64320, 64321, 64323, 64324, 64326, 64433, 64467, 64829, 64848, 64911, 64914, 64967, 65008, 65019, 65024, 65039, 65056, 65062, 65075, 65076, 65101, 65103, 65136, 65140, 65142, 65276, 65296, 65305, 65313, 65338, 65343, 65343, 65345, 65370, 65382, 65470, 65474, 65479, 65482, 65487, 65490, 65495, 65498, 65500,];
/**
* Generated by scripts/regenerate-unicode-identifier-parts.js on node v12.4.0 with unicode 12.1
* based on http://www.unicode.org/reports/tr31/ and https://www.ecma-international.org/ecma-262/6.0/#sec-names-and-keywords
* unicodeESNextIdentifierStart corresponds to the ID_Start and Other_ID_Start property, and
* unicodeESNextIdentifierPart corresponds to ID_Continue, Other_ID_Continue, plus ID_Start and Other_ID_Start
*/
var unicodeESNextIdentifierStart = [65, 90, 97, 122, 170, 170, 181, 181, 186, 186, 192, 214, 216, 246, 248, 705, 710, 721, 736, 740, 748, 748, 750, 750, 880, 884, 886, 887, 890, 893, 895, 895, 902, 902, 904, 906, 908, 908, 910, 929, 931, 1013, 1015, 1153, 1162, 1327, 1329, 1366, 1369, 1369, 1376, 1416, 1488, 1514, 1519, 1522, 1568, 1610, 1646, 1647, 1649, 1747, 1749, 1749, 1765, 1766, 1774, 1775, 1786, 1788, 1791, 1791, 1808, 1808, 1810, 1839, 1869, 1957, 1969, 1969, 1994, 2026, 2036, 2037, 2042, 2042, 2048, 2069, 2074, 2074, 2084, 2084, 2088, 2088, 2112, 2136, 2144, 2154, 2208, 2228, 2230, 2237, 2308, 2361, 2365, 2365, 2384, 2384, 2392, 2401, 2417, 2432, 2437, 2444, 2447, 2448, 2451, 2472, 2474, 2480, 2482, 2482, 2486, 2489, 2493, 2493, 2510, 2510, 2524, 2525, 2527, 2529, 2544, 2545, 2556, 2556, 2565, 2570, 2575, 2576, 2579, 2600, 2602, 2608, 2610, 2611, 2613, 2614, 2616, 2617, 2649, 2652, 2654, 2654, 2674, 2676, 2693, 2701, 2703, 2705, 2707, 2728, 2730, 2736, 2738, 2739, 2741, 2745, 2749, 2749, 2768, 2768, 2784, 2785, 2809, 2809, 2821, 2828, 2831, 2832, 2835, 2856, 2858, 2864, 2866, 2867, 2869, 2873, 2877, 2877, 2908, 2909, 2911, 2913, 2929, 2929, 2947, 2947, 2949, 2954, 2958, 2960, 2962, 2965, 2969, 2970, 2972, 2972, 2974, 2975, 2979, 2980, 2984, 2986, 2990, 3001, 3024, 3024, 3077, 3084, 3086, 3088, 3090, 3112, 3114, 3129, 3133, 3133, 3160, 3162, 3168, 3169, 3200, 3200, 3205, 3212, 3214, 3216, 3218, 3240, 3242, 3251, 3253, 3257, 3261, 3261, 3294, 3294, 3296, 3297, 3313, 3314, 3333, 3340, 3342, 3344, 3346, 3386, 3389, 3389, 3406, 3406, 3412, 3414, 3423, 3425, 3450, 3455, 3461, 3478, 3482, 3505, 3507, 3515, 3517, 3517, 3520, 3526, 3585, 3632, 3634, 3635, 3648, 3654, 3713, 3714, 3716, 3716, 3718, 3722, 3724, 3747, 3749, 3749, 3751, 3760, 3762, 3763, 3773, 3773, 3776, 3780, 3782, 3782, 3804, 3807, 3840, 3840, 3904, 3911, 3913, 3948, 3976, 3980, 4096, 4138, 4159, 4159, 4176, 4181, 4186, 4189, 4193, 4193, 4197, 4198, 4206, 4208, 4213, 4225, 4238, 4238, 4256, 4293, 4295, 4295, 4301, 4301, 4304, 4346, 4348, 4680, 4682, 4685, 4688, 4694, 4696, 4696, 4698, 4701, 4704, 4744, 4746, 4749, 4752, 4784, 4786, 4789, 4792, 4798, 4800, 4800, 4802, 4805, 4808, 4822, 4824, 4880, 4882, 4885, 4888, 4954, 4992, 5007, 5024, 5109, 5112, 5117, 5121, 5740, 5743, 5759, 5761, 5786, 5792, 5866, 5870, 5880, 5888, 5900, 5902, 5905, 5920, 5937, 5952, 5969, 5984, 5996, 5998, 6000, 6016, 6067, 6103, 6103, 6108, 6108, 6176, 6264, 6272, 6312, 6314, 6314, 6320, 6389, 6400, 6430, 6480, 6509, 6512, 6516, 6528, 6571, 6576, 6601, 6656, 6678, 6688, 6740, 6823, 6823, 6917, 6963, 6981, 6987, 7043, 7072, 7086, 7087, 7098, 7141, 7168, 7203, 7245, 7247, 7258, 7293, 7296, 7304, 7312, 7354, 7357, 7359, 7401, 7404, 7406, 7411, 7413, 7414, 7418, 7418, 7424, 7615, 7680, 7957, 7960, 7965, 7968, 8005, 8008, 8013, 8016, 8023, 8025, 8025, 8027, 8027, 8029, 8029, 8031, 8061, 8064, 8116, 8118, 8124, 8126, 8126, 8130, 8132, 8134, 8140, 8144, 8147, 8150, 8155, 8160, 8172, 8178, 8180, 8182, 8188, 8305, 8305, 8319, 8319, 8336, 8348, 8450, 8450, 8455, 8455, 8458, 8467, 8469, 8469, 8472, 8477, 8484, 8484, 8486, 8486, 8488, 8488, 8490, 8505, 8508, 8511, 8517, 8521, 8526, 8526, 8544, 8584, 11264, 11310, 11312, 11358, 11360, 11492, 11499, 11502, 11506, 11507, 11520, 11557, 11559, 11559, 11565, 11565, 11568, 11623, 11631, 11631, 11648, 11670, 11680, 11686, 11688, 11694, 11696, 11702, 11704, 11710, 11712, 11718, 11720, 11726, 11728, 11734, 11736, 11742, 12293, 12295, 12321, 12329, 12337, 12341, 12344, 12348, 12353, 12438, 12443, 12447, 12449, 12538, 12540, 12543, 12549, 12591, 12593, 12686, 12704, 12730, 12784, 12799, 13312, 19893, 19968, 40943, 40960, 42124, 42192, 42237, 42240, 42508, 42512, 42527, 42538, 42539, 42560, 42606, 42623, 42653, 42656, 42735, 42775, 42783, 42786, 42888, 42891, 42943, 42946, 42950, 42999, 43009, 43011, 43013, 43015, 43018, 43020, 43042, 43072, 43123, 43138, 43187, 43250, 43255, 43259, 43259, 43261, 43262, 43274, 43301, 43312, 43334, 43360, 43388, 43396, 43442, 43471, 43471, 43488, 43492, 43494, 43503, 43514, 43518, 43520, 43560, 43584, 43586, 43588, 43595, 43616, 43638, 43642, 43642, 43646, 43695, 43697, 43697, 43701, 43702, 43705, 43709, 43712, 43712, 43714, 43714, 43739, 43741, 43744, 43754, 43762, 43764, 43777, 43782, 43785, 43790, 43793, 43798, 43808, 43814, 43816, 43822, 43824, 43866, 43868, 43879, 43888, 44002, 44032, 55203, 55216, 55238, 55243, 55291, 63744, 64109, 64112, 64217, 64256, 64262, 64275, 64279, 64285, 64285, 64287, 64296, 64298, 64310, 64312, 64316, 64318, 64318, 64320, 64321, 64323, 64324, 64326, 64433, 64467, 64829, 64848, 64911, 64914, 64967, 65008, 65019, 65136, 65140, 65142, 65276, 65313, 65338, 65345, 65370, 65382, 65470, 65474, 65479, 65482, 65487, 65490, 65495, 65498, 65500, 65536, 65547, 65549, 65574, 65576, 65594, 65596, 65597, 65599, 65613, 65616, 65629, 65664, 65786, 65856, 65908, 66176, 66204, 66208, 66256, 66304, 66335, 66349, 66378, 66384, 66421, 66432, 66461, 66464, 66499, 66504, 66511, 66513, 66517, 66560, 66717, 66736, 66771, 66776, 66811, 66816, 66855, 66864, 66915, 67072, 67382, 67392, 67413, 67424, 67431, 67584, 67589, 67592, 67592, 67594, 67637, 67639, 67640, 67644, 67644, 67647, 67669, 67680, 67702, 67712, 67742, 67808, 67826, 67828, 67829, 67840, 67861, 67872, 67897, 67968, 68023, 68030, 68031, 68096, 68096, 68112, 68115, 68117, 68119, 68121, 68149, 68192, 68220, 68224, 68252, 68288, 68295, 68297, 68324, 68352, 68405, 68416, 68437, 68448, 68466, 68480, 68497, 68608, 68680, 68736, 68786, 68800, 68850, 68864, 68899, 69376, 69404, 69415, 69415, 69424, 69445, 69600, 69622, 69635, 69687, 69763, 69807, 69840, 69864, 69891, 69926, 69956, 69956, 69968, 70002, 70006, 70006, 70019, 70066, 70081, 70084, 70106, 70106, 70108, 70108, 70144, 70161, 70163, 70187, 70272, 70278, 70280, 70280, 70282, 70285, 70287, 70301, 70303, 70312, 70320, 70366, 70405, 70412, 70415, 70416, 70419, 70440, 70442, 70448, 70450, 70451, 70453, 70457, 70461, 70461, 70480, 70480, 70493, 70497, 70656, 70708, 70727, 70730, 70751, 70751, 70784, 70831, 70852, 70853, 70855, 70855, 71040, 71086, 71128, 71131, 71168, 71215, 71236, 71236, 71296, 71338, 71352, 71352, 71424, 71450, 71680, 71723, 71840, 71903, 71935, 71935, 72096, 72103, 72106, 72144, 72161, 72161, 72163, 72163, 72192, 72192, 72203, 72242, 72250, 72250, 72272, 72272, 72284, 72329, 72349, 72349, 72384, 72440, 72704, 72712, 72714, 72750, 72768, 72768, 72818, 72847, 72960, 72966, 72968, 72969, 72971, 73008, 73030, 73030, 73056, 73061, 73063, 73064, 73066, 73097, 73112, 73112, 73440, 73458, 73728, 74649, 74752, 74862, 74880, 75075, 77824, 78894, 82944, 83526, 92160, 92728, 92736, 92766, 92880, 92909, 92928, 92975, 92992, 92995, 93027, 93047, 93053, 93071, 93760, 93823, 93952, 94026, 94032, 94032, 94099, 94111, 94176, 94177, 94179, 94179, 94208, 100343, 100352, 101106, 110592, 110878, 110928, 110930, 110948, 110951, 110960, 111355, 113664, 113770, 113776, 113788, 113792, 113800, 113808, 113817, 119808, 119892, 119894, 119964, 119966, 119967, 119970, 119970, 119973, 119974, 119977, 119980, 119982, 119993, 119995, 119995, 119997, 120003, 120005, 120069, 120071, 120074, 120077, 120084, 120086, 120092, 120094, 120121, 120123, 120126, 120128, 120132, 120134, 120134, 120138, 120144, 120146, 120485, 120488, 120512, 120514, 120538, 120540, 120570, 120572, 120596, 120598, 120628, 120630, 120654, 120656, 120686, 120688, 120712, 120714, 120744, 120746, 120770, 120772, 120779, 123136, 123180, 123191, 123197, 123214, 123214, 123584, 123627, 124928, 125124, 125184, 125251, 125259, 125259, 126464, 126467, 126469, 126495, 126497, 126498, 126500, 126500, 126503, 126503, 126505, 126514, 126516, 126519, 126521, 126521, 126523, 126523, 126530, 126530, 126535, 126535, 126537, 126537, 126539, 126539, 126541, 126543, 126545, 126546, 126548, 126548, 126551, 126551, 126553, 126553, 126555, 126555, 126557, 126557, 126559, 126559, 126561, 126562, 126564, 126564, 126567, 126570, 126572, 126578, 126580, 126583, 126585, 126588, 126590, 126590, 126592, 126601, 126603, 126619, 126625, 126627, 126629, 126633, 126635, 126651, 131072, 173782, 173824, 177972, 177984, 178205, 178208, 183969, 183984, 191456, 194560, 195101];
var unicodeESNextIdentifierPart = [48, 57, 65, 90, 95, 95, 97, 122, 170, 170, 181, 181, 183, 183, 186, 186, 192, 214, 216, 246, 248, 705, 710, 721, 736, 740, 748, 748, 750, 750, 768, 884, 886, 887, 890, 893, 895, 895, 902, 906, 908, 908, 910, 929, 931, 1013, 1015, 1153, 1155, 1159, 1162, 1327, 1329, 1366, 1369, 1369, 1376, 1416, 1425, 1469, 1471, 1471, 1473, 1474, 1476, 1477, 1479, 1479, 1488, 1514, 1519, 1522, 1552, 1562, 1568, 1641, 1646, 1747, 1749, 1756, 1759, 1768, 1770, 1788, 1791, 1791, 1808, 1866, 1869, 1969, 1984, 2037, 2042, 2042, 2045, 2045, 2048, 2093, 2112, 2139, 2144, 2154, 2208, 2228, 2230, 2237, 2259, 2273, 2275, 2403, 2406, 2415, 2417, 2435, 2437, 2444, 2447, 2448, 2451, 2472, 2474, 2480, 2482, 2482, 2486, 2489, 2492, 2500, 2503, 2504, 2507, 2510, 2519, 2519, 2524, 2525, 2527, 2531, 2534, 2545, 2556, 2556, 2558, 2558, 2561, 2563, 2565, 2570, 2575, 2576, 2579, 2600, 2602, 2608, 2610, 2611, 2613, 2614, 2616, 2617, 2620, 2620, 2622, 2626, 2631, 2632, 2635, 2637, 2641, 2641, 2649, 2652, 2654, 2654, 2662, 2677, 2689, 2691, 2693, 2701, 2703, 2705, 2707, 2728, 2730, 2736, 2738, 2739, 2741, 2745, 2748, 2757, 2759, 2761, 2763, 2765, 2768, 2768, 2784, 2787, 2790, 2799, 2809, 2815, 2817, 2819, 2821, 2828, 2831, 2832, 2835, 2856, 2858, 2864, 2866, 2867, 2869, 2873, 2876, 2884, 2887, 2888, 2891, 2893, 2902, 2903, 2908, 2909, 2911, 2915, 2918, 2927, 2929, 2929, 2946, 2947, 2949, 2954, 2958, 2960, 2962, 2965, 2969, 2970, 2972, 2972, 2974, 2975, 2979, 2980, 2984, 2986, 2990, 3001, 3006, 3010, 3014, 3016, 3018, 3021, 3024, 3024, 3031, 3031, 3046, 3055, 3072, 3084, 3086, 3088, 3090, 3112, 3114, 3129, 3133, 3140, 3142, 3144, 3146, 3149, 3157, 3158, 3160, 3162, 3168, 3171, 3174, 3183, 3200, 3203, 3205, 3212, 3214, 3216, 3218, 3240, 3242, 3251, 3253, 3257, 3260, 3268, 3270, 3272, 3274, 3277, 3285, 3286, 3294, 3294, 3296, 3299, 3302, 3311, 3313, 3314, 3328, 3331, 3333, 3340, 3342, 3344, 3346, 3396, 3398, 3400, 3402, 3406, 3412, 3415, 3423, 3427, 3430, 3439, 3450, 3455, 3458, 3459, 3461, 3478, 3482, 3505, 3507, 3515, 3517, 3517, 3520, 3526, 3530, 3530, 3535, 3540, 3542, 3542, 3544, 3551, 3558, 3567, 3570, 3571, 3585, 3642, 3648, 3662, 3664, 3673, 3713, 3714, 3716, 3716, 3718, 3722, 3724, 3747, 3749, 3749, 3751, 3773, 3776, 3780, 3782, 3782, 3784, 3789, 3792, 3801, 3804, 3807, 3840, 3840, 3864, 3865, 3872, 3881, 3893, 3893, 3895, 3895, 3897, 3897, 3902, 3911, 3913, 3948, 3953, 3972, 3974, 3991, 3993, 4028, 4038, 4038, 4096, 4169, 4176, 4253, 4256, 4293, 4295, 4295, 4301, 4301, 4304, 4346, 4348, 4680, 4682, 4685, 4688, 4694, 4696, 4696, 4698, 4701, 4704, 4744, 4746, 4749, 4752, 4784, 4786, 4789, 4792, 4798, 4800, 4800, 4802, 4805, 4808, 4822, 4824, 4880, 4882, 4885, 4888, 4954, 4957, 4959, 4969, 4977, 4992, 5007, 5024, 5109, 5112, 5117, 5121, 5740, 5743, 5759, 5761, 5786, 5792, 5866, 5870, 5880, 5888, 5900, 5902, 5908, 5920, 5940, 5952, 5971, 5984, 5996, 5998, 6000, 6002, 6003, 6016, 6099, 6103, 6103, 6108, 6109, 6112, 6121, 6155, 6157, 6160, 6169, 6176, 6264, 6272, 6314, 6320, 6389, 6400, 6430, 6432, 6443, 6448, 6459, 6470, 6509, 6512, 6516, 6528, 6571, 6576, 6601, 6608, 6618, 6656, 6683, 6688, 6750, 6752, 6780, 6783, 6793, 6800, 6809, 6823, 6823, 6832, 6845, 6912, 6987, 6992, 7001, 7019, 7027, 7040, 7155, 7168, 7223, 7232, 7241, 7245, 7293, 7296, 7304, 7312, 7354, 7357, 7359, 7376, 7378, 7380, 7418, 7424, 7673, 7675, 7957, 7960, 7965, 7968, 8005, 8008, 8013, 8016, 8023, 8025, 8025, 8027, 8027, 8029, 8029, 8031, 8061, 8064, 8116, 8118, 8124, 8126, 8126, 8130, 8132, 8134, 8140, 8144, 8147, 8150, 8155, 8160, 8172, 8178, 8180, 8182, 8188, 8255, 8256, 8276, 8276, 8305, 8305, 8319, 8319, 8336, 8348, 8400, 8412, 8417, 8417, 8421, 8432, 8450, 8450, 8455, 8455, 8458, 8467, 8469, 8469, 8472, 8477, 8484, 8484, 8486, 8486, 8488, 8488, 8490, 8505, 8508, 8511, 8517, 8521, 8526, 8526, 8544, 8584, 11264, 11310, 11312, 11358, 11360, 11492, 11499, 11507, 11520, 11557, 11559, 11559, 11565, 11565, 11568, 11623, 11631, 11631, 11647, 11670, 11680, 11686, 11688, 11694, 11696, 11702, 11704, 11710, 11712, 11718, 11720, 11726, 11728, 11734, 11736, 11742, 11744, 11775, 12293, 12295, 12321, 12335, 12337, 12341, 12344, 12348, 12353, 12438, 12441, 12447, 12449, 12538, 12540, 12543, 12549, 12591, 12593, 12686, 12704, 12730, 12784, 12799, 13312, 19893, 19968, 40943, 40960, 42124, 42192, 42237, 42240, 42508, 42512, 42539, 42560, 42607, 42612, 42621, 42623, 42737, 42775, 42783, 42786, 42888, 42891, 42943, 42946, 42950, 42999, 43047, 43072, 43123, 43136, 43205, 43216, 43225, 43232, 43255, 43259, 43259, 43261, 43309, 43312, 43347, 43360, 43388, 43392, 43456, 43471, 43481, 43488, 43518, 43520, 43574, 43584, 43597, 43600, 43609, 43616, 43638, 43642, 43714, 43739, 43741, 43744, 43759, 43762, 43766, 43777, 43782, 43785, 43790, 43793, 43798, 43808, 43814, 43816, 43822, 43824, 43866, 43868, 43879, 43888, 44010, 44012, 44013, 44016, 44025, 44032, 55203, 55216, 55238, 55243, 55291, 63744, 64109, 64112, 64217, 64256, 64262, 64275, 64279, 64285, 64296, 64298, 64310, 64312, 64316, 64318, 64318, 64320, 64321, 64323, 64324, 64326, 64433, 64467, 64829, 64848, 64911, 64914, 64967, 65008, 65019, 65024, 65039, 65056, 65071, 65075, 65076, 65101, 65103, 65136, 65140, 65142, 65276, 65296, 65305, 65313, 65338, 65343, 65343, 65345, 65370, 65382, 65470, 65474, 65479, 65482, 65487, 65490, 65495, 65498, 65500, 65536, 65547, 65549, 65574, 65576, 65594, 65596, 65597, 65599, 65613, 65616, 65629, 65664, 65786, 65856, 65908, 66045, 66045, 66176, 66204, 66208, 66256, 66272, 66272, 66304, 66335, 66349, 66378, 66384, 66426, 66432, 66461, 66464, 66499, 66504, 66511, 66513, 66517, 66560, 66717, 66720, 66729, 66736, 66771, 66776, 66811, 66816, 66855, 66864, 66915, 67072, 67382, 67392, 67413, 67424, 67431, 67584, 67589, 67592, 67592, 67594, 67637, 67639, 67640, 67644, 67644, 67647, 67669, 67680, 67702, 67712, 67742, 67808, 67826, 67828, 67829, 67840, 67861, 67872, 67897, 67968, 68023, 68030, 68031, 68096, 68099, 68101, 68102, 68108, 68115, 68117, 68119, 68121, 68149, 68152, 68154, 68159, 68159, 68192, 68220, 68224, 68252, 68288, 68295, 68297, 68326, 68352, 68405, 68416, 68437, 68448, 68466, 68480, 68497, 68608, 68680, 68736, 68786, 68800, 68850, 68864, 68903, 68912, 68921, 69376, 69404, 69415, 69415, 69424, 69456, 69600, 69622, 69632, 69702, 69734, 69743, 69759, 69818, 69840, 69864, 69872, 69881, 69888, 69940, 69942, 69951, 69956, 69958, 69968, 70003, 70006, 70006, 70016, 70084, 70089, 70092, 70096, 70106, 70108, 70108, 70144, 70161, 70163, 70199, 70206, 70206, 70272, 70278, 70280, 70280, 70282, 70285, 70287, 70301, 70303, 70312, 70320, 70378, 70384, 70393, 70400, 70403, 70405, 70412, 70415, 70416, 70419, 70440, 70442, 70448, 70450, 70451, 70453, 70457, 70459, 70468, 70471, 70472, 70475, 70477, 70480, 70480, 70487, 70487, 70493, 70499, 70502, 70508, 70512, 70516, 70656, 70730, 70736, 70745, 70750, 70751, 70784, 70853, 70855, 70855, 70864, 70873, 71040, 71093, 71096, 71104, 71128, 71133, 71168, 71232, 71236, 71236, 71248, 71257, 71296, 71352, 71360, 71369, 71424, 71450, 71453, 71467, 71472, 71481, 71680, 71738, 71840, 71913, 71935, 71935, 72096, 72103, 72106, 72151, 72154, 72161, 72163, 72164, 72192, 72254, 72263, 72263, 72272, 72345, 72349, 72349, 72384, 72440, 72704, 72712, 72714, 72758, 72760, 72768, 72784, 72793, 72818, 72847, 72850, 72871, 72873, 72886, 72960, 72966, 72968, 72969, 72971, 73014, 73018, 73018, 73020, 73021, 73023, 73031, 73040, 73049, 73056, 73061, 73063, 73064, 73066, 73102, 73104, 73105, 73107, 73112, 73120, 73129, 73440, 73462, 73728, 74649, 74752, 74862, 74880, 75075, 77824, 78894, 82944, 83526, 92160, 92728, 92736, 92766, 92768, 92777, 92880, 92909, 92912, 92916, 92928, 92982, 92992, 92995, 93008, 93017, 93027, 93047, 93053, 93071, 93760, 93823, 93952, 94026, 94031, 94087, 94095, 94111, 94176, 94177, 94179, 94179, 94208, 100343, 100352, 101106, 110592, 110878, 110928, 110930, 110948, 110951, 110960, 111355, 113664, 113770, 113776, 113788, 113792, 113800, 113808, 113817, 113821, 113822, 119141, 119145, 119149, 119154, 119163, 119170, 119173, 119179, 119210, 119213, 119362, 119364, 119808, 119892, 119894, 119964, 119966, 119967, 119970, 119970, 119973, 119974, 119977, 119980, 119982, 119993, 119995, 119995, 119997, 120003, 120005, 120069, 120071, 120074, 120077, 120084, 120086, 120092, 120094, 120121, 120123, 120126, 120128, 120132, 120134, 120134, 120138, 120144, 120146, 120485, 120488, 120512, 120514, 120538, 120540, 120570, 120572, 120596, 120598, 120628, 120630, 120654, 120656, 120686, 120688, 120712, 120714, 120744, 120746, 120770, 120772, 120779, 120782, 120831, 121344, 121398, 121403, 121452, 121461, 121461, 121476, 121476, 121499, 121503, 121505, 121519, 122880, 122886, 122888, 122904, 122907, 122913, 122915, 122916, 122918, 122922, 123136, 123180, 123184, 123197, 123200, 123209, 123214, 123214, 123584, 123641, 124928, 125124, 125136, 125142, 125184, 125259, 125264, 125273, 126464, 126467, 126469, 126495, 126497, 126498, 126500, 126500, 126503, 126503, 126505, 126514, 126516, 126519, 126521, 126521, 126523, 126523, 126530, 126530, 126535, 126535, 126537, 126537, 126539, 126539, 126541, 126543, 126545, 126546, 126548, 126548, 126551, 126551, 126553, 126553, 126555, 126555, 126557, 126557, 126559, 126559, 126561, 126562, 126564, 126564, 126567, 126570, 126572, 126578, 126580, 126583, 126585, 126588, 126590, 126590, 126592, 126601, 126603, 126619, 126625, 126627, 126629, 126633, 126635, 126651, 131072, 173782, 173824, 177972, 177984, 178205, 178208, 183969, 183984, 191456, 194560, 195101, 917760, 917999];
/**
* Test for whether a single line comment with leading whitespace trimmed's text contains a directive.
*/
var commentDirectiveRegExSingleLine = /^\/\/\/?\s*@(ts-expect-error|ts-ignore)/;
/**
* Test for whether a multi-line comment with leading whitespace trimmed's last line contains a directive.
*/
var commentDirectiveRegExMultiLine = /^(?:\/|\*)*\s*@(ts-expect-error|ts-ignore)/;
function lookupInUnicodeMap(code, map) {
// Bail out quickly if it couldn't possibly be in the map.
if (code < map[0]) {
return false;
}
// Perform binary search in one of the Unicode range maps
var lo = 0;
var hi = map.length;
var mid;
while (lo + 1 < hi) {
mid = lo + (hi - lo) / 2;
// mid has to be even to catch a range's beginning
mid -= mid % 2;
if (map[mid] <= code && code <= map[mid + 1]) {
return true;
}
if (code < map[mid]) {
hi = mid;
}
else {
lo = mid + 2;
}
}
return false;
}
/* @internal */ function isUnicodeIdentifierStart(code, languageVersion) {
return languageVersion >= 2 /* ES2015 */ ?
lookupInUnicodeMap(code, unicodeESNextIdentifierStart) :
languageVersion === 1 /* ES5 */ ? lookupInUnicodeMap(code, unicodeES5IdentifierStart) :
lookupInUnicodeMap(code, unicodeES3IdentifierStart);
}
ts.isUnicodeIdentifierStart = isUnicodeIdentifierStart;
function isUnicodeIdentifierPart(code, languageVersion) {
return languageVersion >= 2 /* ES2015 */ ?
lookupInUnicodeMap(code, unicodeESNextIdentifierPart) :
languageVersion === 1 /* ES5 */ ? lookupInUnicodeMap(code, unicodeES5IdentifierPart) :
lookupInUnicodeMap(code, unicodeES3IdentifierPart);
}
function makeReverseMap(source) {
var result = [];
source.forEach(function (value, name) {
result[value] = name;
});
return result;
}
var tokenStrings = makeReverseMap(textToToken);
function tokenToString(t) {
return tokenStrings[t];
}
ts.tokenToString = tokenToString;
/* @internal */
function stringToToken(s) {
return textToToken.get(s);
}
ts.stringToToken = stringToToken;
/* @internal */
function computeLineStarts(text) {
var result = new Array();
var pos = 0;
var lineStart = 0;
while (pos < text.length) {
var ch = text.charCodeAt(pos);
pos++;
switch (ch) {
case 13 /* carriageReturn */:
if (text.charCodeAt(pos) === 10 /* lineFeed */) {
pos++;
}
// falls through
case 10 /* lineFeed */:
result.push(lineStart);
lineStart = pos;
break;
default:
if (ch > 127 /* maxAsciiCharacter */ && isLineBreak(ch)) {
result.push(lineStart);
lineStart = pos;
}
break;
}
}
result.push(lineStart);
return result;
}
ts.computeLineStarts = computeLineStarts;
function getPositionOfLineAndCharacter(sourceFile, line, character, allowEdits) {
return sourceFile.getPositionOfLineAndCharacter ?
sourceFile.getPositionOfLineAndCharacter(line, character, allowEdits) :
computePositionOfLineAndCharacter(getLineStarts(sourceFile), line, character, sourceFile.text, allowEdits);
}
ts.getPositionOfLineAndCharacter = getPositionOfLineAndCharacter;
/* @internal */
function computePositionOfLineAndCharacter(lineStarts, line, character, debugText, allowEdits) {
if (line < 0 || line >= lineStarts.length) {
if (allowEdits) {
// Clamp line to nearest allowable value
line = line < 0 ? 0 : line >= lineStarts.length ? lineStarts.length - 1 : line;
}
else {
ts.Debug.fail("Bad line number. Line: " + line + ", lineStarts.length: " + lineStarts.length + " , line map is correct? " + (debugText !== undefined ? ts.arraysEqual(lineStarts, computeLineStarts(debugText)) : "unknown"));
}
}
var res = lineStarts[line] + character;
if (allowEdits) {
// Clamp to nearest allowable values to allow the underlying to be edited without crashing (accuracy is lost, instead)
// TODO: Somehow track edits between file as it was during the creation of sourcemap we have and the current file and
// apply them to the computed position to improve accuracy
return res > lineStarts[line + 1] ? lineStarts[line + 1] : typeof debugText === "string" && res > debugText.length ? debugText.length : res;
}
if (line < lineStarts.length - 1) {
ts.Debug.assert(res < lineStarts[line + 1]);
}
else if (debugText !== undefined) {
ts.Debug.assert(res <= debugText.length); // Allow single character overflow for trailing newline
}
return res;
}
ts.computePositionOfLineAndCharacter = computePositionOfLineAndCharacter;
/* @internal */
function getLineStarts(sourceFile) {
return sourceFile.lineMap || (sourceFile.lineMap = computeLineStarts(sourceFile.text));
}
ts.getLineStarts = getLineStarts;
/* @internal */
function computeLineAndCharacterOfPosition(lineStarts, position) {
var lineNumber = computeLineOfPosition(lineStarts, position);
return {
line: lineNumber,
character: position - lineStarts[lineNumber]
};
}
ts.computeLineAndCharacterOfPosition = computeLineAndCharacterOfPosition;
/**
* @internal
* We assume the first line starts at position 0 and 'position' is non-negative.
*/
function computeLineOfPosition(lineStarts, position, lowerBound) {
var lineNumber = ts.binarySearch(lineStarts, position, ts.identity, ts.compareValues, lowerBound);
if (lineNumber < 0) {
// If the actual position was not found,
// the binary search returns the 2's-complement of the next line start
// e.g. if the line starts at [5, 10, 23, 80] and the position requested was 20
// then the search will return -2.
//
// We want the index of the previous line start, so we subtract 1.
// Review 2's-complement if this is confusing.
lineNumber = ~lineNumber - 1;
ts.Debug.assert(lineNumber !== -1, "position cannot precede the beginning of the file");
}
return lineNumber;
}
ts.computeLineOfPosition = computeLineOfPosition;
/** @internal */
function getLinesBetweenPositions(sourceFile, pos1, pos2) {
if (pos1 === pos2)
return 0;
var lineStarts = getLineStarts(sourceFile);
var lower = Math.min(pos1, pos2);
var isNegative = lower === pos2;
var upper = isNegative ? pos1 : pos2;
var lowerLine = computeLineOfPosition(lineStarts, lower);
var upperLine = computeLineOfPosition(lineStarts, upper, lowerLine);
return isNegative ? lowerLine - upperLine : upperLine - lowerLine;
}
ts.getLinesBetweenPositions = getLinesBetweenPositions;
function getLineAndCharacterOfPosition(sourceFile, position) {
return computeLineAndCharacterOfPosition(getLineStarts(sourceFile), position);
}
ts.getLineAndCharacterOfPosition = getLineAndCharacterOfPosition;
function isWhiteSpaceLike(ch) {
return isWhiteSpaceSingleLine(ch) || isLineBreak(ch);
}
ts.isWhiteSpaceLike = isWhiteSpaceLike;
/** Does not include line breaks. For that, see isWhiteSpaceLike. */
function isWhiteSpaceSingleLine(ch) {
// Note: nextLine is in the Zs space, and should be considered to be a whitespace.
// It is explicitly not a line-break as it isn't in the exact set specified by EcmaScript.
return ch === 32 /* space */ ||
ch === 9 /* tab */ ||
ch === 11 /* verticalTab */ ||
ch === 12 /* formFeed */ ||
ch === 160 /* nonBreakingSpace */ ||
ch === 133 /* nextLine */ ||
ch === 5760 /* ogham */ ||
ch >= 8192 /* enQuad */ && ch <= 8203 /* zeroWidthSpace */ ||
ch === 8239 /* narrowNoBreakSpace */ ||
ch === 8287 /* mathematicalSpace */ ||
ch === 12288 /* ideographicSpace */ ||
ch === 65279 /* byteOrderMark */;
}
ts.isWhiteSpaceSingleLine = isWhiteSpaceSingleLine;
function isLineBreak(ch) {
// ES5 7.3:
// The ECMAScript line terminator characters are listed in Table 3.
// Table 3: Line Terminator Characters
// Code Unit Value Name Formal Name
// \u000A Line Feed <LF>
// \u000D Carriage Return <CR>
// \u2028 Line separator <LS>
// \u2029 Paragraph separator <PS>
// Only the characters in Table 3 are treated as line terminators. Other new line or line
// breaking characters are treated as white space but not as line terminators.
return ch === 10 /* lineFeed */ ||
ch === 13 /* carriageReturn */ ||
ch === 8232 /* lineSeparator */ ||
ch === 8233 /* paragraphSeparator */;
}
ts.isLineBreak = isLineBreak;
function isDigit(ch) {
return ch >= 48 /* _0 */ && ch <= 57 /* _9 */;
}
function isHexDigit(ch) {
return isDigit(ch) || ch >= 65 /* A */ && ch <= 70 /* F */ || ch >= 97 /* a */ && ch <= 102 /* f */;
}
function isCodePoint(code) {
return code <= 0x10FFFF;
}
/* @internal */
function isOctalDigit(ch) {
return ch >= 48 /* _0 */ && ch <= 55 /* _7 */;
}
ts.isOctalDigit = isOctalDigit;
function couldStartTrivia(text, pos) {
// Keep in sync with skipTrivia
var ch = text.charCodeAt(pos);
switch (ch) {
case 13 /* carriageReturn */:
case 10 /* lineFeed */:
case 9 /* tab */:
case 11 /* verticalTab */:
case 12 /* formFeed */:
case 32 /* space */:
case 47 /* slash */:
// starts of normal trivia
// falls through
case 60 /* lessThan */:
case 124 /* bar */:
case 61 /* equals */:
case 62 /* greaterThan */:
// Starts of conflict marker trivia
return true;
case 35 /* hash */:
// Only if its the beginning can we have #! trivia
return pos === 0;
default:
return ch > 127 /* maxAsciiCharacter */;
}
}
ts.couldStartTrivia = couldStartTrivia;
/* @internal */
function skipTrivia(text, pos, stopAfterLineBreak, stopAtComments, inJSDoc) {
if (ts.positionIsSynthesized(pos)) {
return pos;
}
var canConsumeStar = false;
// Keep in sync with couldStartTrivia
while (true) {
var ch = text.charCodeAt(pos);
switch (ch) {
case 13 /* carriageReturn */:
if (text.charCodeAt(pos + 1) === 10 /* lineFeed */) {
pos++;
}
// falls through
case 10 /* lineFeed */:
pos++;
if (stopAfterLineBreak) {
return pos;
}
canConsumeStar = !!inJSDoc;
continue;
case 9 /* tab */:
case 11 /* verticalTab */:
case 12 /* formFeed */:
case 32 /* space */:
pos++;
continue;
case 47 /* slash */:
if (stopAtComments) {
break;
}
if (text.charCodeAt(pos + 1) === 47 /* slash */) {
pos += 2;
while (pos < text.length) {
if (isLineBreak(text.charCodeAt(pos))) {
break;
}
pos++;
}
canConsumeStar = false;
continue;
}
if (text.charCodeAt(pos + 1) === 42 /* asterisk */) {
pos += 2;
while (pos < text.length) {
if (text.charCodeAt(pos) === 42 /* asterisk */ && text.charCodeAt(pos + 1) === 47 /* slash */) {
pos += 2;
break;
}
pos++;
}
canConsumeStar = false;
continue;
}
break;
case 60 /* lessThan */:
case 124 /* bar */:
case 61 /* equals */:
case 62 /* greaterThan */:
if (isConflictMarkerTrivia(text, pos)) {
pos = scanConflictMarkerTrivia(text, pos);
canConsumeStar = false;
continue;
}
break;
case 35 /* hash */:
if (pos === 0 && isShebangTrivia(text, pos)) {
pos = scanShebangTrivia(text, pos);
canConsumeStar = false;
continue;
}
break;
case 42 /* asterisk */:
if (canConsumeStar) {
pos++;
canConsumeStar = false;
continue;
}
break;
default:
if (ch > 127 /* maxAsciiCharacter */ && (isWhiteSpaceLike(ch))) {
pos++;
continue;
}
break;
}
return pos;
}
}
ts.skipTrivia = skipTrivia;
// All conflict markers consist of the same character repeated seven times. If it is
// a <<<<<<< or >>>>>>> marker then it is also followed by a space.
var mergeConflictMarkerLength = "<<<<<<<".length;
function isConflictMarkerTrivia(text, pos) {
ts.Debug.assert(pos >= 0);
// Conflict markers must be at the start of a line.
if (pos === 0 || isLineBreak(text.charCodeAt(pos - 1))) {
var ch = text.charCodeAt(pos);
if ((pos + mergeConflictMarkerLength) < text.length) {
for (var i = 0; i < mergeConflictMarkerLength; i++) {
if (text.charCodeAt(pos + i) !== ch) {
return false;
}
}
return ch === 61 /* equals */ ||
text.charCodeAt(pos + mergeConflictMarkerLength) === 32 /* space */;
}
}
return false;
}
function scanConflictMarkerTrivia(text, pos, error) {
if (error) {
error(ts.Diagnostics.Merge_conflict_marker_encountered, pos, mergeConflictMarkerLength);
}
var ch = text.charCodeAt(pos);
var len = text.length;
if (ch === 60 /* lessThan */ || ch === 62 /* greaterThan */) {
while (pos < len && !isLineBreak(text.charCodeAt(pos))) {
pos++;
}
}
else {
ts.Debug.assert(ch === 124 /* bar */ || ch === 61 /* equals */);
// Consume everything from the start of a ||||||| or ======= marker to the start
// of the next ======= or >>>>>>> marker.
while (pos < len) {
var currentChar = text.charCodeAt(pos);
if ((currentChar === 61 /* equals */ || currentChar === 62 /* greaterThan */) && currentChar !== ch && isConflictMarkerTrivia(text, pos)) {
break;
}
pos++;
}
}
return pos;
}
var shebangTriviaRegex = /^#!.*/;
/*@internal*/
function isShebangTrivia(text, pos) {
// Shebangs check must only be done at the start of the file
ts.Debug.assert(pos === 0);
return shebangTriviaRegex.test(text);
}
ts.isShebangTrivia = isShebangTrivia;
/*@internal*/
function scanShebangTrivia(text, pos) {
var shebang = shebangTriviaRegex.exec(text)[0];
pos = pos + shebang.length;
return pos;
}
ts.scanShebangTrivia = scanShebangTrivia;
/**
* Invokes a callback for each comment range following the provided position.
*
* Single-line comment ranges include the leading double-slash characters but not the ending
* line break. Multi-line comment ranges include the leading slash-asterisk and trailing
* asterisk-slash characters.
*
* @param reduce If true, accumulates the result of calling the callback in a fashion similar
* to reduceLeft. If false, iteration stops when the callback returns a truthy value.
* @param text The source text to scan.
* @param pos The position at which to start scanning.
* @param trailing If false, whitespace is skipped until the first line break and comments
* between that location and the next token are returned. If true, comments occurring
* between the given position and the next line break are returned.
* @param cb The callback to execute as each comment range is encountered.
* @param state A state value to pass to each iteration of the callback.
* @param initial An initial value to pass when accumulating results (when "reduce" is true).
* @returns If "reduce" is true, the accumulated value. If "reduce" is false, the first truthy
* return value of the callback.
*/
function iterateCommentRanges(reduce, text, pos, trailing, cb, state, initial) {
var pendingPos;
var pendingEnd;
var pendingKind;
var pendingHasTrailingNewLine;
var hasPendingCommentRange = false;
var collecting = trailing;
var accumulator = initial;
if (pos === 0) {
collecting = true;
var shebang = getShebang(text);
if (shebang) {
pos = shebang.length;
}
}
scan: while (pos >= 0 && pos < text.length) {
var ch = text.charCodeAt(pos);
switch (ch) {
case 13 /* carriageReturn */:
if (text.charCodeAt(pos + 1) === 10 /* lineFeed */) {
pos++;
}
// falls through
case 10 /* lineFeed */:
pos++;
if (trailing) {
break scan;
}
collecting = true;
if (hasPendingCommentRange) {
pendingHasTrailingNewLine = true;
}
continue;
case 9 /* tab */:
case 11 /* verticalTab */:
case 12 /* formFeed */:
case 32 /* space */:
pos++;
continue;
case 47 /* slash */:
var nextChar = text.charCodeAt(pos + 1);
var hasTrailingNewLine = false;
if (nextChar === 47 /* slash */ || nextChar === 42 /* asterisk */) {
var kind = nextChar === 47 /* slash */ ? 2 /* SingleLineCommentTrivia */ : 3 /* MultiLineCommentTrivia */;
var startPos = pos;
pos += 2;
if (nextChar === 47 /* slash */) {
while (pos < text.length) {
if (isLineBreak(text.charCodeAt(pos))) {
hasTrailingNewLine = true;
break;
}
pos++;
}
}
else {
while (pos < text.length) {
if (text.charCodeAt(pos) === 42 /* asterisk */ && text.charCodeAt(pos + 1) === 47 /* slash */) {
pos += 2;
break;
}
pos++;
}
}
if (collecting) {
if (hasPendingCommentRange) {
accumulator = cb(pendingPos, pendingEnd, pendingKind, pendingHasTrailingNewLine, state, accumulator);
if (!reduce && accumulator) {
// If we are not reducing and we have a truthy result, return it.
return accumulator;
}
}
pendingPos = startPos;
pendingEnd = pos;
pendingKind = kind;
pendingHasTrailingNewLine = hasTrailingNewLine;
hasPendingCommentRange = true;
}
continue;
}
break scan;
default:
if (ch > 127 /* maxAsciiCharacter */ && (isWhiteSpaceLike(ch))) {
if (hasPendingCommentRange && isLineBreak(ch)) {
pendingHasTrailingNewLine = true;
}
pos++;
continue;
}
break scan;
}
}
if (hasPendingCommentRange) {
accumulator = cb(pendingPos, pendingEnd, pendingKind, pendingHasTrailingNewLine, state, accumulator);
}
return accumulator;
}
function forEachLeadingCommentRange(text, pos, cb, state) {
return iterateCommentRanges(/*reduce*/ false, text, pos, /*trailing*/ false, cb, state);
}
ts.forEachLeadingCommentRange = forEachLeadingCommentRange;
function forEachTrailingCommentRange(text, pos, cb, state) {
return iterateCommentRanges(/*reduce*/ false, text, pos, /*trailing*/ true, cb, state);
}
ts.forEachTrailingCommentRange = forEachTrailingCommentRange;
function reduceEachLeadingCommentRange(text, pos, cb, state, initial) {
return iterateCommentRanges(/*reduce*/ true, text, pos, /*trailing*/ false, cb, state, initial);
}
ts.reduceEachLeadingCommentRange = reduceEachLeadingCommentRange;
function reduceEachTrailingCommentRange(text, pos, cb, state, initial) {
return iterateCommentRanges(/*reduce*/ true, text, pos, /*trailing*/ true, cb, state, initial);
}
ts.reduceEachTrailingCommentRange = reduceEachTrailingCommentRange;
function appendCommentRange(pos, end, kind, hasTrailingNewLine, _state, comments) {
if (!comments) {
comments = [];
}
comments.push({ kind: kind, pos: pos, end: end, hasTrailingNewLine: hasTrailingNewLine });
return comments;
}
function getLeadingCommentRanges(text, pos) {
return reduceEachLeadingCommentRange(text, pos, appendCommentRange, /*state*/ undefined, /*initial*/ undefined);
}
ts.getLeadingCommentRanges = getLeadingCommentRanges;
function getTrailingCommentRanges(text, pos) {
return reduceEachTrailingCommentRange(text, pos, appendCommentRange, /*state*/ undefined, /*initial*/ undefined);
}
ts.getTrailingCommentRanges = getTrailingCommentRanges;
/** Optionally, get the shebang */
function getShebang(text) {
var match = shebangTriviaRegex.exec(text);
if (match) {
return match[0];
}
}
ts.getShebang = getShebang;
function isIdentifierStart(ch, languageVersion) {
return ch >= 65 /* A */ && ch <= 90 /* Z */ || ch >= 97 /* a */ && ch <= 122 /* z */ ||
ch === 36 /* $ */ || ch === 95 /* _ */ ||
ch > 127 /* maxAsciiCharacter */ && isUnicodeIdentifierStart(ch, languageVersion);
}
ts.isIdentifierStart = isIdentifierStart;
function isIdentifierPart(ch, languageVersion, identifierVariant) {
return ch >= 65 /* A */ && ch <= 90 /* Z */ || ch >= 97 /* a */ && ch <= 122 /* z */ ||
ch >= 48 /* _0 */ && ch <= 57 /* _9 */ || ch === 36 /* $ */ || ch === 95 /* _ */ ||
// "-" and ":" are valid in JSX Identifiers
(identifierVariant === 1 /* JSX */ ? (ch === 45 /* minus */ || ch === 58 /* colon */) : false) ||
ch > 127 /* maxAsciiCharacter */ && isUnicodeIdentifierPart(ch, languageVersion);
}
ts.isIdentifierPart = isIdentifierPart;
/* @internal */
function isIdentifierText(name, languageVersion, identifierVariant) {
var ch = codePointAt(name, 0);
if (!isIdentifierStart(ch, languageVersion)) {
return false;
}
for (var i = charSize(ch); i < name.length; i += charSize(ch)) {
if (!isIdentifierPart(ch = codePointAt(name, i), languageVersion, identifierVariant)) {
return false;
}
}
return true;
}
ts.isIdentifierText = isIdentifierText;
// Creates a scanner over a (possibly unspecified) range of a piece of text.
function createScanner(languageVersion, skipTrivia, languageVariant, textInitial, onError, start, length) {
if (languageVariant === void 0) { languageVariant = 0 /* Standard */; }
var text = textInitial;
// Current position (end position of text of current token)
var pos;
// end of text
var end;
// Start position of whitespace before current token
var startPos;
// Start position of text of current token
var tokenPos;
var token;
var tokenValue;
var tokenFlags;
var commentDirectives;
var inJSDocType = 0;
setText(text, start, length);
var scanner = {
getStartPos: function () { return startPos; },
getTextPos: function () { return pos; },
getToken: function () { return token; },
getTokenPos: function () { return tokenPos; },
getTokenText: function () { return text.substring(tokenPos, pos); },
getTokenValue: function () { return tokenValue; },
hasUnicodeEscape: function () { return (tokenFlags & 1024 /* UnicodeEscape */) !== 0; },
hasExtendedUnicodeEscape: function () { return (tokenFlags & 8 /* ExtendedUnicodeEscape */) !== 0; },
hasPrecedingLineBreak: function () { return (tokenFlags & 1 /* PrecedingLineBreak */) !== 0; },
hasPrecedingJSDocComment: function () { return (tokenFlags & 2 /* PrecedingJSDocComment */) !== 0; },
isIdentifier: function () { return token === 79 /* Identifier */ || token > 116 /* LastReservedWord */; },
isReservedWord: function () { return token >= 81 /* FirstReservedWord */ && token <= 116 /* LastReservedWord */; },
isUnterminated: function () { return (tokenFlags & 4 /* Unterminated */) !== 0; },
getCommentDirectives: function () { return commentDirectives; },
getNumericLiteralFlags: function () { return tokenFlags & 1008 /* NumericLiteralFlags */; },
getTokenFlags: function () { return tokenFlags; },
reScanGreaterToken: reScanGreaterToken,
reScanAsteriskEqualsToken: reScanAsteriskEqualsToken,
reScanSlashToken: reScanSlashToken,
reScanTemplateToken: reScanTemplateToken,
reScanTemplateHeadOrNoSubstitutionTemplate: reScanTemplateHeadOrNoSubstitutionTemplate,
scanJsxIdentifier: scanJsxIdentifier,
scanJsxAttributeValue: scanJsxAttributeValue,
reScanJsxAttributeValue: reScanJsxAttributeValue,
reScanJsxToken: reScanJsxToken,
reScanLessThanToken: reScanLessThanToken,
reScanHashToken: reScanHashToken,
reScanQuestionToken: reScanQuestionToken,
reScanInvalidIdentifier: reScanInvalidIdentifier,
scanJsxToken: scanJsxToken,
scanJsDocToken: scanJsDocToken,
scan: scan,
getText: getText,
clearCommentDirectives: clearCommentDirectives,
setText: setText,
setScriptTarget: setScriptTarget,
setLanguageVariant: setLanguageVariant,
setOnError: setOnError,
setTextPos: setTextPos,
setInJSDocType: setInJSDocType,
tryScan: tryScan,
lookAhead: lookAhead,
scanRange: scanRange,
};
if (ts.Debug.isDebugging) {
Object.defineProperty(scanner, "__debugShowCurrentPositionInText", {
get: function () {
var text = scanner.getText();
return text.slice(0, scanner.getStartPos()) + "║" + text.slice(scanner.getStartPos());
},
});
}
return scanner;
function error(message, errPos, length) {
if (errPos === void 0) { errPos = pos; }
if (onError) {
var oldPos = pos;
pos = errPos;
onError(message, length || 0);
pos = oldPos;
}
}
function scanNumberFragment() {
var start = pos;
var allowSeparator = false;
var isPreviousTokenSeparator = false;
var result = "";
while (true) {
var ch = text.charCodeAt(pos);
if (ch === 95 /* _ */) {
tokenFlags |= 512 /* ContainsSeparator */;
if (allowSeparator) {
allowSeparator = false;
isPreviousTokenSeparator = true;
result += text.substring(start, pos);
}
else if (isPreviousTokenSeparator) {
error(ts.Diagnostics.Multiple_consecutive_numeric_separators_are_not_permitted, pos, 1);
}
else {
error(ts.Diagnostics.Numeric_separators_are_not_allowed_here, pos, 1);
}
pos++;
start = pos;
continue;
}
if (isDigit(ch)) {
allowSeparator = true;
isPreviousTokenSeparator = false;
pos++;
continue;
}
break;
}
if (text.charCodeAt(pos - 1) === 95 /* _ */) {
error(ts.Diagnostics.Numeric_separators_are_not_allowed_here, pos - 1, 1);
}
return result + text.substring(start, pos);
}
function scanNumber() {
var start = pos;
var mainFragment = scanNumberFragment();
var decimalFragment;
var scientificFragment;
if (text.charCodeAt(pos) === 46 /* dot */) {
pos++;
decimalFragment = scanNumberFragment();
}
var end = pos;
if (text.charCodeAt(pos) === 69 /* E */ || text.charCodeAt(pos) === 101 /* e */) {
pos++;
tokenFlags |= 16 /* Scientific */;
if (text.charCodeAt(pos) === 43 /* plus */ || text.charCodeAt(pos) === 45 /* minus */)
pos++;
var preNumericPart = pos;
var finalFragment = scanNumberFragment();
if (!finalFragment) {
error(ts.Diagnostics.Digit_expected);
}
else {
scientificFragment = text.substring(end, preNumericPart) + finalFragment;
end = pos;
}
}
var result;
if (tokenFlags & 512 /* ContainsSeparator */) {
result = mainFragment;
if (decimalFragment) {
result += "." + decimalFragment;
}
if (scientificFragment) {
result += scientificFragment;
}
}
else {
result = text.substring(start, end); // No need to use all the fragments; no _ removal needed
}
if (decimalFragment !== undefined || tokenFlags & 16 /* Scientific */) {
checkForIdentifierStartAfterNumericLiteral(start, decimalFragment === undefined && !!(tokenFlags & 16 /* Scientific */));
return {
type: 8 /* NumericLiteral */,
value: "" + +result // if value is not an integer, it can be safely coerced to a number
};
}
else {
tokenValue = result;
var type = checkBigIntSuffix(); // if value is an integer, check whether it is a bigint
checkForIdentifierStartAfterNumericLiteral(start);
return { type: type, value: tokenValue };
}
}
function checkForIdentifierStartAfterNumericLiteral(numericStart, isScientific) {
if (!isIdentifierStart(codePointAt(text, pos), languageVersion)) {
return;
}
var identifierStart = pos;
var length = scanIdentifierParts().length;
if (length === 1 && text[identifierStart] === "n") {
if (isScientific) {
error(ts.Diagnostics.A_bigint_literal_cannot_use_exponential_notation, numericStart, identifierStart - numericStart + 1);
}
else {
error(ts.Diagnostics.A_bigint_literal_must_be_an_integer, numericStart, identifierStart - numericStart + 1);
}
}
else {
error(ts.Diagnostics.An_identifier_or_keyword_cannot_immediately_follow_a_numeric_literal, identifierStart, length);
pos = identifierStart;
}
}
function scanOctalDigits() {
var start = pos;
while (isOctalDigit(text.charCodeAt(pos))) {
pos++;
}
return +(text.substring(start, pos));
}
/**
* Scans the given number of hexadecimal digits in the text,
* returning -1 if the given number is unavailable.
*/
function scanExactNumberOfHexDigits(count, canHaveSeparators) {
var valueString = scanHexDigits(/*minCount*/ count, /*scanAsManyAsPossible*/ false, canHaveSeparators);
return valueString ? parseInt(valueString, 16) : -1;
}
/**
* Scans as many hexadecimal digits as are available in the text,
* returning "" if the given number of digits was unavailable.
*/
function scanMinimumNumberOfHexDigits(count, canHaveSeparators) {
return scanHexDigits(/*minCount*/ count, /*scanAsManyAsPossible*/ true, canHaveSeparators);
}
function scanHexDigits(minCount, scanAsManyAsPossible, canHaveSeparators) {
var valueChars = [];
var allowSeparator = false;
var isPreviousTokenSeparator = false;
while (valueChars.length < minCount || scanAsManyAsPossible) {
var ch = text.charCodeAt(pos);
if (canHaveSeparators && ch === 95 /* _ */) {
tokenFlags |= 512 /* ContainsSeparator */;
if (allowSeparator) {
allowSeparator = false;
isPreviousTokenSeparator = true;
}
else if (isPreviousTokenSeparator) {
error(ts.Diagnostics.Multiple_consecutive_numeric_separators_are_not_permitted, pos, 1);
}
else {
error(ts.Diagnostics.Numeric_separators_are_not_allowed_here, pos, 1);
}
pos++;
continue;
}
allowSeparator = canHaveSeparators;
if (ch >= 65 /* A */ && ch <= 70 /* F */) {
ch += 97 /* a */ - 65 /* A */; // standardize hex literals to lowercase
}
else if (!((ch >= 48 /* _0 */ && ch <= 57 /* _9 */) ||
(ch >= 97 /* a */ && ch <= 102 /* f */))) {
break;
}
valueChars.push(ch);
pos++;
isPreviousTokenSeparator = false;
}
if (valueChars.length < minCount) {
valueChars = [];
}
if (text.charCodeAt(pos - 1) === 95 /* _ */) {
error(ts.Diagnostics.Numeric_separators_are_not_allowed_here, pos - 1, 1);
}
return String.fromCharCode.apply(String, valueChars);
}
function scanString(jsxAttributeString) {
if (jsxAttributeString === void 0) { jsxAttributeString = false; }
var quote = text.charCodeAt(pos);
pos++;
var result = "";
var start = pos;
while (true) {
if (pos >= end) {
result += text.substring(start, pos);
tokenFlags |= 4 /* Unterminated */;
error(ts.Diagnostics.Unterminated_string_literal);
break;
}
var ch = text.charCodeAt(pos);
if (ch === quote) {
result += text.substring(start, pos);
pos++;
break;
}
if (ch === 92 /* backslash */ && !jsxAttributeString) {
result += text.substring(start, pos);
result += scanEscapeSequence();
start = pos;
continue;
}
if (isLineBreak(ch) && !jsxAttributeString) {
result += text.substring(start, pos);
tokenFlags |= 4 /* Unterminated */;
error(ts.Diagnostics.Unterminated_string_literal);
break;
}
pos++;
}
return result;
}
/**
* Sets the current 'tokenValue' and returns a NoSubstitutionTemplateLiteral or
* a literal component of a TemplateExpression.
*/
function scanTemplateAndSetTokenValue(isTaggedTemplate) {
var startedWithBacktick = text.charCodeAt(pos) === 96 /* backtick */;
pos++;
var start = pos;
var contents = "";
var resultingToken;
while (true) {
if (pos >= end) {
contents += text.substring(start, pos);
tokenFlags |= 4 /* Unterminated */;
error(ts.Diagnostics.Unterminated_template_literal);
resultingToken = startedWithBacktick ? 14 /* NoSubstitutionTemplateLiteral */ : 17 /* TemplateTail */;
break;
}
var currChar = text.charCodeAt(pos);
// '`'
if (currChar === 96 /* backtick */) {
contents += text.substring(start, pos);
pos++;
resultingToken = startedWithBacktick ? 14 /* NoSubstitutionTemplateLiteral */ : 17 /* TemplateTail */;
break;
}
// '${'
if (currChar === 36 /* $ */ && pos + 1 < end && text.charCodeAt(pos + 1) === 123 /* openBrace */) {
contents += text.substring(start, pos);
pos += 2;
resultingToken = startedWithBacktick ? 15 /* TemplateHead */ : 16 /* TemplateMiddle */;
break;
}
// Escape character
if (currChar === 92 /* backslash */) {
contents += text.substring(start, pos);
contents += scanEscapeSequence(isTaggedTemplate);
start = pos;
continue;
}
// Speculated ECMAScript 6 Spec 11.8.6.1:
// <CR><LF> and <CR> LineTerminatorSequences are normalized to <LF> for Template Values
if (currChar === 13 /* carriageReturn */) {
contents += text.substring(start, pos);
pos++;
if (pos < end && text.charCodeAt(pos) === 10 /* lineFeed */) {
pos++;
}
contents += "\n";
start = pos;
continue;
}
pos++;
}
ts.Debug.assert(resultingToken !== undefined);
tokenValue = contents;
return resultingToken;
}
function scanEscapeSequence(isTaggedTemplate) {
var start = pos;
pos++;
if (pos >= end) {
error(ts.Diagnostics.Unexpected_end_of_text);
return "";
}
var ch = text.charCodeAt(pos);
pos++;
switch (ch) {
case 48 /* _0 */:
// '\01'
if (isTaggedTemplate && pos < end && isDigit(text.charCodeAt(pos))) {
pos++;
tokenFlags |= 2048 /* ContainsInvalidEscape */;
return text.substring(start, pos);
}
return "\0";
case 98 /* b */:
return "\b";
case 116 /* t */:
return "\t";
case 110 /* n */:
return "\n";
case 118 /* v */:
return "\v";
case 102 /* f */:
return "\f";
case 114 /* r */:
return "\r";
case 39 /* singleQuote */:
return "\'";
case 34 /* doubleQuote */:
return "\"";
case 117 /* u */:
if (isTaggedTemplate) {
// '\u' or '\u0' or '\u00' or '\u000'
for (var escapePos = pos; escapePos < pos + 4; escapePos++) {
if (escapePos < end && !isHexDigit(text.charCodeAt(escapePos)) && text.charCodeAt(escapePos) !== 123 /* openBrace */) {
pos = escapePos;
tokenFlags |= 2048 /* ContainsInvalidEscape */;
return text.substring(start, pos);
}
}
}
// '\u{DDDDDDDD}'
if (pos < end && text.charCodeAt(pos) === 123 /* openBrace */) {
pos++;
// '\u{'
if (isTaggedTemplate && !isHexDigit(text.charCodeAt(pos))) {
tokenFlags |= 2048 /* ContainsInvalidEscape */;
return text.substring(start, pos);
}
if (isTaggedTemplate) {
var savePos = pos;
var escapedValueString = scanMinimumNumberOfHexDigits(1, /*canHaveSeparators*/ false);
var escapedValue = escapedValueString ? parseInt(escapedValueString, 16) : -1;
// '\u{Not Code Point' or '\u{CodePoint'
if (!isCodePoint(escapedValue) || text.charCodeAt(pos) !== 125 /* closeBrace */) {
tokenFlags |= 2048 /* ContainsInvalidEscape */;
return text.substring(start, pos);
}
else {
pos = savePos;
}
}
tokenFlags |= 8 /* ExtendedUnicodeEscape */;
return scanExtendedUnicodeEscape();
}
tokenFlags |= 1024 /* UnicodeEscape */;
// '\uDDDD'
return scanHexadecimalEscape(/*numDigits*/ 4);
case 120 /* x */:
if (isTaggedTemplate) {
if (!isHexDigit(text.charCodeAt(pos))) {
tokenFlags |= 2048 /* ContainsInvalidEscape */;
return text.substring(start, pos);
}
else if (!isHexDigit(text.charCodeAt(pos + 1))) {
pos++;
tokenFlags |= 2048 /* ContainsInvalidEscape */;
return text.substring(start, pos);
}
}
// '\xDD'
return scanHexadecimalEscape(/*numDigits*/ 2);
// when encountering a LineContinuation (i.e. a backslash and a line terminator sequence),
// the line terminator is interpreted to be "the empty code unit sequence".
case 13 /* carriageReturn */:
if (pos < end && text.charCodeAt(pos) === 10 /* lineFeed */) {
pos++;
}
// falls through
case 10 /* lineFeed */:
case 8232 /* lineSeparator */:
case 8233 /* paragraphSeparator */:
return "";
default:
return String.fromCharCode(ch);
}
}
function scanHexadecimalEscape(numDigits) {
var escapedValue = scanExactNumberOfHexDigits(numDigits, /*canHaveSeparators*/ false);
if (escapedValue >= 0) {
return String.fromCharCode(escapedValue);
}
else {
error(ts.Diagnostics.Hexadecimal_digit_expected);
return "";
}
}
function scanExtendedUnicodeEscape() {
var escapedValueString = scanMinimumNumberOfHexDigits(1, /*canHaveSeparators*/ false);
var escapedValue = escapedValueString ? parseInt(escapedValueString, 16) : -1;
var isInvalidExtendedEscape = false;
// Validate the value of the digit
if (escapedValue < 0) {
error(ts.Diagnostics.Hexadecimal_digit_expected);
isInvalidExtendedEscape = true;
}
else if (escapedValue > 0x10FFFF) {
error(ts.Diagnostics.An_extended_Unicode_escape_value_must_be_between_0x0_and_0x10FFFF_inclusive);
isInvalidExtendedEscape = true;
}
if (pos >= end) {
error(ts.Diagnostics.Unexpected_end_of_text);
isInvalidExtendedEscape = true;
}
else if (text.charCodeAt(pos) === 125 /* closeBrace */) {
// Only swallow the following character up if it's a '}'.
pos++;
}
else {
error(ts.Diagnostics.Unterminated_Unicode_escape_sequence);
isInvalidExtendedEscape = true;
}
if (isInvalidExtendedEscape) {
return "";
}
return utf16EncodeAsString(escapedValue);
}
// Current character is known to be a backslash. Check for Unicode escape of the form '\uXXXX'
// and return code point value if valid Unicode escape is found. Otherwise return -1.
function peekUnicodeEscape() {
if (pos + 5 < end && text.charCodeAt(pos + 1) === 117 /* u */) {
var start_1 = pos;
pos += 2;
var value = scanExactNumberOfHexDigits(4, /*canHaveSeparators*/ false);
pos = start_1;
return value;
}
return -1;
}
function peekExtendedUnicodeEscape() {
if (languageVersion >= 2 /* ES2015 */ && codePointAt(text, pos + 1) === 117 /* u */ && codePointAt(text, pos + 2) === 123 /* openBrace */) {
var start_2 = pos;
pos += 3;
var escapedValueString = scanMinimumNumberOfHexDigits(1, /*canHaveSeparators*/ false);
var escapedValue = escapedValueString ? parseInt(escapedValueString, 16) : -1;
pos = start_2;
return escapedValue;
}
return -1;
}
function scanIdentifierParts() {
var result = "";
var start = pos;
while (pos < end) {
var ch = codePointAt(text, pos);
if (isIdentifierPart(ch, languageVersion)) {
pos += charSize(ch);
}
else if (ch === 92 /* backslash */) {
ch = peekExtendedUnicodeEscape();
if (ch >= 0 && isIdentifierPart(ch, languageVersion)) {
pos += 3;
tokenFlags |= 8 /* ExtendedUnicodeEscape */;
result += scanExtendedUnicodeEscape();
start = pos;
continue;
}
ch = peekUnicodeEscape();
if (!(ch >= 0 && isIdentifierPart(ch, languageVersion))) {
break;
}
tokenFlags |= 1024 /* UnicodeEscape */;
result += text.substring(start, pos);
result += utf16EncodeAsString(ch);
// Valid Unicode escape is always six characters
pos += 6;
start = pos;
}
else {
break;
}
}
result += text.substring(start, pos);
return result;
}
function getIdentifierToken() {
// Reserved words are between 2 and 12 characters long and start with a lowercase letter
var len = tokenValue.length;
if (len >= 2 && len <= 12) {
var ch = tokenValue.charCodeAt(0);
if (ch >= 97 /* a */ && ch <= 122 /* z */) {
var keyword = textToKeyword.get(tokenValue);
if (keyword !== undefined) {
return token = keyword;
}
}
}
return token = 79 /* Identifier */;
}
function scanBinaryOrOctalDigits(base) {
var value = "";
// For counting number of digits; Valid binaryIntegerLiteral must have at least one binary digit following B or b.
// Similarly valid octalIntegerLiteral must have at least one octal digit following o or O.
var separatorAllowed = false;
var isPreviousTokenSeparator = false;
while (true) {
var ch = text.charCodeAt(pos);
// Numeric separators are allowed anywhere within a numeric literal, except not at the beginning, or following another separator
if (ch === 95 /* _ */) {
tokenFlags |= 512 /* ContainsSeparator */;
if (separatorAllowed) {
separatorAllowed = false;
isPreviousTokenSeparator = true;
}
else if (isPreviousTokenSeparator) {
error(ts.Diagnostics.Multiple_consecutive_numeric_separators_are_not_permitted, pos, 1);
}
else {
error(ts.Diagnostics.Numeric_separators_are_not_allowed_here, pos, 1);
}
pos++;
continue;
}
separatorAllowed = true;
if (!isDigit(ch) || ch - 48 /* _0 */ >= base) {
break;
}
value += text[pos];
pos++;
isPreviousTokenSeparator = false;
}
if (text.charCodeAt(pos - 1) === 95 /* _ */) {
// Literal ends with underscore - not allowed
error(ts.Diagnostics.Numeric_separators_are_not_allowed_here, pos - 1, 1);
}
return value;
}
function checkBigIntSuffix() {
if (text.charCodeAt(pos) === 110 /* n */) {
tokenValue += "n";
// Use base 10 instead of base 2 or base 8 for shorter literals
if (tokenFlags & 384 /* BinaryOrOctalSpecifier */) {
tokenValue = ts.parsePseudoBigInt(tokenValue) + "n";
}
pos++;
return 9 /* BigIntLiteral */;
}
else { // not a bigint, so can convert to number in simplified form
// Number() may not support 0b or 0o, so use parseInt() instead
var numericValue = tokenFlags & 128 /* BinarySpecifier */
? parseInt(tokenValue.slice(2), 2) // skip "0b"
: tokenFlags & 256 /* OctalSpecifier */
? parseInt(tokenValue.slice(2), 8) // skip "0o"
: +tokenValue;
tokenValue = "" + numericValue;
return 8 /* NumericLiteral */;
}
}
function scan() {
var _a;
startPos = pos;
tokenFlags = 0 /* None */;
var asteriskSeen = false;
while (true) {
tokenPos = pos;
if (pos >= end) {
return token = 1 /* EndOfFileToken */;
}
var ch = codePointAt(text, pos);
// Special handling for shebang
if (ch === 35 /* hash */ && pos === 0 && isShebangTrivia(text, pos)) {
pos = scanShebangTrivia(text, pos);
if (skipTrivia) {
continue;
}
else {
return token = 6 /* ShebangTrivia */;
}
}
switch (ch) {
case 10 /* lineFeed */:
case 13 /* carriageReturn */:
tokenFlags |= 1 /* PrecedingLineBreak */;
if (skipTrivia) {
pos++;
continue;
}
else {
if (ch === 13 /* carriageReturn */ && pos + 1 < end && text.charCodeAt(pos + 1) === 10 /* lineFeed */) {
// consume both CR and LF
pos += 2;
}
else {
pos++;
}
return token = 4 /* NewLineTrivia */;
}
case 9 /* tab */:
case 11 /* verticalTab */:
case 12 /* formFeed */:
case 32 /* space */:
case 160 /* nonBreakingSpace */:
case 5760 /* ogham */:
case 8192 /* enQuad */:
case 8193 /* emQuad */:
case 8194 /* enSpace */:
case 8195 /* emSpace */:
case 8196 /* threePerEmSpace */:
case 8197 /* fourPerEmSpace */:
case 8198 /* sixPerEmSpace */:
case 8199 /* figureSpace */:
case 8200 /* punctuationSpace */:
case 8201 /* thinSpace */:
case 8202 /* hairSpace */:
case 8203 /* zeroWidthSpace */:
case 8239 /* narrowNoBreakSpace */:
case 8287 /* mathematicalSpace */:
case 12288 /* ideographicSpace */:
case 65279 /* byteOrderMark */:
if (skipTrivia) {
pos++;
continue;
}
else {
while (pos < end && isWhiteSpaceSingleLine(text.charCodeAt(pos))) {
pos++;
}
return token = 5 /* WhitespaceTrivia */;
}
case 33 /* exclamation */:
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
if (text.charCodeAt(pos + 2) === 61 /* equals */) {
return pos += 3, token = 37 /* ExclamationEqualsEqualsToken */;
}
return pos += 2, token = 35 /* ExclamationEqualsToken */;
}
pos++;
return token = 53 /* ExclamationToken */;
case 34 /* doubleQuote */:
case 39 /* singleQuote */:
tokenValue = scanString();
return token = 10 /* StringLiteral */;
case 96 /* backtick */:
return token = scanTemplateAndSetTokenValue(/* isTaggedTemplate */ false);
case 37 /* percent */:
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
return pos += 2, token = 69 /* PercentEqualsToken */;
}
pos++;
return token = 44 /* PercentToken */;
case 38 /* ampersand */:
if (text.charCodeAt(pos + 1) === 38 /* ampersand */) {
if (text.charCodeAt(pos + 2) === 61 /* equals */) {
return pos += 3, token = 76 /* AmpersandAmpersandEqualsToken */;
}
return pos += 2, token = 55 /* AmpersandAmpersandToken */;
}
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
return pos += 2, token = 73 /* AmpersandEqualsToken */;
}
pos++;
return token = 50 /* AmpersandToken */;
case 40 /* openParen */:
pos++;
return token = 20 /* OpenParenToken */;
case 41 /* closeParen */:
pos++;
return token = 21 /* CloseParenToken */;
case 42 /* asterisk */:
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
return pos += 2, token = 66 /* AsteriskEqualsToken */;
}
if (text.charCodeAt(pos + 1) === 42 /* asterisk */) {
if (text.charCodeAt(pos + 2) === 61 /* equals */) {
return pos += 3, token = 67 /* AsteriskAsteriskEqualsToken */;
}
return pos += 2, token = 42 /* AsteriskAsteriskToken */;
}
pos++;
if (inJSDocType && !asteriskSeen && (tokenFlags & 1 /* PrecedingLineBreak */)) {
// decoration at the start of a JSDoc comment line
asteriskSeen = true;
continue;
}
return token = 41 /* AsteriskToken */;
case 43 /* plus */:
if (text.charCodeAt(pos + 1) === 43 /* plus */) {
return pos += 2, token = 45 /* PlusPlusToken */;
}
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
return pos += 2, token = 64 /* PlusEqualsToken */;
}
pos++;
return token = 39 /* PlusToken */;
case 44 /* comma */:
pos++;
return token = 27 /* CommaToken */;
case 45 /* minus */:
if (text.charCodeAt(pos + 1) === 45 /* minus */) {
return pos += 2, token = 46 /* MinusMinusToken */;
}
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
return pos += 2, token = 65 /* MinusEqualsToken */;
}
pos++;
return token = 40 /* MinusToken */;
case 46 /* dot */:
if (isDigit(text.charCodeAt(pos + 1))) {
tokenValue = scanNumber().value;
return token = 8 /* NumericLiteral */;
}
if (text.charCodeAt(pos + 1) === 46 /* dot */ && text.charCodeAt(pos + 2) === 46 /* dot */) {
return pos += 3, token = 25 /* DotDotDotToken */;
}
pos++;
return token = 24 /* DotToken */;
case 47 /* slash */:
// Single-line comment
if (text.charCodeAt(pos + 1) === 47 /* slash */) {
pos += 2;
while (pos < end) {
if (isLineBreak(text.charCodeAt(pos))) {
break;
}
pos++;
}
commentDirectives = appendIfCommentDirective(commentDirectives, text.slice(tokenPos, pos), commentDirectiveRegExSingleLine, tokenPos);
if (skipTrivia) {
continue;
}
else {
return token = 2 /* SingleLineCommentTrivia */;
}
}
// Multi-line comment
if (text.charCodeAt(pos + 1) === 42 /* asterisk */) {
pos += 2;
if (text.charCodeAt(pos) === 42 /* asterisk */ && text.charCodeAt(pos + 1) !== 47 /* slash */) {
tokenFlags |= 2 /* PrecedingJSDocComment */;
}
var commentClosed = false;
var lastLineStart = tokenPos;
while (pos < end) {
var ch_1 = text.charCodeAt(pos);
if (ch_1 === 42 /* asterisk */ && text.charCodeAt(pos + 1) === 47 /* slash */) {
pos += 2;
commentClosed = true;
break;
}
pos++;
if (isLineBreak(ch_1)) {
lastLineStart = pos;
tokenFlags |= 1 /* PrecedingLineBreak */;
}
}
commentDirectives = appendIfCommentDirective(commentDirectives, text.slice(lastLineStart, pos), commentDirectiveRegExMultiLine, lastLineStart);
if (!commentClosed) {
error(ts.Diagnostics.Asterisk_Slash_expected);
}
if (skipTrivia) {
continue;
}
else {
if (!commentClosed) {
tokenFlags |= 4 /* Unterminated */;
}
return token = 3 /* MultiLineCommentTrivia */;
}
}
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
return pos += 2, token = 68 /* SlashEqualsToken */;
}
pos++;
return token = 43 /* SlashToken */;
case 48 /* _0 */:
if (pos + 2 < end && (text.charCodeAt(pos + 1) === 88 /* X */ || text.charCodeAt(pos + 1) === 120 /* x */)) {
pos += 2;
tokenValue = scanMinimumNumberOfHexDigits(1, /*canHaveSeparators*/ true);
if (!tokenValue) {
error(ts.Diagnostics.Hexadecimal_digit_expected);
tokenValue = "0";
}
tokenValue = "0x" + tokenValue;
tokenFlags |= 64 /* HexSpecifier */;
return token = checkBigIntSuffix();
}
else if (pos + 2 < end && (text.charCodeAt(pos + 1) === 66 /* B */ || text.charCodeAt(pos + 1) === 98 /* b */)) {
pos += 2;
tokenValue = scanBinaryOrOctalDigits(/* base */ 2);
if (!tokenValue) {
error(ts.Diagnostics.Binary_digit_expected);
tokenValue = "0";
}
tokenValue = "0b" + tokenValue;
tokenFlags |= 128 /* BinarySpecifier */;
return token = checkBigIntSuffix();
}
else if (pos + 2 < end && (text.charCodeAt(pos + 1) === 79 /* O */ || text.charCodeAt(pos + 1) === 111 /* o */)) {
pos += 2;
tokenValue = scanBinaryOrOctalDigits(/* base */ 8);
if (!tokenValue) {
error(ts.Diagnostics.Octal_digit_expected);
tokenValue = "0";
}
tokenValue = "0o" + tokenValue;
tokenFlags |= 256 /* OctalSpecifier */;
return token = checkBigIntSuffix();
}
// Try to parse as an octal
if (pos + 1 < end && isOctalDigit(text.charCodeAt(pos + 1))) {
tokenValue = "" + scanOctalDigits();
tokenFlags |= 32 /* Octal */;
return token = 8 /* NumericLiteral */;
}
// This fall-through is a deviation from the EcmaScript grammar. The grammar says that a leading zero
// can only be followed by an octal digit, a dot, or the end of the number literal. However, we are being
// permissive and allowing decimal digits of the form 08* and 09* (which many browsers also do).
// falls through
case 49 /* _1 */:
case 50 /* _2 */:
case 51 /* _3 */:
case 52 /* _4 */:
case 53 /* _5 */:
case 54 /* _6 */:
case 55 /* _7 */:
case 56 /* _8 */:
case 57 /* _9 */:
(_a = scanNumber(), token = _a.type, tokenValue = _a.value);
return token;
case 58 /* colon */:
pos++;
return token = 58 /* ColonToken */;
case 59 /* semicolon */:
pos++;
return token = 26 /* SemicolonToken */;
case 60 /* lessThan */:
if (isConflictMarkerTrivia(text, pos)) {
pos = scanConflictMarkerTrivia(text, pos, error);
if (skipTrivia) {
continue;
}
else {
return token = 7 /* ConflictMarkerTrivia */;
}
}
if (text.charCodeAt(pos + 1) === 60 /* lessThan */) {
if (text.charCodeAt(pos + 2) === 61 /* equals */) {
return pos += 3, token = 70 /* LessThanLessThanEqualsToken */;
}
return pos += 2, token = 47 /* LessThanLessThanToken */;
}
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
return pos += 2, token = 32 /* LessThanEqualsToken */;
}
if (languageVariant === 1 /* JSX */ &&
text.charCodeAt(pos + 1) === 47 /* slash */ &&
text.charCodeAt(pos + 2) !== 42 /* asterisk */) {
return pos += 2, token = 30 /* LessThanSlashToken */;
}
pos++;
return token = 29 /* LessThanToken */;
case 61 /* equals */:
if (isConflictMarkerTrivia(text, pos)) {
pos = scanConflictMarkerTrivia(text, pos, error);
if (skipTrivia) {
continue;
}
else {
return token = 7 /* ConflictMarkerTrivia */;
}
}
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
if (text.charCodeAt(pos + 2) === 61 /* equals */) {
return pos += 3, token = 36 /* EqualsEqualsEqualsToken */;
}
return pos += 2, token = 34 /* EqualsEqualsToken */;
}
if (text.charCodeAt(pos + 1) === 62 /* greaterThan */) {
return pos += 2, token = 38 /* EqualsGreaterThanToken */;
}
pos++;
return token = 63 /* EqualsToken */;
case 62 /* greaterThan */:
if (isConflictMarkerTrivia(text, pos)) {
pos = scanConflictMarkerTrivia(text, pos, error);
if (skipTrivia) {
continue;
}
else {
return token = 7 /* ConflictMarkerTrivia */;
}
}
pos++;
return token = 31 /* GreaterThanToken */;
case 63 /* question */:
if (text.charCodeAt(pos + 1) === 46 /* dot */ && !isDigit(text.charCodeAt(pos + 2))) {
return pos += 2, token = 28 /* QuestionDotToken */;
}
if (text.charCodeAt(pos + 1) === 63 /* question */) {
if (text.charCodeAt(pos + 2) === 61 /* equals */) {
return pos += 3, token = 77 /* QuestionQuestionEqualsToken */;
}
return pos += 2, token = 60 /* QuestionQuestionToken */;
}
pos++;
return token = 57 /* QuestionToken */;
case 91 /* openBracket */:
pos++;
return token = 22 /* OpenBracketToken */;
case 93 /* closeBracket */:
pos++;
return token = 23 /* CloseBracketToken */;
case 94 /* caret */:
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
return pos += 2, token = 78 /* CaretEqualsToken */;
}
pos++;
return token = 52 /* CaretToken */;
case 123 /* openBrace */:
pos++;
return token = 18 /* OpenBraceToken */;
case 124 /* bar */:
if (isConflictMarkerTrivia(text, pos)) {
pos = scanConflictMarkerTrivia(text, pos, error);
if (skipTrivia) {
continue;
}
else {
return token = 7 /* ConflictMarkerTrivia */;
}
}
if (text.charCodeAt(pos + 1) === 124 /* bar */) {
if (text.charCodeAt(pos + 2) === 61 /* equals */) {
return pos += 3, token = 75 /* BarBarEqualsToken */;
}
return pos += 2, token = 56 /* BarBarToken */;
}
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
return pos += 2, token = 74 /* BarEqualsToken */;
}
pos++;
return token = 51 /* BarToken */;
case 125 /* closeBrace */:
pos++;
return token = 19 /* CloseBraceToken */;
case 126 /* tilde */:
pos++;
return token = 54 /* TildeToken */;
case 64 /* at */:
pos++;
return token = 59 /* AtToken */;
case 92 /* backslash */:
var extendedCookedChar = peekExtendedUnicodeEscape();
if (extendedCookedChar >= 0 && isIdentifierStart(extendedCookedChar, languageVersion)) {
pos += 3;
tokenFlags |= 8 /* ExtendedUnicodeEscape */;
tokenValue = scanExtendedUnicodeEscape() + scanIdentifierParts();
return token = getIdentifierToken();
}
var cookedChar = peekUnicodeEscape();
if (cookedChar >= 0 && isIdentifierStart(cookedChar, languageVersion)) {
pos += 6;
tokenFlags |= 1024 /* UnicodeEscape */;
tokenValue = String.fromCharCode(cookedChar) + scanIdentifierParts();
return token = getIdentifierToken();
}
error(ts.Diagnostics.Invalid_character);
pos++;
return token = 0 /* Unknown */;
case 35 /* hash */:
if (pos !== 0 && text[pos + 1] === "!") {
error(ts.Diagnostics.can_only_be_used_at_the_start_of_a_file);
pos++;
return token = 0 /* Unknown */;
}
if (isIdentifierStart(codePointAt(text, pos + 1), languageVersion)) {
pos++;
scanIdentifier(codePointAt(text, pos), languageVersion);
}
else {
tokenValue = String.fromCharCode(codePointAt(text, pos));
error(ts.Diagnostics.Invalid_character, pos++, charSize(ch));
}
return token = 80 /* PrivateIdentifier */;
default:
var identifierKind = scanIdentifier(ch, languageVersion);
if (identifierKind) {
return token = identifierKind;
}
else if (isWhiteSpaceSingleLine(ch)) {
pos += charSize(ch);
continue;
}
else if (isLineBreak(ch)) {
tokenFlags |= 1 /* PrecedingLineBreak */;
pos += charSize(ch);
continue;
}
var size = charSize(ch);
error(ts.Diagnostics.Invalid_character, pos, size);
pos += size;
return token = 0 /* Unknown */;
}
}
}
function reScanInvalidIdentifier() {
ts.Debug.assert(token === 0 /* Unknown */, "'reScanInvalidIdentifier' should only be called when the current token is 'SyntaxKind.Unknown'.");
pos = tokenPos = startPos;
tokenFlags = 0;
var ch = codePointAt(text, pos);
var identifierKind = scanIdentifier(ch, 99 /* ESNext */);
if (identifierKind) {
return token = identifierKind;
}
pos += charSize(ch);
return token; // Still `SyntaKind.Unknown`
}
function scanIdentifier(startCharacter, languageVersion) {
var ch = startCharacter;
if (isIdentifierStart(ch, languageVersion)) {
pos += charSize(ch);
while (pos < end && isIdentifierPart(ch = codePointAt(text, pos), languageVersion))
pos += charSize(ch);
tokenValue = text.substring(tokenPos, pos);
if (ch === 92 /* backslash */) {
tokenValue += scanIdentifierParts();
}
return getIdentifierToken();
}
}
function reScanGreaterToken() {
if (token === 31 /* GreaterThanToken */) {
if (text.charCodeAt(pos) === 62 /* greaterThan */) {
if (text.charCodeAt(pos + 1) === 62 /* greaterThan */) {
if (text.charCodeAt(pos + 2) === 61 /* equals */) {
return pos += 3, token = 72 /* GreaterThanGreaterThanGreaterThanEqualsToken */;
}
return pos += 2, token = 49 /* GreaterThanGreaterThanGreaterThanToken */;
}
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
return pos += 2, token = 71 /* GreaterThanGreaterThanEqualsToken */;
}
pos++;
return token = 48 /* GreaterThanGreaterThanToken */;
}
if (text.charCodeAt(pos) === 61 /* equals */) {
pos++;
return token = 33 /* GreaterThanEqualsToken */;
}
}
return token;
}
function reScanAsteriskEqualsToken() {
ts.Debug.assert(token === 66 /* AsteriskEqualsToken */, "'reScanAsteriskEqualsToken' should only be called on a '*='");
pos = tokenPos + 1;
return token = 63 /* EqualsToken */;
}
function reScanSlashToken() {
if (token === 43 /* SlashToken */ || token === 68 /* SlashEqualsToken */) {
var p = tokenPos + 1;
var inEscape = false;
var inCharacterClass = false;
while (true) {
// If we reach the end of a file, or hit a newline, then this is an unterminated
// regex. Report error and return what we have so far.
if (p >= end) {
tokenFlags |= 4 /* Unterminated */;
error(ts.Diagnostics.Unterminated_regular_expression_literal);
break;
}
var ch = text.charCodeAt(p);
if (isLineBreak(ch)) {
tokenFlags |= 4 /* Unterminated */;
error(ts.Diagnostics.Unterminated_regular_expression_literal);
break;
}
if (inEscape) {
// Parsing an escape character;
// reset the flag and just advance to the next char.
inEscape = false;
}
else if (ch === 47 /* slash */ && !inCharacterClass) {
// A slash within a character class is permissible,
// but in general it signals the end of the regexp literal.
p++;
break;
}
else if (ch === 91 /* openBracket */) {
inCharacterClass = true;
}
else if (ch === 92 /* backslash */) {
inEscape = true;
}
else if (ch === 93 /* closeBracket */) {
inCharacterClass = false;
}
p++;
}
while (p < end && isIdentifierPart(text.charCodeAt(p), languageVersion)) {
p++;
}
pos = p;
tokenValue = text.substring(tokenPos, pos);
token = 13 /* RegularExpressionLiteral */;
}
return token;
}
function appendIfCommentDirective(commentDirectives, text, commentDirectiveRegEx, lineStart) {
var type = getDirectiveFromComment(ts.trimStringStart(text), commentDirectiveRegEx);
if (type === undefined) {
return commentDirectives;
}
return ts.append(commentDirectives, {
range: { pos: lineStart, end: pos },
type: type,
});
}
function getDirectiveFromComment(text, commentDirectiveRegEx) {
var match = commentDirectiveRegEx.exec(text);
if (!match) {
return undefined;
}
switch (match[1]) {
case "ts-expect-error":
return 0 /* ExpectError */;
case "ts-ignore":
return 1 /* Ignore */;
}
return undefined;
}
/**
* Unconditionally back up and scan a template expression portion.
*/
function reScanTemplateToken(isTaggedTemplate) {
ts.Debug.assert(token === 19 /* CloseBraceToken */, "'reScanTemplateToken' should only be called on a '}'");
pos = tokenPos;
return token = scanTemplateAndSetTokenValue(isTaggedTemplate);
}
function reScanTemplateHeadOrNoSubstitutionTemplate() {
pos = tokenPos;
return token = scanTemplateAndSetTokenValue(/* isTaggedTemplate */ true);
}
function reScanJsxToken(allowMultilineJsxText) {
if (allowMultilineJsxText === void 0) { allowMultilineJsxText = true; }
pos = tokenPos = startPos;
return token = scanJsxToken(allowMultilineJsxText);
}
function reScanLessThanToken() {
if (token === 47 /* LessThanLessThanToken */) {
pos = tokenPos + 1;
return token = 29 /* LessThanToken */;
}
return token;
}
function reScanHashToken() {
if (token === 80 /* PrivateIdentifier */) {
pos = tokenPos + 1;
return token = 62 /* HashToken */;
}
return token;
}
function reScanQuestionToken() {
ts.Debug.assert(token === 60 /* QuestionQuestionToken */, "'reScanQuestionToken' should only be called on a '??'");
pos = tokenPos + 1;
return token = 57 /* QuestionToken */;
}
function scanJsxToken(allowMultilineJsxText) {
if (allowMultilineJsxText === void 0) { allowMultilineJsxText = true; }
startPos = tokenPos = pos;
if (pos >= end) {
return token = 1 /* EndOfFileToken */;
}
var char = text.charCodeAt(pos);
if (char === 60 /* lessThan */) {
if (text.charCodeAt(pos + 1) === 47 /* slash */) {
pos += 2;
return token = 30 /* LessThanSlashToken */;
}
pos++;
return token = 29 /* LessThanToken */;
}
if (char === 123 /* openBrace */) {
pos++;
return token = 18 /* OpenBraceToken */;
}
// First non-whitespace character on this line.
var firstNonWhitespace = 0;
// These initial values are special because the first line is:
// firstNonWhitespace = 0 to indicate that we want leading whitespace,
while (pos < end) {
char = text.charCodeAt(pos);
if (char === 123 /* openBrace */) {
break;
}
if (char === 60 /* lessThan */) {
if (isConflictMarkerTrivia(text, pos)) {
pos = scanConflictMarkerTrivia(text, pos, error);
return token = 7 /* ConflictMarkerTrivia */;
}
break;
}
if (char === 62 /* greaterThan */) {
error(ts.Diagnostics.Unexpected_token_Did_you_mean_or_gt, pos, 1);
}
if (char === 125 /* closeBrace */) {
error(ts.Diagnostics.Unexpected_token_Did_you_mean_or_rbrace, pos, 1);
}
// FirstNonWhitespace is 0, then we only see whitespaces so far. If we see a linebreak, we want to ignore that whitespaces.
// i.e (- : whitespace)
// <div>----
// </div> becomes <div></div>
//
// <div>----</div> becomes <div>----</div>
if (isLineBreak(char) && firstNonWhitespace === 0) {
firstNonWhitespace = -1;
}
else if (!allowMultilineJsxText && isLineBreak(char) && firstNonWhitespace > 0) {
// Stop JsxText on each line during formatting. This allows the formatter to
// indent each line correctly.
break;
}
else if (!isWhiteSpaceLike(char)) {
firstNonWhitespace = pos;
}
pos++;
}
tokenValue = text.substring(startPos, pos);
return firstNonWhitespace === -1 ? 12 /* JsxTextAllWhiteSpaces */ : 11 /* JsxText */;
}
// Scans a JSX identifier; these differ from normal identifiers in that
// they allow dashes
function scanJsxIdentifier() {
if (tokenIsIdentifierOrKeyword(token)) {
// An identifier or keyword has already been parsed - check for a `-` or a single instance of `:` and then append it and
// everything after it to the token
// Do note that this means that `scanJsxIdentifier` effectively _mutates_ the visible token without advancing to a new token
// Any caller should be expecting this behavior and should only read the pos or token value after calling it.
var namespaceSeparator = false;
while (pos < end) {
var ch = text.charCodeAt(pos);
if (ch === 45 /* minus */) {
tokenValue += "-";
pos++;
continue;
}
else if (ch === 58 /* colon */ && !namespaceSeparator) {
tokenValue += ":";
pos++;
namespaceSeparator = true;
token = 79 /* Identifier */; // swap from keyword kind to identifier kind
continue;
}
var oldPos = pos;
tokenValue += scanIdentifierParts(); // reuse `scanIdentifierParts` so unicode escapes are handled
if (pos === oldPos) {
break;
}
}
// Do not include a trailing namespace separator in the token, since this is against the spec.
if (tokenValue.slice(-1) === ":") {
tokenValue = tokenValue.slice(0, -1);
pos--;
}
}
return token;
}
function scanJsxAttributeValue() {
startPos = pos;
switch (text.charCodeAt(pos)) {
case 34 /* doubleQuote */:
case 39 /* singleQuote */:
tokenValue = scanString(/*jsxAttributeString*/ true);
return token = 10 /* StringLiteral */;
default:
// If this scans anything other than `{`, it's a parse error.
return scan();
}
}
function reScanJsxAttributeValue() {
pos = tokenPos = startPos;
return scanJsxAttributeValue();
}
function scanJsDocToken() {
startPos = tokenPos = pos;
tokenFlags = 0 /* None */;
if (pos >= end) {
return token = 1 /* EndOfFileToken */;
}
var ch = codePointAt(text, pos);
pos += charSize(ch);
switch (ch) {
case 9 /* tab */:
case 11 /* verticalTab */:
case 12 /* formFeed */:
case 32 /* space */:
while (pos < end && isWhiteSpaceSingleLine(text.charCodeAt(pos))) {
pos++;
}
return token = 5 /* WhitespaceTrivia */;
case 64 /* at */:
return token = 59 /* AtToken */;
case 13 /* carriageReturn */:
if (text.charCodeAt(pos) === 10 /* lineFeed */) {
pos++;
}
// falls through
case 10 /* lineFeed */:
tokenFlags |= 1 /* PrecedingLineBreak */;
return token = 4 /* NewLineTrivia */;
case 42 /* asterisk */:
return token = 41 /* AsteriskToken */;
case 123 /* openBrace */:
return token = 18 /* OpenBraceToken */;
case 125 /* closeBrace */:
return token = 19 /* CloseBraceToken */;
case 91 /* openBracket */:
return token = 22 /* OpenBracketToken */;
case 93 /* closeBracket */:
return token = 23 /* CloseBracketToken */;
case 60 /* lessThan */:
return token = 29 /* LessThanToken */;
case 62 /* greaterThan */:
return token = 31 /* GreaterThanToken */;
case 61 /* equals */:
return token = 63 /* EqualsToken */;
case 44 /* comma */:
return token = 27 /* CommaToken */;
case 46 /* dot */:
return token = 24 /* DotToken */;
case 96 /* backtick */:
return token = 61 /* BacktickToken */;
case 35 /* hash */:
return token = 62 /* HashToken */;
case 92 /* backslash */:
pos--;
var extendedCookedChar = peekExtendedUnicodeEscape();
if (extendedCookedChar >= 0 && isIdentifierStart(extendedCookedChar, languageVersion)) {
pos += 3;
tokenFlags |= 8 /* ExtendedUnicodeEscape */;
tokenValue = scanExtendedUnicodeEscape() + scanIdentifierParts();
return token = getIdentifierToken();
}
var cookedChar = peekUnicodeEscape();
if (cookedChar >= 0 && isIdentifierStart(cookedChar, languageVersion)) {
pos += 6;
tokenFlags |= 1024 /* UnicodeEscape */;
tokenValue = String.fromCharCode(cookedChar) + scanIdentifierParts();
return token = getIdentifierToken();
}
pos++;
return token = 0 /* Unknown */;
}
if (isIdentifierStart(ch, languageVersion)) {
var char = ch;
while (pos < end && isIdentifierPart(char = codePointAt(text, pos), languageVersion) || text.charCodeAt(pos) === 45 /* minus */)
pos += charSize(char);
tokenValue = text.substring(tokenPos, pos);
if (char === 92 /* backslash */) {
tokenValue += scanIdentifierParts();
}
return token = getIdentifierToken();
}
else {
return token = 0 /* Unknown */;
}
}
function speculationHelper(callback, isLookahead) {
var savePos = pos;
var saveStartPos = startPos;
var saveTokenPos = tokenPos;
var saveToken = token;
var saveTokenValue = tokenValue;
var saveTokenFlags = tokenFlags;
var result = callback();
// If our callback returned something 'falsy' or we're just looking ahead,
// then unconditionally restore us to where we were.
if (!result || isLookahead) {
pos = savePos;
startPos = saveStartPos;
tokenPos = saveTokenPos;
token = saveToken;
tokenValue = saveTokenValue;
tokenFlags = saveTokenFlags;
}
return result;
}
function scanRange(start, length, callback) {
var saveEnd = end;
var savePos = pos;
var saveStartPos = startPos;
var saveTokenPos = tokenPos;
var saveToken = token;
var saveTokenValue = tokenValue;
var saveTokenFlags = tokenFlags;
var saveErrorExpectations = commentDirectives;
setText(text, start, length);
var result = callback();
end = saveEnd;
pos = savePos;
startPos = saveStartPos;
tokenPos = saveTokenPos;
token = saveToken;
tokenValue = saveTokenValue;
tokenFlags = saveTokenFlags;
commentDirectives = saveErrorExpectations;
return result;
}
function lookAhead(callback) {
return speculationHelper(callback, /*isLookahead*/ true);
}
function tryScan(callback) {
return speculationHelper(callback, /*isLookahead*/ false);
}
function getText() {
return text;
}
function clearCommentDirectives() {
commentDirectives = undefined;
}
function setText(newText, start, length) {
text = newText || "";
end = length === undefined ? text.length : start + length;
setTextPos(start || 0);
}
function setOnError(errorCallback) {
onError = errorCallback;
}
function setScriptTarget(scriptTarget) {
languageVersion = scriptTarget;
}
function setLanguageVariant(variant) {
languageVariant = variant;
}
function setTextPos(textPos) {
ts.Debug.assert(textPos >= 0);
pos = textPos;
startPos = textPos;
tokenPos = textPos;
token = 0 /* Unknown */;
tokenValue = undefined;
tokenFlags = 0 /* None */;
}
function setInJSDocType(inType) {
inJSDocType += inType ? 1 : -1;
}
}
ts.createScanner = createScanner;
/* @internal */
var codePointAt = String.prototype.codePointAt ? function (s, i) { return s.codePointAt(i); } : function codePointAt(str, i) {
// from https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/codePointAt
var size = str.length;
// Account for out-of-bounds indices:
if (i < 0 || i >= size) {
return undefined; // String.codePointAt returns `undefined` for OOB indexes
}
// Get the first code unit
var first = str.charCodeAt(i);
// check if it’s the start of a surrogate pair
if (first >= 0xD800 && first <= 0xDBFF && size > i + 1) { // high surrogate and there is a next code unit
var second = str.charCodeAt(i + 1);
if (second >= 0xDC00 && second <= 0xDFFF) { // low surrogate
// https://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
return (first - 0xD800) * 0x400 + second - 0xDC00 + 0x10000;
}
}
return first;
};
/* @internal */
function charSize(ch) {
if (ch >= 0x10000) {
return 2;
}
return 1;
}
// Derived from the 10.1.1 UTF16Encoding of the ES6 Spec.
function utf16EncodeAsStringFallback(codePoint) {
ts.Debug.assert(0x0 <= codePoint && codePoint <= 0x10FFFF);
if (codePoint <= 65535) {
return String.fromCharCode(codePoint);
}
var codeUnit1 = Math.floor((codePoint - 65536) / 1024) + 0xD800;
var codeUnit2 = ((codePoint - 65536) % 1024) + 0xDC00;
return String.fromCharCode(codeUnit1, codeUnit2);
}
var utf16EncodeAsStringWorker = String.fromCodePoint ? function (codePoint) { return String.fromCodePoint(codePoint); } : utf16EncodeAsStringFallback;
/* @internal */
function utf16EncodeAsString(codePoint) {
return utf16EncodeAsStringWorker(codePoint);
}
ts.utf16EncodeAsString = utf16EncodeAsString;
})(ts || (ts = {}));
var ts;
(function (ts) {
function isExternalModuleNameRelative(moduleName) {
// TypeScript 1.0 spec (April 2014): 11.2.1
// An external module name is "relative" if the first term is "." or "..".
// Update: We also consider a path like `C:\foo.ts` "relative" because we do not search for it in `node_modules` or treat it as an ambient module.
return ts.pathIsRelative(moduleName) || ts.isRootedDiskPath(moduleName);
}
ts.isExternalModuleNameRelative = isExternalModuleNameRelative;
function sortAndDeduplicateDiagnostics(diagnostics) {
return ts.sortAndDeduplicate(diagnostics, ts.compareDiagnostics);
}
ts.sortAndDeduplicateDiagnostics = sortAndDeduplicateDiagnostics;
function getDefaultLibFileName(options) {
switch (options.target) {
case 99 /* ESNext */:
return "lib.esnext.full.d.ts";
case 8 /* ES2021 */:
return "lib.es2021.full.d.ts";
case 7 /* ES2020 */:
return "lib.es2020.full.d.ts";
case 6 /* ES2019 */:
return "lib.es2019.full.d.ts";
case 5 /* ES2018 */:
return "lib.es2018.full.d.ts";
case 4 /* ES2017 */:
return "lib.es2017.full.d.ts";
case 3 /* ES2016 */:
return "lib.es2016.full.d.ts";
case 2 /* ES2015 */:
return "lib.es6.d.ts"; // We don't use lib.es2015.full.d.ts due to breaking change.
default:
return "lib.d.ts";
}
}
ts.getDefaultLibFileName = getDefaultLibFileName;
function textSpanEnd(span) {
return span.start + span.length;
}
ts.textSpanEnd = textSpanEnd;
function textSpanIsEmpty(span) {
return span.length === 0;
}
ts.textSpanIsEmpty = textSpanIsEmpty;
function textSpanContainsPosition(span, position) {
return position >= span.start && position < textSpanEnd(span);
}
ts.textSpanContainsPosition = textSpanContainsPosition;
/* @internal */
function textRangeContainsPositionInclusive(span, position) {
return position >= span.pos && position <= span.end;
}
ts.textRangeContainsPositionInclusive = textRangeContainsPositionInclusive;
// Returns true if 'span' contains 'other'.
function textSpanContainsTextSpan(span, other) {
return other.start >= span.start && textSpanEnd(other) <= textSpanEnd(span);
}
ts.textSpanContainsTextSpan = textSpanContainsTextSpan;
function textSpanOverlapsWith(span, other) {
return textSpanOverlap(span, other) !== undefined;
}
ts.textSpanOverlapsWith = textSpanOverlapsWith;
function textSpanOverlap(span1, span2) {
var overlap = textSpanIntersection(span1, span2);
return overlap && overlap.length === 0 ? undefined : overlap;
}
ts.textSpanOverlap = textSpanOverlap;
function textSpanIntersectsWithTextSpan(span, other) {
return decodedTextSpanIntersectsWith(span.start, span.length, other.start, other.length);
}
ts.textSpanIntersectsWithTextSpan = textSpanIntersectsWithTextSpan;
function textSpanIntersectsWith(span, start, length) {
return decodedTextSpanIntersectsWith(span.start, span.length, start, length);
}
ts.textSpanIntersectsWith = textSpanIntersectsWith;
function decodedTextSpanIntersectsWith(start1, length1, start2, length2) {
var end1 = start1 + length1;
var end2 = start2 + length2;
return start2 <= end1 && end2 >= start1;
}
ts.decodedTextSpanIntersectsWith = decodedTextSpanIntersectsWith;
function textSpanIntersectsWithPosition(span, position) {
return position <= textSpanEnd(span) && position >= span.start;
}
ts.textSpanIntersectsWithPosition = textSpanIntersectsWithPosition;
function textSpanIntersection(span1, span2) {
var start = Math.max(span1.start, span2.start);
var end = Math.min(textSpanEnd(span1), textSpanEnd(span2));
return start <= end ? createTextSpanFromBounds(start, end) : undefined;
}
ts.textSpanIntersection = textSpanIntersection;
function createTextSpan(start, length) {
if (start < 0) {
throw new Error("start < 0");
}
if (length < 0) {
throw new Error("length < 0");
}
return { start: start, length: length };
}
ts.createTextSpan = createTextSpan;
function createTextSpanFromBounds(start, end) {
return createTextSpan(start, end - start);
}
ts.createTextSpanFromBounds = createTextSpanFromBounds;
function textChangeRangeNewSpan(range) {
return createTextSpan(range.span.start, range.newLength);
}
ts.textChangeRangeNewSpan = textChangeRangeNewSpan;
function textChangeRangeIsUnchanged(range) {
return textSpanIsEmpty(range.span) && range.newLength === 0;
}
ts.textChangeRangeIsUnchanged = textChangeRangeIsUnchanged;
function createTextChangeRange(span, newLength) {
if (newLength < 0) {
throw new Error("newLength < 0");
}
return { span: span, newLength: newLength };
}
ts.createTextChangeRange = createTextChangeRange;
ts.unchangedTextChangeRange = createTextChangeRange(createTextSpan(0, 0), 0); // eslint-disable-line prefer-const
/**
* Called to merge all the changes that occurred across several versions of a script snapshot
* into a single change. i.e. if a user keeps making successive edits to a script we will
* have a text change from V1 to V2, V2 to V3, ..., Vn.
*
* This function will then merge those changes into a single change range valid between V1 and
* Vn.
*/
function collapseTextChangeRangesAcrossMultipleVersions(changes) {
if (changes.length === 0) {
return ts.unchangedTextChangeRange;
}
if (changes.length === 1) {
return changes[0];
}
// We change from talking about { { oldStart, oldLength }, newLength } to { oldStart, oldEnd, newEnd }
// as it makes things much easier to reason about.
var change0 = changes[0];
var oldStartN = change0.span.start;
var oldEndN = textSpanEnd(change0.span);
var newEndN = oldStartN + change0.newLength;
for (var i = 1; i < changes.length; i++) {
var nextChange = changes[i];
// Consider the following case:
// i.e. two edits. The first represents the text change range { { 10, 50 }, 30 }. i.e. The span starting
// at 10, with length 50 is reduced to length 30. The second represents the text change range { { 30, 30 }, 40 }.
// i.e. the span starting at 30 with length 30 is increased to length 40.
//
// 0 10 20 30 40 50 60 70 80 90 100
// -------------------------------------------------------------------------------------------------------
// | /
// | /----
// T1 | /----
// | /----
// | /----
// -------------------------------------------------------------------------------------------------------
// | \
// | \
// T2 | \
// | \
// | \
// -------------------------------------------------------------------------------------------------------
//
// Merging these turns out to not be too difficult. First, determining the new start of the change is trivial
// it's just the min of the old and new starts. i.e.:
//
// 0 10 20 30 40 50 60 70 80 90 100
// ------------------------------------------------------------*------------------------------------------
// | /
// | /----
// T1 | /----
// | /----
// | /----
// ----------------------------------------$-------------------$------------------------------------------
// . | \
// . | \
// T2 . | \
// . | \
// . | \
// ----------------------------------------------------------------------*--------------------------------
//
// (Note the dots represent the newly inferred start.
// Determining the new and old end is also pretty simple. Basically it boils down to paying attention to the
// absolute positions at the asterisks, and the relative change between the dollar signs. Basically, we see
// which if the two $'s precedes the other, and we move that one forward until they line up. in this case that
// means:
//
// 0 10 20 30 40 50 60 70 80 90 100
// --------------------------------------------------------------------------------*----------------------
// | /
// | /----
// T1 | /----
// | /----
// | /----
// ------------------------------------------------------------$------------------------------------------
// . | \
// . | \
// T2 . | \
// . | \
// . | \
// ----------------------------------------------------------------------*--------------------------------
//
// In other words (in this case), we're recognizing that the second edit happened after where the first edit
// ended with a delta of 20 characters (60 - 40). Thus, if we go back in time to where the first edit started
// that's the same as if we started at char 80 instead of 60.
//
// As it so happens, the same logic applies if the second edit precedes the first edit. In that case rather
// than pushing the first edit forward to match the second, we'll push the second edit forward to match the
// first.
//
// In this case that means we have { oldStart: 10, oldEnd: 80, newEnd: 70 } or, in TextChangeRange
// semantics: { { start: 10, length: 70 }, newLength: 60 }
//
// The math then works out as follows.
// If we have { oldStart1, oldEnd1, newEnd1 } and { oldStart2, oldEnd2, newEnd2 } then we can compute the
// final result like so:
//
// {
// oldStart3: Min(oldStart1, oldStart2),
// oldEnd3: Max(oldEnd1, oldEnd1 + (oldEnd2 - newEnd1)),
// newEnd3: Max(newEnd2, newEnd2 + (newEnd1 - oldEnd2))
// }
var oldStart1 = oldStartN;
var oldEnd1 = oldEndN;
var newEnd1 = newEndN;
var oldStart2 = nextChange.span.start;
var oldEnd2 = textSpanEnd(nextChange.span);
var newEnd2 = oldStart2 + nextChange.newLength;
oldStartN = Math.min(oldStart1, oldStart2);
oldEndN = Math.max(oldEnd1, oldEnd1 + (oldEnd2 - newEnd1));
newEndN = Math.max(newEnd2, newEnd2 + (newEnd1 - oldEnd2));
}
return createTextChangeRange(createTextSpanFromBounds(oldStartN, oldEndN), /*newLength*/ newEndN - oldStartN);
}
ts.collapseTextChangeRangesAcrossMultipleVersions = collapseTextChangeRangesAcrossMultipleVersions;
function getTypeParameterOwner(d) {
if (d && d.kind === 161 /* TypeParameter */) {
for (var current = d; current; current = current.parent) {
if (isFunctionLike(current) || isClassLike(current) || current.kind === 256 /* InterfaceDeclaration */) {
return current;
}
}
}
}
ts.getTypeParameterOwner = getTypeParameterOwner;
function isParameterPropertyDeclaration(node, parent) {
return ts.hasSyntacticModifier(node, 16476 /* ParameterPropertyModifier */) && parent.kind === 169 /* Constructor */;
}
ts.isParameterPropertyDeclaration = isParameterPropertyDeclaration;
function isEmptyBindingPattern(node) {
if (isBindingPattern(node)) {
return ts.every(node.elements, isEmptyBindingElement);
}
return false;
}
ts.isEmptyBindingPattern = isEmptyBindingPattern;
function isEmptyBindingElement(node) {
if (ts.isOmittedExpression(node)) {
return true;
}
return isEmptyBindingPattern(node.name);
}
ts.isEmptyBindingElement = isEmptyBindingElement;
function walkUpBindingElementsAndPatterns(binding) {
var node = binding.parent;
while (ts.isBindingElement(node.parent)) {
node = node.parent.parent;
}
return node.parent;
}
ts.walkUpBindingElementsAndPatterns = walkUpBindingElementsAndPatterns;
function getCombinedFlags(node, getFlags) {
if (ts.isBindingElement(node)) {
node = walkUpBindingElementsAndPatterns(node);
}
var flags = getFlags(node);
if (node.kind === 252 /* VariableDeclaration */) {
node = node.parent;
}
if (node && node.kind === 253 /* VariableDeclarationList */) {
flags |= getFlags(node);
node = node.parent;
}
if (node && node.kind === 235 /* VariableStatement */) {
flags |= getFlags(node);
}
return flags;
}
function getCombinedModifierFlags(node) {
return getCombinedFlags(node, ts.getEffectiveModifierFlags);
}
ts.getCombinedModifierFlags = getCombinedModifierFlags;
/* @internal */
function getCombinedNodeFlagsAlwaysIncludeJSDoc(node) {
return getCombinedFlags(node, ts.getEffectiveModifierFlagsAlwaysIncludeJSDoc);
}
ts.getCombinedNodeFlagsAlwaysIncludeJSDoc = getCombinedNodeFlagsAlwaysIncludeJSDoc;
// Returns the node flags for this node and all relevant parent nodes. This is done so that
// nodes like variable declarations and binding elements can returned a view of their flags
// that includes the modifiers from their container. i.e. flags like export/declare aren't
// stored on the variable declaration directly, but on the containing variable statement
// (if it has one). Similarly, flags for let/const are stored on the variable declaration
// list. By calling this function, all those flags are combined so that the client can treat
// the node as if it actually had those flags.
function getCombinedNodeFlags(node) {
return getCombinedFlags(node, function (n) { return n.flags; });
}
ts.getCombinedNodeFlags = getCombinedNodeFlags;
/* @internal */
ts.supportedLocaleDirectories = ["cs", "de", "es", "fr", "it", "ja", "ko", "pl", "pt-br", "ru", "tr", "zh-cn", "zh-tw"];
/**
* Checks to see if the locale is in the appropriate format,
* and if it is, attempts to set the appropriate language.
*/
function validateLocaleAndSetLanguage(locale, sys, errors) {
var lowerCaseLocale = locale.toLowerCase();
var matchResult = /^([a-z]+)([_\-]([a-z]+))?$/.exec(lowerCaseLocale);
if (!matchResult) {
if (errors) {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Locale_must_be_of_the_form_language_or_language_territory_For_example_0_or_1, "en", "ja-jp"));
}
return;
}
var language = matchResult[1];
var territory = matchResult[3];
// First try the entire locale, then fall back to just language if that's all we have.
// Either ways do not fail, and fallback to the English diagnostic strings.
if (ts.contains(ts.supportedLocaleDirectories, lowerCaseLocale) && !trySetLanguageAndTerritory(language, territory, errors)) {
trySetLanguageAndTerritory(language, /*territory*/ undefined, errors);
}
// Set the UI locale for string collation
ts.setUILocale(locale);
function trySetLanguageAndTerritory(language, territory, errors) {
var compilerFilePath = ts.normalizePath(sys.getExecutingFilePath());
var containingDirectoryPath = ts.getDirectoryPath(compilerFilePath);
var filePath = ts.combinePaths(containingDirectoryPath, language);
if (territory) {
filePath = filePath + "-" + territory;
}
filePath = sys.resolvePath(ts.combinePaths(filePath, "diagnosticMessages.generated.json"));
if (!sys.fileExists(filePath)) {
return false;
}
// TODO: Add codePage support for readFile?
var fileContents = "";
try {
fileContents = sys.readFile(filePath);
}
catch (e) {
if (errors) {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Unable_to_open_file_0, filePath));
}
return false;
}
try {
// this is a global mutation (or live binding update)!
ts.setLocalizedDiagnosticMessages(JSON.parse(fileContents));
}
catch (_a) {
if (errors) {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Corrupted_locale_file_0, filePath));
}
return false;
}
return true;
}
}
ts.validateLocaleAndSetLanguage = validateLocaleAndSetLanguage;
function getOriginalNode(node, nodeTest) {
if (node) {
while (node.original !== undefined) {
node = node.original;
}
}
return !nodeTest || nodeTest(node) ? node : undefined;
}
ts.getOriginalNode = getOriginalNode;
function findAncestor(node, callback) {
while (node) {
var result = callback(node);
if (result === "quit") {
return undefined;
}
else if (result) {
return node;
}
node = node.parent;
}
return undefined;
}
ts.findAncestor = findAncestor;
/**
* Gets a value indicating whether a node originated in the parse tree.
*
* @param node The node to test.
*/
function isParseTreeNode(node) {
return (node.flags & 8 /* Synthesized */) === 0;
}
ts.isParseTreeNode = isParseTreeNode;
function getParseTreeNode(node, nodeTest) {
if (node === undefined || isParseTreeNode(node)) {
return node;
}
node = node.original;
while (node) {
if (isParseTreeNode(node)) {
return !nodeTest || nodeTest(node) ? node : undefined;
}
node = node.original;
}
}
ts.getParseTreeNode = getParseTreeNode;
/** Add an extra underscore to identifiers that start with two underscores to avoid issues with magic names like '__proto__' */
function escapeLeadingUnderscores(identifier) {
return (identifier.length >= 2 && identifier.charCodeAt(0) === 95 /* _ */ && identifier.charCodeAt(1) === 95 /* _ */ ? "_" + identifier : identifier);
}
ts.escapeLeadingUnderscores = escapeLeadingUnderscores;
/**
* Remove extra underscore from escaped identifier text content.
*
* @param identifier The escaped identifier text.
* @returns The unescaped identifier text.
*/
function unescapeLeadingUnderscores(identifier) {
var id = identifier;
return id.length >= 3 && id.charCodeAt(0) === 95 /* _ */ && id.charCodeAt(1) === 95 /* _ */ && id.charCodeAt(2) === 95 /* _ */ ? id.substr(1) : id;
}
ts.unescapeLeadingUnderscores = unescapeLeadingUnderscores;
function idText(identifierOrPrivateName) {
return unescapeLeadingUnderscores(identifierOrPrivateName.escapedText);
}
ts.idText = idText;
function symbolName(symbol) {
if (symbol.valueDeclaration && isPrivateIdentifierClassElementDeclaration(symbol.valueDeclaration)) {
return idText(symbol.valueDeclaration.name);
}
return unescapeLeadingUnderscores(symbol.escapedName);
}
ts.symbolName = symbolName;
/**
* A JSDocTypedef tag has an _optional_ name field - if a name is not directly present, we should
* attempt to draw the name from the node the declaration is on (as that declaration is what its' symbol
* will be merged with)
*/
function nameForNamelessJSDocTypedef(declaration) {
var hostNode = declaration.parent.parent;
if (!hostNode) {
return undefined;
}
// Covers classes, functions - any named declaration host node
if (isDeclaration(hostNode)) {
return getDeclarationIdentifier(hostNode);
}
// Covers remaining cases (returning undefined if none match).
switch (hostNode.kind) {
case 235 /* VariableStatement */:
if (hostNode.declarationList && hostNode.declarationList.declarations[0]) {
return getDeclarationIdentifier(hostNode.declarationList.declarations[0]);
}
break;
case 236 /* ExpressionStatement */:
var expr = hostNode.expression;
if (expr.kind === 219 /* BinaryExpression */ && expr.operatorToken.kind === 63 /* EqualsToken */) {
expr = expr.left;
}
switch (expr.kind) {
case 204 /* PropertyAccessExpression */:
return expr.name;
case 205 /* ElementAccessExpression */:
var arg = expr.argumentExpression;
if (ts.isIdentifier(arg)) {
return arg;
}
}
break;
case 210 /* ParenthesizedExpression */: {
return getDeclarationIdentifier(hostNode.expression);
}
case 248 /* LabeledStatement */: {
if (isDeclaration(hostNode.statement) || isExpression(hostNode.statement)) {
return getDeclarationIdentifier(hostNode.statement);
}
break;
}
}
}
function getDeclarationIdentifier(node) {
var name = getNameOfDeclaration(node);
return name && ts.isIdentifier(name) ? name : undefined;
}
/** @internal */
function nodeHasName(statement, name) {
if (isNamedDeclaration(statement) && ts.isIdentifier(statement.name) && idText(statement.name) === idText(name)) {
return true;
}
if (ts.isVariableStatement(statement) && ts.some(statement.declarationList.declarations, function (d) { return nodeHasName(d, name); })) {
return true;
}
return false;
}
ts.nodeHasName = nodeHasName;
function getNameOfJSDocTypedef(declaration) {
return declaration.name || nameForNamelessJSDocTypedef(declaration);
}
ts.getNameOfJSDocTypedef = getNameOfJSDocTypedef;
/** @internal */
function isNamedDeclaration(node) {
return !!node.name; // A 'name' property should always be a DeclarationName.
}
ts.isNamedDeclaration = isNamedDeclaration;
/** @internal */
function getNonAssignedNameOfDeclaration(declaration) {
switch (declaration.kind) {
case 79 /* Identifier */:
return declaration;
case 342 /* JSDocPropertyTag */:
case 335 /* JSDocParameterTag */: {
var name = declaration.name;
if (name.kind === 159 /* QualifiedName */) {
return name.right;
}
break;
}
case 206 /* CallExpression */:
case 219 /* BinaryExpression */: {
var expr_1 = declaration;
switch (ts.getAssignmentDeclarationKind(expr_1)) {
case 1 /* ExportsProperty */:
case 4 /* ThisProperty */:
case 5 /* Property */:
case 3 /* PrototypeProperty */:
return ts.getElementOrPropertyAccessArgumentExpressionOrName(expr_1.left);
case 7 /* ObjectDefinePropertyValue */:
case 8 /* ObjectDefinePropertyExports */:
case 9 /* ObjectDefinePrototypeProperty */:
return expr_1.arguments[1];
default:
return undefined;
}
}
case 340 /* JSDocTypedefTag */:
return getNameOfJSDocTypedef(declaration);
case 334 /* JSDocEnumTag */:
return nameForNamelessJSDocTypedef(declaration);
case 269 /* ExportAssignment */: {
var expression = declaration.expression;
return ts.isIdentifier(expression) ? expression : undefined;
}
case 205 /* ElementAccessExpression */:
var expr = declaration;
if (ts.isBindableStaticElementAccessExpression(expr)) {
return expr.argumentExpression;
}
}
return declaration.name;
}
ts.getNonAssignedNameOfDeclaration = getNonAssignedNameOfDeclaration;
function getNameOfDeclaration(declaration) {
if (declaration === undefined)
return undefined;
return getNonAssignedNameOfDeclaration(declaration) ||
(ts.isFunctionExpression(declaration) || ts.isArrowFunction(declaration) || ts.isClassExpression(declaration) ? getAssignedName(declaration) : undefined);
}
ts.getNameOfDeclaration = getNameOfDeclaration;
/*@internal*/
function getAssignedName(node) {
if (!node.parent) {
return undefined;
}
else if (ts.isPropertyAssignment(node.parent) || ts.isBindingElement(node.parent)) {
return node.parent.name;
}
else if (ts.isBinaryExpression(node.parent) && node === node.parent.right) {
if (ts.isIdentifier(node.parent.left)) {
return node.parent.left;
}
else if (ts.isAccessExpression(node.parent.left)) {
return ts.getElementOrPropertyAccessArgumentExpressionOrName(node.parent.left);
}
}
else if (ts.isVariableDeclaration(node.parent) && ts.isIdentifier(node.parent.name)) {
return node.parent.name;
}
}
ts.getAssignedName = getAssignedName;
function getJSDocParameterTagsWorker(param, noCache) {
if (param.name) {
if (ts.isIdentifier(param.name)) {
var name_1 = param.name.escapedText;
return getJSDocTagsWorker(param.parent, noCache).filter(function (tag) { return ts.isJSDocParameterTag(tag) && ts.isIdentifier(tag.name) && tag.name.escapedText === name_1; });
}
else {
var i = param.parent.parameters.indexOf(param);
ts.Debug.assert(i > -1, "Parameters should always be in their parents' parameter list");
var paramTags = getJSDocTagsWorker(param.parent, noCache).filter(ts.isJSDocParameterTag);
if (i < paramTags.length) {
return [paramTags[i]];
}
}
}
// return empty array for: out-of-order binding patterns and JSDoc function syntax, which has un-named parameters
return ts.emptyArray;
}
/**
* Gets the JSDoc parameter tags for the node if present.
*
* @remarks Returns any JSDoc param tag whose name matches the provided
* parameter, whether a param tag on a containing function
* expression, or a param tag on a variable declaration whose
* initializer is the containing function. The tags closest to the
* node are returned first, so in the previous example, the param
* tag on the containing function expression would be first.
*
* For binding patterns, parameter tags are matched by position.
*/
function getJSDocParameterTags(param) {
return getJSDocParameterTagsWorker(param, /*noCache*/ false);
}
ts.getJSDocParameterTags = getJSDocParameterTags;
/* @internal */
function getJSDocParameterTagsNoCache(param) {
return getJSDocParameterTagsWorker(param, /*noCache*/ true);
}
ts.getJSDocParameterTagsNoCache = getJSDocParameterTagsNoCache;
function getJSDocTypeParameterTagsWorker(param, noCache) {
var name = param.name.escapedText;
return getJSDocTagsWorker(param.parent, noCache).filter(function (tag) {
return ts.isJSDocTemplateTag(tag) && tag.typeParameters.some(function (tp) { return tp.name.escapedText === name; });
});
}
/**
* Gets the JSDoc type parameter tags for the node if present.
*
* @remarks Returns any JSDoc template tag whose names match the provided
* parameter, whether a template tag on a containing function
* expression, or a template tag on a variable declaration whose
* initializer is the containing function. The tags closest to the
* node are returned first, so in the previous example, the template
* tag on the containing function expression would be first.
*/
function getJSDocTypeParameterTags(param) {
return getJSDocTypeParameterTagsWorker(param, /*noCache*/ false);
}
ts.getJSDocTypeParameterTags = getJSDocTypeParameterTags;
/* @internal */
function getJSDocTypeParameterTagsNoCache(param) {
return getJSDocTypeParameterTagsWorker(param, /*noCache*/ true);
}
ts.getJSDocTypeParameterTagsNoCache = getJSDocTypeParameterTagsNoCache;
/**
* Return true if the node has JSDoc parameter tags.
*
* @remarks Includes parameter tags that are not directly on the node,
* for example on a variable declaration whose initializer is a function expression.
*/
function hasJSDocParameterTags(node) {
return !!getFirstJSDocTag(node, ts.isJSDocParameterTag);
}
ts.hasJSDocParameterTags = hasJSDocParameterTags;
/** Gets the JSDoc augments tag for the node if present */
function getJSDocAugmentsTag(node) {
return getFirstJSDocTag(node, ts.isJSDocAugmentsTag);
}
ts.getJSDocAugmentsTag = getJSDocAugmentsTag;
/** Gets the JSDoc implements tags for the node if present */
function getJSDocImplementsTags(node) {
return getAllJSDocTags(node, ts.isJSDocImplementsTag);
}
ts.getJSDocImplementsTags = getJSDocImplementsTags;
/** Gets the JSDoc class tag for the node if present */
function getJSDocClassTag(node) {
return getFirstJSDocTag(node, ts.isJSDocClassTag);
}
ts.getJSDocClassTag = getJSDocClassTag;
/** Gets the JSDoc public tag for the node if present */
function getJSDocPublicTag(node) {
return getFirstJSDocTag(node, ts.isJSDocPublicTag);
}
ts.getJSDocPublicTag = getJSDocPublicTag;
/*@internal*/
function getJSDocPublicTagNoCache(node) {
return getFirstJSDocTag(node, ts.isJSDocPublicTag, /*noCache*/ true);
}
ts.getJSDocPublicTagNoCache = getJSDocPublicTagNoCache;
/** Gets the JSDoc private tag for the node if present */
function getJSDocPrivateTag(node) {
return getFirstJSDocTag(node, ts.isJSDocPrivateTag);
}
ts.getJSDocPrivateTag = getJSDocPrivateTag;
/*@internal*/
function getJSDocPrivateTagNoCache(node) {
return getFirstJSDocTag(node, ts.isJSDocPrivateTag, /*noCache*/ true);
}
ts.getJSDocPrivateTagNoCache = getJSDocPrivateTagNoCache;
/** Gets the JSDoc protected tag for the node if present */
function getJSDocProtectedTag(node) {
return getFirstJSDocTag(node, ts.isJSDocProtectedTag);
}
ts.getJSDocProtectedTag = getJSDocProtectedTag;
/*@internal*/
function getJSDocProtectedTagNoCache(node) {
return getFirstJSDocTag(node, ts.isJSDocProtectedTag, /*noCache*/ true);
}
ts.getJSDocProtectedTagNoCache = getJSDocProtectedTagNoCache;
/** Gets the JSDoc protected tag for the node if present */
function getJSDocReadonlyTag(node) {
return getFirstJSDocTag(node, ts.isJSDocReadonlyTag);
}
ts.getJSDocReadonlyTag = getJSDocReadonlyTag;
/*@internal*/
function getJSDocReadonlyTagNoCache(node) {
return getFirstJSDocTag(node, ts.isJSDocReadonlyTag, /*noCache*/ true);
}
ts.getJSDocReadonlyTagNoCache = getJSDocReadonlyTagNoCache;
function getJSDocOverrideTagNoCache(node) {
return getFirstJSDocTag(node, ts.isJSDocOverrideTag, /*noCache*/ true);
}
ts.getJSDocOverrideTagNoCache = getJSDocOverrideTagNoCache;
/** Gets the JSDoc deprecated tag for the node if present */
function getJSDocDeprecatedTag(node) {
return getFirstJSDocTag(node, ts.isJSDocDeprecatedTag);
}
ts.getJSDocDeprecatedTag = getJSDocDeprecatedTag;
/*@internal */
function getJSDocDeprecatedTagNoCache(node) {
return getFirstJSDocTag(node, ts.isJSDocDeprecatedTag, /*noCache*/ true);
}
ts.getJSDocDeprecatedTagNoCache = getJSDocDeprecatedTagNoCache;
/** Gets the JSDoc enum tag for the node if present */
function getJSDocEnumTag(node) {
return getFirstJSDocTag(node, ts.isJSDocEnumTag);
}
ts.getJSDocEnumTag = getJSDocEnumTag;
/** Gets the JSDoc this tag for the node if present */
function getJSDocThisTag(node) {
return getFirstJSDocTag(node, ts.isJSDocThisTag);
}
ts.getJSDocThisTag = getJSDocThisTag;
/** Gets the JSDoc return tag for the node if present */
function getJSDocReturnTag(node) {
return getFirstJSDocTag(node, ts.isJSDocReturnTag);
}
ts.getJSDocReturnTag = getJSDocReturnTag;
/** Gets the JSDoc template tag for the node if present */
function getJSDocTemplateTag(node) {
return getFirstJSDocTag(node, ts.isJSDocTemplateTag);
}
ts.getJSDocTemplateTag = getJSDocTemplateTag;
/** Gets the JSDoc type tag for the node if present and valid */
function getJSDocTypeTag(node) {
// We should have already issued an error if there were multiple type jsdocs, so just use the first one.
var tag = getFirstJSDocTag(node, ts.isJSDocTypeTag);
if (tag && tag.typeExpression && tag.typeExpression.type) {
return tag;
}
return undefined;
}
ts.getJSDocTypeTag = getJSDocTypeTag;
/**
* Gets the type node for the node if provided via JSDoc.
*
* @remarks The search includes any JSDoc param tag that relates
* to the provided parameter, for example a type tag on the
* parameter itself, or a param tag on a containing function
* expression, or a param tag on a variable declaration whose
* initializer is the containing function. The tags closest to the
* node are examined first, so in the previous example, the type
* tag directly on the node would be returned.
*/
function getJSDocType(node) {
var tag = getFirstJSDocTag(node, ts.isJSDocTypeTag);
if (!tag && ts.isParameter(node)) {
tag = ts.find(getJSDocParameterTags(node), function (tag) { return !!tag.typeExpression; });
}
return tag && tag.typeExpression && tag.typeExpression.type;
}
ts.getJSDocType = getJSDocType;
/**
* Gets the return type node for the node if provided via JSDoc return tag or type tag.
*
* @remarks `getJSDocReturnTag` just gets the whole JSDoc tag. This function
* gets the type from inside the braces, after the fat arrow, etc.
*/
function getJSDocReturnType(node) {
var returnTag = getJSDocReturnTag(node);
if (returnTag && returnTag.typeExpression) {
return returnTag.typeExpression.type;
}
var typeTag = getJSDocTypeTag(node);
if (typeTag && typeTag.typeExpression) {
var type = typeTag.typeExpression.type;
if (ts.isTypeLiteralNode(type)) {
var sig = ts.find(type.members, ts.isCallSignatureDeclaration);
return sig && sig.type;
}
if (ts.isFunctionTypeNode(type) || ts.isJSDocFunctionType(type)) {
return type.type;
}
}
}
ts.getJSDocReturnType = getJSDocReturnType;
function getJSDocTagsWorker(node, noCache) {
var tags = node.jsDocCache;
// If cache is 'null', that means we did the work of searching for JSDoc tags and came up with nothing.
if (tags === undefined || noCache) {
var comments = ts.getJSDocCommentsAndTags(node, noCache);
ts.Debug.assert(comments.length < 2 || comments[0] !== comments[1]);
tags = ts.flatMap(comments, function (j) { return ts.isJSDoc(j) ? j.tags : j; });
if (!noCache) {
node.jsDocCache = tags;
}
}
return tags;
}
/** Get all JSDoc tags related to a node, including those on parent nodes. */
function getJSDocTags(node) {
return getJSDocTagsWorker(node, /*noCache*/ false);
}
ts.getJSDocTags = getJSDocTags;
/* @internal */
function getJSDocTagsNoCache(node) {
return getJSDocTagsWorker(node, /*noCache*/ true);
}
ts.getJSDocTagsNoCache = getJSDocTagsNoCache;
/** Get the first JSDoc tag of a specified kind, or undefined if not present. */
function getFirstJSDocTag(node, predicate, noCache) {
return ts.find(getJSDocTagsWorker(node, noCache), predicate);
}
/** Gets all JSDoc tags that match a specified predicate */
function getAllJSDocTags(node, predicate) {
return getJSDocTags(node).filter(predicate);
}
ts.getAllJSDocTags = getAllJSDocTags;
/** Gets all JSDoc tags of a specified kind */
function getAllJSDocTagsOfKind(node, kind) {
return getJSDocTags(node).filter(function (doc) { return doc.kind === kind; });
}
ts.getAllJSDocTagsOfKind = getAllJSDocTagsOfKind;
/** Gets the text of a jsdoc comment, flattening links to their text. */
function getTextOfJSDocComment(comment) {
return typeof comment === "string" ? comment
: comment === null || comment === void 0 ? void 0 : comment.map(function (c) {
// TODO: Other kinds here
return c.kind === 316 /* JSDocText */ ? c.text : "{@link " + (c.name ? ts.entityNameToString(c.name) + " " : "") + c.text + "}";
}).join("");
}
ts.getTextOfJSDocComment = getTextOfJSDocComment;
/**
* Gets the effective type parameters. If the node was parsed in a
* JavaScript file, gets the type parameters from the `@template` tag from JSDoc.
*/
function getEffectiveTypeParameterDeclarations(node) {
if (ts.isJSDocSignature(node)) {
return ts.emptyArray;
}
if (ts.isJSDocTypeAlias(node)) {
ts.Debug.assert(node.parent.kind === 315 /* JSDocComment */);
return ts.flatMap(node.parent.tags, function (tag) { return ts.isJSDocTemplateTag(tag) ? tag.typeParameters : undefined; });
}
if (node.typeParameters) {
return node.typeParameters;
}
if (ts.isInJSFile(node)) {
var decls = ts.getJSDocTypeParameterDeclarations(node);
if (decls.length) {
return decls;
}
var typeTag = getJSDocType(node);
if (typeTag && ts.isFunctionTypeNode(typeTag) && typeTag.typeParameters) {
return typeTag.typeParameters;
}
}
return ts.emptyArray;
}
ts.getEffectiveTypeParameterDeclarations = getEffectiveTypeParameterDeclarations;
function getEffectiveConstraintOfTypeParameter(node) {
return node.constraint ? node.constraint :
ts.isJSDocTemplateTag(node.parent) && node === node.parent.typeParameters[0] ? node.parent.constraint :
undefined;
}
ts.getEffectiveConstraintOfTypeParameter = getEffectiveConstraintOfTypeParameter;
// #region
function isMemberName(node) {
return node.kind === 79 /* Identifier */ || node.kind === 80 /* PrivateIdentifier */;
}
ts.isMemberName = isMemberName;
/* @internal */
function isGetOrSetAccessorDeclaration(node) {
return node.kind === 171 /* SetAccessor */ || node.kind === 170 /* GetAccessor */;
}
ts.isGetOrSetAccessorDeclaration = isGetOrSetAccessorDeclaration;
function isPropertyAccessChain(node) {
return ts.isPropertyAccessExpression(node) && !!(node.flags & 32 /* OptionalChain */);
}
ts.isPropertyAccessChain = isPropertyAccessChain;
function isElementAccessChain(node) {
return ts.isElementAccessExpression(node) && !!(node.flags & 32 /* OptionalChain */);
}
ts.isElementAccessChain = isElementAccessChain;
function isCallChain(node) {
return ts.isCallExpression(node) && !!(node.flags & 32 /* OptionalChain */);
}
ts.isCallChain = isCallChain;
function isOptionalChain(node) {
var kind = node.kind;
return !!(node.flags & 32 /* OptionalChain */) &&
(kind === 204 /* PropertyAccessExpression */
|| kind === 205 /* ElementAccessExpression */
|| kind === 206 /* CallExpression */
|| kind === 228 /* NonNullExpression */);
}
ts.isOptionalChain = isOptionalChain;
/* @internal */
function isOptionalChainRoot(node) {
return isOptionalChain(node) && !ts.isNonNullExpression(node) && !!node.questionDotToken;
}
ts.isOptionalChainRoot = isOptionalChainRoot;
/**
* Determines whether a node is the expression preceding an optional chain (i.e. `a` in `a?.b`).
*/
/* @internal */
function isExpressionOfOptionalChainRoot(node) {
return isOptionalChainRoot(node.parent) && node.parent.expression === node;
}
ts.isExpressionOfOptionalChainRoot = isExpressionOfOptionalChainRoot;
/**
* Determines whether a node is the outermost `OptionalChain` in an ECMAScript `OptionalExpression`:
*
* 1. For `a?.b.c`, the outermost chain is `a?.b.c` (`c` is the end of the chain starting at `a?.`)
* 2. For `a?.b!`, the outermost chain is `a?.b` (`b` is the end of the chain starting at `a?.`)
* 3. For `(a?.b.c).d`, the outermost chain is `a?.b.c` (`c` is the end of the chain starting at `a?.` since parens end the chain)
* 4. For `a?.b.c?.d`, both `a?.b.c` and `a?.b.c?.d` are outermost (`c` is the end of the chain starting at `a?.`, and `d` is
* the end of the chain starting at `c?.`)
* 5. For `a?.(b?.c).d`, both `b?.c` and `a?.(b?.c)d` are outermost (`c` is the end of the chain starting at `b`, and `d` is
* the end of the chain starting at `a?.`)
*/
/* @internal */
function isOutermostOptionalChain(node) {
return !isOptionalChain(node.parent) // cases 1, 2, and 3
|| isOptionalChainRoot(node.parent) // case 4
|| node !== node.parent.expression; // case 5
}
ts.isOutermostOptionalChain = isOutermostOptionalChain;
function isNullishCoalesce(node) {
return node.kind === 219 /* BinaryExpression */ && node.operatorToken.kind === 60 /* QuestionQuestionToken */;
}
ts.isNullishCoalesce = isNullishCoalesce;
function isConstTypeReference(node) {
return ts.isTypeReferenceNode(node) && ts.isIdentifier(node.typeName) &&
node.typeName.escapedText === "const" && !node.typeArguments;
}
ts.isConstTypeReference = isConstTypeReference;
function skipPartiallyEmittedExpressions(node) {
return ts.skipOuterExpressions(node, 8 /* PartiallyEmittedExpressions */);
}
ts.skipPartiallyEmittedExpressions = skipPartiallyEmittedExpressions;
function isNonNullChain(node) {
return ts.isNonNullExpression(node) && !!(node.flags & 32 /* OptionalChain */);
}
ts.isNonNullChain = isNonNullChain;
function isBreakOrContinueStatement(node) {
return node.kind === 244 /* BreakStatement */ || node.kind === 243 /* ContinueStatement */;
}
ts.isBreakOrContinueStatement = isBreakOrContinueStatement;
function isNamedExportBindings(node) {
return node.kind === 272 /* NamespaceExport */ || node.kind === 271 /* NamedExports */;
}
ts.isNamedExportBindings = isNamedExportBindings;
function isUnparsedTextLike(node) {
switch (node.kind) {
case 297 /* UnparsedText */:
case 298 /* UnparsedInternalText */:
return true;
default:
return false;
}
}
ts.isUnparsedTextLike = isUnparsedTextLike;
function isUnparsedNode(node) {
return isUnparsedTextLike(node) ||
node.kind === 295 /* UnparsedPrologue */ ||
node.kind === 299 /* UnparsedSyntheticReference */;
}
ts.isUnparsedNode = isUnparsedNode;
function isJSDocPropertyLikeTag(node) {
return node.kind === 342 /* JSDocPropertyTag */ || node.kind === 335 /* JSDocParameterTag */;
}
ts.isJSDocPropertyLikeTag = isJSDocPropertyLikeTag;
// #endregion
// #region
// Node tests
//
// All node tests in the following list should *not* reference parent pointers so that
// they may be used with transformations.
/* @internal */
function isNode(node) {
return isNodeKind(node.kind);
}
ts.isNode = isNode;
/* @internal */
function isNodeKind(kind) {
return kind >= 159 /* FirstNode */;
}
ts.isNodeKind = isNodeKind;
/**
* True if kind is of some token syntax kind.
* For example, this is true for an IfKeyword but not for an IfStatement.
* Literals are considered tokens, except TemplateLiteral, but does include TemplateHead/Middle/Tail.
*/
function isTokenKind(kind) {
return kind >= 0 /* FirstToken */ && kind <= 158 /* LastToken */;
}
ts.isTokenKind = isTokenKind;
/**
* True if node is of some token syntax kind.
* For example, this is true for an IfKeyword but not for an IfStatement.
* Literals are considered tokens, except TemplateLiteral, but does include TemplateHead/Middle/Tail.
*/
function isToken(n) {
return isTokenKind(n.kind);
}
ts.isToken = isToken;
// Node Arrays
/* @internal */
function isNodeArray(array) {
return array.hasOwnProperty("pos") && array.hasOwnProperty("end");
}
ts.isNodeArray = isNodeArray;
// Literals
/* @internal */
function isLiteralKind(kind) {
return 8 /* FirstLiteralToken */ <= kind && kind <= 14 /* LastLiteralToken */;
}
ts.isLiteralKind = isLiteralKind;
function isLiteralExpression(node) {
return isLiteralKind(node.kind);
}
ts.isLiteralExpression = isLiteralExpression;
// Pseudo-literals
/* @internal */
function isTemplateLiteralKind(kind) {
return 14 /* FirstTemplateToken */ <= kind && kind <= 17 /* LastTemplateToken */;
}
ts.isTemplateLiteralKind = isTemplateLiteralKind;
function isTemplateLiteralToken(node) {
return isTemplateLiteralKind(node.kind);
}
ts.isTemplateLiteralToken = isTemplateLiteralToken;
function isTemplateMiddleOrTemplateTail(node) {
var kind = node.kind;
return kind === 16 /* TemplateMiddle */
|| kind === 17 /* TemplateTail */;
}
ts.isTemplateMiddleOrTemplateTail = isTemplateMiddleOrTemplateTail;
function isImportOrExportSpecifier(node) {
return ts.isImportSpecifier(node) || ts.isExportSpecifier(node);
}
ts.isImportOrExportSpecifier = isImportOrExportSpecifier;
function isTypeOnlyImportOrExportDeclaration(node) {
switch (node.kind) {
case 268 /* ImportSpecifier */:
case 273 /* ExportSpecifier */:
return node.parent.parent.isTypeOnly;
case 266 /* NamespaceImport */:
return node.parent.isTypeOnly;
case 265 /* ImportClause */:
case 263 /* ImportEqualsDeclaration */:
return node.isTypeOnly;
default:
return false;
}
}
ts.isTypeOnlyImportOrExportDeclaration = isTypeOnlyImportOrExportDeclaration;
function isStringTextContainingNode(node) {
return node.kind === 10 /* StringLiteral */ || isTemplateLiteralKind(node.kind);
}
ts.isStringTextContainingNode = isStringTextContainingNode;
// Identifiers
/* @internal */
function isGeneratedIdentifier(node) {
return ts.isIdentifier(node) && (node.autoGenerateFlags & 7 /* KindMask */) > 0 /* None */;
}
ts.isGeneratedIdentifier = isGeneratedIdentifier;
// Private Identifiers
/*@internal*/
function isPrivateIdentifierClassElementDeclaration(node) {
return (ts.isPropertyDeclaration(node) || isMethodOrAccessor(node)) && ts.isPrivateIdentifier(node.name);
}
ts.isPrivateIdentifierClassElementDeclaration = isPrivateIdentifierClassElementDeclaration;
/*@internal*/
function isPrivateIdentifierPropertyAccessExpression(node) {
return ts.isPropertyAccessExpression(node) && ts.isPrivateIdentifier(node.name);
}
ts.isPrivateIdentifierPropertyAccessExpression = isPrivateIdentifierPropertyAccessExpression;
// Keywords
/* @internal */
function isModifierKind(token) {
switch (token) {
case 126 /* AbstractKeyword */:
case 130 /* AsyncKeyword */:
case 85 /* ConstKeyword */:
case 134 /* DeclareKeyword */:
case 88 /* DefaultKeyword */:
case 93 /* ExportKeyword */:
case 123 /* PublicKeyword */:
case 121 /* PrivateKeyword */:
case 122 /* ProtectedKeyword */:
case 143 /* ReadonlyKeyword */:
case 124 /* StaticKeyword */:
case 157 /* OverrideKeyword */:
return true;
}
return false;
}
ts.isModifierKind = isModifierKind;
/* @internal */
function isParameterPropertyModifier(kind) {
return !!(ts.modifierToFlag(kind) & 16476 /* ParameterPropertyModifier */);
}
ts.isParameterPropertyModifier = isParameterPropertyModifier;
/* @internal */
function isClassMemberModifier(idToken) {
return isParameterPropertyModifier(idToken) || idToken === 124 /* StaticKeyword */ || idToken === 157 /* OverrideKeyword */;
}
ts.isClassMemberModifier = isClassMemberModifier;
function isModifier(node) {
return isModifierKind(node.kind);
}
ts.isModifier = isModifier;
function isEntityName(node) {
var kind = node.kind;
return kind === 159 /* QualifiedName */
|| kind === 79 /* Identifier */;
}
ts.isEntityName = isEntityName;
function isPropertyName(node) {
var kind = node.kind;
return kind === 79 /* Identifier */
|| kind === 80 /* PrivateIdentifier */
|| kind === 10 /* StringLiteral */
|| kind === 8 /* NumericLiteral */
|| kind === 160 /* ComputedPropertyName */;
}
ts.isPropertyName = isPropertyName;
function isBindingName(node) {
var kind = node.kind;
return kind === 79 /* Identifier */
|| kind === 199 /* ObjectBindingPattern */
|| kind === 200 /* ArrayBindingPattern */;
}
ts.isBindingName = isBindingName;
// Functions
function isFunctionLike(node) {
return !!node && isFunctionLikeKind(node.kind);
}
ts.isFunctionLike = isFunctionLike;
/* @internal */
function isFunctionLikeOrClassStaticBlockDeclaration(node) {
return !!node && (isFunctionLikeKind(node.kind) || ts.isClassStaticBlockDeclaration(node));
}
ts.isFunctionLikeOrClassStaticBlockDeclaration = isFunctionLikeOrClassStaticBlockDeclaration;
/* @internal */
function isFunctionLikeDeclaration(node) {
return node && isFunctionLikeDeclarationKind(node.kind);
}
ts.isFunctionLikeDeclaration = isFunctionLikeDeclaration;
/* @internal */
function isBooleanLiteral(node) {
return node.kind === 110 /* TrueKeyword */ || node.kind === 95 /* FalseKeyword */;
}
ts.isBooleanLiteral = isBooleanLiteral;
function isFunctionLikeDeclarationKind(kind) {
switch (kind) {
case 254 /* FunctionDeclaration */:
case 167 /* MethodDeclaration */:
case 169 /* Constructor */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
return true;
default:
return false;
}
}
/* @internal */
function isFunctionLikeKind(kind) {
switch (kind) {
case 166 /* MethodSignature */:
case 172 /* CallSignature */:
case 318 /* JSDocSignature */:
case 173 /* ConstructSignature */:
case 174 /* IndexSignature */:
case 177 /* FunctionType */:
case 312 /* JSDocFunctionType */:
case 178 /* ConstructorType */:
return true;
default:
return isFunctionLikeDeclarationKind(kind);
}
}
ts.isFunctionLikeKind = isFunctionLikeKind;
/* @internal */
function isFunctionOrModuleBlock(node) {
return ts.isSourceFile(node) || ts.isModuleBlock(node) || ts.isBlock(node) && isFunctionLike(node.parent);
}
ts.isFunctionOrModuleBlock = isFunctionOrModuleBlock;
// Classes
function isClassElement(node) {
var kind = node.kind;
return kind === 169 /* Constructor */
|| kind === 165 /* PropertyDeclaration */
|| kind === 167 /* MethodDeclaration */
|| kind === 170 /* GetAccessor */
|| kind === 171 /* SetAccessor */
|| kind === 174 /* IndexSignature */
|| kind === 168 /* ClassStaticBlockDeclaration */
|| kind === 232 /* SemicolonClassElement */;
}
ts.isClassElement = isClassElement;
function isClassLike(node) {
return node && (node.kind === 255 /* ClassDeclaration */ || node.kind === 224 /* ClassExpression */);
}
ts.isClassLike = isClassLike;
function isAccessor(node) {
return node && (node.kind === 170 /* GetAccessor */ || node.kind === 171 /* SetAccessor */);
}
ts.isAccessor = isAccessor;
/* @internal */
function isMethodOrAccessor(node) {
switch (node.kind) {
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return true;
default:
return false;
}
}
ts.isMethodOrAccessor = isMethodOrAccessor;
// Type members
function isTypeElement(node) {
var kind = node.kind;
return kind === 173 /* ConstructSignature */
|| kind === 172 /* CallSignature */
|| kind === 164 /* PropertySignature */
|| kind === 166 /* MethodSignature */
|| kind === 174 /* IndexSignature */;
}
ts.isTypeElement = isTypeElement;
function isClassOrTypeElement(node) {
return isTypeElement(node) || isClassElement(node);
}
ts.isClassOrTypeElement = isClassOrTypeElement;
function isObjectLiteralElementLike(node) {
var kind = node.kind;
return kind === 291 /* PropertyAssignment */
|| kind === 292 /* ShorthandPropertyAssignment */
|| kind === 293 /* SpreadAssignment */
|| kind === 167 /* MethodDeclaration */
|| kind === 170 /* GetAccessor */
|| kind === 171 /* SetAccessor */;
}
ts.isObjectLiteralElementLike = isObjectLiteralElementLike;
// Type
/**
* Node test that determines whether a node is a valid type node.
* This differs from the `isPartOfTypeNode` function which determines whether a node is *part*
* of a TypeNode.
*/
function isTypeNode(node) {
return ts.isTypeNodeKind(node.kind);
}
ts.isTypeNode = isTypeNode;
function isFunctionOrConstructorTypeNode(node) {
switch (node.kind) {
case 177 /* FunctionType */:
case 178 /* ConstructorType */:
return true;
}
return false;
}
ts.isFunctionOrConstructorTypeNode = isFunctionOrConstructorTypeNode;
// Binding patterns
/* @internal */
function isBindingPattern(node) {
if (node) {
var kind = node.kind;
return kind === 200 /* ArrayBindingPattern */
|| kind === 199 /* ObjectBindingPattern */;
}
return false;
}
ts.isBindingPattern = isBindingPattern;
/* @internal */
function isAssignmentPattern(node) {
var kind = node.kind;
return kind === 202 /* ArrayLiteralExpression */
|| kind === 203 /* ObjectLiteralExpression */;
}
ts.isAssignmentPattern = isAssignmentPattern;
/* @internal */
function isArrayBindingElement(node) {
var kind = node.kind;
return kind === 201 /* BindingElement */
|| kind === 225 /* OmittedExpression */;
}
ts.isArrayBindingElement = isArrayBindingElement;
/**
* Determines whether the BindingOrAssignmentElement is a BindingElement-like declaration
*/
/* @internal */
function isDeclarationBindingElement(bindingElement) {
switch (bindingElement.kind) {
case 252 /* VariableDeclaration */:
case 162 /* Parameter */:
case 201 /* BindingElement */:
return true;
}
return false;
}
ts.isDeclarationBindingElement = isDeclarationBindingElement;
/**
* Determines whether a node is a BindingOrAssignmentPattern
*/
/* @internal */
function isBindingOrAssignmentPattern(node) {
return isObjectBindingOrAssignmentPattern(node)
|| isArrayBindingOrAssignmentPattern(node);
}
ts.isBindingOrAssignmentPattern = isBindingOrAssignmentPattern;
/**
* Determines whether a node is an ObjectBindingOrAssignmentPattern
*/
/* @internal */
function isObjectBindingOrAssignmentPattern(node) {
switch (node.kind) {
case 199 /* ObjectBindingPattern */:
case 203 /* ObjectLiteralExpression */:
return true;
}
return false;
}
ts.isObjectBindingOrAssignmentPattern = isObjectBindingOrAssignmentPattern;
/* @internal */
function isObjectBindingOrAssignmentElement(node) {
switch (node.kind) {
case 201 /* BindingElement */:
case 291 /* PropertyAssignment */: // AssignmentProperty
case 292 /* ShorthandPropertyAssignment */: // AssignmentProperty
case 293 /* SpreadAssignment */: // AssignmentRestProperty
return true;
}
return false;
}
ts.isObjectBindingOrAssignmentElement = isObjectBindingOrAssignmentElement;
/**
* Determines whether a node is an ArrayBindingOrAssignmentPattern
*/
/* @internal */
function isArrayBindingOrAssignmentPattern(node) {
switch (node.kind) {
case 200 /* ArrayBindingPattern */:
case 202 /* ArrayLiteralExpression */:
return true;
}
return false;
}
ts.isArrayBindingOrAssignmentPattern = isArrayBindingOrAssignmentPattern;
/* @internal */
function isPropertyAccessOrQualifiedNameOrImportTypeNode(node) {
var kind = node.kind;
return kind === 204 /* PropertyAccessExpression */
|| kind === 159 /* QualifiedName */
|| kind === 198 /* ImportType */;
}
ts.isPropertyAccessOrQualifiedNameOrImportTypeNode = isPropertyAccessOrQualifiedNameOrImportTypeNode;
// Expression
function isPropertyAccessOrQualifiedName(node) {
var kind = node.kind;
return kind === 204 /* PropertyAccessExpression */
|| kind === 159 /* QualifiedName */;
}
ts.isPropertyAccessOrQualifiedName = isPropertyAccessOrQualifiedName;
function isCallLikeExpression(node) {
switch (node.kind) {
case 278 /* JsxOpeningElement */:
case 277 /* JsxSelfClosingElement */:
case 206 /* CallExpression */:
case 207 /* NewExpression */:
case 208 /* TaggedTemplateExpression */:
case 163 /* Decorator */:
return true;
default:
return false;
}
}
ts.isCallLikeExpression = isCallLikeExpression;
function isCallOrNewExpression(node) {
return node.kind === 206 /* CallExpression */ || node.kind === 207 /* NewExpression */;
}
ts.isCallOrNewExpression = isCallOrNewExpression;
function isTemplateLiteral(node) {
var kind = node.kind;
return kind === 221 /* TemplateExpression */
|| kind === 14 /* NoSubstitutionTemplateLiteral */;
}
ts.isTemplateLiteral = isTemplateLiteral;
/* @internal */
function isLeftHandSideExpression(node) {
return isLeftHandSideExpressionKind(skipPartiallyEmittedExpressions(node).kind);
}
ts.isLeftHandSideExpression = isLeftHandSideExpression;
function isLeftHandSideExpressionKind(kind) {
switch (kind) {
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
case 207 /* NewExpression */:
case 206 /* CallExpression */:
case 276 /* JsxElement */:
case 277 /* JsxSelfClosingElement */:
case 280 /* JsxFragment */:
case 208 /* TaggedTemplateExpression */:
case 202 /* ArrayLiteralExpression */:
case 210 /* ParenthesizedExpression */:
case 203 /* ObjectLiteralExpression */:
case 224 /* ClassExpression */:
case 211 /* FunctionExpression */:
case 79 /* Identifier */:
case 13 /* RegularExpressionLiteral */:
case 8 /* NumericLiteral */:
case 9 /* BigIntLiteral */:
case 10 /* StringLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
case 221 /* TemplateExpression */:
case 95 /* FalseKeyword */:
case 104 /* NullKeyword */:
case 108 /* ThisKeyword */:
case 110 /* TrueKeyword */:
case 106 /* SuperKeyword */:
case 228 /* NonNullExpression */:
case 229 /* MetaProperty */:
case 100 /* ImportKeyword */: // technically this is only an Expression if it's in a CallExpression
return true;
default:
return false;
}
}
/* @internal */
function isUnaryExpression(node) {
return isUnaryExpressionKind(skipPartiallyEmittedExpressions(node).kind);
}
ts.isUnaryExpression = isUnaryExpression;
function isUnaryExpressionKind(kind) {
switch (kind) {
case 217 /* PrefixUnaryExpression */:
case 218 /* PostfixUnaryExpression */:
case 213 /* DeleteExpression */:
case 214 /* TypeOfExpression */:
case 215 /* VoidExpression */:
case 216 /* AwaitExpression */:
case 209 /* TypeAssertionExpression */:
return true;
default:
return isLeftHandSideExpressionKind(kind);
}
}
/* @internal */
function isUnaryExpressionWithWrite(expr) {
switch (expr.kind) {
case 218 /* PostfixUnaryExpression */:
return true;
case 217 /* PrefixUnaryExpression */:
return expr.operator === 45 /* PlusPlusToken */ ||
expr.operator === 46 /* MinusMinusToken */;
default:
return false;
}
}
ts.isUnaryExpressionWithWrite = isUnaryExpressionWithWrite;
/* @internal */
/**
* Determines whether a node is an expression based only on its kind.
* Use `isExpressionNode` if not in transforms.
*/
function isExpression(node) {
return isExpressionKind(skipPartiallyEmittedExpressions(node).kind);
}
ts.isExpression = isExpression;
function isExpressionKind(kind) {
switch (kind) {
case 220 /* ConditionalExpression */:
case 222 /* YieldExpression */:
case 212 /* ArrowFunction */:
case 219 /* BinaryExpression */:
case 223 /* SpreadElement */:
case 227 /* AsExpression */:
case 225 /* OmittedExpression */:
case 346 /* CommaListExpression */:
case 345 /* PartiallyEmittedExpression */:
return true;
default:
return isUnaryExpressionKind(kind);
}
}
function isAssertionExpression(node) {
var kind = node.kind;
return kind === 209 /* TypeAssertionExpression */
|| kind === 227 /* AsExpression */;
}
ts.isAssertionExpression = isAssertionExpression;
/* @internal */
function isNotEmittedOrPartiallyEmittedNode(node) {
return ts.isNotEmittedStatement(node)
|| ts.isPartiallyEmittedExpression(node);
}
ts.isNotEmittedOrPartiallyEmittedNode = isNotEmittedOrPartiallyEmittedNode;
function isIterationStatement(node, lookInLabeledStatements) {
switch (node.kind) {
case 240 /* ForStatement */:
case 241 /* ForInStatement */:
case 242 /* ForOfStatement */:
case 238 /* DoStatement */:
case 239 /* WhileStatement */:
return true;
case 248 /* LabeledStatement */:
return lookInLabeledStatements && isIterationStatement(node.statement, lookInLabeledStatements);
}
return false;
}
ts.isIterationStatement = isIterationStatement;
/* @internal */
function isScopeMarker(node) {
return ts.isExportAssignment(node) || ts.isExportDeclaration(node);
}
ts.isScopeMarker = isScopeMarker;
/* @internal */
function hasScopeMarker(statements) {
return ts.some(statements, isScopeMarker);
}
ts.hasScopeMarker = hasScopeMarker;
/* @internal */
function needsScopeMarker(result) {
return !ts.isAnyImportOrReExport(result) && !ts.isExportAssignment(result) && !ts.hasSyntacticModifier(result, 1 /* Export */) && !ts.isAmbientModule(result);
}
ts.needsScopeMarker = needsScopeMarker;
/* @internal */
function isExternalModuleIndicator(result) {
// Exported top-level member indicates moduleness
return ts.isAnyImportOrReExport(result) || ts.isExportAssignment(result) || ts.hasSyntacticModifier(result, 1 /* Export */);
}
ts.isExternalModuleIndicator = isExternalModuleIndicator;
/* @internal */
function isForInOrOfStatement(node) {
return node.kind === 241 /* ForInStatement */ || node.kind === 242 /* ForOfStatement */;
}
ts.isForInOrOfStatement = isForInOrOfStatement;
// Element
/* @internal */
function isConciseBody(node) {
return ts.isBlock(node)
|| isExpression(node);
}
ts.isConciseBody = isConciseBody;
/* @internal */
function isFunctionBody(node) {
return ts.isBlock(node);
}
ts.isFunctionBody = isFunctionBody;
/* @internal */
function isForInitializer(node) {
return ts.isVariableDeclarationList(node)
|| isExpression(node);
}
ts.isForInitializer = isForInitializer;
/* @internal */
function isModuleBody(node) {
var kind = node.kind;
return kind === 260 /* ModuleBlock */
|| kind === 259 /* ModuleDeclaration */
|| kind === 79 /* Identifier */;
}
ts.isModuleBody = isModuleBody;
/* @internal */
function isNamespaceBody(node) {
var kind = node.kind;
return kind === 260 /* ModuleBlock */
|| kind === 259 /* ModuleDeclaration */;
}
ts.isNamespaceBody = isNamespaceBody;
/* @internal */
function isJSDocNamespaceBody(node) {
var kind = node.kind;
return kind === 79 /* Identifier */
|| kind === 259 /* ModuleDeclaration */;
}
ts.isJSDocNamespaceBody = isJSDocNamespaceBody;
/* @internal */
function isNamedImportBindings(node) {
var kind = node.kind;
return kind === 267 /* NamedImports */
|| kind === 266 /* NamespaceImport */;
}
ts.isNamedImportBindings = isNamedImportBindings;
/* @internal */
function isModuleOrEnumDeclaration(node) {
return node.kind === 259 /* ModuleDeclaration */ || node.kind === 258 /* EnumDeclaration */;
}
ts.isModuleOrEnumDeclaration = isModuleOrEnumDeclaration;
function isDeclarationKind(kind) {
return kind === 212 /* ArrowFunction */
|| kind === 201 /* BindingElement */
|| kind === 255 /* ClassDeclaration */
|| kind === 224 /* ClassExpression */
|| kind === 168 /* ClassStaticBlockDeclaration */
|| kind === 169 /* Constructor */
|| kind === 258 /* EnumDeclaration */
|| kind === 294 /* EnumMember */
|| kind === 273 /* ExportSpecifier */
|| kind === 254 /* FunctionDeclaration */
|| kind === 211 /* FunctionExpression */
|| kind === 170 /* GetAccessor */
|| kind === 265 /* ImportClause */
|| kind === 263 /* ImportEqualsDeclaration */
|| kind === 268 /* ImportSpecifier */
|| kind === 256 /* InterfaceDeclaration */
|| kind === 283 /* JsxAttribute */
|| kind === 167 /* MethodDeclaration */
|| kind === 166 /* MethodSignature */
|| kind === 259 /* ModuleDeclaration */
|| kind === 262 /* NamespaceExportDeclaration */
|| kind === 266 /* NamespaceImport */
|| kind === 272 /* NamespaceExport */
|| kind === 162 /* Parameter */
|| kind === 291 /* PropertyAssignment */
|| kind === 165 /* PropertyDeclaration */
|| kind === 164 /* PropertySignature */
|| kind === 171 /* SetAccessor */
|| kind === 292 /* ShorthandPropertyAssignment */
|| kind === 257 /* TypeAliasDeclaration */
|| kind === 161 /* TypeParameter */
|| kind === 252 /* VariableDeclaration */
|| kind === 340 /* JSDocTypedefTag */
|| kind === 333 /* JSDocCallbackTag */
|| kind === 342 /* JSDocPropertyTag */;
}
function isDeclarationStatementKind(kind) {
return kind === 254 /* FunctionDeclaration */
|| kind === 274 /* MissingDeclaration */
|| kind === 255 /* ClassDeclaration */
|| kind === 256 /* InterfaceDeclaration */
|| kind === 257 /* TypeAliasDeclaration */
|| kind === 258 /* EnumDeclaration */
|| kind === 259 /* ModuleDeclaration */
|| kind === 264 /* ImportDeclaration */
|| kind === 263 /* ImportEqualsDeclaration */
|| kind === 270 /* ExportDeclaration */
|| kind === 269 /* ExportAssignment */
|| kind === 262 /* NamespaceExportDeclaration */;
}
function isStatementKindButNotDeclarationKind(kind) {
return kind === 244 /* BreakStatement */
|| kind === 243 /* ContinueStatement */
|| kind === 251 /* DebuggerStatement */
|| kind === 238 /* DoStatement */
|| kind === 236 /* ExpressionStatement */
|| kind === 234 /* EmptyStatement */
|| kind === 241 /* ForInStatement */
|| kind === 242 /* ForOfStatement */
|| kind === 240 /* ForStatement */
|| kind === 237 /* IfStatement */
|| kind === 248 /* LabeledStatement */
|| kind === 245 /* ReturnStatement */
|| kind === 247 /* SwitchStatement */
|| kind === 249 /* ThrowStatement */
|| kind === 250 /* TryStatement */
|| kind === 235 /* VariableStatement */
|| kind === 239 /* WhileStatement */
|| kind === 246 /* WithStatement */
|| kind === 344 /* NotEmittedStatement */
|| kind === 348 /* EndOfDeclarationMarker */
|| kind === 347 /* MergeDeclarationMarker */;
}
/* @internal */
function isDeclaration(node) {
if (node.kind === 161 /* TypeParameter */) {
return (node.parent && node.parent.kind !== 339 /* JSDocTemplateTag */) || ts.isInJSFile(node);
}
return isDeclarationKind(node.kind);
}
ts.isDeclaration = isDeclaration;
/* @internal */
function isDeclarationStatement(node) {
return isDeclarationStatementKind(node.kind);
}
ts.isDeclarationStatement = isDeclarationStatement;
/**
* Determines whether the node is a statement that is not also a declaration
*/
/* @internal */
function isStatementButNotDeclaration(node) {
return isStatementKindButNotDeclarationKind(node.kind);
}
ts.isStatementButNotDeclaration = isStatementButNotDeclaration;
/* @internal */
function isStatement(node) {
var kind = node.kind;
return isStatementKindButNotDeclarationKind(kind)
|| isDeclarationStatementKind(kind)
|| isBlockStatement(node);
}
ts.isStatement = isStatement;
function isBlockStatement(node) {
if (node.kind !== 233 /* Block */)
return false;
if (node.parent !== undefined) {
if (node.parent.kind === 250 /* TryStatement */ || node.parent.kind === 290 /* CatchClause */) {
return false;
}
}
return !ts.isFunctionBlock(node);
}
/**
* NOTE: This is similar to `isStatement` but does not access parent pointers.
*/
/* @internal */
function isStatementOrBlock(node) {
var kind = node.kind;
return isStatementKindButNotDeclarationKind(kind)
|| isDeclarationStatementKind(kind)
|| kind === 233 /* Block */;
}
ts.isStatementOrBlock = isStatementOrBlock;
// Module references
/* @internal */
function isModuleReference(node) {
var kind = node.kind;
return kind === 275 /* ExternalModuleReference */
|| kind === 159 /* QualifiedName */
|| kind === 79 /* Identifier */;
}
ts.isModuleReference = isModuleReference;
// JSX
/* @internal */
function isJsxTagNameExpression(node) {
var kind = node.kind;
return kind === 108 /* ThisKeyword */
|| kind === 79 /* Identifier */
|| kind === 204 /* PropertyAccessExpression */;
}
ts.isJsxTagNameExpression = isJsxTagNameExpression;
/* @internal */
function isJsxChild(node) {
var kind = node.kind;
return kind === 276 /* JsxElement */
|| kind === 286 /* JsxExpression */
|| kind === 277 /* JsxSelfClosingElement */
|| kind === 11 /* JsxText */
|| kind === 280 /* JsxFragment */;
}
ts.isJsxChild = isJsxChild;
/* @internal */
function isJsxAttributeLike(node) {
var kind = node.kind;
return kind === 283 /* JsxAttribute */
|| kind === 285 /* JsxSpreadAttribute */;
}
ts.isJsxAttributeLike = isJsxAttributeLike;
/* @internal */
function isStringLiteralOrJsxExpression(node) {
var kind = node.kind;
return kind === 10 /* StringLiteral */
|| kind === 286 /* JsxExpression */;
}
ts.isStringLiteralOrJsxExpression = isStringLiteralOrJsxExpression;
function isJsxOpeningLikeElement(node) {
var kind = node.kind;
return kind === 278 /* JsxOpeningElement */
|| kind === 277 /* JsxSelfClosingElement */;
}
ts.isJsxOpeningLikeElement = isJsxOpeningLikeElement;
// Clauses
function isCaseOrDefaultClause(node) {
var kind = node.kind;
return kind === 287 /* CaseClause */
|| kind === 288 /* DefaultClause */;
}
ts.isCaseOrDefaultClause = isCaseOrDefaultClause;
// JSDoc
/** True if node is of some JSDoc syntax kind. */
/* @internal */
function isJSDocNode(node) {
return node.kind >= 304 /* FirstJSDocNode */ && node.kind <= 342 /* LastJSDocNode */;
}
ts.isJSDocNode = isJSDocNode;
/** True if node is of a kind that may contain comment text. */
function isJSDocCommentContainingNode(node) {
return node.kind === 315 /* JSDocComment */
|| node.kind === 314 /* JSDocNamepathType */
|| node.kind === 316 /* JSDocText */
|| isJSDocLinkLike(node)
|| isJSDocTag(node)
|| ts.isJSDocTypeLiteral(node)
|| ts.isJSDocSignature(node);
}
ts.isJSDocCommentContainingNode = isJSDocCommentContainingNode;
// TODO: determine what this does before making it public.
/* @internal */
function isJSDocTag(node) {
return node.kind >= 322 /* FirstJSDocTagNode */ && node.kind <= 342 /* LastJSDocTagNode */;
}
ts.isJSDocTag = isJSDocTag;
function isSetAccessor(node) {
return node.kind === 171 /* SetAccessor */;
}
ts.isSetAccessor = isSetAccessor;
function isGetAccessor(node) {
return node.kind === 170 /* GetAccessor */;
}
ts.isGetAccessor = isGetAccessor;
/** True if has jsdoc nodes attached to it. */
/* @internal */
// TODO: GH#19856 Would like to return `node is Node & { jsDoc: JSDoc[] }` but it causes long compile times
function hasJSDocNodes(node) {
var jsDoc = node.jsDoc;
return !!jsDoc && jsDoc.length > 0;
}
ts.hasJSDocNodes = hasJSDocNodes;
/** True if has type node attached to it. */
/* @internal */
function hasType(node) {
return !!node.type;
}
ts.hasType = hasType;
/** True if has initializer node attached to it. */
/* @internal */
function hasInitializer(node) {
return !!node.initializer;
}
ts.hasInitializer = hasInitializer;
/** True if has initializer node attached to it. */
function hasOnlyExpressionInitializer(node) {
switch (node.kind) {
case 252 /* VariableDeclaration */:
case 162 /* Parameter */:
case 201 /* BindingElement */:
case 164 /* PropertySignature */:
case 165 /* PropertyDeclaration */:
case 291 /* PropertyAssignment */:
case 294 /* EnumMember */:
return true;
default:
return false;
}
}
ts.hasOnlyExpressionInitializer = hasOnlyExpressionInitializer;
function isObjectLiteralElement(node) {
return node.kind === 283 /* JsxAttribute */ || node.kind === 285 /* JsxSpreadAttribute */ || isObjectLiteralElementLike(node);
}
ts.isObjectLiteralElement = isObjectLiteralElement;
/* @internal */
function isTypeReferenceType(node) {
return node.kind === 176 /* TypeReference */ || node.kind === 226 /* ExpressionWithTypeArguments */;
}
ts.isTypeReferenceType = isTypeReferenceType;
var MAX_SMI_X86 = 1073741823;
/* @internal */
function guessIndentation(lines) {
var indentation = MAX_SMI_X86;
for (var _i = 0, lines_1 = lines; _i < lines_1.length; _i++) {
var line = lines_1[_i];
if (!line.length) {
continue;
}
var i = 0;
for (; i < line.length && i < indentation; i++) {
if (!ts.isWhiteSpaceLike(line.charCodeAt(i))) {
break;
}
}
if (i < indentation) {
indentation = i;
}
if (indentation === 0) {
return 0;
}
}
return indentation === MAX_SMI_X86 ? undefined : indentation;
}
ts.guessIndentation = guessIndentation;
function isStringLiteralLike(node) {
return node.kind === 10 /* StringLiteral */ || node.kind === 14 /* NoSubstitutionTemplateLiteral */;
}
ts.isStringLiteralLike = isStringLiteralLike;
function isJSDocLinkLike(node) {
return node.kind === 319 /* JSDocLink */ || node.kind === 320 /* JSDocLinkCode */ || node.kind === 321 /* JSDocLinkPlain */;
}
ts.isJSDocLinkLike = isJSDocLinkLike;
// #endregion
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
ts.resolvingEmptyArray = [];
ts.externalHelpersModuleNameText = "tslib";
ts.defaultMaximumTruncationLength = 160;
ts.noTruncationMaximumTruncationLength = 1000000;
function getDeclarationOfKind(symbol, kind) {
var declarations = symbol.declarations;
if (declarations) {
for (var _i = 0, declarations_1 = declarations; _i < declarations_1.length; _i++) {
var declaration = declarations_1[_i];
if (declaration.kind === kind) {
return declaration;
}
}
}
return undefined;
}
ts.getDeclarationOfKind = getDeclarationOfKind;
/**
* Create a new escaped identifier map.
* @deprecated Use `new Map<__String, T>()` instead.
*/
function createUnderscoreEscapedMap() {
return new ts.Map();
}
ts.createUnderscoreEscapedMap = createUnderscoreEscapedMap;
/**
* @deprecated Use `!!map?.size` instead
*/
function hasEntries(map) {
return !!map && !!map.size;
}
ts.hasEntries = hasEntries;
function createSymbolTable(symbols) {
var result = new ts.Map();
if (symbols) {
for (var _i = 0, symbols_1 = symbols; _i < symbols_1.length; _i++) {
var symbol = symbols_1[_i];
result.set(symbol.escapedName, symbol);
}
}
return result;
}
ts.createSymbolTable = createSymbolTable;
function isTransientSymbol(symbol) {
return (symbol.flags & 33554432 /* Transient */) !== 0;
}
ts.isTransientSymbol = isTransientSymbol;
var stringWriter = createSingleLineStringWriter();
function createSingleLineStringWriter() {
var str = "";
var writeText = function (text) { return str += text; };
return {
getText: function () { return str; },
write: writeText,
rawWrite: writeText,
writeKeyword: writeText,
writeOperator: writeText,
writePunctuation: writeText,
writeSpace: writeText,
writeStringLiteral: writeText,
writeLiteral: writeText,
writeParameter: writeText,
writeProperty: writeText,
writeSymbol: function (s, _) { return writeText(s); },
writeTrailingSemicolon: writeText,
writeComment: writeText,
getTextPos: function () { return str.length; },
getLine: function () { return 0; },
getColumn: function () { return 0; },
getIndent: function () { return 0; },
isAtStartOfLine: function () { return false; },
hasTrailingComment: function () { return false; },
hasTrailingWhitespace: function () { return !!str.length && ts.isWhiteSpaceLike(str.charCodeAt(str.length - 1)); },
// Completely ignore indentation for string writers. And map newlines to
// a single space.
writeLine: function () { return str += " "; },
increaseIndent: ts.noop,
decreaseIndent: ts.noop,
clear: function () { return str = ""; },
trackSymbol: function () { return false; },
reportInaccessibleThisError: ts.noop,
reportInaccessibleUniqueSymbolError: ts.noop,
reportPrivateInBaseOfClassExpression: ts.noop,
};
}
function changesAffectModuleResolution(oldOptions, newOptions) {
return oldOptions.configFilePath !== newOptions.configFilePath ||
optionsHaveModuleResolutionChanges(oldOptions, newOptions);
}
ts.changesAffectModuleResolution = changesAffectModuleResolution;
function optionsHaveModuleResolutionChanges(oldOptions, newOptions) {
return optionsHaveChanges(oldOptions, newOptions, ts.moduleResolutionOptionDeclarations);
}
ts.optionsHaveModuleResolutionChanges = optionsHaveModuleResolutionChanges;
function changesAffectingProgramStructure(oldOptions, newOptions) {
return optionsHaveChanges(oldOptions, newOptions, ts.optionsAffectingProgramStructure);
}
ts.changesAffectingProgramStructure = changesAffectingProgramStructure;
function optionsHaveChanges(oldOptions, newOptions, optionDeclarations) {
return oldOptions !== newOptions && optionDeclarations.some(function (o) {
return !isJsonEqual(getCompilerOptionValue(oldOptions, o), getCompilerOptionValue(newOptions, o));
});
}
ts.optionsHaveChanges = optionsHaveChanges;
function forEachAncestor(node, callback) {
while (true) {
var res = callback(node);
if (res === "quit")
return undefined;
if (res !== undefined)
return res;
if (ts.isSourceFile(node))
return undefined;
node = node.parent;
}
}
ts.forEachAncestor = forEachAncestor;
/**
* Calls `callback` for each entry in the map, returning the first truthy result.
* Use `map.forEach` instead for normal iteration.
*/
function forEachEntry(map, callback) {
var iterator = map.entries();
for (var iterResult = iterator.next(); !iterResult.done; iterResult = iterator.next()) {
var _a = iterResult.value, key = _a[0], value = _a[1];
var result = callback(value, key);
if (result) {
return result;
}
}
return undefined;
}
ts.forEachEntry = forEachEntry;
/** `forEachEntry` for just keys. */
function forEachKey(map, callback) {
var iterator = map.keys();
for (var iterResult = iterator.next(); !iterResult.done; iterResult = iterator.next()) {
var result = callback(iterResult.value);
if (result) {
return result;
}
}
return undefined;
}
ts.forEachKey = forEachKey;
/** Copy entries from `source` to `target`. */
function copyEntries(source, target) {
source.forEach(function (value, key) {
target.set(key, value);
});
}
ts.copyEntries = copyEntries;
function usingSingleLineStringWriter(action) {
var oldString = stringWriter.getText();
try {
action(stringWriter);
return stringWriter.getText();
}
finally {
stringWriter.clear();
stringWriter.writeKeyword(oldString);
}
}
ts.usingSingleLineStringWriter = usingSingleLineStringWriter;
function getFullWidth(node) {
return node.end - node.pos;
}
ts.getFullWidth = getFullWidth;
function getResolvedModule(sourceFile, moduleNameText) {
return sourceFile && sourceFile.resolvedModules && sourceFile.resolvedModules.get(moduleNameText);
}
ts.getResolvedModule = getResolvedModule;
function setResolvedModule(sourceFile, moduleNameText, resolvedModule) {
if (!sourceFile.resolvedModules) {
sourceFile.resolvedModules = new ts.Map();
}
sourceFile.resolvedModules.set(moduleNameText, resolvedModule);
}
ts.setResolvedModule = setResolvedModule;
function setResolvedTypeReferenceDirective(sourceFile, typeReferenceDirectiveName, resolvedTypeReferenceDirective) {
if (!sourceFile.resolvedTypeReferenceDirectiveNames) {
sourceFile.resolvedTypeReferenceDirectiveNames = new ts.Map();
}
sourceFile.resolvedTypeReferenceDirectiveNames.set(typeReferenceDirectiveName, resolvedTypeReferenceDirective);
}
ts.setResolvedTypeReferenceDirective = setResolvedTypeReferenceDirective;
function projectReferenceIsEqualTo(oldRef, newRef) {
return oldRef.path === newRef.path &&
!oldRef.prepend === !newRef.prepend &&
!oldRef.circular === !newRef.circular;
}
ts.projectReferenceIsEqualTo = projectReferenceIsEqualTo;
function moduleResolutionIsEqualTo(oldResolution, newResolution) {
return oldResolution.isExternalLibraryImport === newResolution.isExternalLibraryImport &&
oldResolution.extension === newResolution.extension &&
oldResolution.resolvedFileName === newResolution.resolvedFileName &&
oldResolution.originalPath === newResolution.originalPath &&
packageIdIsEqual(oldResolution.packageId, newResolution.packageId);
}
ts.moduleResolutionIsEqualTo = moduleResolutionIsEqualTo;
function packageIdIsEqual(a, b) {
return a === b || !!a && !!b && a.name === b.name && a.subModuleName === b.subModuleName && a.version === b.version;
}
function packageIdToString(_a) {
var name = _a.name, subModuleName = _a.subModuleName, version = _a.version;
var fullName = subModuleName ? name + "/" + subModuleName : name;
return fullName + "@" + version;
}
ts.packageIdToString = packageIdToString;
function typeDirectiveIsEqualTo(oldResolution, newResolution) {
return oldResolution.resolvedFileName === newResolution.resolvedFileName
&& oldResolution.primary === newResolution.primary
&& oldResolution.originalPath === newResolution.originalPath;
}
ts.typeDirectiveIsEqualTo = typeDirectiveIsEqualTo;
function hasChangesInResolutions(names, newResolutions, oldResolutions, comparer) {
ts.Debug.assert(names.length === newResolutions.length);
for (var i = 0; i < names.length; i++) {
var newResolution = newResolutions[i];
var oldResolution = oldResolutions && oldResolutions.get(names[i]);
var changed = oldResolution
? !newResolution || !comparer(oldResolution, newResolution)
: newResolution;
if (changed) {
return true;
}
}
return false;
}
ts.hasChangesInResolutions = hasChangesInResolutions;
// Returns true if this node contains a parse error anywhere underneath it.
function containsParseError(node) {
aggregateChildData(node);
return (node.flags & 262144 /* ThisNodeOrAnySubNodesHasError */) !== 0;
}
ts.containsParseError = containsParseError;
function aggregateChildData(node) {
if (!(node.flags & 524288 /* HasAggregatedChildData */)) {
// A node is considered to contain a parse error if:
// a) the parser explicitly marked that it had an error
// b) any of it's children reported that it had an error.
var thisNodeOrAnySubNodesHasError = ((node.flags & 65536 /* ThisNodeHasError */) !== 0) ||
ts.forEachChild(node, containsParseError);
// If so, mark ourselves accordingly.
if (thisNodeOrAnySubNodesHasError) {
node.flags |= 262144 /* ThisNodeOrAnySubNodesHasError */;
}
// Also mark that we've propagated the child information to this node. This way we can
// always consult the bit directly on this node without needing to check its children
// again.
node.flags |= 524288 /* HasAggregatedChildData */;
}
}
function getSourceFileOfNode(node) {
while (node && node.kind !== 300 /* SourceFile */) {
node = node.parent;
}
return node;
}
ts.getSourceFileOfNode = getSourceFileOfNode;
function getSourceFileOfModule(module) {
return getSourceFileOfNode(module.valueDeclaration || getNonAugmentationDeclaration(module));
}
ts.getSourceFileOfModule = getSourceFileOfModule;
function isStatementWithLocals(node) {
switch (node.kind) {
case 233 /* Block */:
case 261 /* CaseBlock */:
case 240 /* ForStatement */:
case 241 /* ForInStatement */:
case 242 /* ForOfStatement */:
return true;
}
return false;
}
ts.isStatementWithLocals = isStatementWithLocals;
function getStartPositionOfLine(line, sourceFile) {
ts.Debug.assert(line >= 0);
return ts.getLineStarts(sourceFile)[line];
}
ts.getStartPositionOfLine = getStartPositionOfLine;
// This is a useful function for debugging purposes.
function nodePosToString(node) {
var file = getSourceFileOfNode(node);
var loc = ts.getLineAndCharacterOfPosition(file, node.pos);
return file.fileName + "(" + (loc.line + 1) + "," + (loc.character + 1) + ")";
}
ts.nodePosToString = nodePosToString;
function getEndLinePosition(line, sourceFile) {
ts.Debug.assert(line >= 0);
var lineStarts = ts.getLineStarts(sourceFile);
var lineIndex = line;
var sourceText = sourceFile.text;
if (lineIndex + 1 === lineStarts.length) {
// last line - return EOF
return sourceText.length - 1;
}
else {
// current line start
var start = lineStarts[lineIndex];
// take the start position of the next line - 1 = it should be some line break
var pos = lineStarts[lineIndex + 1] - 1;
ts.Debug.assert(ts.isLineBreak(sourceText.charCodeAt(pos)));
// walk backwards skipping line breaks, stop the the beginning of current line.
// i.e:
// <some text>
// $ <- end of line for this position should match the start position
while (start <= pos && ts.isLineBreak(sourceText.charCodeAt(pos))) {
pos--;
}
return pos;
}
}
ts.getEndLinePosition = getEndLinePosition;
/**
* Returns a value indicating whether a name is unique globally or within the current file.
* Note: This does not consider whether a name appears as a free identifier or not, so at the expression `x.y` this includes both `x` and `y`.
*/
function isFileLevelUniqueName(sourceFile, name, hasGlobalName) {
return !(hasGlobalName && hasGlobalName(name)) && !sourceFile.identifiers.has(name);
}
ts.isFileLevelUniqueName = isFileLevelUniqueName;
// Returns true if this node is missing from the actual source code. A 'missing' node is different
// from 'undefined/defined'. When a node is undefined (which can happen for optional nodes
// in the tree), it is definitely missing. However, a node may be defined, but still be
// missing. This happens whenever the parser knows it needs to parse something, but can't
// get anything in the source code that it expects at that location. For example:
//
// let a: ;
//
// Here, the Type in the Type-Annotation is not-optional (as there is a colon in the source
// code). So the parser will attempt to parse out a type, and will create an actual node.
// However, this node will be 'missing' in the sense that no actual source-code/tokens are
// contained within it.
function nodeIsMissing(node) {
if (node === undefined) {
return true;
}
return node.pos === node.end && node.pos >= 0 && node.kind !== 1 /* EndOfFileToken */;
}
ts.nodeIsMissing = nodeIsMissing;
function nodeIsPresent(node) {
return !nodeIsMissing(node);
}
ts.nodeIsPresent = nodeIsPresent;
function insertStatementsAfterPrologue(to, from, isPrologueDirective) {
if (from === undefined || from.length === 0)
return to;
var statementIndex = 0;
// skip all prologue directives to insert at the correct position
for (; statementIndex < to.length; ++statementIndex) {
if (!isPrologueDirective(to[statementIndex])) {
break;
}
}
to.splice.apply(to, __spreadArray([statementIndex, 0], from, false));
return to;
}
function insertStatementAfterPrologue(to, statement, isPrologueDirective) {
if (statement === undefined)
return to;
var statementIndex = 0;
// skip all prologue directives to insert at the correct position
for (; statementIndex < to.length; ++statementIndex) {
if (!isPrologueDirective(to[statementIndex])) {
break;
}
}
to.splice(statementIndex, 0, statement);
return to;
}
function isAnyPrologueDirective(node) {
return isPrologueDirective(node) || !!(getEmitFlags(node) & 1048576 /* CustomPrologue */);
}
/**
* Prepends statements to an array while taking care of prologue directives.
*/
function insertStatementsAfterStandardPrologue(to, from) {
return insertStatementsAfterPrologue(to, from, isPrologueDirective);
}
ts.insertStatementsAfterStandardPrologue = insertStatementsAfterStandardPrologue;
function insertStatementsAfterCustomPrologue(to, from) {
return insertStatementsAfterPrologue(to, from, isAnyPrologueDirective);
}
ts.insertStatementsAfterCustomPrologue = insertStatementsAfterCustomPrologue;
/**
* Prepends statements to an array while taking care of prologue directives.
*/
function insertStatementAfterStandardPrologue(to, statement) {
return insertStatementAfterPrologue(to, statement, isPrologueDirective);
}
ts.insertStatementAfterStandardPrologue = insertStatementAfterStandardPrologue;
function insertStatementAfterCustomPrologue(to, statement) {
return insertStatementAfterPrologue(to, statement, isAnyPrologueDirective);
}
ts.insertStatementAfterCustomPrologue = insertStatementAfterCustomPrologue;
/**
* Determine if the given comment is a triple-slash
*
* @return true if the comment is a triple-slash comment else false
*/
function isRecognizedTripleSlashComment(text, commentPos, commentEnd) {
// Verify this is /// comment, but do the regexp match only when we first can find /// in the comment text
// so that we don't end up computing comment string and doing match for all // comments
if (text.charCodeAt(commentPos + 1) === 47 /* slash */ &&
commentPos + 2 < commentEnd &&
text.charCodeAt(commentPos + 2) === 47 /* slash */) {
var textSubStr = text.substring(commentPos, commentEnd);
return ts.fullTripleSlashReferencePathRegEx.test(textSubStr) ||
ts.fullTripleSlashAMDReferencePathRegEx.test(textSubStr) ||
fullTripleSlashReferenceTypeReferenceDirectiveRegEx.test(textSubStr) ||
defaultLibReferenceRegEx.test(textSubStr) ?
true : false;
}
return false;
}
ts.isRecognizedTripleSlashComment = isRecognizedTripleSlashComment;
function isPinnedComment(text, start) {
return text.charCodeAt(start + 1) === 42 /* asterisk */ &&
text.charCodeAt(start + 2) === 33 /* exclamation */;
}
ts.isPinnedComment = isPinnedComment;
function createCommentDirectivesMap(sourceFile, commentDirectives) {
var directivesByLine = new ts.Map(commentDirectives.map(function (commentDirective) { return ([
"" + ts.getLineAndCharacterOfPosition(sourceFile, commentDirective.range.end).line,
commentDirective,
]); }));
var usedLines = new ts.Map();
return { getUnusedExpectations: getUnusedExpectations, markUsed: markUsed };
function getUnusedExpectations() {
return ts.arrayFrom(directivesByLine.entries())
.filter(function (_a) {
var line = _a[0], directive = _a[1];
return directive.type === 0 /* ExpectError */ && !usedLines.get(line);
})
.map(function (_a) {
var _ = _a[0], directive = _a[1];
return directive;
});
}
function markUsed(line) {
if (!directivesByLine.has("" + line)) {
return false;
}
usedLines.set("" + line, true);
return true;
}
}
ts.createCommentDirectivesMap = createCommentDirectivesMap;
function getTokenPosOfNode(node, sourceFile, includeJsDoc) {
// With nodes that have no width (i.e. 'Missing' nodes), we actually *don't*
// want to skip trivia because this will launch us forward to the next token.
if (nodeIsMissing(node)) {
return node.pos;
}
if (ts.isJSDocNode(node) || node.kind === 11 /* JsxText */) {
// JsxText cannot actually contain comments, even though the scanner will think it sees comments
return ts.skipTrivia((sourceFile || getSourceFileOfNode(node)).text, node.pos, /*stopAfterLineBreak*/ false, /*stopAtComments*/ true);
}
if (includeJsDoc && ts.hasJSDocNodes(node)) {
return getTokenPosOfNode(node.jsDoc[0], sourceFile);
}
// For a syntax list, it is possible that one of its children has JSDocComment nodes, while
// the syntax list itself considers them as normal trivia. Therefore if we simply skip
// trivia for the list, we may have skipped the JSDocComment as well. So we should process its
// first child to determine the actual position of its first token.
if (node.kind === 343 /* SyntaxList */ && node._children.length > 0) {
return getTokenPosOfNode(node._children[0], sourceFile, includeJsDoc);
}
return ts.skipTrivia((sourceFile || getSourceFileOfNode(node)).text, node.pos,
/*stopAfterLineBreak*/ false,
/*stopAtComments*/ false, isInJSDoc(node));
}
ts.getTokenPosOfNode = getTokenPosOfNode;
function getNonDecoratorTokenPosOfNode(node, sourceFile) {
if (nodeIsMissing(node) || !node.decorators) {
return getTokenPosOfNode(node, sourceFile);
}
return ts.skipTrivia((sourceFile || getSourceFileOfNode(node)).text, node.decorators.end);
}
ts.getNonDecoratorTokenPosOfNode = getNonDecoratorTokenPosOfNode;
function getSourceTextOfNodeFromSourceFile(sourceFile, node, includeTrivia) {
if (includeTrivia === void 0) { includeTrivia = false; }
return getTextOfNodeFromSourceText(sourceFile.text, node, includeTrivia);
}
ts.getSourceTextOfNodeFromSourceFile = getSourceTextOfNodeFromSourceFile;
function isJSDocTypeExpressionOrChild(node) {
return !!ts.findAncestor(node, ts.isJSDocTypeExpression);
}
function isExportNamespaceAsDefaultDeclaration(node) {
return !!(ts.isExportDeclaration(node) && node.exportClause && ts.isNamespaceExport(node.exportClause) && node.exportClause.name.escapedText === "default");
}
ts.isExportNamespaceAsDefaultDeclaration = isExportNamespaceAsDefaultDeclaration;
function getTextOfNodeFromSourceText(sourceText, node, includeTrivia) {
if (includeTrivia === void 0) { includeTrivia = false; }
if (nodeIsMissing(node)) {
return "";
}
var text = sourceText.substring(includeTrivia ? node.pos : ts.skipTrivia(sourceText, node.pos), node.end);
if (isJSDocTypeExpressionOrChild(node)) {
// strip space + asterisk at line start
text = text.split(/\r\n|\n|\r/).map(function (line) { return ts.trimStringStart(line.replace(/^\s*\*/, "")); }).join("\n");
}
return text;
}
ts.getTextOfNodeFromSourceText = getTextOfNodeFromSourceText;
function getTextOfNode(node, includeTrivia) {
if (includeTrivia === void 0) { includeTrivia = false; }
return getSourceTextOfNodeFromSourceFile(getSourceFileOfNode(node), node, includeTrivia);
}
ts.getTextOfNode = getTextOfNode;
function getPos(range) {
return range.pos;
}
/**
* Note: it is expected that the `nodeArray` and the `node` are within the same file.
* For example, searching for a `SourceFile` in a `SourceFile[]` wouldn't work.
*/
function indexOfNode(nodeArray, node) {
return ts.binarySearch(nodeArray, node, getPos, ts.compareValues);
}
ts.indexOfNode = indexOfNode;
/**
* Gets flags that control emit behavior of a node.
*/
function getEmitFlags(node) {
var emitNode = node.emitNode;
return emitNode && emitNode.flags || 0;
}
ts.getEmitFlags = getEmitFlags;
;
function getScriptTargetFeatures() {
return {
es2015: {
Array: ["find", "findIndex", "fill", "copyWithin", "entries", "keys", "values"],
RegExp: ["flags", "sticky", "unicode"],
Reflect: ["apply", "construct", "defineProperty", "deleteProperty", "get", " getOwnPropertyDescriptor", "getPrototypeOf", "has", "isExtensible", "ownKeys", "preventExtensions", "set", "setPrototypeOf"],
ArrayConstructor: ["from", "of"],
ObjectConstructor: ["assign", "getOwnPropertySymbols", "keys", "is", "setPrototypeOf"],
NumberConstructor: ["isFinite", "isInteger", "isNaN", "isSafeInteger", "parseFloat", "parseInt"],
Math: ["clz32", "imul", "sign", "log10", "log2", "log1p", "expm1", "cosh", "sinh", "tanh", "acosh", "asinh", "atanh", "hypot", "trunc", "fround", "cbrt"],
Map: ["entries", "keys", "values"],
Set: ["entries", "keys", "values"],
Promise: ts.emptyArray,
PromiseConstructor: ["all", "race", "reject", "resolve"],
Symbol: ["for", "keyFor"],
WeakMap: ["entries", "keys", "values"],
WeakSet: ["entries", "keys", "values"],
Iterator: ts.emptyArray,
AsyncIterator: ts.emptyArray,
String: ["codePointAt", "includes", "endsWith", "normalize", "repeat", "startsWith", "anchor", "big", "blink", "bold", "fixed", "fontcolor", "fontsize", "italics", "link", "small", "strike", "sub", "sup"],
StringConstructor: ["fromCodePoint", "raw"]
},
es2016: {
Array: ["includes"]
},
es2017: {
Atomics: ts.emptyArray,
SharedArrayBuffer: ts.emptyArray,
String: ["padStart", "padEnd"],
ObjectConstructor: ["values", "entries", "getOwnPropertyDescriptors"],
DateTimeFormat: ["formatToParts"]
},
es2018: {
Promise: ["finally"],
RegExpMatchArray: ["groups"],
RegExpExecArray: ["groups"],
RegExp: ["dotAll"],
Intl: ["PluralRules"],
AsyncIterable: ts.emptyArray,
AsyncIterableIterator: ts.emptyArray,
AsyncGenerator: ts.emptyArray,
AsyncGeneratorFunction: ts.emptyArray,
},
es2019: {
Array: ["flat", "flatMap"],
ObjectConstructor: ["fromEntries"],
String: ["trimStart", "trimEnd", "trimLeft", "trimRight"],
Symbol: ["description"]
},
es2020: {
BigInt: ts.emptyArray,
BigInt64Array: ts.emptyArray,
BigUint64Array: ts.emptyArray,
PromiseConstructor: ["allSettled"],
SymbolConstructor: ["matchAll"],
String: ["matchAll"],
DataView: ["setBigInt64", "setBigUint64", "getBigInt64", "getBigUint64"],
RelativeTimeFormat: ["format", "formatToParts", "resolvedOptions"]
},
es2021: {
PromiseConstructor: ["any"],
String: ["replaceAll"]
},
esnext: {
NumberFormat: ["formatToParts"]
}
};
}
ts.getScriptTargetFeatures = getScriptTargetFeatures;
var GetLiteralTextFlags;
(function (GetLiteralTextFlags) {
GetLiteralTextFlags[GetLiteralTextFlags["None"] = 0] = "None";
GetLiteralTextFlags[GetLiteralTextFlags["NeverAsciiEscape"] = 1] = "NeverAsciiEscape";
GetLiteralTextFlags[GetLiteralTextFlags["JsxAttributeEscape"] = 2] = "JsxAttributeEscape";
GetLiteralTextFlags[GetLiteralTextFlags["TerminateUnterminatedLiterals"] = 4] = "TerminateUnterminatedLiterals";
GetLiteralTextFlags[GetLiteralTextFlags["AllowNumericSeparator"] = 8] = "AllowNumericSeparator";
})(GetLiteralTextFlags = ts.GetLiteralTextFlags || (ts.GetLiteralTextFlags = {}));
function getLiteralText(node, sourceFile, flags) {
var _a;
// If we don't need to downlevel and we can reach the original source text using
// the node's parent reference, then simply get the text as it was originally written.
if (canUseOriginalText(node, flags)) {
return getSourceTextOfNodeFromSourceFile(sourceFile, node);
}
// If we can't reach the original source text, use the canonical form if it's a number,
// or a (possibly escaped) quoted form of the original text if it's string-like.
switch (node.kind) {
case 10 /* StringLiteral */: {
var escapeText = flags & 2 /* JsxAttributeEscape */ ? escapeJsxAttributeString :
flags & 1 /* NeverAsciiEscape */ || (getEmitFlags(node) & 16777216 /* NoAsciiEscaping */) ? escapeString :
escapeNonAsciiString;
if (node.singleQuote) {
return "'" + escapeText(node.text, 39 /* singleQuote */) + "'";
}
else {
return '"' + escapeText(node.text, 34 /* doubleQuote */) + '"';
}
}
case 14 /* NoSubstitutionTemplateLiteral */:
case 15 /* TemplateHead */:
case 16 /* TemplateMiddle */:
case 17 /* TemplateTail */: {
// If a NoSubstitutionTemplateLiteral appears to have a substitution in it, the original text
// had to include a backslash: `not \${a} substitution`.
var escapeText = flags & 1 /* NeverAsciiEscape */ || (getEmitFlags(node) & 16777216 /* NoAsciiEscaping */) ? escapeString :
escapeNonAsciiString;
var rawText = (_a = node.rawText) !== null && _a !== void 0 ? _a : escapeTemplateSubstitution(escapeText(node.text, 96 /* backtick */));
switch (node.kind) {
case 14 /* NoSubstitutionTemplateLiteral */:
return "`" + rawText + "`";
case 15 /* TemplateHead */:
return "`" + rawText + "${";
case 16 /* TemplateMiddle */:
return "}" + rawText + "${";
case 17 /* TemplateTail */:
return "}" + rawText + "`";
}
break;
}
case 8 /* NumericLiteral */:
case 9 /* BigIntLiteral */:
return node.text;
case 13 /* RegularExpressionLiteral */:
if (flags & 4 /* TerminateUnterminatedLiterals */ && node.isUnterminated) {
return node.text + (node.text.charCodeAt(node.text.length - 1) === 92 /* backslash */ ? " /" : "/");
}
return node.text;
}
return ts.Debug.fail("Literal kind '" + node.kind + "' not accounted for.");
}
ts.getLiteralText = getLiteralText;
function canUseOriginalText(node, flags) {
if (nodeIsSynthesized(node) || !node.parent || (flags & 4 /* TerminateUnterminatedLiterals */ && node.isUnterminated)) {
return false;
}
if (ts.isNumericLiteral(node) && node.numericLiteralFlags & 512 /* ContainsSeparator */) {
return !!(flags & 8 /* AllowNumericSeparator */);
}
return !ts.isBigIntLiteral(node);
}
function getTextOfConstantValue(value) {
return ts.isString(value) ? '"' + escapeNonAsciiString(value) + '"' : "" + value;
}
ts.getTextOfConstantValue = getTextOfConstantValue;
// Make an identifier from an external module name by extracting the string after the last "/" and replacing
// all non-alphanumeric characters with underscores
function makeIdentifierFromModuleName(moduleName) {
return ts.getBaseFileName(moduleName).replace(/^(\d)/, "_$1").replace(/\W/g, "_");
}
ts.makeIdentifierFromModuleName = makeIdentifierFromModuleName;
function isBlockOrCatchScoped(declaration) {
return (ts.getCombinedNodeFlags(declaration) & 3 /* BlockScoped */) !== 0 ||
isCatchClauseVariableDeclarationOrBindingElement(declaration);
}
ts.isBlockOrCatchScoped = isBlockOrCatchScoped;
function isCatchClauseVariableDeclarationOrBindingElement(declaration) {
var node = getRootDeclaration(declaration);
return node.kind === 252 /* VariableDeclaration */ && node.parent.kind === 290 /* CatchClause */;
}
ts.isCatchClauseVariableDeclarationOrBindingElement = isCatchClauseVariableDeclarationOrBindingElement;
function isAmbientModule(node) {
return ts.isModuleDeclaration(node) && (node.name.kind === 10 /* StringLiteral */ || isGlobalScopeAugmentation(node));
}
ts.isAmbientModule = isAmbientModule;
function isModuleWithStringLiteralName(node) {
return ts.isModuleDeclaration(node) && node.name.kind === 10 /* StringLiteral */;
}
ts.isModuleWithStringLiteralName = isModuleWithStringLiteralName;
function isNonGlobalAmbientModule(node) {
return ts.isModuleDeclaration(node) && ts.isStringLiteral(node.name);
}
ts.isNonGlobalAmbientModule = isNonGlobalAmbientModule;
/**
* An effective module (namespace) declaration is either
* 1. An actual declaration: namespace X { ... }
* 2. A Javascript declaration, which is:
* An identifier in a nested property access expression: Y in `X.Y.Z = { ... }`
*/
function isEffectiveModuleDeclaration(node) {
return ts.isModuleDeclaration(node) || ts.isIdentifier(node);
}
ts.isEffectiveModuleDeclaration = isEffectiveModuleDeclaration;
/** Given a symbol for a module, checks that it is a shorthand ambient module. */
function isShorthandAmbientModuleSymbol(moduleSymbol) {
return isShorthandAmbientModule(moduleSymbol.valueDeclaration);
}
ts.isShorthandAmbientModuleSymbol = isShorthandAmbientModuleSymbol;
function isShorthandAmbientModule(node) {
// The only kind of module that can be missing a body is a shorthand ambient module.
return !!node && node.kind === 259 /* ModuleDeclaration */ && (!node.body);
}
function isBlockScopedContainerTopLevel(node) {
return node.kind === 300 /* SourceFile */ ||
node.kind === 259 /* ModuleDeclaration */ ||
ts.isFunctionLikeOrClassStaticBlockDeclaration(node);
}
ts.isBlockScopedContainerTopLevel = isBlockScopedContainerTopLevel;
function isGlobalScopeAugmentation(module) {
return !!(module.flags & 1024 /* GlobalAugmentation */);
}
ts.isGlobalScopeAugmentation = isGlobalScopeAugmentation;
function isExternalModuleAugmentation(node) {
return isAmbientModule(node) && isModuleAugmentationExternal(node);
}
ts.isExternalModuleAugmentation = isExternalModuleAugmentation;
function isModuleAugmentationExternal(node) {
// external module augmentation is a ambient module declaration that is either:
// - defined in the top level scope and source file is an external module
// - defined inside ambient module declaration located in the top level scope and source file not an external module
switch (node.parent.kind) {
case 300 /* SourceFile */:
return ts.isExternalModule(node.parent);
case 260 /* ModuleBlock */:
return isAmbientModule(node.parent.parent) && ts.isSourceFile(node.parent.parent.parent) && !ts.isExternalModule(node.parent.parent.parent);
}
return false;
}
ts.isModuleAugmentationExternal = isModuleAugmentationExternal;
function getNonAugmentationDeclaration(symbol) {
var _a;
return (_a = symbol.declarations) === null || _a === void 0 ? void 0 : _a.find(function (d) { return !isExternalModuleAugmentation(d) && !(ts.isModuleDeclaration(d) && isGlobalScopeAugmentation(d)); });
}
ts.getNonAugmentationDeclaration = getNonAugmentationDeclaration;
function isEffectiveExternalModule(node, compilerOptions) {
return ts.isExternalModule(node) || compilerOptions.isolatedModules || ((getEmitModuleKind(compilerOptions) === ts.ModuleKind.CommonJS) && !!node.commonJsModuleIndicator);
}
ts.isEffectiveExternalModule = isEffectiveExternalModule;
/**
* Returns whether the source file will be treated as if it were in strict mode at runtime.
*/
function isEffectiveStrictModeSourceFile(node, compilerOptions) {
// We can only verify strict mode for JS/TS files
switch (node.scriptKind) {
case 1 /* JS */:
case 3 /* TS */:
case 2 /* JSX */:
case 4 /* TSX */:
break;
default:
return false;
}
// Strict mode does not matter for declaration files.
if (node.isDeclarationFile) {
return false;
}
// If `alwaysStrict` is set, then treat the file as strict.
if (getStrictOptionValue(compilerOptions, "alwaysStrict")) {
return true;
}
// Starting with a "use strict" directive indicates the file is strict.
if (ts.startsWithUseStrict(node.statements)) {
return true;
}
if (ts.isExternalModule(node) || compilerOptions.isolatedModules) {
// ECMAScript Modules are always strict.
if (getEmitModuleKind(compilerOptions) >= ts.ModuleKind.ES2015) {
return true;
}
// Other modules are strict unless otherwise specified.
return !compilerOptions.noImplicitUseStrict;
}
return false;
}
ts.isEffectiveStrictModeSourceFile = isEffectiveStrictModeSourceFile;
function isBlockScope(node, parentNode) {
switch (node.kind) {
case 300 /* SourceFile */:
case 261 /* CaseBlock */:
case 290 /* CatchClause */:
case 259 /* ModuleDeclaration */:
case 240 /* ForStatement */:
case 241 /* ForInStatement */:
case 242 /* ForOfStatement */:
case 169 /* Constructor */:
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
case 165 /* PropertyDeclaration */:
case 168 /* ClassStaticBlockDeclaration */:
return true;
case 233 /* Block */:
// function block is not considered block-scope container
// see comment in binder.ts: bind(...), case for SyntaxKind.Block
return !ts.isFunctionLikeOrClassStaticBlockDeclaration(parentNode);
}
return false;
}
ts.isBlockScope = isBlockScope;
function isDeclarationWithTypeParameters(node) {
switch (node.kind) {
case 333 /* JSDocCallbackTag */:
case 340 /* JSDocTypedefTag */:
case 318 /* JSDocSignature */:
return true;
default:
ts.assertType(node);
return isDeclarationWithTypeParameterChildren(node);
}
}
ts.isDeclarationWithTypeParameters = isDeclarationWithTypeParameters;
function isDeclarationWithTypeParameterChildren(node) {
switch (node.kind) {
case 172 /* CallSignature */:
case 173 /* ConstructSignature */:
case 166 /* MethodSignature */:
case 174 /* IndexSignature */:
case 177 /* FunctionType */:
case 178 /* ConstructorType */:
case 312 /* JSDocFunctionType */:
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
case 256 /* InterfaceDeclaration */:
case 257 /* TypeAliasDeclaration */:
case 339 /* JSDocTemplateTag */:
case 254 /* FunctionDeclaration */:
case 167 /* MethodDeclaration */:
case 169 /* Constructor */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
return true;
default:
ts.assertType(node);
return false;
}
}
ts.isDeclarationWithTypeParameterChildren = isDeclarationWithTypeParameterChildren;
function isAnyImportSyntax(node) {
switch (node.kind) {
case 264 /* ImportDeclaration */:
case 263 /* ImportEqualsDeclaration */:
return true;
default:
return false;
}
}
ts.isAnyImportSyntax = isAnyImportSyntax;
function isLateVisibilityPaintedStatement(node) {
switch (node.kind) {
case 264 /* ImportDeclaration */:
case 263 /* ImportEqualsDeclaration */:
case 235 /* VariableStatement */:
case 255 /* ClassDeclaration */:
case 254 /* FunctionDeclaration */:
case 259 /* ModuleDeclaration */:
case 257 /* TypeAliasDeclaration */:
case 256 /* InterfaceDeclaration */:
case 258 /* EnumDeclaration */:
return true;
default:
return false;
}
}
ts.isLateVisibilityPaintedStatement = isLateVisibilityPaintedStatement;
function hasPossibleExternalModuleReference(node) {
return isAnyImportOrReExport(node) || ts.isModuleDeclaration(node) || ts.isImportTypeNode(node) || isImportCall(node);
}
ts.hasPossibleExternalModuleReference = hasPossibleExternalModuleReference;
function isAnyImportOrReExport(node) {
return isAnyImportSyntax(node) || ts.isExportDeclaration(node);
}
ts.isAnyImportOrReExport = isAnyImportOrReExport;
// Gets the nearest enclosing block scope container that has the provided node
// as a descendant, that is not the provided node.
function getEnclosingBlockScopeContainer(node) {
return ts.findAncestor(node.parent, function (current) { return isBlockScope(current, current.parent); });
}
ts.getEnclosingBlockScopeContainer = getEnclosingBlockScopeContainer;
function forEachEnclosingBlockScopeContainer(node, cb) {
var container = getEnclosingBlockScopeContainer(node);
while (container) {
cb(container);
container = getEnclosingBlockScopeContainer(container);
}
}
ts.forEachEnclosingBlockScopeContainer = forEachEnclosingBlockScopeContainer;
// Return display name of an identifier
// Computed property names will just be emitted as "[<expr>]", where <expr> is the source
// text of the expression in the computed property.
function declarationNameToString(name) {
return !name || getFullWidth(name) === 0 ? "(Missing)" : getTextOfNode(name);
}
ts.declarationNameToString = declarationNameToString;
function getNameFromIndexInfo(info) {
return info.declaration ? declarationNameToString(info.declaration.parameters[0].name) : undefined;
}
ts.getNameFromIndexInfo = getNameFromIndexInfo;
function isComputedNonLiteralName(name) {
return name.kind === 160 /* ComputedPropertyName */ && !isStringOrNumericLiteralLike(name.expression);
}
ts.isComputedNonLiteralName = isComputedNonLiteralName;
function getTextOfPropertyName(name) {
switch (name.kind) {
case 79 /* Identifier */:
case 80 /* PrivateIdentifier */:
return name.escapedText;
case 10 /* StringLiteral */:
case 8 /* NumericLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
return ts.escapeLeadingUnderscores(name.text);
case 160 /* ComputedPropertyName */:
if (isStringOrNumericLiteralLike(name.expression))
return ts.escapeLeadingUnderscores(name.expression.text);
return ts.Debug.fail("Text of property name cannot be read from non-literal-valued ComputedPropertyNames");
default:
return ts.Debug.assertNever(name);
}
}
ts.getTextOfPropertyName = getTextOfPropertyName;
function entityNameToString(name) {
switch (name.kind) {
case 108 /* ThisKeyword */:
return "this";
case 80 /* PrivateIdentifier */:
case 79 /* Identifier */:
return getFullWidth(name) === 0 ? ts.idText(name) : getTextOfNode(name);
case 159 /* QualifiedName */:
return entityNameToString(name.left) + "." + entityNameToString(name.right);
case 204 /* PropertyAccessExpression */:
if (ts.isIdentifier(name.name) || ts.isPrivateIdentifier(name.name)) {
return entityNameToString(name.expression) + "." + entityNameToString(name.name);
}
else {
return ts.Debug.assertNever(name.name);
}
case 306 /* JSDocMemberName */:
return entityNameToString(name.left) + entityNameToString(name.right);
default:
return ts.Debug.assertNever(name);
}
}
ts.entityNameToString = entityNameToString;
function createDiagnosticForNode(node, message, arg0, arg1, arg2, arg3) {
var sourceFile = getSourceFileOfNode(node);
return createDiagnosticForNodeInSourceFile(sourceFile, node, message, arg0, arg1, arg2, arg3);
}
ts.createDiagnosticForNode = createDiagnosticForNode;
function createDiagnosticForNodeArray(sourceFile, nodes, message, arg0, arg1, arg2, arg3) {
var start = ts.skipTrivia(sourceFile.text, nodes.pos);
return createFileDiagnostic(sourceFile, start, nodes.end - start, message, arg0, arg1, arg2, arg3);
}
ts.createDiagnosticForNodeArray = createDiagnosticForNodeArray;
function createDiagnosticForNodeInSourceFile(sourceFile, node, message, arg0, arg1, arg2, arg3) {
var span = getErrorSpanForNode(sourceFile, node);
return createFileDiagnostic(sourceFile, span.start, span.length, message, arg0, arg1, arg2, arg3);
}
ts.createDiagnosticForNodeInSourceFile = createDiagnosticForNodeInSourceFile;
function createDiagnosticForNodeFromMessageChain(node, messageChain, relatedInformation) {
var sourceFile = getSourceFileOfNode(node);
var span = getErrorSpanForNode(sourceFile, node);
return createFileDiagnosticFromMessageChain(sourceFile, span.start, span.length, messageChain, relatedInformation);
}
ts.createDiagnosticForNodeFromMessageChain = createDiagnosticForNodeFromMessageChain;
function assertDiagnosticLocation(file, start, length) {
ts.Debug.assertGreaterThanOrEqual(start, 0);
ts.Debug.assertGreaterThanOrEqual(length, 0);
if (file) {
ts.Debug.assertLessThanOrEqual(start, file.text.length);
ts.Debug.assertLessThanOrEqual(start + length, file.text.length);
}
}
function createFileDiagnosticFromMessageChain(file, start, length, messageChain, relatedInformation) {
assertDiagnosticLocation(file, start, length);
return {
file: file,
start: start,
length: length,
code: messageChain.code,
category: messageChain.category,
messageText: messageChain.next ? messageChain : messageChain.messageText,
relatedInformation: relatedInformation
};
}
ts.createFileDiagnosticFromMessageChain = createFileDiagnosticFromMessageChain;
function createDiagnosticForFileFromMessageChain(sourceFile, messageChain, relatedInformation) {
return {
file: sourceFile,
start: 0,
length: 0,
code: messageChain.code,
category: messageChain.category,
messageText: messageChain.next ? messageChain : messageChain.messageText,
relatedInformation: relatedInformation
};
}
ts.createDiagnosticForFileFromMessageChain = createDiagnosticForFileFromMessageChain;
function createDiagnosticForRange(sourceFile, range, message) {
return {
file: sourceFile,
start: range.pos,
length: range.end - range.pos,
code: message.code,
category: message.category,
messageText: message.message,
};
}
ts.createDiagnosticForRange = createDiagnosticForRange;
function getSpanOfTokenAtPosition(sourceFile, pos) {
var scanner = ts.createScanner(sourceFile.languageVersion, /*skipTrivia*/ true, sourceFile.languageVariant, sourceFile.text, /*onError:*/ undefined, pos);
scanner.scan();
var start = scanner.getTokenPos();
return ts.createTextSpanFromBounds(start, scanner.getTextPos());
}
ts.getSpanOfTokenAtPosition = getSpanOfTokenAtPosition;
function getErrorSpanForArrowFunction(sourceFile, node) {
var pos = ts.skipTrivia(sourceFile.text, node.pos);
if (node.body && node.body.kind === 233 /* Block */) {
var startLine = ts.getLineAndCharacterOfPosition(sourceFile, node.body.pos).line;
var endLine = ts.getLineAndCharacterOfPosition(sourceFile, node.body.end).line;
if (startLine < endLine) {
// The arrow function spans multiple lines,
// make the error span be the first line, inclusive.
return ts.createTextSpan(pos, getEndLinePosition(startLine, sourceFile) - pos + 1);
}
}
return ts.createTextSpanFromBounds(pos, node.end);
}
function getErrorSpanForNode(sourceFile, node) {
var errorNode = node;
switch (node.kind) {
case 300 /* SourceFile */:
var pos_1 = ts.skipTrivia(sourceFile.text, 0, /*stopAfterLineBreak*/ false);
if (pos_1 === sourceFile.text.length) {
// file is empty - return span for the beginning of the file
return ts.createTextSpan(0, 0);
}
return getSpanOfTokenAtPosition(sourceFile, pos_1);
// This list is a work in progress. Add missing node kinds to improve their error
// spans.
case 252 /* VariableDeclaration */:
case 201 /* BindingElement */:
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
case 256 /* InterfaceDeclaration */:
case 259 /* ModuleDeclaration */:
case 258 /* EnumDeclaration */:
case 294 /* EnumMember */:
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 257 /* TypeAliasDeclaration */:
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
case 266 /* NamespaceImport */:
errorNode = node.name;
break;
case 212 /* ArrowFunction */:
return getErrorSpanForArrowFunction(sourceFile, node);
case 287 /* CaseClause */:
case 288 /* DefaultClause */:
var start = ts.skipTrivia(sourceFile.text, node.pos);
var end = node.statements.length > 0 ? node.statements[0].pos : node.end;
return ts.createTextSpanFromBounds(start, end);
}
if (errorNode === undefined) {
// If we don't have a better node, then just set the error on the first token of
// construct.
return getSpanOfTokenAtPosition(sourceFile, node.pos);
}
ts.Debug.assert(!ts.isJSDoc(errorNode));
var isMissing = nodeIsMissing(errorNode);
var pos = isMissing || ts.isJsxText(node)
? errorNode.pos
: ts.skipTrivia(sourceFile.text, errorNode.pos);
// These asserts should all be satisfied for a properly constructed `errorNode`.
if (isMissing) {
ts.Debug.assert(pos === errorNode.pos, "This failure could trigger https://github.com/Microsoft/TypeScript/issues/20809");
ts.Debug.assert(pos === errorNode.end, "This failure could trigger https://github.com/Microsoft/TypeScript/issues/20809");
}
else {
ts.Debug.assert(pos >= errorNode.pos, "This failure could trigger https://github.com/Microsoft/TypeScript/issues/20809");
ts.Debug.assert(pos <= errorNode.end, "This failure could trigger https://github.com/Microsoft/TypeScript/issues/20809");
}
return ts.createTextSpanFromBounds(pos, errorNode.end);
}
ts.getErrorSpanForNode = getErrorSpanForNode;
function isExternalOrCommonJsModule(file) {
return (file.externalModuleIndicator || file.commonJsModuleIndicator) !== undefined;
}
ts.isExternalOrCommonJsModule = isExternalOrCommonJsModule;
function isJsonSourceFile(file) {
return file.scriptKind === 6 /* JSON */;
}
ts.isJsonSourceFile = isJsonSourceFile;
function isEnumConst(node) {
return !!(ts.getCombinedModifierFlags(node) & 2048 /* Const */);
}
ts.isEnumConst = isEnumConst;
function isDeclarationReadonly(declaration) {
return !!(ts.getCombinedModifierFlags(declaration) & 64 /* Readonly */ && !ts.isParameterPropertyDeclaration(declaration, declaration.parent));
}
ts.isDeclarationReadonly = isDeclarationReadonly;
function isVarConst(node) {
return !!(ts.getCombinedNodeFlags(node) & 2 /* Const */);
}
ts.isVarConst = isVarConst;
function isLet(node) {
return !!(ts.getCombinedNodeFlags(node) & 1 /* Let */);
}
ts.isLet = isLet;
function isSuperCall(n) {
return n.kind === 206 /* CallExpression */ && n.expression.kind === 106 /* SuperKeyword */;
}
ts.isSuperCall = isSuperCall;
function isImportCall(n) {
return n.kind === 206 /* CallExpression */ && n.expression.kind === 100 /* ImportKeyword */;
}
ts.isImportCall = isImportCall;
function isImportMeta(n) {
return ts.isMetaProperty(n)
&& n.keywordToken === 100 /* ImportKeyword */
&& n.name.escapedText === "meta";
}
ts.isImportMeta = isImportMeta;
function isLiteralImportTypeNode(n) {
return ts.isImportTypeNode(n) && ts.isLiteralTypeNode(n.argument) && ts.isStringLiteral(n.argument.literal);
}
ts.isLiteralImportTypeNode = isLiteralImportTypeNode;
function isPrologueDirective(node) {
return node.kind === 236 /* ExpressionStatement */
&& node.expression.kind === 10 /* StringLiteral */;
}
ts.isPrologueDirective = isPrologueDirective;
function isCustomPrologue(node) {
return !!(getEmitFlags(node) & 1048576 /* CustomPrologue */);
}
ts.isCustomPrologue = isCustomPrologue;
function isHoistedFunction(node) {
return isCustomPrologue(node)
&& ts.isFunctionDeclaration(node);
}
ts.isHoistedFunction = isHoistedFunction;
function isHoistedVariable(node) {
return ts.isIdentifier(node.name)
&& !node.initializer;
}
function isHoistedVariableStatement(node) {
return isCustomPrologue(node)
&& ts.isVariableStatement(node)
&& ts.every(node.declarationList.declarations, isHoistedVariable);
}
ts.isHoistedVariableStatement = isHoistedVariableStatement;
function getLeadingCommentRangesOfNode(node, sourceFileOfNode) {
return node.kind !== 11 /* JsxText */ ? ts.getLeadingCommentRanges(sourceFileOfNode.text, node.pos) : undefined;
}
ts.getLeadingCommentRangesOfNode = getLeadingCommentRangesOfNode;
function getJSDocCommentRanges(node, text) {
var commentRanges = (node.kind === 162 /* Parameter */ ||
node.kind === 161 /* TypeParameter */ ||
node.kind === 211 /* FunctionExpression */ ||
node.kind === 212 /* ArrowFunction */ ||
node.kind === 210 /* ParenthesizedExpression */ ||
node.kind === 252 /* VariableDeclaration */) ?
ts.concatenate(ts.getTrailingCommentRanges(text, node.pos), ts.getLeadingCommentRanges(text, node.pos)) :
ts.getLeadingCommentRanges(text, node.pos);
// True if the comment starts with '/**' but not if it is '/**/'
return ts.filter(commentRanges, function (comment) {
return text.charCodeAt(comment.pos + 1) === 42 /* asterisk */ &&
text.charCodeAt(comment.pos + 2) === 42 /* asterisk */ &&
text.charCodeAt(comment.pos + 3) !== 47 /* slash */;
});
}
ts.getJSDocCommentRanges = getJSDocCommentRanges;
ts.fullTripleSlashReferencePathRegEx = /^(\/\/\/\s*<reference\s+path\s*=\s*)(('[^']*')|("[^"]*")).*?\/>/;
var fullTripleSlashReferenceTypeReferenceDirectiveRegEx = /^(\/\/\/\s*<reference\s+types\s*=\s*)(('[^']*')|("[^"]*")).*?\/>/;
ts.fullTripleSlashAMDReferencePathRegEx = /^(\/\/\/\s*<amd-dependency\s+path\s*=\s*)(('[^']*')|("[^"]*")).*?\/>/;
var defaultLibReferenceRegEx = /^(\/\/\/\s*<reference\s+no-default-lib\s*=\s*)(('[^']*')|("[^"]*"))\s*\/>/;
function isPartOfTypeNode(node) {
if (175 /* FirstTypeNode */ <= node.kind && node.kind <= 198 /* LastTypeNode */) {
return true;
}
switch (node.kind) {
case 129 /* AnyKeyword */:
case 153 /* UnknownKeyword */:
case 145 /* NumberKeyword */:
case 156 /* BigIntKeyword */:
case 148 /* StringKeyword */:
case 132 /* BooleanKeyword */:
case 149 /* SymbolKeyword */:
case 146 /* ObjectKeyword */:
case 151 /* UndefinedKeyword */:
case 142 /* NeverKeyword */:
return true;
case 114 /* VoidKeyword */:
return node.parent.kind !== 215 /* VoidExpression */;
case 226 /* ExpressionWithTypeArguments */:
return !isExpressionWithTypeArgumentsInClassExtendsClause(node);
case 161 /* TypeParameter */:
return node.parent.kind === 193 /* MappedType */ || node.parent.kind === 188 /* InferType */;
// Identifiers and qualified names may be type nodes, depending on their context. Climb
// above them to find the lowest container
case 79 /* Identifier */:
// If the identifier is the RHS of a qualified name, then it's a type iff its parent is.
if (node.parent.kind === 159 /* QualifiedName */ && node.parent.right === node) {
node = node.parent;
}
else if (node.parent.kind === 204 /* PropertyAccessExpression */ && node.parent.name === node) {
node = node.parent;
}
// At this point, node is either a qualified name or an identifier
ts.Debug.assert(node.kind === 79 /* Identifier */ || node.kind === 159 /* QualifiedName */ || node.kind === 204 /* PropertyAccessExpression */, "'node' was expected to be a qualified name, identifier or property access in 'isPartOfTypeNode'.");
// falls through
case 159 /* QualifiedName */:
case 204 /* PropertyAccessExpression */:
case 108 /* ThisKeyword */: {
var parent = node.parent;
if (parent.kind === 179 /* TypeQuery */) {
return false;
}
if (parent.kind === 198 /* ImportType */) {
return !parent.isTypeOf;
}
// Do not recursively call isPartOfTypeNode on the parent. In the example:
//
// let a: A.B.C;
//
// Calling isPartOfTypeNode would consider the qualified name A.B a type node.
// Only C and A.B.C are type nodes.
if (175 /* FirstTypeNode */ <= parent.kind && parent.kind <= 198 /* LastTypeNode */) {
return true;
}
switch (parent.kind) {
case 226 /* ExpressionWithTypeArguments */:
return !isExpressionWithTypeArgumentsInClassExtendsClause(parent);
case 161 /* TypeParameter */:
return node === parent.constraint;
case 339 /* JSDocTemplateTag */:
return node === parent.constraint;
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
case 162 /* Parameter */:
case 252 /* VariableDeclaration */:
return node === parent.type;
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
case 169 /* Constructor */:
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return node === parent.type;
case 172 /* CallSignature */:
case 173 /* ConstructSignature */:
case 174 /* IndexSignature */:
return node === parent.type;
case 209 /* TypeAssertionExpression */:
return node === parent.type;
case 206 /* CallExpression */:
case 207 /* NewExpression */:
return ts.contains(parent.typeArguments, node);
case 208 /* TaggedTemplateExpression */:
// TODO (drosen): TaggedTemplateExpressions may eventually support type arguments.
return false;
}
}
}
return false;
}
ts.isPartOfTypeNode = isPartOfTypeNode;
function isChildOfNodeWithKind(node, kind) {
while (node) {
if (node.kind === kind) {
return true;
}
node = node.parent;
}
return false;
}
ts.isChildOfNodeWithKind = isChildOfNodeWithKind;
// Warning: This has the same semantics as the forEach family of functions,
// in that traversal terminates in the event that 'visitor' supplies a truthy value.
function forEachReturnStatement(body, visitor) {
return traverse(body);
function traverse(node) {
switch (node.kind) {
case 245 /* ReturnStatement */:
return visitor(node);
case 261 /* CaseBlock */:
case 233 /* Block */:
case 237 /* IfStatement */:
case 238 /* DoStatement */:
case 239 /* WhileStatement */:
case 240 /* ForStatement */:
case 241 /* ForInStatement */:
case 242 /* ForOfStatement */:
case 246 /* WithStatement */:
case 247 /* SwitchStatement */:
case 287 /* CaseClause */:
case 288 /* DefaultClause */:
case 248 /* LabeledStatement */:
case 250 /* TryStatement */:
case 290 /* CatchClause */:
return ts.forEachChild(node, traverse);
}
}
}
ts.forEachReturnStatement = forEachReturnStatement;
function forEachYieldExpression(body, visitor) {
return traverse(body);
function traverse(node) {
switch (node.kind) {
case 222 /* YieldExpression */:
visitor(node);
var operand = node.expression;
if (operand) {
traverse(operand);
}
return;
case 258 /* EnumDeclaration */:
case 256 /* InterfaceDeclaration */:
case 259 /* ModuleDeclaration */:
case 257 /* TypeAliasDeclaration */:
// These are not allowed inside a generator now, but eventually they may be allowed
// as local types. Regardless, skip them to avoid the work.
return;
default:
if (ts.isFunctionLike(node)) {
if (node.name && node.name.kind === 160 /* ComputedPropertyName */) {
// Note that we will not include methods/accessors of a class because they would require
// first descending into the class. This is by design.
traverse(node.name.expression);
return;
}
}
else if (!isPartOfTypeNode(node)) {
// This is the general case, which should include mostly expressions and statements.
// Also includes NodeArrays.
ts.forEachChild(node, traverse);
}
}
}
}
ts.forEachYieldExpression = forEachYieldExpression;
/**
* Gets the most likely element type for a TypeNode. This is not an exhaustive test
* as it assumes a rest argument can only be an array type (either T[], or Array<T>).
*
* @param node The type node.
*/
function getRestParameterElementType(node) {
if (node && node.kind === 181 /* ArrayType */) {
return node.elementType;
}
else if (node && node.kind === 176 /* TypeReference */) {
return ts.singleOrUndefined(node.typeArguments);
}
else {
return undefined;
}
}
ts.getRestParameterElementType = getRestParameterElementType;
function getMembersOfDeclaration(node) {
switch (node.kind) {
case 256 /* InterfaceDeclaration */:
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
case 180 /* TypeLiteral */:
return node.members;
case 203 /* ObjectLiteralExpression */:
return node.properties;
}
}
ts.getMembersOfDeclaration = getMembersOfDeclaration;
function isVariableLike(node) {
if (node) {
switch (node.kind) {
case 201 /* BindingElement */:
case 294 /* EnumMember */:
case 162 /* Parameter */:
case 291 /* PropertyAssignment */:
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
case 292 /* ShorthandPropertyAssignment */:
case 252 /* VariableDeclaration */:
return true;
}
}
return false;
}
ts.isVariableLike = isVariableLike;
function isVariableLikeOrAccessor(node) {
return isVariableLike(node) || ts.isAccessor(node);
}
ts.isVariableLikeOrAccessor = isVariableLikeOrAccessor;
function isVariableDeclarationInVariableStatement(node) {
return node.parent.kind === 253 /* VariableDeclarationList */
&& node.parent.parent.kind === 235 /* VariableStatement */;
}
ts.isVariableDeclarationInVariableStatement = isVariableDeclarationInVariableStatement;
function isValidESSymbolDeclaration(node) {
return ts.isVariableDeclaration(node) ? isVarConst(node) && ts.isIdentifier(node.name) && isVariableDeclarationInVariableStatement(node) :
ts.isPropertyDeclaration(node) ? hasEffectiveReadonlyModifier(node) && hasStaticModifier(node) :
ts.isPropertySignature(node) && hasEffectiveReadonlyModifier(node);
}
ts.isValidESSymbolDeclaration = isValidESSymbolDeclaration;
function introducesArgumentsExoticObject(node) {
switch (node.kind) {
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
case 169 /* Constructor */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
return true;
}
return false;
}
ts.introducesArgumentsExoticObject = introducesArgumentsExoticObject;
function unwrapInnermostStatementOfLabel(node, beforeUnwrapLabelCallback) {
while (true) {
if (beforeUnwrapLabelCallback) {
beforeUnwrapLabelCallback(node);
}
if (node.statement.kind !== 248 /* LabeledStatement */) {
return node.statement;
}
node = node.statement;
}
}
ts.unwrapInnermostStatementOfLabel = unwrapInnermostStatementOfLabel;
function isFunctionBlock(node) {
return node && node.kind === 233 /* Block */ && ts.isFunctionLike(node.parent);
}
ts.isFunctionBlock = isFunctionBlock;
function isObjectLiteralMethod(node) {
return node && node.kind === 167 /* MethodDeclaration */ && node.parent.kind === 203 /* ObjectLiteralExpression */;
}
ts.isObjectLiteralMethod = isObjectLiteralMethod;
function isObjectLiteralOrClassExpressionMethod(node) {
return node.kind === 167 /* MethodDeclaration */ &&
(node.parent.kind === 203 /* ObjectLiteralExpression */ ||
node.parent.kind === 224 /* ClassExpression */);
}
ts.isObjectLiteralOrClassExpressionMethod = isObjectLiteralOrClassExpressionMethod;
function isIdentifierTypePredicate(predicate) {
return predicate && predicate.kind === 1 /* Identifier */;
}
ts.isIdentifierTypePredicate = isIdentifierTypePredicate;
function isThisTypePredicate(predicate) {
return predicate && predicate.kind === 0 /* This */;
}
ts.isThisTypePredicate = isThisTypePredicate;
function getPropertyAssignment(objectLiteral, key, key2) {
return objectLiteral.properties.filter(function (property) {
if (property.kind === 291 /* PropertyAssignment */) {
var propName = getTextOfPropertyName(property.name);
return key === propName || (!!key2 && key2 === propName);
}
return false;
});
}
ts.getPropertyAssignment = getPropertyAssignment;
function getPropertyArrayElementValue(objectLiteral, propKey, elementValue) {
return ts.firstDefined(getPropertyAssignment(objectLiteral, propKey), function (property) {
return ts.isArrayLiteralExpression(property.initializer) ?
ts.find(property.initializer.elements, function (element) { return ts.isStringLiteral(element) && element.text === elementValue; }) :
undefined;
});
}
ts.getPropertyArrayElementValue = getPropertyArrayElementValue;
function getTsConfigObjectLiteralExpression(tsConfigSourceFile) {
if (tsConfigSourceFile && tsConfigSourceFile.statements.length) {
var expression = tsConfigSourceFile.statements[0].expression;
return ts.tryCast(expression, ts.isObjectLiteralExpression);
}
}
ts.getTsConfigObjectLiteralExpression = getTsConfigObjectLiteralExpression;
function getTsConfigPropArrayElementValue(tsConfigSourceFile, propKey, elementValue) {
return ts.firstDefined(getTsConfigPropArray(tsConfigSourceFile, propKey), function (property) {
return ts.isArrayLiteralExpression(property.initializer) ?
ts.find(property.initializer.elements, function (element) { return ts.isStringLiteral(element) && element.text === elementValue; }) :
undefined;
});
}
ts.getTsConfigPropArrayElementValue = getTsConfigPropArrayElementValue;
function getTsConfigPropArray(tsConfigSourceFile, propKey) {
var jsonObjectLiteral = getTsConfigObjectLiteralExpression(tsConfigSourceFile);
return jsonObjectLiteral ? getPropertyAssignment(jsonObjectLiteral, propKey) : ts.emptyArray;
}
ts.getTsConfigPropArray = getTsConfigPropArray;
function getContainingFunction(node) {
return ts.findAncestor(node.parent, ts.isFunctionLike);
}
ts.getContainingFunction = getContainingFunction;
function getContainingFunctionDeclaration(node) {
return ts.findAncestor(node.parent, ts.isFunctionLikeDeclaration);
}
ts.getContainingFunctionDeclaration = getContainingFunctionDeclaration;
function getContainingClass(node) {
return ts.findAncestor(node.parent, ts.isClassLike);
}
ts.getContainingClass = getContainingClass;
function getContainingClassStaticBlock(node) {
return ts.findAncestor(node.parent, function (n) {
if (ts.isClassLike(n) || ts.isFunctionLike(n)) {
return "quit";
}
return ts.isClassStaticBlockDeclaration(n);
});
}
ts.getContainingClassStaticBlock = getContainingClassStaticBlock;
function getContainingFunctionOrClassStaticBlock(node) {
return ts.findAncestor(node.parent, ts.isFunctionLikeOrClassStaticBlockDeclaration);
}
ts.getContainingFunctionOrClassStaticBlock = getContainingFunctionOrClassStaticBlock;
function getThisContainer(node, includeArrowFunctions) {
ts.Debug.assert(node.kind !== 300 /* SourceFile */);
while (true) {
node = node.parent;
if (!node) {
return ts.Debug.fail(); // If we never pass in a SourceFile, this should be unreachable, since we'll stop when we reach that.
}
switch (node.kind) {
case 160 /* ComputedPropertyName */:
// If the grandparent node is an object literal (as opposed to a class),
// then the computed property is not a 'this' container.
// A computed property name in a class needs to be a this container
// so that we can error on it.
if (ts.isClassLike(node.parent.parent)) {
return node;
}
// If this is a computed property, then the parent should not
// make it a this container. The parent might be a property
// in an object literal, like a method or accessor. But in order for
// such a parent to be a this container, the reference must be in
// the *body* of the container.
node = node.parent;
break;
case 163 /* Decorator */:
// Decorators are always applied outside of the body of a class or method.
if (node.parent.kind === 162 /* Parameter */ && ts.isClassElement(node.parent.parent)) {
// If the decorator's parent is a Parameter, we resolve the this container from
// the grandparent class declaration.
node = node.parent.parent;
}
else if (ts.isClassElement(node.parent)) {
// If the decorator's parent is a class element, we resolve the 'this' container
// from the parent class declaration.
node = node.parent;
}
break;
case 212 /* ArrowFunction */:
if (!includeArrowFunctions) {
continue;
}
// falls through
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
case 259 /* ModuleDeclaration */:
case 168 /* ClassStaticBlockDeclaration */:
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
case 169 /* Constructor */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 172 /* CallSignature */:
case 173 /* ConstructSignature */:
case 174 /* IndexSignature */:
case 258 /* EnumDeclaration */:
case 300 /* SourceFile */:
return node;
}
}
}
ts.getThisContainer = getThisContainer;
function isInTopLevelContext(node) {
// The name of a class or function declaration is a BindingIdentifier in its surrounding scope.
if (ts.isIdentifier(node) && (ts.isClassDeclaration(node.parent) || ts.isFunctionDeclaration(node.parent)) && node.parent.name === node) {
node = node.parent;
}
var container = getThisContainer(node, /*includeArrowFunctions*/ true);
return ts.isSourceFile(container);
}
ts.isInTopLevelContext = isInTopLevelContext;
function getNewTargetContainer(node) {
var container = getThisContainer(node, /*includeArrowFunctions*/ false);
if (container) {
switch (container.kind) {
case 169 /* Constructor */:
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
return container;
}
}
return undefined;
}
ts.getNewTargetContainer = getNewTargetContainer;
/**
* Given an super call/property node, returns the closest node where
* - a super call/property access is legal in the node and not legal in the parent node the node.
* i.e. super call is legal in constructor but not legal in the class body.
* - the container is an arrow function (so caller might need to call getSuperContainer again in case it needs to climb higher)
* - a super call/property is definitely illegal in the container (but might be legal in some subnode)
* i.e. super property access is illegal in function declaration but can be legal in the statement list
*/
function getSuperContainer(node, stopOnFunctions) {
while (true) {
node = node.parent;
if (!node) {
return node;
}
switch (node.kind) {
case 160 /* ComputedPropertyName */:
node = node.parent;
break;
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
if (!stopOnFunctions) {
continue;
}
// falls through
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
case 169 /* Constructor */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 168 /* ClassStaticBlockDeclaration */:
return node;
case 163 /* Decorator */:
// Decorators are always applied outside of the body of a class or method.
if (node.parent.kind === 162 /* Parameter */ && ts.isClassElement(node.parent.parent)) {
// If the decorator's parent is a Parameter, we resolve the this container from
// the grandparent class declaration.
node = node.parent.parent;
}
else if (ts.isClassElement(node.parent)) {
// If the decorator's parent is a class element, we resolve the 'this' container
// from the parent class declaration.
node = node.parent;
}
break;
}
}
}
ts.getSuperContainer = getSuperContainer;
function getImmediatelyInvokedFunctionExpression(func) {
if (func.kind === 211 /* FunctionExpression */ || func.kind === 212 /* ArrowFunction */) {
var prev = func;
var parent = func.parent;
while (parent.kind === 210 /* ParenthesizedExpression */) {
prev = parent;
parent = parent.parent;
}
if (parent.kind === 206 /* CallExpression */ && parent.expression === prev) {
return parent;
}
}
}
ts.getImmediatelyInvokedFunctionExpression = getImmediatelyInvokedFunctionExpression;
function isSuperOrSuperProperty(node) {
return node.kind === 106 /* SuperKeyword */
|| isSuperProperty(node);
}
ts.isSuperOrSuperProperty = isSuperOrSuperProperty;
/**
* Determines whether a node is a property or element access expression for `super`.
*/
function isSuperProperty(node) {
var kind = node.kind;
return (kind === 204 /* PropertyAccessExpression */ || kind === 205 /* ElementAccessExpression */)
&& node.expression.kind === 106 /* SuperKeyword */;
}
ts.isSuperProperty = isSuperProperty;
/**
* Determines whether a node is a property or element access expression for `this`.
*/
function isThisProperty(node) {
var kind = node.kind;
return (kind === 204 /* PropertyAccessExpression */ || kind === 205 /* ElementAccessExpression */)
&& node.expression.kind === 108 /* ThisKeyword */;
}
ts.isThisProperty = isThisProperty;
function isThisInitializedDeclaration(node) {
var _a;
return !!node && ts.isVariableDeclaration(node) && ((_a = node.initializer) === null || _a === void 0 ? void 0 : _a.kind) === 108 /* ThisKeyword */;
}
ts.isThisInitializedDeclaration = isThisInitializedDeclaration;
function isThisInitializedObjectBindingExpression(node) {
return !!node
&& (ts.isShorthandPropertyAssignment(node) || ts.isPropertyAssignment(node))
&& ts.isBinaryExpression(node.parent.parent)
&& node.parent.parent.operatorToken.kind === 63 /* EqualsToken */
&& node.parent.parent.right.kind === 108 /* ThisKeyword */;
}
ts.isThisInitializedObjectBindingExpression = isThisInitializedObjectBindingExpression;
function getEntityNameFromTypeNode(node) {
switch (node.kind) {
case 176 /* TypeReference */:
return node.typeName;
case 226 /* ExpressionWithTypeArguments */:
return isEntityNameExpression(node.expression)
? node.expression
: undefined;
// TODO(rbuckton): These aren't valid TypeNodes, but we treat them as such because of `isPartOfTypeNode`, which returns `true` for things that aren't `TypeNode`s.
case 79 /* Identifier */:
case 159 /* QualifiedName */:
return node;
}
return undefined;
}
ts.getEntityNameFromTypeNode = getEntityNameFromTypeNode;
function getInvokedExpression(node) {
switch (node.kind) {
case 208 /* TaggedTemplateExpression */:
return node.tag;
case 278 /* JsxOpeningElement */:
case 277 /* JsxSelfClosingElement */:
return node.tagName;
default:
return node.expression;
}
}
ts.getInvokedExpression = getInvokedExpression;
function nodeCanBeDecorated(node, parent, grandparent) {
// private names cannot be used with decorators yet
if (ts.isNamedDeclaration(node) && ts.isPrivateIdentifier(node.name)) {
return false;
}
switch (node.kind) {
case 255 /* ClassDeclaration */:
// classes are valid targets
return true;
case 165 /* PropertyDeclaration */:
// property declarations are valid if their parent is a class declaration.
return parent.kind === 255 /* ClassDeclaration */;
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 167 /* MethodDeclaration */:
// if this method has a body and its parent is a class declaration, this is a valid target.
return node.body !== undefined
&& parent.kind === 255 /* ClassDeclaration */;
case 162 /* Parameter */:
// if the parameter's parent has a body and its grandparent is a class declaration, this is a valid target;
return parent.body !== undefined
&& (parent.kind === 169 /* Constructor */
|| parent.kind === 167 /* MethodDeclaration */
|| parent.kind === 171 /* SetAccessor */)
&& grandparent.kind === 255 /* ClassDeclaration */;
}
return false;
}
ts.nodeCanBeDecorated = nodeCanBeDecorated;
function nodeIsDecorated(node, parent, grandparent) {
return node.decorators !== undefined
&& nodeCanBeDecorated(node, parent, grandparent); // TODO: GH#18217
}
ts.nodeIsDecorated = nodeIsDecorated;
function nodeOrChildIsDecorated(node, parent, grandparent) {
return nodeIsDecorated(node, parent, grandparent) || childIsDecorated(node, parent); // TODO: GH#18217
}
ts.nodeOrChildIsDecorated = nodeOrChildIsDecorated;
function childIsDecorated(node, parent) {
switch (node.kind) {
case 255 /* ClassDeclaration */:
return ts.some(node.members, function (m) { return nodeOrChildIsDecorated(m, node, parent); }); // TODO: GH#18217
case 167 /* MethodDeclaration */:
case 171 /* SetAccessor */:
case 169 /* Constructor */:
return ts.some(node.parameters, function (p) { return nodeIsDecorated(p, node, parent); }); // TODO: GH#18217
default:
return false;
}
}
ts.childIsDecorated = childIsDecorated;
function classOrConstructorParameterIsDecorated(node) {
if (nodeIsDecorated(node))
return true;
var constructor = getFirstConstructorWithBody(node);
return !!constructor && childIsDecorated(constructor, node);
}
ts.classOrConstructorParameterIsDecorated = classOrConstructorParameterIsDecorated;
function isJSXTagName(node) {
var parent = node.parent;
if (parent.kind === 278 /* JsxOpeningElement */ ||
parent.kind === 277 /* JsxSelfClosingElement */ ||
parent.kind === 279 /* JsxClosingElement */) {
return parent.tagName === node;
}
return false;
}
ts.isJSXTagName = isJSXTagName;
function isExpressionNode(node) {
switch (node.kind) {
case 106 /* SuperKeyword */:
case 104 /* NullKeyword */:
case 110 /* TrueKeyword */:
case 95 /* FalseKeyword */:
case 13 /* RegularExpressionLiteral */:
case 202 /* ArrayLiteralExpression */:
case 203 /* ObjectLiteralExpression */:
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
case 206 /* CallExpression */:
case 207 /* NewExpression */:
case 208 /* TaggedTemplateExpression */:
case 227 /* AsExpression */:
case 209 /* TypeAssertionExpression */:
case 228 /* NonNullExpression */:
case 210 /* ParenthesizedExpression */:
case 211 /* FunctionExpression */:
case 224 /* ClassExpression */:
case 212 /* ArrowFunction */:
case 215 /* VoidExpression */:
case 213 /* DeleteExpression */:
case 214 /* TypeOfExpression */:
case 217 /* PrefixUnaryExpression */:
case 218 /* PostfixUnaryExpression */:
case 219 /* BinaryExpression */:
case 220 /* ConditionalExpression */:
case 223 /* SpreadElement */:
case 221 /* TemplateExpression */:
case 225 /* OmittedExpression */:
case 276 /* JsxElement */:
case 277 /* JsxSelfClosingElement */:
case 280 /* JsxFragment */:
case 222 /* YieldExpression */:
case 216 /* AwaitExpression */:
case 229 /* MetaProperty */:
return true;
case 159 /* QualifiedName */:
while (node.parent.kind === 159 /* QualifiedName */) {
node = node.parent;
}
return node.parent.kind === 179 /* TypeQuery */ || ts.isJSDocLinkLike(node.parent) || ts.isJSDocNameReference(node.parent) || ts.isJSDocMemberName(node.parent) || isJSXTagName(node);
case 306 /* JSDocMemberName */:
while (ts.isJSDocMemberName(node.parent)) {
node = node.parent;
}
return node.parent.kind === 179 /* TypeQuery */ || ts.isJSDocLinkLike(node.parent) || ts.isJSDocNameReference(node.parent) || ts.isJSDocMemberName(node.parent) || isJSXTagName(node);
case 79 /* Identifier */:
if (node.parent.kind === 179 /* TypeQuery */ || ts.isJSDocLinkLike(node.parent) || ts.isJSDocNameReference(node.parent) || ts.isJSDocMemberName(node.parent) || isJSXTagName(node)) {
return true;
}
// falls through
case 8 /* NumericLiteral */:
case 9 /* BigIntLiteral */:
case 10 /* StringLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
case 108 /* ThisKeyword */:
return isInExpressionContext(node);
default:
return false;
}
}
ts.isExpressionNode = isExpressionNode;
function isInExpressionContext(node) {
var parent = node.parent;
switch (parent.kind) {
case 252 /* VariableDeclaration */:
case 162 /* Parameter */:
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
case 294 /* EnumMember */:
case 291 /* PropertyAssignment */:
case 201 /* BindingElement */:
return parent.initializer === node;
case 236 /* ExpressionStatement */:
case 237 /* IfStatement */:
case 238 /* DoStatement */:
case 239 /* WhileStatement */:
case 245 /* ReturnStatement */:
case 246 /* WithStatement */:
case 247 /* SwitchStatement */:
case 287 /* CaseClause */:
case 249 /* ThrowStatement */:
return parent.expression === node;
case 240 /* ForStatement */:
var forStatement = parent;
return (forStatement.initializer === node && forStatement.initializer.kind !== 253 /* VariableDeclarationList */) ||
forStatement.condition === node ||
forStatement.incrementor === node;
case 241 /* ForInStatement */:
case 242 /* ForOfStatement */:
var forInStatement = parent;
return (forInStatement.initializer === node && forInStatement.initializer.kind !== 253 /* VariableDeclarationList */) ||
forInStatement.expression === node;
case 209 /* TypeAssertionExpression */:
case 227 /* AsExpression */:
return node === parent.expression;
case 231 /* TemplateSpan */:
return node === parent.expression;
case 160 /* ComputedPropertyName */:
return node === parent.expression;
case 163 /* Decorator */:
case 286 /* JsxExpression */:
case 285 /* JsxSpreadAttribute */:
case 293 /* SpreadAssignment */:
return true;
case 226 /* ExpressionWithTypeArguments */:
return parent.expression === node && isExpressionWithTypeArgumentsInClassExtendsClause(parent);
case 292 /* ShorthandPropertyAssignment */:
return parent.objectAssignmentInitializer === node;
default:
return isExpressionNode(parent);
}
}
ts.isInExpressionContext = isInExpressionContext;
function isPartOfTypeQuery(node) {
while (node.kind === 159 /* QualifiedName */ || node.kind === 79 /* Identifier */) {
node = node.parent;
}
return node.kind === 179 /* TypeQuery */;
}
ts.isPartOfTypeQuery = isPartOfTypeQuery;
function isNamespaceReexportDeclaration(node) {
return ts.isNamespaceExport(node) && !!node.parent.moduleSpecifier;
}
ts.isNamespaceReexportDeclaration = isNamespaceReexportDeclaration;
function isExternalModuleImportEqualsDeclaration(node) {
return node.kind === 263 /* ImportEqualsDeclaration */ && node.moduleReference.kind === 275 /* ExternalModuleReference */;
}
ts.isExternalModuleImportEqualsDeclaration = isExternalModuleImportEqualsDeclaration;
function getExternalModuleImportEqualsDeclarationExpression(node) {
ts.Debug.assert(isExternalModuleImportEqualsDeclaration(node));
return node.moduleReference.expression;
}
ts.getExternalModuleImportEqualsDeclarationExpression = getExternalModuleImportEqualsDeclarationExpression;
function getExternalModuleRequireArgument(node) {
return isRequireVariableDeclaration(node) && getLeftmostAccessExpression(node.initializer).arguments[0];
}
ts.getExternalModuleRequireArgument = getExternalModuleRequireArgument;
function isInternalModuleImportEqualsDeclaration(node) {
return node.kind === 263 /* ImportEqualsDeclaration */ && node.moduleReference.kind !== 275 /* ExternalModuleReference */;
}
ts.isInternalModuleImportEqualsDeclaration = isInternalModuleImportEqualsDeclaration;
function isSourceFileJS(file) {
return isInJSFile(file);
}
ts.isSourceFileJS = isSourceFileJS;
function isSourceFileNotJS(file) {
return !isInJSFile(file);
}
ts.isSourceFileNotJS = isSourceFileNotJS;
function isInJSFile(node) {
return !!node && !!(node.flags & 131072 /* JavaScriptFile */);
}
ts.isInJSFile = isInJSFile;
function isInJsonFile(node) {
return !!node && !!(node.flags & 33554432 /* JsonFile */);
}
ts.isInJsonFile = isInJsonFile;
function isSourceFileNotJson(file) {
return !isJsonSourceFile(file);
}
ts.isSourceFileNotJson = isSourceFileNotJson;
function isInJSDoc(node) {
return !!node && !!(node.flags & 4194304 /* JSDoc */);
}
ts.isInJSDoc = isInJSDoc;
function isJSDocIndexSignature(node) {
return ts.isTypeReferenceNode(node) &&
ts.isIdentifier(node.typeName) &&
node.typeName.escapedText === "Object" &&
node.typeArguments && node.typeArguments.length === 2 &&
(node.typeArguments[0].kind === 148 /* StringKeyword */ || node.typeArguments[0].kind === 145 /* NumberKeyword */);
}
ts.isJSDocIndexSignature = isJSDocIndexSignature;
function isRequireCall(callExpression, requireStringLiteralLikeArgument) {
if (callExpression.kind !== 206 /* CallExpression */) {
return false;
}
var _a = callExpression, expression = _a.expression, args = _a.arguments;
if (expression.kind !== 79 /* Identifier */ || expression.escapedText !== "require") {
return false;
}
if (args.length !== 1) {
return false;
}
var arg = args[0];
return !requireStringLiteralLikeArgument || ts.isStringLiteralLike(arg);
}
ts.isRequireCall = isRequireCall;
/**
* Returns true if the node is a VariableDeclaration initialized to a require call (see `isRequireCall`).
* This function does not test if the node is in a JavaScript file or not.
*/
function isRequireVariableDeclaration(node) {
if (node.kind === 201 /* BindingElement */) {
node = node.parent.parent;
}
return ts.isVariableDeclaration(node) && !!node.initializer && isRequireCall(getLeftmostAccessExpression(node.initializer), /*requireStringLiteralLikeArgument*/ true);
}
ts.isRequireVariableDeclaration = isRequireVariableDeclaration;
function isRequireVariableStatement(node) {
return ts.isVariableStatement(node)
&& node.declarationList.declarations.length > 0
&& ts.every(node.declarationList.declarations, function (decl) { return isRequireVariableDeclaration(decl); });
}
ts.isRequireVariableStatement = isRequireVariableStatement;
function isSingleOrDoubleQuote(charCode) {
return charCode === 39 /* singleQuote */ || charCode === 34 /* doubleQuote */;
}
ts.isSingleOrDoubleQuote = isSingleOrDoubleQuote;
function isStringDoubleQuoted(str, sourceFile) {
return getSourceTextOfNodeFromSourceFile(sourceFile, str).charCodeAt(0) === 34 /* doubleQuote */;
}
ts.isStringDoubleQuoted = isStringDoubleQuoted;
function isAssignmentDeclaration(decl) {
return ts.isBinaryExpression(decl) || isAccessExpression(decl) || ts.isIdentifier(decl) || ts.isCallExpression(decl);
}
ts.isAssignmentDeclaration = isAssignmentDeclaration;
/** Get the initializer, taking into account defaulted Javascript initializers */
function getEffectiveInitializer(node) {
if (isInJSFile(node) && node.initializer &&
ts.isBinaryExpression(node.initializer) &&
(node.initializer.operatorToken.kind === 56 /* BarBarToken */ || node.initializer.operatorToken.kind === 60 /* QuestionQuestionToken */) &&
node.name && isEntityNameExpression(node.name) && isSameEntityName(node.name, node.initializer.left)) {
return node.initializer.right;
}
return node.initializer;
}
ts.getEffectiveInitializer = getEffectiveInitializer;
/** Get the declaration initializer when it is container-like (See getExpandoInitializer). */
function getDeclaredExpandoInitializer(node) {
var init = getEffectiveInitializer(node);
return init && getExpandoInitializer(init, isPrototypeAccess(node.name));
}
ts.getDeclaredExpandoInitializer = getDeclaredExpandoInitializer;
function hasExpandoValueProperty(node, isPrototypeAssignment) {
return ts.forEach(node.properties, function (p) {
return ts.isPropertyAssignment(p) &&
ts.isIdentifier(p.name) &&
p.name.escapedText === "value" &&
p.initializer &&
getExpandoInitializer(p.initializer, isPrototypeAssignment);
});
}
/**
* Get the assignment 'initializer' -- the righthand side-- when the initializer is container-like (See getExpandoInitializer).
* We treat the right hand side of assignments with container-like initializers as declarations.
*/
function getAssignedExpandoInitializer(node) {
if (node && node.parent && ts.isBinaryExpression(node.parent) && node.parent.operatorToken.kind === 63 /* EqualsToken */) {
var isPrototypeAssignment = isPrototypeAccess(node.parent.left);
return getExpandoInitializer(node.parent.right, isPrototypeAssignment) ||
getDefaultedExpandoInitializer(node.parent.left, node.parent.right, isPrototypeAssignment);
}
if (node && ts.isCallExpression(node) && isBindableObjectDefinePropertyCall(node)) {
var result = hasExpandoValueProperty(node.arguments[2], node.arguments[1].text === "prototype");
if (result) {
return result;
}
}
}
ts.getAssignedExpandoInitializer = getAssignedExpandoInitializer;
/**
* Recognized expando initializers are:
* 1. (function() {})() -- IIFEs
* 2. function() { } -- Function expressions
* 3. class { } -- Class expressions
* 4. {} -- Empty object literals
* 5. { ... } -- Non-empty object literals, when used to initialize a prototype, like `C.prototype = { m() { } }`
*
* This function returns the provided initializer, or undefined if it is not valid.
*/
function getExpandoInitializer(initializer, isPrototypeAssignment) {
if (ts.isCallExpression(initializer)) {
var e = skipParentheses(initializer.expression);
return e.kind === 211 /* FunctionExpression */ || e.kind === 212 /* ArrowFunction */ ? initializer : undefined;
}
if (initializer.kind === 211 /* FunctionExpression */ ||
initializer.kind === 224 /* ClassExpression */ ||
initializer.kind === 212 /* ArrowFunction */) {
return initializer;
}
if (ts.isObjectLiteralExpression(initializer) && (initializer.properties.length === 0 || isPrototypeAssignment)) {
return initializer;
}
}
ts.getExpandoInitializer = getExpandoInitializer;
/**
* A defaulted expando initializer matches the pattern
* `Lhs = Lhs || ExpandoInitializer`
* or `var Lhs = Lhs || ExpandoInitializer`
*
* The second Lhs is required to be the same as the first except that it may be prefixed with
* 'window.', 'global.' or 'self.' The second Lhs is otherwise ignored by the binder and checker.
*/
function getDefaultedExpandoInitializer(name, initializer, isPrototypeAssignment) {
var e = ts.isBinaryExpression(initializer)
&& (initializer.operatorToken.kind === 56 /* BarBarToken */ || initializer.operatorToken.kind === 60 /* QuestionQuestionToken */)
&& getExpandoInitializer(initializer.right, isPrototypeAssignment);
if (e && isSameEntityName(name, initializer.left)) {
return e;
}
}
function isDefaultedExpandoInitializer(node) {
var name = ts.isVariableDeclaration(node.parent) ? node.parent.name :
ts.isBinaryExpression(node.parent) && node.parent.operatorToken.kind === 63 /* EqualsToken */ ? node.parent.left :
undefined;
return name && getExpandoInitializer(node.right, isPrototypeAccess(name)) && isEntityNameExpression(name) && isSameEntityName(name, node.left);
}
ts.isDefaultedExpandoInitializer = isDefaultedExpandoInitializer;
/** Given an expando initializer, return its declaration name, or the left-hand side of the assignment if it's part of an assignment declaration. */
function getNameOfExpando(node) {
if (ts.isBinaryExpression(node.parent)) {
var parent = ((node.parent.operatorToken.kind === 56 /* BarBarToken */ || node.parent.operatorToken.kind === 60 /* QuestionQuestionToken */) && ts.isBinaryExpression(node.parent.parent)) ? node.parent.parent : node.parent;
if (parent.operatorToken.kind === 63 /* EqualsToken */ && ts.isIdentifier(parent.left)) {
return parent.left;
}
}
else if (ts.isVariableDeclaration(node.parent)) {
return node.parent.name;
}
}
ts.getNameOfExpando = getNameOfExpando;
/**
* Is the 'declared' name the same as the one in the initializer?
* @return true for identical entity names, as well as ones where the initializer is prefixed with
* 'window', 'self' or 'global'. For example:
*
* var my = my || {}
* var min = window.min || {}
* my.app = self.my.app || class { }
*/
function isSameEntityName(name, initializer) {
if (isPropertyNameLiteral(name) && isPropertyNameLiteral(initializer)) {
return getTextOfIdentifierOrLiteral(name) === getTextOfIdentifierOrLiteral(initializer);
}
if (ts.isIdentifier(name) && isLiteralLikeAccess(initializer) &&
(initializer.expression.kind === 108 /* ThisKeyword */ ||
ts.isIdentifier(initializer.expression) &&
(initializer.expression.escapedText === "window" ||
initializer.expression.escapedText === "self" ||
initializer.expression.escapedText === "global"))) {
var nameOrArgument = getNameOrArgument(initializer);
if (ts.isPrivateIdentifier(nameOrArgument)) {
ts.Debug.fail("Unexpected PrivateIdentifier in name expression with literal-like access.");
}
return isSameEntityName(name, nameOrArgument);
}
if (isLiteralLikeAccess(name) && isLiteralLikeAccess(initializer)) {
return getElementOrPropertyAccessName(name) === getElementOrPropertyAccessName(initializer)
&& isSameEntityName(name.expression, initializer.expression);
}
return false;
}
ts.isSameEntityName = isSameEntityName;
function getRightMostAssignedExpression(node) {
while (isAssignmentExpression(node, /*excludeCompoundAssignments*/ true)) {
node = node.right;
}
return node;
}
ts.getRightMostAssignedExpression = getRightMostAssignedExpression;
function isExportsIdentifier(node) {
return ts.isIdentifier(node) && node.escapedText === "exports";
}
ts.isExportsIdentifier = isExportsIdentifier;
function isModuleIdentifier(node) {
return ts.isIdentifier(node) && node.escapedText === "module";
}
ts.isModuleIdentifier = isModuleIdentifier;
function isModuleExportsAccessExpression(node) {
return (ts.isPropertyAccessExpression(node) || isLiteralLikeElementAccess(node))
&& isModuleIdentifier(node.expression)
&& getElementOrPropertyAccessName(node) === "exports";
}
ts.isModuleExportsAccessExpression = isModuleExportsAccessExpression;
/// Given a BinaryExpression, returns SpecialPropertyAssignmentKind for the various kinds of property
/// assignments we treat as special in the binder
function getAssignmentDeclarationKind(expr) {
var special = getAssignmentDeclarationKindWorker(expr);
return special === 5 /* Property */ || isInJSFile(expr) ? special : 0 /* None */;
}
ts.getAssignmentDeclarationKind = getAssignmentDeclarationKind;
function isBindableObjectDefinePropertyCall(expr) {
return ts.length(expr.arguments) === 3 &&
ts.isPropertyAccessExpression(expr.expression) &&
ts.isIdentifier(expr.expression.expression) &&
ts.idText(expr.expression.expression) === "Object" &&
ts.idText(expr.expression.name) === "defineProperty" &&
isStringOrNumericLiteralLike(expr.arguments[1]) &&
isBindableStaticNameExpression(expr.arguments[0], /*excludeThisKeyword*/ true);
}
ts.isBindableObjectDefinePropertyCall = isBindableObjectDefinePropertyCall;
/** x.y OR x[0] */
function isLiteralLikeAccess(node) {
return ts.isPropertyAccessExpression(node) || isLiteralLikeElementAccess(node);
}
ts.isLiteralLikeAccess = isLiteralLikeAccess;
/** x[0] OR x['a'] OR x[Symbol.y] */
function isLiteralLikeElementAccess(node) {
return ts.isElementAccessExpression(node) && isStringOrNumericLiteralLike(node.argumentExpression);
}
ts.isLiteralLikeElementAccess = isLiteralLikeElementAccess;
/** Any series of property and element accesses. */
function isBindableStaticAccessExpression(node, excludeThisKeyword) {
return ts.isPropertyAccessExpression(node) && (!excludeThisKeyword && node.expression.kind === 108 /* ThisKeyword */ || ts.isIdentifier(node.name) && isBindableStaticNameExpression(node.expression, /*excludeThisKeyword*/ true))
|| isBindableStaticElementAccessExpression(node, excludeThisKeyword);
}
ts.isBindableStaticAccessExpression = isBindableStaticAccessExpression;
/** Any series of property and element accesses, ending in a literal element access */
function isBindableStaticElementAccessExpression(node, excludeThisKeyword) {
return isLiteralLikeElementAccess(node)
&& ((!excludeThisKeyword && node.expression.kind === 108 /* ThisKeyword */) ||
isEntityNameExpression(node.expression) ||
isBindableStaticAccessExpression(node.expression, /*excludeThisKeyword*/ true));
}
ts.isBindableStaticElementAccessExpression = isBindableStaticElementAccessExpression;
function isBindableStaticNameExpression(node, excludeThisKeyword) {
return isEntityNameExpression(node) || isBindableStaticAccessExpression(node, excludeThisKeyword);
}
ts.isBindableStaticNameExpression = isBindableStaticNameExpression;
function getNameOrArgument(expr) {
if (ts.isPropertyAccessExpression(expr)) {
return expr.name;
}
return expr.argumentExpression;
}
ts.getNameOrArgument = getNameOrArgument;
function getAssignmentDeclarationKindWorker(expr) {
if (ts.isCallExpression(expr)) {
if (!isBindableObjectDefinePropertyCall(expr)) {
return 0 /* None */;
}
var entityName = expr.arguments[0];
if (isExportsIdentifier(entityName) || isModuleExportsAccessExpression(entityName)) {
return 8 /* ObjectDefinePropertyExports */;
}
if (isBindableStaticAccessExpression(entityName) && getElementOrPropertyAccessName(entityName) === "prototype") {
return 9 /* ObjectDefinePrototypeProperty */;
}
return 7 /* ObjectDefinePropertyValue */;
}
if (expr.operatorToken.kind !== 63 /* EqualsToken */ || !isAccessExpression(expr.left) || isVoidZero(getRightMostAssignedExpression(expr))) {
return 0 /* None */;
}
if (isBindableStaticNameExpression(expr.left.expression, /*excludeThisKeyword*/ true) && getElementOrPropertyAccessName(expr.left) === "prototype" && ts.isObjectLiteralExpression(getInitializerOfBinaryExpression(expr))) {
// F.prototype = { ... }
return 6 /* Prototype */;
}
return getAssignmentDeclarationPropertyAccessKind(expr.left);
}
function isVoidZero(node) {
return ts.isVoidExpression(node) && ts.isNumericLiteral(node.expression) && node.expression.text === "0";
}
/**
* Does not handle signed numeric names like `a[+0]` - handling those would require handling prefix unary expressions
* throughout late binding handling as well, which is awkward (but ultimately probably doable if there is demand)
*/
/* @internal */
function getElementOrPropertyAccessArgumentExpressionOrName(node) {
if (ts.isPropertyAccessExpression(node)) {
return node.name;
}
var arg = skipParentheses(node.argumentExpression);
if (ts.isNumericLiteral(arg) || ts.isStringLiteralLike(arg)) {
return arg;
}
return node;
}
ts.getElementOrPropertyAccessArgumentExpressionOrName = getElementOrPropertyAccessArgumentExpressionOrName;
function getElementOrPropertyAccessName(node) {
var name = getElementOrPropertyAccessArgumentExpressionOrName(node);
if (name) {
if (ts.isIdentifier(name)) {
return name.escapedText;
}
if (ts.isStringLiteralLike(name) || ts.isNumericLiteral(name)) {
return ts.escapeLeadingUnderscores(name.text);
}
}
return undefined;
}
ts.getElementOrPropertyAccessName = getElementOrPropertyAccessName;
function getAssignmentDeclarationPropertyAccessKind(lhs) {
if (lhs.expression.kind === 108 /* ThisKeyword */) {
return 4 /* ThisProperty */;
}
else if (isModuleExportsAccessExpression(lhs)) {
// module.exports = expr
return 2 /* ModuleExports */;
}
else if (isBindableStaticNameExpression(lhs.expression, /*excludeThisKeyword*/ true)) {
if (isPrototypeAccess(lhs.expression)) {
// F.G....prototype.x = expr
return 3 /* PrototypeProperty */;
}
var nextToLast = lhs;
while (!ts.isIdentifier(nextToLast.expression)) {
nextToLast = nextToLast.expression;
}
var id = nextToLast.expression;
if ((id.escapedText === "exports" ||
id.escapedText === "module" && getElementOrPropertyAccessName(nextToLast) === "exports") &&
// ExportsProperty does not support binding with computed names
isBindableStaticAccessExpression(lhs)) {
// exports.name = expr OR module.exports.name = expr OR exports["name"] = expr ...
return 1 /* ExportsProperty */;
}
if (isBindableStaticNameExpression(lhs, /*excludeThisKeyword*/ true) || (ts.isElementAccessExpression(lhs) && isDynamicName(lhs))) {
// F.G...x = expr
return 5 /* Property */;
}
}
return 0 /* None */;
}
ts.getAssignmentDeclarationPropertyAccessKind = getAssignmentDeclarationPropertyAccessKind;
function getInitializerOfBinaryExpression(expr) {
while (ts.isBinaryExpression(expr.right)) {
expr = expr.right;
}
return expr.right;
}
ts.getInitializerOfBinaryExpression = getInitializerOfBinaryExpression;
function isPrototypePropertyAssignment(node) {
return ts.isBinaryExpression(node) && getAssignmentDeclarationKind(node) === 3 /* PrototypeProperty */;
}
ts.isPrototypePropertyAssignment = isPrototypePropertyAssignment;
function isSpecialPropertyDeclaration(expr) {
return isInJSFile(expr) &&
expr.parent && expr.parent.kind === 236 /* ExpressionStatement */ &&
(!ts.isElementAccessExpression(expr) || isLiteralLikeElementAccess(expr)) &&
!!ts.getJSDocTypeTag(expr.parent);
}
ts.isSpecialPropertyDeclaration = isSpecialPropertyDeclaration;
function setValueDeclaration(symbol, node) {
var valueDeclaration = symbol.valueDeclaration;
if (!valueDeclaration ||
!(node.flags & 8388608 /* Ambient */ && !(valueDeclaration.flags & 8388608 /* Ambient */)) &&
(isAssignmentDeclaration(valueDeclaration) && !isAssignmentDeclaration(node)) ||
(valueDeclaration.kind !== node.kind && isEffectiveModuleDeclaration(valueDeclaration))) {
// other kinds of value declarations take precedence over modules and assignment declarations
symbol.valueDeclaration = node;
}
}
ts.setValueDeclaration = setValueDeclaration;
function isFunctionSymbol(symbol) {
if (!symbol || !symbol.valueDeclaration) {
return false;
}
var decl = symbol.valueDeclaration;
return decl.kind === 254 /* FunctionDeclaration */ || ts.isVariableDeclaration(decl) && decl.initializer && ts.isFunctionLike(decl.initializer);
}
ts.isFunctionSymbol = isFunctionSymbol;
function tryGetModuleSpecifierFromDeclaration(node) {
var _a, _b, _c;
switch (node.kind) {
case 252 /* VariableDeclaration */:
return node.initializer.arguments[0].text;
case 264 /* ImportDeclaration */:
return (_a = ts.tryCast(node.moduleSpecifier, ts.isStringLiteralLike)) === null || _a === void 0 ? void 0 : _a.text;
case 263 /* ImportEqualsDeclaration */:
return (_c = ts.tryCast((_b = ts.tryCast(node.moduleReference, ts.isExternalModuleReference)) === null || _b === void 0 ? void 0 : _b.expression, ts.isStringLiteralLike)) === null || _c === void 0 ? void 0 : _c.text;
default:
ts.Debug.assertNever(node);
}
}
ts.tryGetModuleSpecifierFromDeclaration = tryGetModuleSpecifierFromDeclaration;
function importFromModuleSpecifier(node) {
return tryGetImportFromModuleSpecifier(node) || ts.Debug.failBadSyntaxKind(node.parent);
}
ts.importFromModuleSpecifier = importFromModuleSpecifier;
function tryGetImportFromModuleSpecifier(node) {
switch (node.parent.kind) {
case 264 /* ImportDeclaration */:
case 270 /* ExportDeclaration */:
return node.parent;
case 275 /* ExternalModuleReference */:
return node.parent.parent;
case 206 /* CallExpression */:
return isImportCall(node.parent) || isRequireCall(node.parent, /*checkArg*/ false) ? node.parent : undefined;
case 194 /* LiteralType */:
ts.Debug.assert(ts.isStringLiteral(node));
return ts.tryCast(node.parent.parent, ts.isImportTypeNode);
default:
return undefined;
}
}
ts.tryGetImportFromModuleSpecifier = tryGetImportFromModuleSpecifier;
function getExternalModuleName(node) {
switch (node.kind) {
case 264 /* ImportDeclaration */:
case 270 /* ExportDeclaration */:
return node.moduleSpecifier;
case 263 /* ImportEqualsDeclaration */:
return node.moduleReference.kind === 275 /* ExternalModuleReference */ ? node.moduleReference.expression : undefined;
case 198 /* ImportType */:
return isLiteralImportTypeNode(node) ? node.argument.literal : undefined;
case 206 /* CallExpression */:
return node.arguments[0];
case 259 /* ModuleDeclaration */:
return node.name.kind === 10 /* StringLiteral */ ? node.name : undefined;
default:
return ts.Debug.assertNever(node);
}
}
ts.getExternalModuleName = getExternalModuleName;
function getNamespaceDeclarationNode(node) {
switch (node.kind) {
case 264 /* ImportDeclaration */:
return node.importClause && ts.tryCast(node.importClause.namedBindings, ts.isNamespaceImport);
case 263 /* ImportEqualsDeclaration */:
return node;
case 270 /* ExportDeclaration */:
return node.exportClause && ts.tryCast(node.exportClause, ts.isNamespaceExport);
default:
return ts.Debug.assertNever(node);
}
}
ts.getNamespaceDeclarationNode = getNamespaceDeclarationNode;
function isDefaultImport(node) {
return node.kind === 264 /* ImportDeclaration */ && !!node.importClause && !!node.importClause.name;
}
ts.isDefaultImport = isDefaultImport;
function forEachImportClauseDeclaration(node, action) {
if (node.name) {
var result = action(node);
if (result)
return result;
}
if (node.namedBindings) {
var result = ts.isNamespaceImport(node.namedBindings)
? action(node.namedBindings)
: ts.forEach(node.namedBindings.elements, action);
if (result)
return result;
}
}
ts.forEachImportClauseDeclaration = forEachImportClauseDeclaration;
function hasQuestionToken(node) {
if (node) {
switch (node.kind) {
case 162 /* Parameter */:
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
case 292 /* ShorthandPropertyAssignment */:
case 291 /* PropertyAssignment */:
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
return node.questionToken !== undefined;
}
}
return false;
}
ts.hasQuestionToken = hasQuestionToken;
function isJSDocConstructSignature(node) {
var param = ts.isJSDocFunctionType(node) ? ts.firstOrUndefined(node.parameters) : undefined;
var name = ts.tryCast(param && param.name, ts.isIdentifier);
return !!name && name.escapedText === "new";
}
ts.isJSDocConstructSignature = isJSDocConstructSignature;
function isJSDocTypeAlias(node) {
return node.kind === 340 /* JSDocTypedefTag */ || node.kind === 333 /* JSDocCallbackTag */ || node.kind === 334 /* JSDocEnumTag */;
}
ts.isJSDocTypeAlias = isJSDocTypeAlias;
function isTypeAlias(node) {
return isJSDocTypeAlias(node) || ts.isTypeAliasDeclaration(node);
}
ts.isTypeAlias = isTypeAlias;
function getSourceOfAssignment(node) {
return ts.isExpressionStatement(node) &&
ts.isBinaryExpression(node.expression) &&
node.expression.operatorToken.kind === 63 /* EqualsToken */
? getRightMostAssignedExpression(node.expression)
: undefined;
}
function getSourceOfDefaultedAssignment(node) {
return ts.isExpressionStatement(node) &&
ts.isBinaryExpression(node.expression) &&
getAssignmentDeclarationKind(node.expression) !== 0 /* None */ &&
ts.isBinaryExpression(node.expression.right) &&
(node.expression.right.operatorToken.kind === 56 /* BarBarToken */ || node.expression.right.operatorToken.kind === 60 /* QuestionQuestionToken */)
? node.expression.right.right
: undefined;
}
function getSingleInitializerOfVariableStatementOrPropertyDeclaration(node) {
switch (node.kind) {
case 235 /* VariableStatement */:
var v = getSingleVariableOfVariableStatement(node);
return v && v.initializer;
case 165 /* PropertyDeclaration */:
return node.initializer;
case 291 /* PropertyAssignment */:
return node.initializer;
}
}
ts.getSingleInitializerOfVariableStatementOrPropertyDeclaration = getSingleInitializerOfVariableStatementOrPropertyDeclaration;
function getSingleVariableOfVariableStatement(node) {
return ts.isVariableStatement(node) ? ts.firstOrUndefined(node.declarationList.declarations) : undefined;
}
ts.getSingleVariableOfVariableStatement = getSingleVariableOfVariableStatement;
function getNestedModuleDeclaration(node) {
return ts.isModuleDeclaration(node) &&
node.body &&
node.body.kind === 259 /* ModuleDeclaration */
? node.body
: undefined;
}
function getJSDocCommentsAndTags(hostNode, noCache) {
var result;
// Pull parameter comments from declaring function as well
if (isVariableLike(hostNode) && ts.hasInitializer(hostNode) && ts.hasJSDocNodes(hostNode.initializer)) {
result = ts.append(result, ts.last(hostNode.initializer.jsDoc));
}
var node = hostNode;
while (node && node.parent) {
if (ts.hasJSDocNodes(node)) {
result = ts.append(result, ts.last(node.jsDoc));
}
if (node.kind === 162 /* Parameter */) {
result = ts.addRange(result, (noCache ? ts.getJSDocParameterTagsNoCache : ts.getJSDocParameterTags)(node));
break;
}
if (node.kind === 161 /* TypeParameter */) {
result = ts.addRange(result, (noCache ? ts.getJSDocTypeParameterTagsNoCache : ts.getJSDocTypeParameterTags)(node));
break;
}
node = getNextJSDocCommentLocation(node);
}
return result || ts.emptyArray;
}
ts.getJSDocCommentsAndTags = getJSDocCommentsAndTags;
function getNextJSDocCommentLocation(node) {
var parent = node.parent;
if (parent.kind === 291 /* PropertyAssignment */ ||
parent.kind === 269 /* ExportAssignment */ ||
parent.kind === 165 /* PropertyDeclaration */ ||
parent.kind === 236 /* ExpressionStatement */ && node.kind === 204 /* PropertyAccessExpression */ ||
parent.kind === 245 /* ReturnStatement */ ||
getNestedModuleDeclaration(parent) ||
ts.isBinaryExpression(node) && node.operatorToken.kind === 63 /* EqualsToken */) {
return parent;
}
// Try to recognize this pattern when node is initializer of variable declaration and JSDoc comments are on containing variable statement.
// /**
// * @param {number} name
// * @returns {number}
// */
// var x = function(name) { return name.length; }
else if (parent.parent &&
(getSingleVariableOfVariableStatement(parent.parent) === node ||
ts.isBinaryExpression(parent) && parent.operatorToken.kind === 63 /* EqualsToken */)) {
return parent.parent;
}
else if (parent.parent && parent.parent.parent &&
(getSingleVariableOfVariableStatement(parent.parent.parent) ||
getSingleInitializerOfVariableStatementOrPropertyDeclaration(parent.parent.parent) === node ||
getSourceOfDefaultedAssignment(parent.parent.parent))) {
return parent.parent.parent;
}
}
ts.getNextJSDocCommentLocation = getNextJSDocCommentLocation;
/** Does the opposite of `getJSDocParameterTags`: given a JSDoc parameter, finds the parameter corresponding to it. */
function getParameterSymbolFromJSDoc(node) {
if (node.symbol) {
return node.symbol;
}
if (!ts.isIdentifier(node.name)) {
return undefined;
}
var name = node.name.escapedText;
var decl = getHostSignatureFromJSDoc(node);
if (!decl) {
return undefined;
}
var parameter = ts.find(decl.parameters, function (p) { return p.name.kind === 79 /* Identifier */ && p.name.escapedText === name; });
return parameter && parameter.symbol;
}
ts.getParameterSymbolFromJSDoc = getParameterSymbolFromJSDoc;
function getHostSignatureFromJSDoc(node) {
var host = getEffectiveJSDocHost(node);
return host && ts.isFunctionLike(host) ? host : undefined;
}
ts.getHostSignatureFromJSDoc = getHostSignatureFromJSDoc;
function getEffectiveJSDocHost(node) {
var host = getJSDocHost(node);
if (host) {
return getSourceOfDefaultedAssignment(host)
|| getSourceOfAssignment(host)
|| getSingleInitializerOfVariableStatementOrPropertyDeclaration(host)
|| getSingleVariableOfVariableStatement(host)
|| getNestedModuleDeclaration(host)
|| host;
}
}
ts.getEffectiveJSDocHost = getEffectiveJSDocHost;
/** Use getEffectiveJSDocHost if you additionally need to look for jsdoc on parent nodes, like assignments. */
function getJSDocHost(node) {
var jsDoc = getJSDocRoot(node);
if (!jsDoc) {
return undefined;
}
var host = jsDoc.parent;
if (host && host.jsDoc && jsDoc === ts.lastOrUndefined(host.jsDoc)) {
return host;
}
}
ts.getJSDocHost = getJSDocHost;
function getJSDocRoot(node) {
return ts.findAncestor(node.parent, ts.isJSDoc);
}
ts.getJSDocRoot = getJSDocRoot;
function getTypeParameterFromJsDoc(node) {
var name = node.name.escapedText;
var typeParameters = node.parent.parent.parent.typeParameters;
return typeParameters && ts.find(typeParameters, function (p) { return p.name.escapedText === name; });
}
ts.getTypeParameterFromJsDoc = getTypeParameterFromJsDoc;
function hasRestParameter(s) {
var last = ts.lastOrUndefined(s.parameters);
return !!last && isRestParameter(last);
}
ts.hasRestParameter = hasRestParameter;
function isRestParameter(node) {
var type = ts.isJSDocParameterTag(node) ? (node.typeExpression && node.typeExpression.type) : node.type;
return node.dotDotDotToken !== undefined || !!type && type.kind === 313 /* JSDocVariadicType */;
}
ts.isRestParameter = isRestParameter;
function hasTypeArguments(node) {
return !!node.typeArguments;
}
ts.hasTypeArguments = hasTypeArguments;
var AssignmentKind;
(function (AssignmentKind) {
AssignmentKind[AssignmentKind["None"] = 0] = "None";
AssignmentKind[AssignmentKind["Definite"] = 1] = "Definite";
AssignmentKind[AssignmentKind["Compound"] = 2] = "Compound";
})(AssignmentKind = ts.AssignmentKind || (ts.AssignmentKind = {}));
function getAssignmentTargetKind(node) {
var parent = node.parent;
while (true) {
switch (parent.kind) {
case 219 /* BinaryExpression */:
var binaryOperator = parent.operatorToken.kind;
return isAssignmentOperator(binaryOperator) && parent.left === node ?
binaryOperator === 63 /* EqualsToken */ || isLogicalOrCoalescingAssignmentOperator(binaryOperator) ? 1 /* Definite */ : 2 /* Compound */ :
0 /* None */;
case 217 /* PrefixUnaryExpression */:
case 218 /* PostfixUnaryExpression */:
var unaryOperator = parent.operator;
return unaryOperator === 45 /* PlusPlusToken */ || unaryOperator === 46 /* MinusMinusToken */ ? 2 /* Compound */ : 0 /* None */;
case 241 /* ForInStatement */:
case 242 /* ForOfStatement */:
return parent.initializer === node ? 1 /* Definite */ : 0 /* None */;
case 210 /* ParenthesizedExpression */:
case 202 /* ArrayLiteralExpression */:
case 223 /* SpreadElement */:
case 228 /* NonNullExpression */:
node = parent;
break;
case 293 /* SpreadAssignment */:
node = parent.parent;
break;
case 292 /* ShorthandPropertyAssignment */:
if (parent.name !== node) {
return 0 /* None */;
}
node = parent.parent;
break;
case 291 /* PropertyAssignment */:
if (parent.name === node) {
return 0 /* None */;
}
node = parent.parent;
break;
default:
return 0 /* None */;
}
parent = node.parent;
}
}
ts.getAssignmentTargetKind = getAssignmentTargetKind;
// A node is an assignment target if it is on the left hand side of an '=' token, if it is parented by a property
// assignment in an object literal that is an assignment target, or if it is parented by an array literal that is
// an assignment target. Examples include 'a = xxx', '{ p: a } = xxx', '[{ a }] = xxx'.
// (Note that `p` is not a target in the above examples, only `a`.)
function isAssignmentTarget(node) {
return getAssignmentTargetKind(node) !== 0 /* None */;
}
ts.isAssignmentTarget = isAssignmentTarget;
/**
* Indicates whether a node could contain a `var` VariableDeclarationList that contributes to
* the same `var` declaration scope as the node's parent.
*/
function isNodeWithPossibleHoistedDeclaration(node) {
switch (node.kind) {
case 233 /* Block */:
case 235 /* VariableStatement */:
case 246 /* WithStatement */:
case 237 /* IfStatement */:
case 247 /* SwitchStatement */:
case 261 /* CaseBlock */:
case 287 /* CaseClause */:
case 288 /* DefaultClause */:
case 248 /* LabeledStatement */:
case 240 /* ForStatement */:
case 241 /* ForInStatement */:
case 242 /* ForOfStatement */:
case 238 /* DoStatement */:
case 239 /* WhileStatement */:
case 250 /* TryStatement */:
case 290 /* CatchClause */:
return true;
}
return false;
}
ts.isNodeWithPossibleHoistedDeclaration = isNodeWithPossibleHoistedDeclaration;
function isValueSignatureDeclaration(node) {
return ts.isFunctionExpression(node) || ts.isArrowFunction(node) || ts.isMethodOrAccessor(node) || ts.isFunctionDeclaration(node) || ts.isConstructorDeclaration(node);
}
ts.isValueSignatureDeclaration = isValueSignatureDeclaration;
function walkUp(node, kind) {
while (node && node.kind === kind) {
node = node.parent;
}
return node;
}
function walkUpParenthesizedTypes(node) {
return walkUp(node, 189 /* ParenthesizedType */);
}
ts.walkUpParenthesizedTypes = walkUpParenthesizedTypes;
function walkUpParenthesizedExpressions(node) {
return walkUp(node, 210 /* ParenthesizedExpression */);
}
ts.walkUpParenthesizedExpressions = walkUpParenthesizedExpressions;
/**
* Walks up parenthesized types.
* It returns both the outermost parenthesized type and its parent.
* If given node is not a parenthesiezd type, undefined is return as the former.
*/
function walkUpParenthesizedTypesAndGetParentAndChild(node) {
var child;
while (node && node.kind === 189 /* ParenthesizedType */) {
child = node;
node = node.parent;
}
return [child, node];
}
ts.walkUpParenthesizedTypesAndGetParentAndChild = walkUpParenthesizedTypesAndGetParentAndChild;
function skipParentheses(node) {
return ts.skipOuterExpressions(node, 1 /* Parentheses */);
}
ts.skipParentheses = skipParentheses;
// a node is delete target iff. it is PropertyAccessExpression/ElementAccessExpression with parentheses skipped
function isDeleteTarget(node) {
if (node.kind !== 204 /* PropertyAccessExpression */ && node.kind !== 205 /* ElementAccessExpression */) {
return false;
}
node = walkUpParenthesizedExpressions(node.parent);
return node && node.kind === 213 /* DeleteExpression */;
}
ts.isDeleteTarget = isDeleteTarget;
function isNodeDescendantOf(node, ancestor) {
while (node) {
if (node === ancestor)
return true;
node = node.parent;
}
return false;
}
ts.isNodeDescendantOf = isNodeDescendantOf;
// True if `name` is the name of a declaration node
function isDeclarationName(name) {
return !ts.isSourceFile(name) && !ts.isBindingPattern(name) && ts.isDeclaration(name.parent) && name.parent.name === name;
}
ts.isDeclarationName = isDeclarationName;
// See GH#16030
function getDeclarationFromName(name) {
var parent = name.parent;
switch (name.kind) {
case 10 /* StringLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
case 8 /* NumericLiteral */:
if (ts.isComputedPropertyName(parent))
return parent.parent;
// falls through
case 79 /* Identifier */:
if (ts.isDeclaration(parent)) {
return parent.name === name ? parent : undefined;
}
else if (ts.isQualifiedName(parent)) {
var tag = parent.parent;
return ts.isJSDocParameterTag(tag) && tag.name === parent ? tag : undefined;
}
else {
var binExp = parent.parent;
return ts.isBinaryExpression(binExp) &&
getAssignmentDeclarationKind(binExp) !== 0 /* None */ &&
(binExp.left.symbol || binExp.symbol) &&
ts.getNameOfDeclaration(binExp) === name
? binExp
: undefined;
}
case 80 /* PrivateIdentifier */:
return ts.isDeclaration(parent) && parent.name === name ? parent : undefined;
default:
return undefined;
}
}
ts.getDeclarationFromName = getDeclarationFromName;
function isLiteralComputedPropertyDeclarationName(node) {
return isStringOrNumericLiteralLike(node) &&
node.parent.kind === 160 /* ComputedPropertyName */ &&
ts.isDeclaration(node.parent.parent);
}
ts.isLiteralComputedPropertyDeclarationName = isLiteralComputedPropertyDeclarationName;
// Return true if the given identifier is classified as an IdentifierName
function isIdentifierName(node) {
var parent = node.parent;
switch (parent.kind) {
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 294 /* EnumMember */:
case 291 /* PropertyAssignment */:
case 204 /* PropertyAccessExpression */:
// Name in member declaration or property name in property access
return parent.name === node;
case 159 /* QualifiedName */:
// Name on right hand side of dot in a type query or type reference
return parent.right === node;
case 201 /* BindingElement */:
case 268 /* ImportSpecifier */:
// Property name in binding element or import specifier
return parent.propertyName === node;
case 273 /* ExportSpecifier */:
case 283 /* JsxAttribute */:
// Any name in an export specifier or JSX Attribute
return true;
}
return false;
}
ts.isIdentifierName = isIdentifierName;
// An alias symbol is created by one of the following declarations:
// import <symbol> = ...
// import <symbol> from ...
// import * as <symbol> from ...
// import { x as <symbol> } from ...
// export { x as <symbol> } from ...
// export * as ns <symbol> from ...
// export = <EntityNameExpression>
// export default <EntityNameExpression>
// module.exports = <EntityNameExpression>
// {<Identifier>}
// {name: <EntityNameExpression>}
function isAliasSymbolDeclaration(node) {
return node.kind === 263 /* ImportEqualsDeclaration */ ||
node.kind === 262 /* NamespaceExportDeclaration */ ||
node.kind === 265 /* ImportClause */ && !!node.name ||
node.kind === 266 /* NamespaceImport */ ||
node.kind === 272 /* NamespaceExport */ ||
node.kind === 268 /* ImportSpecifier */ ||
node.kind === 273 /* ExportSpecifier */ ||
node.kind === 269 /* ExportAssignment */ && exportAssignmentIsAlias(node) ||
ts.isBinaryExpression(node) && getAssignmentDeclarationKind(node) === 2 /* ModuleExports */ && exportAssignmentIsAlias(node) ||
ts.isPropertyAccessExpression(node) && ts.isBinaryExpression(node.parent) && node.parent.left === node && node.parent.operatorToken.kind === 63 /* EqualsToken */ && isAliasableExpression(node.parent.right) ||
node.kind === 292 /* ShorthandPropertyAssignment */ ||
node.kind === 291 /* PropertyAssignment */ && isAliasableExpression(node.initializer);
}
ts.isAliasSymbolDeclaration = isAliasSymbolDeclaration;
function getAliasDeclarationFromName(node) {
switch (node.parent.kind) {
case 265 /* ImportClause */:
case 268 /* ImportSpecifier */:
case 266 /* NamespaceImport */:
case 273 /* ExportSpecifier */:
case 269 /* ExportAssignment */:
case 263 /* ImportEqualsDeclaration */:
return node.parent;
case 159 /* QualifiedName */:
do {
node = node.parent;
} while (node.parent.kind === 159 /* QualifiedName */);
return getAliasDeclarationFromName(node);
}
}
ts.getAliasDeclarationFromName = getAliasDeclarationFromName;
function isAliasableExpression(e) {
return isEntityNameExpression(e) || ts.isClassExpression(e);
}
ts.isAliasableExpression = isAliasableExpression;
function exportAssignmentIsAlias(node) {
var e = getExportAssignmentExpression(node);
return isAliasableExpression(e);
}
ts.exportAssignmentIsAlias = exportAssignmentIsAlias;
function getExportAssignmentExpression(node) {
return ts.isExportAssignment(node) ? node.expression : node.right;
}
ts.getExportAssignmentExpression = getExportAssignmentExpression;
function getPropertyAssignmentAliasLikeExpression(node) {
return node.kind === 292 /* ShorthandPropertyAssignment */ ? node.name : node.kind === 291 /* PropertyAssignment */ ? node.initializer :
node.parent.right;
}
ts.getPropertyAssignmentAliasLikeExpression = getPropertyAssignmentAliasLikeExpression;
function getEffectiveBaseTypeNode(node) {
var baseType = getClassExtendsHeritageElement(node);
if (baseType && isInJSFile(node)) {
// Prefer an @augments tag because it may have type parameters.
var tag = ts.getJSDocAugmentsTag(node);
if (tag) {
return tag.class;
}
}
return baseType;
}
ts.getEffectiveBaseTypeNode = getEffectiveBaseTypeNode;
function getClassExtendsHeritageElement(node) {
var heritageClause = getHeritageClause(node.heritageClauses, 94 /* ExtendsKeyword */);
return heritageClause && heritageClause.types.length > 0 ? heritageClause.types[0] : undefined;
}
ts.getClassExtendsHeritageElement = getClassExtendsHeritageElement;
function getEffectiveImplementsTypeNodes(node) {
if (isInJSFile(node)) {
return ts.getJSDocImplementsTags(node).map(function (n) { return n.class; });
}
else {
var heritageClause = getHeritageClause(node.heritageClauses, 117 /* ImplementsKeyword */);
return heritageClause === null || heritageClause === void 0 ? void 0 : heritageClause.types;
}
}
ts.getEffectiveImplementsTypeNodes = getEffectiveImplementsTypeNodes;
/** Returns the node in an `extends` or `implements` clause of a class or interface. */
function getAllSuperTypeNodes(node) {
return ts.isInterfaceDeclaration(node) ? getInterfaceBaseTypeNodes(node) || ts.emptyArray :
ts.isClassLike(node) ? ts.concatenate(ts.singleElementArray(getEffectiveBaseTypeNode(node)), getEffectiveImplementsTypeNodes(node)) || ts.emptyArray :
ts.emptyArray;
}
ts.getAllSuperTypeNodes = getAllSuperTypeNodes;
function getInterfaceBaseTypeNodes(node) {
var heritageClause = getHeritageClause(node.heritageClauses, 94 /* ExtendsKeyword */);
return heritageClause ? heritageClause.types : undefined;
}
ts.getInterfaceBaseTypeNodes = getInterfaceBaseTypeNodes;
function getHeritageClause(clauses, kind) {
if (clauses) {
for (var _i = 0, clauses_1 = clauses; _i < clauses_1.length; _i++) {
var clause = clauses_1[_i];
if (clause.token === kind) {
return clause;
}
}
}
return undefined;
}
ts.getHeritageClause = getHeritageClause;
function getAncestor(node, kind) {
while (node) {
if (node.kind === kind) {
return node;
}
node = node.parent;
}
return undefined;
}
ts.getAncestor = getAncestor;
function isKeyword(token) {
return 81 /* FirstKeyword */ <= token && token <= 158 /* LastKeyword */;
}
ts.isKeyword = isKeyword;
function isContextualKeyword(token) {
return 126 /* FirstContextualKeyword */ <= token && token <= 158 /* LastContextualKeyword */;
}
ts.isContextualKeyword = isContextualKeyword;
function isNonContextualKeyword(token) {
return isKeyword(token) && !isContextualKeyword(token);
}
ts.isNonContextualKeyword = isNonContextualKeyword;
function isFutureReservedKeyword(token) {
return 117 /* FirstFutureReservedWord */ <= token && token <= 125 /* LastFutureReservedWord */;
}
ts.isFutureReservedKeyword = isFutureReservedKeyword;
function isStringANonContextualKeyword(name) {
var token = ts.stringToToken(name);
return token !== undefined && isNonContextualKeyword(token);
}
ts.isStringANonContextualKeyword = isStringANonContextualKeyword;
function isStringAKeyword(name) {
var token = ts.stringToToken(name);
return token !== undefined && isKeyword(token);
}
ts.isStringAKeyword = isStringAKeyword;
function isIdentifierANonContextualKeyword(_a) {
var originalKeywordKind = _a.originalKeywordKind;
return !!originalKeywordKind && !isContextualKeyword(originalKeywordKind);
}
ts.isIdentifierANonContextualKeyword = isIdentifierANonContextualKeyword;
function isTrivia(token) {
return 2 /* FirstTriviaToken */ <= token && token <= 7 /* LastTriviaToken */;
}
ts.isTrivia = isTrivia;
var FunctionFlags;
(function (FunctionFlags) {
FunctionFlags[FunctionFlags["Normal"] = 0] = "Normal";
FunctionFlags[FunctionFlags["Generator"] = 1] = "Generator";
FunctionFlags[FunctionFlags["Async"] = 2] = "Async";
FunctionFlags[FunctionFlags["Invalid"] = 4] = "Invalid";
FunctionFlags[FunctionFlags["AsyncGenerator"] = 3] = "AsyncGenerator";
})(FunctionFlags = ts.FunctionFlags || (ts.FunctionFlags = {}));
function getFunctionFlags(node) {
if (!node) {
return 4 /* Invalid */;
}
var flags = 0 /* Normal */;
switch (node.kind) {
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
case 167 /* MethodDeclaration */:
if (node.asteriskToken) {
flags |= 1 /* Generator */;
}
// falls through
case 212 /* ArrowFunction */:
if (hasSyntacticModifier(node, 256 /* Async */)) {
flags |= 2 /* Async */;
}
break;
}
if (!node.body) {
flags |= 4 /* Invalid */;
}
return flags;
}
ts.getFunctionFlags = getFunctionFlags;
function isAsyncFunction(node) {
switch (node.kind) {
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
case 167 /* MethodDeclaration */:
return node.body !== undefined
&& node.asteriskToken === undefined
&& hasSyntacticModifier(node, 256 /* Async */);
}
return false;
}
ts.isAsyncFunction = isAsyncFunction;
function isStringOrNumericLiteralLike(node) {
return ts.isStringLiteralLike(node) || ts.isNumericLiteral(node);
}
ts.isStringOrNumericLiteralLike = isStringOrNumericLiteralLike;
function isSignedNumericLiteral(node) {
return ts.isPrefixUnaryExpression(node) && (node.operator === 39 /* PlusToken */ || node.operator === 40 /* MinusToken */) && ts.isNumericLiteral(node.operand);
}
ts.isSignedNumericLiteral = isSignedNumericLiteral;
/**
* A declaration has a dynamic name if all of the following are true:
* 1. The declaration has a computed property name.
* 2. The computed name is *not* expressed as a StringLiteral.
* 3. The computed name is *not* expressed as a NumericLiteral.
* 4. The computed name is *not* expressed as a PlusToken or MinusToken
* immediately followed by a NumericLiteral.
*/
function hasDynamicName(declaration) {
var name = ts.getNameOfDeclaration(declaration);
return !!name && isDynamicName(name);
}
ts.hasDynamicName = hasDynamicName;
function isDynamicName(name) {
if (!(name.kind === 160 /* ComputedPropertyName */ || name.kind === 205 /* ElementAccessExpression */)) {
return false;
}
var expr = ts.isElementAccessExpression(name) ? skipParentheses(name.argumentExpression) : name.expression;
return !isStringOrNumericLiteralLike(expr) &&
!isSignedNumericLiteral(expr);
}
ts.isDynamicName = isDynamicName;
function getPropertyNameForPropertyNameNode(name) {
switch (name.kind) {
case 79 /* Identifier */:
case 80 /* PrivateIdentifier */:
return name.escapedText;
case 10 /* StringLiteral */:
case 8 /* NumericLiteral */:
return ts.escapeLeadingUnderscores(name.text);
case 160 /* ComputedPropertyName */:
var nameExpression = name.expression;
if (isStringOrNumericLiteralLike(nameExpression)) {
return ts.escapeLeadingUnderscores(nameExpression.text);
}
else if (isSignedNumericLiteral(nameExpression)) {
if (nameExpression.operator === 40 /* MinusToken */) {
return ts.tokenToString(nameExpression.operator) + nameExpression.operand.text;
}
return nameExpression.operand.text;
}
return undefined;
default:
return ts.Debug.assertNever(name);
}
}
ts.getPropertyNameForPropertyNameNode = getPropertyNameForPropertyNameNode;
function isPropertyNameLiteral(node) {
switch (node.kind) {
case 79 /* Identifier */:
case 10 /* StringLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
case 8 /* NumericLiteral */:
return true;
default:
return false;
}
}
ts.isPropertyNameLiteral = isPropertyNameLiteral;
function getTextOfIdentifierOrLiteral(node) {
return ts.isMemberName(node) ? ts.idText(node) : node.text;
}
ts.getTextOfIdentifierOrLiteral = getTextOfIdentifierOrLiteral;
function getEscapedTextOfIdentifierOrLiteral(node) {
return ts.isMemberName(node) ? node.escapedText : ts.escapeLeadingUnderscores(node.text);
}
ts.getEscapedTextOfIdentifierOrLiteral = getEscapedTextOfIdentifierOrLiteral;
function getPropertyNameForUniqueESSymbol(symbol) {
return "__@" + ts.getSymbolId(symbol) + "@" + symbol.escapedName;
}
ts.getPropertyNameForUniqueESSymbol = getPropertyNameForUniqueESSymbol;
function getSymbolNameForPrivateIdentifier(containingClassSymbol, description) {
return "__#" + ts.getSymbolId(containingClassSymbol) + "@" + description;
}
ts.getSymbolNameForPrivateIdentifier = getSymbolNameForPrivateIdentifier;
function isKnownSymbol(symbol) {
return ts.startsWith(symbol.escapedName, "__@");
}
ts.isKnownSymbol = isKnownSymbol;
function isPrivateIdentifierSymbol(symbol) {
return ts.startsWith(symbol.escapedName, "__#");
}
ts.isPrivateIdentifierSymbol = isPrivateIdentifierSymbol;
/**
* Includes the word "Symbol" with unicode escapes
*/
function isESSymbolIdentifier(node) {
return node.kind === 79 /* Identifier */ && node.escapedText === "Symbol";
}
ts.isESSymbolIdentifier = isESSymbolIdentifier;
function isPushOrUnshiftIdentifier(node) {
return node.escapedText === "push" || node.escapedText === "unshift";
}
ts.isPushOrUnshiftIdentifier = isPushOrUnshiftIdentifier;
function isParameterDeclaration(node) {
var root = getRootDeclaration(node);
return root.kind === 162 /* Parameter */;
}
ts.isParameterDeclaration = isParameterDeclaration;
function getRootDeclaration(node) {
while (node.kind === 201 /* BindingElement */) {
node = node.parent.parent;
}
return node;
}
ts.getRootDeclaration = getRootDeclaration;
function nodeStartsNewLexicalEnvironment(node) {
var kind = node.kind;
return kind === 169 /* Constructor */
|| kind === 211 /* FunctionExpression */
|| kind === 254 /* FunctionDeclaration */
|| kind === 212 /* ArrowFunction */
|| kind === 167 /* MethodDeclaration */
|| kind === 170 /* GetAccessor */
|| kind === 171 /* SetAccessor */
|| kind === 259 /* ModuleDeclaration */
|| kind === 300 /* SourceFile */;
}
ts.nodeStartsNewLexicalEnvironment = nodeStartsNewLexicalEnvironment;
function nodeIsSynthesized(range) {
return positionIsSynthesized(range.pos)
|| positionIsSynthesized(range.end);
}
ts.nodeIsSynthesized = nodeIsSynthesized;
function getOriginalSourceFile(sourceFile) {
return ts.getParseTreeNode(sourceFile, ts.isSourceFile) || sourceFile;
}
ts.getOriginalSourceFile = getOriginalSourceFile;
var Associativity;
(function (Associativity) {
Associativity[Associativity["Left"] = 0] = "Left";
Associativity[Associativity["Right"] = 1] = "Right";
})(Associativity = ts.Associativity || (ts.Associativity = {}));
function getExpressionAssociativity(expression) {
var operator = getOperator(expression);
var hasArguments = expression.kind === 207 /* NewExpression */ && expression.arguments !== undefined;
return getOperatorAssociativity(expression.kind, operator, hasArguments);
}
ts.getExpressionAssociativity = getExpressionAssociativity;
function getOperatorAssociativity(kind, operator, hasArguments) {
switch (kind) {
case 207 /* NewExpression */:
return hasArguments ? 0 /* Left */ : 1 /* Right */;
case 217 /* PrefixUnaryExpression */:
case 214 /* TypeOfExpression */:
case 215 /* VoidExpression */:
case 213 /* DeleteExpression */:
case 216 /* AwaitExpression */:
case 220 /* ConditionalExpression */:
case 222 /* YieldExpression */:
return 1 /* Right */;
case 219 /* BinaryExpression */:
switch (operator) {
case 42 /* AsteriskAsteriskToken */:
case 63 /* EqualsToken */:
case 64 /* PlusEqualsToken */:
case 65 /* MinusEqualsToken */:
case 67 /* AsteriskAsteriskEqualsToken */:
case 66 /* AsteriskEqualsToken */:
case 68 /* SlashEqualsToken */:
case 69 /* PercentEqualsToken */:
case 70 /* LessThanLessThanEqualsToken */:
case 71 /* GreaterThanGreaterThanEqualsToken */:
case 72 /* GreaterThanGreaterThanGreaterThanEqualsToken */:
case 73 /* AmpersandEqualsToken */:
case 78 /* CaretEqualsToken */:
case 74 /* BarEqualsToken */:
case 75 /* BarBarEqualsToken */:
case 76 /* AmpersandAmpersandEqualsToken */:
case 77 /* QuestionQuestionEqualsToken */:
return 1 /* Right */;
}
}
return 0 /* Left */;
}
ts.getOperatorAssociativity = getOperatorAssociativity;
function getExpressionPrecedence(expression) {
var operator = getOperator(expression);
var hasArguments = expression.kind === 207 /* NewExpression */ && expression.arguments !== undefined;
return getOperatorPrecedence(expression.kind, operator, hasArguments);
}
ts.getExpressionPrecedence = getExpressionPrecedence;
function getOperator(expression) {
if (expression.kind === 219 /* BinaryExpression */) {
return expression.operatorToken.kind;
}
else if (expression.kind === 217 /* PrefixUnaryExpression */ || expression.kind === 218 /* PostfixUnaryExpression */) {
return expression.operator;
}
else {
return expression.kind;
}
}
ts.getOperator = getOperator;
var OperatorPrecedence;
(function (OperatorPrecedence) {
// Expression:
// AssignmentExpression
// Expression `,` AssignmentExpression
OperatorPrecedence[OperatorPrecedence["Comma"] = 0] = "Comma";
// NOTE: `Spread` is higher than `Comma` due to how it is parsed in |ElementList|
// SpreadElement:
// `...` AssignmentExpression
OperatorPrecedence[OperatorPrecedence["Spread"] = 1] = "Spread";
// AssignmentExpression:
// ConditionalExpression
// YieldExpression
// ArrowFunction
// AsyncArrowFunction
// LeftHandSideExpression `=` AssignmentExpression
// LeftHandSideExpression AssignmentOperator AssignmentExpression
//
// NOTE: AssignmentExpression is broken down into several precedences due to the requirements
// of the parenthesizer rules.
// AssignmentExpression: YieldExpression
// YieldExpression:
// `yield`
// `yield` AssignmentExpression
// `yield` `*` AssignmentExpression
OperatorPrecedence[OperatorPrecedence["Yield"] = 2] = "Yield";
// AssignmentExpression: LeftHandSideExpression `=` AssignmentExpression
// AssignmentExpression: LeftHandSideExpression AssignmentOperator AssignmentExpression
// AssignmentOperator: one of
// `*=` `/=` `%=` `+=` `-=` `<<=` `>>=` `>>>=` `&=` `^=` `|=` `**=`
OperatorPrecedence[OperatorPrecedence["Assignment"] = 3] = "Assignment";
// NOTE: `Conditional` is considered higher than `Assignment` here, but in reality they have
// the same precedence.
// AssignmentExpression: ConditionalExpression
// ConditionalExpression:
// ShortCircuitExpression
// ShortCircuitExpression `?` AssignmentExpression `:` AssignmentExpression
// ShortCircuitExpression:
// LogicalORExpression
// CoalesceExpression
OperatorPrecedence[OperatorPrecedence["Conditional"] = 4] = "Conditional";
// CoalesceExpression:
// CoalesceExpressionHead `??` BitwiseORExpression
// CoalesceExpressionHead:
// CoalesceExpression
// BitwiseORExpression
OperatorPrecedence[OperatorPrecedence["Coalesce"] = 4] = "Coalesce";
// LogicalORExpression:
// LogicalANDExpression
// LogicalORExpression `||` LogicalANDExpression
OperatorPrecedence[OperatorPrecedence["LogicalOR"] = 5] = "LogicalOR";
// LogicalANDExpression:
// BitwiseORExpression
// LogicalANDExprerssion `&&` BitwiseORExpression
OperatorPrecedence[OperatorPrecedence["LogicalAND"] = 6] = "LogicalAND";
// BitwiseORExpression:
// BitwiseXORExpression
// BitwiseORExpression `^` BitwiseXORExpression
OperatorPrecedence[OperatorPrecedence["BitwiseOR"] = 7] = "BitwiseOR";
// BitwiseXORExpression:
// BitwiseANDExpression
// BitwiseXORExpression `^` BitwiseANDExpression
OperatorPrecedence[OperatorPrecedence["BitwiseXOR"] = 8] = "BitwiseXOR";
// BitwiseANDExpression:
// EqualityExpression
// BitwiseANDExpression `^` EqualityExpression
OperatorPrecedence[OperatorPrecedence["BitwiseAND"] = 9] = "BitwiseAND";
// EqualityExpression:
// RelationalExpression
// EqualityExpression `==` RelationalExpression
// EqualityExpression `!=` RelationalExpression
// EqualityExpression `===` RelationalExpression
// EqualityExpression `!==` RelationalExpression
OperatorPrecedence[OperatorPrecedence["Equality"] = 10] = "Equality";
// RelationalExpression:
// ShiftExpression
// RelationalExpression `<` ShiftExpression
// RelationalExpression `>` ShiftExpression
// RelationalExpression `<=` ShiftExpression
// RelationalExpression `>=` ShiftExpression
// RelationalExpression `instanceof` ShiftExpression
// RelationalExpression `in` ShiftExpression
// [+TypeScript] RelationalExpression `as` Type
OperatorPrecedence[OperatorPrecedence["Relational"] = 11] = "Relational";
// ShiftExpression:
// AdditiveExpression
// ShiftExpression `<<` AdditiveExpression
// ShiftExpression `>>` AdditiveExpression
// ShiftExpression `>>>` AdditiveExpression
OperatorPrecedence[OperatorPrecedence["Shift"] = 12] = "Shift";
// AdditiveExpression:
// MultiplicativeExpression
// AdditiveExpression `+` MultiplicativeExpression
// AdditiveExpression `-` MultiplicativeExpression
OperatorPrecedence[OperatorPrecedence["Additive"] = 13] = "Additive";
// MultiplicativeExpression:
// ExponentiationExpression
// MultiplicativeExpression MultiplicativeOperator ExponentiationExpression
// MultiplicativeOperator: one of `*`, `/`, `%`
OperatorPrecedence[OperatorPrecedence["Multiplicative"] = 14] = "Multiplicative";
// ExponentiationExpression:
// UnaryExpression
// UpdateExpression `**` ExponentiationExpression
OperatorPrecedence[OperatorPrecedence["Exponentiation"] = 15] = "Exponentiation";
// UnaryExpression:
// UpdateExpression
// `delete` UnaryExpression
// `void` UnaryExpression
// `typeof` UnaryExpression
// `+` UnaryExpression
// `-` UnaryExpression
// `~` UnaryExpression
// `!` UnaryExpression
// AwaitExpression
// UpdateExpression: // TODO: Do we need to investigate the precedence here?
// `++` UnaryExpression
// `--` UnaryExpression
OperatorPrecedence[OperatorPrecedence["Unary"] = 16] = "Unary";
// UpdateExpression:
// LeftHandSideExpression
// LeftHandSideExpression `++`
// LeftHandSideExpression `--`
OperatorPrecedence[OperatorPrecedence["Update"] = 17] = "Update";
// LeftHandSideExpression:
// NewExpression
// CallExpression
// NewExpression:
// MemberExpression
// `new` NewExpression
OperatorPrecedence[OperatorPrecedence["LeftHandSide"] = 18] = "LeftHandSide";
// CallExpression:
// CoverCallExpressionAndAsyncArrowHead
// SuperCall
// ImportCall
// CallExpression Arguments
// CallExpression `[` Expression `]`
// CallExpression `.` IdentifierName
// CallExpression TemplateLiteral
// MemberExpression:
// PrimaryExpression
// MemberExpression `[` Expression `]`
// MemberExpression `.` IdentifierName
// MemberExpression TemplateLiteral
// SuperProperty
// MetaProperty
// `new` MemberExpression Arguments
OperatorPrecedence[OperatorPrecedence["Member"] = 19] = "Member";
// TODO: JSXElement?
// PrimaryExpression:
// `this`
// IdentifierReference
// Literal
// ArrayLiteral
// ObjectLiteral
// FunctionExpression
// ClassExpression
// GeneratorExpression
// AsyncFunctionExpression
// AsyncGeneratorExpression
// RegularExpressionLiteral
// TemplateLiteral
// CoverParenthesizedExpressionAndArrowParameterList
OperatorPrecedence[OperatorPrecedence["Primary"] = 20] = "Primary";
OperatorPrecedence[OperatorPrecedence["Highest"] = 20] = "Highest";
OperatorPrecedence[OperatorPrecedence["Lowest"] = 0] = "Lowest";
// -1 is lower than all other precedences. Returning it will cause binary expression
// parsing to stop.
OperatorPrecedence[OperatorPrecedence["Invalid"] = -1] = "Invalid";
})(OperatorPrecedence = ts.OperatorPrecedence || (ts.OperatorPrecedence = {}));
function getOperatorPrecedence(nodeKind, operatorKind, hasArguments) {
switch (nodeKind) {
case 346 /* CommaListExpression */:
return 0 /* Comma */;
case 223 /* SpreadElement */:
return 1 /* Spread */;
case 222 /* YieldExpression */:
return 2 /* Yield */;
case 220 /* ConditionalExpression */:
return 4 /* Conditional */;
case 219 /* BinaryExpression */:
switch (operatorKind) {
case 27 /* CommaToken */:
return 0 /* Comma */;
case 63 /* EqualsToken */:
case 64 /* PlusEqualsToken */:
case 65 /* MinusEqualsToken */:
case 67 /* AsteriskAsteriskEqualsToken */:
case 66 /* AsteriskEqualsToken */:
case 68 /* SlashEqualsToken */:
case 69 /* PercentEqualsToken */:
case 70 /* LessThanLessThanEqualsToken */:
case 71 /* GreaterThanGreaterThanEqualsToken */:
case 72 /* GreaterThanGreaterThanGreaterThanEqualsToken */:
case 73 /* AmpersandEqualsToken */:
case 78 /* CaretEqualsToken */:
case 74 /* BarEqualsToken */:
case 75 /* BarBarEqualsToken */:
case 76 /* AmpersandAmpersandEqualsToken */:
case 77 /* QuestionQuestionEqualsToken */:
return 3 /* Assignment */;
default:
return getBinaryOperatorPrecedence(operatorKind);
}
// TODO: Should prefix `++` and `--` be moved to the `Update` precedence?
case 209 /* TypeAssertionExpression */:
case 228 /* NonNullExpression */:
case 217 /* PrefixUnaryExpression */:
case 214 /* TypeOfExpression */:
case 215 /* VoidExpression */:
case 213 /* DeleteExpression */:
case 216 /* AwaitExpression */:
return 16 /* Unary */;
case 218 /* PostfixUnaryExpression */:
return 17 /* Update */;
case 206 /* CallExpression */:
return 18 /* LeftHandSide */;
case 207 /* NewExpression */:
return hasArguments ? 19 /* Member */ : 18 /* LeftHandSide */;
case 208 /* TaggedTemplateExpression */:
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
case 229 /* MetaProperty */:
return 19 /* Member */;
case 227 /* AsExpression */:
return 11 /* Relational */;
case 108 /* ThisKeyword */:
case 106 /* SuperKeyword */:
case 79 /* Identifier */:
case 104 /* NullKeyword */:
case 110 /* TrueKeyword */:
case 95 /* FalseKeyword */:
case 8 /* NumericLiteral */:
case 9 /* BigIntLiteral */:
case 10 /* StringLiteral */:
case 202 /* ArrayLiteralExpression */:
case 203 /* ObjectLiteralExpression */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
case 224 /* ClassExpression */:
case 13 /* RegularExpressionLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
case 221 /* TemplateExpression */:
case 210 /* ParenthesizedExpression */:
case 225 /* OmittedExpression */:
case 276 /* JsxElement */:
case 277 /* JsxSelfClosingElement */:
case 280 /* JsxFragment */:
return 20 /* Primary */;
default:
return -1 /* Invalid */;
}
}
ts.getOperatorPrecedence = getOperatorPrecedence;
function getBinaryOperatorPrecedence(kind) {
switch (kind) {
case 60 /* QuestionQuestionToken */:
return 4 /* Coalesce */;
case 56 /* BarBarToken */:
return 5 /* LogicalOR */;
case 55 /* AmpersandAmpersandToken */:
return 6 /* LogicalAND */;
case 51 /* BarToken */:
return 7 /* BitwiseOR */;
case 52 /* CaretToken */:
return 8 /* BitwiseXOR */;
case 50 /* AmpersandToken */:
return 9 /* BitwiseAND */;
case 34 /* EqualsEqualsToken */:
case 35 /* ExclamationEqualsToken */:
case 36 /* EqualsEqualsEqualsToken */:
case 37 /* ExclamationEqualsEqualsToken */:
return 10 /* Equality */;
case 29 /* LessThanToken */:
case 31 /* GreaterThanToken */:
case 32 /* LessThanEqualsToken */:
case 33 /* GreaterThanEqualsToken */:
case 102 /* InstanceOfKeyword */:
case 101 /* InKeyword */:
case 127 /* AsKeyword */:
return 11 /* Relational */;
case 47 /* LessThanLessThanToken */:
case 48 /* GreaterThanGreaterThanToken */:
case 49 /* GreaterThanGreaterThanGreaterThanToken */:
return 12 /* Shift */;
case 39 /* PlusToken */:
case 40 /* MinusToken */:
return 13 /* Additive */;
case 41 /* AsteriskToken */:
case 43 /* SlashToken */:
case 44 /* PercentToken */:
return 14 /* Multiplicative */;
case 42 /* AsteriskAsteriskToken */:
return 15 /* Exponentiation */;
}
// -1 is lower than all other precedences. Returning it will cause binary expression
// parsing to stop.
return -1;
}
ts.getBinaryOperatorPrecedence = getBinaryOperatorPrecedence;
function getSemanticJsxChildren(children) {
return ts.filter(children, function (i) {
switch (i.kind) {
case 286 /* JsxExpression */:
return !!i.expression;
case 11 /* JsxText */:
return !i.containsOnlyTriviaWhiteSpaces;
default:
return true;
}
});
}
ts.getSemanticJsxChildren = getSemanticJsxChildren;
function createDiagnosticCollection() {
var nonFileDiagnostics = []; // See GH#19873
var filesWithDiagnostics = [];
var fileDiagnostics = new ts.Map();
var hasReadNonFileDiagnostics = false;
return {
add: add,
lookup: lookup,
getGlobalDiagnostics: getGlobalDiagnostics,
getDiagnostics: getDiagnostics,
};
function lookup(diagnostic) {
var diagnostics;
if (diagnostic.file) {
diagnostics = fileDiagnostics.get(diagnostic.file.fileName);
}
else {
diagnostics = nonFileDiagnostics;
}
if (!diagnostics) {
return undefined;
}
var result = ts.binarySearch(diagnostics, diagnostic, ts.identity, compareDiagnosticsSkipRelatedInformation);
if (result >= 0) {
return diagnostics[result];
}
return undefined;
}
function add(diagnostic) {
var diagnostics;
if (diagnostic.file) {
diagnostics = fileDiagnostics.get(diagnostic.file.fileName);
if (!diagnostics) {
diagnostics = []; // See GH#19873
fileDiagnostics.set(diagnostic.file.fileName, diagnostics);
ts.insertSorted(filesWithDiagnostics, diagnostic.file.fileName, ts.compareStringsCaseSensitive);
}
}
else {
// If we've already read the non-file diagnostics, do not modify the existing array.
if (hasReadNonFileDiagnostics) {
hasReadNonFileDiagnostics = false;
nonFileDiagnostics = nonFileDiagnostics.slice();
}
diagnostics = nonFileDiagnostics;
}
ts.insertSorted(diagnostics, diagnostic, compareDiagnostics);
}
function getGlobalDiagnostics() {
hasReadNonFileDiagnostics = true;
return nonFileDiagnostics;
}
function getDiagnostics(fileName) {
if (fileName) {
return fileDiagnostics.get(fileName) || [];
}
var fileDiags = ts.flatMapToMutable(filesWithDiagnostics, function (f) { return fileDiagnostics.get(f); });
if (!nonFileDiagnostics.length) {
return fileDiags;
}
fileDiags.unshift.apply(fileDiags, nonFileDiagnostics);
return fileDiags;
}
}
ts.createDiagnosticCollection = createDiagnosticCollection;
var templateSubstitutionRegExp = /\$\{/g;
function escapeTemplateSubstitution(str) {
return str.replace(templateSubstitutionRegExp, "\\${");
}
/** @internal */
function hasInvalidEscape(template) {
return template && !!(ts.isNoSubstitutionTemplateLiteral(template)
? template.templateFlags
: (template.head.templateFlags || ts.some(template.templateSpans, function (span) { return !!span.literal.templateFlags; })));
}
ts.hasInvalidEscape = hasInvalidEscape;
// This consists of the first 19 unprintable ASCII characters, canonical escapes, lineSeparator,
// paragraphSeparator, and nextLine. The latter three are just desirable to suppress new lines in
// the language service. These characters should be escaped when printing, and if any characters are added,
// the map below must be updated. Note that this regexp *does not* include the 'delete' character.
// There is no reason for this other than that JSON.stringify does not handle it either.
var doubleQuoteEscapedCharsRegExp = /[\\\"\u0000-\u001f\t\v\f\b\r\n\u2028\u2029\u0085]/g;
var singleQuoteEscapedCharsRegExp = /[\\\'\u0000-\u001f\t\v\f\b\r\n\u2028\u2029\u0085]/g;
// Template strings preserve simple LF newlines, still encode CRLF (or CR)
var backtickQuoteEscapedCharsRegExp = /\r\n|[\\\`\u0000-\u001f\t\v\f\b\r\u2028\u2029\u0085]/g;
var escapedCharsMap = new ts.Map(ts.getEntries({
"\t": "\\t",
"\v": "\\v",
"\f": "\\f",
"\b": "\\b",
"\r": "\\r",
"\n": "\\n",
"\\": "\\\\",
"\"": "\\\"",
"\'": "\\\'",
"\`": "\\\`",
"\u2028": "\\u2028",
"\u2029": "\\u2029",
"\u0085": "\\u0085",
"\r\n": "\\r\\n", // special case for CRLFs in backticks
}));
function encodeUtf16EscapeSequence(charCode) {
var hexCharCode = charCode.toString(16).toUpperCase();
var paddedHexCode = ("0000" + hexCharCode).slice(-4);
return "\\u" + paddedHexCode;
}
function getReplacement(c, offset, input) {
if (c.charCodeAt(0) === 0 /* nullCharacter */) {
var lookAhead = input.charCodeAt(offset + c.length);
if (lookAhead >= 48 /* _0 */ && lookAhead <= 57 /* _9 */) {
// If the null character is followed by digits, print as a hex escape to prevent the result from parsing as an octal (which is forbidden in strict mode)
return "\\x00";
}
// Otherwise, keep printing a literal \0 for the null character
return "\\0";
}
return escapedCharsMap.get(c) || encodeUtf16EscapeSequence(c.charCodeAt(0));
}
/**
* Based heavily on the abstract 'Quote'/'QuoteJSONString' operation from ECMA-262 (24.3.2.2),
* but augmented for a few select characters (e.g. lineSeparator, paragraphSeparator, nextLine)
* Note that this doesn't actually wrap the input in double quotes.
*/
function escapeString(s, quoteChar) {
var escapedCharsRegExp = quoteChar === 96 /* backtick */ ? backtickQuoteEscapedCharsRegExp :
quoteChar === 39 /* singleQuote */ ? singleQuoteEscapedCharsRegExp :
doubleQuoteEscapedCharsRegExp;
return s.replace(escapedCharsRegExp, getReplacement);
}
ts.escapeString = escapeString;
var nonAsciiCharacters = /[^\u0000-\u007F]/g;
function escapeNonAsciiString(s, quoteChar) {
s = escapeString(s, quoteChar);
// Replace non-ASCII characters with '\uNNNN' escapes if any exist.
// Otherwise just return the original string.
return nonAsciiCharacters.test(s) ?
s.replace(nonAsciiCharacters, function (c) { return encodeUtf16EscapeSequence(c.charCodeAt(0)); }) :
s;
}
ts.escapeNonAsciiString = escapeNonAsciiString;
// This consists of the first 19 unprintable ASCII characters, JSX canonical escapes, lineSeparator,
// paragraphSeparator, and nextLine. The latter three are just desirable to suppress new lines in
// the language service. These characters should be escaped when printing, and if any characters are added,
// the map below must be updated.
var jsxDoubleQuoteEscapedCharsRegExp = /[\"\u0000-\u001f\u2028\u2029\u0085]/g;
var jsxSingleQuoteEscapedCharsRegExp = /[\'\u0000-\u001f\u2028\u2029\u0085]/g;
var jsxEscapedCharsMap = new ts.Map(ts.getEntries({
"\"": "&quot;",
"\'": "&apos;"
}));
function encodeJsxCharacterEntity(charCode) {
var hexCharCode = charCode.toString(16).toUpperCase();
return "&#x" + hexCharCode + ";";
}
function getJsxAttributeStringReplacement(c) {
if (c.charCodeAt(0) === 0 /* nullCharacter */) {
return "&#0;";
}
return jsxEscapedCharsMap.get(c) || encodeJsxCharacterEntity(c.charCodeAt(0));
}
function escapeJsxAttributeString(s, quoteChar) {
var escapedCharsRegExp = quoteChar === 39 /* singleQuote */ ? jsxSingleQuoteEscapedCharsRegExp :
jsxDoubleQuoteEscapedCharsRegExp;
return s.replace(escapedCharsRegExp, getJsxAttributeStringReplacement);
}
ts.escapeJsxAttributeString = escapeJsxAttributeString;
/**
* Strip off existed surrounding single quotes, double quotes, or backticks from a given string
*
* @return non-quoted string
*/
function stripQuotes(name) {
var length = name.length;
if (length >= 2 && name.charCodeAt(0) === name.charCodeAt(length - 1) && isQuoteOrBacktick(name.charCodeAt(0))) {
return name.substring(1, length - 1);
}
return name;
}
ts.stripQuotes = stripQuotes;
function isQuoteOrBacktick(charCode) {
return charCode === 39 /* singleQuote */ ||
charCode === 34 /* doubleQuote */ ||
charCode === 96 /* backtick */;
}
function isIntrinsicJsxName(name) {
var ch = name.charCodeAt(0);
return (ch >= 97 /* a */ && ch <= 122 /* z */) || ts.stringContains(name, "-") || ts.stringContains(name, ":");
}
ts.isIntrinsicJsxName = isIntrinsicJsxName;
var indentStrings = ["", " "];
function getIndentString(level) {
// prepopulate cache
var singleLevel = indentStrings[1];
for (var current = indentStrings.length; current <= level; current++) {
indentStrings.push(indentStrings[current - 1] + singleLevel);
}
return indentStrings[level];
}
ts.getIndentString = getIndentString;
function getIndentSize() {
return indentStrings[1].length;
}
ts.getIndentSize = getIndentSize;
function createTextWriter(newLine) {
var output;
var indent;
var lineStart;
var lineCount;
var linePos;
var hasTrailingComment = false;
function updateLineCountAndPosFor(s) {
var lineStartsOfS = ts.computeLineStarts(s);
if (lineStartsOfS.length > 1) {
lineCount = lineCount + lineStartsOfS.length - 1;
linePos = output.length - s.length + ts.last(lineStartsOfS);
lineStart = (linePos - output.length) === 0;
}
else {
lineStart = false;
}
}
function writeText(s) {
if (s && s.length) {
if (lineStart) {
s = getIndentString(indent) + s;
lineStart = false;
}
output += s;
updateLineCountAndPosFor(s);
}
}
function write(s) {
if (s)
hasTrailingComment = false;
writeText(s);
}
function writeComment(s) {
if (s)
hasTrailingComment = true;
writeText(s);
}
function reset() {
output = "";
indent = 0;
lineStart = true;
lineCount = 0;
linePos = 0;
hasTrailingComment = false;
}
function rawWrite(s) {
if (s !== undefined) {
output += s;
updateLineCountAndPosFor(s);
hasTrailingComment = false;
}
}
function writeLiteral(s) {
if (s && s.length) {
write(s);
}
}
function writeLine(force) {
if (!lineStart || force) {
output += newLine;
lineCount++;
linePos = output.length;
lineStart = true;
hasTrailingComment = false;
}
}
function getTextPosWithWriteLine() {
return lineStart ? output.length : (output.length + newLine.length);
}
reset();
return {
write: write,
rawWrite: rawWrite,
writeLiteral: writeLiteral,
writeLine: writeLine,
increaseIndent: function () { indent++; },
decreaseIndent: function () { indent--; },
getIndent: function () { return indent; },
getTextPos: function () { return output.length; },
getLine: function () { return lineCount; },
getColumn: function () { return lineStart ? indent * getIndentSize() : output.length - linePos; },
getText: function () { return output; },
isAtStartOfLine: function () { return lineStart; },
hasTrailingComment: function () { return hasTrailingComment; },
hasTrailingWhitespace: function () { return !!output.length && ts.isWhiteSpaceLike(output.charCodeAt(output.length - 1)); },
clear: reset,
reportInaccessibleThisError: ts.noop,
reportPrivateInBaseOfClassExpression: ts.noop,
reportInaccessibleUniqueSymbolError: ts.noop,
trackSymbol: function () { return false; },
writeKeyword: write,
writeOperator: write,
writeParameter: write,
writeProperty: write,
writePunctuation: write,
writeSpace: write,
writeStringLiteral: write,
writeSymbol: function (s, _) { return write(s); },
writeTrailingSemicolon: write,
writeComment: writeComment,
getTextPosWithWriteLine: getTextPosWithWriteLine
};
}
ts.createTextWriter = createTextWriter;
function getTrailingSemicolonDeferringWriter(writer) {
var pendingTrailingSemicolon = false;
function commitPendingTrailingSemicolon() {
if (pendingTrailingSemicolon) {
writer.writeTrailingSemicolon(";");
pendingTrailingSemicolon = false;
}
}
return __assign(__assign({}, writer), { writeTrailingSemicolon: function () {
pendingTrailingSemicolon = true;
}, writeLiteral: function (s) {
commitPendingTrailingSemicolon();
writer.writeLiteral(s);
}, writeStringLiteral: function (s) {
commitPendingTrailingSemicolon();
writer.writeStringLiteral(s);
}, writeSymbol: function (s, sym) {
commitPendingTrailingSemicolon();
writer.writeSymbol(s, sym);
}, writePunctuation: function (s) {
commitPendingTrailingSemicolon();
writer.writePunctuation(s);
}, writeKeyword: function (s) {
commitPendingTrailingSemicolon();
writer.writeKeyword(s);
}, writeOperator: function (s) {
commitPendingTrailingSemicolon();
writer.writeOperator(s);
}, writeParameter: function (s) {
commitPendingTrailingSemicolon();
writer.writeParameter(s);
}, writeSpace: function (s) {
commitPendingTrailingSemicolon();
writer.writeSpace(s);
}, writeProperty: function (s) {
commitPendingTrailingSemicolon();
writer.writeProperty(s);
}, writeComment: function (s) {
commitPendingTrailingSemicolon();
writer.writeComment(s);
}, writeLine: function () {
commitPendingTrailingSemicolon();
writer.writeLine();
}, increaseIndent: function () {
commitPendingTrailingSemicolon();
writer.increaseIndent();
}, decreaseIndent: function () {
commitPendingTrailingSemicolon();
writer.decreaseIndent();
} });
}
ts.getTrailingSemicolonDeferringWriter = getTrailingSemicolonDeferringWriter;
function hostUsesCaseSensitiveFileNames(host) {
return host.useCaseSensitiveFileNames ? host.useCaseSensitiveFileNames() : false;
}
ts.hostUsesCaseSensitiveFileNames = hostUsesCaseSensitiveFileNames;
function hostGetCanonicalFileName(host) {
return ts.createGetCanonicalFileName(hostUsesCaseSensitiveFileNames(host));
}
ts.hostGetCanonicalFileName = hostGetCanonicalFileName;
function getResolvedExternalModuleName(host, file, referenceFile) {
return file.moduleName || getExternalModuleNameFromPath(host, file.fileName, referenceFile && referenceFile.fileName);
}
ts.getResolvedExternalModuleName = getResolvedExternalModuleName;
function getCanonicalAbsolutePath(host, path) {
return host.getCanonicalFileName(ts.getNormalizedAbsolutePath(path, host.getCurrentDirectory()));
}
function getExternalModuleNameFromDeclaration(host, resolver, declaration) {
var file = resolver.getExternalModuleFileFromDeclaration(declaration);
if (!file || file.isDeclarationFile) {
return undefined;
}
// If the declaration already uses a non-relative name, and is outside the common source directory, continue to use it
var specifier = getExternalModuleName(declaration);
if (specifier && ts.isStringLiteralLike(specifier) && !ts.pathIsRelative(specifier.text) &&
getCanonicalAbsolutePath(host, file.path).indexOf(getCanonicalAbsolutePath(host, ts.ensureTrailingDirectorySeparator(host.getCommonSourceDirectory()))) === -1) {
return undefined;
}
return getResolvedExternalModuleName(host, file);
}
ts.getExternalModuleNameFromDeclaration = getExternalModuleNameFromDeclaration;
/**
* Resolves a local path to a path which is absolute to the base of the emit
*/
function getExternalModuleNameFromPath(host, fileName, referencePath) {
var getCanonicalFileName = function (f) { return host.getCanonicalFileName(f); };
var dir = ts.toPath(referencePath ? ts.getDirectoryPath(referencePath) : host.getCommonSourceDirectory(), host.getCurrentDirectory(), getCanonicalFileName);
var filePath = ts.getNormalizedAbsolutePath(fileName, host.getCurrentDirectory());
var relativePath = ts.getRelativePathToDirectoryOrUrl(dir, filePath, dir, getCanonicalFileName, /*isAbsolutePathAnUrl*/ false);
var extensionless = removeFileExtension(relativePath);
return referencePath ? ts.ensurePathIsNonModuleName(extensionless) : extensionless;
}
ts.getExternalModuleNameFromPath = getExternalModuleNameFromPath;
function getOwnEmitOutputFilePath(fileName, host, extension) {
var compilerOptions = host.getCompilerOptions();
var emitOutputFilePathWithoutExtension;
if (compilerOptions.outDir) {
emitOutputFilePathWithoutExtension = removeFileExtension(getSourceFilePathInNewDir(fileName, host, compilerOptions.outDir));
}
else {
emitOutputFilePathWithoutExtension = removeFileExtension(fileName);
}
return emitOutputFilePathWithoutExtension + extension;
}
ts.getOwnEmitOutputFilePath = getOwnEmitOutputFilePath;
function getDeclarationEmitOutputFilePath(fileName, host) {
return getDeclarationEmitOutputFilePathWorker(fileName, host.getCompilerOptions(), host.getCurrentDirectory(), host.getCommonSourceDirectory(), function (f) { return host.getCanonicalFileName(f); });
}
ts.getDeclarationEmitOutputFilePath = getDeclarationEmitOutputFilePath;
function getDeclarationEmitOutputFilePathWorker(fileName, options, currentDirectory, commonSourceDirectory, getCanonicalFileName) {
var outputDir = options.declarationDir || options.outDir; // Prefer declaration folder if specified
var path = outputDir
? getSourceFilePathInNewDirWorker(fileName, outputDir, currentDirectory, commonSourceDirectory, getCanonicalFileName)
: fileName;
return removeFileExtension(path) + ".d.ts" /* Dts */;
}
ts.getDeclarationEmitOutputFilePathWorker = getDeclarationEmitOutputFilePathWorker;
function outFile(options) {
return options.outFile || options.out;
}
ts.outFile = outFile;
/** Returns 'undefined' if and only if 'options.paths' is undefined. */
function getPathsBasePath(options, host) {
var _a, _b;
if (!options.paths)
return undefined;
return (_a = options.baseUrl) !== null && _a !== void 0 ? _a : ts.Debug.checkDefined(options.pathsBasePath || ((_b = host.getCurrentDirectory) === null || _b === void 0 ? void 0 : _b.call(host)), "Encountered 'paths' without a 'baseUrl', config file, or host 'getCurrentDirectory'.");
}
ts.getPathsBasePath = getPathsBasePath;
/**
* Gets the source files that are expected to have an emit output.
*
* Originally part of `forEachExpectedEmitFile`, this functionality was extracted to support
* transformations.
*
* @param host An EmitHost.
* @param targetSourceFile An optional target source file to emit.
*/
function getSourceFilesToEmit(host, targetSourceFile, forceDtsEmit) {
var options = host.getCompilerOptions();
if (outFile(options)) {
var moduleKind = getEmitModuleKind(options);
var moduleEmitEnabled_1 = options.emitDeclarationOnly || moduleKind === ts.ModuleKind.AMD || moduleKind === ts.ModuleKind.System;
// Can emit only sources that are not declaration file and are either non module code or module with --module or --target es6 specified
return ts.filter(host.getSourceFiles(), function (sourceFile) {
return (moduleEmitEnabled_1 || !ts.isExternalModule(sourceFile)) &&
sourceFileMayBeEmitted(sourceFile, host, forceDtsEmit);
});
}
else {
var sourceFiles = targetSourceFile === undefined ? host.getSourceFiles() : [targetSourceFile];
return ts.filter(sourceFiles, function (sourceFile) { return sourceFileMayBeEmitted(sourceFile, host, forceDtsEmit); });
}
}
ts.getSourceFilesToEmit = getSourceFilesToEmit;
/** Don't call this for `--outFile`, just for `--outDir` or plain emit. `--outFile` needs additional checks. */
function sourceFileMayBeEmitted(sourceFile, host, forceDtsEmit) {
var options = host.getCompilerOptions();
return !(options.noEmitForJsFiles && isSourceFileJS(sourceFile)) &&
!sourceFile.isDeclarationFile &&
!host.isSourceFileFromExternalLibrary(sourceFile) &&
(forceDtsEmit || (!(isJsonSourceFile(sourceFile) && host.getResolvedProjectReferenceToRedirect(sourceFile.fileName)) &&
!host.isSourceOfProjectReferenceRedirect(sourceFile.fileName)));
}
ts.sourceFileMayBeEmitted = sourceFileMayBeEmitted;
function getSourceFilePathInNewDir(fileName, host, newDirPath) {
return getSourceFilePathInNewDirWorker(fileName, newDirPath, host.getCurrentDirectory(), host.getCommonSourceDirectory(), function (f) { return host.getCanonicalFileName(f); });
}
ts.getSourceFilePathInNewDir = getSourceFilePathInNewDir;
function getSourceFilePathInNewDirWorker(fileName, newDirPath, currentDirectory, commonSourceDirectory, getCanonicalFileName) {
var sourceFilePath = ts.getNormalizedAbsolutePath(fileName, currentDirectory);
var isSourceFileInCommonSourceDirectory = getCanonicalFileName(sourceFilePath).indexOf(getCanonicalFileName(commonSourceDirectory)) === 0;
sourceFilePath = isSourceFileInCommonSourceDirectory ? sourceFilePath.substring(commonSourceDirectory.length) : sourceFilePath;
return ts.combinePaths(newDirPath, sourceFilePath);
}
ts.getSourceFilePathInNewDirWorker = getSourceFilePathInNewDirWorker;
function writeFile(host, diagnostics, fileName, data, writeByteOrderMark, sourceFiles) {
host.writeFile(fileName, data, writeByteOrderMark, function (hostErrorMessage) {
diagnostics.add(createCompilerDiagnostic(ts.Diagnostics.Could_not_write_file_0_Colon_1, fileName, hostErrorMessage));
}, sourceFiles);
}
ts.writeFile = writeFile;
function ensureDirectoriesExist(directoryPath, createDirectory, directoryExists) {
if (directoryPath.length > ts.getRootLength(directoryPath) && !directoryExists(directoryPath)) {
var parentDirectory = ts.getDirectoryPath(directoryPath);
ensureDirectoriesExist(parentDirectory, createDirectory, directoryExists);
createDirectory(directoryPath);
}
}
function writeFileEnsuringDirectories(path, data, writeByteOrderMark, writeFile, createDirectory, directoryExists) {
// PERF: Checking for directory existence is expensive. Instead, assume the directory exists
// and fall back to creating it if the file write fails.
try {
writeFile(path, data, writeByteOrderMark);
}
catch (_a) {
ensureDirectoriesExist(ts.getDirectoryPath(ts.normalizePath(path)), createDirectory, directoryExists);
writeFile(path, data, writeByteOrderMark);
}
}
ts.writeFileEnsuringDirectories = writeFileEnsuringDirectories;
function getLineOfLocalPosition(sourceFile, pos) {
var lineStarts = ts.getLineStarts(sourceFile);
return ts.computeLineOfPosition(lineStarts, pos);
}
ts.getLineOfLocalPosition = getLineOfLocalPosition;
function getLineOfLocalPositionFromLineMap(lineMap, pos) {
return ts.computeLineOfPosition(lineMap, pos);
}
ts.getLineOfLocalPositionFromLineMap = getLineOfLocalPositionFromLineMap;
function getFirstConstructorWithBody(node) {
return ts.find(node.members, function (member) { return ts.isConstructorDeclaration(member) && nodeIsPresent(member.body); });
}
ts.getFirstConstructorWithBody = getFirstConstructorWithBody;
function getSetAccessorValueParameter(accessor) {
if (accessor && accessor.parameters.length > 0) {
var hasThis = accessor.parameters.length === 2 && parameterIsThisKeyword(accessor.parameters[0]);
return accessor.parameters[hasThis ? 1 : 0];
}
}
ts.getSetAccessorValueParameter = getSetAccessorValueParameter;
/** Get the type annotation for the value parameter. */
function getSetAccessorTypeAnnotationNode(accessor) {
var parameter = getSetAccessorValueParameter(accessor);
return parameter && parameter.type;
}
ts.getSetAccessorTypeAnnotationNode = getSetAccessorTypeAnnotationNode;
function getThisParameter(signature) {
// callback tags do not currently support this parameters
if (signature.parameters.length && !ts.isJSDocSignature(signature)) {
var thisParameter = signature.parameters[0];
if (parameterIsThisKeyword(thisParameter)) {
return thisParameter;
}
}
}
ts.getThisParameter = getThisParameter;
function parameterIsThisKeyword(parameter) {
return isThisIdentifier(parameter.name);
}
ts.parameterIsThisKeyword = parameterIsThisKeyword;
function isThisIdentifier(node) {
return !!node && node.kind === 79 /* Identifier */ && identifierIsThisKeyword(node);
}
ts.isThisIdentifier = isThisIdentifier;
function isThisInTypeQuery(node) {
if (!isThisIdentifier(node)) {
return false;
}
while (ts.isQualifiedName(node.parent) && node.parent.left === node) {
node = node.parent;
}
return node.parent.kind === 179 /* TypeQuery */;
}
ts.isThisInTypeQuery = isThisInTypeQuery;
function identifierIsThisKeyword(id) {
return id.originalKeywordKind === 108 /* ThisKeyword */;
}
ts.identifierIsThisKeyword = identifierIsThisKeyword;
function getAllAccessorDeclarations(declarations, accessor) {
// TODO: GH#18217
var firstAccessor;
var secondAccessor;
var getAccessor;
var setAccessor;
if (hasDynamicName(accessor)) {
firstAccessor = accessor;
if (accessor.kind === 170 /* GetAccessor */) {
getAccessor = accessor;
}
else if (accessor.kind === 171 /* SetAccessor */) {
setAccessor = accessor;
}
else {
ts.Debug.fail("Accessor has wrong kind");
}
}
else {
ts.forEach(declarations, function (member) {
if (ts.isAccessor(member)
&& isStatic(member) === isStatic(accessor)) {
var memberName = getPropertyNameForPropertyNameNode(member.name);
var accessorName = getPropertyNameForPropertyNameNode(accessor.name);
if (memberName === accessorName) {
if (!firstAccessor) {
firstAccessor = member;
}
else if (!secondAccessor) {
secondAccessor = member;
}
if (member.kind === 170 /* GetAccessor */ && !getAccessor) {
getAccessor = member;
}
if (member.kind === 171 /* SetAccessor */ && !setAccessor) {
setAccessor = member;
}
}
}
});
}
return {
firstAccessor: firstAccessor,
secondAccessor: secondAccessor,
getAccessor: getAccessor,
setAccessor: setAccessor
};
}
ts.getAllAccessorDeclarations = getAllAccessorDeclarations;
/**
* Gets the effective type annotation of a variable, parameter, or property. If the node was
* parsed in a JavaScript file, gets the type annotation from JSDoc. Also gets the type of
* functions only the JSDoc case.
*/
function getEffectiveTypeAnnotationNode(node) {
if (!isInJSFile(node) && ts.isFunctionDeclaration(node))
return undefined;
var type = node.type;
if (type || !isInJSFile(node))
return type;
return ts.isJSDocPropertyLikeTag(node) ? node.typeExpression && node.typeExpression.type : ts.getJSDocType(node);
}
ts.getEffectiveTypeAnnotationNode = getEffectiveTypeAnnotationNode;
function getTypeAnnotationNode(node) {
return node.type;
}
ts.getTypeAnnotationNode = getTypeAnnotationNode;
/**
* Gets the effective return type annotation of a signature. If the node was parsed in a
* JavaScript file, gets the return type annotation from JSDoc.
*/
function getEffectiveReturnTypeNode(node) {
return ts.isJSDocSignature(node) ?
node.type && node.type.typeExpression && node.type.typeExpression.type :
node.type || (isInJSFile(node) ? ts.getJSDocReturnType(node) : undefined);
}
ts.getEffectiveReturnTypeNode = getEffectiveReturnTypeNode;
function getJSDocTypeParameterDeclarations(node) {
return ts.flatMap(ts.getJSDocTags(node), function (tag) { return isNonTypeAliasTemplate(tag) ? tag.typeParameters : undefined; });
}
ts.getJSDocTypeParameterDeclarations = getJSDocTypeParameterDeclarations;
/** template tags are only available when a typedef isn't already using them */
function isNonTypeAliasTemplate(tag) {
return ts.isJSDocTemplateTag(tag) && !(tag.parent.kind === 315 /* JSDocComment */ && tag.parent.tags.some(isJSDocTypeAlias));
}
/**
* Gets the effective type annotation of the value parameter of a set accessor. If the node
* was parsed in a JavaScript file, gets the type annotation from JSDoc.
*/
function getEffectiveSetAccessorTypeAnnotationNode(node) {
var parameter = getSetAccessorValueParameter(node);
return parameter && getEffectiveTypeAnnotationNode(parameter);
}
ts.getEffectiveSetAccessorTypeAnnotationNode = getEffectiveSetAccessorTypeAnnotationNode;
function emitNewLineBeforeLeadingComments(lineMap, writer, node, leadingComments) {
emitNewLineBeforeLeadingCommentsOfPosition(lineMap, writer, node.pos, leadingComments);
}
ts.emitNewLineBeforeLeadingComments = emitNewLineBeforeLeadingComments;
function emitNewLineBeforeLeadingCommentsOfPosition(lineMap, writer, pos, leadingComments) {
// If the leading comments start on different line than the start of node, write new line
if (leadingComments && leadingComments.length && pos !== leadingComments[0].pos &&
getLineOfLocalPositionFromLineMap(lineMap, pos) !== getLineOfLocalPositionFromLineMap(lineMap, leadingComments[0].pos)) {
writer.writeLine();
}
}
ts.emitNewLineBeforeLeadingCommentsOfPosition = emitNewLineBeforeLeadingCommentsOfPosition;
function emitNewLineBeforeLeadingCommentOfPosition(lineMap, writer, pos, commentPos) {
// If the leading comments start on different line than the start of node, write new line
if (pos !== commentPos &&
getLineOfLocalPositionFromLineMap(lineMap, pos) !== getLineOfLocalPositionFromLineMap(lineMap, commentPos)) {
writer.writeLine();
}
}
ts.emitNewLineBeforeLeadingCommentOfPosition = emitNewLineBeforeLeadingCommentOfPosition;
function emitComments(text, lineMap, writer, comments, leadingSeparator, trailingSeparator, newLine, writeComment) {
if (comments && comments.length > 0) {
if (leadingSeparator) {
writer.writeSpace(" ");
}
var emitInterveningSeparator = false;
for (var _i = 0, comments_1 = comments; _i < comments_1.length; _i++) {
var comment = comments_1[_i];
if (emitInterveningSeparator) {
writer.writeSpace(" ");
emitInterveningSeparator = false;
}
writeComment(text, lineMap, writer, comment.pos, comment.end, newLine);
if (comment.hasTrailingNewLine) {
writer.writeLine();
}
else {
emitInterveningSeparator = true;
}
}
if (emitInterveningSeparator && trailingSeparator) {
writer.writeSpace(" ");
}
}
}
ts.emitComments = emitComments;
/**
* Detached comment is a comment at the top of file or function body that is separated from
* the next statement by space.
*/
function emitDetachedComments(text, lineMap, writer, writeComment, node, newLine, removeComments) {
var leadingComments;
var currentDetachedCommentInfo;
if (removeComments) {
// removeComments is true, only reserve pinned comment at the top of file
// For example:
// /*! Pinned Comment */
//
// var x = 10;
if (node.pos === 0) {
leadingComments = ts.filter(ts.getLeadingCommentRanges(text, node.pos), isPinnedCommentLocal);
}
}
else {
// removeComments is false, just get detached as normal and bypass the process to filter comment
leadingComments = ts.getLeadingCommentRanges(text, node.pos);
}
if (leadingComments) {
var detachedComments = [];
var lastComment = void 0;
for (var _i = 0, leadingComments_1 = leadingComments; _i < leadingComments_1.length; _i++) {
var comment = leadingComments_1[_i];
if (lastComment) {
var lastCommentLine = getLineOfLocalPositionFromLineMap(lineMap, lastComment.end);
var commentLine = getLineOfLocalPositionFromLineMap(lineMap, comment.pos);
if (commentLine >= lastCommentLine + 2) {
// There was a blank line between the last comment and this comment. This
// comment is not part of the copyright comments. Return what we have so
// far.
break;
}
}
detachedComments.push(comment);
lastComment = comment;
}
if (detachedComments.length) {
// All comments look like they could have been part of the copyright header. Make
// sure there is at least one blank line between it and the node. If not, it's not
// a copyright header.
var lastCommentLine = getLineOfLocalPositionFromLineMap(lineMap, ts.last(detachedComments).end);
var nodeLine = getLineOfLocalPositionFromLineMap(lineMap, ts.skipTrivia(text, node.pos));
if (nodeLine >= lastCommentLine + 2) {
// Valid detachedComments
emitNewLineBeforeLeadingComments(lineMap, writer, node, leadingComments);
emitComments(text, lineMap, writer, detachedComments, /*leadingSeparator*/ false, /*trailingSeparator*/ true, newLine, writeComment);
currentDetachedCommentInfo = { nodePos: node.pos, detachedCommentEndPos: ts.last(detachedComments).end };
}
}
}
return currentDetachedCommentInfo;
function isPinnedCommentLocal(comment) {
return isPinnedComment(text, comment.pos);
}
}
ts.emitDetachedComments = emitDetachedComments;
function writeCommentRange(text, lineMap, writer, commentPos, commentEnd, newLine) {
if (text.charCodeAt(commentPos + 1) === 42 /* asterisk */) {
var firstCommentLineAndCharacter = ts.computeLineAndCharacterOfPosition(lineMap, commentPos);
var lineCount = lineMap.length;
var firstCommentLineIndent = void 0;
for (var pos = commentPos, currentLine = firstCommentLineAndCharacter.line; pos < commentEnd; currentLine++) {
var nextLineStart = (currentLine + 1) === lineCount
? text.length + 1
: lineMap[currentLine + 1];
if (pos !== commentPos) {
// If we are not emitting first line, we need to write the spaces to adjust the alignment
if (firstCommentLineIndent === undefined) {
firstCommentLineIndent = calculateIndent(text, lineMap[firstCommentLineAndCharacter.line], commentPos);
}
// These are number of spaces writer is going to write at current indent
var currentWriterIndentSpacing = writer.getIndent() * getIndentSize();
// Number of spaces we want to be writing
// eg: Assume writer indent
// module m {
// /* starts at character 9 this is line 1
// * starts at character pos 4 line --1 = 8 - 8 + 3
// More left indented comment */ --2 = 8 - 8 + 2
// class c { }
// }
// module m {
// /* this is line 1 -- Assume current writer indent 8
// * line --3 = 8 - 4 + 5
// More right indented comment */ --4 = 8 - 4 + 11
// class c { }
// }
var spacesToEmit = currentWriterIndentSpacing - firstCommentLineIndent + calculateIndent(text, pos, nextLineStart);
if (spacesToEmit > 0) {
var numberOfSingleSpacesToEmit = spacesToEmit % getIndentSize();
var indentSizeSpaceString = getIndentString((spacesToEmit - numberOfSingleSpacesToEmit) / getIndentSize());
// Write indent size string ( in eg 1: = "", 2: "" , 3: string with 8 spaces 4: string with 12 spaces
writer.rawWrite(indentSizeSpaceString);
// Emit the single spaces (in eg: 1: 3 spaces, 2: 2 spaces, 3: 1 space, 4: 3 spaces)
while (numberOfSingleSpacesToEmit) {
writer.rawWrite(" ");
numberOfSingleSpacesToEmit--;
}
}
else {
// No spaces to emit write empty string
writer.rawWrite("");
}
}
// Write the comment line text
writeTrimmedCurrentLine(text, commentEnd, writer, newLine, pos, nextLineStart);
pos = nextLineStart;
}
}
else {
// Single line comment of style //....
writer.writeComment(text.substring(commentPos, commentEnd));
}
}
ts.writeCommentRange = writeCommentRange;
function writeTrimmedCurrentLine(text, commentEnd, writer, newLine, pos, nextLineStart) {
var end = Math.min(commentEnd, nextLineStart - 1);
var currentLineText = ts.trimString(text.substring(pos, end));
if (currentLineText) {
// trimmed forward and ending spaces text
writer.writeComment(currentLineText);
if (end !== commentEnd) {
writer.writeLine();
}
}
else {
// Empty string - make sure we write empty line
writer.rawWrite(newLine);
}
}
function calculateIndent(text, pos, end) {
var currentLineIndent = 0;
for (; pos < end && ts.isWhiteSpaceSingleLine(text.charCodeAt(pos)); pos++) {
if (text.charCodeAt(pos) === 9 /* tab */) {
// Tabs = TabSize = indent size and go to next tabStop
currentLineIndent += getIndentSize() - (currentLineIndent % getIndentSize());
}
else {
// Single space
currentLineIndent++;
}
}
return currentLineIndent;
}
function hasEffectiveModifiers(node) {
return getEffectiveModifierFlags(node) !== 0 /* None */;
}
ts.hasEffectiveModifiers = hasEffectiveModifiers;
function hasSyntacticModifiers(node) {
return getSyntacticModifierFlags(node) !== 0 /* None */;
}
ts.hasSyntacticModifiers = hasSyntacticModifiers;
function hasEffectiveModifier(node, flags) {
return !!getSelectedEffectiveModifierFlags(node, flags);
}
ts.hasEffectiveModifier = hasEffectiveModifier;
function hasSyntacticModifier(node, flags) {
return !!getSelectedSyntacticModifierFlags(node, flags);
}
ts.hasSyntacticModifier = hasSyntacticModifier;
function isStatic(node) {
// https://tc39.es/ecma262/#sec-static-semantics-isstatic
return ts.isClassElement(node) && hasStaticModifier(node) || ts.isClassStaticBlockDeclaration(node);
}
ts.isStatic = isStatic;
function hasStaticModifier(node) {
return hasSyntacticModifier(node, 32 /* Static */);
}
ts.hasStaticModifier = hasStaticModifier;
function hasOverrideModifier(node) {
return hasEffectiveModifier(node, 16384 /* Override */);
}
ts.hasOverrideModifier = hasOverrideModifier;
function hasAbstractModifier(node) {
return hasSyntacticModifier(node, 128 /* Abstract */);
}
ts.hasAbstractModifier = hasAbstractModifier;
function hasAmbientModifier(node) {
return hasSyntacticModifier(node, 2 /* Ambient */);
}
ts.hasAmbientModifier = hasAmbientModifier;
function hasEffectiveReadonlyModifier(node) {
return hasEffectiveModifier(node, 64 /* Readonly */);
}
ts.hasEffectiveReadonlyModifier = hasEffectiveReadonlyModifier;
function getSelectedEffectiveModifierFlags(node, flags) {
return getEffectiveModifierFlags(node) & flags;
}
ts.getSelectedEffectiveModifierFlags = getSelectedEffectiveModifierFlags;
function getSelectedSyntacticModifierFlags(node, flags) {
return getSyntacticModifierFlags(node) & flags;
}
ts.getSelectedSyntacticModifierFlags = getSelectedSyntacticModifierFlags;
function getModifierFlagsWorker(node, includeJSDoc, alwaysIncludeJSDoc) {
if (node.kind >= 0 /* FirstToken */ && node.kind <= 158 /* LastToken */) {
return 0 /* None */;
}
if (!(node.modifierFlagsCache & 536870912 /* HasComputedFlags */)) {
node.modifierFlagsCache = getSyntacticModifierFlagsNoCache(node) | 536870912 /* HasComputedFlags */;
}
if (includeJSDoc && !(node.modifierFlagsCache & 4096 /* HasComputedJSDocModifiers */) && (alwaysIncludeJSDoc || isInJSFile(node)) && node.parent) {
node.modifierFlagsCache |= getJSDocModifierFlagsNoCache(node) | 4096 /* HasComputedJSDocModifiers */;
}
return node.modifierFlagsCache & ~(536870912 /* HasComputedFlags */ | 4096 /* HasComputedJSDocModifiers */);
}
/**
* Gets the effective ModifierFlags for the provided node, including JSDoc modifiers. The modifiers will be cached on the node to improve performance.
*
* NOTE: This function may use `parent` pointers.
*/
function getEffectiveModifierFlags(node) {
return getModifierFlagsWorker(node, /*includeJSDoc*/ true);
}
ts.getEffectiveModifierFlags = getEffectiveModifierFlags;
function getEffectiveModifierFlagsAlwaysIncludeJSDoc(node) {
return getModifierFlagsWorker(node, /*includeJSDOc*/ true, /*alwaysIncludeJSDOc*/ true);
}
ts.getEffectiveModifierFlagsAlwaysIncludeJSDoc = getEffectiveModifierFlagsAlwaysIncludeJSDoc;
/**
* Gets the ModifierFlags for syntactic modifiers on the provided node. The modifiers will be cached on the node to improve performance.
*
* NOTE: This function does not use `parent` pointers and will not include modifiers from JSDoc.
*/
function getSyntacticModifierFlags(node) {
return getModifierFlagsWorker(node, /*includeJSDoc*/ false);
}
ts.getSyntacticModifierFlags = getSyntacticModifierFlags;
function getJSDocModifierFlagsNoCache(node) {
var flags = 0 /* None */;
if (!!node.parent && !ts.isParameter(node)) {
if (isInJSFile(node)) {
if (ts.getJSDocPublicTagNoCache(node))
flags |= 4 /* Public */;
if (ts.getJSDocPrivateTagNoCache(node))
flags |= 8 /* Private */;
if (ts.getJSDocProtectedTagNoCache(node))
flags |= 16 /* Protected */;
if (ts.getJSDocReadonlyTagNoCache(node))
flags |= 64 /* Readonly */;
if (ts.getJSDocOverrideTagNoCache(node))
flags |= 16384 /* Override */;
}
if (ts.getJSDocDeprecatedTagNoCache(node))
flags |= 8192 /* Deprecated */;
}
return flags;
}
/**
* Gets the effective ModifierFlags for the provided node, including JSDoc modifiers. The modifier flags cache on the node is ignored.
*
* NOTE: This function may use `parent` pointers.
*/
function getEffectiveModifierFlagsNoCache(node) {
return getSyntacticModifierFlagsNoCache(node) | getJSDocModifierFlagsNoCache(node);
}
ts.getEffectiveModifierFlagsNoCache = getEffectiveModifierFlagsNoCache;
/**
* Gets the ModifierFlags for syntactic modifiers on the provided node. The modifier flags cache on the node is ignored.
*
* NOTE: This function does not use `parent` pointers and will not include modifiers from JSDoc.
*/
function getSyntacticModifierFlagsNoCache(node) {
var flags = modifiersToFlags(node.modifiers);
if (node.flags & 4 /* NestedNamespace */ || (node.kind === 79 /* Identifier */ && node.isInJSDocNamespace)) {
flags |= 1 /* Export */;
}
return flags;
}
ts.getSyntacticModifierFlagsNoCache = getSyntacticModifierFlagsNoCache;
function modifiersToFlags(modifiers) {
var flags = 0 /* None */;
if (modifiers) {
for (var _i = 0, modifiers_1 = modifiers; _i < modifiers_1.length; _i++) {
var modifier = modifiers_1[_i];
flags |= modifierToFlag(modifier.kind);
}
}
return flags;
}
ts.modifiersToFlags = modifiersToFlags;
function modifierToFlag(token) {
switch (token) {
case 124 /* StaticKeyword */: return 32 /* Static */;
case 123 /* PublicKeyword */: return 4 /* Public */;
case 122 /* ProtectedKeyword */: return 16 /* Protected */;
case 121 /* PrivateKeyword */: return 8 /* Private */;
case 126 /* AbstractKeyword */: return 128 /* Abstract */;
case 93 /* ExportKeyword */: return 1 /* Export */;
case 134 /* DeclareKeyword */: return 2 /* Ambient */;
case 85 /* ConstKeyword */: return 2048 /* Const */;
case 88 /* DefaultKeyword */: return 512 /* Default */;
case 130 /* AsyncKeyword */: return 256 /* Async */;
case 143 /* ReadonlyKeyword */: return 64 /* Readonly */;
case 157 /* OverrideKeyword */: return 16384 /* Override */;
}
return 0 /* None */;
}
ts.modifierToFlag = modifierToFlag;
function createModifiers(modifierFlags) {
return modifierFlags ? ts.factory.createNodeArray(ts.factory.createModifiersFromModifierFlags(modifierFlags)) : undefined;
}
ts.createModifiers = createModifiers;
function isLogicalOperator(token) {
return token === 56 /* BarBarToken */
|| token === 55 /* AmpersandAmpersandToken */
|| token === 53 /* ExclamationToken */;
}
ts.isLogicalOperator = isLogicalOperator;
function isLogicalOrCoalescingAssignmentOperator(token) {
return token === 75 /* BarBarEqualsToken */
|| token === 76 /* AmpersandAmpersandEqualsToken */
|| token === 77 /* QuestionQuestionEqualsToken */;
}
ts.isLogicalOrCoalescingAssignmentOperator = isLogicalOrCoalescingAssignmentOperator;
function isLogicalOrCoalescingAssignmentExpression(expr) {
return isLogicalOrCoalescingAssignmentOperator(expr.operatorToken.kind);
}
ts.isLogicalOrCoalescingAssignmentExpression = isLogicalOrCoalescingAssignmentExpression;
function isAssignmentOperator(token) {
return token >= 63 /* FirstAssignment */ && token <= 78 /* LastAssignment */;
}
ts.isAssignmentOperator = isAssignmentOperator;
/** Get `C` given `N` if `N` is in the position `class C extends N` where `N` is an ExpressionWithTypeArguments. */
function tryGetClassExtendingExpressionWithTypeArguments(node) {
var cls = tryGetClassImplementingOrExtendingExpressionWithTypeArguments(node);
return cls && !cls.isImplements ? cls.class : undefined;
}
ts.tryGetClassExtendingExpressionWithTypeArguments = tryGetClassExtendingExpressionWithTypeArguments;
function tryGetClassImplementingOrExtendingExpressionWithTypeArguments(node) {
return ts.isExpressionWithTypeArguments(node)
&& ts.isHeritageClause(node.parent)
&& ts.isClassLike(node.parent.parent)
? { class: node.parent.parent, isImplements: node.parent.token === 117 /* ImplementsKeyword */ }
: undefined;
}
ts.tryGetClassImplementingOrExtendingExpressionWithTypeArguments = tryGetClassImplementingOrExtendingExpressionWithTypeArguments;
function isAssignmentExpression(node, excludeCompoundAssignment) {
return ts.isBinaryExpression(node)
&& (excludeCompoundAssignment
? node.operatorToken.kind === 63 /* EqualsToken */
: isAssignmentOperator(node.operatorToken.kind))
&& ts.isLeftHandSideExpression(node.left);
}
ts.isAssignmentExpression = isAssignmentExpression;
function isLeftHandSideOfAssignment(node) {
return isAssignmentExpression(node.parent) && node.parent.left === node;
}
ts.isLeftHandSideOfAssignment = isLeftHandSideOfAssignment;
function isDestructuringAssignment(node) {
if (isAssignmentExpression(node, /*excludeCompoundAssignment*/ true)) {
var kind = node.left.kind;
return kind === 203 /* ObjectLiteralExpression */
|| kind === 202 /* ArrayLiteralExpression */;
}
return false;
}
ts.isDestructuringAssignment = isDestructuringAssignment;
function isExpressionWithTypeArgumentsInClassExtendsClause(node) {
return tryGetClassExtendingExpressionWithTypeArguments(node) !== undefined;
}
ts.isExpressionWithTypeArgumentsInClassExtendsClause = isExpressionWithTypeArgumentsInClassExtendsClause;
function isEntityNameExpression(node) {
return node.kind === 79 /* Identifier */ || isPropertyAccessEntityNameExpression(node);
}
ts.isEntityNameExpression = isEntityNameExpression;
function getFirstIdentifier(node) {
switch (node.kind) {
case 79 /* Identifier */:
return node;
case 159 /* QualifiedName */:
do {
node = node.left;
} while (node.kind !== 79 /* Identifier */);
return node;
case 204 /* PropertyAccessExpression */:
do {
node = node.expression;
} while (node.kind !== 79 /* Identifier */);
return node;
}
}
ts.getFirstIdentifier = getFirstIdentifier;
function isDottedName(node) {
return node.kind === 79 /* Identifier */
|| node.kind === 108 /* ThisKeyword */
|| node.kind === 106 /* SuperKeyword */
|| node.kind === 229 /* MetaProperty */
|| node.kind === 204 /* PropertyAccessExpression */ && isDottedName(node.expression)
|| node.kind === 210 /* ParenthesizedExpression */ && isDottedName(node.expression);
}
ts.isDottedName = isDottedName;
function isPropertyAccessEntityNameExpression(node) {
return ts.isPropertyAccessExpression(node) && ts.isIdentifier(node.name) && isEntityNameExpression(node.expression);
}
ts.isPropertyAccessEntityNameExpression = isPropertyAccessEntityNameExpression;
function tryGetPropertyAccessOrIdentifierToString(expr) {
if (ts.isPropertyAccessExpression(expr)) {
var baseStr = tryGetPropertyAccessOrIdentifierToString(expr.expression);
if (baseStr !== undefined) {
return baseStr + "." + entityNameToString(expr.name);
}
}
else if (ts.isElementAccessExpression(expr)) {
var baseStr = tryGetPropertyAccessOrIdentifierToString(expr.expression);
if (baseStr !== undefined && ts.isPropertyName(expr.argumentExpression)) {
return baseStr + "." + getPropertyNameForPropertyNameNode(expr.argumentExpression);
}
}
else if (ts.isIdentifier(expr)) {
return ts.unescapeLeadingUnderscores(expr.escapedText);
}
return undefined;
}
ts.tryGetPropertyAccessOrIdentifierToString = tryGetPropertyAccessOrIdentifierToString;
function isPrototypeAccess(node) {
return isBindableStaticAccessExpression(node) && getElementOrPropertyAccessName(node) === "prototype";
}
ts.isPrototypeAccess = isPrototypeAccess;
function isRightSideOfQualifiedNameOrPropertyAccess(node) {
return (node.parent.kind === 159 /* QualifiedName */ && node.parent.right === node) ||
(node.parent.kind === 204 /* PropertyAccessExpression */ && node.parent.name === node);
}
ts.isRightSideOfQualifiedNameOrPropertyAccess = isRightSideOfQualifiedNameOrPropertyAccess;
function isRightSideOfQualifiedNameOrPropertyAccessOrJSDocMemberName(node) {
return ts.isQualifiedName(node.parent) && node.parent.right === node
|| ts.isPropertyAccessExpression(node.parent) && node.parent.name === node
|| ts.isJSDocMemberName(node.parent) && node.parent.right === node;
}
ts.isRightSideOfQualifiedNameOrPropertyAccessOrJSDocMemberName = isRightSideOfQualifiedNameOrPropertyAccessOrJSDocMemberName;
function isEmptyObjectLiteral(expression) {
return expression.kind === 203 /* ObjectLiteralExpression */ &&
expression.properties.length === 0;
}
ts.isEmptyObjectLiteral = isEmptyObjectLiteral;
function isEmptyArrayLiteral(expression) {
return expression.kind === 202 /* ArrayLiteralExpression */ &&
expression.elements.length === 0;
}
ts.isEmptyArrayLiteral = isEmptyArrayLiteral;
function getLocalSymbolForExportDefault(symbol) {
if (!isExportDefaultSymbol(symbol) || !symbol.declarations)
return undefined;
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var decl = _a[_i];
if (decl.localSymbol)
return decl.localSymbol;
}
return undefined;
}
ts.getLocalSymbolForExportDefault = getLocalSymbolForExportDefault;
function isExportDefaultSymbol(symbol) {
return symbol && ts.length(symbol.declarations) > 0 && hasSyntacticModifier(symbol.declarations[0], 512 /* Default */);
}
/** Return ".ts", ".d.ts", or ".tsx", if that is the extension. */
function tryExtractTSExtension(fileName) {
return ts.find(ts.supportedTSExtensionsForExtractExtension, function (extension) { return ts.fileExtensionIs(fileName, extension); });
}
ts.tryExtractTSExtension = tryExtractTSExtension;
/**
* Replace each instance of non-ascii characters by one, two, three, or four escape sequences
* representing the UTF-8 encoding of the character, and return the expanded char code list.
*/
function getExpandedCharCodes(input) {
var output = [];
var length = input.length;
for (var i = 0; i < length; i++) {
var charCode = input.charCodeAt(i);
// handle utf8
if (charCode < 0x80) {
output.push(charCode);
}
else if (charCode < 0x800) {
output.push((charCode >> 6) | 192);
output.push((charCode & 63) | 128);
}
else if (charCode < 0x10000) {
output.push((charCode >> 12) | 224);
output.push(((charCode >> 6) & 63) | 128);
output.push((charCode & 63) | 128);
}
else if (charCode < 0x20000) {
output.push((charCode >> 18) | 240);
output.push(((charCode >> 12) & 63) | 128);
output.push(((charCode >> 6) & 63) | 128);
output.push((charCode & 63) | 128);
}
else {
ts.Debug.assert(false, "Unexpected code point");
}
}
return output;
}
var base64Digits = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
/**
* Converts a string to a base-64 encoded ASCII string.
*/
function convertToBase64(input) {
var result = "";
var charCodes = getExpandedCharCodes(input);
var i = 0;
var length = charCodes.length;
var byte1, byte2, byte3, byte4;
while (i < length) {
// Convert every 6-bits in the input 3 character points
// into a base64 digit
byte1 = charCodes[i] >> 2;
byte2 = (charCodes[i] & 3) << 4 | charCodes[i + 1] >> 4;
byte3 = (charCodes[i + 1] & 15) << 2 | charCodes[i + 2] >> 6;
byte4 = charCodes[i + 2] & 63;
// We are out of characters in the input, set the extra
// digits to 64 (padding character).
if (i + 1 >= length) {
byte3 = byte4 = 64;
}
else if (i + 2 >= length) {
byte4 = 64;
}
// Write to the output
result += base64Digits.charAt(byte1) + base64Digits.charAt(byte2) + base64Digits.charAt(byte3) + base64Digits.charAt(byte4);
i += 3;
}
return result;
}
ts.convertToBase64 = convertToBase64;
function getStringFromExpandedCharCodes(codes) {
var output = "";
var i = 0;
var length = codes.length;
while (i < length) {
var charCode = codes[i];
if (charCode < 0x80) {
output += String.fromCharCode(charCode);
i++;
}
else if ((charCode & 192) === 192) {
var value = charCode & 63;
i++;
var nextCode = codes[i];
while ((nextCode & 192) === 128) {
value = (value << 6) | (nextCode & 63);
i++;
nextCode = codes[i];
}
// `value` may be greater than 10FFFF (the maximum unicode codepoint) - JS will just make this into an invalid character for us
output += String.fromCharCode(value);
}
else {
// We don't want to kill the process when decoding fails (due to a following char byte not
// following a leading char), so we just print the (bad) value
output += String.fromCharCode(charCode);
i++;
}
}
return output;
}
function base64encode(host, input) {
if (host && host.base64encode) {
return host.base64encode(input);
}
return convertToBase64(input);
}
ts.base64encode = base64encode;
function base64decode(host, input) {
if (host && host.base64decode) {
return host.base64decode(input);
}
var length = input.length;
var expandedCharCodes = [];
var i = 0;
while (i < length) {
// Stop decoding once padding characters are present
if (input.charCodeAt(i) === base64Digits.charCodeAt(64)) {
break;
}
// convert 4 input digits into three characters, ignoring padding characters at the end
var ch1 = base64Digits.indexOf(input[i]);
var ch2 = base64Digits.indexOf(input[i + 1]);
var ch3 = base64Digits.indexOf(input[i + 2]);
var ch4 = base64Digits.indexOf(input[i + 3]);
var code1 = ((ch1 & 63) << 2) | ((ch2 >> 4) & 3);
var code2 = ((ch2 & 15) << 4) | ((ch3 >> 2) & 15);
var code3 = ((ch3 & 3) << 6) | (ch4 & 63);
if (code2 === 0 && ch3 !== 0) { // code2 decoded to zero, but ch3 was padding - elide code2 and code3
expandedCharCodes.push(code1);
}
else if (code3 === 0 && ch4 !== 0) { // code3 decoded to zero, but ch4 was padding, elide code3
expandedCharCodes.push(code1, code2);
}
else {
expandedCharCodes.push(code1, code2, code3);
}
i += 4;
}
return getStringFromExpandedCharCodes(expandedCharCodes);
}
ts.base64decode = base64decode;
function readJson(path, host) {
try {
var jsonText = host.readFile(path);
if (!jsonText)
return {};
var result = ts.parseConfigFileTextToJson(path, jsonText);
if (result.error) {
return {};
}
return result.config;
}
catch (e) {
// gracefully handle if readFile fails or returns not JSON
return {};
}
}
ts.readJson = readJson;
function directoryProbablyExists(directoryName, host) {
// if host does not support 'directoryExists' assume that directory will exist
return !host.directoryExists || host.directoryExists(directoryName);
}
ts.directoryProbablyExists = directoryProbablyExists;
var carriageReturnLineFeed = "\r\n";
var lineFeed = "\n";
function getNewLineCharacter(options, getNewLine) {
switch (options.newLine) {
case 0 /* CarriageReturnLineFeed */:
return carriageReturnLineFeed;
case 1 /* LineFeed */:
return lineFeed;
}
return getNewLine ? getNewLine() : ts.sys ? ts.sys.newLine : carriageReturnLineFeed;
}
ts.getNewLineCharacter = getNewLineCharacter;
/**
* Creates a new TextRange from the provided pos and end.
*
* @param pos The start position.
* @param end The end position.
*/
function createRange(pos, end) {
if (end === void 0) { end = pos; }
ts.Debug.assert(end >= pos || end === -1);
return { pos: pos, end: end };
}
ts.createRange = createRange;
/**
* Creates a new TextRange from a provided range with a new end position.
*
* @param range A TextRange.
* @param end The new end position.
*/
function moveRangeEnd(range, end) {
return createRange(range.pos, end);
}
ts.moveRangeEnd = moveRangeEnd;
/**
* Creates a new TextRange from a provided range with a new start position.
*
* @param range A TextRange.
* @param pos The new Start position.
*/
function moveRangePos(range, pos) {
return createRange(pos, range.end);
}
ts.moveRangePos = moveRangePos;
/**
* Moves the start position of a range past any decorators.
*/
function moveRangePastDecorators(node) {
return node.decorators && node.decorators.length > 0
? moveRangePos(node, node.decorators.end)
: node;
}
ts.moveRangePastDecorators = moveRangePastDecorators;
/**
* Moves the start position of a range past any decorators or modifiers.
*/
function moveRangePastModifiers(node) {
return node.modifiers && node.modifiers.length > 0
? moveRangePos(node, node.modifiers.end)
: moveRangePastDecorators(node);
}
ts.moveRangePastModifiers = moveRangePastModifiers;
/**
* Determines whether a TextRange has the same start and end positions.
*
* @param range A TextRange.
*/
function isCollapsedRange(range) {
return range.pos === range.end;
}
ts.isCollapsedRange = isCollapsedRange;
/**
* Creates a new TextRange for a token at the provides start position.
*
* @param pos The start position.
* @param token The token.
*/
function createTokenRange(pos, token) {
return createRange(pos, pos + ts.tokenToString(token).length);
}
ts.createTokenRange = createTokenRange;
function rangeIsOnSingleLine(range, sourceFile) {
return rangeStartIsOnSameLineAsRangeEnd(range, range, sourceFile);
}
ts.rangeIsOnSingleLine = rangeIsOnSingleLine;
function rangeStartPositionsAreOnSameLine(range1, range2, sourceFile) {
return positionsAreOnSameLine(getStartPositionOfRange(range1, sourceFile, /*includeComments*/ false), getStartPositionOfRange(range2, sourceFile, /*includeComments*/ false), sourceFile);
}
ts.rangeStartPositionsAreOnSameLine = rangeStartPositionsAreOnSameLine;
function rangeEndPositionsAreOnSameLine(range1, range2, sourceFile) {
return positionsAreOnSameLine(range1.end, range2.end, sourceFile);
}
ts.rangeEndPositionsAreOnSameLine = rangeEndPositionsAreOnSameLine;
function rangeStartIsOnSameLineAsRangeEnd(range1, range2, sourceFile) {
return positionsAreOnSameLine(getStartPositionOfRange(range1, sourceFile, /*includeComments*/ false), range2.end, sourceFile);
}
ts.rangeStartIsOnSameLineAsRangeEnd = rangeStartIsOnSameLineAsRangeEnd;
function rangeEndIsOnSameLineAsRangeStart(range1, range2, sourceFile) {
return positionsAreOnSameLine(range1.end, getStartPositionOfRange(range2, sourceFile, /*includeComments*/ false), sourceFile);
}
ts.rangeEndIsOnSameLineAsRangeStart = rangeEndIsOnSameLineAsRangeStart;
function getLinesBetweenRangeEndAndRangeStart(range1, range2, sourceFile, includeSecondRangeComments) {
var range2Start = getStartPositionOfRange(range2, sourceFile, includeSecondRangeComments);
return ts.getLinesBetweenPositions(sourceFile, range1.end, range2Start);
}
ts.getLinesBetweenRangeEndAndRangeStart = getLinesBetweenRangeEndAndRangeStart;
function getLinesBetweenRangeEndPositions(range1, range2, sourceFile) {
return ts.getLinesBetweenPositions(sourceFile, range1.end, range2.end);
}
ts.getLinesBetweenRangeEndPositions = getLinesBetweenRangeEndPositions;
function isNodeArrayMultiLine(list, sourceFile) {
return !positionsAreOnSameLine(list.pos, list.end, sourceFile);
}
ts.isNodeArrayMultiLine = isNodeArrayMultiLine;
function positionsAreOnSameLine(pos1, pos2, sourceFile) {
return ts.getLinesBetweenPositions(sourceFile, pos1, pos2) === 0;
}
ts.positionsAreOnSameLine = positionsAreOnSameLine;
function getStartPositionOfRange(range, sourceFile, includeComments) {
return positionIsSynthesized(range.pos) ? -1 : ts.skipTrivia(sourceFile.text, range.pos, /*stopAfterLineBreak*/ false, includeComments);
}
ts.getStartPositionOfRange = getStartPositionOfRange;
function getLinesBetweenPositionAndPrecedingNonWhitespaceCharacter(pos, stopPos, sourceFile, includeComments) {
var startPos = ts.skipTrivia(sourceFile.text, pos, /*stopAfterLineBreak*/ false, includeComments);
var prevPos = getPreviousNonWhitespacePosition(startPos, stopPos, sourceFile);
return ts.getLinesBetweenPositions(sourceFile, prevPos !== null && prevPos !== void 0 ? prevPos : stopPos, startPos);
}
ts.getLinesBetweenPositionAndPrecedingNonWhitespaceCharacter = getLinesBetweenPositionAndPrecedingNonWhitespaceCharacter;
function getLinesBetweenPositionAndNextNonWhitespaceCharacter(pos, stopPos, sourceFile, includeComments) {
var nextPos = ts.skipTrivia(sourceFile.text, pos, /*stopAfterLineBreak*/ false, includeComments);
return ts.getLinesBetweenPositions(sourceFile, pos, Math.min(stopPos, nextPos));
}
ts.getLinesBetweenPositionAndNextNonWhitespaceCharacter = getLinesBetweenPositionAndNextNonWhitespaceCharacter;
function getPreviousNonWhitespacePosition(pos, stopPos, sourceFile) {
if (stopPos === void 0) { stopPos = 0; }
while (pos-- > stopPos) {
if (!ts.isWhiteSpaceLike(sourceFile.text.charCodeAt(pos))) {
return pos;
}
}
}
/**
* Determines whether a name was originally the declaration name of an enum or namespace
* declaration.
*/
function isDeclarationNameOfEnumOrNamespace(node) {
var parseNode = ts.getParseTreeNode(node);
if (parseNode) {
switch (parseNode.parent.kind) {
case 258 /* EnumDeclaration */:
case 259 /* ModuleDeclaration */:
return parseNode === parseNode.parent.name;
}
}
return false;
}
ts.isDeclarationNameOfEnumOrNamespace = isDeclarationNameOfEnumOrNamespace;
function getInitializedVariables(node) {
return ts.filter(node.declarations, isInitializedVariable);
}
ts.getInitializedVariables = getInitializedVariables;
function isInitializedVariable(node) {
return node.initializer !== undefined;
}
function isWatchSet(options) {
// Firefox has Object.prototype.watch
return options.watch && options.hasOwnProperty("watch");
}
ts.isWatchSet = isWatchSet;
function closeFileWatcher(watcher) {
watcher.close();
}
ts.closeFileWatcher = closeFileWatcher;
function getCheckFlags(symbol) {
return symbol.flags & 33554432 /* Transient */ ? symbol.checkFlags : 0;
}
ts.getCheckFlags = getCheckFlags;
function getDeclarationModifierFlagsFromSymbol(s, isWrite) {
if (isWrite === void 0) { isWrite = false; }
if (s.valueDeclaration) {
var declaration = (isWrite && s.declarations && ts.find(s.declarations, function (d) { return d.kind === 171 /* SetAccessor */; })) || s.valueDeclaration;
var flags = ts.getCombinedModifierFlags(declaration);
return s.parent && s.parent.flags & 32 /* Class */ ? flags : flags & ~28 /* AccessibilityModifier */;
}
if (getCheckFlags(s) & 6 /* Synthetic */) {
var checkFlags = s.checkFlags;
var accessModifier = checkFlags & 1024 /* ContainsPrivate */ ? 8 /* Private */ :
checkFlags & 256 /* ContainsPublic */ ? 4 /* Public */ :
16 /* Protected */;
var staticModifier = checkFlags & 2048 /* ContainsStatic */ ? 32 /* Static */ : 0;
return accessModifier | staticModifier;
}
if (s.flags & 4194304 /* Prototype */) {
return 4 /* Public */ | 32 /* Static */;
}
return 0;
}
ts.getDeclarationModifierFlagsFromSymbol = getDeclarationModifierFlagsFromSymbol;
function skipAlias(symbol, checker) {
return symbol.flags & 2097152 /* Alias */ ? checker.getAliasedSymbol(symbol) : symbol;
}
ts.skipAlias = skipAlias;
/** See comment on `declareModuleMember` in `binder.ts`. */
function getCombinedLocalAndExportSymbolFlags(symbol) {
return symbol.exportSymbol ? symbol.exportSymbol.flags | symbol.flags : symbol.flags;
}
ts.getCombinedLocalAndExportSymbolFlags = getCombinedLocalAndExportSymbolFlags;
function isWriteOnlyAccess(node) {
return accessKind(node) === 1 /* Write */;
}
ts.isWriteOnlyAccess = isWriteOnlyAccess;
function isWriteAccess(node) {
return accessKind(node) !== 0 /* Read */;
}
ts.isWriteAccess = isWriteAccess;
var AccessKind;
(function (AccessKind) {
/** Only reads from a variable. */
AccessKind[AccessKind["Read"] = 0] = "Read";
/** Only writes to a variable without using the result. E.g.: `x++;`. */
AccessKind[AccessKind["Write"] = 1] = "Write";
/** Writes to a variable and uses the result as an expression. E.g.: `f(x++);`. */
AccessKind[AccessKind["ReadWrite"] = 2] = "ReadWrite";
})(AccessKind || (AccessKind = {}));
function accessKind(node) {
var parent = node.parent;
if (!parent)
return 0 /* Read */;
switch (parent.kind) {
case 210 /* ParenthesizedExpression */:
return accessKind(parent);
case 218 /* PostfixUnaryExpression */:
case 217 /* PrefixUnaryExpression */:
var operator = parent.operator;
return operator === 45 /* PlusPlusToken */ || operator === 46 /* MinusMinusToken */ ? writeOrReadWrite() : 0 /* Read */;
case 219 /* BinaryExpression */:
var _a = parent, left = _a.left, operatorToken = _a.operatorToken;
return left === node && isAssignmentOperator(operatorToken.kind) ?
operatorToken.kind === 63 /* EqualsToken */ ? 1 /* Write */ : writeOrReadWrite()
: 0 /* Read */;
case 204 /* PropertyAccessExpression */:
return parent.name !== node ? 0 /* Read */ : accessKind(parent);
case 291 /* PropertyAssignment */: {
var parentAccess = accessKind(parent.parent);
// In `({ x: varname }) = { x: 1 }`, the left `x` is a read, the right `x` is a write.
return node === parent.name ? reverseAccessKind(parentAccess) : parentAccess;
}
case 292 /* ShorthandPropertyAssignment */:
// Assume it's the local variable being accessed, since we don't check public properties for --noUnusedLocals.
return node === parent.objectAssignmentInitializer ? 0 /* Read */ : accessKind(parent.parent);
case 202 /* ArrayLiteralExpression */:
return accessKind(parent);
default:
return 0 /* Read */;
}
function writeOrReadWrite() {
// If grandparent is not an ExpressionStatement, this is used as an expression in addition to having a side effect.
return parent.parent && walkUpParenthesizedExpressions(parent.parent).kind === 236 /* ExpressionStatement */ ? 1 /* Write */ : 2 /* ReadWrite */;
}
}
function reverseAccessKind(a) {
switch (a) {
case 0 /* Read */:
return 1 /* Write */;
case 1 /* Write */:
return 0 /* Read */;
case 2 /* ReadWrite */:
return 2 /* ReadWrite */;
default:
return ts.Debug.assertNever(a);
}
}
function compareDataObjects(dst, src) {
if (!dst || !src || Object.keys(dst).length !== Object.keys(src).length) {
return false;
}
for (var e in dst) {
if (typeof dst[e] === "object") {
if (!compareDataObjects(dst[e], src[e])) {
return false;
}
}
else if (typeof dst[e] !== "function") {
if (dst[e] !== src[e]) {
return false;
}
}
}
return true;
}
ts.compareDataObjects = compareDataObjects;
/**
* clears already present map by calling onDeleteExistingValue callback before deleting that key/value
*/
function clearMap(map, onDeleteValue) {
// Remove all
map.forEach(onDeleteValue);
map.clear();
}
ts.clearMap = clearMap;
/**
* Mutates the map with newMap such that keys in map will be same as newMap.
*/
function mutateMapSkippingNewValues(map, newMap, options) {
var onDeleteValue = options.onDeleteValue, onExistingValue = options.onExistingValue;
// Needs update
map.forEach(function (existingValue, key) {
var valueInNewMap = newMap.get(key);
// Not present any more in new map, remove it
if (valueInNewMap === undefined) {
map.delete(key);
onDeleteValue(existingValue, key);
}
// If present notify about existing values
else if (onExistingValue) {
onExistingValue(existingValue, valueInNewMap, key);
}
});
}
ts.mutateMapSkippingNewValues = mutateMapSkippingNewValues;
/**
* Mutates the map with newMap such that keys in map will be same as newMap.
*/
function mutateMap(map, newMap, options) {
// Needs update
mutateMapSkippingNewValues(map, newMap, options);
var createNewValue = options.createNewValue;
// Add new values that are not already present
newMap.forEach(function (valueInNewMap, key) {
if (!map.has(key)) {
// New values
map.set(key, createNewValue(key, valueInNewMap));
}
});
}
ts.mutateMap = mutateMap;
function isAbstractConstructorSymbol(symbol) {
if (symbol.flags & 32 /* Class */) {
var declaration = getClassLikeDeclarationOfSymbol(symbol);
return !!declaration && hasSyntacticModifier(declaration, 128 /* Abstract */);
}
return false;
}
ts.isAbstractConstructorSymbol = isAbstractConstructorSymbol;
function getClassLikeDeclarationOfSymbol(symbol) {
var _a;
return (_a = symbol.declarations) === null || _a === void 0 ? void 0 : _a.find(ts.isClassLike);
}
ts.getClassLikeDeclarationOfSymbol = getClassLikeDeclarationOfSymbol;
function getObjectFlags(type) {
return type.flags & 3899393 /* ObjectFlagsType */ ? type.objectFlags : 0;
}
ts.getObjectFlags = getObjectFlags;
function typeHasCallOrConstructSignatures(type, checker) {
return checker.getSignaturesOfType(type, 0 /* Call */).length !== 0 || checker.getSignaturesOfType(type, 1 /* Construct */).length !== 0;
}
ts.typeHasCallOrConstructSignatures = typeHasCallOrConstructSignatures;
function forSomeAncestorDirectory(directory, callback) {
return !!ts.forEachAncestorDirectory(directory, function (d) { return callback(d) ? true : undefined; });
}
ts.forSomeAncestorDirectory = forSomeAncestorDirectory;
function isUMDExportSymbol(symbol) {
return !!symbol && !!symbol.declarations && !!symbol.declarations[0] && ts.isNamespaceExportDeclaration(symbol.declarations[0]);
}
ts.isUMDExportSymbol = isUMDExportSymbol;
function showModuleSpecifier(_a) {
var moduleSpecifier = _a.moduleSpecifier;
return ts.isStringLiteral(moduleSpecifier) ? moduleSpecifier.text : getTextOfNode(moduleSpecifier);
}
ts.showModuleSpecifier = showModuleSpecifier;
function getLastChild(node) {
var lastChild;
ts.forEachChild(node, function (child) {
if (nodeIsPresent(child))
lastChild = child;
}, function (children) {
// As an optimization, jump straight to the end of the list.
for (var i = children.length - 1; i >= 0; i--) {
if (nodeIsPresent(children[i])) {
lastChild = children[i];
break;
}
}
});
return lastChild;
}
ts.getLastChild = getLastChild;
function addToSeen(seen, key, value) {
if (value === void 0) { value = true; }
if (seen.has(key)) {
return false;
}
seen.set(key, value);
return true;
}
ts.addToSeen = addToSeen;
function isObjectTypeDeclaration(node) {
return ts.isClassLike(node) || ts.isInterfaceDeclaration(node) || ts.isTypeLiteralNode(node);
}
ts.isObjectTypeDeclaration = isObjectTypeDeclaration;
function isTypeNodeKind(kind) {
return (kind >= 175 /* FirstTypeNode */ && kind <= 198 /* LastTypeNode */)
|| kind === 129 /* AnyKeyword */
|| kind === 153 /* UnknownKeyword */
|| kind === 145 /* NumberKeyword */
|| kind === 156 /* BigIntKeyword */
|| kind === 146 /* ObjectKeyword */
|| kind === 132 /* BooleanKeyword */
|| kind === 148 /* StringKeyword */
|| kind === 149 /* SymbolKeyword */
|| kind === 114 /* VoidKeyword */
|| kind === 151 /* UndefinedKeyword */
|| kind === 142 /* NeverKeyword */
|| kind === 226 /* ExpressionWithTypeArguments */
|| kind === 307 /* JSDocAllType */
|| kind === 308 /* JSDocUnknownType */
|| kind === 309 /* JSDocNullableType */
|| kind === 310 /* JSDocNonNullableType */
|| kind === 311 /* JSDocOptionalType */
|| kind === 312 /* JSDocFunctionType */
|| kind === 313 /* JSDocVariadicType */;
}
ts.isTypeNodeKind = isTypeNodeKind;
function isAccessExpression(node) {
return node.kind === 204 /* PropertyAccessExpression */ || node.kind === 205 /* ElementAccessExpression */;
}
ts.isAccessExpression = isAccessExpression;
function getNameOfAccessExpression(node) {
if (node.kind === 204 /* PropertyAccessExpression */) {
return node.name;
}
ts.Debug.assert(node.kind === 205 /* ElementAccessExpression */);
return node.argumentExpression;
}
ts.getNameOfAccessExpression = getNameOfAccessExpression;
function isBundleFileTextLike(section) {
switch (section.kind) {
case "text" /* Text */:
case "internal" /* Internal */:
return true;
default:
return false;
}
}
ts.isBundleFileTextLike = isBundleFileTextLike;
function isNamedImportsOrExports(node) {
return node.kind === 267 /* NamedImports */ || node.kind === 271 /* NamedExports */;
}
ts.isNamedImportsOrExports = isNamedImportsOrExports;
function getLeftmostAccessExpression(expr) {
while (isAccessExpression(expr)) {
expr = expr.expression;
}
return expr;
}
ts.getLeftmostAccessExpression = getLeftmostAccessExpression;
function getLeftmostExpression(node, stopAtCallExpressions) {
while (true) {
switch (node.kind) {
case 218 /* PostfixUnaryExpression */:
node = node.operand;
continue;
case 219 /* BinaryExpression */:
node = node.left;
continue;
case 220 /* ConditionalExpression */:
node = node.condition;
continue;
case 208 /* TaggedTemplateExpression */:
node = node.tag;
continue;
case 206 /* CallExpression */:
if (stopAtCallExpressions) {
return node;
}
// falls through
case 227 /* AsExpression */:
case 205 /* ElementAccessExpression */:
case 204 /* PropertyAccessExpression */:
case 228 /* NonNullExpression */:
case 345 /* PartiallyEmittedExpression */:
node = node.expression;
continue;
}
return node;
}
}
ts.getLeftmostExpression = getLeftmostExpression;
function Symbol(flags, name) {
this.flags = flags;
this.escapedName = name;
this.declarations = undefined;
this.valueDeclaration = undefined;
this.id = undefined;
this.mergeId = undefined;
this.parent = undefined;
}
function Type(checker, flags) {
this.flags = flags;
if (ts.Debug.isDebugging || ts.tracing) {
this.checker = checker;
}
}
function Signature(checker, flags) {
this.flags = flags;
if (ts.Debug.isDebugging) {
this.checker = checker;
}
}
function Node(kind, pos, end) {
this.pos = pos;
this.end = end;
this.kind = kind;
this.id = 0;
this.flags = 0 /* None */;
this.modifierFlagsCache = 0 /* None */;
this.transformFlags = 0 /* None */;
this.parent = undefined;
this.original = undefined;
}
function Token(kind, pos, end) {
this.pos = pos;
this.end = end;
this.kind = kind;
this.id = 0;
this.flags = 0 /* None */;
this.transformFlags = 0 /* None */;
this.parent = undefined;
}
function Identifier(kind, pos, end) {
this.pos = pos;
this.end = end;
this.kind = kind;
this.id = 0;
this.flags = 0 /* None */;
this.transformFlags = 0 /* None */;
this.parent = undefined;
this.original = undefined;
this.flowNode = undefined;
}
function SourceMapSource(fileName, text, skipTrivia) {
this.fileName = fileName;
this.text = text;
this.skipTrivia = skipTrivia || (function (pos) { return pos; });
}
// eslint-disable-next-line prefer-const
ts.objectAllocator = {
getNodeConstructor: function () { return Node; },
getTokenConstructor: function () { return Token; },
getIdentifierConstructor: function () { return Identifier; },
getPrivateIdentifierConstructor: function () { return Node; },
getSourceFileConstructor: function () { return Node; },
getSymbolConstructor: function () { return Symbol; },
getTypeConstructor: function () { return Type; },
getSignatureConstructor: function () { return Signature; },
getSourceMapSourceConstructor: function () { return SourceMapSource; },
};
function setObjectAllocator(alloc) {
ts.objectAllocator = alloc;
}
ts.setObjectAllocator = setObjectAllocator;
function formatStringFromArgs(text, args, baseIndex) {
if (baseIndex === void 0) { baseIndex = 0; }
return text.replace(/{(\d+)}/g, function (_match, index) { return "" + ts.Debug.checkDefined(args[+index + baseIndex]); });
}
ts.formatStringFromArgs = formatStringFromArgs;
/* @internal */
function setLocalizedDiagnosticMessages(messages) {
ts.localizedDiagnosticMessages = messages;
}
ts.setLocalizedDiagnosticMessages = setLocalizedDiagnosticMessages;
function getLocaleSpecificMessage(message) {
return ts.localizedDiagnosticMessages && ts.localizedDiagnosticMessages[message.key] || message.message;
}
ts.getLocaleSpecificMessage = getLocaleSpecificMessage;
function createDetachedDiagnostic(fileName, start, length, message) {
assertDiagnosticLocation(/*file*/ undefined, start, length);
var text = getLocaleSpecificMessage(message);
if (arguments.length > 4) {
text = formatStringFromArgs(text, arguments, 4);
}
return {
file: undefined,
start: start,
length: length,
messageText: text,
category: message.category,
code: message.code,
reportsUnnecessary: message.reportsUnnecessary,
fileName: fileName,
};
}
ts.createDetachedDiagnostic = createDetachedDiagnostic;
function isDiagnosticWithDetachedLocation(diagnostic) {
return diagnostic.file === undefined
&& diagnostic.start !== undefined
&& diagnostic.length !== undefined
&& typeof diagnostic.fileName === "string";
}
function attachFileToDiagnostic(diagnostic, file) {
var fileName = file.fileName || "";
var length = file.text.length;
ts.Debug.assertEqual(diagnostic.fileName, fileName);
ts.Debug.assertLessThanOrEqual(diagnostic.start, length);
ts.Debug.assertLessThanOrEqual(diagnostic.start + diagnostic.length, length);
var diagnosticWithLocation = {
file: file,
start: diagnostic.start,
length: diagnostic.length,
messageText: diagnostic.messageText,
category: diagnostic.category,
code: diagnostic.code,
reportsUnnecessary: diagnostic.reportsUnnecessary
};
if (diagnostic.relatedInformation) {
diagnosticWithLocation.relatedInformation = [];
for (var _i = 0, _a = diagnostic.relatedInformation; _i < _a.length; _i++) {
var related = _a[_i];
if (isDiagnosticWithDetachedLocation(related) && related.fileName === fileName) {
ts.Debug.assertLessThanOrEqual(related.start, length);
ts.Debug.assertLessThanOrEqual(related.start + related.length, length);
diagnosticWithLocation.relatedInformation.push(attachFileToDiagnostic(related, file));
}
else {
diagnosticWithLocation.relatedInformation.push(related);
}
}
}
return diagnosticWithLocation;
}
function attachFileToDiagnostics(diagnostics, file) {
var diagnosticsWithLocation = [];
for (var _i = 0, diagnostics_1 = diagnostics; _i < diagnostics_1.length; _i++) {
var diagnostic = diagnostics_1[_i];
diagnosticsWithLocation.push(attachFileToDiagnostic(diagnostic, file));
}
return diagnosticsWithLocation;
}
ts.attachFileToDiagnostics = attachFileToDiagnostics;
function createFileDiagnostic(file, start, length, message) {
assertDiagnosticLocation(file, start, length);
var text = getLocaleSpecificMessage(message);
if (arguments.length > 4) {
text = formatStringFromArgs(text, arguments, 4);
}
return {
file: file,
start: start,
length: length,
messageText: text,
category: message.category,
code: message.code,
reportsUnnecessary: message.reportsUnnecessary,
reportsDeprecated: message.reportsDeprecated
};
}
ts.createFileDiagnostic = createFileDiagnostic;
function formatMessage(_dummy, message) {
var text = getLocaleSpecificMessage(message);
if (arguments.length > 2) {
text = formatStringFromArgs(text, arguments, 2);
}
return text;
}
ts.formatMessage = formatMessage;
function createCompilerDiagnostic(message) {
var text = getLocaleSpecificMessage(message);
if (arguments.length > 1) {
text = formatStringFromArgs(text, arguments, 1);
}
return {
file: undefined,
start: undefined,
length: undefined,
messageText: text,
category: message.category,
code: message.code,
reportsUnnecessary: message.reportsUnnecessary,
reportsDeprecated: message.reportsDeprecated
};
}
ts.createCompilerDiagnostic = createCompilerDiagnostic;
function createCompilerDiagnosticFromMessageChain(chain, relatedInformation) {
return {
file: undefined,
start: undefined,
length: undefined,
code: chain.code,
category: chain.category,
messageText: chain.next ? chain : chain.messageText,
relatedInformation: relatedInformation
};
}
ts.createCompilerDiagnosticFromMessageChain = createCompilerDiagnosticFromMessageChain;
function chainDiagnosticMessages(details, message) {
var text = getLocaleSpecificMessage(message);
if (arguments.length > 2) {
text = formatStringFromArgs(text, arguments, 2);
}
return {
messageText: text,
category: message.category,
code: message.code,
next: details === undefined || Array.isArray(details) ? details : [details]
};
}
ts.chainDiagnosticMessages = chainDiagnosticMessages;
function concatenateDiagnosticMessageChains(headChain, tailChain) {
var lastChain = headChain;
while (lastChain.next) {
lastChain = lastChain.next[0];
}
lastChain.next = [tailChain];
}
ts.concatenateDiagnosticMessageChains = concatenateDiagnosticMessageChains;
function getDiagnosticFilePath(diagnostic) {
return diagnostic.file ? diagnostic.file.path : undefined;
}
function compareDiagnostics(d1, d2) {
return compareDiagnosticsSkipRelatedInformation(d1, d2) ||
compareRelatedInformation(d1, d2) ||
0 /* EqualTo */;
}
ts.compareDiagnostics = compareDiagnostics;
function compareDiagnosticsSkipRelatedInformation(d1, d2) {
return ts.compareStringsCaseSensitive(getDiagnosticFilePath(d1), getDiagnosticFilePath(d2)) ||
ts.compareValues(d1.start, d2.start) ||
ts.compareValues(d1.length, d2.length) ||
ts.compareValues(d1.code, d2.code) ||
compareMessageText(d1.messageText, d2.messageText) ||
0 /* EqualTo */;
}
ts.compareDiagnosticsSkipRelatedInformation = compareDiagnosticsSkipRelatedInformation;
function compareRelatedInformation(d1, d2) {
if (!d1.relatedInformation && !d2.relatedInformation) {
return 0 /* EqualTo */;
}
if (d1.relatedInformation && d2.relatedInformation) {
return ts.compareValues(d1.relatedInformation.length, d2.relatedInformation.length) || ts.forEach(d1.relatedInformation, function (d1i, index) {
var d2i = d2.relatedInformation[index];
return compareDiagnostics(d1i, d2i); // EqualTo is 0, so falsy, and will cause the next item to be compared
}) || 0 /* EqualTo */;
}
return d1.relatedInformation ? -1 /* LessThan */ : 1 /* GreaterThan */;
}
function compareMessageText(t1, t2) {
if (typeof t1 === "string" && typeof t2 === "string") {
return ts.compareStringsCaseSensitive(t1, t2);
}
else if (typeof t1 === "string") {
return -1 /* LessThan */;
}
else if (typeof t2 === "string") {
return 1 /* GreaterThan */;
}
var res = ts.compareStringsCaseSensitive(t1.messageText, t2.messageText);
if (res) {
return res;
}
if (!t1.next && !t2.next) {
return 0 /* EqualTo */;
}
if (!t1.next) {
return -1 /* LessThan */;
}
if (!t2.next) {
return 1 /* GreaterThan */;
}
var len = Math.min(t1.next.length, t2.next.length);
for (var i = 0; i < len; i++) {
res = compareMessageText(t1.next[i], t2.next[i]);
if (res) {
return res;
}
}
if (t1.next.length < t2.next.length) {
return -1 /* LessThan */;
}
else if (t1.next.length > t2.next.length) {
return 1 /* GreaterThan */;
}
return 0 /* EqualTo */;
}
function getLanguageVariant(scriptKind) {
// .tsx and .jsx files are treated as jsx language variant.
return scriptKind === 4 /* TSX */ || scriptKind === 2 /* JSX */ || scriptKind === 1 /* JS */ || scriptKind === 6 /* JSON */ ? 1 /* JSX */ : 0 /* Standard */;
}
ts.getLanguageVariant = getLanguageVariant;
function getEmitScriptTarget(compilerOptions) {
return compilerOptions.target || 0 /* ES3 */;
}
ts.getEmitScriptTarget = getEmitScriptTarget;
function getEmitModuleKind(compilerOptions) {
return typeof compilerOptions.module === "number" ?
compilerOptions.module :
getEmitScriptTarget(compilerOptions) >= 2 /* ES2015 */ ? ts.ModuleKind.ES2015 : ts.ModuleKind.CommonJS;
}
ts.getEmitModuleKind = getEmitModuleKind;
function getEmitModuleResolutionKind(compilerOptions) {
var moduleResolution = compilerOptions.moduleResolution;
if (moduleResolution === undefined) {
moduleResolution = getEmitModuleKind(compilerOptions) === ts.ModuleKind.CommonJS ? ts.ModuleResolutionKind.NodeJs : ts.ModuleResolutionKind.Classic;
}
return moduleResolution;
}
ts.getEmitModuleResolutionKind = getEmitModuleResolutionKind;
function hasJsonModuleEmitEnabled(options) {
switch (getEmitModuleKind(options)) {
case ts.ModuleKind.CommonJS:
case ts.ModuleKind.AMD:
case ts.ModuleKind.ES2015:
case ts.ModuleKind.ES2020:
case ts.ModuleKind.ESNext:
return true;
default:
return false;
}
}
ts.hasJsonModuleEmitEnabled = hasJsonModuleEmitEnabled;
function unreachableCodeIsError(options) {
return options.allowUnreachableCode === false;
}
ts.unreachableCodeIsError = unreachableCodeIsError;
function unusedLabelIsError(options) {
return options.allowUnusedLabels === false;
}
ts.unusedLabelIsError = unusedLabelIsError;
function getAreDeclarationMapsEnabled(options) {
return !!(getEmitDeclarations(options) && options.declarationMap);
}
ts.getAreDeclarationMapsEnabled = getAreDeclarationMapsEnabled;
function getAllowSyntheticDefaultImports(compilerOptions) {
var moduleKind = getEmitModuleKind(compilerOptions);
return compilerOptions.allowSyntheticDefaultImports !== undefined
? compilerOptions.allowSyntheticDefaultImports
: compilerOptions.esModuleInterop ||
moduleKind === ts.ModuleKind.System;
}
ts.getAllowSyntheticDefaultImports = getAllowSyntheticDefaultImports;
function getEmitDeclarations(compilerOptions) {
return !!(compilerOptions.declaration || compilerOptions.composite);
}
ts.getEmitDeclarations = getEmitDeclarations;
function shouldPreserveConstEnums(compilerOptions) {
return !!(compilerOptions.preserveConstEnums || compilerOptions.isolatedModules);
}
ts.shouldPreserveConstEnums = shouldPreserveConstEnums;
function isIncrementalCompilation(options) {
return !!(options.incremental || options.composite);
}
ts.isIncrementalCompilation = isIncrementalCompilation;
function getStrictOptionValue(compilerOptions, flag) {
return compilerOptions[flag] === undefined ? !!compilerOptions.strict : !!compilerOptions[flag];
}
ts.getStrictOptionValue = getStrictOptionValue;
function getAllowJSCompilerOption(compilerOptions) {
return compilerOptions.allowJs === undefined ? !!compilerOptions.checkJs : compilerOptions.allowJs;
}
ts.getAllowJSCompilerOption = getAllowJSCompilerOption;
function getUseDefineForClassFields(compilerOptions) {
return compilerOptions.useDefineForClassFields === undefined ? compilerOptions.target === 99 /* ESNext */ : compilerOptions.useDefineForClassFields;
}
ts.getUseDefineForClassFields = getUseDefineForClassFields;
function compilerOptionsAffectSemanticDiagnostics(newOptions, oldOptions) {
return optionsHaveChanges(oldOptions, newOptions, ts.semanticDiagnosticsOptionDeclarations);
}
ts.compilerOptionsAffectSemanticDiagnostics = compilerOptionsAffectSemanticDiagnostics;
function compilerOptionsAffectEmit(newOptions, oldOptions) {
return optionsHaveChanges(oldOptions, newOptions, ts.affectsEmitOptionDeclarations);
}
ts.compilerOptionsAffectEmit = compilerOptionsAffectEmit;
function getCompilerOptionValue(options, option) {
return option.strictFlag ? getStrictOptionValue(options, option.name) : options[option.name];
}
ts.getCompilerOptionValue = getCompilerOptionValue;
function getJSXTransformEnabled(options) {
var jsx = options.jsx;
return jsx === 2 /* React */ || jsx === 4 /* ReactJSX */ || jsx === 5 /* ReactJSXDev */;
}
ts.getJSXTransformEnabled = getJSXTransformEnabled;
function getJSXImplicitImportBase(compilerOptions, file) {
var jsxImportSourcePragmas = file === null || file === void 0 ? void 0 : file.pragmas.get("jsximportsource");
var jsxImportSourcePragma = ts.isArray(jsxImportSourcePragmas) ? jsxImportSourcePragmas[jsxImportSourcePragmas.length - 1] : jsxImportSourcePragmas;
return compilerOptions.jsx === 4 /* ReactJSX */ ||
compilerOptions.jsx === 5 /* ReactJSXDev */ ||
compilerOptions.jsxImportSource ||
jsxImportSourcePragma ?
(jsxImportSourcePragma === null || jsxImportSourcePragma === void 0 ? void 0 : jsxImportSourcePragma.arguments.factory) || compilerOptions.jsxImportSource || "react" :
undefined;
}
ts.getJSXImplicitImportBase = getJSXImplicitImportBase;
function getJSXRuntimeImport(base, options) {
return base ? base + "/" + (options.jsx === 5 /* ReactJSXDev */ ? "jsx-dev-runtime" : "jsx-runtime") : undefined;
}
ts.getJSXRuntimeImport = getJSXRuntimeImport;
function hasZeroOrOneAsteriskCharacter(str) {
var seenAsterisk = false;
for (var i = 0; i < str.length; i++) {
if (str.charCodeAt(i) === 42 /* asterisk */) {
if (!seenAsterisk) {
seenAsterisk = true;
}
else {
// have already seen asterisk
return false;
}
}
}
return true;
}
ts.hasZeroOrOneAsteriskCharacter = hasZeroOrOneAsteriskCharacter;
function createSymlinkCache(cwd, getCanonicalFileName) {
var symlinkedDirectories;
var symlinkedDirectoriesByRealpath;
var symlinkedFiles;
var hasProcessedResolutions = false;
return {
getSymlinkedFiles: function () { return symlinkedFiles; },
getSymlinkedDirectories: function () { return symlinkedDirectories; },
getSymlinkedDirectoriesByRealpath: function () { return symlinkedDirectoriesByRealpath; },
setSymlinkedFile: function (path, real) { return (symlinkedFiles || (symlinkedFiles = new ts.Map())).set(path, real); },
setSymlinkedDirectory: function (symlink, real) {
// Large, interconnected dependency graphs in pnpm will have a huge number of symlinks
// where both the realpath and the symlink path are inside node_modules/.pnpm. Since
// this path is never a candidate for a module specifier, we can ignore it entirely.
var symlinkPath = ts.toPath(symlink, cwd, getCanonicalFileName);
if (!containsIgnoredPath(symlinkPath)) {
symlinkPath = ts.ensureTrailingDirectorySeparator(symlinkPath);
if (real !== false && !(symlinkedDirectories === null || symlinkedDirectories === void 0 ? void 0 : symlinkedDirectories.has(symlinkPath))) {
(symlinkedDirectoriesByRealpath || (symlinkedDirectoriesByRealpath = ts.createMultiMap())).add(ts.ensureTrailingDirectorySeparator(real.realPath), symlink);
}
(symlinkedDirectories || (symlinkedDirectories = new ts.Map())).set(symlinkPath, real);
}
},
setSymlinkedDirectoryFromSymlinkedFile: function (symlink, real) {
this.setSymlinkedFile(ts.toPath(symlink, cwd, getCanonicalFileName), real);
var _a = guessDirectorySymlink(real, symlink, cwd, getCanonicalFileName) || ts.emptyArray, commonResolved = _a[0], commonOriginal = _a[1];
if (commonResolved && commonOriginal) {
this.setSymlinkedDirectory(commonOriginal, {
real: commonResolved,
realPath: ts.toPath(commonResolved, cwd, getCanonicalFileName),
});
}
},
setSymlinksFromResolutions: function (files, typeReferenceDirectives) {
var _this = this;
var _a;
ts.Debug.assert(!hasProcessedResolutions);
hasProcessedResolutions = true;
for (var _i = 0, files_1 = files; _i < files_1.length; _i++) {
var file = files_1[_i];
(_a = file.resolvedModules) === null || _a === void 0 ? void 0 : _a.forEach(function (resolution) { return processResolution(_this, resolution); });
}
typeReferenceDirectives === null || typeReferenceDirectives === void 0 ? void 0 : typeReferenceDirectives.forEach(function (resolution) { return processResolution(_this, resolution); });
},
hasProcessedResolutions: function () { return hasProcessedResolutions; },
};
function processResolution(cache, resolution) {
if (!resolution || !resolution.originalPath || !resolution.resolvedFileName)
return;
var resolvedFileName = resolution.resolvedFileName, originalPath = resolution.originalPath;
cache.setSymlinkedFile(ts.toPath(originalPath, cwd, getCanonicalFileName), resolvedFileName);
var _a = guessDirectorySymlink(resolvedFileName, originalPath, cwd, getCanonicalFileName) || ts.emptyArray, commonResolved = _a[0], commonOriginal = _a[1];
if (commonResolved && commonOriginal) {
cache.setSymlinkedDirectory(commonOriginal, { real: commonResolved, realPath: ts.toPath(commonResolved, cwd, getCanonicalFileName) });
}
}
}
ts.createSymlinkCache = createSymlinkCache;
function guessDirectorySymlink(a, b, cwd, getCanonicalFileName) {
var aParts = ts.getPathComponents(ts.getNormalizedAbsolutePath(a, cwd));
var bParts = ts.getPathComponents(ts.getNormalizedAbsolutePath(b, cwd));
var isDirectory = false;
while (!isNodeModulesOrScopedPackageDirectory(aParts[aParts.length - 2], getCanonicalFileName) &&
!isNodeModulesOrScopedPackageDirectory(bParts[bParts.length - 2], getCanonicalFileName) &&
getCanonicalFileName(aParts[aParts.length - 1]) === getCanonicalFileName(bParts[bParts.length - 1])) {
aParts.pop();
bParts.pop();
isDirectory = true;
}
return isDirectory ? [ts.getPathFromPathComponents(aParts), ts.getPathFromPathComponents(bParts)] : undefined;
}
// KLUDGE: Don't assume one 'node_modules' links to another. More likely a single directory inside the node_modules is the symlink.
// ALso, don't assume that an `@foo` directory is linked. More likely the contents of that are linked.
function isNodeModulesOrScopedPackageDirectory(s, getCanonicalFileName) {
return getCanonicalFileName(s) === "node_modules" || ts.startsWith(s, "@");
}
function stripLeadingDirectorySeparator(s) {
return ts.isAnyDirectorySeparator(s.charCodeAt(0)) ? s.slice(1) : undefined;
}
function tryRemoveDirectoryPrefix(path, dirPath, getCanonicalFileName) {
var withoutPrefix = ts.tryRemovePrefix(path, dirPath, getCanonicalFileName);
return withoutPrefix === undefined ? undefined : stripLeadingDirectorySeparator(withoutPrefix);
}
ts.tryRemoveDirectoryPrefix = tryRemoveDirectoryPrefix;
// Reserved characters, forces escaping of any non-word (or digit), non-whitespace character.
// It may be inefficient (we could just match (/[-[\]{}()*+?.,\\^$|#\s]/g), but this is future
// proof.
var reservedCharacterPattern = /[^\w\s\/]/g;
function regExpEscape(text) {
return text.replace(reservedCharacterPattern, escapeRegExpCharacter);
}
ts.regExpEscape = regExpEscape;
function escapeRegExpCharacter(match) {
return "\\" + match;
}
var wildcardCharCodes = [42 /* asterisk */, 63 /* question */];
ts.commonPackageFolders = ["node_modules", "bower_components", "jspm_packages"];
var implicitExcludePathRegexPattern = "(?!(" + ts.commonPackageFolders.join("|") + ")(/|$))";
var filesMatcher = {
/**
* Matches any single directory segment unless it is the last segment and a .min.js file
* Breakdown:
* [^./] # matches everything up to the first . character (excluding directory separators)
* (\\.(?!min\\.js$))? # matches . characters but not if they are part of the .min.js file extension
*/
singleAsteriskRegexFragment: "([^./]|(\\.(?!min\\.js$))?)*",
/**
* Regex for the ** wildcard. Matches any number of subdirectories. When used for including
* files or directories, does not match subdirectories that start with a . character
*/
doubleAsteriskRegexFragment: "(/" + implicitExcludePathRegexPattern + "[^/.][^/]*)*?",
replaceWildcardCharacter: function (match) { return replaceWildcardCharacter(match, filesMatcher.singleAsteriskRegexFragment); }
};
var directoriesMatcher = {
singleAsteriskRegexFragment: "[^/]*",
/**
* Regex for the ** wildcard. Matches any number of subdirectories. When used for including
* files or directories, does not match subdirectories that start with a . character
*/
doubleAsteriskRegexFragment: "(/" + implicitExcludePathRegexPattern + "[^/.][^/]*)*?",
replaceWildcardCharacter: function (match) { return replaceWildcardCharacter(match, directoriesMatcher.singleAsteriskRegexFragment); }
};
var excludeMatcher = {
singleAsteriskRegexFragment: "[^/]*",
doubleAsteriskRegexFragment: "(/.+?)?",
replaceWildcardCharacter: function (match) { return replaceWildcardCharacter(match, excludeMatcher.singleAsteriskRegexFragment); }
};
var wildcardMatchers = {
files: filesMatcher,
directories: directoriesMatcher,
exclude: excludeMatcher
};
function getRegularExpressionForWildcard(specs, basePath, usage) {
var patterns = getRegularExpressionsForWildcards(specs, basePath, usage);
if (!patterns || !patterns.length) {
return undefined;
}
var pattern = patterns.map(function (pattern) { return "(" + pattern + ")"; }).join("|");
// If excluding, match "foo/bar/baz...", but if including, only allow "foo".
var terminator = usage === "exclude" ? "($|/)" : "$";
return "^(" + pattern + ")" + terminator;
}
ts.getRegularExpressionForWildcard = getRegularExpressionForWildcard;
function getRegularExpressionsForWildcards(specs, basePath, usage) {
if (specs === undefined || specs.length === 0) {
return undefined;
}
return ts.flatMap(specs, function (spec) {
return spec && getSubPatternFromSpec(spec, basePath, usage, wildcardMatchers[usage]);
});
}
ts.getRegularExpressionsForWildcards = getRegularExpressionsForWildcards;
/**
* An "includes" path "foo" is implicitly a glob "foo/** /*" (without the space) if its last component has no extension,
* and does not contain any glob characters itself.
*/
function isImplicitGlob(lastPathComponent) {
return !/[.*?]/.test(lastPathComponent);
}
ts.isImplicitGlob = isImplicitGlob;
function getPatternFromSpec(spec, basePath, usage) {
var pattern = spec && getSubPatternFromSpec(spec, basePath, usage, wildcardMatchers[usage]);
return pattern && "^(" + pattern + ")" + (usage === "exclude" ? "($|/)" : "$");
}
ts.getPatternFromSpec = getPatternFromSpec;
function getSubPatternFromSpec(spec, basePath, usage, _a) {
var singleAsteriskRegexFragment = _a.singleAsteriskRegexFragment, doubleAsteriskRegexFragment = _a.doubleAsteriskRegexFragment, replaceWildcardCharacter = _a.replaceWildcardCharacter;
var subpattern = "";
var hasWrittenComponent = false;
var components = ts.getNormalizedPathComponents(spec, basePath);
var lastComponent = ts.last(components);
if (usage !== "exclude" && lastComponent === "**") {
return undefined;
}
// getNormalizedPathComponents includes the separator for the root component.
// We need to remove to create our regex correctly.
components[0] = ts.removeTrailingDirectorySeparator(components[0]);
if (isImplicitGlob(lastComponent)) {
components.push("**", "*");
}
var optionalCount = 0;
for (var _i = 0, components_1 = components; _i < components_1.length; _i++) {
var component = components_1[_i];
if (component === "**") {
subpattern += doubleAsteriskRegexFragment;
}
else {
if (usage === "directories") {
subpattern += "(";
optionalCount++;
}
if (hasWrittenComponent) {
subpattern += ts.directorySeparator;
}
if (usage !== "exclude") {
var componentPattern = "";
// The * and ? wildcards should not match directories or files that start with . if they
// appear first in a component. Dotted directories and files can be included explicitly
// like so: **/.*/.*
if (component.charCodeAt(0) === 42 /* asterisk */) {
componentPattern += "([^./]" + singleAsteriskRegexFragment + ")?";
component = component.substr(1);
}
else if (component.charCodeAt(0) === 63 /* question */) {
componentPattern += "[^./]";
component = component.substr(1);
}
componentPattern += component.replace(reservedCharacterPattern, replaceWildcardCharacter);
// Patterns should not include subfolders like node_modules unless they are
// explicitly included as part of the path.
//
// As an optimization, if the component pattern is the same as the component,
// then there definitely were no wildcard characters and we do not need to
// add the exclusion pattern.
if (componentPattern !== component) {
subpattern += implicitExcludePathRegexPattern;
}
subpattern += componentPattern;
}
else {
subpattern += component.replace(reservedCharacterPattern, replaceWildcardCharacter);
}
}
hasWrittenComponent = true;
}
while (optionalCount > 0) {
subpattern += ")?";
optionalCount--;
}
return subpattern;
}
function replaceWildcardCharacter(match, singleAsteriskRegexFragment) {
return match === "*" ? singleAsteriskRegexFragment : match === "?" ? "[^/]" : "\\" + match;
}
/** @param path directory of the tsconfig.json */
function getFileMatcherPatterns(path, excludes, includes, useCaseSensitiveFileNames, currentDirectory) {
path = ts.normalizePath(path);
currentDirectory = ts.normalizePath(currentDirectory);
var absolutePath = ts.combinePaths(currentDirectory, path);
return {
includeFilePatterns: ts.map(getRegularExpressionsForWildcards(includes, absolutePath, "files"), function (pattern) { return "^" + pattern + "$"; }),
includeFilePattern: getRegularExpressionForWildcard(includes, absolutePath, "files"),
includeDirectoryPattern: getRegularExpressionForWildcard(includes, absolutePath, "directories"),
excludePattern: getRegularExpressionForWildcard(excludes, absolutePath, "exclude"),
basePaths: getBasePaths(path, includes, useCaseSensitiveFileNames)
};
}
ts.getFileMatcherPatterns = getFileMatcherPatterns;
function getRegexFromPattern(pattern, useCaseSensitiveFileNames) {
return new RegExp(pattern, useCaseSensitiveFileNames ? "" : "i");
}
ts.getRegexFromPattern = getRegexFromPattern;
/** @param path directory of the tsconfig.json */
function matchFiles(path, extensions, excludes, includes, useCaseSensitiveFileNames, currentDirectory, depth, getFileSystemEntries, realpath, directoryExists) {
path = ts.normalizePath(path);
currentDirectory = ts.normalizePath(currentDirectory);
var patterns = getFileMatcherPatterns(path, excludes, includes, useCaseSensitiveFileNames, currentDirectory);
var includeFileRegexes = patterns.includeFilePatterns && patterns.includeFilePatterns.map(function (pattern) { return getRegexFromPattern(pattern, useCaseSensitiveFileNames); });
var includeDirectoryRegex = patterns.includeDirectoryPattern && getRegexFromPattern(patterns.includeDirectoryPattern, useCaseSensitiveFileNames);
var excludeRegex = patterns.excludePattern && getRegexFromPattern(patterns.excludePattern, useCaseSensitiveFileNames);
// Associate an array of results with each include regex. This keeps results in order of the "include" order.
// If there are no "includes", then just put everything in results[0].
var results = includeFileRegexes ? includeFileRegexes.map(function () { return []; }) : [[]];
var visited = new ts.Map();
var toCanonical = ts.createGetCanonicalFileName(useCaseSensitiveFileNames);
for (var _i = 0, _a = patterns.basePaths; _i < _a.length; _i++) {
var basePath = _a[_i];
if (directoryExists(basePath)) {
visitDirectory(basePath, ts.combinePaths(currentDirectory, basePath), depth);
}
}
return ts.flatten(results);
function visitDirectory(path, absolutePath, depth) {
var canonicalPath = toCanonical(realpath(absolutePath));
if (visited.has(canonicalPath))
return;
visited.set(canonicalPath, true);
var _a = getFileSystemEntries(path), files = _a.files, directories = _a.directories;
var _loop_1 = function (current) {
var name = ts.combinePaths(path, current);
var absoluteName = ts.combinePaths(absolutePath, current);
if (extensions && !ts.fileExtensionIsOneOf(name, extensions))
return "continue";
if (excludeRegex && excludeRegex.test(absoluteName))
return "continue";
if (!includeFileRegexes) {
results[0].push(name);
}
else {
var includeIndex = ts.findIndex(includeFileRegexes, function (re) { return re.test(absoluteName); });
if (includeIndex !== -1) {
results[includeIndex].push(name);
}
}
};
for (var _i = 0, _b = ts.sort(files, ts.compareStringsCaseSensitive); _i < _b.length; _i++) {
var current = _b[_i];
_loop_1(current);
}
if (depth !== undefined) {
depth--;
if (depth === 0) {
return;
}
}
for (var _c = 0, _d = ts.sort(directories, ts.compareStringsCaseSensitive); _c < _d.length; _c++) {
var current = _d[_c];
var name = ts.combinePaths(path, current);
var absoluteName = ts.combinePaths(absolutePath, current);
if ((!includeDirectoryRegex || includeDirectoryRegex.test(absoluteName)) &&
(!excludeRegex || !excludeRegex.test(absoluteName))) {
visitDirectory(name, absoluteName, depth);
}
}
}
}
ts.matchFiles = matchFiles;
/**
* Computes the unique non-wildcard base paths amongst the provided include patterns.
*/
function getBasePaths(path, includes, useCaseSensitiveFileNames) {
// Storage for our results in the form of literal paths (e.g. the paths as written by the user).
var basePaths = [path];
if (includes) {
// Storage for literal base paths amongst the include patterns.
var includeBasePaths = [];
for (var _i = 0, includes_1 = includes; _i < includes_1.length; _i++) {
var include = includes_1[_i];
// We also need to check the relative paths by converting them to absolute and normalizing
// in case they escape the base path (e.g "..\somedirectory")
var absolute = ts.isRootedDiskPath(include) ? include : ts.normalizePath(ts.combinePaths(path, include));
// Append the literal and canonical candidate base paths.
includeBasePaths.push(getIncludeBasePath(absolute));
}
// Sort the offsets array using either the literal or canonical path representations.
includeBasePaths.sort(ts.getStringComparer(!useCaseSensitiveFileNames));
var _loop_2 = function (includeBasePath) {
if (ts.every(basePaths, function (basePath) { return !ts.containsPath(basePath, includeBasePath, path, !useCaseSensitiveFileNames); })) {
basePaths.push(includeBasePath);
}
};
// Iterate over each include base path and include unique base paths that are not a
// subpath of an existing base path
for (var _a = 0, includeBasePaths_1 = includeBasePaths; _a < includeBasePaths_1.length; _a++) {
var includeBasePath = includeBasePaths_1[_a];
_loop_2(includeBasePath);
}
}
return basePaths;
}
function getIncludeBasePath(absolute) {
var wildcardOffset = ts.indexOfAnyCharCode(absolute, wildcardCharCodes);
if (wildcardOffset < 0) {
// No "*" or "?" in the path
return !ts.hasExtension(absolute)
? absolute
: ts.removeTrailingDirectorySeparator(ts.getDirectoryPath(absolute));
}
return absolute.substring(0, absolute.lastIndexOf(ts.directorySeparator, wildcardOffset));
}
function ensureScriptKind(fileName, scriptKind) {
// Using scriptKind as a condition handles both:
// - 'scriptKind' is unspecified and thus it is `undefined`
// - 'scriptKind' is set and it is `Unknown` (0)
// If the 'scriptKind' is 'undefined' or 'Unknown' then we attempt
// to get the ScriptKind from the file name. If it cannot be resolved
// from the file name then the default 'TS' script kind is returned.
return scriptKind || getScriptKindFromFileName(fileName) || 3 /* TS */;
}
ts.ensureScriptKind = ensureScriptKind;
function getScriptKindFromFileName(fileName) {
var ext = fileName.substr(fileName.lastIndexOf("."));
switch (ext.toLowerCase()) {
case ".js" /* Js */:
return 1 /* JS */;
case ".jsx" /* Jsx */:
return 2 /* JSX */;
case ".ts" /* Ts */:
return 3 /* TS */;
case ".tsx" /* Tsx */:
return 4 /* TSX */;
case ".json" /* Json */:
return 6 /* JSON */;
default:
return 0 /* Unknown */;
}
}
ts.getScriptKindFromFileName = getScriptKindFromFileName;
/**
* List of supported extensions in order of file resolution precedence.
*/
ts.supportedTSExtensions = [".ts" /* Ts */, ".tsx" /* Tsx */, ".d.ts" /* Dts */];
ts.supportedTSExtensionsWithJson = [".ts" /* Ts */, ".tsx" /* Tsx */, ".d.ts" /* Dts */, ".json" /* Json */];
/** Must have ".d.ts" first because if ".ts" goes first, that will be detected as the extension instead of ".d.ts". */
ts.supportedTSExtensionsForExtractExtension = [".d.ts" /* Dts */, ".ts" /* Ts */, ".tsx" /* Tsx */];
ts.supportedJSExtensions = [".js" /* Js */, ".jsx" /* Jsx */];
ts.supportedJSAndJsonExtensions = [".js" /* Js */, ".jsx" /* Jsx */, ".json" /* Json */];
var allSupportedExtensions = __spreadArray(__spreadArray([], ts.supportedTSExtensions, true), ts.supportedJSExtensions, true);
var allSupportedExtensionsWithJson = __spreadArray(__spreadArray(__spreadArray([], ts.supportedTSExtensions, true), ts.supportedJSExtensions, true), [".json" /* Json */], false);
function getSupportedExtensions(options, extraFileExtensions) {
var needJsExtensions = options && getAllowJSCompilerOption(options);
if (!extraFileExtensions || extraFileExtensions.length === 0) {
return needJsExtensions ? allSupportedExtensions : ts.supportedTSExtensions;
}
var extensions = __spreadArray(__spreadArray([], needJsExtensions ? allSupportedExtensions : ts.supportedTSExtensions, true), ts.mapDefined(extraFileExtensions, function (x) { return x.scriptKind === 7 /* Deferred */ || needJsExtensions && isJSLike(x.scriptKind) ? x.extension : undefined; }), true);
return ts.deduplicate(extensions, ts.equateStringsCaseSensitive, ts.compareStringsCaseSensitive);
}
ts.getSupportedExtensions = getSupportedExtensions;
function getSuppoertedExtensionsWithJsonIfResolveJsonModule(options, supportedExtensions) {
if (!options || !options.resolveJsonModule) {
return supportedExtensions;
}
if (supportedExtensions === allSupportedExtensions) {
return allSupportedExtensionsWithJson;
}
if (supportedExtensions === ts.supportedTSExtensions) {
return ts.supportedTSExtensionsWithJson;
}
return __spreadArray(__spreadArray([], supportedExtensions, true), [".json" /* Json */], false);
}
ts.getSuppoertedExtensionsWithJsonIfResolveJsonModule = getSuppoertedExtensionsWithJsonIfResolveJsonModule;
function isJSLike(scriptKind) {
return scriptKind === 1 /* JS */ || scriptKind === 2 /* JSX */;
}
function hasJSFileExtension(fileName) {
return ts.some(ts.supportedJSExtensions, function (extension) { return ts.fileExtensionIs(fileName, extension); });
}
ts.hasJSFileExtension = hasJSFileExtension;
function hasTSFileExtension(fileName) {
return ts.some(ts.supportedTSExtensions, function (extension) { return ts.fileExtensionIs(fileName, extension); });
}
ts.hasTSFileExtension = hasTSFileExtension;
function isSupportedSourceFileName(fileName, compilerOptions, extraFileExtensions) {
if (!fileName) {
return false;
}
var supportedExtensions = getSupportedExtensions(compilerOptions, extraFileExtensions);
for (var _i = 0, _a = getSuppoertedExtensionsWithJsonIfResolveJsonModule(compilerOptions, supportedExtensions); _i < _a.length; _i++) {
var extension = _a[_i];
if (ts.fileExtensionIs(fileName, extension)) {
return true;
}
}
return false;
}
ts.isSupportedSourceFileName = isSupportedSourceFileName;
function numberOfDirectorySeparators(str) {
var match = str.match(/\//g);
return match ? match.length : 0;
}
function compareNumberOfDirectorySeparators(path1, path2) {
return ts.compareValues(numberOfDirectorySeparators(path1), numberOfDirectorySeparators(path2));
}
ts.compareNumberOfDirectorySeparators = compareNumberOfDirectorySeparators;
/**
* Extension boundaries by priority. Lower numbers indicate higher priorities, and are
* aligned to the offset of the highest priority extension in the
* allSupportedExtensions array.
*/
var ExtensionPriority;
(function (ExtensionPriority) {
ExtensionPriority[ExtensionPriority["TypeScriptFiles"] = 0] = "TypeScriptFiles";
ExtensionPriority[ExtensionPriority["DeclarationAndJavaScriptFiles"] = 2] = "DeclarationAndJavaScriptFiles";
ExtensionPriority[ExtensionPriority["Highest"] = 0] = "Highest";
ExtensionPriority[ExtensionPriority["Lowest"] = 2] = "Lowest";
})(ExtensionPriority = ts.ExtensionPriority || (ts.ExtensionPriority = {}));
function getExtensionPriority(path, supportedExtensions) {
for (var i = supportedExtensions.length - 1; i >= 0; i--) {
if (ts.fileExtensionIs(path, supportedExtensions[i])) {
return adjustExtensionPriority(i, supportedExtensions);
}
}
// If its not in the list of supported extensions, this is likely a
// TypeScript file with a non-ts extension
return 0 /* Highest */;
}
ts.getExtensionPriority = getExtensionPriority;
/**
* Adjusts an extension priority to be the highest priority within the same range.
*/
function adjustExtensionPriority(extensionPriority, supportedExtensions) {
if (extensionPriority < 2 /* DeclarationAndJavaScriptFiles */) {
return 0 /* TypeScriptFiles */;
}
else if (extensionPriority < supportedExtensions.length) {
return 2 /* DeclarationAndJavaScriptFiles */;
}
else {
return supportedExtensions.length;
}
}
ts.adjustExtensionPriority = adjustExtensionPriority;
/**
* Gets the next lowest extension priority for a given priority.
*/
function getNextLowestExtensionPriority(extensionPriority, supportedExtensions) {
if (extensionPriority < 2 /* DeclarationAndJavaScriptFiles */) {
return 2 /* DeclarationAndJavaScriptFiles */;
}
else {
return supportedExtensions.length;
}
}
ts.getNextLowestExtensionPriority = getNextLowestExtensionPriority;
var extensionsToRemove = [".d.ts" /* Dts */, ".ts" /* Ts */, ".js" /* Js */, ".tsx" /* Tsx */, ".jsx" /* Jsx */, ".json" /* Json */];
function removeFileExtension(path) {
for (var _i = 0, extensionsToRemove_1 = extensionsToRemove; _i < extensionsToRemove_1.length; _i++) {
var ext = extensionsToRemove_1[_i];
var extensionless = tryRemoveExtension(path, ext);
if (extensionless !== undefined) {
return extensionless;
}
}
return path;
}
ts.removeFileExtension = removeFileExtension;
function tryRemoveExtension(path, extension) {
return ts.fileExtensionIs(path, extension) ? removeExtension(path, extension) : undefined;
}
ts.tryRemoveExtension = tryRemoveExtension;
function removeExtension(path, extension) {
return path.substring(0, path.length - extension.length);
}
ts.removeExtension = removeExtension;
function changeExtension(path, newExtension) {
return ts.changeAnyExtension(path, newExtension, extensionsToRemove, /*ignoreCase*/ false);
}
ts.changeExtension = changeExtension;
/**
* Returns the input if there are no stars, a pattern if there is exactly one,
* and undefined if there are more.
*/
function tryParsePattern(pattern) {
var indexOfStar = pattern.indexOf("*");
if (indexOfStar === -1) {
return pattern;
}
return pattern.indexOf("*", indexOfStar + 1) !== -1
? undefined
: {
prefix: pattern.substr(0, indexOfStar),
suffix: pattern.substr(indexOfStar + 1)
};
}
ts.tryParsePattern = tryParsePattern;
function tryParsePatterns(paths) {
return ts.mapDefined(ts.getOwnKeys(paths), function (path) { return tryParsePattern(path); });
}
ts.tryParsePatterns = tryParsePatterns;
function positionIsSynthesized(pos) {
// This is a fast way of testing the following conditions:
// pos === undefined || pos === null || isNaN(pos) || pos < 0;
return !(pos >= 0);
}
ts.positionIsSynthesized = positionIsSynthesized;
/** True if an extension is one of the supported TypeScript extensions. */
function extensionIsTS(ext) {
return ext === ".ts" /* Ts */ || ext === ".tsx" /* Tsx */ || ext === ".d.ts" /* Dts */;
}
ts.extensionIsTS = extensionIsTS;
function resolutionExtensionIsTSOrJson(ext) {
return extensionIsTS(ext) || ext === ".json" /* Json */;
}
ts.resolutionExtensionIsTSOrJson = resolutionExtensionIsTSOrJson;
/**
* Gets the extension from a path.
* Path must have a valid extension.
*/
function extensionFromPath(path) {
var ext = tryGetExtensionFromPath(path);
return ext !== undefined ? ext : ts.Debug.fail("File " + path + " has unknown extension.");
}
ts.extensionFromPath = extensionFromPath;
function isAnySupportedFileExtension(path) {
return tryGetExtensionFromPath(path) !== undefined;
}
ts.isAnySupportedFileExtension = isAnySupportedFileExtension;
function tryGetExtensionFromPath(path) {
return ts.find(extensionsToRemove, function (e) { return ts.fileExtensionIs(path, e); });
}
ts.tryGetExtensionFromPath = tryGetExtensionFromPath;
function isCheckJsEnabledForFile(sourceFile, compilerOptions) {
return sourceFile.checkJsDirective ? sourceFile.checkJsDirective.enabled : compilerOptions.checkJs;
}
ts.isCheckJsEnabledForFile = isCheckJsEnabledForFile;
ts.emptyFileSystemEntries = {
files: ts.emptyArray,
directories: ts.emptyArray
};
/**
* patternOrStrings contains both patterns (containing "*") and regular strings.
* Return an exact match if possible, or a pattern match, or undefined.
* (These are verified by verifyCompilerOptions to have 0 or 1 "*" characters.)
*/
function matchPatternOrExact(patternOrStrings, candidate) {
var patterns = [];
for (var _i = 0, patternOrStrings_1 = patternOrStrings; _i < patternOrStrings_1.length; _i++) {
var patternOrString = patternOrStrings_1[_i];
if (patternOrString === candidate) {
return candidate;
}
if (!ts.isString(patternOrString)) {
patterns.push(patternOrString);
}
}
return ts.findBestPatternMatch(patterns, function (_) { return _; }, candidate);
}
ts.matchPatternOrExact = matchPatternOrExact;
function sliceAfter(arr, value) {
var index = arr.indexOf(value);
ts.Debug.assert(index !== -1);
return arr.slice(index);
}
ts.sliceAfter = sliceAfter;
function addRelatedInfo(diagnostic) {
var _a;
var relatedInformation = [];
for (var _i = 1; _i < arguments.length; _i++) {
relatedInformation[_i - 1] = arguments[_i];
}
if (!relatedInformation.length) {
return diagnostic;
}
if (!diagnostic.relatedInformation) {
diagnostic.relatedInformation = [];
}
ts.Debug.assert(diagnostic.relatedInformation !== ts.emptyArray, "Diagnostic had empty array singleton for related info, but is still being constructed!");
(_a = diagnostic.relatedInformation).push.apply(_a, relatedInformation);
return diagnostic;
}
ts.addRelatedInfo = addRelatedInfo;
function minAndMax(arr, getValue) {
ts.Debug.assert(arr.length !== 0);
var min = getValue(arr[0]);
var max = min;
for (var i = 1; i < arr.length; i++) {
var value = getValue(arr[i]);
if (value < min) {
min = value;
}
else if (value > max) {
max = value;
}
}
return { min: min, max: max };
}
ts.minAndMax = minAndMax;
function rangeOfNode(node) {
return { pos: getTokenPosOfNode(node), end: node.end };
}
ts.rangeOfNode = rangeOfNode;
function rangeOfTypeParameters(sourceFile, typeParameters) {
// Include the `<>`
var pos = typeParameters.pos - 1;
var end = ts.skipTrivia(sourceFile.text, typeParameters.end) + 1;
return { pos: pos, end: end };
}
ts.rangeOfTypeParameters = rangeOfTypeParameters;
function skipTypeChecking(sourceFile, options, host) {
// If skipLibCheck is enabled, skip reporting errors if file is a declaration file.
// If skipDefaultLibCheck is enabled, skip reporting errors if file contains a
// '/// <reference no-default-lib="true"/>' directive.
return (options.skipLibCheck && sourceFile.isDeclarationFile ||
options.skipDefaultLibCheck && sourceFile.hasNoDefaultLib) ||
host.isSourceOfProjectReferenceRedirect(sourceFile.fileName);
}
ts.skipTypeChecking = skipTypeChecking;
function isJsonEqual(a, b) {
// eslint-disable-next-line no-null/no-null
return a === b || typeof a === "object" && a !== null && typeof b === "object" && b !== null && ts.equalOwnProperties(a, b, isJsonEqual);
}
ts.isJsonEqual = isJsonEqual;
/**
* Converts a bigint literal string, e.g. `0x1234n`,
* to its decimal string representation, e.g. `4660`.
*/
function parsePseudoBigInt(stringValue) {
var log2Base;
switch (stringValue.charCodeAt(1)) { // "x" in "0x123"
case 98 /* b */:
case 66 /* B */: // 0b or 0B
log2Base = 1;
break;
case 111 /* o */:
case 79 /* O */: // 0o or 0O
log2Base = 3;
break;
case 120 /* x */:
case 88 /* X */: // 0x or 0X
log2Base = 4;
break;
default: // already in decimal; omit trailing "n"
var nIndex = stringValue.length - 1;
// Skip leading 0s
var nonZeroStart = 0;
while (stringValue.charCodeAt(nonZeroStart) === 48 /* _0 */) {
nonZeroStart++;
}
return stringValue.slice(nonZeroStart, nIndex) || "0";
}
// Omit leading "0b", "0o", or "0x", and trailing "n"
var startIndex = 2, endIndex = stringValue.length - 1;
var bitsNeeded = (endIndex - startIndex) * log2Base;
// Stores the value specified by the string as a LE array of 16-bit integers
// using Uint16 instead of Uint32 so combining steps can use bitwise operators
var segments = new Uint16Array((bitsNeeded >>> 4) + (bitsNeeded & 15 ? 1 : 0));
// Add the digits, one at a time
for (var i = endIndex - 1, bitOffset = 0; i >= startIndex; i--, bitOffset += log2Base) {
var segment = bitOffset >>> 4;
var digitChar = stringValue.charCodeAt(i);
// Find character range: 0-9 < A-F < a-f
var digit = digitChar <= 57 /* _9 */
? digitChar - 48 /* _0 */
: 10 + digitChar -
(digitChar <= 70 /* F */ ? 65 /* A */ : 97 /* a */);
var shiftedDigit = digit << (bitOffset & 15);
segments[segment] |= shiftedDigit;
var residual = shiftedDigit >>> 16;
if (residual)
segments[segment + 1] |= residual; // overflows segment
}
// Repeatedly divide segments by 10 and add remainder to base10Value
var base10Value = "";
var firstNonzeroSegment = segments.length - 1;
var segmentsRemaining = true;
while (segmentsRemaining) {
var mod10 = 0;
segmentsRemaining = false;
for (var segment = firstNonzeroSegment; segment >= 0; segment--) {
var newSegment = mod10 << 16 | segments[segment];
var segmentValue = (newSegment / 10) | 0;
segments[segment] = segmentValue;
mod10 = newSegment - segmentValue * 10;
if (segmentValue && !segmentsRemaining) {
firstNonzeroSegment = segment;
segmentsRemaining = true;
}
}
base10Value = mod10 + base10Value;
}
return base10Value;
}
ts.parsePseudoBigInt = parsePseudoBigInt;
function pseudoBigIntToString(_a) {
var negative = _a.negative, base10Value = _a.base10Value;
return (negative && base10Value !== "0" ? "-" : "") + base10Value;
}
ts.pseudoBigIntToString = pseudoBigIntToString;
function isValidTypeOnlyAliasUseSite(useSite) {
return !!(useSite.flags & 8388608 /* Ambient */)
|| isPartOfTypeQuery(useSite)
|| isIdentifierInNonEmittingHeritageClause(useSite)
|| isPartOfPossiblyValidTypeOrAbstractComputedPropertyName(useSite)
|| !(isExpressionNode(useSite) || isShorthandPropertyNameUseSite(useSite));
}
ts.isValidTypeOnlyAliasUseSite = isValidTypeOnlyAliasUseSite;
function typeOnlyDeclarationIsExport(typeOnlyDeclaration) {
return typeOnlyDeclaration.kind === 273 /* ExportSpecifier */;
}
ts.typeOnlyDeclarationIsExport = typeOnlyDeclarationIsExport;
function isShorthandPropertyNameUseSite(useSite) {
return ts.isIdentifier(useSite) && ts.isShorthandPropertyAssignment(useSite.parent) && useSite.parent.name === useSite;
}
function isPartOfPossiblyValidTypeOrAbstractComputedPropertyName(node) {
while (node.kind === 79 /* Identifier */ || node.kind === 204 /* PropertyAccessExpression */) {
node = node.parent;
}
if (node.kind !== 160 /* ComputedPropertyName */) {
return false;
}
if (hasSyntacticModifier(node.parent, 128 /* Abstract */)) {
return true;
}
var containerKind = node.parent.parent.kind;
return containerKind === 256 /* InterfaceDeclaration */ || containerKind === 180 /* TypeLiteral */;
}
/** Returns true for an identifier in 1) an `implements` clause, and 2) an `extends` clause of an interface. */
function isIdentifierInNonEmittingHeritageClause(node) {
if (node.kind !== 79 /* Identifier */)
return false;
var heritageClause = ts.findAncestor(node.parent, function (parent) {
switch (parent.kind) {
case 289 /* HeritageClause */:
return true;
case 204 /* PropertyAccessExpression */:
case 226 /* ExpressionWithTypeArguments */:
return false;
default:
return "quit";
}
});
return (heritageClause === null || heritageClause === void 0 ? void 0 : heritageClause.token) === 117 /* ImplementsKeyword */ || (heritageClause === null || heritageClause === void 0 ? void 0 : heritageClause.parent.kind) === 256 /* InterfaceDeclaration */;
}
function isIdentifierTypeReference(node) {
return ts.isTypeReferenceNode(node) && ts.isIdentifier(node.typeName);
}
ts.isIdentifierTypeReference = isIdentifierTypeReference;
function arrayIsHomogeneous(array, comparer) {
if (comparer === void 0) { comparer = ts.equateValues; }
if (array.length < 2)
return true;
var first = array[0];
for (var i = 1, length_1 = array.length; i < length_1; i++) {
var target = array[i];
if (!comparer(first, target))
return false;
}
return true;
}
ts.arrayIsHomogeneous = arrayIsHomogeneous;
/**
* Bypasses immutability and directly sets the `pos` property of a `TextRange` or `Node`.
*/
/* @internal */
function setTextRangePos(range, pos) {
range.pos = pos;
return range;
}
ts.setTextRangePos = setTextRangePos;
/**
* Bypasses immutability and directly sets the `end` property of a `TextRange` or `Node`.
*/
/* @internal */
function setTextRangeEnd(range, end) {
range.end = end;
return range;
}
ts.setTextRangeEnd = setTextRangeEnd;
/**
* Bypasses immutability and directly sets the `pos` and `end` properties of a `TextRange` or `Node`.
*/
/* @internal */
function setTextRangePosEnd(range, pos, end) {
return setTextRangeEnd(setTextRangePos(range, pos), end);
}
ts.setTextRangePosEnd = setTextRangePosEnd;
/**
* Bypasses immutability and directly sets the `pos` and `end` properties of a `TextRange` or `Node` from the
* provided position and width.
*/
/* @internal */
function setTextRangePosWidth(range, pos, width) {
return setTextRangePosEnd(range, pos, pos + width);
}
ts.setTextRangePosWidth = setTextRangePosWidth;
function setNodeFlags(node, newFlags) {
if (node) {
node.flags = newFlags;
}
return node;
}
ts.setNodeFlags = setNodeFlags;
function setParent(child, parent) {
if (child && parent) {
child.parent = parent;
}
return child;
}
ts.setParent = setParent;
function setEachParent(children, parent) {
if (children) {
for (var _i = 0, children_1 = children; _i < children_1.length; _i++) {
var child = children_1[_i];
setParent(child, parent);
}
}
return children;
}
ts.setEachParent = setEachParent;
function setParentRecursive(rootNode, incremental) {
if (!rootNode)
return rootNode;
ts.forEachChildRecursively(rootNode, ts.isJSDocNode(rootNode) ? bindParentToChildIgnoringJSDoc : bindParentToChild);
return rootNode;
function bindParentToChildIgnoringJSDoc(child, parent) {
if (incremental && child.parent === parent) {
return "skip";
}
setParent(child, parent);
}
function bindJSDoc(child) {
if (ts.hasJSDocNodes(child)) {
for (var _i = 0, _a = child.jsDoc; _i < _a.length; _i++) {
var doc = _a[_i];
bindParentToChildIgnoringJSDoc(doc, child);
ts.forEachChildRecursively(doc, bindParentToChildIgnoringJSDoc);
}
}
}
function bindParentToChild(child, parent) {
return bindParentToChildIgnoringJSDoc(child, parent) || bindJSDoc(child);
}
}
ts.setParentRecursive = setParentRecursive;
function isPackedElement(node) {
return !ts.isOmittedExpression(node);
}
/**
* Determines whether the provided node is an ArrayLiteralExpression that contains no missing elements.
*/
function isPackedArrayLiteral(node) {
return ts.isArrayLiteralExpression(node) && ts.every(node.elements, isPackedElement);
}
ts.isPackedArrayLiteral = isPackedArrayLiteral;
/**
* Indicates whether the result of an `Expression` will be unused.
*
* NOTE: This requires a node with a valid `parent` pointer.
*/
function expressionResultIsUnused(node) {
ts.Debug.assertIsDefined(node.parent);
while (true) {
var parent = node.parent;
// walk up parenthesized expressions, but keep a pointer to the top-most parenthesized expression
if (ts.isParenthesizedExpression(parent)) {
node = parent;
continue;
}
// result is unused in an expression statement, `void` expression, or the initializer or incrementer of a `for` loop
if (ts.isExpressionStatement(parent) ||
ts.isVoidExpression(parent) ||
ts.isForStatement(parent) && (parent.initializer === node || parent.incrementor === node)) {
return true;
}
if (ts.isCommaListExpression(parent)) {
// left side of comma is always unused
if (node !== ts.last(parent.elements))
return true;
// right side of comma is unused if parent is unused
node = parent;
continue;
}
if (ts.isBinaryExpression(parent) && parent.operatorToken.kind === 27 /* CommaToken */) {
// left side of comma is always unused
if (node === parent.left)
return true;
// right side of comma is unused if parent is unused
node = parent;
continue;
}
return false;
}
}
ts.expressionResultIsUnused = expressionResultIsUnused;
function containsIgnoredPath(path) {
return ts.some(ts.ignoredPaths, function (p) { return ts.stringContains(path, p); });
}
ts.containsIgnoredPath = containsIgnoredPath;
function getContainingNodeArray(node) {
if (!node.parent)
return undefined;
switch (node.kind) {
case 161 /* TypeParameter */:
var parent_1 = node.parent;
return parent_1.kind === 188 /* InferType */ ? undefined : parent_1.typeParameters;
case 162 /* Parameter */:
return node.parent.parameters;
case 197 /* TemplateLiteralTypeSpan */:
return node.parent.templateSpans;
case 231 /* TemplateSpan */:
return node.parent.templateSpans;
case 163 /* Decorator */:
return node.parent.decorators;
case 289 /* HeritageClause */:
return node.parent.heritageClauses;
}
var parent = node.parent;
if (ts.isJSDocTag(node)) {
return ts.isJSDocTypeLiteral(node.parent) ? undefined : node.parent.tags;
}
switch (parent.kind) {
case 180 /* TypeLiteral */:
case 256 /* InterfaceDeclaration */:
return ts.isTypeElement(node) ? parent.members : undefined;
case 185 /* UnionType */:
case 186 /* IntersectionType */:
return parent.types;
case 182 /* TupleType */:
case 202 /* ArrayLiteralExpression */:
case 346 /* CommaListExpression */:
case 267 /* NamedImports */:
case 271 /* NamedExports */:
return parent.elements;
case 203 /* ObjectLiteralExpression */:
case 284 /* JsxAttributes */:
return parent.properties;
case 206 /* CallExpression */:
case 207 /* NewExpression */:
return ts.isTypeNode(node) ? parent.typeArguments :
parent.expression === node ? undefined :
parent.arguments;
case 276 /* JsxElement */:
case 280 /* JsxFragment */:
return ts.isJsxChild(node) ? parent.children : undefined;
case 278 /* JsxOpeningElement */:
case 277 /* JsxSelfClosingElement */:
return ts.isTypeNode(node) ? parent.typeArguments : undefined;
case 233 /* Block */:
case 287 /* CaseClause */:
case 288 /* DefaultClause */:
case 260 /* ModuleBlock */:
return parent.statements;
case 261 /* CaseBlock */:
return parent.clauses;
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
return ts.isClassElement(node) ? parent.members : undefined;
case 258 /* EnumDeclaration */:
return ts.isEnumMember(node) ? parent.members : undefined;
case 300 /* SourceFile */:
return parent.statements;
}
}
ts.getContainingNodeArray = getContainingNodeArray;
function hasContextSensitiveParameters(node) {
// Functions with type parameters are not context sensitive.
if (!node.typeParameters) {
// Functions with any parameters that lack type annotations are context sensitive.
if (ts.some(node.parameters, function (p) { return !getEffectiveTypeAnnotationNode(p); })) {
return true;
}
if (node.kind !== 212 /* ArrowFunction */) {
// If the first parameter is not an explicit 'this' parameter, then the function has
// an implicit 'this' parameter which is subject to contextual typing.
var parameter = ts.firstOrUndefined(node.parameters);
if (!(parameter && parameterIsThisKeyword(parameter))) {
return true;
}
}
}
return false;
}
ts.hasContextSensitiveParameters = hasContextSensitiveParameters;
/* @internal */
function isInfinityOrNaNString(name) {
return name === "Infinity" || name === "-Infinity" || name === "NaN";
}
ts.isInfinityOrNaNString = isInfinityOrNaNString;
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
/**
* Creates a `BaseNodeFactory` which can be used to create `Node` instances from the constructors provided by the object allocator.
*/
function createBaseNodeFactory() {
// tslint:disable variable-name
var NodeConstructor;
var TokenConstructor;
var IdentifierConstructor;
var PrivateIdentifierConstructor;
var SourceFileConstructor;
// tslint:enable variable-name
return {
createBaseSourceFileNode: createBaseSourceFileNode,
createBaseIdentifierNode: createBaseIdentifierNode,
createBasePrivateIdentifierNode: createBasePrivateIdentifierNode,
createBaseTokenNode: createBaseTokenNode,
createBaseNode: createBaseNode
};
function createBaseSourceFileNode(kind) {
return new (SourceFileConstructor || (SourceFileConstructor = ts.objectAllocator.getSourceFileConstructor()))(kind, /*pos*/ -1, /*end*/ -1);
}
function createBaseIdentifierNode(kind) {
return new (IdentifierConstructor || (IdentifierConstructor = ts.objectAllocator.getIdentifierConstructor()))(kind, /*pos*/ -1, /*end*/ -1);
}
function createBasePrivateIdentifierNode(kind) {
return new (PrivateIdentifierConstructor || (PrivateIdentifierConstructor = ts.objectAllocator.getPrivateIdentifierConstructor()))(kind, /*pos*/ -1, /*end*/ -1);
}
function createBaseTokenNode(kind) {
return new (TokenConstructor || (TokenConstructor = ts.objectAllocator.getTokenConstructor()))(kind, /*pos*/ -1, /*end*/ -1);
}
function createBaseNode(kind) {
return new (NodeConstructor || (NodeConstructor = ts.objectAllocator.getNodeConstructor()))(kind, /*pos*/ -1, /*end*/ -1);
}
}
ts.createBaseNodeFactory = createBaseNodeFactory;
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
function createParenthesizerRules(factory) {
var binaryLeftOperandParenthesizerCache;
var binaryRightOperandParenthesizerCache;
return {
getParenthesizeLeftSideOfBinaryForOperator: getParenthesizeLeftSideOfBinaryForOperator,
getParenthesizeRightSideOfBinaryForOperator: getParenthesizeRightSideOfBinaryForOperator,
parenthesizeLeftSideOfBinary: parenthesizeLeftSideOfBinary,
parenthesizeRightSideOfBinary: parenthesizeRightSideOfBinary,
parenthesizeExpressionOfComputedPropertyName: parenthesizeExpressionOfComputedPropertyName,
parenthesizeConditionOfConditionalExpression: parenthesizeConditionOfConditionalExpression,
parenthesizeBranchOfConditionalExpression: parenthesizeBranchOfConditionalExpression,
parenthesizeExpressionOfExportDefault: parenthesizeExpressionOfExportDefault,
parenthesizeExpressionOfNew: parenthesizeExpressionOfNew,
parenthesizeLeftSideOfAccess: parenthesizeLeftSideOfAccess,
parenthesizeOperandOfPostfixUnary: parenthesizeOperandOfPostfixUnary,
parenthesizeOperandOfPrefixUnary: parenthesizeOperandOfPrefixUnary,
parenthesizeExpressionsOfCommaDelimitedList: parenthesizeExpressionsOfCommaDelimitedList,
parenthesizeExpressionForDisallowedComma: parenthesizeExpressionForDisallowedComma,
parenthesizeExpressionOfExpressionStatement: parenthesizeExpressionOfExpressionStatement,
parenthesizeConciseBodyOfArrowFunction: parenthesizeConciseBodyOfArrowFunction,
parenthesizeMemberOfConditionalType: parenthesizeMemberOfConditionalType,
parenthesizeMemberOfElementType: parenthesizeMemberOfElementType,
parenthesizeElementTypeOfArrayType: parenthesizeElementTypeOfArrayType,
parenthesizeConstituentTypesOfUnionOrIntersectionType: parenthesizeConstituentTypesOfUnionOrIntersectionType,
parenthesizeTypeArguments: parenthesizeTypeArguments,
};
function getParenthesizeLeftSideOfBinaryForOperator(operatorKind) {
binaryLeftOperandParenthesizerCache || (binaryLeftOperandParenthesizerCache = new ts.Map());
var parenthesizerRule = binaryLeftOperandParenthesizerCache.get(operatorKind);
if (!parenthesizerRule) {
parenthesizerRule = function (node) { return parenthesizeLeftSideOfBinary(operatorKind, node); };
binaryLeftOperandParenthesizerCache.set(operatorKind, parenthesizerRule);
}
return parenthesizerRule;
}
function getParenthesizeRightSideOfBinaryForOperator(operatorKind) {
binaryRightOperandParenthesizerCache || (binaryRightOperandParenthesizerCache = new ts.Map());
var parenthesizerRule = binaryRightOperandParenthesizerCache.get(operatorKind);
if (!parenthesizerRule) {
parenthesizerRule = function (node) { return parenthesizeRightSideOfBinary(operatorKind, /*leftSide*/ undefined, node); };
binaryRightOperandParenthesizerCache.set(operatorKind, parenthesizerRule);
}
return parenthesizerRule;
}
/**
* Determines whether the operand to a BinaryExpression needs to be parenthesized.
*
* @param binaryOperator The operator for the BinaryExpression.
* @param operand The operand for the BinaryExpression.
* @param isLeftSideOfBinary A value indicating whether the operand is the left side of the
* BinaryExpression.
*/
function binaryOperandNeedsParentheses(binaryOperator, operand, isLeftSideOfBinary, leftOperand) {
// If the operand has lower precedence, then it needs to be parenthesized to preserve the
// intent of the expression. For example, if the operand is `a + b` and the operator is
// `*`, then we need to parenthesize the operand to preserve the intended order of
// operations: `(a + b) * x`.
//
// If the operand has higher precedence, then it does not need to be parenthesized. For
// example, if the operand is `a * b` and the operator is `+`, then we do not need to
// parenthesize to preserve the intended order of operations: `a * b + x`.
//
// If the operand has the same precedence, then we need to check the associativity of
// the operator based on whether this is the left or right operand of the expression.
//
// For example, if `a / d` is on the right of operator `*`, we need to parenthesize
// to preserve the intended order of operations: `x * (a / d)`
//
// If `a ** d` is on the left of operator `**`, we need to parenthesize to preserve
// the intended order of operations: `(a ** b) ** c`
var binaryOperatorPrecedence = ts.getOperatorPrecedence(219 /* BinaryExpression */, binaryOperator);
var binaryOperatorAssociativity = ts.getOperatorAssociativity(219 /* BinaryExpression */, binaryOperator);
var emittedOperand = ts.skipPartiallyEmittedExpressions(operand);
if (!isLeftSideOfBinary && operand.kind === 212 /* ArrowFunction */ && binaryOperatorPrecedence > 3 /* Assignment */) {
// We need to parenthesize arrow functions on the right side to avoid it being
// parsed as parenthesized expression: `a && (() => {})`
return true;
}
var operandPrecedence = ts.getExpressionPrecedence(emittedOperand);
switch (ts.compareValues(operandPrecedence, binaryOperatorPrecedence)) {
case -1 /* LessThan */:
// If the operand is the right side of a right-associative binary operation
// and is a yield expression, then we do not need parentheses.
if (!isLeftSideOfBinary
&& binaryOperatorAssociativity === 1 /* Right */
&& operand.kind === 222 /* YieldExpression */) {
return false;
}
return true;
case 1 /* GreaterThan */:
return false;
case 0 /* EqualTo */:
if (isLeftSideOfBinary) {
// No need to parenthesize the left operand when the binary operator is
// left associative:
// (a*b)/x -> a*b/x
// (a**b)/x -> a**b/x
//
// Parentheses are needed for the left operand when the binary operator is
// right associative:
// (a/b)**x -> (a/b)**x
// (a**b)**x -> (a**b)**x
return binaryOperatorAssociativity === 1 /* Right */;
}
else {
if (ts.isBinaryExpression(emittedOperand)
&& emittedOperand.operatorToken.kind === binaryOperator) {
// No need to parenthesize the right operand when the binary operator and
// operand are the same and one of the following:
// x*(a*b) => x*a*b
// x|(a|b) => x|a|b
// x&(a&b) => x&a&b
// x^(a^b) => x^a^b
if (operatorHasAssociativeProperty(binaryOperator)) {
return false;
}
// No need to parenthesize the right operand when the binary operator
// is plus (+) if both the left and right operands consist solely of either
// literals of the same kind or binary plus (+) expressions for literals of
// the same kind (recursively).
// "a"+(1+2) => "a"+(1+2)
// "a"+("b"+"c") => "a"+"b"+"c"
if (binaryOperator === 39 /* PlusToken */) {
var leftKind = leftOperand ? getLiteralKindOfBinaryPlusOperand(leftOperand) : 0 /* Unknown */;
if (ts.isLiteralKind(leftKind) && leftKind === getLiteralKindOfBinaryPlusOperand(emittedOperand)) {
return false;
}
}
}
// No need to parenthesize the right operand when the operand is right
// associative:
// x/(a**b) -> x/a**b
// x**(a**b) -> x**a**b
//
// Parentheses are needed for the right operand when the operand is left
// associative:
// x/(a*b) -> x/(a*b)
// x**(a/b) -> x**(a/b)
var operandAssociativity = ts.getExpressionAssociativity(emittedOperand);
return operandAssociativity === 0 /* Left */;
}
}
}
/**
* Determines whether a binary operator is mathematically associative.
*
* @param binaryOperator The binary operator.
*/
function operatorHasAssociativeProperty(binaryOperator) {
// The following operators are associative in JavaScript:
// (a*b)*c -> a*(b*c) -> a*b*c
// (a|b)|c -> a|(b|c) -> a|b|c
// (a&b)&c -> a&(b&c) -> a&b&c
// (a^b)^c -> a^(b^c) -> a^b^c
//
// While addition is associative in mathematics, JavaScript's `+` is not
// guaranteed to be associative as it is overloaded with string concatenation.
return binaryOperator === 41 /* AsteriskToken */
|| binaryOperator === 51 /* BarToken */
|| binaryOperator === 50 /* AmpersandToken */
|| binaryOperator === 52 /* CaretToken */;
}
/**
* This function determines whether an expression consists of a homogeneous set of
* literal expressions or binary plus expressions that all share the same literal kind.
* It is used to determine whether the right-hand operand of a binary plus expression can be
* emitted without parentheses.
*/
function getLiteralKindOfBinaryPlusOperand(node) {
node = ts.skipPartiallyEmittedExpressions(node);
if (ts.isLiteralKind(node.kind)) {
return node.kind;
}
if (node.kind === 219 /* BinaryExpression */ && node.operatorToken.kind === 39 /* PlusToken */) {
if (node.cachedLiteralKind !== undefined) {
return node.cachedLiteralKind;
}
var leftKind = getLiteralKindOfBinaryPlusOperand(node.left);
var literalKind = ts.isLiteralKind(leftKind)
&& leftKind === getLiteralKindOfBinaryPlusOperand(node.right)
? leftKind
: 0 /* Unknown */;
node.cachedLiteralKind = literalKind;
return literalKind;
}
return 0 /* Unknown */;
}
/**
* Wraps the operand to a BinaryExpression in parentheses if they are needed to preserve the intended
* order of operations.
*
* @param binaryOperator The operator for the BinaryExpression.
* @param operand The operand for the BinaryExpression.
* @param isLeftSideOfBinary A value indicating whether the operand is the left side of the
* BinaryExpression.
*/
function parenthesizeBinaryOperand(binaryOperator, operand, isLeftSideOfBinary, leftOperand) {
var skipped = ts.skipPartiallyEmittedExpressions(operand);
// If the resulting expression is already parenthesized, we do not need to do any further processing.
if (skipped.kind === 210 /* ParenthesizedExpression */) {
return operand;
}
return binaryOperandNeedsParentheses(binaryOperator, operand, isLeftSideOfBinary, leftOperand)
? factory.createParenthesizedExpression(operand)
: operand;
}
function parenthesizeLeftSideOfBinary(binaryOperator, leftSide) {
return parenthesizeBinaryOperand(binaryOperator, leftSide, /*isLeftSideOfBinary*/ true);
}
function parenthesizeRightSideOfBinary(binaryOperator, leftSide, rightSide) {
return parenthesizeBinaryOperand(binaryOperator, rightSide, /*isLeftSideOfBinary*/ false, leftSide);
}
function parenthesizeExpressionOfComputedPropertyName(expression) {
return ts.isCommaSequence(expression) ? factory.createParenthesizedExpression(expression) : expression;
}
function parenthesizeConditionOfConditionalExpression(condition) {
var conditionalPrecedence = ts.getOperatorPrecedence(220 /* ConditionalExpression */, 57 /* QuestionToken */);
var emittedCondition = ts.skipPartiallyEmittedExpressions(condition);
var conditionPrecedence = ts.getExpressionPrecedence(emittedCondition);
if (ts.compareValues(conditionPrecedence, conditionalPrecedence) !== 1 /* GreaterThan */) {
return factory.createParenthesizedExpression(condition);
}
return condition;
}
function parenthesizeBranchOfConditionalExpression(branch) {
// per ES grammar both 'whenTrue' and 'whenFalse' parts of conditional expression are assignment expressions
// so in case when comma expression is introduced as a part of previous transformations
// if should be wrapped in parens since comma operator has the lowest precedence
var emittedExpression = ts.skipPartiallyEmittedExpressions(branch);
return ts.isCommaSequence(emittedExpression)
? factory.createParenthesizedExpression(branch)
: branch;
}
/**
* [Per the spec](https://tc39.github.io/ecma262/#prod-ExportDeclaration), `export default` accepts _AssigmentExpression_ but
* has a lookahead restriction for `function`, `async function`, and `class`.
*
* Basically, that means we need to parenthesize in the following cases:
*
* - BinaryExpression of CommaToken
* - CommaList (synthetic list of multiple comma expressions)
* - FunctionExpression
* - ClassExpression
*/
function parenthesizeExpressionOfExportDefault(expression) {
var check = ts.skipPartiallyEmittedExpressions(expression);
var needsParens = ts.isCommaSequence(check);
if (!needsParens) {
switch (ts.getLeftmostExpression(check, /*stopAtCallExpression*/ false).kind) {
case 224 /* ClassExpression */:
case 211 /* FunctionExpression */:
needsParens = true;
}
}
return needsParens ? factory.createParenthesizedExpression(expression) : expression;
}
/**
* Wraps an expression in parentheses if it is needed in order to use the expression
* as the expression of a `NewExpression` node.
*/
function parenthesizeExpressionOfNew(expression) {
var leftmostExpr = ts.getLeftmostExpression(expression, /*stopAtCallExpressions*/ true);
switch (leftmostExpr.kind) {
case 206 /* CallExpression */:
return factory.createParenthesizedExpression(expression);
case 207 /* NewExpression */:
return !leftmostExpr.arguments
? factory.createParenthesizedExpression(expression)
: expression; // TODO(rbuckton): Verify this assertion holds
}
return parenthesizeLeftSideOfAccess(expression);
}
/**
* Wraps an expression in parentheses if it is needed in order to use the expression for
* property or element access.
*/
function parenthesizeLeftSideOfAccess(expression) {
// isLeftHandSideExpression is almost the correct criterion for when it is not necessary
// to parenthesize the expression before a dot. The known exception is:
//
// NewExpression:
// new C.x -> not the same as (new C).x
//
var emittedExpression = ts.skipPartiallyEmittedExpressions(expression);
if (ts.isLeftHandSideExpression(emittedExpression)
&& (emittedExpression.kind !== 207 /* NewExpression */ || emittedExpression.arguments)) {
// TODO(rbuckton): Verify whether this assertion holds.
return expression;
}
// TODO(rbuckton): Verifiy whether `setTextRange` is needed.
return ts.setTextRange(factory.createParenthesizedExpression(expression), expression);
}
function parenthesizeOperandOfPostfixUnary(operand) {
// TODO(rbuckton): Verifiy whether `setTextRange` is needed.
return ts.isLeftHandSideExpression(operand) ? operand : ts.setTextRange(factory.createParenthesizedExpression(operand), operand);
}
function parenthesizeOperandOfPrefixUnary(operand) {
// TODO(rbuckton): Verifiy whether `setTextRange` is needed.
return ts.isUnaryExpression(operand) ? operand : ts.setTextRange(factory.createParenthesizedExpression(operand), operand);
}
function parenthesizeExpressionsOfCommaDelimitedList(elements) {
var result = ts.sameMap(elements, parenthesizeExpressionForDisallowedComma);
return ts.setTextRange(factory.createNodeArray(result, elements.hasTrailingComma), elements);
}
function parenthesizeExpressionForDisallowedComma(expression) {
var emittedExpression = ts.skipPartiallyEmittedExpressions(expression);
var expressionPrecedence = ts.getExpressionPrecedence(emittedExpression);
var commaPrecedence = ts.getOperatorPrecedence(219 /* BinaryExpression */, 27 /* CommaToken */);
// TODO(rbuckton): Verifiy whether `setTextRange` is needed.
return expressionPrecedence > commaPrecedence ? expression : ts.setTextRange(factory.createParenthesizedExpression(expression), expression);
}
function parenthesizeExpressionOfExpressionStatement(expression) {
var emittedExpression = ts.skipPartiallyEmittedExpressions(expression);
if (ts.isCallExpression(emittedExpression)) {
var callee = emittedExpression.expression;
var kind = ts.skipPartiallyEmittedExpressions(callee).kind;
if (kind === 211 /* FunctionExpression */ || kind === 212 /* ArrowFunction */) {
// TODO(rbuckton): Verifiy whether `setTextRange` is needed.
var updated = factory.updateCallExpression(emittedExpression, ts.setTextRange(factory.createParenthesizedExpression(callee), callee), emittedExpression.typeArguments, emittedExpression.arguments);
return factory.restoreOuterExpressions(expression, updated, 8 /* PartiallyEmittedExpressions */);
}
}
var leftmostExpressionKind = ts.getLeftmostExpression(emittedExpression, /*stopAtCallExpressions*/ false).kind;
if (leftmostExpressionKind === 203 /* ObjectLiteralExpression */ || leftmostExpressionKind === 211 /* FunctionExpression */) {
// TODO(rbuckton): Verifiy whether `setTextRange` is needed.
return ts.setTextRange(factory.createParenthesizedExpression(expression), expression);
}
return expression;
}
function parenthesizeConciseBodyOfArrowFunction(body) {
if (!ts.isBlock(body) && (ts.isCommaSequence(body) || ts.getLeftmostExpression(body, /*stopAtCallExpressions*/ false).kind === 203 /* ObjectLiteralExpression */)) {
// TODO(rbuckton): Verifiy whether `setTextRange` is needed.
return ts.setTextRange(factory.createParenthesizedExpression(body), body);
}
return body;
}
function parenthesizeMemberOfConditionalType(member) {
return member.kind === 187 /* ConditionalType */ ? factory.createParenthesizedType(member) : member;
}
function parenthesizeMemberOfElementType(member) {
switch (member.kind) {
case 185 /* UnionType */:
case 186 /* IntersectionType */:
case 177 /* FunctionType */:
case 178 /* ConstructorType */:
return factory.createParenthesizedType(member);
}
return parenthesizeMemberOfConditionalType(member);
}
function parenthesizeElementTypeOfArrayType(member) {
switch (member.kind) {
case 179 /* TypeQuery */:
case 191 /* TypeOperator */:
case 188 /* InferType */:
return factory.createParenthesizedType(member);
}
return parenthesizeMemberOfElementType(member);
}
function parenthesizeConstituentTypesOfUnionOrIntersectionType(members) {
return factory.createNodeArray(ts.sameMap(members, parenthesizeMemberOfElementType));
}
function parenthesizeOrdinalTypeArgument(node, i) {
return i === 0 && ts.isFunctionOrConstructorTypeNode(node) && node.typeParameters ? factory.createParenthesizedType(node) : node;
}
function parenthesizeTypeArguments(typeArguments) {
if (ts.some(typeArguments)) {
return factory.createNodeArray(ts.sameMap(typeArguments, parenthesizeOrdinalTypeArgument));
}
}
}
ts.createParenthesizerRules = createParenthesizerRules;
ts.nullParenthesizerRules = {
getParenthesizeLeftSideOfBinaryForOperator: function (_) { return ts.identity; },
getParenthesizeRightSideOfBinaryForOperator: function (_) { return ts.identity; },
parenthesizeLeftSideOfBinary: function (_binaryOperator, leftSide) { return leftSide; },
parenthesizeRightSideOfBinary: function (_binaryOperator, _leftSide, rightSide) { return rightSide; },
parenthesizeExpressionOfComputedPropertyName: ts.identity,
parenthesizeConditionOfConditionalExpression: ts.identity,
parenthesizeBranchOfConditionalExpression: ts.identity,
parenthesizeExpressionOfExportDefault: ts.identity,
parenthesizeExpressionOfNew: function (expression) { return ts.cast(expression, ts.isLeftHandSideExpression); },
parenthesizeLeftSideOfAccess: function (expression) { return ts.cast(expression, ts.isLeftHandSideExpression); },
parenthesizeOperandOfPostfixUnary: function (operand) { return ts.cast(operand, ts.isLeftHandSideExpression); },
parenthesizeOperandOfPrefixUnary: function (operand) { return ts.cast(operand, ts.isUnaryExpression); },
parenthesizeExpressionsOfCommaDelimitedList: function (nodes) { return ts.cast(nodes, ts.isNodeArray); },
parenthesizeExpressionForDisallowedComma: ts.identity,
parenthesizeExpressionOfExpressionStatement: ts.identity,
parenthesizeConciseBodyOfArrowFunction: ts.identity,
parenthesizeMemberOfConditionalType: ts.identity,
parenthesizeMemberOfElementType: ts.identity,
parenthesizeElementTypeOfArrayType: ts.identity,
parenthesizeConstituentTypesOfUnionOrIntersectionType: function (nodes) { return ts.cast(nodes, ts.isNodeArray); },
parenthesizeTypeArguments: function (nodes) { return nodes && ts.cast(nodes, ts.isNodeArray); },
};
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
function createNodeConverters(factory) {
return {
convertToFunctionBlock: convertToFunctionBlock,
convertToFunctionExpression: convertToFunctionExpression,
convertToArrayAssignmentElement: convertToArrayAssignmentElement,
convertToObjectAssignmentElement: convertToObjectAssignmentElement,
convertToAssignmentPattern: convertToAssignmentPattern,
convertToObjectAssignmentPattern: convertToObjectAssignmentPattern,
convertToArrayAssignmentPattern: convertToArrayAssignmentPattern,
convertToAssignmentElementTarget: convertToAssignmentElementTarget,
};
function convertToFunctionBlock(node, multiLine) {
if (ts.isBlock(node))
return node;
var returnStatement = factory.createReturnStatement(node);
ts.setTextRange(returnStatement, node);
var body = factory.createBlock([returnStatement], multiLine);
ts.setTextRange(body, node);
return body;
}
function convertToFunctionExpression(node) {
if (!node.body)
return ts.Debug.fail("Cannot convert a FunctionDeclaration without a body");
var updated = factory.createFunctionExpression(node.modifiers, node.asteriskToken, node.name, node.typeParameters, node.parameters, node.type, node.body);
ts.setOriginalNode(updated, node);
ts.setTextRange(updated, node);
if (ts.getStartsOnNewLine(node)) {
ts.setStartsOnNewLine(updated, /*newLine*/ true);
}
return updated;
}
function convertToArrayAssignmentElement(element) {
if (ts.isBindingElement(element)) {
if (element.dotDotDotToken) {
ts.Debug.assertNode(element.name, ts.isIdentifier);
return ts.setOriginalNode(ts.setTextRange(factory.createSpreadElement(element.name), element), element);
}
var expression = convertToAssignmentElementTarget(element.name);
return element.initializer
? ts.setOriginalNode(ts.setTextRange(factory.createAssignment(expression, element.initializer), element), element)
: expression;
}
return ts.cast(element, ts.isExpression);
}
function convertToObjectAssignmentElement(element) {
if (ts.isBindingElement(element)) {
if (element.dotDotDotToken) {
ts.Debug.assertNode(element.name, ts.isIdentifier);
return ts.setOriginalNode(ts.setTextRange(factory.createSpreadAssignment(element.name), element), element);
}
if (element.propertyName) {
var expression = convertToAssignmentElementTarget(element.name);
return ts.setOriginalNode(ts.setTextRange(factory.createPropertyAssignment(element.propertyName, element.initializer ? factory.createAssignment(expression, element.initializer) : expression), element), element);
}
ts.Debug.assertNode(element.name, ts.isIdentifier);
return ts.setOriginalNode(ts.setTextRange(factory.createShorthandPropertyAssignment(element.name, element.initializer), element), element);
}
return ts.cast(element, ts.isObjectLiteralElementLike);
}
function convertToAssignmentPattern(node) {
switch (node.kind) {
case 200 /* ArrayBindingPattern */:
case 202 /* ArrayLiteralExpression */:
return convertToArrayAssignmentPattern(node);
case 199 /* ObjectBindingPattern */:
case 203 /* ObjectLiteralExpression */:
return convertToObjectAssignmentPattern(node);
}
}
function convertToObjectAssignmentPattern(node) {
if (ts.isObjectBindingPattern(node)) {
return ts.setOriginalNode(ts.setTextRange(factory.createObjectLiteralExpression(ts.map(node.elements, convertToObjectAssignmentElement)), node), node);
}
return ts.cast(node, ts.isObjectLiteralExpression);
}
function convertToArrayAssignmentPattern(node) {
if (ts.isArrayBindingPattern(node)) {
return ts.setOriginalNode(ts.setTextRange(factory.createArrayLiteralExpression(ts.map(node.elements, convertToArrayAssignmentElement)), node), node);
}
return ts.cast(node, ts.isArrayLiteralExpression);
}
function convertToAssignmentElementTarget(node) {
if (ts.isBindingPattern(node)) {
return convertToAssignmentPattern(node);
}
return ts.cast(node, ts.isExpression);
}
}
ts.createNodeConverters = createNodeConverters;
ts.nullNodeConverters = {
convertToFunctionBlock: ts.notImplemented,
convertToFunctionExpression: ts.notImplemented,
convertToArrayAssignmentElement: ts.notImplemented,
convertToObjectAssignmentElement: ts.notImplemented,
convertToAssignmentPattern: ts.notImplemented,
convertToObjectAssignmentPattern: ts.notImplemented,
convertToArrayAssignmentPattern: ts.notImplemented,
convertToAssignmentElementTarget: ts.notImplemented,
};
})(ts || (ts = {}));
var ts;
(function (ts) {
var nextAutoGenerateId = 0;
/* @internal */
var NodeFactoryFlags;
(function (NodeFactoryFlags) {
NodeFactoryFlags[NodeFactoryFlags["None"] = 0] = "None";
// Disables the parenthesizer rules for the factory.
NodeFactoryFlags[NodeFactoryFlags["NoParenthesizerRules"] = 1] = "NoParenthesizerRules";
// Disables the node converters for the factory.
NodeFactoryFlags[NodeFactoryFlags["NoNodeConverters"] = 2] = "NoNodeConverters";
// Ensures new `PropertyAccessExpression` nodes are created with the `NoIndentation` emit flag set.
NodeFactoryFlags[NodeFactoryFlags["NoIndentationOnFreshPropertyAccess"] = 4] = "NoIndentationOnFreshPropertyAccess";
// Do not set an `original` pointer when updating a node.
NodeFactoryFlags[NodeFactoryFlags["NoOriginalNode"] = 8] = "NoOriginalNode";
})(NodeFactoryFlags = ts.NodeFactoryFlags || (ts.NodeFactoryFlags = {}));
/**
* Creates a `NodeFactory` that can be used to create and update a syntax tree.
* @param flags Flags that control factory behavior.
* @param baseFactory A `BaseNodeFactory` used to create the base `Node` objects.
*/
/* @internal */
function createNodeFactory(flags, baseFactory) {
var update = flags & 8 /* NoOriginalNode */ ? updateWithoutOriginal : updateWithOriginal;
// Lazily load the parenthesizer, node converters, and some factory methods until they are used.
var parenthesizerRules = ts.memoize(function () { return flags & 1 /* NoParenthesizerRules */ ? ts.nullParenthesizerRules : ts.createParenthesizerRules(factory); });
var converters = ts.memoize(function () { return flags & 2 /* NoNodeConverters */ ? ts.nullNodeConverters : ts.createNodeConverters(factory); });
// lazy initializaton of common operator factories
var getBinaryCreateFunction = ts.memoizeOne(function (operator) { return function (left, right) { return createBinaryExpression(left, operator, right); }; });
var getPrefixUnaryCreateFunction = ts.memoizeOne(function (operator) { return function (operand) { return createPrefixUnaryExpression(operator, operand); }; });
var getPostfixUnaryCreateFunction = ts.memoizeOne(function (operator) { return function (operand) { return createPostfixUnaryExpression(operand, operator); }; });
var getJSDocPrimaryTypeCreateFunction = ts.memoizeOne(function (kind) { return function () { return createJSDocPrimaryTypeWorker(kind); }; });
var getJSDocUnaryTypeCreateFunction = ts.memoizeOne(function (kind) { return function (type) { return createJSDocUnaryTypeWorker(kind, type); }; });
var getJSDocUnaryTypeUpdateFunction = ts.memoizeOne(function (kind) { return function (node, type) { return updateJSDocUnaryTypeWorker(kind, node, type); }; });
var getJSDocSimpleTagCreateFunction = ts.memoizeOne(function (kind) { return function (tagName, comment) { return createJSDocSimpleTagWorker(kind, tagName, comment); }; });
var getJSDocSimpleTagUpdateFunction = ts.memoizeOne(function (kind) { return function (node, tagName, comment) { return updateJSDocSimpleTagWorker(kind, node, tagName, comment); }; });
var getJSDocTypeLikeTagCreateFunction = ts.memoizeOne(function (kind) { return function (tagName, typeExpression, comment) { return createJSDocTypeLikeTagWorker(kind, tagName, typeExpression, comment); }; });
var getJSDocTypeLikeTagUpdateFunction = ts.memoizeOne(function (kind) { return function (node, tagName, typeExpression, comment) { return updateJSDocTypeLikeTagWorker(kind, node, tagName, typeExpression, comment); }; });
var factory = {
get parenthesizer() { return parenthesizerRules(); },
get converters() { return converters(); },
createNodeArray: createNodeArray,
createNumericLiteral: createNumericLiteral,
createBigIntLiteral: createBigIntLiteral,
createStringLiteral: createStringLiteral,
createStringLiteralFromNode: createStringLiteralFromNode,
createRegularExpressionLiteral: createRegularExpressionLiteral,
createLiteralLikeNode: createLiteralLikeNode,
createIdentifier: createIdentifier,
updateIdentifier: updateIdentifier,
createTempVariable: createTempVariable,
createLoopVariable: createLoopVariable,
createUniqueName: createUniqueName,
getGeneratedNameForNode: getGeneratedNameForNode,
createPrivateIdentifier: createPrivateIdentifier,
createToken: createToken,
createSuper: createSuper,
createThis: createThis,
createNull: createNull,
createTrue: createTrue,
createFalse: createFalse,
createModifier: createModifier,
createModifiersFromModifierFlags: createModifiersFromModifierFlags,
createQualifiedName: createQualifiedName,
updateQualifiedName: updateQualifiedName,
createComputedPropertyName: createComputedPropertyName,
updateComputedPropertyName: updateComputedPropertyName,
createTypeParameterDeclaration: createTypeParameterDeclaration,
updateTypeParameterDeclaration: updateTypeParameterDeclaration,
createParameterDeclaration: createParameterDeclaration,
updateParameterDeclaration: updateParameterDeclaration,
createDecorator: createDecorator,
updateDecorator: updateDecorator,
createPropertySignature: createPropertySignature,
updatePropertySignature: updatePropertySignature,
createPropertyDeclaration: createPropertyDeclaration,
updatePropertyDeclaration: updatePropertyDeclaration,
createMethodSignature: createMethodSignature,
updateMethodSignature: updateMethodSignature,
createMethodDeclaration: createMethodDeclaration,
updateMethodDeclaration: updateMethodDeclaration,
createConstructorDeclaration: createConstructorDeclaration,
updateConstructorDeclaration: updateConstructorDeclaration,
createGetAccessorDeclaration: createGetAccessorDeclaration,
updateGetAccessorDeclaration: updateGetAccessorDeclaration,
createSetAccessorDeclaration: createSetAccessorDeclaration,
updateSetAccessorDeclaration: updateSetAccessorDeclaration,
createCallSignature: createCallSignature,
updateCallSignature: updateCallSignature,
createConstructSignature: createConstructSignature,
updateConstructSignature: updateConstructSignature,
createIndexSignature: createIndexSignature,
updateIndexSignature: updateIndexSignature,
createClassStaticBlockDeclaration: createClassStaticBlockDeclaration,
updateClassStaticBlockDeclaration: updateClassStaticBlockDeclaration,
createTemplateLiteralTypeSpan: createTemplateLiteralTypeSpan,
updateTemplateLiteralTypeSpan: updateTemplateLiteralTypeSpan,
createKeywordTypeNode: createKeywordTypeNode,
createTypePredicateNode: createTypePredicateNode,
updateTypePredicateNode: updateTypePredicateNode,
createTypeReferenceNode: createTypeReferenceNode,
updateTypeReferenceNode: updateTypeReferenceNode,
createFunctionTypeNode: createFunctionTypeNode,
updateFunctionTypeNode: updateFunctionTypeNode,
createConstructorTypeNode: createConstructorTypeNode,
updateConstructorTypeNode: updateConstructorTypeNode,
createTypeQueryNode: createTypeQueryNode,
updateTypeQueryNode: updateTypeQueryNode,
createTypeLiteralNode: createTypeLiteralNode,
updateTypeLiteralNode: updateTypeLiteralNode,
createArrayTypeNode: createArrayTypeNode,
updateArrayTypeNode: updateArrayTypeNode,
createTupleTypeNode: createTupleTypeNode,
updateTupleTypeNode: updateTupleTypeNode,
createNamedTupleMember: createNamedTupleMember,
updateNamedTupleMember: updateNamedTupleMember,
createOptionalTypeNode: createOptionalTypeNode,
updateOptionalTypeNode: updateOptionalTypeNode,
createRestTypeNode: createRestTypeNode,
updateRestTypeNode: updateRestTypeNode,
createUnionTypeNode: createUnionTypeNode,
updateUnionTypeNode: updateUnionTypeNode,
createIntersectionTypeNode: createIntersectionTypeNode,
updateIntersectionTypeNode: updateIntersectionTypeNode,
createConditionalTypeNode: createConditionalTypeNode,
updateConditionalTypeNode: updateConditionalTypeNode,
createInferTypeNode: createInferTypeNode,
updateInferTypeNode: updateInferTypeNode,
createImportTypeNode: createImportTypeNode,
updateImportTypeNode: updateImportTypeNode,
createParenthesizedType: createParenthesizedType,
updateParenthesizedType: updateParenthesizedType,
createThisTypeNode: createThisTypeNode,
createTypeOperatorNode: createTypeOperatorNode,
updateTypeOperatorNode: updateTypeOperatorNode,
createIndexedAccessTypeNode: createIndexedAccessTypeNode,
updateIndexedAccessTypeNode: updateIndexedAccessTypeNode,
createMappedTypeNode: createMappedTypeNode,
updateMappedTypeNode: updateMappedTypeNode,
createLiteralTypeNode: createLiteralTypeNode,
updateLiteralTypeNode: updateLiteralTypeNode,
createTemplateLiteralType: createTemplateLiteralType,
updateTemplateLiteralType: updateTemplateLiteralType,
createObjectBindingPattern: createObjectBindingPattern,
updateObjectBindingPattern: updateObjectBindingPattern,
createArrayBindingPattern: createArrayBindingPattern,
updateArrayBindingPattern: updateArrayBindingPattern,
createBindingElement: createBindingElement,
updateBindingElement: updateBindingElement,
createArrayLiteralExpression: createArrayLiteralExpression,
updateArrayLiteralExpression: updateArrayLiteralExpression,
createObjectLiteralExpression: createObjectLiteralExpression,
updateObjectLiteralExpression: updateObjectLiteralExpression,
createPropertyAccessExpression: flags & 4 /* NoIndentationOnFreshPropertyAccess */ ?
function (expression, name) { return ts.setEmitFlags(createPropertyAccessExpression(expression, name), 131072 /* NoIndentation */); } :
createPropertyAccessExpression,
updatePropertyAccessExpression: updatePropertyAccessExpression,
createPropertyAccessChain: flags & 4 /* NoIndentationOnFreshPropertyAccess */ ?
function (expression, questionDotToken, name) { return ts.setEmitFlags(createPropertyAccessChain(expression, questionDotToken, name), 131072 /* NoIndentation */); } :
createPropertyAccessChain,
updatePropertyAccessChain: updatePropertyAccessChain,
createElementAccessExpression: createElementAccessExpression,
updateElementAccessExpression: updateElementAccessExpression,
createElementAccessChain: createElementAccessChain,
updateElementAccessChain: updateElementAccessChain,
createCallExpression: createCallExpression,
updateCallExpression: updateCallExpression,
createCallChain: createCallChain,
updateCallChain: updateCallChain,
createNewExpression: createNewExpression,
updateNewExpression: updateNewExpression,
createTaggedTemplateExpression: createTaggedTemplateExpression,
updateTaggedTemplateExpression: updateTaggedTemplateExpression,
createTypeAssertion: createTypeAssertion,
updateTypeAssertion: updateTypeAssertion,
createParenthesizedExpression: createParenthesizedExpression,
updateParenthesizedExpression: updateParenthesizedExpression,
createFunctionExpression: createFunctionExpression,
updateFunctionExpression: updateFunctionExpression,
createArrowFunction: createArrowFunction,
updateArrowFunction: updateArrowFunction,
createDeleteExpression: createDeleteExpression,
updateDeleteExpression: updateDeleteExpression,
createTypeOfExpression: createTypeOfExpression,
updateTypeOfExpression: updateTypeOfExpression,
createVoidExpression: createVoidExpression,
updateVoidExpression: updateVoidExpression,
createAwaitExpression: createAwaitExpression,
updateAwaitExpression: updateAwaitExpression,
createPrefixUnaryExpression: createPrefixUnaryExpression,
updatePrefixUnaryExpression: updatePrefixUnaryExpression,
createPostfixUnaryExpression: createPostfixUnaryExpression,
updatePostfixUnaryExpression: updatePostfixUnaryExpression,
createBinaryExpression: createBinaryExpression,
updateBinaryExpression: updateBinaryExpression,
createConditionalExpression: createConditionalExpression,
updateConditionalExpression: updateConditionalExpression,
createTemplateExpression: createTemplateExpression,
updateTemplateExpression: updateTemplateExpression,
createTemplateHead: createTemplateHead,
createTemplateMiddle: createTemplateMiddle,
createTemplateTail: createTemplateTail,
createNoSubstitutionTemplateLiteral: createNoSubstitutionTemplateLiteral,
createTemplateLiteralLikeNode: createTemplateLiteralLikeNode,
createYieldExpression: createYieldExpression,
updateYieldExpression: updateYieldExpression,
createSpreadElement: createSpreadElement,
updateSpreadElement: updateSpreadElement,
createClassExpression: createClassExpression,
updateClassExpression: updateClassExpression,
createOmittedExpression: createOmittedExpression,
createExpressionWithTypeArguments: createExpressionWithTypeArguments,
updateExpressionWithTypeArguments: updateExpressionWithTypeArguments,
createAsExpression: createAsExpression,
updateAsExpression: updateAsExpression,
createNonNullExpression: createNonNullExpression,
updateNonNullExpression: updateNonNullExpression,
createNonNullChain: createNonNullChain,
updateNonNullChain: updateNonNullChain,
createMetaProperty: createMetaProperty,
updateMetaProperty: updateMetaProperty,
createTemplateSpan: createTemplateSpan,
updateTemplateSpan: updateTemplateSpan,
createSemicolonClassElement: createSemicolonClassElement,
createBlock: createBlock,
updateBlock: updateBlock,
createVariableStatement: createVariableStatement,
updateVariableStatement: updateVariableStatement,
createEmptyStatement: createEmptyStatement,
createExpressionStatement: createExpressionStatement,
updateExpressionStatement: updateExpressionStatement,
createIfStatement: createIfStatement,
updateIfStatement: updateIfStatement,
createDoStatement: createDoStatement,
updateDoStatement: updateDoStatement,
createWhileStatement: createWhileStatement,
updateWhileStatement: updateWhileStatement,
createForStatement: createForStatement,
updateForStatement: updateForStatement,
createForInStatement: createForInStatement,
updateForInStatement: updateForInStatement,
createForOfStatement: createForOfStatement,
updateForOfStatement: updateForOfStatement,
createContinueStatement: createContinueStatement,
updateContinueStatement: updateContinueStatement,
createBreakStatement: createBreakStatement,
updateBreakStatement: updateBreakStatement,
createReturnStatement: createReturnStatement,
updateReturnStatement: updateReturnStatement,
createWithStatement: createWithStatement,
updateWithStatement: updateWithStatement,
createSwitchStatement: createSwitchStatement,
updateSwitchStatement: updateSwitchStatement,
createLabeledStatement: createLabeledStatement,
updateLabeledStatement: updateLabeledStatement,
createThrowStatement: createThrowStatement,
updateThrowStatement: updateThrowStatement,
createTryStatement: createTryStatement,
updateTryStatement: updateTryStatement,
createDebuggerStatement: createDebuggerStatement,
createVariableDeclaration: createVariableDeclaration,
updateVariableDeclaration: updateVariableDeclaration,
createVariableDeclarationList: createVariableDeclarationList,
updateVariableDeclarationList: updateVariableDeclarationList,
createFunctionDeclaration: createFunctionDeclaration,
updateFunctionDeclaration: updateFunctionDeclaration,
createClassDeclaration: createClassDeclaration,
updateClassDeclaration: updateClassDeclaration,
createInterfaceDeclaration: createInterfaceDeclaration,
updateInterfaceDeclaration: updateInterfaceDeclaration,
createTypeAliasDeclaration: createTypeAliasDeclaration,
updateTypeAliasDeclaration: updateTypeAliasDeclaration,
createEnumDeclaration: createEnumDeclaration,
updateEnumDeclaration: updateEnumDeclaration,
createModuleDeclaration: createModuleDeclaration,
updateModuleDeclaration: updateModuleDeclaration,
createModuleBlock: createModuleBlock,
updateModuleBlock: updateModuleBlock,
createCaseBlock: createCaseBlock,
updateCaseBlock: updateCaseBlock,
createNamespaceExportDeclaration: createNamespaceExportDeclaration,
updateNamespaceExportDeclaration: updateNamespaceExportDeclaration,
createImportEqualsDeclaration: createImportEqualsDeclaration,
updateImportEqualsDeclaration: updateImportEqualsDeclaration,
createImportDeclaration: createImportDeclaration,
updateImportDeclaration: updateImportDeclaration,
createImportClause: createImportClause,
updateImportClause: updateImportClause,
createNamespaceImport: createNamespaceImport,
updateNamespaceImport: updateNamespaceImport,
createNamespaceExport: createNamespaceExport,
updateNamespaceExport: updateNamespaceExport,
createNamedImports: createNamedImports,
updateNamedImports: updateNamedImports,
createImportSpecifier: createImportSpecifier,
updateImportSpecifier: updateImportSpecifier,
createExportAssignment: createExportAssignment,
updateExportAssignment: updateExportAssignment,
createExportDeclaration: createExportDeclaration,
updateExportDeclaration: updateExportDeclaration,
createNamedExports: createNamedExports,
updateNamedExports: updateNamedExports,
createExportSpecifier: createExportSpecifier,
updateExportSpecifier: updateExportSpecifier,
createMissingDeclaration: createMissingDeclaration,
createExternalModuleReference: createExternalModuleReference,
updateExternalModuleReference: updateExternalModuleReference,
// lazily load factory members for JSDoc types with similar structure
get createJSDocAllType() { return getJSDocPrimaryTypeCreateFunction(307 /* JSDocAllType */); },
get createJSDocUnknownType() { return getJSDocPrimaryTypeCreateFunction(308 /* JSDocUnknownType */); },
get createJSDocNonNullableType() { return getJSDocUnaryTypeCreateFunction(310 /* JSDocNonNullableType */); },
get updateJSDocNonNullableType() { return getJSDocUnaryTypeUpdateFunction(310 /* JSDocNonNullableType */); },
get createJSDocNullableType() { return getJSDocUnaryTypeCreateFunction(309 /* JSDocNullableType */); },
get updateJSDocNullableType() { return getJSDocUnaryTypeUpdateFunction(309 /* JSDocNullableType */); },
get createJSDocOptionalType() { return getJSDocUnaryTypeCreateFunction(311 /* JSDocOptionalType */); },
get updateJSDocOptionalType() { return getJSDocUnaryTypeUpdateFunction(311 /* JSDocOptionalType */); },
get createJSDocVariadicType() { return getJSDocUnaryTypeCreateFunction(313 /* JSDocVariadicType */); },
get updateJSDocVariadicType() { return getJSDocUnaryTypeUpdateFunction(313 /* JSDocVariadicType */); },
get createJSDocNamepathType() { return getJSDocUnaryTypeCreateFunction(314 /* JSDocNamepathType */); },
get updateJSDocNamepathType() { return getJSDocUnaryTypeUpdateFunction(314 /* JSDocNamepathType */); },
createJSDocFunctionType: createJSDocFunctionType,
updateJSDocFunctionType: updateJSDocFunctionType,
createJSDocTypeLiteral: createJSDocTypeLiteral,
updateJSDocTypeLiteral: updateJSDocTypeLiteral,
createJSDocTypeExpression: createJSDocTypeExpression,
updateJSDocTypeExpression: updateJSDocTypeExpression,
createJSDocSignature: createJSDocSignature,
updateJSDocSignature: updateJSDocSignature,
createJSDocTemplateTag: createJSDocTemplateTag,
updateJSDocTemplateTag: updateJSDocTemplateTag,
createJSDocTypedefTag: createJSDocTypedefTag,
updateJSDocTypedefTag: updateJSDocTypedefTag,
createJSDocParameterTag: createJSDocParameterTag,
updateJSDocParameterTag: updateJSDocParameterTag,
createJSDocPropertyTag: createJSDocPropertyTag,
updateJSDocPropertyTag: updateJSDocPropertyTag,
createJSDocCallbackTag: createJSDocCallbackTag,
updateJSDocCallbackTag: updateJSDocCallbackTag,
createJSDocAugmentsTag: createJSDocAugmentsTag,
updateJSDocAugmentsTag: updateJSDocAugmentsTag,
createJSDocImplementsTag: createJSDocImplementsTag,
updateJSDocImplementsTag: updateJSDocImplementsTag,
createJSDocSeeTag: createJSDocSeeTag,
updateJSDocSeeTag: updateJSDocSeeTag,
createJSDocNameReference: createJSDocNameReference,
updateJSDocNameReference: updateJSDocNameReference,
createJSDocMemberName: createJSDocMemberName,
updateJSDocMemberName: updateJSDocMemberName,
createJSDocLink: createJSDocLink,
updateJSDocLink: updateJSDocLink,
createJSDocLinkCode: createJSDocLinkCode,
updateJSDocLinkCode: updateJSDocLinkCode,
createJSDocLinkPlain: createJSDocLinkPlain,
updateJSDocLinkPlain: updateJSDocLinkPlain,
// lazily load factory members for JSDoc tags with similar structure
get createJSDocTypeTag() { return getJSDocTypeLikeTagCreateFunction(338 /* JSDocTypeTag */); },
get updateJSDocTypeTag() { return getJSDocTypeLikeTagUpdateFunction(338 /* JSDocTypeTag */); },
get createJSDocReturnTag() { return getJSDocTypeLikeTagCreateFunction(336 /* JSDocReturnTag */); },
get updateJSDocReturnTag() { return getJSDocTypeLikeTagUpdateFunction(336 /* JSDocReturnTag */); },
get createJSDocThisTag() { return getJSDocTypeLikeTagCreateFunction(337 /* JSDocThisTag */); },
get updateJSDocThisTag() { return getJSDocTypeLikeTagUpdateFunction(337 /* JSDocThisTag */); },
get createJSDocEnumTag() { return getJSDocTypeLikeTagCreateFunction(334 /* JSDocEnumTag */); },
get updateJSDocEnumTag() { return getJSDocTypeLikeTagUpdateFunction(334 /* JSDocEnumTag */); },
get createJSDocAuthorTag() { return getJSDocSimpleTagCreateFunction(325 /* JSDocAuthorTag */); },
get updateJSDocAuthorTag() { return getJSDocSimpleTagUpdateFunction(325 /* JSDocAuthorTag */); },
get createJSDocClassTag() { return getJSDocSimpleTagCreateFunction(327 /* JSDocClassTag */); },
get updateJSDocClassTag() { return getJSDocSimpleTagUpdateFunction(327 /* JSDocClassTag */); },
get createJSDocPublicTag() { return getJSDocSimpleTagCreateFunction(328 /* JSDocPublicTag */); },
get updateJSDocPublicTag() { return getJSDocSimpleTagUpdateFunction(328 /* JSDocPublicTag */); },
get createJSDocPrivateTag() { return getJSDocSimpleTagCreateFunction(329 /* JSDocPrivateTag */); },
get updateJSDocPrivateTag() { return getJSDocSimpleTagUpdateFunction(329 /* JSDocPrivateTag */); },
get createJSDocProtectedTag() { return getJSDocSimpleTagCreateFunction(330 /* JSDocProtectedTag */); },
get updateJSDocProtectedTag() { return getJSDocSimpleTagUpdateFunction(330 /* JSDocProtectedTag */); },
get createJSDocReadonlyTag() { return getJSDocSimpleTagCreateFunction(331 /* JSDocReadonlyTag */); },
get updateJSDocReadonlyTag() { return getJSDocSimpleTagUpdateFunction(331 /* JSDocReadonlyTag */); },
get createJSDocOverrideTag() { return getJSDocSimpleTagCreateFunction(332 /* JSDocOverrideTag */); },
get updateJSDocOverrideTag() { return getJSDocSimpleTagUpdateFunction(332 /* JSDocOverrideTag */); },
get createJSDocDeprecatedTag() { return getJSDocSimpleTagCreateFunction(326 /* JSDocDeprecatedTag */); },
get updateJSDocDeprecatedTag() { return getJSDocSimpleTagUpdateFunction(326 /* JSDocDeprecatedTag */); },
createJSDocUnknownTag: createJSDocUnknownTag,
updateJSDocUnknownTag: updateJSDocUnknownTag,
createJSDocText: createJSDocText,
updateJSDocText: updateJSDocText,
createJSDocComment: createJSDocComment,
updateJSDocComment: updateJSDocComment,
createJsxElement: createJsxElement,
updateJsxElement: updateJsxElement,
createJsxSelfClosingElement: createJsxSelfClosingElement,
updateJsxSelfClosingElement: updateJsxSelfClosingElement,
createJsxOpeningElement: createJsxOpeningElement,
updateJsxOpeningElement: updateJsxOpeningElement,
createJsxClosingElement: createJsxClosingElement,
updateJsxClosingElement: updateJsxClosingElement,
createJsxFragment: createJsxFragment,
createJsxText: createJsxText,
updateJsxText: updateJsxText,
createJsxOpeningFragment: createJsxOpeningFragment,
createJsxJsxClosingFragment: createJsxJsxClosingFragment,
updateJsxFragment: updateJsxFragment,
createJsxAttribute: createJsxAttribute,
updateJsxAttribute: updateJsxAttribute,
createJsxAttributes: createJsxAttributes,
updateJsxAttributes: updateJsxAttributes,
createJsxSpreadAttribute: createJsxSpreadAttribute,
updateJsxSpreadAttribute: updateJsxSpreadAttribute,
createJsxExpression: createJsxExpression,
updateJsxExpression: updateJsxExpression,
createCaseClause: createCaseClause,
updateCaseClause: updateCaseClause,
createDefaultClause: createDefaultClause,
updateDefaultClause: updateDefaultClause,
createHeritageClause: createHeritageClause,
updateHeritageClause: updateHeritageClause,
createCatchClause: createCatchClause,
updateCatchClause: updateCatchClause,
createPropertyAssignment: createPropertyAssignment,
updatePropertyAssignment: updatePropertyAssignment,
createShorthandPropertyAssignment: createShorthandPropertyAssignment,
updateShorthandPropertyAssignment: updateShorthandPropertyAssignment,
createSpreadAssignment: createSpreadAssignment,
updateSpreadAssignment: updateSpreadAssignment,
createEnumMember: createEnumMember,
updateEnumMember: updateEnumMember,
createSourceFile: createSourceFile,
updateSourceFile: updateSourceFile,
createBundle: createBundle,
updateBundle: updateBundle,
createUnparsedSource: createUnparsedSource,
createUnparsedPrologue: createUnparsedPrologue,
createUnparsedPrepend: createUnparsedPrepend,
createUnparsedTextLike: createUnparsedTextLike,
createUnparsedSyntheticReference: createUnparsedSyntheticReference,
createInputFiles: createInputFiles,
createSyntheticExpression: createSyntheticExpression,
createSyntaxList: createSyntaxList,
createNotEmittedStatement: createNotEmittedStatement,
createPartiallyEmittedExpression: createPartiallyEmittedExpression,
updatePartiallyEmittedExpression: updatePartiallyEmittedExpression,
createCommaListExpression: createCommaListExpression,
updateCommaListExpression: updateCommaListExpression,
createEndOfDeclarationMarker: createEndOfDeclarationMarker,
createMergeDeclarationMarker: createMergeDeclarationMarker,
createSyntheticReferenceExpression: createSyntheticReferenceExpression,
updateSyntheticReferenceExpression: updateSyntheticReferenceExpression,
cloneNode: cloneNode,
// Lazily load factory methods for common operator factories and utilities
get createComma() { return getBinaryCreateFunction(27 /* CommaToken */); },
get createAssignment() { return getBinaryCreateFunction(63 /* EqualsToken */); },
get createLogicalOr() { return getBinaryCreateFunction(56 /* BarBarToken */); },
get createLogicalAnd() { return getBinaryCreateFunction(55 /* AmpersandAmpersandToken */); },
get createBitwiseOr() { return getBinaryCreateFunction(51 /* BarToken */); },
get createBitwiseXor() { return getBinaryCreateFunction(52 /* CaretToken */); },
get createBitwiseAnd() { return getBinaryCreateFunction(50 /* AmpersandToken */); },
get createStrictEquality() { return getBinaryCreateFunction(36 /* EqualsEqualsEqualsToken */); },
get createStrictInequality() { return getBinaryCreateFunction(37 /* ExclamationEqualsEqualsToken */); },
get createEquality() { return getBinaryCreateFunction(34 /* EqualsEqualsToken */); },
get createInequality() { return getBinaryCreateFunction(35 /* ExclamationEqualsToken */); },
get createLessThan() { return getBinaryCreateFunction(29 /* LessThanToken */); },
get createLessThanEquals() { return getBinaryCreateFunction(32 /* LessThanEqualsToken */); },
get createGreaterThan() { return getBinaryCreateFunction(31 /* GreaterThanToken */); },
get createGreaterThanEquals() { return getBinaryCreateFunction(33 /* GreaterThanEqualsToken */); },
get createLeftShift() { return getBinaryCreateFunction(47 /* LessThanLessThanToken */); },
get createRightShift() { return getBinaryCreateFunction(48 /* GreaterThanGreaterThanToken */); },
get createUnsignedRightShift() { return getBinaryCreateFunction(49 /* GreaterThanGreaterThanGreaterThanToken */); },
get createAdd() { return getBinaryCreateFunction(39 /* PlusToken */); },
get createSubtract() { return getBinaryCreateFunction(40 /* MinusToken */); },
get createMultiply() { return getBinaryCreateFunction(41 /* AsteriskToken */); },
get createDivide() { return getBinaryCreateFunction(43 /* SlashToken */); },
get createModulo() { return getBinaryCreateFunction(44 /* PercentToken */); },
get createExponent() { return getBinaryCreateFunction(42 /* AsteriskAsteriskToken */); },
get createPrefixPlus() { return getPrefixUnaryCreateFunction(39 /* PlusToken */); },
get createPrefixMinus() { return getPrefixUnaryCreateFunction(40 /* MinusToken */); },
get createPrefixIncrement() { return getPrefixUnaryCreateFunction(45 /* PlusPlusToken */); },
get createPrefixDecrement() { return getPrefixUnaryCreateFunction(46 /* MinusMinusToken */); },
get createBitwiseNot() { return getPrefixUnaryCreateFunction(54 /* TildeToken */); },
get createLogicalNot() { return getPrefixUnaryCreateFunction(53 /* ExclamationToken */); },
get createPostfixIncrement() { return getPostfixUnaryCreateFunction(45 /* PlusPlusToken */); },
get createPostfixDecrement() { return getPostfixUnaryCreateFunction(46 /* MinusMinusToken */); },
// Compound nodes
createImmediatelyInvokedFunctionExpression: createImmediatelyInvokedFunctionExpression,
createImmediatelyInvokedArrowFunction: createImmediatelyInvokedArrowFunction,
createVoidZero: createVoidZero,
createExportDefault: createExportDefault,
createExternalModuleExport: createExternalModuleExport,
createTypeCheck: createTypeCheck,
createMethodCall: createMethodCall,
createGlobalMethodCall: createGlobalMethodCall,
createFunctionBindCall: createFunctionBindCall,
createFunctionCallCall: createFunctionCallCall,
createFunctionApplyCall: createFunctionApplyCall,
createArraySliceCall: createArraySliceCall,
createArrayConcatCall: createArrayConcatCall,
createObjectDefinePropertyCall: createObjectDefinePropertyCall,
createReflectGetCall: createReflectGetCall,
createReflectSetCall: createReflectSetCall,
createPropertyDescriptor: createPropertyDescriptor,
createCallBinding: createCallBinding,
createAssignmentTargetWrapper: createAssignmentTargetWrapper,
// Utilities
inlineExpressions: inlineExpressions,
getInternalName: getInternalName,
getLocalName: getLocalName,
getExportName: getExportName,
getDeclarationName: getDeclarationName,
getNamespaceMemberName: getNamespaceMemberName,
getExternalModuleOrNamespaceExportName: getExternalModuleOrNamespaceExportName,
restoreOuterExpressions: restoreOuterExpressions,
restoreEnclosingLabel: restoreEnclosingLabel,
createUseStrictPrologue: createUseStrictPrologue,
copyPrologue: copyPrologue,
copyStandardPrologue: copyStandardPrologue,
copyCustomPrologue: copyCustomPrologue,
ensureUseStrict: ensureUseStrict,
liftToBlock: liftToBlock,
mergeLexicalEnvironment: mergeLexicalEnvironment,
updateModifiers: updateModifiers,
};
return factory;
// @api
function createNodeArray(elements, hasTrailingComma) {
if (elements === undefined || elements === ts.emptyArray) {
elements = [];
}
else if (ts.isNodeArray(elements)) {
if (hasTrailingComma === undefined || elements.hasTrailingComma === hasTrailingComma) {
// Ensure the transform flags have been aggregated for this NodeArray
if (elements.transformFlags === undefined) {
aggregateChildrenFlags(elements);
}
ts.Debug.attachNodeArrayDebugInfo(elements);
return elements;
}
// This *was* a `NodeArray`, but the `hasTrailingComma` option differs. Recreate the
// array with the same elements, text range, and transform flags but with the updated
// value for `hasTrailingComma`
var array_8 = elements.slice();
array_8.pos = elements.pos;
array_8.end = elements.end;
array_8.hasTrailingComma = hasTrailingComma;
array_8.transformFlags = elements.transformFlags;
ts.Debug.attachNodeArrayDebugInfo(array_8);
return array_8;
}
// Since the element list of a node array is typically created by starting with an empty array and
// repeatedly calling push(), the list may not have the optimal memory layout. We invoke slice() for
// small arrays (1 to 4 elements) to give the VM a chance to allocate an optimal representation.
var length = elements.length;
var array = (length >= 1 && length <= 4 ? elements.slice() : elements);
ts.setTextRangePosEnd(array, -1, -1);
array.hasTrailingComma = !!hasTrailingComma;
aggregateChildrenFlags(array);
ts.Debug.attachNodeArrayDebugInfo(array);
return array;
}
function createBaseNode(kind) {
return baseFactory.createBaseNode(kind);
}
function createBaseDeclaration(kind, decorators, modifiers) {
var node = createBaseNode(kind);
node.decorators = asNodeArray(decorators);
node.modifiers = asNodeArray(modifiers);
node.transformFlags |=
propagateChildrenFlags(node.decorators) |
propagateChildrenFlags(node.modifiers);
// NOTE: The following properties are commonly set by the binder and are added here to
// ensure declarations have a stable shape.
node.symbol = undefined; // initialized by binder
node.localSymbol = undefined; // initialized by binder
node.locals = undefined; // initialized by binder
node.nextContainer = undefined; // initialized by binder
return node;
}
function createBaseNamedDeclaration(kind, decorators, modifiers, name) {
var node = createBaseDeclaration(kind, decorators, modifiers);
name = asName(name);
node.name = name;
// The PropertyName of a member is allowed to be `await`.
// We don't need to exclude `await` for type signatures since types
// don't propagate child flags.
if (name) {
switch (node.kind) {
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 165 /* PropertyDeclaration */:
case 291 /* PropertyAssignment */:
if (ts.isIdentifier(name)) {
node.transformFlags |= propagateIdentifierNameFlags(name);
break;
}
// fall through
default:
node.transformFlags |= propagateChildFlags(name);
break;
}
}
return node;
}
function createBaseGenericNamedDeclaration(kind, decorators, modifiers, name, typeParameters) {
var node = createBaseNamedDeclaration(kind, decorators, modifiers, name);
node.typeParameters = asNodeArray(typeParameters);
node.transformFlags |= propagateChildrenFlags(node.typeParameters);
if (typeParameters)
node.transformFlags |= 1 /* ContainsTypeScript */;
return node;
}
function createBaseSignatureDeclaration(kind, decorators, modifiers, name, typeParameters, parameters, type) {
var node = createBaseGenericNamedDeclaration(kind, decorators, modifiers, name, typeParameters);
node.parameters = createNodeArray(parameters);
node.type = type;
node.transformFlags |=
propagateChildrenFlags(node.parameters) |
propagateChildFlags(node.type);
if (type)
node.transformFlags |= 1 /* ContainsTypeScript */;
return node;
}
function updateBaseSignatureDeclaration(updated, original) {
// copy children used only for error reporting
if (original.typeArguments)
updated.typeArguments = original.typeArguments;
return update(updated, original);
}
function createBaseFunctionLikeDeclaration(kind, decorators, modifiers, name, typeParameters, parameters, type, body) {
var node = createBaseSignatureDeclaration(kind, decorators, modifiers, name, typeParameters, parameters, type);
node.body = body;
node.transformFlags |= propagateChildFlags(node.body) & ~16777216 /* ContainsPossibleTopLevelAwait */;
if (!body)
node.transformFlags |= 1 /* ContainsTypeScript */;
return node;
}
function updateBaseFunctionLikeDeclaration(updated, original) {
// copy children used only for error reporting
if (original.exclamationToken)
updated.exclamationToken = original.exclamationToken;
if (original.typeArguments)
updated.typeArguments = original.typeArguments;
return updateBaseSignatureDeclaration(updated, original);
}
function createBaseInterfaceOrClassLikeDeclaration(kind, decorators, modifiers, name, typeParameters, heritageClauses) {
var node = createBaseGenericNamedDeclaration(kind, decorators, modifiers, name, typeParameters);
node.heritageClauses = asNodeArray(heritageClauses);
node.transformFlags |= propagateChildrenFlags(node.heritageClauses);
return node;
}
function createBaseClassLikeDeclaration(kind, decorators, modifiers, name, typeParameters, heritageClauses, members) {
var node = createBaseInterfaceOrClassLikeDeclaration(kind, decorators, modifiers, name, typeParameters, heritageClauses);
node.members = createNodeArray(members);
node.transformFlags |= propagateChildrenFlags(node.members);
return node;
}
function createBaseBindingLikeDeclaration(kind, decorators, modifiers, name, initializer) {
var node = createBaseNamedDeclaration(kind, decorators, modifiers, name);
node.initializer = initializer;
node.transformFlags |= propagateChildFlags(node.initializer);
return node;
}
function createBaseVariableLikeDeclaration(kind, decorators, modifiers, name, type, initializer) {
var node = createBaseBindingLikeDeclaration(kind, decorators, modifiers, name, initializer);
node.type = type;
node.transformFlags |= propagateChildFlags(type);
if (type)
node.transformFlags |= 1 /* ContainsTypeScript */;
return node;
}
//
// Literals
//
function createBaseLiteral(kind, text) {
var node = createBaseToken(kind);
node.text = text;
return node;
}
// @api
function createNumericLiteral(value, numericLiteralFlags) {
if (numericLiteralFlags === void 0) { numericLiteralFlags = 0 /* None */; }
var node = createBaseLiteral(8 /* NumericLiteral */, typeof value === "number" ? value + "" : value);
node.numericLiteralFlags = numericLiteralFlags;
if (numericLiteralFlags & 384 /* BinaryOrOctalSpecifier */)
node.transformFlags |= 512 /* ContainsES2015 */;
return node;
}
// @api
function createBigIntLiteral(value) {
var node = createBaseLiteral(9 /* BigIntLiteral */, typeof value === "string" ? value : ts.pseudoBigIntToString(value) + "n");
node.transformFlags |= 4 /* ContainsESNext */;
return node;
}
function createBaseStringLiteral(text, isSingleQuote) {
var node = createBaseLiteral(10 /* StringLiteral */, text);
node.singleQuote = isSingleQuote;
return node;
}
// @api
function createStringLiteral(text, isSingleQuote, hasExtendedUnicodeEscape) {
var node = createBaseStringLiteral(text, isSingleQuote);
node.hasExtendedUnicodeEscape = hasExtendedUnicodeEscape;
if (hasExtendedUnicodeEscape)
node.transformFlags |= 512 /* ContainsES2015 */;
return node;
}
// @api
function createStringLiteralFromNode(sourceNode) {
var node = createBaseStringLiteral(ts.getTextOfIdentifierOrLiteral(sourceNode), /*isSingleQuote*/ undefined);
node.textSourceNode = sourceNode;
return node;
}
// @api
function createRegularExpressionLiteral(text) {
var node = createBaseLiteral(13 /* RegularExpressionLiteral */, text);
return node;
}
// @api
function createLiteralLikeNode(kind, text) {
switch (kind) {
case 8 /* NumericLiteral */: return createNumericLiteral(text, /*numericLiteralFlags*/ 0);
case 9 /* BigIntLiteral */: return createBigIntLiteral(text);
case 10 /* StringLiteral */: return createStringLiteral(text, /*isSingleQuote*/ undefined);
case 11 /* JsxText */: return createJsxText(text, /*containsOnlyTriviaWhiteSpaces*/ false);
case 12 /* JsxTextAllWhiteSpaces */: return createJsxText(text, /*containsOnlyTriviaWhiteSpaces*/ true);
case 13 /* RegularExpressionLiteral */: return createRegularExpressionLiteral(text);
case 14 /* NoSubstitutionTemplateLiteral */: return createTemplateLiteralLikeNode(kind, text, /*rawText*/ undefined, /*templateFlags*/ 0);
}
}
//
// Identifiers
//
function createBaseIdentifier(text, originalKeywordKind) {
if (originalKeywordKind === undefined && text) {
originalKeywordKind = ts.stringToToken(text);
}
if (originalKeywordKind === 79 /* Identifier */) {
originalKeywordKind = undefined;
}
var node = baseFactory.createBaseIdentifierNode(79 /* Identifier */);
node.originalKeywordKind = originalKeywordKind;
node.escapedText = ts.escapeLeadingUnderscores(text);
return node;
}
function createBaseGeneratedIdentifier(text, autoGenerateFlags) {
var node = createBaseIdentifier(text, /*originalKeywordKind*/ undefined);
node.autoGenerateFlags = autoGenerateFlags;
node.autoGenerateId = nextAutoGenerateId;
nextAutoGenerateId++;
return node;
}
// @api
function createIdentifier(text, typeArguments, originalKeywordKind) {
var node = createBaseIdentifier(text, originalKeywordKind);
if (typeArguments) {
// NOTE: we do not use `setChildren` here because typeArguments in an identifier do not contribute to transformations
node.typeArguments = createNodeArray(typeArguments);
}
if (node.originalKeywordKind === 131 /* AwaitKeyword */) {
node.transformFlags |= 16777216 /* ContainsPossibleTopLevelAwait */;
}
return node;
}
// @api
function updateIdentifier(node, typeArguments) {
return node.typeArguments !== typeArguments
? update(createIdentifier(ts.idText(node), typeArguments), node)
: node;
}
// @api
function createTempVariable(recordTempVariable, reservedInNestedScopes) {
var flags = 1 /* Auto */;
if (reservedInNestedScopes)
flags |= 8 /* ReservedInNestedScopes */;
var name = createBaseGeneratedIdentifier("", flags);
if (recordTempVariable) {
recordTempVariable(name);
}
return name;
}
/** Create a unique temporary variable for use in a loop. */
// @api
function createLoopVariable(reservedInNestedScopes) {
var flags = 2 /* Loop */;
if (reservedInNestedScopes)
flags |= 8 /* ReservedInNestedScopes */;
return createBaseGeneratedIdentifier("", flags);
}
/** Create a unique name based on the supplied text. */
// @api
function createUniqueName(text, flags) {
if (flags === void 0) { flags = 0 /* None */; }
ts.Debug.assert(!(flags & 7 /* KindMask */), "Argument out of range: flags");
ts.Debug.assert((flags & (16 /* Optimistic */ | 32 /* FileLevel */)) !== 32 /* FileLevel */, "GeneratedIdentifierFlags.FileLevel cannot be set without also setting GeneratedIdentifierFlags.Optimistic");
return createBaseGeneratedIdentifier(text, 3 /* Unique */ | flags);
}
/** Create a unique name generated for a node. */
// @api
function getGeneratedNameForNode(node, flags) {
if (flags === void 0) { flags = 0; }
ts.Debug.assert(!(flags & 7 /* KindMask */), "Argument out of range: flags");
var name = createBaseGeneratedIdentifier(node && ts.isIdentifier(node) ? ts.idText(node) : "", 4 /* Node */ | flags);
name.original = node;
return name;
}
// @api
function createPrivateIdentifier(text) {
if (!ts.startsWith(text, "#"))
ts.Debug.fail("First character of private identifier must be #: " + text);
var node = baseFactory.createBasePrivateIdentifierNode(80 /* PrivateIdentifier */);
node.escapedText = ts.escapeLeadingUnderscores(text);
node.transformFlags |= 8388608 /* ContainsClassFields */;
return node;
}
//
// Punctuation
//
function createBaseToken(kind) {
return baseFactory.createBaseTokenNode(kind);
}
function createToken(token) {
ts.Debug.assert(token >= 0 /* FirstToken */ && token <= 158 /* LastToken */, "Invalid token");
ts.Debug.assert(token <= 14 /* FirstTemplateToken */ || token >= 17 /* LastTemplateToken */, "Invalid token. Use 'createTemplateLiteralLikeNode' to create template literals.");
ts.Debug.assert(token <= 8 /* FirstLiteralToken */ || token >= 14 /* LastLiteralToken */, "Invalid token. Use 'createLiteralLikeNode' to create literals.");
ts.Debug.assert(token !== 79 /* Identifier */, "Invalid token. Use 'createIdentifier' to create identifiers");
var node = createBaseToken(token);
var transformFlags = 0 /* None */;
switch (token) {
case 130 /* AsyncKeyword */:
// 'async' modifier is ES2017 (async functions) or ES2018 (async generators)
transformFlags =
128 /* ContainsES2017 */ |
64 /* ContainsES2018 */;
break;
case 123 /* PublicKeyword */:
case 121 /* PrivateKeyword */:
case 122 /* ProtectedKeyword */:
case 143 /* ReadonlyKeyword */:
case 126 /* AbstractKeyword */:
case 134 /* DeclareKeyword */:
case 85 /* ConstKeyword */:
case 129 /* AnyKeyword */:
case 145 /* NumberKeyword */:
case 156 /* BigIntKeyword */:
case 142 /* NeverKeyword */:
case 146 /* ObjectKeyword */:
case 157 /* OverrideKeyword */:
case 148 /* StringKeyword */:
case 132 /* BooleanKeyword */:
case 149 /* SymbolKeyword */:
case 114 /* VoidKeyword */:
case 153 /* UnknownKeyword */:
case 151 /* UndefinedKeyword */: // `undefined` is an Identifier in the expression case.
transformFlags = 1 /* ContainsTypeScript */;
break;
case 106 /* SuperKeyword */:
transformFlags = 512 /* ContainsES2015 */ | 33554432 /* ContainsLexicalSuper */;
break;
case 124 /* StaticKeyword */:
transformFlags = 512 /* ContainsES2015 */;
break;
case 108 /* ThisKeyword */:
// 'this' indicates a lexical 'this'
transformFlags = 8192 /* ContainsLexicalThis */;
break;
}
if (transformFlags) {
node.transformFlags |= transformFlags;
}
return node;
}
//
// Reserved words
//
// @api
function createSuper() {
return createToken(106 /* SuperKeyword */);
}
// @api
function createThis() {
return createToken(108 /* ThisKeyword */);
}
// @api
function createNull() {
return createToken(104 /* NullKeyword */);
}
// @api
function createTrue() {
return createToken(110 /* TrueKeyword */);
}
// @api
function createFalse() {
return createToken(95 /* FalseKeyword */);
}
//
// Modifiers
//
// @api
function createModifier(kind) {
return createToken(kind);
}
// @api
function createModifiersFromModifierFlags(flags) {
var result = [];
if (flags & 1 /* Export */) {
result.push(createModifier(93 /* ExportKeyword */));
}
if (flags & 2 /* Ambient */) {
result.push(createModifier(134 /* DeclareKeyword */));
}
if (flags & 512 /* Default */) {
result.push(createModifier(88 /* DefaultKeyword */));
}
if (flags & 2048 /* Const */) {
result.push(createModifier(85 /* ConstKeyword */));
}
if (flags & 4 /* Public */) {
result.push(createModifier(123 /* PublicKeyword */));
}
if (flags & 8 /* Private */) {
result.push(createModifier(121 /* PrivateKeyword */));
}
if (flags & 16 /* Protected */) {
result.push(createModifier(122 /* ProtectedKeyword */));
}
if (flags & 128 /* Abstract */) {
result.push(createModifier(126 /* AbstractKeyword */));
}
if (flags & 32 /* Static */) {
result.push(createModifier(124 /* StaticKeyword */));
}
if (flags & 16384 /* Override */) {
result.push(createModifier(157 /* OverrideKeyword */));
}
if (flags & 64 /* Readonly */) {
result.push(createModifier(143 /* ReadonlyKeyword */));
}
if (flags & 256 /* Async */) {
result.push(createModifier(130 /* AsyncKeyword */));
}
return result;
}
//
// Names
//
// @api
function createQualifiedName(left, right) {
var node = createBaseNode(159 /* QualifiedName */);
node.left = left;
node.right = asName(right);
node.transformFlags |=
propagateChildFlags(node.left) |
propagateIdentifierNameFlags(node.right);
return node;
}
// @api
function updateQualifiedName(node, left, right) {
return node.left !== left
|| node.right !== right
? update(createQualifiedName(left, right), node)
: node;
}
// @api
function createComputedPropertyName(expression) {
var node = createBaseNode(160 /* ComputedPropertyName */);
node.expression = parenthesizerRules().parenthesizeExpressionOfComputedPropertyName(expression);
node.transformFlags |=
propagateChildFlags(node.expression) |
512 /* ContainsES2015 */ |
65536 /* ContainsComputedPropertyName */;
return node;
}
// @api
function updateComputedPropertyName(node, expression) {
return node.expression !== expression
? update(createComputedPropertyName(expression), node)
: node;
}
//
// Signature elements
//
// @api
function createTypeParameterDeclaration(name, constraint, defaultType) {
var node = createBaseNamedDeclaration(161 /* TypeParameter */,
/*decorators*/ undefined,
/*modifiers*/ undefined, name);
node.constraint = constraint;
node.default = defaultType;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateTypeParameterDeclaration(node, name, constraint, defaultType) {
return node.name !== name
|| node.constraint !== constraint
|| node.default !== defaultType
? update(createTypeParameterDeclaration(name, constraint, defaultType), node)
: node;
}
// @api
function createParameterDeclaration(decorators, modifiers, dotDotDotToken, name, questionToken, type, initializer) {
var node = createBaseVariableLikeDeclaration(162 /* Parameter */, decorators, modifiers, name, type, initializer && parenthesizerRules().parenthesizeExpressionForDisallowedComma(initializer));
node.dotDotDotToken = dotDotDotToken;
node.questionToken = questionToken;
if (ts.isThisIdentifier(node.name)) {
node.transformFlags = 1 /* ContainsTypeScript */;
}
else {
node.transformFlags |=
propagateChildFlags(node.dotDotDotToken) |
propagateChildFlags(node.questionToken);
if (questionToken)
node.transformFlags |= 1 /* ContainsTypeScript */;
if (ts.modifiersToFlags(node.modifiers) & 16476 /* ParameterPropertyModifier */)
node.transformFlags |= 4096 /* ContainsTypeScriptClassSyntax */;
if (initializer || dotDotDotToken)
node.transformFlags |= 512 /* ContainsES2015 */;
}
return node;
}
// @api
function updateParameterDeclaration(node, decorators, modifiers, dotDotDotToken, name, questionToken, type, initializer) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.dotDotDotToken !== dotDotDotToken
|| node.name !== name
|| node.questionToken !== questionToken
|| node.type !== type
|| node.initializer !== initializer
? update(createParameterDeclaration(decorators, modifiers, dotDotDotToken, name, questionToken, type, initializer), node)
: node;
}
// @api
function createDecorator(expression) {
var node = createBaseNode(163 /* Decorator */);
node.expression = parenthesizerRules().parenthesizeLeftSideOfAccess(expression);
node.transformFlags |=
propagateChildFlags(node.expression) |
1 /* ContainsTypeScript */ |
4096 /* ContainsTypeScriptClassSyntax */;
return node;
}
// @api
function updateDecorator(node, expression) {
return node.expression !== expression
? update(createDecorator(expression), node)
: node;
}
//
// Type Elements
//
// @api
function createPropertySignature(modifiers, name, questionToken, type) {
var node = createBaseNamedDeclaration(164 /* PropertySignature */,
/*decorators*/ undefined, modifiers, name);
node.type = type;
node.questionToken = questionToken;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updatePropertySignature(node, modifiers, name, questionToken, type) {
return node.modifiers !== modifiers
|| node.name !== name
|| node.questionToken !== questionToken
|| node.type !== type
? update(createPropertySignature(modifiers, name, questionToken, type), node)
: node;
}
// @api
function createPropertyDeclaration(decorators, modifiers, name, questionOrExclamationToken, type, initializer) {
var node = createBaseVariableLikeDeclaration(165 /* PropertyDeclaration */, decorators, modifiers, name, type, initializer);
node.questionToken = questionOrExclamationToken && ts.isQuestionToken(questionOrExclamationToken) ? questionOrExclamationToken : undefined;
node.exclamationToken = questionOrExclamationToken && ts.isExclamationToken(questionOrExclamationToken) ? questionOrExclamationToken : undefined;
node.transformFlags |=
propagateChildFlags(node.questionToken) |
propagateChildFlags(node.exclamationToken) |
8388608 /* ContainsClassFields */;
if (ts.isComputedPropertyName(node.name) || (ts.hasStaticModifier(node) && node.initializer)) {
node.transformFlags |= 4096 /* ContainsTypeScriptClassSyntax */;
}
if (questionOrExclamationToken || ts.modifiersToFlags(node.modifiers) & 2 /* Ambient */) {
node.transformFlags |= 1 /* ContainsTypeScript */;
}
return node;
}
// @api
function updatePropertyDeclaration(node, decorators, modifiers, name, questionOrExclamationToken, type, initializer) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.name !== name
|| node.questionToken !== (questionOrExclamationToken !== undefined && ts.isQuestionToken(questionOrExclamationToken) ? questionOrExclamationToken : undefined)
|| node.exclamationToken !== (questionOrExclamationToken !== undefined && ts.isExclamationToken(questionOrExclamationToken) ? questionOrExclamationToken : undefined)
|| node.type !== type
|| node.initializer !== initializer
? update(createPropertyDeclaration(decorators, modifiers, name, questionOrExclamationToken, type, initializer), node)
: node;
}
// @api
function createMethodSignature(modifiers, name, questionToken, typeParameters, parameters, type) {
var node = createBaseSignatureDeclaration(166 /* MethodSignature */,
/*decorators*/ undefined, modifiers, name, typeParameters, parameters, type);
node.questionToken = questionToken;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateMethodSignature(node, modifiers, name, questionToken, typeParameters, parameters, type) {
return node.modifiers !== modifiers
|| node.name !== name
|| node.questionToken !== questionToken
|| node.typeParameters !== typeParameters
|| node.parameters !== parameters
|| node.type !== type
? updateBaseSignatureDeclaration(createMethodSignature(modifiers, name, questionToken, typeParameters, parameters, type), node)
: node;
}
// @api
function createMethodDeclaration(decorators, modifiers, asteriskToken, name, questionToken, typeParameters, parameters, type, body) {
var node = createBaseFunctionLikeDeclaration(167 /* MethodDeclaration */, decorators, modifiers, name, typeParameters, parameters, type, body);
node.asteriskToken = asteriskToken;
node.questionToken = questionToken;
node.transformFlags |=
propagateChildFlags(node.asteriskToken) |
propagateChildFlags(node.questionToken) |
512 /* ContainsES2015 */;
if (questionToken) {
node.transformFlags |= 1 /* ContainsTypeScript */;
}
if (ts.modifiersToFlags(node.modifiers) & 256 /* Async */) {
if (asteriskToken) {
node.transformFlags |= 64 /* ContainsES2018 */;
}
else {
node.transformFlags |= 128 /* ContainsES2017 */;
}
}
else if (asteriskToken) {
node.transformFlags |= 1024 /* ContainsGenerator */;
}
return node;
}
// @api
function updateMethodDeclaration(node, decorators, modifiers, asteriskToken, name, questionToken, typeParameters, parameters, type, body) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.asteriskToken !== asteriskToken
|| node.name !== name
|| node.questionToken !== questionToken
|| node.typeParameters !== typeParameters
|| node.parameters !== parameters
|| node.type !== type
|| node.body !== body
? updateBaseFunctionLikeDeclaration(createMethodDeclaration(decorators, modifiers, asteriskToken, name, questionToken, typeParameters, parameters, type, body), node)
: node;
}
// @api
function createClassStaticBlockDeclaration(decorators, modifiers, body) {
var node = createBaseGenericNamedDeclaration(168 /* ClassStaticBlockDeclaration */, decorators, modifiers,
/*name*/ undefined,
/*typeParameters*/ undefined);
node.body = body;
node.transformFlags = propagateChildFlags(body) | 8388608 /* ContainsClassFields */;
return node;
}
// @api
function updateClassStaticBlockDeclaration(node, decorators, modifiers, body) {
return node.decorators !== decorators
|| node.modifier !== modifiers
|| node.body !== body
? update(createClassStaticBlockDeclaration(decorators, modifiers, body), node)
: node;
}
// @api
function createConstructorDeclaration(decorators, modifiers, parameters, body) {
var node = createBaseFunctionLikeDeclaration(169 /* Constructor */, decorators, modifiers,
/*name*/ undefined,
/*typeParameters*/ undefined, parameters,
/*type*/ undefined, body);
node.transformFlags |= 512 /* ContainsES2015 */;
return node;
}
// @api
function updateConstructorDeclaration(node, decorators, modifiers, parameters, body) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.parameters !== parameters
|| node.body !== body
? updateBaseFunctionLikeDeclaration(createConstructorDeclaration(decorators, modifiers, parameters, body), node)
: node;
}
// @api
function createGetAccessorDeclaration(decorators, modifiers, name, parameters, type, body) {
return createBaseFunctionLikeDeclaration(170 /* GetAccessor */, decorators, modifiers, name,
/*typeParameters*/ undefined, parameters, type, body);
}
// @api
function updateGetAccessorDeclaration(node, decorators, modifiers, name, parameters, type, body) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.name !== name
|| node.parameters !== parameters
|| node.type !== type
|| node.body !== body
? updateBaseFunctionLikeDeclaration(createGetAccessorDeclaration(decorators, modifiers, name, parameters, type, body), node)
: node;
}
// @api
function createSetAccessorDeclaration(decorators, modifiers, name, parameters, body) {
return createBaseFunctionLikeDeclaration(171 /* SetAccessor */, decorators, modifiers, name,
/*typeParameters*/ undefined, parameters,
/*type*/ undefined, body);
}
// @api
function updateSetAccessorDeclaration(node, decorators, modifiers, name, parameters, body) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.name !== name
|| node.parameters !== parameters
|| node.body !== body
? updateBaseFunctionLikeDeclaration(createSetAccessorDeclaration(decorators, modifiers, name, parameters, body), node)
: node;
}
// @api
function createCallSignature(typeParameters, parameters, type) {
var node = createBaseSignatureDeclaration(172 /* CallSignature */,
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*name*/ undefined, typeParameters, parameters, type);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateCallSignature(node, typeParameters, parameters, type) {
return node.typeParameters !== typeParameters
|| node.parameters !== parameters
|| node.type !== type
? updateBaseSignatureDeclaration(createCallSignature(typeParameters, parameters, type), node)
: node;
}
// @api
function createConstructSignature(typeParameters, parameters, type) {
var node = createBaseSignatureDeclaration(173 /* ConstructSignature */,
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*name*/ undefined, typeParameters, parameters, type);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateConstructSignature(node, typeParameters, parameters, type) {
return node.typeParameters !== typeParameters
|| node.parameters !== parameters
|| node.type !== type
? updateBaseSignatureDeclaration(createConstructSignature(typeParameters, parameters, type), node)
: node;
}
// @api
function createIndexSignature(decorators, modifiers, parameters, type) {
var node = createBaseSignatureDeclaration(174 /* IndexSignature */, decorators, modifiers,
/*name*/ undefined,
/*typeParameters*/ undefined, parameters, type);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateIndexSignature(node, decorators, modifiers, parameters, type) {
return node.parameters !== parameters
|| node.type !== type
|| node.decorators !== decorators
|| node.modifiers !== modifiers
? updateBaseSignatureDeclaration(createIndexSignature(decorators, modifiers, parameters, type), node)
: node;
}
// @api
function createTemplateLiteralTypeSpan(type, literal) {
var node = createBaseNode(197 /* TemplateLiteralTypeSpan */);
node.type = type;
node.literal = literal;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateTemplateLiteralTypeSpan(node, type, literal) {
return node.type !== type
|| node.literal !== literal
? update(createTemplateLiteralTypeSpan(type, literal), node)
: node;
}
//
// Types
//
// @api
function createKeywordTypeNode(kind) {
return createToken(kind);
}
// @api
function createTypePredicateNode(assertsModifier, parameterName, type) {
var node = createBaseNode(175 /* TypePredicate */);
node.assertsModifier = assertsModifier;
node.parameterName = asName(parameterName);
node.type = type;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateTypePredicateNode(node, assertsModifier, parameterName, type) {
return node.assertsModifier !== assertsModifier
|| node.parameterName !== parameterName
|| node.type !== type
? update(createTypePredicateNode(assertsModifier, parameterName, type), node)
: node;
}
// @api
function createTypeReferenceNode(typeName, typeArguments) {
var node = createBaseNode(176 /* TypeReference */);
node.typeName = asName(typeName);
node.typeArguments = typeArguments && parenthesizerRules().parenthesizeTypeArguments(createNodeArray(typeArguments));
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateTypeReferenceNode(node, typeName, typeArguments) {
return node.typeName !== typeName
|| node.typeArguments !== typeArguments
? update(createTypeReferenceNode(typeName, typeArguments), node)
: node;
}
// @api
function createFunctionTypeNode(typeParameters, parameters, type) {
var node = createBaseSignatureDeclaration(177 /* FunctionType */,
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*name*/ undefined, typeParameters, parameters, type);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateFunctionTypeNode(node, typeParameters, parameters, type) {
return node.typeParameters !== typeParameters
|| node.parameters !== parameters
|| node.type !== type
? updateBaseSignatureDeclaration(createFunctionTypeNode(typeParameters, parameters, type), node)
: node;
}
// @api
function createConstructorTypeNode() {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
return args.length === 4 ? createConstructorTypeNode1.apply(void 0, args) :
args.length === 3 ? createConstructorTypeNode2.apply(void 0, args) :
ts.Debug.fail("Incorrect number of arguments specified.");
}
function createConstructorTypeNode1(modifiers, typeParameters, parameters, type) {
var node = createBaseSignatureDeclaration(178 /* ConstructorType */,
/*decorators*/ undefined, modifiers,
/*name*/ undefined, typeParameters, parameters, type);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
/** @deprecated */
function createConstructorTypeNode2(typeParameters, parameters, type) {
return createConstructorTypeNode1(/*modifiers*/ undefined, typeParameters, parameters, type);
}
// @api
function updateConstructorTypeNode() {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
return args.length === 5 ? updateConstructorTypeNode1.apply(void 0, args) :
args.length === 4 ? updateConstructorTypeNode2.apply(void 0, args) :
ts.Debug.fail("Incorrect number of arguments specified.");
}
function updateConstructorTypeNode1(node, modifiers, typeParameters, parameters, type) {
return node.modifiers !== modifiers
|| node.typeParameters !== typeParameters
|| node.parameters !== parameters
|| node.type !== type
? updateBaseSignatureDeclaration(createConstructorTypeNode(modifiers, typeParameters, parameters, type), node)
: node;
}
/** @deprecated */
function updateConstructorTypeNode2(node, typeParameters, parameters, type) {
return updateConstructorTypeNode1(node, node.modifiers, typeParameters, parameters, type);
}
// @api
function createTypeQueryNode(exprName) {
var node = createBaseNode(179 /* TypeQuery */);
node.exprName = exprName;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateTypeQueryNode(node, exprName) {
return node.exprName !== exprName
? update(createTypeQueryNode(exprName), node)
: node;
}
// @api
function createTypeLiteralNode(members) {
var node = createBaseNode(180 /* TypeLiteral */);
node.members = createNodeArray(members);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateTypeLiteralNode(node, members) {
return node.members !== members
? update(createTypeLiteralNode(members), node)
: node;
}
// @api
function createArrayTypeNode(elementType) {
var node = createBaseNode(181 /* ArrayType */);
node.elementType = parenthesizerRules().parenthesizeElementTypeOfArrayType(elementType);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateArrayTypeNode(node, elementType) {
return node.elementType !== elementType
? update(createArrayTypeNode(elementType), node)
: node;
}
// @api
function createTupleTypeNode(elements) {
var node = createBaseNode(182 /* TupleType */);
node.elements = createNodeArray(elements);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateTupleTypeNode(node, elements) {
return node.elements !== elements
? update(createTupleTypeNode(elements), node)
: node;
}
// @api
function createNamedTupleMember(dotDotDotToken, name, questionToken, type) {
var node = createBaseNode(195 /* NamedTupleMember */);
node.dotDotDotToken = dotDotDotToken;
node.name = name;
node.questionToken = questionToken;
node.type = type;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateNamedTupleMember(node, dotDotDotToken, name, questionToken, type) {
return node.dotDotDotToken !== dotDotDotToken
|| node.name !== name
|| node.questionToken !== questionToken
|| node.type !== type
? update(createNamedTupleMember(dotDotDotToken, name, questionToken, type), node)
: node;
}
// @api
function createOptionalTypeNode(type) {
var node = createBaseNode(183 /* OptionalType */);
node.type = parenthesizerRules().parenthesizeElementTypeOfArrayType(type);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateOptionalTypeNode(node, type) {
return node.type !== type
? update(createOptionalTypeNode(type), node)
: node;
}
// @api
function createRestTypeNode(type) {
var node = createBaseNode(184 /* RestType */);
node.type = type;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateRestTypeNode(node, type) {
return node.type !== type
? update(createRestTypeNode(type), node)
: node;
}
function createUnionOrIntersectionTypeNode(kind, types) {
var node = createBaseNode(kind);
node.types = parenthesizerRules().parenthesizeConstituentTypesOfUnionOrIntersectionType(types);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
function updateUnionOrIntersectionTypeNode(node, types) {
return node.types !== types
? update(createUnionOrIntersectionTypeNode(node.kind, types), node)
: node;
}
// @api
function createUnionTypeNode(types) {
return createUnionOrIntersectionTypeNode(185 /* UnionType */, types);
}
// @api
function updateUnionTypeNode(node, types) {
return updateUnionOrIntersectionTypeNode(node, types);
}
// @api
function createIntersectionTypeNode(types) {
return createUnionOrIntersectionTypeNode(186 /* IntersectionType */, types);
}
// @api
function updateIntersectionTypeNode(node, types) {
return updateUnionOrIntersectionTypeNode(node, types);
}
// @api
function createConditionalTypeNode(checkType, extendsType, trueType, falseType) {
var node = createBaseNode(187 /* ConditionalType */);
node.checkType = parenthesizerRules().parenthesizeMemberOfConditionalType(checkType);
node.extendsType = parenthesizerRules().parenthesizeMemberOfConditionalType(extendsType);
node.trueType = trueType;
node.falseType = falseType;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateConditionalTypeNode(node, checkType, extendsType, trueType, falseType) {
return node.checkType !== checkType
|| node.extendsType !== extendsType
|| node.trueType !== trueType
|| node.falseType !== falseType
? update(createConditionalTypeNode(checkType, extendsType, trueType, falseType), node)
: node;
}
// @api
function createInferTypeNode(typeParameter) {
var node = createBaseNode(188 /* InferType */);
node.typeParameter = typeParameter;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateInferTypeNode(node, typeParameter) {
return node.typeParameter !== typeParameter
? update(createInferTypeNode(typeParameter), node)
: node;
}
// @api
function createTemplateLiteralType(head, templateSpans) {
var node = createBaseNode(196 /* TemplateLiteralType */);
node.head = head;
node.templateSpans = createNodeArray(templateSpans);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateTemplateLiteralType(node, head, templateSpans) {
return node.head !== head
|| node.templateSpans !== templateSpans
? update(createTemplateLiteralType(head, templateSpans), node)
: node;
}
// @api
function createImportTypeNode(argument, qualifier, typeArguments, isTypeOf) {
if (isTypeOf === void 0) { isTypeOf = false; }
var node = createBaseNode(198 /* ImportType */);
node.argument = argument;
node.qualifier = qualifier;
node.typeArguments = typeArguments && parenthesizerRules().parenthesizeTypeArguments(typeArguments);
node.isTypeOf = isTypeOf;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateImportTypeNode(node, argument, qualifier, typeArguments, isTypeOf) {
if (isTypeOf === void 0) { isTypeOf = node.isTypeOf; }
return node.argument !== argument
|| node.qualifier !== qualifier
|| node.typeArguments !== typeArguments
|| node.isTypeOf !== isTypeOf
? update(createImportTypeNode(argument, qualifier, typeArguments, isTypeOf), node)
: node;
}
// @api
function createParenthesizedType(type) {
var node = createBaseNode(189 /* ParenthesizedType */);
node.type = type;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateParenthesizedType(node, type) {
return node.type !== type
? update(createParenthesizedType(type), node)
: node;
}
// @api
function createThisTypeNode() {
var node = createBaseNode(190 /* ThisType */);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function createTypeOperatorNode(operator, type) {
var node = createBaseNode(191 /* TypeOperator */);
node.operator = operator;
node.type = parenthesizerRules().parenthesizeMemberOfElementType(type);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateTypeOperatorNode(node, type) {
return node.type !== type
? update(createTypeOperatorNode(node.operator, type), node)
: node;
}
// @api
function createIndexedAccessTypeNode(objectType, indexType) {
var node = createBaseNode(192 /* IndexedAccessType */);
node.objectType = parenthesizerRules().parenthesizeMemberOfElementType(objectType);
node.indexType = indexType;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateIndexedAccessTypeNode(node, objectType, indexType) {
return node.objectType !== objectType
|| node.indexType !== indexType
? update(createIndexedAccessTypeNode(objectType, indexType), node)
: node;
}
// @api
function createMappedTypeNode(readonlyToken, typeParameter, nameType, questionToken, type) {
var node = createBaseNode(193 /* MappedType */);
node.readonlyToken = readonlyToken;
node.typeParameter = typeParameter;
node.nameType = nameType;
node.questionToken = questionToken;
node.type = type;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateMappedTypeNode(node, readonlyToken, typeParameter, nameType, questionToken, type) {
return node.readonlyToken !== readonlyToken
|| node.typeParameter !== typeParameter
|| node.nameType !== nameType
|| node.questionToken !== questionToken
|| node.type !== type
? update(createMappedTypeNode(readonlyToken, typeParameter, nameType, questionToken, type), node)
: node;
}
// @api
function createLiteralTypeNode(literal) {
var node = createBaseNode(194 /* LiteralType */);
node.literal = literal;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateLiteralTypeNode(node, literal) {
return node.literal !== literal
? update(createLiteralTypeNode(literal), node)
: node;
}
//
// Binding Patterns
//
// @api
function createObjectBindingPattern(elements) {
var node = createBaseNode(199 /* ObjectBindingPattern */);
node.elements = createNodeArray(elements);
node.transformFlags |=
propagateChildrenFlags(node.elements) |
512 /* ContainsES2015 */ |
262144 /* ContainsBindingPattern */;
if (node.transformFlags & 16384 /* ContainsRestOrSpread */) {
node.transformFlags |=
64 /* ContainsES2018 */ |
32768 /* ContainsObjectRestOrSpread */;
}
return node;
}
// @api
function updateObjectBindingPattern(node, elements) {
return node.elements !== elements
? update(createObjectBindingPattern(elements), node)
: node;
}
// @api
function createArrayBindingPattern(elements) {
var node = createBaseNode(200 /* ArrayBindingPattern */);
node.elements = createNodeArray(elements);
node.transformFlags |=
propagateChildrenFlags(node.elements) |
512 /* ContainsES2015 */ |
262144 /* ContainsBindingPattern */;
return node;
}
// @api
function updateArrayBindingPattern(node, elements) {
return node.elements !== elements
? update(createArrayBindingPattern(elements), node)
: node;
}
// @api
function createBindingElement(dotDotDotToken, propertyName, name, initializer) {
var node = createBaseBindingLikeDeclaration(201 /* BindingElement */,
/*decorators*/ undefined,
/*modifiers*/ undefined, name, initializer && parenthesizerRules().parenthesizeExpressionForDisallowedComma(initializer));
node.propertyName = asName(propertyName);
node.dotDotDotToken = dotDotDotToken;
node.transformFlags |=
propagateChildFlags(node.dotDotDotToken) |
512 /* ContainsES2015 */;
if (node.propertyName) {
node.transformFlags |= ts.isIdentifier(node.propertyName) ?
propagateIdentifierNameFlags(node.propertyName) :
propagateChildFlags(node.propertyName);
}
if (dotDotDotToken)
node.transformFlags |= 16384 /* ContainsRestOrSpread */;
return node;
}
// @api
function updateBindingElement(node, dotDotDotToken, propertyName, name, initializer) {
return node.propertyName !== propertyName
|| node.dotDotDotToken !== dotDotDotToken
|| node.name !== name
|| node.initializer !== initializer
? update(createBindingElement(dotDotDotToken, propertyName, name, initializer), node)
: node;
}
//
// Expression
//
function createBaseExpression(kind) {
var node = createBaseNode(kind);
// the following properties are commonly set by the checker/binder
return node;
}
// @api
function createArrayLiteralExpression(elements, multiLine) {
var node = createBaseExpression(202 /* ArrayLiteralExpression */);
// Ensure we add a trailing comma for something like `[NumericLiteral(1), NumericLiteral(2), OmittedExpresion]` so that
// we end up with `[1, 2, ,]` instead of `[1, 2, ]` otherwise the `OmittedExpression` will just end up being treated like
// a trailing comma.
var lastElement = elements && ts.lastOrUndefined(elements);
var elementsArray = createNodeArray(elements, lastElement && ts.isOmittedExpression(lastElement) ? true : undefined);
node.elements = parenthesizerRules().parenthesizeExpressionsOfCommaDelimitedList(elementsArray);
node.multiLine = multiLine;
node.transformFlags |= propagateChildrenFlags(node.elements);
return node;
}
// @api
function updateArrayLiteralExpression(node, elements) {
return node.elements !== elements
? update(createArrayLiteralExpression(elements, node.multiLine), node)
: node;
}
// @api
function createObjectLiteralExpression(properties, multiLine) {
var node = createBaseExpression(203 /* ObjectLiteralExpression */);
node.properties = createNodeArray(properties);
node.multiLine = multiLine;
node.transformFlags |= propagateChildrenFlags(node.properties);
return node;
}
// @api
function updateObjectLiteralExpression(node, properties) {
return node.properties !== properties
? update(createObjectLiteralExpression(properties, node.multiLine), node)
: node;
}
// @api
function createPropertyAccessExpression(expression, name) {
var node = createBaseExpression(204 /* PropertyAccessExpression */);
node.expression = parenthesizerRules().parenthesizeLeftSideOfAccess(expression);
node.name = asName(name);
node.transformFlags =
propagateChildFlags(node.expression) |
(ts.isIdentifier(node.name) ?
propagateIdentifierNameFlags(node.name) :
propagateChildFlags(node.name));
if (ts.isSuperKeyword(expression)) {
// super method calls require a lexical 'this'
// super method calls require 'super' hoisting in ES2017 and ES2018 async functions and async generators
node.transformFlags |=
128 /* ContainsES2017 */ |
64 /* ContainsES2018 */;
}
return node;
}
// @api
function updatePropertyAccessExpression(node, expression, name) {
if (ts.isPropertyAccessChain(node)) {
return updatePropertyAccessChain(node, expression, node.questionDotToken, ts.cast(name, ts.isIdentifier));
}
return node.expression !== expression
|| node.name !== name
? update(createPropertyAccessExpression(expression, name), node)
: node;
}
// @api
function createPropertyAccessChain(expression, questionDotToken, name) {
var node = createBaseExpression(204 /* PropertyAccessExpression */);
node.flags |= 32 /* OptionalChain */;
node.expression = parenthesizerRules().parenthesizeLeftSideOfAccess(expression);
node.questionDotToken = questionDotToken;
node.name = asName(name);
node.transformFlags |=
16 /* ContainsES2020 */ |
propagateChildFlags(node.expression) |
propagateChildFlags(node.questionDotToken) |
(ts.isIdentifier(node.name) ?
propagateIdentifierNameFlags(node.name) :
propagateChildFlags(node.name));
return node;
}
// @api
function updatePropertyAccessChain(node, expression, questionDotToken, name) {
ts.Debug.assert(!!(node.flags & 32 /* OptionalChain */), "Cannot update a PropertyAccessExpression using updatePropertyAccessChain. Use updatePropertyAccess instead.");
// Because we are updating an existing PropertyAccessChain we want to inherit its emitFlags
// instead of using the default from createPropertyAccess
return node.expression !== expression
|| node.questionDotToken !== questionDotToken
|| node.name !== name
? update(createPropertyAccessChain(expression, questionDotToken, name), node)
: node;
}
// @api
function createElementAccessExpression(expression, index) {
var node = createBaseExpression(205 /* ElementAccessExpression */);
node.expression = parenthesizerRules().parenthesizeLeftSideOfAccess(expression);
node.argumentExpression = asExpression(index);
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildFlags(node.argumentExpression);
if (ts.isSuperKeyword(expression)) {
// super method calls require a lexical 'this'
// super method calls require 'super' hoisting in ES2017 and ES2018 async functions and async generators
node.transformFlags |=
128 /* ContainsES2017 */ |
64 /* ContainsES2018 */;
}
return node;
}
// @api
function updateElementAccessExpression(node, expression, argumentExpression) {
if (ts.isElementAccessChain(node)) {
return updateElementAccessChain(node, expression, node.questionDotToken, argumentExpression);
}
return node.expression !== expression
|| node.argumentExpression !== argumentExpression
? update(createElementAccessExpression(expression, argumentExpression), node)
: node;
}
// @api
function createElementAccessChain(expression, questionDotToken, index) {
var node = createBaseExpression(205 /* ElementAccessExpression */);
node.flags |= 32 /* OptionalChain */;
node.expression = parenthesizerRules().parenthesizeLeftSideOfAccess(expression);
node.questionDotToken = questionDotToken;
node.argumentExpression = asExpression(index);
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildFlags(node.questionDotToken) |
propagateChildFlags(node.argumentExpression) |
16 /* ContainsES2020 */;
return node;
}
// @api
function updateElementAccessChain(node, expression, questionDotToken, argumentExpression) {
ts.Debug.assert(!!(node.flags & 32 /* OptionalChain */), "Cannot update a ElementAccessExpression using updateElementAccessChain. Use updateElementAccess instead.");
// Because we are updating an existing ElementAccessChain we want to inherit its emitFlags
// instead of using the default from createElementAccess
return node.expression !== expression
|| node.questionDotToken !== questionDotToken
|| node.argumentExpression !== argumentExpression
? update(createElementAccessChain(expression, questionDotToken, argumentExpression), node)
: node;
}
// @api
function createCallExpression(expression, typeArguments, argumentsArray) {
var node = createBaseExpression(206 /* CallExpression */);
node.expression = parenthesizerRules().parenthesizeLeftSideOfAccess(expression);
node.typeArguments = asNodeArray(typeArguments);
node.arguments = parenthesizerRules().parenthesizeExpressionsOfCommaDelimitedList(createNodeArray(argumentsArray));
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildrenFlags(node.typeArguments) |
propagateChildrenFlags(node.arguments);
if (node.typeArguments) {
node.transformFlags |= 1 /* ContainsTypeScript */;
}
if (ts.isImportKeyword(node.expression)) {
node.transformFlags |= 4194304 /* ContainsDynamicImport */;
}
else if (ts.isSuperProperty(node.expression)) {
node.transformFlags |= 8192 /* ContainsLexicalThis */;
}
return node;
}
// @api
function updateCallExpression(node, expression, typeArguments, argumentsArray) {
if (ts.isCallChain(node)) {
return updateCallChain(node, expression, node.questionDotToken, typeArguments, argumentsArray);
}
return node.expression !== expression
|| node.typeArguments !== typeArguments
|| node.arguments !== argumentsArray
? update(createCallExpression(expression, typeArguments, argumentsArray), node)
: node;
}
// @api
function createCallChain(expression, questionDotToken, typeArguments, argumentsArray) {
var node = createBaseExpression(206 /* CallExpression */);
node.flags |= 32 /* OptionalChain */;
node.expression = parenthesizerRules().parenthesizeLeftSideOfAccess(expression);
node.questionDotToken = questionDotToken;
node.typeArguments = asNodeArray(typeArguments);
node.arguments = parenthesizerRules().parenthesizeExpressionsOfCommaDelimitedList(createNodeArray(argumentsArray));
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildFlags(node.questionDotToken) |
propagateChildrenFlags(node.typeArguments) |
propagateChildrenFlags(node.arguments) |
16 /* ContainsES2020 */;
if (node.typeArguments) {
node.transformFlags |= 1 /* ContainsTypeScript */;
}
if (ts.isSuperProperty(node.expression)) {
node.transformFlags |= 8192 /* ContainsLexicalThis */;
}
return node;
}
// @api
function updateCallChain(node, expression, questionDotToken, typeArguments, argumentsArray) {
ts.Debug.assert(!!(node.flags & 32 /* OptionalChain */), "Cannot update a CallExpression using updateCallChain. Use updateCall instead.");
return node.expression !== expression
|| node.questionDotToken !== questionDotToken
|| node.typeArguments !== typeArguments
|| node.arguments !== argumentsArray
? update(createCallChain(expression, questionDotToken, typeArguments, argumentsArray), node)
: node;
}
// @api
function createNewExpression(expression, typeArguments, argumentsArray) {
var node = createBaseExpression(207 /* NewExpression */);
node.expression = parenthesizerRules().parenthesizeExpressionOfNew(expression);
node.typeArguments = asNodeArray(typeArguments);
node.arguments = argumentsArray ? parenthesizerRules().parenthesizeExpressionsOfCommaDelimitedList(argumentsArray) : undefined;
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildrenFlags(node.typeArguments) |
propagateChildrenFlags(node.arguments) |
16 /* ContainsES2020 */;
if (node.typeArguments) {
node.transformFlags |= 1 /* ContainsTypeScript */;
}
return node;
}
// @api
function updateNewExpression(node, expression, typeArguments, argumentsArray) {
return node.expression !== expression
|| node.typeArguments !== typeArguments
|| node.arguments !== argumentsArray
? update(createNewExpression(expression, typeArguments, argumentsArray), node)
: node;
}
// @api
function createTaggedTemplateExpression(tag, typeArguments, template) {
var node = createBaseExpression(208 /* TaggedTemplateExpression */);
node.tag = parenthesizerRules().parenthesizeLeftSideOfAccess(tag);
node.typeArguments = asNodeArray(typeArguments);
node.template = template;
node.transformFlags |=
propagateChildFlags(node.tag) |
propagateChildrenFlags(node.typeArguments) |
propagateChildFlags(node.template) |
512 /* ContainsES2015 */;
if (node.typeArguments) {
node.transformFlags |= 1 /* ContainsTypeScript */;
}
if (ts.hasInvalidEscape(node.template)) {
node.transformFlags |= 64 /* ContainsES2018 */;
}
return node;
}
// @api
function updateTaggedTemplateExpression(node, tag, typeArguments, template) {
return node.tag !== tag
|| node.typeArguments !== typeArguments
|| node.template !== template
? update(createTaggedTemplateExpression(tag, typeArguments, template), node)
: node;
}
// @api
function createTypeAssertion(type, expression) {
var node = createBaseExpression(209 /* TypeAssertionExpression */);
node.expression = parenthesizerRules().parenthesizeOperandOfPrefixUnary(expression);
node.type = type;
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildFlags(node.type) |
1 /* ContainsTypeScript */;
return node;
}
// @api
function updateTypeAssertion(node, type, expression) {
return node.type !== type
|| node.expression !== expression
? update(createTypeAssertion(type, expression), node)
: node;
}
// @api
function createParenthesizedExpression(expression) {
var node = createBaseExpression(210 /* ParenthesizedExpression */);
node.expression = expression;
node.transformFlags = propagateChildFlags(node.expression);
return node;
}
// @api
function updateParenthesizedExpression(node, expression) {
return node.expression !== expression
? update(createParenthesizedExpression(expression), node)
: node;
}
// @api
function createFunctionExpression(modifiers, asteriskToken, name, typeParameters, parameters, type, body) {
var node = createBaseFunctionLikeDeclaration(211 /* FunctionExpression */,
/*decorators*/ undefined, modifiers, name, typeParameters, parameters, type, body);
node.asteriskToken = asteriskToken;
node.transformFlags |= propagateChildFlags(node.asteriskToken);
if (node.typeParameters) {
node.transformFlags |= 1 /* ContainsTypeScript */;
}
if (ts.modifiersToFlags(node.modifiers) & 256 /* Async */) {
if (node.asteriskToken) {
node.transformFlags |= 64 /* ContainsES2018 */;
}
else {
node.transformFlags |= 128 /* ContainsES2017 */;
}
}
else if (node.asteriskToken) {
node.transformFlags |= 1024 /* ContainsGenerator */;
}
return node;
}
// @api
function updateFunctionExpression(node, modifiers, asteriskToken, name, typeParameters, parameters, type, body) {
return node.name !== name
|| node.modifiers !== modifiers
|| node.asteriskToken !== asteriskToken
|| node.typeParameters !== typeParameters
|| node.parameters !== parameters
|| node.type !== type
|| node.body !== body
? updateBaseFunctionLikeDeclaration(createFunctionExpression(modifiers, asteriskToken, name, typeParameters, parameters, type, body), node)
: node;
}
// @api
function createArrowFunction(modifiers, typeParameters, parameters, type, equalsGreaterThanToken, body) {
var node = createBaseFunctionLikeDeclaration(212 /* ArrowFunction */,
/*decorators*/ undefined, modifiers,
/*name*/ undefined, typeParameters, parameters, type, parenthesizerRules().parenthesizeConciseBodyOfArrowFunction(body));
node.equalsGreaterThanToken = equalsGreaterThanToken !== null && equalsGreaterThanToken !== void 0 ? equalsGreaterThanToken : createToken(38 /* EqualsGreaterThanToken */);
node.transformFlags |=
propagateChildFlags(node.equalsGreaterThanToken) |
512 /* ContainsES2015 */;
if (ts.modifiersToFlags(node.modifiers) & 256 /* Async */) {
node.transformFlags |= 128 /* ContainsES2017 */ | 8192 /* ContainsLexicalThis */;
}
return node;
}
// @api
function updateArrowFunction(node, modifiers, typeParameters, parameters, type, equalsGreaterThanToken, body) {
return node.modifiers !== modifiers
|| node.typeParameters !== typeParameters
|| node.parameters !== parameters
|| node.type !== type
|| node.equalsGreaterThanToken !== equalsGreaterThanToken
|| node.body !== body
? updateBaseFunctionLikeDeclaration(createArrowFunction(modifiers, typeParameters, parameters, type, equalsGreaterThanToken, body), node)
: node;
}
// @api
function createDeleteExpression(expression) {
var node = createBaseExpression(213 /* DeleteExpression */);
node.expression = parenthesizerRules().parenthesizeOperandOfPrefixUnary(expression);
node.transformFlags |= propagateChildFlags(node.expression);
return node;
}
// @api
function updateDeleteExpression(node, expression) {
return node.expression !== expression
? update(createDeleteExpression(expression), node)
: node;
}
// @api
function createTypeOfExpression(expression) {
var node = createBaseExpression(214 /* TypeOfExpression */);
node.expression = parenthesizerRules().parenthesizeOperandOfPrefixUnary(expression);
node.transformFlags |= propagateChildFlags(node.expression);
return node;
}
// @api
function updateTypeOfExpression(node, expression) {
return node.expression !== expression
? update(createTypeOfExpression(expression), node)
: node;
}
// @api
function createVoidExpression(expression) {
var node = createBaseExpression(215 /* VoidExpression */);
node.expression = parenthesizerRules().parenthesizeOperandOfPrefixUnary(expression);
node.transformFlags |= propagateChildFlags(node.expression);
return node;
}
// @api
function updateVoidExpression(node, expression) {
return node.expression !== expression
? update(createVoidExpression(expression), node)
: node;
}
// @api
function createAwaitExpression(expression) {
var node = createBaseExpression(216 /* AwaitExpression */);
node.expression = parenthesizerRules().parenthesizeOperandOfPrefixUnary(expression);
node.transformFlags |=
propagateChildFlags(node.expression) |
128 /* ContainsES2017 */ |
64 /* ContainsES2018 */ |
1048576 /* ContainsAwait */;
return node;
}
// @api
function updateAwaitExpression(node, expression) {
return node.expression !== expression
? update(createAwaitExpression(expression), node)
: node;
}
// @api
function createPrefixUnaryExpression(operator, operand) {
var node = createBaseExpression(217 /* PrefixUnaryExpression */);
node.operator = operator;
node.operand = parenthesizerRules().parenthesizeOperandOfPrefixUnary(operand);
node.transformFlags |= propagateChildFlags(node.operand);
// Only set this flag for non-generated identifiers and non-"local" names. See the
// comment in `visitPreOrPostfixUnaryExpression` in module.ts
if ((operator === 45 /* PlusPlusToken */ || operator === 46 /* MinusMinusToken */) &&
ts.isIdentifier(node.operand) &&
!ts.isGeneratedIdentifier(node.operand) &&
!ts.isLocalName(node.operand)) {
node.transformFlags |= 67108864 /* ContainsUpdateExpressionForIdentifier */;
}
return node;
}
// @api
function updatePrefixUnaryExpression(node, operand) {
return node.operand !== operand
? update(createPrefixUnaryExpression(node.operator, operand), node)
: node;
}
// @api
function createPostfixUnaryExpression(operand, operator) {
var node = createBaseExpression(218 /* PostfixUnaryExpression */);
node.operator = operator;
node.operand = parenthesizerRules().parenthesizeOperandOfPostfixUnary(operand);
node.transformFlags |= propagateChildFlags(node.operand);
// Only set this flag for non-generated identifiers and non-"local" names. See the
// comment in `visitPreOrPostfixUnaryExpression` in module.ts
if (ts.isIdentifier(node.operand) &&
!ts.isGeneratedIdentifier(node.operand) &&
!ts.isLocalName(node.operand)) {
node.transformFlags |= 67108864 /* ContainsUpdateExpressionForIdentifier */;
}
return node;
}
// @api
function updatePostfixUnaryExpression(node, operand) {
return node.operand !== operand
? update(createPostfixUnaryExpression(operand, node.operator), node)
: node;
}
// @api
function createBinaryExpression(left, operator, right) {
var node = createBaseExpression(219 /* BinaryExpression */);
var operatorToken = asToken(operator);
var operatorKind = operatorToken.kind;
node.left = parenthesizerRules().parenthesizeLeftSideOfBinary(operatorKind, left);
node.operatorToken = operatorToken;
node.right = parenthesizerRules().parenthesizeRightSideOfBinary(operatorKind, node.left, right);
node.transformFlags |=
propagateChildFlags(node.left) |
propagateChildFlags(node.operatorToken) |
propagateChildFlags(node.right);
if (operatorKind === 60 /* QuestionQuestionToken */) {
node.transformFlags |= 16 /* ContainsES2020 */;
}
else if (operatorKind === 63 /* EqualsToken */) {
if (ts.isObjectLiteralExpression(node.left)) {
node.transformFlags |=
512 /* ContainsES2015 */ |
64 /* ContainsES2018 */ |
2048 /* ContainsDestructuringAssignment */ |
propagateAssignmentPatternFlags(node.left);
}
else if (ts.isArrayLiteralExpression(node.left)) {
node.transformFlags |=
512 /* ContainsES2015 */ |
2048 /* ContainsDestructuringAssignment */ |
propagateAssignmentPatternFlags(node.left);
}
}
else if (operatorKind === 42 /* AsteriskAsteriskToken */ || operatorKind === 67 /* AsteriskAsteriskEqualsToken */) {
node.transformFlags |= 256 /* ContainsES2016 */;
}
else if (ts.isLogicalOrCoalescingAssignmentOperator(operatorKind)) {
node.transformFlags |= 8 /* ContainsES2021 */;
}
return node;
}
function propagateAssignmentPatternFlags(node) {
if (node.transformFlags & 32768 /* ContainsObjectRestOrSpread */)
return 32768 /* ContainsObjectRestOrSpread */;
if (node.transformFlags & 64 /* ContainsES2018 */) {
// check for nested spread assignments, otherwise '{ x: { a, ...b } = foo } = c'
// will not be correctly interpreted by the ES2018 transformer
for (var _i = 0, _a = ts.getElementsOfBindingOrAssignmentPattern(node); _i < _a.length; _i++) {
var element = _a[_i];
var target = ts.getTargetOfBindingOrAssignmentElement(element);
if (target && ts.isAssignmentPattern(target)) {
if (target.transformFlags & 32768 /* ContainsObjectRestOrSpread */) {
return 32768 /* ContainsObjectRestOrSpread */;
}
if (target.transformFlags & 64 /* ContainsES2018 */) {
var flags_1 = propagateAssignmentPatternFlags(target);
if (flags_1)
return flags_1;
}
}
}
}
return 0 /* None */;
}
// @api
function updateBinaryExpression(node, left, operator, right) {
return node.left !== left
|| node.operatorToken !== operator
|| node.right !== right
? update(createBinaryExpression(left, operator, right), node)
: node;
}
// @api
function createConditionalExpression(condition, questionToken, whenTrue, colonToken, whenFalse) {
var node = createBaseExpression(220 /* ConditionalExpression */);
node.condition = parenthesizerRules().parenthesizeConditionOfConditionalExpression(condition);
node.questionToken = questionToken !== null && questionToken !== void 0 ? questionToken : createToken(57 /* QuestionToken */);
node.whenTrue = parenthesizerRules().parenthesizeBranchOfConditionalExpression(whenTrue);
node.colonToken = colonToken !== null && colonToken !== void 0 ? colonToken : createToken(58 /* ColonToken */);
node.whenFalse = parenthesizerRules().parenthesizeBranchOfConditionalExpression(whenFalse);
node.transformFlags |=
propagateChildFlags(node.condition) |
propagateChildFlags(node.questionToken) |
propagateChildFlags(node.whenTrue) |
propagateChildFlags(node.colonToken) |
propagateChildFlags(node.whenFalse);
return node;
}
// @api
function updateConditionalExpression(node, condition, questionToken, whenTrue, colonToken, whenFalse) {
return node.condition !== condition
|| node.questionToken !== questionToken
|| node.whenTrue !== whenTrue
|| node.colonToken !== colonToken
|| node.whenFalse !== whenFalse
? update(createConditionalExpression(condition, questionToken, whenTrue, colonToken, whenFalse), node)
: node;
}
// @api
function createTemplateExpression(head, templateSpans) {
var node = createBaseExpression(221 /* TemplateExpression */);
node.head = head;
node.templateSpans = createNodeArray(templateSpans);
node.transformFlags |=
propagateChildFlags(node.head) |
propagateChildrenFlags(node.templateSpans) |
512 /* ContainsES2015 */;
return node;
}
// @api
function updateTemplateExpression(node, head, templateSpans) {
return node.head !== head
|| node.templateSpans !== templateSpans
? update(createTemplateExpression(head, templateSpans), node)
: node;
}
function createTemplateLiteralLikeNodeChecked(kind, text, rawText, templateFlags) {
if (templateFlags === void 0) { templateFlags = 0 /* None */; }
ts.Debug.assert(!(templateFlags & ~2048 /* TemplateLiteralLikeFlags */), "Unsupported template flags.");
// NOTE: without the assignment to `undefined`, we don't narrow the initial type of `cooked`.
// eslint-disable-next-line no-undef-init
var cooked = undefined;
if (rawText !== undefined && rawText !== text) {
cooked = getCookedText(kind, rawText);
if (typeof cooked === "object") {
return ts.Debug.fail("Invalid raw text");
}
}
if (text === undefined) {
if (cooked === undefined) {
return ts.Debug.fail("Arguments 'text' and 'rawText' may not both be undefined.");
}
text = cooked;
}
else if (cooked !== undefined) {
ts.Debug.assert(text === cooked, "Expected argument 'text' to be the normalized (i.e. 'cooked') version of argument 'rawText'.");
}
return createTemplateLiteralLikeNode(kind, text, rawText, templateFlags);
}
// @api
function createTemplateLiteralLikeNode(kind, text, rawText, templateFlags) {
var node = createBaseToken(kind);
node.text = text;
node.rawText = rawText;
node.templateFlags = templateFlags & 2048 /* TemplateLiteralLikeFlags */;
node.transformFlags |= 512 /* ContainsES2015 */;
if (node.templateFlags) {
node.transformFlags |= 64 /* ContainsES2018 */;
}
return node;
}
// @api
function createTemplateHead(text, rawText, templateFlags) {
return createTemplateLiteralLikeNodeChecked(15 /* TemplateHead */, text, rawText, templateFlags);
}
// @api
function createTemplateMiddle(text, rawText, templateFlags) {
return createTemplateLiteralLikeNodeChecked(16 /* TemplateMiddle */, text, rawText, templateFlags);
}
// @api
function createTemplateTail(text, rawText, templateFlags) {
return createTemplateLiteralLikeNodeChecked(17 /* TemplateTail */, text, rawText, templateFlags);
}
// @api
function createNoSubstitutionTemplateLiteral(text, rawText, templateFlags) {
return createTemplateLiteralLikeNodeChecked(14 /* NoSubstitutionTemplateLiteral */, text, rawText, templateFlags);
}
// @api
function createYieldExpression(asteriskToken, expression) {
ts.Debug.assert(!asteriskToken || !!expression, "A `YieldExpression` with an asteriskToken must have an expression.");
var node = createBaseExpression(222 /* YieldExpression */);
node.expression = expression && parenthesizerRules().parenthesizeExpressionForDisallowedComma(expression);
node.asteriskToken = asteriskToken;
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildFlags(node.asteriskToken) |
512 /* ContainsES2015 */ |
64 /* ContainsES2018 */ |
524288 /* ContainsYield */;
return node;
}
// @api
function updateYieldExpression(node, asteriskToken, expression) {
return node.expression !== expression
|| node.asteriskToken !== asteriskToken
? update(createYieldExpression(asteriskToken, expression), node)
: node;
}
// @api
function createSpreadElement(expression) {
var node = createBaseExpression(223 /* SpreadElement */);
node.expression = parenthesizerRules().parenthesizeExpressionForDisallowedComma(expression);
node.transformFlags |=
propagateChildFlags(node.expression) |
512 /* ContainsES2015 */ |
16384 /* ContainsRestOrSpread */;
return node;
}
// @api
function updateSpreadElement(node, expression) {
return node.expression !== expression
? update(createSpreadElement(expression), node)
: node;
}
// @api
function createClassExpression(decorators, modifiers, name, typeParameters, heritageClauses, members) {
var node = createBaseClassLikeDeclaration(224 /* ClassExpression */, decorators, modifiers, name, typeParameters, heritageClauses, members);
node.transformFlags |= 512 /* ContainsES2015 */;
return node;
}
// @api
function updateClassExpression(node, decorators, modifiers, name, typeParameters, heritageClauses, members) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.name !== name
|| node.typeParameters !== typeParameters
|| node.heritageClauses !== heritageClauses
|| node.members !== members
? update(createClassExpression(decorators, modifiers, name, typeParameters, heritageClauses, members), node)
: node;
}
// @api
function createOmittedExpression() {
return createBaseExpression(225 /* OmittedExpression */);
}
// @api
function createExpressionWithTypeArguments(expression, typeArguments) {
var node = createBaseNode(226 /* ExpressionWithTypeArguments */);
node.expression = parenthesizerRules().parenthesizeLeftSideOfAccess(expression);
node.typeArguments = typeArguments && parenthesizerRules().parenthesizeTypeArguments(typeArguments);
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildrenFlags(node.typeArguments) |
512 /* ContainsES2015 */;
return node;
}
// @api
function updateExpressionWithTypeArguments(node, expression, typeArguments) {
return node.expression !== expression
|| node.typeArguments !== typeArguments
? update(createExpressionWithTypeArguments(expression, typeArguments), node)
: node;
}
// @api
function createAsExpression(expression, type) {
var node = createBaseExpression(227 /* AsExpression */);
node.expression = expression;
node.type = type;
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildFlags(node.type) |
1 /* ContainsTypeScript */;
return node;
}
// @api
function updateAsExpression(node, expression, type) {
return node.expression !== expression
|| node.type !== type
? update(createAsExpression(expression, type), node)
: node;
}
// @api
function createNonNullExpression(expression) {
var node = createBaseExpression(228 /* NonNullExpression */);
node.expression = parenthesizerRules().parenthesizeLeftSideOfAccess(expression);
node.transformFlags |=
propagateChildFlags(node.expression) |
1 /* ContainsTypeScript */;
return node;
}
// @api
function updateNonNullExpression(node, expression) {
if (ts.isNonNullChain(node)) {
return updateNonNullChain(node, expression);
}
return node.expression !== expression
? update(createNonNullExpression(expression), node)
: node;
}
// @api
function createNonNullChain(expression) {
var node = createBaseExpression(228 /* NonNullExpression */);
node.flags |= 32 /* OptionalChain */;
node.expression = parenthesizerRules().parenthesizeLeftSideOfAccess(expression);
node.transformFlags |=
propagateChildFlags(node.expression) |
1 /* ContainsTypeScript */;
return node;
}
// @api
function updateNonNullChain(node, expression) {
ts.Debug.assert(!!(node.flags & 32 /* OptionalChain */), "Cannot update a NonNullExpression using updateNonNullChain. Use updateNonNullExpression instead.");
return node.expression !== expression
? update(createNonNullChain(expression), node)
: node;
}
// @api
function createMetaProperty(keywordToken, name) {
var node = createBaseExpression(229 /* MetaProperty */);
node.keywordToken = keywordToken;
node.name = name;
node.transformFlags |= propagateChildFlags(node.name);
switch (keywordToken) {
case 103 /* NewKeyword */:
node.transformFlags |= 512 /* ContainsES2015 */;
break;
case 100 /* ImportKeyword */:
node.transformFlags |= 4 /* ContainsESNext */;
break;
default:
return ts.Debug.assertNever(keywordToken);
}
return node;
}
// @api
function updateMetaProperty(node, name) {
return node.name !== name
? update(createMetaProperty(node.keywordToken, name), node)
: node;
}
//
// Misc
//
// @api
function createTemplateSpan(expression, literal) {
var node = createBaseNode(231 /* TemplateSpan */);
node.expression = expression;
node.literal = literal;
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildFlags(node.literal) |
512 /* ContainsES2015 */;
return node;
}
// @api
function updateTemplateSpan(node, expression, literal) {
return node.expression !== expression
|| node.literal !== literal
? update(createTemplateSpan(expression, literal), node)
: node;
}
// @api
function createSemicolonClassElement() {
var node = createBaseNode(232 /* SemicolonClassElement */);
node.transformFlags |= 512 /* ContainsES2015 */;
return node;
}
//
// Element
//
// @api
function createBlock(statements, multiLine) {
var node = createBaseNode(233 /* Block */);
node.statements = createNodeArray(statements);
node.multiLine = multiLine;
node.transformFlags |= propagateChildrenFlags(node.statements);
return node;
}
// @api
function updateBlock(node, statements) {
return node.statements !== statements
? update(createBlock(statements, node.multiLine), node)
: node;
}
// @api
function createVariableStatement(modifiers, declarationList) {
var node = createBaseDeclaration(235 /* VariableStatement */, /*decorators*/ undefined, modifiers);
node.declarationList = ts.isArray(declarationList) ? createVariableDeclarationList(declarationList) : declarationList;
node.transformFlags |=
propagateChildFlags(node.declarationList);
if (ts.modifiersToFlags(node.modifiers) & 2 /* Ambient */) {
node.transformFlags = 1 /* ContainsTypeScript */;
}
return node;
}
// @api
function updateVariableStatement(node, modifiers, declarationList) {
return node.modifiers !== modifiers
|| node.declarationList !== declarationList
? update(createVariableStatement(modifiers, declarationList), node)
: node;
}
// @api
function createEmptyStatement() {
return createBaseNode(234 /* EmptyStatement */);
}
// @api
function createExpressionStatement(expression) {
var node = createBaseNode(236 /* ExpressionStatement */);
node.expression = parenthesizerRules().parenthesizeExpressionOfExpressionStatement(expression);
node.transformFlags |= propagateChildFlags(node.expression);
return node;
}
// @api
function updateExpressionStatement(node, expression) {
return node.expression !== expression
? update(createExpressionStatement(expression), node)
: node;
}
// @api
function createIfStatement(expression, thenStatement, elseStatement) {
var node = createBaseNode(237 /* IfStatement */);
node.expression = expression;
node.thenStatement = asEmbeddedStatement(thenStatement);
node.elseStatement = asEmbeddedStatement(elseStatement);
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildFlags(node.thenStatement) |
propagateChildFlags(node.elseStatement);
return node;
}
// @api
function updateIfStatement(node, expression, thenStatement, elseStatement) {
return node.expression !== expression
|| node.thenStatement !== thenStatement
|| node.elseStatement !== elseStatement
? update(createIfStatement(expression, thenStatement, elseStatement), node)
: node;
}
// @api
function createDoStatement(statement, expression) {
var node = createBaseNode(238 /* DoStatement */);
node.statement = asEmbeddedStatement(statement);
node.expression = expression;
node.transformFlags |=
propagateChildFlags(node.statement) |
propagateChildFlags(node.expression);
return node;
}
// @api
function updateDoStatement(node, statement, expression) {
return node.statement !== statement
|| node.expression !== expression
? update(createDoStatement(statement, expression), node)
: node;
}
// @api
function createWhileStatement(expression, statement) {
var node = createBaseNode(239 /* WhileStatement */);
node.expression = expression;
node.statement = asEmbeddedStatement(statement);
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildFlags(node.statement);
return node;
}
// @api
function updateWhileStatement(node, expression, statement) {
return node.expression !== expression
|| node.statement !== statement
? update(createWhileStatement(expression, statement), node)
: node;
}
// @api
function createForStatement(initializer, condition, incrementor, statement) {
var node = createBaseNode(240 /* ForStatement */);
node.initializer = initializer;
node.condition = condition;
node.incrementor = incrementor;
node.statement = asEmbeddedStatement(statement);
node.transformFlags |=
propagateChildFlags(node.initializer) |
propagateChildFlags(node.condition) |
propagateChildFlags(node.incrementor) |
propagateChildFlags(node.statement);
return node;
}
// @api
function updateForStatement(node, initializer, condition, incrementor, statement) {
return node.initializer !== initializer
|| node.condition !== condition
|| node.incrementor !== incrementor
|| node.statement !== statement
? update(createForStatement(initializer, condition, incrementor, statement), node)
: node;
}
// @api
function createForInStatement(initializer, expression, statement) {
var node = createBaseNode(241 /* ForInStatement */);
node.initializer = initializer;
node.expression = expression;
node.statement = asEmbeddedStatement(statement);
node.transformFlags |=
propagateChildFlags(node.initializer) |
propagateChildFlags(node.expression) |
propagateChildFlags(node.statement);
return node;
}
// @api
function updateForInStatement(node, initializer, expression, statement) {
return node.initializer !== initializer
|| node.expression !== expression
|| node.statement !== statement
? update(createForInStatement(initializer, expression, statement), node)
: node;
}
// @api
function createForOfStatement(awaitModifier, initializer, expression, statement) {
var node = createBaseNode(242 /* ForOfStatement */);
node.awaitModifier = awaitModifier;
node.initializer = initializer;
node.expression = parenthesizerRules().parenthesizeExpressionForDisallowedComma(expression);
node.statement = asEmbeddedStatement(statement);
node.transformFlags |=
propagateChildFlags(node.awaitModifier) |
propagateChildFlags(node.initializer) |
propagateChildFlags(node.expression) |
propagateChildFlags(node.statement) |
512 /* ContainsES2015 */;
if (awaitModifier)
node.transformFlags |= 64 /* ContainsES2018 */;
return node;
}
// @api
function updateForOfStatement(node, awaitModifier, initializer, expression, statement) {
return node.awaitModifier !== awaitModifier
|| node.initializer !== initializer
|| node.expression !== expression
|| node.statement !== statement
? update(createForOfStatement(awaitModifier, initializer, expression, statement), node)
: node;
}
// @api
function createContinueStatement(label) {
var node = createBaseNode(243 /* ContinueStatement */);
node.label = asName(label);
node.transformFlags |=
propagateChildFlags(node.label) |
2097152 /* ContainsHoistedDeclarationOrCompletion */;
return node;
}
// @api
function updateContinueStatement(node, label) {
return node.label !== label
? update(createContinueStatement(label), node)
: node;
}
// @api
function createBreakStatement(label) {
var node = createBaseNode(244 /* BreakStatement */);
node.label = asName(label);
node.transformFlags |=
propagateChildFlags(node.label) |
2097152 /* ContainsHoistedDeclarationOrCompletion */;
return node;
}
// @api
function updateBreakStatement(node, label) {
return node.label !== label
? update(createBreakStatement(label), node)
: node;
}
// @api
function createReturnStatement(expression) {
var node = createBaseNode(245 /* ReturnStatement */);
node.expression = expression;
// return in an ES2018 async generator must be awaited
node.transformFlags |=
propagateChildFlags(node.expression) |
64 /* ContainsES2018 */ |
2097152 /* ContainsHoistedDeclarationOrCompletion */;
return node;
}
// @api
function updateReturnStatement(node, expression) {
return node.expression !== expression
? update(createReturnStatement(expression), node)
: node;
}
// @api
function createWithStatement(expression, statement) {
var node = createBaseNode(246 /* WithStatement */);
node.expression = expression;
node.statement = asEmbeddedStatement(statement);
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildFlags(node.statement);
return node;
}
// @api
function updateWithStatement(node, expression, statement) {
return node.expression !== expression
|| node.statement !== statement
? update(createWithStatement(expression, statement), node)
: node;
}
// @api
function createSwitchStatement(expression, caseBlock) {
var node = createBaseNode(247 /* SwitchStatement */);
node.expression = parenthesizerRules().parenthesizeExpressionForDisallowedComma(expression);
node.caseBlock = caseBlock;
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildFlags(node.caseBlock);
return node;
}
// @api
function updateSwitchStatement(node, expression, caseBlock) {
return node.expression !== expression
|| node.caseBlock !== caseBlock
? update(createSwitchStatement(expression, caseBlock), node)
: node;
}
// @api
function createLabeledStatement(label, statement) {
var node = createBaseNode(248 /* LabeledStatement */);
node.label = asName(label);
node.statement = asEmbeddedStatement(statement);
node.transformFlags |=
propagateChildFlags(node.label) |
propagateChildFlags(node.statement);
return node;
}
// @api
function updateLabeledStatement(node, label, statement) {
return node.label !== label
|| node.statement !== statement
? update(createLabeledStatement(label, statement), node)
: node;
}
// @api
function createThrowStatement(expression) {
var node = createBaseNode(249 /* ThrowStatement */);
node.expression = expression;
node.transformFlags |= propagateChildFlags(node.expression);
return node;
}
// @api
function updateThrowStatement(node, expression) {
return node.expression !== expression
? update(createThrowStatement(expression), node)
: node;
}
// @api
function createTryStatement(tryBlock, catchClause, finallyBlock) {
var node = createBaseNode(250 /* TryStatement */);
node.tryBlock = tryBlock;
node.catchClause = catchClause;
node.finallyBlock = finallyBlock;
node.transformFlags |=
propagateChildFlags(node.tryBlock) |
propagateChildFlags(node.catchClause) |
propagateChildFlags(node.finallyBlock);
return node;
}
// @api
function updateTryStatement(node, tryBlock, catchClause, finallyBlock) {
return node.tryBlock !== tryBlock
|| node.catchClause !== catchClause
|| node.finallyBlock !== finallyBlock
? update(createTryStatement(tryBlock, catchClause, finallyBlock), node)
: node;
}
// @api
function createDebuggerStatement() {
return createBaseNode(251 /* DebuggerStatement */);
}
// @api
function createVariableDeclaration(name, exclamationToken, type, initializer) {
var node = createBaseVariableLikeDeclaration(252 /* VariableDeclaration */,
/*decorators*/ undefined,
/*modifiers*/ undefined, name, type, initializer && parenthesizerRules().parenthesizeExpressionForDisallowedComma(initializer));
node.exclamationToken = exclamationToken;
node.transformFlags |= propagateChildFlags(node.exclamationToken);
if (exclamationToken) {
node.transformFlags |= 1 /* ContainsTypeScript */;
}
return node;
}
// @api
function updateVariableDeclaration(node, name, exclamationToken, type, initializer) {
return node.name !== name
|| node.type !== type
|| node.exclamationToken !== exclamationToken
|| node.initializer !== initializer
? update(createVariableDeclaration(name, exclamationToken, type, initializer), node)
: node;
}
// @api
function createVariableDeclarationList(declarations, flags) {
if (flags === void 0) { flags = 0 /* None */; }
var node = createBaseNode(253 /* VariableDeclarationList */);
node.flags |= flags & 3 /* BlockScoped */;
node.declarations = createNodeArray(declarations);
node.transformFlags |=
propagateChildrenFlags(node.declarations) |
2097152 /* ContainsHoistedDeclarationOrCompletion */;
if (flags & 3 /* BlockScoped */) {
node.transformFlags |=
512 /* ContainsES2015 */ |
131072 /* ContainsBlockScopedBinding */;
}
return node;
}
// @api
function updateVariableDeclarationList(node, declarations) {
return node.declarations !== declarations
? update(createVariableDeclarationList(declarations, node.flags), node)
: node;
}
// @api
function createFunctionDeclaration(decorators, modifiers, asteriskToken, name, typeParameters, parameters, type, body) {
var node = createBaseFunctionLikeDeclaration(254 /* FunctionDeclaration */, decorators, modifiers, name, typeParameters, parameters, type, body);
node.asteriskToken = asteriskToken;
if (!node.body || ts.modifiersToFlags(node.modifiers) & 2 /* Ambient */) {
node.transformFlags = 1 /* ContainsTypeScript */;
}
else {
node.transformFlags |=
propagateChildFlags(node.asteriskToken) |
2097152 /* ContainsHoistedDeclarationOrCompletion */;
if (ts.modifiersToFlags(node.modifiers) & 256 /* Async */) {
if (node.asteriskToken) {
node.transformFlags |= 64 /* ContainsES2018 */;
}
else {
node.transformFlags |= 128 /* ContainsES2017 */;
}
}
else if (node.asteriskToken) {
node.transformFlags |= 1024 /* ContainsGenerator */;
}
}
return node;
}
// @api
function updateFunctionDeclaration(node, decorators, modifiers, asteriskToken, name, typeParameters, parameters, type, body) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.asteriskToken !== asteriskToken
|| node.name !== name
|| node.typeParameters !== typeParameters
|| node.parameters !== parameters
|| node.type !== type
|| node.body !== body
? updateBaseFunctionLikeDeclaration(createFunctionDeclaration(decorators, modifiers, asteriskToken, name, typeParameters, parameters, type, body), node)
: node;
}
// @api
function createClassDeclaration(decorators, modifiers, name, typeParameters, heritageClauses, members) {
var node = createBaseClassLikeDeclaration(255 /* ClassDeclaration */, decorators, modifiers, name, typeParameters, heritageClauses, members);
if (ts.modifiersToFlags(node.modifiers) & 2 /* Ambient */) {
node.transformFlags = 1 /* ContainsTypeScript */;
}
else {
node.transformFlags |= 512 /* ContainsES2015 */;
if (node.transformFlags & 4096 /* ContainsTypeScriptClassSyntax */) {
node.transformFlags |= 1 /* ContainsTypeScript */;
}
}
return node;
}
// @api
function updateClassDeclaration(node, decorators, modifiers, name, typeParameters, heritageClauses, members) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.name !== name
|| node.typeParameters !== typeParameters
|| node.heritageClauses !== heritageClauses
|| node.members !== members
? update(createClassDeclaration(decorators, modifiers, name, typeParameters, heritageClauses, members), node)
: node;
}
// @api
function createInterfaceDeclaration(decorators, modifiers, name, typeParameters, heritageClauses, members) {
var node = createBaseInterfaceOrClassLikeDeclaration(256 /* InterfaceDeclaration */, decorators, modifiers, name, typeParameters, heritageClauses);
node.members = createNodeArray(members);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateInterfaceDeclaration(node, decorators, modifiers, name, typeParameters, heritageClauses, members) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.name !== name
|| node.typeParameters !== typeParameters
|| node.heritageClauses !== heritageClauses
|| node.members !== members
? update(createInterfaceDeclaration(decorators, modifiers, name, typeParameters, heritageClauses, members), node)
: node;
}
// @api
function createTypeAliasDeclaration(decorators, modifiers, name, typeParameters, type) {
var node = createBaseGenericNamedDeclaration(257 /* TypeAliasDeclaration */, decorators, modifiers, name, typeParameters);
node.type = type;
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateTypeAliasDeclaration(node, decorators, modifiers, name, typeParameters, type) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.name !== name
|| node.typeParameters !== typeParameters
|| node.type !== type
? update(createTypeAliasDeclaration(decorators, modifiers, name, typeParameters, type), node)
: node;
}
// @api
function createEnumDeclaration(decorators, modifiers, name, members) {
var node = createBaseNamedDeclaration(258 /* EnumDeclaration */, decorators, modifiers, name);
node.members = createNodeArray(members);
node.transformFlags |=
propagateChildrenFlags(node.members) |
1 /* ContainsTypeScript */;
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // Enum declarations cannot contain `await`
return node;
}
// @api
function updateEnumDeclaration(node, decorators, modifiers, name, members) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.name !== name
|| node.members !== members
? update(createEnumDeclaration(decorators, modifiers, name, members), node)
: node;
}
// @api
function createModuleDeclaration(decorators, modifiers, name, body, flags) {
if (flags === void 0) { flags = 0 /* None */; }
var node = createBaseDeclaration(259 /* ModuleDeclaration */, decorators, modifiers);
node.flags |= flags & (16 /* Namespace */ | 4 /* NestedNamespace */ | 1024 /* GlobalAugmentation */);
node.name = name;
node.body = body;
if (ts.modifiersToFlags(node.modifiers) & 2 /* Ambient */) {
node.transformFlags = 1 /* ContainsTypeScript */;
}
else {
node.transformFlags |=
propagateChildFlags(node.name) |
propagateChildFlags(node.body) |
1 /* ContainsTypeScript */;
}
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // Module declarations cannot contain `await`.
return node;
}
// @api
function updateModuleDeclaration(node, decorators, modifiers, name, body) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.name !== name
|| node.body !== body
? update(createModuleDeclaration(decorators, modifiers, name, body, node.flags), node)
: node;
}
// @api
function createModuleBlock(statements) {
var node = createBaseNode(260 /* ModuleBlock */);
node.statements = createNodeArray(statements);
node.transformFlags |= propagateChildrenFlags(node.statements);
return node;
}
// @api
function updateModuleBlock(node, statements) {
return node.statements !== statements
? update(createModuleBlock(statements), node)
: node;
}
// @api
function createCaseBlock(clauses) {
var node = createBaseNode(261 /* CaseBlock */);
node.clauses = createNodeArray(clauses);
node.transformFlags |= propagateChildrenFlags(node.clauses);
return node;
}
// @api
function updateCaseBlock(node, clauses) {
return node.clauses !== clauses
? update(createCaseBlock(clauses), node)
: node;
}
// @api
function createNamespaceExportDeclaration(name) {
var node = createBaseNamedDeclaration(262 /* NamespaceExportDeclaration */,
/*decorators*/ undefined,
/*modifiers*/ undefined, name);
node.transformFlags = 1 /* ContainsTypeScript */;
return node;
}
// @api
function updateNamespaceExportDeclaration(node, name) {
return node.name !== name
? update(createNamespaceExportDeclaration(name), node)
: node;
}
// @api
function createImportEqualsDeclaration(decorators, modifiers, isTypeOnly, name, moduleReference) {
var node = createBaseNamedDeclaration(263 /* ImportEqualsDeclaration */, decorators, modifiers, name);
node.isTypeOnly = isTypeOnly;
node.moduleReference = moduleReference;
node.transformFlags |= propagateChildFlags(node.moduleReference);
if (!ts.isExternalModuleReference(node.moduleReference))
node.transformFlags |= 1 /* ContainsTypeScript */;
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // Import= declaration is always parsed in an Await context
return node;
}
// @api
function updateImportEqualsDeclaration(node, decorators, modifiers, isTypeOnly, name, moduleReference) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.isTypeOnly !== isTypeOnly
|| node.name !== name
|| node.moduleReference !== moduleReference
? update(createImportEqualsDeclaration(decorators, modifiers, isTypeOnly, name, moduleReference), node)
: node;
}
// @api
function createImportDeclaration(decorators, modifiers, importClause, moduleSpecifier) {
var node = createBaseDeclaration(264 /* ImportDeclaration */, decorators, modifiers);
node.importClause = importClause;
node.moduleSpecifier = moduleSpecifier;
node.transformFlags |=
propagateChildFlags(node.importClause) |
propagateChildFlags(node.moduleSpecifier);
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // always parsed in an Await context
return node;
}
// @api
function updateImportDeclaration(node, decorators, modifiers, importClause, moduleSpecifier) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.importClause !== importClause
|| node.moduleSpecifier !== moduleSpecifier
? update(createImportDeclaration(decorators, modifiers, importClause, moduleSpecifier), node)
: node;
}
// @api
function createImportClause(isTypeOnly, name, namedBindings) {
var node = createBaseNode(265 /* ImportClause */);
node.isTypeOnly = isTypeOnly;
node.name = name;
node.namedBindings = namedBindings;
node.transformFlags |=
propagateChildFlags(node.name) |
propagateChildFlags(node.namedBindings);
if (isTypeOnly) {
node.transformFlags |= 1 /* ContainsTypeScript */;
}
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // always parsed in an Await context
return node;
}
// @api
function updateImportClause(node, isTypeOnly, name, namedBindings) {
return node.isTypeOnly !== isTypeOnly
|| node.name !== name
|| node.namedBindings !== namedBindings
? update(createImportClause(isTypeOnly, name, namedBindings), node)
: node;
}
// @api
function createNamespaceImport(name) {
var node = createBaseNode(266 /* NamespaceImport */);
node.name = name;
node.transformFlags |= propagateChildFlags(node.name);
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // always parsed in an Await context
return node;
}
// @api
function updateNamespaceImport(node, name) {
return node.name !== name
? update(createNamespaceImport(name), node)
: node;
}
// @api
function createNamespaceExport(name) {
var node = createBaseNode(272 /* NamespaceExport */);
node.name = name;
node.transformFlags |=
propagateChildFlags(node.name) |
4 /* ContainsESNext */;
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // always parsed in an Await context
return node;
}
// @api
function updateNamespaceExport(node, name) {
return node.name !== name
? update(createNamespaceExport(name), node)
: node;
}
// @api
function createNamedImports(elements) {
var node = createBaseNode(267 /* NamedImports */);
node.elements = createNodeArray(elements);
node.transformFlags |= propagateChildrenFlags(node.elements);
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // always parsed in an Await context
return node;
}
// @api
function updateNamedImports(node, elements) {
return node.elements !== elements
? update(createNamedImports(elements), node)
: node;
}
// @api
function createImportSpecifier(propertyName, name) {
var node = createBaseNode(268 /* ImportSpecifier */);
node.propertyName = propertyName;
node.name = name;
node.transformFlags |=
propagateChildFlags(node.propertyName) |
propagateChildFlags(node.name);
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // always parsed in an Await context
return node;
}
// @api
function updateImportSpecifier(node, propertyName, name) {
return node.propertyName !== propertyName
|| node.name !== name
? update(createImportSpecifier(propertyName, name), node)
: node;
}
// @api
function createExportAssignment(decorators, modifiers, isExportEquals, expression) {
var node = createBaseDeclaration(269 /* ExportAssignment */, decorators, modifiers);
node.isExportEquals = isExportEquals;
node.expression = isExportEquals
? parenthesizerRules().parenthesizeRightSideOfBinary(63 /* EqualsToken */, /*leftSide*/ undefined, expression)
: parenthesizerRules().parenthesizeExpressionOfExportDefault(expression);
node.transformFlags |= propagateChildFlags(node.expression);
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // always parsed in an Await context
return node;
}
// @api
function updateExportAssignment(node, decorators, modifiers, expression) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.expression !== expression
? update(createExportAssignment(decorators, modifiers, node.isExportEquals, expression), node)
: node;
}
// @api
function createExportDeclaration(decorators, modifiers, isTypeOnly, exportClause, moduleSpecifier) {
var node = createBaseDeclaration(270 /* ExportDeclaration */, decorators, modifiers);
node.isTypeOnly = isTypeOnly;
node.exportClause = exportClause;
node.moduleSpecifier = moduleSpecifier;
node.transformFlags |=
propagateChildFlags(node.exportClause) |
propagateChildFlags(node.moduleSpecifier);
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // always parsed in an Await context
return node;
}
// @api
function updateExportDeclaration(node, decorators, modifiers, isTypeOnly, exportClause, moduleSpecifier) {
return node.decorators !== decorators
|| node.modifiers !== modifiers
|| node.isTypeOnly !== isTypeOnly
|| node.exportClause !== exportClause
|| node.moduleSpecifier !== moduleSpecifier
? update(createExportDeclaration(decorators, modifiers, isTypeOnly, exportClause, moduleSpecifier), node)
: node;
}
// @api
function createNamedExports(elements) {
var node = createBaseNode(271 /* NamedExports */);
node.elements = createNodeArray(elements);
node.transformFlags |= propagateChildrenFlags(node.elements);
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // always parsed in an Await context
return node;
}
// @api
function updateNamedExports(node, elements) {
return node.elements !== elements
? update(createNamedExports(elements), node)
: node;
}
// @api
function createExportSpecifier(propertyName, name) {
var node = createBaseNode(273 /* ExportSpecifier */);
node.propertyName = asName(propertyName);
node.name = asName(name);
node.transformFlags |=
propagateChildFlags(node.propertyName) |
propagateChildFlags(node.name);
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // always parsed in an Await context
return node;
}
// @api
function updateExportSpecifier(node, propertyName, name) {
return node.propertyName !== propertyName
|| node.name !== name
? update(createExportSpecifier(propertyName, name), node)
: node;
}
// @api
function createMissingDeclaration() {
var node = createBaseDeclaration(274 /* MissingDeclaration */,
/*decorators*/ undefined,
/*modifiers*/ undefined);
return node;
}
//
// Module references
//
// @api
function createExternalModuleReference(expression) {
var node = createBaseNode(275 /* ExternalModuleReference */);
node.expression = expression;
node.transformFlags |= propagateChildFlags(node.expression);
node.transformFlags &= ~16777216 /* ContainsPossibleTopLevelAwait */; // always parsed in an Await context
return node;
}
// @api
function updateExternalModuleReference(node, expression) {
return node.expression !== expression
? update(createExternalModuleReference(expression), node)
: node;
}
//
// JSDoc
//
// @api
// createJSDocAllType
// createJSDocUnknownType
function createJSDocPrimaryTypeWorker(kind) {
return createBaseNode(kind);
}
// @api
// createJSDocNonNullableType
// createJSDocNullableType
// createJSDocOptionalType
// createJSDocVariadicType
// createJSDocNamepathType
function createJSDocUnaryTypeWorker(kind, type) {
var node = createBaseNode(kind);
node.type = type;
return node;
}
// @api
// updateJSDocNonNullableType
// updateJSDocNullableType
// updateJSDocOptionalType
// updateJSDocVariadicType
// updateJSDocNamepathType
function updateJSDocUnaryTypeWorker(kind, node, type) {
return node.type !== type
? update(createJSDocUnaryTypeWorker(kind, type), node)
: node;
}
// @api
function createJSDocFunctionType(parameters, type) {
var node = createBaseSignatureDeclaration(312 /* JSDocFunctionType */,
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, parameters, type);
return node;
}
// @api
function updateJSDocFunctionType(node, parameters, type) {
return node.parameters !== parameters
|| node.type !== type
? update(createJSDocFunctionType(parameters, type), node)
: node;
}
// @api
function createJSDocTypeLiteral(propertyTags, isArrayType) {
if (isArrayType === void 0) { isArrayType = false; }
var node = createBaseNode(317 /* JSDocTypeLiteral */);
node.jsDocPropertyTags = asNodeArray(propertyTags);
node.isArrayType = isArrayType;
return node;
}
// @api
function updateJSDocTypeLiteral(node, propertyTags, isArrayType) {
return node.jsDocPropertyTags !== propertyTags
|| node.isArrayType !== isArrayType
? update(createJSDocTypeLiteral(propertyTags, isArrayType), node)
: node;
}
// @api
function createJSDocTypeExpression(type) {
var node = createBaseNode(304 /* JSDocTypeExpression */);
node.type = type;
return node;
}
// @api
function updateJSDocTypeExpression(node, type) {
return node.type !== type
? update(createJSDocTypeExpression(type), node)
: node;
}
// @api
function createJSDocSignature(typeParameters, parameters, type) {
var node = createBaseNode(318 /* JSDocSignature */);
node.typeParameters = asNodeArray(typeParameters);
node.parameters = createNodeArray(parameters);
node.type = type;
return node;
}
// @api
function updateJSDocSignature(node, typeParameters, parameters, type) {
return node.typeParameters !== typeParameters
|| node.parameters !== parameters
|| node.type !== type
? update(createJSDocSignature(typeParameters, parameters, type), node)
: node;
}
function getDefaultTagName(node) {
var defaultTagName = getDefaultTagNameForKind(node.kind);
return node.tagName.escapedText === ts.escapeLeadingUnderscores(defaultTagName)
? node.tagName
: createIdentifier(defaultTagName);
}
// @api
function createBaseJSDocTag(kind, tagName, comment) {
var node = createBaseNode(kind);
node.tagName = tagName;
node.comment = comment;
return node;
}
// @api
function createJSDocTemplateTag(tagName, constraint, typeParameters, comment) {
var node = createBaseJSDocTag(339 /* JSDocTemplateTag */, tagName !== null && tagName !== void 0 ? tagName : createIdentifier("template"), comment);
node.constraint = constraint;
node.typeParameters = createNodeArray(typeParameters);
return node;
}
// @api
function updateJSDocTemplateTag(node, tagName, constraint, typeParameters, comment) {
if (tagName === void 0) { tagName = getDefaultTagName(node); }
return node.tagName !== tagName
|| node.constraint !== constraint
|| node.typeParameters !== typeParameters
|| node.comment !== comment
? update(createJSDocTemplateTag(tagName, constraint, typeParameters, comment), node)
: node;
}
// @api
function createJSDocTypedefTag(tagName, typeExpression, fullName, comment) {
var node = createBaseJSDocTag(340 /* JSDocTypedefTag */, tagName !== null && tagName !== void 0 ? tagName : createIdentifier("typedef"), comment);
node.typeExpression = typeExpression;
node.fullName = fullName;
node.name = ts.getJSDocTypeAliasName(fullName);
return node;
}
// @api
function updateJSDocTypedefTag(node, tagName, typeExpression, fullName, comment) {
if (tagName === void 0) { tagName = getDefaultTagName(node); }
return node.tagName !== tagName
|| node.typeExpression !== typeExpression
|| node.fullName !== fullName
|| node.comment !== comment
? update(createJSDocTypedefTag(tagName, typeExpression, fullName, comment), node)
: node;
}
// @api
function createJSDocParameterTag(tagName, name, isBracketed, typeExpression, isNameFirst, comment) {
var node = createBaseJSDocTag(335 /* JSDocParameterTag */, tagName !== null && tagName !== void 0 ? tagName : createIdentifier("param"), comment);
node.typeExpression = typeExpression;
node.name = name;
node.isNameFirst = !!isNameFirst;
node.isBracketed = isBracketed;
return node;
}
// @api
function updateJSDocParameterTag(node, tagName, name, isBracketed, typeExpression, isNameFirst, comment) {
if (tagName === void 0) { tagName = getDefaultTagName(node); }
return node.tagName !== tagName
|| node.name !== name
|| node.isBracketed !== isBracketed
|| node.typeExpression !== typeExpression
|| node.isNameFirst !== isNameFirst
|| node.comment !== comment
? update(createJSDocParameterTag(tagName, name, isBracketed, typeExpression, isNameFirst, comment), node)
: node;
}
// @api
function createJSDocPropertyTag(tagName, name, isBracketed, typeExpression, isNameFirst, comment) {
var node = createBaseJSDocTag(342 /* JSDocPropertyTag */, tagName !== null && tagName !== void 0 ? tagName : createIdentifier("prop"), comment);
node.typeExpression = typeExpression;
node.name = name;
node.isNameFirst = !!isNameFirst;
node.isBracketed = isBracketed;
return node;
}
// @api
function updateJSDocPropertyTag(node, tagName, name, isBracketed, typeExpression, isNameFirst, comment) {
if (tagName === void 0) { tagName = getDefaultTagName(node); }
return node.tagName !== tagName
|| node.name !== name
|| node.isBracketed !== isBracketed
|| node.typeExpression !== typeExpression
|| node.isNameFirst !== isNameFirst
|| node.comment !== comment
? update(createJSDocPropertyTag(tagName, name, isBracketed, typeExpression, isNameFirst, comment), node)
: node;
}
// @api
function createJSDocCallbackTag(tagName, typeExpression, fullName, comment) {
var node = createBaseJSDocTag(333 /* JSDocCallbackTag */, tagName !== null && tagName !== void 0 ? tagName : createIdentifier("callback"), comment);
node.typeExpression = typeExpression;
node.fullName = fullName;
node.name = ts.getJSDocTypeAliasName(fullName);
return node;
}
// @api
function updateJSDocCallbackTag(node, tagName, typeExpression, fullName, comment) {
if (tagName === void 0) { tagName = getDefaultTagName(node); }
return node.tagName !== tagName
|| node.typeExpression !== typeExpression
|| node.fullName !== fullName
|| node.comment !== comment
? update(createJSDocCallbackTag(tagName, typeExpression, fullName, comment), node)
: node;
}
// @api
function createJSDocAugmentsTag(tagName, className, comment) {
var node = createBaseJSDocTag(323 /* JSDocAugmentsTag */, tagName !== null && tagName !== void 0 ? tagName : createIdentifier("augments"), comment);
node.class = className;
return node;
}
// @api
function updateJSDocAugmentsTag(node, tagName, className, comment) {
if (tagName === void 0) { tagName = getDefaultTagName(node); }
return node.tagName !== tagName
|| node.class !== className
|| node.comment !== comment
? update(createJSDocAugmentsTag(tagName, className, comment), node)
: node;
}
// @api
function createJSDocImplementsTag(tagName, className, comment) {
var node = createBaseJSDocTag(324 /* JSDocImplementsTag */, tagName !== null && tagName !== void 0 ? tagName : createIdentifier("implements"), comment);
node.class = className;
return node;
}
// @api
function createJSDocSeeTag(tagName, name, comment) {
var node = createBaseJSDocTag(341 /* JSDocSeeTag */, tagName !== null && tagName !== void 0 ? tagName : createIdentifier("see"), comment);
node.name = name;
return node;
}
// @api
function updateJSDocSeeTag(node, tagName, name, comment) {
return node.tagName !== tagName
|| node.name !== name
|| node.comment !== comment
? update(createJSDocSeeTag(tagName, name, comment), node)
: node;
}
// @api
function createJSDocNameReference(name) {
var node = createBaseNode(305 /* JSDocNameReference */);
node.name = name;
return node;
}
// @api
function updateJSDocNameReference(node, name) {
return node.name !== name
? update(createJSDocNameReference(name), node)
: node;
}
// @api
function createJSDocMemberName(left, right) {
var node = createBaseNode(306 /* JSDocMemberName */);
node.left = left;
node.right = right;
node.transformFlags |=
propagateChildFlags(node.left) |
propagateChildFlags(node.right);
return node;
}
// @api
function updateJSDocMemberName(node, left, right) {
return node.left !== left
|| node.right !== right
? update(createJSDocMemberName(left, right), node)
: node;
}
// @api
function createJSDocLink(name, text) {
var node = createBaseNode(319 /* JSDocLink */);
node.name = name;
node.text = text;
return node;
}
// @api
function updateJSDocLink(node, name, text) {
return node.name !== name
? update(createJSDocLink(name, text), node)
: node;
}
// @api
function createJSDocLinkCode(name, text) {
var node = createBaseNode(320 /* JSDocLinkCode */);
node.name = name;
node.text = text;
return node;
}
// @api
function updateJSDocLinkCode(node, name, text) {
return node.name !== name
? update(createJSDocLinkCode(name, text), node)
: node;
}
// @api
function createJSDocLinkPlain(name, text) {
var node = createBaseNode(321 /* JSDocLinkPlain */);
node.name = name;
node.text = text;
return node;
}
// @api
function updateJSDocLinkPlain(node, name, text) {
return node.name !== name
? update(createJSDocLinkPlain(name, text), node)
: node;
}
// @api
function updateJSDocImplementsTag(node, tagName, className, comment) {
if (tagName === void 0) { tagName = getDefaultTagName(node); }
return node.tagName !== tagName
|| node.class !== className
|| node.comment !== comment
? update(createJSDocImplementsTag(tagName, className, comment), node)
: node;
}
// @api
// createJSDocAuthorTag
// createJSDocClassTag
// createJSDocPublicTag
// createJSDocPrivateTag
// createJSDocProtectedTag
// createJSDocReadonlyTag
// createJSDocDeprecatedTag
function createJSDocSimpleTagWorker(kind, tagName, comment) {
var node = createBaseJSDocTag(kind, tagName !== null && tagName !== void 0 ? tagName : createIdentifier(getDefaultTagNameForKind(kind)), comment);
return node;
}
// @api
// updateJSDocAuthorTag
// updateJSDocClassTag
// updateJSDocPublicTag
// updateJSDocPrivateTag
// updateJSDocProtectedTag
// updateJSDocReadonlyTag
// updateJSDocDeprecatedTag
function updateJSDocSimpleTagWorker(kind, node, tagName, comment) {
if (tagName === void 0) { tagName = getDefaultTagName(node); }
return node.tagName !== tagName
|| node.comment !== comment
? update(createJSDocSimpleTagWorker(kind, tagName, comment), node) :
node;
}
// @api
// createJSDocTypeTag
// createJSDocReturnTag
// createJSDocThisTag
// createJSDocEnumTag
function createJSDocTypeLikeTagWorker(kind, tagName, typeExpression, comment) {
var node = createBaseJSDocTag(kind, tagName !== null && tagName !== void 0 ? tagName : createIdentifier(getDefaultTagNameForKind(kind)), comment);
node.typeExpression = typeExpression;
return node;
}
// @api
// updateJSDocTypeTag
// updateJSDocReturnTag
// updateJSDocThisTag
// updateJSDocEnumTag
function updateJSDocTypeLikeTagWorker(kind, node, tagName, typeExpression, comment) {
if (tagName === void 0) { tagName = getDefaultTagName(node); }
return node.tagName !== tagName
|| node.typeExpression !== typeExpression
|| node.comment !== comment
? update(createJSDocTypeLikeTagWorker(kind, tagName, typeExpression, comment), node)
: node;
}
// @api
function createJSDocUnknownTag(tagName, comment) {
var node = createBaseJSDocTag(322 /* JSDocTag */, tagName, comment);
return node;
}
// @api
function updateJSDocUnknownTag(node, tagName, comment) {
return node.tagName !== tagName
|| node.comment !== comment
? update(createJSDocUnknownTag(tagName, comment), node)
: node;
}
// @api
function createJSDocText(text) {
var node = createBaseNode(316 /* JSDocText */);
node.text = text;
return node;
}
// @api
function updateJSDocText(node, text) {
return node.text !== text
? update(createJSDocText(text), node)
: node;
}
// @api
function createJSDocComment(comment, tags) {
var node = createBaseNode(315 /* JSDocComment */);
node.comment = comment;
node.tags = asNodeArray(tags);
return node;
}
// @api
function updateJSDocComment(node, comment, tags) {
return node.comment !== comment
|| node.tags !== tags
? update(createJSDocComment(comment, tags), node)
: node;
}
//
// JSX
//
// @api
function createJsxElement(openingElement, children, closingElement) {
var node = createBaseNode(276 /* JsxElement */);
node.openingElement = openingElement;
node.children = createNodeArray(children);
node.closingElement = closingElement;
node.transformFlags |=
propagateChildFlags(node.openingElement) |
propagateChildrenFlags(node.children) |
propagateChildFlags(node.closingElement) |
2 /* ContainsJsx */;
return node;
}
// @api
function updateJsxElement(node, openingElement, children, closingElement) {
return node.openingElement !== openingElement
|| node.children !== children
|| node.closingElement !== closingElement
? update(createJsxElement(openingElement, children, closingElement), node)
: node;
}
// @api
function createJsxSelfClosingElement(tagName, typeArguments, attributes) {
var node = createBaseNode(277 /* JsxSelfClosingElement */);
node.tagName = tagName;
node.typeArguments = asNodeArray(typeArguments);
node.attributes = attributes;
node.transformFlags |=
propagateChildFlags(node.tagName) |
propagateChildrenFlags(node.typeArguments) |
propagateChildFlags(node.attributes) |
2 /* ContainsJsx */;
if (node.typeArguments) {
node.transformFlags |= 1 /* ContainsTypeScript */;
}
return node;
}
// @api
function updateJsxSelfClosingElement(node, tagName, typeArguments, attributes) {
return node.tagName !== tagName
|| node.typeArguments !== typeArguments
|| node.attributes !== attributes
? update(createJsxSelfClosingElement(tagName, typeArguments, attributes), node)
: node;
}
// @api
function createJsxOpeningElement(tagName, typeArguments, attributes) {
var node = createBaseNode(278 /* JsxOpeningElement */);
node.tagName = tagName;
node.typeArguments = asNodeArray(typeArguments);
node.attributes = attributes;
node.transformFlags |=
propagateChildFlags(node.tagName) |
propagateChildrenFlags(node.typeArguments) |
propagateChildFlags(node.attributes) |
2 /* ContainsJsx */;
if (typeArguments) {
node.transformFlags |= 1 /* ContainsTypeScript */;
}
return node;
}
// @api
function updateJsxOpeningElement(node, tagName, typeArguments, attributes) {
return node.tagName !== tagName
|| node.typeArguments !== typeArguments
|| node.attributes !== attributes
? update(createJsxOpeningElement(tagName, typeArguments, attributes), node)
: node;
}
// @api
function createJsxClosingElement(tagName) {
var node = createBaseNode(279 /* JsxClosingElement */);
node.tagName = tagName;
node.transformFlags |=
propagateChildFlags(node.tagName) |
2 /* ContainsJsx */;
return node;
}
// @api
function updateJsxClosingElement(node, tagName) {
return node.tagName !== tagName
? update(createJsxClosingElement(tagName), node)
: node;
}
// @api
function createJsxFragment(openingFragment, children, closingFragment) {
var node = createBaseNode(280 /* JsxFragment */);
node.openingFragment = openingFragment;
node.children = createNodeArray(children);
node.closingFragment = closingFragment;
node.transformFlags |=
propagateChildFlags(node.openingFragment) |
propagateChildrenFlags(node.children) |
propagateChildFlags(node.closingFragment) |
2 /* ContainsJsx */;
return node;
}
// @api
function updateJsxFragment(node, openingFragment, children, closingFragment) {
return node.openingFragment !== openingFragment
|| node.children !== children
|| node.closingFragment !== closingFragment
? update(createJsxFragment(openingFragment, children, closingFragment), node)
: node;
}
// @api
function createJsxText(text, containsOnlyTriviaWhiteSpaces) {
var node = createBaseNode(11 /* JsxText */);
node.text = text;
node.containsOnlyTriviaWhiteSpaces = !!containsOnlyTriviaWhiteSpaces;
node.transformFlags |= 2 /* ContainsJsx */;
return node;
}
// @api
function updateJsxText(node, text, containsOnlyTriviaWhiteSpaces) {
return node.text !== text
|| node.containsOnlyTriviaWhiteSpaces !== containsOnlyTriviaWhiteSpaces
? update(createJsxText(text, containsOnlyTriviaWhiteSpaces), node)
: node;
}
// @api
function createJsxOpeningFragment() {
var node = createBaseNode(281 /* JsxOpeningFragment */);
node.transformFlags |= 2 /* ContainsJsx */;
return node;
}
// @api
function createJsxJsxClosingFragment() {
var node = createBaseNode(282 /* JsxClosingFragment */);
node.transformFlags |= 2 /* ContainsJsx */;
return node;
}
// @api
function createJsxAttribute(name, initializer) {
var node = createBaseNode(283 /* JsxAttribute */);
node.name = name;
node.initializer = initializer;
node.transformFlags |=
propagateChildFlags(node.name) |
propagateChildFlags(node.initializer) |
2 /* ContainsJsx */;
return node;
}
// @api
function updateJsxAttribute(node, name, initializer) {
return node.name !== name
|| node.initializer !== initializer
? update(createJsxAttribute(name, initializer), node)
: node;
}
// @api
function createJsxAttributes(properties) {
var node = createBaseNode(284 /* JsxAttributes */);
node.properties = createNodeArray(properties);
node.transformFlags |=
propagateChildrenFlags(node.properties) |
2 /* ContainsJsx */;
return node;
}
// @api
function updateJsxAttributes(node, properties) {
return node.properties !== properties
? update(createJsxAttributes(properties), node)
: node;
}
// @api
function createJsxSpreadAttribute(expression) {
var node = createBaseNode(285 /* JsxSpreadAttribute */);
node.expression = expression;
node.transformFlags |=
propagateChildFlags(node.expression) |
2 /* ContainsJsx */;
return node;
}
// @api
function updateJsxSpreadAttribute(node, expression) {
return node.expression !== expression
? update(createJsxSpreadAttribute(expression), node)
: node;
}
// @api
function createJsxExpression(dotDotDotToken, expression) {
var node = createBaseNode(286 /* JsxExpression */);
node.dotDotDotToken = dotDotDotToken;
node.expression = expression;
node.transformFlags |=
propagateChildFlags(node.dotDotDotToken) |
propagateChildFlags(node.expression) |
2 /* ContainsJsx */;
return node;
}
// @api
function updateJsxExpression(node, expression) {
return node.expression !== expression
? update(createJsxExpression(node.dotDotDotToken, expression), node)
: node;
}
//
// Clauses
//
// @api
function createCaseClause(expression, statements) {
var node = createBaseNode(287 /* CaseClause */);
node.expression = parenthesizerRules().parenthesizeExpressionForDisallowedComma(expression);
node.statements = createNodeArray(statements);
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildrenFlags(node.statements);
return node;
}
// @api
function updateCaseClause(node, expression, statements) {
return node.expression !== expression
|| node.statements !== statements
? update(createCaseClause(expression, statements), node)
: node;
}
// @api
function createDefaultClause(statements) {
var node = createBaseNode(288 /* DefaultClause */);
node.statements = createNodeArray(statements);
node.transformFlags = propagateChildrenFlags(node.statements);
return node;
}
// @api
function updateDefaultClause(node, statements) {
return node.statements !== statements
? update(createDefaultClause(statements), node)
: node;
}
// @api
function createHeritageClause(token, types) {
var node = createBaseNode(289 /* HeritageClause */);
node.token = token;
node.types = createNodeArray(types);
node.transformFlags |= propagateChildrenFlags(node.types);
switch (token) {
case 94 /* ExtendsKeyword */:
node.transformFlags |= 512 /* ContainsES2015 */;
break;
case 117 /* ImplementsKeyword */:
node.transformFlags |= 1 /* ContainsTypeScript */;
break;
default:
return ts.Debug.assertNever(token);
}
return node;
}
// @api
function updateHeritageClause(node, types) {
return node.types !== types
? update(createHeritageClause(node.token, types), node)
: node;
}
// @api
function createCatchClause(variableDeclaration, block) {
var node = createBaseNode(290 /* CatchClause */);
variableDeclaration = !ts.isString(variableDeclaration) ? variableDeclaration : createVariableDeclaration(variableDeclaration,
/*exclamationToken*/ undefined,
/*type*/ undefined,
/*initializer*/ undefined);
node.variableDeclaration = variableDeclaration;
node.block = block;
node.transformFlags |=
propagateChildFlags(node.variableDeclaration) |
propagateChildFlags(node.block);
if (!variableDeclaration)
node.transformFlags |= 32 /* ContainsES2019 */;
return node;
}
// @api
function updateCatchClause(node, variableDeclaration, block) {
return node.variableDeclaration !== variableDeclaration
|| node.block !== block
? update(createCatchClause(variableDeclaration, block), node)
: node;
}
//
// Property assignments
//
// @api
function createPropertyAssignment(name, initializer) {
var node = createBaseNamedDeclaration(291 /* PropertyAssignment */,
/*decorators*/ undefined,
/*modifiers*/ undefined, name);
node.initializer = parenthesizerRules().parenthesizeExpressionForDisallowedComma(initializer);
node.transformFlags |=
propagateChildFlags(node.name) |
propagateChildFlags(node.initializer);
return node;
}
function finishUpdatePropertyAssignment(updated, original) {
// copy children used only for error reporting
if (original.decorators)
updated.decorators = original.decorators;
if (original.modifiers)
updated.modifiers = original.modifiers;
if (original.questionToken)
updated.questionToken = original.questionToken;
if (original.exclamationToken)
updated.exclamationToken = original.exclamationToken;
return update(updated, original);
}
// @api
function updatePropertyAssignment(node, name, initializer) {
return node.name !== name
|| node.initializer !== initializer
? finishUpdatePropertyAssignment(createPropertyAssignment(name, initializer), node)
: node;
}
// @api
function createShorthandPropertyAssignment(name, objectAssignmentInitializer) {
var node = createBaseNamedDeclaration(292 /* ShorthandPropertyAssignment */,
/*decorators*/ undefined,
/*modifiers*/ undefined, name);
node.objectAssignmentInitializer = objectAssignmentInitializer && parenthesizerRules().parenthesizeExpressionForDisallowedComma(objectAssignmentInitializer);
node.transformFlags |=
propagateChildFlags(node.objectAssignmentInitializer) |
512 /* ContainsES2015 */;
return node;
}
function finishUpdateShorthandPropertyAssignment(updated, original) {
// copy children used only for error reporting
if (original.decorators)
updated.decorators = original.decorators;
if (original.modifiers)
updated.modifiers = original.modifiers;
if (original.equalsToken)
updated.equalsToken = original.equalsToken;
if (original.questionToken)
updated.questionToken = original.questionToken;
if (original.exclamationToken)
updated.exclamationToken = original.exclamationToken;
return update(updated, original);
}
// @api
function updateShorthandPropertyAssignment(node, name, objectAssignmentInitializer) {
return node.name !== name
|| node.objectAssignmentInitializer !== objectAssignmentInitializer
? finishUpdateShorthandPropertyAssignment(createShorthandPropertyAssignment(name, objectAssignmentInitializer), node)
: node;
}
// @api
function createSpreadAssignment(expression) {
var node = createBaseNode(293 /* SpreadAssignment */);
node.expression = parenthesizerRules().parenthesizeExpressionForDisallowedComma(expression);
node.transformFlags |=
propagateChildFlags(node.expression) |
64 /* ContainsES2018 */ |
32768 /* ContainsObjectRestOrSpread */;
return node;
}
// @api
function updateSpreadAssignment(node, expression) {
return node.expression !== expression
? update(createSpreadAssignment(expression), node)
: node;
}
//
// Enum
//
// @api
function createEnumMember(name, initializer) {
var node = createBaseNode(294 /* EnumMember */);
node.name = asName(name);
node.initializer = initializer && parenthesizerRules().parenthesizeExpressionForDisallowedComma(initializer);
node.transformFlags |=
propagateChildFlags(node.name) |
propagateChildFlags(node.initializer) |
1 /* ContainsTypeScript */;
return node;
}
// @api
function updateEnumMember(node, name, initializer) {
return node.name !== name
|| node.initializer !== initializer
? update(createEnumMember(name, initializer), node)
: node;
}
//
// Top-level nodes
//
// @api
function createSourceFile(statements, endOfFileToken, flags) {
var node = baseFactory.createBaseSourceFileNode(300 /* SourceFile */);
node.statements = createNodeArray(statements);
node.endOfFileToken = endOfFileToken;
node.flags |= flags;
node.fileName = "";
node.text = "";
node.languageVersion = 0;
node.languageVariant = 0;
node.scriptKind = 0;
node.isDeclarationFile = false;
node.hasNoDefaultLib = false;
node.transformFlags |=
propagateChildrenFlags(node.statements) |
propagateChildFlags(node.endOfFileToken);
return node;
}
function cloneSourceFileWithChanges(source, statements, isDeclarationFile, referencedFiles, typeReferences, hasNoDefaultLib, libReferences) {
var node = baseFactory.createBaseSourceFileNode(300 /* SourceFile */);
for (var p in source) {
if (p === "emitNode" || ts.hasProperty(node, p) || !ts.hasProperty(source, p))
continue;
node[p] = source[p];
}
node.flags |= source.flags;
node.statements = createNodeArray(statements);
node.endOfFileToken = source.endOfFileToken;
node.isDeclarationFile = isDeclarationFile;
node.referencedFiles = referencedFiles;
node.typeReferenceDirectives = typeReferences;
node.hasNoDefaultLib = hasNoDefaultLib;
node.libReferenceDirectives = libReferences;
node.transformFlags =
propagateChildrenFlags(node.statements) |
propagateChildFlags(node.endOfFileToken);
return node;
}
// @api
function updateSourceFile(node, statements, isDeclarationFile, referencedFiles, typeReferenceDirectives, hasNoDefaultLib, libReferenceDirectives) {
if (isDeclarationFile === void 0) { isDeclarationFile = node.isDeclarationFile; }
if (referencedFiles === void 0) { referencedFiles = node.referencedFiles; }
if (typeReferenceDirectives === void 0) { typeReferenceDirectives = node.typeReferenceDirectives; }
if (hasNoDefaultLib === void 0) { hasNoDefaultLib = node.hasNoDefaultLib; }
if (libReferenceDirectives === void 0) { libReferenceDirectives = node.libReferenceDirectives; }
return node.statements !== statements
|| node.isDeclarationFile !== isDeclarationFile
|| node.referencedFiles !== referencedFiles
|| node.typeReferenceDirectives !== typeReferenceDirectives
|| node.hasNoDefaultLib !== hasNoDefaultLib
|| node.libReferenceDirectives !== libReferenceDirectives
? update(cloneSourceFileWithChanges(node, statements, isDeclarationFile, referencedFiles, typeReferenceDirectives, hasNoDefaultLib, libReferenceDirectives), node)
: node;
}
// @api
function createBundle(sourceFiles, prepends) {
if (prepends === void 0) { prepends = ts.emptyArray; }
var node = createBaseNode(301 /* Bundle */);
node.prepends = prepends;
node.sourceFiles = sourceFiles;
return node;
}
// @api
function updateBundle(node, sourceFiles, prepends) {
if (prepends === void 0) { prepends = ts.emptyArray; }
return node.sourceFiles !== sourceFiles
|| node.prepends !== prepends
? update(createBundle(sourceFiles, prepends), node)
: node;
}
// @api
function createUnparsedSource(prologues, syntheticReferences, texts) {
var node = createBaseNode(302 /* UnparsedSource */);
node.prologues = prologues;
node.syntheticReferences = syntheticReferences;
node.texts = texts;
node.fileName = "";
node.text = "";
node.referencedFiles = ts.emptyArray;
node.libReferenceDirectives = ts.emptyArray;
node.getLineAndCharacterOfPosition = function (pos) { return ts.getLineAndCharacterOfPosition(node, pos); };
return node;
}
function createBaseUnparsedNode(kind, data) {
var node = createBaseNode(kind);
node.data = data;
return node;
}
// @api
function createUnparsedPrologue(data) {
return createBaseUnparsedNode(295 /* UnparsedPrologue */, data);
}
// @api
function createUnparsedPrepend(data, texts) {
var node = createBaseUnparsedNode(296 /* UnparsedPrepend */, data);
node.texts = texts;
return node;
}
// @api
function createUnparsedTextLike(data, internal) {
return createBaseUnparsedNode(internal ? 298 /* UnparsedInternalText */ : 297 /* UnparsedText */, data);
}
// @api
function createUnparsedSyntheticReference(section) {
var node = createBaseNode(299 /* UnparsedSyntheticReference */);
node.data = section.data;
node.section = section;
return node;
}
// @api
function createInputFiles() {
var node = createBaseNode(303 /* InputFiles */);
node.javascriptText = "";
node.declarationText = "";
return node;
}
//
// Synthetic Nodes (used by checker)
//
// @api
function createSyntheticExpression(type, isSpread, tupleNameSource) {
if (isSpread === void 0) { isSpread = false; }
var node = createBaseNode(230 /* SyntheticExpression */);
node.type = type;
node.isSpread = isSpread;
node.tupleNameSource = tupleNameSource;
return node;
}
// @api
function createSyntaxList(children) {
var node = createBaseNode(343 /* SyntaxList */);
node._children = children;
return node;
}
//
// Transformation nodes
//
/**
* Creates a synthetic statement to act as a placeholder for a not-emitted statement in
* order to preserve comments.
*
* @param original The original statement.
*/
// @api
function createNotEmittedStatement(original) {
var node = createBaseNode(344 /* NotEmittedStatement */);
node.original = original;
ts.setTextRange(node, original);
return node;
}
/**
* Creates a synthetic expression to act as a placeholder for a not-emitted expression in
* order to preserve comments or sourcemap positions.
*
* @param expression The inner expression to emit.
* @param original The original outer expression.
*/
// @api
function createPartiallyEmittedExpression(expression, original) {
var node = createBaseNode(345 /* PartiallyEmittedExpression */);
node.expression = expression;
node.original = original;
node.transformFlags |=
propagateChildFlags(node.expression) |
1 /* ContainsTypeScript */;
ts.setTextRange(node, original);
return node;
}
// @api
function updatePartiallyEmittedExpression(node, expression) {
return node.expression !== expression
? update(createPartiallyEmittedExpression(expression, node.original), node)
: node;
}
function flattenCommaElements(node) {
if (ts.nodeIsSynthesized(node) && !ts.isParseTreeNode(node) && !node.original && !node.emitNode && !node.id) {
if (ts.isCommaListExpression(node)) {
return node.elements;
}
if (ts.isBinaryExpression(node) && ts.isCommaToken(node.operatorToken)) {
return [node.left, node.right];
}
}
return node;
}
// @api
function createCommaListExpression(elements) {
var node = createBaseNode(346 /* CommaListExpression */);
node.elements = createNodeArray(ts.sameFlatMap(elements, flattenCommaElements));
node.transformFlags |= propagateChildrenFlags(node.elements);
return node;
}
// @api
function updateCommaListExpression(node, elements) {
return node.elements !== elements
? update(createCommaListExpression(elements), node)
: node;
}
/**
* Creates a synthetic element to act as a placeholder for the end of an emitted declaration in
* order to properly emit exports.
*/
// @api
function createEndOfDeclarationMarker(original) {
var node = createBaseNode(348 /* EndOfDeclarationMarker */);
node.emitNode = {};
node.original = original;
return node;
}
/**
* Creates a synthetic element to act as a placeholder for the beginning of a merged declaration in
* order to properly emit exports.
*/
// @api
function createMergeDeclarationMarker(original) {
var node = createBaseNode(347 /* MergeDeclarationMarker */);
node.emitNode = {};
node.original = original;
return node;
}
// @api
function createSyntheticReferenceExpression(expression, thisArg) {
var node = createBaseNode(349 /* SyntheticReferenceExpression */);
node.expression = expression;
node.thisArg = thisArg;
node.transformFlags |=
propagateChildFlags(node.expression) |
propagateChildFlags(node.thisArg);
return node;
}
// @api
function updateSyntheticReferenceExpression(node, expression, thisArg) {
return node.expression !== expression
|| node.thisArg !== thisArg
? update(createSyntheticReferenceExpression(expression, thisArg), node)
: node;
}
function cloneNode(node) {
// We don't use "clone" from core.ts here, as we need to preserve the prototype chain of
// the original node. We also need to exclude specific properties and only include own-
// properties (to skip members already defined on the shared prototype).
if (node === undefined) {
return node;
}
var clone = ts.isSourceFile(node) ? baseFactory.createBaseSourceFileNode(300 /* SourceFile */) :
ts.isIdentifier(node) ? baseFactory.createBaseIdentifierNode(79 /* Identifier */) :
ts.isPrivateIdentifier(node) ? baseFactory.createBasePrivateIdentifierNode(80 /* PrivateIdentifier */) :
!ts.isNodeKind(node.kind) ? baseFactory.createBaseTokenNode(node.kind) :
baseFactory.createBaseNode(node.kind);
clone.flags |= (node.flags & ~8 /* Synthesized */);
clone.transformFlags = node.transformFlags;
setOriginalNode(clone, node);
for (var key in node) {
if (clone.hasOwnProperty(key) || !node.hasOwnProperty(key)) {
continue;
}
clone[key] = node[key];
}
return clone;
}
function createImmediatelyInvokedFunctionExpression(statements, param, paramValue) {
return createCallExpression(createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined,
/*parameters*/ param ? [param] : [],
/*type*/ undefined, createBlock(statements, /*multiLine*/ true)),
/*typeArguments*/ undefined,
/*argumentsArray*/ paramValue ? [paramValue] : []);
}
function createImmediatelyInvokedArrowFunction(statements, param, paramValue) {
return createCallExpression(createArrowFunction(
/*modifiers*/ undefined,
/*typeParameters*/ undefined,
/*parameters*/ param ? [param] : [],
/*type*/ undefined,
/*equalsGreaterThanToken*/ undefined, createBlock(statements, /*multiLine*/ true)),
/*typeArguments*/ undefined,
/*argumentsArray*/ paramValue ? [paramValue] : []);
}
function createVoidZero() {
return createVoidExpression(createNumericLiteral("0"));
}
function createExportDefault(expression) {
return createExportAssignment(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isExportEquals*/ false, expression);
}
function createExternalModuleExport(exportName) {
return createExportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, createNamedExports([
createExportSpecifier(/*propertyName*/ undefined, exportName)
]));
}
//
// Utilities
//
function createTypeCheck(value, tag) {
return tag === "undefined"
? factory.createStrictEquality(value, createVoidZero())
: factory.createStrictEquality(createTypeOfExpression(value), createStringLiteral(tag));
}
function createMethodCall(object, methodName, argumentsList) {
// Preserve the optionality of `object`.
if (ts.isCallChain(object)) {
return createCallChain(createPropertyAccessChain(object, /*questionDotToken*/ undefined, methodName),
/*questionDotToken*/ undefined,
/*typeArguments*/ undefined, argumentsList);
}
return createCallExpression(createPropertyAccessExpression(object, methodName),
/*typeArguments*/ undefined, argumentsList);
}
function createFunctionBindCall(target, thisArg, argumentsList) {
return createMethodCall(target, "bind", __spreadArray([thisArg], argumentsList, true));
}
function createFunctionCallCall(target, thisArg, argumentsList) {
return createMethodCall(target, "call", __spreadArray([thisArg], argumentsList, true));
}
function createFunctionApplyCall(target, thisArg, argumentsExpression) {
return createMethodCall(target, "apply", [thisArg, argumentsExpression]);
}
function createGlobalMethodCall(globalObjectName, methodName, argumentsList) {
return createMethodCall(createIdentifier(globalObjectName), methodName, argumentsList);
}
function createArraySliceCall(array, start) {
return createMethodCall(array, "slice", start === undefined ? [] : [asExpression(start)]);
}
function createArrayConcatCall(array, argumentsList) {
return createMethodCall(array, "concat", argumentsList);
}
function createObjectDefinePropertyCall(target, propertyName, attributes) {
return createGlobalMethodCall("Object", "defineProperty", [target, asExpression(propertyName), attributes]);
}
function createReflectGetCall(target, propertyKey, receiver) {
return createGlobalMethodCall("Reflect", "get", receiver ? [target, propertyKey, receiver] : [target, propertyKey]);
}
function createReflectSetCall(target, propertyKey, value, receiver) {
return createGlobalMethodCall("Reflect", "set", receiver ? [target, propertyKey, value, receiver] : [target, propertyKey, value]);
}
function tryAddPropertyAssignment(properties, propertyName, expression) {
if (expression) {
properties.push(createPropertyAssignment(propertyName, expression));
return true;
}
return false;
}
function createPropertyDescriptor(attributes, singleLine) {
var properties = [];
tryAddPropertyAssignment(properties, "enumerable", asExpression(attributes.enumerable));
tryAddPropertyAssignment(properties, "configurable", asExpression(attributes.configurable));
var isData = tryAddPropertyAssignment(properties, "writable", asExpression(attributes.writable));
isData = tryAddPropertyAssignment(properties, "value", attributes.value) || isData;
var isAccessor = tryAddPropertyAssignment(properties, "get", attributes.get);
isAccessor = tryAddPropertyAssignment(properties, "set", attributes.set) || isAccessor;
ts.Debug.assert(!(isData && isAccessor), "A PropertyDescriptor may not be both an accessor descriptor and a data descriptor.");
return createObjectLiteralExpression(properties, !singleLine);
}
function updateOuterExpression(outerExpression, expression) {
switch (outerExpression.kind) {
case 210 /* ParenthesizedExpression */: return updateParenthesizedExpression(outerExpression, expression);
case 209 /* TypeAssertionExpression */: return updateTypeAssertion(outerExpression, outerExpression.type, expression);
case 227 /* AsExpression */: return updateAsExpression(outerExpression, expression, outerExpression.type);
case 228 /* NonNullExpression */: return updateNonNullExpression(outerExpression, expression);
case 345 /* PartiallyEmittedExpression */: return updatePartiallyEmittedExpression(outerExpression, expression);
}
}
/**
* Determines whether a node is a parenthesized expression that can be ignored when recreating outer expressions.
*
* A parenthesized expression can be ignored when all of the following are true:
*
* - It's `pos` and `end` are not -1
* - It does not have a custom source map range
* - It does not have a custom comment range
* - It does not have synthetic leading or trailing comments
*
* If an outermost parenthesized expression is ignored, but the containing expression requires a parentheses around
* the expression to maintain precedence, a new parenthesized expression should be created automatically when
* the containing expression is created/updated.
*/
function isIgnorableParen(node) {
return ts.isParenthesizedExpression(node)
&& ts.nodeIsSynthesized(node)
&& ts.nodeIsSynthesized(ts.getSourceMapRange(node))
&& ts.nodeIsSynthesized(ts.getCommentRange(node))
&& !ts.some(ts.getSyntheticLeadingComments(node))
&& !ts.some(ts.getSyntheticTrailingComments(node));
}
function restoreOuterExpressions(outerExpression, innerExpression, kinds) {
if (kinds === void 0) { kinds = 15 /* All */; }
if (outerExpression && ts.isOuterExpression(outerExpression, kinds) && !isIgnorableParen(outerExpression)) {
return updateOuterExpression(outerExpression, restoreOuterExpressions(outerExpression.expression, innerExpression));
}
return innerExpression;
}
function restoreEnclosingLabel(node, outermostLabeledStatement, afterRestoreLabelCallback) {
if (!outermostLabeledStatement) {
return node;
}
var updated = updateLabeledStatement(outermostLabeledStatement, outermostLabeledStatement.label, ts.isLabeledStatement(outermostLabeledStatement.statement)
? restoreEnclosingLabel(node, outermostLabeledStatement.statement)
: node);
if (afterRestoreLabelCallback) {
afterRestoreLabelCallback(outermostLabeledStatement);
}
return updated;
}
function shouldBeCapturedInTempVariable(node, cacheIdentifiers) {
var target = ts.skipParentheses(node);
switch (target.kind) {
case 79 /* Identifier */:
return cacheIdentifiers;
case 108 /* ThisKeyword */:
case 8 /* NumericLiteral */:
case 9 /* BigIntLiteral */:
case 10 /* StringLiteral */:
return false;
case 202 /* ArrayLiteralExpression */:
var elements = target.elements;
if (elements.length === 0) {
return false;
}
return true;
case 203 /* ObjectLiteralExpression */:
return target.properties.length > 0;
default:
return true;
}
}
function createCallBinding(expression, recordTempVariable, languageVersion, cacheIdentifiers) {
if (cacheIdentifiers === void 0) { cacheIdentifiers = false; }
var callee = ts.skipOuterExpressions(expression, 15 /* All */);
var thisArg;
var target;
if (ts.isSuperProperty(callee)) {
thisArg = createThis();
target = callee;
}
else if (ts.isSuperKeyword(callee)) {
thisArg = createThis();
target = languageVersion !== undefined && languageVersion < 2 /* ES2015 */
? ts.setTextRange(createIdentifier("_super"), callee)
: callee;
}
else if (ts.getEmitFlags(callee) & 4096 /* HelperName */) {
thisArg = createVoidZero();
target = parenthesizerRules().parenthesizeLeftSideOfAccess(callee);
}
else if (ts.isPropertyAccessExpression(callee)) {
if (shouldBeCapturedInTempVariable(callee.expression, cacheIdentifiers)) {
// for `a.b()` target is `(_a = a).b` and thisArg is `_a`
thisArg = createTempVariable(recordTempVariable);
target = createPropertyAccessExpression(ts.setTextRange(factory.createAssignment(thisArg, callee.expression), callee.expression), callee.name);
ts.setTextRange(target, callee);
}
else {
thisArg = callee.expression;
target = callee;
}
}
else if (ts.isElementAccessExpression(callee)) {
if (shouldBeCapturedInTempVariable(callee.expression, cacheIdentifiers)) {
// for `a[b]()` target is `(_a = a)[b]` and thisArg is `_a`
thisArg = createTempVariable(recordTempVariable);
target = createElementAccessExpression(ts.setTextRange(factory.createAssignment(thisArg, callee.expression), callee.expression), callee.argumentExpression);
ts.setTextRange(target, callee);
}
else {
thisArg = callee.expression;
target = callee;
}
}
else {
// for `a()` target is `a` and thisArg is `void 0`
thisArg = createVoidZero();
target = parenthesizerRules().parenthesizeLeftSideOfAccess(expression);
}
return { target: target, thisArg: thisArg };
}
function createAssignmentTargetWrapper(paramName, expression) {
return createPropertyAccessExpression(
// Explicit parens required because of v8 regression (https://bugs.chromium.org/p/v8/issues/detail?id=9560)
createParenthesizedExpression(createObjectLiteralExpression([
createSetAccessorDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, "value", [createParameterDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*dotDotDotToken*/ undefined, paramName,
/*questionToken*/ undefined,
/*type*/ undefined,
/*initializer*/ undefined)], createBlock([
createExpressionStatement(expression)
]))
])), "value");
}
function inlineExpressions(expressions) {
// Avoid deeply nested comma expressions as traversing them during emit can result in "Maximum call
// stack size exceeded" errors.
return expressions.length > 10
? createCommaListExpression(expressions)
: ts.reduceLeft(expressions, factory.createComma);
}
function getName(node, allowComments, allowSourceMaps, emitFlags) {
if (emitFlags === void 0) { emitFlags = 0; }
var nodeName = ts.getNameOfDeclaration(node);
if (nodeName && ts.isIdentifier(nodeName) && !ts.isGeneratedIdentifier(nodeName)) {
// TODO(rbuckton): Does this need to be parented?
var name = ts.setParent(ts.setTextRange(cloneNode(nodeName), nodeName), nodeName.parent);
emitFlags |= ts.getEmitFlags(nodeName);
if (!allowSourceMaps)
emitFlags |= 48 /* NoSourceMap */;
if (!allowComments)
emitFlags |= 1536 /* NoComments */;
if (emitFlags)
ts.setEmitFlags(name, emitFlags);
return name;
}
return getGeneratedNameForNode(node);
}
/**
* Gets the internal name of a declaration. This is primarily used for declarations that can be
* referred to by name in the body of an ES5 class function body. An internal name will *never*
* be prefixed with an module or namespace export modifier like "exports." when emitted as an
* expression. An internal name will also *never* be renamed due to a collision with a block
* scoped variable.
*
* @param node The declaration.
* @param allowComments A value indicating whether comments may be emitted for the name.
* @param allowSourceMaps A value indicating whether source maps may be emitted for the name.
*/
function getInternalName(node, allowComments, allowSourceMaps) {
return getName(node, allowComments, allowSourceMaps, 16384 /* LocalName */ | 32768 /* InternalName */);
}
/**
* Gets the local name of a declaration. This is primarily used for declarations that can be
* referred to by name in the declaration's immediate scope (classes, enums, namespaces). A
* local name will *never* be prefixed with an module or namespace export modifier like
* "exports." when emitted as an expression.
*
* @param node The declaration.
* @param allowComments A value indicating whether comments may be emitted for the name.
* @param allowSourceMaps A value indicating whether source maps may be emitted for the name.
*/
function getLocalName(node, allowComments, allowSourceMaps) {
return getName(node, allowComments, allowSourceMaps, 16384 /* LocalName */);
}
/**
* Gets the export name of a declaration. This is primarily used for declarations that can be
* referred to by name in the declaration's immediate scope (classes, enums, namespaces). An
* export name will *always* be prefixed with an module or namespace export modifier like
* `"exports."` when emitted as an expression if the name points to an exported symbol.
*
* @param node The declaration.
* @param allowComments A value indicating whether comments may be emitted for the name.
* @param allowSourceMaps A value indicating whether source maps may be emitted for the name.
*/
function getExportName(node, allowComments, allowSourceMaps) {
return getName(node, allowComments, allowSourceMaps, 8192 /* ExportName */);
}
/**
* Gets the name of a declaration for use in declarations.
*
* @param node The declaration.
* @param allowComments A value indicating whether comments may be emitted for the name.
* @param allowSourceMaps A value indicating whether source maps may be emitted for the name.
*/
function getDeclarationName(node, allowComments, allowSourceMaps) {
return getName(node, allowComments, allowSourceMaps);
}
/**
* Gets a namespace-qualified name for use in expressions.
*
* @param ns The namespace identifier.
* @param name The name.
* @param allowComments A value indicating whether comments may be emitted for the name.
* @param allowSourceMaps A value indicating whether source maps may be emitted for the name.
*/
function getNamespaceMemberName(ns, name, allowComments, allowSourceMaps) {
var qualifiedName = createPropertyAccessExpression(ns, ts.nodeIsSynthesized(name) ? name : cloneNode(name));
ts.setTextRange(qualifiedName, name);
var emitFlags = 0;
if (!allowSourceMaps)
emitFlags |= 48 /* NoSourceMap */;
if (!allowComments)
emitFlags |= 1536 /* NoComments */;
if (emitFlags)
ts.setEmitFlags(qualifiedName, emitFlags);
return qualifiedName;
}
/**
* Gets the exported name of a declaration for use in expressions.
*
* An exported name will *always* be prefixed with an module or namespace export modifier like
* "exports." if the name points to an exported symbol.
*
* @param ns The namespace identifier.
* @param node The declaration.
* @param allowComments A value indicating whether comments may be emitted for the name.
* @param allowSourceMaps A value indicating whether source maps may be emitted for the name.
*/
function getExternalModuleOrNamespaceExportName(ns, node, allowComments, allowSourceMaps) {
if (ns && ts.hasSyntacticModifier(node, 1 /* Export */)) {
return getNamespaceMemberName(ns, getName(node), allowComments, allowSourceMaps);
}
return getExportName(node, allowComments, allowSourceMaps);
}
/**
* Copies any necessary standard and custom prologue-directives into target array.
* @param source origin statements array
* @param target result statements array
* @param ensureUseStrict boolean determining whether the function need to add prologue-directives
* @param visitor Optional callback used to visit any custom prologue directives.
*/
function copyPrologue(source, target, ensureUseStrict, visitor) {
var offset = copyStandardPrologue(source, target, ensureUseStrict);
return copyCustomPrologue(source, target, offset, visitor);
}
function isUseStrictPrologue(node) {
return ts.isStringLiteral(node.expression) && node.expression.text === "use strict";
}
function createUseStrictPrologue() {
return ts.startOnNewLine(createExpressionStatement(createStringLiteral("use strict")));
}
/**
* Copies only the standard (string-expression) prologue-directives into the target statement-array.
* @param source origin statements array
* @param target result statements array
* @param ensureUseStrict boolean determining whether the function need to add prologue-directives
*/
function copyStandardPrologue(source, target, ensureUseStrict) {
ts.Debug.assert(target.length === 0, "Prologue directives should be at the first statement in the target statements array");
var foundUseStrict = false;
var statementOffset = 0;
var numStatements = source.length;
while (statementOffset < numStatements) {
var statement = source[statementOffset];
if (ts.isPrologueDirective(statement)) {
if (isUseStrictPrologue(statement)) {
foundUseStrict = true;
}
target.push(statement);
}
else {
break;
}
statementOffset++;
}
if (ensureUseStrict && !foundUseStrict) {
target.push(createUseStrictPrologue());
}
return statementOffset;
}
function copyCustomPrologue(source, target, statementOffset, visitor, filter) {
if (filter === void 0) { filter = ts.returnTrue; }
var numStatements = source.length;
while (statementOffset !== undefined && statementOffset < numStatements) {
var statement = source[statementOffset];
if (ts.getEmitFlags(statement) & 1048576 /* CustomPrologue */ && filter(statement)) {
ts.append(target, visitor ? ts.visitNode(statement, visitor, ts.isStatement) : statement);
}
else {
break;
}
statementOffset++;
}
return statementOffset;
}
/**
* Ensures "use strict" directive is added
*
* @param statements An array of statements
*/
function ensureUseStrict(statements) {
var foundUseStrict = ts.findUseStrictPrologue(statements);
if (!foundUseStrict) {
return ts.setTextRange(createNodeArray(__spreadArray([createUseStrictPrologue()], statements, true)), statements);
}
return statements;
}
/**
* Lifts a NodeArray containing only Statement nodes to a block.
*
* @param nodes The NodeArray.
*/
function liftToBlock(nodes) {
ts.Debug.assert(ts.every(nodes, ts.isStatementOrBlock), "Cannot lift nodes to a Block.");
return ts.singleOrUndefined(nodes) || createBlock(nodes);
}
function findSpanEnd(array, test, start) {
var i = start;
while (i < array.length && test(array[i])) {
i++;
}
return i;
}
function mergeLexicalEnvironment(statements, declarations) {
if (!ts.some(declarations)) {
return statements;
}
// When we merge new lexical statements into an existing statement list, we merge them in the following manner:
//
// Given:
//
// | Left | Right |
// |------------------------------------|-------------------------------------|
// | [standard prologues (left)] | [standard prologues (right)] |
// | [hoisted functions (left)] | [hoisted functions (right)] |
// | [hoisted variables (left)] | [hoisted variables (right)] |
// | [lexical init statements (left)] | [lexical init statements (right)] |
// | [other statements (left)] | |
//
// The resulting statement list will be:
//
// | Result |
// |-------------------------------------|
// | [standard prologues (right)] |
// | [standard prologues (left)] |
// | [hoisted functions (right)] |
// | [hoisted functions (left)] |
// | [hoisted variables (right)] |
// | [hoisted variables (left)] |
// | [lexical init statements (right)] |
// | [lexical init statements (left)] |
// | [other statements (left)] |
//
// NOTE: It is expected that new lexical init statements must be evaluated before existing lexical init statements,
// as the prior transformation may depend on the evaluation of the lexical init statements to be in the correct state.
// find standard prologues on left in the following order: standard directives, hoisted functions, hoisted variables, other custom
var leftStandardPrologueEnd = findSpanEnd(statements, ts.isPrologueDirective, 0);
var leftHoistedFunctionsEnd = findSpanEnd(statements, ts.isHoistedFunction, leftStandardPrologueEnd);
var leftHoistedVariablesEnd = findSpanEnd(statements, ts.isHoistedVariableStatement, leftHoistedFunctionsEnd);
// find standard prologues on right in the following order: standard directives, hoisted functions, hoisted variables, other custom
var rightStandardPrologueEnd = findSpanEnd(declarations, ts.isPrologueDirective, 0);
var rightHoistedFunctionsEnd = findSpanEnd(declarations, ts.isHoistedFunction, rightStandardPrologueEnd);
var rightHoistedVariablesEnd = findSpanEnd(declarations, ts.isHoistedVariableStatement, rightHoistedFunctionsEnd);
var rightCustomPrologueEnd = findSpanEnd(declarations, ts.isCustomPrologue, rightHoistedVariablesEnd);
ts.Debug.assert(rightCustomPrologueEnd === declarations.length, "Expected declarations to be valid standard or custom prologues");
// splice prologues from the right into the left. We do this in reverse order
// so that we don't need to recompute the index on the left when we insert items.
var left = ts.isNodeArray(statements) ? statements.slice() : statements;
// splice other custom prologues from right into left
if (rightCustomPrologueEnd > rightHoistedVariablesEnd) {
left.splice.apply(left, __spreadArray([leftHoistedVariablesEnd, 0], declarations.slice(rightHoistedVariablesEnd, rightCustomPrologueEnd), false));
}
// splice hoisted variables from right into left
if (rightHoistedVariablesEnd > rightHoistedFunctionsEnd) {
left.splice.apply(left, __spreadArray([leftHoistedFunctionsEnd, 0], declarations.slice(rightHoistedFunctionsEnd, rightHoistedVariablesEnd), false));
}
// splice hoisted functions from right into left
if (rightHoistedFunctionsEnd > rightStandardPrologueEnd) {
left.splice.apply(left, __spreadArray([leftStandardPrologueEnd, 0], declarations.slice(rightStandardPrologueEnd, rightHoistedFunctionsEnd), false));
}
// splice standard prologues from right into left (that are not already in left)
if (rightStandardPrologueEnd > 0) {
if (leftStandardPrologueEnd === 0) {
left.splice.apply(left, __spreadArray([0, 0], declarations.slice(0, rightStandardPrologueEnd), false));
}
else {
var leftPrologues = new ts.Map();
for (var i = 0; i < leftStandardPrologueEnd; i++) {
var leftPrologue = statements[i];
leftPrologues.set(leftPrologue.expression.text, true);
}
for (var i = rightStandardPrologueEnd - 1; i >= 0; i--) {
var rightPrologue = declarations[i];
if (!leftPrologues.has(rightPrologue.expression.text)) {
left.unshift(rightPrologue);
}
}
}
}
if (ts.isNodeArray(statements)) {
return ts.setTextRange(createNodeArray(left, statements.hasTrailingComma), statements);
}
return statements;
}
function updateModifiers(node, modifiers) {
var _a;
if (typeof modifiers === "number") {
modifiers = createModifiersFromModifierFlags(modifiers);
}
return ts.isParameter(node) ? updateParameterDeclaration(node, node.decorators, modifiers, node.dotDotDotToken, node.name, node.questionToken, node.type, node.initializer) :
ts.isPropertySignature(node) ? updatePropertySignature(node, modifiers, node.name, node.questionToken, node.type) :
ts.isPropertyDeclaration(node) ? updatePropertyDeclaration(node, node.decorators, modifiers, node.name, (_a = node.questionToken) !== null && _a !== void 0 ? _a : node.exclamationToken, node.type, node.initializer) :
ts.isMethodSignature(node) ? updateMethodSignature(node, modifiers, node.name, node.questionToken, node.typeParameters, node.parameters, node.type) :
ts.isMethodDeclaration(node) ? updateMethodDeclaration(node, node.decorators, modifiers, node.asteriskToken, node.name, node.questionToken, node.typeParameters, node.parameters, node.type, node.body) :
ts.isConstructorDeclaration(node) ? updateConstructorDeclaration(node, node.decorators, modifiers, node.parameters, node.body) :
ts.isGetAccessorDeclaration(node) ? updateGetAccessorDeclaration(node, node.decorators, modifiers, node.name, node.parameters, node.type, node.body) :
ts.isSetAccessorDeclaration(node) ? updateSetAccessorDeclaration(node, node.decorators, modifiers, node.name, node.parameters, node.body) :
ts.isIndexSignatureDeclaration(node) ? updateIndexSignature(node, node.decorators, modifiers, node.parameters, node.type) :
ts.isFunctionExpression(node) ? updateFunctionExpression(node, modifiers, node.asteriskToken, node.name, node.typeParameters, node.parameters, node.type, node.body) :
ts.isArrowFunction(node) ? updateArrowFunction(node, modifiers, node.typeParameters, node.parameters, node.type, node.equalsGreaterThanToken, node.body) :
ts.isClassExpression(node) ? updateClassExpression(node, node.decorators, modifiers, node.name, node.typeParameters, node.heritageClauses, node.members) :
ts.isVariableStatement(node) ? updateVariableStatement(node, modifiers, node.declarationList) :
ts.isFunctionDeclaration(node) ? updateFunctionDeclaration(node, node.decorators, modifiers, node.asteriskToken, node.name, node.typeParameters, node.parameters, node.type, node.body) :
ts.isClassDeclaration(node) ? updateClassDeclaration(node, node.decorators, modifiers, node.name, node.typeParameters, node.heritageClauses, node.members) :
ts.isInterfaceDeclaration(node) ? updateInterfaceDeclaration(node, node.decorators, modifiers, node.name, node.typeParameters, node.heritageClauses, node.members) :
ts.isTypeAliasDeclaration(node) ? updateTypeAliasDeclaration(node, node.decorators, modifiers, node.name, node.typeParameters, node.type) :
ts.isEnumDeclaration(node) ? updateEnumDeclaration(node, node.decorators, modifiers, node.name, node.members) :
ts.isModuleDeclaration(node) ? updateModuleDeclaration(node, node.decorators, modifiers, node.name, node.body) :
ts.isImportEqualsDeclaration(node) ? updateImportEqualsDeclaration(node, node.decorators, modifiers, node.isTypeOnly, node.name, node.moduleReference) :
ts.isImportDeclaration(node) ? updateImportDeclaration(node, node.decorators, modifiers, node.importClause, node.moduleSpecifier) :
ts.isExportAssignment(node) ? updateExportAssignment(node, node.decorators, modifiers, node.expression) :
ts.isExportDeclaration(node) ? updateExportDeclaration(node, node.decorators, modifiers, node.isTypeOnly, node.exportClause, node.moduleSpecifier) :
ts.Debug.assertNever(node);
}
function asNodeArray(array) {
return array ? createNodeArray(array) : undefined;
}
function asName(name) {
return typeof name === "string" ? createIdentifier(name) :
name;
}
function asExpression(value) {
return typeof value === "string" ? createStringLiteral(value) :
typeof value === "number" ? createNumericLiteral(value) :
typeof value === "boolean" ? value ? createTrue() : createFalse() :
value;
}
function asToken(value) {
return typeof value === "number" ? createToken(value) : value;
}
function asEmbeddedStatement(statement) {
return statement && ts.isNotEmittedStatement(statement) ? ts.setTextRange(setOriginalNode(createEmptyStatement(), statement), statement) : statement;
}
}
ts.createNodeFactory = createNodeFactory;
function updateWithoutOriginal(updated, original) {
if (updated !== original) {
ts.setTextRange(updated, original);
}
return updated;
}
function updateWithOriginal(updated, original) {
if (updated !== original) {
setOriginalNode(updated, original);
ts.setTextRange(updated, original);
}
return updated;
}
function getDefaultTagNameForKind(kind) {
switch (kind) {
case 338 /* JSDocTypeTag */: return "type";
case 336 /* JSDocReturnTag */: return "returns";
case 337 /* JSDocThisTag */: return "this";
case 334 /* JSDocEnumTag */: return "enum";
case 325 /* JSDocAuthorTag */: return "author";
case 327 /* JSDocClassTag */: return "class";
case 328 /* JSDocPublicTag */: return "public";
case 329 /* JSDocPrivateTag */: return "private";
case 330 /* JSDocProtectedTag */: return "protected";
case 331 /* JSDocReadonlyTag */: return "readonly";
case 332 /* JSDocOverrideTag */: return "override";
case 339 /* JSDocTemplateTag */: return "template";
case 340 /* JSDocTypedefTag */: return "typedef";
case 335 /* JSDocParameterTag */: return "param";
case 342 /* JSDocPropertyTag */: return "prop";
case 333 /* JSDocCallbackTag */: return "callback";
case 323 /* JSDocAugmentsTag */: return "augments";
case 324 /* JSDocImplementsTag */: return "implements";
default:
return ts.Debug.fail("Unsupported kind: " + ts.Debug.formatSyntaxKind(kind));
}
}
var rawTextScanner;
var invalidValueSentinel = {};
function getCookedText(kind, rawText) {
if (!rawTextScanner) {
rawTextScanner = ts.createScanner(99 /* Latest */, /*skipTrivia*/ false, 0 /* Standard */);
}
switch (kind) {
case 14 /* NoSubstitutionTemplateLiteral */:
rawTextScanner.setText("`" + rawText + "`");
break;
case 15 /* TemplateHead */:
// tslint:disable-next-line no-invalid-template-strings
rawTextScanner.setText("`" + rawText + "${");
break;
case 16 /* TemplateMiddle */:
// tslint:disable-next-line no-invalid-template-strings
rawTextScanner.setText("}" + rawText + "${");
break;
case 17 /* TemplateTail */:
rawTextScanner.setText("}" + rawText + "`");
break;
}
var token = rawTextScanner.scan();
if (token === 19 /* CloseBraceToken */) {
token = rawTextScanner.reScanTemplateToken(/*isTaggedTemplate*/ false);
}
if (rawTextScanner.isUnterminated()) {
rawTextScanner.setText(undefined);
return invalidValueSentinel;
}
var tokenValue;
switch (token) {
case 14 /* NoSubstitutionTemplateLiteral */:
case 15 /* TemplateHead */:
case 16 /* TemplateMiddle */:
case 17 /* TemplateTail */:
tokenValue = rawTextScanner.getTokenValue();
break;
}
if (tokenValue === undefined || rawTextScanner.scan() !== 1 /* EndOfFileToken */) {
rawTextScanner.setText(undefined);
return invalidValueSentinel;
}
rawTextScanner.setText(undefined);
return tokenValue;
}
function propagateIdentifierNameFlags(node) {
// An IdentifierName is allowed to be `await`
return propagateChildFlags(node) & ~16777216 /* ContainsPossibleTopLevelAwait */;
}
function propagatePropertyNameFlagsOfChild(node, transformFlags) {
return transformFlags | (node.transformFlags & 33562624 /* PropertyNamePropagatingFlags */);
}
function propagateChildFlags(child) {
if (!child)
return 0 /* None */;
var childFlags = child.transformFlags & ~getTransformFlagsSubtreeExclusions(child.kind);
return ts.isNamedDeclaration(child) && ts.isPropertyName(child.name) ? propagatePropertyNameFlagsOfChild(child.name, childFlags) : childFlags;
}
function propagateChildrenFlags(children) {
return children ? children.transformFlags : 0 /* None */;
}
function aggregateChildrenFlags(children) {
var subtreeFlags = 0 /* None */;
for (var _i = 0, children_2 = children; _i < children_2.length; _i++) {
var child = children_2[_i];
subtreeFlags |= propagateChildFlags(child);
}
children.transformFlags = subtreeFlags;
}
/**
* Gets the transform flags to exclude when unioning the transform flags of a subtree.
*/
/* @internal */
function getTransformFlagsSubtreeExclusions(kind) {
if (kind >= 175 /* FirstTypeNode */ && kind <= 198 /* LastTypeNode */) {
return -2 /* TypeExcludes */;
}
switch (kind) {
case 206 /* CallExpression */:
case 207 /* NewExpression */:
case 202 /* ArrayLiteralExpression */:
return 536887296 /* ArrayLiteralOrCallOrNewExcludes */;
case 259 /* ModuleDeclaration */:
return 589443072 /* ModuleExcludes */;
case 162 /* Parameter */:
return 536870912 /* ParameterExcludes */;
case 212 /* ArrowFunction */:
return 557748224 /* ArrowFunctionExcludes */;
case 211 /* FunctionExpression */:
case 254 /* FunctionDeclaration */:
return 591310848 /* FunctionExcludes */;
case 253 /* VariableDeclarationList */:
return 537165824 /* VariableDeclarationListExcludes */;
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
return 536940544 /* ClassExcludes */;
case 169 /* Constructor */:
return 591306752 /* ConstructorExcludes */;
case 165 /* PropertyDeclaration */:
return 570433536 /* PropertyExcludes */;
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return 574529536 /* MethodOrAccessorExcludes */;
case 129 /* AnyKeyword */:
case 145 /* NumberKeyword */:
case 156 /* BigIntKeyword */:
case 142 /* NeverKeyword */:
case 148 /* StringKeyword */:
case 146 /* ObjectKeyword */:
case 132 /* BooleanKeyword */:
case 149 /* SymbolKeyword */:
case 114 /* VoidKeyword */:
case 161 /* TypeParameter */:
case 164 /* PropertySignature */:
case 166 /* MethodSignature */:
case 172 /* CallSignature */:
case 173 /* ConstructSignature */:
case 174 /* IndexSignature */:
case 256 /* InterfaceDeclaration */:
case 257 /* TypeAliasDeclaration */:
return -2 /* TypeExcludes */;
case 203 /* ObjectLiteralExpression */:
return 536973312 /* ObjectLiteralExcludes */;
case 290 /* CatchClause */:
return 536903680 /* CatchClauseExcludes */;
case 199 /* ObjectBindingPattern */:
case 200 /* ArrayBindingPattern */:
return 536887296 /* BindingPatternExcludes */;
case 209 /* TypeAssertionExpression */:
case 227 /* AsExpression */:
case 345 /* PartiallyEmittedExpression */:
case 210 /* ParenthesizedExpression */:
case 106 /* SuperKeyword */:
return 536870912 /* OuterExpressionExcludes */;
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
return 536870912 /* PropertyAccessExcludes */;
default:
return 536870912 /* NodeExcludes */;
}
}
ts.getTransformFlagsSubtreeExclusions = getTransformFlagsSubtreeExclusions;
var baseFactory = ts.createBaseNodeFactory();
function makeSynthetic(node) {
node.flags |= 8 /* Synthesized */;
return node;
}
var syntheticFactory = {
createBaseSourceFileNode: function (kind) { return makeSynthetic(baseFactory.createBaseSourceFileNode(kind)); },
createBaseIdentifierNode: function (kind) { return makeSynthetic(baseFactory.createBaseIdentifierNode(kind)); },
createBasePrivateIdentifierNode: function (kind) { return makeSynthetic(baseFactory.createBasePrivateIdentifierNode(kind)); },
createBaseTokenNode: function (kind) { return makeSynthetic(baseFactory.createBaseTokenNode(kind)); },
createBaseNode: function (kind) { return makeSynthetic(baseFactory.createBaseNode(kind)); },
};
ts.factory = createNodeFactory(4 /* NoIndentationOnFreshPropertyAccess */, syntheticFactory);
function createUnparsedSourceFile(textOrInputFiles, mapPathOrType, mapTextOrStripInternal) {
var stripInternal;
var bundleFileInfo;
var fileName;
var text;
var length;
var sourceMapPath;
var sourceMapText;
var getText;
var getSourceMapText;
var oldFileOfCurrentEmit;
if (!ts.isString(textOrInputFiles)) {
ts.Debug.assert(mapPathOrType === "js" || mapPathOrType === "dts");
fileName = (mapPathOrType === "js" ? textOrInputFiles.javascriptPath : textOrInputFiles.declarationPath) || "";
sourceMapPath = mapPathOrType === "js" ? textOrInputFiles.javascriptMapPath : textOrInputFiles.declarationMapPath;
getText = function () { return mapPathOrType === "js" ? textOrInputFiles.javascriptText : textOrInputFiles.declarationText; };
getSourceMapText = function () { return mapPathOrType === "js" ? textOrInputFiles.javascriptMapText : textOrInputFiles.declarationMapText; };
length = function () { return getText().length; };
if (textOrInputFiles.buildInfo && textOrInputFiles.buildInfo.bundle) {
ts.Debug.assert(mapTextOrStripInternal === undefined || typeof mapTextOrStripInternal === "boolean");
stripInternal = mapTextOrStripInternal;
bundleFileInfo = mapPathOrType === "js" ? textOrInputFiles.buildInfo.bundle.js : textOrInputFiles.buildInfo.bundle.dts;
oldFileOfCurrentEmit = textOrInputFiles.oldFileOfCurrentEmit;
}
}
else {
fileName = "";
text = textOrInputFiles;
length = textOrInputFiles.length;
sourceMapPath = mapPathOrType;
sourceMapText = mapTextOrStripInternal;
}
var node = oldFileOfCurrentEmit ?
parseOldFileOfCurrentEmit(ts.Debug.assertDefined(bundleFileInfo)) :
parseUnparsedSourceFile(bundleFileInfo, stripInternal, length);
node.fileName = fileName;
node.sourceMapPath = sourceMapPath;
node.oldFileOfCurrentEmit = oldFileOfCurrentEmit;
if (getText && getSourceMapText) {
Object.defineProperty(node, "text", { get: getText });
Object.defineProperty(node, "sourceMapText", { get: getSourceMapText });
}
else {
ts.Debug.assert(!oldFileOfCurrentEmit);
node.text = text !== null && text !== void 0 ? text : "";
node.sourceMapText = sourceMapText;
}
return node;
}
ts.createUnparsedSourceFile = createUnparsedSourceFile;
function parseUnparsedSourceFile(bundleFileInfo, stripInternal, length) {
var prologues;
var helpers;
var referencedFiles;
var typeReferenceDirectives;
var libReferenceDirectives;
var prependChildren;
var texts;
var hasNoDefaultLib;
for (var _i = 0, _a = bundleFileInfo ? bundleFileInfo.sections : ts.emptyArray; _i < _a.length; _i++) {
var section = _a[_i];
switch (section.kind) {
case "prologue" /* Prologue */:
prologues = ts.append(prologues, ts.setTextRange(ts.factory.createUnparsedPrologue(section.data), section));
break;
case "emitHelpers" /* EmitHelpers */:
helpers = ts.append(helpers, ts.getAllUnscopedEmitHelpers().get(section.data));
break;
case "no-default-lib" /* NoDefaultLib */:
hasNoDefaultLib = true;
break;
case "reference" /* Reference */:
referencedFiles = ts.append(referencedFiles, { pos: -1, end: -1, fileName: section.data });
break;
case "type" /* Type */:
typeReferenceDirectives = ts.append(typeReferenceDirectives, section.data);
break;
case "lib" /* Lib */:
libReferenceDirectives = ts.append(libReferenceDirectives, { pos: -1, end: -1, fileName: section.data });
break;
case "prepend" /* Prepend */:
var prependTexts = void 0;
for (var _b = 0, _c = section.texts; _b < _c.length; _b++) {
var text = _c[_b];
if (!stripInternal || text.kind !== "internal" /* Internal */) {
prependTexts = ts.append(prependTexts, ts.setTextRange(ts.factory.createUnparsedTextLike(text.data, text.kind === "internal" /* Internal */), text));
}
}
prependChildren = ts.addRange(prependChildren, prependTexts);
texts = ts.append(texts, ts.factory.createUnparsedPrepend(section.data, prependTexts !== null && prependTexts !== void 0 ? prependTexts : ts.emptyArray));
break;
case "internal" /* Internal */:
if (stripInternal) {
if (!texts)
texts = [];
break;
}
// falls through
case "text" /* Text */:
texts = ts.append(texts, ts.setTextRange(ts.factory.createUnparsedTextLike(section.data, section.kind === "internal" /* Internal */), section));
break;
default:
ts.Debug.assertNever(section);
}
}
if (!texts) {
var textNode = ts.factory.createUnparsedTextLike(/*data*/ undefined, /*internal*/ false);
ts.setTextRangePosWidth(textNode, 0, typeof length === "function" ? length() : length);
texts = [textNode];
}
var node = ts.parseNodeFactory.createUnparsedSource(prologues !== null && prologues !== void 0 ? prologues : ts.emptyArray, /*syntheticReferences*/ undefined, texts);
ts.setEachParent(prologues, node);
ts.setEachParent(texts, node);
ts.setEachParent(prependChildren, node);
node.hasNoDefaultLib = hasNoDefaultLib;
node.helpers = helpers;
node.referencedFiles = referencedFiles || ts.emptyArray;
node.typeReferenceDirectives = typeReferenceDirectives;
node.libReferenceDirectives = libReferenceDirectives || ts.emptyArray;
return node;
}
function parseOldFileOfCurrentEmit(bundleFileInfo) {
var texts;
var syntheticReferences;
for (var _i = 0, _a = bundleFileInfo.sections; _i < _a.length; _i++) {
var section = _a[_i];
switch (section.kind) {
case "internal" /* Internal */:
case "text" /* Text */:
texts = ts.append(texts, ts.setTextRange(ts.factory.createUnparsedTextLike(section.data, section.kind === "internal" /* Internal */), section));
break;
case "no-default-lib" /* NoDefaultLib */:
case "reference" /* Reference */:
case "type" /* Type */:
case "lib" /* Lib */:
syntheticReferences = ts.append(syntheticReferences, ts.setTextRange(ts.factory.createUnparsedSyntheticReference(section), section));
break;
// Ignore
case "prologue" /* Prologue */:
case "emitHelpers" /* EmitHelpers */:
case "prepend" /* Prepend */:
break;
default:
ts.Debug.assertNever(section);
}
}
var node = ts.factory.createUnparsedSource(ts.emptyArray, syntheticReferences, texts !== null && texts !== void 0 ? texts : ts.emptyArray);
ts.setEachParent(syntheticReferences, node);
ts.setEachParent(texts, node);
node.helpers = ts.map(bundleFileInfo.sources && bundleFileInfo.sources.helpers, function (name) { return ts.getAllUnscopedEmitHelpers().get(name); });
return node;
}
function createInputFiles(javascriptTextOrReadFileText, declarationTextOrJavascriptPath, javascriptMapPath, javascriptMapTextOrDeclarationPath, declarationMapPath, declarationMapTextOrBuildInfoPath, javascriptPath, declarationPath, buildInfoPath, buildInfo, oldFileOfCurrentEmit) {
var node = ts.parseNodeFactory.createInputFiles();
if (!ts.isString(javascriptTextOrReadFileText)) {
var cache_1 = new ts.Map();
var textGetter_1 = function (path) {
if (path === undefined)
return undefined;
var value = cache_1.get(path);
if (value === undefined) {
value = javascriptTextOrReadFileText(path);
cache_1.set(path, value !== undefined ? value : false);
}
return value !== false ? value : undefined;
};
var definedTextGetter_1 = function (path) {
var result = textGetter_1(path);
return result !== undefined ? result : "/* Input file " + path + " was missing */\r\n";
};
var buildInfo_1;
var getAndCacheBuildInfo_1 = function (getText) {
if (buildInfo_1 === undefined) {
var result = getText();
buildInfo_1 = result !== undefined ? ts.getBuildInfo(result) : false;
}
return buildInfo_1 || undefined;
};
node.javascriptPath = declarationTextOrJavascriptPath;
node.javascriptMapPath = javascriptMapPath;
node.declarationPath = ts.Debug.assertDefined(javascriptMapTextOrDeclarationPath);
node.declarationMapPath = declarationMapPath;
node.buildInfoPath = declarationMapTextOrBuildInfoPath;
Object.defineProperties(node, {
javascriptText: { get: function () { return definedTextGetter_1(declarationTextOrJavascriptPath); } },
javascriptMapText: { get: function () { return textGetter_1(javascriptMapPath); } },
declarationText: { get: function () { return definedTextGetter_1(ts.Debug.assertDefined(javascriptMapTextOrDeclarationPath)); } },
declarationMapText: { get: function () { return textGetter_1(declarationMapPath); } },
buildInfo: { get: function () { return getAndCacheBuildInfo_1(function () { return textGetter_1(declarationMapTextOrBuildInfoPath); }); } }
});
}
else {
node.javascriptText = javascriptTextOrReadFileText;
node.javascriptMapPath = javascriptMapPath;
node.javascriptMapText = javascriptMapTextOrDeclarationPath;
node.declarationText = declarationTextOrJavascriptPath;
node.declarationMapPath = declarationMapPath;
node.declarationMapText = declarationMapTextOrBuildInfoPath;
node.javascriptPath = javascriptPath;
node.declarationPath = declarationPath;
node.buildInfoPath = buildInfoPath;
node.buildInfo = buildInfo;
node.oldFileOfCurrentEmit = oldFileOfCurrentEmit;
}
return node;
}
ts.createInputFiles = createInputFiles;
// tslint:disable-next-line variable-name
var SourceMapSource;
/**
* Create an external source map source file reference
*/
function createSourceMapSource(fileName, text, skipTrivia) {
return new (SourceMapSource || (SourceMapSource = ts.objectAllocator.getSourceMapSourceConstructor()))(fileName, text, skipTrivia);
}
ts.createSourceMapSource = createSourceMapSource;
// Utilities
function setOriginalNode(node, original) {
node.original = original;
if (original) {
var emitNode = original.emitNode;
if (emitNode)
node.emitNode = mergeEmitNode(emitNode, node.emitNode);
}
return node;
}
ts.setOriginalNode = setOriginalNode;
function mergeEmitNode(sourceEmitNode, destEmitNode) {
var flags = sourceEmitNode.flags, leadingComments = sourceEmitNode.leadingComments, trailingComments = sourceEmitNode.trailingComments, commentRange = sourceEmitNode.commentRange, sourceMapRange = sourceEmitNode.sourceMapRange, tokenSourceMapRanges = sourceEmitNode.tokenSourceMapRanges, constantValue = sourceEmitNode.constantValue, helpers = sourceEmitNode.helpers, startsOnNewLine = sourceEmitNode.startsOnNewLine;
if (!destEmitNode)
destEmitNode = {};
// We are using `.slice()` here in case `destEmitNode.leadingComments` is pushed to later.
if (leadingComments)
destEmitNode.leadingComments = ts.addRange(leadingComments.slice(), destEmitNode.leadingComments);
if (trailingComments)
destEmitNode.trailingComments = ts.addRange(trailingComments.slice(), destEmitNode.trailingComments);
if (flags)
destEmitNode.flags = flags & ~268435456 /* Immutable */;
if (commentRange)
destEmitNode.commentRange = commentRange;
if (sourceMapRange)
destEmitNode.sourceMapRange = sourceMapRange;
if (tokenSourceMapRanges)
destEmitNode.tokenSourceMapRanges = mergeTokenSourceMapRanges(tokenSourceMapRanges, destEmitNode.tokenSourceMapRanges);
if (constantValue !== undefined)
destEmitNode.constantValue = constantValue;
if (helpers) {
for (var _i = 0, helpers_1 = helpers; _i < helpers_1.length; _i++) {
var helper = helpers_1[_i];
destEmitNode.helpers = ts.appendIfUnique(destEmitNode.helpers, helper);
}
}
if (startsOnNewLine !== undefined)
destEmitNode.startsOnNewLine = startsOnNewLine;
return destEmitNode;
}
function mergeTokenSourceMapRanges(sourceRanges, destRanges) {
if (!destRanges)
destRanges = [];
for (var key in sourceRanges) {
destRanges[key] = sourceRanges[key];
}
return destRanges;
}
})(ts || (ts = {}));
var ts;
(function (ts) {
/**
* Associates a node with the current transformation, initializing
* various transient transformation properties.
* @internal
*/
function getOrCreateEmitNode(node) {
var _a;
if (!node.emitNode) {
if (ts.isParseTreeNode(node)) {
// To avoid holding onto transformation artifacts, we keep track of any
// parse tree node we are annotating. This allows us to clean them up after
// all transformations have completed.
if (node.kind === 300 /* SourceFile */) {
return node.emitNode = { annotatedNodes: [node] };
}
var sourceFile = (_a = ts.getSourceFileOfNode(ts.getParseTreeNode(ts.getSourceFileOfNode(node)))) !== null && _a !== void 0 ? _a : ts.Debug.fail("Could not determine parsed source file.");
getOrCreateEmitNode(sourceFile).annotatedNodes.push(node);
}
node.emitNode = {};
}
else {
ts.Debug.assert(!(node.emitNode.flags & 268435456 /* Immutable */), "Invalid attempt to mutate an immutable node.");
}
return node.emitNode;
}
ts.getOrCreateEmitNode = getOrCreateEmitNode;
/**
* Clears any `EmitNode` entries from parse-tree nodes.
* @param sourceFile A source file.
*/
function disposeEmitNodes(sourceFile) {
var _a, _b;
// During transformation we may need to annotate a parse tree node with transient
// transformation properties. As parse tree nodes live longer than transformation
// nodes, we need to make sure we reclaim any memory allocated for custom ranges
// from these nodes to ensure we do not hold onto entire subtrees just for position
// information. We also need to reset these nodes to a pre-transformation state
// for incremental parsing scenarios so that we do not impact later emit.
var annotatedNodes = (_b = (_a = ts.getSourceFileOfNode(ts.getParseTreeNode(sourceFile))) === null || _a === void 0 ? void 0 : _a.emitNode) === null || _b === void 0 ? void 0 : _b.annotatedNodes;
if (annotatedNodes) {
for (var _i = 0, annotatedNodes_1 = annotatedNodes; _i < annotatedNodes_1.length; _i++) {
var node = annotatedNodes_1[_i];
node.emitNode = undefined;
}
}
}
ts.disposeEmitNodes = disposeEmitNodes;
/**
* Sets `EmitFlags.NoComments` on a node and removes any leading and trailing synthetic comments.
* @internal
*/
function removeAllComments(node) {
var emitNode = getOrCreateEmitNode(node);
emitNode.flags |= 1536 /* NoComments */;
emitNode.leadingComments = undefined;
emitNode.trailingComments = undefined;
return node;
}
ts.removeAllComments = removeAllComments;
/**
* Sets flags that control emit behavior of a node.
*/
function setEmitFlags(node, emitFlags) {
getOrCreateEmitNode(node).flags = emitFlags;
return node;
}
ts.setEmitFlags = setEmitFlags;
/**
* Sets flags that control emit behavior of a node.
*/
/* @internal */
function addEmitFlags(node, emitFlags) {
var emitNode = getOrCreateEmitNode(node);
emitNode.flags = emitNode.flags | emitFlags;
return node;
}
ts.addEmitFlags = addEmitFlags;
/**
* Gets a custom text range to use when emitting source maps.
*/
function getSourceMapRange(node) {
var _a, _b;
return (_b = (_a = node.emitNode) === null || _a === void 0 ? void 0 : _a.sourceMapRange) !== null && _b !== void 0 ? _b : node;
}
ts.getSourceMapRange = getSourceMapRange;
/**
* Sets a custom text range to use when emitting source maps.
*/
function setSourceMapRange(node, range) {
getOrCreateEmitNode(node).sourceMapRange = range;
return node;
}
ts.setSourceMapRange = setSourceMapRange;
/**
* Gets the TextRange to use for source maps for a token of a node.
*/
function getTokenSourceMapRange(node, token) {
var _a, _b;
return (_b = (_a = node.emitNode) === null || _a === void 0 ? void 0 : _a.tokenSourceMapRanges) === null || _b === void 0 ? void 0 : _b[token];
}
ts.getTokenSourceMapRange = getTokenSourceMapRange;
/**
* Sets the TextRange to use for source maps for a token of a node.
*/
function setTokenSourceMapRange(node, token, range) {
var _a;
var emitNode = getOrCreateEmitNode(node);
var tokenSourceMapRanges = (_a = emitNode.tokenSourceMapRanges) !== null && _a !== void 0 ? _a : (emitNode.tokenSourceMapRanges = []);
tokenSourceMapRanges[token] = range;
return node;
}
ts.setTokenSourceMapRange = setTokenSourceMapRange;
/**
* Gets a custom text range to use when emitting comments.
*/
/*@internal*/
function getStartsOnNewLine(node) {
var _a;
return (_a = node.emitNode) === null || _a === void 0 ? void 0 : _a.startsOnNewLine;
}
ts.getStartsOnNewLine = getStartsOnNewLine;
/**
* Sets a custom text range to use when emitting comments.
*/
/*@internal*/
function setStartsOnNewLine(node, newLine) {
getOrCreateEmitNode(node).startsOnNewLine = newLine;
return node;
}
ts.setStartsOnNewLine = setStartsOnNewLine;
/**
* Gets a custom text range to use when emitting comments.
*/
function getCommentRange(node) {
var _a, _b;
return (_b = (_a = node.emitNode) === null || _a === void 0 ? void 0 : _a.commentRange) !== null && _b !== void 0 ? _b : node;
}
ts.getCommentRange = getCommentRange;
/**
* Sets a custom text range to use when emitting comments.
*/
function setCommentRange(node, range) {
getOrCreateEmitNode(node).commentRange = range;
return node;
}
ts.setCommentRange = setCommentRange;
function getSyntheticLeadingComments(node) {
var _a;
return (_a = node.emitNode) === null || _a === void 0 ? void 0 : _a.leadingComments;
}
ts.getSyntheticLeadingComments = getSyntheticLeadingComments;
function setSyntheticLeadingComments(node, comments) {
getOrCreateEmitNode(node).leadingComments = comments;
return node;
}
ts.setSyntheticLeadingComments = setSyntheticLeadingComments;
function addSyntheticLeadingComment(node, kind, text, hasTrailingNewLine) {
return setSyntheticLeadingComments(node, ts.append(getSyntheticLeadingComments(node), { kind: kind, pos: -1, end: -1, hasTrailingNewLine: hasTrailingNewLine, text: text }));
}
ts.addSyntheticLeadingComment = addSyntheticLeadingComment;
function getSyntheticTrailingComments(node) {
var _a;
return (_a = node.emitNode) === null || _a === void 0 ? void 0 : _a.trailingComments;
}
ts.getSyntheticTrailingComments = getSyntheticTrailingComments;
function setSyntheticTrailingComments(node, comments) {
getOrCreateEmitNode(node).trailingComments = comments;
return node;
}
ts.setSyntheticTrailingComments = setSyntheticTrailingComments;
function addSyntheticTrailingComment(node, kind, text, hasTrailingNewLine) {
return setSyntheticTrailingComments(node, ts.append(getSyntheticTrailingComments(node), { kind: kind, pos: -1, end: -1, hasTrailingNewLine: hasTrailingNewLine, text: text }));
}
ts.addSyntheticTrailingComment = addSyntheticTrailingComment;
function moveSyntheticComments(node, original) {
setSyntheticLeadingComments(node, getSyntheticLeadingComments(original));
setSyntheticTrailingComments(node, getSyntheticTrailingComments(original));
var emit = getOrCreateEmitNode(original);
emit.leadingComments = undefined;
emit.trailingComments = undefined;
return node;
}
ts.moveSyntheticComments = moveSyntheticComments;
/**
* Gets the constant value to emit for an expression representing an enum.
*/
function getConstantValue(node) {
var _a;
return (_a = node.emitNode) === null || _a === void 0 ? void 0 : _a.constantValue;
}
ts.getConstantValue = getConstantValue;
/**
* Sets the constant value to emit for an expression.
*/
function setConstantValue(node, value) {
var emitNode = getOrCreateEmitNode(node);
emitNode.constantValue = value;
return node;
}
ts.setConstantValue = setConstantValue;
/**
* Adds an EmitHelper to a node.
*/
function addEmitHelper(node, helper) {
var emitNode = getOrCreateEmitNode(node);
emitNode.helpers = ts.append(emitNode.helpers, helper);
return node;
}
ts.addEmitHelper = addEmitHelper;
/**
* Add EmitHelpers to a node.
*/
function addEmitHelpers(node, helpers) {
if (ts.some(helpers)) {
var emitNode = getOrCreateEmitNode(node);
for (var _i = 0, helpers_2 = helpers; _i < helpers_2.length; _i++) {
var helper = helpers_2[_i];
emitNode.helpers = ts.appendIfUnique(emitNode.helpers, helper);
}
}
return node;
}
ts.addEmitHelpers = addEmitHelpers;
/**
* Removes an EmitHelper from a node.
*/
function removeEmitHelper(node, helper) {
var _a;
var helpers = (_a = node.emitNode) === null || _a === void 0 ? void 0 : _a.helpers;
if (helpers) {
return ts.orderedRemoveItem(helpers, helper);
}
return false;
}
ts.removeEmitHelper = removeEmitHelper;
/**
* Gets the EmitHelpers of a node.
*/
function getEmitHelpers(node) {
var _a;
return (_a = node.emitNode) === null || _a === void 0 ? void 0 : _a.helpers;
}
ts.getEmitHelpers = getEmitHelpers;
/**
* Moves matching emit helpers from a source node to a target node.
*/
function moveEmitHelpers(source, target, predicate) {
var sourceEmitNode = source.emitNode;
var sourceEmitHelpers = sourceEmitNode && sourceEmitNode.helpers;
if (!ts.some(sourceEmitHelpers))
return;
var targetEmitNode = getOrCreateEmitNode(target);
var helpersRemoved = 0;
for (var i = 0; i < sourceEmitHelpers.length; i++) {
var helper = sourceEmitHelpers[i];
if (predicate(helper)) {
helpersRemoved++;
targetEmitNode.helpers = ts.appendIfUnique(targetEmitNode.helpers, helper);
}
else if (helpersRemoved > 0) {
sourceEmitHelpers[i - helpersRemoved] = helper;
}
}
if (helpersRemoved > 0) {
sourceEmitHelpers.length -= helpersRemoved;
}
}
ts.moveEmitHelpers = moveEmitHelpers;
/* @internal */
function ignoreSourceNewlines(node) {
getOrCreateEmitNode(node).flags |= 134217728 /* IgnoreSourceNewlines */;
return node;
}
ts.ignoreSourceNewlines = ignoreSourceNewlines;
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
function createEmitHelperFactory(context) {
var factory = context.factory;
var immutableTrue = ts.memoize(function () { return ts.setEmitFlags(factory.createTrue(), 268435456 /* Immutable */); });
var immutableFalse = ts.memoize(function () { return ts.setEmitFlags(factory.createFalse(), 268435456 /* Immutable */); });
return {
getUnscopedHelperName: getUnscopedHelperName,
// TypeScript Helpers
createDecorateHelper: createDecorateHelper,
createMetadataHelper: createMetadataHelper,
createParamHelper: createParamHelper,
// ES2018 Helpers
createAssignHelper: createAssignHelper,
createAwaitHelper: createAwaitHelper,
createAsyncGeneratorHelper: createAsyncGeneratorHelper,
createAsyncDelegatorHelper: createAsyncDelegatorHelper,
createAsyncValuesHelper: createAsyncValuesHelper,
// ES2018 Destructuring Helpers
createRestHelper: createRestHelper,
// ES2017 Helpers
createAwaiterHelper: createAwaiterHelper,
// ES2015 Helpers
createExtendsHelper: createExtendsHelper,
createTemplateObjectHelper: createTemplateObjectHelper,
createSpreadArrayHelper: createSpreadArrayHelper,
// ES2015 Destructuring Helpers
createValuesHelper: createValuesHelper,
createReadHelper: createReadHelper,
// ES2015 Generator Helpers
createGeneratorHelper: createGeneratorHelper,
// ES Module Helpers
createCreateBindingHelper: createCreateBindingHelper,
createImportStarHelper: createImportStarHelper,
createImportStarCallbackHelper: createImportStarCallbackHelper,
createImportDefaultHelper: createImportDefaultHelper,
createExportStarHelper: createExportStarHelper,
// Class Fields Helpers
createClassPrivateFieldGetHelper: createClassPrivateFieldGetHelper,
createClassPrivateFieldSetHelper: createClassPrivateFieldSetHelper,
};
/**
* Gets an identifier for the name of an *unscoped* emit helper.
*/
function getUnscopedHelperName(name) {
return ts.setEmitFlags(factory.createIdentifier(name), 4096 /* HelperName */ | 2 /* AdviseOnEmitNode */);
}
// TypeScript Helpers
function createDecorateHelper(decoratorExpressions, target, memberName, descriptor) {
context.requestEmitHelper(ts.decorateHelper);
var argumentsArray = [];
argumentsArray.push(factory.createArrayLiteralExpression(decoratorExpressions, /*multiLine*/ true));
argumentsArray.push(target);
if (memberName) {
argumentsArray.push(memberName);
if (descriptor) {
argumentsArray.push(descriptor);
}
}
return factory.createCallExpression(getUnscopedHelperName("__decorate"),
/*typeArguments*/ undefined, argumentsArray);
}
function createMetadataHelper(metadataKey, metadataValue) {
context.requestEmitHelper(ts.metadataHelper);
return factory.createCallExpression(getUnscopedHelperName("__metadata"),
/*typeArguments*/ undefined, [
factory.createStringLiteral(metadataKey),
metadataValue
]);
}
function createParamHelper(expression, parameterOffset, location) {
context.requestEmitHelper(ts.paramHelper);
return ts.setTextRange(factory.createCallExpression(getUnscopedHelperName("__param"),
/*typeArguments*/ undefined, [
factory.createNumericLiteral(parameterOffset + ""),
expression
]), location);
}
// ES2018 Helpers
function createAssignHelper(attributesSegments) {
if (context.getCompilerOptions().target >= 2 /* ES2015 */) {
return factory.createCallExpression(factory.createPropertyAccessExpression(factory.createIdentifier("Object"), "assign"),
/*typeArguments*/ undefined, attributesSegments);
}
context.requestEmitHelper(ts.assignHelper);
return factory.createCallExpression(getUnscopedHelperName("__assign"),
/*typeArguments*/ undefined, attributesSegments);
}
function createAwaitHelper(expression) {
context.requestEmitHelper(ts.awaitHelper);
return factory.createCallExpression(getUnscopedHelperName("__await"), /*typeArguments*/ undefined, [expression]);
}
function createAsyncGeneratorHelper(generatorFunc, hasLexicalThis) {
context.requestEmitHelper(ts.awaitHelper);
context.requestEmitHelper(ts.asyncGeneratorHelper);
// Mark this node as originally an async function
(generatorFunc.emitNode || (generatorFunc.emitNode = {})).flags |= 262144 /* AsyncFunctionBody */ | 524288 /* ReuseTempVariableScope */;
return factory.createCallExpression(getUnscopedHelperName("__asyncGenerator"),
/*typeArguments*/ undefined, [
hasLexicalThis ? factory.createThis() : factory.createVoidZero(),
factory.createIdentifier("arguments"),
generatorFunc
]);
}
function createAsyncDelegatorHelper(expression) {
context.requestEmitHelper(ts.awaitHelper);
context.requestEmitHelper(ts.asyncDelegator);
return factory.createCallExpression(getUnscopedHelperName("__asyncDelegator"),
/*typeArguments*/ undefined, [expression]);
}
function createAsyncValuesHelper(expression) {
context.requestEmitHelper(ts.asyncValues);
return factory.createCallExpression(getUnscopedHelperName("__asyncValues"),
/*typeArguments*/ undefined, [expression]);
}
// ES2018 Destructuring Helpers
/** Given value: o, propName: p, pattern: { a, b, ...p } from the original statement
* `{ a, b, ...p } = o`, create `p = __rest(o, ["a", "b"]);`
*/
function createRestHelper(value, elements, computedTempVariables, location) {
context.requestEmitHelper(ts.restHelper);
var propertyNames = [];
var computedTempVariableOffset = 0;
for (var i = 0; i < elements.length - 1; i++) {
var propertyName = ts.getPropertyNameOfBindingOrAssignmentElement(elements[i]);
if (propertyName) {
if (ts.isComputedPropertyName(propertyName)) {
ts.Debug.assertIsDefined(computedTempVariables, "Encountered computed property name but 'computedTempVariables' argument was not provided.");
var temp = computedTempVariables[computedTempVariableOffset];
computedTempVariableOffset++;
// typeof _tmp === "symbol" ? _tmp : _tmp + ""
propertyNames.push(factory.createConditionalExpression(factory.createTypeCheck(temp, "symbol"),
/*questionToken*/ undefined, temp,
/*colonToken*/ undefined, factory.createAdd(temp, factory.createStringLiteral(""))));
}
else {
propertyNames.push(factory.createStringLiteralFromNode(propertyName));
}
}
}
return factory.createCallExpression(getUnscopedHelperName("__rest"),
/*typeArguments*/ undefined, [
value,
ts.setTextRange(factory.createArrayLiteralExpression(propertyNames), location)
]);
}
// ES2017 Helpers
function createAwaiterHelper(hasLexicalThis, hasLexicalArguments, promiseConstructor, body) {
context.requestEmitHelper(ts.awaiterHelper);
var generatorFunc = factory.createFunctionExpression(
/*modifiers*/ undefined, factory.createToken(41 /* AsteriskToken */),
/*name*/ undefined,
/*typeParameters*/ undefined,
/*parameters*/ [],
/*type*/ undefined, body);
// Mark this node as originally an async function
(generatorFunc.emitNode || (generatorFunc.emitNode = {})).flags |= 262144 /* AsyncFunctionBody */ | 524288 /* ReuseTempVariableScope */;
return factory.createCallExpression(getUnscopedHelperName("__awaiter"),
/*typeArguments*/ undefined, [
hasLexicalThis ? factory.createThis() : factory.createVoidZero(),
hasLexicalArguments ? factory.createIdentifier("arguments") : factory.createVoidZero(),
promiseConstructor ? ts.createExpressionFromEntityName(factory, promiseConstructor) : factory.createVoidZero(),
generatorFunc
]);
}
// ES2015 Helpers
function createExtendsHelper(name) {
context.requestEmitHelper(ts.extendsHelper);
return factory.createCallExpression(getUnscopedHelperName("__extends"),
/*typeArguments*/ undefined, [name, factory.createUniqueName("_super", 16 /* Optimistic */ | 32 /* FileLevel */)]);
}
function createTemplateObjectHelper(cooked, raw) {
context.requestEmitHelper(ts.templateObjectHelper);
return factory.createCallExpression(getUnscopedHelperName("__makeTemplateObject"),
/*typeArguments*/ undefined, [cooked, raw]);
}
function createSpreadArrayHelper(to, from, packFrom) {
context.requestEmitHelper(ts.spreadArrayHelper);
return factory.createCallExpression(getUnscopedHelperName("__spreadArray"),
/*typeArguments*/ undefined, [to, from, packFrom ? immutableTrue() : immutableFalse()]);
}
// ES2015 Destructuring Helpers
function createValuesHelper(expression) {
context.requestEmitHelper(ts.valuesHelper);
return factory.createCallExpression(getUnscopedHelperName("__values"),
/*typeArguments*/ undefined, [expression]);
}
function createReadHelper(iteratorRecord, count) {
context.requestEmitHelper(ts.readHelper);
return factory.createCallExpression(getUnscopedHelperName("__read"),
/*typeArguments*/ undefined, count !== undefined
? [iteratorRecord, factory.createNumericLiteral(count + "")]
: [iteratorRecord]);
}
// ES2015 Generator Helpers
function createGeneratorHelper(body) {
context.requestEmitHelper(ts.generatorHelper);
return factory.createCallExpression(getUnscopedHelperName("__generator"),
/*typeArguments*/ undefined, [factory.createThis(), body]);
}
// ES Module Helpers
function createCreateBindingHelper(module, inputName, outputName) {
context.requestEmitHelper(ts.createBindingHelper);
return factory.createCallExpression(getUnscopedHelperName("__createBinding"),
/*typeArguments*/ undefined, __spreadArray([factory.createIdentifier("exports"), module, inputName], (outputName ? [outputName] : []), true));
}
function createImportStarHelper(expression) {
context.requestEmitHelper(ts.importStarHelper);
return factory.createCallExpression(getUnscopedHelperName("__importStar"),
/*typeArguments*/ undefined, [expression]);
}
function createImportStarCallbackHelper() {
context.requestEmitHelper(ts.importStarHelper);
return getUnscopedHelperName("__importStar");
}
function createImportDefaultHelper(expression) {
context.requestEmitHelper(ts.importDefaultHelper);
return factory.createCallExpression(getUnscopedHelperName("__importDefault"),
/*typeArguments*/ undefined, [expression]);
}
function createExportStarHelper(moduleExpression, exportsExpression) {
if (exportsExpression === void 0) { exportsExpression = factory.createIdentifier("exports"); }
context.requestEmitHelper(ts.exportStarHelper);
context.requestEmitHelper(ts.createBindingHelper);
return factory.createCallExpression(getUnscopedHelperName("__exportStar"),
/*typeArguments*/ undefined, [moduleExpression, exportsExpression]);
}
// Class Fields Helpers
function createClassPrivateFieldGetHelper(receiver, state, kind, f) {
context.requestEmitHelper(ts.classPrivateFieldGetHelper);
var args;
if (!f) {
args = [receiver, state, factory.createStringLiteral(kind)];
}
else {
args = [receiver, state, factory.createStringLiteral(kind), f];
}
return factory.createCallExpression(getUnscopedHelperName("__classPrivateFieldGet"), /*typeArguments*/ undefined, args);
}
function createClassPrivateFieldSetHelper(receiver, state, value, kind, f) {
context.requestEmitHelper(ts.classPrivateFieldSetHelper);
var args;
if (!f) {
args = [receiver, state, value, factory.createStringLiteral(kind)];
}
else {
args = [receiver, state, value, factory.createStringLiteral(kind), f];
}
return factory.createCallExpression(getUnscopedHelperName("__classPrivateFieldSet"), /*typeArguments*/ undefined, args);
}
}
ts.createEmitHelperFactory = createEmitHelperFactory;
/* @internal */
function compareEmitHelpers(x, y) {
if (x === y)
return 0 /* EqualTo */;
if (x.priority === y.priority)
return 0 /* EqualTo */;
if (x.priority === undefined)
return 1 /* GreaterThan */;
if (y.priority === undefined)
return -1 /* LessThan */;
return ts.compareValues(x.priority, y.priority);
}
ts.compareEmitHelpers = compareEmitHelpers;
/**
* @param input Template string input strings
* @param args Names which need to be made file-level unique
*/
function helperString(input) {
var args = [];
for (var _i = 1; _i < arguments.length; _i++) {
args[_i - 1] = arguments[_i];
}
return function (uniqueName) {
var result = "";
for (var i = 0; i < args.length; i++) {
result += input[i];
result += uniqueName(args[i]);
}
result += input[input.length - 1];
return result;
};
}
ts.helperString = helperString;
// TypeScript Helpers
ts.decorateHelper = {
name: "typescript:decorate",
importName: "__decorate",
scoped: false,
priority: 2,
text: "\n var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n };"
};
ts.metadataHelper = {
name: "typescript:metadata",
importName: "__metadata",
scoped: false,
priority: 3,
text: "\n var __metadata = (this && this.__metadata) || function (k, v) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(k, v);\n };"
};
ts.paramHelper = {
name: "typescript:param",
importName: "__param",
scoped: false,
priority: 4,
text: "\n var __param = (this && this.__param) || function (paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n };"
};
// ES2018 Helpers
ts.assignHelper = {
name: "typescript:assign",
importName: "__assign",
scoped: false,
priority: 1,
text: "\n var __assign = (this && this.__assign) || function () {\n __assign = Object.assign || function(t) {\n for (var s, i = 1, n = arguments.length; i < n; i++) {\n s = arguments[i];\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))\n t[p] = s[p];\n }\n return t;\n };\n return __assign.apply(this, arguments);\n };"
};
ts.awaitHelper = {
name: "typescript:await",
importName: "__await",
scoped: false,
text: "\n var __await = (this && this.__await) || function (v) { return this instanceof __await ? (this.v = v, this) : new __await(v); }"
};
ts.asyncGeneratorHelper = {
name: "typescript:asyncGenerator",
importName: "__asyncGenerator",
scoped: false,
dependencies: [ts.awaitHelper],
text: "\n var __asyncGenerator = (this && this.__asyncGenerator) || function (thisArg, _arguments, generator) {\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\n return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\n function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n function fulfill(value) { resume(\"next\", value); }\n function reject(value) { resume(\"throw\", value); }\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n };"
};
ts.asyncDelegator = {
name: "typescript:asyncDelegator",
importName: "__asyncDelegator",
scoped: false,
dependencies: [ts.awaitHelper],
text: "\n var __asyncDelegator = (this && this.__asyncDelegator) || function (o) {\n var i, p;\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\n };"
};
ts.asyncValues = {
name: "typescript:asyncValues",
importName: "__asyncValues",
scoped: false,
text: "\n var __asyncValues = (this && this.__asyncValues) || function (o) {\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n var m = o[Symbol.asyncIterator], i;\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n };"
};
// ES2018 Destructuring Helpers
ts.restHelper = {
name: "typescript:rest",
importName: "__rest",
scoped: false,
text: "\n var __rest = (this && this.__rest) || function (s, e) {\n var t = {};\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n t[p] = s[p];\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n t[p[i]] = s[p[i]];\n }\n return t;\n };"
};
// ES2017 Helpers
ts.awaiterHelper = {
name: "typescript:awaiter",
importName: "__awaiter",
scoped: false,
priority: 5,
text: "\n var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n };"
};
// ES2015 Helpers
ts.extendsHelper = {
name: "typescript:extends",
importName: "__extends",
scoped: false,
priority: 0,
text: "\n var __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n\n return function (d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n })();"
};
ts.templateObjectHelper = {
name: "typescript:makeTemplateObject",
importName: "__makeTemplateObject",
scoped: false,
priority: 0,
text: "\n var __makeTemplateObject = (this && this.__makeTemplateObject) || function (cooked, raw) {\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n return cooked;\n };"
};
ts.readHelper = {
name: "typescript:read",
importName: "__read",
scoped: false,
text: "\n var __read = (this && this.__read) || function (o, n) {\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n if (!m) return o;\n var i = m.call(o), r, ar = [], e;\n try {\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n }\n catch (error) { e = { error: error }; }\n finally {\n try {\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\n }\n finally { if (e) throw e.error; }\n }\n return ar;\n };"
};
ts.spreadArrayHelper = {
name: "typescript:spreadArray",
importName: "__spreadArray",
scoped: false,
text: "\n var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {\n if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n if (ar || !(i in from)) {\n if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n ar[i] = from[i];\n }\n }\n return to.concat(ar || Array.prototype.slice.call(from));\n };"
};
// ES2015 Destructuring Helpers
ts.valuesHelper = {
name: "typescript:values",
importName: "__values",
scoped: false,
text: "\n var __values = (this && this.__values) || function(o) {\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n if (m) return m.call(o);\n if (o && typeof o.length === \"number\") return {\n next: function () {\n if (o && i >= o.length) o = void 0;\n return { value: o && o[i++], done: !o };\n }\n };\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n };"
};
// ES2015 Generator Helpers
// The __generator helper is used by down-level transformations to emulate the runtime
// semantics of an ES2015 generator function. When called, this helper returns an
// object that implements the Iterator protocol, in that it has `next`, `return`, and
// `throw` methods that step through the generator when invoked.
//
// parameters:
// @param thisArg The value to use as the `this` binding for the transformed generator body.
// @param body A function that acts as the transformed generator body.
//
// variables:
// _ Persistent state for the generator that is shared between the helper and the
// generator body. The state object has the following members:
// sent() - A method that returns or throws the current completion value.
// label - The next point at which to resume evaluation of the generator body.
// trys - A stack of protected regions (try/catch/finally blocks).
// ops - A stack of pending instructions when inside of a finally block.
// f A value indicating whether the generator is executing.
// y An iterator to delegate for a yield*.
// t A temporary variable that holds one of the following values (note that these
// cases do not overlap):
// - The completion value when resuming from a `yield` or `yield*`.
// - The error value for a catch block.
// - The current protected region (array of try/catch/finally/end labels).
// - The verb (`next`, `throw`, or `return` method) to delegate to the expression
// of a `yield*`.
// - The result of evaluating the verb delegated to the expression of a `yield*`.
//
// functions:
// verb(n) Creates a bound callback to the `step` function for opcode `n`.
// step(op) Evaluates opcodes in a generator body until execution is suspended or
// completed.
//
// The __generator helper understands a limited set of instructions:
// 0: next(value?) - Start or resume the generator with the specified value.
// 1: throw(error) - Resume the generator with an exception. If the generator is
// suspended inside of one or more protected regions, evaluates
// any intervening finally blocks between the current label and
// the nearest catch block or function boundary. If uncaught, the
// exception is thrown to the caller.
// 2: return(value?) - Resume the generator as if with a return. If the generator is
// suspended inside of one or more protected regions, evaluates any
// intervening finally blocks.
// 3: break(label) - Jump to the specified label. If the label is outside of the
// current protected region, evaluates any intervening finally
// blocks.
// 4: yield(value?) - Yield execution to the caller with an optional value. When
// resumed, the generator will continue at the next label.
// 5: yield*(value) - Delegates evaluation to the supplied iterator. When
// delegation completes, the generator will continue at the next
// label.
// 6: catch(error) - Handles an exception thrown from within the generator body. If
// the current label is inside of one or more protected regions,
// evaluates any intervening finally blocks between the current
// label and the nearest catch block or function boundary. If
// uncaught, the exception is thrown to the caller.
// 7: endfinally - Ends a finally block, resuming the last instruction prior to
// entering a finally block.
//
// For examples of how these are used, see the comments in ./transformers/generators.ts
ts.generatorHelper = {
name: "typescript:generator",
importName: "__generator",
scoped: false,
priority: 6,
text: "\n var __generator = (this && this.__generator) || function (thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (_) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n };"
};
// ES Module Helpers
ts.createBindingHelper = {
name: "typescript:commonjscreatebinding",
importName: "__createBinding",
scoped: false,
priority: 1,
text: "\n var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n }) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n }));"
};
ts.setModuleDefaultHelper = {
name: "typescript:commonjscreatevalue",
importName: "__setModuleDefault",
scoped: false,
priority: 1,
text: "\n var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n }) : function(o, v) {\n o[\"default\"] = v;\n });"
};
// emit helper for `import * as Name from "foo"`
ts.importStarHelper = {
name: "typescript:commonjsimportstar",
importName: "__importStar",
scoped: false,
dependencies: [ts.createBindingHelper, ts.setModuleDefaultHelper],
priority: 2,
text: "\n var __importStar = (this && this.__importStar) || function (mod) {\n if (mod && mod.__esModule) return mod;\n var result = {};\n if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n __setModuleDefault(result, mod);\n return result;\n };"
};
// emit helper for `import Name from "foo"`
ts.importDefaultHelper = {
name: "typescript:commonjsimportdefault",
importName: "__importDefault",
scoped: false,
text: "\n var __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n };"
};
ts.exportStarHelper = {
name: "typescript:export-star",
importName: "__exportStar",
scoped: false,
dependencies: [ts.createBindingHelper],
priority: 2,
text: "\n var __exportStar = (this && this.__exportStar) || function(m, exports) {\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n };"
};
/**
* Parameters:
* @param receiver — The object from which the private member will be read.
* @param state — One of the following:
* - A WeakMap used to read a private instance field.
* - A WeakSet used as an instance brand for private instance methods and accessors.
* - A function value that should be the undecorated class constructor used to brand check private static fields, methods, and accessors.
* @param kind — (optional pre TS 4.3, required for TS 4.3+) One of the following values:
* - undefined — Indicates a private instance field (pre TS 4.3).
* - "f" — Indicates a private field (instance or static).
* - "m" — Indicates a private method (instance or static).
* - "a" — Indicates a private accessor (instance or static).
* @param f — (optional pre TS 4.3) Depends on the arguments for state and kind:
* - If kind is "m", this should be the function corresponding to the static or instance method.
* - If kind is "a", this should be the function corresponding to the getter method, or undefined if the getter was not defined.
* - If kind is "f" and state is a function, this should be an object holding the value of a static field, or undefined if the static field declaration has not yet been evaluated.
* Usage:
* This helper will only ever be used by the compiler in the following ways:
*
* Reading from a private instance field (pre TS 4.3):
* __classPrivateFieldGet(<any>, <WeakMap>)
*
* Reading from a private instance field (TS 4.3+):
* __classPrivateFieldGet(<any>, <WeakMap>, "f")
*
* Reading from a private instance get accessor (when defined, TS 4.3+):
* __classPrivateFieldGet(<any>, <WeakSet>, "a", <function>)
*
* Reading from a private instance get accessor (when not defined, TS 4.3+):
* __classPrivateFieldGet(<any>, <WeakSet>, "a", void 0)
* NOTE: This always results in a runtime error.
*
* Reading from a private instance method (TS 4.3+):
* __classPrivateFieldGet(<any>, <WeakSet>, "m", <function>)
*
* Reading from a private static field (TS 4.3+):
* __classPrivateFieldGet(<any>, <constructor>, "f", <{ value: any }>)
*
* Reading from a private static get accessor (when defined, TS 4.3+):
* __classPrivateFieldGet(<any>, <constructor>, "a", <function>)
*
* Reading from a private static get accessor (when not defined, TS 4.3+):
* __classPrivateFieldGet(<any>, <constructor>, "a", void 0)
* NOTE: This always results in a runtime error.
*
* Reading from a private static method (TS 4.3+):
* __classPrivateFieldGet(<any>, <constructor>, "m", <function>)
*/
ts.classPrivateFieldGetHelper = {
name: "typescript:classPrivateFieldGet",
importName: "__classPrivateFieldGet",
scoped: false,
text: "\n var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n };"
};
/**
* Parameters:
* @param receiver — The object on which the private member will be set.
* @param state — One of the following:
* - A WeakMap used to store a private instance field.
* - A WeakSet used as an instance brand for private instance methods and accessors.
* - A function value that should be the undecorated class constructor used to brand check private static fields, methods, and accessors.
* @param value — The value to set.
* @param kind — (optional pre TS 4.3, required for TS 4.3+) One of the following values:
* - undefined — Indicates a private instance field (pre TS 4.3).
* - "f" — Indicates a private field (instance or static).
* - "m" — Indicates a private method (instance or static).
* - "a" — Indicates a private accessor (instance or static).
* @param f — (optional pre TS 4.3) Depends on the arguments for state and kind:
* - If kind is "m", this should be the function corresponding to the static or instance method.
* - If kind is "a", this should be the function corresponding to the setter method, or undefined if the setter was not defined.
* - If kind is "f" and state is a function, this should be an object holding the value of a static field, or undefined if the static field declaration has not yet been evaluated.
* Usage:
* This helper will only ever be used by the compiler in the following ways:
*
* Writing to a private instance field (pre TS 4.3):
* __classPrivateFieldSet(<any>, <WeakMap>, <any>)
*
* Writing to a private instance field (TS 4.3+):
* __classPrivateFieldSet(<any>, <WeakMap>, <any>, "f")
*
* Writing to a private instance set accessor (when defined, TS 4.3+):
* __classPrivateFieldSet(<any>, <WeakSet>, <any>, "a", <function>)
*
* Writing to a private instance set accessor (when not defined, TS 4.3+):
* __classPrivateFieldSet(<any>, <WeakSet>, <any>, "a", void 0)
* NOTE: This always results in a runtime error.
*
* Writing to a private instance method (TS 4.3+):
* __classPrivateFieldSet(<any>, <WeakSet>, <any>, "m", <function>)
* NOTE: This always results in a runtime error.
*
* Writing to a private static field (TS 4.3+):
* __classPrivateFieldSet(<any>, <constructor>, <any>, "f", <{ value: any }>)
*
* Writing to a private static set accessor (when defined, TS 4.3+):
* __classPrivateFieldSet(<any>, <constructor>, <any>, "a", <function>)
*
* Writing to a private static set accessor (when not defined, TS 4.3+):
* __classPrivateFieldSet(<any>, <constructor>, <any>, "a", void 0)
* NOTE: This always results in a runtime error.
*
* Writing to a private static method (TS 4.3+):
* __classPrivateFieldSet(<any>, <constructor>, <any>, "m", <function>)
* NOTE: This always results in a runtime error.
*/
ts.classPrivateFieldSetHelper = {
name: "typescript:classPrivateFieldSet",
importName: "__classPrivateFieldSet",
scoped: false,
text: "\n var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n };"
};
var allUnscopedEmitHelpers;
function getAllUnscopedEmitHelpers() {
return allUnscopedEmitHelpers || (allUnscopedEmitHelpers = ts.arrayToMap([
ts.decorateHelper,
ts.metadataHelper,
ts.paramHelper,
ts.assignHelper,
ts.awaitHelper,
ts.asyncGeneratorHelper,
ts.asyncDelegator,
ts.asyncValues,
ts.restHelper,
ts.awaiterHelper,
ts.extendsHelper,
ts.templateObjectHelper,
ts.spreadArrayHelper,
ts.valuesHelper,
ts.readHelper,
ts.generatorHelper,
ts.importStarHelper,
ts.importDefaultHelper,
ts.exportStarHelper,
ts.classPrivateFieldGetHelper,
ts.classPrivateFieldSetHelper,
ts.createBindingHelper,
ts.setModuleDefaultHelper
], function (helper) { return helper.name; }));
}
ts.getAllUnscopedEmitHelpers = getAllUnscopedEmitHelpers;
ts.asyncSuperHelper = {
name: "typescript:async-super",
scoped: true,
text: helperString(__makeTemplateObject(["\n const ", " = name => super[name];"], ["\n const ", " = name => super[name];"]), "_superIndex")
};
ts.advancedAsyncSuperHelper = {
name: "typescript:advanced-async-super",
scoped: true,
text: helperString(__makeTemplateObject(["\n const ", " = (function (geti, seti) {\n const cache = Object.create(null);\n return name => cache[name] || (cache[name] = { get value() { return geti(name); }, set value(v) { seti(name, v); } });\n })(name => super[name], (name, value) => super[name] = value);"], ["\n const ", " = (function (geti, seti) {\n const cache = Object.create(null);\n return name => cache[name] || (cache[name] = { get value() { return geti(name); }, set value(v) { seti(name, v); } });\n })(name => super[name], (name, value) => super[name] = value);"]), "_superIndex")
};
function isCallToHelper(firstSegment, helperName) {
return ts.isCallExpression(firstSegment)
&& ts.isIdentifier(firstSegment.expression)
&& (ts.getEmitFlags(firstSegment.expression) & 4096 /* HelperName */) !== 0
&& firstSegment.expression.escapedText === helperName;
}
ts.isCallToHelper = isCallToHelper;
})(ts || (ts = {}));
var ts;
(function (ts) {
// Literals
function isNumericLiteral(node) {
return node.kind === 8 /* NumericLiteral */;
}
ts.isNumericLiteral = isNumericLiteral;
function isBigIntLiteral(node) {
return node.kind === 9 /* BigIntLiteral */;
}
ts.isBigIntLiteral = isBigIntLiteral;
function isStringLiteral(node) {
return node.kind === 10 /* StringLiteral */;
}
ts.isStringLiteral = isStringLiteral;
function isJsxText(node) {
return node.kind === 11 /* JsxText */;
}
ts.isJsxText = isJsxText;
function isRegularExpressionLiteral(node) {
return node.kind === 13 /* RegularExpressionLiteral */;
}
ts.isRegularExpressionLiteral = isRegularExpressionLiteral;
function isNoSubstitutionTemplateLiteral(node) {
return node.kind === 14 /* NoSubstitutionTemplateLiteral */;
}
ts.isNoSubstitutionTemplateLiteral = isNoSubstitutionTemplateLiteral;
// Pseudo-literals
function isTemplateHead(node) {
return node.kind === 15 /* TemplateHead */;
}
ts.isTemplateHead = isTemplateHead;
function isTemplateMiddle(node) {
return node.kind === 16 /* TemplateMiddle */;
}
ts.isTemplateMiddle = isTemplateMiddle;
function isTemplateTail(node) {
return node.kind === 17 /* TemplateTail */;
}
ts.isTemplateTail = isTemplateTail;
// Punctuation
function isDotDotDotToken(node) {
return node.kind === 25 /* DotDotDotToken */;
}
ts.isDotDotDotToken = isDotDotDotToken;
/*@internal*/
function isCommaToken(node) {
return node.kind === 27 /* CommaToken */;
}
ts.isCommaToken = isCommaToken;
function isPlusToken(node) {
return node.kind === 39 /* PlusToken */;
}
ts.isPlusToken = isPlusToken;
function isMinusToken(node) {
return node.kind === 40 /* MinusToken */;
}
ts.isMinusToken = isMinusToken;
function isAsteriskToken(node) {
return node.kind === 41 /* AsteriskToken */;
}
ts.isAsteriskToken = isAsteriskToken;
/*@internal*/
function isExclamationToken(node) {
return node.kind === 53 /* ExclamationToken */;
}
ts.isExclamationToken = isExclamationToken;
/*@internal*/
function isQuestionToken(node) {
return node.kind === 57 /* QuestionToken */;
}
ts.isQuestionToken = isQuestionToken;
/*@internal*/
function isColonToken(node) {
return node.kind === 58 /* ColonToken */;
}
ts.isColonToken = isColonToken;
/*@internal*/
function isQuestionDotToken(node) {
return node.kind === 28 /* QuestionDotToken */;
}
ts.isQuestionDotToken = isQuestionDotToken;
/*@internal*/
function isEqualsGreaterThanToken(node) {
return node.kind === 38 /* EqualsGreaterThanToken */;
}
ts.isEqualsGreaterThanToken = isEqualsGreaterThanToken;
// Identifiers
function isIdentifier(node) {
return node.kind === 79 /* Identifier */;
}
ts.isIdentifier = isIdentifier;
function isPrivateIdentifier(node) {
return node.kind === 80 /* PrivateIdentifier */;
}
ts.isPrivateIdentifier = isPrivateIdentifier;
// Reserved Words
/* @internal */
function isExportModifier(node) {
return node.kind === 93 /* ExportKeyword */;
}
ts.isExportModifier = isExportModifier;
/* @internal */
function isAsyncModifier(node) {
return node.kind === 130 /* AsyncKeyword */;
}
ts.isAsyncModifier = isAsyncModifier;
/* @internal */
function isAssertsKeyword(node) {
return node.kind === 128 /* AssertsKeyword */;
}
ts.isAssertsKeyword = isAssertsKeyword;
/* @internal */
function isAwaitKeyword(node) {
return node.kind === 131 /* AwaitKeyword */;
}
ts.isAwaitKeyword = isAwaitKeyword;
/* @internal */
function isReadonlyKeyword(node) {
return node.kind === 143 /* ReadonlyKeyword */;
}
ts.isReadonlyKeyword = isReadonlyKeyword;
/* @internal */
function isStaticModifier(node) {
return node.kind === 124 /* StaticKeyword */;
}
ts.isStaticModifier = isStaticModifier;
/* @internal */
function isAbstractModifier(node) {
return node.kind === 126 /* AbstractKeyword */;
}
ts.isAbstractModifier = isAbstractModifier;
/*@internal*/
function isSuperKeyword(node) {
return node.kind === 106 /* SuperKeyword */;
}
ts.isSuperKeyword = isSuperKeyword;
/*@internal*/
function isImportKeyword(node) {
return node.kind === 100 /* ImportKeyword */;
}
ts.isImportKeyword = isImportKeyword;
// Names
function isQualifiedName(node) {
return node.kind === 159 /* QualifiedName */;
}
ts.isQualifiedName = isQualifiedName;
function isComputedPropertyName(node) {
return node.kind === 160 /* ComputedPropertyName */;
}
ts.isComputedPropertyName = isComputedPropertyName;
// Signature elements
function isTypeParameterDeclaration(node) {
return node.kind === 161 /* TypeParameter */;
}
ts.isTypeParameterDeclaration = isTypeParameterDeclaration;
// TODO(rbuckton): Rename to 'isParameterDeclaration'
function isParameter(node) {
return node.kind === 162 /* Parameter */;
}
ts.isParameter = isParameter;
function isDecorator(node) {
return node.kind === 163 /* Decorator */;
}
ts.isDecorator = isDecorator;
// TypeMember
function isPropertySignature(node) {
return node.kind === 164 /* PropertySignature */;
}
ts.isPropertySignature = isPropertySignature;
function isPropertyDeclaration(node) {
return node.kind === 165 /* PropertyDeclaration */;
}
ts.isPropertyDeclaration = isPropertyDeclaration;
function isMethodSignature(node) {
return node.kind === 166 /* MethodSignature */;
}
ts.isMethodSignature = isMethodSignature;
function isMethodDeclaration(node) {
return node.kind === 167 /* MethodDeclaration */;
}
ts.isMethodDeclaration = isMethodDeclaration;
function isClassStaticBlockDeclaration(node) {
return node.kind === 168 /* ClassStaticBlockDeclaration */;
}
ts.isClassStaticBlockDeclaration = isClassStaticBlockDeclaration;
function isConstructorDeclaration(node) {
return node.kind === 169 /* Constructor */;
}
ts.isConstructorDeclaration = isConstructorDeclaration;
function isGetAccessorDeclaration(node) {
return node.kind === 170 /* GetAccessor */;
}
ts.isGetAccessorDeclaration = isGetAccessorDeclaration;
function isSetAccessorDeclaration(node) {
return node.kind === 171 /* SetAccessor */;
}
ts.isSetAccessorDeclaration = isSetAccessorDeclaration;
function isCallSignatureDeclaration(node) {
return node.kind === 172 /* CallSignature */;
}
ts.isCallSignatureDeclaration = isCallSignatureDeclaration;
function isConstructSignatureDeclaration(node) {
return node.kind === 173 /* ConstructSignature */;
}
ts.isConstructSignatureDeclaration = isConstructSignatureDeclaration;
function isIndexSignatureDeclaration(node) {
return node.kind === 174 /* IndexSignature */;
}
ts.isIndexSignatureDeclaration = isIndexSignatureDeclaration;
// Type
function isTypePredicateNode(node) {
return node.kind === 175 /* TypePredicate */;
}
ts.isTypePredicateNode = isTypePredicateNode;
function isTypeReferenceNode(node) {
return node.kind === 176 /* TypeReference */;
}
ts.isTypeReferenceNode = isTypeReferenceNode;
function isFunctionTypeNode(node) {
return node.kind === 177 /* FunctionType */;
}
ts.isFunctionTypeNode = isFunctionTypeNode;
function isConstructorTypeNode(node) {
return node.kind === 178 /* ConstructorType */;
}
ts.isConstructorTypeNode = isConstructorTypeNode;
function isTypeQueryNode(node) {
return node.kind === 179 /* TypeQuery */;
}
ts.isTypeQueryNode = isTypeQueryNode;
function isTypeLiteralNode(node) {
return node.kind === 180 /* TypeLiteral */;
}
ts.isTypeLiteralNode = isTypeLiteralNode;
function isArrayTypeNode(node) {
return node.kind === 181 /* ArrayType */;
}
ts.isArrayTypeNode = isArrayTypeNode;
function isTupleTypeNode(node) {
return node.kind === 182 /* TupleType */;
}
ts.isTupleTypeNode = isTupleTypeNode;
function isNamedTupleMember(node) {
return node.kind === 195 /* NamedTupleMember */;
}
ts.isNamedTupleMember = isNamedTupleMember;
function isOptionalTypeNode(node) {
return node.kind === 183 /* OptionalType */;
}
ts.isOptionalTypeNode = isOptionalTypeNode;
function isRestTypeNode(node) {
return node.kind === 184 /* RestType */;
}
ts.isRestTypeNode = isRestTypeNode;
function isUnionTypeNode(node) {
return node.kind === 185 /* UnionType */;
}
ts.isUnionTypeNode = isUnionTypeNode;
function isIntersectionTypeNode(node) {
return node.kind === 186 /* IntersectionType */;
}
ts.isIntersectionTypeNode = isIntersectionTypeNode;
function isConditionalTypeNode(node) {
return node.kind === 187 /* ConditionalType */;
}
ts.isConditionalTypeNode = isConditionalTypeNode;
function isInferTypeNode(node) {
return node.kind === 188 /* InferType */;
}
ts.isInferTypeNode = isInferTypeNode;
function isParenthesizedTypeNode(node) {
return node.kind === 189 /* ParenthesizedType */;
}
ts.isParenthesizedTypeNode = isParenthesizedTypeNode;
function isThisTypeNode(node) {
return node.kind === 190 /* ThisType */;
}
ts.isThisTypeNode = isThisTypeNode;
function isTypeOperatorNode(node) {
return node.kind === 191 /* TypeOperator */;
}
ts.isTypeOperatorNode = isTypeOperatorNode;
function isIndexedAccessTypeNode(node) {
return node.kind === 192 /* IndexedAccessType */;
}
ts.isIndexedAccessTypeNode = isIndexedAccessTypeNode;
function isMappedTypeNode(node) {
return node.kind === 193 /* MappedType */;
}
ts.isMappedTypeNode = isMappedTypeNode;
function isLiteralTypeNode(node) {
return node.kind === 194 /* LiteralType */;
}
ts.isLiteralTypeNode = isLiteralTypeNode;
function isImportTypeNode(node) {
return node.kind === 198 /* ImportType */;
}
ts.isImportTypeNode = isImportTypeNode;
function isTemplateLiteralTypeSpan(node) {
return node.kind === 197 /* TemplateLiteralTypeSpan */;
}
ts.isTemplateLiteralTypeSpan = isTemplateLiteralTypeSpan;
function isTemplateLiteralTypeNode(node) {
return node.kind === 196 /* TemplateLiteralType */;
}
ts.isTemplateLiteralTypeNode = isTemplateLiteralTypeNode;
// Binding patterns
function isObjectBindingPattern(node) {
return node.kind === 199 /* ObjectBindingPattern */;
}
ts.isObjectBindingPattern = isObjectBindingPattern;
function isArrayBindingPattern(node) {
return node.kind === 200 /* ArrayBindingPattern */;
}
ts.isArrayBindingPattern = isArrayBindingPattern;
function isBindingElement(node) {
return node.kind === 201 /* BindingElement */;
}
ts.isBindingElement = isBindingElement;
// Expression
function isArrayLiteralExpression(node) {
return node.kind === 202 /* ArrayLiteralExpression */;
}
ts.isArrayLiteralExpression = isArrayLiteralExpression;
function isObjectLiteralExpression(node) {
return node.kind === 203 /* ObjectLiteralExpression */;
}
ts.isObjectLiteralExpression = isObjectLiteralExpression;
function isPropertyAccessExpression(node) {
return node.kind === 204 /* PropertyAccessExpression */;
}
ts.isPropertyAccessExpression = isPropertyAccessExpression;
function isElementAccessExpression(node) {
return node.kind === 205 /* ElementAccessExpression */;
}
ts.isElementAccessExpression = isElementAccessExpression;
function isCallExpression(node) {
return node.kind === 206 /* CallExpression */;
}
ts.isCallExpression = isCallExpression;
function isNewExpression(node) {
return node.kind === 207 /* NewExpression */;
}
ts.isNewExpression = isNewExpression;
function isTaggedTemplateExpression(node) {
return node.kind === 208 /* TaggedTemplateExpression */;
}
ts.isTaggedTemplateExpression = isTaggedTemplateExpression;
function isTypeAssertionExpression(node) {
return node.kind === 209 /* TypeAssertionExpression */;
}
ts.isTypeAssertionExpression = isTypeAssertionExpression;
function isParenthesizedExpression(node) {
return node.kind === 210 /* ParenthesizedExpression */;
}
ts.isParenthesizedExpression = isParenthesizedExpression;
function isFunctionExpression(node) {
return node.kind === 211 /* FunctionExpression */;
}
ts.isFunctionExpression = isFunctionExpression;
function isArrowFunction(node) {
return node.kind === 212 /* ArrowFunction */;
}
ts.isArrowFunction = isArrowFunction;
function isDeleteExpression(node) {
return node.kind === 213 /* DeleteExpression */;
}
ts.isDeleteExpression = isDeleteExpression;
function isTypeOfExpression(node) {
return node.kind === 214 /* TypeOfExpression */;
}
ts.isTypeOfExpression = isTypeOfExpression;
function isVoidExpression(node) {
return node.kind === 215 /* VoidExpression */;
}
ts.isVoidExpression = isVoidExpression;
function isAwaitExpression(node) {
return node.kind === 216 /* AwaitExpression */;
}
ts.isAwaitExpression = isAwaitExpression;
function isPrefixUnaryExpression(node) {
return node.kind === 217 /* PrefixUnaryExpression */;
}
ts.isPrefixUnaryExpression = isPrefixUnaryExpression;
function isPostfixUnaryExpression(node) {
return node.kind === 218 /* PostfixUnaryExpression */;
}
ts.isPostfixUnaryExpression = isPostfixUnaryExpression;
function isBinaryExpression(node) {
return node.kind === 219 /* BinaryExpression */;
}
ts.isBinaryExpression = isBinaryExpression;
function isConditionalExpression(node) {
return node.kind === 220 /* ConditionalExpression */;
}
ts.isConditionalExpression = isConditionalExpression;
function isTemplateExpression(node) {
return node.kind === 221 /* TemplateExpression */;
}
ts.isTemplateExpression = isTemplateExpression;
function isYieldExpression(node) {
return node.kind === 222 /* YieldExpression */;
}
ts.isYieldExpression = isYieldExpression;
function isSpreadElement(node) {
return node.kind === 223 /* SpreadElement */;
}
ts.isSpreadElement = isSpreadElement;
function isClassExpression(node) {
return node.kind === 224 /* ClassExpression */;
}
ts.isClassExpression = isClassExpression;
function isOmittedExpression(node) {
return node.kind === 225 /* OmittedExpression */;
}
ts.isOmittedExpression = isOmittedExpression;
function isExpressionWithTypeArguments(node) {
return node.kind === 226 /* ExpressionWithTypeArguments */;
}
ts.isExpressionWithTypeArguments = isExpressionWithTypeArguments;
function isAsExpression(node) {
return node.kind === 227 /* AsExpression */;
}
ts.isAsExpression = isAsExpression;
function isNonNullExpression(node) {
return node.kind === 228 /* NonNullExpression */;
}
ts.isNonNullExpression = isNonNullExpression;
function isMetaProperty(node) {
return node.kind === 229 /* MetaProperty */;
}
ts.isMetaProperty = isMetaProperty;
function isSyntheticExpression(node) {
return node.kind === 230 /* SyntheticExpression */;
}
ts.isSyntheticExpression = isSyntheticExpression;
function isPartiallyEmittedExpression(node) {
return node.kind === 345 /* PartiallyEmittedExpression */;
}
ts.isPartiallyEmittedExpression = isPartiallyEmittedExpression;
function isCommaListExpression(node) {
return node.kind === 346 /* CommaListExpression */;
}
ts.isCommaListExpression = isCommaListExpression;
// Misc
function isTemplateSpan(node) {
return node.kind === 231 /* TemplateSpan */;
}
ts.isTemplateSpan = isTemplateSpan;
function isSemicolonClassElement(node) {
return node.kind === 232 /* SemicolonClassElement */;
}
ts.isSemicolonClassElement = isSemicolonClassElement;
// Elements
function isBlock(node) {
return node.kind === 233 /* Block */;
}
ts.isBlock = isBlock;
function isVariableStatement(node) {
return node.kind === 235 /* VariableStatement */;
}
ts.isVariableStatement = isVariableStatement;
function isEmptyStatement(node) {
return node.kind === 234 /* EmptyStatement */;
}
ts.isEmptyStatement = isEmptyStatement;
function isExpressionStatement(node) {
return node.kind === 236 /* ExpressionStatement */;
}
ts.isExpressionStatement = isExpressionStatement;
function isIfStatement(node) {
return node.kind === 237 /* IfStatement */;
}
ts.isIfStatement = isIfStatement;
function isDoStatement(node) {
return node.kind === 238 /* DoStatement */;
}
ts.isDoStatement = isDoStatement;
function isWhileStatement(node) {
return node.kind === 239 /* WhileStatement */;
}
ts.isWhileStatement = isWhileStatement;
function isForStatement(node) {
return node.kind === 240 /* ForStatement */;
}
ts.isForStatement = isForStatement;
function isForInStatement(node) {
return node.kind === 241 /* ForInStatement */;
}
ts.isForInStatement = isForInStatement;
function isForOfStatement(node) {
return node.kind === 242 /* ForOfStatement */;
}
ts.isForOfStatement = isForOfStatement;
function isContinueStatement(node) {
return node.kind === 243 /* ContinueStatement */;
}
ts.isContinueStatement = isContinueStatement;
function isBreakStatement(node) {
return node.kind === 244 /* BreakStatement */;
}
ts.isBreakStatement = isBreakStatement;
function isReturnStatement(node) {
return node.kind === 245 /* ReturnStatement */;
}
ts.isReturnStatement = isReturnStatement;
function isWithStatement(node) {
return node.kind === 246 /* WithStatement */;
}
ts.isWithStatement = isWithStatement;
function isSwitchStatement(node) {
return node.kind === 247 /* SwitchStatement */;
}
ts.isSwitchStatement = isSwitchStatement;
function isLabeledStatement(node) {
return node.kind === 248 /* LabeledStatement */;
}
ts.isLabeledStatement = isLabeledStatement;
function isThrowStatement(node) {
return node.kind === 249 /* ThrowStatement */;
}
ts.isThrowStatement = isThrowStatement;
function isTryStatement(node) {
return node.kind === 250 /* TryStatement */;
}
ts.isTryStatement = isTryStatement;
function isDebuggerStatement(node) {
return node.kind === 251 /* DebuggerStatement */;
}
ts.isDebuggerStatement = isDebuggerStatement;
function isVariableDeclaration(node) {
return node.kind === 252 /* VariableDeclaration */;
}
ts.isVariableDeclaration = isVariableDeclaration;
function isVariableDeclarationList(node) {
return node.kind === 253 /* VariableDeclarationList */;
}
ts.isVariableDeclarationList = isVariableDeclarationList;
function isFunctionDeclaration(node) {
return node.kind === 254 /* FunctionDeclaration */;
}
ts.isFunctionDeclaration = isFunctionDeclaration;
function isClassDeclaration(node) {
return node.kind === 255 /* ClassDeclaration */;
}
ts.isClassDeclaration = isClassDeclaration;
function isInterfaceDeclaration(node) {
return node.kind === 256 /* InterfaceDeclaration */;
}
ts.isInterfaceDeclaration = isInterfaceDeclaration;
function isTypeAliasDeclaration(node) {
return node.kind === 257 /* TypeAliasDeclaration */;
}
ts.isTypeAliasDeclaration = isTypeAliasDeclaration;
function isEnumDeclaration(node) {
return node.kind === 258 /* EnumDeclaration */;
}
ts.isEnumDeclaration = isEnumDeclaration;
function isModuleDeclaration(node) {
return node.kind === 259 /* ModuleDeclaration */;
}
ts.isModuleDeclaration = isModuleDeclaration;
function isModuleBlock(node) {
return node.kind === 260 /* ModuleBlock */;
}
ts.isModuleBlock = isModuleBlock;
function isCaseBlock(node) {
return node.kind === 261 /* CaseBlock */;
}
ts.isCaseBlock = isCaseBlock;
function isNamespaceExportDeclaration(node) {
return node.kind === 262 /* NamespaceExportDeclaration */;
}
ts.isNamespaceExportDeclaration = isNamespaceExportDeclaration;
function isImportEqualsDeclaration(node) {
return node.kind === 263 /* ImportEqualsDeclaration */;
}
ts.isImportEqualsDeclaration = isImportEqualsDeclaration;
function isImportDeclaration(node) {
return node.kind === 264 /* ImportDeclaration */;
}
ts.isImportDeclaration = isImportDeclaration;
function isImportClause(node) {
return node.kind === 265 /* ImportClause */;
}
ts.isImportClause = isImportClause;
function isNamespaceImport(node) {
return node.kind === 266 /* NamespaceImport */;
}
ts.isNamespaceImport = isNamespaceImport;
function isNamespaceExport(node) {
return node.kind === 272 /* NamespaceExport */;
}
ts.isNamespaceExport = isNamespaceExport;
function isNamedImports(node) {
return node.kind === 267 /* NamedImports */;
}
ts.isNamedImports = isNamedImports;
function isImportSpecifier(node) {
return node.kind === 268 /* ImportSpecifier */;
}
ts.isImportSpecifier = isImportSpecifier;
function isExportAssignment(node) {
return node.kind === 269 /* ExportAssignment */;
}
ts.isExportAssignment = isExportAssignment;
function isExportDeclaration(node) {
return node.kind === 270 /* ExportDeclaration */;
}
ts.isExportDeclaration = isExportDeclaration;
function isNamedExports(node) {
return node.kind === 271 /* NamedExports */;
}
ts.isNamedExports = isNamedExports;
function isExportSpecifier(node) {
return node.kind === 273 /* ExportSpecifier */;
}
ts.isExportSpecifier = isExportSpecifier;
function isMissingDeclaration(node) {
return node.kind === 274 /* MissingDeclaration */;
}
ts.isMissingDeclaration = isMissingDeclaration;
function isNotEmittedStatement(node) {
return node.kind === 344 /* NotEmittedStatement */;
}
ts.isNotEmittedStatement = isNotEmittedStatement;
/* @internal */
function isSyntheticReference(node) {
return node.kind === 349 /* SyntheticReferenceExpression */;
}
ts.isSyntheticReference = isSyntheticReference;
/* @internal */
function isMergeDeclarationMarker(node) {
return node.kind === 347 /* MergeDeclarationMarker */;
}
ts.isMergeDeclarationMarker = isMergeDeclarationMarker;
/* @internal */
function isEndOfDeclarationMarker(node) {
return node.kind === 348 /* EndOfDeclarationMarker */;
}
ts.isEndOfDeclarationMarker = isEndOfDeclarationMarker;
// Module References
function isExternalModuleReference(node) {
return node.kind === 275 /* ExternalModuleReference */;
}
ts.isExternalModuleReference = isExternalModuleReference;
// JSX
function isJsxElement(node) {
return node.kind === 276 /* JsxElement */;
}
ts.isJsxElement = isJsxElement;
function isJsxSelfClosingElement(node) {
return node.kind === 277 /* JsxSelfClosingElement */;
}
ts.isJsxSelfClosingElement = isJsxSelfClosingElement;
function isJsxOpeningElement(node) {
return node.kind === 278 /* JsxOpeningElement */;
}
ts.isJsxOpeningElement = isJsxOpeningElement;
function isJsxClosingElement(node) {
return node.kind === 279 /* JsxClosingElement */;
}
ts.isJsxClosingElement = isJsxClosingElement;
function isJsxFragment(node) {
return node.kind === 280 /* JsxFragment */;
}
ts.isJsxFragment = isJsxFragment;
function isJsxOpeningFragment(node) {
return node.kind === 281 /* JsxOpeningFragment */;
}
ts.isJsxOpeningFragment = isJsxOpeningFragment;
function isJsxClosingFragment(node) {
return node.kind === 282 /* JsxClosingFragment */;
}
ts.isJsxClosingFragment = isJsxClosingFragment;
function isJsxAttribute(node) {
return node.kind === 283 /* JsxAttribute */;
}
ts.isJsxAttribute = isJsxAttribute;
function isJsxAttributes(node) {
return node.kind === 284 /* JsxAttributes */;
}
ts.isJsxAttributes = isJsxAttributes;
function isJsxSpreadAttribute(node) {
return node.kind === 285 /* JsxSpreadAttribute */;
}
ts.isJsxSpreadAttribute = isJsxSpreadAttribute;
function isJsxExpression(node) {
return node.kind === 286 /* JsxExpression */;
}
ts.isJsxExpression = isJsxExpression;
// Clauses
function isCaseClause(node) {
return node.kind === 287 /* CaseClause */;
}
ts.isCaseClause = isCaseClause;
function isDefaultClause(node) {
return node.kind === 288 /* DefaultClause */;
}
ts.isDefaultClause = isDefaultClause;
function isHeritageClause(node) {
return node.kind === 289 /* HeritageClause */;
}
ts.isHeritageClause = isHeritageClause;
function isCatchClause(node) {
return node.kind === 290 /* CatchClause */;
}
ts.isCatchClause = isCatchClause;
// Property assignments
function isPropertyAssignment(node) {
return node.kind === 291 /* PropertyAssignment */;
}
ts.isPropertyAssignment = isPropertyAssignment;
function isShorthandPropertyAssignment(node) {
return node.kind === 292 /* ShorthandPropertyAssignment */;
}
ts.isShorthandPropertyAssignment = isShorthandPropertyAssignment;
function isSpreadAssignment(node) {
return node.kind === 293 /* SpreadAssignment */;
}
ts.isSpreadAssignment = isSpreadAssignment;
// Enum
function isEnumMember(node) {
return node.kind === 294 /* EnumMember */;
}
ts.isEnumMember = isEnumMember;
// Unparsed
// TODO(rbuckton): isUnparsedPrologue
function isUnparsedPrepend(node) {
return node.kind === 296 /* UnparsedPrepend */;
}
ts.isUnparsedPrepend = isUnparsedPrepend;
// TODO(rbuckton): isUnparsedText
// TODO(rbuckton): isUnparsedInternalText
// TODO(rbuckton): isUnparsedSyntheticReference
// Top-level nodes
function isSourceFile(node) {
return node.kind === 300 /* SourceFile */;
}
ts.isSourceFile = isSourceFile;
function isBundle(node) {
return node.kind === 301 /* Bundle */;
}
ts.isBundle = isBundle;
function isUnparsedSource(node) {
return node.kind === 302 /* UnparsedSource */;
}
ts.isUnparsedSource = isUnparsedSource;
// TODO(rbuckton): isInputFiles
// JSDoc Elements
function isJSDocTypeExpression(node) {
return node.kind === 304 /* JSDocTypeExpression */;
}
ts.isJSDocTypeExpression = isJSDocTypeExpression;
function isJSDocNameReference(node) {
return node.kind === 305 /* JSDocNameReference */;
}
ts.isJSDocNameReference = isJSDocNameReference;
function isJSDocMemberName(node) {
return node.kind === 306 /* JSDocMemberName */;
}
ts.isJSDocMemberName = isJSDocMemberName;
function isJSDocLink(node) {
return node.kind === 319 /* JSDocLink */;
}
ts.isJSDocLink = isJSDocLink;
function isJSDocLinkCode(node) {
return node.kind === 320 /* JSDocLinkCode */;
}
ts.isJSDocLinkCode = isJSDocLinkCode;
function isJSDocLinkPlain(node) {
return node.kind === 321 /* JSDocLinkPlain */;
}
ts.isJSDocLinkPlain = isJSDocLinkPlain;
function isJSDocAllType(node) {
return node.kind === 307 /* JSDocAllType */;
}
ts.isJSDocAllType = isJSDocAllType;
function isJSDocUnknownType(node) {
return node.kind === 308 /* JSDocUnknownType */;
}
ts.isJSDocUnknownType = isJSDocUnknownType;
function isJSDocNullableType(node) {
return node.kind === 309 /* JSDocNullableType */;
}
ts.isJSDocNullableType = isJSDocNullableType;
function isJSDocNonNullableType(node) {
return node.kind === 310 /* JSDocNonNullableType */;
}
ts.isJSDocNonNullableType = isJSDocNonNullableType;
function isJSDocOptionalType(node) {
return node.kind === 311 /* JSDocOptionalType */;
}
ts.isJSDocOptionalType = isJSDocOptionalType;
function isJSDocFunctionType(node) {
return node.kind === 312 /* JSDocFunctionType */;
}
ts.isJSDocFunctionType = isJSDocFunctionType;
function isJSDocVariadicType(node) {
return node.kind === 313 /* JSDocVariadicType */;
}
ts.isJSDocVariadicType = isJSDocVariadicType;
function isJSDocNamepathType(node) {
return node.kind === 314 /* JSDocNamepathType */;
}
ts.isJSDocNamepathType = isJSDocNamepathType;
function isJSDoc(node) {
return node.kind === 315 /* JSDocComment */;
}
ts.isJSDoc = isJSDoc;
function isJSDocTypeLiteral(node) {
return node.kind === 317 /* JSDocTypeLiteral */;
}
ts.isJSDocTypeLiteral = isJSDocTypeLiteral;
function isJSDocSignature(node) {
return node.kind === 318 /* JSDocSignature */;
}
ts.isJSDocSignature = isJSDocSignature;
// JSDoc Tags
function isJSDocAugmentsTag(node) {
return node.kind === 323 /* JSDocAugmentsTag */;
}
ts.isJSDocAugmentsTag = isJSDocAugmentsTag;
function isJSDocAuthorTag(node) {
return node.kind === 325 /* JSDocAuthorTag */;
}
ts.isJSDocAuthorTag = isJSDocAuthorTag;
function isJSDocClassTag(node) {
return node.kind === 327 /* JSDocClassTag */;
}
ts.isJSDocClassTag = isJSDocClassTag;
function isJSDocCallbackTag(node) {
return node.kind === 333 /* JSDocCallbackTag */;
}
ts.isJSDocCallbackTag = isJSDocCallbackTag;
function isJSDocPublicTag(node) {
return node.kind === 328 /* JSDocPublicTag */;
}
ts.isJSDocPublicTag = isJSDocPublicTag;
function isJSDocPrivateTag(node) {
return node.kind === 329 /* JSDocPrivateTag */;
}
ts.isJSDocPrivateTag = isJSDocPrivateTag;
function isJSDocProtectedTag(node) {
return node.kind === 330 /* JSDocProtectedTag */;
}
ts.isJSDocProtectedTag = isJSDocProtectedTag;
function isJSDocReadonlyTag(node) {
return node.kind === 331 /* JSDocReadonlyTag */;
}
ts.isJSDocReadonlyTag = isJSDocReadonlyTag;
function isJSDocOverrideTag(node) {
return node.kind === 332 /* JSDocOverrideTag */;
}
ts.isJSDocOverrideTag = isJSDocOverrideTag;
function isJSDocDeprecatedTag(node) {
return node.kind === 326 /* JSDocDeprecatedTag */;
}
ts.isJSDocDeprecatedTag = isJSDocDeprecatedTag;
function isJSDocSeeTag(node) {
return node.kind === 341 /* JSDocSeeTag */;
}
ts.isJSDocSeeTag = isJSDocSeeTag;
function isJSDocEnumTag(node) {
return node.kind === 334 /* JSDocEnumTag */;
}
ts.isJSDocEnumTag = isJSDocEnumTag;
function isJSDocParameterTag(node) {
return node.kind === 335 /* JSDocParameterTag */;
}
ts.isJSDocParameterTag = isJSDocParameterTag;
function isJSDocReturnTag(node) {
return node.kind === 336 /* JSDocReturnTag */;
}
ts.isJSDocReturnTag = isJSDocReturnTag;
function isJSDocThisTag(node) {
return node.kind === 337 /* JSDocThisTag */;
}
ts.isJSDocThisTag = isJSDocThisTag;
function isJSDocTypeTag(node) {
return node.kind === 338 /* JSDocTypeTag */;
}
ts.isJSDocTypeTag = isJSDocTypeTag;
function isJSDocTemplateTag(node) {
return node.kind === 339 /* JSDocTemplateTag */;
}
ts.isJSDocTemplateTag = isJSDocTemplateTag;
function isJSDocTypedefTag(node) {
return node.kind === 340 /* JSDocTypedefTag */;
}
ts.isJSDocTypedefTag = isJSDocTypedefTag;
function isJSDocUnknownTag(node) {
return node.kind === 322 /* JSDocTag */;
}
ts.isJSDocUnknownTag = isJSDocUnknownTag;
function isJSDocPropertyTag(node) {
return node.kind === 342 /* JSDocPropertyTag */;
}
ts.isJSDocPropertyTag = isJSDocPropertyTag;
function isJSDocImplementsTag(node) {
return node.kind === 324 /* JSDocImplementsTag */;
}
ts.isJSDocImplementsTag = isJSDocImplementsTag;
// Synthesized list
/* @internal */
function isSyntaxList(n) {
return n.kind === 343 /* SyntaxList */;
}
ts.isSyntaxList = isSyntaxList;
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
// Compound nodes
function createEmptyExports(factory) {
return factory.createExportDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*isTypeOnly*/ false, factory.createNamedExports([]), /*moduleSpecifier*/ undefined);
}
ts.createEmptyExports = createEmptyExports;
function createMemberAccessForPropertyName(factory, target, memberName, location) {
if (ts.isComputedPropertyName(memberName)) {
return ts.setTextRange(factory.createElementAccessExpression(target, memberName.expression), location);
}
else {
var expression = ts.setTextRange(ts.isMemberName(memberName)
? factory.createPropertyAccessExpression(target, memberName)
: factory.createElementAccessExpression(target, memberName), memberName);
ts.getOrCreateEmitNode(expression).flags |= 64 /* NoNestedSourceMaps */;
return expression;
}
}
ts.createMemberAccessForPropertyName = createMemberAccessForPropertyName;
function createReactNamespace(reactNamespace, parent) {
// To ensure the emit resolver can properly resolve the namespace, we need to
// treat this identifier as if it were a source tree node by clearing the `Synthesized`
// flag and setting a parent node.
var react = ts.parseNodeFactory.createIdentifier(reactNamespace || "React");
// Set the parent that is in parse tree
// this makes sure that parent chain is intact for checker to traverse complete scope tree
ts.setParent(react, ts.getParseTreeNode(parent));
return react;
}
function createJsxFactoryExpressionFromEntityName(factory, jsxFactory, parent) {
if (ts.isQualifiedName(jsxFactory)) {
var left = createJsxFactoryExpressionFromEntityName(factory, jsxFactory.left, parent);
var right = factory.createIdentifier(ts.idText(jsxFactory.right));
right.escapedText = jsxFactory.right.escapedText;
return factory.createPropertyAccessExpression(left, right);
}
else {
return createReactNamespace(ts.idText(jsxFactory), parent);
}
}
function createJsxFactoryExpression(factory, jsxFactoryEntity, reactNamespace, parent) {
return jsxFactoryEntity ?
createJsxFactoryExpressionFromEntityName(factory, jsxFactoryEntity, parent) :
factory.createPropertyAccessExpression(createReactNamespace(reactNamespace, parent), "createElement");
}
ts.createJsxFactoryExpression = createJsxFactoryExpression;
function createJsxFragmentFactoryExpression(factory, jsxFragmentFactoryEntity, reactNamespace, parent) {
return jsxFragmentFactoryEntity ?
createJsxFactoryExpressionFromEntityName(factory, jsxFragmentFactoryEntity, parent) :
factory.createPropertyAccessExpression(createReactNamespace(reactNamespace, parent), "Fragment");
}
function createExpressionForJsxElement(factory, callee, tagName, props, children, location) {
var argumentsList = [tagName];
if (props) {
argumentsList.push(props);
}
if (children && children.length > 0) {
if (!props) {
argumentsList.push(factory.createNull());
}
if (children.length > 1) {
for (var _i = 0, children_3 = children; _i < children_3.length; _i++) {
var child = children_3[_i];
startOnNewLine(child);
argumentsList.push(child);
}
}
else {
argumentsList.push(children[0]);
}
}
return ts.setTextRange(factory.createCallExpression(callee,
/*typeArguments*/ undefined, argumentsList), location);
}
ts.createExpressionForJsxElement = createExpressionForJsxElement;
function createExpressionForJsxFragment(factory, jsxFactoryEntity, jsxFragmentFactoryEntity, reactNamespace, children, parentElement, location) {
var tagName = createJsxFragmentFactoryExpression(factory, jsxFragmentFactoryEntity, reactNamespace, parentElement);
var argumentsList = [tagName, factory.createNull()];
if (children && children.length > 0) {
if (children.length > 1) {
for (var _i = 0, children_4 = children; _i < children_4.length; _i++) {
var child = children_4[_i];
startOnNewLine(child);
argumentsList.push(child);
}
}
else {
argumentsList.push(children[0]);
}
}
return ts.setTextRange(factory.createCallExpression(createJsxFactoryExpression(factory, jsxFactoryEntity, reactNamespace, parentElement),
/*typeArguments*/ undefined, argumentsList), location);
}
ts.createExpressionForJsxFragment = createExpressionForJsxFragment;
// Utilities
function createForOfBindingStatement(factory, node, boundValue) {
if (ts.isVariableDeclarationList(node)) {
var firstDeclaration = ts.first(node.declarations);
var updatedDeclaration = factory.updateVariableDeclaration(firstDeclaration, firstDeclaration.name,
/*exclamationToken*/ undefined,
/*type*/ undefined, boundValue);
return ts.setTextRange(factory.createVariableStatement(
/*modifiers*/ undefined, factory.updateVariableDeclarationList(node, [updatedDeclaration])),
/*location*/ node);
}
else {
var updatedExpression = ts.setTextRange(factory.createAssignment(node, boundValue), /*location*/ node);
return ts.setTextRange(factory.createExpressionStatement(updatedExpression), /*location*/ node);
}
}
ts.createForOfBindingStatement = createForOfBindingStatement;
function insertLeadingStatement(factory, dest, source) {
if (ts.isBlock(dest)) {
return factory.updateBlock(dest, ts.setTextRange(factory.createNodeArray(__spreadArray([source], dest.statements, true)), dest.statements));
}
else {
return factory.createBlock(factory.createNodeArray([dest, source]), /*multiLine*/ true);
}
}
ts.insertLeadingStatement = insertLeadingStatement;
function createExpressionFromEntityName(factory, node) {
if (ts.isQualifiedName(node)) {
var left = createExpressionFromEntityName(factory, node.left);
// TODO(rbuckton): Does this need to be parented?
var right = ts.setParent(ts.setTextRange(factory.cloneNode(node.right), node.right), node.right.parent);
return ts.setTextRange(factory.createPropertyAccessExpression(left, right), node);
}
else {
// TODO(rbuckton): Does this need to be parented?
return ts.setParent(ts.setTextRange(factory.cloneNode(node), node), node.parent);
}
}
ts.createExpressionFromEntityName = createExpressionFromEntityName;
function createExpressionForPropertyName(factory, memberName) {
if (ts.isIdentifier(memberName)) {
return factory.createStringLiteralFromNode(memberName);
}
else if (ts.isComputedPropertyName(memberName)) {
// TODO(rbuckton): Does this need to be parented?
return ts.setParent(ts.setTextRange(factory.cloneNode(memberName.expression), memberName.expression), memberName.expression.parent);
}
else {
// TODO(rbuckton): Does this need to be parented?
return ts.setParent(ts.setTextRange(factory.cloneNode(memberName), memberName), memberName.parent);
}
}
ts.createExpressionForPropertyName = createExpressionForPropertyName;
function createExpressionForAccessorDeclaration(factory, properties, property, receiver, multiLine) {
var _a = ts.getAllAccessorDeclarations(properties, property), firstAccessor = _a.firstAccessor, getAccessor = _a.getAccessor, setAccessor = _a.setAccessor;
if (property === firstAccessor) {
return ts.setTextRange(factory.createObjectDefinePropertyCall(receiver, createExpressionForPropertyName(factory, property.name), factory.createPropertyDescriptor({
enumerable: factory.createFalse(),
configurable: true,
get: getAccessor && ts.setTextRange(ts.setOriginalNode(factory.createFunctionExpression(getAccessor.modifiers,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, getAccessor.parameters,
/*type*/ undefined, getAccessor.body // TODO: GH#18217
), getAccessor), getAccessor),
set: setAccessor && ts.setTextRange(ts.setOriginalNode(factory.createFunctionExpression(setAccessor.modifiers,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, setAccessor.parameters,
/*type*/ undefined, setAccessor.body // TODO: GH#18217
), setAccessor), setAccessor)
}, !multiLine)), firstAccessor);
}
return undefined;
}
function createExpressionForPropertyAssignment(factory, property, receiver) {
return ts.setOriginalNode(ts.setTextRange(factory.createAssignment(createMemberAccessForPropertyName(factory, receiver, property.name, /*location*/ property.name), property.initializer), property), property);
}
function createExpressionForShorthandPropertyAssignment(factory, property, receiver) {
return ts.setOriginalNode(ts.setTextRange(factory.createAssignment(createMemberAccessForPropertyName(factory, receiver, property.name, /*location*/ property.name), factory.cloneNode(property.name)),
/*location*/ property),
/*original*/ property);
}
function createExpressionForMethodDeclaration(factory, method, receiver) {
return ts.setOriginalNode(ts.setTextRange(factory.createAssignment(createMemberAccessForPropertyName(factory, receiver, method.name, /*location*/ method.name), ts.setOriginalNode(ts.setTextRange(factory.createFunctionExpression(method.modifiers, method.asteriskToken,
/*name*/ undefined,
/*typeParameters*/ undefined, method.parameters,
/*type*/ undefined, method.body // TODO: GH#18217
),
/*location*/ method),
/*original*/ method)),
/*location*/ method),
/*original*/ method);
}
function createExpressionForObjectLiteralElementLike(factory, node, property, receiver) {
if (property.name && ts.isPrivateIdentifier(property.name)) {
ts.Debug.failBadSyntaxKind(property.name, "Private identifiers are not allowed in object literals.");
}
switch (property.kind) {
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return createExpressionForAccessorDeclaration(factory, node.properties, property, receiver, !!node.multiLine);
case 291 /* PropertyAssignment */:
return createExpressionForPropertyAssignment(factory, property, receiver);
case 292 /* ShorthandPropertyAssignment */:
return createExpressionForShorthandPropertyAssignment(factory, property, receiver);
case 167 /* MethodDeclaration */:
return createExpressionForMethodDeclaration(factory, property, receiver);
}
}
ts.createExpressionForObjectLiteralElementLike = createExpressionForObjectLiteralElementLike;
/**
* Expand the read and increment/decrement operations a pre- or post-increment or pre- or post-decrement expression.
*
* ```ts
* // input
* <expression>++
* // output (if result is not discarded)
* var <temp>;
* (<temp> = <expression>, <resultVariable> = <temp>++, <temp>)
* // output (if result is discarded)
* var <temp>;
* (<temp> = <expression>, <temp>++, <temp>)
*
* // input
* ++<expression>
* // output (if result is not discarded)
* var <temp>;
* (<temp> = <expression>, <resultVariable> = ++<temp>)
* // output (if result is discarded)
* var <temp>;
* (<temp> = <expression>, ++<temp>)
* ```
*
* It is up to the caller to supply a temporary variable for `<resultVariable>` if one is needed.
* The temporary variable `<temp>` is injected so that `++` and `--` work uniformly with `number` and `bigint`.
* The result of the expression is always the final result of incrementing or decrementing the expression, so that it can be used for storage.
*
* @param factory {@link NodeFactory} used to create the expanded representation.
* @param node The original prefix or postfix unary node.
* @param expression The expression to use as the value to increment or decrement
* @param resultVariable A temporary variable in which to store the result. Pass `undefined` if the result is discarded, or if the value of `<temp>` is the expected result.
*/
function expandPreOrPostfixIncrementOrDecrementExpression(factory, node, expression, recordTempVariable, resultVariable) {
var operator = node.operator;
ts.Debug.assert(operator === 45 /* PlusPlusToken */ || operator === 46 /* MinusMinusToken */, "Expected 'node' to be a pre- or post-increment or pre- or post-decrement expression");
var temp = factory.createTempVariable(recordTempVariable);
expression = factory.createAssignment(temp, expression);
ts.setTextRange(expression, node.operand);
var operation = ts.isPrefixUnaryExpression(node) ?
factory.createPrefixUnaryExpression(operator, temp) :
factory.createPostfixUnaryExpression(temp, operator);
ts.setTextRange(operation, node);
if (resultVariable) {
operation = factory.createAssignment(resultVariable, operation);
ts.setTextRange(operation, node);
}
expression = factory.createComma(expression, operation);
ts.setTextRange(expression, node);
if (ts.isPostfixUnaryExpression(node)) {
expression = factory.createComma(expression, temp);
ts.setTextRange(expression, node);
}
return expression;
}
ts.expandPreOrPostfixIncrementOrDecrementExpression = expandPreOrPostfixIncrementOrDecrementExpression;
/**
* Gets whether an identifier should only be referred to by its internal name.
*/
function isInternalName(node) {
return (ts.getEmitFlags(node) & 32768 /* InternalName */) !== 0;
}
ts.isInternalName = isInternalName;
/**
* Gets whether an identifier should only be referred to by its local name.
*/
function isLocalName(node) {
return (ts.getEmitFlags(node) & 16384 /* LocalName */) !== 0;
}
ts.isLocalName = isLocalName;
/**
* Gets whether an identifier should only be referred to by its export representation if the
* name points to an exported symbol.
*/
function isExportName(node) {
return (ts.getEmitFlags(node) & 8192 /* ExportName */) !== 0;
}
ts.isExportName = isExportName;
function isUseStrictPrologue(node) {
return ts.isStringLiteral(node.expression) && node.expression.text === "use strict";
}
function findUseStrictPrologue(statements) {
for (var _i = 0, statements_1 = statements; _i < statements_1.length; _i++) {
var statement = statements_1[_i];
if (ts.isPrologueDirective(statement)) {
if (isUseStrictPrologue(statement)) {
return statement;
}
}
else {
break;
}
}
return undefined;
}
ts.findUseStrictPrologue = findUseStrictPrologue;
function startsWithUseStrict(statements) {
var firstStatement = ts.firstOrUndefined(statements);
return firstStatement !== undefined
&& ts.isPrologueDirective(firstStatement)
&& isUseStrictPrologue(firstStatement);
}
ts.startsWithUseStrict = startsWithUseStrict;
function isCommaSequence(node) {
return node.kind === 219 /* BinaryExpression */ && node.operatorToken.kind === 27 /* CommaToken */ ||
node.kind === 346 /* CommaListExpression */;
}
ts.isCommaSequence = isCommaSequence;
function isOuterExpression(node, kinds) {
if (kinds === void 0) { kinds = 15 /* All */; }
switch (node.kind) {
case 210 /* ParenthesizedExpression */:
return (kinds & 1 /* Parentheses */) !== 0;
case 209 /* TypeAssertionExpression */:
case 227 /* AsExpression */:
return (kinds & 2 /* TypeAssertions */) !== 0;
case 228 /* NonNullExpression */:
return (kinds & 4 /* NonNullAssertions */) !== 0;
case 345 /* PartiallyEmittedExpression */:
return (kinds & 8 /* PartiallyEmittedExpressions */) !== 0;
}
return false;
}
ts.isOuterExpression = isOuterExpression;
function skipOuterExpressions(node, kinds) {
if (kinds === void 0) { kinds = 15 /* All */; }
while (isOuterExpression(node, kinds)) {
node = node.expression;
}
return node;
}
ts.skipOuterExpressions = skipOuterExpressions;
function skipAssertions(node) {
return skipOuterExpressions(node, 6 /* Assertions */);
}
ts.skipAssertions = skipAssertions;
function startOnNewLine(node) {
return ts.setStartsOnNewLine(node, /*newLine*/ true);
}
ts.startOnNewLine = startOnNewLine;
function getExternalHelpersModuleName(node) {
var parseNode = ts.getOriginalNode(node, ts.isSourceFile);
var emitNode = parseNode && parseNode.emitNode;
return emitNode && emitNode.externalHelpersModuleName;
}
ts.getExternalHelpersModuleName = getExternalHelpersModuleName;
function hasRecordedExternalHelpers(sourceFile) {
var parseNode = ts.getOriginalNode(sourceFile, ts.isSourceFile);
var emitNode = parseNode && parseNode.emitNode;
return !!emitNode && (!!emitNode.externalHelpersModuleName || !!emitNode.externalHelpers);
}
ts.hasRecordedExternalHelpers = hasRecordedExternalHelpers;
function createExternalHelpersImportDeclarationIfNeeded(nodeFactory, helperFactory, sourceFile, compilerOptions, hasExportStarsToExportValues, hasImportStar, hasImportDefault) {
if (compilerOptions.importHelpers && ts.isEffectiveExternalModule(sourceFile, compilerOptions)) {
var namedBindings = void 0;
var moduleKind = ts.getEmitModuleKind(compilerOptions);
if (moduleKind >= ts.ModuleKind.ES2015 && moduleKind <= ts.ModuleKind.ESNext) {
// use named imports
var helpers = ts.getEmitHelpers(sourceFile);
if (helpers) {
var helperNames = [];
for (var _i = 0, helpers_3 = helpers; _i < helpers_3.length; _i++) {
var helper = helpers_3[_i];
if (!helper.scoped) {
var importName = helper.importName;
if (importName) {
ts.pushIfUnique(helperNames, importName);
}
}
}
if (ts.some(helperNames)) {
helperNames.sort(ts.compareStringsCaseSensitive);
// Alias the imports if the names are used somewhere in the file.
// NOTE: We don't need to care about global import collisions as this is a module.
namedBindings = nodeFactory.createNamedImports(ts.map(helperNames, function (name) { return ts.isFileLevelUniqueName(sourceFile, name)
? nodeFactory.createImportSpecifier(/*propertyName*/ undefined, nodeFactory.createIdentifier(name))
: nodeFactory.createImportSpecifier(nodeFactory.createIdentifier(name), helperFactory.getUnscopedHelperName(name)); }));
var parseNode = ts.getOriginalNode(sourceFile, ts.isSourceFile);
var emitNode = ts.getOrCreateEmitNode(parseNode);
emitNode.externalHelpers = true;
}
}
}
else {
// use a namespace import
var externalHelpersModuleName = getOrCreateExternalHelpersModuleNameIfNeeded(nodeFactory, sourceFile, compilerOptions, hasExportStarsToExportValues, hasImportStar || hasImportDefault);
if (externalHelpersModuleName) {
namedBindings = nodeFactory.createNamespaceImport(externalHelpersModuleName);
}
}
if (namedBindings) {
var externalHelpersImportDeclaration = nodeFactory.createImportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, nodeFactory.createImportClause(/*isTypeOnly*/ false, /*name*/ undefined, namedBindings), nodeFactory.createStringLiteral(ts.externalHelpersModuleNameText));
ts.addEmitFlags(externalHelpersImportDeclaration, 67108864 /* NeverApplyImportHelper */);
return externalHelpersImportDeclaration;
}
}
}
ts.createExternalHelpersImportDeclarationIfNeeded = createExternalHelpersImportDeclarationIfNeeded;
function getOrCreateExternalHelpersModuleNameIfNeeded(factory, node, compilerOptions, hasExportStarsToExportValues, hasImportStarOrImportDefault) {
if (compilerOptions.importHelpers && ts.isEffectiveExternalModule(node, compilerOptions)) {
var externalHelpersModuleName = getExternalHelpersModuleName(node);
if (externalHelpersModuleName) {
return externalHelpersModuleName;
}
var moduleKind = ts.getEmitModuleKind(compilerOptions);
var create = (hasExportStarsToExportValues || (compilerOptions.esModuleInterop && hasImportStarOrImportDefault))
&& moduleKind !== ts.ModuleKind.System
&& moduleKind < ts.ModuleKind.ES2015;
if (!create) {
var helpers = ts.getEmitHelpers(node);
if (helpers) {
for (var _i = 0, helpers_4 = helpers; _i < helpers_4.length; _i++) {
var helper = helpers_4[_i];
if (!helper.scoped) {
create = true;
break;
}
}
}
}
if (create) {
var parseNode = ts.getOriginalNode(node, ts.isSourceFile);
var emitNode = ts.getOrCreateEmitNode(parseNode);
return emitNode.externalHelpersModuleName || (emitNode.externalHelpersModuleName = factory.createUniqueName(ts.externalHelpersModuleNameText));
}
}
}
ts.getOrCreateExternalHelpersModuleNameIfNeeded = getOrCreateExternalHelpersModuleNameIfNeeded;
/**
* Get the name of that target module from an import or export declaration
*/
function getLocalNameForExternalImport(factory, node, sourceFile) {
var namespaceDeclaration = ts.getNamespaceDeclarationNode(node);
if (namespaceDeclaration && !ts.isDefaultImport(node) && !ts.isExportNamespaceAsDefaultDeclaration(node)) {
var name = namespaceDeclaration.name;
return ts.isGeneratedIdentifier(name) ? name : factory.createIdentifier(ts.getSourceTextOfNodeFromSourceFile(sourceFile, name) || ts.idText(name));
}
if (node.kind === 264 /* ImportDeclaration */ && node.importClause) {
return factory.getGeneratedNameForNode(node);
}
if (node.kind === 270 /* ExportDeclaration */ && node.moduleSpecifier) {
return factory.getGeneratedNameForNode(node);
}
return undefined;
}
ts.getLocalNameForExternalImport = getLocalNameForExternalImport;
/**
* Get the name of a target module from an import/export declaration as should be written in the emitted output.
* The emitted output name can be different from the input if:
* 1. The module has a /// <amd-module name="<new name>" />
* 2. --out or --outFile is used, making the name relative to the rootDir
* 3- The containing SourceFile has an entry in renamedDependencies for the import as requested by some module loaders (e.g. System).
* Otherwise, a new StringLiteral node representing the module name will be returned.
*/
function getExternalModuleNameLiteral(factory, importNode, sourceFile, host, resolver, compilerOptions) {
var moduleName = ts.getExternalModuleName(importNode);
if (moduleName && ts.isStringLiteral(moduleName)) {
return tryGetModuleNameFromDeclaration(importNode, host, factory, resolver, compilerOptions)
|| tryRenameExternalModule(factory, moduleName, sourceFile)
|| factory.cloneNode(moduleName);
}
return undefined;
}
ts.getExternalModuleNameLiteral = getExternalModuleNameLiteral;
/**
* Some bundlers (SystemJS builder) sometimes want to rename dependencies.
* Here we check if alternative name was provided for a given moduleName and return it if possible.
*/
function tryRenameExternalModule(factory, moduleName, sourceFile) {
var rename = sourceFile.renamedDependencies && sourceFile.renamedDependencies.get(moduleName.text);
return rename ? factory.createStringLiteral(rename) : undefined;
}
/**
* Get the name of a module as should be written in the emitted output.
* The emitted output name can be different from the input if:
* 1. The module has a /// <amd-module name="<new name>" />
* 2. --out or --outFile is used, making the name relative to the rootDir
* Otherwise, a new StringLiteral node representing the module name will be returned.
*/
function tryGetModuleNameFromFile(factory, file, host, options) {
if (!file) {
return undefined;
}
if (file.moduleName) {
return factory.createStringLiteral(file.moduleName);
}
if (!file.isDeclarationFile && ts.outFile(options)) {
return factory.createStringLiteral(ts.getExternalModuleNameFromPath(host, file.fileName));
}
return undefined;
}
ts.tryGetModuleNameFromFile = tryGetModuleNameFromFile;
function tryGetModuleNameFromDeclaration(declaration, host, factory, resolver, compilerOptions) {
return tryGetModuleNameFromFile(factory, resolver.getExternalModuleFileFromDeclaration(declaration), host, compilerOptions);
}
/**
* Gets the initializer of an BindingOrAssignmentElement.
*/
function getInitializerOfBindingOrAssignmentElement(bindingElement) {
if (ts.isDeclarationBindingElement(bindingElement)) {
// `1` in `let { a = 1 } = ...`
// `1` in `let { a: b = 1 } = ...`
// `1` in `let { a: {b} = 1 } = ...`
// `1` in `let { a: [b] = 1 } = ...`
// `1` in `let [a = 1] = ...`
// `1` in `let [{a} = 1] = ...`
// `1` in `let [[a] = 1] = ...`
return bindingElement.initializer;
}
if (ts.isPropertyAssignment(bindingElement)) {
// `1` in `({ a: b = 1 } = ...)`
// `1` in `({ a: {b} = 1 } = ...)`
// `1` in `({ a: [b] = 1 } = ...)`
var initializer = bindingElement.initializer;
return ts.isAssignmentExpression(initializer, /*excludeCompoundAssignment*/ true)
? initializer.right
: undefined;
}
if (ts.isShorthandPropertyAssignment(bindingElement)) {
// `1` in `({ a = 1 } = ...)`
return bindingElement.objectAssignmentInitializer;
}
if (ts.isAssignmentExpression(bindingElement, /*excludeCompoundAssignment*/ true)) {
// `1` in `[a = 1] = ...`
// `1` in `[{a} = 1] = ...`
// `1` in `[[a] = 1] = ...`
return bindingElement.right;
}
if (ts.isSpreadElement(bindingElement)) {
// Recovery consistent with existing emit.
return getInitializerOfBindingOrAssignmentElement(bindingElement.expression);
}
}
ts.getInitializerOfBindingOrAssignmentElement = getInitializerOfBindingOrAssignmentElement;
/**
* Gets the name of an BindingOrAssignmentElement.
*/
function getTargetOfBindingOrAssignmentElement(bindingElement) {
if (ts.isDeclarationBindingElement(bindingElement)) {
// `a` in `let { a } = ...`
// `a` in `let { a = 1 } = ...`
// `b` in `let { a: b } = ...`
// `b` in `let { a: b = 1 } = ...`
// `a` in `let { ...a } = ...`
// `{b}` in `let { a: {b} } = ...`
// `{b}` in `let { a: {b} = 1 } = ...`
// `[b]` in `let { a: [b] } = ...`
// `[b]` in `let { a: [b] = 1 } = ...`
// `a` in `let [a] = ...`
// `a` in `let [a = 1] = ...`
// `a` in `let [...a] = ...`
// `{a}` in `let [{a}] = ...`
// `{a}` in `let [{a} = 1] = ...`
// `[a]` in `let [[a]] = ...`
// `[a]` in `let [[a] = 1] = ...`
return bindingElement.name;
}
if (ts.isObjectLiteralElementLike(bindingElement)) {
switch (bindingElement.kind) {
case 291 /* PropertyAssignment */:
// `b` in `({ a: b } = ...)`
// `b` in `({ a: b = 1 } = ...)`
// `{b}` in `({ a: {b} } = ...)`
// `{b}` in `({ a: {b} = 1 } = ...)`
// `[b]` in `({ a: [b] } = ...)`
// `[b]` in `({ a: [b] = 1 } = ...)`
// `b.c` in `({ a: b.c } = ...)`
// `b.c` in `({ a: b.c = 1 } = ...)`
// `b[0]` in `({ a: b[0] } = ...)`
// `b[0]` in `({ a: b[0] = 1 } = ...)`
return getTargetOfBindingOrAssignmentElement(bindingElement.initializer);
case 292 /* ShorthandPropertyAssignment */:
// `a` in `({ a } = ...)`
// `a` in `({ a = 1 } = ...)`
return bindingElement.name;
case 293 /* SpreadAssignment */:
// `a` in `({ ...a } = ...)`
return getTargetOfBindingOrAssignmentElement(bindingElement.expression);
}
// no target
return undefined;
}
if (ts.isAssignmentExpression(bindingElement, /*excludeCompoundAssignment*/ true)) {
// `a` in `[a = 1] = ...`
// `{a}` in `[{a} = 1] = ...`
// `[a]` in `[[a] = 1] = ...`
// `a.b` in `[a.b = 1] = ...`
// `a[0]` in `[a[0] = 1] = ...`
return getTargetOfBindingOrAssignmentElement(bindingElement.left);
}
if (ts.isSpreadElement(bindingElement)) {
// `a` in `[...a] = ...`
return getTargetOfBindingOrAssignmentElement(bindingElement.expression);
}
// `a` in `[a] = ...`
// `{a}` in `[{a}] = ...`
// `[a]` in `[[a]] = ...`
// `a.b` in `[a.b] = ...`
// `a[0]` in `[a[0]] = ...`
return bindingElement;
}
ts.getTargetOfBindingOrAssignmentElement = getTargetOfBindingOrAssignmentElement;
/**
* Determines whether an BindingOrAssignmentElement is a rest element.
*/
function getRestIndicatorOfBindingOrAssignmentElement(bindingElement) {
switch (bindingElement.kind) {
case 162 /* Parameter */:
case 201 /* BindingElement */:
// `...` in `let [...a] = ...`
return bindingElement.dotDotDotToken;
case 223 /* SpreadElement */:
case 293 /* SpreadAssignment */:
// `...` in `[...a] = ...`
return bindingElement;
}
return undefined;
}
ts.getRestIndicatorOfBindingOrAssignmentElement = getRestIndicatorOfBindingOrAssignmentElement;
/**
* Gets the property name of a BindingOrAssignmentElement
*/
function getPropertyNameOfBindingOrAssignmentElement(bindingElement) {
var propertyName = tryGetPropertyNameOfBindingOrAssignmentElement(bindingElement);
ts.Debug.assert(!!propertyName || ts.isSpreadAssignment(bindingElement), "Invalid property name for binding element.");
return propertyName;
}
ts.getPropertyNameOfBindingOrAssignmentElement = getPropertyNameOfBindingOrAssignmentElement;
function tryGetPropertyNameOfBindingOrAssignmentElement(bindingElement) {
switch (bindingElement.kind) {
case 201 /* BindingElement */:
// `a` in `let { a: b } = ...`
// `[a]` in `let { [a]: b } = ...`
// `"a"` in `let { "a": b } = ...`
// `1` in `let { 1: b } = ...`
if (bindingElement.propertyName) {
var propertyName = bindingElement.propertyName;
if (ts.isPrivateIdentifier(propertyName)) {
return ts.Debug.failBadSyntaxKind(propertyName);
}
return ts.isComputedPropertyName(propertyName) && isStringOrNumericLiteral(propertyName.expression)
? propertyName.expression
: propertyName;
}
break;
case 291 /* PropertyAssignment */:
// `a` in `({ a: b } = ...)`
// `[a]` in `({ [a]: b } = ...)`
// `"a"` in `({ "a": b } = ...)`
// `1` in `({ 1: b } = ...)`
if (bindingElement.name) {
var propertyName = bindingElement.name;
if (ts.isPrivateIdentifier(propertyName)) {
return ts.Debug.failBadSyntaxKind(propertyName);
}
return ts.isComputedPropertyName(propertyName) && isStringOrNumericLiteral(propertyName.expression)
? propertyName.expression
: propertyName;
}
break;
case 293 /* SpreadAssignment */:
// `a` in `({ ...a } = ...)`
if (bindingElement.name && ts.isPrivateIdentifier(bindingElement.name)) {
return ts.Debug.failBadSyntaxKind(bindingElement.name);
}
return bindingElement.name;
}
var target = getTargetOfBindingOrAssignmentElement(bindingElement);
if (target && ts.isPropertyName(target)) {
return target;
}
}
ts.tryGetPropertyNameOfBindingOrAssignmentElement = tryGetPropertyNameOfBindingOrAssignmentElement;
function isStringOrNumericLiteral(node) {
var kind = node.kind;
return kind === 10 /* StringLiteral */
|| kind === 8 /* NumericLiteral */;
}
/**
* Gets the elements of a BindingOrAssignmentPattern
*/
function getElementsOfBindingOrAssignmentPattern(name) {
switch (name.kind) {
case 199 /* ObjectBindingPattern */:
case 200 /* ArrayBindingPattern */:
case 202 /* ArrayLiteralExpression */:
// `a` in `{a}`
// `a` in `[a]`
return name.elements;
case 203 /* ObjectLiteralExpression */:
// `a` in `{a}`
return name.properties;
}
}
ts.getElementsOfBindingOrAssignmentPattern = getElementsOfBindingOrAssignmentPattern;
/* @internal */
function getJSDocTypeAliasName(fullName) {
if (fullName) {
var rightNode = fullName;
while (true) {
if (ts.isIdentifier(rightNode) || !rightNode.body) {
return ts.isIdentifier(rightNode) ? rightNode : rightNode.name;
}
rightNode = rightNode.body;
}
}
}
ts.getJSDocTypeAliasName = getJSDocTypeAliasName;
function canHaveModifiers(node) {
var kind = node.kind;
return kind === 162 /* Parameter */
|| kind === 164 /* PropertySignature */
|| kind === 165 /* PropertyDeclaration */
|| kind === 166 /* MethodSignature */
|| kind === 167 /* MethodDeclaration */
|| kind === 169 /* Constructor */
|| kind === 170 /* GetAccessor */
|| kind === 171 /* SetAccessor */
|| kind === 174 /* IndexSignature */
|| kind === 211 /* FunctionExpression */
|| kind === 212 /* ArrowFunction */
|| kind === 224 /* ClassExpression */
|| kind === 235 /* VariableStatement */
|| kind === 254 /* FunctionDeclaration */
|| kind === 255 /* ClassDeclaration */
|| kind === 256 /* InterfaceDeclaration */
|| kind === 257 /* TypeAliasDeclaration */
|| kind === 258 /* EnumDeclaration */
|| kind === 259 /* ModuleDeclaration */
|| kind === 263 /* ImportEqualsDeclaration */
|| kind === 264 /* ImportDeclaration */
|| kind === 269 /* ExportAssignment */
|| kind === 270 /* ExportDeclaration */;
}
ts.canHaveModifiers = canHaveModifiers;
ts.isTypeNodeOrTypeParameterDeclaration = ts.or(ts.isTypeNode, ts.isTypeParameterDeclaration);
ts.isQuestionOrExclamationToken = ts.or(ts.isQuestionToken, ts.isExclamationToken);
ts.isIdentifierOrThisTypeNode = ts.or(ts.isIdentifier, ts.isThisTypeNode);
ts.isReadonlyKeywordOrPlusOrMinusToken = ts.or(ts.isReadonlyKeyword, ts.isPlusToken, ts.isMinusToken);
ts.isQuestionOrPlusOrMinusToken = ts.or(ts.isQuestionToken, ts.isPlusToken, ts.isMinusToken);
ts.isModuleName = ts.or(ts.isIdentifier, ts.isStringLiteral);
function isLiteralTypeLikeExpression(node) {
var kind = node.kind;
return kind === 104 /* NullKeyword */
|| kind === 110 /* TrueKeyword */
|| kind === 95 /* FalseKeyword */
|| ts.isLiteralExpression(node)
|| ts.isPrefixUnaryExpression(node);
}
ts.isLiteralTypeLikeExpression = isLiteralTypeLikeExpression;
function isExponentiationOperator(kind) {
return kind === 42 /* AsteriskAsteriskToken */;
}
function isMultiplicativeOperator(kind) {
return kind === 41 /* AsteriskToken */
|| kind === 43 /* SlashToken */
|| kind === 44 /* PercentToken */;
}
function isMultiplicativeOperatorOrHigher(kind) {
return isExponentiationOperator(kind)
|| isMultiplicativeOperator(kind);
}
function isAdditiveOperator(kind) {
return kind === 39 /* PlusToken */
|| kind === 40 /* MinusToken */;
}
function isAdditiveOperatorOrHigher(kind) {
return isAdditiveOperator(kind)
|| isMultiplicativeOperatorOrHigher(kind);
}
function isShiftOperator(kind) {
return kind === 47 /* LessThanLessThanToken */
|| kind === 48 /* GreaterThanGreaterThanToken */
|| kind === 49 /* GreaterThanGreaterThanGreaterThanToken */;
}
function isShiftOperatorOrHigher(kind) {
return isShiftOperator(kind)
|| isAdditiveOperatorOrHigher(kind);
}
function isRelationalOperator(kind) {
return kind === 29 /* LessThanToken */
|| kind === 32 /* LessThanEqualsToken */
|| kind === 31 /* GreaterThanToken */
|| kind === 33 /* GreaterThanEqualsToken */
|| kind === 102 /* InstanceOfKeyword */
|| kind === 101 /* InKeyword */;
}
function isRelationalOperatorOrHigher(kind) {
return isRelationalOperator(kind)
|| isShiftOperatorOrHigher(kind);
}
function isEqualityOperator(kind) {
return kind === 34 /* EqualsEqualsToken */
|| kind === 36 /* EqualsEqualsEqualsToken */
|| kind === 35 /* ExclamationEqualsToken */
|| kind === 37 /* ExclamationEqualsEqualsToken */;
}
function isEqualityOperatorOrHigher(kind) {
return isEqualityOperator(kind)
|| isRelationalOperatorOrHigher(kind);
}
function isBitwiseOperator(kind) {
return kind === 50 /* AmpersandToken */
|| kind === 51 /* BarToken */
|| kind === 52 /* CaretToken */;
}
function isBitwiseOperatorOrHigher(kind) {
return isBitwiseOperator(kind)
|| isEqualityOperatorOrHigher(kind);
}
// NOTE: The version in utilities includes ExclamationToken, which is not a binary operator.
function isLogicalOperator(kind) {
return kind === 55 /* AmpersandAmpersandToken */
|| kind === 56 /* BarBarToken */;
}
function isLogicalOperatorOrHigher(kind) {
return isLogicalOperator(kind)
|| isBitwiseOperatorOrHigher(kind);
}
function isAssignmentOperatorOrHigher(kind) {
return kind === 60 /* QuestionQuestionToken */
|| isLogicalOperatorOrHigher(kind)
|| ts.isAssignmentOperator(kind);
}
function isBinaryOperator(kind) {
return isAssignmentOperatorOrHigher(kind)
|| kind === 27 /* CommaToken */;
}
function isBinaryOperatorToken(node) {
return isBinaryOperator(node.kind);
}
ts.isBinaryOperatorToken = isBinaryOperatorToken;
var BinaryExpressionState;
(function (BinaryExpressionState) {
/**
* Handles walking into a `BinaryExpression`.
* @param machine State machine handler functions
* @param frame The current frame
* @returns The new frame
*/
function enter(machine, stackIndex, stateStack, nodeStack, userStateStack, _resultHolder, outerState) {
var prevUserState = stackIndex > 0 ? userStateStack[stackIndex - 1] : undefined;
ts.Debug.assertEqual(stateStack[stackIndex], enter);
userStateStack[stackIndex] = machine.onEnter(nodeStack[stackIndex], prevUserState, outerState);
stateStack[stackIndex] = nextState(machine, enter);
return stackIndex;
}
BinaryExpressionState.enter = enter;
/**
* Handles walking the `left` side of a `BinaryExpression`.
* @param machine State machine handler functions
* @param frame The current frame
* @returns The new frame
*/
function left(machine, stackIndex, stateStack, nodeStack, userStateStack, _resultHolder, _outerState) {
ts.Debug.assertEqual(stateStack[stackIndex], left);
ts.Debug.assertIsDefined(machine.onLeft);
stateStack[stackIndex] = nextState(machine, left);
var nextNode = machine.onLeft(nodeStack[stackIndex].left, userStateStack[stackIndex], nodeStack[stackIndex]);
if (nextNode) {
checkCircularity(stackIndex, nodeStack, nextNode);
return pushStack(stackIndex, stateStack, nodeStack, userStateStack, nextNode);
}
return stackIndex;
}
BinaryExpressionState.left = left;
/**
* Handles walking the `operatorToken` of a `BinaryExpression`.
* @param machine State machine handler functions
* @param frame The current frame
* @returns The new frame
*/
function operator(machine, stackIndex, stateStack, nodeStack, userStateStack, _resultHolder, _outerState) {
ts.Debug.assertEqual(stateStack[stackIndex], operator);
ts.Debug.assertIsDefined(machine.onOperator);
stateStack[stackIndex] = nextState(machine, operator);
machine.onOperator(nodeStack[stackIndex].operatorToken, userStateStack[stackIndex], nodeStack[stackIndex]);
return stackIndex;
}
BinaryExpressionState.operator = operator;
/**
* Handles walking the `right` side of a `BinaryExpression`.
* @param machine State machine handler functions
* @param frame The current frame
* @returns The new frame
*/
function right(machine, stackIndex, stateStack, nodeStack, userStateStack, _resultHolder, _outerState) {
ts.Debug.assertEqual(stateStack[stackIndex], right);
ts.Debug.assertIsDefined(machine.onRight);
stateStack[stackIndex] = nextState(machine, right);
var nextNode = machine.onRight(nodeStack[stackIndex].right, userStateStack[stackIndex], nodeStack[stackIndex]);
if (nextNode) {
checkCircularity(stackIndex, nodeStack, nextNode);
return pushStack(stackIndex, stateStack, nodeStack, userStateStack, nextNode);
}
return stackIndex;
}
BinaryExpressionState.right = right;
/**
* Handles walking out of a `BinaryExpression`.
* @param machine State machine handler functions
* @param frame The current frame
* @returns The new frame
*/
function exit(machine, stackIndex, stateStack, nodeStack, userStateStack, resultHolder, _outerState) {
ts.Debug.assertEqual(stateStack[stackIndex], exit);
stateStack[stackIndex] = nextState(machine, exit);
var result = machine.onExit(nodeStack[stackIndex], userStateStack[stackIndex]);
if (stackIndex > 0) {
stackIndex--;
if (machine.foldState) {
var side = stateStack[stackIndex] === exit ? "right" : "left";
userStateStack[stackIndex] = machine.foldState(userStateStack[stackIndex], result, side);
}
}
else {
resultHolder.value = result;
}
return stackIndex;
}
BinaryExpressionState.exit = exit;
/**
* Handles a frame that is already done.
* @returns The `done` state.
*/
function done(_machine, stackIndex, stateStack, _nodeStack, _userStateStack, _resultHolder, _outerState) {
ts.Debug.assertEqual(stateStack[stackIndex], done);
return stackIndex;
}
BinaryExpressionState.done = done;
function nextState(machine, currentState) {
switch (currentState) {
case enter:
if (machine.onLeft)
return left;
// falls through
case left:
if (machine.onOperator)
return operator;
// falls through
case operator:
if (machine.onRight)
return right;
// falls through
case right: return exit;
case exit: return done;
case done: return done;
default: ts.Debug.fail("Invalid state");
}
}
BinaryExpressionState.nextState = nextState;
function pushStack(stackIndex, stateStack, nodeStack, userStateStack, node) {
stackIndex++;
stateStack[stackIndex] = enter;
nodeStack[stackIndex] = node;
userStateStack[stackIndex] = undefined;
return stackIndex;
}
function checkCircularity(stackIndex, nodeStack, node) {
if (ts.Debug.shouldAssert(2 /* Aggressive */)) {
while (stackIndex >= 0) {
ts.Debug.assert(nodeStack[stackIndex] !== node, "Circular traversal detected.");
stackIndex--;
}
}
}
})(BinaryExpressionState || (BinaryExpressionState = {}));
/**
* Holds state machine handler functions
*/
var BinaryExpressionStateMachine = /** @class */ (function () {
function BinaryExpressionStateMachine(onEnter, onLeft, onOperator, onRight, onExit, foldState) {
this.onEnter = onEnter;
this.onLeft = onLeft;
this.onOperator = onOperator;
this.onRight = onRight;
this.onExit = onExit;
this.foldState = foldState;
}
return BinaryExpressionStateMachine;
}());
function createBinaryExpressionTrampoline(onEnter, onLeft, onOperator, onRight, onExit, foldState) {
var machine = new BinaryExpressionStateMachine(onEnter, onLeft, onOperator, onRight, onExit, foldState);
return trampoline;
function trampoline(node, outerState) {
var resultHolder = { value: undefined };
var stateStack = [BinaryExpressionState.enter];
var nodeStack = [node];
var userStateStack = [undefined];
var stackIndex = 0;
while (stateStack[stackIndex] !== BinaryExpressionState.done) {
stackIndex = stateStack[stackIndex](machine, stackIndex, stateStack, nodeStack, userStateStack, resultHolder, outerState);
}
ts.Debug.assertEqual(stackIndex, 0);
return resultHolder.value;
}
}
ts.createBinaryExpressionTrampoline = createBinaryExpressionTrampoline;
})(ts || (ts = {}));
var ts;
(function (ts) {
function setTextRange(range, location) {
return location ? ts.setTextRangePosEnd(range, location.pos, location.end) : range;
}
ts.setTextRange = setTextRange;
})(ts || (ts = {}));
var ts;
(function (ts) {
var SignatureFlags;
(function (SignatureFlags) {
SignatureFlags[SignatureFlags["None"] = 0] = "None";
SignatureFlags[SignatureFlags["Yield"] = 1] = "Yield";
SignatureFlags[SignatureFlags["Await"] = 2] = "Await";
SignatureFlags[SignatureFlags["Type"] = 4] = "Type";
SignatureFlags[SignatureFlags["IgnoreMissingOpenBrace"] = 16] = "IgnoreMissingOpenBrace";
SignatureFlags[SignatureFlags["JSDoc"] = 32] = "JSDoc";
})(SignatureFlags || (SignatureFlags = {}));
var SpeculationKind;
(function (SpeculationKind) {
SpeculationKind[SpeculationKind["TryParse"] = 0] = "TryParse";
SpeculationKind[SpeculationKind["Lookahead"] = 1] = "Lookahead";
SpeculationKind[SpeculationKind["Reparse"] = 2] = "Reparse";
})(SpeculationKind || (SpeculationKind = {}));
var NodeConstructor;
var TokenConstructor;
var IdentifierConstructor;
var PrivateIdentifierConstructor;
var SourceFileConstructor;
/**
* NOTE: You should not use this, it is only exported to support `createNode` in `~/src/deprecatedCompat/deprecations.ts`.
*/
/* @internal */
ts.parseBaseNodeFactory = {
createBaseSourceFileNode: function (kind) { return new (SourceFileConstructor || (SourceFileConstructor = ts.objectAllocator.getSourceFileConstructor()))(kind, -1, -1); },
createBaseIdentifierNode: function (kind) { return new (IdentifierConstructor || (IdentifierConstructor = ts.objectAllocator.getIdentifierConstructor()))(kind, -1, -1); },
createBasePrivateIdentifierNode: function (kind) { return new (PrivateIdentifierConstructor || (PrivateIdentifierConstructor = ts.objectAllocator.getPrivateIdentifierConstructor()))(kind, -1, -1); },
createBaseTokenNode: function (kind) { return new (TokenConstructor || (TokenConstructor = ts.objectAllocator.getTokenConstructor()))(kind, -1, -1); },
createBaseNode: function (kind) { return new (NodeConstructor || (NodeConstructor = ts.objectAllocator.getNodeConstructor()))(kind, -1, -1); },
};
/* @internal */
ts.parseNodeFactory = ts.createNodeFactory(1 /* NoParenthesizerRules */, ts.parseBaseNodeFactory);
function visitNode(cbNode, node) {
return node && cbNode(node);
}
function visitNodes(cbNode, cbNodes, nodes) {
if (nodes) {
if (cbNodes) {
return cbNodes(nodes);
}
for (var _i = 0, nodes_1 = nodes; _i < nodes_1.length; _i++) {
var node = nodes_1[_i];
var result = cbNode(node);
if (result) {
return result;
}
}
}
}
/*@internal*/
function isJSDocLikeText(text, start) {
return text.charCodeAt(start + 1) === 42 /* asterisk */ &&
text.charCodeAt(start + 2) === 42 /* asterisk */ &&
text.charCodeAt(start + 3) !== 47 /* slash */;
}
ts.isJSDocLikeText = isJSDocLikeText;
/**
* Invokes a callback for each child of the given node. The 'cbNode' callback is invoked for all child nodes
* stored in properties. If a 'cbNodes' callback is specified, it is invoked for embedded arrays; otherwise,
* embedded arrays are flattened and the 'cbNode' callback is invoked for each element. If a callback returns
* a truthy value, iteration stops and that value is returned. Otherwise, undefined is returned.
*
* @param node a given node to visit its children
* @param cbNode a callback to be invoked for all child nodes
* @param cbNodes a callback to be invoked for embedded array
*
* @remarks `forEachChild` must visit the children of a node in the order
* that they appear in the source code. The language service depends on this property to locate nodes by position.
*/
function forEachChild(node, cbNode, cbNodes) {
if (!node || node.kind <= 158 /* LastToken */) {
return;
}
switch (node.kind) {
case 159 /* QualifiedName */:
return visitNode(cbNode, node.left) ||
visitNode(cbNode, node.right);
case 161 /* TypeParameter */:
return visitNode(cbNode, node.name) ||
visitNode(cbNode, node.constraint) ||
visitNode(cbNode, node.default) ||
visitNode(cbNode, node.expression);
case 292 /* ShorthandPropertyAssignment */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.name) ||
visitNode(cbNode, node.questionToken) ||
visitNode(cbNode, node.exclamationToken) ||
visitNode(cbNode, node.equalsToken) ||
visitNode(cbNode, node.objectAssignmentInitializer);
case 293 /* SpreadAssignment */:
return visitNode(cbNode, node.expression);
case 162 /* Parameter */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.dotDotDotToken) ||
visitNode(cbNode, node.name) ||
visitNode(cbNode, node.questionToken) ||
visitNode(cbNode, node.type) ||
visitNode(cbNode, node.initializer);
case 165 /* PropertyDeclaration */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.name) ||
visitNode(cbNode, node.questionToken) ||
visitNode(cbNode, node.exclamationToken) ||
visitNode(cbNode, node.type) ||
visitNode(cbNode, node.initializer);
case 164 /* PropertySignature */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.name) ||
visitNode(cbNode, node.questionToken) ||
visitNode(cbNode, node.type) ||
visitNode(cbNode, node.initializer);
case 291 /* PropertyAssignment */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.name) ||
visitNode(cbNode, node.questionToken) ||
visitNode(cbNode, node.initializer);
case 252 /* VariableDeclaration */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.name) ||
visitNode(cbNode, node.exclamationToken) ||
visitNode(cbNode, node.type) ||
visitNode(cbNode, node.initializer);
case 201 /* BindingElement */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.dotDotDotToken) ||
visitNode(cbNode, node.propertyName) ||
visitNode(cbNode, node.name) ||
visitNode(cbNode, node.initializer);
case 177 /* FunctionType */:
case 178 /* ConstructorType */:
case 172 /* CallSignature */:
case 173 /* ConstructSignature */:
case 174 /* IndexSignature */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNodes(cbNode, cbNodes, node.typeParameters) ||
visitNodes(cbNode, cbNodes, node.parameters) ||
visitNode(cbNode, node.type);
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
case 169 /* Constructor */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 211 /* FunctionExpression */:
case 254 /* FunctionDeclaration */:
case 212 /* ArrowFunction */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.asteriskToken) ||
visitNode(cbNode, node.name) ||
visitNode(cbNode, node.questionToken) ||
visitNode(cbNode, node.exclamationToken) ||
visitNodes(cbNode, cbNodes, node.typeParameters) ||
visitNodes(cbNode, cbNodes, node.parameters) ||
visitNode(cbNode, node.type) ||
visitNode(cbNode, node.equalsGreaterThanToken) ||
visitNode(cbNode, node.body);
case 168 /* ClassStaticBlockDeclaration */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.body);
case 176 /* TypeReference */:
return visitNode(cbNode, node.typeName) ||
visitNodes(cbNode, cbNodes, node.typeArguments);
case 175 /* TypePredicate */:
return visitNode(cbNode, node.assertsModifier) ||
visitNode(cbNode, node.parameterName) ||
visitNode(cbNode, node.type);
case 179 /* TypeQuery */:
return visitNode(cbNode, node.exprName);
case 180 /* TypeLiteral */:
return visitNodes(cbNode, cbNodes, node.members);
case 181 /* ArrayType */:
return visitNode(cbNode, node.elementType);
case 182 /* TupleType */:
return visitNodes(cbNode, cbNodes, node.elements);
case 185 /* UnionType */:
case 186 /* IntersectionType */:
return visitNodes(cbNode, cbNodes, node.types);
case 187 /* ConditionalType */:
return visitNode(cbNode, node.checkType) ||
visitNode(cbNode, node.extendsType) ||
visitNode(cbNode, node.trueType) ||
visitNode(cbNode, node.falseType);
case 188 /* InferType */:
return visitNode(cbNode, node.typeParameter);
case 198 /* ImportType */:
return visitNode(cbNode, node.argument) ||
visitNode(cbNode, node.qualifier) ||
visitNodes(cbNode, cbNodes, node.typeArguments);
case 189 /* ParenthesizedType */:
case 191 /* TypeOperator */:
return visitNode(cbNode, node.type);
case 192 /* IndexedAccessType */:
return visitNode(cbNode, node.objectType) ||
visitNode(cbNode, node.indexType);
case 193 /* MappedType */:
return visitNode(cbNode, node.readonlyToken) ||
visitNode(cbNode, node.typeParameter) ||
visitNode(cbNode, node.nameType) ||
visitNode(cbNode, node.questionToken) ||
visitNode(cbNode, node.type);
case 194 /* LiteralType */:
return visitNode(cbNode, node.literal);
case 195 /* NamedTupleMember */:
return visitNode(cbNode, node.dotDotDotToken) ||
visitNode(cbNode, node.name) ||
visitNode(cbNode, node.questionToken) ||
visitNode(cbNode, node.type);
case 199 /* ObjectBindingPattern */:
case 200 /* ArrayBindingPattern */:
return visitNodes(cbNode, cbNodes, node.elements);
case 202 /* ArrayLiteralExpression */:
return visitNodes(cbNode, cbNodes, node.elements);
case 203 /* ObjectLiteralExpression */:
return visitNodes(cbNode, cbNodes, node.properties);
case 204 /* PropertyAccessExpression */:
return visitNode(cbNode, node.expression) ||
visitNode(cbNode, node.questionDotToken) ||
visitNode(cbNode, node.name);
case 205 /* ElementAccessExpression */:
return visitNode(cbNode, node.expression) ||
visitNode(cbNode, node.questionDotToken) ||
visitNode(cbNode, node.argumentExpression);
case 206 /* CallExpression */:
case 207 /* NewExpression */:
return visitNode(cbNode, node.expression) ||
visitNode(cbNode, node.questionDotToken) ||
visitNodes(cbNode, cbNodes, node.typeArguments) ||
visitNodes(cbNode, cbNodes, node.arguments);
case 208 /* TaggedTemplateExpression */:
return visitNode(cbNode, node.tag) ||
visitNode(cbNode, node.questionDotToken) ||
visitNodes(cbNode, cbNodes, node.typeArguments) ||
visitNode(cbNode, node.template);
case 209 /* TypeAssertionExpression */:
return visitNode(cbNode, node.type) ||
visitNode(cbNode, node.expression);
case 210 /* ParenthesizedExpression */:
return visitNode(cbNode, node.expression);
case 213 /* DeleteExpression */:
return visitNode(cbNode, node.expression);
case 214 /* TypeOfExpression */:
return visitNode(cbNode, node.expression);
case 215 /* VoidExpression */:
return visitNode(cbNode, node.expression);
case 217 /* PrefixUnaryExpression */:
return visitNode(cbNode, node.operand);
case 222 /* YieldExpression */:
return visitNode(cbNode, node.asteriskToken) ||
visitNode(cbNode, node.expression);
case 216 /* AwaitExpression */:
return visitNode(cbNode, node.expression);
case 218 /* PostfixUnaryExpression */:
return visitNode(cbNode, node.operand);
case 219 /* BinaryExpression */:
return visitNode(cbNode, node.left) ||
visitNode(cbNode, node.operatorToken) ||
visitNode(cbNode, node.right);
case 227 /* AsExpression */:
return visitNode(cbNode, node.expression) ||
visitNode(cbNode, node.type);
case 228 /* NonNullExpression */:
return visitNode(cbNode, node.expression);
case 229 /* MetaProperty */:
return visitNode(cbNode, node.name);
case 220 /* ConditionalExpression */:
return visitNode(cbNode, node.condition) ||
visitNode(cbNode, node.questionToken) ||
visitNode(cbNode, node.whenTrue) ||
visitNode(cbNode, node.colonToken) ||
visitNode(cbNode, node.whenFalse);
case 223 /* SpreadElement */:
return visitNode(cbNode, node.expression);
case 233 /* Block */:
case 260 /* ModuleBlock */:
return visitNodes(cbNode, cbNodes, node.statements);
case 300 /* SourceFile */:
return visitNodes(cbNode, cbNodes, node.statements) ||
visitNode(cbNode, node.endOfFileToken);
case 235 /* VariableStatement */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.declarationList);
case 253 /* VariableDeclarationList */:
return visitNodes(cbNode, cbNodes, node.declarations);
case 236 /* ExpressionStatement */:
return visitNode(cbNode, node.expression);
case 237 /* IfStatement */:
return visitNode(cbNode, node.expression) ||
visitNode(cbNode, node.thenStatement) ||
visitNode(cbNode, node.elseStatement);
case 238 /* DoStatement */:
return visitNode(cbNode, node.statement) ||
visitNode(cbNode, node.expression);
case 239 /* WhileStatement */:
return visitNode(cbNode, node.expression) ||
visitNode(cbNode, node.statement);
case 240 /* ForStatement */:
return visitNode(cbNode, node.initializer) ||
visitNode(cbNode, node.condition) ||
visitNode(cbNode, node.incrementor) ||
visitNode(cbNode, node.statement);
case 241 /* ForInStatement */:
return visitNode(cbNode, node.initializer) ||
visitNode(cbNode, node.expression) ||
visitNode(cbNode, node.statement);
case 242 /* ForOfStatement */:
return visitNode(cbNode, node.awaitModifier) ||
visitNode(cbNode, node.initializer) ||
visitNode(cbNode, node.expression) ||
visitNode(cbNode, node.statement);
case 243 /* ContinueStatement */:
case 244 /* BreakStatement */:
return visitNode(cbNode, node.label);
case 245 /* ReturnStatement */:
return visitNode(cbNode, node.expression);
case 246 /* WithStatement */:
return visitNode(cbNode, node.expression) ||
visitNode(cbNode, node.statement);
case 247 /* SwitchStatement */:
return visitNode(cbNode, node.expression) ||
visitNode(cbNode, node.caseBlock);
case 261 /* CaseBlock */:
return visitNodes(cbNode, cbNodes, node.clauses);
case 287 /* CaseClause */:
return visitNode(cbNode, node.expression) ||
visitNodes(cbNode, cbNodes, node.statements);
case 288 /* DefaultClause */:
return visitNodes(cbNode, cbNodes, node.statements);
case 248 /* LabeledStatement */:
return visitNode(cbNode, node.label) ||
visitNode(cbNode, node.statement);
case 249 /* ThrowStatement */:
return visitNode(cbNode, node.expression);
case 250 /* TryStatement */:
return visitNode(cbNode, node.tryBlock) ||
visitNode(cbNode, node.catchClause) ||
visitNode(cbNode, node.finallyBlock);
case 290 /* CatchClause */:
return visitNode(cbNode, node.variableDeclaration) ||
visitNode(cbNode, node.block);
case 163 /* Decorator */:
return visitNode(cbNode, node.expression);
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.name) ||
visitNodes(cbNode, cbNodes, node.typeParameters) ||
visitNodes(cbNode, cbNodes, node.heritageClauses) ||
visitNodes(cbNode, cbNodes, node.members);
case 256 /* InterfaceDeclaration */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.name) ||
visitNodes(cbNode, cbNodes, node.typeParameters) ||
visitNodes(cbNode, cbNodes, node.heritageClauses) ||
visitNodes(cbNode, cbNodes, node.members);
case 257 /* TypeAliasDeclaration */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.name) ||
visitNodes(cbNode, cbNodes, node.typeParameters) ||
visitNode(cbNode, node.type);
case 258 /* EnumDeclaration */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.name) ||
visitNodes(cbNode, cbNodes, node.members);
case 294 /* EnumMember */:
return visitNode(cbNode, node.name) ||
visitNode(cbNode, node.initializer);
case 259 /* ModuleDeclaration */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.name) ||
visitNode(cbNode, node.body);
case 263 /* ImportEqualsDeclaration */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.name) ||
visitNode(cbNode, node.moduleReference);
case 264 /* ImportDeclaration */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.importClause) ||
visitNode(cbNode, node.moduleSpecifier);
case 265 /* ImportClause */:
return visitNode(cbNode, node.name) ||
visitNode(cbNode, node.namedBindings);
case 262 /* NamespaceExportDeclaration */:
return visitNode(cbNode, node.name);
case 266 /* NamespaceImport */:
return visitNode(cbNode, node.name);
case 272 /* NamespaceExport */:
return visitNode(cbNode, node.name);
case 267 /* NamedImports */:
case 271 /* NamedExports */:
return visitNodes(cbNode, cbNodes, node.elements);
case 270 /* ExportDeclaration */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.exportClause) ||
visitNode(cbNode, node.moduleSpecifier);
case 268 /* ImportSpecifier */:
case 273 /* ExportSpecifier */:
return visitNode(cbNode, node.propertyName) ||
visitNode(cbNode, node.name);
case 269 /* ExportAssignment */:
return visitNodes(cbNode, cbNodes, node.decorators) ||
visitNodes(cbNode, cbNodes, node.modifiers) ||
visitNode(cbNode, node.expression);
case 221 /* TemplateExpression */:
return visitNode(cbNode, node.head) || visitNodes(cbNode, cbNodes, node.templateSpans);
case 231 /* TemplateSpan */:
return visitNode(cbNode, node.expression) || visitNode(cbNode, node.literal);
case 196 /* TemplateLiteralType */:
return visitNode(cbNode, node.head) || visitNodes(cbNode, cbNodes, node.templateSpans);
case 197 /* TemplateLiteralTypeSpan */:
return visitNode(cbNode, node.type) || visitNode(cbNode, node.literal);
case 160 /* ComputedPropertyName */:
return visitNode(cbNode, node.expression);
case 289 /* HeritageClause */:
return visitNodes(cbNode, cbNodes, node.types);
case 226 /* ExpressionWithTypeArguments */:
return visitNode(cbNode, node.expression) ||
visitNodes(cbNode, cbNodes, node.typeArguments);
case 275 /* ExternalModuleReference */:
return visitNode(cbNode, node.expression);
case 274 /* MissingDeclaration */:
return visitNodes(cbNode, cbNodes, node.decorators);
case 346 /* CommaListExpression */:
return visitNodes(cbNode, cbNodes, node.elements);
case 276 /* JsxElement */:
return visitNode(cbNode, node.openingElement) ||
visitNodes(cbNode, cbNodes, node.children) ||
visitNode(cbNode, node.closingElement);
case 280 /* JsxFragment */:
return visitNode(cbNode, node.openingFragment) ||
visitNodes(cbNode, cbNodes, node.children) ||
visitNode(cbNode, node.closingFragment);
case 277 /* JsxSelfClosingElement */:
case 278 /* JsxOpeningElement */:
return visitNode(cbNode, node.tagName) ||
visitNodes(cbNode, cbNodes, node.typeArguments) ||
visitNode(cbNode, node.attributes);
case 284 /* JsxAttributes */:
return visitNodes(cbNode, cbNodes, node.properties);
case 283 /* JsxAttribute */:
return visitNode(cbNode, node.name) ||
visitNode(cbNode, node.initializer);
case 285 /* JsxSpreadAttribute */:
return visitNode(cbNode, node.expression);
case 286 /* JsxExpression */:
return visitNode(cbNode, node.dotDotDotToken) ||
visitNode(cbNode, node.expression);
case 279 /* JsxClosingElement */:
return visitNode(cbNode, node.tagName);
case 183 /* OptionalType */:
case 184 /* RestType */:
case 304 /* JSDocTypeExpression */:
case 310 /* JSDocNonNullableType */:
case 309 /* JSDocNullableType */:
case 311 /* JSDocOptionalType */:
case 313 /* JSDocVariadicType */:
return visitNode(cbNode, node.type);
case 312 /* JSDocFunctionType */:
return visitNodes(cbNode, cbNodes, node.parameters) ||
visitNode(cbNode, node.type);
case 315 /* JSDocComment */:
return (typeof node.comment === "string" ? undefined : visitNodes(cbNode, cbNodes, node.comment))
|| visitNodes(cbNode, cbNodes, node.tags);
case 341 /* JSDocSeeTag */:
return visitNode(cbNode, node.tagName) ||
visitNode(cbNode, node.name) ||
(typeof node.comment === "string" ? undefined : visitNodes(cbNode, cbNodes, node.comment));
case 305 /* JSDocNameReference */:
return visitNode(cbNode, node.name);
case 306 /* JSDocMemberName */:
return visitNode(cbNode, node.left) ||
visitNode(cbNode, node.right);
case 335 /* JSDocParameterTag */:
case 342 /* JSDocPropertyTag */:
return visitNode(cbNode, node.tagName) ||
(node.isNameFirst
? visitNode(cbNode, node.name) ||
visitNode(cbNode, node.typeExpression) ||
(typeof node.comment === "string" ? undefined : visitNodes(cbNode, cbNodes, node.comment))
: visitNode(cbNode, node.typeExpression) ||
visitNode(cbNode, node.name) ||
(typeof node.comment === "string" ? undefined : visitNodes(cbNode, cbNodes, node.comment)));
case 325 /* JSDocAuthorTag */:
return visitNode(cbNode, node.tagName) ||
(typeof node.comment === "string" ? undefined : visitNodes(cbNode, cbNodes, node.comment));
case 324 /* JSDocImplementsTag */:
return visitNode(cbNode, node.tagName) ||
visitNode(cbNode, node.class) ||
(typeof node.comment === "string" ? undefined : visitNodes(cbNode, cbNodes, node.comment));
case 323 /* JSDocAugmentsTag */:
return visitNode(cbNode, node.tagName) ||
visitNode(cbNode, node.class) ||
(typeof node.comment === "string" ? undefined : visitNodes(cbNode, cbNodes, node.comment));
case 339 /* JSDocTemplateTag */:
return visitNode(cbNode, node.tagName) ||
visitNode(cbNode, node.constraint) ||
visitNodes(cbNode, cbNodes, node.typeParameters) ||
(typeof node.comment === "string" ? undefined : visitNodes(cbNode, cbNodes, node.comment));
case 340 /* JSDocTypedefTag */:
return visitNode(cbNode, node.tagName) ||
(node.typeExpression &&
node.typeExpression.kind === 304 /* JSDocTypeExpression */
? visitNode(cbNode, node.typeExpression) ||
visitNode(cbNode, node.fullName) ||
(typeof node.comment === "string" ? undefined : visitNodes(cbNode, cbNodes, node.comment))
: visitNode(cbNode, node.fullName) ||
visitNode(cbNode, node.typeExpression) ||
(typeof node.comment === "string" ? undefined : visitNodes(cbNode, cbNodes, node.comment)));
case 333 /* JSDocCallbackTag */:
return visitNode(cbNode, node.tagName) ||
visitNode(cbNode, node.fullName) ||
visitNode(cbNode, node.typeExpression) ||
(typeof node.comment === "string" ? undefined : visitNodes(cbNode, cbNodes, node.comment));
case 336 /* JSDocReturnTag */:
case 338 /* JSDocTypeTag */:
case 337 /* JSDocThisTag */:
case 334 /* JSDocEnumTag */:
return visitNode(cbNode, node.tagName) ||
visitNode(cbNode, node.typeExpression) ||
(typeof node.comment === "string" ? undefined : visitNodes(cbNode, cbNodes, node.comment));
case 318 /* JSDocSignature */:
return ts.forEach(node.typeParameters, cbNode) ||
ts.forEach(node.parameters, cbNode) ||
visitNode(cbNode, node.type);
case 319 /* JSDocLink */:
case 320 /* JSDocLinkCode */:
case 321 /* JSDocLinkPlain */:
return visitNode(cbNode, node.name);
case 317 /* JSDocTypeLiteral */:
return ts.forEach(node.jsDocPropertyTags, cbNode);
case 322 /* JSDocTag */:
case 327 /* JSDocClassTag */:
case 328 /* JSDocPublicTag */:
case 329 /* JSDocPrivateTag */:
case 330 /* JSDocProtectedTag */:
case 331 /* JSDocReadonlyTag */:
case 326 /* JSDocDeprecatedTag */:
return visitNode(cbNode, node.tagName)
|| (typeof node.comment === "string" ? undefined : visitNodes(cbNode, cbNodes, node.comment));
case 345 /* PartiallyEmittedExpression */:
return visitNode(cbNode, node.expression);
}
}
ts.forEachChild = forEachChild;
/** @internal */
/**
* Invokes a callback for each child of the given node. The 'cbNode' callback is invoked for all child nodes
* stored in properties. If a 'cbNodes' callback is specified, it is invoked for embedded arrays; additionally,
* unlike `forEachChild`, embedded arrays are flattened and the 'cbNode' callback is invoked for each element.
* If a callback returns a truthy value, iteration stops and that value is returned. Otherwise, undefined is returned.
*
* @param node a given node to visit its children
* @param cbNode a callback to be invoked for all child nodes
* @param cbNodes a callback to be invoked for embedded array
*
* @remarks Unlike `forEachChild`, `forEachChildRecursively` handles recursively invoking the traversal on each child node found,
* and while doing so, handles traversing the structure without relying on the callstack to encode the tree structure.
*/
function forEachChildRecursively(rootNode, cbNode, cbNodes) {
var queue = gatherPossibleChildren(rootNode);
var parents = []; // tracks parent references for elements in queue
while (parents.length < queue.length) {
parents.push(rootNode);
}
while (queue.length !== 0) {
var current = queue.pop();
var parent = parents.pop();
if (ts.isArray(current)) {
if (cbNodes) {
var res = cbNodes(current, parent);
if (res) {
if (res === "skip")
continue;
return res;
}
}
for (var i = current.length - 1; i >= 0; --i) {
queue.push(current[i]);
parents.push(parent);
}
}
else {
var res = cbNode(current, parent);
if (res) {
if (res === "skip")
continue;
return res;
}
if (current.kind >= 159 /* FirstNode */) {
// add children in reverse order to the queue, so popping gives the first child
for (var _i = 0, _a = gatherPossibleChildren(current); _i < _a.length; _i++) {
var child = _a[_i];
queue.push(child);
parents.push(current);
}
}
}
}
}
ts.forEachChildRecursively = forEachChildRecursively;
function gatherPossibleChildren(node) {
var children = [];
forEachChild(node, addWorkItem, addWorkItem); // By using a stack above and `unshift` here, we emulate a depth-first preorder traversal
return children;
function addWorkItem(n) {
children.unshift(n);
}
}
function createSourceFile(fileName, sourceText, languageVersion, setParentNodes, scriptKind) {
if (setParentNodes === void 0) { setParentNodes = false; }
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("parse" /* Parse */, "createSourceFile", { path: fileName }, /*separateBeginAndEnd*/ true);
ts.performance.mark("beforeParse");
var result;
ts.perfLogger.logStartParseSourceFile(fileName);
if (languageVersion === 100 /* JSON */) {
result = Parser.parseSourceFile(fileName, sourceText, languageVersion, /*syntaxCursor*/ undefined, setParentNodes, 6 /* JSON */);
}
else {
result = Parser.parseSourceFile(fileName, sourceText, languageVersion, /*syntaxCursor*/ undefined, setParentNodes, scriptKind);
}
ts.perfLogger.logStopParseSourceFile();
ts.performance.mark("afterParse");
ts.performance.measure("Parse", "beforeParse", "afterParse");
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
return result;
}
ts.createSourceFile = createSourceFile;
function parseIsolatedEntityName(text, languageVersion) {
return Parser.parseIsolatedEntityName(text, languageVersion);
}
ts.parseIsolatedEntityName = parseIsolatedEntityName;
/**
* Parse json text into SyntaxTree and return node and parse errors if any
* @param fileName
* @param sourceText
*/
function parseJsonText(fileName, sourceText) {
return Parser.parseJsonText(fileName, sourceText);
}
ts.parseJsonText = parseJsonText;
// See also `isExternalOrCommonJsModule` in utilities.ts
function isExternalModule(file) {
return file.externalModuleIndicator !== undefined;
}
ts.isExternalModule = isExternalModule;
// Produces a new SourceFile for the 'newText' provided. The 'textChangeRange' parameter
// indicates what changed between the 'text' that this SourceFile has and the 'newText'.
// The SourceFile will be created with the compiler attempting to reuse as many nodes from
// this file as possible.
//
// Note: this function mutates nodes from this SourceFile. That means any existing nodes
// from this SourceFile that are being held onto may change as a result (including
// becoming detached from any SourceFile). It is recommended that this SourceFile not
// be used once 'update' is called on it.
function updateSourceFile(sourceFile, newText, textChangeRange, aggressiveChecks) {
if (aggressiveChecks === void 0) { aggressiveChecks = false; }
var newSourceFile = IncrementalParser.updateSourceFile(sourceFile, newText, textChangeRange, aggressiveChecks);
// Because new source file node is created, it may not have the flag PossiblyContainDynamicImport. This is the case if there is no new edit to add dynamic import.
// We will manually port the flag to the new source file.
newSourceFile.flags |= (sourceFile.flags & 3145728 /* PermanentlySetIncrementalFlags */);
return newSourceFile;
}
ts.updateSourceFile = updateSourceFile;
/* @internal */
function parseIsolatedJSDocComment(content, start, length) {
var result = Parser.JSDocParser.parseIsolatedJSDocComment(content, start, length);
if (result && result.jsDoc) {
// because the jsDocComment was parsed out of the source file, it might
// not be covered by the fixupParentReferences.
Parser.fixupParentReferences(result.jsDoc);
}
return result;
}
ts.parseIsolatedJSDocComment = parseIsolatedJSDocComment;
/* @internal */
// Exposed only for testing.
function parseJSDocTypeExpressionForTests(content, start, length) {
return Parser.JSDocParser.parseJSDocTypeExpressionForTests(content, start, length);
}
ts.parseJSDocTypeExpressionForTests = parseJSDocTypeExpressionForTests;
// Implement the parser as a singleton module. We do this for perf reasons because creating
// parser instances can actually be expensive enough to impact us on projects with many source
// files.
var Parser;
(function (Parser) {
// Share a single scanner across all calls to parse a source file. This helps speed things
// up by avoiding the cost of creating/compiling scanners over and over again.
var scanner = ts.createScanner(99 /* Latest */, /*skipTrivia*/ true);
var disallowInAndDecoratorContext = 4096 /* DisallowInContext */ | 16384 /* DecoratorContext */;
// capture constructors in 'initializeState' to avoid null checks
// tslint:disable variable-name
var NodeConstructor;
var TokenConstructor;
var IdentifierConstructor;
var PrivateIdentifierConstructor;
var SourceFileConstructor;
// tslint:enable variable-name
function countNode(node) {
nodeCount++;
return node;
}
// Rather than using `createBaseNodeFactory` here, we establish a `BaseNodeFactory` that closes over the
// constructors above, which are reset each time `initializeState` is called.
var baseNodeFactory = {
createBaseSourceFileNode: function (kind) { return countNode(new SourceFileConstructor(kind, /*pos*/ 0, /*end*/ 0)); },
createBaseIdentifierNode: function (kind) { return countNode(new IdentifierConstructor(kind, /*pos*/ 0, /*end*/ 0)); },
createBasePrivateIdentifierNode: function (kind) { return countNode(new PrivateIdentifierConstructor(kind, /*pos*/ 0, /*end*/ 0)); },
createBaseTokenNode: function (kind) { return countNode(new TokenConstructor(kind, /*pos*/ 0, /*end*/ 0)); },
createBaseNode: function (kind) { return countNode(new NodeConstructor(kind, /*pos*/ 0, /*end*/ 0)); }
};
var factory = ts.createNodeFactory(1 /* NoParenthesizerRules */ | 2 /* NoNodeConverters */ | 8 /* NoOriginalNode */, baseNodeFactory);
var fileName;
var sourceFlags;
var sourceText;
var languageVersion;
var scriptKind;
var languageVariant;
var parseDiagnostics;
var jsDocDiagnostics;
var syntaxCursor;
var currentToken;
var nodeCount;
var identifiers;
var privateIdentifiers;
var identifierCount;
var parsingContext;
var notParenthesizedArrow;
// Flags that dictate what parsing context we're in. For example:
// Whether or not we are in strict parsing mode. All that changes in strict parsing mode is
// that some tokens that would be considered identifiers may be considered keywords.
//
// When adding more parser context flags, consider which is the more common case that the
// flag will be in. This should be the 'false' state for that flag. The reason for this is
// that we don't store data in our nodes unless the value is in the *non-default* state. So,
// for example, more often than code 'allows-in' (or doesn't 'disallow-in'). We opt for
// 'disallow-in' set to 'false'. Otherwise, if we had 'allowsIn' set to 'true', then almost
// all nodes would need extra state on them to store this info.
//
// Note: 'allowIn' and 'allowYield' track 1:1 with the [in] and [yield] concepts in the ES6
// grammar specification.
//
// An important thing about these context concepts. By default they are effectively inherited
// while parsing through every grammar production. i.e. if you don't change them, then when
// you parse a sub-production, it will have the same context values as the parent production.
// This is great most of the time. After all, consider all the 'expression' grammar productions
// and how nearly all of them pass along the 'in' and 'yield' context values:
//
// EqualityExpression[In, Yield] :
// RelationalExpression[?In, ?Yield]
// EqualityExpression[?In, ?Yield] == RelationalExpression[?In, ?Yield]
// EqualityExpression[?In, ?Yield] != RelationalExpression[?In, ?Yield]
// EqualityExpression[?In, ?Yield] === RelationalExpression[?In, ?Yield]
// EqualityExpression[?In, ?Yield] !== RelationalExpression[?In, ?Yield]
//
// Where you have to be careful is then understanding what the points are in the grammar
// where the values are *not* passed along. For example:
//
// SingleNameBinding[Yield,GeneratorParameter]
// [+GeneratorParameter]BindingIdentifier[Yield] Initializer[In]opt
// [~GeneratorParameter]BindingIdentifier[?Yield]Initializer[In, ?Yield]opt
//
// Here this is saying that if the GeneratorParameter context flag is set, that we should
// explicitly set the 'yield' context flag to false before calling into the BindingIdentifier
// and we should explicitly unset the 'yield' context flag before calling into the Initializer.
// production. Conversely, if the GeneratorParameter context flag is not set, then we
// should leave the 'yield' context flag alone.
//
// Getting this all correct is tricky and requires careful reading of the grammar to
// understand when these values should be changed versus when they should be inherited.
//
// Note: it should not be necessary to save/restore these flags during speculative/lookahead
// parsing. These context flags are naturally stored and restored through normal recursive
// descent parsing and unwinding.
var contextFlags;
// Indicates whether we are currently parsing top-level statements.
var topLevel = true;
// Whether or not we've had a parse error since creating the last AST node. If we have
// encountered an error, it will be stored on the next AST node we create. Parse errors
// can be broken down into three categories:
//
// 1) An error that occurred during scanning. For example, an unterminated literal, or a
// character that was completely not understood.
//
// 2) A token was expected, but was not present. This type of error is commonly produced
// by the 'parseExpected' function.
//
// 3) A token was present that no parsing function was able to consume. This type of error
// only occurs in the 'abortParsingListOrMoveToNextToken' function when the parser
// decides to skip the token.
//
// In all of these cases, we want to mark the next node as having had an error before it.
// With this mark, we can know in incremental settings if this node can be reused, or if
// we have to reparse it. If we don't keep this information around, we may just reuse the
// node. in that event we would then not produce the same errors as we did before, causing
// significant confusion problems.
//
// Note: it is necessary that this value be saved/restored during speculative/lookahead
// parsing. During lookahead parsing, we will often create a node. That node will have
// this value attached, and then this value will be set back to 'false'. If we decide to
// rewind, we must get back to the same value we had prior to the lookahead.
//
// Note: any errors at the end of the file that do not precede a regular node, should get
// attached to the EOF token.
var parseErrorBeforeNextFinishedNode = false;
function parseSourceFile(fileName, sourceText, languageVersion, syntaxCursor, setParentNodes, scriptKind) {
var _a;
if (setParentNodes === void 0) { setParentNodes = false; }
scriptKind = ts.ensureScriptKind(fileName, scriptKind);
if (scriptKind === 6 /* JSON */) {
var result_3 = parseJsonText(fileName, sourceText, languageVersion, syntaxCursor, setParentNodes);
ts.convertToObjectWorker(result_3, (_a = result_3.statements[0]) === null || _a === void 0 ? void 0 : _a.expression, result_3.parseDiagnostics, /*returnValue*/ false, /*knownRootOptions*/ undefined, /*jsonConversionNotifier*/ undefined);
result_3.referencedFiles = ts.emptyArray;
result_3.typeReferenceDirectives = ts.emptyArray;
result_3.libReferenceDirectives = ts.emptyArray;
result_3.amdDependencies = ts.emptyArray;
result_3.hasNoDefaultLib = false;
result_3.pragmas = ts.emptyMap;
return result_3;
}
initializeState(fileName, sourceText, languageVersion, syntaxCursor, scriptKind);
var result = parseSourceFileWorker(languageVersion, setParentNodes, scriptKind);
clearState();
return result;
}
Parser.parseSourceFile = parseSourceFile;
function parseIsolatedEntityName(content, languageVersion) {
// Choice of `isDeclarationFile` should be arbitrary
initializeState("", content, languageVersion, /*syntaxCursor*/ undefined, 1 /* JS */);
// Prime the scanner.
nextToken();
var entityName = parseEntityName(/*allowReservedWords*/ true);
var isInvalid = token() === 1 /* EndOfFileToken */ && !parseDiagnostics.length;
clearState();
return isInvalid ? entityName : undefined;
}
Parser.parseIsolatedEntityName = parseIsolatedEntityName;
function parseJsonText(fileName, sourceText, languageVersion, syntaxCursor, setParentNodes) {
if (languageVersion === void 0) { languageVersion = 2 /* ES2015 */; }
if (setParentNodes === void 0) { setParentNodes = false; }
initializeState(fileName, sourceText, languageVersion, syntaxCursor, 6 /* JSON */);
sourceFlags = contextFlags;
// Prime the scanner.
nextToken();
var pos = getNodePos();
var statements, endOfFileToken;
if (token() === 1 /* EndOfFileToken */) {
statements = createNodeArray([], pos, pos);
endOfFileToken = parseTokenNode();
}
else {
// Loop and synthesize an ArrayLiteralExpression if there are more than
// one top-level expressions to ensure all input text is consumed.
var expressions = void 0;
while (token() !== 1 /* EndOfFileToken */) {
var expression_1 = void 0;
switch (token()) {
case 22 /* OpenBracketToken */:
expression_1 = parseArrayLiteralExpression();
break;
case 110 /* TrueKeyword */:
case 95 /* FalseKeyword */:
case 104 /* NullKeyword */:
expression_1 = parseTokenNode();
break;
case 40 /* MinusToken */:
if (lookAhead(function () { return nextToken() === 8 /* NumericLiteral */ && nextToken() !== 58 /* ColonToken */; })) {
expression_1 = parsePrefixUnaryExpression();
}
else {
expression_1 = parseObjectLiteralExpression();
}
break;
case 8 /* NumericLiteral */:
case 10 /* StringLiteral */:
if (lookAhead(function () { return nextToken() !== 58 /* ColonToken */; })) {
expression_1 = parseLiteralNode();
break;
}
// falls through
default:
expression_1 = parseObjectLiteralExpression();
break;
}
// Error recovery: collect multiple top-level expressions
if (expressions && ts.isArray(expressions)) {
expressions.push(expression_1);
}
else if (expressions) {
expressions = [expressions, expression_1];
}
else {
expressions = expression_1;
if (token() !== 1 /* EndOfFileToken */) {
parseErrorAtCurrentToken(ts.Diagnostics.Unexpected_token);
}
}
}
var expression = ts.isArray(expressions) ? finishNode(factory.createArrayLiteralExpression(expressions), pos) : ts.Debug.checkDefined(expressions);
var statement = factory.createExpressionStatement(expression);
finishNode(statement, pos);
statements = createNodeArray([statement], pos);
endOfFileToken = parseExpectedToken(1 /* EndOfFileToken */, ts.Diagnostics.Unexpected_token);
}
// Set source file so that errors will be reported with this file name
var sourceFile = createSourceFile(fileName, 2 /* ES2015 */, 6 /* JSON */, /*isDeclaration*/ false, statements, endOfFileToken, sourceFlags);
if (setParentNodes) {
fixupParentReferences(sourceFile);
}
sourceFile.nodeCount = nodeCount;
sourceFile.identifierCount = identifierCount;
sourceFile.identifiers = identifiers;
sourceFile.parseDiagnostics = ts.attachFileToDiagnostics(parseDiagnostics, sourceFile);
if (jsDocDiagnostics) {
sourceFile.jsDocDiagnostics = ts.attachFileToDiagnostics(jsDocDiagnostics, sourceFile);
}
var result = sourceFile;
clearState();
return result;
}
Parser.parseJsonText = parseJsonText;
function initializeState(_fileName, _sourceText, _languageVersion, _syntaxCursor, _scriptKind) {
NodeConstructor = ts.objectAllocator.getNodeConstructor();
TokenConstructor = ts.objectAllocator.getTokenConstructor();
IdentifierConstructor = ts.objectAllocator.getIdentifierConstructor();
PrivateIdentifierConstructor = ts.objectAllocator.getPrivateIdentifierConstructor();
SourceFileConstructor = ts.objectAllocator.getSourceFileConstructor();
fileName = ts.normalizePath(_fileName);
sourceText = _sourceText;
languageVersion = _languageVersion;
syntaxCursor = _syntaxCursor;
scriptKind = _scriptKind;
languageVariant = ts.getLanguageVariant(_scriptKind);
parseDiagnostics = [];
parsingContext = 0;
identifiers = new ts.Map();
privateIdentifiers = new ts.Map();
identifierCount = 0;
nodeCount = 0;
sourceFlags = 0;
topLevel = true;
switch (scriptKind) {
case 1 /* JS */:
case 2 /* JSX */:
contextFlags = 131072 /* JavaScriptFile */;
break;
case 6 /* JSON */:
contextFlags = 131072 /* JavaScriptFile */ | 33554432 /* JsonFile */;
break;
default:
contextFlags = 0 /* None */;
break;
}
parseErrorBeforeNextFinishedNode = false;
// Initialize and prime the scanner before parsing the source elements.
scanner.setText(sourceText);
scanner.setOnError(scanError);
scanner.setScriptTarget(languageVersion);
scanner.setLanguageVariant(languageVariant);
}
function clearState() {
// Clear out the text the scanner is pointing at, so it doesn't keep anything alive unnecessarily.
scanner.clearCommentDirectives();
scanner.setText("");
scanner.setOnError(undefined);
// Clear any data. We don't want to accidentally hold onto it for too long.
sourceText = undefined;
languageVersion = undefined;
syntaxCursor = undefined;
scriptKind = undefined;
languageVariant = undefined;
sourceFlags = 0;
parseDiagnostics = undefined;
jsDocDiagnostics = undefined;
parsingContext = 0;
identifiers = undefined;
notParenthesizedArrow = undefined;
topLevel = true;
}
function parseSourceFileWorker(languageVersion, setParentNodes, scriptKind) {
var isDeclarationFile = isDeclarationFileName(fileName);
if (isDeclarationFile) {
contextFlags |= 8388608 /* Ambient */;
}
sourceFlags = contextFlags;
// Prime the scanner.
nextToken();
var statements = parseList(0 /* SourceElements */, parseStatement);
ts.Debug.assert(token() === 1 /* EndOfFileToken */);
var endOfFileToken = addJSDocComment(parseTokenNode());
var sourceFile = createSourceFile(fileName, languageVersion, scriptKind, isDeclarationFile, statements, endOfFileToken, sourceFlags);
// A member of ReadonlyArray<T> isn't assignable to a member of T[] (and prevents a direct cast) - but this is where we set up those members so they can be readonly in the future
processCommentPragmas(sourceFile, sourceText);
processPragmasIntoFields(sourceFile, reportPragmaDiagnostic);
sourceFile.commentDirectives = scanner.getCommentDirectives();
sourceFile.nodeCount = nodeCount;
sourceFile.identifierCount = identifierCount;
sourceFile.identifiers = identifiers;
sourceFile.parseDiagnostics = ts.attachFileToDiagnostics(parseDiagnostics, sourceFile);
if (jsDocDiagnostics) {
sourceFile.jsDocDiagnostics = ts.attachFileToDiagnostics(jsDocDiagnostics, sourceFile);
}
if (setParentNodes) {
fixupParentReferences(sourceFile);
}
return sourceFile;
function reportPragmaDiagnostic(pos, end, diagnostic) {
parseDiagnostics.push(ts.createDetachedDiagnostic(fileName, pos, end, diagnostic));
}
}
function withJSDoc(node, hasJSDoc) {
return hasJSDoc ? addJSDocComment(node) : node;
}
var hasDeprecatedTag = false;
function addJSDocComment(node) {
ts.Debug.assert(!node.jsDoc); // Should only be called once per node
var jsDoc = ts.mapDefined(ts.getJSDocCommentRanges(node, sourceText), function (comment) { return JSDocParser.parseJSDocComment(node, comment.pos, comment.end - comment.pos); });
if (jsDoc.length)
node.jsDoc = jsDoc;
if (hasDeprecatedTag) {
hasDeprecatedTag = false;
node.flags |= 134217728 /* Deprecated */;
}
return node;
}
function reparseTopLevelAwait(sourceFile) {
var savedSyntaxCursor = syntaxCursor;
var baseSyntaxCursor = IncrementalParser.createSyntaxCursor(sourceFile);
syntaxCursor = { currentNode: currentNode };
var statements = [];
var savedParseDiagnostics = parseDiagnostics;
parseDiagnostics = [];
var pos = 0;
var start = findNextStatementWithAwait(sourceFile.statements, 0);
var _loop_3 = function () {
// append all statements between pos and start
var prevStatement = sourceFile.statements[pos];
var nextStatement = sourceFile.statements[start];
ts.addRange(statements, sourceFile.statements, pos, start);
pos = findNextStatementWithoutAwait(sourceFile.statements, start);
// append all diagnostics associated with the copied range
var diagnosticStart = ts.findIndex(savedParseDiagnostics, function (diagnostic) { return diagnostic.start >= prevStatement.pos; });
var diagnosticEnd = diagnosticStart >= 0 ? ts.findIndex(savedParseDiagnostics, function (diagnostic) { return diagnostic.start >= nextStatement.pos; }, diagnosticStart) : -1;
if (diagnosticStart >= 0) {
ts.addRange(parseDiagnostics, savedParseDiagnostics, diagnosticStart, diagnosticEnd >= 0 ? diagnosticEnd : undefined);
}
// reparse all statements between start and pos. We skip existing diagnostics for the same range and allow the parser to generate new ones.
speculationHelper(function () {
var savedContextFlags = contextFlags;
contextFlags |= 32768 /* AwaitContext */;
scanner.setTextPos(nextStatement.pos);
nextToken();
while (token() !== 1 /* EndOfFileToken */) {
var startPos = scanner.getStartPos();
var statement = parseListElement(0 /* SourceElements */, parseStatement);
statements.push(statement);
if (startPos === scanner.getStartPos()) {
nextToken();
}
if (pos >= 0) {
var nonAwaitStatement = sourceFile.statements[pos];
if (statement.end === nonAwaitStatement.pos) {
// done reparsing this section
break;
}
if (statement.end > nonAwaitStatement.pos) {
// we ate into the next statement, so we must reparse it.
pos = findNextStatementWithoutAwait(sourceFile.statements, pos + 1);
}
}
}
contextFlags = savedContextFlags;
}, 2 /* Reparse */);
// find the next statement containing an `await`
start = pos >= 0 ? findNextStatementWithAwait(sourceFile.statements, pos) : -1;
};
while (start !== -1) {
_loop_3();
}
// append all statements between pos and the end of the list
if (pos >= 0) {
var prevStatement_1 = sourceFile.statements[pos];
ts.addRange(statements, sourceFile.statements, pos);
// append all diagnostics associated with the copied range
var diagnosticStart = ts.findIndex(savedParseDiagnostics, function (diagnostic) { return diagnostic.start >= prevStatement_1.pos; });
if (diagnosticStart >= 0) {
ts.addRange(parseDiagnostics, savedParseDiagnostics, diagnosticStart);
}
}
syntaxCursor = savedSyntaxCursor;
return factory.updateSourceFile(sourceFile, ts.setTextRange(factory.createNodeArray(statements), sourceFile.statements));
function containsPossibleTopLevelAwait(node) {
return !(node.flags & 32768 /* AwaitContext */)
&& !!(node.transformFlags & 16777216 /* ContainsPossibleTopLevelAwait */);
}
function findNextStatementWithAwait(statements, start) {
for (var i = start; i < statements.length; i++) {
if (containsPossibleTopLevelAwait(statements[i])) {
return i;
}
}
return -1;
}
function findNextStatementWithoutAwait(statements, start) {
for (var i = start; i < statements.length; i++) {
if (!containsPossibleTopLevelAwait(statements[i])) {
return i;
}
}
return -1;
}
function currentNode(position) {
var node = baseSyntaxCursor.currentNode(position);
if (topLevel && node && containsPossibleTopLevelAwait(node)) {
node.intersectsChange = true;
}
return node;
}
}
function fixupParentReferences(rootNode) {
// normally parent references are set during binding. However, for clients that only need
// a syntax tree, and no semantic features, then the binding process is an unnecessary
// overhead. This functions allows us to set all the parents, without all the expense of
// binding.
ts.setParentRecursive(rootNode, /*incremental*/ true);
}
Parser.fixupParentReferences = fixupParentReferences;
function createSourceFile(fileName, languageVersion, scriptKind, isDeclarationFile, statements, endOfFileToken, flags) {
// code from createNode is inlined here so createNode won't have to deal with special case of creating source files
// this is quite rare comparing to other nodes and createNode should be as fast as possible
var sourceFile = factory.createSourceFile(statements, endOfFileToken, flags);
ts.setTextRangePosWidth(sourceFile, 0, sourceText.length);
setExternalModuleIndicator(sourceFile);
// If we parsed this as an external module, it may contain top-level await
if (!isDeclarationFile && isExternalModule(sourceFile) && sourceFile.transformFlags & 16777216 /* ContainsPossibleTopLevelAwait */) {
sourceFile = reparseTopLevelAwait(sourceFile);
}
sourceFile.text = sourceText;
sourceFile.bindDiagnostics = [];
sourceFile.bindSuggestionDiagnostics = undefined;
sourceFile.languageVersion = languageVersion;
sourceFile.fileName = fileName;
sourceFile.languageVariant = ts.getLanguageVariant(scriptKind);
sourceFile.isDeclarationFile = isDeclarationFile;
sourceFile.scriptKind = scriptKind;
return sourceFile;
}
function setContextFlag(val, flag) {
if (val) {
contextFlags |= flag;
}
else {
contextFlags &= ~flag;
}
}
function setDisallowInContext(val) {
setContextFlag(val, 4096 /* DisallowInContext */);
}
function setYieldContext(val) {
setContextFlag(val, 8192 /* YieldContext */);
}
function setDecoratorContext(val) {
setContextFlag(val, 16384 /* DecoratorContext */);
}
function setAwaitContext(val) {
setContextFlag(val, 32768 /* AwaitContext */);
}
function doOutsideOfContext(context, func) {
// contextFlagsToClear will contain only the context flags that are
// currently set that we need to temporarily clear
// We don't just blindly reset to the previous flags to ensure
// that we do not mutate cached flags for the incremental
// parser (ThisNodeHasError, ThisNodeOrAnySubNodesHasError, and
// HasAggregatedChildData).
var contextFlagsToClear = context & contextFlags;
if (contextFlagsToClear) {
// clear the requested context flags
setContextFlag(/*val*/ false, contextFlagsToClear);
var result = func();
// restore the context flags we just cleared
setContextFlag(/*val*/ true, contextFlagsToClear);
return result;
}
// no need to do anything special as we are not in any of the requested contexts
return func();
}
function doInsideOfContext(context, func) {
// contextFlagsToSet will contain only the context flags that
// are not currently set that we need to temporarily enable.
// We don't just blindly reset to the previous flags to ensure
// that we do not mutate cached flags for the incremental
// parser (ThisNodeHasError, ThisNodeOrAnySubNodesHasError, and
// HasAggregatedChildData).
var contextFlagsToSet = context & ~contextFlags;
if (contextFlagsToSet) {
// set the requested context flags
setContextFlag(/*val*/ true, contextFlagsToSet);
var result = func();
// reset the context flags we just set
setContextFlag(/*val*/ false, contextFlagsToSet);
return result;
}
// no need to do anything special as we are already in all of the requested contexts
return func();
}
function allowInAnd(func) {
return doOutsideOfContext(4096 /* DisallowInContext */, func);
}
function disallowInAnd(func) {
return doInsideOfContext(4096 /* DisallowInContext */, func);
}
function doInYieldContext(func) {
return doInsideOfContext(8192 /* YieldContext */, func);
}
function doInDecoratorContext(func) {
return doInsideOfContext(16384 /* DecoratorContext */, func);
}
function doInAwaitContext(func) {
return doInsideOfContext(32768 /* AwaitContext */, func);
}
function doOutsideOfAwaitContext(func) {
return doOutsideOfContext(32768 /* AwaitContext */, func);
}
function doInYieldAndAwaitContext(func) {
return doInsideOfContext(8192 /* YieldContext */ | 32768 /* AwaitContext */, func);
}
function doOutsideOfYieldAndAwaitContext(func) {
return doOutsideOfContext(8192 /* YieldContext */ | 32768 /* AwaitContext */, func);
}
function inContext(flags) {
return (contextFlags & flags) !== 0;
}
function inYieldContext() {
return inContext(8192 /* YieldContext */);
}
function inDisallowInContext() {
return inContext(4096 /* DisallowInContext */);
}
function inDecoratorContext() {
return inContext(16384 /* DecoratorContext */);
}
function inAwaitContext() {
return inContext(32768 /* AwaitContext */);
}
function parseErrorAtCurrentToken(message, arg0) {
parseErrorAt(scanner.getTokenPos(), scanner.getTextPos(), message, arg0);
}
function parseErrorAtPosition(start, length, message, arg0) {
// Don't report another error if it would just be at the same position as the last error.
var lastError = ts.lastOrUndefined(parseDiagnostics);
if (!lastError || start !== lastError.start) {
parseDiagnostics.push(ts.createDetachedDiagnostic(fileName, start, length, message, arg0));
}
// Mark that we've encountered an error. We'll set an appropriate bit on the next
// node we finish so that it can't be reused incrementally.
parseErrorBeforeNextFinishedNode = true;
}
function parseErrorAt(start, end, message, arg0) {
parseErrorAtPosition(start, end - start, message, arg0);
}
function parseErrorAtRange(range, message, arg0) {
parseErrorAt(range.pos, range.end, message, arg0);
}
function scanError(message, length) {
parseErrorAtPosition(scanner.getTextPos(), length, message);
}
function getNodePos() {
return scanner.getStartPos();
}
function hasPrecedingJSDocComment() {
return scanner.hasPrecedingJSDocComment();
}
// Use this function to access the current token instead of reading the currentToken
// variable. Since function results aren't narrowed in control flow analysis, this ensures
// that the type checker doesn't make wrong assumptions about the type of the current
// token (e.g. a call to nextToken() changes the current token but the checker doesn't
// reason about this side effect). Mainstream VMs inline simple functions like this, so
// there is no performance penalty.
function token() {
return currentToken;
}
function nextTokenWithoutCheck() {
return currentToken = scanner.scan();
}
function nextTokenAnd(func) {
nextToken();
return func();
}
function nextToken() {
// if the keyword had an escape
if (ts.isKeyword(currentToken) && (scanner.hasUnicodeEscape() || scanner.hasExtendedUnicodeEscape())) {
// issue a parse error for the escape
parseErrorAt(scanner.getTokenPos(), scanner.getTextPos(), ts.Diagnostics.Keywords_cannot_contain_escape_characters);
}
return nextTokenWithoutCheck();
}
function nextTokenJSDoc() {
return currentToken = scanner.scanJsDocToken();
}
function reScanGreaterToken() {
return currentToken = scanner.reScanGreaterToken();
}
function reScanSlashToken() {
return currentToken = scanner.reScanSlashToken();
}
function reScanTemplateToken(isTaggedTemplate) {
return currentToken = scanner.reScanTemplateToken(isTaggedTemplate);
}
function reScanTemplateHeadOrNoSubstitutionTemplate() {
return currentToken = scanner.reScanTemplateHeadOrNoSubstitutionTemplate();
}
function reScanLessThanToken() {
return currentToken = scanner.reScanLessThanToken();
}
function reScanHashToken() {
return currentToken = scanner.reScanHashToken();
}
function scanJsxIdentifier() {
return currentToken = scanner.scanJsxIdentifier();
}
function scanJsxText() {
return currentToken = scanner.scanJsxToken();
}
function scanJsxAttributeValue() {
return currentToken = scanner.scanJsxAttributeValue();
}
function speculationHelper(callback, speculationKind) {
// Keep track of the state we'll need to rollback to if lookahead fails (or if the
// caller asked us to always reset our state).
var saveToken = currentToken;
var saveParseDiagnosticsLength = parseDiagnostics.length;
var saveParseErrorBeforeNextFinishedNode = parseErrorBeforeNextFinishedNode;
// Note: it is not actually necessary to save/restore the context flags here. That's
// because the saving/restoring of these flags happens naturally through the recursive
// descent nature of our parser. However, we still store this here just so we can
// assert that invariant holds.
var saveContextFlags = contextFlags;
// If we're only looking ahead, then tell the scanner to only lookahead as well.
// Otherwise, if we're actually speculatively parsing, then tell the scanner to do the
// same.
var result = speculationKind !== 0 /* TryParse */
? scanner.lookAhead(callback)
: scanner.tryScan(callback);
ts.Debug.assert(saveContextFlags === contextFlags);
// If our callback returned something 'falsy' or we're just looking ahead,
// then unconditionally restore us to where we were.
if (!result || speculationKind !== 0 /* TryParse */) {
currentToken = saveToken;
if (speculationKind !== 2 /* Reparse */) {
parseDiagnostics.length = saveParseDiagnosticsLength;
}
parseErrorBeforeNextFinishedNode = saveParseErrorBeforeNextFinishedNode;
}
return result;
}
/** Invokes the provided callback then unconditionally restores the parser to the state it
* was in immediately prior to invoking the callback. The result of invoking the callback
* is returned from this function.
*/
function lookAhead(callback) {
return speculationHelper(callback, 1 /* Lookahead */);
}
/** Invokes the provided callback. If the callback returns something falsy, then it restores
* the parser to the state it was in immediately prior to invoking the callback. If the
* callback returns something truthy, then the parser state is not rolled back. The result
* of invoking the callback is returned from this function.
*/
function tryParse(callback) {
return speculationHelper(callback, 0 /* TryParse */);
}
function isBindingIdentifier() {
if (token() === 79 /* Identifier */) {
return true;
}
// `let await`/`let yield` in [Yield] or [Await] are allowed here and disallowed in the binder.
return token() > 116 /* LastReservedWord */;
}
// Ignore strict mode flag because we will report an error in type checker instead.
function isIdentifier() {
if (token() === 79 /* Identifier */) {
return true;
}
// If we have a 'yield' keyword, and we're in the [yield] context, then 'yield' is
// considered a keyword and is not an identifier.
if (token() === 125 /* YieldKeyword */ && inYieldContext()) {
return false;
}
// If we have a 'await' keyword, and we're in the [Await] context, then 'await' is
// considered a keyword and is not an identifier.
if (token() === 131 /* AwaitKeyword */ && inAwaitContext()) {
return false;
}
return token() > 116 /* LastReservedWord */;
}
function parseExpected(kind, diagnosticMessage, shouldAdvance) {
if (shouldAdvance === void 0) { shouldAdvance = true; }
if (token() === kind) {
if (shouldAdvance) {
nextToken();
}
return true;
}
// Report specific message if provided with one. Otherwise, report generic fallback message.
if (diagnosticMessage) {
parseErrorAtCurrentToken(diagnosticMessage);
}
else {
parseErrorAtCurrentToken(ts.Diagnostics._0_expected, ts.tokenToString(kind));
}
return false;
}
var viableKeywordSuggestions = Object.keys(ts.textToKeywordObj).filter(function (keyword) { return keyword.length > 2; });
/**
* Provides a better error message than the generic "';' expected" if possible for
* known common variants of a missing semicolon, such as from a mispelled names.
*
* @param node Node preceding the expected semicolon location.
*/
function parseErrorForMissingSemicolonAfter(node) {
var _a;
// Tagged template literals are sometimes used in places where only simple strings are allowed, i.e.:
// module `M1` {
// ^^^^^^^^^^^ This block is parsed as a template literal like module`M1`.
if (ts.isTaggedTemplateExpression(node)) {
parseErrorAt(ts.skipTrivia(sourceText, node.template.pos), node.template.end, ts.Diagnostics.Module_declaration_names_may_only_use_or_quoted_strings);
return;
}
// Otherwise, if this isn't a well-known keyword-like identifier, give the generic fallback message.
var expressionText = ts.isIdentifier(node) ? ts.idText(node) : undefined;
if (!expressionText || !ts.isIdentifierText(expressionText, languageVersion)) {
parseErrorAtCurrentToken(ts.Diagnostics._0_expected, ts.tokenToString(26 /* SemicolonToken */));
return;
}
var pos = ts.skipTrivia(sourceText, node.pos);
// Some known keywords are likely signs of syntax being used improperly.
switch (expressionText) {
case "const":
case "let":
case "var":
parseErrorAt(pos, node.end, ts.Diagnostics.Variable_declaration_not_allowed_at_this_location);
return;
case "declare":
// If a declared node failed to parse, it would have emitted a diagnostic already.
return;
case "interface":
parseErrorForInvalidName(ts.Diagnostics.Interface_name_cannot_be_0, ts.Diagnostics.Interface_must_be_given_a_name, 18 /* OpenBraceToken */);
return;
case "is":
parseErrorAt(pos, scanner.getTextPos(), ts.Diagnostics.A_type_predicate_is_only_allowed_in_return_type_position_for_functions_and_methods);
return;
case "module":
case "namespace":
parseErrorForInvalidName(ts.Diagnostics.Namespace_name_cannot_be_0, ts.Diagnostics.Namespace_must_be_given_a_name, 18 /* OpenBraceToken */);
return;
case "type":
parseErrorForInvalidName(ts.Diagnostics.Type_alias_name_cannot_be_0, ts.Diagnostics.Type_alias_must_be_given_a_name, 63 /* EqualsToken */);
return;
}
// The user alternatively might have misspelled or forgotten to add a space after a common keyword.
var suggestion = (_a = ts.getSpellingSuggestion(expressionText, viableKeywordSuggestions, function (n) { return n; })) !== null && _a !== void 0 ? _a : getSpaceSuggestion(expressionText);
if (suggestion) {
parseErrorAt(pos, node.end, ts.Diagnostics.Unknown_keyword_or_identifier_Did_you_mean_0, suggestion);
return;
}
// Unknown tokens are handled with their own errors in the scanner
if (token() === 0 /* Unknown */) {
return;
}
// Otherwise, we know this some kind of unknown word, not just a missing expected semicolon.
parseErrorAt(pos, node.end, ts.Diagnostics.Unexpected_keyword_or_identifier);
}
/**
* Reports a diagnostic error for the current token being an invalid name.
*
* @param blankDiagnostic Diagnostic to report for the case of the name being blank (matched tokenIfBlankName).
* @param nameDiagnostic Diagnostic to report for all other cases.
* @param tokenIfBlankName Current token if the name was invalid for being blank (not provided / skipped).
*/
function parseErrorForInvalidName(nameDiagnostic, blankDiagnostic, tokenIfBlankName) {
if (token() === tokenIfBlankName) {
parseErrorAtCurrentToken(blankDiagnostic);
}
else {
parseErrorAtCurrentToken(nameDiagnostic, ts.tokenToString(token()));
}
}
function getSpaceSuggestion(expressionText) {
for (var _i = 0, viableKeywordSuggestions_1 = viableKeywordSuggestions; _i < viableKeywordSuggestions_1.length; _i++) {
var keyword = viableKeywordSuggestions_1[_i];
if (expressionText.length > keyword.length + 2 && ts.startsWith(expressionText, keyword)) {
return keyword + " " + expressionText.slice(keyword.length);
}
}
return undefined;
}
function parseSemicolonAfterPropertyName(name, type, initializer) {
if (token() === 59 /* AtToken */ && !scanner.hasPrecedingLineBreak()) {
parseErrorAtCurrentToken(ts.Diagnostics.Decorators_must_precede_the_name_and_all_keywords_of_property_declarations);
return;
}
if (token() === 20 /* OpenParenToken */) {
parseErrorAtCurrentToken(ts.Diagnostics.Cannot_start_a_function_call_in_a_type_annotation);
nextToken();
return;
}
if (type && !canParseSemicolon()) {
if (initializer) {
parseErrorAtCurrentToken(ts.Diagnostics._0_expected, ts.tokenToString(26 /* SemicolonToken */));
}
else {
parseErrorAtCurrentToken(ts.Diagnostics.Expected_for_property_initializer);
}
return;
}
if (tryParseSemicolon()) {
return;
}
// If an initializer was parsed but there is still an error in finding the next semicolon,
// we generally know there was an error already reported in the initializer...
// class Example { a = new Map([), ) }
// ~
if (initializer) {
// ...unless we've found the start of a block after a property declaration, in which
// case we can know that regardless of the initializer we should complain on the block.
// class Example { a = 0 {} }
// ~
if (token() === 18 /* OpenBraceToken */) {
parseErrorAtCurrentToken(ts.Diagnostics._0_expected, ts.tokenToString(26 /* SemicolonToken */));
}
return;
}
parseErrorForMissingSemicolonAfter(name);
}
function parseExpectedJSDoc(kind) {
if (token() === kind) {
nextTokenJSDoc();
return true;
}
parseErrorAtCurrentToken(ts.Diagnostics._0_expected, ts.tokenToString(kind));
return false;
}
function parseOptional(t) {
if (token() === t) {
nextToken();
return true;
}
return false;
}
function parseOptionalToken(t) {
if (token() === t) {
return parseTokenNode();
}
return undefined;
}
function parseOptionalTokenJSDoc(t) {
if (token() === t) {
return parseTokenNodeJSDoc();
}
return undefined;
}
function parseExpectedToken(t, diagnosticMessage, arg0) {
return parseOptionalToken(t) ||
createMissingNode(t, /*reportAtCurrentPosition*/ false, diagnosticMessage || ts.Diagnostics._0_expected, arg0 || ts.tokenToString(t));
}
function parseExpectedTokenJSDoc(t) {
return parseOptionalTokenJSDoc(t) ||
createMissingNode(t, /*reportAtCurrentPosition*/ false, ts.Diagnostics._0_expected, ts.tokenToString(t));
}
function parseTokenNode() {
var pos = getNodePos();
var kind = token();
nextToken();
return finishNode(factory.createToken(kind), pos);
}
function parseTokenNodeJSDoc() {
var pos = getNodePos();
var kind = token();
nextTokenJSDoc();
return finishNode(factory.createToken(kind), pos);
}
function canParseSemicolon() {
// If there's a real semicolon, then we can always parse it out.
if (token() === 26 /* SemicolonToken */) {
return true;
}
// We can parse out an optional semicolon in ASI cases in the following cases.
return token() === 19 /* CloseBraceToken */ || token() === 1 /* EndOfFileToken */ || scanner.hasPrecedingLineBreak();
}
function tryParseSemicolon() {
if (!canParseSemicolon()) {
return false;
}
if (token() === 26 /* SemicolonToken */) {
// consume the semicolon if it was explicitly provided.
nextToken();
}
return true;
}
function parseSemicolon() {
return tryParseSemicolon() || parseExpected(26 /* SemicolonToken */);
}
function createNodeArray(elements, pos, end, hasTrailingComma) {
var array = factory.createNodeArray(elements, hasTrailingComma);
ts.setTextRangePosEnd(array, pos, end !== null && end !== void 0 ? end : scanner.getStartPos());
return array;
}
function finishNode(node, pos, end) {
ts.setTextRangePosEnd(node, pos, end !== null && end !== void 0 ? end : scanner.getStartPos());
if (contextFlags) {
node.flags |= contextFlags;
}
// Keep track on the node if we encountered an error while parsing it. If we did, then
// we cannot reuse the node incrementally. Once we've marked this node, clear out the
// flag so that we don't mark any subsequent nodes.
if (parseErrorBeforeNextFinishedNode) {
parseErrorBeforeNextFinishedNode = false;
node.flags |= 65536 /* ThisNodeHasError */;
}
return node;
}
function createMissingNode(kind, reportAtCurrentPosition, diagnosticMessage, arg0) {
if (reportAtCurrentPosition) {
parseErrorAtPosition(scanner.getStartPos(), 0, diagnosticMessage, arg0);
}
else if (diagnosticMessage) {
parseErrorAtCurrentToken(diagnosticMessage, arg0);
}
var pos = getNodePos();
var result = kind === 79 /* Identifier */ ? factory.createIdentifier("", /*typeArguments*/ undefined, /*originalKeywordKind*/ undefined) :
ts.isTemplateLiteralKind(kind) ? factory.createTemplateLiteralLikeNode(kind, "", "", /*templateFlags*/ undefined) :
kind === 8 /* NumericLiteral */ ? factory.createNumericLiteral("", /*numericLiteralFlags*/ undefined) :
kind === 10 /* StringLiteral */ ? factory.createStringLiteral("", /*isSingleQuote*/ undefined) :
kind === 274 /* MissingDeclaration */ ? factory.createMissingDeclaration() :
factory.createToken(kind);
return finishNode(result, pos);
}
function internIdentifier(text) {
var identifier = identifiers.get(text);
if (identifier === undefined) {
identifiers.set(text, identifier = text);
}
return identifier;
}
// An identifier that starts with two underscores has an extra underscore character prepended to it to avoid issues
// with magic property names like '__proto__'. The 'identifiers' object is used to share a single string instance for
// each identifier in order to reduce memory consumption.
function createIdentifier(isIdentifier, diagnosticMessage, privateIdentifierDiagnosticMessage) {
if (isIdentifier) {
identifierCount++;
var pos = getNodePos();
// Store original token kind if it is not just an Identifier so we can report appropriate error later in type checker
var originalKeywordKind = token();
var text = internIdentifier(scanner.getTokenValue());
nextTokenWithoutCheck();
return finishNode(factory.createIdentifier(text, /*typeArguments*/ undefined, originalKeywordKind), pos);
}
if (token() === 80 /* PrivateIdentifier */) {
parseErrorAtCurrentToken(privateIdentifierDiagnosticMessage || ts.Diagnostics.Private_identifiers_are_not_allowed_outside_class_bodies);
return createIdentifier(/*isIdentifier*/ true);
}
if (token() === 0 /* Unknown */ && scanner.tryScan(function () { return scanner.reScanInvalidIdentifier() === 79 /* Identifier */; })) {
// Scanner has already recorded an 'Invalid character' error, so no need to add another from the parser.
return createIdentifier(/*isIdentifier*/ true);
}
identifierCount++;
// Only for end of file because the error gets reported incorrectly on embedded script tags.
var reportAtCurrentPosition = token() === 1 /* EndOfFileToken */;
var isReservedWord = scanner.isReservedWord();
var msgArg = scanner.getTokenText();
var defaultMessage = isReservedWord ?
ts.Diagnostics.Identifier_expected_0_is_a_reserved_word_that_cannot_be_used_here :
ts.Diagnostics.Identifier_expected;
return createMissingNode(79 /* Identifier */, reportAtCurrentPosition, diagnosticMessage || defaultMessage, msgArg);
}
function parseBindingIdentifier(privateIdentifierDiagnosticMessage) {
return createIdentifier(isBindingIdentifier(), /*diagnosticMessage*/ undefined, privateIdentifierDiagnosticMessage);
}
function parseIdentifier(diagnosticMessage, privateIdentifierDiagnosticMessage) {
return createIdentifier(isIdentifier(), diagnosticMessage, privateIdentifierDiagnosticMessage);
}
function parseIdentifierName(diagnosticMessage) {
return createIdentifier(ts.tokenIsIdentifierOrKeyword(token()), diagnosticMessage);
}
function isLiteralPropertyName() {
return ts.tokenIsIdentifierOrKeyword(token()) ||
token() === 10 /* StringLiteral */ ||
token() === 8 /* NumericLiteral */;
}
function parsePropertyNameWorker(allowComputedPropertyNames) {
if (token() === 10 /* StringLiteral */ || token() === 8 /* NumericLiteral */) {
var node = parseLiteralNode();
node.text = internIdentifier(node.text);
return node;
}
if (allowComputedPropertyNames && token() === 22 /* OpenBracketToken */) {
return parseComputedPropertyName();
}
if (token() === 80 /* PrivateIdentifier */) {
return parsePrivateIdentifier();
}
return parseIdentifierName();
}
function parsePropertyName() {
return parsePropertyNameWorker(/*allowComputedPropertyNames*/ true);
}
function parseComputedPropertyName() {
// PropertyName [Yield]:
// LiteralPropertyName
// ComputedPropertyName[?Yield]
var pos = getNodePos();
parseExpected(22 /* OpenBracketToken */);
// We parse any expression (including a comma expression). But the grammar
// says that only an assignment expression is allowed, so the grammar checker
// will error if it sees a comma expression.
var expression = allowInAnd(parseExpression);
parseExpected(23 /* CloseBracketToken */);
return finishNode(factory.createComputedPropertyName(expression), pos);
}
function internPrivateIdentifier(text) {
var privateIdentifier = privateIdentifiers.get(text);
if (privateIdentifier === undefined) {
privateIdentifiers.set(text, privateIdentifier = text);
}
return privateIdentifier;
}
function parsePrivateIdentifier() {
var pos = getNodePos();
var node = factory.createPrivateIdentifier(internPrivateIdentifier(scanner.getTokenText()));
nextToken();
return finishNode(node, pos);
}
function parseContextualModifier(t) {
return token() === t && tryParse(nextTokenCanFollowModifier);
}
function nextTokenIsOnSameLineAndCanFollowModifier() {
nextToken();
if (scanner.hasPrecedingLineBreak()) {
return false;
}
return canFollowModifier();
}
function nextTokenCanFollowModifier() {
switch (token()) {
case 85 /* ConstKeyword */:
// 'const' is only a modifier if followed by 'enum'.
return nextToken() === 92 /* EnumKeyword */;
case 93 /* ExportKeyword */:
nextToken();
if (token() === 88 /* DefaultKeyword */) {
return lookAhead(nextTokenCanFollowDefaultKeyword);
}
if (token() === 150 /* TypeKeyword */) {
return lookAhead(nextTokenCanFollowExportModifier);
}
return canFollowExportModifier();
case 88 /* DefaultKeyword */:
return nextTokenCanFollowDefaultKeyword();
case 124 /* StaticKeyword */:
return nextTokenIsOnSameLineAndCanFollowModifier();
case 135 /* GetKeyword */:
case 147 /* SetKeyword */:
nextToken();
return canFollowModifier();
default:
return nextTokenIsOnSameLineAndCanFollowModifier();
}
}
function canFollowExportModifier() {
return token() !== 41 /* AsteriskToken */
&& token() !== 127 /* AsKeyword */
&& token() !== 18 /* OpenBraceToken */
&& canFollowModifier();
}
function nextTokenCanFollowExportModifier() {
nextToken();
return canFollowExportModifier();
}
function parseAnyContextualModifier() {
return ts.isModifierKind(token()) && tryParse(nextTokenCanFollowModifier);
}
function canFollowModifier() {
return token() === 22 /* OpenBracketToken */
|| token() === 18 /* OpenBraceToken */
|| token() === 41 /* AsteriskToken */
|| token() === 25 /* DotDotDotToken */
|| isLiteralPropertyName();
}
function nextTokenCanFollowDefaultKeyword() {
nextToken();
return token() === 84 /* ClassKeyword */ || token() === 98 /* FunctionKeyword */ ||
token() === 118 /* InterfaceKeyword */ ||
(token() === 126 /* AbstractKeyword */ && lookAhead(nextTokenIsClassKeywordOnSameLine)) ||
(token() === 130 /* AsyncKeyword */ && lookAhead(nextTokenIsFunctionKeywordOnSameLine));
}
// True if positioned at the start of a list element
function isListElement(parsingContext, inErrorRecovery) {
var node = currentNode(parsingContext);
if (node) {
return true;
}
switch (parsingContext) {
case 0 /* SourceElements */:
case 1 /* BlockStatements */:
case 3 /* SwitchClauseStatements */:
// If we're in error recovery, then we don't want to treat ';' as an empty statement.
// The problem is that ';' can show up in far too many contexts, and if we see one
// and assume it's a statement, then we may bail out inappropriately from whatever
// we're parsing. For example, if we have a semicolon in the middle of a class, then
// we really don't want to assume the class is over and we're on a statement in the
// outer module. We just want to consume and move on.
return !(token() === 26 /* SemicolonToken */ && inErrorRecovery) && isStartOfStatement();
case 2 /* SwitchClauses */:
return token() === 82 /* CaseKeyword */ || token() === 88 /* DefaultKeyword */;
case 4 /* TypeMembers */:
return lookAhead(isTypeMemberStart);
case 5 /* ClassMembers */:
// We allow semicolons as class elements (as specified by ES6) as long as we're
// not in error recovery. If we're in error recovery, we don't want an errant
// semicolon to be treated as a class member (since they're almost always used
// for statements.
return lookAhead(isClassMemberStart) || (token() === 26 /* SemicolonToken */ && !inErrorRecovery);
case 6 /* EnumMembers */:
// Include open bracket computed properties. This technically also lets in indexers,
// which would be a candidate for improved error reporting.
return token() === 22 /* OpenBracketToken */ || isLiteralPropertyName();
case 12 /* ObjectLiteralMembers */:
switch (token()) {
case 22 /* OpenBracketToken */:
case 41 /* AsteriskToken */:
case 25 /* DotDotDotToken */:
case 24 /* DotToken */: // Not an object literal member, but don't want to close the object (see `tests/cases/fourslash/completionsDotInObjectLiteral.ts`)
return true;
default:
return isLiteralPropertyName();
}
case 18 /* RestProperties */:
return isLiteralPropertyName();
case 9 /* ObjectBindingElements */:
return token() === 22 /* OpenBracketToken */ || token() === 25 /* DotDotDotToken */ || isLiteralPropertyName();
case 7 /* HeritageClauseElement */:
// If we see `{ ... }` then only consume it as an expression if it is followed by `,` or `{`
// That way we won't consume the body of a class in its heritage clause.
if (token() === 18 /* OpenBraceToken */) {
return lookAhead(isValidHeritageClauseObjectLiteral);
}
if (!inErrorRecovery) {
return isStartOfLeftHandSideExpression() && !isHeritageClauseExtendsOrImplementsKeyword();
}
else {
// If we're in error recovery we tighten up what we're willing to match.
// That way we don't treat something like "this" as a valid heritage clause
// element during recovery.
return isIdentifier() && !isHeritageClauseExtendsOrImplementsKeyword();
}
case 8 /* VariableDeclarations */:
return isBindingIdentifierOrPrivateIdentifierOrPattern();
case 10 /* ArrayBindingElements */:
return token() === 27 /* CommaToken */ || token() === 25 /* DotDotDotToken */ || isBindingIdentifierOrPrivateIdentifierOrPattern();
case 19 /* TypeParameters */:
return isIdentifier();
case 15 /* ArrayLiteralMembers */:
switch (token()) {
case 27 /* CommaToken */:
case 24 /* DotToken */: // Not an array literal member, but don't want to close the array (see `tests/cases/fourslash/completionsDotInArrayLiteralInObjectLiteral.ts`)
return true;
}
// falls through
case 11 /* ArgumentExpressions */:
return token() === 25 /* DotDotDotToken */ || isStartOfExpression();
case 16 /* Parameters */:
return isStartOfParameter(/*isJSDocParameter*/ false);
case 17 /* JSDocParameters */:
return isStartOfParameter(/*isJSDocParameter*/ true);
case 20 /* TypeArguments */:
case 21 /* TupleElementTypes */:
return token() === 27 /* CommaToken */ || isStartOfType();
case 22 /* HeritageClauses */:
return isHeritageClause();
case 23 /* ImportOrExportSpecifiers */:
return ts.tokenIsIdentifierOrKeyword(token());
case 13 /* JsxAttributes */:
return ts.tokenIsIdentifierOrKeyword(token()) || token() === 18 /* OpenBraceToken */;
case 14 /* JsxChildren */:
return true;
}
return ts.Debug.fail("Non-exhaustive case in 'isListElement'.");
}
function isValidHeritageClauseObjectLiteral() {
ts.Debug.assert(token() === 18 /* OpenBraceToken */);
if (nextToken() === 19 /* CloseBraceToken */) {
// if we see "extends {}" then only treat the {} as what we're extending (and not
// the class body) if we have:
//
// extends {} {
// extends {},
// extends {} extends
// extends {} implements
var next = nextToken();
return next === 27 /* CommaToken */ || next === 18 /* OpenBraceToken */ || next === 94 /* ExtendsKeyword */ || next === 117 /* ImplementsKeyword */;
}
return true;
}
function nextTokenIsIdentifier() {
nextToken();
return isIdentifier();
}
function nextTokenIsIdentifierOrKeyword() {
nextToken();
return ts.tokenIsIdentifierOrKeyword(token());
}
function nextTokenIsIdentifierOrKeywordOrGreaterThan() {
nextToken();
return ts.tokenIsIdentifierOrKeywordOrGreaterThan(token());
}
function isHeritageClauseExtendsOrImplementsKeyword() {
if (token() === 117 /* ImplementsKeyword */ ||
token() === 94 /* ExtendsKeyword */) {
return lookAhead(nextTokenIsStartOfExpression);
}
return false;
}
function nextTokenIsStartOfExpression() {
nextToken();
return isStartOfExpression();
}
function nextTokenIsStartOfType() {
nextToken();
return isStartOfType();
}
// True if positioned at a list terminator
function isListTerminator(kind) {
if (token() === 1 /* EndOfFileToken */) {
// Being at the end of the file ends all lists.
return true;
}
switch (kind) {
case 1 /* BlockStatements */:
case 2 /* SwitchClauses */:
case 4 /* TypeMembers */:
case 5 /* ClassMembers */:
case 6 /* EnumMembers */:
case 12 /* ObjectLiteralMembers */:
case 9 /* ObjectBindingElements */:
case 23 /* ImportOrExportSpecifiers */:
return token() === 19 /* CloseBraceToken */;
case 3 /* SwitchClauseStatements */:
return token() === 19 /* CloseBraceToken */ || token() === 82 /* CaseKeyword */ || token() === 88 /* DefaultKeyword */;
case 7 /* HeritageClauseElement */:
return token() === 18 /* OpenBraceToken */ || token() === 94 /* ExtendsKeyword */ || token() === 117 /* ImplementsKeyword */;
case 8 /* VariableDeclarations */:
return isVariableDeclaratorListTerminator();
case 19 /* TypeParameters */:
// Tokens other than '>' are here for better error recovery
return token() === 31 /* GreaterThanToken */ || token() === 20 /* OpenParenToken */ || token() === 18 /* OpenBraceToken */ || token() === 94 /* ExtendsKeyword */ || token() === 117 /* ImplementsKeyword */;
case 11 /* ArgumentExpressions */:
// Tokens other than ')' are here for better error recovery
return token() === 21 /* CloseParenToken */ || token() === 26 /* SemicolonToken */;
case 15 /* ArrayLiteralMembers */:
case 21 /* TupleElementTypes */:
case 10 /* ArrayBindingElements */:
return token() === 23 /* CloseBracketToken */;
case 17 /* JSDocParameters */:
case 16 /* Parameters */:
case 18 /* RestProperties */:
// Tokens other than ')' and ']' (the latter for index signatures) are here for better error recovery
return token() === 21 /* CloseParenToken */ || token() === 23 /* CloseBracketToken */ /*|| token === SyntaxKind.OpenBraceToken*/;
case 20 /* TypeArguments */:
// All other tokens should cause the type-argument to terminate except comma token
return token() !== 27 /* CommaToken */;
case 22 /* HeritageClauses */:
return token() === 18 /* OpenBraceToken */ || token() === 19 /* CloseBraceToken */;
case 13 /* JsxAttributes */:
return token() === 31 /* GreaterThanToken */ || token() === 43 /* SlashToken */;
case 14 /* JsxChildren */:
return token() === 29 /* LessThanToken */ && lookAhead(nextTokenIsSlash);
default:
return false;
}
}
function isVariableDeclaratorListTerminator() {
// If we can consume a semicolon (either explicitly, or with ASI), then consider us done
// with parsing the list of variable declarators.
if (canParseSemicolon()) {
return true;
}
// in the case where we're parsing the variable declarator of a 'for-in' statement, we
// are done if we see an 'in' keyword in front of us. Same with for-of
if (isInOrOfKeyword(token())) {
return true;
}
// ERROR RECOVERY TWEAK:
// For better error recovery, if we see an '=>' then we just stop immediately. We've got an
// arrow function here and it's going to be very unlikely that we'll resynchronize and get
// another variable declaration.
if (token() === 38 /* EqualsGreaterThanToken */) {
return true;
}
// Keep trying to parse out variable declarators.
return false;
}
// True if positioned at element or terminator of the current list or any enclosing list
function isInSomeParsingContext() {
for (var kind = 0; kind < 24 /* Count */; kind++) {
if (parsingContext & (1 << kind)) {
if (isListElement(kind, /*inErrorRecovery*/ true) || isListTerminator(kind)) {
return true;
}
}
}
return false;
}
// Parses a list of elements
function parseList(kind, parseElement) {
var saveParsingContext = parsingContext;
parsingContext |= 1 << kind;
var list = [];
var listPos = getNodePos();
while (!isListTerminator(kind)) {
if (isListElement(kind, /*inErrorRecovery*/ false)) {
list.push(parseListElement(kind, parseElement));
continue;
}
if (abortParsingListOrMoveToNextToken(kind)) {
break;
}
}
parsingContext = saveParsingContext;
return createNodeArray(list, listPos);
}
function parseListElement(parsingContext, parseElement) {
var node = currentNode(parsingContext);
if (node) {
return consumeNode(node);
}
return parseElement();
}
function currentNode(parsingContext) {
// If we don't have a cursor or the parsing context isn't reusable, there's nothing to reuse.
//
// If there is an outstanding parse error that we've encountered, but not attached to
// some node, then we cannot get a node from the old source tree. This is because we
// want to mark the next node we encounter as being unusable.
//
// Note: This may be too conservative. Perhaps we could reuse the node and set the bit
// on it (or its leftmost child) as having the error. For now though, being conservative
// is nice and likely won't ever affect perf.
if (!syntaxCursor || !isReusableParsingContext(parsingContext) || parseErrorBeforeNextFinishedNode) {
return undefined;
}
var node = syntaxCursor.currentNode(scanner.getStartPos());
// Can't reuse a missing node.
// Can't reuse a node that intersected the change range.
// Can't reuse a node that contains a parse error. This is necessary so that we
// produce the same set of errors again.
if (ts.nodeIsMissing(node) || node.intersectsChange || ts.containsParseError(node)) {
return undefined;
}
// We can only reuse a node if it was parsed under the same strict mode that we're
// currently in. i.e. if we originally parsed a node in non-strict mode, but then
// the user added 'using strict' at the top of the file, then we can't use that node
// again as the presence of strict mode may cause us to parse the tokens in the file
// differently.
//
// Note: we *can* reuse tokens when the strict mode changes. That's because tokens
// are unaffected by strict mode. It's just the parser will decide what to do with it
// differently depending on what mode it is in.
//
// This also applies to all our other context flags as well.
var nodeContextFlags = node.flags & 25358336 /* ContextFlags */;
if (nodeContextFlags !== contextFlags) {
return undefined;
}
// Ok, we have a node that looks like it could be reused. Now verify that it is valid
// in the current list parsing context that we're currently at.
if (!canReuseNode(node, parsingContext)) {
return undefined;
}
if (node.jsDocCache) {
// jsDocCache may include tags from parent nodes, which might have been modified.
node.jsDocCache = undefined;
}
return node;
}
function consumeNode(node) {
// Move the scanner so it is after the node we just consumed.
scanner.setTextPos(node.end);
nextToken();
return node;
}
function isReusableParsingContext(parsingContext) {
switch (parsingContext) {
case 5 /* ClassMembers */:
case 2 /* SwitchClauses */:
case 0 /* SourceElements */:
case 1 /* BlockStatements */:
case 3 /* SwitchClauseStatements */:
case 6 /* EnumMembers */:
case 4 /* TypeMembers */:
case 8 /* VariableDeclarations */:
case 17 /* JSDocParameters */:
case 16 /* Parameters */:
return true;
}
return false;
}
function canReuseNode(node, parsingContext) {
switch (parsingContext) {
case 5 /* ClassMembers */:
return isReusableClassMember(node);
case 2 /* SwitchClauses */:
return isReusableSwitchClause(node);
case 0 /* SourceElements */:
case 1 /* BlockStatements */:
case 3 /* SwitchClauseStatements */:
return isReusableStatement(node);
case 6 /* EnumMembers */:
return isReusableEnumMember(node);
case 4 /* TypeMembers */:
return isReusableTypeMember(node);
case 8 /* VariableDeclarations */:
return isReusableVariableDeclaration(node);
case 17 /* JSDocParameters */:
case 16 /* Parameters */:
return isReusableParameter(node);
// Any other lists we do not care about reusing nodes in. But feel free to add if
// you can do so safely. Danger areas involve nodes that may involve speculative
// parsing. If speculative parsing is involved with the node, then the range the
// parser reached while looking ahead might be in the edited range (see the example
// in canReuseVariableDeclaratorNode for a good case of this).
// case ParsingContext.HeritageClauses:
// This would probably be safe to reuse. There is no speculative parsing with
// heritage clauses.
// case ParsingContext.TypeParameters:
// This would probably be safe to reuse. There is no speculative parsing with
// type parameters. Note that that's because type *parameters* only occur in
// unambiguous *type* contexts. While type *arguments* occur in very ambiguous
// *expression* contexts.
// case ParsingContext.TupleElementTypes:
// This would probably be safe to reuse. There is no speculative parsing with
// tuple types.
// Technically, type argument list types are probably safe to reuse. While
// speculative parsing is involved with them (since type argument lists are only
// produced from speculative parsing a < as a type argument list), we only have
// the types because speculative parsing succeeded. Thus, the lookahead never
// went past the end of the list and rewound.
// case ParsingContext.TypeArguments:
// Note: these are almost certainly not safe to ever reuse. Expressions commonly
// need a large amount of lookahead, and we should not reuse them as they may
// have actually intersected the edit.
// case ParsingContext.ArgumentExpressions:
// This is not safe to reuse for the same reason as the 'AssignmentExpression'
// cases. i.e. a property assignment may end with an expression, and thus might
// have lookahead far beyond it's old node.
// case ParsingContext.ObjectLiteralMembers:
// This is probably not safe to reuse. There can be speculative parsing with
// type names in a heritage clause. There can be generic names in the type
// name list, and there can be left hand side expressions (which can have type
// arguments.)
// case ParsingContext.HeritageClauseElement:
// Perhaps safe to reuse, but it's unlikely we'd see more than a dozen attributes
// on any given element. Same for children.
// case ParsingContext.JsxAttributes:
// case ParsingContext.JsxChildren:
}
return false;
}
function isReusableClassMember(node) {
if (node) {
switch (node.kind) {
case 169 /* Constructor */:
case 174 /* IndexSignature */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 165 /* PropertyDeclaration */:
case 232 /* SemicolonClassElement */:
return true;
case 167 /* MethodDeclaration */:
// Method declarations are not necessarily reusable. An object-literal
// may have a method calls "constructor(...)" and we must reparse that
// into an actual .ConstructorDeclaration.
var methodDeclaration = node;
var nameIsConstructor = methodDeclaration.name.kind === 79 /* Identifier */ &&
methodDeclaration.name.originalKeywordKind === 133 /* ConstructorKeyword */;
return !nameIsConstructor;
}
}
return false;
}
function isReusableSwitchClause(node) {
if (node) {
switch (node.kind) {
case 287 /* CaseClause */:
case 288 /* DefaultClause */:
return true;
}
}
return false;
}
function isReusableStatement(node) {
if (node) {
switch (node.kind) {
case 254 /* FunctionDeclaration */:
case 235 /* VariableStatement */:
case 233 /* Block */:
case 237 /* IfStatement */:
case 236 /* ExpressionStatement */:
case 249 /* ThrowStatement */:
case 245 /* ReturnStatement */:
case 247 /* SwitchStatement */:
case 244 /* BreakStatement */:
case 243 /* ContinueStatement */:
case 241 /* ForInStatement */:
case 242 /* ForOfStatement */:
case 240 /* ForStatement */:
case 239 /* WhileStatement */:
case 246 /* WithStatement */:
case 234 /* EmptyStatement */:
case 250 /* TryStatement */:
case 248 /* LabeledStatement */:
case 238 /* DoStatement */:
case 251 /* DebuggerStatement */:
case 264 /* ImportDeclaration */:
case 263 /* ImportEqualsDeclaration */:
case 270 /* ExportDeclaration */:
case 269 /* ExportAssignment */:
case 259 /* ModuleDeclaration */:
case 255 /* ClassDeclaration */:
case 256 /* InterfaceDeclaration */:
case 258 /* EnumDeclaration */:
case 257 /* TypeAliasDeclaration */:
return true;
}
}
return false;
}
function isReusableEnumMember(node) {
return node.kind === 294 /* EnumMember */;
}
function isReusableTypeMember(node) {
if (node) {
switch (node.kind) {
case 173 /* ConstructSignature */:
case 166 /* MethodSignature */:
case 174 /* IndexSignature */:
case 164 /* PropertySignature */:
case 172 /* CallSignature */:
return true;
}
}
return false;
}
function isReusableVariableDeclaration(node) {
if (node.kind !== 252 /* VariableDeclaration */) {
return false;
}
// Very subtle incremental parsing bug. Consider the following code:
//
// let v = new List < A, B
//
// This is actually legal code. It's a list of variable declarators "v = new List<A"
// on one side and "B" on the other. If you then change that to:
//
// let v = new List < A, B >()
//
// then we have a problem. "v = new List<A" doesn't intersect the change range, so we
// start reparsing at "B" and we completely fail to handle this properly.
//
// In order to prevent this, we do not allow a variable declarator to be reused if it
// has an initializer.
var variableDeclarator = node;
return variableDeclarator.initializer === undefined;
}
function isReusableParameter(node) {
if (node.kind !== 162 /* Parameter */) {
return false;
}
// See the comment in isReusableVariableDeclaration for why we do this.
var parameter = node;
return parameter.initializer === undefined;
}
// Returns true if we should abort parsing.
function abortParsingListOrMoveToNextToken(kind) {
parsingContextErrors(kind);
if (isInSomeParsingContext()) {
return true;
}
nextToken();
return false;
}
function parsingContextErrors(context) {
switch (context) {
case 0 /* SourceElements */:
return token() === 88 /* DefaultKeyword */
? parseErrorAtCurrentToken(ts.Diagnostics._0_expected, ts.tokenToString(93 /* ExportKeyword */))
: parseErrorAtCurrentToken(ts.Diagnostics.Declaration_or_statement_expected);
case 1 /* BlockStatements */: return parseErrorAtCurrentToken(ts.Diagnostics.Declaration_or_statement_expected);
case 2 /* SwitchClauses */: return parseErrorAtCurrentToken(ts.Diagnostics.case_or_default_expected);
case 3 /* SwitchClauseStatements */: return parseErrorAtCurrentToken(ts.Diagnostics.Statement_expected);
case 18 /* RestProperties */: // fallthrough
case 4 /* TypeMembers */: return parseErrorAtCurrentToken(ts.Diagnostics.Property_or_signature_expected);
case 5 /* ClassMembers */: return parseErrorAtCurrentToken(ts.Diagnostics.Unexpected_token_A_constructor_method_accessor_or_property_was_expected);
case 6 /* EnumMembers */: return parseErrorAtCurrentToken(ts.Diagnostics.Enum_member_expected);
case 7 /* HeritageClauseElement */: return parseErrorAtCurrentToken(ts.Diagnostics.Expression_expected);
case 8 /* VariableDeclarations */:
return ts.isKeyword(token())
? parseErrorAtCurrentToken(ts.Diagnostics._0_is_not_allowed_as_a_variable_declaration_name, ts.tokenToString(token()))
: parseErrorAtCurrentToken(ts.Diagnostics.Variable_declaration_expected);
case 9 /* ObjectBindingElements */: return parseErrorAtCurrentToken(ts.Diagnostics.Property_destructuring_pattern_expected);
case 10 /* ArrayBindingElements */: return parseErrorAtCurrentToken(ts.Diagnostics.Array_element_destructuring_pattern_expected);
case 11 /* ArgumentExpressions */: return parseErrorAtCurrentToken(ts.Diagnostics.Argument_expression_expected);
case 12 /* ObjectLiteralMembers */: return parseErrorAtCurrentToken(ts.Diagnostics.Property_assignment_expected);
case 15 /* ArrayLiteralMembers */: return parseErrorAtCurrentToken(ts.Diagnostics.Expression_or_comma_expected);
case 17 /* JSDocParameters */: return parseErrorAtCurrentToken(ts.Diagnostics.Parameter_declaration_expected);
case 16 /* Parameters */: return parseErrorAtCurrentToken(ts.Diagnostics.Parameter_declaration_expected);
case 19 /* TypeParameters */: return parseErrorAtCurrentToken(ts.Diagnostics.Type_parameter_declaration_expected);
case 20 /* TypeArguments */: return parseErrorAtCurrentToken(ts.Diagnostics.Type_argument_expected);
case 21 /* TupleElementTypes */: return parseErrorAtCurrentToken(ts.Diagnostics.Type_expected);
case 22 /* HeritageClauses */: return parseErrorAtCurrentToken(ts.Diagnostics.Unexpected_token_expected);
case 23 /* ImportOrExportSpecifiers */: return parseErrorAtCurrentToken(ts.Diagnostics.Identifier_expected);
case 13 /* JsxAttributes */: return parseErrorAtCurrentToken(ts.Diagnostics.Identifier_expected);
case 14 /* JsxChildren */: return parseErrorAtCurrentToken(ts.Diagnostics.Identifier_expected);
default: return [undefined]; // TODO: GH#18217 `default: Debug.assertNever(context);`
}
}
// Parses a comma-delimited list of elements
function parseDelimitedList(kind, parseElement, considerSemicolonAsDelimiter) {
var saveParsingContext = parsingContext;
parsingContext |= 1 << kind;
var list = [];
var listPos = getNodePos();
var commaStart = -1; // Meaning the previous token was not a comma
while (true) {
if (isListElement(kind, /*inErrorRecovery*/ false)) {
var startPos = scanner.getStartPos();
list.push(parseListElement(kind, parseElement));
commaStart = scanner.getTokenPos();
if (parseOptional(27 /* CommaToken */)) {
// No need to check for a zero length node since we know we parsed a comma
continue;
}
commaStart = -1; // Back to the state where the last token was not a comma
if (isListTerminator(kind)) {
break;
}
// We didn't get a comma, and the list wasn't terminated, explicitly parse
// out a comma so we give a good error message.
parseExpected(27 /* CommaToken */, getExpectedCommaDiagnostic(kind));
// If the token was a semicolon, and the caller allows that, then skip it and
// continue. This ensures we get back on track and don't result in tons of
// parse errors. For example, this can happen when people do things like use
// a semicolon to delimit object literal members. Note: we'll have already
// reported an error when we called parseExpected above.
if (considerSemicolonAsDelimiter && token() === 26 /* SemicolonToken */ && !scanner.hasPrecedingLineBreak()) {
nextToken();
}
if (startPos === scanner.getStartPos()) {
// What we're parsing isn't actually remotely recognizable as a element and we've consumed no tokens whatsoever
// Consume a token to advance the parser in some way and avoid an infinite loop
// This can happen when we're speculatively parsing parenthesized expressions which we think may be arrow functions,
// or when a modifier keyword which is disallowed as a parameter name (ie, `static` in strict mode) is supplied
nextToken();
}
continue;
}
if (isListTerminator(kind)) {
break;
}
if (abortParsingListOrMoveToNextToken(kind)) {
break;
}
}
parsingContext = saveParsingContext;
// Recording the trailing comma is deliberately done after the previous
// loop, and not just if we see a list terminator. This is because the list
// may have ended incorrectly, but it is still important to know if there
// was a trailing comma.
// Check if the last token was a comma.
// Always preserve a trailing comma by marking it on the NodeArray
return createNodeArray(list, listPos, /*end*/ undefined, commaStart >= 0);
}
function getExpectedCommaDiagnostic(kind) {
return kind === 6 /* EnumMembers */ ? ts.Diagnostics.An_enum_member_name_must_be_followed_by_a_or : undefined;
}
function createMissingList() {
var list = createNodeArray([], getNodePos());
list.isMissingList = true;
return list;
}
function isMissingList(arr) {
return !!arr.isMissingList;
}
function parseBracketedList(kind, parseElement, open, close) {
if (parseExpected(open)) {
var result = parseDelimitedList(kind, parseElement);
parseExpected(close);
return result;
}
return createMissingList();
}
function parseEntityName(allowReservedWords, diagnosticMessage) {
var pos = getNodePos();
var entity = allowReservedWords ? parseIdentifierName(diagnosticMessage) : parseIdentifier(diagnosticMessage);
var dotPos = getNodePos();
while (parseOptional(24 /* DotToken */)) {
if (token() === 29 /* LessThanToken */) {
// the entity is part of a JSDoc-style generic, so record the trailing dot for later error reporting
entity.jsdocDotPos = dotPos;
break;
}
dotPos = getNodePos();
entity = finishNode(factory.createQualifiedName(entity, parseRightSideOfDot(allowReservedWords, /* allowPrivateIdentifiers */ false)), pos);
}
return entity;
}
function createQualifiedName(entity, name) {
return finishNode(factory.createQualifiedName(entity, name), entity.pos);
}
function parseRightSideOfDot(allowIdentifierNames, allowPrivateIdentifiers) {
// Technically a keyword is valid here as all identifiers and keywords are identifier names.
// However, often we'll encounter this in error situations when the identifier or keyword
// is actually starting another valid construct.
//
// So, we check for the following specific case:
//
// name.
// identifierOrKeyword identifierNameOrKeyword
//
// Note: the newlines are important here. For example, if that above code
// were rewritten into:
//
// name.identifierOrKeyword
// identifierNameOrKeyword
//
// Then we would consider it valid. That's because ASI would take effect and
// the code would be implicitly: "name.identifierOrKeyword; identifierNameOrKeyword".
// In the first case though, ASI will not take effect because there is not a
// line terminator after the identifier or keyword.
if (scanner.hasPrecedingLineBreak() && ts.tokenIsIdentifierOrKeyword(token())) {
var matchesPattern = lookAhead(nextTokenIsIdentifierOrKeywordOnSameLine);
if (matchesPattern) {
// Report that we need an identifier. However, report it right after the dot,
// and not on the next token. This is because the next token might actually
// be an identifier and the error would be quite confusing.
return createMissingNode(79 /* Identifier */, /*reportAtCurrentPosition*/ true, ts.Diagnostics.Identifier_expected);
}
}
if (token() === 80 /* PrivateIdentifier */) {
var node = parsePrivateIdentifier();
return allowPrivateIdentifiers ? node : createMissingNode(79 /* Identifier */, /*reportAtCurrentPosition*/ true, ts.Diagnostics.Identifier_expected);
}
return allowIdentifierNames ? parseIdentifierName() : parseIdentifier();
}
function parseTemplateSpans(isTaggedTemplate) {
var pos = getNodePos();
var list = [];
var node;
do {
node = parseTemplateSpan(isTaggedTemplate);
list.push(node);
} while (node.literal.kind === 16 /* TemplateMiddle */);
return createNodeArray(list, pos);
}
function parseTemplateExpression(isTaggedTemplate) {
var pos = getNodePos();
return finishNode(factory.createTemplateExpression(parseTemplateHead(isTaggedTemplate), parseTemplateSpans(isTaggedTemplate)), pos);
}
function parseTemplateType() {
var pos = getNodePos();
return finishNode(factory.createTemplateLiteralType(parseTemplateHead(/*isTaggedTemplate*/ false), parseTemplateTypeSpans()), pos);
}
function parseTemplateTypeSpans() {
var pos = getNodePos();
var list = [];
var node;
do {
node = parseTemplateTypeSpan();
list.push(node);
} while (node.literal.kind === 16 /* TemplateMiddle */);
return createNodeArray(list, pos);
}
function parseTemplateTypeSpan() {
var pos = getNodePos();
return finishNode(factory.createTemplateLiteralTypeSpan(parseType(), parseLiteralOfTemplateSpan(/*isTaggedTemplate*/ false)), pos);
}
function parseLiteralOfTemplateSpan(isTaggedTemplate) {
if (token() === 19 /* CloseBraceToken */) {
reScanTemplateToken(isTaggedTemplate);
return parseTemplateMiddleOrTemplateTail();
}
else {
// TODO(rbuckton): Do we need to call `parseExpectedToken` or can we just call `createMissingNode` directly?
return parseExpectedToken(17 /* TemplateTail */, ts.Diagnostics._0_expected, ts.tokenToString(19 /* CloseBraceToken */));
}
}
function parseTemplateSpan(isTaggedTemplate) {
var pos = getNodePos();
return finishNode(factory.createTemplateSpan(allowInAnd(parseExpression), parseLiteralOfTemplateSpan(isTaggedTemplate)), pos);
}
function parseLiteralNode() {
return parseLiteralLikeNode(token());
}
function parseTemplateHead(isTaggedTemplate) {
if (isTaggedTemplate) {
reScanTemplateHeadOrNoSubstitutionTemplate();
}
var fragment = parseLiteralLikeNode(token());
ts.Debug.assert(fragment.kind === 15 /* TemplateHead */, "Template head has wrong token kind");
return fragment;
}
function parseTemplateMiddleOrTemplateTail() {
var fragment = parseLiteralLikeNode(token());
ts.Debug.assert(fragment.kind === 16 /* TemplateMiddle */ || fragment.kind === 17 /* TemplateTail */, "Template fragment has wrong token kind");
return fragment;
}
function getTemplateLiteralRawText(kind) {
var isLast = kind === 14 /* NoSubstitutionTemplateLiteral */ || kind === 17 /* TemplateTail */;
var tokenText = scanner.getTokenText();
return tokenText.substring(1, tokenText.length - (scanner.isUnterminated() ? 0 : isLast ? 1 : 2));
}
function parseLiteralLikeNode(kind) {
var pos = getNodePos();
var node = ts.isTemplateLiteralKind(kind) ? factory.createTemplateLiteralLikeNode(kind, scanner.getTokenValue(), getTemplateLiteralRawText(kind), scanner.getTokenFlags() & 2048 /* TemplateLiteralLikeFlags */) :
// Octal literals are not allowed in strict mode or ES5
// Note that theoretically the following condition would hold true literals like 009,
// which is not octal. But because of how the scanner separates the tokens, we would
// never get a token like this. Instead, we would get 00 and 9 as two separate tokens.
// We also do not need to check for negatives because any prefix operator would be part of a
// parent unary expression.
kind === 8 /* NumericLiteral */ ? factory.createNumericLiteral(scanner.getTokenValue(), scanner.getNumericLiteralFlags()) :
kind === 10 /* StringLiteral */ ? factory.createStringLiteral(scanner.getTokenValue(), /*isSingleQuote*/ undefined, scanner.hasExtendedUnicodeEscape()) :
ts.isLiteralKind(kind) ? factory.createLiteralLikeNode(kind, scanner.getTokenValue()) :
ts.Debug.fail();
if (scanner.hasExtendedUnicodeEscape()) {
node.hasExtendedUnicodeEscape = true;
}
if (scanner.isUnterminated()) {
node.isUnterminated = true;
}
nextToken();
return finishNode(node, pos);
}
// TYPES
function parseEntityNameOfTypeReference() {
return parseEntityName(/*allowReservedWords*/ true, ts.Diagnostics.Type_expected);
}
function parseTypeArgumentsOfTypeReference() {
if (!scanner.hasPrecedingLineBreak() && reScanLessThanToken() === 29 /* LessThanToken */) {
return parseBracketedList(20 /* TypeArguments */, parseType, 29 /* LessThanToken */, 31 /* GreaterThanToken */);
}
}
function parseTypeReference() {
var pos = getNodePos();
return finishNode(factory.createTypeReferenceNode(parseEntityNameOfTypeReference(), parseTypeArgumentsOfTypeReference()), pos);
}
// If true, we should abort parsing an error function.
function typeHasArrowFunctionBlockingParseError(node) {
switch (node.kind) {
case 176 /* TypeReference */:
return ts.nodeIsMissing(node.typeName);
case 177 /* FunctionType */:
case 178 /* ConstructorType */: {
var _a = node, parameters = _a.parameters, type = _a.type;
return isMissingList(parameters) || typeHasArrowFunctionBlockingParseError(type);
}
case 189 /* ParenthesizedType */:
return typeHasArrowFunctionBlockingParseError(node.type);
default:
return false;
}
}
function parseThisTypePredicate(lhs) {
nextToken();
return finishNode(factory.createTypePredicateNode(/*assertsModifier*/ undefined, lhs, parseType()), lhs.pos);
}
function parseThisTypeNode() {
var pos = getNodePos();
nextToken();
return finishNode(factory.createThisTypeNode(), pos);
}
function parseJSDocAllType() {
var pos = getNodePos();
nextToken();
return finishNode(factory.createJSDocAllType(), pos);
}
function parseJSDocNonNullableType() {
var pos = getNodePos();
nextToken();
return finishNode(factory.createJSDocNonNullableType(parseNonArrayType()), pos);
}
function parseJSDocUnknownOrNullableType() {
var pos = getNodePos();
// skip the ?
nextToken();
// Need to lookahead to decide if this is a nullable or unknown type.
// Here are cases where we'll pick the unknown type:
//
// Foo(?,
// { a: ? }
// Foo(?)
// Foo<?>
// Foo(?=
// (?|
if (token() === 27 /* CommaToken */ ||
token() === 19 /* CloseBraceToken */ ||
token() === 21 /* CloseParenToken */ ||
token() === 31 /* GreaterThanToken */ ||
token() === 63 /* EqualsToken */ ||
token() === 51 /* BarToken */) {
return finishNode(factory.createJSDocUnknownType(), pos);
}
else {
return finishNode(factory.createJSDocNullableType(parseType()), pos);
}
}
function parseJSDocFunctionType() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
if (lookAhead(nextTokenIsOpenParen)) {
nextToken();
var parameters = parseParameters(4 /* Type */ | 32 /* JSDoc */);
var type = parseReturnType(58 /* ColonToken */, /*isType*/ false);
return withJSDoc(finishNode(factory.createJSDocFunctionType(parameters, type), pos), hasJSDoc);
}
return finishNode(factory.createTypeReferenceNode(parseIdentifierName(), /*typeArguments*/ undefined), pos);
}
function parseJSDocParameter() {
var pos = getNodePos();
var name;
if (token() === 108 /* ThisKeyword */ || token() === 103 /* NewKeyword */) {
name = parseIdentifierName();
parseExpected(58 /* ColonToken */);
}
return finishNode(factory.createParameterDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*dotDotDotToken*/ undefined,
// TODO(rbuckton): JSDoc parameters don't have names (except `this`/`new`), should we manufacture an empty identifier?
name,
/*questionToken*/ undefined, parseJSDocType(),
/*initializer*/ undefined), pos);
}
function parseJSDocType() {
scanner.setInJSDocType(true);
var pos = getNodePos();
if (parseOptional(140 /* ModuleKeyword */)) {
// TODO(rbuckton): We never set the type for a JSDocNamepathType. What should we put here?
var moduleTag = factory.createJSDocNamepathType(/*type*/ undefined);
terminate: while (true) {
switch (token()) {
case 19 /* CloseBraceToken */:
case 1 /* EndOfFileToken */:
case 27 /* CommaToken */:
case 5 /* WhitespaceTrivia */:
break terminate;
default:
nextTokenJSDoc();
}
}
scanner.setInJSDocType(false);
return finishNode(moduleTag, pos);
}
var hasDotDotDot = parseOptional(25 /* DotDotDotToken */);
var type = parseTypeOrTypePredicate();
scanner.setInJSDocType(false);
if (hasDotDotDot) {
type = finishNode(factory.createJSDocVariadicType(type), pos);
}
if (token() === 63 /* EqualsToken */) {
nextToken();
return finishNode(factory.createJSDocOptionalType(type), pos);
}
return type;
}
function parseTypeQuery() {
var pos = getNodePos();
parseExpected(112 /* TypeOfKeyword */);
return finishNode(factory.createTypeQueryNode(parseEntityName(/*allowReservedWords*/ true)), pos);
}
function parseTypeParameter() {
var pos = getNodePos();
var name = parseIdentifier();
var constraint;
var expression;
if (parseOptional(94 /* ExtendsKeyword */)) {
// It's not uncommon for people to write improper constraints to a generic. If the
// user writes a constraint that is an expression and not an actual type, then parse
// it out as an expression (so we can recover well), but report that a type is needed
// instead.
if (isStartOfType() || !isStartOfExpression()) {
constraint = parseType();
}
else {
// It was not a type, and it looked like an expression. Parse out an expression
// here so we recover well. Note: it is important that we call parseUnaryExpression
// and not parseExpression here. If the user has:
//
// <T extends "">
//
// We do *not* want to consume the `>` as we're consuming the expression for "".
expression = parseUnaryExpressionOrHigher();
}
}
var defaultType = parseOptional(63 /* EqualsToken */) ? parseType() : undefined;
var node = factory.createTypeParameterDeclaration(name, constraint, defaultType);
node.expression = expression;
return finishNode(node, pos);
}
function parseTypeParameters() {
if (token() === 29 /* LessThanToken */) {
return parseBracketedList(19 /* TypeParameters */, parseTypeParameter, 29 /* LessThanToken */, 31 /* GreaterThanToken */);
}
}
function isStartOfParameter(isJSDocParameter) {
return token() === 25 /* DotDotDotToken */ ||
isBindingIdentifierOrPrivateIdentifierOrPattern() ||
ts.isModifierKind(token()) ||
token() === 59 /* AtToken */ ||
isStartOfType(/*inStartOfParameter*/ !isJSDocParameter);
}
function parseNameOfParameter(modifiers) {
// FormalParameter [Yield,Await]:
// BindingElement[?Yield,?Await]
var name = parseIdentifierOrPattern(ts.Diagnostics.Private_identifiers_cannot_be_used_as_parameters);
if (ts.getFullWidth(name) === 0 && !ts.some(modifiers) && ts.isModifierKind(token())) {
// in cases like
// 'use strict'
// function foo(static)
// isParameter('static') === true, because of isModifier('static')
// however 'static' is not a legal identifier in a strict mode.
// so result of this function will be ParameterDeclaration (flags = 0, name = missing, type = undefined, initializer = undefined)
// and current token will not change => parsing of the enclosing parameter list will last till the end of time (or OOM)
// to avoid this we'll advance cursor to the next token.
nextToken();
}
return name;
}
function parseParameterInOuterAwaitContext() {
return parseParameterWorker(/*inOuterAwaitContext*/ true);
}
function parseParameter() {
return parseParameterWorker(/*inOuterAwaitContext*/ false);
}
function parseParameterWorker(inOuterAwaitContext) {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
// FormalParameter [Yield,Await]:
// BindingElement[?Yield,?Await]
// Decorators are parsed in the outer [Await] context, the rest of the parameter is parsed in the function's [Await] context.
var decorators = inOuterAwaitContext ? doInAwaitContext(parseDecorators) : parseDecorators();
if (token() === 108 /* ThisKeyword */) {
var node_1 = factory.createParameterDeclaration(decorators,
/*modifiers*/ undefined,
/*dotDotDotToken*/ undefined, createIdentifier(/*isIdentifier*/ true),
/*questionToken*/ undefined, parseTypeAnnotation(),
/*initializer*/ undefined);
if (decorators) {
parseErrorAtRange(decorators[0], ts.Diagnostics.Decorators_may_not_be_applied_to_this_parameters);
}
return withJSDoc(finishNode(node_1, pos), hasJSDoc);
}
var savedTopLevel = topLevel;
topLevel = false;
var modifiers = parseModifiers();
var node = withJSDoc(finishNode(factory.createParameterDeclaration(decorators, modifiers, parseOptionalToken(25 /* DotDotDotToken */), parseNameOfParameter(modifiers), parseOptionalToken(57 /* QuestionToken */), parseTypeAnnotation(), parseInitializer()), pos), hasJSDoc);
topLevel = savedTopLevel;
return node;
}
function parseReturnType(returnToken, isType) {
if (shouldParseReturnType(returnToken, isType)) {
return parseTypeOrTypePredicate();
}
}
function shouldParseReturnType(returnToken, isType) {
if (returnToken === 38 /* EqualsGreaterThanToken */) {
parseExpected(returnToken);
return true;
}
else if (parseOptional(58 /* ColonToken */)) {
return true;
}
else if (isType && token() === 38 /* EqualsGreaterThanToken */) {
// This is easy to get backward, especially in type contexts, so parse the type anyway
parseErrorAtCurrentToken(ts.Diagnostics._0_expected, ts.tokenToString(58 /* ColonToken */));
nextToken();
return true;
}
return false;
}
function parseParametersWorker(flags) {
// FormalParameters [Yield,Await]: (modified)
// [empty]
// FormalParameterList[?Yield,Await]
//
// FormalParameter[Yield,Await]: (modified)
// BindingElement[?Yield,Await]
//
// BindingElement [Yield,Await]: (modified)
// SingleNameBinding[?Yield,?Await]
// BindingPattern[?Yield,?Await]Initializer [In, ?Yield,?Await] opt
//
// SingleNameBinding [Yield,Await]:
// BindingIdentifier[?Yield,?Await]Initializer [In, ?Yield,?Await] opt
var savedYieldContext = inYieldContext();
var savedAwaitContext = inAwaitContext();
setYieldContext(!!(flags & 1 /* Yield */));
setAwaitContext(!!(flags & 2 /* Await */));
var parameters = flags & 32 /* JSDoc */ ?
parseDelimitedList(17 /* JSDocParameters */, parseJSDocParameter) :
parseDelimitedList(16 /* Parameters */, savedAwaitContext ? parseParameterInOuterAwaitContext : parseParameter);
setYieldContext(savedYieldContext);
setAwaitContext(savedAwaitContext);
return parameters;
}
function parseParameters(flags) {
// FormalParameters [Yield,Await]: (modified)
// [empty]
// FormalParameterList[?Yield,Await]
//
// FormalParameter[Yield,Await]: (modified)
// BindingElement[?Yield,Await]
//
// BindingElement [Yield,Await]: (modified)
// SingleNameBinding[?Yield,?Await]
// BindingPattern[?Yield,?Await]Initializer [In, ?Yield,?Await] opt
//
// SingleNameBinding [Yield,Await]:
// BindingIdentifier[?Yield,?Await]Initializer [In, ?Yield,?Await] opt
if (!parseExpected(20 /* OpenParenToken */)) {
return createMissingList();
}
var parameters = parseParametersWorker(flags);
parseExpected(21 /* CloseParenToken */);
return parameters;
}
function parseTypeMemberSemicolon() {
// We allow type members to be separated by commas or (possibly ASI) semicolons.
// First check if it was a comma. If so, we're done with the member.
if (parseOptional(27 /* CommaToken */)) {
return;
}
// Didn't have a comma. We must have a (possible ASI) semicolon.
parseSemicolon();
}
function parseSignatureMember(kind) {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
if (kind === 173 /* ConstructSignature */) {
parseExpected(103 /* NewKeyword */);
}
var typeParameters = parseTypeParameters();
var parameters = parseParameters(4 /* Type */);
var type = parseReturnType(58 /* ColonToken */, /*isType*/ true);
parseTypeMemberSemicolon();
var node = kind === 172 /* CallSignature */
? factory.createCallSignature(typeParameters, parameters, type)
: factory.createConstructSignature(typeParameters, parameters, type);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function isIndexSignature() {
return token() === 22 /* OpenBracketToken */ && lookAhead(isUnambiguouslyIndexSignature);
}
function isUnambiguouslyIndexSignature() {
// The only allowed sequence is:
//
// [id:
//
// However, for error recovery, we also check the following cases:
//
// [...
// [id,
// [id?,
// [id?:
// [id?]
// [public id
// [private id
// [protected id
// []
//
nextToken();
if (token() === 25 /* DotDotDotToken */ || token() === 23 /* CloseBracketToken */) {
return true;
}
if (ts.isModifierKind(token())) {
nextToken();
if (isIdentifier()) {
return true;
}
}
else if (!isIdentifier()) {
return false;
}
else {
// Skip the identifier
nextToken();
}
// A colon signifies a well formed indexer
// A comma should be a badly formed indexer because comma expressions are not allowed
// in computed properties.
if (token() === 58 /* ColonToken */ || token() === 27 /* CommaToken */) {
return true;
}
// Question mark could be an indexer with an optional property,
// or it could be a conditional expression in a computed property.
if (token() !== 57 /* QuestionToken */) {
return false;
}
// If any of the following tokens are after the question mark, it cannot
// be a conditional expression, so treat it as an indexer.
nextToken();
return token() === 58 /* ColonToken */ || token() === 27 /* CommaToken */ || token() === 23 /* CloseBracketToken */;
}
function parseIndexSignatureDeclaration(pos, hasJSDoc, decorators, modifiers) {
var parameters = parseBracketedList(16 /* Parameters */, parseParameter, 22 /* OpenBracketToken */, 23 /* CloseBracketToken */);
var type = parseTypeAnnotation();
parseTypeMemberSemicolon();
var node = factory.createIndexSignature(decorators, modifiers, parameters, type);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parsePropertyOrMethodSignature(pos, hasJSDoc, modifiers) {
var name = parsePropertyName();
var questionToken = parseOptionalToken(57 /* QuestionToken */);
var node;
if (token() === 20 /* OpenParenToken */ || token() === 29 /* LessThanToken */) {
// Method signatures don't exist in expression contexts. So they have neither
// [Yield] nor [Await]
var typeParameters = parseTypeParameters();
var parameters = parseParameters(4 /* Type */);
var type = parseReturnType(58 /* ColonToken */, /*isType*/ true);
node = factory.createMethodSignature(modifiers, name, questionToken, typeParameters, parameters, type);
}
else {
var type = parseTypeAnnotation();
node = factory.createPropertySignature(modifiers, name, questionToken, type);
// Although type literal properties cannot not have initializers, we attempt
// to parse an initializer so we can report in the checker that an interface
// property or type literal property cannot have an initializer.
if (token() === 63 /* EqualsToken */)
node.initializer = parseInitializer();
}
parseTypeMemberSemicolon();
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function isTypeMemberStart() {
// Return true if we have the start of a signature member
if (token() === 20 /* OpenParenToken */ ||
token() === 29 /* LessThanToken */ ||
token() === 135 /* GetKeyword */ ||
token() === 147 /* SetKeyword */) {
return true;
}
var idToken = false;
// Eat up all modifiers, but hold on to the last one in case it is actually an identifier
while (ts.isModifierKind(token())) {
idToken = true;
nextToken();
}
// Index signatures and computed property names are type members
if (token() === 22 /* OpenBracketToken */) {
return true;
}
// Try to get the first property-like token following all modifiers
if (isLiteralPropertyName()) {
idToken = true;
nextToken();
}
// If we were able to get any potential identifier, check that it is
// the start of a member declaration
if (idToken) {
return token() === 20 /* OpenParenToken */ ||
token() === 29 /* LessThanToken */ ||
token() === 57 /* QuestionToken */ ||
token() === 58 /* ColonToken */ ||
token() === 27 /* CommaToken */ ||
canParseSemicolon();
}
return false;
}
function parseTypeMember() {
if (token() === 20 /* OpenParenToken */ || token() === 29 /* LessThanToken */) {
return parseSignatureMember(172 /* CallSignature */);
}
if (token() === 103 /* NewKeyword */ && lookAhead(nextTokenIsOpenParenOrLessThan)) {
return parseSignatureMember(173 /* ConstructSignature */);
}
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
var modifiers = parseModifiers();
if (parseContextualModifier(135 /* GetKeyword */)) {
return parseAccessorDeclaration(pos, hasJSDoc, /*decorators*/ undefined, modifiers, 170 /* GetAccessor */);
}
if (parseContextualModifier(147 /* SetKeyword */)) {
return parseAccessorDeclaration(pos, hasJSDoc, /*decorators*/ undefined, modifiers, 171 /* SetAccessor */);
}
if (isIndexSignature()) {
return parseIndexSignatureDeclaration(pos, hasJSDoc, /*decorators*/ undefined, modifiers);
}
return parsePropertyOrMethodSignature(pos, hasJSDoc, modifiers);
}
function nextTokenIsOpenParenOrLessThan() {
nextToken();
return token() === 20 /* OpenParenToken */ || token() === 29 /* LessThanToken */;
}
function nextTokenIsDot() {
return nextToken() === 24 /* DotToken */;
}
function nextTokenIsOpenParenOrLessThanOrDot() {
switch (nextToken()) {
case 20 /* OpenParenToken */:
case 29 /* LessThanToken */:
case 24 /* DotToken */:
return true;
}
return false;
}
function parseTypeLiteral() {
var pos = getNodePos();
return finishNode(factory.createTypeLiteralNode(parseObjectTypeMembers()), pos);
}
function parseObjectTypeMembers() {
var members;
if (parseExpected(18 /* OpenBraceToken */)) {
members = parseList(4 /* TypeMembers */, parseTypeMember);
parseExpected(19 /* CloseBraceToken */);
}
else {
members = createMissingList();
}
return members;
}
function isStartOfMappedType() {
nextToken();
if (token() === 39 /* PlusToken */ || token() === 40 /* MinusToken */) {
return nextToken() === 143 /* ReadonlyKeyword */;
}
if (token() === 143 /* ReadonlyKeyword */) {
nextToken();
}
return token() === 22 /* OpenBracketToken */ && nextTokenIsIdentifier() && nextToken() === 101 /* InKeyword */;
}
function parseMappedTypeParameter() {
var pos = getNodePos();
var name = parseIdentifierName();
parseExpected(101 /* InKeyword */);
var type = parseType();
return finishNode(factory.createTypeParameterDeclaration(name, type, /*defaultType*/ undefined), pos);
}
function parseMappedType() {
var pos = getNodePos();
parseExpected(18 /* OpenBraceToken */);
var readonlyToken;
if (token() === 143 /* ReadonlyKeyword */ || token() === 39 /* PlusToken */ || token() === 40 /* MinusToken */) {
readonlyToken = parseTokenNode();
if (readonlyToken.kind !== 143 /* ReadonlyKeyword */) {
parseExpected(143 /* ReadonlyKeyword */);
}
}
parseExpected(22 /* OpenBracketToken */);
var typeParameter = parseMappedTypeParameter();
var nameType = parseOptional(127 /* AsKeyword */) ? parseType() : undefined;
parseExpected(23 /* CloseBracketToken */);
var questionToken;
if (token() === 57 /* QuestionToken */ || token() === 39 /* PlusToken */ || token() === 40 /* MinusToken */) {
questionToken = parseTokenNode();
if (questionToken.kind !== 57 /* QuestionToken */) {
parseExpected(57 /* QuestionToken */);
}
}
var type = parseTypeAnnotation();
parseSemicolon();
parseExpected(19 /* CloseBraceToken */);
return finishNode(factory.createMappedTypeNode(readonlyToken, typeParameter, nameType, questionToken, type), pos);
}
function parseTupleElementType() {
var pos = getNodePos();
if (parseOptional(25 /* DotDotDotToken */)) {
return finishNode(factory.createRestTypeNode(parseType()), pos);
}
var type = parseType();
if (ts.isJSDocNullableType(type) && type.pos === type.type.pos) {
var node = factory.createOptionalTypeNode(type.type);
ts.setTextRange(node, type);
node.flags = type.flags;
return node;
}
return type;
}
function isNextTokenColonOrQuestionColon() {
return nextToken() === 58 /* ColonToken */ || (token() === 57 /* QuestionToken */ && nextToken() === 58 /* ColonToken */);
}
function isTupleElementName() {
if (token() === 25 /* DotDotDotToken */) {
return ts.tokenIsIdentifierOrKeyword(nextToken()) && isNextTokenColonOrQuestionColon();
}
return ts.tokenIsIdentifierOrKeyword(token()) && isNextTokenColonOrQuestionColon();
}
function parseTupleElementNameOrTupleElementType() {
if (lookAhead(isTupleElementName)) {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
var dotDotDotToken = parseOptionalToken(25 /* DotDotDotToken */);
var name = parseIdentifierName();
var questionToken = parseOptionalToken(57 /* QuestionToken */);
parseExpected(58 /* ColonToken */);
var type = parseTupleElementType();
var node = factory.createNamedTupleMember(dotDotDotToken, name, questionToken, type);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
return parseTupleElementType();
}
function parseTupleType() {
var pos = getNodePos();
return finishNode(factory.createTupleTypeNode(parseBracketedList(21 /* TupleElementTypes */, parseTupleElementNameOrTupleElementType, 22 /* OpenBracketToken */, 23 /* CloseBracketToken */)), pos);
}
function parseParenthesizedType() {
var pos = getNodePos();
parseExpected(20 /* OpenParenToken */);
var type = parseType();
parseExpected(21 /* CloseParenToken */);
return finishNode(factory.createParenthesizedType(type), pos);
}
function parseModifiersForConstructorType() {
var modifiers;
if (token() === 126 /* AbstractKeyword */) {
var pos = getNodePos();
nextToken();
var modifier = finishNode(factory.createToken(126 /* AbstractKeyword */), pos);
modifiers = createNodeArray([modifier], pos);
}
return modifiers;
}
function parseFunctionOrConstructorType() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
var modifiers = parseModifiersForConstructorType();
var isConstructorType = parseOptional(103 /* NewKeyword */);
var typeParameters = parseTypeParameters();
var parameters = parseParameters(4 /* Type */);
var type = parseReturnType(38 /* EqualsGreaterThanToken */, /*isType*/ false);
var node = isConstructorType
? factory.createConstructorTypeNode(modifiers, typeParameters, parameters, type)
: factory.createFunctionTypeNode(typeParameters, parameters, type);
if (!isConstructorType)
node.modifiers = modifiers;
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseKeywordAndNoDot() {
var node = parseTokenNode();
return token() === 24 /* DotToken */ ? undefined : node;
}
function parseLiteralTypeNode(negative) {
var pos = getNodePos();
if (negative) {
nextToken();
}
var expression = token() === 110 /* TrueKeyword */ || token() === 95 /* FalseKeyword */ || token() === 104 /* NullKeyword */ ?
parseTokenNode() :
parseLiteralLikeNode(token());
if (negative) {
expression = finishNode(factory.createPrefixUnaryExpression(40 /* MinusToken */, expression), pos);
}
return finishNode(factory.createLiteralTypeNode(expression), pos);
}
function isStartOfTypeOfImportType() {
nextToken();
return token() === 100 /* ImportKeyword */;
}
function parseImportType() {
sourceFlags |= 1048576 /* PossiblyContainsDynamicImport */;
var pos = getNodePos();
var isTypeOf = parseOptional(112 /* TypeOfKeyword */);
parseExpected(100 /* ImportKeyword */);
parseExpected(20 /* OpenParenToken */);
var type = parseType();
parseExpected(21 /* CloseParenToken */);
var qualifier = parseOptional(24 /* DotToken */) ? parseEntityNameOfTypeReference() : undefined;
var typeArguments = parseTypeArgumentsOfTypeReference();
return finishNode(factory.createImportTypeNode(type, qualifier, typeArguments, isTypeOf), pos);
}
function nextTokenIsNumericOrBigIntLiteral() {
nextToken();
return token() === 8 /* NumericLiteral */ || token() === 9 /* BigIntLiteral */;
}
function parseNonArrayType() {
switch (token()) {
case 129 /* AnyKeyword */:
case 153 /* UnknownKeyword */:
case 148 /* StringKeyword */:
case 145 /* NumberKeyword */:
case 156 /* BigIntKeyword */:
case 149 /* SymbolKeyword */:
case 132 /* BooleanKeyword */:
case 151 /* UndefinedKeyword */:
case 142 /* NeverKeyword */:
case 146 /* ObjectKeyword */:
// If these are followed by a dot, then parse these out as a dotted type reference instead.
return tryParse(parseKeywordAndNoDot) || parseTypeReference();
case 66 /* AsteriskEqualsToken */:
// If there is '*=', treat it as * followed by postfix =
scanner.reScanAsteriskEqualsToken();
// falls through
case 41 /* AsteriskToken */:
return parseJSDocAllType();
case 60 /* QuestionQuestionToken */:
// If there is '??', treat it as prefix-'?' in JSDoc type.
scanner.reScanQuestionToken();
// falls through
case 57 /* QuestionToken */:
return parseJSDocUnknownOrNullableType();
case 98 /* FunctionKeyword */:
return parseJSDocFunctionType();
case 53 /* ExclamationToken */:
return parseJSDocNonNullableType();
case 14 /* NoSubstitutionTemplateLiteral */:
case 10 /* StringLiteral */:
case 8 /* NumericLiteral */:
case 9 /* BigIntLiteral */:
case 110 /* TrueKeyword */:
case 95 /* FalseKeyword */:
case 104 /* NullKeyword */:
return parseLiteralTypeNode();
case 40 /* MinusToken */:
return lookAhead(nextTokenIsNumericOrBigIntLiteral) ? parseLiteralTypeNode(/*negative*/ true) : parseTypeReference();
case 114 /* VoidKeyword */:
return parseTokenNode();
case 108 /* ThisKeyword */: {
var thisKeyword = parseThisTypeNode();
if (token() === 138 /* IsKeyword */ && !scanner.hasPrecedingLineBreak()) {
return parseThisTypePredicate(thisKeyword);
}
else {
return thisKeyword;
}
}
case 112 /* TypeOfKeyword */:
return lookAhead(isStartOfTypeOfImportType) ? parseImportType() : parseTypeQuery();
case 18 /* OpenBraceToken */:
return lookAhead(isStartOfMappedType) ? parseMappedType() : parseTypeLiteral();
case 22 /* OpenBracketToken */:
return parseTupleType();
case 20 /* OpenParenToken */:
return parseParenthesizedType();
case 100 /* ImportKeyword */:
return parseImportType();
case 128 /* AssertsKeyword */:
return lookAhead(nextTokenIsIdentifierOrKeywordOnSameLine) ? parseAssertsTypePredicate() : parseTypeReference();
case 15 /* TemplateHead */:
return parseTemplateType();
default:
return parseTypeReference();
}
}
function isStartOfType(inStartOfParameter) {
switch (token()) {
case 129 /* AnyKeyword */:
case 153 /* UnknownKeyword */:
case 148 /* StringKeyword */:
case 145 /* NumberKeyword */:
case 156 /* BigIntKeyword */:
case 132 /* BooleanKeyword */:
case 143 /* ReadonlyKeyword */:
case 149 /* SymbolKeyword */:
case 152 /* UniqueKeyword */:
case 114 /* VoidKeyword */:
case 151 /* UndefinedKeyword */:
case 104 /* NullKeyword */:
case 108 /* ThisKeyword */:
case 112 /* TypeOfKeyword */:
case 142 /* NeverKeyword */:
case 18 /* OpenBraceToken */:
case 22 /* OpenBracketToken */:
case 29 /* LessThanToken */:
case 51 /* BarToken */:
case 50 /* AmpersandToken */:
case 103 /* NewKeyword */:
case 10 /* StringLiteral */:
case 8 /* NumericLiteral */:
case 9 /* BigIntLiteral */:
case 110 /* TrueKeyword */:
case 95 /* FalseKeyword */:
case 146 /* ObjectKeyword */:
case 41 /* AsteriskToken */:
case 57 /* QuestionToken */:
case 53 /* ExclamationToken */:
case 25 /* DotDotDotToken */:
case 136 /* InferKeyword */:
case 100 /* ImportKeyword */:
case 128 /* AssertsKeyword */:
case 14 /* NoSubstitutionTemplateLiteral */:
case 15 /* TemplateHead */:
return true;
case 98 /* FunctionKeyword */:
return !inStartOfParameter;
case 40 /* MinusToken */:
return !inStartOfParameter && lookAhead(nextTokenIsNumericOrBigIntLiteral);
case 20 /* OpenParenToken */:
// Only consider '(' the start of a type if followed by ')', '...', an identifier, a modifier,
// or something that starts a type. We don't want to consider things like '(1)' a type.
return !inStartOfParameter && lookAhead(isStartOfParenthesizedOrFunctionType);
default:
return isIdentifier();
}
}
function isStartOfParenthesizedOrFunctionType() {
nextToken();
return token() === 21 /* CloseParenToken */ || isStartOfParameter(/*isJSDocParameter*/ false) || isStartOfType();
}
function parsePostfixTypeOrHigher() {
var pos = getNodePos();
var type = parseNonArrayType();
while (!scanner.hasPrecedingLineBreak()) {
switch (token()) {
case 53 /* ExclamationToken */:
nextToken();
type = finishNode(factory.createJSDocNonNullableType(type), pos);
break;
case 57 /* QuestionToken */:
// If next token is start of a type we have a conditional type
if (lookAhead(nextTokenIsStartOfType)) {
return type;
}
nextToken();
type = finishNode(factory.createJSDocNullableType(type), pos);
break;
case 22 /* OpenBracketToken */:
parseExpected(22 /* OpenBracketToken */);
if (isStartOfType()) {
var indexType = parseType();
parseExpected(23 /* CloseBracketToken */);
type = finishNode(factory.createIndexedAccessTypeNode(type, indexType), pos);
}
else {
parseExpected(23 /* CloseBracketToken */);
type = finishNode(factory.createArrayTypeNode(type), pos);
}
break;
default:
return type;
}
}
return type;
}
function parseTypeOperator(operator) {
var pos = getNodePos();
parseExpected(operator);
return finishNode(factory.createTypeOperatorNode(operator, parseTypeOperatorOrHigher()), pos);
}
function parseTypeParameterOfInferType() {
var pos = getNodePos();
return finishNode(factory.createTypeParameterDeclaration(parseIdentifier(),
/*constraint*/ undefined,
/*defaultType*/ undefined), pos);
}
function parseInferType() {
var pos = getNodePos();
parseExpected(136 /* InferKeyword */);
return finishNode(factory.createInferTypeNode(parseTypeParameterOfInferType()), pos);
}
function parseTypeOperatorOrHigher() {
var operator = token();
switch (operator) {
case 139 /* KeyOfKeyword */:
case 152 /* UniqueKeyword */:
case 143 /* ReadonlyKeyword */:
return parseTypeOperator(operator);
case 136 /* InferKeyword */:
return parseInferType();
}
return parsePostfixTypeOrHigher();
}
function parseFunctionOrConstructorTypeToError(isInUnionType) {
// the function type and constructor type shorthand notation
// are not allowed directly in unions and intersections, but we'll
// try to parse them gracefully and issue a helpful message.
if (isStartOfFunctionTypeOrConstructorType()) {
var type = parseFunctionOrConstructorType();
var diagnostic = void 0;
if (ts.isFunctionTypeNode(type)) {
diagnostic = isInUnionType
? ts.Diagnostics.Function_type_notation_must_be_parenthesized_when_used_in_a_union_type
: ts.Diagnostics.Function_type_notation_must_be_parenthesized_when_used_in_an_intersection_type;
}
else {
diagnostic = isInUnionType
? ts.Diagnostics.Constructor_type_notation_must_be_parenthesized_when_used_in_a_union_type
: ts.Diagnostics.Constructor_type_notation_must_be_parenthesized_when_used_in_an_intersection_type;
}
parseErrorAtRange(type, diagnostic);
return type;
}
return undefined;
}
function parseUnionOrIntersectionType(operator, parseConstituentType, createTypeNode) {
var pos = getNodePos();
var isUnionType = operator === 51 /* BarToken */;
var hasLeadingOperator = parseOptional(operator);
var type = hasLeadingOperator && parseFunctionOrConstructorTypeToError(isUnionType)
|| parseConstituentType();
if (token() === operator || hasLeadingOperator) {
var types = [type];
while (parseOptional(operator)) {
types.push(parseFunctionOrConstructorTypeToError(isUnionType) || parseConstituentType());
}
type = finishNode(createTypeNode(createNodeArray(types, pos)), pos);
}
return type;
}
function parseIntersectionTypeOrHigher() {
return parseUnionOrIntersectionType(50 /* AmpersandToken */, parseTypeOperatorOrHigher, factory.createIntersectionTypeNode);
}
function parseUnionTypeOrHigher() {
return parseUnionOrIntersectionType(51 /* BarToken */, parseIntersectionTypeOrHigher, factory.createUnionTypeNode);
}
function nextTokenIsNewKeyword() {
nextToken();
return token() === 103 /* NewKeyword */;
}
function isStartOfFunctionTypeOrConstructorType() {
if (token() === 29 /* LessThanToken */) {
return true;
}
if (token() === 20 /* OpenParenToken */ && lookAhead(isUnambiguouslyStartOfFunctionType)) {
return true;
}
return token() === 103 /* NewKeyword */ ||
token() === 126 /* AbstractKeyword */ && lookAhead(nextTokenIsNewKeyword);
}
function skipParameterStart() {
if (ts.isModifierKind(token())) {
// Skip modifiers
parseModifiers();
}
if (isIdentifier() || token() === 108 /* ThisKeyword */) {
nextToken();
return true;
}
if (token() === 22 /* OpenBracketToken */ || token() === 18 /* OpenBraceToken */) {
// Return true if we can parse an array or object binding pattern with no errors
var previousErrorCount = parseDiagnostics.length;
parseIdentifierOrPattern();
return previousErrorCount === parseDiagnostics.length;
}
return false;
}
function isUnambiguouslyStartOfFunctionType() {
nextToken();
if (token() === 21 /* CloseParenToken */ || token() === 25 /* DotDotDotToken */) {
// ( )
// ( ...
return true;
}
if (skipParameterStart()) {
// We successfully skipped modifiers (if any) and an identifier or binding pattern,
// now see if we have something that indicates a parameter declaration
if (token() === 58 /* ColonToken */ || token() === 27 /* CommaToken */ ||
token() === 57 /* QuestionToken */ || token() === 63 /* EqualsToken */) {
// ( xxx :
// ( xxx ,
// ( xxx ?
// ( xxx =
return true;
}
if (token() === 21 /* CloseParenToken */) {
nextToken();
if (token() === 38 /* EqualsGreaterThanToken */) {
// ( xxx ) =>
return true;
}
}
}
return false;
}
function parseTypeOrTypePredicate() {
var pos = getNodePos();
var typePredicateVariable = isIdentifier() && tryParse(parseTypePredicatePrefix);
var type = parseType();
if (typePredicateVariable) {
return finishNode(factory.createTypePredicateNode(/*assertsModifier*/ undefined, typePredicateVariable, type), pos);
}
else {
return type;
}
}
function parseTypePredicatePrefix() {
var id = parseIdentifier();
if (token() === 138 /* IsKeyword */ && !scanner.hasPrecedingLineBreak()) {
nextToken();
return id;
}
}
function parseAssertsTypePredicate() {
var pos = getNodePos();
var assertsModifier = parseExpectedToken(128 /* AssertsKeyword */);
var parameterName = token() === 108 /* ThisKeyword */ ? parseThisTypeNode() : parseIdentifier();
var type = parseOptional(138 /* IsKeyword */) ? parseType() : undefined;
return finishNode(factory.createTypePredicateNode(assertsModifier, parameterName, type), pos);
}
function parseType() {
// The rules about 'yield' only apply to actual code/expression contexts. They don't
// apply to 'type' contexts. So we disable these parameters here before moving on.
return doOutsideOfContext(40960 /* TypeExcludesFlags */, parseTypeWorker);
}
function parseTypeWorker(noConditionalTypes) {
if (isStartOfFunctionTypeOrConstructorType()) {
return parseFunctionOrConstructorType();
}
var pos = getNodePos();
var type = parseUnionTypeOrHigher();
if (!noConditionalTypes && !scanner.hasPrecedingLineBreak() && parseOptional(94 /* ExtendsKeyword */)) {
// The type following 'extends' is not permitted to be another conditional type
var extendsType = parseTypeWorker(/*noConditionalTypes*/ true);
parseExpected(57 /* QuestionToken */);
var trueType = parseTypeWorker();
parseExpected(58 /* ColonToken */);
var falseType = parseTypeWorker();
return finishNode(factory.createConditionalTypeNode(type, extendsType, trueType, falseType), pos);
}
return type;
}
function parseTypeAnnotation() {
return parseOptional(58 /* ColonToken */) ? parseType() : undefined;
}
// EXPRESSIONS
function isStartOfLeftHandSideExpression() {
switch (token()) {
case 108 /* ThisKeyword */:
case 106 /* SuperKeyword */:
case 104 /* NullKeyword */:
case 110 /* TrueKeyword */:
case 95 /* FalseKeyword */:
case 8 /* NumericLiteral */:
case 9 /* BigIntLiteral */:
case 10 /* StringLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
case 15 /* TemplateHead */:
case 20 /* OpenParenToken */:
case 22 /* OpenBracketToken */:
case 18 /* OpenBraceToken */:
case 98 /* FunctionKeyword */:
case 84 /* ClassKeyword */:
case 103 /* NewKeyword */:
case 43 /* SlashToken */:
case 68 /* SlashEqualsToken */:
case 79 /* Identifier */:
return true;
case 100 /* ImportKeyword */:
return lookAhead(nextTokenIsOpenParenOrLessThanOrDot);
default:
return isIdentifier();
}
}
function isStartOfExpression() {
if (isStartOfLeftHandSideExpression()) {
return true;
}
switch (token()) {
case 39 /* PlusToken */:
case 40 /* MinusToken */:
case 54 /* TildeToken */:
case 53 /* ExclamationToken */:
case 89 /* DeleteKeyword */:
case 112 /* TypeOfKeyword */:
case 114 /* VoidKeyword */:
case 45 /* PlusPlusToken */:
case 46 /* MinusMinusToken */:
case 29 /* LessThanToken */:
case 131 /* AwaitKeyword */:
case 125 /* YieldKeyword */:
case 80 /* PrivateIdentifier */:
// Yield/await always starts an expression. Either it is an identifier (in which case
// it is definitely an expression). Or it's a keyword (either because we're in
// a generator or async function, or in strict mode (or both)) and it started a yield or await expression.
return true;
default:
// Error tolerance. If we see the start of some binary operator, we consider
// that the start of an expression. That way we'll parse out a missing identifier,
// give a good message about an identifier being missing, and then consume the
// rest of the binary expression.
if (isBinaryOperator()) {
return true;
}
return isIdentifier();
}
}
function isStartOfExpressionStatement() {
// As per the grammar, none of '{' or 'function' or 'class' can start an expression statement.
return token() !== 18 /* OpenBraceToken */ &&
token() !== 98 /* FunctionKeyword */ &&
token() !== 84 /* ClassKeyword */ &&
token() !== 59 /* AtToken */ &&
isStartOfExpression();
}
function parseExpression() {
// Expression[in]:
// AssignmentExpression[in]
// Expression[in] , AssignmentExpression[in]
// clear the decorator context when parsing Expression, as it should be unambiguous when parsing a decorator
var saveDecoratorContext = inDecoratorContext();
if (saveDecoratorContext) {
setDecoratorContext(/*val*/ false);
}
var pos = getNodePos();
var expr = parseAssignmentExpressionOrHigher();
var operatorToken;
while ((operatorToken = parseOptionalToken(27 /* CommaToken */))) {
expr = makeBinaryExpression(expr, operatorToken, parseAssignmentExpressionOrHigher(), pos);
}
if (saveDecoratorContext) {
setDecoratorContext(/*val*/ true);
}
return expr;
}
function parseInitializer() {
return parseOptional(63 /* EqualsToken */) ? parseAssignmentExpressionOrHigher() : undefined;
}
function parseAssignmentExpressionOrHigher() {
// AssignmentExpression[in,yield]:
// 1) ConditionalExpression[?in,?yield]
// 2) LeftHandSideExpression = AssignmentExpression[?in,?yield]
// 3) LeftHandSideExpression AssignmentOperator AssignmentExpression[?in,?yield]
// 4) ArrowFunctionExpression[?in,?yield]
// 5) AsyncArrowFunctionExpression[in,yield,await]
// 6) [+Yield] YieldExpression[?In]
//
// Note: for ease of implementation we treat productions '2' and '3' as the same thing.
// (i.e. they're both BinaryExpressions with an assignment operator in it).
// First, do the simple check if we have a YieldExpression (production '6').
if (isYieldExpression()) {
return parseYieldExpression();
}
// Then, check if we have an arrow function (production '4' and '5') that starts with a parenthesized
// parameter list or is an async arrow function.
// AsyncArrowFunctionExpression:
// 1) async[no LineTerminator here]AsyncArrowBindingIdentifier[?Yield][no LineTerminator here]=>AsyncConciseBody[?In]
// 2) CoverCallExpressionAndAsyncArrowHead[?Yield, ?Await][no LineTerminator here]=>AsyncConciseBody[?In]
// Production (1) of AsyncArrowFunctionExpression is parsed in "tryParseAsyncSimpleArrowFunctionExpression".
// And production (2) is parsed in "tryParseParenthesizedArrowFunctionExpression".
//
// If we do successfully parse arrow-function, we must *not* recurse for productions 1, 2 or 3. An ArrowFunction is
// not a LeftHandSideExpression, nor does it start a ConditionalExpression. So we are done
// with AssignmentExpression if we see one.
var arrowExpression = tryParseParenthesizedArrowFunctionExpression() || tryParseAsyncSimpleArrowFunctionExpression();
if (arrowExpression) {
return arrowExpression;
}
// Now try to see if we're in production '1', '2' or '3'. A conditional expression can
// start with a LogicalOrExpression, while the assignment productions can only start with
// LeftHandSideExpressions.
//
// So, first, we try to just parse out a BinaryExpression. If we get something that is a
// LeftHandSide or higher, then we can try to parse out the assignment expression part.
// Otherwise, we try to parse out the conditional expression bit. We want to allow any
// binary expression here, so we pass in the 'lowest' precedence here so that it matches
// and consumes anything.
var pos = getNodePos();
var expr = parseBinaryExpressionOrHigher(0 /* Lowest */);
// To avoid a look-ahead, we did not handle the case of an arrow function with a single un-parenthesized
// parameter ('x => ...') above. We handle it here by checking if the parsed expression was a single
// identifier and the current token is an arrow.
if (expr.kind === 79 /* Identifier */ && token() === 38 /* EqualsGreaterThanToken */) {
return parseSimpleArrowFunctionExpression(pos, expr, /*asyncModifier*/ undefined);
}
// Now see if we might be in cases '2' or '3'.
// If the expression was a LHS expression, and we have an assignment operator, then
// we're in '2' or '3'. Consume the assignment and return.
//
// Note: we call reScanGreaterToken so that we get an appropriately merged token
// for cases like `> > =` becoming `>>=`
if (ts.isLeftHandSideExpression(expr) && ts.isAssignmentOperator(reScanGreaterToken())) {
return makeBinaryExpression(expr, parseTokenNode(), parseAssignmentExpressionOrHigher(), pos);
}
// It wasn't an assignment or a lambda. This is a conditional expression:
return parseConditionalExpressionRest(expr, pos);
}
function isYieldExpression() {
if (token() === 125 /* YieldKeyword */) {
// If we have a 'yield' keyword, and this is a context where yield expressions are
// allowed, then definitely parse out a yield expression.
if (inYieldContext()) {
return true;
}
// We're in a context where 'yield expr' is not allowed. However, if we can
// definitely tell that the user was trying to parse a 'yield expr' and not
// just a normal expr that start with a 'yield' identifier, then parse out
// a 'yield expr'. We can then report an error later that they are only
// allowed in generator expressions.
//
// for example, if we see 'yield(foo)', then we'll have to treat that as an
// invocation expression of something called 'yield'. However, if we have
// 'yield foo' then that is not legal as a normal expression, so we can
// definitely recognize this as a yield expression.
//
// for now we just check if the next token is an identifier. More heuristics
// can be added here later as necessary. We just need to make sure that we
// don't accidentally consume something legal.
return lookAhead(nextTokenIsIdentifierOrKeywordOrLiteralOnSameLine);
}
return false;
}
function nextTokenIsIdentifierOnSameLine() {
nextToken();
return !scanner.hasPrecedingLineBreak() && isIdentifier();
}
function parseYieldExpression() {
var pos = getNodePos();
// YieldExpression[In] :
// yield
// yield [no LineTerminator here] [Lexical goal InputElementRegExp]AssignmentExpression[?In, Yield]
// yield [no LineTerminator here] * [Lexical goal InputElementRegExp]AssignmentExpression[?In, Yield]
nextToken();
if (!scanner.hasPrecedingLineBreak() &&
(token() === 41 /* AsteriskToken */ || isStartOfExpression())) {
return finishNode(factory.createYieldExpression(parseOptionalToken(41 /* AsteriskToken */), parseAssignmentExpressionOrHigher()), pos);
}
else {
// if the next token is not on the same line as yield. or we don't have an '*' or
// the start of an expression, then this is just a simple "yield" expression.
return finishNode(factory.createYieldExpression(/*asteriskToken*/ undefined, /*expression*/ undefined), pos);
}
}
function parseSimpleArrowFunctionExpression(pos, identifier, asyncModifier) {
ts.Debug.assert(token() === 38 /* EqualsGreaterThanToken */, "parseSimpleArrowFunctionExpression should only have been called if we had a =>");
var parameter = factory.createParameterDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*dotDotDotToken*/ undefined, identifier,
/*questionToken*/ undefined,
/*type*/ undefined,
/*initializer*/ undefined);
finishNode(parameter, identifier.pos);
var parameters = createNodeArray([parameter], parameter.pos, parameter.end);
var equalsGreaterThanToken = parseExpectedToken(38 /* EqualsGreaterThanToken */);
var body = parseArrowFunctionExpressionBody(/*isAsync*/ !!asyncModifier);
var node = factory.createArrowFunction(asyncModifier, /*typeParameters*/ undefined, parameters, /*type*/ undefined, equalsGreaterThanToken, body);
return addJSDocComment(finishNode(node, pos));
}
function tryParseParenthesizedArrowFunctionExpression() {
var triState = isParenthesizedArrowFunctionExpression();
if (triState === 0 /* False */) {
// It's definitely not a parenthesized arrow function expression.
return undefined;
}
// If we definitely have an arrow function, then we can just parse one, not requiring a
// following => or { token. Otherwise, we *might* have an arrow function. Try to parse
// it out, but don't allow any ambiguity, and return 'undefined' if this could be an
// expression instead.
return triState === 1 /* True */ ?
parseParenthesizedArrowFunctionExpression(/*allowAmbiguity*/ true) :
tryParse(parsePossibleParenthesizedArrowFunctionExpression);
}
// True -> We definitely expect a parenthesized arrow function here.
// False -> There *cannot* be a parenthesized arrow function here.
// Unknown -> There *might* be a parenthesized arrow function here.
// Speculatively look ahead to be sure, and rollback if not.
function isParenthesizedArrowFunctionExpression() {
if (token() === 20 /* OpenParenToken */ || token() === 29 /* LessThanToken */ || token() === 130 /* AsyncKeyword */) {
return lookAhead(isParenthesizedArrowFunctionExpressionWorker);
}
if (token() === 38 /* EqualsGreaterThanToken */) {
// ERROR RECOVERY TWEAK:
// If we see a standalone => try to parse it as an arrow function expression as that's
// likely what the user intended to write.
return 1 /* True */;
}
// Definitely not a parenthesized arrow function.
return 0 /* False */;
}
function isParenthesizedArrowFunctionExpressionWorker() {
if (token() === 130 /* AsyncKeyword */) {
nextToken();
if (scanner.hasPrecedingLineBreak()) {
return 0 /* False */;
}
if (token() !== 20 /* OpenParenToken */ && token() !== 29 /* LessThanToken */) {
return 0 /* False */;
}
}
var first = token();
var second = nextToken();
if (first === 20 /* OpenParenToken */) {
if (second === 21 /* CloseParenToken */) {
// Simple cases: "() =>", "(): ", and "() {".
// This is an arrow function with no parameters.
// The last one is not actually an arrow function,
// but this is probably what the user intended.
var third = nextToken();
switch (third) {
case 38 /* EqualsGreaterThanToken */:
case 58 /* ColonToken */:
case 18 /* OpenBraceToken */:
return 1 /* True */;
default:
return 0 /* False */;
}
}
// If encounter "([" or "({", this could be the start of a binding pattern.
// Examples:
// ([ x ]) => { }
// ({ x }) => { }
// ([ x ])
// ({ x })
if (second === 22 /* OpenBracketToken */ || second === 18 /* OpenBraceToken */) {
return 2 /* Unknown */;
}
// Simple case: "(..."
// This is an arrow function with a rest parameter.
if (second === 25 /* DotDotDotToken */) {
return 1 /* True */;
}
// Check for "(xxx yyy", where xxx is a modifier and yyy is an identifier. This
// isn't actually allowed, but we want to treat it as a lambda so we can provide
// a good error message.
if (ts.isModifierKind(second) && second !== 130 /* AsyncKeyword */ && lookAhead(nextTokenIsIdentifier)) {
return 1 /* True */;
}
// If we had "(" followed by something that's not an identifier,
// then this definitely doesn't look like a lambda. "this" is not
// valid, but we want to parse it and then give a semantic error.
if (!isIdentifier() && second !== 108 /* ThisKeyword */) {
return 0 /* False */;
}
switch (nextToken()) {
case 58 /* ColonToken */:
// If we have something like "(a:", then we must have a
// type-annotated parameter in an arrow function expression.
return 1 /* True */;
case 57 /* QuestionToken */:
nextToken();
// If we have "(a?:" or "(a?," or "(a?=" or "(a?)" then it is definitely a lambda.
if (token() === 58 /* ColonToken */ || token() === 27 /* CommaToken */ || token() === 63 /* EqualsToken */ || token() === 21 /* CloseParenToken */) {
return 1 /* True */;
}
// Otherwise it is definitely not a lambda.
return 0 /* False */;
case 27 /* CommaToken */:
case 63 /* EqualsToken */:
case 21 /* CloseParenToken */:
// If we have "(a," or "(a=" or "(a)" this *could* be an arrow function
return 2 /* Unknown */;
}
// It is definitely not an arrow function
return 0 /* False */;
}
else {
ts.Debug.assert(first === 29 /* LessThanToken */);
// If we have "<" not followed by an identifier,
// then this definitely is not an arrow function.
if (!isIdentifier()) {
return 0 /* False */;
}
// JSX overrides
if (languageVariant === 1 /* JSX */) {
var isArrowFunctionInJsx = lookAhead(function () {
var third = nextToken();
if (third === 94 /* ExtendsKeyword */) {
var fourth = nextToken();
switch (fourth) {
case 63 /* EqualsToken */:
case 31 /* GreaterThanToken */:
return false;
default:
return true;
}
}
else if (third === 27 /* CommaToken */) {
return true;
}
return false;
});
if (isArrowFunctionInJsx) {
return 1 /* True */;
}
return 0 /* False */;
}
// This *could* be a parenthesized arrow function.
return 2 /* Unknown */;
}
}
function parsePossibleParenthesizedArrowFunctionExpression() {
var tokenPos = scanner.getTokenPos();
if (notParenthesizedArrow === null || notParenthesizedArrow === void 0 ? void 0 : notParenthesizedArrow.has(tokenPos)) {
return undefined;
}
var result = parseParenthesizedArrowFunctionExpression(/*allowAmbiguity*/ false);
if (!result) {
(notParenthesizedArrow || (notParenthesizedArrow = new ts.Set())).add(tokenPos);
}
return result;
}
function tryParseAsyncSimpleArrowFunctionExpression() {
// We do a check here so that we won't be doing unnecessarily call to "lookAhead"
if (token() === 130 /* AsyncKeyword */) {
if (lookAhead(isUnParenthesizedAsyncArrowFunctionWorker) === 1 /* True */) {
var pos = getNodePos();
var asyncModifier = parseModifiersForArrowFunction();
var expr = parseBinaryExpressionOrHigher(0 /* Lowest */);
return parseSimpleArrowFunctionExpression(pos, expr, asyncModifier);
}
}
return undefined;
}
function isUnParenthesizedAsyncArrowFunctionWorker() {
// AsyncArrowFunctionExpression:
// 1) async[no LineTerminator here]AsyncArrowBindingIdentifier[?Yield][no LineTerminator here]=>AsyncConciseBody[?In]
// 2) CoverCallExpressionAndAsyncArrowHead[?Yield, ?Await][no LineTerminator here]=>AsyncConciseBody[?In]
if (token() === 130 /* AsyncKeyword */) {
nextToken();
// If the "async" is followed by "=>" token then it is not a beginning of an async arrow-function
// but instead a simple arrow-function which will be parsed inside "parseAssignmentExpressionOrHigher"
if (scanner.hasPrecedingLineBreak() || token() === 38 /* EqualsGreaterThanToken */) {
return 0 /* False */;
}
// Check for un-parenthesized AsyncArrowFunction
var expr = parseBinaryExpressionOrHigher(0 /* Lowest */);
if (!scanner.hasPrecedingLineBreak() && expr.kind === 79 /* Identifier */ && token() === 38 /* EqualsGreaterThanToken */) {
return 1 /* True */;
}
}
return 0 /* False */;
}
function parseParenthesizedArrowFunctionExpression(allowAmbiguity) {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
var modifiers = parseModifiersForArrowFunction();
var isAsync = ts.some(modifiers, ts.isAsyncModifier) ? 2 /* Await */ : 0 /* None */;
// Arrow functions are never generators.
//
// If we're speculatively parsing a signature for a parenthesized arrow function, then
// we have to have a complete parameter list. Otherwise we might see something like
// a => (b => c)
// And think that "(b =>" was actually a parenthesized arrow function with a missing
// close paren.
var typeParameters = parseTypeParameters();
var parameters;
if (!parseExpected(20 /* OpenParenToken */)) {
if (!allowAmbiguity) {
return undefined;
}
parameters = createMissingList();
}
else {
parameters = parseParametersWorker(isAsync);
if (!parseExpected(21 /* CloseParenToken */) && !allowAmbiguity) {
return undefined;
}
}
var type = parseReturnType(58 /* ColonToken */, /*isType*/ false);
if (type && !allowAmbiguity && typeHasArrowFunctionBlockingParseError(type)) {
return undefined;
}
// Parsing a signature isn't enough.
// Parenthesized arrow signatures often look like other valid expressions.
// For instance:
// - "(x = 10)" is an assignment expression parsed as a signature with a default parameter value.
// - "(x,y)" is a comma expression parsed as a signature with two parameters.
// - "a ? (b): c" will have "(b):" parsed as a signature with a return type annotation.
// - "a ? (b): function() {}" will too, since function() is a valid JSDoc function type.
//
// So we need just a bit of lookahead to ensure that it can only be a signature.
var hasJSDocFunctionType = type && ts.isJSDocFunctionType(type);
if (!allowAmbiguity && token() !== 38 /* EqualsGreaterThanToken */ && (hasJSDocFunctionType || token() !== 18 /* OpenBraceToken */)) {
// Returning undefined here will cause our caller to rewind to where we started from.
return undefined;
}
// If we have an arrow, then try to parse the body. Even if not, try to parse if we
// have an opening brace, just in case we're in an error state.
var lastToken = token();
var equalsGreaterThanToken = parseExpectedToken(38 /* EqualsGreaterThanToken */);
var body = (lastToken === 38 /* EqualsGreaterThanToken */ || lastToken === 18 /* OpenBraceToken */)
? parseArrowFunctionExpressionBody(ts.some(modifiers, ts.isAsyncModifier))
: parseIdentifier();
var node = factory.createArrowFunction(modifiers, typeParameters, parameters, type, equalsGreaterThanToken, body);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseArrowFunctionExpressionBody(isAsync) {
if (token() === 18 /* OpenBraceToken */) {
return parseFunctionBlock(isAsync ? 2 /* Await */ : 0 /* None */);
}
if (token() !== 26 /* SemicolonToken */ &&
token() !== 98 /* FunctionKeyword */ &&
token() !== 84 /* ClassKeyword */ &&
isStartOfStatement() &&
!isStartOfExpressionStatement()) {
// Check if we got a plain statement (i.e. no expression-statements, no function/class expressions/declarations)
//
// Here we try to recover from a potential error situation in the case where the
// user meant to supply a block. For example, if the user wrote:
//
// a =>
// let v = 0;
// }
//
// they may be missing an open brace. Check to see if that's the case so we can
// try to recover better. If we don't do this, then the next close curly we see may end
// up preemptively closing the containing construct.
//
// Note: even when 'IgnoreMissingOpenBrace' is passed, parseBody will still error.
return parseFunctionBlock(16 /* IgnoreMissingOpenBrace */ | (isAsync ? 2 /* Await */ : 0 /* None */));
}
var savedTopLevel = topLevel;
topLevel = false;
var node = isAsync
? doInAwaitContext(parseAssignmentExpressionOrHigher)
: doOutsideOfAwaitContext(parseAssignmentExpressionOrHigher);
topLevel = savedTopLevel;
return node;
}
function parseConditionalExpressionRest(leftOperand, pos) {
// Note: we are passed in an expression which was produced from parseBinaryExpressionOrHigher.
var questionToken = parseOptionalToken(57 /* QuestionToken */);
if (!questionToken) {
return leftOperand;
}
// Note: we explicitly 'allowIn' in the whenTrue part of the condition expression, and
// we do not that for the 'whenFalse' part.
var colonToken;
return finishNode(factory.createConditionalExpression(leftOperand, questionToken, doOutsideOfContext(disallowInAndDecoratorContext, parseAssignmentExpressionOrHigher), colonToken = parseExpectedToken(58 /* ColonToken */), ts.nodeIsPresent(colonToken)
? parseAssignmentExpressionOrHigher()
: createMissingNode(79 /* Identifier */, /*reportAtCurrentPosition*/ false, ts.Diagnostics._0_expected, ts.tokenToString(58 /* ColonToken */))), pos);
}
function parseBinaryExpressionOrHigher(precedence) {
var pos = getNodePos();
var leftOperand = parseUnaryExpressionOrHigher();
return parseBinaryExpressionRest(precedence, leftOperand, pos);
}
function isInOrOfKeyword(t) {
return t === 101 /* InKeyword */ || t === 158 /* OfKeyword */;
}
function parseBinaryExpressionRest(precedence, leftOperand, pos) {
while (true) {
// We either have a binary operator here, or we're finished. We call
// reScanGreaterToken so that we merge token sequences like > and = into >=
reScanGreaterToken();
var newPrecedence = ts.getBinaryOperatorPrecedence(token());
// Check the precedence to see if we should "take" this operator
// - For left associative operator (all operator but **), consume the operator,
// recursively call the function below, and parse binaryExpression as a rightOperand
// of the caller if the new precedence of the operator is greater then or equal to the current precedence.
// For example:
// a - b - c;
// ^token; leftOperand = b. Return b to the caller as a rightOperand
// a * b - c
// ^token; leftOperand = b. Return b to the caller as a rightOperand
// a - b * c;
// ^token; leftOperand = b. Return b * c to the caller as a rightOperand
// - For right associative operator (**), consume the operator, recursively call the function
// and parse binaryExpression as a rightOperand of the caller if the new precedence of
// the operator is strictly grater than the current precedence
// For example:
// a ** b ** c;
// ^^token; leftOperand = b. Return b ** c to the caller as a rightOperand
// a - b ** c;
// ^^token; leftOperand = b. Return b ** c to the caller as a rightOperand
// a ** b - c
// ^token; leftOperand = b. Return b to the caller as a rightOperand
var consumeCurrentOperator = token() === 42 /* AsteriskAsteriskToken */ ?
newPrecedence >= precedence :
newPrecedence > precedence;
if (!consumeCurrentOperator) {
break;
}
if (token() === 101 /* InKeyword */ && inDisallowInContext()) {
break;
}
if (token() === 127 /* AsKeyword */) {
// Make sure we *do* perform ASI for constructs like this:
// var x = foo
// as (Bar)
// This should be parsed as an initialized variable, followed
// by a function call to 'as' with the argument 'Bar'
if (scanner.hasPrecedingLineBreak()) {
break;
}
else {
nextToken();
leftOperand = makeAsExpression(leftOperand, parseType());
}
}
else {
leftOperand = makeBinaryExpression(leftOperand, parseTokenNode(), parseBinaryExpressionOrHigher(newPrecedence), pos);
}
}
return leftOperand;
}
function isBinaryOperator() {
if (inDisallowInContext() && token() === 101 /* InKeyword */) {
return false;
}
return ts.getBinaryOperatorPrecedence(token()) > 0;
}
function makeBinaryExpression(left, operatorToken, right, pos) {
return finishNode(factory.createBinaryExpression(left, operatorToken, right), pos);
}
function makeAsExpression(left, right) {
return finishNode(factory.createAsExpression(left, right), left.pos);
}
function parsePrefixUnaryExpression() {
var pos = getNodePos();
return finishNode(factory.createPrefixUnaryExpression(token(), nextTokenAnd(parseSimpleUnaryExpression)), pos);
}
function parseDeleteExpression() {
var pos = getNodePos();
return finishNode(factory.createDeleteExpression(nextTokenAnd(parseSimpleUnaryExpression)), pos);
}
function parseTypeOfExpression() {
var pos = getNodePos();
return finishNode(factory.createTypeOfExpression(nextTokenAnd(parseSimpleUnaryExpression)), pos);
}
function parseVoidExpression() {
var pos = getNodePos();
return finishNode(factory.createVoidExpression(nextTokenAnd(parseSimpleUnaryExpression)), pos);
}
function isAwaitExpression() {
if (token() === 131 /* AwaitKeyword */) {
if (inAwaitContext()) {
return true;
}
// here we are using similar heuristics as 'isYieldExpression'
return lookAhead(nextTokenIsIdentifierOrKeywordOrLiteralOnSameLine);
}
return false;
}
function parseAwaitExpression() {
var pos = getNodePos();
return finishNode(factory.createAwaitExpression(nextTokenAnd(parseSimpleUnaryExpression)), pos);
}
/**
* Parse ES7 exponential expression and await expression
*
* ES7 ExponentiationExpression:
* 1) UnaryExpression[?Yield]
* 2) UpdateExpression[?Yield] ** ExponentiationExpression[?Yield]
*
*/
function parseUnaryExpressionOrHigher() {
/**
* ES7 UpdateExpression:
* 1) LeftHandSideExpression[?Yield]
* 2) LeftHandSideExpression[?Yield][no LineTerminator here]++
* 3) LeftHandSideExpression[?Yield][no LineTerminator here]--
* 4) ++UnaryExpression[?Yield]
* 5) --UnaryExpression[?Yield]
*/
if (isUpdateExpression()) {
var pos = getNodePos();
var updateExpression = parseUpdateExpression();
return token() === 42 /* AsteriskAsteriskToken */ ?
parseBinaryExpressionRest(ts.getBinaryOperatorPrecedence(token()), updateExpression, pos) :
updateExpression;
}
/**
* ES7 UnaryExpression:
* 1) UpdateExpression[?yield]
* 2) delete UpdateExpression[?yield]
* 3) void UpdateExpression[?yield]
* 4) typeof UpdateExpression[?yield]
* 5) + UpdateExpression[?yield]
* 6) - UpdateExpression[?yield]
* 7) ~ UpdateExpression[?yield]
* 8) ! UpdateExpression[?yield]
*/
var unaryOperator = token();
var simpleUnaryExpression = parseSimpleUnaryExpression();
if (token() === 42 /* AsteriskAsteriskToken */) {
var pos = ts.skipTrivia(sourceText, simpleUnaryExpression.pos);
var end = simpleUnaryExpression.end;
if (simpleUnaryExpression.kind === 209 /* TypeAssertionExpression */) {
parseErrorAt(pos, end, ts.Diagnostics.A_type_assertion_expression_is_not_allowed_in_the_left_hand_side_of_an_exponentiation_expression_Consider_enclosing_the_expression_in_parentheses);
}
else {
parseErrorAt(pos, end, ts.Diagnostics.An_unary_expression_with_the_0_operator_is_not_allowed_in_the_left_hand_side_of_an_exponentiation_expression_Consider_enclosing_the_expression_in_parentheses, ts.tokenToString(unaryOperator));
}
}
return simpleUnaryExpression;
}
/**
* Parse ES7 simple-unary expression or higher:
*
* ES7 UnaryExpression:
* 1) UpdateExpression[?yield]
* 2) delete UnaryExpression[?yield]
* 3) void UnaryExpression[?yield]
* 4) typeof UnaryExpression[?yield]
* 5) + UnaryExpression[?yield]
* 6) - UnaryExpression[?yield]
* 7) ~ UnaryExpression[?yield]
* 8) ! UnaryExpression[?yield]
* 9) [+Await] await UnaryExpression[?yield]
*/
function parseSimpleUnaryExpression() {
switch (token()) {
case 39 /* PlusToken */:
case 40 /* MinusToken */:
case 54 /* TildeToken */:
case 53 /* ExclamationToken */:
return parsePrefixUnaryExpression();
case 89 /* DeleteKeyword */:
return parseDeleteExpression();
case 112 /* TypeOfKeyword */:
return parseTypeOfExpression();
case 114 /* VoidKeyword */:
return parseVoidExpression();
case 29 /* LessThanToken */:
// This is modified UnaryExpression grammar in TypeScript
// UnaryExpression (modified):
// < type > UnaryExpression
return parseTypeAssertion();
case 131 /* AwaitKeyword */:
if (isAwaitExpression()) {
return parseAwaitExpression();
}
// falls through
default:
return parseUpdateExpression();
}
}
/**
* Check if the current token can possibly be an ES7 increment expression.
*
* ES7 UpdateExpression:
* LeftHandSideExpression[?Yield]
* LeftHandSideExpression[?Yield][no LineTerminator here]++
* LeftHandSideExpression[?Yield][no LineTerminator here]--
* ++LeftHandSideExpression[?Yield]
* --LeftHandSideExpression[?Yield]
*/
function isUpdateExpression() {
// This function is called inside parseUnaryExpression to decide
// whether to call parseSimpleUnaryExpression or call parseUpdateExpression directly
switch (token()) {
case 39 /* PlusToken */:
case 40 /* MinusToken */:
case 54 /* TildeToken */:
case 53 /* ExclamationToken */:
case 89 /* DeleteKeyword */:
case 112 /* TypeOfKeyword */:
case 114 /* VoidKeyword */:
case 131 /* AwaitKeyword */:
return false;
case 29 /* LessThanToken */:
// If we are not in JSX context, we are parsing TypeAssertion which is an UnaryExpression
if (languageVariant !== 1 /* JSX */) {
return false;
}
// We are in JSX context and the token is part of JSXElement.
// falls through
default:
return true;
}
}
/**
* Parse ES7 UpdateExpression. UpdateExpression is used instead of ES6's PostFixExpression.
*
* ES7 UpdateExpression[yield]:
* 1) LeftHandSideExpression[?yield]
* 2) LeftHandSideExpression[?yield] [[no LineTerminator here]]++
* 3) LeftHandSideExpression[?yield] [[no LineTerminator here]]--
* 4) ++LeftHandSideExpression[?yield]
* 5) --LeftHandSideExpression[?yield]
* In TypeScript (2), (3) are parsed as PostfixUnaryExpression. (4), (5) are parsed as PrefixUnaryExpression
*/
function parseUpdateExpression() {
if (token() === 45 /* PlusPlusToken */ || token() === 46 /* MinusMinusToken */) {
var pos = getNodePos();
return finishNode(factory.createPrefixUnaryExpression(token(), nextTokenAnd(parseLeftHandSideExpressionOrHigher)), pos);
}
else if (languageVariant === 1 /* JSX */ && token() === 29 /* LessThanToken */ && lookAhead(nextTokenIsIdentifierOrKeywordOrGreaterThan)) {
// JSXElement is part of primaryExpression
return parseJsxElementOrSelfClosingElementOrFragment(/*inExpressionContext*/ true);
}
var expression = parseLeftHandSideExpressionOrHigher();
ts.Debug.assert(ts.isLeftHandSideExpression(expression));
if ((token() === 45 /* PlusPlusToken */ || token() === 46 /* MinusMinusToken */) && !scanner.hasPrecedingLineBreak()) {
var operator = token();
nextToken();
return finishNode(factory.createPostfixUnaryExpression(expression, operator), expression.pos);
}
return expression;
}
function parseLeftHandSideExpressionOrHigher() {
// Original Ecma:
// LeftHandSideExpression: See 11.2
// NewExpression
// CallExpression
//
// Our simplification:
//
// LeftHandSideExpression: See 11.2
// MemberExpression
// CallExpression
//
// See comment in parseMemberExpressionOrHigher on how we replaced NewExpression with
// MemberExpression to make our lives easier.
//
// to best understand the below code, it's important to see how CallExpression expands
// out into its own productions:
//
// CallExpression:
// MemberExpression Arguments
// CallExpression Arguments
// CallExpression[Expression]
// CallExpression.IdentifierName
// import (AssignmentExpression)
// super Arguments
// super.IdentifierName
//
// Because of the recursion in these calls, we need to bottom out first. There are three
// bottom out states we can run into: 1) We see 'super' which must start either of
// the last two CallExpression productions. 2) We see 'import' which must start import call.
// 3)we have a MemberExpression which either completes the LeftHandSideExpression,
// or starts the beginning of the first four CallExpression productions.
var pos = getNodePos();
var expression;
if (token() === 100 /* ImportKeyword */) {
if (lookAhead(nextTokenIsOpenParenOrLessThan)) {
// We don't want to eagerly consume all import keyword as import call expression so we look ahead to find "("
// For example:
// var foo3 = require("subfolder
// import * as foo1 from "module-from-node
// We want this import to be a statement rather than import call expression
sourceFlags |= 1048576 /* PossiblyContainsDynamicImport */;
expression = parseTokenNode();
}
else if (lookAhead(nextTokenIsDot)) {
// This is an 'import.*' metaproperty (i.e. 'import.meta')
nextToken(); // advance past the 'import'
nextToken(); // advance past the dot
expression = finishNode(factory.createMetaProperty(100 /* ImportKeyword */, parseIdentifierName()), pos);
sourceFlags |= 2097152 /* PossiblyContainsImportMeta */;
}
else {
expression = parseMemberExpressionOrHigher();
}
}
else {
expression = token() === 106 /* SuperKeyword */ ? parseSuperExpression() : parseMemberExpressionOrHigher();
}
// Now, we *may* be complete. However, we might have consumed the start of a
// CallExpression or OptionalExpression. As such, we need to consume the rest
// of it here to be complete.
return parseCallExpressionRest(pos, expression);
}
function parseMemberExpressionOrHigher() {
// Note: to make our lives simpler, we decompose the NewExpression productions and
// place ObjectCreationExpression and FunctionExpression into PrimaryExpression.
// like so:
//
// PrimaryExpression : See 11.1
// this
// Identifier
// Literal
// ArrayLiteral
// ObjectLiteral
// (Expression)
// FunctionExpression
// new MemberExpression Arguments?
//
// MemberExpression : See 11.2
// PrimaryExpression
// MemberExpression[Expression]
// MemberExpression.IdentifierName
//
// CallExpression : See 11.2
// MemberExpression
// CallExpression Arguments
// CallExpression[Expression]
// CallExpression.IdentifierName
//
// Technically this is ambiguous. i.e. CallExpression defines:
//
// CallExpression:
// CallExpression Arguments
//
// If you see: "new Foo()"
//
// Then that could be treated as a single ObjectCreationExpression, or it could be
// treated as the invocation of "new Foo". We disambiguate that in code (to match
// the original grammar) by making sure that if we see an ObjectCreationExpression
// we always consume arguments if they are there. So we treat "new Foo()" as an
// object creation only, and not at all as an invocation. Another way to think
// about this is that for every "new" that we see, we will consume an argument list if
// it is there as part of the *associated* object creation node. Any additional
// argument lists we see, will become invocation expressions.
//
// Because there are no other places in the grammar now that refer to FunctionExpression
// or ObjectCreationExpression, it is safe to push down into the PrimaryExpression
// production.
//
// Because CallExpression and MemberExpression are left recursive, we need to bottom out
// of the recursion immediately. So we parse out a primary expression to start with.
var pos = getNodePos();
var expression = parsePrimaryExpression();
return parseMemberExpressionRest(pos, expression, /*allowOptionalChain*/ true);
}
function parseSuperExpression() {
var pos = getNodePos();
var expression = parseTokenNode();
if (token() === 29 /* LessThanToken */) {
var startPos = getNodePos();
var typeArguments = tryParse(parseTypeArgumentsInExpression);
if (typeArguments !== undefined) {
parseErrorAt(startPos, getNodePos(), ts.Diagnostics.super_may_not_use_type_arguments);
}
}
if (token() === 20 /* OpenParenToken */ || token() === 24 /* DotToken */ || token() === 22 /* OpenBracketToken */) {
return expression;
}
// If we have seen "super" it must be followed by '(' or '.'.
// If it wasn't then just try to parse out a '.' and report an error.
parseExpectedToken(24 /* DotToken */, ts.Diagnostics.super_must_be_followed_by_an_argument_list_or_member_access);
// private names will never work with `super` (`super.#foo`), but that's a semantic error, not syntactic
return finishNode(factory.createPropertyAccessExpression(expression, parseRightSideOfDot(/*allowIdentifierNames*/ true, /*allowPrivateIdentifiers*/ true)), pos);
}
function parseJsxElementOrSelfClosingElementOrFragment(inExpressionContext, topInvalidNodePosition, openingTag) {
var pos = getNodePos();
var opening = parseJsxOpeningOrSelfClosingElementOrOpeningFragment(inExpressionContext);
var result;
if (opening.kind === 278 /* JsxOpeningElement */) {
var children = parseJsxChildren(opening);
var closingElement = void 0;
var lastChild = children[children.length - 1];
if ((lastChild === null || lastChild === void 0 ? void 0 : lastChild.kind) === 276 /* JsxElement */
&& !tagNamesAreEquivalent(lastChild.openingElement.tagName, lastChild.closingElement.tagName)
&& tagNamesAreEquivalent(opening.tagName, lastChild.closingElement.tagName)) {
// when an unclosed JsxOpeningElement incorrectly parses its parent's JsxClosingElement,
// restructure (<div>(...<span></div>)) --> (<div>(...<span></span>)</div>)
// (no need to error; the parent will error)
var end = lastChild.openingElement.end; // newly-created children and closing are both zero-width end/end
var newLast = finishNode(factory.createJsxElement(lastChild.openingElement, createNodeArray([], end, end), finishNode(factory.createJsxClosingElement(finishNode(factory.createIdentifier(""), end, end)), end, end)), lastChild.openingElement.pos, end);
children = createNodeArray(__spreadArray(__spreadArray([], children.slice(0, children.length - 1), true), [newLast], false), children.pos, end);
closingElement = lastChild.closingElement;
}
else {
closingElement = parseJsxClosingElement(opening, inExpressionContext);
if (!tagNamesAreEquivalent(opening.tagName, closingElement.tagName)) {
if (openingTag && ts.isJsxOpeningElement(openingTag) && tagNamesAreEquivalent(closingElement.tagName, openingTag.tagName)) {
// opening incorrectly matched with its parent's closing -- put error on opening
parseErrorAtRange(opening.tagName, ts.Diagnostics.JSX_element_0_has_no_corresponding_closing_tag, ts.getTextOfNodeFromSourceText(sourceText, opening.tagName));
}
else {
// other opening/closing mismatches -- put error on closing
parseErrorAtRange(closingElement.tagName, ts.Diagnostics.Expected_corresponding_JSX_closing_tag_for_0, ts.getTextOfNodeFromSourceText(sourceText, opening.tagName));
}
}
}
result = finishNode(factory.createJsxElement(opening, children, closingElement), pos);
}
else if (opening.kind === 281 /* JsxOpeningFragment */) {
result = finishNode(factory.createJsxFragment(opening, parseJsxChildren(opening), parseJsxClosingFragment(inExpressionContext)), pos);
}
else {
ts.Debug.assert(opening.kind === 277 /* JsxSelfClosingElement */);
// Nothing else to do for self-closing elements
result = opening;
}
// If the user writes the invalid code '<div></div><div></div>' in an expression context (i.e. not wrapped in
// an enclosing tag), we'll naively try to parse ^ this as a 'less than' operator and the remainder of the tag
// as garbage, which will cause the formatter to badly mangle the JSX. Perform a speculative parse of a JSX
// element if we see a < token so that we can wrap it in a synthetic binary expression so the formatter
// does less damage and we can report a better error.
// Since JSX elements are invalid < operands anyway, this lookahead parse will only occur in error scenarios
// of one sort or another.
if (inExpressionContext && token() === 29 /* LessThanToken */) {
var topBadPos_1 = typeof topInvalidNodePosition === "undefined" ? result.pos : topInvalidNodePosition;
var invalidElement = tryParse(function () { return parseJsxElementOrSelfClosingElementOrFragment(/*inExpressionContext*/ true, topBadPos_1); });
if (invalidElement) {
var operatorToken = createMissingNode(27 /* CommaToken */, /*reportAtCurrentPosition*/ false);
ts.setTextRangePosWidth(operatorToken, invalidElement.pos, 0);
parseErrorAt(ts.skipTrivia(sourceText, topBadPos_1), invalidElement.end, ts.Diagnostics.JSX_expressions_must_have_one_parent_element);
return finishNode(factory.createBinaryExpression(result, operatorToken, invalidElement), pos);
}
}
return result;
}
function parseJsxText() {
var pos = getNodePos();
var node = factory.createJsxText(scanner.getTokenValue(), currentToken === 12 /* JsxTextAllWhiteSpaces */);
currentToken = scanner.scanJsxToken();
return finishNode(node, pos);
}
function parseJsxChild(openingTag, token) {
switch (token) {
case 1 /* EndOfFileToken */:
// If we hit EOF, issue the error at the tag that lacks the closing element
// rather than at the end of the file (which is useless)
if (ts.isJsxOpeningFragment(openingTag)) {
parseErrorAtRange(openingTag, ts.Diagnostics.JSX_fragment_has_no_corresponding_closing_tag);
}
else {
// We want the error span to cover only 'Foo.Bar' in < Foo.Bar >
// or to cover only 'Foo' in < Foo >
var tag = openingTag.tagName;
var start = ts.skipTrivia(sourceText, tag.pos);
parseErrorAt(start, tag.end, ts.Diagnostics.JSX_element_0_has_no_corresponding_closing_tag, ts.getTextOfNodeFromSourceText(sourceText, openingTag.tagName));
}
return undefined;
case 30 /* LessThanSlashToken */:
case 7 /* ConflictMarkerTrivia */:
return undefined;
case 11 /* JsxText */:
case 12 /* JsxTextAllWhiteSpaces */:
return parseJsxText();
case 18 /* OpenBraceToken */:
return parseJsxExpression(/*inExpressionContext*/ false);
case 29 /* LessThanToken */:
return parseJsxElementOrSelfClosingElementOrFragment(/*inExpressionContext*/ false, /*topInvalidNodePosition*/ undefined, openingTag);
default:
return ts.Debug.assertNever(token);
}
}
function parseJsxChildren(openingTag) {
var list = [];
var listPos = getNodePos();
var saveParsingContext = parsingContext;
parsingContext |= 1 << 14 /* JsxChildren */;
while (true) {
var child = parseJsxChild(openingTag, currentToken = scanner.reScanJsxToken());
if (!child)
break;
list.push(child);
if (ts.isJsxOpeningElement(openingTag)
&& (child === null || child === void 0 ? void 0 : child.kind) === 276 /* JsxElement */
&& !tagNamesAreEquivalent(child.openingElement.tagName, child.closingElement.tagName)
&& tagNamesAreEquivalent(openingTag.tagName, child.closingElement.tagName)) {
// stop after parsing a mismatched child like <div>...(<span></div>) in order to reattach the </div> higher
break;
}
}
parsingContext = saveParsingContext;
return createNodeArray(list, listPos);
}
function parseJsxAttributes() {
var pos = getNodePos();
return finishNode(factory.createJsxAttributes(parseList(13 /* JsxAttributes */, parseJsxAttribute)), pos);
}
function parseJsxOpeningOrSelfClosingElementOrOpeningFragment(inExpressionContext) {
var pos = getNodePos();
parseExpected(29 /* LessThanToken */);
if (token() === 31 /* GreaterThanToken */) {
// See below for explanation of scanJsxText
scanJsxText();
return finishNode(factory.createJsxOpeningFragment(), pos);
}
var tagName = parseJsxElementName();
var typeArguments = (contextFlags & 131072 /* JavaScriptFile */) === 0 ? tryParseTypeArguments() : undefined;
var attributes = parseJsxAttributes();
var node;
if (token() === 31 /* GreaterThanToken */) {
// Closing tag, so scan the immediately-following text with the JSX scanning instead
// of regular scanning to avoid treating illegal characters (e.g. '#') as immediate
// scanning errors
scanJsxText();
node = factory.createJsxOpeningElement(tagName, typeArguments, attributes);
}
else {
parseExpected(43 /* SlashToken */);
if (parseExpected(31 /* GreaterThanToken */, /*diagnostic*/ undefined, /*shouldAdvance*/ false)) {
// manually advance the scanner in order to look for jsx text inside jsx
if (inExpressionContext) {
nextToken();
}
else {
scanJsxText();
}
}
node = factory.createJsxSelfClosingElement(tagName, typeArguments, attributes);
}
return finishNode(node, pos);
}
function parseJsxElementName() {
var pos = getNodePos();
scanJsxIdentifier();
// JsxElement can have name in the form of
// propertyAccessExpression
// primaryExpression in the form of an identifier and "this" keyword
// We can't just simply use parseLeftHandSideExpressionOrHigher because then we will start consider class,function etc as a keyword
// We only want to consider "this" as a primaryExpression
var expression = token() === 108 /* ThisKeyword */ ?
parseTokenNode() : parseIdentifierName();
while (parseOptional(24 /* DotToken */)) {
expression = finishNode(factory.createPropertyAccessExpression(expression, parseRightSideOfDot(/*allowIdentifierNames*/ true, /*allowPrivateIdentifiers*/ false)), pos);
}
return expression;
}
function parseJsxExpression(inExpressionContext) {
var pos = getNodePos();
if (!parseExpected(18 /* OpenBraceToken */)) {
return undefined;
}
var dotDotDotToken;
var expression;
if (token() !== 19 /* CloseBraceToken */) {
dotDotDotToken = parseOptionalToken(25 /* DotDotDotToken */);
// Only an AssignmentExpression is valid here per the JSX spec,
// but we can unambiguously parse a comma sequence and provide
// a better error message in grammar checking.
expression = parseExpression();
}
if (inExpressionContext) {
parseExpected(19 /* CloseBraceToken */);
}
else {
if (parseExpected(19 /* CloseBraceToken */, /*message*/ undefined, /*shouldAdvance*/ false)) {
scanJsxText();
}
}
return finishNode(factory.createJsxExpression(dotDotDotToken, expression), pos);
}
function parseJsxAttribute() {
if (token() === 18 /* OpenBraceToken */) {
return parseJsxSpreadAttribute();
}
scanJsxIdentifier();
var pos = getNodePos();
return finishNode(factory.createJsxAttribute(parseIdentifierName(), token() !== 63 /* EqualsToken */ ? undefined :
scanJsxAttributeValue() === 10 /* StringLiteral */ ? parseLiteralNode() :
parseJsxExpression(/*inExpressionContext*/ true)), pos);
}
function parseJsxSpreadAttribute() {
var pos = getNodePos();
parseExpected(18 /* OpenBraceToken */);
parseExpected(25 /* DotDotDotToken */);
var expression = parseExpression();
parseExpected(19 /* CloseBraceToken */);
return finishNode(factory.createJsxSpreadAttribute(expression), pos);
}
function parseJsxClosingElement(open, inExpressionContext) {
var pos = getNodePos();
parseExpected(30 /* LessThanSlashToken */);
var tagName = parseJsxElementName();
if (parseExpected(31 /* GreaterThanToken */, /*diagnostic*/ undefined, /*shouldAdvance*/ false)) {
// manually advance the scanner in order to look for jsx text inside jsx
if (inExpressionContext || !tagNamesAreEquivalent(open.tagName, tagName)) {
nextToken();
}
else {
scanJsxText();
}
}
return finishNode(factory.createJsxClosingElement(tagName), pos);
}
function parseJsxClosingFragment(inExpressionContext) {
var pos = getNodePos();
parseExpected(30 /* LessThanSlashToken */);
if (ts.tokenIsIdentifierOrKeyword(token())) {
parseErrorAtRange(parseJsxElementName(), ts.Diagnostics.Expected_corresponding_closing_tag_for_JSX_fragment);
}
if (parseExpected(31 /* GreaterThanToken */, /*diagnostic*/ undefined, /*shouldAdvance*/ false)) {
// manually advance the scanner in order to look for jsx text inside jsx
if (inExpressionContext) {
nextToken();
}
else {
scanJsxText();
}
}
return finishNode(factory.createJsxJsxClosingFragment(), pos);
}
function parseTypeAssertion() {
var pos = getNodePos();
parseExpected(29 /* LessThanToken */);
var type = parseType();
parseExpected(31 /* GreaterThanToken */);
var expression = parseSimpleUnaryExpression();
return finishNode(factory.createTypeAssertion(type, expression), pos);
}
function nextTokenIsIdentifierOrKeywordOrOpenBracketOrTemplate() {
nextToken();
return ts.tokenIsIdentifierOrKeyword(token())
|| token() === 22 /* OpenBracketToken */
|| isTemplateStartOfTaggedTemplate();
}
function isStartOfOptionalPropertyOrElementAccessChain() {
return token() === 28 /* QuestionDotToken */
&& lookAhead(nextTokenIsIdentifierOrKeywordOrOpenBracketOrTemplate);
}
function tryReparseOptionalChain(node) {
if (node.flags & 32 /* OptionalChain */) {
return true;
}
// check for an optional chain in a non-null expression
if (ts.isNonNullExpression(node)) {
var expr = node.expression;
while (ts.isNonNullExpression(expr) && !(expr.flags & 32 /* OptionalChain */)) {
expr = expr.expression;
}
if (expr.flags & 32 /* OptionalChain */) {
// this is part of an optional chain. Walk down from `node` to `expression` and set the flag.
while (ts.isNonNullExpression(node)) {
node.flags |= 32 /* OptionalChain */;
node = node.expression;
}
return true;
}
}
return false;
}
function parsePropertyAccessExpressionRest(pos, expression, questionDotToken) {
var name = parseRightSideOfDot(/*allowIdentifierNames*/ true, /*allowPrivateIdentifiers*/ true);
var isOptionalChain = questionDotToken || tryReparseOptionalChain(expression);
var propertyAccess = isOptionalChain ?
factory.createPropertyAccessChain(expression, questionDotToken, name) :
factory.createPropertyAccessExpression(expression, name);
if (isOptionalChain && ts.isPrivateIdentifier(propertyAccess.name)) {
parseErrorAtRange(propertyAccess.name, ts.Diagnostics.An_optional_chain_cannot_contain_private_identifiers);
}
return finishNode(propertyAccess, pos);
}
function parseElementAccessExpressionRest(pos, expression, questionDotToken) {
var argumentExpression;
if (token() === 23 /* CloseBracketToken */) {
argumentExpression = createMissingNode(79 /* Identifier */, /*reportAtCurrentPosition*/ true, ts.Diagnostics.An_element_access_expression_should_take_an_argument);
}
else {
var argument = allowInAnd(parseExpression);
if (ts.isStringOrNumericLiteralLike(argument)) {
argument.text = internIdentifier(argument.text);
}
argumentExpression = argument;
}
parseExpected(23 /* CloseBracketToken */);
var indexedAccess = questionDotToken || tryReparseOptionalChain(expression) ?
factory.createElementAccessChain(expression, questionDotToken, argumentExpression) :
factory.createElementAccessExpression(expression, argumentExpression);
return finishNode(indexedAccess, pos);
}
function parseMemberExpressionRest(pos, expression, allowOptionalChain) {
while (true) {
var questionDotToken = void 0;
var isPropertyAccess = false;
if (allowOptionalChain && isStartOfOptionalPropertyOrElementAccessChain()) {
questionDotToken = parseExpectedToken(28 /* QuestionDotToken */);
isPropertyAccess = ts.tokenIsIdentifierOrKeyword(token());
}
else {
isPropertyAccess = parseOptional(24 /* DotToken */);
}
if (isPropertyAccess) {
expression = parsePropertyAccessExpressionRest(pos, expression, questionDotToken);
continue;
}
if (!questionDotToken && token() === 53 /* ExclamationToken */ && !scanner.hasPrecedingLineBreak()) {
nextToken();
expression = finishNode(factory.createNonNullExpression(expression), pos);
continue;
}
// when in the [Decorator] context, we do not parse ElementAccess as it could be part of a ComputedPropertyName
if ((questionDotToken || !inDecoratorContext()) && parseOptional(22 /* OpenBracketToken */)) {
expression = parseElementAccessExpressionRest(pos, expression, questionDotToken);
continue;
}
if (isTemplateStartOfTaggedTemplate()) {
expression = parseTaggedTemplateRest(pos, expression, questionDotToken, /*typeArguments*/ undefined);
continue;
}
return expression;
}
}
function isTemplateStartOfTaggedTemplate() {
return token() === 14 /* NoSubstitutionTemplateLiteral */ || token() === 15 /* TemplateHead */;
}
function parseTaggedTemplateRest(pos, tag, questionDotToken, typeArguments) {
var tagExpression = factory.createTaggedTemplateExpression(tag, typeArguments, token() === 14 /* NoSubstitutionTemplateLiteral */ ?
(reScanTemplateHeadOrNoSubstitutionTemplate(), parseLiteralNode()) :
parseTemplateExpression(/*isTaggedTemplate*/ true));
if (questionDotToken || tag.flags & 32 /* OptionalChain */) {
tagExpression.flags |= 32 /* OptionalChain */;
}
tagExpression.questionDotToken = questionDotToken;
return finishNode(tagExpression, pos);
}
function parseCallExpressionRest(pos, expression) {
while (true) {
expression = parseMemberExpressionRest(pos, expression, /*allowOptionalChain*/ true);
var questionDotToken = parseOptionalToken(28 /* QuestionDotToken */);
// handle 'foo<<T>()'
// parse template arguments only in TypeScript files (not in JavaScript files).
if ((contextFlags & 131072 /* JavaScriptFile */) === 0 && (token() === 29 /* LessThanToken */ || token() === 47 /* LessThanLessThanToken */)) {
// See if this is the start of a generic invocation. If so, consume it and
// keep checking for postfix expressions. Otherwise, it's just a '<' that's
// part of an arithmetic expression. Break out so we consume it higher in the
// stack.
var typeArguments = tryParse(parseTypeArgumentsInExpression);
if (typeArguments) {
if (isTemplateStartOfTaggedTemplate()) {
expression = parseTaggedTemplateRest(pos, expression, questionDotToken, typeArguments);
continue;
}
var argumentList = parseArgumentList();
var callExpr = questionDotToken || tryReparseOptionalChain(expression) ?
factory.createCallChain(expression, questionDotToken, typeArguments, argumentList) :
factory.createCallExpression(expression, typeArguments, argumentList);
expression = finishNode(callExpr, pos);
continue;
}
}
else if (token() === 20 /* OpenParenToken */) {
var argumentList = parseArgumentList();
var callExpr = questionDotToken || tryReparseOptionalChain(expression) ?
factory.createCallChain(expression, questionDotToken, /*typeArguments*/ undefined, argumentList) :
factory.createCallExpression(expression, /*typeArguments*/ undefined, argumentList);
expression = finishNode(callExpr, pos);
continue;
}
if (questionDotToken) {
// We failed to parse anything, so report a missing identifier here.
var name = createMissingNode(79 /* Identifier */, /*reportAtCurrentPosition*/ false, ts.Diagnostics.Identifier_expected);
expression = finishNode(factory.createPropertyAccessChain(expression, questionDotToken, name), pos);
}
break;
}
return expression;
}
function parseArgumentList() {
parseExpected(20 /* OpenParenToken */);
var result = parseDelimitedList(11 /* ArgumentExpressions */, parseArgumentExpression);
parseExpected(21 /* CloseParenToken */);
return result;
}
function parseTypeArgumentsInExpression() {
if ((contextFlags & 131072 /* JavaScriptFile */) !== 0) {
// TypeArguments must not be parsed in JavaScript files to avoid ambiguity with binary operators.
return undefined;
}
if (reScanLessThanToken() !== 29 /* LessThanToken */) {
return undefined;
}
nextToken();
var typeArguments = parseDelimitedList(20 /* TypeArguments */, parseType);
if (!parseExpected(31 /* GreaterThanToken */)) {
// If it doesn't have the closing `>` then it's definitely not an type argument list.
return undefined;
}
// If we have a '<', then only parse this as a argument list if the type arguments
// are complete and we have an open paren. if we don't, rewind and return nothing.
return typeArguments && canFollowTypeArgumentsInExpression()
? typeArguments
: undefined;
}
function canFollowTypeArgumentsInExpression() {
switch (token()) {
case 20 /* OpenParenToken */: // foo<x>(
case 14 /* NoSubstitutionTemplateLiteral */: // foo<T> `...`
case 15 /* TemplateHead */: // foo<T> `...${100}...`
// these are the only tokens can legally follow a type argument
// list. So we definitely want to treat them as type arg lists.
// falls through
case 24 /* DotToken */: // foo<x>.
case 21 /* CloseParenToken */: // foo<x>)
case 23 /* CloseBracketToken */: // foo<x>]
case 58 /* ColonToken */: // foo<x>:
case 26 /* SemicolonToken */: // foo<x>;
case 57 /* QuestionToken */: // foo<x>?
case 34 /* EqualsEqualsToken */: // foo<x> ==
case 36 /* EqualsEqualsEqualsToken */: // foo<x> ===
case 35 /* ExclamationEqualsToken */: // foo<x> !=
case 37 /* ExclamationEqualsEqualsToken */: // foo<x> !==
case 55 /* AmpersandAmpersandToken */: // foo<x> &&
case 56 /* BarBarToken */: // foo<x> ||
case 60 /* QuestionQuestionToken */: // foo<x> ??
case 52 /* CaretToken */: // foo<x> ^
case 50 /* AmpersandToken */: // foo<x> &
case 51 /* BarToken */: // foo<x> |
case 19 /* CloseBraceToken */: // foo<x> }
case 1 /* EndOfFileToken */: // foo<x>
// these cases can't legally follow a type arg list. However, they're not legal
// expressions either. The user is probably in the middle of a generic type. So
// treat it as such.
return true;
case 27 /* CommaToken */: // foo<x>,
case 18 /* OpenBraceToken */: // foo<x> {
// We don't want to treat these as type arguments. Otherwise we'll parse this
// as an invocation expression. Instead, we want to parse out the expression
// in isolation from the type arguments.
// falls through
default:
// Anything else treat as an expression.
return false;
}
}
function parsePrimaryExpression() {
switch (token()) {
case 8 /* NumericLiteral */:
case 9 /* BigIntLiteral */:
case 10 /* StringLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
return parseLiteralNode();
case 108 /* ThisKeyword */:
case 106 /* SuperKeyword */:
case 104 /* NullKeyword */:
case 110 /* TrueKeyword */:
case 95 /* FalseKeyword */:
return parseTokenNode();
case 20 /* OpenParenToken */:
return parseParenthesizedExpression();
case 22 /* OpenBracketToken */:
return parseArrayLiteralExpression();
case 18 /* OpenBraceToken */:
return parseObjectLiteralExpression();
case 130 /* AsyncKeyword */:
// Async arrow functions are parsed earlier in parseAssignmentExpressionOrHigher.
// If we encounter `async [no LineTerminator here] function` then this is an async
// function; otherwise, its an identifier.
if (!lookAhead(nextTokenIsFunctionKeywordOnSameLine)) {
break;
}
return parseFunctionExpression();
case 84 /* ClassKeyword */:
return parseClassExpression();
case 98 /* FunctionKeyword */:
return parseFunctionExpression();
case 103 /* NewKeyword */:
return parseNewExpressionOrNewDotTarget();
case 43 /* SlashToken */:
case 68 /* SlashEqualsToken */:
if (reScanSlashToken() === 13 /* RegularExpressionLiteral */) {
return parseLiteralNode();
}
break;
case 15 /* TemplateHead */:
return parseTemplateExpression(/* isTaggedTemplate */ false);
}
return parseIdentifier(ts.Diagnostics.Expression_expected);
}
function parseParenthesizedExpression() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
parseExpected(20 /* OpenParenToken */);
var expression = allowInAnd(parseExpression);
parseExpected(21 /* CloseParenToken */);
return withJSDoc(finishNode(factory.createParenthesizedExpression(expression), pos), hasJSDoc);
}
function parseSpreadElement() {
var pos = getNodePos();
parseExpected(25 /* DotDotDotToken */);
var expression = parseAssignmentExpressionOrHigher();
return finishNode(factory.createSpreadElement(expression), pos);
}
function parseArgumentOrArrayLiteralElement() {
return token() === 25 /* DotDotDotToken */ ? parseSpreadElement() :
token() === 27 /* CommaToken */ ? finishNode(factory.createOmittedExpression(), getNodePos()) :
parseAssignmentExpressionOrHigher();
}
function parseArgumentExpression() {
return doOutsideOfContext(disallowInAndDecoratorContext, parseArgumentOrArrayLiteralElement);
}
function parseArrayLiteralExpression() {
var pos = getNodePos();
parseExpected(22 /* OpenBracketToken */);
var multiLine = scanner.hasPrecedingLineBreak();
var elements = parseDelimitedList(15 /* ArrayLiteralMembers */, parseArgumentOrArrayLiteralElement);
parseExpected(23 /* CloseBracketToken */);
return finishNode(factory.createArrayLiteralExpression(elements, multiLine), pos);
}
function parseObjectLiteralElement() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
if (parseOptionalToken(25 /* DotDotDotToken */)) {
var expression = parseAssignmentExpressionOrHigher();
return withJSDoc(finishNode(factory.createSpreadAssignment(expression), pos), hasJSDoc);
}
var decorators = parseDecorators();
var modifiers = parseModifiers();
if (parseContextualModifier(135 /* GetKeyword */)) {
return parseAccessorDeclaration(pos, hasJSDoc, decorators, modifiers, 170 /* GetAccessor */);
}
if (parseContextualModifier(147 /* SetKeyword */)) {
return parseAccessorDeclaration(pos, hasJSDoc, decorators, modifiers, 171 /* SetAccessor */);
}
var asteriskToken = parseOptionalToken(41 /* AsteriskToken */);
var tokenIsIdentifier = isIdentifier();
var name = parsePropertyName();
// Disallowing of optional property assignments and definite assignment assertion happens in the grammar checker.
var questionToken = parseOptionalToken(57 /* QuestionToken */);
var exclamationToken = parseOptionalToken(53 /* ExclamationToken */);
if (asteriskToken || token() === 20 /* OpenParenToken */ || token() === 29 /* LessThanToken */) {
return parseMethodDeclaration(pos, hasJSDoc, decorators, modifiers, asteriskToken, name, questionToken, exclamationToken);
}
// check if it is short-hand property assignment or normal property assignment
// NOTE: if token is EqualsToken it is interpreted as CoverInitializedName production
// CoverInitializedName[Yield] :
// IdentifierReference[?Yield] Initializer[In, ?Yield]
// this is necessary because ObjectLiteral productions are also used to cover grammar for ObjectAssignmentPattern
var node;
var isShorthandPropertyAssignment = tokenIsIdentifier && (token() !== 58 /* ColonToken */);
if (isShorthandPropertyAssignment) {
var equalsToken = parseOptionalToken(63 /* EqualsToken */);
var objectAssignmentInitializer = equalsToken ? allowInAnd(parseAssignmentExpressionOrHigher) : undefined;
node = factory.createShorthandPropertyAssignment(name, objectAssignmentInitializer);
// Save equals token for error reporting.
// TODO(rbuckton): Consider manufacturing this when we need to report an error as it is otherwise not useful.
node.equalsToken = equalsToken;
}
else {
parseExpected(58 /* ColonToken */);
var initializer = allowInAnd(parseAssignmentExpressionOrHigher);
node = factory.createPropertyAssignment(name, initializer);
}
// Decorators, Modifiers, questionToken, and exclamationToken are not supported by property assignments and are reported in the grammar checker
node.decorators = decorators;
node.modifiers = modifiers;
node.questionToken = questionToken;
node.exclamationToken = exclamationToken;
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseObjectLiteralExpression() {
var pos = getNodePos();
var openBracePosition = scanner.getTokenPos();
parseExpected(18 /* OpenBraceToken */);
var multiLine = scanner.hasPrecedingLineBreak();
var properties = parseDelimitedList(12 /* ObjectLiteralMembers */, parseObjectLiteralElement, /*considerSemicolonAsDelimiter*/ true);
if (!parseExpected(19 /* CloseBraceToken */)) {
var lastError = ts.lastOrUndefined(parseDiagnostics);
if (lastError && lastError.code === ts.Diagnostics._0_expected.code) {
ts.addRelatedInfo(lastError, ts.createDetachedDiagnostic(fileName, openBracePosition, 1, ts.Diagnostics.The_parser_expected_to_find_a_to_match_the_token_here));
}
}
return finishNode(factory.createObjectLiteralExpression(properties, multiLine), pos);
}
function parseFunctionExpression() {
// GeneratorExpression:
// function* BindingIdentifier [Yield][opt](FormalParameters[Yield]){ GeneratorBody }
//
// FunctionExpression:
// function BindingIdentifier[opt](FormalParameters){ FunctionBody }
var savedDecoratorContext = inDecoratorContext();
setDecoratorContext(/*val*/ false);
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
var modifiers = parseModifiers();
parseExpected(98 /* FunctionKeyword */);
var asteriskToken = parseOptionalToken(41 /* AsteriskToken */);
var isGenerator = asteriskToken ? 1 /* Yield */ : 0 /* None */;
var isAsync = ts.some(modifiers, ts.isAsyncModifier) ? 2 /* Await */ : 0 /* None */;
var name = isGenerator && isAsync ? doInYieldAndAwaitContext(parseOptionalBindingIdentifier) :
isGenerator ? doInYieldContext(parseOptionalBindingIdentifier) :
isAsync ? doInAwaitContext(parseOptionalBindingIdentifier) :
parseOptionalBindingIdentifier();
var typeParameters = parseTypeParameters();
var parameters = parseParameters(isGenerator | isAsync);
var type = parseReturnType(58 /* ColonToken */, /*isType*/ false);
var body = parseFunctionBlock(isGenerator | isAsync);
setDecoratorContext(savedDecoratorContext);
var node = factory.createFunctionExpression(modifiers, asteriskToken, name, typeParameters, parameters, type, body);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseOptionalBindingIdentifier() {
return isBindingIdentifier() ? parseBindingIdentifier() : undefined;
}
function parseNewExpressionOrNewDotTarget() {
var pos = getNodePos();
parseExpected(103 /* NewKeyword */);
if (parseOptional(24 /* DotToken */)) {
var name = parseIdentifierName();
return finishNode(factory.createMetaProperty(103 /* NewKeyword */, name), pos);
}
var expressionPos = getNodePos();
var expression = parsePrimaryExpression();
var typeArguments;
while (true) {
expression = parseMemberExpressionRest(expressionPos, expression, /*allowOptionalChain*/ false);
typeArguments = tryParse(parseTypeArgumentsInExpression);
if (isTemplateStartOfTaggedTemplate()) {
ts.Debug.assert(!!typeArguments, "Expected a type argument list; all plain tagged template starts should be consumed in 'parseMemberExpressionRest'");
expression = parseTaggedTemplateRest(expressionPos, expression, /*optionalChain*/ undefined, typeArguments);
typeArguments = undefined;
}
break;
}
var argumentsArray;
if (token() === 20 /* OpenParenToken */) {
argumentsArray = parseArgumentList();
}
else if (typeArguments) {
parseErrorAt(pos, scanner.getStartPos(), ts.Diagnostics.A_new_expression_with_type_arguments_must_always_be_followed_by_a_parenthesized_argument_list);
}
return finishNode(factory.createNewExpression(expression, typeArguments, argumentsArray), pos);
}
// STATEMENTS
function parseBlock(ignoreMissingOpenBrace, diagnosticMessage) {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
var openBracePosition = scanner.getTokenPos();
if (parseExpected(18 /* OpenBraceToken */, diagnosticMessage) || ignoreMissingOpenBrace) {
var multiLine = scanner.hasPrecedingLineBreak();
var statements = parseList(1 /* BlockStatements */, parseStatement);
if (!parseExpected(19 /* CloseBraceToken */)) {
var lastError = ts.lastOrUndefined(parseDiagnostics);
if (lastError && lastError.code === ts.Diagnostics._0_expected.code) {
ts.addRelatedInfo(lastError, ts.createDetachedDiagnostic(fileName, openBracePosition, 1, ts.Diagnostics.The_parser_expected_to_find_a_to_match_the_token_here));
}
}
var result = withJSDoc(finishNode(factory.createBlock(statements, multiLine), pos), hasJSDoc);
if (token() === 63 /* EqualsToken */) {
parseErrorAtCurrentToken(ts.Diagnostics.Declaration_or_statement_expected_This_follows_a_block_of_statements_so_if_you_intended_to_write_a_destructuring_assignment_you_might_need_to_wrap_the_the_whole_assignment_in_parentheses);
nextToken();
}
return result;
}
else {
var statements = createMissingList();
return withJSDoc(finishNode(factory.createBlock(statements, /*multiLine*/ undefined), pos), hasJSDoc);
}
}
function parseFunctionBlock(flags, diagnosticMessage) {
var savedYieldContext = inYieldContext();
setYieldContext(!!(flags & 1 /* Yield */));
var savedAwaitContext = inAwaitContext();
setAwaitContext(!!(flags & 2 /* Await */));
var savedTopLevel = topLevel;
topLevel = false;
// We may be in a [Decorator] context when parsing a function expression or
// arrow function. The body of the function is not in [Decorator] context.
var saveDecoratorContext = inDecoratorContext();
if (saveDecoratorContext) {
setDecoratorContext(/*val*/ false);
}
var block = parseBlock(!!(flags & 16 /* IgnoreMissingOpenBrace */), diagnosticMessage);
if (saveDecoratorContext) {
setDecoratorContext(/*val*/ true);
}
topLevel = savedTopLevel;
setYieldContext(savedYieldContext);
setAwaitContext(savedAwaitContext);
return block;
}
function parseEmptyStatement() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
parseExpected(26 /* SemicolonToken */);
return withJSDoc(finishNode(factory.createEmptyStatement(), pos), hasJSDoc);
}
function parseIfStatement() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
parseExpected(99 /* IfKeyword */);
parseExpected(20 /* OpenParenToken */);
var expression = allowInAnd(parseExpression);
parseExpected(21 /* CloseParenToken */);
var thenStatement = parseStatement();
var elseStatement = parseOptional(91 /* ElseKeyword */) ? parseStatement() : undefined;
return withJSDoc(finishNode(factory.createIfStatement(expression, thenStatement, elseStatement), pos), hasJSDoc);
}
function parseDoStatement() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
parseExpected(90 /* DoKeyword */);
var statement = parseStatement();
parseExpected(115 /* WhileKeyword */);
parseExpected(20 /* OpenParenToken */);
var expression = allowInAnd(parseExpression);
parseExpected(21 /* CloseParenToken */);
// From: https://mail.mozilla.org/pipermail/es-discuss/2011-August/016188.html
// 157 min --- All allen at wirfs-brock.com CONF --- "do{;}while(false)false" prohibited in
// spec but allowed in consensus reality. Approved -- this is the de-facto standard whereby
// do;while(0)x will have a semicolon inserted before x.
parseOptional(26 /* SemicolonToken */);
return withJSDoc(finishNode(factory.createDoStatement(statement, expression), pos), hasJSDoc);
}
function parseWhileStatement() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
parseExpected(115 /* WhileKeyword */);
parseExpected(20 /* OpenParenToken */);
var expression = allowInAnd(parseExpression);
parseExpected(21 /* CloseParenToken */);
var statement = parseStatement();
return withJSDoc(finishNode(factory.createWhileStatement(expression, statement), pos), hasJSDoc);
}
function parseForOrForInOrForOfStatement() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
parseExpected(97 /* ForKeyword */);
var awaitToken = parseOptionalToken(131 /* AwaitKeyword */);
parseExpected(20 /* OpenParenToken */);
var initializer;
if (token() !== 26 /* SemicolonToken */) {
if (token() === 113 /* VarKeyword */ || token() === 119 /* LetKeyword */ || token() === 85 /* ConstKeyword */) {
initializer = parseVariableDeclarationList(/*inForStatementInitializer*/ true);
}
else {
initializer = disallowInAnd(parseExpression);
}
}
var node;
if (awaitToken ? parseExpected(158 /* OfKeyword */) : parseOptional(158 /* OfKeyword */)) {
var expression = allowInAnd(parseAssignmentExpressionOrHigher);
parseExpected(21 /* CloseParenToken */);
node = factory.createForOfStatement(awaitToken, initializer, expression, parseStatement());
}
else if (parseOptional(101 /* InKeyword */)) {
var expression = allowInAnd(parseExpression);
parseExpected(21 /* CloseParenToken */);
node = factory.createForInStatement(initializer, expression, parseStatement());
}
else {
parseExpected(26 /* SemicolonToken */);
var condition = token() !== 26 /* SemicolonToken */ && token() !== 21 /* CloseParenToken */
? allowInAnd(parseExpression)
: undefined;
parseExpected(26 /* SemicolonToken */);
var incrementor = token() !== 21 /* CloseParenToken */
? allowInAnd(parseExpression)
: undefined;
parseExpected(21 /* CloseParenToken */);
node = factory.createForStatement(initializer, condition, incrementor, parseStatement());
}
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseBreakOrContinueStatement(kind) {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
parseExpected(kind === 244 /* BreakStatement */ ? 81 /* BreakKeyword */ : 86 /* ContinueKeyword */);
var label = canParseSemicolon() ? undefined : parseIdentifier();
parseSemicolon();
var node = kind === 244 /* BreakStatement */
? factory.createBreakStatement(label)
: factory.createContinueStatement(label);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseReturnStatement() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
parseExpected(105 /* ReturnKeyword */);
var expression = canParseSemicolon() ? undefined : allowInAnd(parseExpression);
parseSemicolon();
return withJSDoc(finishNode(factory.createReturnStatement(expression), pos), hasJSDoc);
}
function parseWithStatement() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
parseExpected(116 /* WithKeyword */);
parseExpected(20 /* OpenParenToken */);
var expression = allowInAnd(parseExpression);
parseExpected(21 /* CloseParenToken */);
var statement = doInsideOfContext(16777216 /* InWithStatement */, parseStatement);
return withJSDoc(finishNode(factory.createWithStatement(expression, statement), pos), hasJSDoc);
}
function parseCaseClause() {
var pos = getNodePos();
parseExpected(82 /* CaseKeyword */);
var expression = allowInAnd(parseExpression);
parseExpected(58 /* ColonToken */);
var statements = parseList(3 /* SwitchClauseStatements */, parseStatement);
return finishNode(factory.createCaseClause(expression, statements), pos);
}
function parseDefaultClause() {
var pos = getNodePos();
parseExpected(88 /* DefaultKeyword */);
parseExpected(58 /* ColonToken */);
var statements = parseList(3 /* SwitchClauseStatements */, parseStatement);
return finishNode(factory.createDefaultClause(statements), pos);
}
function parseCaseOrDefaultClause() {
return token() === 82 /* CaseKeyword */ ? parseCaseClause() : parseDefaultClause();
}
function parseCaseBlock() {
var pos = getNodePos();
parseExpected(18 /* OpenBraceToken */);
var clauses = parseList(2 /* SwitchClauses */, parseCaseOrDefaultClause);
parseExpected(19 /* CloseBraceToken */);
return finishNode(factory.createCaseBlock(clauses), pos);
}
function parseSwitchStatement() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
parseExpected(107 /* SwitchKeyword */);
parseExpected(20 /* OpenParenToken */);
var expression = allowInAnd(parseExpression);
parseExpected(21 /* CloseParenToken */);
var caseBlock = parseCaseBlock();
return withJSDoc(finishNode(factory.createSwitchStatement(expression, caseBlock), pos), hasJSDoc);
}
function parseThrowStatement() {
// ThrowStatement[Yield] :
// throw [no LineTerminator here]Expression[In, ?Yield];
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
parseExpected(109 /* ThrowKeyword */);
// Because of automatic semicolon insertion, we need to report error if this
// throw could be terminated with a semicolon. Note: we can't call 'parseExpression'
// directly as that might consume an expression on the following line.
// Instead, we create a "missing" identifier, but don't report an error. The actual error
// will be reported in the grammar walker.
var expression = scanner.hasPrecedingLineBreak() ? undefined : allowInAnd(parseExpression);
if (expression === undefined) {
identifierCount++;
expression = finishNode(factory.createIdentifier(""), getNodePos());
}
if (!tryParseSemicolon()) {
parseErrorForMissingSemicolonAfter(expression);
}
return withJSDoc(finishNode(factory.createThrowStatement(expression), pos), hasJSDoc);
}
// TODO: Review for error recovery
function parseTryStatement() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
parseExpected(111 /* TryKeyword */);
var tryBlock = parseBlock(/*ignoreMissingOpenBrace*/ false);
var catchClause = token() === 83 /* CatchKeyword */ ? parseCatchClause() : undefined;
// If we don't have a catch clause, then we must have a finally clause. Try to parse
// one out no matter what.
var finallyBlock;
if (!catchClause || token() === 96 /* FinallyKeyword */) {
parseExpected(96 /* FinallyKeyword */);
finallyBlock = parseBlock(/*ignoreMissingOpenBrace*/ false);
}
return withJSDoc(finishNode(factory.createTryStatement(tryBlock, catchClause, finallyBlock), pos), hasJSDoc);
}
function parseCatchClause() {
var pos = getNodePos();
parseExpected(83 /* CatchKeyword */);
var variableDeclaration;
if (parseOptional(20 /* OpenParenToken */)) {
variableDeclaration = parseVariableDeclaration();
parseExpected(21 /* CloseParenToken */);
}
else {
// Keep shape of node to avoid degrading performance.
variableDeclaration = undefined;
}
var block = parseBlock(/*ignoreMissingOpenBrace*/ false);
return finishNode(factory.createCatchClause(variableDeclaration, block), pos);
}
function parseDebuggerStatement() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
parseExpected(87 /* DebuggerKeyword */);
parseSemicolon();
return withJSDoc(finishNode(factory.createDebuggerStatement(), pos), hasJSDoc);
}
function parseExpressionOrLabeledStatement() {
// Avoiding having to do the lookahead for a labeled statement by just trying to parse
// out an expression, seeing if it is identifier and then seeing if it is followed by
// a colon.
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
var node;
var hasParen = token() === 20 /* OpenParenToken */;
var expression = allowInAnd(parseExpression);
if (ts.isIdentifier(expression) && parseOptional(58 /* ColonToken */)) {
node = factory.createLabeledStatement(expression, parseStatement());
}
else {
if (!tryParseSemicolon()) {
parseErrorForMissingSemicolonAfter(expression);
}
node = factory.createExpressionStatement(expression);
if (hasParen) {
// do not parse the same jsdoc twice
hasJSDoc = false;
}
}
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function nextTokenIsIdentifierOrKeywordOnSameLine() {
nextToken();
return ts.tokenIsIdentifierOrKeyword(token()) && !scanner.hasPrecedingLineBreak();
}
function nextTokenIsClassKeywordOnSameLine() {
nextToken();
return token() === 84 /* ClassKeyword */ && !scanner.hasPrecedingLineBreak();
}
function nextTokenIsFunctionKeywordOnSameLine() {
nextToken();
return token() === 98 /* FunctionKeyword */ && !scanner.hasPrecedingLineBreak();
}
function nextTokenIsIdentifierOrKeywordOrLiteralOnSameLine() {
nextToken();
return (ts.tokenIsIdentifierOrKeyword(token()) || token() === 8 /* NumericLiteral */ || token() === 9 /* BigIntLiteral */ || token() === 10 /* StringLiteral */) && !scanner.hasPrecedingLineBreak();
}
function isDeclaration() {
while (true) {
switch (token()) {
case 113 /* VarKeyword */:
case 119 /* LetKeyword */:
case 85 /* ConstKeyword */:
case 98 /* FunctionKeyword */:
case 84 /* ClassKeyword */:
case 92 /* EnumKeyword */:
return true;
// 'declare', 'module', 'namespace', 'interface'* and 'type' are all legal JavaScript identifiers;
// however, an identifier cannot be followed by another identifier on the same line. This is what we
// count on to parse out the respective declarations. For instance, we exploit this to say that
//
// namespace n
//
// can be none other than the beginning of a namespace declaration, but need to respect that JavaScript sees
//
// namespace
// n
//
// as the identifier 'namespace' on one line followed by the identifier 'n' on another.
// We need to look one token ahead to see if it permissible to try parsing a declaration.
//
// *Note*: 'interface' is actually a strict mode reserved word. So while
//
// "use strict"
// interface
// I {}
//
// could be legal, it would add complexity for very little gain.
case 118 /* InterfaceKeyword */:
case 150 /* TypeKeyword */:
return nextTokenIsIdentifierOnSameLine();
case 140 /* ModuleKeyword */:
case 141 /* NamespaceKeyword */:
return nextTokenIsIdentifierOrStringLiteralOnSameLine();
case 126 /* AbstractKeyword */:
case 130 /* AsyncKeyword */:
case 134 /* DeclareKeyword */:
case 121 /* PrivateKeyword */:
case 122 /* ProtectedKeyword */:
case 123 /* PublicKeyword */:
case 143 /* ReadonlyKeyword */:
nextToken();
// ASI takes effect for this modifier.
if (scanner.hasPrecedingLineBreak()) {
return false;
}
continue;
case 155 /* GlobalKeyword */:
nextToken();
return token() === 18 /* OpenBraceToken */ || token() === 79 /* Identifier */ || token() === 93 /* ExportKeyword */;
case 100 /* ImportKeyword */:
nextToken();
return token() === 10 /* StringLiteral */ || token() === 41 /* AsteriskToken */ ||
token() === 18 /* OpenBraceToken */ || ts.tokenIsIdentifierOrKeyword(token());
case 93 /* ExportKeyword */:
var currentToken_1 = nextToken();
if (currentToken_1 === 150 /* TypeKeyword */) {
currentToken_1 = lookAhead(nextToken);
}
if (currentToken_1 === 63 /* EqualsToken */ || currentToken_1 === 41 /* AsteriskToken */ ||
currentToken_1 === 18 /* OpenBraceToken */ || currentToken_1 === 88 /* DefaultKeyword */ ||
currentToken_1 === 127 /* AsKeyword */) {
return true;
}
continue;
case 124 /* StaticKeyword */:
nextToken();
continue;
default:
return false;
}
}
}
function isStartOfDeclaration() {
return lookAhead(isDeclaration);
}
function isStartOfStatement() {
switch (token()) {
case 59 /* AtToken */:
case 26 /* SemicolonToken */:
case 18 /* OpenBraceToken */:
case 113 /* VarKeyword */:
case 119 /* LetKeyword */:
case 98 /* FunctionKeyword */:
case 84 /* ClassKeyword */:
case 92 /* EnumKeyword */:
case 99 /* IfKeyword */:
case 90 /* DoKeyword */:
case 115 /* WhileKeyword */:
case 97 /* ForKeyword */:
case 86 /* ContinueKeyword */:
case 81 /* BreakKeyword */:
case 105 /* ReturnKeyword */:
case 116 /* WithKeyword */:
case 107 /* SwitchKeyword */:
case 109 /* ThrowKeyword */:
case 111 /* TryKeyword */:
case 87 /* DebuggerKeyword */:
// 'catch' and 'finally' do not actually indicate that the code is part of a statement,
// however, we say they are here so that we may gracefully parse them and error later.
// falls through
case 83 /* CatchKeyword */:
case 96 /* FinallyKeyword */:
return true;
case 100 /* ImportKeyword */:
return isStartOfDeclaration() || lookAhead(nextTokenIsOpenParenOrLessThanOrDot);
case 85 /* ConstKeyword */:
case 93 /* ExportKeyword */:
return isStartOfDeclaration();
case 130 /* AsyncKeyword */:
case 134 /* DeclareKeyword */:
case 118 /* InterfaceKeyword */:
case 140 /* ModuleKeyword */:
case 141 /* NamespaceKeyword */:
case 150 /* TypeKeyword */:
case 155 /* GlobalKeyword */:
// When these don't start a declaration, they're an identifier in an expression statement
return true;
case 123 /* PublicKeyword */:
case 121 /* PrivateKeyword */:
case 122 /* ProtectedKeyword */:
case 124 /* StaticKeyword */:
case 143 /* ReadonlyKeyword */:
// When these don't start a declaration, they may be the start of a class member if an identifier
// immediately follows. Otherwise they're an identifier in an expression statement.
return isStartOfDeclaration() || !lookAhead(nextTokenIsIdentifierOrKeywordOnSameLine);
default:
return isStartOfExpression();
}
}
function nextTokenIsBindingIdentifierOrStartOfDestructuring() {
nextToken();
return isBindingIdentifier() || token() === 18 /* OpenBraceToken */ || token() === 22 /* OpenBracketToken */;
}
function isLetDeclaration() {
// In ES6 'let' always starts a lexical declaration if followed by an identifier or {
// or [.
return lookAhead(nextTokenIsBindingIdentifierOrStartOfDestructuring);
}
function parseStatement() {
switch (token()) {
case 26 /* SemicolonToken */:
return parseEmptyStatement();
case 18 /* OpenBraceToken */:
return parseBlock(/*ignoreMissingOpenBrace*/ false);
case 113 /* VarKeyword */:
return parseVariableStatement(getNodePos(), hasPrecedingJSDocComment(), /*decorators*/ undefined, /*modifiers*/ undefined);
case 119 /* LetKeyword */:
if (isLetDeclaration()) {
return parseVariableStatement(getNodePos(), hasPrecedingJSDocComment(), /*decorators*/ undefined, /*modifiers*/ undefined);
}
break;
case 98 /* FunctionKeyword */:
return parseFunctionDeclaration(getNodePos(), hasPrecedingJSDocComment(), /*decorators*/ undefined, /*modifiers*/ undefined);
case 84 /* ClassKeyword */:
return parseClassDeclaration(getNodePos(), hasPrecedingJSDocComment(), /*decorators*/ undefined, /*modifiers*/ undefined);
case 99 /* IfKeyword */:
return parseIfStatement();
case 90 /* DoKeyword */:
return parseDoStatement();
case 115 /* WhileKeyword */:
return parseWhileStatement();
case 97 /* ForKeyword */:
return parseForOrForInOrForOfStatement();
case 86 /* ContinueKeyword */:
return parseBreakOrContinueStatement(243 /* ContinueStatement */);
case 81 /* BreakKeyword */:
return parseBreakOrContinueStatement(244 /* BreakStatement */);
case 105 /* ReturnKeyword */:
return parseReturnStatement();
case 116 /* WithKeyword */:
return parseWithStatement();
case 107 /* SwitchKeyword */:
return parseSwitchStatement();
case 109 /* ThrowKeyword */:
return parseThrowStatement();
case 111 /* TryKeyword */:
// Include 'catch' and 'finally' for error recovery.
// falls through
case 83 /* CatchKeyword */:
case 96 /* FinallyKeyword */:
return parseTryStatement();
case 87 /* DebuggerKeyword */:
return parseDebuggerStatement();
case 59 /* AtToken */:
return parseDeclaration();
case 130 /* AsyncKeyword */:
case 118 /* InterfaceKeyword */:
case 150 /* TypeKeyword */:
case 140 /* ModuleKeyword */:
case 141 /* NamespaceKeyword */:
case 134 /* DeclareKeyword */:
case 85 /* ConstKeyword */:
case 92 /* EnumKeyword */:
case 93 /* ExportKeyword */:
case 100 /* ImportKeyword */:
case 121 /* PrivateKeyword */:
case 122 /* ProtectedKeyword */:
case 123 /* PublicKeyword */:
case 126 /* AbstractKeyword */:
case 124 /* StaticKeyword */:
case 143 /* ReadonlyKeyword */:
case 155 /* GlobalKeyword */:
if (isStartOfDeclaration()) {
return parseDeclaration();
}
break;
}
return parseExpressionOrLabeledStatement();
}
function isDeclareModifier(modifier) {
return modifier.kind === 134 /* DeclareKeyword */;
}
function parseDeclaration() {
// TODO: Can we hold onto the parsed decorators/modifiers and advance the scanner
// if we can't reuse the declaration, so that we don't do this work twice?
//
// `parseListElement` attempted to get the reused node at this position,
// but the ambient context flag was not yet set, so the node appeared
// not reusable in that context.
var isAmbient = ts.some(lookAhead(function () { return (parseDecorators(), parseModifiers()); }), isDeclareModifier);
if (isAmbient) {
var node = tryReuseAmbientDeclaration();
if (node) {
return node;
}
}
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
var decorators = parseDecorators();
var modifiers = parseModifiers();
if (isAmbient) {
for (var _i = 0, _a = modifiers; _i < _a.length; _i++) {
var m = _a[_i];
m.flags |= 8388608 /* Ambient */;
}
return doInsideOfContext(8388608 /* Ambient */, function () { return parseDeclarationWorker(pos, hasJSDoc, decorators, modifiers); });
}
else {
return parseDeclarationWorker(pos, hasJSDoc, decorators, modifiers);
}
}
function tryReuseAmbientDeclaration() {
return doInsideOfContext(8388608 /* Ambient */, function () {
var node = currentNode(parsingContext);
if (node) {
return consumeNode(node);
}
});
}
function parseDeclarationWorker(pos, hasJSDoc, decorators, modifiers) {
switch (token()) {
case 113 /* VarKeyword */:
case 119 /* LetKeyword */:
case 85 /* ConstKeyword */:
return parseVariableStatement(pos, hasJSDoc, decorators, modifiers);
case 98 /* FunctionKeyword */:
return parseFunctionDeclaration(pos, hasJSDoc, decorators, modifiers);
case 84 /* ClassKeyword */:
return parseClassDeclaration(pos, hasJSDoc, decorators, modifiers);
case 118 /* InterfaceKeyword */:
return parseInterfaceDeclaration(pos, hasJSDoc, decorators, modifiers);
case 150 /* TypeKeyword */:
return parseTypeAliasDeclaration(pos, hasJSDoc, decorators, modifiers);
case 92 /* EnumKeyword */:
return parseEnumDeclaration(pos, hasJSDoc, decorators, modifiers);
case 155 /* GlobalKeyword */:
case 140 /* ModuleKeyword */:
case 141 /* NamespaceKeyword */:
return parseModuleDeclaration(pos, hasJSDoc, decorators, modifiers);
case 100 /* ImportKeyword */:
return parseImportDeclarationOrImportEqualsDeclaration(pos, hasJSDoc, decorators, modifiers);
case 93 /* ExportKeyword */:
nextToken();
switch (token()) {
case 88 /* DefaultKeyword */:
case 63 /* EqualsToken */:
return parseExportAssignment(pos, hasJSDoc, decorators, modifiers);
case 127 /* AsKeyword */:
return parseNamespaceExportDeclaration(pos, hasJSDoc, decorators, modifiers);
default:
return parseExportDeclaration(pos, hasJSDoc, decorators, modifiers);
}
default:
if (decorators || modifiers) {
// We reached this point because we encountered decorators and/or modifiers and assumed a declaration
// would follow. For recovery and error reporting purposes, return an incomplete declaration.
var missing = createMissingNode(274 /* MissingDeclaration */, /*reportAtCurrentPosition*/ true, ts.Diagnostics.Declaration_expected);
ts.setTextRangePos(missing, pos);
missing.decorators = decorators;
missing.modifiers = modifiers;
return missing;
}
return undefined; // TODO: GH#18217
}
}
function nextTokenIsIdentifierOrStringLiteralOnSameLine() {
nextToken();
return !scanner.hasPrecedingLineBreak() && (isIdentifier() || token() === 10 /* StringLiteral */);
}
function parseFunctionBlockOrSemicolon(flags, diagnosticMessage) {
if (token() !== 18 /* OpenBraceToken */ && canParseSemicolon()) {
parseSemicolon();
return;
}
return parseFunctionBlock(flags, diagnosticMessage);
}
// DECLARATIONS
function parseArrayBindingElement() {
var pos = getNodePos();
if (token() === 27 /* CommaToken */) {
return finishNode(factory.createOmittedExpression(), pos);
}
var dotDotDotToken = parseOptionalToken(25 /* DotDotDotToken */);
var name = parseIdentifierOrPattern();
var initializer = parseInitializer();
return finishNode(factory.createBindingElement(dotDotDotToken, /*propertyName*/ undefined, name, initializer), pos);
}
function parseObjectBindingElement() {
var pos = getNodePos();
var dotDotDotToken = parseOptionalToken(25 /* DotDotDotToken */);
var tokenIsIdentifier = isBindingIdentifier();
var propertyName = parsePropertyName();
var name;
if (tokenIsIdentifier && token() !== 58 /* ColonToken */) {
name = propertyName;
propertyName = undefined;
}
else {
parseExpected(58 /* ColonToken */);
name = parseIdentifierOrPattern();
}
var initializer = parseInitializer();
return finishNode(factory.createBindingElement(dotDotDotToken, propertyName, name, initializer), pos);
}
function parseObjectBindingPattern() {
var pos = getNodePos();
parseExpected(18 /* OpenBraceToken */);
var elements = parseDelimitedList(9 /* ObjectBindingElements */, parseObjectBindingElement);
parseExpected(19 /* CloseBraceToken */);
return finishNode(factory.createObjectBindingPattern(elements), pos);
}
function parseArrayBindingPattern() {
var pos = getNodePos();
parseExpected(22 /* OpenBracketToken */);
var elements = parseDelimitedList(10 /* ArrayBindingElements */, parseArrayBindingElement);
parseExpected(23 /* CloseBracketToken */);
return finishNode(factory.createArrayBindingPattern(elements), pos);
}
function isBindingIdentifierOrPrivateIdentifierOrPattern() {
return token() === 18 /* OpenBraceToken */
|| token() === 22 /* OpenBracketToken */
|| token() === 80 /* PrivateIdentifier */
|| isBindingIdentifier();
}
function parseIdentifierOrPattern(privateIdentifierDiagnosticMessage) {
if (token() === 22 /* OpenBracketToken */) {
return parseArrayBindingPattern();
}
if (token() === 18 /* OpenBraceToken */) {
return parseObjectBindingPattern();
}
return parseBindingIdentifier(privateIdentifierDiagnosticMessage);
}
function parseVariableDeclarationAllowExclamation() {
return parseVariableDeclaration(/*allowExclamation*/ true);
}
function parseVariableDeclaration(allowExclamation) {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
var name = parseIdentifierOrPattern(ts.Diagnostics.Private_identifiers_are_not_allowed_in_variable_declarations);
var exclamationToken;
if (allowExclamation && name.kind === 79 /* Identifier */ &&
token() === 53 /* ExclamationToken */ && !scanner.hasPrecedingLineBreak()) {
exclamationToken = parseTokenNode();
}
var type = parseTypeAnnotation();
var initializer = isInOrOfKeyword(token()) ? undefined : parseInitializer();
var node = factory.createVariableDeclaration(name, exclamationToken, type, initializer);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseVariableDeclarationList(inForStatementInitializer) {
var pos = getNodePos();
var flags = 0;
switch (token()) {
case 113 /* VarKeyword */:
break;
case 119 /* LetKeyword */:
flags |= 1 /* Let */;
break;
case 85 /* ConstKeyword */:
flags |= 2 /* Const */;
break;
default:
ts.Debug.fail();
}
nextToken();
// The user may have written the following:
//
// for (let of X) { }
//
// In this case, we want to parse an empty declaration list, and then parse 'of'
// as a keyword. The reason this is not automatic is that 'of' is a valid identifier.
// So we need to look ahead to determine if 'of' should be treated as a keyword in
// this context.
// The checker will then give an error that there is an empty declaration list.
var declarations;
if (token() === 158 /* OfKeyword */ && lookAhead(canFollowContextualOfKeyword)) {
declarations = createMissingList();
}
else {
var savedDisallowIn = inDisallowInContext();
setDisallowInContext(inForStatementInitializer);
declarations = parseDelimitedList(8 /* VariableDeclarations */, inForStatementInitializer ? parseVariableDeclaration : parseVariableDeclarationAllowExclamation);
setDisallowInContext(savedDisallowIn);
}
return finishNode(factory.createVariableDeclarationList(declarations, flags), pos);
}
function canFollowContextualOfKeyword() {
return nextTokenIsIdentifier() && nextToken() === 21 /* CloseParenToken */;
}
function parseVariableStatement(pos, hasJSDoc, decorators, modifiers) {
var declarationList = parseVariableDeclarationList(/*inForStatementInitializer*/ false);
parseSemicolon();
var node = factory.createVariableStatement(modifiers, declarationList);
// Decorators are not allowed on a variable statement, so we keep track of them to report them in the grammar checker.
node.decorators = decorators;
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseFunctionDeclaration(pos, hasJSDoc, decorators, modifiers) {
var savedAwaitContext = inAwaitContext();
var modifierFlags = ts.modifiersToFlags(modifiers);
parseExpected(98 /* FunctionKeyword */);
var asteriskToken = parseOptionalToken(41 /* AsteriskToken */);
// We don't parse the name here in await context, instead we will report a grammar error in the checker.
var name = modifierFlags & 512 /* Default */ ? parseOptionalBindingIdentifier() : parseBindingIdentifier();
var isGenerator = asteriskToken ? 1 /* Yield */ : 0 /* None */;
var isAsync = modifierFlags & 256 /* Async */ ? 2 /* Await */ : 0 /* None */;
var typeParameters = parseTypeParameters();
if (modifierFlags & 1 /* Export */)
setAwaitContext(/*value*/ true);
var parameters = parseParameters(isGenerator | isAsync);
var type = parseReturnType(58 /* ColonToken */, /*isType*/ false);
var body = parseFunctionBlockOrSemicolon(isGenerator | isAsync, ts.Diagnostics.or_expected);
setAwaitContext(savedAwaitContext);
var node = factory.createFunctionDeclaration(decorators, modifiers, asteriskToken, name, typeParameters, parameters, type, body);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseConstructorName() {
if (token() === 133 /* ConstructorKeyword */) {
return parseExpected(133 /* ConstructorKeyword */);
}
if (token() === 10 /* StringLiteral */ && lookAhead(nextToken) === 20 /* OpenParenToken */) {
return tryParse(function () {
var literalNode = parseLiteralNode();
return literalNode.text === "constructor" ? literalNode : undefined;
});
}
}
function tryParseConstructorDeclaration(pos, hasJSDoc, decorators, modifiers) {
return tryParse(function () {
if (parseConstructorName()) {
var typeParameters = parseTypeParameters();
var parameters = parseParameters(0 /* None */);
var type = parseReturnType(58 /* ColonToken */, /*isType*/ false);
var body = parseFunctionBlockOrSemicolon(0 /* None */, ts.Diagnostics.or_expected);
var node = factory.createConstructorDeclaration(decorators, modifiers, parameters, body);
// Attach `typeParameters` and `type` if they exist so that we can report them in the grammar checker.
node.typeParameters = typeParameters;
node.type = type;
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
});
}
function parseMethodDeclaration(pos, hasJSDoc, decorators, modifiers, asteriskToken, name, questionToken, exclamationToken, diagnosticMessage) {
var isGenerator = asteriskToken ? 1 /* Yield */ : 0 /* None */;
var isAsync = ts.some(modifiers, ts.isAsyncModifier) ? 2 /* Await */ : 0 /* None */;
var typeParameters = parseTypeParameters();
var parameters = parseParameters(isGenerator | isAsync);
var type = parseReturnType(58 /* ColonToken */, /*isType*/ false);
var body = parseFunctionBlockOrSemicolon(isGenerator | isAsync, diagnosticMessage);
var node = factory.createMethodDeclaration(decorators, modifiers, asteriskToken, name, questionToken, typeParameters, parameters, type, body);
// An exclamation token on a method is invalid syntax and will be handled by the grammar checker
node.exclamationToken = exclamationToken;
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parsePropertyDeclaration(pos, hasJSDoc, decorators, modifiers, name, questionToken) {
var exclamationToken = !questionToken && !scanner.hasPrecedingLineBreak() ? parseOptionalToken(53 /* ExclamationToken */) : undefined;
var type = parseTypeAnnotation();
var initializer = doOutsideOfContext(8192 /* YieldContext */ | 32768 /* AwaitContext */ | 4096 /* DisallowInContext */, parseInitializer);
parseSemicolonAfterPropertyName(name, type, initializer);
var node = factory.createPropertyDeclaration(decorators, modifiers, name, questionToken || exclamationToken, type, initializer);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parsePropertyOrMethodDeclaration(pos, hasJSDoc, decorators, modifiers) {
var asteriskToken = parseOptionalToken(41 /* AsteriskToken */);
var name = parsePropertyName();
// Note: this is not legal as per the grammar. But we allow it in the parser and
// report an error in the grammar checker.
var questionToken = parseOptionalToken(57 /* QuestionToken */);
if (asteriskToken || token() === 20 /* OpenParenToken */ || token() === 29 /* LessThanToken */) {
return parseMethodDeclaration(pos, hasJSDoc, decorators, modifiers, asteriskToken, name, questionToken, /*exclamationToken*/ undefined, ts.Diagnostics.or_expected);
}
return parsePropertyDeclaration(pos, hasJSDoc, decorators, modifiers, name, questionToken);
}
function parseAccessorDeclaration(pos, hasJSDoc, decorators, modifiers, kind) {
var name = parsePropertyName();
var typeParameters = parseTypeParameters();
var parameters = parseParameters(0 /* None */);
var type = parseReturnType(58 /* ColonToken */, /*isType*/ false);
var body = parseFunctionBlockOrSemicolon(0 /* None */);
var node = kind === 170 /* GetAccessor */
? factory.createGetAccessorDeclaration(decorators, modifiers, name, parameters, type, body)
: factory.createSetAccessorDeclaration(decorators, modifiers, name, parameters, body);
// Keep track of `typeParameters` (for both) and `type` (for setters) if they were parsed those indicate grammar errors
node.typeParameters = typeParameters;
if (type && node.kind === 171 /* SetAccessor */)
node.type = type;
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function isClassMemberStart() {
var idToken;
if (token() === 59 /* AtToken */) {
return true;
}
// Eat up all modifiers, but hold on to the last one in case it is actually an identifier.
while (ts.isModifierKind(token())) {
idToken = token();
// If the idToken is a class modifier (protected, private, public, and static), it is
// certain that we are starting to parse class member. This allows better error recovery
// Example:
// public foo() ... // true
// public @dec blah ... // true; we will then report an error later
// export public ... // true; we will then report an error later
if (ts.isClassMemberModifier(idToken)) {
return true;
}
nextToken();
}
if (token() === 41 /* AsteriskToken */) {
return true;
}
// Try to get the first property-like token following all modifiers.
// This can either be an identifier or the 'get' or 'set' keywords.
if (isLiteralPropertyName()) {
idToken = token();
nextToken();
}
// Index signatures and computed properties are class members; we can parse.
if (token() === 22 /* OpenBracketToken */) {
return true;
}
// If we were able to get any potential identifier...
if (idToken !== undefined) {
// If we have a non-keyword identifier, or if we have an accessor, then it's safe to parse.
if (!ts.isKeyword(idToken) || idToken === 147 /* SetKeyword */ || idToken === 135 /* GetKeyword */) {
return true;
}
// If it *is* a keyword, but not an accessor, check a little farther along
// to see if it should actually be parsed as a class member.
switch (token()) {
case 20 /* OpenParenToken */: // Method declaration
case 29 /* LessThanToken */: // Generic Method declaration
case 53 /* ExclamationToken */: // Non-null assertion on property name
case 58 /* ColonToken */: // Type Annotation for declaration
case 63 /* EqualsToken */: // Initializer for declaration
case 57 /* QuestionToken */: // Not valid, but permitted so that it gets caught later on.
return true;
default:
// Covers
// - Semicolons (declaration termination)
// - Closing braces (end-of-class, must be declaration)
// - End-of-files (not valid, but permitted so that it gets caught later on)
// - Line-breaks (enabling *automatic semicolon insertion*)
return canParseSemicolon();
}
}
return false;
}
function parseClassStaticBlockDeclaration(pos, hasJSDoc, decorators, modifiers) {
parseExpectedToken(124 /* StaticKeyword */);
var body = parseClassStaticBlockBody();
return withJSDoc(finishNode(factory.createClassStaticBlockDeclaration(decorators, modifiers, body), pos), hasJSDoc);
}
function parseClassStaticBlockBody() {
var savedYieldContext = inYieldContext();
var savedAwaitContext = inAwaitContext();
setYieldContext(false);
setAwaitContext(true);
var body = parseBlock(/*ignoreMissingOpenBrace*/ false);
setYieldContext(savedYieldContext);
setAwaitContext(savedAwaitContext);
return body;
}
function parseDecoratorExpression() {
if (inAwaitContext() && token() === 131 /* AwaitKeyword */) {
// `@await` is is disallowed in an [Await] context, but can cause parsing to go off the rails
// This simply parses the missing identifier and moves on.
var pos = getNodePos();
var awaitExpression = parseIdentifier(ts.Diagnostics.Expression_expected);
nextToken();
var memberExpression = parseMemberExpressionRest(pos, awaitExpression, /*allowOptionalChain*/ true);
return parseCallExpressionRest(pos, memberExpression);
}
return parseLeftHandSideExpressionOrHigher();
}
function tryParseDecorator() {
var pos = getNodePos();
if (!parseOptional(59 /* AtToken */)) {
return undefined;
}
var expression = doInDecoratorContext(parseDecoratorExpression);
return finishNode(factory.createDecorator(expression), pos);
}
function parseDecorators() {
var pos = getNodePos();
var list, decorator;
while (decorator = tryParseDecorator()) {
list = ts.append(list, decorator);
}
return list && createNodeArray(list, pos);
}
function tryParseModifier(permitInvalidConstAsModifier, stopOnStartOfClassStaticBlock) {
var pos = getNodePos();
var kind = token();
if (token() === 85 /* ConstKeyword */ && permitInvalidConstAsModifier) {
// We need to ensure that any subsequent modifiers appear on the same line
// so that when 'const' is a standalone declaration, we don't issue an error.
if (!tryParse(nextTokenIsOnSameLineAndCanFollowModifier)) {
return undefined;
}
}
else if (stopOnStartOfClassStaticBlock && token() === 124 /* StaticKeyword */ && lookAhead(nextTokenIsOpenBrace)) {
return undefined;
}
else {
if (!parseAnyContextualModifier()) {
return undefined;
}
}
return finishNode(factory.createToken(kind), pos);
}
/*
* There are situations in which a modifier like 'const' will appear unexpectedly, such as on a class member.
* In those situations, if we are entirely sure that 'const' is not valid on its own (such as when ASI takes effect
* and turns it into a standalone declaration), then it is better to parse it and report an error later.
*
* In such situations, 'permitInvalidConstAsModifier' should be set to true.
*/
function parseModifiers(permitInvalidConstAsModifier, stopOnStartOfClassStaticBlock) {
var pos = getNodePos();
var list, modifier;
while (modifier = tryParseModifier(permitInvalidConstAsModifier, stopOnStartOfClassStaticBlock)) {
list = ts.append(list, modifier);
}
return list && createNodeArray(list, pos);
}
function parseModifiersForArrowFunction() {
var modifiers;
if (token() === 130 /* AsyncKeyword */) {
var pos = getNodePos();
nextToken();
var modifier = finishNode(factory.createToken(130 /* AsyncKeyword */), pos);
modifiers = createNodeArray([modifier], pos);
}
return modifiers;
}
function parseClassElement() {
var pos = getNodePos();
if (token() === 26 /* SemicolonToken */) {
nextToken();
return finishNode(factory.createSemicolonClassElement(), pos);
}
var hasJSDoc = hasPrecedingJSDocComment();
var decorators = parseDecorators();
var modifiers = parseModifiers(/*permitInvalidConstAsModifier*/ true, /*stopOnStartOfClassStaticBlock*/ true);
if (token() === 124 /* StaticKeyword */ && lookAhead(nextTokenIsOpenBrace)) {
return parseClassStaticBlockDeclaration(pos, hasJSDoc, decorators, modifiers);
}
if (parseContextualModifier(135 /* GetKeyword */)) {
return parseAccessorDeclaration(pos, hasJSDoc, decorators, modifiers, 170 /* GetAccessor */);
}
if (parseContextualModifier(147 /* SetKeyword */)) {
return parseAccessorDeclaration(pos, hasJSDoc, decorators, modifiers, 171 /* SetAccessor */);
}
if (token() === 133 /* ConstructorKeyword */ || token() === 10 /* StringLiteral */) {
var constructorDeclaration = tryParseConstructorDeclaration(pos, hasJSDoc, decorators, modifiers);
if (constructorDeclaration) {
return constructorDeclaration;
}
}
if (isIndexSignature()) {
return parseIndexSignatureDeclaration(pos, hasJSDoc, decorators, modifiers);
}
// It is very important that we check this *after* checking indexers because
// the [ token can start an index signature or a computed property name
if (ts.tokenIsIdentifierOrKeyword(token()) ||
token() === 10 /* StringLiteral */ ||
token() === 8 /* NumericLiteral */ ||
token() === 41 /* AsteriskToken */ ||
token() === 22 /* OpenBracketToken */) {
var isAmbient = ts.some(modifiers, isDeclareModifier);
if (isAmbient) {
for (var _i = 0, _a = modifiers; _i < _a.length; _i++) {
var m = _a[_i];
m.flags |= 8388608 /* Ambient */;
}
return doInsideOfContext(8388608 /* Ambient */, function () { return parsePropertyOrMethodDeclaration(pos, hasJSDoc, decorators, modifiers); });
}
else {
return parsePropertyOrMethodDeclaration(pos, hasJSDoc, decorators, modifiers);
}
}
if (decorators || modifiers) {
// treat this as a property declaration with a missing name.
var name = createMissingNode(79 /* Identifier */, /*reportAtCurrentPosition*/ true, ts.Diagnostics.Declaration_expected);
return parsePropertyDeclaration(pos, hasJSDoc, decorators, modifiers, name, /*questionToken*/ undefined);
}
// 'isClassMemberStart' should have hinted not to attempt parsing.
return ts.Debug.fail("Should not have attempted to parse class member declaration.");
}
function parseClassExpression() {
return parseClassDeclarationOrExpression(getNodePos(), hasPrecedingJSDocComment(), /*decorators*/ undefined, /*modifiers*/ undefined, 224 /* ClassExpression */);
}
function parseClassDeclaration(pos, hasJSDoc, decorators, modifiers) {
return parseClassDeclarationOrExpression(pos, hasJSDoc, decorators, modifiers, 255 /* ClassDeclaration */);
}
function parseClassDeclarationOrExpression(pos, hasJSDoc, decorators, modifiers, kind) {
var savedAwaitContext = inAwaitContext();
parseExpected(84 /* ClassKeyword */);
// We don't parse the name here in await context, instead we will report a grammar error in the checker.
var name = parseNameOfClassDeclarationOrExpression();
var typeParameters = parseTypeParameters();
if (ts.some(modifiers, ts.isExportModifier))
setAwaitContext(/*value*/ true);
var heritageClauses = parseHeritageClauses();
var members;
if (parseExpected(18 /* OpenBraceToken */)) {
// ClassTail[Yield,Await] : (Modified) See 14.5
// ClassHeritage[?Yield,?Await]opt { ClassBody[?Yield,?Await]opt }
members = parseClassMembers();
parseExpected(19 /* CloseBraceToken */);
}
else {
members = createMissingList();
}
setAwaitContext(savedAwaitContext);
var node = kind === 255 /* ClassDeclaration */
? factory.createClassDeclaration(decorators, modifiers, name, typeParameters, heritageClauses, members)
: factory.createClassExpression(decorators, modifiers, name, typeParameters, heritageClauses, members);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseNameOfClassDeclarationOrExpression() {
// implements is a future reserved word so
// 'class implements' might mean either
// - class expression with omitted name, 'implements' starts heritage clause
// - class with name 'implements'
// 'isImplementsClause' helps to disambiguate between these two cases
return isBindingIdentifier() && !isImplementsClause()
? createIdentifier(isBindingIdentifier())
: undefined;
}
function isImplementsClause() {
return token() === 117 /* ImplementsKeyword */ && lookAhead(nextTokenIsIdentifierOrKeyword);
}
function parseHeritageClauses() {
// ClassTail[Yield,Await] : (Modified) See 14.5
// ClassHeritage[?Yield,?Await]opt { ClassBody[?Yield,?Await]opt }
if (isHeritageClause()) {
return parseList(22 /* HeritageClauses */, parseHeritageClause);
}
return undefined;
}
function parseHeritageClause() {
var pos = getNodePos();
var tok = token();
ts.Debug.assert(tok === 94 /* ExtendsKeyword */ || tok === 117 /* ImplementsKeyword */); // isListElement() should ensure this.
nextToken();
var types = parseDelimitedList(7 /* HeritageClauseElement */, parseExpressionWithTypeArguments);
return finishNode(factory.createHeritageClause(tok, types), pos);
}
function parseExpressionWithTypeArguments() {
var pos = getNodePos();
var expression = parseLeftHandSideExpressionOrHigher();
var typeArguments = tryParseTypeArguments();
return finishNode(factory.createExpressionWithTypeArguments(expression, typeArguments), pos);
}
function tryParseTypeArguments() {
return token() === 29 /* LessThanToken */ ?
parseBracketedList(20 /* TypeArguments */, parseType, 29 /* LessThanToken */, 31 /* GreaterThanToken */) : undefined;
}
function isHeritageClause() {
return token() === 94 /* ExtendsKeyword */ || token() === 117 /* ImplementsKeyword */;
}
function parseClassMembers() {
return parseList(5 /* ClassMembers */, parseClassElement);
}
function parseInterfaceDeclaration(pos, hasJSDoc, decorators, modifiers) {
parseExpected(118 /* InterfaceKeyword */);
var name = parseIdentifier();
var typeParameters = parseTypeParameters();
var heritageClauses = parseHeritageClauses();
var members = parseObjectTypeMembers();
var node = factory.createInterfaceDeclaration(decorators, modifiers, name, typeParameters, heritageClauses, members);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseTypeAliasDeclaration(pos, hasJSDoc, decorators, modifiers) {
parseExpected(150 /* TypeKeyword */);
var name = parseIdentifier();
var typeParameters = parseTypeParameters();
parseExpected(63 /* EqualsToken */);
var type = token() === 137 /* IntrinsicKeyword */ && tryParse(parseKeywordAndNoDot) || parseType();
parseSemicolon();
var node = factory.createTypeAliasDeclaration(decorators, modifiers, name, typeParameters, type);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
// In an ambient declaration, the grammar only allows integer literals as initializers.
// In a non-ambient declaration, the grammar allows uninitialized members only in a
// ConstantEnumMemberSection, which starts at the beginning of an enum declaration
// or any time an integer literal initializer is encountered.
function parseEnumMember() {
var pos = getNodePos();
var hasJSDoc = hasPrecedingJSDocComment();
var name = parsePropertyName();
var initializer = allowInAnd(parseInitializer);
return withJSDoc(finishNode(factory.createEnumMember(name, initializer), pos), hasJSDoc);
}
function parseEnumDeclaration(pos, hasJSDoc, decorators, modifiers) {
parseExpected(92 /* EnumKeyword */);
var name = parseIdentifier();
var members;
if (parseExpected(18 /* OpenBraceToken */)) {
members = doOutsideOfYieldAndAwaitContext(function () { return parseDelimitedList(6 /* EnumMembers */, parseEnumMember); });
parseExpected(19 /* CloseBraceToken */);
}
else {
members = createMissingList();
}
var node = factory.createEnumDeclaration(decorators, modifiers, name, members);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseModuleBlock() {
var pos = getNodePos();
var statements;
if (parseExpected(18 /* OpenBraceToken */)) {
statements = parseList(1 /* BlockStatements */, parseStatement);
parseExpected(19 /* CloseBraceToken */);
}
else {
statements = createMissingList();
}
return finishNode(factory.createModuleBlock(statements), pos);
}
function parseModuleOrNamespaceDeclaration(pos, hasJSDoc, decorators, modifiers, flags) {
// If we are parsing a dotted namespace name, we want to
// propagate the 'Namespace' flag across the names if set.
var namespaceFlag = flags & 16 /* Namespace */;
var name = parseIdentifier();
var body = parseOptional(24 /* DotToken */)
? parseModuleOrNamespaceDeclaration(getNodePos(), /*hasJSDoc*/ false, /*decorators*/ undefined, /*modifiers*/ undefined, 4 /* NestedNamespace */ | namespaceFlag)
: parseModuleBlock();
var node = factory.createModuleDeclaration(decorators, modifiers, name, body, flags);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseAmbientExternalModuleDeclaration(pos, hasJSDoc, decorators, modifiers) {
var flags = 0;
var name;
if (token() === 155 /* GlobalKeyword */) {
// parse 'global' as name of global scope augmentation
name = parseIdentifier();
flags |= 1024 /* GlobalAugmentation */;
}
else {
name = parseLiteralNode();
name.text = internIdentifier(name.text);
}
var body;
if (token() === 18 /* OpenBraceToken */) {
body = parseModuleBlock();
}
else {
parseSemicolon();
}
var node = factory.createModuleDeclaration(decorators, modifiers, name, body, flags);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseModuleDeclaration(pos, hasJSDoc, decorators, modifiers) {
var flags = 0;
if (token() === 155 /* GlobalKeyword */) {
// global augmentation
return parseAmbientExternalModuleDeclaration(pos, hasJSDoc, decorators, modifiers);
}
else if (parseOptional(141 /* NamespaceKeyword */)) {
flags |= 16 /* Namespace */;
}
else {
parseExpected(140 /* ModuleKeyword */);
if (token() === 10 /* StringLiteral */) {
return parseAmbientExternalModuleDeclaration(pos, hasJSDoc, decorators, modifiers);
}
}
return parseModuleOrNamespaceDeclaration(pos, hasJSDoc, decorators, modifiers, flags);
}
function isExternalModuleReference() {
return token() === 144 /* RequireKeyword */ &&
lookAhead(nextTokenIsOpenParen);
}
function nextTokenIsOpenParen() {
return nextToken() === 20 /* OpenParenToken */;
}
function nextTokenIsOpenBrace() {
return nextToken() === 18 /* OpenBraceToken */;
}
function nextTokenIsSlash() {
return nextToken() === 43 /* SlashToken */;
}
function parseNamespaceExportDeclaration(pos, hasJSDoc, decorators, modifiers) {
parseExpected(127 /* AsKeyword */);
parseExpected(141 /* NamespaceKeyword */);
var name = parseIdentifier();
parseSemicolon();
var node = factory.createNamespaceExportDeclaration(name);
// NamespaceExportDeclaration nodes cannot have decorators or modifiers, so we attach them here so we can report them in the grammar checker
node.decorators = decorators;
node.modifiers = modifiers;
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseImportDeclarationOrImportEqualsDeclaration(pos, hasJSDoc, decorators, modifiers) {
parseExpected(100 /* ImportKeyword */);
var afterImportPos = scanner.getStartPos();
// We don't parse the identifier here in await context, instead we will report a grammar error in the checker.
var identifier;
if (isIdentifier()) {
identifier = parseIdentifier();
}
var isTypeOnly = false;
if (token() !== 154 /* FromKeyword */ &&
(identifier === null || identifier === void 0 ? void 0 : identifier.escapedText) === "type" &&
(isIdentifier() || tokenAfterImportDefinitelyProducesImportDeclaration())) {
isTypeOnly = true;
identifier = isIdentifier() ? parseIdentifier() : undefined;
}
if (identifier && !tokenAfterImportedIdentifierDefinitelyProducesImportDeclaration()) {
return parseImportEqualsDeclaration(pos, hasJSDoc, decorators, modifiers, identifier, isTypeOnly);
}
// ImportDeclaration:
// import ImportClause from ModuleSpecifier ;
// import ModuleSpecifier;
var importClause;
if (identifier || // import id
token() === 41 /* AsteriskToken */ || // import *
token() === 18 /* OpenBraceToken */ // import {
) {
importClause = parseImportClause(identifier, afterImportPos, isTypeOnly);
parseExpected(154 /* FromKeyword */);
}
var moduleSpecifier = parseModuleSpecifier();
parseSemicolon();
var node = factory.createImportDeclaration(decorators, modifiers, importClause, moduleSpecifier);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function tokenAfterImportDefinitelyProducesImportDeclaration() {
return token() === 41 /* AsteriskToken */ || token() === 18 /* OpenBraceToken */;
}
function tokenAfterImportedIdentifierDefinitelyProducesImportDeclaration() {
// In `import id ___`, the current token decides whether to produce
// an ImportDeclaration or ImportEqualsDeclaration.
return token() === 27 /* CommaToken */ || token() === 154 /* FromKeyword */;
}
function parseImportEqualsDeclaration(pos, hasJSDoc, decorators, modifiers, identifier, isTypeOnly) {
parseExpected(63 /* EqualsToken */);
var moduleReference = parseModuleReference();
parseSemicolon();
var node = factory.createImportEqualsDeclaration(decorators, modifiers, isTypeOnly, identifier, moduleReference);
var finished = withJSDoc(finishNode(node, pos), hasJSDoc);
return finished;
}
function parseImportClause(identifier, pos, isTypeOnly) {
// ImportClause:
// ImportedDefaultBinding
// NameSpaceImport
// NamedImports
// ImportedDefaultBinding, NameSpaceImport
// ImportedDefaultBinding, NamedImports
// If there was no default import or if there is comma token after default import
// parse namespace or named imports
var namedBindings;
if (!identifier ||
parseOptional(27 /* CommaToken */)) {
namedBindings = token() === 41 /* AsteriskToken */ ? parseNamespaceImport() : parseNamedImportsOrExports(267 /* NamedImports */);
}
return finishNode(factory.createImportClause(isTypeOnly, identifier, namedBindings), pos);
}
function parseModuleReference() {
return isExternalModuleReference()
? parseExternalModuleReference()
: parseEntityName(/*allowReservedWords*/ false);
}
function parseExternalModuleReference() {
var pos = getNodePos();
parseExpected(144 /* RequireKeyword */);
parseExpected(20 /* OpenParenToken */);
var expression = parseModuleSpecifier();
parseExpected(21 /* CloseParenToken */);
return finishNode(factory.createExternalModuleReference(expression), pos);
}
function parseModuleSpecifier() {
if (token() === 10 /* StringLiteral */) {
var result = parseLiteralNode();
result.text = internIdentifier(result.text);
return result;
}
else {
// We allow arbitrary expressions here, even though the grammar only allows string
// literals. We check to ensure that it is only a string literal later in the grammar
// check pass.
return parseExpression();
}
}
function parseNamespaceImport() {
// NameSpaceImport:
// * as ImportedBinding
var pos = getNodePos();
parseExpected(41 /* AsteriskToken */);
parseExpected(127 /* AsKeyword */);
var name = parseIdentifier();
return finishNode(factory.createNamespaceImport(name), pos);
}
function parseNamedImportsOrExports(kind) {
var pos = getNodePos();
// NamedImports:
// { }
// { ImportsList }
// { ImportsList, }
// ImportsList:
// ImportSpecifier
// ImportsList, ImportSpecifier
var node = kind === 267 /* NamedImports */
? factory.createNamedImports(parseBracketedList(23 /* ImportOrExportSpecifiers */, parseImportSpecifier, 18 /* OpenBraceToken */, 19 /* CloseBraceToken */))
: factory.createNamedExports(parseBracketedList(23 /* ImportOrExportSpecifiers */, parseExportSpecifier, 18 /* OpenBraceToken */, 19 /* CloseBraceToken */));
return finishNode(node, pos);
}
function parseExportSpecifier() {
return parseImportOrExportSpecifier(273 /* ExportSpecifier */);
}
function parseImportSpecifier() {
return parseImportOrExportSpecifier(268 /* ImportSpecifier */);
}
function parseImportOrExportSpecifier(kind) {
var pos = getNodePos();
// ImportSpecifier:
// BindingIdentifier
// IdentifierName as BindingIdentifier
// ExportSpecifier:
// IdentifierName
// IdentifierName as IdentifierName
var checkIdentifierIsKeyword = ts.isKeyword(token()) && !isIdentifier();
var checkIdentifierStart = scanner.getTokenPos();
var checkIdentifierEnd = scanner.getTextPos();
var identifierName = parseIdentifierName();
var propertyName;
var name;
if (token() === 127 /* AsKeyword */) {
propertyName = identifierName;
parseExpected(127 /* AsKeyword */);
checkIdentifierIsKeyword = ts.isKeyword(token()) && !isIdentifier();
checkIdentifierStart = scanner.getTokenPos();
checkIdentifierEnd = scanner.getTextPos();
name = parseIdentifierName();
}
else {
name = identifierName;
}
if (kind === 268 /* ImportSpecifier */ && checkIdentifierIsKeyword) {
parseErrorAt(checkIdentifierStart, checkIdentifierEnd, ts.Diagnostics.Identifier_expected);
}
var node = kind === 268 /* ImportSpecifier */
? factory.createImportSpecifier(propertyName, name)
: factory.createExportSpecifier(propertyName, name);
return finishNode(node, pos);
}
function parseNamespaceExport(pos) {
return finishNode(factory.createNamespaceExport(parseIdentifierName()), pos);
}
function parseExportDeclaration(pos, hasJSDoc, decorators, modifiers) {
var savedAwaitContext = inAwaitContext();
setAwaitContext(/*value*/ true);
var exportClause;
var moduleSpecifier;
var isTypeOnly = parseOptional(150 /* TypeKeyword */);
var namespaceExportPos = getNodePos();
if (parseOptional(41 /* AsteriskToken */)) {
if (parseOptional(127 /* AsKeyword */)) {
exportClause = parseNamespaceExport(namespaceExportPos);
}
parseExpected(154 /* FromKeyword */);
moduleSpecifier = parseModuleSpecifier();
}
else {
exportClause = parseNamedImportsOrExports(271 /* NamedExports */);
// It is not uncommon to accidentally omit the 'from' keyword. Additionally, in editing scenarios,
// the 'from' keyword can be parsed as a named export when the export clause is unterminated (i.e. `export { from "moduleName";`)
// If we don't have a 'from' keyword, see if we have a string literal such that ASI won't take effect.
if (token() === 154 /* FromKeyword */ || (token() === 10 /* StringLiteral */ && !scanner.hasPrecedingLineBreak())) {
parseExpected(154 /* FromKeyword */);
moduleSpecifier = parseModuleSpecifier();
}
}
parseSemicolon();
setAwaitContext(savedAwaitContext);
var node = factory.createExportDeclaration(decorators, modifiers, isTypeOnly, exportClause, moduleSpecifier);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function parseExportAssignment(pos, hasJSDoc, decorators, modifiers) {
var savedAwaitContext = inAwaitContext();
setAwaitContext(/*value*/ true);
var isExportEquals;
if (parseOptional(63 /* EqualsToken */)) {
isExportEquals = true;
}
else {
parseExpected(88 /* DefaultKeyword */);
}
var expression = parseAssignmentExpressionOrHigher();
parseSemicolon();
setAwaitContext(savedAwaitContext);
var node = factory.createExportAssignment(decorators, modifiers, isExportEquals, expression);
return withJSDoc(finishNode(node, pos), hasJSDoc);
}
function setExternalModuleIndicator(sourceFile) {
// Try to use the first top-level import/export when available, then
// fall back to looking for an 'import.meta' somewhere in the tree if necessary.
sourceFile.externalModuleIndicator =
ts.forEach(sourceFile.statements, isAnExternalModuleIndicatorNode) ||
getImportMetaIfNecessary(sourceFile);
}
function isAnExternalModuleIndicatorNode(node) {
return hasModifierOfKind(node, 93 /* ExportKeyword */)
|| ts.isImportEqualsDeclaration(node) && ts.isExternalModuleReference(node.moduleReference)
|| ts.isImportDeclaration(node)
|| ts.isExportAssignment(node)
|| ts.isExportDeclaration(node) ? node : undefined;
}
function getImportMetaIfNecessary(sourceFile) {
return sourceFile.flags & 2097152 /* PossiblyContainsImportMeta */ ?
walkTreeForExternalModuleIndicators(sourceFile) :
undefined;
}
function walkTreeForExternalModuleIndicators(node) {
return isImportMeta(node) ? node : forEachChild(node, walkTreeForExternalModuleIndicators);
}
/** Do not use hasModifier inside the parser; it relies on parent pointers. Use this instead. */
function hasModifierOfKind(node, kind) {
return ts.some(node.modifiers, function (m) { return m.kind === kind; });
}
function isImportMeta(node) {
return ts.isMetaProperty(node) && node.keywordToken === 100 /* ImportKeyword */ && node.name.escapedText === "meta";
}
var ParsingContext;
(function (ParsingContext) {
ParsingContext[ParsingContext["SourceElements"] = 0] = "SourceElements";
ParsingContext[ParsingContext["BlockStatements"] = 1] = "BlockStatements";
ParsingContext[ParsingContext["SwitchClauses"] = 2] = "SwitchClauses";
ParsingContext[ParsingContext["SwitchClauseStatements"] = 3] = "SwitchClauseStatements";
ParsingContext[ParsingContext["TypeMembers"] = 4] = "TypeMembers";
ParsingContext[ParsingContext["ClassMembers"] = 5] = "ClassMembers";
ParsingContext[ParsingContext["EnumMembers"] = 6] = "EnumMembers";
ParsingContext[ParsingContext["HeritageClauseElement"] = 7] = "HeritageClauseElement";
ParsingContext[ParsingContext["VariableDeclarations"] = 8] = "VariableDeclarations";
ParsingContext[ParsingContext["ObjectBindingElements"] = 9] = "ObjectBindingElements";
ParsingContext[ParsingContext["ArrayBindingElements"] = 10] = "ArrayBindingElements";
ParsingContext[ParsingContext["ArgumentExpressions"] = 11] = "ArgumentExpressions";
ParsingContext[ParsingContext["ObjectLiteralMembers"] = 12] = "ObjectLiteralMembers";
ParsingContext[ParsingContext["JsxAttributes"] = 13] = "JsxAttributes";
ParsingContext[ParsingContext["JsxChildren"] = 14] = "JsxChildren";
ParsingContext[ParsingContext["ArrayLiteralMembers"] = 15] = "ArrayLiteralMembers";
ParsingContext[ParsingContext["Parameters"] = 16] = "Parameters";
ParsingContext[ParsingContext["JSDocParameters"] = 17] = "JSDocParameters";
ParsingContext[ParsingContext["RestProperties"] = 18] = "RestProperties";
ParsingContext[ParsingContext["TypeParameters"] = 19] = "TypeParameters";
ParsingContext[ParsingContext["TypeArguments"] = 20] = "TypeArguments";
ParsingContext[ParsingContext["TupleElementTypes"] = 21] = "TupleElementTypes";
ParsingContext[ParsingContext["HeritageClauses"] = 22] = "HeritageClauses";
ParsingContext[ParsingContext["ImportOrExportSpecifiers"] = 23] = "ImportOrExportSpecifiers";
ParsingContext[ParsingContext["Count"] = 24] = "Count"; // Number of parsing contexts
})(ParsingContext || (ParsingContext = {}));
var Tristate;
(function (Tristate) {
Tristate[Tristate["False"] = 0] = "False";
Tristate[Tristate["True"] = 1] = "True";
Tristate[Tristate["Unknown"] = 2] = "Unknown";
})(Tristate || (Tristate = {}));
var JSDocParser;
(function (JSDocParser) {
function parseJSDocTypeExpressionForTests(content, start, length) {
initializeState("file.js", content, 99 /* Latest */, /*_syntaxCursor:*/ undefined, 1 /* JS */);
scanner.setText(content, start, length);
currentToken = scanner.scan();
var jsDocTypeExpression = parseJSDocTypeExpression();
var sourceFile = createSourceFile("file.js", 99 /* Latest */, 1 /* JS */, /*isDeclarationFile*/ false, [], factory.createToken(1 /* EndOfFileToken */), 0 /* None */);
var diagnostics = ts.attachFileToDiagnostics(parseDiagnostics, sourceFile);
if (jsDocDiagnostics) {
sourceFile.jsDocDiagnostics = ts.attachFileToDiagnostics(jsDocDiagnostics, sourceFile);
}
clearState();
return jsDocTypeExpression ? { jsDocTypeExpression: jsDocTypeExpression, diagnostics: diagnostics } : undefined;
}
JSDocParser.parseJSDocTypeExpressionForTests = parseJSDocTypeExpressionForTests;
// Parses out a JSDoc type expression.
function parseJSDocTypeExpression(mayOmitBraces) {
var pos = getNodePos();
var hasBrace = (mayOmitBraces ? parseOptional : parseExpected)(18 /* OpenBraceToken */);
var type = doInsideOfContext(4194304 /* JSDoc */, parseJSDocType);
if (!mayOmitBraces || hasBrace) {
parseExpectedJSDoc(19 /* CloseBraceToken */);
}
var result = factory.createJSDocTypeExpression(type);
fixupParentReferences(result);
return finishNode(result, pos);
}
JSDocParser.parseJSDocTypeExpression = parseJSDocTypeExpression;
function parseJSDocNameReference() {
var pos = getNodePos();
var hasBrace = parseOptional(18 /* OpenBraceToken */);
var p2 = getNodePos();
var entityName = parseEntityName(/* allowReservedWords*/ false);
while (token() === 80 /* PrivateIdentifier */) {
reScanHashToken(); // rescan #id as # id
nextTokenJSDoc(); // then skip the #
entityName = finishNode(factory.createJSDocMemberName(entityName, parseIdentifier()), p2);
}
if (hasBrace) {
parseExpectedJSDoc(19 /* CloseBraceToken */);
}
var result = factory.createJSDocNameReference(entityName);
fixupParentReferences(result);
return finishNode(result, pos);
}
JSDocParser.parseJSDocNameReference = parseJSDocNameReference;
function parseIsolatedJSDocComment(content, start, length) {
initializeState("", content, 99 /* Latest */, /*_syntaxCursor:*/ undefined, 1 /* JS */);
var jsDoc = doInsideOfContext(4194304 /* JSDoc */, function () { return parseJSDocCommentWorker(start, length); });
var sourceFile = { languageVariant: 0 /* Standard */, text: content };
var diagnostics = ts.attachFileToDiagnostics(parseDiagnostics, sourceFile);
clearState();
return jsDoc ? { jsDoc: jsDoc, diagnostics: diagnostics } : undefined;
}
JSDocParser.parseIsolatedJSDocComment = parseIsolatedJSDocComment;
function parseJSDocComment(parent, start, length) {
var saveToken = currentToken;
var saveParseDiagnosticsLength = parseDiagnostics.length;
var saveParseErrorBeforeNextFinishedNode = parseErrorBeforeNextFinishedNode;
var comment = doInsideOfContext(4194304 /* JSDoc */, function () { return parseJSDocCommentWorker(start, length); });
ts.setParent(comment, parent);
if (contextFlags & 131072 /* JavaScriptFile */) {
if (!jsDocDiagnostics) {
jsDocDiagnostics = [];
}
jsDocDiagnostics.push.apply(jsDocDiagnostics, parseDiagnostics);
}
currentToken = saveToken;
parseDiagnostics.length = saveParseDiagnosticsLength;
parseErrorBeforeNextFinishedNode = saveParseErrorBeforeNextFinishedNode;
return comment;
}
JSDocParser.parseJSDocComment = parseJSDocComment;
var JSDocState;
(function (JSDocState) {
JSDocState[JSDocState["BeginningOfLine"] = 0] = "BeginningOfLine";
JSDocState[JSDocState["SawAsterisk"] = 1] = "SawAsterisk";
JSDocState[JSDocState["SavingComments"] = 2] = "SavingComments";
JSDocState[JSDocState["SavingBackticks"] = 3] = "SavingBackticks";
})(JSDocState || (JSDocState = {}));
var PropertyLikeParse;
(function (PropertyLikeParse) {
PropertyLikeParse[PropertyLikeParse["Property"] = 1] = "Property";
PropertyLikeParse[PropertyLikeParse["Parameter"] = 2] = "Parameter";
PropertyLikeParse[PropertyLikeParse["CallbackParameter"] = 4] = "CallbackParameter";
})(PropertyLikeParse || (PropertyLikeParse = {}));
function parseJSDocCommentWorker(start, length) {
if (start === void 0) { start = 0; }
var content = sourceText;
var end = length === undefined ? content.length : start + length;
length = end - start;
ts.Debug.assert(start >= 0);
ts.Debug.assert(start <= end);
ts.Debug.assert(end <= content.length);
// Check for /** (JSDoc opening part)
if (!isJSDocLikeText(content, start)) {
return undefined;
}
var tags;
var tagsPos;
var tagsEnd;
var linkEnd;
var commentsPos;
var comments = [];
var parts = [];
// + 3 for leading /**, - 5 in total for /** */
return scanner.scanRange(start + 3, length - 5, function () {
// Initially we can parse out a tag. We also have seen a starting asterisk.
// This is so that /** * @type */ doesn't parse.
var state = 1 /* SawAsterisk */;
var margin;
// + 4 for leading '/** '
// + 1 because the last index of \n is always one index before the first character in the line and coincidentally, if there is no \n before start, it is -1, which is also one index before the first character
var indent = start - (content.lastIndexOf("\n", start) + 1) + 4;
function pushComment(text) {
if (!margin) {
margin = indent;
}
comments.push(text);
indent += text.length;
}
nextTokenJSDoc();
while (parseOptionalJsdoc(5 /* WhitespaceTrivia */))
;
if (parseOptionalJsdoc(4 /* NewLineTrivia */)) {
state = 0 /* BeginningOfLine */;
indent = 0;
}
loop: while (true) {
switch (token()) {
case 59 /* AtToken */:
if (state === 0 /* BeginningOfLine */ || state === 1 /* SawAsterisk */) {
removeTrailingWhitespace(comments);
if (!commentsPos)
commentsPos = getNodePos();
addTag(parseTag(indent));
// NOTE: According to usejsdoc.org, a tag goes to end of line, except the last tag.
// Real-world comments may break this rule, so "BeginningOfLine" will not be a real line beginning
// for malformed examples like `/** @param {string} x @returns {number} the length */`
state = 0 /* BeginningOfLine */;
margin = undefined;
}
else {
pushComment(scanner.getTokenText());
}
break;
case 4 /* NewLineTrivia */:
comments.push(scanner.getTokenText());
state = 0 /* BeginningOfLine */;
indent = 0;
break;
case 41 /* AsteriskToken */:
var asterisk = scanner.getTokenText();
if (state === 1 /* SawAsterisk */ || state === 2 /* SavingComments */) {
// If we've already seen an asterisk, then we can no longer parse a tag on this line
state = 2 /* SavingComments */;
pushComment(asterisk);
}
else {
// Ignore the first asterisk on a line
state = 1 /* SawAsterisk */;
indent += asterisk.length;
}
break;
case 5 /* WhitespaceTrivia */:
// only collect whitespace if we're already saving comments or have just crossed the comment indent margin
var whitespace = scanner.getTokenText();
if (state === 2 /* SavingComments */) {
comments.push(whitespace);
}
else if (margin !== undefined && indent + whitespace.length > margin) {
comments.push(whitespace.slice(margin - indent));
}
indent += whitespace.length;
break;
case 1 /* EndOfFileToken */:
break loop;
case 18 /* OpenBraceToken */:
state = 2 /* SavingComments */;
var commentEnd = scanner.getStartPos();
var linkStart = scanner.getTextPos() - 1;
var link = parseJSDocLink(linkStart);
if (link) {
if (!linkEnd) {
removeLeadingNewlines(comments);
}
parts.push(finishNode(factory.createJSDocText(comments.join("")), linkEnd !== null && linkEnd !== void 0 ? linkEnd : start, commentEnd));
parts.push(link);
comments = [];
linkEnd = scanner.getTextPos();
break;
}
// fallthrough if it's not a {@link sequence
default:
// Anything else is doc comment text. We just save it. Because it
// wasn't a tag, we can no longer parse a tag on this line until we hit the next
// line break.
state = 2 /* SavingComments */;
pushComment(scanner.getTokenText());
break;
}
nextTokenJSDoc();
}
removeTrailingWhitespace(comments);
if (parts.length && comments.length) {
parts.push(finishNode(factory.createJSDocText(comments.join("")), linkEnd !== null && linkEnd !== void 0 ? linkEnd : start, commentsPos));
}
if (parts.length && tags)
ts.Debug.assertIsDefined(commentsPos, "having parsed tags implies that the end of the comment span should be set");
var tagsArray = tags && createNodeArray(tags, tagsPos, tagsEnd);
return finishNode(factory.createJSDocComment(parts.length ? createNodeArray(parts, start, commentsPos) : comments.length ? comments.join("") : undefined, tagsArray), start, end);
});
function removeLeadingNewlines(comments) {
while (comments.length && (comments[0] === "\n" || comments[0] === "\r")) {
comments.shift();
}
}
function removeTrailingWhitespace(comments) {
while (comments.length && comments[comments.length - 1].trim() === "") {
comments.pop();
}
}
function isNextNonwhitespaceTokenEndOfFile() {
// We must use infinite lookahead, as there could be any number of newlines :(
while (true) {
nextTokenJSDoc();
if (token() === 1 /* EndOfFileToken */) {
return true;
}
if (!(token() === 5 /* WhitespaceTrivia */ || token() === 4 /* NewLineTrivia */)) {
return false;
}
}
}
function skipWhitespace() {
if (token() === 5 /* WhitespaceTrivia */ || token() === 4 /* NewLineTrivia */) {
if (lookAhead(isNextNonwhitespaceTokenEndOfFile)) {
return; // Don't skip whitespace prior to EoF (or end of comment) - that shouldn't be included in any node's range
}
}
while (token() === 5 /* WhitespaceTrivia */ || token() === 4 /* NewLineTrivia */) {
nextTokenJSDoc();
}
}
function skipWhitespaceOrAsterisk() {
if (token() === 5 /* WhitespaceTrivia */ || token() === 4 /* NewLineTrivia */) {
if (lookAhead(isNextNonwhitespaceTokenEndOfFile)) {
return ""; // Don't skip whitespace prior to EoF (or end of comment) - that shouldn't be included in any node's range
}
}
var precedingLineBreak = scanner.hasPrecedingLineBreak();
var seenLineBreak = false;
var indentText = "";
while ((precedingLineBreak && token() === 41 /* AsteriskToken */) || token() === 5 /* WhitespaceTrivia */ || token() === 4 /* NewLineTrivia */) {
indentText += scanner.getTokenText();
if (token() === 4 /* NewLineTrivia */) {
precedingLineBreak = true;
seenLineBreak = true;
indentText = "";
}
else if (token() === 41 /* AsteriskToken */) {
precedingLineBreak = false;
}
nextTokenJSDoc();
}
return seenLineBreak ? indentText : "";
}
function parseTag(margin) {
ts.Debug.assert(token() === 59 /* AtToken */);
var start = scanner.getTokenPos();
nextTokenJSDoc();
var tagName = parseJSDocIdentifierName(/*message*/ undefined);
var indentText = skipWhitespaceOrAsterisk();
var tag;
switch (tagName.escapedText) {
case "author":
tag = parseAuthorTag(start, tagName, margin, indentText);
break;
case "implements":
tag = parseImplementsTag(start, tagName, margin, indentText);
break;
case "augments":
case "extends":
tag = parseAugmentsTag(start, tagName, margin, indentText);
break;
case "class":
case "constructor":
tag = parseSimpleTag(start, factory.createJSDocClassTag, tagName, margin, indentText);
break;
case "public":
tag = parseSimpleTag(start, factory.createJSDocPublicTag, tagName, margin, indentText);
break;
case "private":
tag = parseSimpleTag(start, factory.createJSDocPrivateTag, tagName, margin, indentText);
break;
case "protected":
tag = parseSimpleTag(start, factory.createJSDocProtectedTag, tagName, margin, indentText);
break;
case "readonly":
tag = parseSimpleTag(start, factory.createJSDocReadonlyTag, tagName, margin, indentText);
break;
case "override":
tag = parseSimpleTag(start, factory.createJSDocOverrideTag, tagName, margin, indentText);
break;
case "deprecated":
hasDeprecatedTag = true;
tag = parseSimpleTag(start, factory.createJSDocDeprecatedTag, tagName, margin, indentText);
break;
case "this":
tag = parseThisTag(start, tagName, margin, indentText);
break;
case "enum":
tag = parseEnumTag(start, tagName, margin, indentText);
break;
case "arg":
case "argument":
case "param":
return parseParameterOrPropertyTag(start, tagName, 2 /* Parameter */, margin);
case "return":
case "returns":
tag = parseReturnTag(start, tagName, margin, indentText);
break;
case "template":
tag = parseTemplateTag(start, tagName, margin, indentText);
break;
case "type":
tag = parseTypeTag(start, tagName, margin, indentText);
break;
case "typedef":
tag = parseTypedefTag(start, tagName, margin, indentText);
break;
case "callback":
tag = parseCallbackTag(start, tagName, margin, indentText);
break;
case "see":
tag = parseSeeTag(start, tagName, margin, indentText);
break;
default:
tag = parseUnknownTag(start, tagName, margin, indentText);
break;
}
return tag;
}
function parseTrailingTagComments(pos, end, margin, indentText) {
// some tags, like typedef and callback, have already parsed their comments earlier
if (!indentText) {
margin += end - pos;
}
return parseTagComments(margin, indentText.slice(margin));
}
function parseTagComments(indent, initialMargin) {
var commentsPos = getNodePos();
var comments = [];
var parts = [];
var linkEnd;
var state = 0 /* BeginningOfLine */;
var previousWhitespace = true;
var margin;
function pushComment(text) {
if (!margin) {
margin = indent;
}
comments.push(text);
indent += text.length;
}
if (initialMargin !== undefined) {
// jump straight to saving comments if there is some initial indentation
if (initialMargin !== "") {
pushComment(initialMargin);
}
state = 1 /* SawAsterisk */;
}
var tok = token();
loop: while (true) {
switch (tok) {
case 4 /* NewLineTrivia */:
state = 0 /* BeginningOfLine */;
// don't use pushComment here because we want to keep the margin unchanged
comments.push(scanner.getTokenText());
indent = 0;
break;
case 59 /* AtToken */:
if (state === 3 /* SavingBackticks */
|| state === 2 /* SavingComments */ && (!previousWhitespace || lookAhead(isNextJSDocTokenWhitespace))) {
// @ doesn't start a new tag inside ``, and inside a comment, only after whitespace or not before whitespace
comments.push(scanner.getTokenText());
break;
}
scanner.setTextPos(scanner.getTextPos() - 1);
// falls through
case 1 /* EndOfFileToken */:
// Done
break loop;
case 5 /* WhitespaceTrivia */:
if (state === 2 /* SavingComments */ || state === 3 /* SavingBackticks */) {
pushComment(scanner.getTokenText());
}
else {
var whitespace = scanner.getTokenText();
// if the whitespace crosses the margin, take only the whitespace that passes the margin
if (margin !== undefined && indent + whitespace.length > margin) {
comments.push(whitespace.slice(margin - indent));
}
indent += whitespace.length;
}
break;
case 18 /* OpenBraceToken */:
state = 2 /* SavingComments */;
var commentEnd = scanner.getStartPos();
var linkStart = scanner.getTextPos() - 1;
var link = parseJSDocLink(linkStart);
if (link) {
parts.push(finishNode(factory.createJSDocText(comments.join("")), linkEnd !== null && linkEnd !== void 0 ? linkEnd : commentsPos, commentEnd));
parts.push(link);
comments = [];
linkEnd = scanner.getTextPos();
}
else {
pushComment(scanner.getTokenText());
}
break;
case 61 /* BacktickToken */:
if (state === 3 /* SavingBackticks */) {
state = 2 /* SavingComments */;
}
else {
state = 3 /* SavingBackticks */;
}
pushComment(scanner.getTokenText());
break;
case 41 /* AsteriskToken */:
if (state === 0 /* BeginningOfLine */) {
// leading asterisks start recording on the *next* (non-whitespace) token
state = 1 /* SawAsterisk */;
indent += 1;
break;
}
// record the * as a comment
// falls through
default:
if (state !== 3 /* SavingBackticks */) {
state = 2 /* SavingComments */; // leading identifiers start recording as well
}
pushComment(scanner.getTokenText());
break;
}
previousWhitespace = token() === 5 /* WhitespaceTrivia */;
tok = nextTokenJSDoc();
}
removeLeadingNewlines(comments);
removeTrailingWhitespace(comments);
if (parts.length) {
if (comments.length) {
parts.push(finishNode(factory.createJSDocText(comments.join("")), linkEnd !== null && linkEnd !== void 0 ? linkEnd : commentsPos));
}
return createNodeArray(parts, commentsPos, scanner.getTextPos());
}
else if (comments.length) {
return comments.join("");
}
}
function isNextJSDocTokenWhitespace() {
var next = nextTokenJSDoc();
return next === 5 /* WhitespaceTrivia */ || next === 4 /* NewLineTrivia */;
}
function parseJSDocLink(start) {
var linkType = tryParse(parseJSDocLinkPrefix);
if (!linkType) {
return undefined;
}
nextTokenJSDoc(); // start at token after link, then skip any whitespace
skipWhitespace();
// parseEntityName logs an error for non-identifier, so create a MissingNode ourselves to avoid the error
var p2 = getNodePos();
var name = ts.tokenIsIdentifierOrKeyword(token())
? parseEntityName(/*allowReservedWords*/ true)
: undefined;
if (name) {
while (token() === 80 /* PrivateIdentifier */) {
reScanHashToken(); // rescan #id as # id
nextTokenJSDoc(); // then skip the #
name = finishNode(factory.createJSDocMemberName(name, parseIdentifier()), p2);
}
}
var text = [];
while (token() !== 19 /* CloseBraceToken */ && token() !== 4 /* NewLineTrivia */ && token() !== 1 /* EndOfFileToken */) {
text.push(scanner.getTokenText());
nextTokenJSDoc();
}
var create = linkType === "link" ? factory.createJSDocLink
: linkType === "linkcode" ? factory.createJSDocLinkCode
: factory.createJSDocLinkPlain;
return finishNode(create(name, text.join("")), start, scanner.getTextPos());
}
function parseJSDocLinkPrefix() {
skipWhitespaceOrAsterisk();
if (token() === 18 /* OpenBraceToken */
&& nextTokenJSDoc() === 59 /* AtToken */
&& ts.tokenIsIdentifierOrKeyword(nextTokenJSDoc())) {
var kind = scanner.getTokenValue();
if (kind === "link" || kind === "linkcode" || kind === "linkplain") {
return kind;
}
}
}
function parseUnknownTag(start, tagName, indent, indentText) {
return finishNode(factory.createJSDocUnknownTag(tagName, parseTrailingTagComments(start, getNodePos(), indent, indentText)), start);
}
function addTag(tag) {
if (!tag) {
return;
}
if (!tags) {
tags = [tag];
tagsPos = tag.pos;
}
else {
tags.push(tag);
}
tagsEnd = tag.end;
}
function tryParseTypeExpression() {
skipWhitespaceOrAsterisk();
return token() === 18 /* OpenBraceToken */ ? parseJSDocTypeExpression() : undefined;
}
function parseBracketNameInPropertyAndParamTag() {
// Looking for something like '[foo]', 'foo', '[foo.bar]' or 'foo.bar'
var isBracketed = parseOptionalJsdoc(22 /* OpenBracketToken */);
if (isBracketed) {
skipWhitespace();
}
// a markdown-quoted name: `arg` is not legal jsdoc, but occurs in the wild
var isBackquoted = parseOptionalJsdoc(61 /* BacktickToken */);
var name = parseJSDocEntityName();
if (isBackquoted) {
parseExpectedTokenJSDoc(61 /* BacktickToken */);
}
if (isBracketed) {
skipWhitespace();
// May have an optional default, e.g. '[foo = 42]'
if (parseOptionalToken(63 /* EqualsToken */)) {
parseExpression();
}
parseExpected(23 /* CloseBracketToken */);
}
return { name: name, isBracketed: isBracketed };
}
function isObjectOrObjectArrayTypeReference(node) {
switch (node.kind) {
case 146 /* ObjectKeyword */:
return true;
case 181 /* ArrayType */:
return isObjectOrObjectArrayTypeReference(node.elementType);
default:
return ts.isTypeReferenceNode(node) && ts.isIdentifier(node.typeName) && node.typeName.escapedText === "Object" && !node.typeArguments;
}
}
function parseParameterOrPropertyTag(start, tagName, target, indent) {
var typeExpression = tryParseTypeExpression();
var isNameFirst = !typeExpression;
skipWhitespaceOrAsterisk();
var _a = parseBracketNameInPropertyAndParamTag(), name = _a.name, isBracketed = _a.isBracketed;
var indentText = skipWhitespaceOrAsterisk();
if (isNameFirst && !lookAhead(parseJSDocLinkPrefix)) {
typeExpression = tryParseTypeExpression();
}
var comment = parseTrailingTagComments(start, getNodePos(), indent, indentText);
var nestedTypeLiteral = target !== 4 /* CallbackParameter */ && parseNestedTypeLiteral(typeExpression, name, target, indent);
if (nestedTypeLiteral) {
typeExpression = nestedTypeLiteral;
isNameFirst = true;
}
var result = target === 1 /* Property */
? factory.createJSDocPropertyTag(tagName, name, isBracketed, typeExpression, isNameFirst, comment)
: factory.createJSDocParameterTag(tagName, name, isBracketed, typeExpression, isNameFirst, comment);
return finishNode(result, start);
}
function parseNestedTypeLiteral(typeExpression, name, target, indent) {
if (typeExpression && isObjectOrObjectArrayTypeReference(typeExpression.type)) {
var pos = getNodePos();
var child = void 0;
var children = void 0;
while (child = tryParse(function () { return parseChildParameterOrPropertyTag(target, indent, name); })) {
if (child.kind === 335 /* JSDocParameterTag */ || child.kind === 342 /* JSDocPropertyTag */) {
children = ts.append(children, child);
}
}
if (children) {
var literal = finishNode(factory.createJSDocTypeLiteral(children, typeExpression.type.kind === 181 /* ArrayType */), pos);
return finishNode(factory.createJSDocTypeExpression(literal), pos);
}
}
}
function parseReturnTag(start, tagName, indent, indentText) {
if (ts.some(tags, ts.isJSDocReturnTag)) {
parseErrorAt(tagName.pos, scanner.getTokenPos(), ts.Diagnostics._0_tag_already_specified, tagName.escapedText);
}
var typeExpression = tryParseTypeExpression();
return finishNode(factory.createJSDocReturnTag(tagName, typeExpression, parseTrailingTagComments(start, getNodePos(), indent, indentText)), start);
}
function parseTypeTag(start, tagName, indent, indentText) {
if (ts.some(tags, ts.isJSDocTypeTag)) {
parseErrorAt(tagName.pos, scanner.getTokenPos(), ts.Diagnostics._0_tag_already_specified, tagName.escapedText);
}
var typeExpression = parseJSDocTypeExpression(/*mayOmitBraces*/ true);
var comments = indent !== undefined && indentText !== undefined ? parseTrailingTagComments(start, getNodePos(), indent, indentText) : undefined;
return finishNode(factory.createJSDocTypeTag(tagName, typeExpression, comments), start);
}
function parseSeeTag(start, tagName, indent, indentText) {
var isLink = lookAhead(function () { return nextTokenJSDoc() === 59 /* AtToken */ && ts.tokenIsIdentifierOrKeyword(nextTokenJSDoc()) && scanner.getTokenValue() === "link"; });
var nameExpression = isLink ? undefined : parseJSDocNameReference();
var comments = indent !== undefined && indentText !== undefined ? parseTrailingTagComments(start, getNodePos(), indent, indentText) : undefined;
return finishNode(factory.createJSDocSeeTag(tagName, nameExpression, comments), start);
}
function parseAuthorTag(start, tagName, indent, indentText) {
var commentStart = getNodePos();
var textOnly = parseAuthorNameAndEmail();
var commentEnd = scanner.getStartPos();
var comments = parseTrailingTagComments(start, commentEnd, indent, indentText);
if (!comments) {
commentEnd = scanner.getStartPos();
}
var allParts = typeof comments !== "string"
? createNodeArray(ts.concatenate([finishNode(textOnly, commentStart, commentEnd)], comments), commentStart) // cast away readonly
: textOnly.text + comments;
return finishNode(factory.createJSDocAuthorTag(tagName, allParts), start);
}
function parseAuthorNameAndEmail() {
var comments = [];
var inEmail = false;
var token = scanner.getToken();
while (token !== 1 /* EndOfFileToken */ && token !== 4 /* NewLineTrivia */) {
if (token === 29 /* LessThanToken */) {
inEmail = true;
}
else if (token === 59 /* AtToken */ && !inEmail) {
break;
}
else if (token === 31 /* GreaterThanToken */ && inEmail) {
comments.push(scanner.getTokenText());
scanner.setTextPos(scanner.getTokenPos() + 1);
break;
}
comments.push(scanner.getTokenText());
token = nextTokenJSDoc();
}
return factory.createJSDocText(comments.join(""));
}
function parseImplementsTag(start, tagName, margin, indentText) {
var className = parseExpressionWithTypeArgumentsForAugments();
return finishNode(factory.createJSDocImplementsTag(tagName, className, parseTrailingTagComments(start, getNodePos(), margin, indentText)), start);
}
function parseAugmentsTag(start, tagName, margin, indentText) {
var className = parseExpressionWithTypeArgumentsForAugments();
return finishNode(factory.createJSDocAugmentsTag(tagName, className, parseTrailingTagComments(start, getNodePos(), margin, indentText)), start);
}
function parseExpressionWithTypeArgumentsForAugments() {
var usedBrace = parseOptional(18 /* OpenBraceToken */);
var pos = getNodePos();
var expression = parsePropertyAccessEntityNameExpression();
var typeArguments = tryParseTypeArguments();
var node = factory.createExpressionWithTypeArguments(expression, typeArguments);
var res = finishNode(node, pos);
if (usedBrace) {
parseExpected(19 /* CloseBraceToken */);
}
return res;
}
function parsePropertyAccessEntityNameExpression() {
var pos = getNodePos();
var node = parseJSDocIdentifierName();
while (parseOptional(24 /* DotToken */)) {
var name = parseJSDocIdentifierName();
node = finishNode(factory.createPropertyAccessExpression(node, name), pos);
}
return node;
}
function parseSimpleTag(start, createTag, tagName, margin, indentText) {
return finishNode(createTag(tagName, parseTrailingTagComments(start, getNodePos(), margin, indentText)), start);
}
function parseThisTag(start, tagName, margin, indentText) {
var typeExpression = parseJSDocTypeExpression(/*mayOmitBraces*/ true);
skipWhitespace();
return finishNode(factory.createJSDocThisTag(tagName, typeExpression, parseTrailingTagComments(start, getNodePos(), margin, indentText)), start);
}
function parseEnumTag(start, tagName, margin, indentText) {
var typeExpression = parseJSDocTypeExpression(/*mayOmitBraces*/ true);
skipWhitespace();
return finishNode(factory.createJSDocEnumTag(tagName, typeExpression, parseTrailingTagComments(start, getNodePos(), margin, indentText)), start);
}
function parseTypedefTag(start, tagName, indent, indentText) {
var _a;
var typeExpression = tryParseTypeExpression();
skipWhitespaceOrAsterisk();
var fullName = parseJSDocTypeNameWithNamespace();
skipWhitespace();
var comment = parseTagComments(indent);
var end;
if (!typeExpression || isObjectOrObjectArrayTypeReference(typeExpression.type)) {
var child = void 0;
var childTypeTag = void 0;
var jsDocPropertyTags = void 0;
var hasChildren = false;
while (child = tryParse(function () { return parseChildPropertyTag(indent); })) {
hasChildren = true;
if (child.kind === 338 /* JSDocTypeTag */) {
if (childTypeTag) {
parseErrorAtCurrentToken(ts.Diagnostics.A_JSDoc_typedef_comment_may_not_contain_multiple_type_tags);
var lastError = ts.lastOrUndefined(parseDiagnostics);
if (lastError) {
ts.addRelatedInfo(lastError, ts.createDetachedDiagnostic(fileName, 0, 0, ts.Diagnostics.The_tag_was_first_specified_here));
}
break;
}
else {
childTypeTag = child;
}
}
else {
jsDocPropertyTags = ts.append(jsDocPropertyTags, child);
}
}
if (hasChildren) {
var isArrayType = typeExpression && typeExpression.type.kind === 181 /* ArrayType */;
var jsdocTypeLiteral = factory.createJSDocTypeLiteral(jsDocPropertyTags, isArrayType);
typeExpression = childTypeTag && childTypeTag.typeExpression && !isObjectOrObjectArrayTypeReference(childTypeTag.typeExpression.type) ?
childTypeTag.typeExpression :
finishNode(jsdocTypeLiteral, start);
end = typeExpression.end;
}
}
// Only include the characters between the name end and the next token if a comment was actually parsed out - otherwise it's just whitespace
end = end || comment !== undefined ?
getNodePos() :
((_a = fullName !== null && fullName !== void 0 ? fullName : typeExpression) !== null && _a !== void 0 ? _a : tagName).end;
if (!comment) {
comment = parseTrailingTagComments(start, end, indent, indentText);
}
var typedefTag = factory.createJSDocTypedefTag(tagName, typeExpression, fullName, comment);
return finishNode(typedefTag, start, end);
}
function parseJSDocTypeNameWithNamespace(nested) {
var pos = scanner.getTokenPos();
if (!ts.tokenIsIdentifierOrKeyword(token())) {
return undefined;
}
var typeNameOrNamespaceName = parseJSDocIdentifierName();
if (parseOptional(24 /* DotToken */)) {
var body = parseJSDocTypeNameWithNamespace(/*nested*/ true);
var jsDocNamespaceNode = factory.createModuleDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, typeNameOrNamespaceName, body, nested ? 4 /* NestedNamespace */ : undefined);
return finishNode(jsDocNamespaceNode, pos);
}
if (nested) {
typeNameOrNamespaceName.isInJSDocNamespace = true;
}
return typeNameOrNamespaceName;
}
function parseCallbackTagParameters(indent) {
var pos = getNodePos();
var child;
var parameters;
while (child = tryParse(function () { return parseChildParameterOrPropertyTag(4 /* CallbackParameter */, indent); })) {
parameters = ts.append(parameters, child);
}
return createNodeArray(parameters || [], pos);
}
function parseCallbackTag(start, tagName, indent, indentText) {
var fullName = parseJSDocTypeNameWithNamespace();
skipWhitespace();
var comment = parseTagComments(indent);
var parameters = parseCallbackTagParameters(indent);
var returnTag = tryParse(function () {
if (parseOptionalJsdoc(59 /* AtToken */)) {
var tag = parseTag(indent);
if (tag && tag.kind === 336 /* JSDocReturnTag */) {
return tag;
}
}
});
var typeExpression = finishNode(factory.createJSDocSignature(/*typeParameters*/ undefined, parameters, returnTag), start);
if (!comment) {
comment = parseTrailingTagComments(start, getNodePos(), indent, indentText);
}
return finishNode(factory.createJSDocCallbackTag(tagName, typeExpression, fullName, comment), start);
}
function escapedTextsEqual(a, b) {
while (!ts.isIdentifier(a) || !ts.isIdentifier(b)) {
if (!ts.isIdentifier(a) && !ts.isIdentifier(b) && a.right.escapedText === b.right.escapedText) {
a = a.left;
b = b.left;
}
else {
return false;
}
}
return a.escapedText === b.escapedText;
}
function parseChildPropertyTag(indent) {
return parseChildParameterOrPropertyTag(1 /* Property */, indent);
}
function parseChildParameterOrPropertyTag(target, indent, name) {
var canParseTag = true;
var seenAsterisk = false;
while (true) {
switch (nextTokenJSDoc()) {
case 59 /* AtToken */:
if (canParseTag) {
var child = tryParseChildTag(target, indent);
if (child && (child.kind === 335 /* JSDocParameterTag */ || child.kind === 342 /* JSDocPropertyTag */) &&
target !== 4 /* CallbackParameter */ &&
name && (ts.isIdentifier(child.name) || !escapedTextsEqual(name, child.name.left))) {
return false;
}
return child;
}
seenAsterisk = false;
break;
case 4 /* NewLineTrivia */:
canParseTag = true;
seenAsterisk = false;
break;
case 41 /* AsteriskToken */:
if (seenAsterisk) {
canParseTag = false;
}
seenAsterisk = true;
break;
case 79 /* Identifier */:
canParseTag = false;
break;
case 1 /* EndOfFileToken */:
return false;
}
}
}
function tryParseChildTag(target, indent) {
ts.Debug.assert(token() === 59 /* AtToken */);
var start = scanner.getStartPos();
nextTokenJSDoc();
var tagName = parseJSDocIdentifierName();
skipWhitespace();
var t;
switch (tagName.escapedText) {
case "type":
return target === 1 /* Property */ && parseTypeTag(start, tagName);
case "prop":
case "property":
t = 1 /* Property */;
break;
case "arg":
case "argument":
case "param":
t = 2 /* Parameter */ | 4 /* CallbackParameter */;
break;
default:
return false;
}
if (!(target & t)) {
return false;
}
return parseParameterOrPropertyTag(start, tagName, target, indent);
}
function parseTemplateTagTypeParameter() {
var typeParameterPos = getNodePos();
var name = parseJSDocIdentifierName(ts.Diagnostics.Unexpected_token_A_type_parameter_name_was_expected_without_curly_braces);
if (ts.nodeIsMissing(name)) {
return undefined;
}
return finishNode(factory.createTypeParameterDeclaration(name, /*constraint*/ undefined, /*defaultType*/ undefined), typeParameterPos);
}
function parseTemplateTagTypeParameters() {
var pos = getNodePos();
var typeParameters = [];
do {
skipWhitespace();
var node = parseTemplateTagTypeParameter();
if (node !== undefined) {
typeParameters.push(node);
}
skipWhitespaceOrAsterisk();
} while (parseOptionalJsdoc(27 /* CommaToken */));
return createNodeArray(typeParameters, pos);
}
function parseTemplateTag(start, tagName, indent, indentText) {
// The template tag looks like one of the following:
// @template T,U,V
// @template {Constraint} T
//
// According to the [closure docs](https://github.com/google/closure-compiler/wiki/Generic-Types#multiple-bounded-template-types):
// > Multiple bounded generics cannot be declared on the same line. For the sake of clarity, if multiple templates share the same
// > type bound they must be declared on separate lines.
//
// TODO: Determine whether we should enforce this in the checker.
// TODO: Consider moving the `constraint` to the first type parameter as we could then remove `getEffectiveConstraintOfTypeParameter`.
// TODO: Consider only parsing a single type parameter if there is a constraint.
var constraint = token() === 18 /* OpenBraceToken */ ? parseJSDocTypeExpression() : undefined;
var typeParameters = parseTemplateTagTypeParameters();
return finishNode(factory.createJSDocTemplateTag(tagName, constraint, typeParameters, parseTrailingTagComments(start, getNodePos(), indent, indentText)), start);
}
function parseOptionalJsdoc(t) {
if (token() === t) {
nextTokenJSDoc();
return true;
}
return false;
}
function parseJSDocEntityName() {
var entity = parseJSDocIdentifierName();
if (parseOptional(22 /* OpenBracketToken */)) {
parseExpected(23 /* CloseBracketToken */);
// Note that y[] is accepted as an entity name, but the postfix brackets are not saved for checking.
// Technically usejsdoc.org requires them for specifying a property of a type equivalent to Array<{ x: ...}>
// but it's not worth it to enforce that restriction.
}
while (parseOptional(24 /* DotToken */)) {
var name = parseJSDocIdentifierName();
if (parseOptional(22 /* OpenBracketToken */)) {
parseExpected(23 /* CloseBracketToken */);
}
entity = createQualifiedName(entity, name);
}
return entity;
}
function parseJSDocIdentifierName(message) {
if (!ts.tokenIsIdentifierOrKeyword(token())) {
return createMissingNode(79 /* Identifier */, /*reportAtCurrentPosition*/ !message, message || ts.Diagnostics.Identifier_expected);
}
identifierCount++;
var pos = scanner.getTokenPos();
var end = scanner.getTextPos();
var originalKeywordKind = token();
var text = internIdentifier(scanner.getTokenValue());
var result = finishNode(factory.createIdentifier(text, /*typeArguments*/ undefined, originalKeywordKind), pos, end);
nextTokenJSDoc();
return result;
}
}
})(JSDocParser = Parser.JSDocParser || (Parser.JSDocParser = {}));
})(Parser || (Parser = {}));
var IncrementalParser;
(function (IncrementalParser) {
function updateSourceFile(sourceFile, newText, textChangeRange, aggressiveChecks) {
aggressiveChecks = aggressiveChecks || ts.Debug.shouldAssert(2 /* Aggressive */);
checkChangeRange(sourceFile, newText, textChangeRange, aggressiveChecks);
if (ts.textChangeRangeIsUnchanged(textChangeRange)) {
// if the text didn't change, then we can just return our current source file as-is.
return sourceFile;
}
if (sourceFile.statements.length === 0) {
// If we don't have any statements in the current source file, then there's no real
// way to incrementally parse. So just do a full parse instead.
return Parser.parseSourceFile(sourceFile.fileName, newText, sourceFile.languageVersion, /*syntaxCursor*/ undefined, /*setParentNodes*/ true, sourceFile.scriptKind);
}
// Make sure we're not trying to incrementally update a source file more than once. Once
// we do an update the original source file is considered unusable from that point onwards.
//
// This is because we do incremental parsing in-place. i.e. we take nodes from the old
// tree and give them new positions and parents. From that point on, trusting the old
// tree at all is not possible as far too much of it may violate invariants.
var incrementalSourceFile = sourceFile;
ts.Debug.assert(!incrementalSourceFile.hasBeenIncrementallyParsed);
incrementalSourceFile.hasBeenIncrementallyParsed = true;
Parser.fixupParentReferences(incrementalSourceFile);
var oldText = sourceFile.text;
var syntaxCursor = createSyntaxCursor(sourceFile);
// Make the actual change larger so that we know to reparse anything whose lookahead
// might have intersected the change.
var changeRange = extendToAffectedRange(sourceFile, textChangeRange);
checkChangeRange(sourceFile, newText, changeRange, aggressiveChecks);
// Ensure that extending the affected range only moved the start of the change range
// earlier in the file.
ts.Debug.assert(changeRange.span.start <= textChangeRange.span.start);
ts.Debug.assert(ts.textSpanEnd(changeRange.span) === ts.textSpanEnd(textChangeRange.span));
ts.Debug.assert(ts.textSpanEnd(ts.textChangeRangeNewSpan(changeRange)) === ts.textSpanEnd(ts.textChangeRangeNewSpan(textChangeRange)));
// The is the amount the nodes after the edit range need to be adjusted. It can be
// positive (if the edit added characters), negative (if the edit deleted characters)
// or zero (if this was a pure overwrite with nothing added/removed).
var delta = ts.textChangeRangeNewSpan(changeRange).length - changeRange.span.length;
// If we added or removed characters during the edit, then we need to go and adjust all
// the nodes after the edit. Those nodes may move forward (if we inserted chars) or they
// may move backward (if we deleted chars).
//
// Doing this helps us out in two ways. First, it means that any nodes/tokens we want
// to reuse are already at the appropriate position in the new text. That way when we
// reuse them, we don't have to figure out if they need to be adjusted. Second, it makes
// it very easy to determine if we can reuse a node. If the node's position is at where
// we are in the text, then we can reuse it. Otherwise we can't. If the node's position
// is ahead of us, then we'll need to rescan tokens. If the node's position is behind
// us, then we'll need to skip it or crumble it as appropriate
//
// We will also adjust the positions of nodes that intersect the change range as well.
// By doing this, we ensure that all the positions in the old tree are consistent, not
// just the positions of nodes entirely before/after the change range. By being
// consistent, we can then easily map from positions to nodes in the old tree easily.
//
// Also, mark any syntax elements that intersect the changed span. We know, up front,
// that we cannot reuse these elements.
updateTokenPositionsAndMarkElements(incrementalSourceFile, changeRange.span.start, ts.textSpanEnd(changeRange.span), ts.textSpanEnd(ts.textChangeRangeNewSpan(changeRange)), delta, oldText, newText, aggressiveChecks);
// Now that we've set up our internal incremental state just proceed and parse the
// source file in the normal fashion. When possible the parser will retrieve and
// reuse nodes from the old tree.
//
// Note: passing in 'true' for setNodeParents is very important. When incrementally
// parsing, we will be reusing nodes from the old tree, and placing it into new
// parents. If we don't set the parents now, we'll end up with an observably
// inconsistent tree. Setting the parents on the new tree should be very fast. We
// will immediately bail out of walking any subtrees when we can see that their parents
// are already correct.
var result = Parser.parseSourceFile(sourceFile.fileName, newText, sourceFile.languageVersion, syntaxCursor, /*setParentNodes*/ true, sourceFile.scriptKind);
result.commentDirectives = getNewCommentDirectives(sourceFile.commentDirectives, result.commentDirectives, changeRange.span.start, ts.textSpanEnd(changeRange.span), delta, oldText, newText, aggressiveChecks);
return result;
}
IncrementalParser.updateSourceFile = updateSourceFile;
function getNewCommentDirectives(oldDirectives, newDirectives, changeStart, changeRangeOldEnd, delta, oldText, newText, aggressiveChecks) {
if (!oldDirectives)
return newDirectives;
var commentDirectives;
var addedNewlyScannedDirectives = false;
for (var _i = 0, oldDirectives_1 = oldDirectives; _i < oldDirectives_1.length; _i++) {
var directive = oldDirectives_1[_i];
var range = directive.range, type = directive.type;
// Range before the change
if (range.end < changeStart) {
commentDirectives = ts.append(commentDirectives, directive);
}
else if (range.pos > changeRangeOldEnd) {
addNewlyScannedDirectives();
// Node is entirely past the change range. We need to move both its pos and
// end, forward or backward appropriately.
var updatedDirective = {
range: { pos: range.pos + delta, end: range.end + delta },
type: type
};
commentDirectives = ts.append(commentDirectives, updatedDirective);
if (aggressiveChecks) {
ts.Debug.assert(oldText.substring(range.pos, range.end) === newText.substring(updatedDirective.range.pos, updatedDirective.range.end));
}
}
// Ignore ranges that fall in change range
}
addNewlyScannedDirectives();
return commentDirectives;
function addNewlyScannedDirectives() {
if (addedNewlyScannedDirectives)
return;
addedNewlyScannedDirectives = true;
if (!commentDirectives) {
commentDirectives = newDirectives;
}
else if (newDirectives) {
commentDirectives.push.apply(commentDirectives, newDirectives);
}
}
}
function moveElementEntirelyPastChangeRange(element, isArray, delta, oldText, newText, aggressiveChecks) {
if (isArray) {
visitArray(element);
}
else {
visitNode(element);
}
return;
function visitNode(node) {
var text = "";
if (aggressiveChecks && shouldCheckNode(node)) {
text = oldText.substring(node.pos, node.end);
}
// Ditch any existing LS children we may have created. This way we can avoid
// moving them forward.
if (node._children) {
node._children = undefined;
}
ts.setTextRangePosEnd(node, node.pos + delta, node.end + delta);
if (aggressiveChecks && shouldCheckNode(node)) {
ts.Debug.assert(text === newText.substring(node.pos, node.end));
}
forEachChild(node, visitNode, visitArray);
if (ts.hasJSDocNodes(node)) {
for (var _i = 0, _a = node.jsDoc; _i < _a.length; _i++) {
var jsDocComment = _a[_i];
visitNode(jsDocComment);
}
}
checkNodePositions(node, aggressiveChecks);
}
function visitArray(array) {
array._children = undefined;
ts.setTextRangePosEnd(array, array.pos + delta, array.end + delta);
for (var _i = 0, array_9 = array; _i < array_9.length; _i++) {
var node = array_9[_i];
visitNode(node);
}
}
}
function shouldCheckNode(node) {
switch (node.kind) {
case 10 /* StringLiteral */:
case 8 /* NumericLiteral */:
case 79 /* Identifier */:
return true;
}
return false;
}
function adjustIntersectingElement(element, changeStart, changeRangeOldEnd, changeRangeNewEnd, delta) {
ts.Debug.assert(element.end >= changeStart, "Adjusting an element that was entirely before the change range");
ts.Debug.assert(element.pos <= changeRangeOldEnd, "Adjusting an element that was entirely after the change range");
ts.Debug.assert(element.pos <= element.end);
// We have an element that intersects the change range in some way. It may have its
// start, or its end (or both) in the changed range. We want to adjust any part
// that intersects such that the final tree is in a consistent state. i.e. all
// children have spans within the span of their parent, and all siblings are ordered
// properly.
// We may need to update both the 'pos' and the 'end' of the element.
// If the 'pos' is before the start of the change, then we don't need to touch it.
// If it isn't, then the 'pos' must be inside the change. How we update it will
// depend if delta is positive or negative. If delta is positive then we have
// something like:
//
// -------------------AAA-----------------
// -------------------BBBCCCCCCC-----------------
//
// In this case, we consider any node that started in the change range to still be
// starting at the same position.
//
// however, if the delta is negative, then we instead have something like this:
//
// -------------------XXXYYYYYYY-----------------
// -------------------ZZZ-----------------
//
// In this case, any element that started in the 'X' range will keep its position.
// However any element that started after that will have their pos adjusted to be
// at the end of the new range. i.e. any node that started in the 'Y' range will
// be adjusted to have their start at the end of the 'Z' range.
//
// The element will keep its position if possible. Or Move backward to the new-end
// if it's in the 'Y' range.
var pos = Math.min(element.pos, changeRangeNewEnd);
// If the 'end' is after the change range, then we always adjust it by the delta
// amount. However, if the end is in the change range, then how we adjust it
// will depend on if delta is positive or negative. If delta is positive then we
// have something like:
//
// -------------------AAA-----------------
// -------------------BBBCCCCCCC-----------------
//
// In this case, we consider any node that ended inside the change range to keep its
// end position.
//
// however, if the delta is negative, then we instead have something like this:
//
// -------------------XXXYYYYYYY-----------------
// -------------------ZZZ-----------------
//
// In this case, any element that ended in the 'X' range will keep its position.
// However any element that ended after that will have their pos adjusted to be
// at the end of the new range. i.e. any node that ended in the 'Y' range will
// be adjusted to have their end at the end of the 'Z' range.
var end = element.end >= changeRangeOldEnd ?
// Element ends after the change range. Always adjust the end pos.
element.end + delta :
// Element ends in the change range. The element will keep its position if
// possible. Or Move backward to the new-end if it's in the 'Y' range.
Math.min(element.end, changeRangeNewEnd);
ts.Debug.assert(pos <= end);
if (element.parent) {
ts.Debug.assertGreaterThanOrEqual(pos, element.parent.pos);
ts.Debug.assertLessThanOrEqual(end, element.parent.end);
}
ts.setTextRangePosEnd(element, pos, end);
}
function checkNodePositions(node, aggressiveChecks) {
if (aggressiveChecks) {
var pos_2 = node.pos;
var visitNode_1 = function (child) {
ts.Debug.assert(child.pos >= pos_2);
pos_2 = child.end;
};
if (ts.hasJSDocNodes(node)) {
for (var _i = 0, _a = node.jsDoc; _i < _a.length; _i++) {
var jsDocComment = _a[_i];
visitNode_1(jsDocComment);
}
}
forEachChild(node, visitNode_1);
ts.Debug.assert(pos_2 <= node.end);
}
}
function updateTokenPositionsAndMarkElements(sourceFile, changeStart, changeRangeOldEnd, changeRangeNewEnd, delta, oldText, newText, aggressiveChecks) {
visitNode(sourceFile);
return;
function visitNode(child) {
ts.Debug.assert(child.pos <= child.end);
if (child.pos > changeRangeOldEnd) {
// Node is entirely past the change range. We need to move both its pos and
// end, forward or backward appropriately.
moveElementEntirelyPastChangeRange(child, /*isArray*/ false, delta, oldText, newText, aggressiveChecks);
return;
}
// Check if the element intersects the change range. If it does, then it is not
// reusable. Also, we'll need to recurse to see what constituent portions we may
// be able to use.
var fullEnd = child.end;
if (fullEnd >= changeStart) {
child.intersectsChange = true;
child._children = undefined;
// Adjust the pos or end (or both) of the intersecting element accordingly.
adjustIntersectingElement(child, changeStart, changeRangeOldEnd, changeRangeNewEnd, delta);
forEachChild(child, visitNode, visitArray);
if (ts.hasJSDocNodes(child)) {
for (var _i = 0, _a = child.jsDoc; _i < _a.length; _i++) {
var jsDocComment = _a[_i];
visitNode(jsDocComment);
}
}
checkNodePositions(child, aggressiveChecks);
return;
}
// Otherwise, the node is entirely before the change range. No need to do anything with it.
ts.Debug.assert(fullEnd < changeStart);
}
function visitArray(array) {
ts.Debug.assert(array.pos <= array.end);
if (array.pos > changeRangeOldEnd) {
// Array is entirely after the change range. We need to move it, and move any of
// its children.
moveElementEntirelyPastChangeRange(array, /*isArray*/ true, delta, oldText, newText, aggressiveChecks);
return;
}
// Check if the element intersects the change range. If it does, then it is not
// reusable. Also, we'll need to recurse to see what constituent portions we may
// be able to use.
var fullEnd = array.end;
if (fullEnd >= changeStart) {
array.intersectsChange = true;
array._children = undefined;
// Adjust the pos or end (or both) of the intersecting array accordingly.
adjustIntersectingElement(array, changeStart, changeRangeOldEnd, changeRangeNewEnd, delta);
for (var _i = 0, array_10 = array; _i < array_10.length; _i++) {
var node = array_10[_i];
visitNode(node);
}
return;
}
// Otherwise, the array is entirely before the change range. No need to do anything with it.
ts.Debug.assert(fullEnd < changeStart);
}
}
function extendToAffectedRange(sourceFile, changeRange) {
// Consider the following code:
// void foo() { /; }
//
// If the text changes with an insertion of / just before the semicolon then we end up with:
// void foo() { //; }
//
// If we were to just use the changeRange a is, then we would not rescan the { token
// (as it does not intersect the actual original change range). Because an edit may
// change the token touching it, we actually need to look back *at least* one token so
// that the prior token sees that change.
var maxLookahead = 1;
var start = changeRange.span.start;
// the first iteration aligns us with the change start. subsequent iteration move us to
// the left by maxLookahead tokens. We only need to do this as long as we're not at the
// start of the tree.
for (var i = 0; start > 0 && i <= maxLookahead; i++) {
var nearestNode = findNearestNodeStartingBeforeOrAtPosition(sourceFile, start);
ts.Debug.assert(nearestNode.pos <= start);
var position = nearestNode.pos;
start = Math.max(0, position - 1);
}
var finalSpan = ts.createTextSpanFromBounds(start, ts.textSpanEnd(changeRange.span));
var finalLength = changeRange.newLength + (changeRange.span.start - start);
return ts.createTextChangeRange(finalSpan, finalLength);
}
function findNearestNodeStartingBeforeOrAtPosition(sourceFile, position) {
var bestResult = sourceFile;
var lastNodeEntirelyBeforePosition;
forEachChild(sourceFile, visit);
if (lastNodeEntirelyBeforePosition) {
var lastChildOfLastEntireNodeBeforePosition = getLastDescendant(lastNodeEntirelyBeforePosition);
if (lastChildOfLastEntireNodeBeforePosition.pos > bestResult.pos) {
bestResult = lastChildOfLastEntireNodeBeforePosition;
}
}
return bestResult;
function getLastDescendant(node) {
while (true) {
var lastChild = ts.getLastChild(node);
if (lastChild) {
node = lastChild;
}
else {
return node;
}
}
}
function visit(child) {
if (ts.nodeIsMissing(child)) {
// Missing nodes are effectively invisible to us. We never even consider them
// When trying to find the nearest node before us.
return;
}
// If the child intersects this position, then this node is currently the nearest
// node that starts before the position.
if (child.pos <= position) {
if (child.pos >= bestResult.pos) {
// This node starts before the position, and is closer to the position than
// the previous best node we found. It is now the new best node.
bestResult = child;
}
// Now, the node may overlap the position, or it may end entirely before the
// position. If it overlaps with the position, then either it, or one of its
// children must be the nearest node before the position. So we can just
// recurse into this child to see if we can find something better.
if (position < child.end) {
// The nearest node is either this child, or one of the children inside
// of it. We've already marked this child as the best so far. Recurse
// in case one of the children is better.
forEachChild(child, visit);
// Once we look at the children of this node, then there's no need to
// continue any further.
return true;
}
else {
ts.Debug.assert(child.end <= position);
// The child ends entirely before this position. Say you have the following
// (where $ is the position)
//
// <complex expr 1> ? <complex expr 2> $ : <...> <...>
//
// We would want to find the nearest preceding node in "complex expr 2".
// To support that, we keep track of this node, and once we're done searching
// for a best node, we recurse down this node to see if we can find a good
// result in it.
//
// This approach allows us to quickly skip over nodes that are entirely
// before the position, while still allowing us to find any nodes in the
// last one that might be what we want.
lastNodeEntirelyBeforePosition = child;
}
}
else {
ts.Debug.assert(child.pos > position);
// We're now at a node that is entirely past the position we're searching for.
// This node (and all following nodes) could never contribute to the result,
// so just skip them by returning 'true' here.
return true;
}
}
}
function checkChangeRange(sourceFile, newText, textChangeRange, aggressiveChecks) {
var oldText = sourceFile.text;
if (textChangeRange) {
ts.Debug.assert((oldText.length - textChangeRange.span.length + textChangeRange.newLength) === newText.length);
if (aggressiveChecks || ts.Debug.shouldAssert(3 /* VeryAggressive */)) {
var oldTextPrefix = oldText.substr(0, textChangeRange.span.start);
var newTextPrefix = newText.substr(0, textChangeRange.span.start);
ts.Debug.assert(oldTextPrefix === newTextPrefix);
var oldTextSuffix = oldText.substring(ts.textSpanEnd(textChangeRange.span), oldText.length);
var newTextSuffix = newText.substring(ts.textSpanEnd(ts.textChangeRangeNewSpan(textChangeRange)), newText.length);
ts.Debug.assert(oldTextSuffix === newTextSuffix);
}
}
}
function createSyntaxCursor(sourceFile) {
var currentArray = sourceFile.statements;
var currentArrayIndex = 0;
ts.Debug.assert(currentArrayIndex < currentArray.length);
var current = currentArray[currentArrayIndex];
var lastQueriedPosition = -1 /* Value */;
return {
currentNode: function (position) {
// Only compute the current node if the position is different than the last time
// we were asked. The parser commonly asks for the node at the same position
// twice. Once to know if can read an appropriate list element at a certain point,
// and then to actually read and consume the node.
if (position !== lastQueriedPosition) {
// Much of the time the parser will need the very next node in the array that
// we just returned a node from.So just simply check for that case and move
// forward in the array instead of searching for the node again.
if (current && current.end === position && currentArrayIndex < (currentArray.length - 1)) {
currentArrayIndex++;
current = currentArray[currentArrayIndex];
}
// If we don't have a node, or the node we have isn't in the right position,
// then try to find a viable node at the position requested.
if (!current || current.pos !== position) {
findHighestListElementThatStartsAtPosition(position);
}
}
// Cache this query so that we don't do any extra work if the parser calls back
// into us. Note: this is very common as the parser will make pairs of calls like
// 'isListElement -> parseListElement'. If we were unable to find a node when
// called with 'isListElement', we don't want to redo the work when parseListElement
// is called immediately after.
lastQueriedPosition = position;
// Either we don'd have a node, or we have a node at the position being asked for.
ts.Debug.assert(!current || current.pos === position);
return current;
}
};
// Finds the highest element in the tree we can find that starts at the provided position.
// The element must be a direct child of some node list in the tree. This way after we
// return it, we can easily return its next sibling in the list.
function findHighestListElementThatStartsAtPosition(position) {
// Clear out any cached state about the last node we found.
currentArray = undefined;
currentArrayIndex = -1 /* Value */;
current = undefined;
// Recurse into the source file to find the highest node at this position.
forEachChild(sourceFile, visitNode, visitArray);
return;
function visitNode(node) {
if (position >= node.pos && position < node.end) {
// Position was within this node. Keep searching deeper to find the node.
forEachChild(node, visitNode, visitArray);
// don't proceed any further in the search.
return true;
}
// position wasn't in this node, have to keep searching.
return false;
}
function visitArray(array) {
if (position >= array.pos && position < array.end) {
// position was in this array. Search through this array to see if we find a
// viable element.
for (var i = 0; i < array.length; i++) {
var child = array[i];
if (child) {
if (child.pos === position) {
// Found the right node. We're done.
currentArray = array;
currentArrayIndex = i;
current = child;
return true;
}
else {
if (child.pos < position && position < child.end) {
// Position in somewhere within this child. Search in it and
// stop searching in this array.
forEachChild(child, visitNode, visitArray);
return true;
}
}
}
}
}
// position wasn't in this array, have to keep searching.
return false;
}
}
}
IncrementalParser.createSyntaxCursor = createSyntaxCursor;
var InvalidPosition;
(function (InvalidPosition) {
InvalidPosition[InvalidPosition["Value"] = -1] = "Value";
})(InvalidPosition || (InvalidPosition = {}));
})(IncrementalParser || (IncrementalParser = {}));
/** @internal */
function isDeclarationFileName(fileName) {
return ts.fileExtensionIs(fileName, ".d.ts" /* Dts */);
}
ts.isDeclarationFileName = isDeclarationFileName;
/*@internal*/
function processCommentPragmas(context, sourceText) {
var pragmas = [];
for (var _i = 0, _a = ts.getLeadingCommentRanges(sourceText, 0) || ts.emptyArray; _i < _a.length; _i++) {
var range = _a[_i];
var comment = sourceText.substring(range.pos, range.end);
extractPragmas(pragmas, range, comment);
}
context.pragmas = new ts.Map();
for (var _b = 0, pragmas_1 = pragmas; _b < pragmas_1.length; _b++) {
var pragma = pragmas_1[_b];
if (context.pragmas.has(pragma.name)) {
var currentValue = context.pragmas.get(pragma.name);
if (currentValue instanceof Array) {
currentValue.push(pragma.args);
}
else {
context.pragmas.set(pragma.name, [currentValue, pragma.args]);
}
continue;
}
context.pragmas.set(pragma.name, pragma.args);
}
}
ts.processCommentPragmas = processCommentPragmas;
/*@internal*/
function processPragmasIntoFields(context, reportDiagnostic) {
context.checkJsDirective = undefined;
context.referencedFiles = [];
context.typeReferenceDirectives = [];
context.libReferenceDirectives = [];
context.amdDependencies = [];
context.hasNoDefaultLib = false;
context.pragmas.forEach(function (entryOrList, key) {
// TODO: The below should be strongly type-guarded and not need casts/explicit annotations, since entryOrList is related to
// key and key is constrained to a union; but it's not (see GH#21483 for at least partial fix) :(
switch (key) {
case "reference": {
var referencedFiles_1 = context.referencedFiles;
var typeReferenceDirectives_1 = context.typeReferenceDirectives;
var libReferenceDirectives_1 = context.libReferenceDirectives;
ts.forEach(ts.toArray(entryOrList), function (arg) {
var _a = arg.arguments, types = _a.types, lib = _a.lib, path = _a.path;
if (arg.arguments["no-default-lib"]) {
context.hasNoDefaultLib = true;
}
else if (types) {
typeReferenceDirectives_1.push({ pos: types.pos, end: types.end, fileName: types.value });
}
else if (lib) {
libReferenceDirectives_1.push({ pos: lib.pos, end: lib.end, fileName: lib.value });
}
else if (path) {
referencedFiles_1.push({ pos: path.pos, end: path.end, fileName: path.value });
}
else {
reportDiagnostic(arg.range.pos, arg.range.end - arg.range.pos, ts.Diagnostics.Invalid_reference_directive_syntax);
}
});
break;
}
case "amd-dependency": {
context.amdDependencies = ts.map(ts.toArray(entryOrList), function (x) { return ({ name: x.arguments.name, path: x.arguments.path }); });
break;
}
case "amd-module": {
if (entryOrList instanceof Array) {
for (var _i = 0, entryOrList_1 = entryOrList; _i < entryOrList_1.length; _i++) {
var entry = entryOrList_1[_i];
if (context.moduleName) {
// TODO: It's probably fine to issue this diagnostic on all instances of the pragma
reportDiagnostic(entry.range.pos, entry.range.end - entry.range.pos, ts.Diagnostics.An_AMD_module_cannot_have_multiple_name_assignments);
}
context.moduleName = entry.arguments.name;
}
}
else {
context.moduleName = entryOrList.arguments.name;
}
break;
}
case "ts-nocheck":
case "ts-check": {
// _last_ of either nocheck or check in a file is the "winner"
ts.forEach(ts.toArray(entryOrList), function (entry) {
if (!context.checkJsDirective || entry.range.pos > context.checkJsDirective.pos) {
context.checkJsDirective = {
enabled: key === "ts-check",
end: entry.range.end,
pos: entry.range.pos
};
}
});
break;
}
case "jsx":
case "jsxfrag":
case "jsximportsource":
case "jsxruntime":
return; // Accessed directly
default: ts.Debug.fail("Unhandled pragma kind"); // Can this be made into an assertNever in the future?
}
});
}
ts.processPragmasIntoFields = processPragmasIntoFields;
var namedArgRegExCache = new ts.Map();
function getNamedArgRegEx(name) {
if (namedArgRegExCache.has(name)) {
return namedArgRegExCache.get(name);
}
var result = new RegExp("(\\s" + name + "\\s*=\\s*)(?:(?:'([^']*)')|(?:\"([^\"]*)\"))", "im");
namedArgRegExCache.set(name, result);
return result;
}
var tripleSlashXMLCommentStartRegEx = /^\/\/\/\s*<(\S+)\s.*?\/>/im;
var singleLinePragmaRegEx = /^\/\/\/?\s*@(\S+)\s*(.*)\s*$/im;
function extractPragmas(pragmas, range, text) {
var tripleSlash = range.kind === 2 /* SingleLineCommentTrivia */ && tripleSlashXMLCommentStartRegEx.exec(text);
if (tripleSlash) {
var name = tripleSlash[1].toLowerCase(); // Technically unsafe cast, but we do it so the below check to make it safe typechecks
var pragma = ts.commentPragmas[name];
if (!pragma || !(pragma.kind & 1 /* TripleSlashXML */)) {
return;
}
if (pragma.args) {
var argument = {};
for (var _i = 0, _a = pragma.args; _i < _a.length; _i++) {
var arg = _a[_i];
var matcher = getNamedArgRegEx(arg.name);
var matchResult = matcher.exec(text);
if (!matchResult && !arg.optional) {
return; // Missing required argument, don't parse
}
else if (matchResult) {
var value = matchResult[2] || matchResult[3];
if (arg.captureSpan) {
var startPos = range.pos + matchResult.index + matchResult[1].length + 1;
argument[arg.name] = {
value: value,
pos: startPos,
end: startPos + value.length
};
}
else {
argument[arg.name] = value;
}
}
}
pragmas.push({ name: name, args: { arguments: argument, range: range } });
}
else {
pragmas.push({ name: name, args: { arguments: {}, range: range } });
}
return;
}
var singleLine = range.kind === 2 /* SingleLineCommentTrivia */ && singleLinePragmaRegEx.exec(text);
if (singleLine) {
return addPragmaForMatch(pragmas, range, 2 /* SingleLine */, singleLine);
}
if (range.kind === 3 /* MultiLineCommentTrivia */) {
var multiLinePragmaRegEx = /@(\S+)(\s+.*)?$/gim; // Defined inline since it uses the "g" flag, which keeps a persistent index (for iterating)
var multiLineMatch = void 0;
while (multiLineMatch = multiLinePragmaRegEx.exec(text)) {
addPragmaForMatch(pragmas, range, 4 /* MultiLine */, multiLineMatch);
}
}
}
function addPragmaForMatch(pragmas, range, kind, match) {
if (!match)
return;
var name = match[1].toLowerCase(); // Technically unsafe cast, but we do it so they below check to make it safe typechecks
var pragma = ts.commentPragmas[name];
if (!pragma || !(pragma.kind & kind)) {
return;
}
var args = match[2]; // Split on spaces and match up positionally with definition
var argument = getNamedPragmaArguments(pragma, args);
if (argument === "fail")
return; // Missing required argument, fail to parse it
pragmas.push({ name: name, args: { arguments: argument, range: range } });
return;
}
function getNamedPragmaArguments(pragma, text) {
if (!text)
return {};
if (!pragma.args)
return {};
var args = ts.trimString(text).split(/\s+/);
var argMap = {};
for (var i = 0; i < pragma.args.length; i++) {
var argument = pragma.args[i];
if (!args[i] && !argument.optional) {
return "fail";
}
if (argument.captureSpan) {
return ts.Debug.fail("Capture spans not yet implemented for non-xml pragmas");
}
argMap[argument.name] = args[i];
}
return argMap;
}
/** @internal */
function tagNamesAreEquivalent(lhs, rhs) {
if (lhs.kind !== rhs.kind) {
return false;
}
if (lhs.kind === 79 /* Identifier */) {
return lhs.escapedText === rhs.escapedText;
}
if (lhs.kind === 108 /* ThisKeyword */) {
return true;
}
// If we are at this statement then we must have PropertyAccessExpression and because tag name in Jsx element can only
// take forms of JsxTagNameExpression which includes an identifier, "this" expression, or another propertyAccessExpression
// it is safe to case the expression property as such. See parseJsxElementName for how we parse tag name in Jsx element
return lhs.name.escapedText === rhs.name.escapedText &&
tagNamesAreEquivalent(lhs.expression, rhs.expression);
}
ts.tagNamesAreEquivalent = tagNamesAreEquivalent;
})(ts || (ts = {}));
var ts;
(function (ts) {
/* @internal */
ts.compileOnSaveCommandLineOption = { name: "compileOnSave", type: "boolean" };
var jsxOptionMap = new ts.Map(ts.getEntries({
"preserve": 1 /* Preserve */,
"react-native": 3 /* ReactNative */,
"react": 2 /* React */,
"react-jsx": 4 /* ReactJSX */,
"react-jsxdev": 5 /* ReactJSXDev */,
}));
/* @internal */
ts.inverseJsxOptionMap = new ts.Map(ts.arrayFrom(ts.mapIterator(jsxOptionMap.entries(), function (_a) {
var key = _a[0], value = _a[1];
return ["" + value, key];
})));
// NOTE: The order here is important to default lib ordering as entries will have the same
// order in the generated program (see `getDefaultLibPriority` in program.ts). This
// order also affects overload resolution when a type declared in one lib is
// augmented in another lib.
var libEntries = [
// JavaScript only
["es5", "lib.es5.d.ts"],
["es6", "lib.es2015.d.ts"],
["es2015", "lib.es2015.d.ts"],
["es7", "lib.es2016.d.ts"],
["es2016", "lib.es2016.d.ts"],
["es2017", "lib.es2017.d.ts"],
["es2018", "lib.es2018.d.ts"],
["es2019", "lib.es2019.d.ts"],
["es2020", "lib.es2020.d.ts"],
["es2021", "lib.es2021.d.ts"],
["esnext", "lib.esnext.d.ts"],
// Host only
["dom", "lib.dom.d.ts"],
["dom.iterable", "lib.dom.iterable.d.ts"],
["webworker", "lib.webworker.d.ts"],
["webworker.importscripts", "lib.webworker.importscripts.d.ts"],
["webworker.iterable", "lib.webworker.iterable.d.ts"],
["scripthost", "lib.scripthost.d.ts"],
// ES2015 Or ESNext By-feature options
["es2015.core", "lib.es2015.core.d.ts"],
["es2015.collection", "lib.es2015.collection.d.ts"],
["es2015.generator", "lib.es2015.generator.d.ts"],
["es2015.iterable", "lib.es2015.iterable.d.ts"],
["es2015.promise", "lib.es2015.promise.d.ts"],
["es2015.proxy", "lib.es2015.proxy.d.ts"],
["es2015.reflect", "lib.es2015.reflect.d.ts"],
["es2015.symbol", "lib.es2015.symbol.d.ts"],
["es2015.symbol.wellknown", "lib.es2015.symbol.wellknown.d.ts"],
["es2016.array.include", "lib.es2016.array.include.d.ts"],
["es2017.object", "lib.es2017.object.d.ts"],
["es2017.sharedmemory", "lib.es2017.sharedmemory.d.ts"],
["es2017.string", "lib.es2017.string.d.ts"],
["es2017.intl", "lib.es2017.intl.d.ts"],
["es2017.typedarrays", "lib.es2017.typedarrays.d.ts"],
["es2018.asyncgenerator", "lib.es2018.asyncgenerator.d.ts"],
["es2018.asynciterable", "lib.es2018.asynciterable.d.ts"],
["es2018.intl", "lib.es2018.intl.d.ts"],
["es2018.promise", "lib.es2018.promise.d.ts"],
["es2018.regexp", "lib.es2018.regexp.d.ts"],
["es2019.array", "lib.es2019.array.d.ts"],
["es2019.object", "lib.es2019.object.d.ts"],
["es2019.string", "lib.es2019.string.d.ts"],
["es2019.symbol", "lib.es2019.symbol.d.ts"],
["es2020.bigint", "lib.es2020.bigint.d.ts"],
["es2020.promise", "lib.es2020.promise.d.ts"],
["es2020.sharedmemory", "lib.es2020.sharedmemory.d.ts"],
["es2020.string", "lib.es2020.string.d.ts"],
["es2020.symbol.wellknown", "lib.es2020.symbol.wellknown.d.ts"],
["es2020.intl", "lib.es2020.intl.d.ts"],
["es2021.promise", "lib.es2021.promise.d.ts"],
["es2021.string", "lib.es2021.string.d.ts"],
["es2021.weakref", "lib.es2021.weakref.d.ts"],
["esnext.array", "lib.es2019.array.d.ts"],
["esnext.symbol", "lib.es2019.symbol.d.ts"],
["esnext.asynciterable", "lib.es2018.asynciterable.d.ts"],
["esnext.intl", "lib.esnext.intl.d.ts"],
["esnext.bigint", "lib.es2020.bigint.d.ts"],
["esnext.string", "lib.es2021.string.d.ts"],
["esnext.promise", "lib.es2021.promise.d.ts"],
["esnext.weakref", "lib.es2021.weakref.d.ts"]
];
/**
* An array of supported "lib" reference file names used to determine the order for inclusion
* when referenced, as well as for spelling suggestions. This ensures the correct ordering for
* overload resolution when a type declared in one lib is extended by another.
*/
/* @internal */
ts.libs = libEntries.map(function (entry) { return entry[0]; });
/**
* A map of lib names to lib files. This map is used both for parsing the "lib" command line
* option as well as for resolving lib reference directives.
*/
/* @internal */
ts.libMap = new ts.Map(libEntries);
// Watch related options
/* @internal */
ts.optionsForWatch = [
{
name: "watchFile",
type: new ts.Map(ts.getEntries({
fixedpollinginterval: ts.WatchFileKind.FixedPollingInterval,
prioritypollinginterval: ts.WatchFileKind.PriorityPollingInterval,
dynamicprioritypolling: ts.WatchFileKind.DynamicPriorityPolling,
fixedchunksizepolling: ts.WatchFileKind.FixedChunkSizePolling,
usefsevents: ts.WatchFileKind.UseFsEvents,
usefseventsonparentdirectory: ts.WatchFileKind.UseFsEventsOnParentDirectory,
})),
category: ts.Diagnostics.Watch_and_Build_Modes,
description: ts.Diagnostics.Specify_how_the_TypeScript_watch_mode_works,
},
{
name: "watchDirectory",
type: new ts.Map(ts.getEntries({
usefsevents: ts.WatchDirectoryKind.UseFsEvents,
fixedpollinginterval: ts.WatchDirectoryKind.FixedPollingInterval,
dynamicprioritypolling: ts.WatchDirectoryKind.DynamicPriorityPolling,
fixedchunksizepolling: ts.WatchDirectoryKind.FixedChunkSizePolling,
})),
category: ts.Diagnostics.Watch_and_Build_Modes,
description: ts.Diagnostics.Specify_how_directories_are_watched_on_systems_that_lack_recursive_file_watching_functionality,
},
{
name: "fallbackPolling",
type: new ts.Map(ts.getEntries({
fixedinterval: ts.PollingWatchKind.FixedInterval,
priorityinterval: ts.PollingWatchKind.PriorityInterval,
dynamicpriority: ts.PollingWatchKind.DynamicPriority,
fixedchunksize: ts.PollingWatchKind.FixedChunkSize,
})),
category: ts.Diagnostics.Watch_and_Build_Modes,
description: ts.Diagnostics.Specify_what_approach_the_watcher_should_use_if_the_system_runs_out_of_native_file_watchers,
},
{
name: "synchronousWatchDirectory",
type: "boolean",
category: ts.Diagnostics.Watch_and_Build_Modes,
description: ts.Diagnostics.Synchronously_call_callbacks_and_update_the_state_of_directory_watchers_on_platforms_that_don_t_support_recursive_watching_natively,
},
{
name: "excludeDirectories",
type: "list",
element: {
name: "excludeDirectory",
type: "string",
isFilePath: true,
extraValidation: specToDiagnostic
},
category: ts.Diagnostics.Watch_and_Build_Modes,
description: ts.Diagnostics.Remove_a_list_of_directories_from_the_watch_process,
},
{
name: "excludeFiles",
type: "list",
element: {
name: "excludeFile",
type: "string",
isFilePath: true,
extraValidation: specToDiagnostic
},
category: ts.Diagnostics.Watch_and_Build_Modes,
description: ts.Diagnostics.Remove_a_list_of_files_from_the_watch_mode_s_processing,
},
];
/* @internal */
ts.commonOptionsWithBuild = [
{
name: "help",
shortName: "h",
type: "boolean",
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Command_line_Options,
description: ts.Diagnostics.Print_this_message,
},
{
name: "help",
shortName: "?",
type: "boolean"
},
{
name: "watch",
shortName: "w",
type: "boolean",
showInSimplifiedHelpView: true,
isCommandLineOnly: true,
category: ts.Diagnostics.Command_line_Options,
description: ts.Diagnostics.Watch_input_files,
},
{
name: "preserveWatchOutput",
type: "boolean",
showInSimplifiedHelpView: false,
category: ts.Diagnostics.Output_Formatting,
description: ts.Diagnostics.Disable_wiping_the_console_in_watch_mode,
defaultValueDescription: "n/a"
},
{
name: "listFiles",
type: "boolean",
category: ts.Diagnostics.Compiler_Diagnostics,
description: ts.Diagnostics.Print_all_of_the_files_read_during_the_compilation,
defaultValueDescription: "false"
},
{
name: "explainFiles",
type: "boolean",
category: ts.Diagnostics.Compiler_Diagnostics,
description: ts.Diagnostics.Print_files_read_during_the_compilation_including_why_it_was_included
},
{
name: "listEmittedFiles",
type: "boolean",
category: ts.Diagnostics.Compiler_Diagnostics,
description: ts.Diagnostics.Print_the_names_of_emitted_files_after_a_compilation,
defaultValueDescription: "false"
},
{
name: "pretty",
type: "boolean",
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Output_Formatting,
description: ts.Diagnostics.Enable_color_and_formatting_in_TypeScript_s_output_to_make_compiler_errors_easier_to_read,
defaultValueDescription: "true"
},
{
name: "traceResolution",
type: "boolean",
category: ts.Diagnostics.Compiler_Diagnostics,
description: ts.Diagnostics.Log_paths_used_during_the_moduleResolution_process,
defaultValueDescription: "false"
},
{
name: "diagnostics",
type: "boolean",
category: ts.Diagnostics.Compiler_Diagnostics,
description: ts.Diagnostics.Output_compiler_performance_information_after_building,
defaultValueDescription: "false"
},
{
name: "extendedDiagnostics",
type: "boolean",
category: ts.Diagnostics.Compiler_Diagnostics,
description: ts.Diagnostics.Output_more_detailed_compiler_performance_information_after_building,
defaultValueDescription: "false"
},
{
name: "generateCpuProfile",
type: "string",
isFilePath: true,
paramType: ts.Diagnostics.FILE_OR_DIRECTORY,
category: ts.Diagnostics.Compiler_Diagnostics,
description: ts.Diagnostics.Emit_a_v8_CPU_profile_of_the_compiler_run_for_debugging,
defaultValueDescription: "profile.cpuprofile"
},
{
name: "generateTrace",
type: "string",
isFilePath: true,
isCommandLineOnly: true,
paramType: ts.Diagnostics.DIRECTORY,
category: ts.Diagnostics.Compiler_Diagnostics,
description: ts.Diagnostics.Generates_an_event_trace_and_a_list_of_types
},
{
name: "incremental",
shortName: "i",
type: "boolean",
category: ts.Diagnostics.Projects,
description: ts.Diagnostics.Enable_incremental_compilation,
transpileOptionValue: undefined,
defaultValueDescription: ts.Diagnostics.false_unless_composite_is_set
},
{
name: "assumeChangesOnlyAffectDirectDependencies",
type: "boolean",
affectsSemanticDiagnostics: true,
affectsEmit: true,
category: ts.Diagnostics.Watch_and_Build_Modes,
description: ts.Diagnostics.Have_recompiles_in_projects_that_use_incremental_and_watch_mode_assume_that_changes_within_a_file_will_only_affect_files_directly_depending_on_it
},
{
name: "locale",
type: "string",
category: ts.Diagnostics.Command_line_Options,
isCommandLineOnly: true,
description: ts.Diagnostics.Set_the_language_of_the_messaging_from_TypeScript_This_does_not_affect_emit,
defaultValueDescription: ts.Diagnostics.Platform_specific
},
];
/* @internal */
ts.targetOptionDeclaration = {
name: "target",
shortName: "t",
type: new ts.Map(ts.getEntries({
es3: 0 /* ES3 */,
es5: 1 /* ES5 */,
es6: 2 /* ES2015 */,
es2015: 2 /* ES2015 */,
es2016: 3 /* ES2016 */,
es2017: 4 /* ES2017 */,
es2018: 5 /* ES2018 */,
es2019: 6 /* ES2019 */,
es2020: 7 /* ES2020 */,
es2021: 8 /* ES2021 */,
esnext: 99 /* ESNext */,
})),
affectsSourceFile: true,
affectsModuleResolution: true,
affectsEmit: true,
paramType: ts.Diagnostics.VERSION,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Language_and_Environment,
description: ts.Diagnostics.Set_the_JavaScript_language_version_for_emitted_JavaScript_and_include_compatible_library_declarations,
defaultValueDescription: "ES3"
};
var commandOptionsWithoutBuild = [
// CommandLine only options
{
name: "all",
type: "boolean",
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Command_line_Options,
description: ts.Diagnostics.Show_all_compiler_options,
},
{
name: "version",
shortName: "v",
type: "boolean",
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Command_line_Options,
description: ts.Diagnostics.Print_the_compiler_s_version,
},
{
name: "init",
type: "boolean",
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Command_line_Options,
description: ts.Diagnostics.Initializes_a_TypeScript_project_and_creates_a_tsconfig_json_file,
},
{
name: "project",
shortName: "p",
type: "string",
isFilePath: true,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Command_line_Options,
paramType: ts.Diagnostics.FILE_OR_DIRECTORY,
description: ts.Diagnostics.Compile_the_project_given_the_path_to_its_configuration_file_or_to_a_folder_with_a_tsconfig_json,
},
{
name: "build",
type: "boolean",
shortName: "b",
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Command_line_Options,
description: ts.Diagnostics.Build_one_or_more_projects_and_their_dependencies_if_out_of_date
},
{
name: "showConfig",
type: "boolean",
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Command_line_Options,
isCommandLineOnly: true,
description: ts.Diagnostics.Print_the_final_configuration_instead_of_building
},
{
name: "listFilesOnly",
type: "boolean",
category: ts.Diagnostics.Command_line_Options,
affectsSemanticDiagnostics: true,
affectsEmit: true,
isCommandLineOnly: true,
description: ts.Diagnostics.Print_names_of_files_that_are_part_of_the_compilation_and_then_stop_processing
},
// Basic
ts.targetOptionDeclaration,
{
name: "module",
shortName: "m",
type: new ts.Map(ts.getEntries({
none: ts.ModuleKind.None,
commonjs: ts.ModuleKind.CommonJS,
amd: ts.ModuleKind.AMD,
system: ts.ModuleKind.System,
umd: ts.ModuleKind.UMD,
es6: ts.ModuleKind.ES2015,
es2015: ts.ModuleKind.ES2015,
es2020: ts.ModuleKind.ES2020,
esnext: ts.ModuleKind.ESNext
})),
affectsModuleResolution: true,
affectsEmit: true,
paramType: ts.Diagnostics.KIND,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Modules,
description: ts.Diagnostics.Specify_what_module_code_is_generated,
},
{
name: "lib",
type: "list",
element: {
name: "lib",
type: ts.libMap
},
affectsProgramStructure: true,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Language_and_Environment,
description: ts.Diagnostics.Specify_a_set_of_bundled_library_declaration_files_that_describe_the_target_runtime_environment,
transpileOptionValue: undefined
},
{
name: "allowJs",
type: "boolean",
affectsModuleResolution: true,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.JavaScript_Support,
description: ts.Diagnostics.Allow_JavaScript_files_to_be_a_part_of_your_program_Use_the_checkJS_option_to_get_errors_from_these_files,
defaultValueDescription: "false"
},
{
name: "checkJs",
type: "boolean",
showInSimplifiedHelpView: true,
category: ts.Diagnostics.JavaScript_Support,
description: ts.Diagnostics.Enable_error_reporting_in_type_checked_JavaScript_files,
defaultValueDescription: "false"
},
{
name: "jsx",
type: jsxOptionMap,
affectsSourceFile: true,
affectsEmit: true,
affectsModuleResolution: true,
paramType: ts.Diagnostics.KIND,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Language_and_Environment,
description: ts.Diagnostics.Specify_what_JSX_code_is_generated,
defaultValueDescription: "undefined"
},
{
name: "declaration",
shortName: "d",
type: "boolean",
affectsEmit: true,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Emit,
transpileOptionValue: undefined,
description: ts.Diagnostics.Generate_d_ts_files_from_TypeScript_and_JavaScript_files_in_your_project,
defaultValueDescription: ts.Diagnostics.false_unless_composite_is_set,
},
{
name: "declarationMap",
type: "boolean",
affectsEmit: true,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Emit,
transpileOptionValue: undefined,
defaultValueDescription: "false",
description: ts.Diagnostics.Create_sourcemaps_for_d_ts_files
},
{
name: "emitDeclarationOnly",
type: "boolean",
affectsEmit: true,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Only_output_d_ts_files_and_not_JavaScript_files,
transpileOptionValue: undefined,
defaultValueDescription: "false",
},
{
name: "sourceMap",
type: "boolean",
affectsEmit: true,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Emit,
defaultValueDescription: "false",
description: ts.Diagnostics.Create_source_map_files_for_emitted_JavaScript_files,
},
{
name: "outFile",
type: "string",
affectsEmit: true,
isFilePath: true,
paramType: ts.Diagnostics.FILE,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Specify_a_file_that_bundles_all_outputs_into_one_JavaScript_file_If_declaration_is_true_also_designates_a_file_that_bundles_all_d_ts_output,
transpileOptionValue: undefined,
defaultValueDescription: "n/a"
},
{
name: "outDir",
type: "string",
affectsEmit: true,
isFilePath: true,
paramType: ts.Diagnostics.DIRECTORY,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Specify_an_output_folder_for_all_emitted_files,
defaultValueDescription: "n/a"
},
{
name: "rootDir",
type: "string",
affectsEmit: true,
isFilePath: true,
paramType: ts.Diagnostics.LOCATION,
category: ts.Diagnostics.Modules,
description: ts.Diagnostics.Specify_the_root_folder_within_your_source_files,
defaultValueDescription: ts.Diagnostics.Computed_from_the_list_of_input_files
},
{
name: "composite",
type: "boolean",
affectsEmit: true,
isTSConfigOnly: true,
category: ts.Diagnostics.Projects,
transpileOptionValue: undefined,
defaultValueDescription: "false",
description: ts.Diagnostics.Enable_constraints_that_allow_a_TypeScript_project_to_be_used_with_project_references,
},
{
name: "tsBuildInfoFile",
type: "string",
affectsEmit: true,
isFilePath: true,
paramType: ts.Diagnostics.FILE,
category: ts.Diagnostics.Projects,
transpileOptionValue: undefined,
defaultValueDescription: ".tsbuildinfo",
description: ts.Diagnostics.Specify_the_folder_for_tsbuildinfo_incremental_compilation_files,
},
{
name: "removeComments",
type: "boolean",
affectsEmit: true,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Emit,
defaultValueDescription: "false",
description: ts.Diagnostics.Disable_emitting_comments,
},
{
name: "noEmit",
type: "boolean",
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Disable_emitting_files_from_a_compilation,
transpileOptionValue: undefined,
defaultValueDescription: "false"
},
{
name: "importHelpers",
type: "boolean",
affectsEmit: true,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Allow_importing_helper_functions_from_tslib_once_per_project_instead_of_including_them_per_file,
defaultValueDescription: "false"
},
{
name: "importsNotUsedAsValues",
type: new ts.Map(ts.getEntries({
remove: 0 /* Remove */,
preserve: 1 /* Preserve */,
error: 2 /* Error */
})),
affectsEmit: true,
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Specify_emit_Slashchecking_behavior_for_imports_that_are_only_used_for_types
},
{
name: "downlevelIteration",
type: "boolean",
affectsEmit: true,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Emit_more_compliant_but_verbose_and_less_performant_JavaScript_for_iteration,
defaultValueDescription: "false"
},
{
name: "isolatedModules",
type: "boolean",
category: ts.Diagnostics.Interop_Constraints,
description: ts.Diagnostics.Ensure_that_each_file_can_be_safely_transpiled_without_relying_on_other_imports,
transpileOptionValue: true,
defaultValueDescription: "false"
},
// Strict Type Checks
{
name: "strict",
type: "boolean",
// Though this affects semantic diagnostics, affectsSemanticDiagnostics is not set here
// The value of each strictFlag depends on own strictFlag value or this and never accessed directly.
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Enable_all_strict_type_checking_options,
defaultValueDescription: "false"
},
{
name: "noImplicitAny",
type: "boolean",
affectsSemanticDiagnostics: true,
strictFlag: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Enable_error_reporting_for_expressions_and_declarations_with_an_implied_any_type,
defaultValueDescription: ts.Diagnostics.false_unless_strict_is_set
},
{
name: "strictNullChecks",
type: "boolean",
affectsSemanticDiagnostics: true,
strictFlag: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.When_type_checking_take_into_account_null_and_undefined,
defaultValueDescription: ts.Diagnostics.false_unless_strict_is_set
},
{
name: "strictFunctionTypes",
type: "boolean",
strictFlag: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.When_assigning_functions_check_to_ensure_parameters_and_the_return_values_are_subtype_compatible,
defaultValueDescription: ts.Diagnostics.false_unless_strict_is_set
},
{
name: "strictBindCallApply",
type: "boolean",
strictFlag: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Check_that_the_arguments_for_bind_call_and_apply_methods_match_the_original_function,
defaultValueDescription: ts.Diagnostics.false_unless_strict_is_set
},
{
name: "strictPropertyInitialization",
type: "boolean",
affectsSemanticDiagnostics: true,
strictFlag: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Check_for_class_properties_that_are_declared_but_not_set_in_the_constructor,
defaultValueDescription: ts.Diagnostics.false_unless_strict_is_set
},
{
name: "noImplicitThis",
type: "boolean",
affectsSemanticDiagnostics: true,
strictFlag: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Enable_error_reporting_when_this_is_given_the_type_any,
defaultValueDescription: ts.Diagnostics.false_unless_strict_is_set
},
{
name: "useUnknownInCatchVariables",
type: "boolean",
affectsSemanticDiagnostics: true,
strictFlag: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Type_catch_clause_variables_as_unknown_instead_of_any,
},
{
name: "alwaysStrict",
type: "boolean",
affectsSourceFile: true,
strictFlag: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Ensure_use_strict_is_always_emitted,
defaultValueDescription: ts.Diagnostics.false_unless_strict_is_set
},
// Additional Checks
{
name: "noUnusedLocals",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Enable_error_reporting_when_a_local_variables_aren_t_read,
defaultValueDescription: "false"
},
{
name: "noUnusedParameters",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Raise_an_error_when_a_function_parameter_isn_t_read,
defaultValueDescription: "false"
},
{
name: "exactOptionalPropertyTypes",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Interpret_optional_property_types_as_written_rather_than_adding_undefined
},
{
name: "noImplicitReturns",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Enable_error_reporting_for_codepaths_that_do_not_explicitly_return_in_a_function,
defaultValueDescription: "false"
},
{
name: "noFallthroughCasesInSwitch",
type: "boolean",
affectsBindDiagnostics: true,
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Enable_error_reporting_for_fallthrough_cases_in_switch_statements
},
{
name: "noUncheckedIndexedAccess",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Include_undefined_in_index_signature_results
},
{
name: "noImplicitOverride",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Ensure_overriding_members_in_derived_classes_are_marked_with_an_override_modifier
},
{
name: "noPropertyAccessFromIndexSignature",
type: "boolean",
showInSimplifiedHelpView: false,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Enforces_using_indexed_accessors_for_keys_declared_using_an_indexed_type,
defaultValueDescription: "false"
},
// Module Resolution
{
name: "moduleResolution",
type: new ts.Map(ts.getEntries({
node: ts.ModuleResolutionKind.NodeJs,
classic: ts.ModuleResolutionKind.Classic,
})),
affectsModuleResolution: true,
paramType: ts.Diagnostics.STRATEGY,
category: ts.Diagnostics.Modules,
description: ts.Diagnostics.Specify_how_TypeScript_looks_up_a_file_from_a_given_module_specifier,
defaultValueDescription: ts.Diagnostics.module_AMD_or_UMD_or_System_or_ES6_then_Classic_Otherwise_Node
},
{
name: "baseUrl",
type: "string",
affectsModuleResolution: true,
isFilePath: true,
category: ts.Diagnostics.Modules,
description: ts.Diagnostics.Specify_the_base_directory_to_resolve_non_relative_module_names
},
{
// this option can only be specified in tsconfig.json
// use type = object to copy the value as-is
name: "paths",
type: "object",
affectsModuleResolution: true,
isTSConfigOnly: true,
category: ts.Diagnostics.Modules,
description: ts.Diagnostics.Specify_a_set_of_entries_that_re_map_imports_to_additional_lookup_locations,
transpileOptionValue: undefined
},
{
// this option can only be specified in tsconfig.json
// use type = object to copy the value as-is
name: "rootDirs",
type: "list",
isTSConfigOnly: true,
element: {
name: "rootDirs",
type: "string",
isFilePath: true
},
affectsModuleResolution: true,
category: ts.Diagnostics.Modules,
description: ts.Diagnostics.Allow_multiple_folders_to_be_treated_as_one_when_resolving_modules,
transpileOptionValue: undefined,
defaultValueDescription: ts.Diagnostics.Computed_from_the_list_of_input_files
},
{
name: "typeRoots",
type: "list",
element: {
name: "typeRoots",
type: "string",
isFilePath: true
},
affectsModuleResolution: true,
category: ts.Diagnostics.Modules,
description: ts.Diagnostics.Specify_multiple_folders_that_act_like_Slashnode_modules_Slash_types
},
{
name: "types",
type: "list",
element: {
name: "types",
type: "string"
},
affectsProgramStructure: true,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Modules,
description: ts.Diagnostics.Specify_type_package_names_to_be_included_without_being_referenced_in_a_source_file,
transpileOptionValue: undefined
},
{
name: "allowSyntheticDefaultImports",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Interop_Constraints,
description: ts.Diagnostics.Allow_import_x_from_y_when_a_module_doesn_t_have_a_default_export,
defaultValueDescription: ts.Diagnostics.module_system_or_esModuleInterop
},
{
name: "esModuleInterop",
type: "boolean",
affectsSemanticDiagnostics: true,
affectsEmit: true,
showInSimplifiedHelpView: true,
category: ts.Diagnostics.Interop_Constraints,
description: ts.Diagnostics.Emit_additional_JavaScript_to_ease_support_for_importing_CommonJS_modules_This_enables_allowSyntheticDefaultImports_for_type_compatibility,
defaultValueDescription: "false"
},
{
name: "preserveSymlinks",
type: "boolean",
category: ts.Diagnostics.Interop_Constraints,
description: ts.Diagnostics.Disable_resolving_symlinks_to_their_realpath_This_correlates_to_the_same_flag_in_node,
defaultValueDescription: "n/a"
},
{
name: "allowUmdGlobalAccess",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Modules,
description: ts.Diagnostics.Allow_accessing_UMD_globals_from_modules,
defaultValueDescription: "false"
},
// Source Maps
{
name: "sourceRoot",
type: "string",
affectsEmit: true,
paramType: ts.Diagnostics.LOCATION,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Specify_the_root_path_for_debuggers_to_find_the_reference_source_code,
},
{
name: "mapRoot",
type: "string",
affectsEmit: true,
paramType: ts.Diagnostics.LOCATION,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Specify_the_location_where_debugger_should_locate_map_files_instead_of_generated_locations,
},
{
name: "inlineSourceMap",
type: "boolean",
affectsEmit: true,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Include_sourcemap_files_inside_the_emitted_JavaScript,
defaultValueDescription: "false"
},
{
name: "inlineSources",
type: "boolean",
affectsEmit: true,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Include_source_code_in_the_sourcemaps_inside_the_emitted_JavaScript,
defaultValueDescription: "false"
},
// Experimental
{
name: "experimentalDecorators",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Language_and_Environment,
description: ts.Diagnostics.Enable_experimental_support_for_TC39_stage_2_draft_decorators
},
{
name: "emitDecoratorMetadata",
type: "boolean",
affectsSemanticDiagnostics: true,
affectsEmit: true,
category: ts.Diagnostics.Language_and_Environment,
description: ts.Diagnostics.Emit_design_type_metadata_for_decorated_declarations_in_source_files
},
// Advanced
{
name: "jsxFactory",
type: "string",
category: ts.Diagnostics.Language_and_Environment,
description: ts.Diagnostics.Specify_the_JSX_factory_function_used_when_targeting_React_JSX_emit_e_g_React_createElement_or_h,
defaultValueDescription: "`React.createElement`"
},
{
name: "jsxFragmentFactory",
type: "string",
category: ts.Diagnostics.Language_and_Environment,
description: ts.Diagnostics.Specify_the_JSX_Fragment_reference_used_for_fragments_when_targeting_React_JSX_emit_e_g_React_Fragment_or_Fragment
},
{
name: "jsxImportSource",
type: "string",
affectsSemanticDiagnostics: true,
affectsEmit: true,
affectsModuleResolution: true,
category: ts.Diagnostics.Language_and_Environment,
description: ts.Diagnostics.Specify_module_specifier_used_to_import_the_JSX_factory_functions_when_using_jsx_Colon_react_jsx_Asterisk,
defaultValueDescription: "react"
},
{
name: "resolveJsonModule",
type: "boolean",
affectsModuleResolution: true,
category: ts.Diagnostics.Modules,
description: ts.Diagnostics.Enable_importing_json_files,
defaultValueDescription: "false"
},
{
name: "out",
type: "string",
affectsEmit: true,
isFilePath: false,
// for correct behaviour, please use outFile
category: ts.Diagnostics.Backwards_Compatibility,
paramType: ts.Diagnostics.FILE,
transpileOptionValue: undefined,
defaultValueDescription: "n/a",
description: ts.Diagnostics.Deprecated_setting_Use_outFile_instead,
},
{
name: "reactNamespace",
type: "string",
affectsEmit: true,
category: ts.Diagnostics.Language_and_Environment,
description: ts.Diagnostics.Specify_the_object_invoked_for_createElement_This_only_applies_when_targeting_react_JSX_emit,
defaultValueDescription: "`React`",
},
{
name: "skipDefaultLibCheck",
type: "boolean",
category: ts.Diagnostics.Completeness,
description: ts.Diagnostics.Skip_type_checking_d_ts_files_that_are_included_with_TypeScript,
defaultValueDescription: "false",
},
{
name: "charset",
type: "string",
category: ts.Diagnostics.Backwards_Compatibility,
description: ts.Diagnostics.No_longer_supported_In_early_versions_manually_set_the_text_encoding_for_reading_files,
defaultValueDescription: "utf8"
},
{
name: "emitBOM",
type: "boolean",
affectsEmit: true,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Emit_a_UTF_8_Byte_Order_Mark_BOM_in_the_beginning_of_output_files,
defaultValueDescription: "false"
},
{
name: "newLine",
type: new ts.Map(ts.getEntries({
crlf: 0 /* CarriageReturnLineFeed */,
lf: 1 /* LineFeed */
})),
affectsEmit: true,
paramType: ts.Diagnostics.NEWLINE,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Set_the_newline_character_for_emitting_files,
defaultValueDescription: ts.Diagnostics.Platform_specific
},
{
name: "noErrorTruncation",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Output_Formatting,
description: ts.Diagnostics.Disable_truncating_types_in_error_messages,
defaultValueDescription: "false"
},
{
name: "noLib",
type: "boolean",
category: ts.Diagnostics.Language_and_Environment,
affectsProgramStructure: true,
description: ts.Diagnostics.Disable_including_any_library_files_including_the_default_lib_d_ts,
// We are not returning a sourceFile for lib file when asked by the program,
// so pass --noLib to avoid reporting a file not found error.
transpileOptionValue: true,
defaultValueDescription: "false"
},
{
name: "noResolve",
type: "boolean",
affectsModuleResolution: true,
category: ts.Diagnostics.Modules,
description: ts.Diagnostics.Disallow_import_s_require_s_or_reference_s_from_expanding_the_number_of_files_TypeScript_should_add_to_a_project,
// We are not doing a full typecheck, we are not resolving the whole context,
// so pass --noResolve to avoid reporting missing file errors.
transpileOptionValue: true,
defaultValueDescription: "false"
},
{
name: "stripInternal",
type: "boolean",
affectsEmit: true,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Disable_emitting_declarations_that_have_internal_in_their_JSDoc_comments,
},
{
name: "disableSizeLimit",
type: "boolean",
affectsProgramStructure: true,
category: ts.Diagnostics.Editor_Support,
description: ts.Diagnostics.Remove_the_20mb_cap_on_total_source_code_size_for_JavaScript_files_in_the_TypeScript_language_server,
defaultValueDescription: "false"
},
{
name: "disableSourceOfProjectReferenceRedirect",
type: "boolean",
isTSConfigOnly: true,
category: ts.Diagnostics.Projects,
description: ts.Diagnostics.Disable_preferring_source_files_instead_of_declaration_files_when_referencing_composite_projects
},
{
name: "disableSolutionSearching",
type: "boolean",
isTSConfigOnly: true,
category: ts.Diagnostics.Projects,
description: ts.Diagnostics.Opt_a_project_out_of_multi_project_reference_checking_when_editing
},
{
name: "disableReferencedProjectLoad",
type: "boolean",
isTSConfigOnly: true,
category: ts.Diagnostics.Projects,
description: ts.Diagnostics.Reduce_the_number_of_projects_loaded_automatically_by_TypeScript
},
{
name: "noImplicitUseStrict",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Backwards_Compatibility,
description: ts.Diagnostics.Disable_adding_use_strict_directives_in_emitted_JavaScript_files,
defaultValueDescription: "false"
},
{
name: "noEmitHelpers",
type: "boolean",
affectsEmit: true,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Disable_generating_custom_helper_functions_like_extends_in_compiled_output,
defaultValueDescription: "false"
},
{
name: "noEmitOnError",
type: "boolean",
affectsEmit: true,
category: ts.Diagnostics.Emit,
transpileOptionValue: undefined,
description: ts.Diagnostics.Disable_emitting_files_if_any_type_checking_errors_are_reported,
defaultValueDescription: "false"
},
{
name: "preserveConstEnums",
type: "boolean",
affectsEmit: true,
category: ts.Diagnostics.Emit,
description: ts.Diagnostics.Disable_erasing_const_enum_declarations_in_generated_code,
defaultValueDescription: "n/a"
},
{
name: "declarationDir",
type: "string",
affectsEmit: true,
isFilePath: true,
paramType: ts.Diagnostics.DIRECTORY,
category: ts.Diagnostics.Emit,
transpileOptionValue: undefined,
description: ts.Diagnostics.Specify_the_output_directory_for_generated_declaration_files,
defaultValueDescription: "n/a"
},
{
name: "skipLibCheck",
type: "boolean",
category: ts.Diagnostics.Completeness,
description: ts.Diagnostics.Skip_type_checking_all_d_ts_files,
defaultValueDescription: "false"
},
{
name: "allowUnusedLabels",
type: "boolean",
affectsBindDiagnostics: true,
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Disable_error_reporting_for_unused_labels,
defaultValueDescription: "undefined"
},
{
name: "allowUnreachableCode",
type: "boolean",
affectsBindDiagnostics: true,
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Type_Checking,
description: ts.Diagnostics.Disable_error_reporting_for_unreachable_code,
defaultValueDescription: "undefined"
},
{
name: "suppressExcessPropertyErrors",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Backwards_Compatibility,
description: ts.Diagnostics.Disable_reporting_of_excess_property_errors_during_the_creation_of_object_literals,
defaultValueDescription: "false"
},
{
name: "suppressImplicitAnyIndexErrors",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Backwards_Compatibility,
description: ts.Diagnostics.Suppress_noImplicitAny_errors_when_indexing_objects_that_lack_index_signatures,
defaultValueDescription: "false"
},
{
name: "forceConsistentCasingInFileNames",
type: "boolean",
affectsModuleResolution: true,
category: ts.Diagnostics.Interop_Constraints,
description: ts.Diagnostics.Ensure_that_casing_is_correct_in_imports,
defaultValueDescription: "false"
},
{
name: "maxNodeModuleJsDepth",
type: "number",
affectsModuleResolution: true,
category: ts.Diagnostics.JavaScript_Support,
description: ts.Diagnostics.Specify_the_maximum_folder_depth_used_for_checking_JavaScript_files_from_node_modules_Only_applicable_with_allowJs,
defaultValueDescription: "0"
},
{
name: "noStrictGenericChecks",
type: "boolean",
affectsSemanticDiagnostics: true,
category: ts.Diagnostics.Backwards_Compatibility,
description: ts.Diagnostics.Disable_strict_checking_of_generic_signatures_in_function_types,
defaultValueDescription: "false"
},
{
name: "useDefineForClassFields",
type: "boolean",
affectsSemanticDiagnostics: true,
affectsEmit: true,
category: ts.Diagnostics.Language_and_Environment,
description: ts.Diagnostics.Emit_ECMAScript_standard_compliant_class_fields,
defaultValueDescription: "false"
},
{
name: "keyofStringsOnly",
type: "boolean",
category: ts.Diagnostics.Backwards_Compatibility,
description: ts.Diagnostics.Make_keyof_only_return_strings_instead_of_string_numbers_or_symbols_Legacy_option,
defaultValueDescription: "false"
},
{
// A list of plugins to load in the language service
name: "plugins",
type: "list",
isTSConfigOnly: true,
element: {
name: "plugin",
type: "object"
},
description: ts.Diagnostics.List_of_language_service_plugins,
category: ts.Diagnostics.Editor_Support,
},
];
/* @internal */
ts.optionDeclarations = __spreadArray(__spreadArray([], ts.commonOptionsWithBuild, true), commandOptionsWithoutBuild, true);
/* @internal */
ts.semanticDiagnosticsOptionDeclarations = ts.optionDeclarations.filter(function (option) { return !!option.affectsSemanticDiagnostics; });
/* @internal */
ts.affectsEmitOptionDeclarations = ts.optionDeclarations.filter(function (option) { return !!option.affectsEmit; });
/* @internal */
ts.moduleResolutionOptionDeclarations = ts.optionDeclarations.filter(function (option) { return !!option.affectsModuleResolution; });
/* @internal */
ts.sourceFileAffectingCompilerOptions = ts.optionDeclarations.filter(function (option) {
return !!option.affectsSourceFile || !!option.affectsModuleResolution || !!option.affectsBindDiagnostics;
});
/* @internal */
ts.optionsAffectingProgramStructure = ts.optionDeclarations.filter(function (option) { return !!option.affectsProgramStructure; });
/* @internal */
ts.transpileOptionValueCompilerOptions = ts.optionDeclarations.filter(function (option) {
return ts.hasProperty(option, "transpileOptionValue");
});
// Build related options
/* @internal */
ts.optionsForBuild = [
{
name: "verbose",
shortName: "v",
category: ts.Diagnostics.Command_line_Options,
description: ts.Diagnostics.Enable_verbose_logging,
type: "boolean"
},
{
name: "dry",
shortName: "d",
category: ts.Diagnostics.Command_line_Options,
description: ts.Diagnostics.Show_what_would_be_built_or_deleted_if_specified_with_clean,
type: "boolean"
},
{
name: "force",
shortName: "f",
category: ts.Diagnostics.Command_line_Options,
description: ts.Diagnostics.Build_all_projects_including_those_that_appear_to_be_up_to_date,
type: "boolean"
},
{
name: "clean",
category: ts.Diagnostics.Command_line_Options,
description: ts.Diagnostics.Delete_the_outputs_of_all_projects,
type: "boolean"
}
];
/* @internal */
ts.buildOpts = __spreadArray(__spreadArray([], ts.commonOptionsWithBuild, true), ts.optionsForBuild, true);
/* @internal */
ts.typeAcquisitionDeclarations = [
{
/* @deprecated typingOptions.enableAutoDiscovery
* Use typeAcquisition.enable instead.
*/
name: "enableAutoDiscovery",
type: "boolean",
},
{
name: "enable",
type: "boolean",
},
{
name: "include",
type: "list",
element: {
name: "include",
type: "string"
}
},
{
name: "exclude",
type: "list",
element: {
name: "exclude",
type: "string"
}
},
{
name: "disableFilenameBasedTypeAcquisition",
type: "boolean",
},
];
/*@internal*/
function createOptionNameMap(optionDeclarations) {
var optionsNameMap = new ts.Map();
var shortOptionNames = new ts.Map();
ts.forEach(optionDeclarations, function (option) {
optionsNameMap.set(option.name.toLowerCase(), option);
if (option.shortName) {
shortOptionNames.set(option.shortName, option.name);
}
});
return { optionsNameMap: optionsNameMap, shortOptionNames: shortOptionNames };
}
ts.createOptionNameMap = createOptionNameMap;
var optionsNameMapCache;
/* @internal */
function getOptionsNameMap() {
return optionsNameMapCache || (optionsNameMapCache = createOptionNameMap(ts.optionDeclarations));
}
ts.getOptionsNameMap = getOptionsNameMap;
var compilerOptionsAlternateMode = {
diagnostic: ts.Diagnostics.Compiler_option_0_may_only_be_used_with_build,
getOptionsNameMap: getBuildOptionsNameMap
};
/* @internal */
ts.defaultInitCompilerOptions = {
module: ts.ModuleKind.CommonJS,
target: 1 /* ES5 */,
strict: true,
esModuleInterop: true,
forceConsistentCasingInFileNames: true,
skipLibCheck: true
};
/* @internal */
function convertEnableAutoDiscoveryToEnable(typeAcquisition) {
// Convert deprecated typingOptions.enableAutoDiscovery to typeAcquisition.enable
if (typeAcquisition && typeAcquisition.enableAutoDiscovery !== undefined && typeAcquisition.enable === undefined) {
return {
enable: typeAcquisition.enableAutoDiscovery,
include: typeAcquisition.include || [],
exclude: typeAcquisition.exclude || []
};
}
return typeAcquisition;
}
ts.convertEnableAutoDiscoveryToEnable = convertEnableAutoDiscoveryToEnable;
/* @internal */
function createCompilerDiagnosticForInvalidCustomType(opt) {
return createDiagnosticForInvalidCustomType(opt, ts.createCompilerDiagnostic);
}
ts.createCompilerDiagnosticForInvalidCustomType = createCompilerDiagnosticForInvalidCustomType;
function createDiagnosticForInvalidCustomType(opt, createDiagnostic) {
var namesOfType = ts.arrayFrom(opt.type.keys()).map(function (key) { return "'" + key + "'"; }).join(", ");
return createDiagnostic(ts.Diagnostics.Argument_for_0_option_must_be_Colon_1, "--" + opt.name, namesOfType);
}
/* @internal */
function parseCustomTypeOption(opt, value, errors) {
return convertJsonOptionOfCustomType(opt, ts.trimString(value || ""), errors);
}
ts.parseCustomTypeOption = parseCustomTypeOption;
/* @internal */
function parseListTypeOption(opt, value, errors) {
if (value === void 0) { value = ""; }
value = ts.trimString(value);
if (ts.startsWith(value, "-")) {
return undefined;
}
if (value === "") {
return [];
}
var values = value.split(",");
switch (opt.element.type) {
case "number":
return ts.mapDefined(values, function (v) { return validateJsonOptionValue(opt.element, parseInt(v), errors); });
case "string":
return ts.mapDefined(values, function (v) { return validateJsonOptionValue(opt.element, v || "", errors); });
default:
return ts.mapDefined(values, function (v) { return parseCustomTypeOption(opt.element, v, errors); });
}
}
ts.parseListTypeOption = parseListTypeOption;
function getOptionName(option) {
return option.name;
}
function createUnknownOptionError(unknownOption, diagnostics, createDiagnostics, unknownOptionErrorText) {
var _a;
if ((_a = diagnostics.alternateMode) === null || _a === void 0 ? void 0 : _a.getOptionsNameMap().optionsNameMap.has(unknownOption.toLowerCase())) {
return createDiagnostics(diagnostics.alternateMode.diagnostic, unknownOption);
}
var possibleOption = ts.getSpellingSuggestion(unknownOption, diagnostics.optionDeclarations, getOptionName);
return possibleOption ?
createDiagnostics(diagnostics.unknownDidYouMeanDiagnostic, unknownOptionErrorText || unknownOption, possibleOption.name) :
createDiagnostics(diagnostics.unknownOptionDiagnostic, unknownOptionErrorText || unknownOption);
}
/*@internal*/
function parseCommandLineWorker(diagnostics, commandLine, readFile) {
var options = {};
var watchOptions;
var fileNames = [];
var errors = [];
parseStrings(commandLine);
return {
options: options,
watchOptions: watchOptions,
fileNames: fileNames,
errors: errors
};
function parseStrings(args) {
var i = 0;
while (i < args.length) {
var s = args[i];
i++;
if (s.charCodeAt(0) === 64 /* at */) {
parseResponseFile(s.slice(1));
}
else if (s.charCodeAt(0) === 45 /* minus */) {
var inputOptionName = s.slice(s.charCodeAt(1) === 45 /* minus */ ? 2 : 1);
var opt = getOptionDeclarationFromName(diagnostics.getOptionsNameMap, inputOptionName, /*allowShort*/ true);
if (opt) {
i = parseOptionValue(args, i, diagnostics, opt, options, errors);
}
else {
var watchOpt = getOptionDeclarationFromName(watchOptionsDidYouMeanDiagnostics.getOptionsNameMap, inputOptionName, /*allowShort*/ true);
if (watchOpt) {
i = parseOptionValue(args, i, watchOptionsDidYouMeanDiagnostics, watchOpt, watchOptions || (watchOptions = {}), errors);
}
else {
errors.push(createUnknownOptionError(inputOptionName, diagnostics, ts.createCompilerDiagnostic, s));
}
}
}
else {
fileNames.push(s);
}
}
}
function parseResponseFile(fileName) {
var text = tryReadFile(fileName, readFile || (function (fileName) { return ts.sys.readFile(fileName); }));
if (!ts.isString(text)) {
errors.push(text);
return;
}
var args = [];
var pos = 0;
while (true) {
while (pos < text.length && text.charCodeAt(pos) <= 32 /* space */)
pos++;
if (pos >= text.length)
break;
var start = pos;
if (text.charCodeAt(start) === 34 /* doubleQuote */) {
pos++;
while (pos < text.length && text.charCodeAt(pos) !== 34 /* doubleQuote */)
pos++;
if (pos < text.length) {
args.push(text.substring(start + 1, pos));
pos++;
}
else {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Unterminated_quoted_string_in_response_file_0, fileName));
}
}
else {
while (text.charCodeAt(pos) > 32 /* space */)
pos++;
args.push(text.substring(start, pos));
}
}
parseStrings(args);
}
}
ts.parseCommandLineWorker = parseCommandLineWorker;
function parseOptionValue(args, i, diagnostics, opt, options, errors) {
if (opt.isTSConfigOnly) {
var optValue = args[i];
if (optValue === "null") {
options[opt.name] = undefined;
i++;
}
else if (opt.type === "boolean") {
if (optValue === "false") {
options[opt.name] = validateJsonOptionValue(opt, /*value*/ false, errors);
i++;
}
else {
if (optValue === "true")
i++;
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Option_0_can_only_be_specified_in_tsconfig_json_file_or_set_to_false_or_null_on_command_line, opt.name));
}
}
else {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Option_0_can_only_be_specified_in_tsconfig_json_file_or_set_to_null_on_command_line, opt.name));
if (optValue && !ts.startsWith(optValue, "-"))
i++;
}
}
else {
// Check to see if no argument was provided (e.g. "--locale" is the last command-line argument).
if (!args[i] && opt.type !== "boolean") {
errors.push(ts.createCompilerDiagnostic(diagnostics.optionTypeMismatchDiagnostic, opt.name, getCompilerOptionValueTypeString(opt)));
}
if (args[i] !== "null") {
switch (opt.type) {
case "number":
options[opt.name] = validateJsonOptionValue(opt, parseInt(args[i]), errors);
i++;
break;
case "boolean":
// boolean flag has optional value true, false, others
var optValue = args[i];
options[opt.name] = validateJsonOptionValue(opt, optValue !== "false", errors);
// consume next argument as boolean flag value
if (optValue === "false" || optValue === "true") {
i++;
}
break;
case "string":
options[opt.name] = validateJsonOptionValue(opt, args[i] || "", errors);
i++;
break;
case "list":
var result = parseListTypeOption(opt, args[i], errors);
options[opt.name] = result || [];
if (result) {
i++;
}
break;
// If not a primitive, the possible types are specified in what is effectively a map of options.
default:
options[opt.name] = parseCustomTypeOption(opt, args[i], errors);
i++;
break;
}
}
else {
options[opt.name] = undefined;
i++;
}
}
return i;
}
/*@internal*/
ts.compilerOptionsDidYouMeanDiagnostics = {
alternateMode: compilerOptionsAlternateMode,
getOptionsNameMap: getOptionsNameMap,
optionDeclarations: ts.optionDeclarations,
unknownOptionDiagnostic: ts.Diagnostics.Unknown_compiler_option_0,
unknownDidYouMeanDiagnostic: ts.Diagnostics.Unknown_compiler_option_0_Did_you_mean_1,
optionTypeMismatchDiagnostic: ts.Diagnostics.Compiler_option_0_expects_an_argument
};
function parseCommandLine(commandLine, readFile) {
return parseCommandLineWorker(ts.compilerOptionsDidYouMeanDiagnostics, commandLine, readFile);
}
ts.parseCommandLine = parseCommandLine;
/** @internal */
function getOptionFromName(optionName, allowShort) {
return getOptionDeclarationFromName(getOptionsNameMap, optionName, allowShort);
}
ts.getOptionFromName = getOptionFromName;
function getOptionDeclarationFromName(getOptionNameMap, optionName, allowShort) {
if (allowShort === void 0) { allowShort = false; }
optionName = optionName.toLowerCase();
var _a = getOptionNameMap(), optionsNameMap = _a.optionsNameMap, shortOptionNames = _a.shortOptionNames;
// Try to translate short option names to their full equivalents.
if (allowShort) {
var short = shortOptionNames.get(optionName);
if (short !== undefined) {
optionName = short;
}
}
return optionsNameMap.get(optionName);
}
var buildOptionsNameMapCache;
function getBuildOptionsNameMap() {
return buildOptionsNameMapCache || (buildOptionsNameMapCache = createOptionNameMap(ts.buildOpts));
}
var buildOptionsAlternateMode = {
diagnostic: ts.Diagnostics.Compiler_option_0_may_not_be_used_with_build,
getOptionsNameMap: getOptionsNameMap
};
var buildOptionsDidYouMeanDiagnostics = {
alternateMode: buildOptionsAlternateMode,
getOptionsNameMap: getBuildOptionsNameMap,
optionDeclarations: ts.buildOpts,
unknownOptionDiagnostic: ts.Diagnostics.Unknown_build_option_0,
unknownDidYouMeanDiagnostic: ts.Diagnostics.Unknown_build_option_0_Did_you_mean_1,
optionTypeMismatchDiagnostic: ts.Diagnostics.Build_option_0_requires_a_value_of_type_1
};
/*@internal*/
function parseBuildCommand(args) {
var _a = parseCommandLineWorker(buildOptionsDidYouMeanDiagnostics, args), options = _a.options, watchOptions = _a.watchOptions, projects = _a.fileNames, errors = _a.errors;
var buildOptions = options;
if (projects.length === 0) {
// tsc -b invoked with no extra arguments; act as if invoked with "tsc -b ."
projects.push(".");
}
// Nonsensical combinations
if (buildOptions.clean && buildOptions.force) {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Options_0_and_1_cannot_be_combined, "clean", "force"));
}
if (buildOptions.clean && buildOptions.verbose) {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Options_0_and_1_cannot_be_combined, "clean", "verbose"));
}
if (buildOptions.clean && buildOptions.watch) {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Options_0_and_1_cannot_be_combined, "clean", "watch"));
}
if (buildOptions.watch && buildOptions.dry) {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Options_0_and_1_cannot_be_combined, "watch", "dry"));
}
return { buildOptions: buildOptions, watchOptions: watchOptions, projects: projects, errors: errors };
}
ts.parseBuildCommand = parseBuildCommand;
/* @internal */
function getDiagnosticText(_message) {
var _args = [];
for (var _i = 1; _i < arguments.length; _i++) {
_args[_i - 1] = arguments[_i];
}
var diagnostic = ts.createCompilerDiagnostic.apply(undefined, arguments);
return diagnostic.messageText;
}
ts.getDiagnosticText = getDiagnosticText;
/**
* Reads the config file, reports errors if any and exits if the config file cannot be found
*/
function getParsedCommandLineOfConfigFile(configFileName, optionsToExtend, host, extendedConfigCache, watchOptionsToExtend, extraFileExtensions) {
var configFileText = tryReadFile(configFileName, function (fileName) { return host.readFile(fileName); });
if (!ts.isString(configFileText)) {
host.onUnRecoverableConfigFileDiagnostic(configFileText);
return undefined;
}
var result = ts.parseJsonText(configFileName, configFileText);
var cwd = host.getCurrentDirectory();
result.path = ts.toPath(configFileName, cwd, ts.createGetCanonicalFileName(host.useCaseSensitiveFileNames));
result.resolvedPath = result.path;
result.originalFileName = result.fileName;
return parseJsonSourceFileConfigFileContent(result, host, ts.getNormalizedAbsolutePath(ts.getDirectoryPath(configFileName), cwd), optionsToExtend, ts.getNormalizedAbsolutePath(configFileName, cwd),
/*resolutionStack*/ undefined, extraFileExtensions, extendedConfigCache, watchOptionsToExtend);
}
ts.getParsedCommandLineOfConfigFile = getParsedCommandLineOfConfigFile;
/**
* Read tsconfig.json file
* @param fileName The path to the config file
*/
function readConfigFile(fileName, readFile) {
var textOrDiagnostic = tryReadFile(fileName, readFile);
return ts.isString(textOrDiagnostic) ? parseConfigFileTextToJson(fileName, textOrDiagnostic) : { config: {}, error: textOrDiagnostic };
}
ts.readConfigFile = readConfigFile;
/**
* Parse the text of the tsconfig.json file
* @param fileName The path to the config file
* @param jsonText The text of the config file
*/
function parseConfigFileTextToJson(fileName, jsonText) {
var jsonSourceFile = ts.parseJsonText(fileName, jsonText);
return {
config: convertConfigFileToObject(jsonSourceFile, jsonSourceFile.parseDiagnostics, /*reportOptionsErrors*/ false, /*optionsIterator*/ undefined),
error: jsonSourceFile.parseDiagnostics.length ? jsonSourceFile.parseDiagnostics[0] : undefined
};
}
ts.parseConfigFileTextToJson = parseConfigFileTextToJson;
/**
* Read tsconfig.json file
* @param fileName The path to the config file
*/
function readJsonConfigFile(fileName, readFile) {
var textOrDiagnostic = tryReadFile(fileName, readFile);
return ts.isString(textOrDiagnostic) ? ts.parseJsonText(fileName, textOrDiagnostic) : { fileName: fileName, parseDiagnostics: [textOrDiagnostic] };
}
ts.readJsonConfigFile = readJsonConfigFile;
/*@internal*/
function tryReadFile(fileName, readFile) {
var text;
try {
text = readFile(fileName);
}
catch (e) {
return ts.createCompilerDiagnostic(ts.Diagnostics.Cannot_read_file_0_Colon_1, fileName, e.message);
}
return text === undefined ? ts.createCompilerDiagnostic(ts.Diagnostics.Cannot_read_file_0, fileName) : text;
}
ts.tryReadFile = tryReadFile;
function commandLineOptionsToMap(options) {
return ts.arrayToMap(options, getOptionName);
}
var typeAcquisitionDidYouMeanDiagnostics = {
optionDeclarations: ts.typeAcquisitionDeclarations,
unknownOptionDiagnostic: ts.Diagnostics.Unknown_type_acquisition_option_0,
unknownDidYouMeanDiagnostic: ts.Diagnostics.Unknown_type_acquisition_option_0_Did_you_mean_1,
};
var watchOptionsNameMapCache;
function getWatchOptionsNameMap() {
return watchOptionsNameMapCache || (watchOptionsNameMapCache = createOptionNameMap(ts.optionsForWatch));
}
var watchOptionsDidYouMeanDiagnostics = {
getOptionsNameMap: getWatchOptionsNameMap,
optionDeclarations: ts.optionsForWatch,
unknownOptionDiagnostic: ts.Diagnostics.Unknown_watch_option_0,
unknownDidYouMeanDiagnostic: ts.Diagnostics.Unknown_watch_option_0_Did_you_mean_1,
optionTypeMismatchDiagnostic: ts.Diagnostics.Watch_option_0_requires_a_value_of_type_1
};
var commandLineCompilerOptionsMapCache;
function getCommandLineCompilerOptionsMap() {
return commandLineCompilerOptionsMapCache || (commandLineCompilerOptionsMapCache = commandLineOptionsToMap(ts.optionDeclarations));
}
var commandLineWatchOptionsMapCache;
function getCommandLineWatchOptionsMap() {
return commandLineWatchOptionsMapCache || (commandLineWatchOptionsMapCache = commandLineOptionsToMap(ts.optionsForWatch));
}
var commandLineTypeAcquisitionMapCache;
function getCommandLineTypeAcquisitionMap() {
return commandLineTypeAcquisitionMapCache || (commandLineTypeAcquisitionMapCache = commandLineOptionsToMap(ts.typeAcquisitionDeclarations));
}
var _tsconfigRootOptions;
function getTsconfigRootOptionsMap() {
if (_tsconfigRootOptions === undefined) {
_tsconfigRootOptions = {
name: undefined,
type: "object",
elementOptions: commandLineOptionsToMap([
{
name: "compilerOptions",
type: "object",
elementOptions: getCommandLineCompilerOptionsMap(),
extraKeyDiagnostics: ts.compilerOptionsDidYouMeanDiagnostics,
},
{
name: "watchOptions",
type: "object",
elementOptions: getCommandLineWatchOptionsMap(),
extraKeyDiagnostics: watchOptionsDidYouMeanDiagnostics,
},
{
name: "typingOptions",
type: "object",
elementOptions: getCommandLineTypeAcquisitionMap(),
extraKeyDiagnostics: typeAcquisitionDidYouMeanDiagnostics,
},
{
name: "typeAcquisition",
type: "object",
elementOptions: getCommandLineTypeAcquisitionMap(),
extraKeyDiagnostics: typeAcquisitionDidYouMeanDiagnostics
},
{
name: "extends",
type: "string",
category: ts.Diagnostics.File_Management,
},
{
name: "references",
type: "list",
element: {
name: "references",
type: "object"
},
category: ts.Diagnostics.Projects,
},
{
name: "files",
type: "list",
element: {
name: "files",
type: "string"
},
category: ts.Diagnostics.File_Management,
},
{
name: "include",
type: "list",
element: {
name: "include",
type: "string"
},
category: ts.Diagnostics.File_Management,
defaultValueDescription: ts.Diagnostics.if_files_is_specified_otherwise_Asterisk_Asterisk_Slash_Asterisk
},
{
name: "exclude",
type: "list",
element: {
name: "exclude",
type: "string"
},
category: ts.Diagnostics.File_Management,
defaultValueDescription: ts.Diagnostics.node_modules_bower_components_jspm_packages_plus_the_value_of_outDir_if_one_is_specified
},
ts.compileOnSaveCommandLineOption
])
};
}
return _tsconfigRootOptions;
}
function convertConfigFileToObject(sourceFile, errors, reportOptionsErrors, optionsIterator) {
var _a;
var rootExpression = (_a = sourceFile.statements[0]) === null || _a === void 0 ? void 0 : _a.expression;
var knownRootOptions = reportOptionsErrors ? getTsconfigRootOptionsMap() : undefined;
if (rootExpression && rootExpression.kind !== 203 /* ObjectLiteralExpression */) {
errors.push(ts.createDiagnosticForNodeInSourceFile(sourceFile, rootExpression, ts.Diagnostics.The_root_value_of_a_0_file_must_be_an_object, ts.getBaseFileName(sourceFile.fileName) === "jsconfig.json" ? "jsconfig.json" : "tsconfig.json"));
// Last-ditch error recovery. Somewhat useful because the JSON parser will recover from some parse errors by
// synthesizing a top-level array literal expression. There's a reasonable chance the first element of that
// array is a well-formed configuration object, made into an array element by stray characters.
if (ts.isArrayLiteralExpression(rootExpression)) {
var firstObject = ts.find(rootExpression.elements, ts.isObjectLiteralExpression);
if (firstObject) {
return convertToObjectWorker(sourceFile, firstObject, errors, /*returnValue*/ true, knownRootOptions, optionsIterator);
}
}
return {};
}
return convertToObjectWorker(sourceFile, rootExpression, errors, /*returnValue*/ true, knownRootOptions, optionsIterator);
}
/**
* Convert the json syntax tree into the json value
*/
function convertToObject(sourceFile, errors) {
var _a;
return convertToObjectWorker(sourceFile, (_a = sourceFile.statements[0]) === null || _a === void 0 ? void 0 : _a.expression, errors, /*returnValue*/ true, /*knownRootOptions*/ undefined, /*jsonConversionNotifier*/ undefined);
}
ts.convertToObject = convertToObject;
/**
* Convert the json syntax tree into the json value and report errors
* This returns the json value (apart from checking errors) only if returnValue provided is true.
* Otherwise it just checks the errors and returns undefined
*/
/*@internal*/
function convertToObjectWorker(sourceFile, rootExpression, errors, returnValue, knownRootOptions, jsonConversionNotifier) {
if (!rootExpression) {
return returnValue ? {} : undefined;
}
return convertPropertyValueToJson(rootExpression, knownRootOptions);
function isRootOptionMap(knownOptions) {
return knownRootOptions && knownRootOptions.elementOptions === knownOptions;
}
function convertObjectLiteralExpressionToJson(node, knownOptions, extraKeyDiagnostics, parentOption) {
var result = returnValue ? {} : undefined;
var _loop_4 = function (element) {
if (element.kind !== 291 /* PropertyAssignment */) {
errors.push(ts.createDiagnosticForNodeInSourceFile(sourceFile, element, ts.Diagnostics.Property_assignment_expected));
return "continue";
}
if (element.questionToken) {
errors.push(ts.createDiagnosticForNodeInSourceFile(sourceFile, element.questionToken, ts.Diagnostics.The_0_modifier_can_only_be_used_in_TypeScript_files, "?"));
}
if (!isDoubleQuotedString(element.name)) {
errors.push(ts.createDiagnosticForNodeInSourceFile(sourceFile, element.name, ts.Diagnostics.String_literal_with_double_quotes_expected));
}
var textOfKey = ts.isComputedNonLiteralName(element.name) ? undefined : ts.getTextOfPropertyName(element.name);
var keyText = textOfKey && ts.unescapeLeadingUnderscores(textOfKey);
var option = keyText && knownOptions ? knownOptions.get(keyText) : undefined;
if (keyText && extraKeyDiagnostics && !option) {
if (knownOptions) {
errors.push(createUnknownOptionError(keyText, extraKeyDiagnostics, function (message, arg0, arg1) { return ts.createDiagnosticForNodeInSourceFile(sourceFile, element.name, message, arg0, arg1); }));
}
else {
errors.push(ts.createDiagnosticForNodeInSourceFile(sourceFile, element.name, extraKeyDiagnostics.unknownOptionDiagnostic, keyText));
}
}
var value = convertPropertyValueToJson(element.initializer, option);
if (typeof keyText !== "undefined") {
if (returnValue) {
result[keyText] = value;
}
// Notify key value set, if user asked for it
if (jsonConversionNotifier &&
// Current callbacks are only on known parent option or if we are setting values in the root
(parentOption || isRootOptionMap(knownOptions))) {
var isValidOptionValue = isCompilerOptionsValue(option, value);
if (parentOption) {
if (isValidOptionValue) {
// Notify option set in the parent if its a valid option value
jsonConversionNotifier.onSetValidOptionKeyValueInParent(parentOption, option, value);
}
}
else if (isRootOptionMap(knownOptions)) {
if (isValidOptionValue) {
// Notify about the valid root key value being set
jsonConversionNotifier.onSetValidOptionKeyValueInRoot(keyText, element.name, value, element.initializer);
}
else if (!option) {
// Notify about the unknown root key value being set
jsonConversionNotifier.onSetUnknownOptionKeyValueInRoot(keyText, element.name, value, element.initializer);
}
}
}
}
};
for (var _i = 0, _a = node.properties; _i < _a.length; _i++) {
var element = _a[_i];
_loop_4(element);
}
return result;
}
function convertArrayLiteralExpressionToJson(elements, elementOption) {
if (!returnValue) {
elements.forEach(function (element) { return convertPropertyValueToJson(element, elementOption); });
return undefined;
}
// Filter out invalid values
return ts.filter(elements.map(function (element) { return convertPropertyValueToJson(element, elementOption); }), function (v) { return v !== undefined; });
}
function convertPropertyValueToJson(valueExpression, option) {
var invalidReported;
switch (valueExpression.kind) {
case 110 /* TrueKeyword */:
reportInvalidOptionValue(option && option.type !== "boolean");
return validateValue(/*value*/ true);
case 95 /* FalseKeyword */:
reportInvalidOptionValue(option && option.type !== "boolean");
return validateValue(/*value*/ false);
case 104 /* NullKeyword */:
reportInvalidOptionValue(option && option.name === "extends"); // "extends" is the only option we don't allow null/undefined for
return validateValue(/*value*/ null); // eslint-disable-line no-null/no-null
case 10 /* StringLiteral */:
if (!isDoubleQuotedString(valueExpression)) {
errors.push(ts.createDiagnosticForNodeInSourceFile(sourceFile, valueExpression, ts.Diagnostics.String_literal_with_double_quotes_expected));
}
reportInvalidOptionValue(option && (ts.isString(option.type) && option.type !== "string"));
var text = valueExpression.text;
if (option && !ts.isString(option.type)) {
var customOption = option;
// Validate custom option type
if (!customOption.type.has(text.toLowerCase())) {
errors.push(createDiagnosticForInvalidCustomType(customOption, function (message, arg0, arg1) { return ts.createDiagnosticForNodeInSourceFile(sourceFile, valueExpression, message, arg0, arg1); }));
invalidReported = true;
}
}
return validateValue(text);
case 8 /* NumericLiteral */:
reportInvalidOptionValue(option && option.type !== "number");
return validateValue(Number(valueExpression.text));
case 217 /* PrefixUnaryExpression */:
if (valueExpression.operator !== 40 /* MinusToken */ || valueExpression.operand.kind !== 8 /* NumericLiteral */) {
break; // not valid JSON syntax
}
reportInvalidOptionValue(option && option.type !== "number");
return validateValue(-Number(valueExpression.operand.text));
case 203 /* ObjectLiteralExpression */:
reportInvalidOptionValue(option && option.type !== "object");
var objectLiteralExpression = valueExpression;
// Currently having element option declaration in the tsconfig with type "object"
// determines if it needs onSetValidOptionKeyValueInParent callback or not
// At moment there are only "compilerOptions", "typeAcquisition" and "typingOptions"
// that satifies it and need it to modify options set in them (for normalizing file paths)
// vs what we set in the json
// If need arises, we can modify this interface and callbacks as needed
if (option) {
var _a = option, elementOptions = _a.elementOptions, extraKeyDiagnostics = _a.extraKeyDiagnostics, optionName = _a.name;
return validateValue(convertObjectLiteralExpressionToJson(objectLiteralExpression, elementOptions, extraKeyDiagnostics, optionName));
}
else {
return validateValue(convertObjectLiteralExpressionToJson(objectLiteralExpression, /* knownOptions*/ undefined,
/*extraKeyDiagnosticMessage */ undefined, /*parentOption*/ undefined));
}
case 202 /* ArrayLiteralExpression */:
reportInvalidOptionValue(option && option.type !== "list");
return validateValue(convertArrayLiteralExpressionToJson(valueExpression.elements, option && option.element));
}
// Not in expected format
if (option) {
reportInvalidOptionValue(/*isError*/ true);
}
else {
errors.push(ts.createDiagnosticForNodeInSourceFile(sourceFile, valueExpression, ts.Diagnostics.Property_value_can_only_be_string_literal_numeric_literal_true_false_null_object_literal_or_array_literal));
}
return undefined;
function validateValue(value) {
var _a;
if (!invalidReported) {
var diagnostic = (_a = option === null || option === void 0 ? void 0 : option.extraValidation) === null || _a === void 0 ? void 0 : _a.call(option, value);
if (diagnostic) {
errors.push(ts.createDiagnosticForNodeInSourceFile.apply(void 0, __spreadArray([sourceFile, valueExpression], diagnostic, false)));
return undefined;
}
}
return value;
}
function reportInvalidOptionValue(isError) {
if (isError) {
errors.push(ts.createDiagnosticForNodeInSourceFile(sourceFile, valueExpression, ts.Diagnostics.Compiler_option_0_requires_a_value_of_type_1, option.name, getCompilerOptionValueTypeString(option)));
invalidReported = true;
}
}
}
function isDoubleQuotedString(node) {
return ts.isStringLiteral(node) && ts.isStringDoubleQuoted(node, sourceFile);
}
}
ts.convertToObjectWorker = convertToObjectWorker;
function getCompilerOptionValueTypeString(option) {
return option.type === "list" ?
"Array" :
ts.isString(option.type) ? option.type : "string";
}
function isCompilerOptionsValue(option, value) {
if (option) {
if (isNullOrUndefined(value))
return true; // All options are undefinable/nullable
if (option.type === "list") {
return ts.isArray(value);
}
var expectedType = ts.isString(option.type) ? option.type : "string";
return typeof value === expectedType;
}
return false;
}
/**
* Generate an uncommented, complete tsconfig for use with "--showConfig"
* @param configParseResult options to be generated into tsconfig.json
* @param configFileName name of the parsed config file - output paths will be generated relative to this
* @param host provides current directory and case sensitivity services
*/
/** @internal */
function convertToTSConfig(configParseResult, configFileName, host) {
var _a, _b, _c;
var getCanonicalFileName = ts.createGetCanonicalFileName(host.useCaseSensitiveFileNames);
var files = ts.map(ts.filter(configParseResult.fileNames, !((_b = (_a = configParseResult.options.configFile) === null || _a === void 0 ? void 0 : _a.configFileSpecs) === null || _b === void 0 ? void 0 : _b.validatedIncludeSpecs) ? ts.returnTrue : matchesSpecs(configFileName, configParseResult.options.configFile.configFileSpecs.validatedIncludeSpecs, configParseResult.options.configFile.configFileSpecs.validatedExcludeSpecs, host)), function (f) { return ts.getRelativePathFromFile(ts.getNormalizedAbsolutePath(configFileName, host.getCurrentDirectory()), ts.getNormalizedAbsolutePath(f, host.getCurrentDirectory()), getCanonicalFileName); });
var optionMap = serializeCompilerOptions(configParseResult.options, { configFilePath: ts.getNormalizedAbsolutePath(configFileName, host.getCurrentDirectory()), useCaseSensitiveFileNames: host.useCaseSensitiveFileNames });
var watchOptionMap = configParseResult.watchOptions && serializeWatchOptions(configParseResult.watchOptions);
var config = __assign(__assign({ compilerOptions: __assign(__assign({}, optionMapToObject(optionMap)), { showConfig: undefined, configFile: undefined, configFilePath: undefined, help: undefined, init: undefined, listFiles: undefined, listEmittedFiles: undefined, project: undefined, build: undefined, version: undefined }), watchOptions: watchOptionMap && optionMapToObject(watchOptionMap), references: ts.map(configParseResult.projectReferences, function (r) { return (__assign(__assign({}, r), { path: r.originalPath ? r.originalPath : "", originalPath: undefined })); }), files: ts.length(files) ? files : undefined }, (((_c = configParseResult.options.configFile) === null || _c === void 0 ? void 0 : _c.configFileSpecs) ? {
include: filterSameAsDefaultInclude(configParseResult.options.configFile.configFileSpecs.validatedIncludeSpecs),
exclude: configParseResult.options.configFile.configFileSpecs.validatedExcludeSpecs
} : {})), { compileOnSave: !!configParseResult.compileOnSave ? true : undefined });
return config;
}
ts.convertToTSConfig = convertToTSConfig;
function optionMapToObject(optionMap) {
return __assign({}, ts.arrayFrom(optionMap.entries()).reduce(function (prev, cur) {
var _a;
return (__assign(__assign({}, prev), (_a = {}, _a[cur[0]] = cur[1], _a)));
}, {}));
}
function filterSameAsDefaultInclude(specs) {
if (!ts.length(specs))
return undefined;
if (ts.length(specs) !== 1)
return specs;
if (specs[0] === "**/*")
return undefined;
return specs;
}
function matchesSpecs(path, includeSpecs, excludeSpecs, host) {
if (!includeSpecs)
return ts.returnTrue;
var patterns = ts.getFileMatcherPatterns(path, excludeSpecs, includeSpecs, host.useCaseSensitiveFileNames, host.getCurrentDirectory());
var excludeRe = patterns.excludePattern && ts.getRegexFromPattern(patterns.excludePattern, host.useCaseSensitiveFileNames);
var includeRe = patterns.includeFilePattern && ts.getRegexFromPattern(patterns.includeFilePattern, host.useCaseSensitiveFileNames);
if (includeRe) {
if (excludeRe) {
return function (path) { return !(includeRe.test(path) && !excludeRe.test(path)); };
}
return function (path) { return !includeRe.test(path); };
}
if (excludeRe) {
return function (path) { return excludeRe.test(path); };
}
return ts.returnTrue;
}
function getCustomTypeMapOfCommandLineOption(optionDefinition) {
if (optionDefinition.type === "string" || optionDefinition.type === "number" || optionDefinition.type === "boolean" || optionDefinition.type === "object") {
// this is of a type CommandLineOptionOfPrimitiveType
return undefined;
}
else if (optionDefinition.type === "list") {
return getCustomTypeMapOfCommandLineOption(optionDefinition.element);
}
else {
return optionDefinition.type;
}
}
function getNameOfCompilerOptionValue(value, customTypeMap) {
// There is a typeMap associated with this command-line option so use it to map value back to its name
return ts.forEachEntry(customTypeMap, function (mapValue, key) {
if (mapValue === value) {
return key;
}
});
}
function serializeCompilerOptions(options, pathOptions) {
return serializeOptionBaseObject(options, getOptionsNameMap(), pathOptions);
}
function serializeWatchOptions(options) {
return serializeOptionBaseObject(options, getWatchOptionsNameMap());
}
function serializeOptionBaseObject(options, _a, pathOptions) {
var optionsNameMap = _a.optionsNameMap;
var result = new ts.Map();
var getCanonicalFileName = pathOptions && ts.createGetCanonicalFileName(pathOptions.useCaseSensitiveFileNames);
var _loop_5 = function (name) {
if (ts.hasProperty(options, name)) {
// tsconfig only options cannot be specified via command line,
// so we can assume that only types that can appear here string | number | boolean
if (optionsNameMap.has(name) && (optionsNameMap.get(name).category === ts.Diagnostics.Command_line_Options || optionsNameMap.get(name).category === ts.Diagnostics.Output_Formatting)) {
return "continue";
}
var value = options[name];
var optionDefinition = optionsNameMap.get(name.toLowerCase());
if (optionDefinition) {
var customTypeMap_1 = getCustomTypeMapOfCommandLineOption(optionDefinition);
if (!customTypeMap_1) {
// There is no map associated with this compiler option then use the value as-is
// This is the case if the value is expect to be string, number, boolean or list of string
if (pathOptions && optionDefinition.isFilePath) {
result.set(name, ts.getRelativePathFromFile(pathOptions.configFilePath, ts.getNormalizedAbsolutePath(value, ts.getDirectoryPath(pathOptions.configFilePath)), getCanonicalFileName));
}
else {
result.set(name, value);
}
}
else {
if (optionDefinition.type === "list") {
result.set(name, value.map(function (element) { return getNameOfCompilerOptionValue(element, customTypeMap_1); })); // TODO: GH#18217
}
else {
// There is a typeMap associated with this command-line option so use it to map value back to its name
result.set(name, getNameOfCompilerOptionValue(value, customTypeMap_1));
}
}
}
}
};
for (var name in options) {
_loop_5(name);
}
return result;
}
/**
* Generate tsconfig configuration when running command line "--init"
* @param options commandlineOptions to be generated into tsconfig.json
* @param fileNames array of filenames to be generated into tsconfig.json
*/
/* @internal */
function generateTSConfig(options, fileNames, newLine) {
var compilerOptions = ts.extend(options, ts.defaultInitCompilerOptions);
var compilerOptionsMap = serializeCompilerOptions(compilerOptions);
return writeConfigurations();
function getDefaultValueForOption(option) {
switch (option.type) {
case "number":
return 1;
case "boolean":
return true;
case "string":
return option.isFilePath ? "./" : "";
case "list":
return [];
case "object":
return {};
default:
var iterResult = option.type.keys().next();
if (!iterResult.done)
return iterResult.value;
return ts.Debug.fail("Expected 'option.type' to have entries.");
}
}
function makePadding(paddingLength) {
return Array(paddingLength + 1).join(" ");
}
function isAllowedOptionForOutput(_a) {
var category = _a.category, name = _a.name, isCommandLineOnly = _a.isCommandLineOnly;
// Skip options which do not have a category or have categories which are more niche
var categoriesToSkip = [ts.Diagnostics.Command_line_Options, ts.Diagnostics.Editor_Support, ts.Diagnostics.Compiler_Diagnostics, ts.Diagnostics.Backwards_Compatibility, ts.Diagnostics.Watch_and_Build_Modes, ts.Diagnostics.Output_Formatting];
return !isCommandLineOnly && category !== undefined && (!categoriesToSkip.includes(category) || compilerOptionsMap.has(name));
}
function writeConfigurations() {
// Filter applicable options to place in the file
var categorizedOptions = ts.createMultiMap();
for (var _i = 0, optionDeclarations_1 = ts.optionDeclarations; _i < optionDeclarations_1.length; _i++) {
var option = optionDeclarations_1[_i];
var category = option.category;
if (isAllowedOptionForOutput(option)) {
categorizedOptions.add(ts.getLocaleSpecificMessage(category), option);
}
}
// Serialize all options and their descriptions
var marginLength = 0;
var seenKnownKeys = 0;
var entries = [];
categorizedOptions.forEach(function (options, category) {
if (entries.length !== 0) {
entries.push({ value: "" });
}
entries.push({ value: "/* " + category + " */" });
for (var _i = 0, options_1 = options; _i < options_1.length; _i++) {
var option = options_1[_i];
var optionName = void 0;
if (compilerOptionsMap.has(option.name)) {
optionName = "\"" + option.name + "\": " + JSON.stringify(compilerOptionsMap.get(option.name)) + ((seenKnownKeys += 1) === compilerOptionsMap.size ? "" : ",");
}
else {
optionName = "// \"" + option.name + "\": " + JSON.stringify(getDefaultValueForOption(option)) + ",";
}
entries.push({
value: optionName,
description: "/* " + (option.description && ts.getLocaleSpecificMessage(option.description) || option.name) + " */"
});
marginLength = Math.max(optionName.length, marginLength);
}
});
// Write the output
var tab = makePadding(2);
var result = [];
result.push("{");
result.push(tab + "\"compilerOptions\": {");
result.push("" + tab + tab + "/* " + ts.getLocaleSpecificMessage(ts.Diagnostics.Visit_https_Colon_Slash_Slashaka_ms_Slashtsconfig_json_to_read_more_about_this_file) + " */");
result.push("");
// Print out each row, aligning all the descriptions on the same column.
for (var _a = 0, entries_2 = entries; _a < entries_2.length; _a++) {
var entry = entries_2[_a];
var value = entry.value, _b = entry.description, description = _b === void 0 ? "" : _b;
result.push(value && "" + tab + tab + value + (description && (makePadding(marginLength - value.length + 2) + description)));
}
if (fileNames.length) {
result.push(tab + "},");
result.push(tab + "\"files\": [");
for (var i = 0; i < fileNames.length; i++) {
result.push("" + tab + tab + JSON.stringify(fileNames[i]) + (i === fileNames.length - 1 ? "" : ","));
}
result.push(tab + "]");
}
else {
result.push(tab + "}");
}
result.push("}");
return result.join(newLine) + newLine;
}
}
ts.generateTSConfig = generateTSConfig;
/* @internal */
function convertToOptionsWithAbsolutePaths(options, toAbsolutePath) {
var result = {};
var optionsNameMap = getOptionsNameMap().optionsNameMap;
for (var name in options) {
if (ts.hasProperty(options, name)) {
result[name] = convertToOptionValueWithAbsolutePaths(optionsNameMap.get(name.toLowerCase()), options[name], toAbsolutePath);
}
}
if (result.configFilePath) {
result.configFilePath = toAbsolutePath(result.configFilePath);
}
return result;
}
ts.convertToOptionsWithAbsolutePaths = convertToOptionsWithAbsolutePaths;
function convertToOptionValueWithAbsolutePaths(option, value, toAbsolutePath) {
if (option && !isNullOrUndefined(value)) {
if (option.type === "list") {
var values = value;
if (option.element.isFilePath && values.length) {
return values.map(toAbsolutePath);
}
}
else if (option.isFilePath) {
return toAbsolutePath(value);
}
}
return value;
}
/**
* Parse the contents of a config file (tsconfig.json).
* @param json The contents of the config file to parse
* @param host Instance of ParseConfigHost used to enumerate files in folder.
* @param basePath A root directory to resolve relative path entries in the config
* file to. e.g. outDir
*/
function parseJsonConfigFileContent(json, host, basePath, existingOptions, configFileName, resolutionStack, extraFileExtensions, extendedConfigCache, existingWatchOptions) {
return parseJsonConfigFileContentWorker(json, /*sourceFile*/ undefined, host, basePath, existingOptions, existingWatchOptions, configFileName, resolutionStack, extraFileExtensions, extendedConfigCache);
}
ts.parseJsonConfigFileContent = parseJsonConfigFileContent;
/**
* Parse the contents of a config file (tsconfig.json).
* @param jsonNode The contents of the config file to parse
* @param host Instance of ParseConfigHost used to enumerate files in folder.
* @param basePath A root directory to resolve relative path entries in the config
* file to. e.g. outDir
*/
function parseJsonSourceFileConfigFileContent(sourceFile, host, basePath, existingOptions, configFileName, resolutionStack, extraFileExtensions, extendedConfigCache, existingWatchOptions) {
return parseJsonConfigFileContentWorker(/*json*/ undefined, sourceFile, host, basePath, existingOptions, existingWatchOptions, configFileName, resolutionStack, extraFileExtensions, extendedConfigCache);
}
ts.parseJsonSourceFileConfigFileContent = parseJsonSourceFileConfigFileContent;
/*@internal*/
function setConfigFileInOptions(options, configFile) {
if (configFile) {
Object.defineProperty(options, "configFile", { enumerable: false, writable: false, value: configFile });
}
}
ts.setConfigFileInOptions = setConfigFileInOptions;
function isNullOrUndefined(x) {
return x === undefined || x === null; // eslint-disable-line no-null/no-null
}
function directoryOfCombinedPath(fileName, basePath) {
// Use the `getNormalizedAbsolutePath` function to avoid canonicalizing the path, as it must remain noncanonical
// until consistent casing errors are reported
return ts.getDirectoryPath(ts.getNormalizedAbsolutePath(fileName, basePath));
}
/**
* Parse the contents of a config file from json or json source file (tsconfig.json).
* @param json The contents of the config file to parse
* @param sourceFile sourceFile corresponding to the Json
* @param host Instance of ParseConfigHost used to enumerate files in folder.
* @param basePath A root directory to resolve relative path entries in the config
* file to. e.g. outDir
* @param resolutionStack Only present for backwards-compatibility. Should be empty.
*/
function parseJsonConfigFileContentWorker(json, sourceFile, host, basePath, existingOptions, existingWatchOptions, configFileName, resolutionStack, extraFileExtensions, extendedConfigCache) {
if (existingOptions === void 0) { existingOptions = {}; }
if (resolutionStack === void 0) { resolutionStack = []; }
if (extraFileExtensions === void 0) { extraFileExtensions = []; }
ts.Debug.assert((json === undefined && sourceFile !== undefined) || (json !== undefined && sourceFile === undefined));
var errors = [];
var parsedConfig = parseConfig(json, sourceFile, host, basePath, configFileName, resolutionStack, errors, extendedConfigCache);
var raw = parsedConfig.raw;
var options = ts.extend(existingOptions, parsedConfig.options || {});
var watchOptions = existingWatchOptions && parsedConfig.watchOptions ?
ts.extend(existingWatchOptions, parsedConfig.watchOptions) :
parsedConfig.watchOptions || existingWatchOptions;
options.configFilePath = configFileName && ts.normalizeSlashes(configFileName);
var configFileSpecs = getConfigFileSpecs();
if (sourceFile)
sourceFile.configFileSpecs = configFileSpecs;
setConfigFileInOptions(options, sourceFile);
var basePathForFileNames = ts.normalizePath(configFileName ? directoryOfCombinedPath(configFileName, basePath) : basePath);
return {
options: options,
watchOptions: watchOptions,
fileNames: getFileNames(basePathForFileNames),
projectReferences: getProjectReferences(basePathForFileNames),
typeAcquisition: parsedConfig.typeAcquisition || getDefaultTypeAcquisition(),
raw: raw,
errors: errors,
// Wildcard directories (provided as part of a wildcard path) are stored in a
// file map that marks whether it was a regular wildcard match (with a `*` or `?` token),
// or a recursive directory. This information is used by filesystem watchers to monitor for
// new entries in these paths.
wildcardDirectories: getWildcardDirectories(configFileSpecs, basePathForFileNames, host.useCaseSensitiveFileNames),
compileOnSave: !!raw.compileOnSave,
};
function getConfigFileSpecs() {
var referencesOfRaw = getPropFromRaw("references", function (element) { return typeof element === "object"; }, "object");
var filesSpecs = toPropValue(getSpecsFromRaw("files"));
if (filesSpecs) {
var hasZeroOrNoReferences = referencesOfRaw === "no-prop" || ts.isArray(referencesOfRaw) && referencesOfRaw.length === 0;
var hasExtends = ts.hasProperty(raw, "extends");
if (filesSpecs.length === 0 && hasZeroOrNoReferences && !hasExtends) {
if (sourceFile) {
var fileName = configFileName || "tsconfig.json";
var diagnosticMessage = ts.Diagnostics.The_files_list_in_config_file_0_is_empty;
var nodeValue = ts.firstDefined(ts.getTsConfigPropArray(sourceFile, "files"), function (property) { return property.initializer; });
var error = nodeValue
? ts.createDiagnosticForNodeInSourceFile(sourceFile, nodeValue, diagnosticMessage, fileName)
: ts.createCompilerDiagnostic(diagnosticMessage, fileName);
errors.push(error);
}
else {
createCompilerDiagnosticOnlyIfJson(ts.Diagnostics.The_files_list_in_config_file_0_is_empty, configFileName || "tsconfig.json");
}
}
}
var includeSpecs = toPropValue(getSpecsFromRaw("include"));
var excludeOfRaw = getSpecsFromRaw("exclude");
var excludeSpecs = toPropValue(excludeOfRaw);
if (excludeOfRaw === "no-prop" && raw.compilerOptions) {
var outDir = raw.compilerOptions.outDir;
var declarationDir = raw.compilerOptions.declarationDir;
if (outDir || declarationDir) {
excludeSpecs = [outDir, declarationDir].filter(function (d) { return !!d; });
}
}
if (filesSpecs === undefined && includeSpecs === undefined) {
includeSpecs = ["**/*"];
}
var validatedIncludeSpecs, validatedExcludeSpecs;
// The exclude spec list is converted into a regular expression, which allows us to quickly
// test whether a file or directory should be excluded before recursively traversing the
// file system.
if (includeSpecs) {
validatedIncludeSpecs = validateSpecs(includeSpecs, errors, /*disallowTrailingRecursion*/ true, sourceFile, "include");
}
if (excludeSpecs) {
validatedExcludeSpecs = validateSpecs(excludeSpecs, errors, /*disallowTrailingRecursion*/ false, sourceFile, "exclude");
}
return {
filesSpecs: filesSpecs,
includeSpecs: includeSpecs,
excludeSpecs: excludeSpecs,
validatedFilesSpec: ts.filter(filesSpecs, ts.isString),
validatedIncludeSpecs: validatedIncludeSpecs,
validatedExcludeSpecs: validatedExcludeSpecs,
pathPatterns: undefined, // Initialized on first use
};
}
function getFileNames(basePath) {
var fileNames = getFileNamesFromConfigSpecs(configFileSpecs, basePath, options, host, extraFileExtensions);
if (shouldReportNoInputFiles(fileNames, canJsonReportNoInputFiles(raw), resolutionStack)) {
errors.push(getErrorForNoInputFiles(configFileSpecs, configFileName));
}
return fileNames;
}
function getProjectReferences(basePath) {
var projectReferences;
var referencesOfRaw = getPropFromRaw("references", function (element) { return typeof element === "object"; }, "object");
if (ts.isArray(referencesOfRaw)) {
for (var _i = 0, referencesOfRaw_1 = referencesOfRaw; _i < referencesOfRaw_1.length; _i++) {
var ref = referencesOfRaw_1[_i];
if (typeof ref.path !== "string") {
createCompilerDiagnosticOnlyIfJson(ts.Diagnostics.Compiler_option_0_requires_a_value_of_type_1, "reference.path", "string");
}
else {
(projectReferences || (projectReferences = [])).push({
path: ts.getNormalizedAbsolutePath(ref.path, basePath),
originalPath: ref.path,
prepend: ref.prepend,
circular: ref.circular
});
}
}
}
return projectReferences;
}
function toPropValue(specResult) {
return ts.isArray(specResult) ? specResult : undefined;
}
function getSpecsFromRaw(prop) {
return getPropFromRaw(prop, ts.isString, "string");
}
function getPropFromRaw(prop, validateElement, elementTypeName) {
if (ts.hasProperty(raw, prop) && !isNullOrUndefined(raw[prop])) {
if (ts.isArray(raw[prop])) {
var result = raw[prop];
if (!sourceFile && !ts.every(result, validateElement)) {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Compiler_option_0_requires_a_value_of_type_1, prop, elementTypeName));
}
return result;
}
else {
createCompilerDiagnosticOnlyIfJson(ts.Diagnostics.Compiler_option_0_requires_a_value_of_type_1, prop, "Array");
return "not-array";
}
}
return "no-prop";
}
function createCompilerDiagnosticOnlyIfJson(message, arg0, arg1) {
if (!sourceFile) {
errors.push(ts.createCompilerDiagnostic(message, arg0, arg1));
}
}
}
function isErrorNoInputFiles(error) {
return error.code === ts.Diagnostics.No_inputs_were_found_in_config_file_0_Specified_include_paths_were_1_and_exclude_paths_were_2.code;
}
function getErrorForNoInputFiles(_a, configFileName) {
var includeSpecs = _a.includeSpecs, excludeSpecs = _a.excludeSpecs;
return ts.createCompilerDiagnostic(ts.Diagnostics.No_inputs_were_found_in_config_file_0_Specified_include_paths_were_1_and_exclude_paths_were_2, configFileName || "tsconfig.json", JSON.stringify(includeSpecs || []), JSON.stringify(excludeSpecs || []));
}
function shouldReportNoInputFiles(fileNames, canJsonReportNoInutFiles, resolutionStack) {
return fileNames.length === 0 && canJsonReportNoInutFiles && (!resolutionStack || resolutionStack.length === 0);
}
/*@internal*/
function canJsonReportNoInputFiles(raw) {
return !ts.hasProperty(raw, "files") && !ts.hasProperty(raw, "references");
}
ts.canJsonReportNoInputFiles = canJsonReportNoInputFiles;
/*@internal*/
function updateErrorForNoInputFiles(fileNames, configFileName, configFileSpecs, configParseDiagnostics, canJsonReportNoInutFiles) {
var existingErrors = configParseDiagnostics.length;
if (shouldReportNoInputFiles(fileNames, canJsonReportNoInutFiles)) {
configParseDiagnostics.push(getErrorForNoInputFiles(configFileSpecs, configFileName));
}
else {
ts.filterMutate(configParseDiagnostics, function (error) { return !isErrorNoInputFiles(error); });
}
return existingErrors !== configParseDiagnostics.length;
}
ts.updateErrorForNoInputFiles = updateErrorForNoInputFiles;
function isSuccessfulParsedTsconfig(value) {
return !!value.options;
}
/**
* This *just* extracts options/include/exclude/files out of a config file.
* It does *not* resolve the included files.
*/
function parseConfig(json, sourceFile, host, basePath, configFileName, resolutionStack, errors, extendedConfigCache) {
var _a;
basePath = ts.normalizeSlashes(basePath);
var resolvedPath = ts.getNormalizedAbsolutePath(configFileName || "", basePath);
if (resolutionStack.indexOf(resolvedPath) >= 0) {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Circularity_detected_while_resolving_configuration_Colon_0, __spreadArray(__spreadArray([], resolutionStack, true), [resolvedPath], false).join(" -> ")));
return { raw: json || convertToObject(sourceFile, errors) };
}
var ownConfig = json ?
parseOwnConfigOfJson(json, host, basePath, configFileName, errors) :
parseOwnConfigOfJsonSourceFile(sourceFile, host, basePath, configFileName, errors);
if ((_a = ownConfig.options) === null || _a === void 0 ? void 0 : _a.paths) {
// If we end up needing to resolve relative paths from 'paths' relative to
// the config file location, we'll need to know where that config file was.
// Since 'paths' can be inherited from an extended config in another directory,
// we wouldn't know which directory to use unless we store it here.
ownConfig.options.pathsBasePath = basePath;
}
if (ownConfig.extendedConfigPath) {
// copy the resolution stack so it is never reused between branches in potential diamond-problem scenarios.
resolutionStack = resolutionStack.concat([resolvedPath]);
var extendedConfig = getExtendedConfig(sourceFile, ownConfig.extendedConfigPath, host, resolutionStack, errors, extendedConfigCache);
if (extendedConfig && isSuccessfulParsedTsconfig(extendedConfig)) {
var baseRaw_1 = extendedConfig.raw;
var raw_1 = ownConfig.raw;
var relativeDifference_1;
var setPropertyInRawIfNotUndefined = function (propertyName) {
if (!raw_1[propertyName] && baseRaw_1[propertyName]) {
raw_1[propertyName] = ts.map(baseRaw_1[propertyName], function (path) { return ts.isRootedDiskPath(path) ? path : ts.combinePaths(relativeDifference_1 || (relativeDifference_1 = ts.convertToRelativePath(ts.getDirectoryPath(ownConfig.extendedConfigPath), basePath, ts.createGetCanonicalFileName(host.useCaseSensitiveFileNames))), path); });
}
};
setPropertyInRawIfNotUndefined("include");
setPropertyInRawIfNotUndefined("exclude");
setPropertyInRawIfNotUndefined("files");
if (raw_1.compileOnSave === undefined) {
raw_1.compileOnSave = baseRaw_1.compileOnSave;
}
ownConfig.options = ts.assign({}, extendedConfig.options, ownConfig.options);
ownConfig.watchOptions = ownConfig.watchOptions && extendedConfig.watchOptions ?
ts.assign({}, extendedConfig.watchOptions, ownConfig.watchOptions) :
ownConfig.watchOptions || extendedConfig.watchOptions;
// TODO extend type typeAcquisition
}
}
return ownConfig;
}
function parseOwnConfigOfJson(json, host, basePath, configFileName, errors) {
if (ts.hasProperty(json, "excludes")) {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Unknown_option_excludes_Did_you_mean_exclude));
}
var options = convertCompilerOptionsFromJsonWorker(json.compilerOptions, basePath, errors, configFileName);
// typingOptions has been deprecated and is only supported for backward compatibility purposes.
// It should be removed in future releases - use typeAcquisition instead.
var typeAcquisition = convertTypeAcquisitionFromJsonWorker(json.typeAcquisition || json.typingOptions, basePath, errors, configFileName);
var watchOptions = convertWatchOptionsFromJsonWorker(json.watchOptions, basePath, errors);
json.compileOnSave = convertCompileOnSaveOptionFromJson(json, basePath, errors);
var extendedConfigPath;
if (json.extends) {
if (!ts.isString(json.extends)) {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Compiler_option_0_requires_a_value_of_type_1, "extends", "string"));
}
else {
var newBase = configFileName ? directoryOfCombinedPath(configFileName, basePath) : basePath;
extendedConfigPath = getExtendsConfigPath(json.extends, host, newBase, errors, ts.createCompilerDiagnostic);
}
}
return { raw: json, options: options, watchOptions: watchOptions, typeAcquisition: typeAcquisition, extendedConfigPath: extendedConfigPath };
}
function parseOwnConfigOfJsonSourceFile(sourceFile, host, basePath, configFileName, errors) {
var options = getDefaultCompilerOptions(configFileName);
var typeAcquisition, typingOptionstypeAcquisition;
var watchOptions;
var extendedConfigPath;
var optionsIterator = {
onSetValidOptionKeyValueInParent: function (parentOption, option, value) {
var currentOption;
switch (parentOption) {
case "compilerOptions":
currentOption = options;
break;
case "watchOptions":
currentOption = (watchOptions || (watchOptions = {}));
break;
case "typeAcquisition":
currentOption = (typeAcquisition || (typeAcquisition = getDefaultTypeAcquisition(configFileName)));
break;
case "typingOptions":
currentOption = (typingOptionstypeAcquisition || (typingOptionstypeAcquisition = getDefaultTypeAcquisition(configFileName)));
break;
default:
ts.Debug.fail("Unknown option");
}
currentOption[option.name] = normalizeOptionValue(option, basePath, value);
},
onSetValidOptionKeyValueInRoot: function (key, _keyNode, value, valueNode) {
switch (key) {
case "extends":
var newBase = configFileName ? directoryOfCombinedPath(configFileName, basePath) : basePath;
extendedConfigPath = getExtendsConfigPath(value, host, newBase, errors, function (message, arg0) {
return ts.createDiagnosticForNodeInSourceFile(sourceFile, valueNode, message, arg0);
});
return;
}
},
onSetUnknownOptionKeyValueInRoot: function (key, keyNode, _value, _valueNode) {
if (key === "excludes") {
errors.push(ts.createDiagnosticForNodeInSourceFile(sourceFile, keyNode, ts.Diagnostics.Unknown_option_excludes_Did_you_mean_exclude));
}
}
};
var json = convertConfigFileToObject(sourceFile, errors, /*reportOptionsErrors*/ true, optionsIterator);
if (!typeAcquisition) {
if (typingOptionstypeAcquisition) {
typeAcquisition = (typingOptionstypeAcquisition.enableAutoDiscovery !== undefined) ?
{
enable: typingOptionstypeAcquisition.enableAutoDiscovery,
include: typingOptionstypeAcquisition.include,
exclude: typingOptionstypeAcquisition.exclude
} :
typingOptionstypeAcquisition;
}
else {
typeAcquisition = getDefaultTypeAcquisition(configFileName);
}
}
return { raw: json, options: options, watchOptions: watchOptions, typeAcquisition: typeAcquisition, extendedConfigPath: extendedConfigPath };
}
function getExtendsConfigPath(extendedConfig, host, basePath, errors, createDiagnostic) {
extendedConfig = ts.normalizeSlashes(extendedConfig);
if (ts.isRootedDiskPath(extendedConfig) || ts.startsWith(extendedConfig, "./") || ts.startsWith(extendedConfig, "../")) {
var extendedConfigPath = ts.getNormalizedAbsolutePath(extendedConfig, basePath);
if (!host.fileExists(extendedConfigPath) && !ts.endsWith(extendedConfigPath, ".json" /* Json */)) {
extendedConfigPath = extendedConfigPath + ".json";
if (!host.fileExists(extendedConfigPath)) {
errors.push(createDiagnostic(ts.Diagnostics.File_0_not_found, extendedConfig));
return undefined;
}
}
return extendedConfigPath;
}
// If the path isn't a rooted or relative path, resolve like a module
var resolved = ts.nodeModuleNameResolver(extendedConfig, ts.combinePaths(basePath, "tsconfig.json"), { moduleResolution: ts.ModuleResolutionKind.NodeJs }, host, /*cache*/ undefined, /*projectRefs*/ undefined, /*lookupConfig*/ true);
if (resolved.resolvedModule) {
return resolved.resolvedModule.resolvedFileName;
}
errors.push(createDiagnostic(ts.Diagnostics.File_0_not_found, extendedConfig));
return undefined;
}
function getExtendedConfig(sourceFile, extendedConfigPath, host, resolutionStack, errors, extendedConfigCache) {
var _a;
var path = host.useCaseSensitiveFileNames ? extendedConfigPath : ts.toFileNameLowerCase(extendedConfigPath);
var value;
var extendedResult;
var extendedConfig;
if (extendedConfigCache && (value = extendedConfigCache.get(path))) {
(extendedResult = value.extendedResult, extendedConfig = value.extendedConfig);
}
else {
extendedResult = readJsonConfigFile(extendedConfigPath, function (path) { return host.readFile(path); });
if (!extendedResult.parseDiagnostics.length) {
extendedConfig = parseConfig(/*json*/ undefined, extendedResult, host, ts.getDirectoryPath(extendedConfigPath), ts.getBaseFileName(extendedConfigPath), resolutionStack, errors, extendedConfigCache);
}
if (extendedConfigCache) {
extendedConfigCache.set(path, { extendedResult: extendedResult, extendedConfig: extendedConfig });
}
}
if (sourceFile) {
sourceFile.extendedSourceFiles = [extendedResult.fileName];
if (extendedResult.extendedSourceFiles) {
(_a = sourceFile.extendedSourceFiles).push.apply(_a, extendedResult.extendedSourceFiles);
}
}
if (extendedResult.parseDiagnostics.length) {
errors.push.apply(errors, extendedResult.parseDiagnostics);
return undefined;
}
return extendedConfig;
}
function convertCompileOnSaveOptionFromJson(jsonOption, basePath, errors) {
if (!ts.hasProperty(jsonOption, ts.compileOnSaveCommandLineOption.name)) {
return false;
}
var result = convertJsonOption(ts.compileOnSaveCommandLineOption, jsonOption.compileOnSave, basePath, errors);
return typeof result === "boolean" && result;
}
function convertCompilerOptionsFromJson(jsonOptions, basePath, configFileName) {
var errors = [];
var options = convertCompilerOptionsFromJsonWorker(jsonOptions, basePath, errors, configFileName);
return { options: options, errors: errors };
}
ts.convertCompilerOptionsFromJson = convertCompilerOptionsFromJson;
function convertTypeAcquisitionFromJson(jsonOptions, basePath, configFileName) {
var errors = [];
var options = convertTypeAcquisitionFromJsonWorker(jsonOptions, basePath, errors, configFileName);
return { options: options, errors: errors };
}
ts.convertTypeAcquisitionFromJson = convertTypeAcquisitionFromJson;
function getDefaultCompilerOptions(configFileName) {
var options = configFileName && ts.getBaseFileName(configFileName) === "jsconfig.json"
? { allowJs: true, maxNodeModuleJsDepth: 2, allowSyntheticDefaultImports: true, skipLibCheck: true, noEmit: true }
: {};
return options;
}
function convertCompilerOptionsFromJsonWorker(jsonOptions, basePath, errors, configFileName) {
var options = getDefaultCompilerOptions(configFileName);
convertOptionsFromJson(getCommandLineCompilerOptionsMap(), jsonOptions, basePath, options, ts.compilerOptionsDidYouMeanDiagnostics, errors);
if (configFileName) {
options.configFilePath = ts.normalizeSlashes(configFileName);
}
return options;
}
function getDefaultTypeAcquisition(configFileName) {
return { enable: !!configFileName && ts.getBaseFileName(configFileName) === "jsconfig.json", include: [], exclude: [] };
}
function convertTypeAcquisitionFromJsonWorker(jsonOptions, basePath, errors, configFileName) {
var options = getDefaultTypeAcquisition(configFileName);
var typeAcquisition = convertEnableAutoDiscoveryToEnable(jsonOptions);
convertOptionsFromJson(getCommandLineTypeAcquisitionMap(), typeAcquisition, basePath, options, typeAcquisitionDidYouMeanDiagnostics, errors);
return options;
}
function convertWatchOptionsFromJsonWorker(jsonOptions, basePath, errors) {
return convertOptionsFromJson(getCommandLineWatchOptionsMap(), jsonOptions, basePath, /*defaultOptions*/ undefined, watchOptionsDidYouMeanDiagnostics, errors);
}
function convertOptionsFromJson(optionsNameMap, jsonOptions, basePath, defaultOptions, diagnostics, errors) {
if (!jsonOptions) {
return;
}
for (var id in jsonOptions) {
var opt = optionsNameMap.get(id);
if (opt) {
(defaultOptions || (defaultOptions = {}))[opt.name] = convertJsonOption(opt, jsonOptions[id], basePath, errors);
}
else {
errors.push(createUnknownOptionError(id, diagnostics, ts.createCompilerDiagnostic));
}
}
return defaultOptions;
}
/*@internal*/
function convertJsonOption(opt, value, basePath, errors) {
if (isCompilerOptionsValue(opt, value)) {
var optType = opt.type;
if (optType === "list" && ts.isArray(value)) {
return convertJsonOptionOfListType(opt, value, basePath, errors);
}
else if (!ts.isString(optType)) {
return convertJsonOptionOfCustomType(opt, value, errors);
}
var validatedValue = validateJsonOptionValue(opt, value, errors);
return isNullOrUndefined(validatedValue) ? validatedValue : normalizeNonListOptionValue(opt, basePath, validatedValue);
}
else {
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Compiler_option_0_requires_a_value_of_type_1, opt.name, getCompilerOptionValueTypeString(opt)));
}
}
ts.convertJsonOption = convertJsonOption;
function normalizeOptionValue(option, basePath, value) {
if (isNullOrUndefined(value))
return undefined;
if (option.type === "list") {
var listOption_1 = option;
if (listOption_1.element.isFilePath || !ts.isString(listOption_1.element.type)) {
return ts.filter(ts.map(value, function (v) { return normalizeOptionValue(listOption_1.element, basePath, v); }), function (v) { return !!v; });
}
return value;
}
else if (!ts.isString(option.type)) {
return option.type.get(ts.isString(value) ? value.toLowerCase() : value);
}
return normalizeNonListOptionValue(option, basePath, value);
}
function normalizeNonListOptionValue(option, basePath, value) {
if (option.isFilePath) {
value = ts.getNormalizedAbsolutePath(value, basePath);
if (value === "") {
value = ".";
}
}
return value;
}
function validateJsonOptionValue(opt, value, errors) {
var _a;
if (isNullOrUndefined(value))
return undefined;
var d = (_a = opt.extraValidation) === null || _a === void 0 ? void 0 : _a.call(opt, value);
if (!d)
return value;
errors.push(ts.createCompilerDiagnostic.apply(void 0, d));
return undefined;
}
function convertJsonOptionOfCustomType(opt, value, errors) {
if (isNullOrUndefined(value))
return undefined;
var key = value.toLowerCase();
var val = opt.type.get(key);
if (val !== undefined) {
return validateJsonOptionValue(opt, val, errors);
}
else {
errors.push(createCompilerDiagnosticForInvalidCustomType(opt));
}
}
function convertJsonOptionOfListType(option, values, basePath, errors) {
return ts.filter(ts.map(values, function (v) { return convertJsonOption(option.element, v, basePath, errors); }), function (v) { return !!v; });
}
/**
* Tests for a path that ends in a recursive directory wildcard.
* Matches **, \**, **\, and \**\, but not a**b.
*
* NOTE: used \ in place of / above to avoid issues with multiline comments.
*
* Breakdown:
* (^|\/) # matches either the beginning of the string or a directory separator.
* \*\* # matches the recursive directory wildcard "**".
* \/?$ # matches an optional trailing directory separator at the end of the string.
*/
var invalidTrailingRecursionPattern = /(^|\/)\*\*\/?$/;
/**
* Matches the portion of a wildcard path that does not contain wildcards.
* Matches \a of \a\*, or \a\b\c of \a\b\c\?\d.
*
* NOTE: used \ in place of / above to avoid issues with multiline comments.
*
* Breakdown:
* ^ # matches the beginning of the string
* [^*?]* # matches any number of non-wildcard characters
* (?=\/[^/]*[*?]) # lookahead that matches a directory separator followed by
* # a path component that contains at least one wildcard character (* or ?).
*/
var wildcardDirectoryPattern = /^[^*?]*(?=\/[^/]*[*?])/;
/**
* Gets the file names from the provided config file specs that contain, files, include, exclude and
* other properties needed to resolve the file names
* @param configFileSpecs The config file specs extracted with file names to include, wildcards to include/exclude and other details
* @param basePath The base path for any relative file specifications.
* @param options Compiler options.
* @param host The host used to resolve files and directories.
* @param extraFileExtensions optionaly file extra file extension information from host
*/
/* @internal */
function getFileNamesFromConfigSpecs(configFileSpecs, basePath, options, host, extraFileExtensions) {
if (extraFileExtensions === void 0) { extraFileExtensions = ts.emptyArray; }
basePath = ts.normalizePath(basePath);
var keyMapper = ts.createGetCanonicalFileName(host.useCaseSensitiveFileNames);
// Literal file names (provided via the "files" array in tsconfig.json) are stored in a
// file map with a possibly case insensitive key. We use this map later when when including
// wildcard paths.
var literalFileMap = new ts.Map();
// Wildcard paths (provided via the "includes" array in tsconfig.json) are stored in a
// file map with a possibly case insensitive key. We use this map to store paths matched
// via wildcard, and to handle extension priority.
var wildcardFileMap = new ts.Map();
// Wildcard paths of json files (provided via the "includes" array in tsconfig.json) are stored in a
// file map with a possibly case insensitive key. We use this map to store paths matched
// via wildcard of *.json kind
var wildCardJsonFileMap = new ts.Map();
var validatedFilesSpec = configFileSpecs.validatedFilesSpec, validatedIncludeSpecs = configFileSpecs.validatedIncludeSpecs, validatedExcludeSpecs = configFileSpecs.validatedExcludeSpecs;
// Rather than re-query this for each file and filespec, we query the supported extensions
// once and store it on the expansion context.
var supportedExtensions = ts.getSupportedExtensions(options, extraFileExtensions);
var supportedExtensionsWithJsonIfResolveJsonModule = ts.getSuppoertedExtensionsWithJsonIfResolveJsonModule(options, supportedExtensions);
// Literal files are always included verbatim. An "include" or "exclude" specification cannot
// remove a literal file.
if (validatedFilesSpec) {
for (var _i = 0, validatedFilesSpec_1 = validatedFilesSpec; _i < validatedFilesSpec_1.length; _i++) {
var fileName = validatedFilesSpec_1[_i];
var file = ts.getNormalizedAbsolutePath(fileName, basePath);
literalFileMap.set(keyMapper(file), file);
}
}
var jsonOnlyIncludeRegexes;
if (validatedIncludeSpecs && validatedIncludeSpecs.length > 0) {
var _loop_6 = function (file) {
if (ts.fileExtensionIs(file, ".json" /* Json */)) {
// Valid only if *.json specified
if (!jsonOnlyIncludeRegexes) {
var includes = validatedIncludeSpecs.filter(function (s) { return ts.endsWith(s, ".json" /* Json */); });
var includeFilePatterns = ts.map(ts.getRegularExpressionsForWildcards(includes, basePath, "files"), function (pattern) { return "^" + pattern + "$"; });
jsonOnlyIncludeRegexes = includeFilePatterns ? includeFilePatterns.map(function (pattern) { return ts.getRegexFromPattern(pattern, host.useCaseSensitiveFileNames); }) : ts.emptyArray;
}
var includeIndex = ts.findIndex(jsonOnlyIncludeRegexes, function (re) { return re.test(file); });
if (includeIndex !== -1) {
var key_1 = keyMapper(file);
if (!literalFileMap.has(key_1) && !wildCardJsonFileMap.has(key_1)) {
wildCardJsonFileMap.set(key_1, file);
}
}
return "continue";
}
// If we have already included a literal or wildcard path with a
// higher priority extension, we should skip this file.
//
// This handles cases where we may encounter both <file>.ts and
// <file>.d.ts (or <file>.js if "allowJs" is enabled) in the same
// directory when they are compilation outputs.
if (hasFileWithHigherPriorityExtension(file, literalFileMap, wildcardFileMap, supportedExtensions, keyMapper)) {
return "continue";
}
// We may have included a wildcard path with a lower priority
// extension due to the user-defined order of entries in the
// "include" array. If there is a lower priority extension in the
// same directory, we should remove it.
removeWildcardFilesWithLowerPriorityExtension(file, wildcardFileMap, supportedExtensions, keyMapper);
var key = keyMapper(file);
if (!literalFileMap.has(key) && !wildcardFileMap.has(key)) {
wildcardFileMap.set(key, file);
}
};
for (var _a = 0, _b = host.readDirectory(basePath, supportedExtensionsWithJsonIfResolveJsonModule, validatedExcludeSpecs, validatedIncludeSpecs, /*depth*/ undefined); _a < _b.length; _a++) {
var file = _b[_a];
_loop_6(file);
}
}
var literalFiles = ts.arrayFrom(literalFileMap.values());
var wildcardFiles = ts.arrayFrom(wildcardFileMap.values());
return literalFiles.concat(wildcardFiles, ts.arrayFrom(wildCardJsonFileMap.values()));
}
ts.getFileNamesFromConfigSpecs = getFileNamesFromConfigSpecs;
/* @internal */
function isExcludedFile(pathToCheck, spec, basePath, useCaseSensitiveFileNames, currentDirectory) {
var validatedFilesSpec = spec.validatedFilesSpec, validatedIncludeSpecs = spec.validatedIncludeSpecs, validatedExcludeSpecs = spec.validatedExcludeSpecs;
if (!ts.length(validatedIncludeSpecs) || !ts.length(validatedExcludeSpecs))
return false;
basePath = ts.normalizePath(basePath);
var keyMapper = ts.createGetCanonicalFileName(useCaseSensitiveFileNames);
if (validatedFilesSpec) {
for (var _i = 0, validatedFilesSpec_2 = validatedFilesSpec; _i < validatedFilesSpec_2.length; _i++) {
var fileName = validatedFilesSpec_2[_i];
if (keyMapper(ts.getNormalizedAbsolutePath(fileName, basePath)) === pathToCheck)
return false;
}
}
return matchesExcludeWorker(pathToCheck, validatedExcludeSpecs, useCaseSensitiveFileNames, currentDirectory, basePath);
}
ts.isExcludedFile = isExcludedFile;
function invalidDotDotAfterRecursiveWildcard(s) {
// We used to use the regex /(^|\/)\*\*\/(.*\/)?\.\.($|\/)/ to check for this case, but
// in v8, that has polynomial performance because the recursive wildcard match - **/ -
// can be matched in many arbitrary positions when multiple are present, resulting
// in bad backtracking (and we don't care which is matched - just that some /.. segment
// comes after some **/ segment).
var wildcardIndex = ts.startsWith(s, "**/") ? 0 : s.indexOf("/**/");
if (wildcardIndex === -1) {
return false;
}
var lastDotIndex = ts.endsWith(s, "/..") ? s.length : s.lastIndexOf("/../");
return lastDotIndex > wildcardIndex;
}
/* @internal */
function matchesExclude(pathToCheck, excludeSpecs, useCaseSensitiveFileNames, currentDirectory) {
return matchesExcludeWorker(pathToCheck, ts.filter(excludeSpecs, function (spec) { return !invalidDotDotAfterRecursiveWildcard(spec); }), useCaseSensitiveFileNames, currentDirectory);
}
ts.matchesExclude = matchesExclude;
function matchesExcludeWorker(pathToCheck, excludeSpecs, useCaseSensitiveFileNames, currentDirectory, basePath) {
var excludePattern = ts.getRegularExpressionForWildcard(excludeSpecs, ts.combinePaths(ts.normalizePath(currentDirectory), basePath), "exclude");
var excludeRegex = excludePattern && ts.getRegexFromPattern(excludePattern, useCaseSensitiveFileNames);
if (!excludeRegex)
return false;
if (excludeRegex.test(pathToCheck))
return true;
return !ts.hasExtension(pathToCheck) && excludeRegex.test(ts.ensureTrailingDirectorySeparator(pathToCheck));
}
function validateSpecs(specs, errors, disallowTrailingRecursion, jsonSourceFile, specKey) {
return specs.filter(function (spec) {
if (!ts.isString(spec))
return false;
var diag = specToDiagnostic(spec, disallowTrailingRecursion);
if (diag !== undefined) {
errors.push(createDiagnostic.apply(void 0, diag));
}
return diag === undefined;
});
function createDiagnostic(message, spec) {
var element = ts.getTsConfigPropArrayElementValue(jsonSourceFile, specKey, spec);
return element ?
ts.createDiagnosticForNodeInSourceFile(jsonSourceFile, element, message, spec) :
ts.createCompilerDiagnostic(message, spec);
}
}
function specToDiagnostic(spec, disallowTrailingRecursion) {
if (disallowTrailingRecursion && invalidTrailingRecursionPattern.test(spec)) {
return [ts.Diagnostics.File_specification_cannot_end_in_a_recursive_directory_wildcard_Asterisk_Asterisk_Colon_0, spec];
}
else if (invalidDotDotAfterRecursiveWildcard(spec)) {
return [ts.Diagnostics.File_specification_cannot_contain_a_parent_directory_that_appears_after_a_recursive_directory_wildcard_Asterisk_Asterisk_Colon_0, spec];
}
}
/**
* Gets directories in a set of include patterns that should be watched for changes.
*/
function getWildcardDirectories(_a, path, useCaseSensitiveFileNames) {
var include = _a.validatedIncludeSpecs, exclude = _a.validatedExcludeSpecs;
// We watch a directory recursively if it contains a wildcard anywhere in a directory segment
// of the pattern:
//
// /a/b/**/d - Watch /a/b recursively to catch changes to any d in any subfolder recursively
// /a/b/*/d - Watch /a/b recursively to catch any d in any immediate subfolder, even if a new subfolder is added
// /a/b - Watch /a/b recursively to catch changes to anything in any recursive subfoler
//
// We watch a directory without recursion if it contains a wildcard in the file segment of
// the pattern:
//
// /a/b/* - Watch /a/b directly to catch any new file
// /a/b/a?z - Watch /a/b directly to catch any new file matching a?z
var rawExcludeRegex = ts.getRegularExpressionForWildcard(exclude, path, "exclude");
var excludeRegex = rawExcludeRegex && new RegExp(rawExcludeRegex, useCaseSensitiveFileNames ? "" : "i");
var wildcardDirectories = {};
if (include !== undefined) {
var recursiveKeys = [];
for (var _i = 0, include_1 = include; _i < include_1.length; _i++) {
var file = include_1[_i];
var spec = ts.normalizePath(ts.combinePaths(path, file));
if (excludeRegex && excludeRegex.test(spec)) {
continue;
}
var match = getWildcardDirectoryFromSpec(spec, useCaseSensitiveFileNames);
if (match) {
var key = match.key, flags = match.flags;
var existingFlags = wildcardDirectories[key];
if (existingFlags === undefined || existingFlags < flags) {
wildcardDirectories[key] = flags;
if (flags === 1 /* Recursive */) {
recursiveKeys.push(key);
}
}
}
}
// Remove any subpaths under an existing recursively watched directory.
for (var key in wildcardDirectories) {
if (ts.hasProperty(wildcardDirectories, key)) {
for (var _b = 0, recursiveKeys_1 = recursiveKeys; _b < recursiveKeys_1.length; _b++) {
var recursiveKey = recursiveKeys_1[_b];
if (key !== recursiveKey && ts.containsPath(recursiveKey, key, path, !useCaseSensitiveFileNames)) {
delete wildcardDirectories[key];
}
}
}
}
}
return wildcardDirectories;
}
function getWildcardDirectoryFromSpec(spec, useCaseSensitiveFileNames) {
var match = wildcardDirectoryPattern.exec(spec);
if (match) {
// We check this with a few `indexOf` calls because 3 `indexOf`/`lastIndexOf` calls is
// less algorithmically complex (roughly O(3n) worst-case) than the regex we used to use,
// \/[^/]*?[*?][^/]*\/ which was polynominal in v8, since arbitrary sequences of wildcard
// characters could match any of the central patterns, resulting in bad backtracking.
var questionWildcardIndex = spec.indexOf("?");
var starWildcardIndex = spec.indexOf("*");
var lastDirectorySeperatorIndex = spec.lastIndexOf(ts.directorySeparator);
return {
key: useCaseSensitiveFileNames ? match[0] : ts.toFileNameLowerCase(match[0]),
flags: (questionWildcardIndex !== -1 && questionWildcardIndex < lastDirectorySeperatorIndex)
|| (starWildcardIndex !== -1 && starWildcardIndex < lastDirectorySeperatorIndex)
? 1 /* Recursive */ : 0 /* None */
};
}
if (ts.isImplicitGlob(spec)) {
return {
key: useCaseSensitiveFileNames ? spec : ts.toFileNameLowerCase(spec),
flags: 1 /* Recursive */
};
}
return undefined;
}
/**
* Determines whether a literal or wildcard file has already been included that has a higher
* extension priority.
*
* @param file The path to the file.
* @param extensionPriority The priority of the extension.
* @param context The expansion context.
*/
function hasFileWithHigherPriorityExtension(file, literalFiles, wildcardFiles, extensions, keyMapper) {
var extensionPriority = ts.getExtensionPriority(file, extensions);
var adjustedExtensionPriority = ts.adjustExtensionPriority(extensionPriority, extensions);
for (var i = 0 /* Highest */; i < adjustedExtensionPriority; i++) {
var higherPriorityExtension = extensions[i];
var higherPriorityPath = keyMapper(ts.changeExtension(file, higherPriorityExtension));
if (literalFiles.has(higherPriorityPath) || wildcardFiles.has(higherPriorityPath)) {
return true;
}
}
return false;
}
/**
* Removes files included via wildcard expansion with a lower extension priority that have
* already been included.
*
* @param file The path to the file.
* @param extensionPriority The priority of the extension.
* @param context The expansion context.
*/
function removeWildcardFilesWithLowerPriorityExtension(file, wildcardFiles, extensions, keyMapper) {
var extensionPriority = ts.getExtensionPriority(file, extensions);
var nextExtensionPriority = ts.getNextLowestExtensionPriority(extensionPriority, extensions);
for (var i = nextExtensionPriority; i < extensions.length; i++) {
var lowerPriorityExtension = extensions[i];
var lowerPriorityPath = keyMapper(ts.changeExtension(file, lowerPriorityExtension));
wildcardFiles.delete(lowerPriorityPath);
}
}
/**
* Produces a cleaned version of compiler options with personally identifying info (aka, paths) removed.
* Also converts enum values back to strings.
*/
/* @internal */
function convertCompilerOptionsForTelemetry(opts) {
var out = {};
for (var key in opts) {
if (opts.hasOwnProperty(key)) {
var type = getOptionFromName(key);
if (type !== undefined) { // Ignore unknown options
out[key] = getOptionValueWithEmptyStrings(opts[key], type);
}
}
}
return out;
}
ts.convertCompilerOptionsForTelemetry = convertCompilerOptionsForTelemetry;
function getOptionValueWithEmptyStrings(value, option) {
switch (option.type) {
case "object": // "paths". Can't get any useful information from the value since we blank out strings, so just return "".
return "";
case "string": // Could be any arbitrary string -- use empty string instead.
return "";
case "number": // Allow numbers, but be sure to check it's actually a number.
return typeof value === "number" ? value : "";
case "boolean":
return typeof value === "boolean" ? value : "";
case "list":
var elementType_1 = option.element;
return ts.isArray(value) ? value.map(function (v) { return getOptionValueWithEmptyStrings(v, elementType_1); }) : "";
default:
return ts.forEachEntry(option.type, function (optionEnumValue, optionStringValue) {
if (optionEnumValue === value) {
return optionStringValue;
}
}); // TODO: GH#18217
}
}
})(ts || (ts = {}));
var ts;
(function (ts) {
function trace(host) {
host.trace(ts.formatMessage.apply(undefined, arguments));
}
ts.trace = trace;
/* @internal */
function isTraceEnabled(compilerOptions, host) {
return !!compilerOptions.traceResolution && host.trace !== undefined;
}
ts.isTraceEnabled = isTraceEnabled;
function withPackageId(packageInfo, r) {
var packageId;
if (r && packageInfo) {
var packageJsonContent = packageInfo.packageJsonContent;
if (typeof packageJsonContent.name === "string" && typeof packageJsonContent.version === "string") {
packageId = {
name: packageJsonContent.name,
subModuleName: r.path.slice(packageInfo.packageDirectory.length + ts.directorySeparator.length),
version: packageJsonContent.version
};
}
}
return r && { path: r.path, extension: r.ext, packageId: packageId };
}
function noPackageId(r) {
return withPackageId(/*packageInfo*/ undefined, r);
}
function removeIgnoredPackageId(r) {
if (r) {
ts.Debug.assert(r.packageId === undefined);
return { path: r.path, ext: r.extension };
}
}
/**
* Kinds of file that we are currently looking for.
* Typically there is one pass with Extensions.TypeScript, then a second pass with Extensions.JavaScript.
*/
var Extensions;
(function (Extensions) {
Extensions[Extensions["TypeScript"] = 0] = "TypeScript";
Extensions[Extensions["JavaScript"] = 1] = "JavaScript";
Extensions[Extensions["Json"] = 2] = "Json";
Extensions[Extensions["TSConfig"] = 3] = "TSConfig";
Extensions[Extensions["DtsOnly"] = 4] = "DtsOnly"; /** Only '.d.ts' */
})(Extensions || (Extensions = {}));
/** Used with `Extensions.DtsOnly` to extract the path from TypeScript results. */
function resolvedTypeScriptOnly(resolved) {
if (!resolved) {
return undefined;
}
ts.Debug.assert(ts.extensionIsTS(resolved.extension));
return { fileName: resolved.path, packageId: resolved.packageId };
}
function createResolvedModuleWithFailedLookupLocations(resolved, isExternalLibraryImport, failedLookupLocations, resultFromCache) {
var _a;
if (resultFromCache) {
(_a = resultFromCache.failedLookupLocations).push.apply(_a, failedLookupLocations);
return resultFromCache;
}
return {
resolvedModule: resolved && { resolvedFileName: resolved.path, originalPath: resolved.originalPath === true ? undefined : resolved.originalPath, extension: resolved.extension, isExternalLibraryImport: isExternalLibraryImport, packageId: resolved.packageId },
failedLookupLocations: failedLookupLocations
};
}
function readPackageJsonField(jsonContent, fieldName, typeOfTag, state) {
if (!ts.hasProperty(jsonContent, fieldName)) {
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.package_json_does_not_have_a_0_field, fieldName);
}
return;
}
var value = jsonContent[fieldName];
if (typeof value !== typeOfTag || value === null) { // eslint-disable-line no-null/no-null
if (state.traceEnabled) {
// eslint-disable-next-line no-null/no-null
trace(state.host, ts.Diagnostics.Expected_type_of_0_field_in_package_json_to_be_1_got_2, fieldName, typeOfTag, value === null ? "null" : typeof value);
}
return;
}
return value;
}
function readPackageJsonPathField(jsonContent, fieldName, baseDirectory, state) {
var fileName = readPackageJsonField(jsonContent, fieldName, "string", state);
if (fileName === undefined) {
return;
}
if (!fileName) {
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.package_json_had_a_falsy_0_field, fieldName);
}
return;
}
var path = ts.normalizePath(ts.combinePaths(baseDirectory, fileName));
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.package_json_has_0_field_1_that_references_2, fieldName, fileName, path);
}
return path;
}
function readPackageJsonTypesFields(jsonContent, baseDirectory, state) {
return readPackageJsonPathField(jsonContent, "typings", baseDirectory, state)
|| readPackageJsonPathField(jsonContent, "types", baseDirectory, state);
}
function readPackageJsonTSConfigField(jsonContent, baseDirectory, state) {
return readPackageJsonPathField(jsonContent, "tsconfig", baseDirectory, state);
}
function readPackageJsonMainField(jsonContent, baseDirectory, state) {
return readPackageJsonPathField(jsonContent, "main", baseDirectory, state);
}
function readPackageJsonTypesVersionsField(jsonContent, state) {
var typesVersions = readPackageJsonField(jsonContent, "typesVersions", "object", state);
if (typesVersions === undefined)
return;
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.package_json_has_a_typesVersions_field_with_version_specific_path_mappings);
}
return typesVersions;
}
function readPackageJsonTypesVersionPaths(jsonContent, state) {
var typesVersions = readPackageJsonTypesVersionsField(jsonContent, state);
if (typesVersions === undefined)
return;
if (state.traceEnabled) {
for (var key in typesVersions) {
if (ts.hasProperty(typesVersions, key) && !ts.VersionRange.tryParse(key)) {
trace(state.host, ts.Diagnostics.package_json_has_a_typesVersions_entry_0_that_is_not_a_valid_semver_range, key);
}
}
}
var result = getPackageJsonTypesVersionsPaths(typesVersions);
if (!result) {
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.package_json_does_not_have_a_typesVersions_entry_that_matches_version_0, ts.versionMajorMinor);
}
return;
}
var bestVersionKey = result.version, bestVersionPaths = result.paths;
if (typeof bestVersionPaths !== "object") {
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Expected_type_of_0_field_in_package_json_to_be_1_got_2, "typesVersions['" + bestVersionKey + "']", "object", typeof bestVersionPaths);
}
return;
}
return result;
}
var typeScriptVersion;
/* @internal */
function getPackageJsonTypesVersionsPaths(typesVersions) {
if (!typeScriptVersion)
typeScriptVersion = new ts.Version(ts.version);
for (var key in typesVersions) {
if (!ts.hasProperty(typesVersions, key))
continue;
var keyRange = ts.VersionRange.tryParse(key);
if (keyRange === undefined) {
continue;
}
// return the first entry whose range matches the current compiler version.
if (keyRange.test(typeScriptVersion)) {
return { version: key, paths: typesVersions[key] };
}
}
}
ts.getPackageJsonTypesVersionsPaths = getPackageJsonTypesVersionsPaths;
function getEffectiveTypeRoots(options, host) {
if (options.typeRoots) {
return options.typeRoots;
}
var currentDirectory;
if (options.configFilePath) {
currentDirectory = ts.getDirectoryPath(options.configFilePath);
}
else if (host.getCurrentDirectory) {
currentDirectory = host.getCurrentDirectory();
}
if (currentDirectory !== undefined) {
return getDefaultTypeRoots(currentDirectory, host);
}
}
ts.getEffectiveTypeRoots = getEffectiveTypeRoots;
/**
* Returns the path to every node_modules/@types directory from some ancestor directory.
* Returns undefined if there are none.
*/
function getDefaultTypeRoots(currentDirectory, host) {
if (!host.directoryExists) {
return [ts.combinePaths(currentDirectory, nodeModulesAtTypes)];
// And if it doesn't exist, tough.
}
var typeRoots;
ts.forEachAncestorDirectory(ts.normalizePath(currentDirectory), function (directory) {
var atTypes = ts.combinePaths(directory, nodeModulesAtTypes);
if (host.directoryExists(atTypes)) {
(typeRoots || (typeRoots = [])).push(atTypes);
}
return undefined;
});
return typeRoots;
}
var nodeModulesAtTypes = ts.combinePaths("node_modules", "@types");
/**
* @param {string | undefined} containingFile - file that contains type reference directive, can be undefined if containing file is unknown.
* This is possible in case if resolution is performed for directives specified via 'types' parameter. In this case initial path for secondary lookups
* is assumed to be the same as root directory of the project.
*/
function resolveTypeReferenceDirective(typeReferenceDirectiveName, containingFile, options, host, redirectedReference, cache) {
var traceEnabled = isTraceEnabled(options, host);
if (redirectedReference) {
options = redirectedReference.commandLine.options;
}
var containingDirectory = containingFile ? ts.getDirectoryPath(containingFile) : undefined;
var perFolderCache = containingDirectory ? cache && cache.getOrCreateCacheForDirectory(containingDirectory, redirectedReference) : undefined;
var result = perFolderCache && perFolderCache.get(typeReferenceDirectiveName);
if (result) {
if (traceEnabled) {
trace(host, ts.Diagnostics.Resolving_type_reference_directive_0_containing_file_1, typeReferenceDirectiveName, containingFile);
if (redirectedReference)
trace(host, ts.Diagnostics.Using_compiler_options_of_project_reference_redirect_0, redirectedReference.sourceFile.fileName);
trace(host, ts.Diagnostics.Resolution_for_type_reference_directive_0_was_found_in_cache_from_location_1, typeReferenceDirectiveName, containingDirectory);
traceResult(result);
}
return result;
}
var typeRoots = getEffectiveTypeRoots(options, host);
if (traceEnabled) {
if (containingFile === undefined) {
if (typeRoots === undefined) {
trace(host, ts.Diagnostics.Resolving_type_reference_directive_0_containing_file_not_set_root_directory_not_set, typeReferenceDirectiveName);
}
else {
trace(host, ts.Diagnostics.Resolving_type_reference_directive_0_containing_file_not_set_root_directory_1, typeReferenceDirectiveName, typeRoots);
}
}
else {
if (typeRoots === undefined) {
trace(host, ts.Diagnostics.Resolving_type_reference_directive_0_containing_file_1_root_directory_not_set, typeReferenceDirectiveName, containingFile);
}
else {
trace(host, ts.Diagnostics.Resolving_type_reference_directive_0_containing_file_1_root_directory_2, typeReferenceDirectiveName, containingFile, typeRoots);
}
}
if (redirectedReference) {
trace(host, ts.Diagnostics.Using_compiler_options_of_project_reference_redirect_0, redirectedReference.sourceFile.fileName);
}
}
var failedLookupLocations = [];
var moduleResolutionState = { compilerOptions: options, host: host, traceEnabled: traceEnabled, failedLookupLocations: failedLookupLocations, packageJsonInfoCache: cache };
var resolved = primaryLookup();
var primary = true;
if (!resolved) {
resolved = secondaryLookup();
primary = false;
}
var resolvedTypeReferenceDirective;
if (resolved) {
var fileName = resolved.fileName, packageId = resolved.packageId;
var resolvedFileName = options.preserveSymlinks ? fileName : realPath(fileName, host, traceEnabled);
resolvedTypeReferenceDirective = {
primary: primary,
resolvedFileName: resolvedFileName,
originalPath: fileName === resolvedFileName ? undefined : fileName,
packageId: packageId,
isExternalLibraryImport: pathContainsNodeModules(fileName),
};
}
result = { resolvedTypeReferenceDirective: resolvedTypeReferenceDirective, failedLookupLocations: failedLookupLocations };
perFolderCache === null || perFolderCache === void 0 ? void 0 : perFolderCache.set(typeReferenceDirectiveName, result);
if (traceEnabled)
traceResult(result);
return result;
function traceResult(result) {
var _a;
if (!((_a = result.resolvedTypeReferenceDirective) === null || _a === void 0 ? void 0 : _a.resolvedFileName)) {
trace(host, ts.Diagnostics.Type_reference_directive_0_was_not_resolved, typeReferenceDirectiveName);
}
else if (result.resolvedTypeReferenceDirective.packageId) {
trace(host, ts.Diagnostics.Type_reference_directive_0_was_successfully_resolved_to_1_with_Package_ID_2_primary_Colon_3, typeReferenceDirectiveName, result.resolvedTypeReferenceDirective.resolvedFileName, ts.packageIdToString(result.resolvedTypeReferenceDirective.packageId), result.resolvedTypeReferenceDirective.primary);
}
else {
trace(host, ts.Diagnostics.Type_reference_directive_0_was_successfully_resolved_to_1_primary_Colon_2, typeReferenceDirectiveName, result.resolvedTypeReferenceDirective.resolvedFileName, result.resolvedTypeReferenceDirective.primary);
}
}
function primaryLookup() {
// Check primary library paths
if (typeRoots && typeRoots.length) {
if (traceEnabled) {
trace(host, ts.Diagnostics.Resolving_with_primary_search_path_0, typeRoots.join(", "));
}
return ts.firstDefined(typeRoots, function (typeRoot) {
var candidate = ts.combinePaths(typeRoot, typeReferenceDirectiveName);
var candidateDirectory = ts.getDirectoryPath(candidate);
var directoryExists = ts.directoryProbablyExists(candidateDirectory, host);
if (!directoryExists && traceEnabled) {
trace(host, ts.Diagnostics.Directory_0_does_not_exist_skipping_all_lookups_in_it, candidateDirectory);
}
return resolvedTypeScriptOnly(loadNodeModuleFromDirectory(Extensions.DtsOnly, candidate, !directoryExists, moduleResolutionState));
});
}
else {
if (traceEnabled) {
trace(host, ts.Diagnostics.Root_directory_cannot_be_determined_skipping_primary_search_paths);
}
}
}
function secondaryLookup() {
var initialLocationForSecondaryLookup = containingFile && ts.getDirectoryPath(containingFile);
if (initialLocationForSecondaryLookup !== undefined) {
// check secondary locations
if (traceEnabled) {
trace(host, ts.Diagnostics.Looking_up_in_node_modules_folder_initial_location_0, initialLocationForSecondaryLookup);
}
var result_4;
if (!ts.isExternalModuleNameRelative(typeReferenceDirectiveName)) {
var searchResult = loadModuleFromNearestNodeModulesDirectory(Extensions.DtsOnly, typeReferenceDirectiveName, initialLocationForSecondaryLookup, moduleResolutionState, /*cache*/ undefined, /*redirectedReference*/ undefined);
result_4 = searchResult && searchResult.value;
}
else {
var candidate = ts.normalizePathAndParts(ts.combinePaths(initialLocationForSecondaryLookup, typeReferenceDirectiveName)).path;
result_4 = nodeLoadModuleByRelativeName(Extensions.DtsOnly, candidate, /*onlyRecordFailures*/ false, moduleResolutionState, /*considerPackageJson*/ true);
}
return resolvedTypeScriptOnly(result_4);
}
else {
if (traceEnabled) {
trace(host, ts.Diagnostics.Containing_file_is_not_specified_and_root_directory_cannot_be_determined_skipping_lookup_in_node_modules_folder);
}
}
}
}
ts.resolveTypeReferenceDirective = resolveTypeReferenceDirective;
/**
* Given a set of options, returns the set of type directive names
* that should be included for this program automatically.
* This list could either come from the config file,
* or from enumerating the types root + initial secondary types lookup location.
* More type directives might appear in the program later as a result of loading actual source files;
* this list is only the set of defaults that are implicitly included.
*/
function getAutomaticTypeDirectiveNames(options, host) {
// Use explicit type list from tsconfig.json
if (options.types) {
return options.types;
}
// Walk the primary type lookup locations
var result = [];
if (host.directoryExists && host.getDirectories) {
var typeRoots = getEffectiveTypeRoots(options, host);
if (typeRoots) {
for (var _i = 0, typeRoots_1 = typeRoots; _i < typeRoots_1.length; _i++) {
var root = typeRoots_1[_i];
if (host.directoryExists(root)) {
for (var _a = 0, _b = host.getDirectories(root); _a < _b.length; _a++) {
var typeDirectivePath = _b[_a];
var normalized = ts.normalizePath(typeDirectivePath);
var packageJsonPath = ts.combinePaths(root, normalized, "package.json");
// `types-publisher` sometimes creates packages with `"typings": null` for packages that don't provide their own types.
// See `createNotNeededPackageJSON` in the types-publisher` repo.
// eslint-disable-next-line no-null/no-null
var isNotNeededPackage = host.fileExists(packageJsonPath) && ts.readJson(packageJsonPath, host).typings === null;
if (!isNotNeededPackage) {
var baseFileName = ts.getBaseFileName(normalized);
// At this stage, skip results with leading dot.
if (baseFileName.charCodeAt(0) !== 46 /* dot */) {
// Return just the type directive names
result.push(baseFileName);
}
}
}
}
}
}
}
return result;
}
ts.getAutomaticTypeDirectiveNames = getAutomaticTypeDirectiveNames;
/*@internal*/
function createCacheWithRedirects(options) {
var ownMap = new ts.Map();
var redirectsMap = new ts.Map();
return {
getOwnMap: getOwnMap,
redirectsMap: redirectsMap,
getOrCreateMapOfCacheRedirects: getOrCreateMapOfCacheRedirects,
clear: clear,
setOwnOptions: setOwnOptions,
setOwnMap: setOwnMap
};
function getOwnMap() {
return ownMap;
}
function setOwnOptions(newOptions) {
options = newOptions;
}
function setOwnMap(newOwnMap) {
ownMap = newOwnMap;
}
function getOrCreateMapOfCacheRedirects(redirectedReference) {
if (!redirectedReference) {
return ownMap;
}
var path = redirectedReference.sourceFile.path;
var redirects = redirectsMap.get(path);
if (!redirects) {
// Reuse map if redirected reference map uses same resolution
redirects = !options || ts.optionsHaveModuleResolutionChanges(options, redirectedReference.commandLine.options) ? new ts.Map() : ownMap;
redirectsMap.set(path, redirects);
}
return redirects;
}
function clear() {
ownMap.clear();
redirectsMap.clear();
}
}
ts.createCacheWithRedirects = createCacheWithRedirects;
function createPackageJsonInfoCache(currentDirectory, getCanonicalFileName) {
var cache;
return { getPackageJsonInfo: getPackageJsonInfo, setPackageJsonInfo: setPackageJsonInfo, clear: clear, entries: entries };
function getPackageJsonInfo(packageJsonPath) {
return cache === null || cache === void 0 ? void 0 : cache.get(ts.toPath(packageJsonPath, currentDirectory, getCanonicalFileName));
}
function setPackageJsonInfo(packageJsonPath, info) {
(cache || (cache = new ts.Map())).set(ts.toPath(packageJsonPath, currentDirectory, getCanonicalFileName), info);
}
function clear() {
cache = undefined;
}
function entries() {
var iter = cache === null || cache === void 0 ? void 0 : cache.entries();
return iter ? ts.arrayFrom(iter) : [];
}
}
function getOrCreateCache(cacheWithRedirects, redirectedReference, key, create) {
var cache = cacheWithRedirects.getOrCreateMapOfCacheRedirects(redirectedReference);
var result = cache.get(key);
if (!result) {
result = create();
cache.set(key, result);
}
return result;
}
function updateRedirectsMap(options, directoryToModuleNameMap, moduleNameToDirectoryMap) {
if (!options.configFile)
return;
if (directoryToModuleNameMap.redirectsMap.size === 0) {
// The own map will be for projectCompilerOptions
ts.Debug.assert(!moduleNameToDirectoryMap || moduleNameToDirectoryMap.redirectsMap.size === 0);
ts.Debug.assert(directoryToModuleNameMap.getOwnMap().size === 0);
ts.Debug.assert(!moduleNameToDirectoryMap || moduleNameToDirectoryMap.getOwnMap().size === 0);
directoryToModuleNameMap.redirectsMap.set(options.configFile.path, directoryToModuleNameMap.getOwnMap());
moduleNameToDirectoryMap === null || moduleNameToDirectoryMap === void 0 ? void 0 : moduleNameToDirectoryMap.redirectsMap.set(options.configFile.path, moduleNameToDirectoryMap.getOwnMap());
}
else {
// Set correct own map
ts.Debug.assert(!moduleNameToDirectoryMap || moduleNameToDirectoryMap.redirectsMap.size > 0);
var ref = {
sourceFile: options.configFile,
commandLine: { options: options }
};
directoryToModuleNameMap.setOwnMap(directoryToModuleNameMap.getOrCreateMapOfCacheRedirects(ref));
moduleNameToDirectoryMap === null || moduleNameToDirectoryMap === void 0 ? void 0 : moduleNameToDirectoryMap.setOwnMap(moduleNameToDirectoryMap.getOrCreateMapOfCacheRedirects(ref));
}
directoryToModuleNameMap.setOwnOptions(options);
moduleNameToDirectoryMap === null || moduleNameToDirectoryMap === void 0 ? void 0 : moduleNameToDirectoryMap.setOwnOptions(options);
}
function createPerDirectoryResolutionCache(currentDirectory, getCanonicalFileName, directoryToModuleNameMap) {
return {
getOrCreateCacheForDirectory: getOrCreateCacheForDirectory,
clear: clear,
update: update,
};
function clear() {
directoryToModuleNameMap.clear();
}
function update(options) {
updateRedirectsMap(options, directoryToModuleNameMap);
}
function getOrCreateCacheForDirectory(directoryName, redirectedReference) {
var path = ts.toPath(directoryName, currentDirectory, getCanonicalFileName);
return getOrCreateCache(directoryToModuleNameMap, redirectedReference, path, function () { return new ts.Map(); });
}
}
function createModuleResolutionCache(currentDirectory, getCanonicalFileName, options, directoryToModuleNameMap, moduleNameToDirectoryMap) {
var preDirectoryResolutionCache = createPerDirectoryResolutionCache(currentDirectory, getCanonicalFileName, directoryToModuleNameMap || (directoryToModuleNameMap = createCacheWithRedirects(options)));
moduleNameToDirectoryMap || (moduleNameToDirectoryMap = createCacheWithRedirects(options));
var packageJsonInfoCache = createPackageJsonInfoCache(currentDirectory, getCanonicalFileName);
return __assign(__assign(__assign({}, packageJsonInfoCache), preDirectoryResolutionCache), { getOrCreateCacheForModuleName: getOrCreateCacheForModuleName, clear: clear, update: update, getPackageJsonInfoCache: function () { return packageJsonInfoCache; } });
function clear() {
preDirectoryResolutionCache.clear();
moduleNameToDirectoryMap.clear();
packageJsonInfoCache.clear();
}
function update(options) {
updateRedirectsMap(options, directoryToModuleNameMap, moduleNameToDirectoryMap);
}
function getOrCreateCacheForModuleName(nonRelativeModuleName, redirectedReference) {
ts.Debug.assert(!ts.isExternalModuleNameRelative(nonRelativeModuleName));
return getOrCreateCache(moduleNameToDirectoryMap, redirectedReference, nonRelativeModuleName, createPerModuleNameCache);
}
function createPerModuleNameCache() {
var directoryPathMap = new ts.Map();
return { get: get, set: set };
function get(directory) {
return directoryPathMap.get(ts.toPath(directory, currentDirectory, getCanonicalFileName));
}
/**
* At first this function add entry directory -> module resolution result to the table.
* Then it computes the set of parent folders for 'directory' that should have the same module resolution result
* and for every parent folder in set it adds entry: parent -> module resolution. .
* Lets say we first directory name: /a/b/c/d/e and resolution result is: /a/b/bar.ts.
* Set of parent folders that should have the same result will be:
* [
* /a/b/c/d, /a/b/c, /a/b
* ]
* this means that request for module resolution from file in any of these folder will be immediately found in cache.
*/
function set(directory, result) {
var path = ts.toPath(directory, currentDirectory, getCanonicalFileName);
// if entry is already in cache do nothing
if (directoryPathMap.has(path)) {
return;
}
directoryPathMap.set(path, result);
var resolvedFileName = result.resolvedModule &&
(result.resolvedModule.originalPath || result.resolvedModule.resolvedFileName);
// find common prefix between directory and resolved file name
// this common prefix should be the shortest path that has the same resolution
// directory: /a/b/c/d/e
// resolvedFileName: /a/b/foo.d.ts
// commonPrefix: /a/b
// for failed lookups cache the result for every directory up to root
var commonPrefix = resolvedFileName && getCommonPrefix(path, resolvedFileName);
var current = path;
while (current !== commonPrefix) {
var parent = ts.getDirectoryPath(current);
if (parent === current || directoryPathMap.has(parent)) {
break;
}
directoryPathMap.set(parent, result);
current = parent;
}
}
function getCommonPrefix(directory, resolution) {
var resolutionDirectory = ts.toPath(ts.getDirectoryPath(resolution), currentDirectory, getCanonicalFileName);
// find first position where directory and resolution differs
var i = 0;
var limit = Math.min(directory.length, resolutionDirectory.length);
while (i < limit && directory.charCodeAt(i) === resolutionDirectory.charCodeAt(i)) {
i++;
}
if (i === directory.length && (resolutionDirectory.length === i || resolutionDirectory[i] === ts.directorySeparator)) {
return directory;
}
var rootLength = ts.getRootLength(directory);
if (i < rootLength) {
return undefined;
}
var sep = directory.lastIndexOf(ts.directorySeparator, i - 1);
if (sep === -1) {
return undefined;
}
return directory.substr(0, Math.max(sep, rootLength));
}
}
}
ts.createModuleResolutionCache = createModuleResolutionCache;
function createTypeReferenceDirectiveResolutionCache(currentDirectory, getCanonicalFileName, options, packageJsonInfoCache, directoryToModuleNameMap) {
var preDirectoryResolutionCache = createPerDirectoryResolutionCache(currentDirectory, getCanonicalFileName, directoryToModuleNameMap || (directoryToModuleNameMap = createCacheWithRedirects(options)));
packageJsonInfoCache || (packageJsonInfoCache = createPackageJsonInfoCache(currentDirectory, getCanonicalFileName));
return __assign(__assign(__assign({}, packageJsonInfoCache), preDirectoryResolutionCache), { clear: clear });
function clear() {
preDirectoryResolutionCache.clear();
packageJsonInfoCache.clear();
}
}
ts.createTypeReferenceDirectiveResolutionCache = createTypeReferenceDirectiveResolutionCache;
function resolveModuleNameFromCache(moduleName, containingFile, cache) {
var containingDirectory = ts.getDirectoryPath(containingFile);
var perFolderCache = cache && cache.getOrCreateCacheForDirectory(containingDirectory);
return perFolderCache && perFolderCache.get(moduleName);
}
ts.resolveModuleNameFromCache = resolveModuleNameFromCache;
function resolveModuleName(moduleName, containingFile, compilerOptions, host, cache, redirectedReference) {
var traceEnabled = isTraceEnabled(compilerOptions, host);
if (redirectedReference) {
compilerOptions = redirectedReference.commandLine.options;
}
if (traceEnabled) {
trace(host, ts.Diagnostics.Resolving_module_0_from_1, moduleName, containingFile);
if (redirectedReference) {
trace(host, ts.Diagnostics.Using_compiler_options_of_project_reference_redirect_0, redirectedReference.sourceFile.fileName);
}
}
var containingDirectory = ts.getDirectoryPath(containingFile);
var perFolderCache = cache && cache.getOrCreateCacheForDirectory(containingDirectory, redirectedReference);
var result = perFolderCache && perFolderCache.get(moduleName);
if (result) {
if (traceEnabled) {
trace(host, ts.Diagnostics.Resolution_for_module_0_was_found_in_cache_from_location_1, moduleName, containingDirectory);
}
}
else {
var moduleResolution = compilerOptions.moduleResolution;
if (moduleResolution === undefined) {
moduleResolution = ts.getEmitModuleKind(compilerOptions) === ts.ModuleKind.CommonJS ? ts.ModuleResolutionKind.NodeJs : ts.ModuleResolutionKind.Classic;
if (traceEnabled) {
trace(host, ts.Diagnostics.Module_resolution_kind_is_not_specified_using_0, ts.ModuleResolutionKind[moduleResolution]);
}
}
else {
if (traceEnabled) {
trace(host, ts.Diagnostics.Explicitly_specified_module_resolution_kind_Colon_0, ts.ModuleResolutionKind[moduleResolution]);
}
}
ts.perfLogger.logStartResolveModule(moduleName /* , containingFile, ModuleResolutionKind[moduleResolution]*/);
switch (moduleResolution) {
case ts.ModuleResolutionKind.NodeJs:
result = nodeModuleNameResolver(moduleName, containingFile, compilerOptions, host, cache, redirectedReference);
break;
case ts.ModuleResolutionKind.Classic:
result = classicNameResolver(moduleName, containingFile, compilerOptions, host, cache, redirectedReference);
break;
default:
return ts.Debug.fail("Unexpected moduleResolution: " + moduleResolution);
}
if (result && result.resolvedModule)
ts.perfLogger.logInfoEvent("Module \"" + moduleName + "\" resolved to \"" + result.resolvedModule.resolvedFileName + "\"");
ts.perfLogger.logStopResolveModule((result && result.resolvedModule) ? "" + result.resolvedModule.resolvedFileName : "null");
if (perFolderCache) {
perFolderCache.set(moduleName, result);
if (!ts.isExternalModuleNameRelative(moduleName)) {
// put result in per-module name cache
cache.getOrCreateCacheForModuleName(moduleName, redirectedReference).set(containingDirectory, result);
}
}
}
if (traceEnabled) {
if (result.resolvedModule) {
if (result.resolvedModule.packageId) {
trace(host, ts.Diagnostics.Module_name_0_was_successfully_resolved_to_1_with_Package_ID_2, moduleName, result.resolvedModule.resolvedFileName, ts.packageIdToString(result.resolvedModule.packageId));
}
else {
trace(host, ts.Diagnostics.Module_name_0_was_successfully_resolved_to_1, moduleName, result.resolvedModule.resolvedFileName);
}
}
else {
trace(host, ts.Diagnostics.Module_name_0_was_not_resolved, moduleName);
}
}
return result;
}
ts.resolveModuleName = resolveModuleName;
/**
* Any module resolution kind can be augmented with optional settings: 'baseUrl', 'paths' and 'rootDirs' - they are used to
* mitigate differences between design time structure of the project and its runtime counterpart so the same import name
* can be resolved successfully by TypeScript compiler and runtime module loader.
* If these settings are set then loading procedure will try to use them to resolve module name and it can of failure it will
* fallback to standard resolution routine.
*
* - baseUrl - this setting controls how non-relative module names are resolved. If this setting is specified then non-relative
* names will be resolved relative to baseUrl: i.e. if baseUrl is '/a/b' then candidate location to resolve module name 'c/d' will
* be '/a/b/c/d'
* - paths - this setting can only be used when baseUrl is specified. allows to tune how non-relative module names
* will be resolved based on the content of the module name.
* Structure of 'paths' compiler options
* 'paths': {
* pattern-1: [...substitutions],
* pattern-2: [...substitutions],
* ...
* pattern-n: [...substitutions]
* }
* Pattern here is a string that can contain zero or one '*' character. During module resolution module name will be matched against
* all patterns in the list. Matching for patterns that don't contain '*' means that module name must be equal to pattern respecting the case.
* If pattern contains '*' then to match pattern "<prefix>*<suffix>" module name must start with the <prefix> and end with <suffix>.
* <MatchedStar> denotes part of the module name between <prefix> and <suffix>.
* If module name can be matches with multiple patterns then pattern with the longest prefix will be picked.
* After selecting pattern we'll use list of substitutions to get candidate locations of the module and the try to load module
* from the candidate location.
* Substitution is a string that can contain zero or one '*'. To get candidate location from substitution we'll pick every
* substitution in the list and replace '*' with <MatchedStar> string. If candidate location is not rooted it
* will be converted to absolute using baseUrl.
* For example:
* baseUrl: /a/b/c
* "paths": {
* // match all module names
* "*": [
* "*", // use matched name as is,
* // <matched name> will be looked as /a/b/c/<matched name>
*
* "folder1/*" // substitution will convert matched name to 'folder1/<matched name>',
* // since it is not rooted then final candidate location will be /a/b/c/folder1/<matched name>
* ],
* // match module names that start with 'components/'
* "components/*": [ "/root/components/*" ] // substitution will convert /components/folder1/<matched name> to '/root/components/folder1/<matched name>',
* // it is rooted so it will be final candidate location
* }
*
* 'rootDirs' allows the project to be spreaded across multiple locations and resolve modules with relative names as if
* they were in the same location. For example lets say there are two files
* '/local/src/content/file1.ts'
* '/shared/components/contracts/src/content/protocols/file2.ts'
* After bundling content of '/shared/components/contracts/src' will be merged with '/local/src' so
* if file1 has the following import 'import {x} from "./protocols/file2"' it will be resolved successfully in runtime.
* 'rootDirs' provides the way to tell compiler that in order to get the whole project it should behave as if content of all
* root dirs were merged together.
* I.e. for the example above 'rootDirs' will have two entries: [ '/local/src', '/shared/components/contracts/src' ].
* Compiler will first convert './protocols/file2' into absolute path relative to the location of containing file:
* '/local/src/content/protocols/file2' and try to load it - failure.
* Then it will search 'rootDirs' looking for a longest matching prefix of this absolute path and if such prefix is found - absolute path will
* be converted to a path relative to found rootDir entry './content/protocols/file2' (*). As a last step compiler will check all remaining
* entries in 'rootDirs', use them to build absolute path out of (*) and try to resolve module from this location.
*/
function tryLoadModuleUsingOptionalResolutionSettings(extensions, moduleName, containingDirectory, loader, state) {
var resolved = tryLoadModuleUsingPathsIfEligible(extensions, moduleName, loader, state);
if (resolved)
return resolved.value;
if (!ts.isExternalModuleNameRelative(moduleName)) {
return tryLoadModuleUsingBaseUrl(extensions, moduleName, loader, state);
}
else {
return tryLoadModuleUsingRootDirs(extensions, moduleName, containingDirectory, loader, state);
}
}
function tryLoadModuleUsingPathsIfEligible(extensions, moduleName, loader, state) {
var _a;
var _b = state.compilerOptions, baseUrl = _b.baseUrl, paths = _b.paths, configFile = _b.configFile;
if (paths && !ts.pathIsRelative(moduleName)) {
if (state.traceEnabled) {
if (baseUrl) {
trace(state.host, ts.Diagnostics.baseUrl_option_is_set_to_0_using_this_value_to_resolve_non_relative_module_name_1, baseUrl, moduleName);
}
trace(state.host, ts.Diagnostics.paths_option_is_specified_looking_for_a_pattern_to_match_module_name_0, moduleName);
}
var baseDirectory = ts.getPathsBasePath(state.compilerOptions, state.host); // Always defined when 'paths' is defined
var pathPatterns = (configFile === null || configFile === void 0 ? void 0 : configFile.configFileSpecs) ? (_a = configFile.configFileSpecs).pathPatterns || (_a.pathPatterns = ts.tryParsePatterns(paths)) : undefined;
return tryLoadModuleUsingPaths(extensions, moduleName, baseDirectory, paths, pathPatterns, loader, /*onlyRecordFailures*/ false, state);
}
}
function tryLoadModuleUsingRootDirs(extensions, moduleName, containingDirectory, loader, state) {
if (!state.compilerOptions.rootDirs) {
return undefined;
}
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.rootDirs_option_is_set_using_it_to_resolve_relative_module_name_0, moduleName);
}
var candidate = ts.normalizePath(ts.combinePaths(containingDirectory, moduleName));
var matchedRootDir;
var matchedNormalizedPrefix;
for (var _i = 0, _a = state.compilerOptions.rootDirs; _i < _a.length; _i++) {
var rootDir = _a[_i];
// rootDirs are expected to be absolute
// in case of tsconfig.json this will happen automatically - compiler will expand relative names
// using location of tsconfig.json as base location
var normalizedRoot = ts.normalizePath(rootDir);
if (!ts.endsWith(normalizedRoot, ts.directorySeparator)) {
normalizedRoot += ts.directorySeparator;
}
var isLongestMatchingPrefix = ts.startsWith(candidate, normalizedRoot) &&
(matchedNormalizedPrefix === undefined || matchedNormalizedPrefix.length < normalizedRoot.length);
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Checking_if_0_is_the_longest_matching_prefix_for_1_2, normalizedRoot, candidate, isLongestMatchingPrefix);
}
if (isLongestMatchingPrefix) {
matchedNormalizedPrefix = normalizedRoot;
matchedRootDir = rootDir;
}
}
if (matchedNormalizedPrefix) {
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Longest_matching_prefix_for_0_is_1, candidate, matchedNormalizedPrefix);
}
var suffix = candidate.substr(matchedNormalizedPrefix.length);
// first - try to load from a initial location
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Loading_0_from_the_root_dir_1_candidate_location_2, suffix, matchedNormalizedPrefix, candidate);
}
var resolvedFileName = loader(extensions, candidate, !ts.directoryProbablyExists(containingDirectory, state.host), state);
if (resolvedFileName) {
return resolvedFileName;
}
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Trying_other_entries_in_rootDirs);
}
// then try to resolve using remaining entries in rootDirs
for (var _b = 0, _c = state.compilerOptions.rootDirs; _b < _c.length; _b++) {
var rootDir = _c[_b];
if (rootDir === matchedRootDir) {
// skip the initially matched entry
continue;
}
var candidate_1 = ts.combinePaths(ts.normalizePath(rootDir), suffix);
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Loading_0_from_the_root_dir_1_candidate_location_2, suffix, rootDir, candidate_1);
}
var baseDirectory = ts.getDirectoryPath(candidate_1);
var resolvedFileName_1 = loader(extensions, candidate_1, !ts.directoryProbablyExists(baseDirectory, state.host), state);
if (resolvedFileName_1) {
return resolvedFileName_1;
}
}
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Module_resolution_using_rootDirs_has_failed);
}
}
return undefined;
}
function tryLoadModuleUsingBaseUrl(extensions, moduleName, loader, state) {
var baseUrl = state.compilerOptions.baseUrl;
if (!baseUrl) {
return undefined;
}
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.baseUrl_option_is_set_to_0_using_this_value_to_resolve_non_relative_module_name_1, baseUrl, moduleName);
}
var candidate = ts.normalizePath(ts.combinePaths(baseUrl, moduleName));
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Resolving_module_name_0_relative_to_base_url_1_2, moduleName, baseUrl, candidate);
}
return loader(extensions, candidate, !ts.directoryProbablyExists(ts.getDirectoryPath(candidate), state.host), state);
}
/**
* Expose resolution logic to allow us to use Node module resolution logic from arbitrary locations.
* No way to do this with `require()`: https://github.com/nodejs/node/issues/5963
* Throws an error if the module can't be resolved.
*/
/* @internal */
function resolveJSModule(moduleName, initialDir, host) {
var _a = tryResolveJSModuleWorker(moduleName, initialDir, host), resolvedModule = _a.resolvedModule, failedLookupLocations = _a.failedLookupLocations;
if (!resolvedModule) {
throw new Error("Could not resolve JS module '" + moduleName + "' starting at '" + initialDir + "'. Looked in: " + failedLookupLocations.join(", "));
}
return resolvedModule.resolvedFileName;
}
ts.resolveJSModule = resolveJSModule;
/* @internal */
function tryResolveJSModule(moduleName, initialDir, host) {
var resolvedModule = tryResolveJSModuleWorker(moduleName, initialDir, host).resolvedModule;
return resolvedModule && resolvedModule.resolvedFileName;
}
ts.tryResolveJSModule = tryResolveJSModule;
var jsOnlyExtensions = [Extensions.JavaScript];
var tsExtensions = [Extensions.TypeScript, Extensions.JavaScript];
var tsPlusJsonExtensions = __spreadArray(__spreadArray([], tsExtensions, true), [Extensions.Json], false);
var tsconfigExtensions = [Extensions.TSConfig];
function tryResolveJSModuleWorker(moduleName, initialDir, host) {
return nodeModuleNameResolverWorker(moduleName, initialDir, { moduleResolution: ts.ModuleResolutionKind.NodeJs, allowJs: true }, host, /*cache*/ undefined, jsOnlyExtensions, /*redirectedReferences*/ undefined);
}
function nodeModuleNameResolver(moduleName, containingFile, compilerOptions, host, cache, redirectedReference, lookupConfig) {
return nodeModuleNameResolverWorker(moduleName, ts.getDirectoryPath(containingFile), compilerOptions, host, cache, lookupConfig ? tsconfigExtensions : (compilerOptions.resolveJsonModule ? tsPlusJsonExtensions : tsExtensions), redirectedReference);
}
ts.nodeModuleNameResolver = nodeModuleNameResolver;
function nodeModuleNameResolverWorker(moduleName, containingDirectory, compilerOptions, host, cache, extensions, redirectedReference) {
var _a, _b;
var traceEnabled = isTraceEnabled(compilerOptions, host);
var failedLookupLocations = [];
var state = { compilerOptions: compilerOptions, host: host, traceEnabled: traceEnabled, failedLookupLocations: failedLookupLocations, packageJsonInfoCache: cache };
var result = ts.forEach(extensions, function (ext) { return tryResolve(ext); });
return createResolvedModuleWithFailedLookupLocations((_a = result === null || result === void 0 ? void 0 : result.value) === null || _a === void 0 ? void 0 : _a.resolved, (_b = result === null || result === void 0 ? void 0 : result.value) === null || _b === void 0 ? void 0 : _b.isExternalLibraryImport, failedLookupLocations, state.resultFromCache);
function tryResolve(extensions) {
var loader = function (extensions, candidate, onlyRecordFailures, state) { return nodeLoadModuleByRelativeName(extensions, candidate, onlyRecordFailures, state, /*considerPackageJson*/ true); };
var resolved = tryLoadModuleUsingOptionalResolutionSettings(extensions, moduleName, containingDirectory, loader, state);
if (resolved) {
return toSearchResult({ resolved: resolved, isExternalLibraryImport: pathContainsNodeModules(resolved.path) });
}
if (!ts.isExternalModuleNameRelative(moduleName)) {
if (traceEnabled) {
trace(host, ts.Diagnostics.Loading_module_0_from_node_modules_folder_target_file_type_1, moduleName, Extensions[extensions]);
}
var resolved_1 = loadModuleFromNearestNodeModulesDirectory(extensions, moduleName, containingDirectory, state, cache, redirectedReference);
if (!resolved_1)
return undefined;
var resolvedValue = resolved_1.value;
if (!compilerOptions.preserveSymlinks && resolvedValue && !resolvedValue.originalPath) {
var path = realPath(resolvedValue.path, host, traceEnabled);
var originalPath = path === resolvedValue.path ? undefined : resolvedValue.path;
resolvedValue = __assign(__assign({}, resolvedValue), { path: path, originalPath: originalPath });
}
// For node_modules lookups, get the real path so that multiple accesses to an `npm link`-ed module do not create duplicate files.
return { value: resolvedValue && { resolved: resolvedValue, isExternalLibraryImport: true } };
}
else {
var _a = ts.normalizePathAndParts(ts.combinePaths(containingDirectory, moduleName)), candidate = _a.path, parts = _a.parts;
var resolved_2 = nodeLoadModuleByRelativeName(extensions, candidate, /*onlyRecordFailures*/ false, state, /*considerPackageJson*/ true);
// Treat explicit "node_modules" import as an external library import.
return resolved_2 && toSearchResult({ resolved: resolved_2, isExternalLibraryImport: ts.contains(parts, "node_modules") });
}
}
}
function realPath(path, host, traceEnabled) {
if (!host.realpath) {
return path;
}
var real = ts.normalizePath(host.realpath(path));
if (traceEnabled) {
trace(host, ts.Diagnostics.Resolving_real_path_for_0_result_1, path, real);
}
ts.Debug.assert(host.fileExists(real), path + " linked to nonexistent file " + real);
return real;
}
function nodeLoadModuleByRelativeName(extensions, candidate, onlyRecordFailures, state, considerPackageJson) {
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Loading_module_as_file_Slash_folder_candidate_module_location_0_target_file_type_1, candidate, Extensions[extensions]);
}
if (!ts.hasTrailingDirectorySeparator(candidate)) {
if (!onlyRecordFailures) {
var parentOfCandidate = ts.getDirectoryPath(candidate);
if (!ts.directoryProbablyExists(parentOfCandidate, state.host)) {
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Directory_0_does_not_exist_skipping_all_lookups_in_it, parentOfCandidate);
}
onlyRecordFailures = true;
}
}
var resolvedFromFile = loadModuleFromFile(extensions, candidate, onlyRecordFailures, state);
if (resolvedFromFile) {
var packageDirectory = considerPackageJson ? parseNodeModuleFromPath(resolvedFromFile.path) : undefined;
var packageInfo = packageDirectory ? getPackageJsonInfo(packageDirectory, /*onlyRecordFailures*/ false, state) : undefined;
return withPackageId(packageInfo, resolvedFromFile);
}
}
if (!onlyRecordFailures) {
var candidateExists = ts.directoryProbablyExists(candidate, state.host);
if (!candidateExists) {
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Directory_0_does_not_exist_skipping_all_lookups_in_it, candidate);
}
onlyRecordFailures = true;
}
}
return loadNodeModuleFromDirectory(extensions, candidate, onlyRecordFailures, state, considerPackageJson);
}
/*@internal*/
ts.nodeModulesPathPart = "/node_modules/";
/*@internal*/
function pathContainsNodeModules(path) {
return ts.stringContains(path, ts.nodeModulesPathPart);
}
ts.pathContainsNodeModules = pathContainsNodeModules;
/**
* This will be called on the successfully resolved path from `loadModuleFromFile`.
* (Not needed for `loadModuleFromNodeModules` as that looks up the `package.json` as part of resolution.)
*
* packageDirectory is the directory of the package itself.
* For `blah/node_modules/foo/index.d.ts` this is packageDirectory: "foo"
* For `/node_modules/foo/bar.d.ts` this is packageDirectory: "foo"
* For `/node_modules/@types/foo/bar/index.d.ts` this is packageDirectory: "@types/foo"
* For `/node_modules/foo/bar/index.d.ts` this is packageDirectory: "foo"
*/
/* @internal */
function parseNodeModuleFromPath(resolved) {
var path = ts.normalizePath(resolved);
var idx = path.lastIndexOf(ts.nodeModulesPathPart);
if (idx === -1) {
return undefined;
}
var indexAfterNodeModules = idx + ts.nodeModulesPathPart.length;
var indexAfterPackageName = moveToNextDirectorySeparatorIfAvailable(path, indexAfterNodeModules);
if (path.charCodeAt(indexAfterNodeModules) === 64 /* at */) {
indexAfterPackageName = moveToNextDirectorySeparatorIfAvailable(path, indexAfterPackageName);
}
return path.slice(0, indexAfterPackageName);
}
ts.parseNodeModuleFromPath = parseNodeModuleFromPath;
function moveToNextDirectorySeparatorIfAvailable(path, prevSeparatorIndex) {
var nextSeparatorIndex = path.indexOf(ts.directorySeparator, prevSeparatorIndex + 1);
return nextSeparatorIndex === -1 ? prevSeparatorIndex : nextSeparatorIndex;
}
function loadModuleFromFileNoPackageId(extensions, candidate, onlyRecordFailures, state) {
return noPackageId(loadModuleFromFile(extensions, candidate, onlyRecordFailures, state));
}
/**
* @param {boolean} onlyRecordFailures - if true then function won't try to actually load files but instead record all attempts as failures. This flag is necessary
* in cases when we know upfront that all load attempts will fail (because containing folder does not exists) however we still need to record all failed lookup locations.
*/
function loadModuleFromFile(extensions, candidate, onlyRecordFailures, state) {
if (extensions === Extensions.Json || extensions === Extensions.TSConfig) {
var extensionLess = ts.tryRemoveExtension(candidate, ".json" /* Json */);
return (extensionLess === undefined && extensions === Extensions.Json) ? undefined : tryAddingExtensions(extensionLess || candidate, extensions, onlyRecordFailures, state);
}
// First, try adding an extension. An import of "foo" could be matched by a file "foo.ts", or "foo.js" by "foo.js.ts"
var resolvedByAddingExtension = tryAddingExtensions(candidate, extensions, onlyRecordFailures, state);
if (resolvedByAddingExtension) {
return resolvedByAddingExtension;
}
// If that didn't work, try stripping a ".js" or ".jsx" extension and replacing it with a TypeScript one;
// e.g. "./foo.js" can be matched by "./foo.ts" or "./foo.d.ts"
if (ts.hasJSFileExtension(candidate)) {
var extensionless = ts.removeFileExtension(candidate);
if (state.traceEnabled) {
var extension = candidate.substring(extensionless.length);
trace(state.host, ts.Diagnostics.File_name_0_has_a_1_extension_stripping_it, candidate, extension);
}
return tryAddingExtensions(extensionless, extensions, onlyRecordFailures, state);
}
}
/** Try to return an existing file that adds one of the `extensions` to `candidate`. */
function tryAddingExtensions(candidate, extensions, onlyRecordFailures, state) {
if (!onlyRecordFailures) {
// check if containing folder exists - if it doesn't then just record failures for all supported extensions without disk probing
var directory = ts.getDirectoryPath(candidate);
if (directory) {
onlyRecordFailures = !ts.directoryProbablyExists(directory, state.host);
}
}
switch (extensions) {
case Extensions.DtsOnly:
return tryExtension(".d.ts" /* Dts */);
case Extensions.TypeScript:
return tryExtension(".ts" /* Ts */) || tryExtension(".tsx" /* Tsx */) || tryExtension(".d.ts" /* Dts */);
case Extensions.JavaScript:
return tryExtension(".js" /* Js */) || tryExtension(".jsx" /* Jsx */);
case Extensions.TSConfig:
case Extensions.Json:
return tryExtension(".json" /* Json */);
}
function tryExtension(ext) {
var path = tryFile(candidate + ext, onlyRecordFailures, state);
return path === undefined ? undefined : { path: path, ext: ext };
}
}
/** Return the file if it exists. */
function tryFile(fileName, onlyRecordFailures, state) {
if (!onlyRecordFailures) {
if (state.host.fileExists(fileName)) {
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.File_0_exist_use_it_as_a_name_resolution_result, fileName);
}
return fileName;
}
else {
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.File_0_does_not_exist, fileName);
}
}
}
state.failedLookupLocations.push(fileName);
return undefined;
}
function loadNodeModuleFromDirectory(extensions, candidate, onlyRecordFailures, state, considerPackageJson) {
if (considerPackageJson === void 0) { considerPackageJson = true; }
var packageInfo = considerPackageJson ? getPackageJsonInfo(candidate, onlyRecordFailures, state) : undefined;
var packageJsonContent = packageInfo && packageInfo.packageJsonContent;
var versionPaths = packageInfo && packageInfo.versionPaths;
return withPackageId(packageInfo, loadNodeModuleFromDirectoryWorker(extensions, candidate, onlyRecordFailures, state, packageJsonContent, versionPaths));
}
function getPackageJsonInfo(packageDirectory, onlyRecordFailures, state) {
var _a, _b, _c;
var host = state.host, traceEnabled = state.traceEnabled;
var packageJsonPath = ts.combinePaths(packageDirectory, "package.json");
if (onlyRecordFailures) {
state.failedLookupLocations.push(packageJsonPath);
return undefined;
}
var existing = (_a = state.packageJsonInfoCache) === null || _a === void 0 ? void 0 : _a.getPackageJsonInfo(packageJsonPath);
if (existing !== undefined) {
if (typeof existing !== "boolean") {
if (traceEnabled)
trace(host, ts.Diagnostics.File_0_exists_according_to_earlier_cached_lookups, packageJsonPath);
return existing;
}
else {
if (existing && traceEnabled)
trace(host, ts.Diagnostics.File_0_does_not_exist_according_to_earlier_cached_lookups, packageJsonPath);
state.failedLookupLocations.push(packageJsonPath);
return undefined;
}
}
var directoryExists = ts.directoryProbablyExists(packageDirectory, host);
if (directoryExists && host.fileExists(packageJsonPath)) {
var packageJsonContent = ts.readJson(packageJsonPath, host);
if (traceEnabled) {
trace(host, ts.Diagnostics.Found_package_json_at_0, packageJsonPath);
}
var versionPaths = readPackageJsonTypesVersionPaths(packageJsonContent, state);
var result = { packageDirectory: packageDirectory, packageJsonContent: packageJsonContent, versionPaths: versionPaths };
(_b = state.packageJsonInfoCache) === null || _b === void 0 ? void 0 : _b.setPackageJsonInfo(packageJsonPath, result);
return result;
}
else {
if (directoryExists && traceEnabled) {
trace(host, ts.Diagnostics.File_0_does_not_exist, packageJsonPath);
}
(_c = state.packageJsonInfoCache) === null || _c === void 0 ? void 0 : _c.setPackageJsonInfo(packageJsonPath, directoryExists);
// record package json as one of failed lookup locations - in the future if this file will appear it will invalidate resolution results
state.failedLookupLocations.push(packageJsonPath);
}
}
function loadNodeModuleFromDirectoryWorker(extensions, candidate, onlyRecordFailures, state, jsonContent, versionPaths) {
var packageFile;
if (jsonContent) {
switch (extensions) {
case Extensions.JavaScript:
case Extensions.Json:
packageFile = readPackageJsonMainField(jsonContent, candidate, state);
break;
case Extensions.TypeScript:
// When resolving typescript modules, try resolving using main field as well
packageFile = readPackageJsonTypesFields(jsonContent, candidate, state) || readPackageJsonMainField(jsonContent, candidate, state);
break;
case Extensions.DtsOnly:
packageFile = readPackageJsonTypesFields(jsonContent, candidate, state);
break;
case Extensions.TSConfig:
packageFile = readPackageJsonTSConfigField(jsonContent, candidate, state);
break;
default:
return ts.Debug.assertNever(extensions);
}
}
var loader = function (extensions, candidate, onlyRecordFailures, state) {
var fromFile = tryFile(candidate, onlyRecordFailures, state);
if (fromFile) {
var resolved = resolvedIfExtensionMatches(extensions, fromFile);
if (resolved) {
return noPackageId(resolved);
}
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.File_0_has_an_unsupported_extension_so_skipping_it, fromFile);
}
}
// Even if extensions is DtsOnly, we can still look up a .ts file as a result of package.json "types"
var nextExtensions = extensions === Extensions.DtsOnly ? Extensions.TypeScript : extensions;
// Don't do package.json lookup recursively, because Node.js' package lookup doesn't.
return nodeLoadModuleByRelativeName(nextExtensions, candidate, onlyRecordFailures, state, /*considerPackageJson*/ false);
};
var onlyRecordFailuresForPackageFile = packageFile ? !ts.directoryProbablyExists(ts.getDirectoryPath(packageFile), state.host) : undefined;
var onlyRecordFailuresForIndex = onlyRecordFailures || !ts.directoryProbablyExists(candidate, state.host);
var indexPath = ts.combinePaths(candidate, extensions === Extensions.TSConfig ? "tsconfig" : "index");
if (versionPaths && (!packageFile || ts.containsPath(candidate, packageFile))) {
var moduleName = ts.getRelativePathFromDirectory(candidate, packageFile || indexPath, /*ignoreCase*/ false);
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.package_json_has_a_typesVersions_entry_0_that_matches_compiler_version_1_looking_for_a_pattern_to_match_module_name_2, versionPaths.version, ts.version, moduleName);
}
var result = tryLoadModuleUsingPaths(extensions, moduleName, candidate, versionPaths.paths, /*pathPatterns*/ undefined, loader, onlyRecordFailuresForPackageFile || onlyRecordFailuresForIndex, state);
if (result) {
return removeIgnoredPackageId(result.value);
}
}
// It won't have a `packageId` set, because we disabled `considerPackageJson`.
var packageFileResult = packageFile && removeIgnoredPackageId(loader(extensions, packageFile, onlyRecordFailuresForPackageFile, state));
if (packageFileResult)
return packageFileResult;
return loadModuleFromFile(extensions, indexPath, onlyRecordFailuresForIndex, state);
}
/** Resolve from an arbitrarily specified file. Return `undefined` if it has an unsupported extension. */
function resolvedIfExtensionMatches(extensions, path) {
var ext = ts.tryGetExtensionFromPath(path);
return ext !== undefined && extensionIsOk(extensions, ext) ? { path: path, ext: ext } : undefined;
}
/** True if `extension` is one of the supported `extensions`. */
function extensionIsOk(extensions, extension) {
switch (extensions) {
case Extensions.JavaScript:
return extension === ".js" /* Js */ || extension === ".jsx" /* Jsx */;
case Extensions.TSConfig:
case Extensions.Json:
return extension === ".json" /* Json */;
case Extensions.TypeScript:
return extension === ".ts" /* Ts */ || extension === ".tsx" /* Tsx */ || extension === ".d.ts" /* Dts */;
case Extensions.DtsOnly:
return extension === ".d.ts" /* Dts */;
}
}
/* @internal */
function parsePackageName(moduleName) {
var idx = moduleName.indexOf(ts.directorySeparator);
if (moduleName[0] === "@") {
idx = moduleName.indexOf(ts.directorySeparator, idx + 1);
}
return idx === -1 ? { packageName: moduleName, rest: "" } : { packageName: moduleName.slice(0, idx), rest: moduleName.slice(idx + 1) };
}
ts.parsePackageName = parsePackageName;
function loadModuleFromNearestNodeModulesDirectory(extensions, moduleName, directory, state, cache, redirectedReference) {
return loadModuleFromNearestNodeModulesDirectoryWorker(extensions, moduleName, directory, state, /*typesScopeOnly*/ false, cache, redirectedReference);
}
function loadModuleFromNearestNodeModulesDirectoryTypesScope(moduleName, directory, state) {
// Extensions parameter here doesn't actually matter, because typesOnly ensures we're just doing @types lookup, which is always DtsOnly.
return loadModuleFromNearestNodeModulesDirectoryWorker(Extensions.DtsOnly, moduleName, directory, state, /*typesScopeOnly*/ true, /*cache*/ undefined, /*redirectedReference*/ undefined);
}
function loadModuleFromNearestNodeModulesDirectoryWorker(extensions, moduleName, directory, state, typesScopeOnly, cache, redirectedReference) {
var perModuleNameCache = cache && cache.getOrCreateCacheForModuleName(moduleName, redirectedReference);
return ts.forEachAncestorDirectory(ts.normalizeSlashes(directory), function (ancestorDirectory) {
if (ts.getBaseFileName(ancestorDirectory) !== "node_modules") {
var resolutionFromCache = tryFindNonRelativeModuleNameInCache(perModuleNameCache, moduleName, ancestorDirectory, state);
if (resolutionFromCache) {
return resolutionFromCache;
}
return toSearchResult(loadModuleFromImmediateNodeModulesDirectory(extensions, moduleName, ancestorDirectory, state, typesScopeOnly));
}
});
}
function loadModuleFromImmediateNodeModulesDirectory(extensions, moduleName, directory, state, typesScopeOnly) {
var nodeModulesFolder = ts.combinePaths(directory, "node_modules");
var nodeModulesFolderExists = ts.directoryProbablyExists(nodeModulesFolder, state.host);
if (!nodeModulesFolderExists && state.traceEnabled) {
trace(state.host, ts.Diagnostics.Directory_0_does_not_exist_skipping_all_lookups_in_it, nodeModulesFolder);
}
var packageResult = typesScopeOnly ? undefined : loadModuleFromSpecificNodeModulesDirectory(extensions, moduleName, nodeModulesFolder, nodeModulesFolderExists, state);
if (packageResult) {
return packageResult;
}
if (extensions === Extensions.TypeScript || extensions === Extensions.DtsOnly) {
var nodeModulesAtTypes_1 = ts.combinePaths(nodeModulesFolder, "@types");
var nodeModulesAtTypesExists = nodeModulesFolderExists;
if (nodeModulesFolderExists && !ts.directoryProbablyExists(nodeModulesAtTypes_1, state.host)) {
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Directory_0_does_not_exist_skipping_all_lookups_in_it, nodeModulesAtTypes_1);
}
nodeModulesAtTypesExists = false;
}
return loadModuleFromSpecificNodeModulesDirectory(Extensions.DtsOnly, mangleScopedPackageNameWithTrace(moduleName, state), nodeModulesAtTypes_1, nodeModulesAtTypesExists, state);
}
}
function loadModuleFromSpecificNodeModulesDirectory(extensions, moduleName, nodeModulesDirectory, nodeModulesDirectoryExists, state) {
var candidate = ts.normalizePath(ts.combinePaths(nodeModulesDirectory, moduleName));
// First look for a nested package.json, as in `node_modules/foo/bar/package.json`.
var packageInfo = getPackageJsonInfo(candidate, !nodeModulesDirectoryExists, state);
if (packageInfo) {
var fromFile = loadModuleFromFile(extensions, candidate, !nodeModulesDirectoryExists, state);
if (fromFile) {
return noPackageId(fromFile);
}
var fromDirectory = loadNodeModuleFromDirectoryWorker(extensions, candidate, !nodeModulesDirectoryExists, state, packageInfo.packageJsonContent, packageInfo.versionPaths);
return withPackageId(packageInfo, fromDirectory);
}
var loader = function (extensions, candidate, onlyRecordFailures, state) {
var pathAndExtension = loadModuleFromFile(extensions, candidate, onlyRecordFailures, state) ||
loadNodeModuleFromDirectoryWorker(extensions, candidate, onlyRecordFailures, state, packageInfo && packageInfo.packageJsonContent, packageInfo && packageInfo.versionPaths);
return withPackageId(packageInfo, pathAndExtension);
};
var _a = parsePackageName(moduleName), packageName = _a.packageName, rest = _a.rest;
if (rest !== "") { // If "rest" is empty, we just did this search above.
var packageDirectory = ts.combinePaths(nodeModulesDirectory, packageName);
// Don't use a "types" or "main" from here because we're not loading the root, but a subdirectory -- just here for the packageId and path mappings.
packageInfo = getPackageJsonInfo(packageDirectory, !nodeModulesDirectoryExists, state);
if (packageInfo && packageInfo.versionPaths) {
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.package_json_has_a_typesVersions_entry_0_that_matches_compiler_version_1_looking_for_a_pattern_to_match_module_name_2, packageInfo.versionPaths.version, ts.version, rest);
}
var packageDirectoryExists = nodeModulesDirectoryExists && ts.directoryProbablyExists(packageDirectory, state.host);
var fromPaths = tryLoadModuleUsingPaths(extensions, rest, packageDirectory, packageInfo.versionPaths.paths, /*pathPatterns*/ undefined, loader, !packageDirectoryExists, state);
if (fromPaths) {
return fromPaths.value;
}
}
}
return loader(extensions, candidate, !nodeModulesDirectoryExists, state);
}
function tryLoadModuleUsingPaths(extensions, moduleName, baseDirectory, paths, pathPatterns, loader, onlyRecordFailures, state) {
pathPatterns || (pathPatterns = ts.tryParsePatterns(paths));
var matchedPattern = ts.matchPatternOrExact(pathPatterns, moduleName);
if (matchedPattern) {
var matchedStar_1 = ts.isString(matchedPattern) ? undefined : ts.matchedText(matchedPattern, moduleName);
var matchedPatternText = ts.isString(matchedPattern) ? matchedPattern : ts.patternText(matchedPattern);
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Module_name_0_matched_pattern_1, moduleName, matchedPatternText);
}
var resolved = ts.forEach(paths[matchedPatternText], function (subst) {
var path = matchedStar_1 ? subst.replace("*", matchedStar_1) : subst;
// When baseUrl is not specified, the command line parser resolves relative paths to the config file location.
var candidate = ts.normalizePath(ts.combinePaths(baseDirectory, path));
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Trying_substitution_0_candidate_module_location_Colon_1, subst, path);
}
// A path mapping may have an extension, in contrast to an import, which should omit it.
var extension = ts.tryGetExtensionFromPath(subst);
if (extension !== undefined) {
var path_1 = tryFile(candidate, onlyRecordFailures, state);
if (path_1 !== undefined) {
return noPackageId({ path: path_1, ext: extension });
}
}
return loader(extensions, candidate, onlyRecordFailures || !ts.directoryProbablyExists(ts.getDirectoryPath(candidate), state.host), state);
});
return { value: resolved };
}
}
/** Double underscores are used in DefinitelyTyped to delimit scoped packages. */
var mangledScopedPackageSeparator = "__";
/** For a scoped package, we must look in `@types/foo__bar` instead of `@types/@foo/bar`. */
function mangleScopedPackageNameWithTrace(packageName, state) {
var mangled = mangleScopedPackageName(packageName);
if (state.traceEnabled && mangled !== packageName) {
trace(state.host, ts.Diagnostics.Scoped_package_detected_looking_in_0, mangled);
}
return mangled;
}
/* @internal */
function getTypesPackageName(packageName) {
return "@types/" + mangleScopedPackageName(packageName);
}
ts.getTypesPackageName = getTypesPackageName;
/* @internal */
function mangleScopedPackageName(packageName) {
if (ts.startsWith(packageName, "@")) {
var replaceSlash = packageName.replace(ts.directorySeparator, mangledScopedPackageSeparator);
if (replaceSlash !== packageName) {
return replaceSlash.slice(1); // Take off the "@"
}
}
return packageName;
}
ts.mangleScopedPackageName = mangleScopedPackageName;
/* @internal */
function getPackageNameFromTypesPackageName(mangledName) {
var withoutAtTypePrefix = ts.removePrefix(mangledName, "@types/");
if (withoutAtTypePrefix !== mangledName) {
return unmangleScopedPackageName(withoutAtTypePrefix);
}
return mangledName;
}
ts.getPackageNameFromTypesPackageName = getPackageNameFromTypesPackageName;
/* @internal */
function unmangleScopedPackageName(typesPackageName) {
return ts.stringContains(typesPackageName, mangledScopedPackageSeparator) ?
"@" + typesPackageName.replace(mangledScopedPackageSeparator, ts.directorySeparator) :
typesPackageName;
}
ts.unmangleScopedPackageName = unmangleScopedPackageName;
function tryFindNonRelativeModuleNameInCache(cache, moduleName, containingDirectory, state) {
var result = cache && cache.get(containingDirectory);
if (result) {
if (state.traceEnabled) {
trace(state.host, ts.Diagnostics.Resolution_for_module_0_was_found_in_cache_from_location_1, moduleName, containingDirectory);
}
state.resultFromCache = result;
return { value: result.resolvedModule && { path: result.resolvedModule.resolvedFileName, originalPath: result.resolvedModule.originalPath || true, extension: result.resolvedModule.extension, packageId: result.resolvedModule.packageId } };
}
}
function classicNameResolver(moduleName, containingFile, compilerOptions, host, cache, redirectedReference) {
var traceEnabled = isTraceEnabled(compilerOptions, host);
var failedLookupLocations = [];
var state = { compilerOptions: compilerOptions, host: host, traceEnabled: traceEnabled, failedLookupLocations: failedLookupLocations, packageJsonInfoCache: cache };
var containingDirectory = ts.getDirectoryPath(containingFile);
var resolved = tryResolve(Extensions.TypeScript) || tryResolve(Extensions.JavaScript);
// No originalPath because classic resolution doesn't resolve realPath
return createResolvedModuleWithFailedLookupLocations(resolved && resolved.value, /*isExternalLibraryImport*/ false, failedLookupLocations, state.resultFromCache);
function tryResolve(extensions) {
var resolvedUsingSettings = tryLoadModuleUsingOptionalResolutionSettings(extensions, moduleName, containingDirectory, loadModuleFromFileNoPackageId, state);
if (resolvedUsingSettings) {
return { value: resolvedUsingSettings };
}
if (!ts.isExternalModuleNameRelative(moduleName)) {
var perModuleNameCache_1 = cache && cache.getOrCreateCacheForModuleName(moduleName, redirectedReference);
// Climb up parent directories looking for a module.
var resolved_3 = ts.forEachAncestorDirectory(containingDirectory, function (directory) {
var resolutionFromCache = tryFindNonRelativeModuleNameInCache(perModuleNameCache_1, moduleName, directory, state);
if (resolutionFromCache) {
return resolutionFromCache;
}
var searchName = ts.normalizePath(ts.combinePaths(directory, moduleName));
return toSearchResult(loadModuleFromFileNoPackageId(extensions, searchName, /*onlyRecordFailures*/ false, state));
});
if (resolved_3) {
return resolved_3;
}
if (extensions === Extensions.TypeScript) {
// If we didn't find the file normally, look it up in @types.
return loadModuleFromNearestNodeModulesDirectoryTypesScope(moduleName, containingDirectory, state);
}
}
else {
var candidate = ts.normalizePath(ts.combinePaths(containingDirectory, moduleName));
return toSearchResult(loadModuleFromFileNoPackageId(extensions, candidate, /*onlyRecordFailures*/ false, state));
}
}
}
ts.classicNameResolver = classicNameResolver;
/**
* A host may load a module from a global cache of typings.
* This is the minumum code needed to expose that functionality; the rest is in the host.
*/
/* @internal */
function loadModuleFromGlobalCache(moduleName, projectName, compilerOptions, host, globalCache, packageJsonInfoCache) {
var traceEnabled = isTraceEnabled(compilerOptions, host);
if (traceEnabled) {
trace(host, ts.Diagnostics.Auto_discovery_for_typings_is_enabled_in_project_0_Running_extra_resolution_pass_for_module_1_using_cache_location_2, projectName, moduleName, globalCache);
}
var failedLookupLocations = [];
var state = { compilerOptions: compilerOptions, host: host, traceEnabled: traceEnabled, failedLookupLocations: failedLookupLocations, packageJsonInfoCache: packageJsonInfoCache };
var resolved = loadModuleFromImmediateNodeModulesDirectory(Extensions.DtsOnly, moduleName, globalCache, state, /*typesScopeOnly*/ false);
return createResolvedModuleWithFailedLookupLocations(resolved, /*isExternalLibraryImport*/ true, failedLookupLocations, state.resultFromCache);
}
ts.loadModuleFromGlobalCache = loadModuleFromGlobalCache;
/**
* Wraps value to SearchResult.
* @returns undefined if value is undefined or { value } otherwise
*/
function toSearchResult(value) {
return value !== undefined ? { value: value } : undefined;
}
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
var ModuleInstanceState;
(function (ModuleInstanceState) {
ModuleInstanceState[ModuleInstanceState["NonInstantiated"] = 0] = "NonInstantiated";
ModuleInstanceState[ModuleInstanceState["Instantiated"] = 1] = "Instantiated";
ModuleInstanceState[ModuleInstanceState["ConstEnumOnly"] = 2] = "ConstEnumOnly";
})(ModuleInstanceState = ts.ModuleInstanceState || (ts.ModuleInstanceState = {}));
function getModuleInstanceState(node, visited) {
if (node.body && !node.body.parent) {
// getModuleInstanceStateForAliasTarget needs to walk up the parent chain, so parent pointers must be set on this tree already
ts.setParent(node.body, node);
ts.setParentRecursive(node.body, /*incremental*/ false);
}
return node.body ? getModuleInstanceStateCached(node.body, visited) : 1 /* Instantiated */;
}
ts.getModuleInstanceState = getModuleInstanceState;
function getModuleInstanceStateCached(node, visited) {
if (visited === void 0) { visited = new ts.Map(); }
var nodeId = ts.getNodeId(node);
if (visited.has(nodeId)) {
return visited.get(nodeId) || 0 /* NonInstantiated */;
}
visited.set(nodeId, undefined);
var result = getModuleInstanceStateWorker(node, visited);
visited.set(nodeId, result);
return result;
}
function getModuleInstanceStateWorker(node, visited) {
// A module is uninstantiated if it contains only
switch (node.kind) {
// 1. interface declarations, type alias declarations
case 256 /* InterfaceDeclaration */:
case 257 /* TypeAliasDeclaration */:
return 0 /* NonInstantiated */;
// 2. const enum declarations
case 258 /* EnumDeclaration */:
if (ts.isEnumConst(node)) {
return 2 /* ConstEnumOnly */;
}
break;
// 3. non-exported import declarations
case 264 /* ImportDeclaration */:
case 263 /* ImportEqualsDeclaration */:
if (!(ts.hasSyntacticModifier(node, 1 /* Export */))) {
return 0 /* NonInstantiated */;
}
break;
// 4. Export alias declarations pointing at only uninstantiated modules or things uninstantiated modules contain
case 270 /* ExportDeclaration */:
var exportDeclaration = node;
if (!exportDeclaration.moduleSpecifier && exportDeclaration.exportClause && exportDeclaration.exportClause.kind === 271 /* NamedExports */) {
var state = 0 /* NonInstantiated */;
for (var _i = 0, _a = exportDeclaration.exportClause.elements; _i < _a.length; _i++) {
var specifier = _a[_i];
var specifierState = getModuleInstanceStateForAliasTarget(specifier, visited);
if (specifierState > state) {
state = specifierState;
}
if (state === 1 /* Instantiated */) {
return state;
}
}
return state;
}
break;
// 5. other uninstantiated module declarations.
case 260 /* ModuleBlock */: {
var state_1 = 0 /* NonInstantiated */;
ts.forEachChild(node, function (n) {
var childState = getModuleInstanceStateCached(n, visited);
switch (childState) {
case 0 /* NonInstantiated */:
// child is non-instantiated - continue searching
return;
case 2 /* ConstEnumOnly */:
// child is const enum only - record state and continue searching
state_1 = 2 /* ConstEnumOnly */;
return;
case 1 /* Instantiated */:
// child is instantiated - record state and stop
state_1 = 1 /* Instantiated */;
return true;
default:
ts.Debug.assertNever(childState);
}
});
return state_1;
}
case 259 /* ModuleDeclaration */:
return getModuleInstanceState(node, visited);
case 79 /* Identifier */:
// Only jsdoc typedef definition can exist in jsdoc namespace, and it should
// be considered the same as type alias
if (node.isInJSDocNamespace) {
return 0 /* NonInstantiated */;
}
}
return 1 /* Instantiated */;
}
function getModuleInstanceStateForAliasTarget(specifier, visited) {
var name = specifier.propertyName || specifier.name;
var p = specifier.parent;
while (p) {
if (ts.isBlock(p) || ts.isModuleBlock(p) || ts.isSourceFile(p)) {
var statements = p.statements;
var found = void 0;
for (var _i = 0, statements_2 = statements; _i < statements_2.length; _i++) {
var statement = statements_2[_i];
if (ts.nodeHasName(statement, name)) {
if (!statement.parent) {
ts.setParent(statement, p);
ts.setParentRecursive(statement, /*incremental*/ false);
}
var state = getModuleInstanceStateCached(statement, visited);
if (found === undefined || state > found) {
found = state;
}
if (found === 1 /* Instantiated */) {
return found;
}
}
}
if (found !== undefined) {
return found;
}
}
p = p.parent;
}
return 1 /* Instantiated */; // Couldn't locate, assume could refer to a value
}
var ContainerFlags;
(function (ContainerFlags) {
// The current node is not a container, and no container manipulation should happen before
// recursing into it.
ContainerFlags[ContainerFlags["None"] = 0] = "None";
// The current node is a container. It should be set as the current container (and block-
// container) before recursing into it. The current node does not have locals. Examples:
//
// Classes, ObjectLiterals, TypeLiterals, Interfaces...
ContainerFlags[ContainerFlags["IsContainer"] = 1] = "IsContainer";
// The current node is a block-scoped-container. It should be set as the current block-
// container before recursing into it. Examples:
//
// Blocks (when not parented by functions), Catch clauses, For/For-in/For-of statements...
ContainerFlags[ContainerFlags["IsBlockScopedContainer"] = 2] = "IsBlockScopedContainer";
// The current node is the container of a control flow path. The current control flow should
// be saved and restored, and a new control flow initialized within the container.
ContainerFlags[ContainerFlags["IsControlFlowContainer"] = 4] = "IsControlFlowContainer";
ContainerFlags[ContainerFlags["IsFunctionLike"] = 8] = "IsFunctionLike";
ContainerFlags[ContainerFlags["IsFunctionExpression"] = 16] = "IsFunctionExpression";
ContainerFlags[ContainerFlags["HasLocals"] = 32] = "HasLocals";
ContainerFlags[ContainerFlags["IsInterface"] = 64] = "IsInterface";
ContainerFlags[ContainerFlags["IsObjectLiteralOrClassExpressionMethod"] = 128] = "IsObjectLiteralOrClassExpressionMethod";
})(ContainerFlags || (ContainerFlags = {}));
function initFlowNode(node) {
ts.Debug.attachFlowNodeDebugInfo(node);
return node;
}
var binder = createBinder();
function bindSourceFile(file, options) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("bind" /* Bind */, "bindSourceFile", { path: file.path }, /*separateBeginAndEnd*/ true);
ts.performance.mark("beforeBind");
ts.perfLogger.logStartBindFile("" + file.fileName);
binder(file, options);
ts.perfLogger.logStopBindFile();
ts.performance.mark("afterBind");
ts.performance.measure("Bind", "beforeBind", "afterBind");
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
}
ts.bindSourceFile = bindSourceFile;
function createBinder() {
var file;
var options;
var languageVersion;
var parent;
var container;
var thisParentContainer; // Container one level up
var blockScopeContainer;
var lastContainer;
var delayedTypeAliases;
var seenThisKeyword;
// state used by control flow analysis
var currentFlow;
var currentBreakTarget;
var currentContinueTarget;
var currentReturnTarget;
var currentTrueTarget;
var currentFalseTarget;
var currentExceptionTarget;
var preSwitchCaseFlow;
var activeLabelList;
var hasExplicitReturn;
// state used for emit helpers
var emitFlags;
// If this file is an external module, then it is automatically in strict-mode according to
// ES6. If it is not an external module, then we'll determine if it is in strict mode or
// not depending on if we see "use strict" in certain places or if we hit a class/namespace
// or if compiler options contain alwaysStrict.
var inStrictMode;
// If we are binding an assignment pattern, we will bind certain expressions differently.
var inAssignmentPattern = false;
var symbolCount = 0;
var Symbol;
var classifiableNames;
var unreachableFlow = { flags: 1 /* Unreachable */ };
var reportedUnreachableFlow = { flags: 1 /* Unreachable */ };
var bindBinaryExpressionFlow = createBindBinaryExpressionFlow();
/**
* Inside the binder, we may create a diagnostic for an as-yet unbound node (with potentially no parent pointers, implying no accessible source file)
* If so, the node _must_ be in the current file (as that's the only way anything could have traversed to it to yield it as the error node)
* This version of `createDiagnosticForNode` uses the binder's context to account for this, and always yields correct diagnostics even in these situations.
*/
function createDiagnosticForNode(node, message, arg0, arg1, arg2) {
return ts.createDiagnosticForNodeInSourceFile(ts.getSourceFileOfNode(node) || file, node, message, arg0, arg1, arg2);
}
function bindSourceFile(f, opts) {
file = f;
options = opts;
languageVersion = ts.getEmitScriptTarget(options);
inStrictMode = bindInStrictMode(file, opts);
classifiableNames = new ts.Set();
symbolCount = 0;
Symbol = ts.objectAllocator.getSymbolConstructor();
// Attach debugging information if necessary
ts.Debug.attachFlowNodeDebugInfo(unreachableFlow);
ts.Debug.attachFlowNodeDebugInfo(reportedUnreachableFlow);
if (!file.locals) {
bind(file);
file.symbolCount = symbolCount;
file.classifiableNames = classifiableNames;
delayedBindJSDocTypedefTag();
}
file = undefined;
options = undefined;
languageVersion = undefined;
parent = undefined;
container = undefined;
thisParentContainer = undefined;
blockScopeContainer = undefined;
lastContainer = undefined;
delayedTypeAliases = undefined;
seenThisKeyword = false;
currentFlow = undefined;
currentBreakTarget = undefined;
currentContinueTarget = undefined;
currentReturnTarget = undefined;
currentTrueTarget = undefined;
currentFalseTarget = undefined;
currentExceptionTarget = undefined;
activeLabelList = undefined;
hasExplicitReturn = false;
inAssignmentPattern = false;
emitFlags = 0 /* None */;
}
return bindSourceFile;
function bindInStrictMode(file, opts) {
if (ts.getStrictOptionValue(opts, "alwaysStrict") && !file.isDeclarationFile) {
// bind in strict mode source files with alwaysStrict option
return true;
}
else {
return !!file.externalModuleIndicator;
}
}
function createSymbol(flags, name) {
symbolCount++;
return new Symbol(flags, name);
}
function addDeclarationToSymbol(symbol, node, symbolFlags) {
symbol.flags |= symbolFlags;
node.symbol = symbol;
symbol.declarations = ts.appendIfUnique(symbol.declarations, node);
if (symbolFlags & (32 /* Class */ | 384 /* Enum */ | 1536 /* Module */ | 3 /* Variable */) && !symbol.exports) {
symbol.exports = ts.createSymbolTable();
}
if (symbolFlags & (32 /* Class */ | 64 /* Interface */ | 2048 /* TypeLiteral */ | 4096 /* ObjectLiteral */) && !symbol.members) {
symbol.members = ts.createSymbolTable();
}
// On merge of const enum module with class or function, reset const enum only flag (namespaces will already recalculate)
if (symbol.constEnumOnlyModule && (symbol.flags & (16 /* Function */ | 32 /* Class */ | 256 /* RegularEnum */))) {
symbol.constEnumOnlyModule = false;
}
if (symbolFlags & 111551 /* Value */) {
ts.setValueDeclaration(symbol, node);
}
}
// Should not be called on a declaration with a computed property name,
// unless it is a well known Symbol.
function getDeclarationName(node) {
if (node.kind === 269 /* ExportAssignment */) {
return node.isExportEquals ? "export=" /* ExportEquals */ : "default" /* Default */;
}
var name = ts.getNameOfDeclaration(node);
if (name) {
if (ts.isAmbientModule(node)) {
var moduleName = ts.getTextOfIdentifierOrLiteral(name);
return (ts.isGlobalScopeAugmentation(node) ? "__global" : "\"" + moduleName + "\"");
}
if (name.kind === 160 /* ComputedPropertyName */) {
var nameExpression = name.expression;
// treat computed property names where expression is string/numeric literal as just string/numeric literal
if (ts.isStringOrNumericLiteralLike(nameExpression)) {
return ts.escapeLeadingUnderscores(nameExpression.text);
}
if (ts.isSignedNumericLiteral(nameExpression)) {
return ts.tokenToString(nameExpression.operator) + nameExpression.operand.text;
}
else {
ts.Debug.fail("Only computed properties with literal names have declaration names");
}
}
if (ts.isPrivateIdentifier(name)) {
// containingClass exists because private names only allowed inside classes
var containingClass = ts.getContainingClass(node);
if (!containingClass) {
// we can get here in cases where there is already a parse error.
return undefined;
}
var containingClassSymbol = containingClass.symbol;
return ts.getSymbolNameForPrivateIdentifier(containingClassSymbol, name.escapedText);
}
return ts.isPropertyNameLiteral(name) ? ts.getEscapedTextOfIdentifierOrLiteral(name) : undefined;
}
switch (node.kind) {
case 169 /* Constructor */:
return "__constructor" /* Constructor */;
case 177 /* FunctionType */:
case 172 /* CallSignature */:
case 318 /* JSDocSignature */:
return "__call" /* Call */;
case 178 /* ConstructorType */:
case 173 /* ConstructSignature */:
return "__new" /* New */;
case 174 /* IndexSignature */:
return "__index" /* Index */;
case 270 /* ExportDeclaration */:
return "__export" /* ExportStar */;
case 300 /* SourceFile */:
// json file should behave as
// module.exports = ...
return "export=" /* ExportEquals */;
case 219 /* BinaryExpression */:
if (ts.getAssignmentDeclarationKind(node) === 2 /* ModuleExports */) {
// module.exports = ...
return "export=" /* ExportEquals */;
}
ts.Debug.fail("Unknown binary declaration kind");
break;
case 312 /* JSDocFunctionType */:
return (ts.isJSDocConstructSignature(node) ? "__new" /* New */ : "__call" /* Call */);
case 162 /* Parameter */:
// Parameters with names are handled at the top of this function. Parameters
// without names can only come from JSDocFunctionTypes.
ts.Debug.assert(node.parent.kind === 312 /* JSDocFunctionType */, "Impossible parameter parent kind", function () { return "parent is: " + (ts.SyntaxKind ? ts.SyntaxKind[node.parent.kind] : node.parent.kind) + ", expected JSDocFunctionType"; });
var functionType = node.parent;
var index = functionType.parameters.indexOf(node);
return "arg" + index;
}
}
function getDisplayName(node) {
return ts.isNamedDeclaration(node) ? ts.declarationNameToString(node.name) : ts.unescapeLeadingUnderscores(ts.Debug.checkDefined(getDeclarationName(node)));
}
/**
* Declares a Symbol for the node and adds it to symbols. Reports errors for conflicting identifier names.
* @param symbolTable - The symbol table which node will be added to.
* @param parent - node's parent declaration.
* @param node - The declaration to be added to the symbol table
* @param includes - The SymbolFlags that node has in addition to its declaration type (eg: export, ambient, etc.)
* @param excludes - The flags which node cannot be declared alongside in a symbol table. Used to report forbidden declarations.
*/
function declareSymbol(symbolTable, parent, node, includes, excludes, isReplaceableByMethod, isComputedName) {
ts.Debug.assert(isComputedName || !ts.hasDynamicName(node));
var isDefaultExport = ts.hasSyntacticModifier(node, 512 /* Default */) || ts.isExportSpecifier(node) && node.name.escapedText === "default";
// The exported symbol for an export default function/class node is always named "default"
var name = isComputedName ? "__computed" /* Computed */
: isDefaultExport && parent ? "default" /* Default */
: getDeclarationName(node);
var symbol;
if (name === undefined) {
symbol = createSymbol(0 /* None */, "__missing" /* Missing */);
}
else {
// Check and see if the symbol table already has a symbol with this name. If not,
// create a new symbol with this name and add it to the table. Note that we don't
// give the new symbol any flags *yet*. This ensures that it will not conflict
// with the 'excludes' flags we pass in.
//
// If we do get an existing symbol, see if it conflicts with the new symbol we're
// creating. For example, a 'var' symbol and a 'class' symbol will conflict within
// the same symbol table. If we have a conflict, report the issue on each
// declaration we have for this symbol, and then create a new symbol for this
// declaration.
//
// Note that when properties declared in Javascript constructors
// (marked by isReplaceableByMethod) conflict with another symbol, the property loses.
// Always. This allows the common Javascript pattern of overwriting a prototype method
// with an bound instance method of the same type: `this.method = this.method.bind(this)`
//
// If we created a new symbol, either because we didn't have a symbol with this name
// in the symbol table, or we conflicted with an existing symbol, then just add this
// node as the sole declaration of the new symbol.
//
// Otherwise, we'll be merging into a compatible existing symbol (for example when
// you have multiple 'vars' with the same name in the same container). In this case
// just add this node into the declarations list of the symbol.
symbol = symbolTable.get(name);
if (includes & 2885600 /* Classifiable */) {
classifiableNames.add(name);
}
if (!symbol) {
symbolTable.set(name, symbol = createSymbol(0 /* None */, name));
if (isReplaceableByMethod)
symbol.isReplaceableByMethod = true;
}
else if (isReplaceableByMethod && !symbol.isReplaceableByMethod) {
// A symbol already exists, so don't add this as a declaration.
return symbol;
}
else if (symbol.flags & excludes) {
if (symbol.isReplaceableByMethod) {
// Javascript constructor-declared symbols can be discarded in favor of
// prototype symbols like methods.
symbolTable.set(name, symbol = createSymbol(0 /* None */, name));
}
else if (!(includes & 3 /* Variable */ && symbol.flags & 67108864 /* Assignment */)) {
// Assignment declarations are allowed to merge with variables, no matter what other flags they have.
if (ts.isNamedDeclaration(node)) {
ts.setParent(node.name, node);
}
// Report errors every position with duplicate declaration
// Report errors on previous encountered declarations
var message_1 = symbol.flags & 2 /* BlockScopedVariable */
? ts.Diagnostics.Cannot_redeclare_block_scoped_variable_0
: ts.Diagnostics.Duplicate_identifier_0;
var messageNeedsName_1 = true;
if (symbol.flags & 384 /* Enum */ || includes & 384 /* Enum */) {
message_1 = ts.Diagnostics.Enum_declarations_can_only_merge_with_namespace_or_other_enum_declarations;
messageNeedsName_1 = false;
}
var multipleDefaultExports_1 = false;
if (ts.length(symbol.declarations)) {
// If the current node is a default export of some sort, then check if
// there are any other default exports that we need to error on.
// We'll know whether we have other default exports depending on if `symbol` already has a declaration list set.
if (isDefaultExport) {
message_1 = ts.Diagnostics.A_module_cannot_have_multiple_default_exports;
messageNeedsName_1 = false;
multipleDefaultExports_1 = true;
}
else {
// This is to properly report an error in the case "export default { }" is after export default of class declaration or function declaration.
// Error on multiple export default in the following case:
// 1. multiple export default of class declaration or function declaration by checking NodeFlags.Default
// 2. multiple export default of export assignment. This one doesn't have NodeFlags.Default on (as export default doesn't considered as modifiers)
if (symbol.declarations && symbol.declarations.length &&
(node.kind === 269 /* ExportAssignment */ && !node.isExportEquals)) {
message_1 = ts.Diagnostics.A_module_cannot_have_multiple_default_exports;
messageNeedsName_1 = false;
multipleDefaultExports_1 = true;
}
}
}
var relatedInformation_1 = [];
if (ts.isTypeAliasDeclaration(node) && ts.nodeIsMissing(node.type) && ts.hasSyntacticModifier(node, 1 /* Export */) && symbol.flags & (2097152 /* Alias */ | 788968 /* Type */ | 1920 /* Namespace */)) {
// export type T; - may have meant export type { T }?
relatedInformation_1.push(createDiagnosticForNode(node, ts.Diagnostics.Did_you_mean_0, "export type { " + ts.unescapeLeadingUnderscores(node.name.escapedText) + " }"));
}
var declarationName_1 = ts.getNameOfDeclaration(node) || node;
ts.forEach(symbol.declarations, function (declaration, index) {
var decl = ts.getNameOfDeclaration(declaration) || declaration;
var diag = createDiagnosticForNode(decl, message_1, messageNeedsName_1 ? getDisplayName(declaration) : undefined);
file.bindDiagnostics.push(multipleDefaultExports_1 ? ts.addRelatedInfo(diag, createDiagnosticForNode(declarationName_1, index === 0 ? ts.Diagnostics.Another_export_default_is_here : ts.Diagnostics.and_here)) : diag);
if (multipleDefaultExports_1) {
relatedInformation_1.push(createDiagnosticForNode(decl, ts.Diagnostics.The_first_export_default_is_here));
}
});
var diag = createDiagnosticForNode(declarationName_1, message_1, messageNeedsName_1 ? getDisplayName(node) : undefined);
file.bindDiagnostics.push(ts.addRelatedInfo.apply(void 0, __spreadArray([diag], relatedInformation_1, false)));
symbol = createSymbol(0 /* None */, name);
}
}
}
addDeclarationToSymbol(symbol, node, includes);
if (symbol.parent) {
ts.Debug.assert(symbol.parent === parent, "Existing symbol parent should match new one");
}
else {
symbol.parent = parent;
}
return symbol;
}
function declareModuleMember(node, symbolFlags, symbolExcludes) {
var hasExportModifier = !!(ts.getCombinedModifierFlags(node) & 1 /* Export */) || jsdocTreatAsExported(node);
if (symbolFlags & 2097152 /* Alias */) {
if (node.kind === 273 /* ExportSpecifier */ || (node.kind === 263 /* ImportEqualsDeclaration */ && hasExportModifier)) {
return declareSymbol(container.symbol.exports, container.symbol, node, symbolFlags, symbolExcludes);
}
else {
return declareSymbol(container.locals, /*parent*/ undefined, node, symbolFlags, symbolExcludes);
}
}
else {
// Exported module members are given 2 symbols: A local symbol that is classified with an ExportValue flag,
// and an associated export symbol with all the correct flags set on it. There are 2 main reasons:
//
// 1. We treat locals and exports of the same name as mutually exclusive within a container.
// That means the binder will issue a Duplicate Identifier error if you mix locals and exports
// with the same name in the same container.
// TODO: Make this a more specific error and decouple it from the exclusion logic.
// 2. When we checkIdentifier in the checker, we set its resolved symbol to the local symbol,
// but return the export symbol (by calling getExportSymbolOfValueSymbolIfExported). That way
// when the emitter comes back to it, it knows not to qualify the name if it was found in a containing scope.
// NOTE: Nested ambient modules always should go to to 'locals' table to prevent their automatic merge
// during global merging in the checker. Why? The only case when ambient module is permitted inside another module is module augmentation
// and this case is specially handled. Module augmentations should only be merged with original module definition
// and should never be merged directly with other augmentation, and the latter case would be possible if automatic merge is allowed.
if (ts.isJSDocTypeAlias(node))
ts.Debug.assert(ts.isInJSFile(node)); // We shouldn't add symbols for JSDoc nodes if not in a JS file.
if (!ts.isAmbientModule(node) && (hasExportModifier || container.flags & 64 /* ExportContext */)) {
if (!container.locals || (ts.hasSyntacticModifier(node, 512 /* Default */) && !getDeclarationName(node))) {
return declareSymbol(container.symbol.exports, container.symbol, node, symbolFlags, symbolExcludes); // No local symbol for an unnamed default!
}
var exportKind = symbolFlags & 111551 /* Value */ ? 1048576 /* ExportValue */ : 0;
var local = declareSymbol(container.locals, /*parent*/ undefined, node, exportKind, symbolExcludes);
local.exportSymbol = declareSymbol(container.symbol.exports, container.symbol, node, symbolFlags, symbolExcludes);
node.localSymbol = local;
return local;
}
else {
return declareSymbol(container.locals, /*parent*/ undefined, node, symbolFlags, symbolExcludes);
}
}
}
function jsdocTreatAsExported(node) {
if (node.parent && ts.isModuleDeclaration(node)) {
node = node.parent;
}
if (!ts.isJSDocTypeAlias(node))
return false;
// jsdoc typedef handling is a bit of a doozy, but to summarize, treat the typedef as exported if:
// 1. It has an explicit name (since by default typedefs are always directly exported, either at the top level or in a container), or
if (!ts.isJSDocEnumTag(node) && !!node.fullName)
return true;
// 2. The thing a nameless typedef pulls its name from is implicitly a direct export (either by assignment or actual export flag).
var declName = ts.getNameOfDeclaration(node);
if (!declName)
return false;
if (ts.isPropertyAccessEntityNameExpression(declName.parent) && isTopLevelNamespaceAssignment(declName.parent))
return true;
if (ts.isDeclaration(declName.parent) && ts.getCombinedModifierFlags(declName.parent) & 1 /* Export */)
return true;
// This could potentially be simplified by having `delayedBindJSDocTypedefTag` pass in an override for `hasExportModifier`, since it should
// already have calculated and branched on most of this.
return false;
}
// All container nodes are kept on a linked list in declaration order. This list is used by
// the getLocalNameOfContainer function in the type checker to validate that the local name
// used for a container is unique.
function bindContainer(node, containerFlags) {
// Before we recurse into a node's children, we first save the existing parent, container
// and block-container. Then after we pop out of processing the children, we restore
// these saved values.
var saveContainer = container;
var saveThisParentContainer = thisParentContainer;
var savedBlockScopeContainer = blockScopeContainer;
// Depending on what kind of node this is, we may have to adjust the current container
// and block-container. If the current node is a container, then it is automatically
// considered the current block-container as well. Also, for containers that we know
// may contain locals, we eagerly initialize the .locals field. We do this because
// it's highly likely that the .locals will be needed to place some child in (for example,
// a parameter, or variable declaration).
//
// However, we do not proactively create the .locals for block-containers because it's
// totally normal and common for block-containers to never actually have a block-scoped
// variable in them. We don't want to end up allocating an object for every 'block' we
// run into when most of them won't be necessary.
//
// Finally, if this is a block-container, then we clear out any existing .locals object
// it may contain within it. This happens in incremental scenarios. Because we can be
// reusing a node from a previous compilation, that node may have had 'locals' created
// for it. We must clear this so we don't accidentally move any stale data forward from
// a previous compilation.
if (containerFlags & 1 /* IsContainer */) {
if (node.kind !== 212 /* ArrowFunction */) {
thisParentContainer = container;
}
container = blockScopeContainer = node;
if (containerFlags & 32 /* HasLocals */) {
container.locals = ts.createSymbolTable();
}
addToContainerChain(container);
}
else if (containerFlags & 2 /* IsBlockScopedContainer */) {
blockScopeContainer = node;
blockScopeContainer.locals = undefined;
}
if (containerFlags & 4 /* IsControlFlowContainer */) {
var saveCurrentFlow = currentFlow;
var saveBreakTarget = currentBreakTarget;
var saveContinueTarget = currentContinueTarget;
var saveReturnTarget = currentReturnTarget;
var saveExceptionTarget = currentExceptionTarget;
var saveActiveLabelList = activeLabelList;
var saveHasExplicitReturn = hasExplicitReturn;
var isIIFE = containerFlags & 16 /* IsFunctionExpression */ && !ts.hasSyntacticModifier(node, 256 /* Async */) &&
!node.asteriskToken && !!ts.getImmediatelyInvokedFunctionExpression(node);
// A non-async, non-generator IIFE is considered part of the containing control flow. Return statements behave
// similarly to break statements that exit to a label just past the statement body.
if (!isIIFE) {
currentFlow = initFlowNode({ flags: 2 /* Start */ });
if (containerFlags & (16 /* IsFunctionExpression */ | 128 /* IsObjectLiteralOrClassExpressionMethod */)) {
currentFlow.node = node;
}
}
// We create a return control flow graph for IIFEs and constructors. For constructors
// we use the return control flow graph in strict property initialization checks.
currentReturnTarget = isIIFE || node.kind === 169 /* Constructor */ || node.kind === 168 /* ClassStaticBlockDeclaration */ || (ts.isInJSFile(node) && (node.kind === 254 /* FunctionDeclaration */ || node.kind === 211 /* FunctionExpression */)) ? createBranchLabel() : undefined;
currentExceptionTarget = undefined;
currentBreakTarget = undefined;
currentContinueTarget = undefined;
activeLabelList = undefined;
hasExplicitReturn = false;
bindChildren(node);
// Reset all reachability check related flags on node (for incremental scenarios)
node.flags &= ~2816 /* ReachabilityAndEmitFlags */;
if (!(currentFlow.flags & 1 /* Unreachable */) && containerFlags & 8 /* IsFunctionLike */ && ts.nodeIsPresent(node.body)) {
node.flags |= 256 /* HasImplicitReturn */;
if (hasExplicitReturn)
node.flags |= 512 /* HasExplicitReturn */;
node.endFlowNode = currentFlow;
}
if (node.kind === 300 /* SourceFile */) {
node.flags |= emitFlags;
node.endFlowNode = currentFlow;
}
if (currentReturnTarget) {
addAntecedent(currentReturnTarget, currentFlow);
currentFlow = finishFlowLabel(currentReturnTarget);
if (node.kind === 169 /* Constructor */ || node.kind === 168 /* ClassStaticBlockDeclaration */ || (ts.isInJSFile(node) && (node.kind === 254 /* FunctionDeclaration */ || node.kind === 211 /* FunctionExpression */))) {
node.returnFlowNode = currentFlow;
}
}
if (!isIIFE) {
currentFlow = saveCurrentFlow;
}
currentBreakTarget = saveBreakTarget;
currentContinueTarget = saveContinueTarget;
currentReturnTarget = saveReturnTarget;
currentExceptionTarget = saveExceptionTarget;
activeLabelList = saveActiveLabelList;
hasExplicitReturn = saveHasExplicitReturn;
}
else if (containerFlags & 64 /* IsInterface */) {
seenThisKeyword = false;
bindChildren(node);
node.flags = seenThisKeyword ? node.flags | 128 /* ContainsThis */ : node.flags & ~128 /* ContainsThis */;
}
else {
bindChildren(node);
}
container = saveContainer;
thisParentContainer = saveThisParentContainer;
blockScopeContainer = savedBlockScopeContainer;
}
function bindEachFunctionsFirst(nodes) {
bindEach(nodes, function (n) { return n.kind === 254 /* FunctionDeclaration */ ? bind(n) : undefined; });
bindEach(nodes, function (n) { return n.kind !== 254 /* FunctionDeclaration */ ? bind(n) : undefined; });
}
function bindEach(nodes, bindFunction) {
if (bindFunction === void 0) { bindFunction = bind; }
if (nodes === undefined) {
return;
}
ts.forEach(nodes, bindFunction);
}
function bindEachChild(node) {
ts.forEachChild(node, bind, bindEach);
}
function bindChildren(node) {
var saveInAssignmentPattern = inAssignmentPattern;
// Most nodes aren't valid in an assignment pattern, so we clear the value here
// and set it before we descend into nodes that could actually be part of an assignment pattern.
inAssignmentPattern = false;
if (checkUnreachable(node)) {
bindEachChild(node);
bindJSDoc(node);
inAssignmentPattern = saveInAssignmentPattern;
return;
}
if (node.kind >= 235 /* FirstStatement */ && node.kind <= 251 /* LastStatement */ && !options.allowUnreachableCode) {
node.flowNode = currentFlow;
}
switch (node.kind) {
case 239 /* WhileStatement */:
bindWhileStatement(node);
break;
case 238 /* DoStatement */:
bindDoStatement(node);
break;
case 240 /* ForStatement */:
bindForStatement(node);
break;
case 241 /* ForInStatement */:
case 242 /* ForOfStatement */:
bindForInOrForOfStatement(node);
break;
case 237 /* IfStatement */:
bindIfStatement(node);
break;
case 245 /* ReturnStatement */:
case 249 /* ThrowStatement */:
bindReturnOrThrow(node);
break;
case 244 /* BreakStatement */:
case 243 /* ContinueStatement */:
bindBreakOrContinueStatement(node);
break;
case 250 /* TryStatement */:
bindTryStatement(node);
break;
case 247 /* SwitchStatement */:
bindSwitchStatement(node);
break;
case 261 /* CaseBlock */:
bindCaseBlock(node);
break;
case 287 /* CaseClause */:
bindCaseClause(node);
break;
case 236 /* ExpressionStatement */:
bindExpressionStatement(node);
break;
case 248 /* LabeledStatement */:
bindLabeledStatement(node);
break;
case 217 /* PrefixUnaryExpression */:
bindPrefixUnaryExpressionFlow(node);
break;
case 218 /* PostfixUnaryExpression */:
bindPostfixUnaryExpressionFlow(node);
break;
case 219 /* BinaryExpression */:
if (ts.isDestructuringAssignment(node)) {
// Carry over whether we are in an assignment pattern to
// binary expressions that could actually be an initializer
inAssignmentPattern = saveInAssignmentPattern;
bindDestructuringAssignmentFlow(node);
return;
}
bindBinaryExpressionFlow(node);
break;
case 213 /* DeleteExpression */:
bindDeleteExpressionFlow(node);
break;
case 220 /* ConditionalExpression */:
bindConditionalExpressionFlow(node);
break;
case 252 /* VariableDeclaration */:
bindVariableDeclarationFlow(node);
break;
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
bindAccessExpressionFlow(node);
break;
case 206 /* CallExpression */:
bindCallExpressionFlow(node);
break;
case 228 /* NonNullExpression */:
bindNonNullExpressionFlow(node);
break;
case 340 /* JSDocTypedefTag */:
case 333 /* JSDocCallbackTag */:
case 334 /* JSDocEnumTag */:
bindJSDocTypeAlias(node);
break;
// In source files and blocks, bind functions first to match hoisting that occurs at runtime
case 300 /* SourceFile */: {
bindEachFunctionsFirst(node.statements);
bind(node.endOfFileToken);
break;
}
case 233 /* Block */:
case 260 /* ModuleBlock */:
bindEachFunctionsFirst(node.statements);
break;
case 201 /* BindingElement */:
bindBindingElementFlow(node);
break;
case 203 /* ObjectLiteralExpression */:
case 202 /* ArrayLiteralExpression */:
case 291 /* PropertyAssignment */:
case 223 /* SpreadElement */:
// Carry over whether we are in an assignment pattern of Object and Array literals
// as well as their children that are valid assignment targets.
inAssignmentPattern = saveInAssignmentPattern;
// falls through
default:
bindEachChild(node);
break;
}
bindJSDoc(node);
inAssignmentPattern = saveInAssignmentPattern;
}
function isNarrowingExpression(expr) {
switch (expr.kind) {
case 79 /* Identifier */:
case 80 /* PrivateIdentifier */:
case 108 /* ThisKeyword */:
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
return containsNarrowableReference(expr);
case 206 /* CallExpression */:
return hasNarrowableArgument(expr);
case 210 /* ParenthesizedExpression */:
case 228 /* NonNullExpression */:
return isNarrowingExpression(expr.expression);
case 219 /* BinaryExpression */:
return isNarrowingBinaryExpression(expr);
case 217 /* PrefixUnaryExpression */:
return expr.operator === 53 /* ExclamationToken */ && isNarrowingExpression(expr.operand);
case 214 /* TypeOfExpression */:
return isNarrowingExpression(expr.expression);
}
return false;
}
function isNarrowableReference(expr) {
return ts.isDottedName(expr)
|| (ts.isPropertyAccessExpression(expr) || ts.isNonNullExpression(expr) || ts.isParenthesizedExpression(expr)) && isNarrowableReference(expr.expression)
|| ts.isBinaryExpression(expr) && expr.operatorToken.kind === 27 /* CommaToken */ && isNarrowableReference(expr.right)
|| ts.isElementAccessExpression(expr) && ts.isStringOrNumericLiteralLike(expr.argumentExpression) && isNarrowableReference(expr.expression)
|| ts.isAssignmentExpression(expr) && isNarrowableReference(expr.left);
}
function containsNarrowableReference(expr) {
return isNarrowableReference(expr) || ts.isOptionalChain(expr) && containsNarrowableReference(expr.expression);
}
function hasNarrowableArgument(expr) {
if (expr.arguments) {
for (var _i = 0, _a = expr.arguments; _i < _a.length; _i++) {
var argument = _a[_i];
if (containsNarrowableReference(argument)) {
return true;
}
}
}
if (expr.expression.kind === 204 /* PropertyAccessExpression */ &&
containsNarrowableReference(expr.expression.expression)) {
return true;
}
return false;
}
function isNarrowingTypeofOperands(expr1, expr2) {
return ts.isTypeOfExpression(expr1) && isNarrowableOperand(expr1.expression) && ts.isStringLiteralLike(expr2);
}
function isNarrowingBinaryExpression(expr) {
switch (expr.operatorToken.kind) {
case 63 /* EqualsToken */:
case 75 /* BarBarEqualsToken */:
case 76 /* AmpersandAmpersandEqualsToken */:
case 77 /* QuestionQuestionEqualsToken */:
return containsNarrowableReference(expr.left);
case 34 /* EqualsEqualsToken */:
case 35 /* ExclamationEqualsToken */:
case 36 /* EqualsEqualsEqualsToken */:
case 37 /* ExclamationEqualsEqualsToken */:
return isNarrowableOperand(expr.left) || isNarrowableOperand(expr.right) ||
isNarrowingTypeofOperands(expr.right, expr.left) || isNarrowingTypeofOperands(expr.left, expr.right);
case 102 /* InstanceOfKeyword */:
return isNarrowableOperand(expr.left);
case 101 /* InKeyword */:
return isNarrowingExpression(expr.right);
case 27 /* CommaToken */:
return isNarrowingExpression(expr.right);
}
return false;
}
function isNarrowableOperand(expr) {
switch (expr.kind) {
case 210 /* ParenthesizedExpression */:
return isNarrowableOperand(expr.expression);
case 219 /* BinaryExpression */:
switch (expr.operatorToken.kind) {
case 63 /* EqualsToken */:
return isNarrowableOperand(expr.left);
case 27 /* CommaToken */:
return isNarrowableOperand(expr.right);
}
}
return containsNarrowableReference(expr);
}
function createBranchLabel() {
return initFlowNode({ flags: 4 /* BranchLabel */, antecedents: undefined });
}
function createLoopLabel() {
return initFlowNode({ flags: 8 /* LoopLabel */, antecedents: undefined });
}
function createReduceLabel(target, antecedents, antecedent) {
return initFlowNode({ flags: 1024 /* ReduceLabel */, target: target, antecedents: antecedents, antecedent: antecedent });
}
function setFlowNodeReferenced(flow) {
// On first reference we set the Referenced flag, thereafter we set the Shared flag
flow.flags |= flow.flags & 2048 /* Referenced */ ? 4096 /* Shared */ : 2048 /* Referenced */;
}
function addAntecedent(label, antecedent) {
if (!(antecedent.flags & 1 /* Unreachable */) && !ts.contains(label.antecedents, antecedent)) {
(label.antecedents || (label.antecedents = [])).push(antecedent);
setFlowNodeReferenced(antecedent);
}
}
function createFlowCondition(flags, antecedent, expression) {
if (antecedent.flags & 1 /* Unreachable */) {
return antecedent;
}
if (!expression) {
return flags & 32 /* TrueCondition */ ? antecedent : unreachableFlow;
}
if ((expression.kind === 110 /* TrueKeyword */ && flags & 64 /* FalseCondition */ ||
expression.kind === 95 /* FalseKeyword */ && flags & 32 /* TrueCondition */) &&
!ts.isExpressionOfOptionalChainRoot(expression) && !ts.isNullishCoalesce(expression.parent)) {
return unreachableFlow;
}
if (!isNarrowingExpression(expression)) {
return antecedent;
}
setFlowNodeReferenced(antecedent);
return initFlowNode({ flags: flags, antecedent: antecedent, node: expression });
}
function createFlowSwitchClause(antecedent, switchStatement, clauseStart, clauseEnd) {
setFlowNodeReferenced(antecedent);
return initFlowNode({ flags: 128 /* SwitchClause */, antecedent: antecedent, switchStatement: switchStatement, clauseStart: clauseStart, clauseEnd: clauseEnd });
}
function createFlowMutation(flags, antecedent, node) {
setFlowNodeReferenced(antecedent);
var result = initFlowNode({ flags: flags, antecedent: antecedent, node: node });
if (currentExceptionTarget) {
addAntecedent(currentExceptionTarget, result);
}
return result;
}
function createFlowCall(antecedent, node) {
setFlowNodeReferenced(antecedent);
return initFlowNode({ flags: 512 /* Call */, antecedent: antecedent, node: node });
}
function finishFlowLabel(flow) {
var antecedents = flow.antecedents;
if (!antecedents) {
return unreachableFlow;
}
if (antecedents.length === 1) {
return antecedents[0];
}
return flow;
}
function isStatementCondition(node) {
var parent = node.parent;
switch (parent.kind) {
case 237 /* IfStatement */:
case 239 /* WhileStatement */:
case 238 /* DoStatement */:
return parent.expression === node;
case 240 /* ForStatement */:
case 220 /* ConditionalExpression */:
return parent.condition === node;
}
return false;
}
function isLogicalExpression(node) {
while (true) {
if (node.kind === 210 /* ParenthesizedExpression */) {
node = node.expression;
}
else if (node.kind === 217 /* PrefixUnaryExpression */ && node.operator === 53 /* ExclamationToken */) {
node = node.operand;
}
else {
return node.kind === 219 /* BinaryExpression */ && (node.operatorToken.kind === 55 /* AmpersandAmpersandToken */ ||
node.operatorToken.kind === 56 /* BarBarToken */ ||
node.operatorToken.kind === 60 /* QuestionQuestionToken */);
}
}
}
function isLogicalAssignmentExpression(node) {
node = ts.skipParentheses(node);
return ts.isBinaryExpression(node) && ts.isLogicalOrCoalescingAssignmentOperator(node.operatorToken.kind);
}
function isTopLevelLogicalExpression(node) {
while (ts.isParenthesizedExpression(node.parent) ||
ts.isPrefixUnaryExpression(node.parent) && node.parent.operator === 53 /* ExclamationToken */) {
node = node.parent;
}
return !isStatementCondition(node) &&
!isLogicalAssignmentExpression(node.parent) &&
!isLogicalExpression(node.parent) &&
!(ts.isOptionalChain(node.parent) && node.parent.expression === node);
}
function doWithConditionalBranches(action, value, trueTarget, falseTarget) {
var savedTrueTarget = currentTrueTarget;
var savedFalseTarget = currentFalseTarget;
currentTrueTarget = trueTarget;
currentFalseTarget = falseTarget;
action(value);
currentTrueTarget = savedTrueTarget;
currentFalseTarget = savedFalseTarget;
}
function bindCondition(node, trueTarget, falseTarget) {
doWithConditionalBranches(bind, node, trueTarget, falseTarget);
if (!node || !isLogicalAssignmentExpression(node) && !isLogicalExpression(node) && !(ts.isOptionalChain(node) && ts.isOutermostOptionalChain(node))) {
addAntecedent(trueTarget, createFlowCondition(32 /* TrueCondition */, currentFlow, node));
addAntecedent(falseTarget, createFlowCondition(64 /* FalseCondition */, currentFlow, node));
}
}
function bindIterativeStatement(node, breakTarget, continueTarget) {
var saveBreakTarget = currentBreakTarget;
var saveContinueTarget = currentContinueTarget;
currentBreakTarget = breakTarget;
currentContinueTarget = continueTarget;
bind(node);
currentBreakTarget = saveBreakTarget;
currentContinueTarget = saveContinueTarget;
}
function setContinueTarget(node, target) {
var label = activeLabelList;
while (label && node.parent.kind === 248 /* LabeledStatement */) {
label.continueTarget = target;
label = label.next;
node = node.parent;
}
return target;
}
function bindWhileStatement(node) {
var preWhileLabel = setContinueTarget(node, createLoopLabel());
var preBodyLabel = createBranchLabel();
var postWhileLabel = createBranchLabel();
addAntecedent(preWhileLabel, currentFlow);
currentFlow = preWhileLabel;
bindCondition(node.expression, preBodyLabel, postWhileLabel);
currentFlow = finishFlowLabel(preBodyLabel);
bindIterativeStatement(node.statement, postWhileLabel, preWhileLabel);
addAntecedent(preWhileLabel, currentFlow);
currentFlow = finishFlowLabel(postWhileLabel);
}
function bindDoStatement(node) {
var preDoLabel = createLoopLabel();
var preConditionLabel = setContinueTarget(node, createBranchLabel());
var postDoLabel = createBranchLabel();
addAntecedent(preDoLabel, currentFlow);
currentFlow = preDoLabel;
bindIterativeStatement(node.statement, postDoLabel, preConditionLabel);
addAntecedent(preConditionLabel, currentFlow);
currentFlow = finishFlowLabel(preConditionLabel);
bindCondition(node.expression, preDoLabel, postDoLabel);
currentFlow = finishFlowLabel(postDoLabel);
}
function bindForStatement(node) {
var preLoopLabel = setContinueTarget(node, createLoopLabel());
var preBodyLabel = createBranchLabel();
var postLoopLabel = createBranchLabel();
bind(node.initializer);
addAntecedent(preLoopLabel, currentFlow);
currentFlow = preLoopLabel;
bindCondition(node.condition, preBodyLabel, postLoopLabel);
currentFlow = finishFlowLabel(preBodyLabel);
bindIterativeStatement(node.statement, postLoopLabel, preLoopLabel);
bind(node.incrementor);
addAntecedent(preLoopLabel, currentFlow);
currentFlow = finishFlowLabel(postLoopLabel);
}
function bindForInOrForOfStatement(node) {
var preLoopLabel = setContinueTarget(node, createLoopLabel());
var postLoopLabel = createBranchLabel();
bind(node.expression);
addAntecedent(preLoopLabel, currentFlow);
currentFlow = preLoopLabel;
if (node.kind === 242 /* ForOfStatement */) {
bind(node.awaitModifier);
}
addAntecedent(postLoopLabel, currentFlow);
bind(node.initializer);
if (node.initializer.kind !== 253 /* VariableDeclarationList */) {
bindAssignmentTargetFlow(node.initializer);
}
bindIterativeStatement(node.statement, postLoopLabel, preLoopLabel);
addAntecedent(preLoopLabel, currentFlow);
currentFlow = finishFlowLabel(postLoopLabel);
}
function bindIfStatement(node) {
var thenLabel = createBranchLabel();
var elseLabel = createBranchLabel();
var postIfLabel = createBranchLabel();
bindCondition(node.expression, thenLabel, elseLabel);
currentFlow = finishFlowLabel(thenLabel);
bind(node.thenStatement);
addAntecedent(postIfLabel, currentFlow);
currentFlow = finishFlowLabel(elseLabel);
bind(node.elseStatement);
addAntecedent(postIfLabel, currentFlow);
currentFlow = finishFlowLabel(postIfLabel);
}
function bindReturnOrThrow(node) {
bind(node.expression);
if (node.kind === 245 /* ReturnStatement */) {
hasExplicitReturn = true;
if (currentReturnTarget) {
addAntecedent(currentReturnTarget, currentFlow);
}
}
currentFlow = unreachableFlow;
}
function findActiveLabel(name) {
for (var label = activeLabelList; label; label = label.next) {
if (label.name === name) {
return label;
}
}
return undefined;
}
function bindBreakOrContinueFlow(node, breakTarget, continueTarget) {
var flowLabel = node.kind === 244 /* BreakStatement */ ? breakTarget : continueTarget;
if (flowLabel) {
addAntecedent(flowLabel, currentFlow);
currentFlow = unreachableFlow;
}
}
function bindBreakOrContinueStatement(node) {
bind(node.label);
if (node.label) {
var activeLabel = findActiveLabel(node.label.escapedText);
if (activeLabel) {
activeLabel.referenced = true;
bindBreakOrContinueFlow(node, activeLabel.breakTarget, activeLabel.continueTarget);
}
}
else {
bindBreakOrContinueFlow(node, currentBreakTarget, currentContinueTarget);
}
}
function bindTryStatement(node) {
// We conservatively assume that *any* code in the try block can cause an exception, but we only need
// to track code that causes mutations (because only mutations widen the possible control flow type of
// a variable). The exceptionLabel is the target label for control flows that result from exceptions.
// We add all mutation flow nodes as antecedents of this label such that we can analyze them as possible
// antecedents of the start of catch or finally blocks. Furthermore, we add the current control flow to
// represent exceptions that occur before any mutations.
var saveReturnTarget = currentReturnTarget;
var saveExceptionTarget = currentExceptionTarget;
var normalExitLabel = createBranchLabel();
var returnLabel = createBranchLabel();
var exceptionLabel = createBranchLabel();
if (node.finallyBlock) {
currentReturnTarget = returnLabel;
}
addAntecedent(exceptionLabel, currentFlow);
currentExceptionTarget = exceptionLabel;
bind(node.tryBlock);
addAntecedent(normalExitLabel, currentFlow);
if (node.catchClause) {
// Start of catch clause is the target of exceptions from try block.
currentFlow = finishFlowLabel(exceptionLabel);
// The currentExceptionTarget now represents control flows from exceptions in the catch clause.
// Effectively, in a try-catch-finally, if an exception occurs in the try block, the catch block
// acts like a second try block.
exceptionLabel = createBranchLabel();
addAntecedent(exceptionLabel, currentFlow);
currentExceptionTarget = exceptionLabel;
bind(node.catchClause);
addAntecedent(normalExitLabel, currentFlow);
}
currentReturnTarget = saveReturnTarget;
currentExceptionTarget = saveExceptionTarget;
if (node.finallyBlock) {
// Possible ways control can reach the finally block:
// 1) Normal completion of try block of a try-finally or try-catch-finally
// 2) Normal completion of catch block (following exception in try block) of a try-catch-finally
// 3) Return in try or catch block of a try-finally or try-catch-finally
// 4) Exception in try block of a try-finally
// 5) Exception in catch block of a try-catch-finally
// When analyzing a control flow graph that starts inside a finally block we want to consider all
// five possibilities above. However, when analyzing a control flow graph that starts outside (past)
// the finally block, we only want to consider the first two (if we're past a finally block then it
// must have completed normally). Likewise, when analyzing a control flow graph from return statements
// in try or catch blocks in an IIFE, we only want to consider the third. To make this possible, we
// inject a ReduceLabel node into the control flow graph. This node contains an alternate reduced
// set of antecedents for the pre-finally label. As control flow analysis passes by a ReduceLabel
// node, the pre-finally label is temporarily switched to the reduced antecedent set.
var finallyLabel = createBranchLabel();
finallyLabel.antecedents = ts.concatenate(ts.concatenate(normalExitLabel.antecedents, exceptionLabel.antecedents), returnLabel.antecedents);
currentFlow = finallyLabel;
bind(node.finallyBlock);
if (currentFlow.flags & 1 /* Unreachable */) {
// If the end of the finally block is unreachable, the end of the entire try statement is unreachable.
currentFlow = unreachableFlow;
}
else {
// If we have an IIFE return target and return statements in the try or catch blocks, add a control
// flow that goes back through the finally block and back through only the return statements.
if (currentReturnTarget && returnLabel.antecedents) {
addAntecedent(currentReturnTarget, createReduceLabel(finallyLabel, returnLabel.antecedents, currentFlow));
}
// If we have an outer exception target (i.e. a containing try-finally or try-catch-finally), add a
// control flow that goes back through the finally blok and back through each possible exception source.
if (currentExceptionTarget && exceptionLabel.antecedents) {
addAntecedent(currentExceptionTarget, createReduceLabel(finallyLabel, exceptionLabel.antecedents, currentFlow));
}
// If the end of the finally block is reachable, but the end of the try and catch blocks are not,
// convert the current flow to unreachable. For example, 'try { return 1; } finally { ... }' should
// result in an unreachable current control flow.
currentFlow = normalExitLabel.antecedents ? createReduceLabel(finallyLabel, normalExitLabel.antecedents, currentFlow) : unreachableFlow;
}
}
else {
currentFlow = finishFlowLabel(normalExitLabel);
}
}
function bindSwitchStatement(node) {
var postSwitchLabel = createBranchLabel();
bind(node.expression);
var saveBreakTarget = currentBreakTarget;
var savePreSwitchCaseFlow = preSwitchCaseFlow;
currentBreakTarget = postSwitchLabel;
preSwitchCaseFlow = currentFlow;
bind(node.caseBlock);
addAntecedent(postSwitchLabel, currentFlow);
var hasDefault = ts.forEach(node.caseBlock.clauses, function (c) { return c.kind === 288 /* DefaultClause */; });
// We mark a switch statement as possibly exhaustive if it has no default clause and if all
// case clauses have unreachable end points (e.g. they all return). Note, we no longer need
// this property in control flow analysis, it's there only for backwards compatibility.
node.possiblyExhaustive = !hasDefault && !postSwitchLabel.antecedents;
if (!hasDefault) {
addAntecedent(postSwitchLabel, createFlowSwitchClause(preSwitchCaseFlow, node, 0, 0));
}
currentBreakTarget = saveBreakTarget;
preSwitchCaseFlow = savePreSwitchCaseFlow;
currentFlow = finishFlowLabel(postSwitchLabel);
}
function bindCaseBlock(node) {
var clauses = node.clauses;
var isNarrowingSwitch = isNarrowingExpression(node.parent.expression);
var fallthroughFlow = unreachableFlow;
for (var i = 0; i < clauses.length; i++) {
var clauseStart = i;
while (!clauses[i].statements.length && i + 1 < clauses.length) {
bind(clauses[i]);
i++;
}
var preCaseLabel = createBranchLabel();
addAntecedent(preCaseLabel, isNarrowingSwitch ? createFlowSwitchClause(preSwitchCaseFlow, node.parent, clauseStart, i + 1) : preSwitchCaseFlow);
addAntecedent(preCaseLabel, fallthroughFlow);
currentFlow = finishFlowLabel(preCaseLabel);
var clause = clauses[i];
bind(clause);
fallthroughFlow = currentFlow;
if (!(currentFlow.flags & 1 /* Unreachable */) && i !== clauses.length - 1 && options.noFallthroughCasesInSwitch) {
clause.fallthroughFlowNode = currentFlow;
}
}
}
function bindCaseClause(node) {
var saveCurrentFlow = currentFlow;
currentFlow = preSwitchCaseFlow;
bind(node.expression);
currentFlow = saveCurrentFlow;
bindEach(node.statements);
}
function bindExpressionStatement(node) {
bind(node.expression);
maybeBindExpressionFlowIfCall(node.expression);
}
function maybeBindExpressionFlowIfCall(node) {
// A top level or LHS of comma expression call expression with a dotted function name and at least one argument
// is potentially an assertion and is therefore included in the control flow.
if (node.kind === 206 /* CallExpression */) {
var call = node;
if (call.expression.kind !== 106 /* SuperKeyword */ && ts.isDottedName(call.expression)) {
currentFlow = createFlowCall(currentFlow, call);
}
}
}
function bindLabeledStatement(node) {
var postStatementLabel = createBranchLabel();
activeLabelList = {
next: activeLabelList,
name: node.label.escapedText,
breakTarget: postStatementLabel,
continueTarget: undefined,
referenced: false
};
bind(node.label);
bind(node.statement);
if (!activeLabelList.referenced && !options.allowUnusedLabels) {
errorOrSuggestionOnNode(ts.unusedLabelIsError(options), node.label, ts.Diagnostics.Unused_label);
}
activeLabelList = activeLabelList.next;
addAntecedent(postStatementLabel, currentFlow);
currentFlow = finishFlowLabel(postStatementLabel);
}
function bindDestructuringTargetFlow(node) {
if (node.kind === 219 /* BinaryExpression */ && node.operatorToken.kind === 63 /* EqualsToken */) {
bindAssignmentTargetFlow(node.left);
}
else {
bindAssignmentTargetFlow(node);
}
}
function bindAssignmentTargetFlow(node) {
if (isNarrowableReference(node)) {
currentFlow = createFlowMutation(16 /* Assignment */, currentFlow, node);
}
else if (node.kind === 202 /* ArrayLiteralExpression */) {
for (var _i = 0, _a = node.elements; _i < _a.length; _i++) {
var e = _a[_i];
if (e.kind === 223 /* SpreadElement */) {
bindAssignmentTargetFlow(e.expression);
}
else {
bindDestructuringTargetFlow(e);
}
}
}
else if (node.kind === 203 /* ObjectLiteralExpression */) {
for (var _b = 0, _c = node.properties; _b < _c.length; _b++) {
var p = _c[_b];
if (p.kind === 291 /* PropertyAssignment */) {
bindDestructuringTargetFlow(p.initializer);
}
else if (p.kind === 292 /* ShorthandPropertyAssignment */) {
bindAssignmentTargetFlow(p.name);
}
else if (p.kind === 293 /* SpreadAssignment */) {
bindAssignmentTargetFlow(p.expression);
}
}
}
}
function bindLogicalLikeExpression(node, trueTarget, falseTarget) {
var preRightLabel = createBranchLabel();
if (node.operatorToken.kind === 55 /* AmpersandAmpersandToken */ || node.operatorToken.kind === 76 /* AmpersandAmpersandEqualsToken */) {
bindCondition(node.left, preRightLabel, falseTarget);
}
else {
bindCondition(node.left, trueTarget, preRightLabel);
}
currentFlow = finishFlowLabel(preRightLabel);
bind(node.operatorToken);
if (ts.isLogicalOrCoalescingAssignmentOperator(node.operatorToken.kind)) {
doWithConditionalBranches(bind, node.right, trueTarget, falseTarget);
bindAssignmentTargetFlow(node.left);
addAntecedent(trueTarget, createFlowCondition(32 /* TrueCondition */, currentFlow, node));
addAntecedent(falseTarget, createFlowCondition(64 /* FalseCondition */, currentFlow, node));
}
else {
bindCondition(node.right, trueTarget, falseTarget);
}
}
function bindPrefixUnaryExpressionFlow(node) {
if (node.operator === 53 /* ExclamationToken */) {
var saveTrueTarget = currentTrueTarget;
currentTrueTarget = currentFalseTarget;
currentFalseTarget = saveTrueTarget;
bindEachChild(node);
currentFalseTarget = currentTrueTarget;
currentTrueTarget = saveTrueTarget;
}
else {
bindEachChild(node);
if (node.operator === 45 /* PlusPlusToken */ || node.operator === 46 /* MinusMinusToken */) {
bindAssignmentTargetFlow(node.operand);
}
}
}
function bindPostfixUnaryExpressionFlow(node) {
bindEachChild(node);
if (node.operator === 45 /* PlusPlusToken */ || node.operator === 46 /* MinusMinusToken */) {
bindAssignmentTargetFlow(node.operand);
}
}
function bindDestructuringAssignmentFlow(node) {
if (inAssignmentPattern) {
inAssignmentPattern = false;
bind(node.operatorToken);
bind(node.right);
inAssignmentPattern = true;
bind(node.left);
}
else {
inAssignmentPattern = true;
bind(node.left);
inAssignmentPattern = false;
bind(node.operatorToken);
bind(node.right);
}
bindAssignmentTargetFlow(node.left);
}
function createBindBinaryExpressionFlow() {
return ts.createBinaryExpressionTrampoline(onEnter, onLeft, onOperator, onRight, onExit, /*foldState*/ undefined);
function onEnter(node, state) {
if (state) {
state.stackIndex++;
// Emulate the work that `bind` does before reaching `bindChildren`. A normal call to
// `bindBinaryExpressionFlow` will already have done this work.
ts.setParent(node, parent);
var saveInStrictMode = inStrictMode;
bindWorker(node);
var saveParent = parent;
parent = node;
state.skip = false;
state.inStrictModeStack[state.stackIndex] = saveInStrictMode;
state.parentStack[state.stackIndex] = saveParent;
}
else {
state = {
stackIndex: 0,
skip: false,
inStrictModeStack: [undefined],
parentStack: [undefined]
};
}
// TODO: bindLogicalExpression is recursive - if we want to handle deeply nested `&&` expressions
// we'll need to handle the `bindLogicalExpression` scenarios in this state machine, too
// For now, though, since the common cases are chained `+`, leaving it recursive is fine
var operator = node.operatorToken.kind;
if (operator === 55 /* AmpersandAmpersandToken */ ||
operator === 56 /* BarBarToken */ ||
operator === 60 /* QuestionQuestionToken */ ||
ts.isLogicalOrCoalescingAssignmentOperator(operator)) {
if (isTopLevelLogicalExpression(node)) {
var postExpressionLabel = createBranchLabel();
bindLogicalLikeExpression(node, postExpressionLabel, postExpressionLabel);
currentFlow = finishFlowLabel(postExpressionLabel);
}
else {
bindLogicalLikeExpression(node, currentTrueTarget, currentFalseTarget);
}
state.skip = true;
}
return state;
}
function onLeft(left, state, _node) {
if (!state.skip) {
return maybeBind(left);
}
}
function onOperator(operatorToken, state, node) {
if (!state.skip) {
if (operatorToken.kind === 27 /* CommaToken */) {
maybeBindExpressionFlowIfCall(node.left);
}
bind(operatorToken);
}
}
function onRight(right, state, _node) {
if (!state.skip) {
return maybeBind(right);
}
}
function onExit(node, state) {
if (!state.skip) {
var operator = node.operatorToken.kind;
if (ts.isAssignmentOperator(operator) && !ts.isAssignmentTarget(node)) {
bindAssignmentTargetFlow(node.left);
if (operator === 63 /* EqualsToken */ && node.left.kind === 205 /* ElementAccessExpression */) {
var elementAccess = node.left;
if (isNarrowableOperand(elementAccess.expression)) {
currentFlow = createFlowMutation(256 /* ArrayMutation */, currentFlow, node);
}
}
}
}
var savedInStrictMode = state.inStrictModeStack[state.stackIndex];
var savedParent = state.parentStack[state.stackIndex];
if (savedInStrictMode !== undefined) {
inStrictMode = savedInStrictMode;
}
if (savedParent !== undefined) {
parent = savedParent;
}
state.skip = false;
state.stackIndex--;
}
function maybeBind(node) {
if (node && ts.isBinaryExpression(node) && !ts.isDestructuringAssignment(node)) {
return node;
}
bind(node);
}
}
function bindDeleteExpressionFlow(node) {
bindEachChild(node);
if (node.expression.kind === 204 /* PropertyAccessExpression */) {
bindAssignmentTargetFlow(node.expression);
}
}
function bindConditionalExpressionFlow(node) {
var trueLabel = createBranchLabel();
var falseLabel = createBranchLabel();
var postExpressionLabel = createBranchLabel();
bindCondition(node.condition, trueLabel, falseLabel);
currentFlow = finishFlowLabel(trueLabel);
bind(node.questionToken);
bind(node.whenTrue);
addAntecedent(postExpressionLabel, currentFlow);
currentFlow = finishFlowLabel(falseLabel);
bind(node.colonToken);
bind(node.whenFalse);
addAntecedent(postExpressionLabel, currentFlow);
currentFlow = finishFlowLabel(postExpressionLabel);
}
function bindInitializedVariableFlow(node) {
var name = !ts.isOmittedExpression(node) ? node.name : undefined;
if (ts.isBindingPattern(name)) {
for (var _i = 0, _a = name.elements; _i < _a.length; _i++) {
var child = _a[_i];
bindInitializedVariableFlow(child);
}
}
else {
currentFlow = createFlowMutation(16 /* Assignment */, currentFlow, node);
}
}
function bindVariableDeclarationFlow(node) {
bindEachChild(node);
if (node.initializer || ts.isForInOrOfStatement(node.parent.parent)) {
bindInitializedVariableFlow(node);
}
}
function bindBindingElementFlow(node) {
if (ts.isBindingPattern(node.name)) {
// When evaluating a binding pattern, the initializer is evaluated before the binding pattern, per:
// - https://tc39.es/ecma262/#sec-destructuring-binding-patterns-runtime-semantics-iteratorbindinginitialization
// - `BindingElement: BindingPattern Initializer?`
// - https://tc39.es/ecma262/#sec-runtime-semantics-keyedbindinginitialization
// - `BindingElement: BindingPattern Initializer?`
bindEach(node.decorators);
bindEach(node.modifiers);
bind(node.dotDotDotToken);
bind(node.propertyName);
bind(node.initializer);
bind(node.name);
}
else {
bindEachChild(node);
}
}
function bindJSDocTypeAlias(node) {
bind(node.tagName);
if (node.kind !== 334 /* JSDocEnumTag */ && node.fullName) {
// don't bind the type name yet; that's delayed until delayedBindJSDocTypedefTag
ts.setParent(node.fullName, node);
ts.setParentRecursive(node.fullName, /*incremental*/ false);
}
if (typeof node.comment !== "string") {
bindEach(node.comment);
}
}
function bindJSDocClassTag(node) {
bindEachChild(node);
var host = ts.getHostSignatureFromJSDoc(node);
if (host && host.kind !== 167 /* MethodDeclaration */) {
addDeclarationToSymbol(host.symbol, host, 32 /* Class */);
}
}
function bindOptionalExpression(node, trueTarget, falseTarget) {
doWithConditionalBranches(bind, node, trueTarget, falseTarget);
if (!ts.isOptionalChain(node) || ts.isOutermostOptionalChain(node)) {
addAntecedent(trueTarget, createFlowCondition(32 /* TrueCondition */, currentFlow, node));
addAntecedent(falseTarget, createFlowCondition(64 /* FalseCondition */, currentFlow, node));
}
}
function bindOptionalChainRest(node) {
switch (node.kind) {
case 204 /* PropertyAccessExpression */:
bind(node.questionDotToken);
bind(node.name);
break;
case 205 /* ElementAccessExpression */:
bind(node.questionDotToken);
bind(node.argumentExpression);
break;
case 206 /* CallExpression */:
bind(node.questionDotToken);
bindEach(node.typeArguments);
bindEach(node.arguments);
break;
}
}
function bindOptionalChain(node, trueTarget, falseTarget) {
// For an optional chain, we emulate the behavior of a logical expression:
//
// a?.b -> a && a.b
// a?.b.c -> a && a.b.c
// a?.b?.c -> a && a.b && a.b.c
// a?.[x = 1] -> a && a[x = 1]
//
// To do this we descend through the chain until we reach the root of a chain (the expression with a `?.`)
// and build it's CFA graph as if it were the first condition (`a && ...`). Then we bind the rest
// of the node as part of the "true" branch, and continue to do so as we ascend back up to the outermost
// chain node. We then treat the entire node as the right side of the expression.
var preChainLabel = ts.isOptionalChainRoot(node) ? createBranchLabel() : undefined;
bindOptionalExpression(node.expression, preChainLabel || trueTarget, falseTarget);
if (preChainLabel) {
currentFlow = finishFlowLabel(preChainLabel);
}
doWithConditionalBranches(bindOptionalChainRest, node, trueTarget, falseTarget);
if (ts.isOutermostOptionalChain(node)) {
addAntecedent(trueTarget, createFlowCondition(32 /* TrueCondition */, currentFlow, node));
addAntecedent(falseTarget, createFlowCondition(64 /* FalseCondition */, currentFlow, node));
}
}
function bindOptionalChainFlow(node) {
if (isTopLevelLogicalExpression(node)) {
var postExpressionLabel = createBranchLabel();
bindOptionalChain(node, postExpressionLabel, postExpressionLabel);
currentFlow = finishFlowLabel(postExpressionLabel);
}
else {
bindOptionalChain(node, currentTrueTarget, currentFalseTarget);
}
}
function bindNonNullExpressionFlow(node) {
if (ts.isOptionalChain(node)) {
bindOptionalChainFlow(node);
}
else {
bindEachChild(node);
}
}
function bindAccessExpressionFlow(node) {
if (ts.isOptionalChain(node)) {
bindOptionalChainFlow(node);
}
else {
bindEachChild(node);
}
}
function bindCallExpressionFlow(node) {
if (ts.isOptionalChain(node)) {
bindOptionalChainFlow(node);
}
else {
// If the target of the call expression is a function expression or arrow function we have
// an immediately invoked function expression (IIFE). Initialize the flowNode property to
// the current control flow (which includes evaluation of the IIFE arguments).
var expr = ts.skipParentheses(node.expression);
if (expr.kind === 211 /* FunctionExpression */ || expr.kind === 212 /* ArrowFunction */) {
bindEach(node.typeArguments);
bindEach(node.arguments);
bind(node.expression);
}
else {
bindEachChild(node);
if (node.expression.kind === 106 /* SuperKeyword */) {
currentFlow = createFlowCall(currentFlow, node);
}
}
}
if (node.expression.kind === 204 /* PropertyAccessExpression */) {
var propertyAccess = node.expression;
if (ts.isIdentifier(propertyAccess.name) && isNarrowableOperand(propertyAccess.expression) && ts.isPushOrUnshiftIdentifier(propertyAccess.name)) {
currentFlow = createFlowMutation(256 /* ArrayMutation */, currentFlow, node);
}
}
}
function getContainerFlags(node) {
switch (node.kind) {
case 224 /* ClassExpression */:
case 255 /* ClassDeclaration */:
case 258 /* EnumDeclaration */:
case 203 /* ObjectLiteralExpression */:
case 180 /* TypeLiteral */:
case 317 /* JSDocTypeLiteral */:
case 284 /* JsxAttributes */:
return 1 /* IsContainer */;
case 256 /* InterfaceDeclaration */:
return 1 /* IsContainer */ | 64 /* IsInterface */;
case 259 /* ModuleDeclaration */:
case 257 /* TypeAliasDeclaration */:
case 193 /* MappedType */:
return 1 /* IsContainer */ | 32 /* HasLocals */;
case 300 /* SourceFile */:
return 1 /* IsContainer */ | 4 /* IsControlFlowContainer */ | 32 /* HasLocals */;
case 167 /* MethodDeclaration */:
if (ts.isObjectLiteralOrClassExpressionMethod(node)) {
return 1 /* IsContainer */ | 4 /* IsControlFlowContainer */ | 32 /* HasLocals */ | 8 /* IsFunctionLike */ | 128 /* IsObjectLiteralOrClassExpressionMethod */;
}
// falls through
case 169 /* Constructor */:
case 254 /* FunctionDeclaration */:
case 166 /* MethodSignature */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 172 /* CallSignature */:
case 318 /* JSDocSignature */:
case 312 /* JSDocFunctionType */:
case 177 /* FunctionType */:
case 173 /* ConstructSignature */:
case 174 /* IndexSignature */:
case 178 /* ConstructorType */:
case 168 /* ClassStaticBlockDeclaration */:
return 1 /* IsContainer */ | 4 /* IsControlFlowContainer */ | 32 /* HasLocals */ | 8 /* IsFunctionLike */;
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
return 1 /* IsContainer */ | 4 /* IsControlFlowContainer */ | 32 /* HasLocals */ | 8 /* IsFunctionLike */ | 16 /* IsFunctionExpression */;
case 260 /* ModuleBlock */:
return 4 /* IsControlFlowContainer */;
case 165 /* PropertyDeclaration */:
return node.initializer ? 4 /* IsControlFlowContainer */ : 0;
case 290 /* CatchClause */:
case 240 /* ForStatement */:
case 241 /* ForInStatement */:
case 242 /* ForOfStatement */:
case 261 /* CaseBlock */:
return 2 /* IsBlockScopedContainer */;
case 233 /* Block */:
// do not treat blocks directly inside a function as a block-scoped-container.
// Locals that reside in this block should go to the function locals. Otherwise 'x'
// would not appear to be a redeclaration of a block scoped local in the following
// example:
//
// function foo() {
// var x;
// let x;
// }
//
// If we placed 'var x' into the function locals and 'let x' into the locals of
// the block, then there would be no collision.
//
// By not creating a new block-scoped-container here, we ensure that both 'var x'
// and 'let x' go into the Function-container's locals, and we do get a collision
// conflict.
return ts.isFunctionLike(node.parent) || ts.isClassStaticBlockDeclaration(node.parent) ? 0 /* None */ : 2 /* IsBlockScopedContainer */;
}
return 0 /* None */;
}
function addToContainerChain(next) {
if (lastContainer) {
lastContainer.nextContainer = next;
}
lastContainer = next;
}
function declareSymbolAndAddToSymbolTable(node, symbolFlags, symbolExcludes) {
switch (container.kind) {
// Modules, source files, and classes need specialized handling for how their
// members are declared (for example, a member of a class will go into a specific
// symbol table depending on if it is static or not). We defer to specialized
// handlers to take care of declaring these child members.
case 259 /* ModuleDeclaration */:
return declareModuleMember(node, symbolFlags, symbolExcludes);
case 300 /* SourceFile */:
return declareSourceFileMember(node, symbolFlags, symbolExcludes);
case 224 /* ClassExpression */:
case 255 /* ClassDeclaration */:
return declareClassMember(node, symbolFlags, symbolExcludes);
case 258 /* EnumDeclaration */:
return declareSymbol(container.symbol.exports, container.symbol, node, symbolFlags, symbolExcludes);
case 180 /* TypeLiteral */:
case 317 /* JSDocTypeLiteral */:
case 203 /* ObjectLiteralExpression */:
case 256 /* InterfaceDeclaration */:
case 284 /* JsxAttributes */:
// Interface/Object-types always have their children added to the 'members' of
// their container. They are only accessible through an instance of their
// container, and are never in scope otherwise (even inside the body of the
// object / type / interface declaring them). An exception is type parameters,
// which are in scope without qualification (similar to 'locals').
return declareSymbol(container.symbol.members, container.symbol, node, symbolFlags, symbolExcludes);
case 177 /* FunctionType */:
case 178 /* ConstructorType */:
case 172 /* CallSignature */:
case 173 /* ConstructSignature */:
case 318 /* JSDocSignature */:
case 174 /* IndexSignature */:
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
case 169 /* Constructor */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
case 312 /* JSDocFunctionType */:
case 340 /* JSDocTypedefTag */:
case 333 /* JSDocCallbackTag */:
case 168 /* ClassStaticBlockDeclaration */:
case 257 /* TypeAliasDeclaration */:
case 193 /* MappedType */:
// All the children of these container types are never visible through another
// symbol (i.e. through another symbol's 'exports' or 'members'). Instead,
// they're only accessed 'lexically' (i.e. from code that exists underneath
// their container in the tree). To accomplish this, we simply add their declared
// symbol to the 'locals' of the container. These symbols can then be found as
// the type checker walks up the containers, checking them for matching names.
return declareSymbol(container.locals, /*parent*/ undefined, node, symbolFlags, symbolExcludes);
}
}
function declareClassMember(node, symbolFlags, symbolExcludes) {
return ts.isStatic(node)
? declareSymbol(container.symbol.exports, container.symbol, node, symbolFlags, symbolExcludes)
: declareSymbol(container.symbol.members, container.symbol, node, symbolFlags, symbolExcludes);
}
function declareSourceFileMember(node, symbolFlags, symbolExcludes) {
return ts.isExternalModule(file)
? declareModuleMember(node, symbolFlags, symbolExcludes)
: declareSymbol(file.locals, /*parent*/ undefined, node, symbolFlags, symbolExcludes);
}
function hasExportDeclarations(node) {
var body = ts.isSourceFile(node) ? node : ts.tryCast(node.body, ts.isModuleBlock);
return !!body && body.statements.some(function (s) { return ts.isExportDeclaration(s) || ts.isExportAssignment(s); });
}
function setExportContextFlag(node) {
// A declaration source file or ambient module declaration that contains no export declarations (but possibly regular
// declarations with export modifiers) is an export context in which declarations are implicitly exported.
if (node.flags & 8388608 /* Ambient */ && !hasExportDeclarations(node)) {
node.flags |= 64 /* ExportContext */;
}
else {
node.flags &= ~64 /* ExportContext */;
}
}
function bindModuleDeclaration(node) {
setExportContextFlag(node);
if (ts.isAmbientModule(node)) {
if (ts.hasSyntacticModifier(node, 1 /* Export */)) {
errorOnFirstToken(node, ts.Diagnostics.export_modifier_cannot_be_applied_to_ambient_modules_and_module_augmentations_since_they_are_always_visible);
}
if (ts.isModuleAugmentationExternal(node)) {
declareModuleSymbol(node);
}
else {
var pattern = void 0;
if (node.name.kind === 10 /* StringLiteral */) {
var text = node.name.text;
pattern = ts.tryParsePattern(text);
if (pattern === undefined) {
errorOnFirstToken(node.name, ts.Diagnostics.Pattern_0_can_have_at_most_one_Asterisk_character, text);
}
}
var symbol = declareSymbolAndAddToSymbolTable(node, 512 /* ValueModule */, 110735 /* ValueModuleExcludes */);
file.patternAmbientModules = ts.append(file.patternAmbientModules, pattern && !ts.isString(pattern) ? { pattern: pattern, symbol: symbol } : undefined);
}
}
else {
var state = declareModuleSymbol(node);
if (state !== 0 /* NonInstantiated */) {
var symbol = node.symbol;
// if module was already merged with some function, class or non-const enum, treat it as non-const-enum-only
symbol.constEnumOnlyModule = (!(symbol.flags & (16 /* Function */ | 32 /* Class */ | 256 /* RegularEnum */)))
// Current must be `const enum` only
&& state === 2 /* ConstEnumOnly */
// Can't have been set to 'false' in a previous merged symbol. ('undefined' OK)
&& symbol.constEnumOnlyModule !== false;
}
}
}
function declareModuleSymbol(node) {
var state = getModuleInstanceState(node);
var instantiated = state !== 0 /* NonInstantiated */;
declareSymbolAndAddToSymbolTable(node, instantiated ? 512 /* ValueModule */ : 1024 /* NamespaceModule */, instantiated ? 110735 /* ValueModuleExcludes */ : 0 /* NamespaceModuleExcludes */);
return state;
}
function bindFunctionOrConstructorType(node) {
// For a given function symbol "<...>(...) => T" we want to generate a symbol identical
// to the one we would get for: { <...>(...): T }
//
// We do that by making an anonymous type literal symbol, and then setting the function
// symbol as its sole member. To the rest of the system, this symbol will be indistinguishable
// from an actual type literal symbol you would have gotten had you used the long form.
var symbol = createSymbol(131072 /* Signature */, getDeclarationName(node)); // TODO: GH#18217
addDeclarationToSymbol(symbol, node, 131072 /* Signature */);
var typeLiteralSymbol = createSymbol(2048 /* TypeLiteral */, "__type" /* Type */);
addDeclarationToSymbol(typeLiteralSymbol, node, 2048 /* TypeLiteral */);
typeLiteralSymbol.members = ts.createSymbolTable();
typeLiteralSymbol.members.set(symbol.escapedName, symbol);
}
function bindObjectLiteralExpression(node) {
var ElementKind;
(function (ElementKind) {
ElementKind[ElementKind["Property"] = 1] = "Property";
ElementKind[ElementKind["Accessor"] = 2] = "Accessor";
})(ElementKind || (ElementKind = {}));
if (inStrictMode && !ts.isAssignmentTarget(node)) {
var seen = new ts.Map();
for (var _i = 0, _a = node.properties; _i < _a.length; _i++) {
var prop = _a[_i];
if (prop.kind === 293 /* SpreadAssignment */ || prop.name.kind !== 79 /* Identifier */) {
continue;
}
var identifier = prop.name;
// ECMA-262 11.1.5 Object Initializer
// If previous is not undefined then throw a SyntaxError exception if any of the following conditions are true
// a.This production is contained in strict code and IsDataDescriptor(previous) is true and
// IsDataDescriptor(propId.descriptor) is true.
// b.IsDataDescriptor(previous) is true and IsAccessorDescriptor(propId.descriptor) is true.
// c.IsAccessorDescriptor(previous) is true and IsDataDescriptor(propId.descriptor) is true.
// d.IsAccessorDescriptor(previous) is true and IsAccessorDescriptor(propId.descriptor) is true
// and either both previous and propId.descriptor have[[Get]] fields or both previous and propId.descriptor have[[Set]] fields
var currentKind = prop.kind === 291 /* PropertyAssignment */ || prop.kind === 292 /* ShorthandPropertyAssignment */ || prop.kind === 167 /* MethodDeclaration */
? 1 /* Property */
: 2 /* Accessor */;
var existingKind = seen.get(identifier.escapedText);
if (!existingKind) {
seen.set(identifier.escapedText, currentKind);
continue;
}
if (currentKind === 1 /* Property */ && existingKind === 1 /* Property */) {
var span = ts.getErrorSpanForNode(file, identifier);
file.bindDiagnostics.push(ts.createFileDiagnostic(file, span.start, span.length, ts.Diagnostics.An_object_literal_cannot_have_multiple_properties_with_the_same_name_in_strict_mode));
}
}
}
return bindAnonymousDeclaration(node, 4096 /* ObjectLiteral */, "__object" /* Object */);
}
function bindJsxAttributes(node) {
return bindAnonymousDeclaration(node, 4096 /* ObjectLiteral */, "__jsxAttributes" /* JSXAttributes */);
}
function bindJsxAttribute(node, symbolFlags, symbolExcludes) {
return declareSymbolAndAddToSymbolTable(node, symbolFlags, symbolExcludes);
}
function bindAnonymousDeclaration(node, symbolFlags, name) {
var symbol = createSymbol(symbolFlags, name);
if (symbolFlags & (8 /* EnumMember */ | 106500 /* ClassMember */)) {
symbol.parent = container.symbol;
}
addDeclarationToSymbol(symbol, node, symbolFlags);
return symbol;
}
function bindBlockScopedDeclaration(node, symbolFlags, symbolExcludes) {
switch (blockScopeContainer.kind) {
case 259 /* ModuleDeclaration */:
declareModuleMember(node, symbolFlags, symbolExcludes);
break;
case 300 /* SourceFile */:
if (ts.isExternalOrCommonJsModule(container)) {
declareModuleMember(node, symbolFlags, symbolExcludes);
break;
}
// falls through
default:
if (!blockScopeContainer.locals) {
blockScopeContainer.locals = ts.createSymbolTable();
addToContainerChain(blockScopeContainer);
}
declareSymbol(blockScopeContainer.locals, /*parent*/ undefined, node, symbolFlags, symbolExcludes);
}
}
function delayedBindJSDocTypedefTag() {
if (!delayedTypeAliases) {
return;
}
var saveContainer = container;
var saveLastContainer = lastContainer;
var saveBlockScopeContainer = blockScopeContainer;
var saveParent = parent;
var saveCurrentFlow = currentFlow;
for (var _i = 0, delayedTypeAliases_1 = delayedTypeAliases; _i < delayedTypeAliases_1.length; _i++) {
var typeAlias = delayedTypeAliases_1[_i];
var host = typeAlias.parent.parent;
container = ts.findAncestor(host.parent, function (n) { return !!(getContainerFlags(n) & 1 /* IsContainer */); }) || file;
blockScopeContainer = ts.getEnclosingBlockScopeContainer(host) || file;
currentFlow = initFlowNode({ flags: 2 /* Start */ });
parent = typeAlias;
bind(typeAlias.typeExpression);
var declName = ts.getNameOfDeclaration(typeAlias);
if ((ts.isJSDocEnumTag(typeAlias) || !typeAlias.fullName) && declName && ts.isPropertyAccessEntityNameExpression(declName.parent)) {
// typedef anchored to an A.B.C assignment - we need to bind into B's namespace under name C
var isTopLevel = isTopLevelNamespaceAssignment(declName.parent);
if (isTopLevel) {
bindPotentiallyMissingNamespaces(file.symbol, declName.parent, isTopLevel, !!ts.findAncestor(declName, function (d) { return ts.isPropertyAccessExpression(d) && d.name.escapedText === "prototype"; }), /*containerIsClass*/ false);
var oldContainer = container;
switch (ts.getAssignmentDeclarationPropertyAccessKind(declName.parent)) {
case 1 /* ExportsProperty */:
case 2 /* ModuleExports */:
if (!ts.isExternalOrCommonJsModule(file)) {
container = undefined;
}
else {
container = file;
}
break;
case 4 /* ThisProperty */:
container = declName.parent.expression;
break;
case 3 /* PrototypeProperty */:
container = declName.parent.expression.name;
break;
case 5 /* Property */:
container = isExportsOrModuleExportsOrAlias(file, declName.parent.expression) ? file
: ts.isPropertyAccessExpression(declName.parent.expression) ? declName.parent.expression.name
: declName.parent.expression;
break;
case 0 /* None */:
return ts.Debug.fail("Shouldn't have detected typedef or enum on non-assignment declaration");
}
if (container) {
declareModuleMember(typeAlias, 524288 /* TypeAlias */, 788968 /* TypeAliasExcludes */);
}
container = oldContainer;
}
}
else if (ts.isJSDocEnumTag(typeAlias) || !typeAlias.fullName || typeAlias.fullName.kind === 79 /* Identifier */) {
parent = typeAlias.parent;
bindBlockScopedDeclaration(typeAlias, 524288 /* TypeAlias */, 788968 /* TypeAliasExcludes */);
}
else {
bind(typeAlias.fullName);
}
}
container = saveContainer;
lastContainer = saveLastContainer;
blockScopeContainer = saveBlockScopeContainer;
parent = saveParent;
currentFlow = saveCurrentFlow;
}
// The binder visits every node in the syntax tree so it is a convenient place to perform a single localized
// check for reserved words used as identifiers in strict mode code, as well as `yield` or `await` in
// [Yield] or [Await] contexts, respectively.
function checkContextualIdentifier(node) {
// Report error only if there are no parse errors in file
if (!file.parseDiagnostics.length &&
!(node.flags & 8388608 /* Ambient */) &&
!(node.flags & 4194304 /* JSDoc */) &&
!ts.isIdentifierName(node)) {
// strict mode identifiers
if (inStrictMode &&
node.originalKeywordKind >= 117 /* FirstFutureReservedWord */ &&
node.originalKeywordKind <= 125 /* LastFutureReservedWord */) {
file.bindDiagnostics.push(createDiagnosticForNode(node, getStrictModeIdentifierMessage(node), ts.declarationNameToString(node)));
}
else if (node.originalKeywordKind === 131 /* AwaitKeyword */) {
if (ts.isExternalModule(file) && ts.isInTopLevelContext(node)) {
file.bindDiagnostics.push(createDiagnosticForNode(node, ts.Diagnostics.Identifier_expected_0_is_a_reserved_word_at_the_top_level_of_a_module, ts.declarationNameToString(node)));
}
else if (node.flags & 32768 /* AwaitContext */) {
file.bindDiagnostics.push(createDiagnosticForNode(node, ts.Diagnostics.Identifier_expected_0_is_a_reserved_word_that_cannot_be_used_here, ts.declarationNameToString(node)));
}
}
else if (node.originalKeywordKind === 125 /* YieldKeyword */ && node.flags & 8192 /* YieldContext */) {
file.bindDiagnostics.push(createDiagnosticForNode(node, ts.Diagnostics.Identifier_expected_0_is_a_reserved_word_that_cannot_be_used_here, ts.declarationNameToString(node)));
}
}
}
function getStrictModeIdentifierMessage(node) {
// Provide specialized messages to help the user understand why we think they're in
// strict mode.
if (ts.getContainingClass(node)) {
return ts.Diagnostics.Identifier_expected_0_is_a_reserved_word_in_strict_mode_Class_definitions_are_automatically_in_strict_mode;
}
if (file.externalModuleIndicator) {
return ts.Diagnostics.Identifier_expected_0_is_a_reserved_word_in_strict_mode_Modules_are_automatically_in_strict_mode;
}
return ts.Diagnostics.Identifier_expected_0_is_a_reserved_word_in_strict_mode;
}
// The binder visits every node, so this is a good place to check for
// the reserved private name (there is only one)
function checkPrivateIdentifier(node) {
if (node.escapedText === "#constructor") {
// Report error only if there are no parse errors in file
if (!file.parseDiagnostics.length) {
file.bindDiagnostics.push(createDiagnosticForNode(node, ts.Diagnostics.constructor_is_a_reserved_word, ts.declarationNameToString(node)));
}
}
}
function checkStrictModeBinaryExpression(node) {
if (inStrictMode && ts.isLeftHandSideExpression(node.left) && ts.isAssignmentOperator(node.operatorToken.kind)) {
// ECMA 262 (Annex C) The identifier eval or arguments may not appear as the LeftHandSideExpression of an
// Assignment operator(11.13) or of a PostfixExpression(11.3)
checkStrictModeEvalOrArguments(node, node.left);
}
}
function checkStrictModeCatchClause(node) {
// It is a SyntaxError if a TryStatement with a Catch occurs within strict code and the Identifier of the
// Catch production is eval or arguments
if (inStrictMode && node.variableDeclaration) {
checkStrictModeEvalOrArguments(node, node.variableDeclaration.name);
}
}
function checkStrictModeDeleteExpression(node) {
// Grammar checking
if (inStrictMode && node.expression.kind === 79 /* Identifier */) {
// When a delete operator occurs within strict mode code, a SyntaxError is thrown if its
// UnaryExpression is a direct reference to a variable, function argument, or function name
var span = ts.getErrorSpanForNode(file, node.expression);
file.bindDiagnostics.push(ts.createFileDiagnostic(file, span.start, span.length, ts.Diagnostics.delete_cannot_be_called_on_an_identifier_in_strict_mode));
}
}
function isEvalOrArgumentsIdentifier(node) {
return ts.isIdentifier(node) && (node.escapedText === "eval" || node.escapedText === "arguments");
}
function checkStrictModeEvalOrArguments(contextNode, name) {
if (name && name.kind === 79 /* Identifier */) {
var identifier = name;
if (isEvalOrArgumentsIdentifier(identifier)) {
// We check first if the name is inside class declaration or class expression; if so give explicit message
// otherwise report generic error message.
var span = ts.getErrorSpanForNode(file, name);
file.bindDiagnostics.push(ts.createFileDiagnostic(file, span.start, span.length, getStrictModeEvalOrArgumentsMessage(contextNode), ts.idText(identifier)));
}
}
}
function getStrictModeEvalOrArgumentsMessage(node) {
// Provide specialized messages to help the user understand why we think they're in
// strict mode.
if (ts.getContainingClass(node)) {
return ts.Diagnostics.Code_contained_in_a_class_is_evaluated_in_JavaScript_s_strict_mode_which_does_not_allow_this_use_of_0_For_more_information_see_https_Colon_Slash_Slashdeveloper_mozilla_org_Slashen_US_Slashdocs_SlashWeb_SlashJavaScript_SlashReference_SlashStrict_mode;
}
if (file.externalModuleIndicator) {
return ts.Diagnostics.Invalid_use_of_0_Modules_are_automatically_in_strict_mode;
}
return ts.Diagnostics.Invalid_use_of_0_in_strict_mode;
}
function checkStrictModeFunctionName(node) {
if (inStrictMode) {
// It is a SyntaxError if the identifier eval or arguments appears within a FormalParameterList of a strict mode FunctionDeclaration or FunctionExpression (13.1))
checkStrictModeEvalOrArguments(node, node.name);
}
}
function getStrictModeBlockScopeFunctionDeclarationMessage(node) {
// Provide specialized messages to help the user understand why we think they're in
// strict mode.
if (ts.getContainingClass(node)) {
return ts.Diagnostics.Function_declarations_are_not_allowed_inside_blocks_in_strict_mode_when_targeting_ES3_or_ES5_Class_definitions_are_automatically_in_strict_mode;
}
if (file.externalModuleIndicator) {
return ts.Diagnostics.Function_declarations_are_not_allowed_inside_blocks_in_strict_mode_when_targeting_ES3_or_ES5_Modules_are_automatically_in_strict_mode;
}
return ts.Diagnostics.Function_declarations_are_not_allowed_inside_blocks_in_strict_mode_when_targeting_ES3_or_ES5;
}
function checkStrictModeFunctionDeclaration(node) {
if (languageVersion < 2 /* ES2015 */) {
// Report error if function is not top level function declaration
if (blockScopeContainer.kind !== 300 /* SourceFile */ &&
blockScopeContainer.kind !== 259 /* ModuleDeclaration */ &&
!ts.isFunctionLikeOrClassStaticBlockDeclaration(blockScopeContainer)) {
// We check first if the name is inside class declaration or class expression; if so give explicit message
// otherwise report generic error message.
var errorSpan = ts.getErrorSpanForNode(file, node);
file.bindDiagnostics.push(ts.createFileDiagnostic(file, errorSpan.start, errorSpan.length, getStrictModeBlockScopeFunctionDeclarationMessage(node)));
}
}
}
function checkStrictModeNumericLiteral(node) {
if (inStrictMode && node.numericLiteralFlags & 32 /* Octal */) {
file.bindDiagnostics.push(createDiagnosticForNode(node, ts.Diagnostics.Octal_literals_are_not_allowed_in_strict_mode));
}
}
function checkStrictModePostfixUnaryExpression(node) {
// Grammar checking
// The identifier eval or arguments may not appear as the LeftHandSideExpression of an
// Assignment operator(11.13) or of a PostfixExpression(11.3) or as the UnaryExpression
// operated upon by a Prefix Increment(11.4.4) or a Prefix Decrement(11.4.5) operator.
if (inStrictMode) {
checkStrictModeEvalOrArguments(node, node.operand);
}
}
function checkStrictModePrefixUnaryExpression(node) {
// Grammar checking
if (inStrictMode) {
if (node.operator === 45 /* PlusPlusToken */ || node.operator === 46 /* MinusMinusToken */) {
checkStrictModeEvalOrArguments(node, node.operand);
}
}
}
function checkStrictModeWithStatement(node) {
// Grammar checking for withStatement
if (inStrictMode) {
errorOnFirstToken(node, ts.Diagnostics.with_statements_are_not_allowed_in_strict_mode);
}
}
function checkStrictModeLabeledStatement(node) {
// Grammar checking for labeledStatement
if (inStrictMode && options.target >= 2 /* ES2015 */) {
if (ts.isDeclarationStatement(node.statement) || ts.isVariableStatement(node.statement)) {
errorOnFirstToken(node.label, ts.Diagnostics.A_label_is_not_allowed_here);
}
}
}
function errorOnFirstToken(node, message, arg0, arg1, arg2) {
var span = ts.getSpanOfTokenAtPosition(file, node.pos);
file.bindDiagnostics.push(ts.createFileDiagnostic(file, span.start, span.length, message, arg0, arg1, arg2));
}
function errorOrSuggestionOnNode(isError, node, message) {
errorOrSuggestionOnRange(isError, node, node, message);
}
function errorOrSuggestionOnRange(isError, startNode, endNode, message) {
addErrorOrSuggestionDiagnostic(isError, { pos: ts.getTokenPosOfNode(startNode, file), end: endNode.end }, message);
}
function addErrorOrSuggestionDiagnostic(isError, range, message) {
var diag = ts.createFileDiagnostic(file, range.pos, range.end - range.pos, message);
if (isError) {
file.bindDiagnostics.push(diag);
}
else {
file.bindSuggestionDiagnostics = ts.append(file.bindSuggestionDiagnostics, __assign(__assign({}, diag), { category: ts.DiagnosticCategory.Suggestion }));
}
}
function bind(node) {
if (!node) {
return;
}
ts.setParent(node, parent);
var saveInStrictMode = inStrictMode;
// Even though in the AST the jsdoc @typedef node belongs to the current node,
// its symbol might be in the same scope with the current node's symbol. Consider:
//
// /** @typedef {string | number} MyType */
// function foo();
//
// Here the current node is "foo", which is a container, but the scope of "MyType" should
// not be inside "foo". Therefore we always bind @typedef before bind the parent node,
// and skip binding this tag later when binding all the other jsdoc tags.
// First we bind declaration nodes to a symbol if possible. We'll both create a symbol
// and then potentially add the symbol to an appropriate symbol table. Possible
// destination symbol tables are:
//
// 1) The 'exports' table of the current container's symbol.
// 2) The 'members' table of the current container's symbol.
// 3) The 'locals' table of the current container.
//
// However, not all symbols will end up in any of these tables. 'Anonymous' symbols
// (like TypeLiterals for example) will not be put in any table.
bindWorker(node);
// Then we recurse into the children of the node to bind them as well. For certain
// symbols we do specialized work when we recurse. For example, we'll keep track of
// the current 'container' node when it changes. This helps us know which symbol table
// a local should go into for example. Since terminal nodes are known not to have
// children, as an optimization we don't process those.
if (node.kind > 158 /* LastToken */) {
var saveParent = parent;
parent = node;
var containerFlags = getContainerFlags(node);
if (containerFlags === 0 /* None */) {
bindChildren(node);
}
else {
bindContainer(node, containerFlags);
}
parent = saveParent;
}
else {
var saveParent = parent;
if (node.kind === 1 /* EndOfFileToken */)
parent = node;
bindJSDoc(node);
parent = saveParent;
}
inStrictMode = saveInStrictMode;
}
function bindJSDoc(node) {
if (ts.hasJSDocNodes(node)) {
if (ts.isInJSFile(node)) {
for (var _i = 0, _a = node.jsDoc; _i < _a.length; _i++) {
var j = _a[_i];
bind(j);
}
}
else {
for (var _b = 0, _c = node.jsDoc; _b < _c.length; _b++) {
var j = _c[_b];
ts.setParent(j, node);
ts.setParentRecursive(j, /*incremental*/ false);
}
}
}
}
function updateStrictModeStatementList(statements) {
if (!inStrictMode) {
for (var _i = 0, statements_3 = statements; _i < statements_3.length; _i++) {
var statement = statements_3[_i];
if (!ts.isPrologueDirective(statement)) {
return;
}
if (isUseStrictPrologueDirective(statement)) {
inStrictMode = true;
return;
}
}
}
}
/// Should be called only on prologue directives (isPrologueDirective(node) should be true)
function isUseStrictPrologueDirective(node) {
var nodeText = ts.getSourceTextOfNodeFromSourceFile(file, node.expression);
// Note: the node text must be exactly "use strict" or 'use strict'. It is not ok for the
// string to contain unicode escapes (as per ES5).
return nodeText === '"use strict"' || nodeText === "'use strict'";
}
function bindWorker(node) {
switch (node.kind) {
/* Strict mode checks */
case 79 /* Identifier */:
// for typedef type names with namespaces, bind the new jsdoc type symbol here
// because it requires all containing namespaces to be in effect, namely the
// current "blockScopeContainer" needs to be set to its immediate namespace parent.
if (node.isInJSDocNamespace) {
var parentNode = node.parent;
while (parentNode && !ts.isJSDocTypeAlias(parentNode)) {
parentNode = parentNode.parent;
}
bindBlockScopedDeclaration(parentNode, 524288 /* TypeAlias */, 788968 /* TypeAliasExcludes */);
break;
}
// falls through
case 108 /* ThisKeyword */:
if (currentFlow && (ts.isExpression(node) || parent.kind === 292 /* ShorthandPropertyAssignment */)) {
node.flowNode = currentFlow;
}
return checkContextualIdentifier(node);
case 159 /* QualifiedName */:
if (currentFlow && ts.isPartOfTypeQuery(node)) {
node.flowNode = currentFlow;
}
break;
case 229 /* MetaProperty */:
case 106 /* SuperKeyword */:
node.flowNode = currentFlow;
break;
case 80 /* PrivateIdentifier */:
return checkPrivateIdentifier(node);
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
var expr = node;
if (currentFlow && isNarrowableReference(expr)) {
expr.flowNode = currentFlow;
}
if (ts.isSpecialPropertyDeclaration(expr)) {
bindSpecialPropertyDeclaration(expr);
}
if (ts.isInJSFile(expr) &&
file.commonJsModuleIndicator &&
ts.isModuleExportsAccessExpression(expr) &&
!lookupSymbolForName(blockScopeContainer, "module")) {
declareSymbol(file.locals, /*parent*/ undefined, expr.expression, 1 /* FunctionScopedVariable */ | 134217728 /* ModuleExports */, 111550 /* FunctionScopedVariableExcludes */);
}
break;
case 219 /* BinaryExpression */:
var specialKind = ts.getAssignmentDeclarationKind(node);
switch (specialKind) {
case 1 /* ExportsProperty */:
bindExportsPropertyAssignment(node);
break;
case 2 /* ModuleExports */:
bindModuleExportsAssignment(node);
break;
case 3 /* PrototypeProperty */:
bindPrototypePropertyAssignment(node.left, node);
break;
case 6 /* Prototype */:
bindPrototypeAssignment(node);
break;
case 4 /* ThisProperty */:
bindThisPropertyAssignment(node);
break;
case 5 /* Property */:
var expression = node.left.expression;
if (ts.isInJSFile(node) && ts.isIdentifier(expression)) {
var symbol = lookupSymbolForName(blockScopeContainer, expression.escapedText);
if (ts.isThisInitializedDeclaration(symbol === null || symbol === void 0 ? void 0 : symbol.valueDeclaration)) {
bindThisPropertyAssignment(node);
break;
}
}
bindSpecialPropertyAssignment(node);
break;
case 0 /* None */:
// Nothing to do
break;
default:
ts.Debug.fail("Unknown binary expression special property assignment kind");
}
return checkStrictModeBinaryExpression(node);
case 290 /* CatchClause */:
return checkStrictModeCatchClause(node);
case 213 /* DeleteExpression */:
return checkStrictModeDeleteExpression(node);
case 8 /* NumericLiteral */:
return checkStrictModeNumericLiteral(node);
case 218 /* PostfixUnaryExpression */:
return checkStrictModePostfixUnaryExpression(node);
case 217 /* PrefixUnaryExpression */:
return checkStrictModePrefixUnaryExpression(node);
case 246 /* WithStatement */:
return checkStrictModeWithStatement(node);
case 248 /* LabeledStatement */:
return checkStrictModeLabeledStatement(node);
case 190 /* ThisType */:
seenThisKeyword = true;
return;
case 175 /* TypePredicate */:
break; // Binding the children will handle everything
case 161 /* TypeParameter */:
return bindTypeParameter(node);
case 162 /* Parameter */:
return bindParameter(node);
case 252 /* VariableDeclaration */:
return bindVariableDeclarationOrBindingElement(node);
case 201 /* BindingElement */:
node.flowNode = currentFlow;
return bindVariableDeclarationOrBindingElement(node);
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
return bindPropertyWorker(node);
case 291 /* PropertyAssignment */:
case 292 /* ShorthandPropertyAssignment */:
return bindPropertyOrMethodOrAccessor(node, 4 /* Property */, 0 /* PropertyExcludes */);
case 294 /* EnumMember */:
return bindPropertyOrMethodOrAccessor(node, 8 /* EnumMember */, 900095 /* EnumMemberExcludes */);
case 172 /* CallSignature */:
case 173 /* ConstructSignature */:
case 174 /* IndexSignature */:
return declareSymbolAndAddToSymbolTable(node, 131072 /* Signature */, 0 /* None */);
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
// If this is an ObjectLiteralExpression method, then it sits in the same space
// as other properties in the object literal. So we use SymbolFlags.PropertyExcludes
// so that it will conflict with any other object literal members with the same
// name.
return bindPropertyOrMethodOrAccessor(node, 8192 /* Method */ | (node.questionToken ? 16777216 /* Optional */ : 0 /* None */), ts.isObjectLiteralMethod(node) ? 0 /* PropertyExcludes */ : 103359 /* MethodExcludes */);
case 254 /* FunctionDeclaration */:
return bindFunctionDeclaration(node);
case 169 /* Constructor */:
return declareSymbolAndAddToSymbolTable(node, 16384 /* Constructor */, /*symbolExcludes:*/ 0 /* None */);
case 170 /* GetAccessor */:
return bindPropertyOrMethodOrAccessor(node, 32768 /* GetAccessor */, 46015 /* GetAccessorExcludes */);
case 171 /* SetAccessor */:
return bindPropertyOrMethodOrAccessor(node, 65536 /* SetAccessor */, 78783 /* SetAccessorExcludes */);
case 177 /* FunctionType */:
case 312 /* JSDocFunctionType */:
case 318 /* JSDocSignature */:
case 178 /* ConstructorType */:
return bindFunctionOrConstructorType(node);
case 180 /* TypeLiteral */:
case 317 /* JSDocTypeLiteral */:
case 193 /* MappedType */:
return bindAnonymousTypeWorker(node);
case 327 /* JSDocClassTag */:
return bindJSDocClassTag(node);
case 203 /* ObjectLiteralExpression */:
return bindObjectLiteralExpression(node);
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
return bindFunctionExpression(node);
case 206 /* CallExpression */:
var assignmentKind = ts.getAssignmentDeclarationKind(node);
switch (assignmentKind) {
case 7 /* ObjectDefinePropertyValue */:
return bindObjectDefinePropertyAssignment(node);
case 8 /* ObjectDefinePropertyExports */:
return bindObjectDefinePropertyExport(node);
case 9 /* ObjectDefinePrototypeProperty */:
return bindObjectDefinePrototypeProperty(node);
case 0 /* None */:
break; // Nothing to do
default:
return ts.Debug.fail("Unknown call expression assignment declaration kind");
}
if (ts.isInJSFile(node)) {
bindCallExpression(node);
}
break;
// Members of classes, interfaces, and modules
case 224 /* ClassExpression */:
case 255 /* ClassDeclaration */:
// All classes are automatically in strict mode in ES6.
inStrictMode = true;
return bindClassLikeDeclaration(node);
case 256 /* InterfaceDeclaration */:
return bindBlockScopedDeclaration(node, 64 /* Interface */, 788872 /* InterfaceExcludes */);
case 257 /* TypeAliasDeclaration */:
return bindBlockScopedDeclaration(node, 524288 /* TypeAlias */, 788968 /* TypeAliasExcludes */);
case 258 /* EnumDeclaration */:
return bindEnumDeclaration(node);
case 259 /* ModuleDeclaration */:
return bindModuleDeclaration(node);
// Jsx-attributes
case 284 /* JsxAttributes */:
return bindJsxAttributes(node);
case 283 /* JsxAttribute */:
return bindJsxAttribute(node, 4 /* Property */, 0 /* PropertyExcludes */);
// Imports and exports
case 263 /* ImportEqualsDeclaration */:
case 266 /* NamespaceImport */:
case 268 /* ImportSpecifier */:
case 273 /* ExportSpecifier */:
return declareSymbolAndAddToSymbolTable(node, 2097152 /* Alias */, 2097152 /* AliasExcludes */);
case 262 /* NamespaceExportDeclaration */:
return bindNamespaceExportDeclaration(node);
case 265 /* ImportClause */:
return bindImportClause(node);
case 270 /* ExportDeclaration */:
return bindExportDeclaration(node);
case 269 /* ExportAssignment */:
return bindExportAssignment(node);
case 300 /* SourceFile */:
updateStrictModeStatementList(node.statements);
return bindSourceFileIfExternalModule();
case 233 /* Block */:
if (!ts.isFunctionLikeOrClassStaticBlockDeclaration(node.parent)) {
return;
}
// falls through
case 260 /* ModuleBlock */:
return updateStrictModeStatementList(node.statements);
case 335 /* JSDocParameterTag */:
if (node.parent.kind === 318 /* JSDocSignature */) {
return bindParameter(node);
}
if (node.parent.kind !== 317 /* JSDocTypeLiteral */) {
break;
}
// falls through
case 342 /* JSDocPropertyTag */:
var propTag = node;
var flags = propTag.isBracketed || propTag.typeExpression && propTag.typeExpression.type.kind === 311 /* JSDocOptionalType */ ?
4 /* Property */ | 16777216 /* Optional */ :
4 /* Property */;
return declareSymbolAndAddToSymbolTable(propTag, flags, 0 /* PropertyExcludes */);
case 340 /* JSDocTypedefTag */:
case 333 /* JSDocCallbackTag */:
case 334 /* JSDocEnumTag */:
return (delayedTypeAliases || (delayedTypeAliases = [])).push(node);
}
}
function bindPropertyWorker(node) {
return bindPropertyOrMethodOrAccessor(node, 4 /* Property */ | (node.questionToken ? 16777216 /* Optional */ : 0 /* None */), 0 /* PropertyExcludes */);
}
function bindAnonymousTypeWorker(node) {
return bindAnonymousDeclaration(node, 2048 /* TypeLiteral */, "__type" /* Type */);
}
function bindSourceFileIfExternalModule() {
setExportContextFlag(file);
if (ts.isExternalModule(file)) {
bindSourceFileAsExternalModule();
}
else if (ts.isJsonSourceFile(file)) {
bindSourceFileAsExternalModule();
// Create symbol equivalent for the module.exports = {}
var originalSymbol = file.symbol;
declareSymbol(file.symbol.exports, file.symbol, file, 4 /* Property */, 67108863 /* All */);
file.symbol = originalSymbol;
}
}
function bindSourceFileAsExternalModule() {
bindAnonymousDeclaration(file, 512 /* ValueModule */, "\"" + ts.removeFileExtension(file.fileName) + "\"");
}
function bindExportAssignment(node) {
if (!container.symbol || !container.symbol.exports) {
// Incorrect export assignment in some sort of block construct
bindAnonymousDeclaration(node, 111551 /* Value */, getDeclarationName(node));
}
else {
var flags = ts.exportAssignmentIsAlias(node)
// An export default clause with an EntityNameExpression or a class expression exports all meanings of that identifier or expression;
? 2097152 /* Alias */
// An export default clause with any other expression exports a value
: 4 /* Property */;
// If there is an `export default x;` alias declaration, can't `export default` anything else.
// (In contrast, you can still have `export default function f() {}` and `export default interface I {}`.)
var symbol = declareSymbol(container.symbol.exports, container.symbol, node, flags, 67108863 /* All */);
if (node.isExportEquals) {
// Will be an error later, since the module already has other exports. Just make sure this has a valueDeclaration set.
ts.setValueDeclaration(symbol, node);
}
}
}
function bindNamespaceExportDeclaration(node) {
if (node.modifiers && node.modifiers.length) {
file.bindDiagnostics.push(createDiagnosticForNode(node, ts.Diagnostics.Modifiers_cannot_appear_here));
}
var diag = !ts.isSourceFile(node.parent) ? ts.Diagnostics.Global_module_exports_may_only_appear_at_top_level
: !ts.isExternalModule(node.parent) ? ts.Diagnostics.Global_module_exports_may_only_appear_in_module_files
: !node.parent.isDeclarationFile ? ts.Diagnostics.Global_module_exports_may_only_appear_in_declaration_files
: undefined;
if (diag) {
file.bindDiagnostics.push(createDiagnosticForNode(node, diag));
}
else {
file.symbol.globalExports = file.symbol.globalExports || ts.createSymbolTable();
declareSymbol(file.symbol.globalExports, file.symbol, node, 2097152 /* Alias */, 2097152 /* AliasExcludes */);
}
}
function bindExportDeclaration(node) {
if (!container.symbol || !container.symbol.exports) {
// Export * in some sort of block construct
bindAnonymousDeclaration(node, 8388608 /* ExportStar */, getDeclarationName(node));
}
else if (!node.exportClause) {
// All export * declarations are collected in an __export symbol
declareSymbol(container.symbol.exports, container.symbol, node, 8388608 /* ExportStar */, 0 /* None */);
}
else if (ts.isNamespaceExport(node.exportClause)) {
// declareSymbol walks up parents to find name text, parent _must_ be set
// but won't be set by the normal binder walk until `bindChildren` later on.
ts.setParent(node.exportClause, node);
declareSymbol(container.symbol.exports, container.symbol, node.exportClause, 2097152 /* Alias */, 2097152 /* AliasExcludes */);
}
}
function bindImportClause(node) {
if (node.name) {
declareSymbolAndAddToSymbolTable(node, 2097152 /* Alias */, 2097152 /* AliasExcludes */);
}
}
function setCommonJsModuleIndicator(node) {
if (file.externalModuleIndicator) {
return false;
}
if (!file.commonJsModuleIndicator) {
file.commonJsModuleIndicator = node;
bindSourceFileAsExternalModule();
}
return true;
}
function bindObjectDefinePropertyExport(node) {
if (!setCommonJsModuleIndicator(node)) {
return;
}
var symbol = forEachIdentifierInEntityName(node.arguments[0], /*parent*/ undefined, function (id, symbol) {
if (symbol) {
addDeclarationToSymbol(symbol, id, 1536 /* Module */ | 67108864 /* Assignment */);
}
return symbol;
});
if (symbol) {
var flags = 4 /* Property */ | 1048576 /* ExportValue */;
declareSymbol(symbol.exports, symbol, node, flags, 0 /* None */);
}
}
function bindExportsPropertyAssignment(node) {
// When we create a property via 'exports.foo = bar', the 'exports.foo' property access
// expression is the declaration
if (!setCommonJsModuleIndicator(node)) {
return;
}
var symbol = forEachIdentifierInEntityName(node.left.expression, /*parent*/ undefined, function (id, symbol) {
if (symbol) {
addDeclarationToSymbol(symbol, id, 1536 /* Module */ | 67108864 /* Assignment */);
}
return symbol;
});
if (symbol) {
var isAlias = ts.isAliasableExpression(node.right) && (ts.isExportsIdentifier(node.left.expression) || ts.isModuleExportsAccessExpression(node.left.expression));
var flags = isAlias ? 2097152 /* Alias */ : 4 /* Property */ | 1048576 /* ExportValue */;
ts.setParent(node.left, node);
declareSymbol(symbol.exports, symbol, node.left, flags, 0 /* None */);
}
}
function bindModuleExportsAssignment(node) {
// A common practice in node modules is to set 'export = module.exports = {}', this ensures that 'exports'
// is still pointing to 'module.exports'.
// We do not want to consider this as 'export=' since a module can have only one of these.
// Similarly we do not want to treat 'module.exports = exports' as an 'export='.
if (!setCommonJsModuleIndicator(node)) {
return;
}
var assignedExpression = ts.getRightMostAssignedExpression(node.right);
if (ts.isEmptyObjectLiteral(assignedExpression) || container === file && isExportsOrModuleExportsOrAlias(file, assignedExpression)) {
return;
}
if (ts.isObjectLiteralExpression(assignedExpression) && ts.every(assignedExpression.properties, ts.isShorthandPropertyAssignment)) {
ts.forEach(assignedExpression.properties, bindExportAssignedObjectMemberAlias);
return;
}
// 'module.exports = expr' assignment
var flags = ts.exportAssignmentIsAlias(node)
? 2097152 /* Alias */
: 4 /* Property */ | 1048576 /* ExportValue */ | 512 /* ValueModule */;
var symbol = declareSymbol(file.symbol.exports, file.symbol, node, flags | 67108864 /* Assignment */, 0 /* None */);
ts.setValueDeclaration(symbol, node);
}
function bindExportAssignedObjectMemberAlias(node) {
declareSymbol(file.symbol.exports, file.symbol, node, 2097152 /* Alias */ | 67108864 /* Assignment */, 0 /* None */);
}
function bindThisPropertyAssignment(node) {
ts.Debug.assert(ts.isInJSFile(node));
// private identifiers *must* be declared (even in JS files)
var hasPrivateIdentifier = (ts.isBinaryExpression(node) && ts.isPropertyAccessExpression(node.left) && ts.isPrivateIdentifier(node.left.name))
|| (ts.isPropertyAccessExpression(node) && ts.isPrivateIdentifier(node.name));
if (hasPrivateIdentifier) {
return;
}
var thisContainer = ts.getThisContainer(node, /*includeArrowFunctions*/ false);
switch (thisContainer.kind) {
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
var constructorSymbol = thisContainer.symbol;
// For `f.prototype.m = function() { this.x = 0; }`, `this.x = 0` should modify `f`'s members, not the function expression.
if (ts.isBinaryExpression(thisContainer.parent) && thisContainer.parent.operatorToken.kind === 63 /* EqualsToken */) {
var l = thisContainer.parent.left;
if (ts.isBindableStaticAccessExpression(l) && ts.isPrototypeAccess(l.expression)) {
constructorSymbol = lookupSymbolForPropertyAccess(l.expression.expression, thisParentContainer);
}
}
if (constructorSymbol && constructorSymbol.valueDeclaration) {
// Declare a 'member' if the container is an ES5 class or ES6 constructor
constructorSymbol.members = constructorSymbol.members || ts.createSymbolTable();
// It's acceptable for multiple 'this' assignments of the same identifier to occur
if (ts.hasDynamicName(node)) {
bindDynamicallyNamedThisPropertyAssignment(node, constructorSymbol, constructorSymbol.members);
}
else {
declareSymbol(constructorSymbol.members, constructorSymbol, node, 4 /* Property */ | 67108864 /* Assignment */, 0 /* PropertyExcludes */ & ~4 /* Property */);
}
addDeclarationToSymbol(constructorSymbol, constructorSymbol.valueDeclaration, 32 /* Class */);
}
break;
case 169 /* Constructor */:
case 165 /* PropertyDeclaration */:
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
// this.foo assignment in a JavaScript class
// Bind this property to the containing class
var containingClass = thisContainer.parent;
var symbolTable = ts.isStatic(thisContainer) ? containingClass.symbol.exports : containingClass.symbol.members;
if (ts.hasDynamicName(node)) {
bindDynamicallyNamedThisPropertyAssignment(node, containingClass.symbol, symbolTable);
}
else {
declareSymbol(symbolTable, containingClass.symbol, node, 4 /* Property */ | 67108864 /* Assignment */, 0 /* None */, /*isReplaceableByMethod*/ true);
}
break;
case 300 /* SourceFile */:
// this.property = assignment in a source file -- declare symbol in exports for a module, in locals for a script
if (ts.hasDynamicName(node)) {
break;
}
else if (thisContainer.commonJsModuleIndicator) {
declareSymbol(thisContainer.symbol.exports, thisContainer.symbol, node, 4 /* Property */ | 1048576 /* ExportValue */, 0 /* None */);
}
else {
declareSymbolAndAddToSymbolTable(node, 1 /* FunctionScopedVariable */, 111550 /* FunctionScopedVariableExcludes */);
}
break;
default:
ts.Debug.failBadSyntaxKind(thisContainer);
}
}
function bindDynamicallyNamedThisPropertyAssignment(node, symbol, symbolTable) {
declareSymbol(symbolTable, symbol, node, 4 /* Property */, 0 /* None */, /*isReplaceableByMethod*/ true, /*isComputedName*/ true);
addLateBoundAssignmentDeclarationToSymbol(node, symbol);
}
function addLateBoundAssignmentDeclarationToSymbol(node, symbol) {
if (symbol) {
(symbol.assignmentDeclarationMembers || (symbol.assignmentDeclarationMembers = new ts.Map())).set(ts.getNodeId(node), node);
}
}
function bindSpecialPropertyDeclaration(node) {
if (node.expression.kind === 108 /* ThisKeyword */) {
bindThisPropertyAssignment(node);
}
else if (ts.isBindableStaticAccessExpression(node) && node.parent.parent.kind === 300 /* SourceFile */) {
if (ts.isPrototypeAccess(node.expression)) {
bindPrototypePropertyAssignment(node, node.parent);
}
else {
bindStaticPropertyAssignment(node);
}
}
}
/** For `x.prototype = { p, ... }`, declare members p,... if `x` is function/class/{}, or not declared. */
function bindPrototypeAssignment(node) {
ts.setParent(node.left, node);
ts.setParent(node.right, node);
bindPropertyAssignment(node.left.expression, node.left, /*isPrototypeProperty*/ false, /*containerIsClass*/ true);
}
function bindObjectDefinePrototypeProperty(node) {
var namespaceSymbol = lookupSymbolForPropertyAccess(node.arguments[0].expression);
if (namespaceSymbol && namespaceSymbol.valueDeclaration) {
// Ensure the namespace symbol becomes class-like
addDeclarationToSymbol(namespaceSymbol, namespaceSymbol.valueDeclaration, 32 /* Class */);
}
bindPotentiallyNewExpandoMemberToNamespace(node, namespaceSymbol, /*isPrototypeProperty*/ true);
}
/**
* For `x.prototype.y = z`, declare a member `y` on `x` if `x` is a function or class, or not declared.
* Note that jsdoc preceding an ExpressionStatement like `x.prototype.y;` is also treated as a declaration.
*/
function bindPrototypePropertyAssignment(lhs, parent) {
// Look up the function in the local scope, since prototype assignments should
// follow the function declaration
var classPrototype = lhs.expression;
var constructorFunction = classPrototype.expression;
// Fix up parent pointers since we're going to use these nodes before we bind into them
ts.setParent(constructorFunction, classPrototype);
ts.setParent(classPrototype, lhs);
ts.setParent(lhs, parent);
bindPropertyAssignment(constructorFunction, lhs, /*isPrototypeProperty*/ true, /*containerIsClass*/ true);
}
function bindObjectDefinePropertyAssignment(node) {
var namespaceSymbol = lookupSymbolForPropertyAccess(node.arguments[0]);
var isToplevel = node.parent.parent.kind === 300 /* SourceFile */;
namespaceSymbol = bindPotentiallyMissingNamespaces(namespaceSymbol, node.arguments[0], isToplevel, /*isPrototypeProperty*/ false, /*containerIsClass*/ false);
bindPotentiallyNewExpandoMemberToNamespace(node, namespaceSymbol, /*isPrototypeProperty*/ false);
}
function bindSpecialPropertyAssignment(node) {
var _a;
// Class declarations in Typescript do not allow property declarations
var parentSymbol = lookupSymbolForPropertyAccess(node.left.expression, container) || lookupSymbolForPropertyAccess(node.left.expression, blockScopeContainer);
if (!ts.isInJSFile(node) && !ts.isFunctionSymbol(parentSymbol)) {
return;
}
var rootExpr = ts.getLeftmostAccessExpression(node.left);
if (ts.isIdentifier(rootExpr) && ((_a = lookupSymbolForName(container, rootExpr.escapedText)) === null || _a === void 0 ? void 0 : _a.flags) & 2097152 /* Alias */) {
return;
}
// Fix up parent pointers since we're going to use these nodes before we bind into them
ts.setParent(node.left, node);
ts.setParent(node.right, node);
if (ts.isIdentifier(node.left.expression) && container === file && isExportsOrModuleExportsOrAlias(file, node.left.expression)) {
// This can be an alias for the 'exports' or 'module.exports' names, e.g.
// var util = module.exports;
// util.property = function ...
bindExportsPropertyAssignment(node);
}
else if (ts.hasDynamicName(node)) {
bindAnonymousDeclaration(node, 4 /* Property */ | 67108864 /* Assignment */, "__computed" /* Computed */);
var sym = bindPotentiallyMissingNamespaces(parentSymbol, node.left.expression, isTopLevelNamespaceAssignment(node.left), /*isPrototype*/ false, /*containerIsClass*/ false);
addLateBoundAssignmentDeclarationToSymbol(node, sym);
}
else {
bindStaticPropertyAssignment(ts.cast(node.left, ts.isBindableStaticNameExpression));
}
}
/**
* For nodes like `x.y = z`, declare a member 'y' on 'x' if x is a function (or IIFE) or class or {}, or not declared.
* Also works for expression statements preceded by JSDoc, like / ** @type number * / x.y;
*/
function bindStaticPropertyAssignment(node) {
ts.Debug.assert(!ts.isIdentifier(node));
ts.setParent(node.expression, node);
bindPropertyAssignment(node.expression, node, /*isPrototypeProperty*/ false, /*containerIsClass*/ false);
}
function bindPotentiallyMissingNamespaces(namespaceSymbol, entityName, isToplevel, isPrototypeProperty, containerIsClass) {
if ((namespaceSymbol === null || namespaceSymbol === void 0 ? void 0 : namespaceSymbol.flags) & 2097152 /* Alias */) {
return namespaceSymbol;
}
if (isToplevel && !isPrototypeProperty) {
// make symbols or add declarations for intermediate containers
var flags_2 = 1536 /* Module */ | 67108864 /* Assignment */;
var excludeFlags_1 = 110735 /* ValueModuleExcludes */ & ~67108864 /* Assignment */;
namespaceSymbol = forEachIdentifierInEntityName(entityName, namespaceSymbol, function (id, symbol, parent) {
if (symbol) {
addDeclarationToSymbol(symbol, id, flags_2);
return symbol;
}
else {
var table = parent ? parent.exports :
file.jsGlobalAugmentations || (file.jsGlobalAugmentations = ts.createSymbolTable());
return declareSymbol(table, parent, id, flags_2, excludeFlags_1);
}
});
}
if (containerIsClass && namespaceSymbol && namespaceSymbol.valueDeclaration) {
addDeclarationToSymbol(namespaceSymbol, namespaceSymbol.valueDeclaration, 32 /* Class */);
}
return namespaceSymbol;
}
function bindPotentiallyNewExpandoMemberToNamespace(declaration, namespaceSymbol, isPrototypeProperty) {
if (!namespaceSymbol || !isExpandoSymbol(namespaceSymbol)) {
return;
}
// Set up the members collection if it doesn't exist already
var symbolTable = isPrototypeProperty ?
(namespaceSymbol.members || (namespaceSymbol.members = ts.createSymbolTable())) :
(namespaceSymbol.exports || (namespaceSymbol.exports = ts.createSymbolTable()));
var includes = 0 /* None */;
var excludes = 0 /* None */;
// Method-like
if (ts.isFunctionLikeDeclaration(ts.getAssignedExpandoInitializer(declaration))) {
includes = 8192 /* Method */;
excludes = 103359 /* MethodExcludes */;
}
// Maybe accessor-like
else if (ts.isCallExpression(declaration) && ts.isBindableObjectDefinePropertyCall(declaration)) {
if (ts.some(declaration.arguments[2].properties, function (p) {
var id = ts.getNameOfDeclaration(p);
return !!id && ts.isIdentifier(id) && ts.idText(id) === "set";
})) {
// We mix in `SymbolFLags.Property` so in the checker `getTypeOfVariableParameterOrProperty` is used for this
// symbol, instead of `getTypeOfAccessor` (which will assert as there is no real accessor declaration)
includes |= 65536 /* SetAccessor */ | 4 /* Property */;
excludes |= 78783 /* SetAccessorExcludes */;
}
if (ts.some(declaration.arguments[2].properties, function (p) {
var id = ts.getNameOfDeclaration(p);
return !!id && ts.isIdentifier(id) && ts.idText(id) === "get";
})) {
includes |= 32768 /* GetAccessor */ | 4 /* Property */;
excludes |= 46015 /* GetAccessorExcludes */;
}
}
if (includes === 0 /* None */) {
includes = 4 /* Property */;
excludes = 0 /* PropertyExcludes */;
}
declareSymbol(symbolTable, namespaceSymbol, declaration, includes | 67108864 /* Assignment */, excludes & ~67108864 /* Assignment */);
}
function isTopLevelNamespaceAssignment(propertyAccess) {
return ts.isBinaryExpression(propertyAccess.parent)
? getParentOfBinaryExpression(propertyAccess.parent).parent.kind === 300 /* SourceFile */
: propertyAccess.parent.parent.kind === 300 /* SourceFile */;
}
function bindPropertyAssignment(name, propertyAccess, isPrototypeProperty, containerIsClass) {
var namespaceSymbol = lookupSymbolForPropertyAccess(name, container) || lookupSymbolForPropertyAccess(name, blockScopeContainer);
var isToplevel = isTopLevelNamespaceAssignment(propertyAccess);
namespaceSymbol = bindPotentiallyMissingNamespaces(namespaceSymbol, propertyAccess.expression, isToplevel, isPrototypeProperty, containerIsClass);
bindPotentiallyNewExpandoMemberToNamespace(propertyAccess, namespaceSymbol, isPrototypeProperty);
}
/**
* Javascript expando values are:
* - Functions
* - classes
* - namespaces
* - variables initialized with function expressions
* - with class expressions
* - with empty object literals
* - with non-empty object literals if assigned to the prototype property
*/
function isExpandoSymbol(symbol) {
if (symbol.flags & (16 /* Function */ | 32 /* Class */ | 1024 /* NamespaceModule */)) {
return true;
}
var node = symbol.valueDeclaration;
if (node && ts.isCallExpression(node)) {
return !!ts.getAssignedExpandoInitializer(node);
}
var init = !node ? undefined :
ts.isVariableDeclaration(node) ? node.initializer :
ts.isBinaryExpression(node) ? node.right :
ts.isPropertyAccessExpression(node) && ts.isBinaryExpression(node.parent) ? node.parent.right :
undefined;
init = init && ts.getRightMostAssignedExpression(init);
if (init) {
var isPrototypeAssignment = ts.isPrototypeAccess(ts.isVariableDeclaration(node) ? node.name : ts.isBinaryExpression(node) ? node.left : node);
return !!ts.getExpandoInitializer(ts.isBinaryExpression(init) && (init.operatorToken.kind === 56 /* BarBarToken */ || init.operatorToken.kind === 60 /* QuestionQuestionToken */) ? init.right : init, isPrototypeAssignment);
}
return false;
}
function getParentOfBinaryExpression(expr) {
while (ts.isBinaryExpression(expr.parent)) {
expr = expr.parent;
}
return expr.parent;
}
function lookupSymbolForPropertyAccess(node, lookupContainer) {
if (lookupContainer === void 0) { lookupContainer = container; }
if (ts.isIdentifier(node)) {
return lookupSymbolForName(lookupContainer, node.escapedText);
}
else {
var symbol = lookupSymbolForPropertyAccess(node.expression);
return symbol && symbol.exports && symbol.exports.get(ts.getElementOrPropertyAccessName(node));
}
}
function forEachIdentifierInEntityName(e, parent, action) {
if (isExportsOrModuleExportsOrAlias(file, e)) {
return file.symbol;
}
else if (ts.isIdentifier(e)) {
return action(e, lookupSymbolForPropertyAccess(e), parent);
}
else {
var s = forEachIdentifierInEntityName(e.expression, parent, action);
var name = ts.getNameOrArgument(e);
// unreachable
if (ts.isPrivateIdentifier(name)) {
ts.Debug.fail("unexpected PrivateIdentifier");
}
return action(name, s && s.exports && s.exports.get(ts.getElementOrPropertyAccessName(e)), s);
}
}
function bindCallExpression(node) {
// We're only inspecting call expressions to detect CommonJS modules, so we can skip
// this check if we've already seen the module indicator
if (!file.commonJsModuleIndicator && ts.isRequireCall(node, /*checkArgumentIsStringLiteralLike*/ false)) {
setCommonJsModuleIndicator(node);
}
}
function bindClassLikeDeclaration(node) {
if (node.kind === 255 /* ClassDeclaration */) {
bindBlockScopedDeclaration(node, 32 /* Class */, 899503 /* ClassExcludes */);
}
else {
var bindingName = node.name ? node.name.escapedText : "__class" /* Class */;
bindAnonymousDeclaration(node, 32 /* Class */, bindingName);
// Add name of class expression into the map for semantic classifier
if (node.name) {
classifiableNames.add(node.name.escapedText);
}
}
var symbol = node.symbol;
// TypeScript 1.0 spec (April 2014): 8.4
// Every class automatically contains a static property member named 'prototype', the
// type of which is an instantiation of the class type with type Any supplied as a type
// argument for each type parameter. It is an error to explicitly declare a static
// property member with the name 'prototype'.
//
// Note: we check for this here because this class may be merging into a module. The
// module might have an exported variable called 'prototype'. We can't allow that as
// that would clash with the built-in 'prototype' for the class.
var prototypeSymbol = createSymbol(4 /* Property */ | 4194304 /* Prototype */, "prototype");
var symbolExport = symbol.exports.get(prototypeSymbol.escapedName);
if (symbolExport) {
if (node.name) {
ts.setParent(node.name, node);
}
file.bindDiagnostics.push(createDiagnosticForNode(symbolExport.declarations[0], ts.Diagnostics.Duplicate_identifier_0, ts.symbolName(prototypeSymbol)));
}
symbol.exports.set(prototypeSymbol.escapedName, prototypeSymbol);
prototypeSymbol.parent = symbol;
}
function bindEnumDeclaration(node) {
return ts.isEnumConst(node)
? bindBlockScopedDeclaration(node, 128 /* ConstEnum */, 899967 /* ConstEnumExcludes */)
: bindBlockScopedDeclaration(node, 256 /* RegularEnum */, 899327 /* RegularEnumExcludes */);
}
function bindVariableDeclarationOrBindingElement(node) {
if (inStrictMode) {
checkStrictModeEvalOrArguments(node, node.name);
}
if (!ts.isBindingPattern(node.name)) {
if (ts.isInJSFile(node) && ts.isRequireVariableDeclaration(node) && !ts.getJSDocTypeTag(node)) {
declareSymbolAndAddToSymbolTable(node, 2097152 /* Alias */, 2097152 /* AliasExcludes */);
}
else if (ts.isBlockOrCatchScoped(node)) {
bindBlockScopedDeclaration(node, 2 /* BlockScopedVariable */, 111551 /* BlockScopedVariableExcludes */);
}
else if (ts.isParameterDeclaration(node)) {
// It is safe to walk up parent chain to find whether the node is a destructuring parameter declaration
// because its parent chain has already been set up, since parents are set before descending into children.
//
// If node is a binding element in parameter declaration, we need to use ParameterExcludes.
// Using ParameterExcludes flag allows the compiler to report an error on duplicate identifiers in Parameter Declaration
// For example:
// function foo([a,a]) {} // Duplicate Identifier error
// function bar(a,a) {} // Duplicate Identifier error, parameter declaration in this case is handled in bindParameter
// // which correctly set excluded symbols
declareSymbolAndAddToSymbolTable(node, 1 /* FunctionScopedVariable */, 111551 /* ParameterExcludes */);
}
else {
declareSymbolAndAddToSymbolTable(node, 1 /* FunctionScopedVariable */, 111550 /* FunctionScopedVariableExcludes */);
}
}
}
function bindParameter(node) {
if (node.kind === 335 /* JSDocParameterTag */ && container.kind !== 318 /* JSDocSignature */) {
return;
}
if (inStrictMode && !(node.flags & 8388608 /* Ambient */)) {
// It is a SyntaxError if the identifier eval or arguments appears within a FormalParameterList of a
// strict mode FunctionLikeDeclaration or FunctionExpression(13.1)
checkStrictModeEvalOrArguments(node, node.name);
}
if (ts.isBindingPattern(node.name)) {
bindAnonymousDeclaration(node, 1 /* FunctionScopedVariable */, "__" + node.parent.parameters.indexOf(node));
}
else {
declareSymbolAndAddToSymbolTable(node, 1 /* FunctionScopedVariable */, 111551 /* ParameterExcludes */);
}
// If this is a property-parameter, then also declare the property symbol into the
// containing class.
if (ts.isParameterPropertyDeclaration(node, node.parent)) {
var classDeclaration = node.parent.parent;
declareSymbol(classDeclaration.symbol.members, classDeclaration.symbol, node, 4 /* Property */ | (node.questionToken ? 16777216 /* Optional */ : 0 /* None */), 0 /* PropertyExcludes */);
}
}
function bindFunctionDeclaration(node) {
if (!file.isDeclarationFile && !(node.flags & 8388608 /* Ambient */)) {
if (ts.isAsyncFunction(node)) {
emitFlags |= 2048 /* HasAsyncFunctions */;
}
}
checkStrictModeFunctionName(node);
if (inStrictMode) {
checkStrictModeFunctionDeclaration(node);
bindBlockScopedDeclaration(node, 16 /* Function */, 110991 /* FunctionExcludes */);
}
else {
declareSymbolAndAddToSymbolTable(node, 16 /* Function */, 110991 /* FunctionExcludes */);
}
}
function bindFunctionExpression(node) {
if (!file.isDeclarationFile && !(node.flags & 8388608 /* Ambient */)) {
if (ts.isAsyncFunction(node)) {
emitFlags |= 2048 /* HasAsyncFunctions */;
}
}
if (currentFlow) {
node.flowNode = currentFlow;
}
checkStrictModeFunctionName(node);
var bindingName = node.name ? node.name.escapedText : "__function" /* Function */;
return bindAnonymousDeclaration(node, 16 /* Function */, bindingName);
}
function bindPropertyOrMethodOrAccessor(node, symbolFlags, symbolExcludes) {
if (!file.isDeclarationFile && !(node.flags & 8388608 /* Ambient */) && ts.isAsyncFunction(node)) {
emitFlags |= 2048 /* HasAsyncFunctions */;
}
if (currentFlow && ts.isObjectLiteralOrClassExpressionMethod(node)) {
node.flowNode = currentFlow;
}
return ts.hasDynamicName(node)
? bindAnonymousDeclaration(node, symbolFlags, "__computed" /* Computed */)
: declareSymbolAndAddToSymbolTable(node, symbolFlags, symbolExcludes);
}
function getInferTypeContainer(node) {
var extendsType = ts.findAncestor(node, function (n) { return n.parent && ts.isConditionalTypeNode(n.parent) && n.parent.extendsType === n; });
return extendsType && extendsType.parent;
}
function bindTypeParameter(node) {
if (ts.isJSDocTemplateTag(node.parent)) {
var container_1 = ts.find(node.parent.parent.tags, ts.isJSDocTypeAlias) || ts.getHostSignatureFromJSDoc(node.parent); // TODO: GH#18217
if (container_1) {
if (!container_1.locals) {
container_1.locals = ts.createSymbolTable();
}
declareSymbol(container_1.locals, /*parent*/ undefined, node, 262144 /* TypeParameter */, 526824 /* TypeParameterExcludes */);
}
else {
declareSymbolAndAddToSymbolTable(node, 262144 /* TypeParameter */, 526824 /* TypeParameterExcludes */);
}
}
else if (node.parent.kind === 188 /* InferType */) {
var container_2 = getInferTypeContainer(node.parent);
if (container_2) {
if (!container_2.locals) {
container_2.locals = ts.createSymbolTable();
}
declareSymbol(container_2.locals, /*parent*/ undefined, node, 262144 /* TypeParameter */, 526824 /* TypeParameterExcludes */);
}
else {
bindAnonymousDeclaration(node, 262144 /* TypeParameter */, getDeclarationName(node)); // TODO: GH#18217
}
}
else {
declareSymbolAndAddToSymbolTable(node, 262144 /* TypeParameter */, 526824 /* TypeParameterExcludes */);
}
}
// reachability checks
function shouldReportErrorOnModuleDeclaration(node) {
var instanceState = getModuleInstanceState(node);
return instanceState === 1 /* Instantiated */ || (instanceState === 2 /* ConstEnumOnly */ && ts.shouldPreserveConstEnums(options));
}
function checkUnreachable(node) {
if (!(currentFlow.flags & 1 /* Unreachable */)) {
return false;
}
if (currentFlow === unreachableFlow) {
var reportError =
// report error on all statements except empty ones
(ts.isStatementButNotDeclaration(node) && node.kind !== 234 /* EmptyStatement */) ||
// report error on class declarations
node.kind === 255 /* ClassDeclaration */ ||
// report error on instantiated modules or const-enums only modules if preserveConstEnums is set
(node.kind === 259 /* ModuleDeclaration */ && shouldReportErrorOnModuleDeclaration(node));
if (reportError) {
currentFlow = reportedUnreachableFlow;
if (!options.allowUnreachableCode) {
// unreachable code is reported if
// - user has explicitly asked about it AND
// - statement is in not ambient context (statements in ambient context is already an error
// so we should not report extras) AND
// - node is not variable statement OR
// - node is block scoped variable statement OR
// - node is not block scoped variable statement and at least one variable declaration has initializer
// Rationale: we don't want to report errors on non-initialized var's since they are hoisted
// On the other side we do want to report errors on non-initialized 'lets' because of TDZ
var isError_1 = ts.unreachableCodeIsError(options) &&
!(node.flags & 8388608 /* Ambient */) &&
(!ts.isVariableStatement(node) ||
!!(ts.getCombinedNodeFlags(node.declarationList) & 3 /* BlockScoped */) ||
node.declarationList.declarations.some(function (d) { return !!d.initializer; }));
eachUnreachableRange(node, function (start, end) { return errorOrSuggestionOnRange(isError_1, start, end, ts.Diagnostics.Unreachable_code_detected); });
}
}
}
return true;
}
}
function eachUnreachableRange(node, cb) {
if (ts.isStatement(node) && isExecutableStatement(node) && ts.isBlock(node.parent)) {
var statements = node.parent.statements;
var slice_1 = ts.sliceAfter(statements, node);
ts.getRangesWhere(slice_1, isExecutableStatement, function (start, afterEnd) { return cb(slice_1[start], slice_1[afterEnd - 1]); });
}
else {
cb(node, node);
}
}
// As opposed to a pure declaration like an `interface`
function isExecutableStatement(s) {
// Don't remove statements that can validly be used before they appear.
return !ts.isFunctionDeclaration(s) && !isPurelyTypeDeclaration(s) && !ts.isEnumDeclaration(s) &&
// `var x;` may declare a variable used above
!(ts.isVariableStatement(s) && !(ts.getCombinedNodeFlags(s) & (1 /* Let */ | 2 /* Const */)) && s.declarationList.declarations.some(function (d) { return !d.initializer; }));
}
function isPurelyTypeDeclaration(s) {
switch (s.kind) {
case 256 /* InterfaceDeclaration */:
case 257 /* TypeAliasDeclaration */:
return true;
case 259 /* ModuleDeclaration */:
return getModuleInstanceState(s) !== 1 /* Instantiated */;
case 258 /* EnumDeclaration */:
return ts.hasSyntacticModifier(s, 2048 /* Const */);
default:
return false;
}
}
function isExportsOrModuleExportsOrAlias(sourceFile, node) {
var i = 0;
var q = [node];
while (q.length && i < 100) {
i++;
node = q.shift();
if (ts.isExportsIdentifier(node) || ts.isModuleExportsAccessExpression(node)) {
return true;
}
else if (ts.isIdentifier(node)) {
var symbol = lookupSymbolForName(sourceFile, node.escapedText);
if (!!symbol && !!symbol.valueDeclaration && ts.isVariableDeclaration(symbol.valueDeclaration) && !!symbol.valueDeclaration.initializer) {
var init = symbol.valueDeclaration.initializer;
q.push(init);
if (ts.isAssignmentExpression(init, /*excludeCompoundAssignment*/ true)) {
q.push(init.left);
q.push(init.right);
}
}
}
}
return false;
}
ts.isExportsOrModuleExportsOrAlias = isExportsOrModuleExportsOrAlias;
function lookupSymbolForName(container, name) {
var local = container.locals && container.locals.get(name);
if (local) {
return local.exportSymbol || local;
}
if (ts.isSourceFile(container) && container.jsGlobalAugmentations && container.jsGlobalAugmentations.has(name)) {
return container.jsGlobalAugmentations.get(name);
}
return container.symbol && container.symbol.exports && container.symbol.exports.get(name);
}
})(ts || (ts = {}));
/** @internal */
var ts;
(function (ts) {
function createGetSymbolWalker(getRestTypeOfSignature, getTypePredicateOfSignature, getReturnTypeOfSignature, getBaseTypes, resolveStructuredTypeMembers, getTypeOfSymbol, getResolvedSymbol, getConstraintOfTypeParameter, getFirstIdentifier, getTypeArguments) {
return getSymbolWalker;
function getSymbolWalker(accept) {
if (accept === void 0) { accept = function () { return true; }; }
var visitedTypes = []; // Sparse array from id to type
var visitedSymbols = []; // Sparse array from id to symbol
return {
walkType: function (type) {
try {
visitType(type);
return { visitedTypes: ts.getOwnValues(visitedTypes), visitedSymbols: ts.getOwnValues(visitedSymbols) };
}
finally {
ts.clear(visitedTypes);
ts.clear(visitedSymbols);
}
},
walkSymbol: function (symbol) {
try {
visitSymbol(symbol);
return { visitedTypes: ts.getOwnValues(visitedTypes), visitedSymbols: ts.getOwnValues(visitedSymbols) };
}
finally {
ts.clear(visitedTypes);
ts.clear(visitedSymbols);
}
},
};
function visitType(type) {
if (!type) {
return;
}
if (visitedTypes[type.id]) {
return;
}
visitedTypes[type.id] = type;
// Reuse visitSymbol to visit the type's symbol,
// but be sure to bail on recuring into the type if accept declines the symbol.
var shouldBail = visitSymbol(type.symbol);
if (shouldBail)
return;
// Visit the type's related types, if any
if (type.flags & 524288 /* Object */) {
var objectType = type;
var objectFlags = objectType.objectFlags;
if (objectFlags & 4 /* Reference */) {
visitTypeReference(type);
}
if (objectFlags & 32 /* Mapped */) {
visitMappedType(type);
}
if (objectFlags & (1 /* Class */ | 2 /* Interface */)) {
visitInterfaceType(type);
}
if (objectFlags & (8 /* Tuple */ | 16 /* Anonymous */)) {
visitObjectType(objectType);
}
}
if (type.flags & 262144 /* TypeParameter */) {
visitTypeParameter(type);
}
if (type.flags & 3145728 /* UnionOrIntersection */) {
visitUnionOrIntersectionType(type);
}
if (type.flags & 4194304 /* Index */) {
visitIndexType(type);
}
if (type.flags & 8388608 /* IndexedAccess */) {
visitIndexedAccessType(type);
}
}
function visitTypeReference(type) {
visitType(type.target);
ts.forEach(getTypeArguments(type), visitType);
}
function visitTypeParameter(type) {
visitType(getConstraintOfTypeParameter(type));
}
function visitUnionOrIntersectionType(type) {
ts.forEach(type.types, visitType);
}
function visitIndexType(type) {
visitType(type.type);
}
function visitIndexedAccessType(type) {
visitType(type.objectType);
visitType(type.indexType);
visitType(type.constraint);
}
function visitMappedType(type) {
visitType(type.typeParameter);
visitType(type.constraintType);
visitType(type.templateType);
visitType(type.modifiersType);
}
function visitSignature(signature) {
var typePredicate = getTypePredicateOfSignature(signature);
if (typePredicate) {
visitType(typePredicate.type);
}
ts.forEach(signature.typeParameters, visitType);
for (var _i = 0, _a = signature.parameters; _i < _a.length; _i++) {
var parameter = _a[_i];
visitSymbol(parameter);
}
visitType(getRestTypeOfSignature(signature));
visitType(getReturnTypeOfSignature(signature));
}
function visitInterfaceType(interfaceT) {
visitObjectType(interfaceT);
ts.forEach(interfaceT.typeParameters, visitType);
ts.forEach(getBaseTypes(interfaceT), visitType);
visitType(interfaceT.thisType);
}
function visitObjectType(type) {
var resolved = resolveStructuredTypeMembers(type);
for (var _i = 0, _a = resolved.indexInfos; _i < _a.length; _i++) {
var info = _a[_i];
visitType(info.keyType);
visitType(info.type);
}
for (var _b = 0, _c = resolved.callSignatures; _b < _c.length; _b++) {
var signature = _c[_b];
visitSignature(signature);
}
for (var _d = 0, _e = resolved.constructSignatures; _d < _e.length; _d++) {
var signature = _e[_d];
visitSignature(signature);
}
for (var _f = 0, _g = resolved.properties; _f < _g.length; _f++) {
var p = _g[_f];
visitSymbol(p);
}
}
function visitSymbol(symbol) {
if (!symbol) {
return false;
}
var symbolId = ts.getSymbolId(symbol);
if (visitedSymbols[symbolId]) {
return false;
}
visitedSymbols[symbolId] = symbol;
if (!accept(symbol)) {
return true;
}
var t = getTypeOfSymbol(symbol);
visitType(t); // Should handle members on classes and such
if (symbol.exports) {
symbol.exports.forEach(visitSymbol);
}
ts.forEach(symbol.declarations, function (d) {
// Type queries are too far resolved when we just visit the symbol's type
// (their type resolved directly to the member deeply referenced)
// So to get the intervening symbols, we need to check if there's a type
// query node on any of the symbol's declarations and get symbols there
if (d.type && d.type.kind === 179 /* TypeQuery */) {
var query = d.type;
var entity = getResolvedSymbol(getFirstIdentifier(query.exprName));
visitSymbol(entity);
}
});
return false;
}
}
}
ts.createGetSymbolWalker = createGetSymbolWalker;
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
var ambientModuleSymbolRegex = /^".+"$/;
var anon = "(anonymous)";
var nextSymbolId = 1;
var nextNodeId = 1;
var nextMergeId = 1;
var nextFlowId = 1;
var IterationUse;
(function (IterationUse) {
IterationUse[IterationUse["AllowsSyncIterablesFlag"] = 1] = "AllowsSyncIterablesFlag";
IterationUse[IterationUse["AllowsAsyncIterablesFlag"] = 2] = "AllowsAsyncIterablesFlag";
IterationUse[IterationUse["AllowsStringInputFlag"] = 4] = "AllowsStringInputFlag";
IterationUse[IterationUse["ForOfFlag"] = 8] = "ForOfFlag";
IterationUse[IterationUse["YieldStarFlag"] = 16] = "YieldStarFlag";
IterationUse[IterationUse["SpreadFlag"] = 32] = "SpreadFlag";
IterationUse[IterationUse["DestructuringFlag"] = 64] = "DestructuringFlag";
IterationUse[IterationUse["PossiblyOutOfBounds"] = 128] = "PossiblyOutOfBounds";
// Spread, Destructuring, Array element assignment
IterationUse[IterationUse["Element"] = 1] = "Element";
IterationUse[IterationUse["Spread"] = 33] = "Spread";
IterationUse[IterationUse["Destructuring"] = 65] = "Destructuring";
IterationUse[IterationUse["ForOf"] = 13] = "ForOf";
IterationUse[IterationUse["ForAwaitOf"] = 15] = "ForAwaitOf";
IterationUse[IterationUse["YieldStar"] = 17] = "YieldStar";
IterationUse[IterationUse["AsyncYieldStar"] = 19] = "AsyncYieldStar";
IterationUse[IterationUse["GeneratorReturnType"] = 1] = "GeneratorReturnType";
IterationUse[IterationUse["AsyncGeneratorReturnType"] = 2] = "AsyncGeneratorReturnType";
})(IterationUse || (IterationUse = {}));
var IterationTypeKind;
(function (IterationTypeKind) {
IterationTypeKind[IterationTypeKind["Yield"] = 0] = "Yield";
IterationTypeKind[IterationTypeKind["Return"] = 1] = "Return";
IterationTypeKind[IterationTypeKind["Next"] = 2] = "Next";
})(IterationTypeKind || (IterationTypeKind = {}));
var WideningKind;
(function (WideningKind) {
WideningKind[WideningKind["Normal"] = 0] = "Normal";
WideningKind[WideningKind["FunctionReturn"] = 1] = "FunctionReturn";
WideningKind[WideningKind["GeneratorNext"] = 2] = "GeneratorNext";
WideningKind[WideningKind["GeneratorYield"] = 3] = "GeneratorYield";
})(WideningKind || (WideningKind = {}));
var TypeFacts;
(function (TypeFacts) {
TypeFacts[TypeFacts["None"] = 0] = "None";
TypeFacts[TypeFacts["TypeofEQString"] = 1] = "TypeofEQString";
TypeFacts[TypeFacts["TypeofEQNumber"] = 2] = "TypeofEQNumber";
TypeFacts[TypeFacts["TypeofEQBigInt"] = 4] = "TypeofEQBigInt";
TypeFacts[TypeFacts["TypeofEQBoolean"] = 8] = "TypeofEQBoolean";
TypeFacts[TypeFacts["TypeofEQSymbol"] = 16] = "TypeofEQSymbol";
TypeFacts[TypeFacts["TypeofEQObject"] = 32] = "TypeofEQObject";
TypeFacts[TypeFacts["TypeofEQFunction"] = 64] = "TypeofEQFunction";
TypeFacts[TypeFacts["TypeofEQHostObject"] = 128] = "TypeofEQHostObject";
TypeFacts[TypeFacts["TypeofNEString"] = 256] = "TypeofNEString";
TypeFacts[TypeFacts["TypeofNENumber"] = 512] = "TypeofNENumber";
TypeFacts[TypeFacts["TypeofNEBigInt"] = 1024] = "TypeofNEBigInt";
TypeFacts[TypeFacts["TypeofNEBoolean"] = 2048] = "TypeofNEBoolean";
TypeFacts[TypeFacts["TypeofNESymbol"] = 4096] = "TypeofNESymbol";
TypeFacts[TypeFacts["TypeofNEObject"] = 8192] = "TypeofNEObject";
TypeFacts[TypeFacts["TypeofNEFunction"] = 16384] = "TypeofNEFunction";
TypeFacts[TypeFacts["TypeofNEHostObject"] = 32768] = "TypeofNEHostObject";
TypeFacts[TypeFacts["EQUndefined"] = 65536] = "EQUndefined";
TypeFacts[TypeFacts["EQNull"] = 131072] = "EQNull";
TypeFacts[TypeFacts["EQUndefinedOrNull"] = 262144] = "EQUndefinedOrNull";
TypeFacts[TypeFacts["NEUndefined"] = 524288] = "NEUndefined";
TypeFacts[TypeFacts["NENull"] = 1048576] = "NENull";
TypeFacts[TypeFacts["NEUndefinedOrNull"] = 2097152] = "NEUndefinedOrNull";
TypeFacts[TypeFacts["Truthy"] = 4194304] = "Truthy";
TypeFacts[TypeFacts["Falsy"] = 8388608] = "Falsy";
TypeFacts[TypeFacts["All"] = 16777215] = "All";
// The following members encode facts about particular kinds of types for use in the getTypeFacts function.
// The presence of a particular fact means that the given test is true for some (and possibly all) values
// of that kind of type.
TypeFacts[TypeFacts["BaseStringStrictFacts"] = 3735041] = "BaseStringStrictFacts";
TypeFacts[TypeFacts["BaseStringFacts"] = 12582401] = "BaseStringFacts";
TypeFacts[TypeFacts["StringStrictFacts"] = 16317953] = "StringStrictFacts";
TypeFacts[TypeFacts["StringFacts"] = 16776705] = "StringFacts";
TypeFacts[TypeFacts["EmptyStringStrictFacts"] = 12123649] = "EmptyStringStrictFacts";
TypeFacts[TypeFacts["EmptyStringFacts"] = 12582401] = "EmptyStringFacts";
TypeFacts[TypeFacts["NonEmptyStringStrictFacts"] = 7929345] = "NonEmptyStringStrictFacts";
TypeFacts[TypeFacts["NonEmptyStringFacts"] = 16776705] = "NonEmptyStringFacts";
TypeFacts[TypeFacts["BaseNumberStrictFacts"] = 3734786] = "BaseNumberStrictFacts";
TypeFacts[TypeFacts["BaseNumberFacts"] = 12582146] = "BaseNumberFacts";
TypeFacts[TypeFacts["NumberStrictFacts"] = 16317698] = "NumberStrictFacts";
TypeFacts[TypeFacts["NumberFacts"] = 16776450] = "NumberFacts";
TypeFacts[TypeFacts["ZeroNumberStrictFacts"] = 12123394] = "ZeroNumberStrictFacts";
TypeFacts[TypeFacts["ZeroNumberFacts"] = 12582146] = "ZeroNumberFacts";
TypeFacts[TypeFacts["NonZeroNumberStrictFacts"] = 7929090] = "NonZeroNumberStrictFacts";
TypeFacts[TypeFacts["NonZeroNumberFacts"] = 16776450] = "NonZeroNumberFacts";
TypeFacts[TypeFacts["BaseBigIntStrictFacts"] = 3734276] = "BaseBigIntStrictFacts";
TypeFacts[TypeFacts["BaseBigIntFacts"] = 12581636] = "BaseBigIntFacts";
TypeFacts[TypeFacts["BigIntStrictFacts"] = 16317188] = "BigIntStrictFacts";
TypeFacts[TypeFacts["BigIntFacts"] = 16775940] = "BigIntFacts";
TypeFacts[TypeFacts["ZeroBigIntStrictFacts"] = 12122884] = "ZeroBigIntStrictFacts";
TypeFacts[TypeFacts["ZeroBigIntFacts"] = 12581636] = "ZeroBigIntFacts";
TypeFacts[TypeFacts["NonZeroBigIntStrictFacts"] = 7928580] = "NonZeroBigIntStrictFacts";
TypeFacts[TypeFacts["NonZeroBigIntFacts"] = 16775940] = "NonZeroBigIntFacts";
TypeFacts[TypeFacts["BaseBooleanStrictFacts"] = 3733256] = "BaseBooleanStrictFacts";
TypeFacts[TypeFacts["BaseBooleanFacts"] = 12580616] = "BaseBooleanFacts";
TypeFacts[TypeFacts["BooleanStrictFacts"] = 16316168] = "BooleanStrictFacts";
TypeFacts[TypeFacts["BooleanFacts"] = 16774920] = "BooleanFacts";
TypeFacts[TypeFacts["FalseStrictFacts"] = 12121864] = "FalseStrictFacts";
TypeFacts[TypeFacts["FalseFacts"] = 12580616] = "FalseFacts";
TypeFacts[TypeFacts["TrueStrictFacts"] = 7927560] = "TrueStrictFacts";
TypeFacts[TypeFacts["TrueFacts"] = 16774920] = "TrueFacts";
TypeFacts[TypeFacts["SymbolStrictFacts"] = 7925520] = "SymbolStrictFacts";
TypeFacts[TypeFacts["SymbolFacts"] = 16772880] = "SymbolFacts";
TypeFacts[TypeFacts["ObjectStrictFacts"] = 7888800] = "ObjectStrictFacts";
TypeFacts[TypeFacts["ObjectFacts"] = 16736160] = "ObjectFacts";
TypeFacts[TypeFacts["FunctionStrictFacts"] = 7880640] = "FunctionStrictFacts";
TypeFacts[TypeFacts["FunctionFacts"] = 16728000] = "FunctionFacts";
TypeFacts[TypeFacts["UndefinedFacts"] = 9830144] = "UndefinedFacts";
TypeFacts[TypeFacts["NullFacts"] = 9363232] = "NullFacts";
TypeFacts[TypeFacts["EmptyObjectStrictFacts"] = 16318463] = "EmptyObjectStrictFacts";
TypeFacts[TypeFacts["AllTypeofNE"] = 556800] = "AllTypeofNE";
TypeFacts[TypeFacts["EmptyObjectFacts"] = 16777215] = "EmptyObjectFacts";
})(TypeFacts || (TypeFacts = {}));
var typeofEQFacts = new ts.Map(ts.getEntries({
string: 1 /* TypeofEQString */,
number: 2 /* TypeofEQNumber */,
bigint: 4 /* TypeofEQBigInt */,
boolean: 8 /* TypeofEQBoolean */,
symbol: 16 /* TypeofEQSymbol */,
undefined: 65536 /* EQUndefined */,
object: 32 /* TypeofEQObject */,
function: 64 /* TypeofEQFunction */
}));
var typeofNEFacts = new ts.Map(ts.getEntries({
string: 256 /* TypeofNEString */,
number: 512 /* TypeofNENumber */,
bigint: 1024 /* TypeofNEBigInt */,
boolean: 2048 /* TypeofNEBoolean */,
symbol: 4096 /* TypeofNESymbol */,
undefined: 524288 /* NEUndefined */,
object: 8192 /* TypeofNEObject */,
function: 16384 /* TypeofNEFunction */
}));
var TypeSystemPropertyName;
(function (TypeSystemPropertyName) {
TypeSystemPropertyName[TypeSystemPropertyName["Type"] = 0] = "Type";
TypeSystemPropertyName[TypeSystemPropertyName["ResolvedBaseConstructorType"] = 1] = "ResolvedBaseConstructorType";
TypeSystemPropertyName[TypeSystemPropertyName["DeclaredType"] = 2] = "DeclaredType";
TypeSystemPropertyName[TypeSystemPropertyName["ResolvedReturnType"] = 3] = "ResolvedReturnType";
TypeSystemPropertyName[TypeSystemPropertyName["ImmediateBaseConstraint"] = 4] = "ImmediateBaseConstraint";
TypeSystemPropertyName[TypeSystemPropertyName["EnumTagType"] = 5] = "EnumTagType";
TypeSystemPropertyName[TypeSystemPropertyName["ResolvedTypeArguments"] = 6] = "ResolvedTypeArguments";
TypeSystemPropertyName[TypeSystemPropertyName["ResolvedBaseTypes"] = 7] = "ResolvedBaseTypes";
})(TypeSystemPropertyName || (TypeSystemPropertyName = {}));
var CheckMode;
(function (CheckMode) {
CheckMode[CheckMode["Normal"] = 0] = "Normal";
CheckMode[CheckMode["Contextual"] = 1] = "Contextual";
CheckMode[CheckMode["Inferential"] = 2] = "Inferential";
CheckMode[CheckMode["SkipContextSensitive"] = 4] = "SkipContextSensitive";
CheckMode[CheckMode["SkipGenericFunctions"] = 8] = "SkipGenericFunctions";
CheckMode[CheckMode["IsForSignatureHelp"] = 16] = "IsForSignatureHelp";
})(CheckMode || (CheckMode = {}));
var SignatureCheckMode;
(function (SignatureCheckMode) {
SignatureCheckMode[SignatureCheckMode["BivariantCallback"] = 1] = "BivariantCallback";
SignatureCheckMode[SignatureCheckMode["StrictCallback"] = 2] = "StrictCallback";
SignatureCheckMode[SignatureCheckMode["IgnoreReturnTypes"] = 4] = "IgnoreReturnTypes";
SignatureCheckMode[SignatureCheckMode["StrictArity"] = 8] = "StrictArity";
SignatureCheckMode[SignatureCheckMode["Callback"] = 3] = "Callback";
})(SignatureCheckMode || (SignatureCheckMode = {}));
var IntersectionState;
(function (IntersectionState) {
IntersectionState[IntersectionState["None"] = 0] = "None";
IntersectionState[IntersectionState["Source"] = 1] = "Source";
IntersectionState[IntersectionState["Target"] = 2] = "Target";
IntersectionState[IntersectionState["PropertyCheck"] = 4] = "PropertyCheck";
IntersectionState[IntersectionState["UnionIntersectionCheck"] = 8] = "UnionIntersectionCheck";
IntersectionState[IntersectionState["InPropertyCheck"] = 16] = "InPropertyCheck";
})(IntersectionState || (IntersectionState = {}));
var MappedTypeModifiers;
(function (MappedTypeModifiers) {
MappedTypeModifiers[MappedTypeModifiers["IncludeReadonly"] = 1] = "IncludeReadonly";
MappedTypeModifiers[MappedTypeModifiers["ExcludeReadonly"] = 2] = "ExcludeReadonly";
MappedTypeModifiers[MappedTypeModifiers["IncludeOptional"] = 4] = "IncludeOptional";
MappedTypeModifiers[MappedTypeModifiers["ExcludeOptional"] = 8] = "ExcludeOptional";
})(MappedTypeModifiers || (MappedTypeModifiers = {}));
var ExpandingFlags;
(function (ExpandingFlags) {
ExpandingFlags[ExpandingFlags["None"] = 0] = "None";
ExpandingFlags[ExpandingFlags["Source"] = 1] = "Source";
ExpandingFlags[ExpandingFlags["Target"] = 2] = "Target";
ExpandingFlags[ExpandingFlags["Both"] = 3] = "Both";
})(ExpandingFlags || (ExpandingFlags = {}));
var MembersOrExportsResolutionKind;
(function (MembersOrExportsResolutionKind) {
MembersOrExportsResolutionKind["resolvedExports"] = "resolvedExports";
MembersOrExportsResolutionKind["resolvedMembers"] = "resolvedMembers";
})(MembersOrExportsResolutionKind || (MembersOrExportsResolutionKind = {}));
var UnusedKind;
(function (UnusedKind) {
UnusedKind[UnusedKind["Local"] = 0] = "Local";
UnusedKind[UnusedKind["Parameter"] = 1] = "Parameter";
})(UnusedKind || (UnusedKind = {}));
var isNotOverloadAndNotAccessor = ts.and(isNotOverload, isNotAccessor);
var DeclarationMeaning;
(function (DeclarationMeaning) {
DeclarationMeaning[DeclarationMeaning["GetAccessor"] = 1] = "GetAccessor";
DeclarationMeaning[DeclarationMeaning["SetAccessor"] = 2] = "SetAccessor";
DeclarationMeaning[DeclarationMeaning["PropertyAssignment"] = 4] = "PropertyAssignment";
DeclarationMeaning[DeclarationMeaning["Method"] = 8] = "Method";
DeclarationMeaning[DeclarationMeaning["PrivateStatic"] = 16] = "PrivateStatic";
DeclarationMeaning[DeclarationMeaning["GetOrSetAccessor"] = 3] = "GetOrSetAccessor";
DeclarationMeaning[DeclarationMeaning["PropertyAssignmentOrMethod"] = 12] = "PropertyAssignmentOrMethod";
})(DeclarationMeaning || (DeclarationMeaning = {}));
var DeclarationSpaces;
(function (DeclarationSpaces) {
DeclarationSpaces[DeclarationSpaces["None"] = 0] = "None";
DeclarationSpaces[DeclarationSpaces["ExportValue"] = 1] = "ExportValue";
DeclarationSpaces[DeclarationSpaces["ExportType"] = 2] = "ExportType";
DeclarationSpaces[DeclarationSpaces["ExportNamespace"] = 4] = "ExportNamespace";
})(DeclarationSpaces || (DeclarationSpaces = {}));
var MinArgumentCountFlags;
(function (MinArgumentCountFlags) {
MinArgumentCountFlags[MinArgumentCountFlags["None"] = 0] = "None";
MinArgumentCountFlags[MinArgumentCountFlags["StrongArityForUntypedJS"] = 1] = "StrongArityForUntypedJS";
MinArgumentCountFlags[MinArgumentCountFlags["VoidIsNonOptional"] = 2] = "VoidIsNonOptional";
})(MinArgumentCountFlags || (MinArgumentCountFlags = {}));
var IntrinsicTypeKind;
(function (IntrinsicTypeKind) {
IntrinsicTypeKind[IntrinsicTypeKind["Uppercase"] = 0] = "Uppercase";
IntrinsicTypeKind[IntrinsicTypeKind["Lowercase"] = 1] = "Lowercase";
IntrinsicTypeKind[IntrinsicTypeKind["Capitalize"] = 2] = "Capitalize";
IntrinsicTypeKind[IntrinsicTypeKind["Uncapitalize"] = 3] = "Uncapitalize";
})(IntrinsicTypeKind || (IntrinsicTypeKind = {}));
var intrinsicTypeKinds = new ts.Map(ts.getEntries({
Uppercase: 0 /* Uppercase */,
Lowercase: 1 /* Lowercase */,
Capitalize: 2 /* Capitalize */,
Uncapitalize: 3 /* Uncapitalize */
}));
function SymbolLinks() {
}
function NodeLinks() {
this.flags = 0;
}
function getNodeId(node) {
if (!node.id) {
node.id = nextNodeId;
nextNodeId++;
}
return node.id;
}
ts.getNodeId = getNodeId;
function getSymbolId(symbol) {
if (!symbol.id) {
symbol.id = nextSymbolId;
nextSymbolId++;
}
return symbol.id;
}
ts.getSymbolId = getSymbolId;
function isInstantiatedModule(node, preserveConstEnums) {
var moduleState = ts.getModuleInstanceState(node);
return moduleState === 1 /* Instantiated */ ||
(preserveConstEnums && moduleState === 2 /* ConstEnumOnly */);
}
ts.isInstantiatedModule = isInstantiatedModule;
function createTypeChecker(host, produceDiagnostics) {
var getPackagesSet = ts.memoize(function () {
var set = new ts.Set();
host.getSourceFiles().forEach(function (sf) {
if (!sf.resolvedModules)
return;
ts.forEachEntry(sf.resolvedModules, function (r) {
if (r && r.packageId)
set.add(r.packageId.name);
});
});
return set;
});
// Cancellation that controls whether or not we can cancel in the middle of type checking.
// In general cancelling is *not* safe for the type checker. We might be in the middle of
// computing something, and we will leave our internals in an inconsistent state. Callers
// who set the cancellation token should catch if a cancellation exception occurs, and
// should throw away and create a new TypeChecker.
//
// Currently we only support setting the cancellation token when getting diagnostics. This
// is because diagnostics can be quite expensive, and we want to allow hosts to bail out if
// they no longer need the information (for example, if the user started editing again).
var cancellationToken;
var requestedExternalEmitHelpers;
var externalHelpersModule;
var Symbol = ts.objectAllocator.getSymbolConstructor();
var Type = ts.objectAllocator.getTypeConstructor();
var Signature = ts.objectAllocator.getSignatureConstructor();
var typeCount = 0;
var symbolCount = 0;
var enumCount = 0;
var totalInstantiationCount = 0;
var instantiationCount = 0;
var instantiationDepth = 0;
var currentNode;
var emptySymbols = ts.createSymbolTable();
var arrayVariances = [1 /* Covariant */];
var compilerOptions = host.getCompilerOptions();
var languageVersion = ts.getEmitScriptTarget(compilerOptions);
var moduleKind = ts.getEmitModuleKind(compilerOptions);
var useDefineForClassFields = ts.getUseDefineForClassFields(compilerOptions);
var allowSyntheticDefaultImports = ts.getAllowSyntheticDefaultImports(compilerOptions);
var strictNullChecks = ts.getStrictOptionValue(compilerOptions, "strictNullChecks");
var strictFunctionTypes = ts.getStrictOptionValue(compilerOptions, "strictFunctionTypes");
var strictBindCallApply = ts.getStrictOptionValue(compilerOptions, "strictBindCallApply");
var strictPropertyInitialization = ts.getStrictOptionValue(compilerOptions, "strictPropertyInitialization");
var noImplicitAny = ts.getStrictOptionValue(compilerOptions, "noImplicitAny");
var noImplicitThis = ts.getStrictOptionValue(compilerOptions, "noImplicitThis");
var useUnknownInCatchVariables = ts.getStrictOptionValue(compilerOptions, "useUnknownInCatchVariables");
var keyofStringsOnly = !!compilerOptions.keyofStringsOnly;
var freshObjectLiteralFlag = compilerOptions.suppressExcessPropertyErrors ? 0 : 16384 /* FreshLiteral */;
var exactOptionalPropertyTypes = compilerOptions.exactOptionalPropertyTypes;
var checkBinaryExpression = createCheckBinaryExpression();
var emitResolver = createResolver();
var nodeBuilder = createNodeBuilder();
var globals = ts.createSymbolTable();
var undefinedSymbol = createSymbol(4 /* Property */, "undefined");
undefinedSymbol.declarations = [];
var globalThisSymbol = createSymbol(1536 /* Module */, "globalThis", 8 /* Readonly */);
globalThisSymbol.exports = globals;
globalThisSymbol.declarations = [];
globals.set(globalThisSymbol.escapedName, globalThisSymbol);
var argumentsSymbol = createSymbol(4 /* Property */, "arguments");
var requireSymbol = createSymbol(4 /* Property */, "require");
/** This will be set during calls to `getResolvedSignature` where services determines an apparent number of arguments greater than what is actually provided. */
var apparentArgumentCount;
// for public members that accept a Node or one of its subtypes, we must guard against
// synthetic nodes created during transformations by calling `getParseTreeNode`.
// for most of these, we perform the guard only on `checker` to avoid any possible
// extra cost of calling `getParseTreeNode` when calling these functions from inside the
// checker.
var checker = {
getNodeCount: function () { return ts.sum(host.getSourceFiles(), "nodeCount"); },
getIdentifierCount: function () { return ts.sum(host.getSourceFiles(), "identifierCount"); },
getSymbolCount: function () { return ts.sum(host.getSourceFiles(), "symbolCount") + symbolCount; },
getTypeCount: function () { return typeCount; },
getInstantiationCount: function () { return totalInstantiationCount; },
getRelationCacheSizes: function () { return ({
assignable: assignableRelation.size,
identity: identityRelation.size,
subtype: subtypeRelation.size,
strictSubtype: strictSubtypeRelation.size,
}); },
isUndefinedSymbol: function (symbol) { return symbol === undefinedSymbol; },
isArgumentsSymbol: function (symbol) { return symbol === argumentsSymbol; },
isUnknownSymbol: function (symbol) { return symbol === unknownSymbol; },
getMergedSymbol: getMergedSymbol,
getDiagnostics: getDiagnostics,
getGlobalDiagnostics: getGlobalDiagnostics,
getRecursionIdentity: getRecursionIdentity,
getUnmatchedProperties: getUnmatchedProperties,
getTypeOfSymbolAtLocation: function (symbol, locationIn) {
var location = ts.getParseTreeNode(locationIn);
return location ? getTypeOfSymbolAtLocation(symbol, location) : errorType;
},
getSymbolsOfParameterPropertyDeclaration: function (parameterIn, parameterName) {
var parameter = ts.getParseTreeNode(parameterIn, ts.isParameter);
if (parameter === undefined)
return ts.Debug.fail("Cannot get symbols of a synthetic parameter that cannot be resolved to a parse-tree node.");
return getSymbolsOfParameterPropertyDeclaration(parameter, ts.escapeLeadingUnderscores(parameterName));
},
getDeclaredTypeOfSymbol: getDeclaredTypeOfSymbol,
getPropertiesOfType: getPropertiesOfType,
getPropertyOfType: function (type, name) { return getPropertyOfType(type, ts.escapeLeadingUnderscores(name)); },
getPrivateIdentifierPropertyOfType: function (leftType, name, location) {
var node = ts.getParseTreeNode(location);
if (!node) {
return undefined;
}
var propName = ts.escapeLeadingUnderscores(name);
var lexicallyScopedIdentifier = lookupSymbolForPrivateIdentifierDeclaration(propName, node);
return lexicallyScopedIdentifier ? getPrivateIdentifierPropertyOfType(leftType, lexicallyScopedIdentifier) : undefined;
},
getTypeOfPropertyOfType: function (type, name) { return getTypeOfPropertyOfType(type, ts.escapeLeadingUnderscores(name)); },
getIndexInfoOfType: function (type, kind) { return getIndexInfoOfType(type, kind === 0 /* String */ ? stringType : numberType); },
getIndexInfosOfType: getIndexInfosOfType,
getSignaturesOfType: getSignaturesOfType,
getIndexTypeOfType: function (type, kind) { return getIndexTypeOfType(type, kind === 0 /* String */ ? stringType : numberType); },
getBaseTypes: getBaseTypes,
getBaseTypeOfLiteralType: getBaseTypeOfLiteralType,
getWidenedType: getWidenedType,
getTypeFromTypeNode: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn, ts.isTypeNode);
return node ? getTypeFromTypeNode(node) : errorType;
},
getParameterType: getTypeAtPosition,
getParameterIdentifierNameAtPosition: getParameterIdentifierNameAtPosition,
getPromisedTypeOfPromise: getPromisedTypeOfPromise,
getAwaitedType: function (type) { return getAwaitedType(type); },
getReturnTypeOfSignature: getReturnTypeOfSignature,
isNullableType: isNullableType,
getNullableType: getNullableType,
getNonNullableType: getNonNullableType,
getNonOptionalType: removeOptionalTypeMarker,
getTypeArguments: getTypeArguments,
typeToTypeNode: nodeBuilder.typeToTypeNode,
indexInfoToIndexSignatureDeclaration: nodeBuilder.indexInfoToIndexSignatureDeclaration,
signatureToSignatureDeclaration: nodeBuilder.signatureToSignatureDeclaration,
symbolToEntityName: nodeBuilder.symbolToEntityName,
symbolToExpression: nodeBuilder.symbolToExpression,
symbolToTypeParameterDeclarations: nodeBuilder.symbolToTypeParameterDeclarations,
symbolToParameterDeclaration: nodeBuilder.symbolToParameterDeclaration,
typeParameterToDeclaration: nodeBuilder.typeParameterToDeclaration,
getSymbolsInScope: function (locationIn, meaning) {
var location = ts.getParseTreeNode(locationIn);
return location ? getSymbolsInScope(location, meaning) : [];
},
getSymbolAtLocation: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn);
// set ignoreErrors: true because any lookups invoked by the API shouldn't cause any new errors
return node ? getSymbolAtLocation(node, /*ignoreErrors*/ true) : undefined;
},
getIndexInfosAtLocation: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn);
return node ? getIndexInfosAtLocation(node) : undefined;
},
getShorthandAssignmentValueSymbol: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn);
return node ? getShorthandAssignmentValueSymbol(node) : undefined;
},
getExportSpecifierLocalTargetSymbol: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn, ts.isExportSpecifier);
return node ? getExportSpecifierLocalTargetSymbol(node) : undefined;
},
getExportSymbolOfSymbol: function (symbol) {
return getMergedSymbol(symbol.exportSymbol || symbol);
},
getTypeAtLocation: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn);
return node ? getTypeOfNode(node) : errorType;
},
getTypeOfAssignmentPattern: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn, ts.isAssignmentPattern);
return node && getTypeOfAssignmentPattern(node) || errorType;
},
getPropertySymbolOfDestructuringAssignment: function (locationIn) {
var location = ts.getParseTreeNode(locationIn, ts.isIdentifier);
return location ? getPropertySymbolOfDestructuringAssignment(location) : undefined;
},
signatureToString: function (signature, enclosingDeclaration, flags, kind) {
return signatureToString(signature, ts.getParseTreeNode(enclosingDeclaration), flags, kind);
},
typeToString: function (type, enclosingDeclaration, flags) {
return typeToString(type, ts.getParseTreeNode(enclosingDeclaration), flags);
},
symbolToString: function (symbol, enclosingDeclaration, meaning, flags) {
return symbolToString(symbol, ts.getParseTreeNode(enclosingDeclaration), meaning, flags);
},
typePredicateToString: function (predicate, enclosingDeclaration, flags) {
return typePredicateToString(predicate, ts.getParseTreeNode(enclosingDeclaration), flags);
},
writeSignature: function (signature, enclosingDeclaration, flags, kind, writer) {
return signatureToString(signature, ts.getParseTreeNode(enclosingDeclaration), flags, kind, writer);
},
writeType: function (type, enclosingDeclaration, flags, writer) {
return typeToString(type, ts.getParseTreeNode(enclosingDeclaration), flags, writer);
},
writeSymbol: function (symbol, enclosingDeclaration, meaning, flags, writer) {
return symbolToString(symbol, ts.getParseTreeNode(enclosingDeclaration), meaning, flags, writer);
},
writeTypePredicate: function (predicate, enclosingDeclaration, flags, writer) {
return typePredicateToString(predicate, ts.getParseTreeNode(enclosingDeclaration), flags, writer);
},
getAugmentedPropertiesOfType: getAugmentedPropertiesOfType,
getRootSymbols: getRootSymbols,
getSymbolOfExpando: getSymbolOfExpando,
getContextualType: function (nodeIn, contextFlags) {
var node = ts.getParseTreeNode(nodeIn, ts.isExpression);
if (!node) {
return undefined;
}
var containingCall = ts.findAncestor(node, ts.isCallLikeExpression);
var containingCallResolvedSignature = containingCall && getNodeLinks(containingCall).resolvedSignature;
if (contextFlags & 4 /* Completions */ && containingCall) {
var toMarkSkip = node;
do {
getNodeLinks(toMarkSkip).skipDirectInference = true;
toMarkSkip = toMarkSkip.parent;
} while (toMarkSkip && toMarkSkip !== containingCall);
getNodeLinks(containingCall).resolvedSignature = undefined;
}
var result = getContextualType(node, contextFlags);
if (contextFlags & 4 /* Completions */ && containingCall) {
var toMarkSkip = node;
do {
getNodeLinks(toMarkSkip).skipDirectInference = undefined;
toMarkSkip = toMarkSkip.parent;
} while (toMarkSkip && toMarkSkip !== containingCall);
getNodeLinks(containingCall).resolvedSignature = containingCallResolvedSignature;
}
return result;
},
getContextualTypeForObjectLiteralElement: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn, ts.isObjectLiteralElementLike);
return node ? getContextualTypeForObjectLiteralElement(node) : undefined;
},
getContextualTypeForArgumentAtIndex: function (nodeIn, argIndex) {
var node = ts.getParseTreeNode(nodeIn, ts.isCallLikeExpression);
return node && getContextualTypeForArgumentAtIndex(node, argIndex);
},
getContextualTypeForJsxAttribute: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn, ts.isJsxAttributeLike);
return node && getContextualTypeForJsxAttribute(node);
},
isContextSensitive: isContextSensitive,
getTypeOfPropertyOfContextualType: getTypeOfPropertyOfContextualType,
getFullyQualifiedName: getFullyQualifiedName,
getResolvedSignature: function (node, candidatesOutArray, argumentCount) {
return getResolvedSignatureWorker(node, candidatesOutArray, argumentCount, 0 /* Normal */);
},
getResolvedSignatureForSignatureHelp: function (node, candidatesOutArray, argumentCount) {
return getResolvedSignatureWorker(node, candidatesOutArray, argumentCount, 16 /* IsForSignatureHelp */);
},
getExpandedParameters: getExpandedParameters,
hasEffectiveRestParameter: hasEffectiveRestParameter,
containsArgumentsReference: containsArgumentsReference,
getConstantValue: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn, canHaveConstantValue);
return node ? getConstantValue(node) : undefined;
},
isValidPropertyAccess: function (nodeIn, propertyName) {
var node = ts.getParseTreeNode(nodeIn, ts.isPropertyAccessOrQualifiedNameOrImportTypeNode);
return !!node && isValidPropertyAccess(node, ts.escapeLeadingUnderscores(propertyName));
},
isValidPropertyAccessForCompletions: function (nodeIn, type, property) {
var node = ts.getParseTreeNode(nodeIn, ts.isPropertyAccessExpression);
return !!node && isValidPropertyAccessForCompletions(node, type, property);
},
getSignatureFromDeclaration: function (declarationIn) {
var declaration = ts.getParseTreeNode(declarationIn, ts.isFunctionLike);
return declaration ? getSignatureFromDeclaration(declaration) : undefined;
},
isImplementationOfOverload: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn, ts.isFunctionLike);
return node ? isImplementationOfOverload(node) : undefined;
},
getImmediateAliasedSymbol: getImmediateAliasedSymbol,
getAliasedSymbol: resolveAlias,
getEmitResolver: getEmitResolver,
getExportsOfModule: getExportsOfModuleAsArray,
getExportsAndPropertiesOfModule: getExportsAndPropertiesOfModule,
forEachExportAndPropertyOfModule: forEachExportAndPropertyOfModule,
getSymbolWalker: ts.createGetSymbolWalker(getRestTypeOfSignature, getTypePredicateOfSignature, getReturnTypeOfSignature, getBaseTypes, resolveStructuredTypeMembers, getTypeOfSymbol, getResolvedSymbol, getConstraintOfTypeParameter, ts.getFirstIdentifier, getTypeArguments),
getAmbientModules: getAmbientModules,
getJsxIntrinsicTagNamesAt: getJsxIntrinsicTagNamesAt,
isOptionalParameter: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn, ts.isParameter);
return node ? isOptionalParameter(node) : false;
},
tryGetMemberInModuleExports: function (name, symbol) { return tryGetMemberInModuleExports(ts.escapeLeadingUnderscores(name), symbol); },
tryGetMemberInModuleExportsAndProperties: function (name, symbol) { return tryGetMemberInModuleExportsAndProperties(ts.escapeLeadingUnderscores(name), symbol); },
tryFindAmbientModule: function (moduleName) { return tryFindAmbientModule(moduleName, /*withAugmentations*/ true); },
tryFindAmbientModuleWithoutAugmentations: function (moduleName) {
// we deliberately exclude augmentations
// since we are only interested in declarations of the module itself
return tryFindAmbientModule(moduleName, /*withAugmentations*/ false);
},
getApparentType: getApparentType,
getUnionType: getUnionType,
isTypeAssignableTo: isTypeAssignableTo,
createAnonymousType: createAnonymousType,
createSignature: createSignature,
createSymbol: createSymbol,
createIndexInfo: createIndexInfo,
getAnyType: function () { return anyType; },
getStringType: function () { return stringType; },
getNumberType: function () { return numberType; },
createPromiseType: createPromiseType,
createArrayType: createArrayType,
getElementTypeOfArrayType: getElementTypeOfArrayType,
getBooleanType: function () { return booleanType; },
getFalseType: function (fresh) { return fresh ? falseType : regularFalseType; },
getTrueType: function (fresh) { return fresh ? trueType : regularTrueType; },
getVoidType: function () { return voidType; },
getUndefinedType: function () { return undefinedType; },
getNullType: function () { return nullType; },
getESSymbolType: function () { return esSymbolType; },
getNeverType: function () { return neverType; },
getOptionalType: function () { return optionalType; },
isSymbolAccessible: isSymbolAccessible,
isArrayType: isArrayType,
isTupleType: isTupleType,
isArrayLikeType: isArrayLikeType,
isTypeInvalidDueToUnionDiscriminant: isTypeInvalidDueToUnionDiscriminant,
getAllPossiblePropertiesOfTypes: getAllPossiblePropertiesOfTypes,
getSuggestedSymbolForNonexistentProperty: getSuggestedSymbolForNonexistentProperty,
getSuggestionForNonexistentProperty: getSuggestionForNonexistentProperty,
getSuggestedSymbolForNonexistentJSXAttribute: getSuggestedSymbolForNonexistentJSXAttribute,
getSuggestedSymbolForNonexistentSymbol: function (location, name, meaning) { return getSuggestedSymbolForNonexistentSymbol(location, ts.escapeLeadingUnderscores(name), meaning); },
getSuggestionForNonexistentSymbol: function (location, name, meaning) { return getSuggestionForNonexistentSymbol(location, ts.escapeLeadingUnderscores(name), meaning); },
getSuggestedSymbolForNonexistentModule: getSuggestedSymbolForNonexistentModule,
getSuggestionForNonexistentExport: getSuggestionForNonexistentExport,
getSuggestedSymbolForNonexistentClassMember: getSuggestedSymbolForNonexistentClassMember,
getBaseConstraintOfType: getBaseConstraintOfType,
getDefaultFromTypeParameter: function (type) { return type && type.flags & 262144 /* TypeParameter */ ? getDefaultFromTypeParameter(type) : undefined; },
resolveName: function (name, location, meaning, excludeGlobals) {
return resolveName(location, ts.escapeLeadingUnderscores(name), meaning, /*nameNotFoundMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ false, excludeGlobals);
},
getJsxNamespace: function (n) { return ts.unescapeLeadingUnderscores(getJsxNamespace(n)); },
getJsxFragmentFactory: function (n) {
var jsxFragmentFactory = getJsxFragmentFactoryEntity(n);
return jsxFragmentFactory && ts.unescapeLeadingUnderscores(ts.getFirstIdentifier(jsxFragmentFactory).escapedText);
},
getAccessibleSymbolChain: getAccessibleSymbolChain,
getTypePredicateOfSignature: getTypePredicateOfSignature,
resolveExternalModuleName: function (moduleSpecifierIn) {
var moduleSpecifier = ts.getParseTreeNode(moduleSpecifierIn, ts.isExpression);
return moduleSpecifier && resolveExternalModuleName(moduleSpecifier, moduleSpecifier, /*ignoreErrors*/ true);
},
resolveExternalModuleSymbol: resolveExternalModuleSymbol,
tryGetThisTypeAt: function (nodeIn, includeGlobalThis) {
var node = ts.getParseTreeNode(nodeIn);
return node && tryGetThisTypeAt(node, includeGlobalThis);
},
getTypeArgumentConstraint: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn, ts.isTypeNode);
return node && getTypeArgumentConstraint(node);
},
getSuggestionDiagnostics: function (fileIn, ct) {
var file = ts.getParseTreeNode(fileIn, ts.isSourceFile) || ts.Debug.fail("Could not determine parsed source file.");
if (ts.skipTypeChecking(file, compilerOptions, host)) {
return ts.emptyArray;
}
var diagnostics;
try {
// Record the cancellation token so it can be checked later on during checkSourceElement.
// Do this in a finally block so we can ensure that it gets reset back to nothing after
// this call is done.
cancellationToken = ct;
// Ensure file is type checked
checkSourceFile(file);
ts.Debug.assert(!!(getNodeLinks(file).flags & 1 /* TypeChecked */));
diagnostics = ts.addRange(diagnostics, suggestionDiagnostics.getDiagnostics(file.fileName));
checkUnusedIdentifiers(getPotentiallyUnusedIdentifiers(file), function (containingNode, kind, diag) {
if (!ts.containsParseError(containingNode) && !unusedIsError(kind, !!(containingNode.flags & 8388608 /* Ambient */))) {
(diagnostics || (diagnostics = [])).push(__assign(__assign({}, diag), { category: ts.DiagnosticCategory.Suggestion }));
}
});
return diagnostics || ts.emptyArray;
}
finally {
cancellationToken = undefined;
}
},
runWithCancellationToken: function (token, callback) {
try {
cancellationToken = token;
return callback(checker);
}
finally {
cancellationToken = undefined;
}
},
getLocalTypeParametersOfClassOrInterfaceOrTypeAlias: getLocalTypeParametersOfClassOrInterfaceOrTypeAlias,
isDeclarationVisible: isDeclarationVisible,
};
function getResolvedSignatureWorker(nodeIn, candidatesOutArray, argumentCount, checkMode) {
var node = ts.getParseTreeNode(nodeIn, ts.isCallLikeExpression);
apparentArgumentCount = argumentCount;
var res = node ? getResolvedSignature(node, candidatesOutArray, checkMode) : undefined;
apparentArgumentCount = undefined;
return res;
}
var tupleTypes = new ts.Map();
var unionTypes = new ts.Map();
var intersectionTypes = new ts.Map();
var stringLiteralTypes = new ts.Map();
var numberLiteralTypes = new ts.Map();
var bigIntLiteralTypes = new ts.Map();
var enumLiteralTypes = new ts.Map();
var indexedAccessTypes = new ts.Map();
var templateLiteralTypes = new ts.Map();
var stringMappingTypes = new ts.Map();
var substitutionTypes = new ts.Map();
var subtypeReductionCache = new ts.Map();
var evolvingArrayTypes = [];
var undefinedProperties = new ts.Map();
var unknownSymbol = createSymbol(4 /* Property */, "unknown");
var resolvingSymbol = createSymbol(0, "__resolving__" /* Resolving */);
var anyType = createIntrinsicType(1 /* Any */, "any");
var autoType = createIntrinsicType(1 /* Any */, "any");
var wildcardType = createIntrinsicType(1 /* Any */, "any");
var errorType = createIntrinsicType(1 /* Any */, "error");
var nonInferrableAnyType = createIntrinsicType(1 /* Any */, "any", 131072 /* ContainsWideningType */);
var intrinsicMarkerType = createIntrinsicType(1 /* Any */, "intrinsic");
var unknownType = createIntrinsicType(2 /* Unknown */, "unknown");
var undefinedType = createIntrinsicType(32768 /* Undefined */, "undefined");
var undefinedWideningType = strictNullChecks ? undefinedType : createIntrinsicType(32768 /* Undefined */, "undefined", 131072 /* ContainsWideningType */);
var optionalType = createIntrinsicType(32768 /* Undefined */, "undefined");
var missingType = exactOptionalPropertyTypes ? createIntrinsicType(32768 /* Undefined */, "undefined") : undefinedType;
var nullType = createIntrinsicType(65536 /* Null */, "null");
var nullWideningType = strictNullChecks ? nullType : createIntrinsicType(65536 /* Null */, "null", 131072 /* ContainsWideningType */);
var stringType = createIntrinsicType(4 /* String */, "string");
var numberType = createIntrinsicType(8 /* Number */, "number");
var bigintType = createIntrinsicType(64 /* BigInt */, "bigint");
var falseType = createIntrinsicType(512 /* BooleanLiteral */, "false");
var regularFalseType = createIntrinsicType(512 /* BooleanLiteral */, "false");
var trueType = createIntrinsicType(512 /* BooleanLiteral */, "true");
var regularTrueType = createIntrinsicType(512 /* BooleanLiteral */, "true");
trueType.regularType = regularTrueType;
trueType.freshType = trueType;
regularTrueType.regularType = regularTrueType;
regularTrueType.freshType = trueType;
falseType.regularType = regularFalseType;
falseType.freshType = falseType;
regularFalseType.regularType = regularFalseType;
regularFalseType.freshType = falseType;
var booleanType = getUnionType([regularFalseType, regularTrueType]);
var esSymbolType = createIntrinsicType(4096 /* ESSymbol */, "symbol");
var voidType = createIntrinsicType(16384 /* Void */, "void");
var neverType = createIntrinsicType(131072 /* Never */, "never");
var silentNeverType = createIntrinsicType(131072 /* Never */, "never");
var nonInferrableType = createIntrinsicType(131072 /* Never */, "never", 524288 /* NonInferrableType */);
var implicitNeverType = createIntrinsicType(131072 /* Never */, "never");
var unreachableNeverType = createIntrinsicType(131072 /* Never */, "never");
var nonPrimitiveType = createIntrinsicType(67108864 /* NonPrimitive */, "object");
var stringOrNumberType = getUnionType([stringType, numberType]);
var stringNumberSymbolType = getUnionType([stringType, numberType, esSymbolType]);
var keyofConstraintType = keyofStringsOnly ? stringType : stringNumberSymbolType;
var numberOrBigIntType = getUnionType([numberType, bigintType]);
var templateConstraintType = getUnionType([stringType, numberType, booleanType, bigintType, nullType, undefinedType]);
var restrictiveMapper = makeFunctionTypeMapper(function (t) { return t.flags & 262144 /* TypeParameter */ ? getRestrictiveTypeParameter(t) : t; });
var permissiveMapper = makeFunctionTypeMapper(function (t) { return t.flags & 262144 /* TypeParameter */ ? wildcardType : t; });
var emptyObjectType = createAnonymousType(undefined, emptySymbols, ts.emptyArray, ts.emptyArray, ts.emptyArray);
var emptyJsxObjectType = createAnonymousType(undefined, emptySymbols, ts.emptyArray, ts.emptyArray, ts.emptyArray);
emptyJsxObjectType.objectFlags |= 2048 /* JsxAttributes */;
var emptyTypeLiteralSymbol = createSymbol(2048 /* TypeLiteral */, "__type" /* Type */);
emptyTypeLiteralSymbol.members = ts.createSymbolTable();
var emptyTypeLiteralType = createAnonymousType(emptyTypeLiteralSymbol, emptySymbols, ts.emptyArray, ts.emptyArray, ts.emptyArray);
var emptyGenericType = createAnonymousType(undefined, emptySymbols, ts.emptyArray, ts.emptyArray, ts.emptyArray);
emptyGenericType.instantiations = new ts.Map();
var anyFunctionType = createAnonymousType(undefined, emptySymbols, ts.emptyArray, ts.emptyArray, ts.emptyArray);
// The anyFunctionType contains the anyFunctionType by definition. The flag is further propagated
// in getPropagatingFlagsOfTypes, and it is checked in inferFromTypes.
anyFunctionType.objectFlags |= 524288 /* NonInferrableType */;
var noConstraintType = createAnonymousType(undefined, emptySymbols, ts.emptyArray, ts.emptyArray, ts.emptyArray);
var circularConstraintType = createAnonymousType(undefined, emptySymbols, ts.emptyArray, ts.emptyArray, ts.emptyArray);
var resolvingDefaultType = createAnonymousType(undefined, emptySymbols, ts.emptyArray, ts.emptyArray, ts.emptyArray);
var markerSuperType = createTypeParameter();
var markerSubType = createTypeParameter();
markerSubType.constraint = markerSuperType;
var markerOtherType = createTypeParameter();
var noTypePredicate = createTypePredicate(1 /* Identifier */, "<<unresolved>>", 0, anyType);
var anySignature = createSignature(undefined, undefined, undefined, ts.emptyArray, anyType, /*resolvedTypePredicate*/ undefined, 0, 0 /* None */);
var unknownSignature = createSignature(undefined, undefined, undefined, ts.emptyArray, errorType, /*resolvedTypePredicate*/ undefined, 0, 0 /* None */);
var resolvingSignature = createSignature(undefined, undefined, undefined, ts.emptyArray, anyType, /*resolvedTypePredicate*/ undefined, 0, 0 /* None */);
var silentNeverSignature = createSignature(undefined, undefined, undefined, ts.emptyArray, silentNeverType, /*resolvedTypePredicate*/ undefined, 0, 0 /* None */);
var enumNumberIndexInfo = createIndexInfo(numberType, stringType, /*isReadonly*/ true);
var iterationTypesCache = new ts.Map(); // cache for common IterationTypes instances
var noIterationTypes = {
get yieldType() { return ts.Debug.fail("Not supported"); },
get returnType() { return ts.Debug.fail("Not supported"); },
get nextType() { return ts.Debug.fail("Not supported"); },
};
var anyIterationTypes = createIterationTypes(anyType, anyType, anyType);
var anyIterationTypesExceptNext = createIterationTypes(anyType, anyType, unknownType);
var defaultIterationTypes = createIterationTypes(neverType, anyType, undefinedType); // default iteration types for `Iterator`.
var asyncIterationTypesResolver = {
iterableCacheKey: "iterationTypesOfAsyncIterable",
iteratorCacheKey: "iterationTypesOfAsyncIterator",
iteratorSymbolName: "asyncIterator",
getGlobalIteratorType: getGlobalAsyncIteratorType,
getGlobalIterableType: getGlobalAsyncIterableType,
getGlobalIterableIteratorType: getGlobalAsyncIterableIteratorType,
getGlobalGeneratorType: getGlobalAsyncGeneratorType,
resolveIterationType: getAwaitedType,
mustHaveANextMethodDiagnostic: ts.Diagnostics.An_async_iterator_must_have_a_next_method,
mustBeAMethodDiagnostic: ts.Diagnostics.The_0_property_of_an_async_iterator_must_be_a_method,
mustHaveAValueDiagnostic: ts.Diagnostics.The_type_returned_by_the_0_method_of_an_async_iterator_must_be_a_promise_for_a_type_with_a_value_property,
};
var syncIterationTypesResolver = {
iterableCacheKey: "iterationTypesOfIterable",
iteratorCacheKey: "iterationTypesOfIterator",
iteratorSymbolName: "iterator",
getGlobalIteratorType: getGlobalIteratorType,
getGlobalIterableType: getGlobalIterableType,
getGlobalIterableIteratorType: getGlobalIterableIteratorType,
getGlobalGeneratorType: getGlobalGeneratorType,
resolveIterationType: function (type, _errorNode) { return type; },
mustHaveANextMethodDiagnostic: ts.Diagnostics.An_iterator_must_have_a_next_method,
mustBeAMethodDiagnostic: ts.Diagnostics.The_0_property_of_an_iterator_must_be_a_method,
mustHaveAValueDiagnostic: ts.Diagnostics.The_type_returned_by_the_0_method_of_an_iterator_must_have_a_value_property,
};
/** Key is "/path/to/a.ts|/path/to/b.ts". */
var amalgamatedDuplicates;
var reverseMappedCache = new ts.Map();
var inInferTypeForHomomorphicMappedType = false;
var ambientModulesCache;
/**
* List of every ambient module with a "*" wildcard.
* Unlike other ambient modules, these can't be stored in `globals` because symbol tables only deal with exact matches.
* This is only used if there is no exact match.
*/
var patternAmbientModules;
var patternAmbientModuleAugmentations;
var globalObjectType;
var globalFunctionType;
var globalCallableFunctionType;
var globalNewableFunctionType;
var globalArrayType;
var globalReadonlyArrayType;
var globalStringType;
var globalNumberType;
var globalBooleanType;
var globalRegExpType;
var globalThisType;
var anyArrayType;
var autoArrayType;
var anyReadonlyArrayType;
var deferredGlobalNonNullableTypeAlias;
// The library files are only loaded when the feature is used.
// This allows users to just specify library files they want to used through --lib
// and they will not get an error from not having unrelated library files
var deferredGlobalESSymbolConstructorSymbol;
var deferredGlobalESSymbolConstructorTypeSymbol;
var deferredGlobalESSymbolType;
var deferredGlobalTypedPropertyDescriptorType;
var deferredGlobalPromiseType;
var deferredGlobalPromiseLikeType;
var deferredGlobalPromiseConstructorSymbol;
var deferredGlobalPromiseConstructorLikeType;
var deferredGlobalIterableType;
var deferredGlobalIteratorType;
var deferredGlobalIterableIteratorType;
var deferredGlobalGeneratorType;
var deferredGlobalIteratorYieldResultType;
var deferredGlobalIteratorReturnResultType;
var deferredGlobalAsyncIterableType;
var deferredGlobalAsyncIteratorType;
var deferredGlobalAsyncIterableIteratorType;
var deferredGlobalAsyncGeneratorType;
var deferredGlobalTemplateStringsArrayType;
var deferredGlobalImportMetaType;
var deferredGlobalImportMetaExpressionType;
var deferredGlobalExtractSymbol;
var deferredGlobalOmitSymbol;
var deferredGlobalBigIntType;
var allPotentiallyUnusedIdentifiers = new ts.Map(); // key is file name
var flowLoopStart = 0;
var flowLoopCount = 0;
var sharedFlowCount = 0;
var flowAnalysisDisabled = false;
var flowInvocationCount = 0;
var lastFlowNode;
var lastFlowNodeReachable;
var flowTypeCache;
var emptyStringType = getStringLiteralType("");
var zeroType = getNumberLiteralType(0);
var zeroBigIntType = getBigIntLiteralType({ negative: false, base10Value: "0" });
var resolutionTargets = [];
var resolutionResults = [];
var resolutionPropertyNames = [];
var suggestionCount = 0;
var maximumSuggestionCount = 10;
var mergedSymbols = [];
var symbolLinks = [];
var nodeLinks = [];
var flowLoopCaches = [];
var flowLoopNodes = [];
var flowLoopKeys = [];
var flowLoopTypes = [];
var sharedFlowNodes = [];
var sharedFlowTypes = [];
var flowNodeReachable = [];
var flowNodePostSuper = [];
var potentialThisCollisions = [];
var potentialNewTargetCollisions = [];
var potentialWeakMapSetCollisions = [];
var potentialReflectCollisions = [];
var awaitedTypeStack = [];
var diagnostics = ts.createDiagnosticCollection();
var suggestionDiagnostics = ts.createDiagnosticCollection();
var typeofTypesByName = new ts.Map(ts.getEntries({
string: stringType,
number: numberType,
bigint: bigintType,
boolean: booleanType,
symbol: esSymbolType,
undefined: undefinedType
}));
var typeofType = createTypeofType();
var _jsxNamespace;
var _jsxFactoryEntity;
var outofbandVarianceMarkerHandler;
var subtypeRelation = new ts.Map();
var strictSubtypeRelation = new ts.Map();
var assignableRelation = new ts.Map();
var comparableRelation = new ts.Map();
var identityRelation = new ts.Map();
var enumRelation = new ts.Map();
var builtinGlobals = ts.createSymbolTable();
builtinGlobals.set(undefinedSymbol.escapedName, undefinedSymbol);
initializeTypeChecker();
return checker;
function getJsxNamespace(location) {
if (location) {
var file = ts.getSourceFileOfNode(location);
if (file) {
if (ts.isJsxOpeningFragment(location)) {
if (file.localJsxFragmentNamespace) {
return file.localJsxFragmentNamespace;
}
var jsxFragmentPragma = file.pragmas.get("jsxfrag");
if (jsxFragmentPragma) {
var chosenPragma = ts.isArray(jsxFragmentPragma) ? jsxFragmentPragma[0] : jsxFragmentPragma;
file.localJsxFragmentFactory = ts.parseIsolatedEntityName(chosenPragma.arguments.factory, languageVersion);
ts.visitNode(file.localJsxFragmentFactory, markAsSynthetic);
if (file.localJsxFragmentFactory) {
return file.localJsxFragmentNamespace = ts.getFirstIdentifier(file.localJsxFragmentFactory).escapedText;
}
}
var entity = getJsxFragmentFactoryEntity(location);
if (entity) {
file.localJsxFragmentFactory = entity;
return file.localJsxFragmentNamespace = ts.getFirstIdentifier(entity).escapedText;
}
}
else {
if (file.localJsxNamespace) {
return file.localJsxNamespace;
}
var jsxPragma = file.pragmas.get("jsx");
if (jsxPragma) {
var chosenPragma = ts.isArray(jsxPragma) ? jsxPragma[0] : jsxPragma;
file.localJsxFactory = ts.parseIsolatedEntityName(chosenPragma.arguments.factory, languageVersion);
ts.visitNode(file.localJsxFactory, markAsSynthetic);
if (file.localJsxFactory) {
return file.localJsxNamespace = ts.getFirstIdentifier(file.localJsxFactory).escapedText;
}
}
}
}
}
if (!_jsxNamespace) {
_jsxNamespace = "React";
if (compilerOptions.jsxFactory) {
_jsxFactoryEntity = ts.parseIsolatedEntityName(compilerOptions.jsxFactory, languageVersion);
ts.visitNode(_jsxFactoryEntity, markAsSynthetic);
if (_jsxFactoryEntity) {
_jsxNamespace = ts.getFirstIdentifier(_jsxFactoryEntity).escapedText;
}
}
else if (compilerOptions.reactNamespace) {
_jsxNamespace = ts.escapeLeadingUnderscores(compilerOptions.reactNamespace);
}
}
if (!_jsxFactoryEntity) {
_jsxFactoryEntity = ts.factory.createQualifiedName(ts.factory.createIdentifier(ts.unescapeLeadingUnderscores(_jsxNamespace)), "createElement");
}
return _jsxNamespace;
function markAsSynthetic(node) {
ts.setTextRangePosEnd(node, -1, -1);
return ts.visitEachChild(node, markAsSynthetic, ts.nullTransformationContext);
}
}
function getEmitResolver(sourceFile, cancellationToken) {
// Ensure we have all the type information in place for this file so that all the
// emitter questions of this resolver will return the right information.
getDiagnostics(sourceFile, cancellationToken);
return emitResolver;
}
function lookupOrIssueError(location, message, arg0, arg1, arg2, arg3) {
var diagnostic = location
? ts.createDiagnosticForNode(location, message, arg0, arg1, arg2, arg3)
: ts.createCompilerDiagnostic(message, arg0, arg1, arg2, arg3);
var existing = diagnostics.lookup(diagnostic);
if (existing) {
return existing;
}
else {
diagnostics.add(diagnostic);
return diagnostic;
}
}
function errorSkippedOn(key, location, message, arg0, arg1, arg2, arg3) {
var diagnostic = error(location, message, arg0, arg1, arg2, arg3);
diagnostic.skippedOn = key;
return diagnostic;
}
function createError(location, message, arg0, arg1, arg2, arg3) {
return location
? ts.createDiagnosticForNode(location, message, arg0, arg1, arg2, arg3)
: ts.createCompilerDiagnostic(message, arg0, arg1, arg2, arg3);
}
function error(location, message, arg0, arg1, arg2, arg3) {
var diagnostic = createError(location, message, arg0, arg1, arg2, arg3);
diagnostics.add(diagnostic);
return diagnostic;
}
function addErrorOrSuggestion(isError, diagnostic) {
if (isError) {
diagnostics.add(diagnostic);
}
else {
suggestionDiagnostics.add(__assign(__assign({}, diagnostic), { category: ts.DiagnosticCategory.Suggestion }));
}
}
function errorOrSuggestion(isError, location, message, arg0, arg1, arg2, arg3) {
// Pseudo-synthesized input node
if (location.pos < 0 || location.end < 0) {
if (!isError) {
return; // Drop suggestions (we have no span to suggest on)
}
// Issue errors globally
var file = ts.getSourceFileOfNode(location);
addErrorOrSuggestion(isError, "message" in message ? ts.createFileDiagnostic(file, 0, 0, message, arg0, arg1, arg2, arg3) : ts.createDiagnosticForFileFromMessageChain(file, message)); // eslint-disable-line no-in-operator
return;
}
addErrorOrSuggestion(isError, "message" in message ? ts.createDiagnosticForNode(location, message, arg0, arg1, arg2, arg3) : ts.createDiagnosticForNodeFromMessageChain(location, message)); // eslint-disable-line no-in-operator
}
function errorAndMaybeSuggestAwait(location, maybeMissingAwait, message, arg0, arg1, arg2, arg3) {
var diagnostic = error(location, message, arg0, arg1, arg2, arg3);
if (maybeMissingAwait) {
var related = ts.createDiagnosticForNode(location, ts.Diagnostics.Did_you_forget_to_use_await);
ts.addRelatedInfo(diagnostic, related);
}
return diagnostic;
}
function addDeprecatedSuggestionWorker(declarations, diagnostic) {
var deprecatedTag = Array.isArray(declarations) ? ts.forEach(declarations, ts.getJSDocDeprecatedTag) : ts.getJSDocDeprecatedTag(declarations);
if (deprecatedTag) {
ts.addRelatedInfo(diagnostic, ts.createDiagnosticForNode(deprecatedTag, ts.Diagnostics.The_declaration_was_marked_as_deprecated_here));
}
// We call `addRelatedInfo()` before adding the diagnostic to prevent duplicates.
suggestionDiagnostics.add(diagnostic);
return diagnostic;
}
function addDeprecatedSuggestion(location, declarations, deprecatedEntity) {
var diagnostic = ts.createDiagnosticForNode(location, ts.Diagnostics._0_is_deprecated, deprecatedEntity);
return addDeprecatedSuggestionWorker(declarations, diagnostic);
}
function addDeprecatedSuggestionWithSignature(location, declaration, deprecatedEntity, signatureString) {
var diagnostic = deprecatedEntity
? ts.createDiagnosticForNode(location, ts.Diagnostics.The_signature_0_of_1_is_deprecated, signatureString, deprecatedEntity)
: ts.createDiagnosticForNode(location, ts.Diagnostics._0_is_deprecated, signatureString);
return addDeprecatedSuggestionWorker(declaration, diagnostic);
}
function createSymbol(flags, name, checkFlags) {
symbolCount++;
var symbol = new Symbol(flags | 33554432 /* Transient */, name);
symbol.checkFlags = checkFlags || 0;
return symbol;
}
function getExcludedSymbolFlags(flags) {
var result = 0;
if (flags & 2 /* BlockScopedVariable */)
result |= 111551 /* BlockScopedVariableExcludes */;
if (flags & 1 /* FunctionScopedVariable */)
result |= 111550 /* FunctionScopedVariableExcludes */;
if (flags & 4 /* Property */)
result |= 0 /* PropertyExcludes */;
if (flags & 8 /* EnumMember */)
result |= 900095 /* EnumMemberExcludes */;
if (flags & 16 /* Function */)
result |= 110991 /* FunctionExcludes */;
if (flags & 32 /* Class */)
result |= 899503 /* ClassExcludes */;
if (flags & 64 /* Interface */)
result |= 788872 /* InterfaceExcludes */;
if (flags & 256 /* RegularEnum */)
result |= 899327 /* RegularEnumExcludes */;
if (flags & 128 /* ConstEnum */)
result |= 899967 /* ConstEnumExcludes */;
if (flags & 512 /* ValueModule */)
result |= 110735 /* ValueModuleExcludes */;
if (flags & 8192 /* Method */)
result |= 103359 /* MethodExcludes */;
if (flags & 32768 /* GetAccessor */)
result |= 46015 /* GetAccessorExcludes */;
if (flags & 65536 /* SetAccessor */)
result |= 78783 /* SetAccessorExcludes */;
if (flags & 262144 /* TypeParameter */)
result |= 526824 /* TypeParameterExcludes */;
if (flags & 524288 /* TypeAlias */)
result |= 788968 /* TypeAliasExcludes */;
if (flags & 2097152 /* Alias */)
result |= 2097152 /* AliasExcludes */;
return result;
}
function recordMergedSymbol(target, source) {
if (!source.mergeId) {
source.mergeId = nextMergeId;
nextMergeId++;
}
mergedSymbols[source.mergeId] = target;
}
function cloneSymbol(symbol) {
var result = createSymbol(symbol.flags, symbol.escapedName);
result.declarations = symbol.declarations ? symbol.declarations.slice() : [];
result.parent = symbol.parent;
if (symbol.valueDeclaration)
result.valueDeclaration = symbol.valueDeclaration;
if (symbol.constEnumOnlyModule)
result.constEnumOnlyModule = true;
if (symbol.members)
result.members = new ts.Map(symbol.members);
if (symbol.exports)
result.exports = new ts.Map(symbol.exports);
recordMergedSymbol(result, symbol);
return result;
}
/**
* Note: if target is transient, then it is mutable, and mergeSymbol with both mutate and return it.
* If target is not transient, mergeSymbol will produce a transient clone, mutate that and return it.
*/
function mergeSymbol(target, source, unidirectional) {
if (unidirectional === void 0) { unidirectional = false; }
if (!(target.flags & getExcludedSymbolFlags(source.flags)) ||
(source.flags | target.flags) & 67108864 /* Assignment */) {
if (source === target) {
// This can happen when an export assigned namespace exports something also erroneously exported at the top level
// See `declarationFileNoCrashOnExtraExportModifier` for an example
return target;
}
if (!(target.flags & 33554432 /* Transient */)) {
var resolvedTarget = resolveSymbol(target);
if (resolvedTarget === unknownSymbol) {
return source;
}
target = cloneSymbol(resolvedTarget);
}
// Javascript static-property-assignment declarations always merge, even though they are also values
if (source.flags & 512 /* ValueModule */ && target.flags & 512 /* ValueModule */ && target.constEnumOnlyModule && !source.constEnumOnlyModule) {
// reset flag when merging instantiated module into value module that has only const enums
target.constEnumOnlyModule = false;
}
target.flags |= source.flags;
if (source.valueDeclaration) {
ts.setValueDeclaration(target, source.valueDeclaration);
}
ts.addRange(target.declarations, source.declarations);
if (source.members) {
if (!target.members)
target.members = ts.createSymbolTable();
mergeSymbolTable(target.members, source.members, unidirectional);
}
if (source.exports) {
if (!target.exports)
target.exports = ts.createSymbolTable();
mergeSymbolTable(target.exports, source.exports, unidirectional);
}
if (!unidirectional) {
recordMergedSymbol(target, source);
}
}
else if (target.flags & 1024 /* NamespaceModule */) {
// Do not report an error when merging `var globalThis` with the built-in `globalThis`,
// as we will already report a "Declaration name conflicts..." error, and this error
// won't make much sense.
if (target !== globalThisSymbol) {
error(source.declarations && ts.getNameOfDeclaration(source.declarations[0]), ts.Diagnostics.Cannot_augment_module_0_with_value_exports_because_it_resolves_to_a_non_module_entity, symbolToString(target));
}
}
else { // error
var isEitherEnum = !!(target.flags & 384 /* Enum */ || source.flags & 384 /* Enum */);
var isEitherBlockScoped_1 = !!(target.flags & 2 /* BlockScopedVariable */ || source.flags & 2 /* BlockScopedVariable */);
var message = isEitherEnum
? ts.Diagnostics.Enum_declarations_can_only_merge_with_namespace_or_other_enum_declarations
: isEitherBlockScoped_1
? ts.Diagnostics.Cannot_redeclare_block_scoped_variable_0
: ts.Diagnostics.Duplicate_identifier_0;
var sourceSymbolFile = source.declarations && ts.getSourceFileOfNode(source.declarations[0]);
var targetSymbolFile = target.declarations && ts.getSourceFileOfNode(target.declarations[0]);
var symbolName_1 = symbolToString(source);
// Collect top-level duplicate identifier errors into one mapping, so we can then merge their diagnostics if there are a bunch
if (sourceSymbolFile && targetSymbolFile && amalgamatedDuplicates && !isEitherEnum && sourceSymbolFile !== targetSymbolFile) {
var firstFile_1 = ts.comparePaths(sourceSymbolFile.path, targetSymbolFile.path) === -1 /* LessThan */ ? sourceSymbolFile : targetSymbolFile;
var secondFile_1 = firstFile_1 === sourceSymbolFile ? targetSymbolFile : sourceSymbolFile;
var filesDuplicates = ts.getOrUpdate(amalgamatedDuplicates, firstFile_1.path + "|" + secondFile_1.path, function () {
return ({ firstFile: firstFile_1, secondFile: secondFile_1, conflictingSymbols: new ts.Map() });
});
var conflictingSymbolInfo = ts.getOrUpdate(filesDuplicates.conflictingSymbols, symbolName_1, function () {
return ({ isBlockScoped: isEitherBlockScoped_1, firstFileLocations: [], secondFileLocations: [] });
});
addDuplicateLocations(conflictingSymbolInfo.firstFileLocations, source);
addDuplicateLocations(conflictingSymbolInfo.secondFileLocations, target);
}
else {
addDuplicateDeclarationErrorsForSymbols(source, message, symbolName_1, target);
addDuplicateDeclarationErrorsForSymbols(target, message, symbolName_1, source);
}
}
return target;
function addDuplicateLocations(locs, symbol) {
if (symbol.declarations) {
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var decl = _a[_i];
ts.pushIfUnique(locs, decl);
}
}
}
}
function addDuplicateDeclarationErrorsForSymbols(target, message, symbolName, source) {
ts.forEach(target.declarations, function (node) {
addDuplicateDeclarationError(node, message, symbolName, source.declarations);
});
}
function addDuplicateDeclarationError(node, message, symbolName, relatedNodes) {
var errorNode = (ts.getExpandoInitializer(node, /*isPrototypeAssignment*/ false) ? ts.getNameOfExpando(node) : ts.getNameOfDeclaration(node)) || node;
var err = lookupOrIssueError(errorNode, message, symbolName);
var _loop_7 = function (relatedNode) {
var adjustedNode = (ts.getExpandoInitializer(relatedNode, /*isPrototypeAssignment*/ false) ? ts.getNameOfExpando(relatedNode) : ts.getNameOfDeclaration(relatedNode)) || relatedNode;
if (adjustedNode === errorNode)
return "continue";
err.relatedInformation = err.relatedInformation || [];
var leadingMessage = ts.createDiagnosticForNode(adjustedNode, ts.Diagnostics._0_was_also_declared_here, symbolName);
var followOnMessage = ts.createDiagnosticForNode(adjustedNode, ts.Diagnostics.and_here);
if (ts.length(err.relatedInformation) >= 5 || ts.some(err.relatedInformation, function (r) { return ts.compareDiagnostics(r, followOnMessage) === 0 /* EqualTo */ || ts.compareDiagnostics(r, leadingMessage) === 0 /* EqualTo */; }))
return "continue";
ts.addRelatedInfo(err, !ts.length(err.relatedInformation) ? leadingMessage : followOnMessage);
};
for (var _i = 0, _a = relatedNodes || ts.emptyArray; _i < _a.length; _i++) {
var relatedNode = _a[_i];
_loop_7(relatedNode);
}
}
function combineSymbolTables(first, second) {
if (!(first === null || first === void 0 ? void 0 : first.size))
return second;
if (!(second === null || second === void 0 ? void 0 : second.size))
return first;
var combined = ts.createSymbolTable();
mergeSymbolTable(combined, first);
mergeSymbolTable(combined, second);
return combined;
}
function mergeSymbolTable(target, source, unidirectional) {
if (unidirectional === void 0) { unidirectional = false; }
source.forEach(function (sourceSymbol, id) {
var targetSymbol = target.get(id);
target.set(id, targetSymbol ? mergeSymbol(targetSymbol, sourceSymbol, unidirectional) : sourceSymbol);
});
}
function mergeModuleAugmentation(moduleName) {
var _a, _b, _c;
var moduleAugmentation = moduleName.parent;
if (((_a = moduleAugmentation.symbol.declarations) === null || _a === void 0 ? void 0 : _a[0]) !== moduleAugmentation) {
// this is a combined symbol for multiple augmentations within the same file.
// its symbol already has accumulated information for all declarations
// so we need to add it just once - do the work only for first declaration
ts.Debug.assert(moduleAugmentation.symbol.declarations.length > 1);
return;
}
if (ts.isGlobalScopeAugmentation(moduleAugmentation)) {
mergeSymbolTable(globals, moduleAugmentation.symbol.exports);
}
else {
// find a module that about to be augmented
// do not validate names of augmentations that are defined in ambient context
var moduleNotFoundError = !(moduleName.parent.parent.flags & 8388608 /* Ambient */)
? ts.Diagnostics.Invalid_module_name_in_augmentation_module_0_cannot_be_found
: undefined;
var mainModule_1 = resolveExternalModuleNameWorker(moduleName, moduleName, moduleNotFoundError, /*isForAugmentation*/ true);
if (!mainModule_1) {
return;
}
// obtain item referenced by 'export='
mainModule_1 = resolveExternalModuleSymbol(mainModule_1);
if (mainModule_1.flags & 1920 /* Namespace */) {
// If we're merging an augmentation to a pattern ambient module, we want to
// perform the merge unidirectionally from the augmentation ('a.foo') to
// the pattern ('*.foo'), so that 'getMergedSymbol()' on a.foo gives you
// all the exports both from the pattern and from the augmentation, but
// 'getMergedSymbol()' on *.foo only gives you exports from *.foo.
if (ts.some(patternAmbientModules, function (module) { return mainModule_1 === module.symbol; })) {
var merged = mergeSymbol(moduleAugmentation.symbol, mainModule_1, /*unidirectional*/ true);
if (!patternAmbientModuleAugmentations) {
patternAmbientModuleAugmentations = new ts.Map();
}
// moduleName will be a StringLiteral since this is not `declare global`.
patternAmbientModuleAugmentations.set(moduleName.text, merged);
}
else {
if (((_b = mainModule_1.exports) === null || _b === void 0 ? void 0 : _b.get("__export" /* ExportStar */)) && ((_c = moduleAugmentation.symbol.exports) === null || _c === void 0 ? void 0 : _c.size)) {
// We may need to merge the module augmentation's exports into the target symbols of the resolved exports
var resolvedExports = getResolvedMembersOrExportsOfSymbol(mainModule_1, "resolvedExports" /* resolvedExports */);
for (var _i = 0, _d = ts.arrayFrom(moduleAugmentation.symbol.exports.entries()); _i < _d.length; _i++) {
var _e = _d[_i], key = _e[0], value = _e[1];
if (resolvedExports.has(key) && !mainModule_1.exports.has(key)) {
mergeSymbol(resolvedExports.get(key), value);
}
}
}
mergeSymbol(mainModule_1, moduleAugmentation.symbol);
}
}
else {
// moduleName will be a StringLiteral since this is not `declare global`.
error(moduleName, ts.Diagnostics.Cannot_augment_module_0_because_it_resolves_to_a_non_module_entity, moduleName.text);
}
}
}
function addToSymbolTable(target, source, message) {
source.forEach(function (sourceSymbol, id) {
var targetSymbol = target.get(id);
if (targetSymbol) {
// Error on redeclarations
ts.forEach(targetSymbol.declarations, addDeclarationDiagnostic(ts.unescapeLeadingUnderscores(id), message));
}
else {
target.set(id, sourceSymbol);
}
});
function addDeclarationDiagnostic(id, message) {
return function (declaration) { return diagnostics.add(ts.createDiagnosticForNode(declaration, message, id)); };
}
}
function getSymbolLinks(symbol) {
if (symbol.flags & 33554432 /* Transient */)
return symbol;
var id = getSymbolId(symbol);
return symbolLinks[id] || (symbolLinks[id] = new SymbolLinks());
}
function getNodeLinks(node) {
var nodeId = getNodeId(node);
return nodeLinks[nodeId] || (nodeLinks[nodeId] = new NodeLinks());
}
function isGlobalSourceFile(node) {
return node.kind === 300 /* SourceFile */ && !ts.isExternalOrCommonJsModule(node);
}
function getSymbol(symbols, name, meaning) {
if (meaning) {
var symbol = getMergedSymbol(symbols.get(name));
if (symbol) {
ts.Debug.assert((ts.getCheckFlags(symbol) & 1 /* Instantiated */) === 0, "Should never get an instantiated symbol here.");
if (symbol.flags & meaning) {
return symbol;
}
if (symbol.flags & 2097152 /* Alias */) {
var target = resolveAlias(symbol);
// Unknown symbol means an error occurred in alias resolution, treat it as positive answer to avoid cascading errors
if (target === unknownSymbol || target.flags & meaning) {
return symbol;
}
}
}
}
// return undefined if we can't find a symbol.
}
/**
* Get symbols that represent parameter-property-declaration as parameter and as property declaration
* @param parameter a parameterDeclaration node
* @param parameterName a name of the parameter to get the symbols for.
* @return a tuple of two symbols
*/
function getSymbolsOfParameterPropertyDeclaration(parameter, parameterName) {
var constructorDeclaration = parameter.parent;
var classDeclaration = parameter.parent.parent;
var parameterSymbol = getSymbol(constructorDeclaration.locals, parameterName, 111551 /* Value */);
var propertySymbol = getSymbol(getMembersOfSymbol(classDeclaration.symbol), parameterName, 111551 /* Value */);
if (parameterSymbol && propertySymbol) {
return [parameterSymbol, propertySymbol];
}
return ts.Debug.fail("There should exist two symbols, one as property declaration and one as parameter declaration");
}
function isBlockScopedNameDeclaredBeforeUse(declaration, usage) {
var declarationFile = ts.getSourceFileOfNode(declaration);
var useFile = ts.getSourceFileOfNode(usage);
var declContainer = ts.getEnclosingBlockScopeContainer(declaration);
if (declarationFile !== useFile) {
if ((moduleKind && (declarationFile.externalModuleIndicator || useFile.externalModuleIndicator)) ||
(!ts.outFile(compilerOptions)) ||
isInTypeQuery(usage) ||
declaration.flags & 8388608 /* Ambient */) {
// nodes are in different files and order cannot be determined
return true;
}
// declaration is after usage
// can be legal if usage is deferred (i.e. inside function or in initializer of instance property)
if (isUsedInFunctionOrInstanceProperty(usage, declaration)) {
return true;
}
var sourceFiles = host.getSourceFiles();
return sourceFiles.indexOf(declarationFile) <= sourceFiles.indexOf(useFile);
}
if (declaration.pos <= usage.pos && !(ts.isPropertyDeclaration(declaration) && ts.isThisProperty(usage.parent) && !declaration.initializer && !declaration.exclamationToken)) {
// declaration is before usage
if (declaration.kind === 201 /* BindingElement */) {
// still might be illegal if declaration and usage are both binding elements (eg var [a = b, b = b] = [1, 2])
var errorBindingElement = ts.getAncestor(usage, 201 /* BindingElement */);
if (errorBindingElement) {
return ts.findAncestor(errorBindingElement, ts.isBindingElement) !== ts.findAncestor(declaration, ts.isBindingElement) ||
declaration.pos < errorBindingElement.pos;
}
// or it might be illegal if usage happens before parent variable is declared (eg var [a] = a)
return isBlockScopedNameDeclaredBeforeUse(ts.getAncestor(declaration, 252 /* VariableDeclaration */), usage);
}
else if (declaration.kind === 252 /* VariableDeclaration */) {
// still might be illegal if usage is in the initializer of the variable declaration (eg var a = a)
return !isImmediatelyUsedInInitializerOfBlockScopedVariable(declaration, usage);
}
else if (ts.isClassDeclaration(declaration)) {
// still might be illegal if the usage is within a computed property name in the class (eg class A { static p = "a"; [A.p]() {} })
return !ts.findAncestor(usage, function (n) { return ts.isComputedPropertyName(n) && n.parent.parent === declaration; });
}
else if (ts.isPropertyDeclaration(declaration)) {
// still might be illegal if a self-referencing property initializer (eg private x = this.x)
return !isPropertyImmediatelyReferencedWithinDeclaration(declaration, usage, /*stopAtAnyPropertyDeclaration*/ false);
}
else if (ts.isParameterPropertyDeclaration(declaration, declaration.parent)) {
// foo = this.bar is illegal in esnext+useDefineForClassFields when bar is a parameter property
return !(compilerOptions.target === 99 /* ESNext */ && useDefineForClassFields
&& ts.getContainingClass(declaration) === ts.getContainingClass(usage)
&& isUsedInFunctionOrInstanceProperty(usage, declaration));
}
return true;
}
// declaration is after usage, but it can still be legal if usage is deferred:
// 1. inside an export specifier
// 2. inside a function
// 3. inside an instance property initializer, a reference to a non-instance property
// (except when target: "esnext" and useDefineForClassFields: true and the reference is to a parameter property)
// 4. inside a static property initializer, a reference to a static method in the same class
// 5. inside a TS export= declaration (since we will move the export statement during emit to avoid TDZ)
// or if usage is in a type context:
// 1. inside a type query (typeof in type position)
// 2. inside a jsdoc comment
if (usage.parent.kind === 273 /* ExportSpecifier */ || (usage.parent.kind === 269 /* ExportAssignment */ && usage.parent.isExportEquals)) {
// export specifiers do not use the variable, they only make it available for use
return true;
}
// When resolving symbols for exports, the `usage` location passed in can be the export site directly
if (usage.kind === 269 /* ExportAssignment */ && usage.isExportEquals) {
return true;
}
if (!!(usage.flags & 4194304 /* JSDoc */) || isInTypeQuery(usage) || usageInTypeDeclaration()) {
return true;
}
if (isUsedInFunctionOrInstanceProperty(usage, declaration)) {
if (compilerOptions.target === 99 /* ESNext */ && useDefineForClassFields
&& ts.getContainingClass(declaration)
&& (ts.isPropertyDeclaration(declaration) || ts.isParameterPropertyDeclaration(declaration, declaration.parent))) {
return !isPropertyImmediatelyReferencedWithinDeclaration(declaration, usage, /*stopAtAnyPropertyDeclaration*/ true);
}
else {
return true;
}
}
return false;
function usageInTypeDeclaration() {
return !!ts.findAncestor(usage, function (node) { return ts.isInterfaceDeclaration(node) || ts.isTypeAliasDeclaration(node); });
}
function isImmediatelyUsedInInitializerOfBlockScopedVariable(declaration, usage) {
switch (declaration.parent.parent.kind) {
case 235 /* VariableStatement */:
case 240 /* ForStatement */:
case 242 /* ForOfStatement */:
// variable statement/for/for-of statement case,
// use site should not be inside variable declaration (initializer of declaration or binding element)
if (isSameScopeDescendentOf(usage, declaration, declContainer)) {
return true;
}
break;
}
// ForIn/ForOf case - use site should not be used in expression part
var grandparent = declaration.parent.parent;
return ts.isForInOrOfStatement(grandparent) && isSameScopeDescendentOf(usage, grandparent.expression, declContainer);
}
function isUsedInFunctionOrInstanceProperty(usage, declaration) {
return !!ts.findAncestor(usage, function (current) {
if (current === declContainer) {
return "quit";
}
if (ts.isFunctionLike(current)) {
return true;
}
if (ts.isClassStaticBlockDeclaration(current)) {
return declaration.pos < usage.pos;
}
var propertyDeclaration = ts.tryCast(current.parent, ts.isPropertyDeclaration);
if (propertyDeclaration) {
var initializerOfProperty = propertyDeclaration.initializer === current;
if (initializerOfProperty) {
if (ts.isStatic(current.parent)) {
if (declaration.kind === 167 /* MethodDeclaration */) {
return true;
}
if (ts.isPropertyDeclaration(declaration) && ts.getContainingClass(usage) === ts.getContainingClass(declaration)) {
var propName = declaration.name;
if (ts.isIdentifier(propName) || ts.isPrivateIdentifier(propName)) {
var type = getTypeOfSymbol(getSymbolOfNode(declaration));
var staticBlocks = ts.filter(declaration.parent.members, ts.isClassStaticBlockDeclaration);
if (isPropertyInitializedInStaticBlocks(propName, type, staticBlocks, declaration.parent.pos, current.pos)) {
return true;
}
}
}
}
else {
var isDeclarationInstanceProperty = declaration.kind === 165 /* PropertyDeclaration */ && !ts.isStatic(declaration);
if (!isDeclarationInstanceProperty || ts.getContainingClass(usage) !== ts.getContainingClass(declaration)) {
return true;
}
}
}
}
return false;
});
}
/** stopAtAnyPropertyDeclaration is used for detecting ES-standard class field use-before-def errors */
function isPropertyImmediatelyReferencedWithinDeclaration(declaration, usage, stopAtAnyPropertyDeclaration) {
// always legal if usage is after declaration
if (usage.end > declaration.end) {
return false;
}
// still might be legal if usage is deferred (e.g. x: any = () => this.x)
// otherwise illegal if immediately referenced within the declaration (e.g. x: any = this.x)
var ancestorChangingReferenceScope = ts.findAncestor(usage, function (node) {
if (node === declaration) {
return "quit";
}
switch (node.kind) {
case 212 /* ArrowFunction */:
return true;
case 165 /* PropertyDeclaration */:
// even when stopping at any property declaration, they need to come from the same class
return stopAtAnyPropertyDeclaration &&
(ts.isPropertyDeclaration(declaration) && node.parent === declaration.parent
|| ts.isParameterPropertyDeclaration(declaration, declaration.parent) && node.parent === declaration.parent.parent)
? "quit" : true;
case 233 /* Block */:
switch (node.parent.kind) {
case 170 /* GetAccessor */:
case 167 /* MethodDeclaration */:
case 171 /* SetAccessor */:
return true;
default:
return false;
}
default:
return false;
}
});
return ancestorChangingReferenceScope === undefined;
}
}
function useOuterVariableScopeInParameter(result, location, lastLocation) {
var target = ts.getEmitScriptTarget(compilerOptions);
var functionLocation = location;
if (ts.isParameter(lastLocation)
&& functionLocation.body
&& result.valueDeclaration
&& result.valueDeclaration.pos >= functionLocation.body.pos
&& result.valueDeclaration.end <= functionLocation.body.end) {
// check for several cases where we introduce temporaries that require moving the name/initializer of the parameter to the body
// - static field in a class expression
// - optional chaining pre-es2020
// - nullish coalesce pre-es2020
// - spread assignment in binding pattern pre-es2017
if (target >= 2 /* ES2015 */) {
var links = getNodeLinks(functionLocation);
if (links.declarationRequiresScopeChange === undefined) {
links.declarationRequiresScopeChange = ts.forEach(functionLocation.parameters, requiresScopeChange) || false;
}
return !links.declarationRequiresScopeChange;
}
}
return false;
function requiresScopeChange(node) {
return requiresScopeChangeWorker(node.name)
|| !!node.initializer && requiresScopeChangeWorker(node.initializer);
}
function requiresScopeChangeWorker(node) {
switch (node.kind) {
case 212 /* ArrowFunction */:
case 211 /* FunctionExpression */:
case 254 /* FunctionDeclaration */:
case 169 /* Constructor */:
// do not descend into these
return false;
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 291 /* PropertyAssignment */:
return requiresScopeChangeWorker(node.name);
case 165 /* PropertyDeclaration */:
// static properties in classes introduce temporary variables
if (ts.hasStaticModifier(node)) {
return target < 99 /* ESNext */ || !useDefineForClassFields;
}
return requiresScopeChangeWorker(node.name);
default:
// null coalesce and optional chain pre-es2020 produce temporary variables
if (ts.isNullishCoalesce(node) || ts.isOptionalChain(node)) {
return target < 7 /* ES2020 */;
}
if (ts.isBindingElement(node) && node.dotDotDotToken && ts.isObjectBindingPattern(node.parent)) {
return target < 4 /* ES2017 */;
}
if (ts.isTypeNode(node))
return false;
return ts.forEachChild(node, requiresScopeChangeWorker) || false;
}
}
}
/**
* Resolve a given name for a given meaning at a given location. An error is reported if the name was not found and
* the nameNotFoundMessage argument is not undefined. Returns the resolved symbol, or undefined if no symbol with
* the given name can be found.
*
* @param isUse If true, this will count towards --noUnusedLocals / --noUnusedParameters.
*/
function resolveName(location, name, meaning, nameNotFoundMessage, nameArg, isUse, excludeGlobals, issueSuggestions) {
if (excludeGlobals === void 0) { excludeGlobals = false; }
return resolveNameHelper(location, name, meaning, nameNotFoundMessage, nameArg, isUse, excludeGlobals, getSymbol, issueSuggestions);
}
function resolveNameHelper(location, name, meaning, nameNotFoundMessage, nameArg, isUse, excludeGlobals, lookup, issueSuggestions) {
var _a;
var originalLocation = location; // needed for did-you-mean error reporting, which gathers candidates starting from the original location
var result;
var lastLocation;
var lastSelfReferenceLocation;
var propertyWithInvalidInitializer;
var associatedDeclarationForContainingInitializerOrBindingName;
var withinDeferredContext = false;
var errorLocation = location;
var grandparent;
var isInExternalModule = false;
loop: while (location) {
// Locals of a source file are not in scope (because they get merged into the global symbol table)
if (location.locals && !isGlobalSourceFile(location)) {
if (result = lookup(location.locals, name, meaning)) {
var useResult = true;
if (ts.isFunctionLike(location) && lastLocation && lastLocation !== location.body) {
// symbol lookup restrictions for function-like declarations
// - Type parameters of a function are in scope in the entire function declaration, including the parameter
// list and return type. However, local types are only in scope in the function body.
// - parameters are only in the scope of function body
// This restriction does not apply to JSDoc comment types because they are parented
// at a higher level than type parameters would normally be
if (meaning & result.flags & 788968 /* Type */ && lastLocation.kind !== 315 /* JSDocComment */) {
useResult = result.flags & 262144 /* TypeParameter */
// type parameters are visible in parameter list, return type and type parameter list
? lastLocation === location.type ||
lastLocation.kind === 162 /* Parameter */ ||
lastLocation.kind === 161 /* TypeParameter */
// local types not visible outside the function body
: false;
}
if (meaning & result.flags & 3 /* Variable */) {
// expression inside parameter will lookup as normal variable scope when targeting es2015+
if (useOuterVariableScopeInParameter(result, location, lastLocation)) {
useResult = false;
}
else if (result.flags & 1 /* FunctionScopedVariable */) {
// parameters are visible only inside function body, parameter list and return type
// technically for parameter list case here we might mix parameters and variables declared in function,
// however it is detected separately when checking initializers of parameters
// to make sure that they reference no variables declared after them.
useResult =
lastLocation.kind === 162 /* Parameter */ ||
(lastLocation === location.type &&
!!ts.findAncestor(result.valueDeclaration, ts.isParameter));
}
}
}
else if (location.kind === 187 /* ConditionalType */) {
// A type parameter declared using 'infer T' in a conditional type is visible only in
// the true branch of the conditional type.
useResult = lastLocation === location.trueType;
}
if (useResult) {
break loop;
}
else {
result = undefined;
}
}
}
withinDeferredContext = withinDeferredContext || getIsDeferredContext(location, lastLocation);
switch (location.kind) {
case 300 /* SourceFile */:
if (!ts.isExternalOrCommonJsModule(location))
break;
isInExternalModule = true;
// falls through
case 259 /* ModuleDeclaration */:
var moduleExports = getSymbolOfNode(location).exports || emptySymbols;
if (location.kind === 300 /* SourceFile */ || (ts.isModuleDeclaration(location) && location.flags & 8388608 /* Ambient */ && !ts.isGlobalScopeAugmentation(location))) {
// It's an external module. First see if the module has an export default and if the local
// name of that export default matches.
if (result = moduleExports.get("default" /* Default */)) {
var localSymbol = ts.getLocalSymbolForExportDefault(result);
if (localSymbol && (result.flags & meaning) && localSymbol.escapedName === name) {
break loop;
}
result = undefined;
}
// Because of module/namespace merging, a module's exports are in scope,
// yet we never want to treat an export specifier as putting a member in scope.
// Therefore, if the name we find is purely an export specifier, it is not actually considered in scope.
// Two things to note about this:
// 1. We have to check this without calling getSymbol. The problem with calling getSymbol
// on an export specifier is that it might find the export specifier itself, and try to
// resolve it as an alias. This will cause the checker to consider the export specifier
// a circular alias reference when it might not be.
// 2. We check === SymbolFlags.Alias in order to check that the symbol is *purely*
// an alias. If we used &, we'd be throwing out symbols that have non alias aspects,
// which is not the desired behavior.
var moduleExport = moduleExports.get(name);
if (moduleExport &&
moduleExport.flags === 2097152 /* Alias */ &&
(ts.getDeclarationOfKind(moduleExport, 273 /* ExportSpecifier */) || ts.getDeclarationOfKind(moduleExport, 272 /* NamespaceExport */))) {
break;
}
}
// ES6 exports are also visible locally (except for 'default'), but commonjs exports are not (except typedefs)
if (name !== "default" /* Default */ && (result = lookup(moduleExports, name, meaning & 2623475 /* ModuleMember */))) {
if (ts.isSourceFile(location) && location.commonJsModuleIndicator && !((_a = result.declarations) === null || _a === void 0 ? void 0 : _a.some(ts.isJSDocTypeAlias))) {
result = undefined;
}
else {
break loop;
}
}
break;
case 258 /* EnumDeclaration */:
if (result = lookup(getSymbolOfNode(location).exports, name, meaning & 8 /* EnumMember */)) {
break loop;
}
break;
case 165 /* PropertyDeclaration */:
// TypeScript 1.0 spec (April 2014): 8.4.1
// Initializer expressions for instance member variables are evaluated in the scope
// of the class constructor body but are not permitted to reference parameters or
// local variables of the constructor. This effectively means that entities from outer scopes
// by the same name as a constructor parameter or local variable are inaccessible
// in initializer expressions for instance member variables.
if (!ts.isStatic(location)) {
var ctor = findConstructorDeclaration(location.parent);
if (ctor && ctor.locals) {
if (lookup(ctor.locals, name, meaning & 111551 /* Value */)) {
// Remember the property node, it will be used later to report appropriate error
propertyWithInvalidInitializer = location;
}
}
}
break;
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
case 256 /* InterfaceDeclaration */:
// The below is used to lookup type parameters within a class or interface, as they are added to the class/interface locals
// These can never be latebound, so the symbol's raw members are sufficient. `getMembersOfNode` cannot be used, as it would
// trigger resolving late-bound names, which we may already be in the process of doing while we're here!
if (result = lookup(getSymbolOfNode(location).members || emptySymbols, name, meaning & 788968 /* Type */)) {
if (!isTypeParameterSymbolDeclaredInContainer(result, location)) {
// ignore type parameters not declared in this container
result = undefined;
break;
}
if (lastLocation && ts.isStatic(lastLocation)) {
// TypeScript 1.0 spec (April 2014): 3.4.1
// The scope of a type parameter extends over the entire declaration with which the type
// parameter list is associated, with the exception of static member declarations in classes.
error(errorLocation, ts.Diagnostics.Static_members_cannot_reference_class_type_parameters);
return undefined;
}
break loop;
}
if (location.kind === 224 /* ClassExpression */ && meaning & 32 /* Class */) {
var className = location.name;
if (className && name === className.escapedText) {
result = location.symbol;
break loop;
}
}
break;
case 226 /* ExpressionWithTypeArguments */:
// The type parameters of a class are not in scope in the base class expression.
if (lastLocation === location.expression && location.parent.token === 94 /* ExtendsKeyword */) {
var container = location.parent.parent;
if (ts.isClassLike(container) && (result = lookup(getSymbolOfNode(container).members, name, meaning & 788968 /* Type */))) {
if (nameNotFoundMessage) {
error(errorLocation, ts.Diagnostics.Base_class_expressions_cannot_reference_class_type_parameters);
}
return undefined;
}
}
break;
// It is not legal to reference a class's own type parameters from a computed property name that
// belongs to the class. For example:
//
// function foo<T>() { return '' }
// class C<T> { // <-- Class's own type parameter T
// [foo<T>()]() { } // <-- Reference to T from class's own computed property
// }
//
case 160 /* ComputedPropertyName */:
grandparent = location.parent.parent;
if (ts.isClassLike(grandparent) || grandparent.kind === 256 /* InterfaceDeclaration */) {
// A reference to this grandparent's type parameters would be an error
if (result = lookup(getSymbolOfNode(grandparent).members, name, meaning & 788968 /* Type */)) {
error(errorLocation, ts.Diagnostics.A_computed_property_name_cannot_reference_a_type_parameter_from_its_containing_type);
return undefined;
}
}
break;
case 212 /* ArrowFunction */:
// when targeting ES6 or higher there is no 'arguments' in an arrow function
// for lower compile targets the resolved symbol is used to emit an error
if (compilerOptions.target >= 2 /* ES2015 */) {
break;
}
// falls through
case 167 /* MethodDeclaration */:
case 169 /* Constructor */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 254 /* FunctionDeclaration */:
if (meaning & 3 /* Variable */ && name === "arguments") {
result = argumentsSymbol;
break loop;
}
break;
case 211 /* FunctionExpression */:
if (meaning & 3 /* Variable */ && name === "arguments") {
result = argumentsSymbol;
break loop;
}
if (meaning & 16 /* Function */) {
var functionName = location.name;
if (functionName && name === functionName.escapedText) {
result = location.symbol;
break loop;
}
}
break;
case 163 /* Decorator */:
// Decorators are resolved at the class declaration. Resolving at the parameter
// or member would result in looking up locals in the method.
//
// function y() {}
// class C {
// method(@y x, y) {} // <-- decorator y should be resolved at the class declaration, not the parameter.
// }
//
if (location.parent && location.parent.kind === 162 /* Parameter */) {
location = location.parent;
}
//
// function y() {}
// class C {
// @y method(x, y) {} // <-- decorator y should be resolved at the class declaration, not the method.
// }
//
// class Decorators are resolved outside of the class to avoid referencing type parameters of that class.
//
// type T = number;
// declare function y(x: T): any;
// @param(1 as T) // <-- T should resolve to the type alias outside of class C
// class C<T> {}
if (location.parent && (ts.isClassElement(location.parent) || location.parent.kind === 255 /* ClassDeclaration */)) {
location = location.parent;
}
break;
case 340 /* JSDocTypedefTag */:
case 333 /* JSDocCallbackTag */:
case 334 /* JSDocEnumTag */:
// js type aliases do not resolve names from their host, so skip past it
var root = ts.getJSDocRoot(location);
if (root) {
location = root.parent;
}
break;
case 162 /* Parameter */:
if (lastLocation && (lastLocation === location.initializer ||
lastLocation === location.name && ts.isBindingPattern(lastLocation))) {
if (!associatedDeclarationForContainingInitializerOrBindingName) {
associatedDeclarationForContainingInitializerOrBindingName = location;
}
}
break;
case 201 /* BindingElement */:
if (lastLocation && (lastLocation === location.initializer ||
lastLocation === location.name && ts.isBindingPattern(lastLocation))) {
if (ts.isParameterDeclaration(location) && !associatedDeclarationForContainingInitializerOrBindingName) {
associatedDeclarationForContainingInitializerOrBindingName = location;
}
}
break;
case 188 /* InferType */:
if (meaning & 262144 /* TypeParameter */) {
var parameterName = location.typeParameter.name;
if (parameterName && name === parameterName.escapedText) {
result = location.typeParameter.symbol;
break loop;
}
}
break;
}
if (isSelfReferenceLocation(location)) {
lastSelfReferenceLocation = location;
}
lastLocation = location;
location = location.parent;
}
// We just climbed up parents looking for the name, meaning that we started in a descendant node of `lastLocation`.
// If `result === lastSelfReferenceLocation.symbol`, that means that we are somewhere inside `lastSelfReferenceLocation` looking up a name, and resolving to `lastLocation` itself.
// That means that this is a self-reference of `lastLocation`, and shouldn't count this when considering whether `lastLocation` is used.
if (isUse && result && (!lastSelfReferenceLocation || result !== lastSelfReferenceLocation.symbol)) {
result.isReferenced |= meaning;
}
if (!result) {
if (lastLocation) {
ts.Debug.assert(lastLocation.kind === 300 /* SourceFile */);
if (lastLocation.commonJsModuleIndicator && name === "exports" && meaning & lastLocation.symbol.flags) {
return lastLocation.symbol;
}
}
if (!excludeGlobals) {
result = lookup(globals, name, meaning);
}
}
if (!result) {
if (originalLocation && ts.isInJSFile(originalLocation) && originalLocation.parent) {
if (ts.isRequireCall(originalLocation.parent, /*checkArgumentIsStringLiteralLike*/ false)) {
return requireSymbol;
}
}
}
if (!result) {
if (nameNotFoundMessage) {
if (!errorLocation ||
!checkAndReportErrorForMissingPrefix(errorLocation, name, nameArg) && // TODO: GH#18217
!checkAndReportErrorForExtendingInterface(errorLocation) &&
!checkAndReportErrorForUsingTypeAsNamespace(errorLocation, name, meaning) &&
!checkAndReportErrorForExportingPrimitiveType(errorLocation, name) &&
!checkAndReportErrorForUsingTypeAsValue(errorLocation, name, meaning) &&
!checkAndReportErrorForUsingNamespaceModuleAsValue(errorLocation, name, meaning) &&
!checkAndReportErrorForUsingValueAsType(errorLocation, name, meaning)) {
var suggestion = void 0;
if (issueSuggestions && suggestionCount < maximumSuggestionCount) {
suggestion = getSuggestedSymbolForNonexistentSymbol(originalLocation, name, meaning);
var isGlobalScopeAugmentationDeclaration = (suggestion === null || suggestion === void 0 ? void 0 : suggestion.valueDeclaration) && ts.isAmbientModule(suggestion.valueDeclaration) && ts.isGlobalScopeAugmentation(suggestion.valueDeclaration);
if (isGlobalScopeAugmentationDeclaration) {
suggestion = undefined;
}
if (suggestion) {
var suggestionName = symbolToString(suggestion);
var isUncheckedJS = isUncheckedJSSuggestion(originalLocation, suggestion, /*excludeClasses*/ false);
var message = isUncheckedJS ? ts.Diagnostics.Could_not_find_name_0_Did_you_mean_1 : ts.Diagnostics.Cannot_find_name_0_Did_you_mean_1;
var diagnostic = createError(errorLocation, message, diagnosticName(nameArg), suggestionName);
addErrorOrSuggestion(!isUncheckedJS, diagnostic);
if (suggestion.valueDeclaration) {
ts.addRelatedInfo(diagnostic, ts.createDiagnosticForNode(suggestion.valueDeclaration, ts.Diagnostics._0_is_declared_here, suggestionName));
}
}
}
if (!suggestion) {
if (nameArg) {
var lib = getSuggestedLibForNonExistentName(nameArg);
if (lib) {
error(errorLocation, nameNotFoundMessage, diagnosticName(nameArg), lib);
}
else {
error(errorLocation, nameNotFoundMessage, diagnosticName(nameArg));
}
}
}
suggestionCount++;
}
}
return undefined;
}
// Perform extra checks only if error reporting was requested
if (nameNotFoundMessage) {
if (propertyWithInvalidInitializer && !(compilerOptions.target === 99 /* ESNext */ && useDefineForClassFields)) {
// We have a match, but the reference occurred within a property initializer and the identifier also binds
// to a local variable in the constructor where the code will be emitted. Note that this is actually allowed
// with ESNext+useDefineForClassFields because the scope semantics are different.
var propertyName = propertyWithInvalidInitializer.name;
error(errorLocation, ts.Diagnostics.Initializer_of_instance_member_variable_0_cannot_reference_identifier_1_declared_in_the_constructor, ts.declarationNameToString(propertyName), diagnosticName(nameArg));
return undefined;
}
// Only check for block-scoped variable if we have an error location and are looking for the
// name with variable meaning
// For example,
// declare module foo {
// interface bar {}
// }
// const foo/*1*/: foo/*2*/.bar;
// The foo at /*1*/ and /*2*/ will share same symbol with two meanings:
// block-scoped variable and namespace module. However, only when we
// try to resolve name in /*1*/ which is used in variable position,
// we want to check for block-scoped
if (errorLocation &&
(meaning & 2 /* BlockScopedVariable */ ||
((meaning & 32 /* Class */ || meaning & 384 /* Enum */) && (meaning & 111551 /* Value */) === 111551 /* Value */))) {
var exportOrLocalSymbol = getExportSymbolOfValueSymbolIfExported(result);
if (exportOrLocalSymbol.flags & 2 /* BlockScopedVariable */ || exportOrLocalSymbol.flags & 32 /* Class */ || exportOrLocalSymbol.flags & 384 /* Enum */) {
checkResolvedBlockScopedVariable(exportOrLocalSymbol, errorLocation);
}
}
// If we're in an external module, we can't reference value symbols created from UMD export declarations
if (result && isInExternalModule && (meaning & 111551 /* Value */) === 111551 /* Value */ && !(originalLocation.flags & 4194304 /* JSDoc */)) {
var merged = getMergedSymbol(result);
if (ts.length(merged.declarations) && ts.every(merged.declarations, function (d) { return ts.isNamespaceExportDeclaration(d) || ts.isSourceFile(d) && !!d.symbol.globalExports; })) {
errorOrSuggestion(!compilerOptions.allowUmdGlobalAccess, errorLocation, ts.Diagnostics._0_refers_to_a_UMD_global_but_the_current_file_is_a_module_Consider_adding_an_import_instead, ts.unescapeLeadingUnderscores(name));
}
}
// If we're in a parameter initializer or binding name, we can't reference the values of the parameter whose initializer we're within or parameters to the right
if (result && associatedDeclarationForContainingInitializerOrBindingName && !withinDeferredContext && (meaning & 111551 /* Value */) === 111551 /* Value */) {
var candidate = getMergedSymbol(getLateBoundSymbol(result));
var root = ts.getRootDeclaration(associatedDeclarationForContainingInitializerOrBindingName);
// A parameter initializer or binding pattern initializer within a parameter cannot refer to itself
if (candidate === getSymbolOfNode(associatedDeclarationForContainingInitializerOrBindingName)) {
error(errorLocation, ts.Diagnostics.Parameter_0_cannot_reference_itself, ts.declarationNameToString(associatedDeclarationForContainingInitializerOrBindingName.name));
}
// And it cannot refer to any declarations which come after it
else if (candidate.valueDeclaration && candidate.valueDeclaration.pos > associatedDeclarationForContainingInitializerOrBindingName.pos && root.parent.locals && lookup(root.parent.locals, candidate.escapedName, meaning) === candidate) {
error(errorLocation, ts.Diagnostics.Parameter_0_cannot_reference_identifier_1_declared_after_it, ts.declarationNameToString(associatedDeclarationForContainingInitializerOrBindingName.name), ts.declarationNameToString(errorLocation));
}
}
if (result && errorLocation && meaning & 111551 /* Value */ && result.flags & 2097152 /* Alias */) {
checkSymbolUsageInExpressionContext(result, name, errorLocation);
}
}
return result;
}
function checkSymbolUsageInExpressionContext(symbol, name, useSite) {
if (!ts.isValidTypeOnlyAliasUseSite(useSite)) {
var typeOnlyDeclaration = getTypeOnlyAliasDeclaration(symbol);
if (typeOnlyDeclaration) {
var isExport = ts.typeOnlyDeclarationIsExport(typeOnlyDeclaration);
var message = isExport
? ts.Diagnostics._0_cannot_be_used_as_a_value_because_it_was_exported_using_export_type
: ts.Diagnostics._0_cannot_be_used_as_a_value_because_it_was_imported_using_import_type;
var relatedMessage = isExport
? ts.Diagnostics._0_was_exported_here
: ts.Diagnostics._0_was_imported_here;
var unescapedName = ts.unescapeLeadingUnderscores(name);
ts.addRelatedInfo(error(useSite, message, unescapedName), ts.createDiagnosticForNode(typeOnlyDeclaration, relatedMessage, unescapedName));
}
}
}
function getIsDeferredContext(location, lastLocation) {
if (location.kind !== 212 /* ArrowFunction */ && location.kind !== 211 /* FunctionExpression */) {
// initializers in instance property declaration of class like entities are executed in constructor and thus deferred
return ts.isTypeQueryNode(location) || ((ts.isFunctionLikeDeclaration(location) ||
(location.kind === 165 /* PropertyDeclaration */ && !ts.isStatic(location))) && (!lastLocation || lastLocation !== location.name)); // A name is evaluated within the enclosing scope - so it shouldn't count as deferred
}
if (lastLocation && lastLocation === location.name) {
return false;
}
// generator functions and async functions are not inlined in control flow when immediately invoked
if (location.asteriskToken || ts.hasSyntacticModifier(location, 256 /* Async */)) {
return true;
}
return !ts.getImmediatelyInvokedFunctionExpression(location);
}
function isSelfReferenceLocation(node) {
switch (node.kind) {
case 254 /* FunctionDeclaration */:
case 255 /* ClassDeclaration */:
case 256 /* InterfaceDeclaration */:
case 258 /* EnumDeclaration */:
case 257 /* TypeAliasDeclaration */:
case 259 /* ModuleDeclaration */: // For `namespace N { N; }`
return true;
default:
return false;
}
}
function diagnosticName(nameArg) {
return ts.isString(nameArg) ? ts.unescapeLeadingUnderscores(nameArg) : ts.declarationNameToString(nameArg);
}
function isTypeParameterSymbolDeclaredInContainer(symbol, container) {
if (symbol.declarations) {
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var decl = _a[_i];
if (decl.kind === 161 /* TypeParameter */) {
var parent = ts.isJSDocTemplateTag(decl.parent) ? ts.getJSDocHost(decl.parent) : decl.parent;
if (parent === container) {
return !(ts.isJSDocTemplateTag(decl.parent) && ts.find(decl.parent.parent.tags, ts.isJSDocTypeAlias)); // TODO: GH#18217
}
}
}
}
return false;
}
function checkAndReportErrorForMissingPrefix(errorLocation, name, nameArg) {
if (!ts.isIdentifier(errorLocation) || errorLocation.escapedText !== name || isTypeReferenceIdentifier(errorLocation) || isInTypeQuery(errorLocation)) {
return false;
}
var container = ts.getThisContainer(errorLocation, /*includeArrowFunctions*/ false);
var location = container;
while (location) {
if (ts.isClassLike(location.parent)) {
var classSymbol = getSymbolOfNode(location.parent);
if (!classSymbol) {
break;
}
// Check to see if a static member exists.
var constructorType = getTypeOfSymbol(classSymbol);
if (getPropertyOfType(constructorType, name)) {
error(errorLocation, ts.Diagnostics.Cannot_find_name_0_Did_you_mean_the_static_member_1_0, diagnosticName(nameArg), symbolToString(classSymbol));
return true;
}
// No static member is present.
// Check if we're in an instance method and look for a relevant instance member.
if (location === container && !ts.isStatic(location)) {
var instanceType = getDeclaredTypeOfSymbol(classSymbol).thisType; // TODO: GH#18217
if (getPropertyOfType(instanceType, name)) {
error(errorLocation, ts.Diagnostics.Cannot_find_name_0_Did_you_mean_the_instance_member_this_0, diagnosticName(nameArg));
return true;
}
}
}
location = location.parent;
}
return false;
}
function checkAndReportErrorForExtendingInterface(errorLocation) {
var expression = getEntityNameForExtendingInterface(errorLocation);
if (expression && resolveEntityName(expression, 64 /* Interface */, /*ignoreErrors*/ true)) {
error(errorLocation, ts.Diagnostics.Cannot_extend_an_interface_0_Did_you_mean_implements, ts.getTextOfNode(expression));
return true;
}
return false;
}
/**
* Climbs up parents to an ExpressionWithTypeArguments, and returns its expression,
* but returns undefined if that expression is not an EntityNameExpression.
*/
function getEntityNameForExtendingInterface(node) {
switch (node.kind) {
case 79 /* Identifier */:
case 204 /* PropertyAccessExpression */:
return node.parent ? getEntityNameForExtendingInterface(node.parent) : undefined;
case 226 /* ExpressionWithTypeArguments */:
if (ts.isEntityNameExpression(node.expression)) {
return node.expression;
}
// falls through
default:
return undefined;
}
}
function checkAndReportErrorForUsingTypeAsNamespace(errorLocation, name, meaning) {
var namespaceMeaning = 1920 /* Namespace */ | (ts.isInJSFile(errorLocation) ? 111551 /* Value */ : 0);
if (meaning === namespaceMeaning) {
var symbol = resolveSymbol(resolveName(errorLocation, name, 788968 /* Type */ & ~namespaceMeaning, /*nameNotFoundMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ false));
var parent = errorLocation.parent;
if (symbol) {
if (ts.isQualifiedName(parent)) {
ts.Debug.assert(parent.left === errorLocation, "Should only be resolving left side of qualified name as a namespace");
var propName = parent.right.escapedText;
var propType = getPropertyOfType(getDeclaredTypeOfSymbol(symbol), propName);
if (propType) {
error(parent, ts.Diagnostics.Cannot_access_0_1_because_0_is_a_type_but_not_a_namespace_Did_you_mean_to_retrieve_the_type_of_the_property_1_in_0_with_0_1, ts.unescapeLeadingUnderscores(name), ts.unescapeLeadingUnderscores(propName));
return true;
}
}
error(errorLocation, ts.Diagnostics._0_only_refers_to_a_type_but_is_being_used_as_a_namespace_here, ts.unescapeLeadingUnderscores(name));
return true;
}
}
return false;
}
function checkAndReportErrorForUsingValueAsType(errorLocation, name, meaning) {
if (meaning & (788968 /* Type */ & ~1920 /* Namespace */)) {
var symbol = resolveSymbol(resolveName(errorLocation, name, ~788968 /* Type */ & 111551 /* Value */, /*nameNotFoundMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ false));
if (symbol && !(symbol.flags & 1920 /* Namespace */)) {
error(errorLocation, ts.Diagnostics._0_refers_to_a_value_but_is_being_used_as_a_type_here_Did_you_mean_typeof_0, ts.unescapeLeadingUnderscores(name));
return true;
}
}
return false;
}
function isPrimitiveTypeName(name) {
return name === "any" || name === "string" || name === "number" || name === "boolean" || name === "never" || name === "unknown";
}
function checkAndReportErrorForExportingPrimitiveType(errorLocation, name) {
if (isPrimitiveTypeName(name) && errorLocation.parent.kind === 273 /* ExportSpecifier */) {
error(errorLocation, ts.Diagnostics.Cannot_export_0_Only_local_declarations_can_be_exported_from_a_module, name);
return true;
}
return false;
}
function checkAndReportErrorForUsingTypeAsValue(errorLocation, name, meaning) {
if (meaning & (111551 /* Value */ & ~1024 /* NamespaceModule */)) {
if (isPrimitiveTypeName(name)) {
error(errorLocation, ts.Diagnostics._0_only_refers_to_a_type_but_is_being_used_as_a_value_here, ts.unescapeLeadingUnderscores(name));
return true;
}
var symbol = resolveSymbol(resolveName(errorLocation, name, 788968 /* Type */ & ~111551 /* Value */, /*nameNotFoundMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ false));
if (symbol && !(symbol.flags & 1024 /* NamespaceModule */)) {
var rawName = ts.unescapeLeadingUnderscores(name);
if (isES2015OrLaterConstructorName(name)) {
error(errorLocation, ts.Diagnostics._0_only_refers_to_a_type_but_is_being_used_as_a_value_here_Do_you_need_to_change_your_target_library_Try_changing_the_lib_compiler_option_to_es2015_or_later, rawName);
}
else if (maybeMappedType(errorLocation, symbol)) {
error(errorLocation, ts.Diagnostics._0_only_refers_to_a_type_but_is_being_used_as_a_value_here_Did_you_mean_to_use_1_in_0, rawName, rawName === "K" ? "P" : "K");
}
else {
error(errorLocation, ts.Diagnostics._0_only_refers_to_a_type_but_is_being_used_as_a_value_here, rawName);
}
return true;
}
}
return false;
}
function maybeMappedType(node, symbol) {
var container = ts.findAncestor(node.parent, function (n) {
return ts.isComputedPropertyName(n) || ts.isPropertySignature(n) ? false : ts.isTypeLiteralNode(n) || "quit";
});
if (container && container.members.length === 1) {
var type = getDeclaredTypeOfSymbol(symbol);
return !!(type.flags & 1048576 /* Union */) && allTypesAssignableToKind(type, 384 /* StringOrNumberLiteral */, /*strict*/ true);
}
return false;
}
function isES2015OrLaterConstructorName(n) {
switch (n) {
case "Promise":
case "Symbol":
case "Map":
case "WeakMap":
case "Set":
case "WeakSet":
return true;
}
return false;
}
function checkAndReportErrorForUsingNamespaceModuleAsValue(errorLocation, name, meaning) {
if (meaning & (111551 /* Value */ & ~1024 /* NamespaceModule */ & ~788968 /* Type */)) {
var symbol = resolveSymbol(resolveName(errorLocation, name, 1024 /* NamespaceModule */ & ~111551 /* Value */, /*nameNotFoundMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ false));
if (symbol) {
error(errorLocation, ts.Diagnostics.Cannot_use_namespace_0_as_a_value, ts.unescapeLeadingUnderscores(name));
return true;
}
}
else if (meaning & (788968 /* Type */ & ~1024 /* NamespaceModule */ & ~111551 /* Value */)) {
var symbol = resolveSymbol(resolveName(errorLocation, name, (512 /* ValueModule */ | 1024 /* NamespaceModule */) & ~788968 /* Type */, /*nameNotFoundMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ false));
if (symbol) {
error(errorLocation, ts.Diagnostics.Cannot_use_namespace_0_as_a_type, ts.unescapeLeadingUnderscores(name));
return true;
}
}
return false;
}
function checkResolvedBlockScopedVariable(result, errorLocation) {
var _a;
ts.Debug.assert(!!(result.flags & 2 /* BlockScopedVariable */ || result.flags & 32 /* Class */ || result.flags & 384 /* Enum */));
if (result.flags & (16 /* Function */ | 1 /* FunctionScopedVariable */ | 67108864 /* Assignment */) && result.flags & 32 /* Class */) {
// constructor functions aren't block scoped
return;
}
// Block-scoped variables cannot be used before their definition
var declaration = (_a = result.declarations) === null || _a === void 0 ? void 0 : _a.find(function (d) { return ts.isBlockOrCatchScoped(d) || ts.isClassLike(d) || (d.kind === 258 /* EnumDeclaration */); });
if (declaration === undefined)
return ts.Debug.fail("checkResolvedBlockScopedVariable could not find block-scoped declaration");
if (!(declaration.flags & 8388608 /* Ambient */) && !isBlockScopedNameDeclaredBeforeUse(declaration, errorLocation)) {
var diagnosticMessage = void 0;
var declarationName = ts.declarationNameToString(ts.getNameOfDeclaration(declaration));
if (result.flags & 2 /* BlockScopedVariable */) {
diagnosticMessage = error(errorLocation, ts.Diagnostics.Block_scoped_variable_0_used_before_its_declaration, declarationName);
}
else if (result.flags & 32 /* Class */) {
diagnosticMessage = error(errorLocation, ts.Diagnostics.Class_0_used_before_its_declaration, declarationName);
}
else if (result.flags & 256 /* RegularEnum */) {
diagnosticMessage = error(errorLocation, ts.Diagnostics.Enum_0_used_before_its_declaration, declarationName);
}
else {
ts.Debug.assert(!!(result.flags & 128 /* ConstEnum */));
if (ts.shouldPreserveConstEnums(compilerOptions)) {
diagnosticMessage = error(errorLocation, ts.Diagnostics.Enum_0_used_before_its_declaration, declarationName);
}
}
if (diagnosticMessage) {
ts.addRelatedInfo(diagnosticMessage, ts.createDiagnosticForNode(declaration, ts.Diagnostics._0_is_declared_here, declarationName));
}
}
}
/* Starting from 'initial' node walk up the parent chain until 'stopAt' node is reached.
* If at any point current node is equal to 'parent' node - return true.
* Return false if 'stopAt' node is reached or isFunctionLike(current) === true.
*/
function isSameScopeDescendentOf(initial, parent, stopAt) {
return !!parent && !!ts.findAncestor(initial, function (n) { return n === stopAt || ts.isFunctionLike(n) ? "quit" : n === parent; });
}
function getAnyImportSyntax(node) {
switch (node.kind) {
case 263 /* ImportEqualsDeclaration */:
return node;
case 265 /* ImportClause */:
return node.parent;
case 266 /* NamespaceImport */:
return node.parent.parent;
case 268 /* ImportSpecifier */:
return node.parent.parent.parent;
default:
return undefined;
}
}
function getDeclarationOfAliasSymbol(symbol) {
return symbol.declarations && ts.findLast(symbol.declarations, isAliasSymbolDeclaration);
}
/**
* An alias symbol is created by one of the following declarations:
* import <symbol> = ...
* import <symbol> from ...
* import * as <symbol> from ...
* import { x as <symbol> } from ...
* export { x as <symbol> } from ...
* export * as ns <symbol> from ...
* export = <EntityNameExpression>
* export default <EntityNameExpression>
* module.exports = <EntityNameExpression>
* {<Identifier>}
* {name: <EntityNameExpression>}
* const { x } = require ...
*/
function isAliasSymbolDeclaration(node) {
return node.kind === 263 /* ImportEqualsDeclaration */
|| node.kind === 262 /* NamespaceExportDeclaration */
|| node.kind === 265 /* ImportClause */ && !!node.name
|| node.kind === 266 /* NamespaceImport */
|| node.kind === 272 /* NamespaceExport */
|| node.kind === 268 /* ImportSpecifier */
|| node.kind === 273 /* ExportSpecifier */
|| node.kind === 269 /* ExportAssignment */ && ts.exportAssignmentIsAlias(node)
|| ts.isBinaryExpression(node) && ts.getAssignmentDeclarationKind(node) === 2 /* ModuleExports */ && ts.exportAssignmentIsAlias(node)
|| ts.isAccessExpression(node)
&& ts.isBinaryExpression(node.parent)
&& node.parent.left === node
&& node.parent.operatorToken.kind === 63 /* EqualsToken */
&& isAliasableOrJsExpression(node.parent.right)
|| node.kind === 292 /* ShorthandPropertyAssignment */
|| node.kind === 291 /* PropertyAssignment */ && isAliasableOrJsExpression(node.initializer)
|| ts.isRequireVariableDeclaration(node);
}
function isAliasableOrJsExpression(e) {
return ts.isAliasableExpression(e) || ts.isFunctionExpression(e) && isJSConstructor(e);
}
function getTargetOfImportEqualsDeclaration(node, dontResolveAlias) {
var commonJSPropertyAccess = getCommonJSPropertyAccess(node);
if (commonJSPropertyAccess) {
var name = ts.getLeftmostAccessExpression(commonJSPropertyAccess.expression).arguments[0];
return ts.isIdentifier(commonJSPropertyAccess.name)
? resolveSymbol(getPropertyOfType(resolveExternalModuleTypeByLiteral(name), commonJSPropertyAccess.name.escapedText))
: undefined;
}
if (ts.isVariableDeclaration(node) || node.moduleReference.kind === 275 /* ExternalModuleReference */) {
var immediate = resolveExternalModuleName(node, ts.getExternalModuleRequireArgument(node) || ts.getExternalModuleImportEqualsDeclarationExpression(node));
var resolved_4 = resolveExternalModuleSymbol(immediate);
markSymbolOfAliasDeclarationIfTypeOnly(node, immediate, resolved_4, /*overwriteEmpty*/ false);
return resolved_4;
}
var resolved = getSymbolOfPartOfRightHandSideOfImportEquals(node.moduleReference, dontResolveAlias);
checkAndReportErrorForResolvingImportAliasToTypeOnlySymbol(node, resolved);
return resolved;
}
function checkAndReportErrorForResolvingImportAliasToTypeOnlySymbol(node, resolved) {
if (markSymbolOfAliasDeclarationIfTypeOnly(node, /*immediateTarget*/ undefined, resolved, /*overwriteEmpty*/ false) && !node.isTypeOnly) {
var typeOnlyDeclaration = getTypeOnlyAliasDeclaration(getSymbolOfNode(node));
var isExport = ts.typeOnlyDeclarationIsExport(typeOnlyDeclaration);
var message = isExport
? ts.Diagnostics.An_import_alias_cannot_reference_a_declaration_that_was_exported_using_export_type
: ts.Diagnostics.An_import_alias_cannot_reference_a_declaration_that_was_imported_using_import_type;
var relatedMessage = isExport
? ts.Diagnostics._0_was_exported_here
: ts.Diagnostics._0_was_imported_here;
// Non-null assertion is safe because the optionality comes from ImportClause,
// but if an ImportClause was the typeOnlyDeclaration, it had to have a `name`.
var name = ts.unescapeLeadingUnderscores(typeOnlyDeclaration.name.escapedText);
ts.addRelatedInfo(error(node.moduleReference, message), ts.createDiagnosticForNode(typeOnlyDeclaration, relatedMessage, name));
}
}
function resolveExportByName(moduleSymbol, name, sourceNode, dontResolveAlias) {
var exportValue = moduleSymbol.exports.get("export=" /* ExportEquals */);
var exportSymbol = exportValue ? getPropertyOfType(getTypeOfSymbol(exportValue), name) : moduleSymbol.exports.get(name);
var resolved = resolveSymbol(exportSymbol, dontResolveAlias);
markSymbolOfAliasDeclarationIfTypeOnly(sourceNode, exportSymbol, resolved, /*overwriteEmpty*/ false);
return resolved;
}
function isSyntacticDefault(node) {
return ((ts.isExportAssignment(node) && !node.isExportEquals) || ts.hasSyntacticModifier(node, 512 /* Default */) || ts.isExportSpecifier(node));
}
function canHaveSyntheticDefault(file, moduleSymbol, dontResolveAlias) {
if (!allowSyntheticDefaultImports) {
return false;
}
// Declaration files (and ambient modules)
if (!file || file.isDeclarationFile) {
// Definitely cannot have a synthetic default if they have a syntactic default member specified
var defaultExportSymbol = resolveExportByName(moduleSymbol, "default" /* Default */, /*sourceNode*/ undefined, /*dontResolveAlias*/ true); // Dont resolve alias because we want the immediately exported symbol's declaration
if (defaultExportSymbol && ts.some(defaultExportSymbol.declarations, isSyntacticDefault)) {
return false;
}
// It _might_ still be incorrect to assume there is no __esModule marker on the import at runtime, even if there is no `default` member
// So we check a bit more,
if (resolveExportByName(moduleSymbol, ts.escapeLeadingUnderscores("__esModule"), /*sourceNode*/ undefined, dontResolveAlias)) {
// If there is an `__esModule` specified in the declaration (meaning someone explicitly added it or wrote it in their code),
// it definitely is a module and does not have a synthetic default
return false;
}
// There are _many_ declaration files not written with esmodules in mind that still get compiled into a format with __esModule set
// Meaning there may be no default at runtime - however to be on the permissive side, we allow access to a synthetic default member
// as there is no marker to indicate if the accompanying JS has `__esModule` or not, or is even native esm
return true;
}
// TypeScript files never have a synthetic default (as they are always emitted with an __esModule marker) _unless_ they contain an export= statement
if (!ts.isSourceFileJS(file)) {
return hasExportAssignmentSymbol(moduleSymbol);
}
// JS files have a synthetic default if they do not contain ES2015+ module syntax (export = is not valid in js) _and_ do not have an __esModule marker
return !file.externalModuleIndicator && !resolveExportByName(moduleSymbol, ts.escapeLeadingUnderscores("__esModule"), /*sourceNode*/ undefined, dontResolveAlias);
}
function getTargetOfImportClause(node, dontResolveAlias) {
var _a;
var moduleSymbol = resolveExternalModuleName(node, node.parent.moduleSpecifier);
if (moduleSymbol) {
var exportDefaultSymbol = void 0;
if (ts.isShorthandAmbientModuleSymbol(moduleSymbol)) {
exportDefaultSymbol = moduleSymbol;
}
else {
exportDefaultSymbol = resolveExportByName(moduleSymbol, "default" /* Default */, node, dontResolveAlias);
}
var file = (_a = moduleSymbol.declarations) === null || _a === void 0 ? void 0 : _a.find(ts.isSourceFile);
var hasSyntheticDefault = canHaveSyntheticDefault(file, moduleSymbol, dontResolveAlias);
if (!exportDefaultSymbol && !hasSyntheticDefault) {
if (hasExportAssignmentSymbol(moduleSymbol)) {
var compilerOptionName = moduleKind >= ts.ModuleKind.ES2015 ? "allowSyntheticDefaultImports" : "esModuleInterop";
var exportEqualsSymbol = moduleSymbol.exports.get("export=" /* ExportEquals */);
var exportAssignment = exportEqualsSymbol.valueDeclaration;
var err = error(node.name, ts.Diagnostics.Module_0_can_only_be_default_imported_using_the_1_flag, symbolToString(moduleSymbol), compilerOptionName);
if (exportAssignment) {
ts.addRelatedInfo(err, ts.createDiagnosticForNode(exportAssignment, ts.Diagnostics.This_module_is_declared_with_using_export_and_can_only_be_used_with_a_default_import_when_using_the_0_flag, compilerOptionName));
}
}
else {
reportNonDefaultExport(moduleSymbol, node);
}
}
else if (hasSyntheticDefault) {
// per emit behavior, a synthetic default overrides a "real" .default member if `__esModule` is not present
var resolved = resolveExternalModuleSymbol(moduleSymbol, dontResolveAlias) || resolveSymbol(moduleSymbol, dontResolveAlias);
markSymbolOfAliasDeclarationIfTypeOnly(node, moduleSymbol, resolved, /*overwriteTypeOnly*/ false);
return resolved;
}
markSymbolOfAliasDeclarationIfTypeOnly(node, exportDefaultSymbol, /*finalTarget*/ undefined, /*overwriteTypeOnly*/ false);
return exportDefaultSymbol;
}
}
function reportNonDefaultExport(moduleSymbol, node) {
var _a, _b, _c;
if ((_a = moduleSymbol.exports) === null || _a === void 0 ? void 0 : _a.has(node.symbol.escapedName)) {
error(node.name, ts.Diagnostics.Module_0_has_no_default_export_Did_you_mean_to_use_import_1_from_0_instead, symbolToString(moduleSymbol), symbolToString(node.symbol));
}
else {
var diagnostic = error(node.name, ts.Diagnostics.Module_0_has_no_default_export, symbolToString(moduleSymbol));
var exportStar = (_b = moduleSymbol.exports) === null || _b === void 0 ? void 0 : _b.get("__export" /* ExportStar */);
if (exportStar) {
var defaultExport = (_c = exportStar.declarations) === null || _c === void 0 ? void 0 : _c.find(function (decl) {
var _a, _b;
return !!(ts.isExportDeclaration(decl) && decl.moduleSpecifier &&
((_b = (_a = resolveExternalModuleName(decl, decl.moduleSpecifier)) === null || _a === void 0 ? void 0 : _a.exports) === null || _b === void 0 ? void 0 : _b.has("default" /* Default */)));
});
if (defaultExport) {
ts.addRelatedInfo(diagnostic, ts.createDiagnosticForNode(defaultExport, ts.Diagnostics.export_Asterisk_does_not_re_export_a_default));
}
}
}
}
function getTargetOfNamespaceImport(node, dontResolveAlias) {
var moduleSpecifier = node.parent.parent.moduleSpecifier;
var immediate = resolveExternalModuleName(node, moduleSpecifier);
var resolved = resolveESModuleSymbol(immediate, moduleSpecifier, dontResolveAlias, /*suppressUsageError*/ false);
markSymbolOfAliasDeclarationIfTypeOnly(node, immediate, resolved, /*overwriteEmpty*/ false);
return resolved;
}
function getTargetOfNamespaceExport(node, dontResolveAlias) {
var moduleSpecifier = node.parent.moduleSpecifier;
var immediate = moduleSpecifier && resolveExternalModuleName(node, moduleSpecifier);
var resolved = moduleSpecifier && resolveESModuleSymbol(immediate, moduleSpecifier, dontResolveAlias, /*suppressUsageError*/ false);
markSymbolOfAliasDeclarationIfTypeOnly(node, immediate, resolved, /*overwriteEmpty*/ false);
return resolved;
}
// This function creates a synthetic symbol that combines the value side of one symbol with the
// type/namespace side of another symbol. Consider this example:
//
// declare module graphics {
// interface Point {
// x: number;
// y: number;
// }
// }
// declare var graphics: {
// Point: new (x: number, y: number) => graphics.Point;
// }
// declare module "graphics" {
// export = graphics;
// }
//
// An 'import { Point } from "graphics"' needs to create a symbol that combines the value side 'Point'
// property with the type/namespace side interface 'Point'.
function combineValueAndTypeSymbols(valueSymbol, typeSymbol) {
if (valueSymbol === unknownSymbol && typeSymbol === unknownSymbol) {
return unknownSymbol;
}
if (valueSymbol.flags & (788968 /* Type */ | 1920 /* Namespace */)) {
return valueSymbol;
}
var result = createSymbol(valueSymbol.flags | typeSymbol.flags, valueSymbol.escapedName);
result.declarations = ts.deduplicate(ts.concatenate(valueSymbol.declarations, typeSymbol.declarations), ts.equateValues);
result.parent = valueSymbol.parent || typeSymbol.parent;
if (valueSymbol.valueDeclaration)
result.valueDeclaration = valueSymbol.valueDeclaration;
if (typeSymbol.members)
result.members = new ts.Map(typeSymbol.members);
if (valueSymbol.exports)
result.exports = new ts.Map(valueSymbol.exports);
return result;
}
function getExportOfModule(symbol, name, specifier, dontResolveAlias) {
if (symbol.flags & 1536 /* Module */) {
var exportSymbol = getExportsOfSymbol(symbol).get(name.escapedText);
var resolved = resolveSymbol(exportSymbol, dontResolveAlias);
markSymbolOfAliasDeclarationIfTypeOnly(specifier, exportSymbol, resolved, /*overwriteEmpty*/ false);
return resolved;
}
}
function getPropertyOfVariable(symbol, name) {
if (symbol.flags & 3 /* Variable */) {
var typeAnnotation = symbol.valueDeclaration.type;
if (typeAnnotation) {
return resolveSymbol(getPropertyOfType(getTypeFromTypeNode(typeAnnotation), name));
}
}
}
function getExternalModuleMember(node, specifier, dontResolveAlias) {
var _a, _b;
if (dontResolveAlias === void 0) { dontResolveAlias = false; }
var moduleSpecifier = ts.getExternalModuleRequireArgument(node) || node.moduleSpecifier;
var moduleSymbol = resolveExternalModuleName(node, moduleSpecifier); // TODO: GH#18217
var name = !ts.isPropertyAccessExpression(specifier) && specifier.propertyName || specifier.name;
if (!ts.isIdentifier(name)) {
return undefined;
}
var suppressInteropError = name.escapedText === "default" /* Default */ && !!(compilerOptions.allowSyntheticDefaultImports || compilerOptions.esModuleInterop);
var targetSymbol = resolveESModuleSymbol(moduleSymbol, moduleSpecifier, /*dontResolveAlias*/ false, suppressInteropError);
if (targetSymbol) {
if (name.escapedText) {
if (ts.isShorthandAmbientModuleSymbol(moduleSymbol)) {
return moduleSymbol;
}
var symbolFromVariable = void 0;
// First check if module was specified with "export=". If so, get the member from the resolved type
if (moduleSymbol && moduleSymbol.exports && moduleSymbol.exports.get("export=" /* ExportEquals */)) {
symbolFromVariable = getPropertyOfType(getTypeOfSymbol(targetSymbol), name.escapedText, /*skipObjectFunctionPropertyAugment*/ true);
}
else {
symbolFromVariable = getPropertyOfVariable(targetSymbol, name.escapedText);
}
// if symbolFromVariable is export - get its final target
symbolFromVariable = resolveSymbol(symbolFromVariable, dontResolveAlias);
var symbolFromModule = getExportOfModule(targetSymbol, name, specifier, dontResolveAlias);
if (symbolFromModule === undefined && name.escapedText === "default" /* Default */) {
var file = (_a = moduleSymbol.declarations) === null || _a === void 0 ? void 0 : _a.find(ts.isSourceFile);
if (canHaveSyntheticDefault(file, moduleSymbol, dontResolveAlias)) {
symbolFromModule = resolveExternalModuleSymbol(moduleSymbol, dontResolveAlias) || resolveSymbol(moduleSymbol, dontResolveAlias);
}
}
var symbol = symbolFromModule && symbolFromVariable && symbolFromModule !== symbolFromVariable ?
combineValueAndTypeSymbols(symbolFromVariable, symbolFromModule) :
symbolFromModule || symbolFromVariable;
if (!symbol) {
var moduleName = getFullyQualifiedName(moduleSymbol, node);
var declarationName = ts.declarationNameToString(name);
var suggestion = getSuggestedSymbolForNonexistentModule(name, targetSymbol);
if (suggestion !== undefined) {
var suggestionName = symbolToString(suggestion);
var diagnostic = error(name, ts.Diagnostics._0_has_no_exported_member_named_1_Did_you_mean_2, moduleName, declarationName, suggestionName);
if (suggestion.valueDeclaration) {
ts.addRelatedInfo(diagnostic, ts.createDiagnosticForNode(suggestion.valueDeclaration, ts.Diagnostics._0_is_declared_here, suggestionName));
}
}
else {
if ((_b = moduleSymbol.exports) === null || _b === void 0 ? void 0 : _b.has("default" /* Default */)) {
error(name, ts.Diagnostics.Module_0_has_no_exported_member_1_Did_you_mean_to_use_import_1_from_0_instead, moduleName, declarationName);
}
else {
reportNonExportedMember(node, name, declarationName, moduleSymbol, moduleName);
}
}
}
return symbol;
}
}
}
function reportNonExportedMember(node, name, declarationName, moduleSymbol, moduleName) {
var _a, _b;
var localSymbol = (_b = (_a = moduleSymbol.valueDeclaration) === null || _a === void 0 ? void 0 : _a.locals) === null || _b === void 0 ? void 0 : _b.get(name.escapedText);
var exports = moduleSymbol.exports;
if (localSymbol) {
var exportedEqualsSymbol = exports === null || exports === void 0 ? void 0 : exports.get("export=" /* ExportEquals */);
if (exportedEqualsSymbol) {
getSymbolIfSameReference(exportedEqualsSymbol, localSymbol) ? reportInvalidImportEqualsExportMember(node, name, declarationName, moduleName) :
error(name, ts.Diagnostics.Module_0_has_no_exported_member_1, moduleName, declarationName);
}
else {
var exportedSymbol = exports ? ts.find(symbolsToArray(exports), function (symbol) { return !!getSymbolIfSameReference(symbol, localSymbol); }) : undefined;
var diagnostic = exportedSymbol ? error(name, ts.Diagnostics.Module_0_declares_1_locally_but_it_is_exported_as_2, moduleName, declarationName, symbolToString(exportedSymbol)) :
error(name, ts.Diagnostics.Module_0_declares_1_locally_but_it_is_not_exported, moduleName, declarationName);
if (localSymbol.declarations) {
ts.addRelatedInfo.apply(void 0, __spreadArray([diagnostic], ts.map(localSymbol.declarations, function (decl, index) {
return ts.createDiagnosticForNode(decl, index === 0 ? ts.Diagnostics._0_is_declared_here : ts.Diagnostics.and_here, declarationName);
}), false));
}
}
}
else {
error(name, ts.Diagnostics.Module_0_has_no_exported_member_1, moduleName, declarationName);
}
}
function reportInvalidImportEqualsExportMember(node, name, declarationName, moduleName) {
if (moduleKind >= ts.ModuleKind.ES2015) {
var message = compilerOptions.esModuleInterop ? ts.Diagnostics._0_can_only_be_imported_by_using_a_default_import :
ts.Diagnostics._0_can_only_be_imported_by_turning_on_the_esModuleInterop_flag_and_using_a_default_import;
error(name, message, declarationName);
}
else {
if (ts.isInJSFile(node)) {
var message = compilerOptions.esModuleInterop ? ts.Diagnostics._0_can_only_be_imported_by_using_a_require_call_or_by_using_a_default_import :
ts.Diagnostics._0_can_only_be_imported_by_using_a_require_call_or_by_turning_on_the_esModuleInterop_flag_and_using_a_default_import;
error(name, message, declarationName);
}
else {
var message = compilerOptions.esModuleInterop ? ts.Diagnostics._0_can_only_be_imported_by_using_import_1_require_2_or_a_default_import :
ts.Diagnostics._0_can_only_be_imported_by_using_import_1_require_2_or_by_turning_on_the_esModuleInterop_flag_and_using_a_default_import;
error(name, message, declarationName, declarationName, moduleName);
}
}
}
function getTargetOfImportSpecifier(node, dontResolveAlias) {
var root = ts.isBindingElement(node) ? ts.getRootDeclaration(node) : node.parent.parent.parent;
var commonJSPropertyAccess = getCommonJSPropertyAccess(root);
var resolved = getExternalModuleMember(root, commonJSPropertyAccess || node, dontResolveAlias);
var name = node.propertyName || node.name;
if (commonJSPropertyAccess && resolved && ts.isIdentifier(name)) {
return resolveSymbol(getPropertyOfType(getTypeOfSymbol(resolved), name.escapedText), dontResolveAlias);
}
markSymbolOfAliasDeclarationIfTypeOnly(node, /*immediateTarget*/ undefined, resolved, /*overwriteEmpty*/ false);
return resolved;
}
function getCommonJSPropertyAccess(node) {
if (ts.isVariableDeclaration(node) && node.initializer && ts.isPropertyAccessExpression(node.initializer)) {
return node.initializer;
}
}
function getTargetOfNamespaceExportDeclaration(node, dontResolveAlias) {
var resolved = resolveExternalModuleSymbol(node.parent.symbol, dontResolveAlias);
markSymbolOfAliasDeclarationIfTypeOnly(node, /*immediateTarget*/ undefined, resolved, /*overwriteEmpty*/ false);
return resolved;
}
function getTargetOfExportSpecifier(node, meaning, dontResolveAlias) {
var resolved = node.parent.parent.moduleSpecifier ?
getExternalModuleMember(node.parent.parent, node, dontResolveAlias) :
resolveEntityName(node.propertyName || node.name, meaning, /*ignoreErrors*/ false, dontResolveAlias);
markSymbolOfAliasDeclarationIfTypeOnly(node, /*immediateTarget*/ undefined, resolved, /*overwriteEmpty*/ false);
return resolved;
}
function getTargetOfExportAssignment(node, dontResolveAlias) {
var expression = ts.isExportAssignment(node) ? node.expression : node.right;
var resolved = getTargetOfAliasLikeExpression(expression, dontResolveAlias);
markSymbolOfAliasDeclarationIfTypeOnly(node, /*immediateTarget*/ undefined, resolved, /*overwriteEmpty*/ false);
return resolved;
}
function getTargetOfAliasLikeExpression(expression, dontResolveAlias) {
if (ts.isClassExpression(expression)) {
return checkExpressionCached(expression).symbol;
}
if (!ts.isEntityName(expression) && !ts.isEntityNameExpression(expression)) {
return undefined;
}
var aliasLike = resolveEntityName(expression, 111551 /* Value */ | 788968 /* Type */ | 1920 /* Namespace */, /*ignoreErrors*/ true, dontResolveAlias);
if (aliasLike) {
return aliasLike;
}
checkExpressionCached(expression);
return getNodeLinks(expression).resolvedSymbol;
}
function getTargetOfPropertyAssignment(node, dontRecursivelyResolve) {
var expression = node.initializer;
return getTargetOfAliasLikeExpression(expression, dontRecursivelyResolve);
}
function getTargetOfAccessExpression(node, dontRecursivelyResolve) {
if (!(ts.isBinaryExpression(node.parent) && node.parent.left === node && node.parent.operatorToken.kind === 63 /* EqualsToken */)) {
return undefined;
}
return getTargetOfAliasLikeExpression(node.parent.right, dontRecursivelyResolve);
}
function getTargetOfAliasDeclaration(node, dontRecursivelyResolve) {
if (dontRecursivelyResolve === void 0) { dontRecursivelyResolve = false; }
switch (node.kind) {
case 263 /* ImportEqualsDeclaration */:
case 252 /* VariableDeclaration */:
return getTargetOfImportEqualsDeclaration(node, dontRecursivelyResolve);
case 265 /* ImportClause */:
return getTargetOfImportClause(node, dontRecursivelyResolve);
case 266 /* NamespaceImport */:
return getTargetOfNamespaceImport(node, dontRecursivelyResolve);
case 272 /* NamespaceExport */:
return getTargetOfNamespaceExport(node, dontRecursivelyResolve);
case 268 /* ImportSpecifier */:
case 201 /* BindingElement */:
return getTargetOfImportSpecifier(node, dontRecursivelyResolve);
case 273 /* ExportSpecifier */:
return getTargetOfExportSpecifier(node, 111551 /* Value */ | 788968 /* Type */ | 1920 /* Namespace */, dontRecursivelyResolve);
case 269 /* ExportAssignment */:
case 219 /* BinaryExpression */:
return getTargetOfExportAssignment(node, dontRecursivelyResolve);
case 262 /* NamespaceExportDeclaration */:
return getTargetOfNamespaceExportDeclaration(node, dontRecursivelyResolve);
case 292 /* ShorthandPropertyAssignment */:
return resolveEntityName(node.name, 111551 /* Value */ | 788968 /* Type */ | 1920 /* Namespace */, /*ignoreErrors*/ true, dontRecursivelyResolve);
case 291 /* PropertyAssignment */:
return getTargetOfPropertyAssignment(node, dontRecursivelyResolve);
case 205 /* ElementAccessExpression */:
case 204 /* PropertyAccessExpression */:
return getTargetOfAccessExpression(node, dontRecursivelyResolve);
default:
return ts.Debug.fail();
}
}
/**
* Indicates that a symbol is an alias that does not merge with a local declaration.
* OR Is a JSContainer which may merge an alias with a local declaration
*/
function isNonLocalAlias(symbol, excludes) {
if (excludes === void 0) { excludes = 111551 /* Value */ | 788968 /* Type */ | 1920 /* Namespace */; }
if (!symbol)
return false;
return (symbol.flags & (2097152 /* Alias */ | excludes)) === 2097152 /* Alias */ || !!(symbol.flags & 2097152 /* Alias */ && symbol.flags & 67108864 /* Assignment */);
}
function resolveSymbol(symbol, dontResolveAlias) {
return !dontResolveAlias && isNonLocalAlias(symbol) ? resolveAlias(symbol) : symbol;
}
function resolveAlias(symbol) {
ts.Debug.assert((symbol.flags & 2097152 /* Alias */) !== 0, "Should only get Alias here.");
var links = getSymbolLinks(symbol);
if (!links.target) {
links.target = resolvingSymbol;
var node = getDeclarationOfAliasSymbol(symbol);
if (!node)
return ts.Debug.fail();
var target = getTargetOfAliasDeclaration(node);
if (links.target === resolvingSymbol) {
links.target = target || unknownSymbol;
}
else {
error(node, ts.Diagnostics.Circular_definition_of_import_alias_0, symbolToString(symbol));
}
}
else if (links.target === resolvingSymbol) {
links.target = unknownSymbol;
}
return links.target;
}
function tryResolveAlias(symbol) {
var links = getSymbolLinks(symbol);
if (links.target !== resolvingSymbol) {
return resolveAlias(symbol);
}
return undefined;
}
/**
* Marks a symbol as type-only if its declaration is syntactically type-only.
* If it is not itself marked type-only, but resolves to a type-only alias
* somewhere in its resolution chain, save a reference to the type-only alias declaration
* so the alias _not_ marked type-only can be identified as _transitively_ type-only.
*
* This function is called on each alias declaration that could be type-only or resolve to
* another type-only alias during `resolveAlias`, so that later, when an alias is used in a
* JS-emitting expression, we can quickly determine if that symbol is effectively type-only
* and issue an error if so.
*
* @param aliasDeclaration The alias declaration not marked as type-only
* has already been marked as not resolving to a type-only alias. Used when recursively resolving qualified
* names of import aliases, e.g. `import C = a.b.C`. If namespace `a` is not found to be type-only, the
* import declaration will initially be marked as not resolving to a type-only symbol. But, namespace `b`
* must still be checked for a type-only marker, overwriting the previous negative result if found.
* @param immediateTarget The symbol to which the alias declaration immediately resolves
* @param finalTarget The symbol to which the alias declaration ultimately resolves
* @param overwriteEmpty Checks `resolvesToSymbol` for type-only declarations even if `aliasDeclaration`
*/
function markSymbolOfAliasDeclarationIfTypeOnly(aliasDeclaration, immediateTarget, finalTarget, overwriteEmpty) {
if (!aliasDeclaration || ts.isPropertyAccessExpression(aliasDeclaration))
return false;
// If the declaration itself is type-only, mark it and return.
// No need to check what it resolves to.
var sourceSymbol = getSymbolOfNode(aliasDeclaration);
if (ts.isTypeOnlyImportOrExportDeclaration(aliasDeclaration)) {
var links_1 = getSymbolLinks(sourceSymbol);
links_1.typeOnlyDeclaration = aliasDeclaration;
return true;
}
var links = getSymbolLinks(sourceSymbol);
return markSymbolOfAliasDeclarationIfTypeOnlyWorker(links, immediateTarget, overwriteEmpty)
|| markSymbolOfAliasDeclarationIfTypeOnlyWorker(links, finalTarget, overwriteEmpty);
}
function markSymbolOfAliasDeclarationIfTypeOnlyWorker(aliasDeclarationLinks, target, overwriteEmpty) {
var _a, _b, _c;
if (target && (aliasDeclarationLinks.typeOnlyDeclaration === undefined || overwriteEmpty && aliasDeclarationLinks.typeOnlyDeclaration === false)) {
var exportSymbol = (_b = (_a = target.exports) === null || _a === void 0 ? void 0 : _a.get("export=" /* ExportEquals */)) !== null && _b !== void 0 ? _b : target;
var typeOnly = exportSymbol.declarations && ts.find(exportSymbol.declarations, ts.isTypeOnlyImportOrExportDeclaration);
aliasDeclarationLinks.typeOnlyDeclaration = (_c = typeOnly !== null && typeOnly !== void 0 ? typeOnly : getSymbolLinks(exportSymbol).typeOnlyDeclaration) !== null && _c !== void 0 ? _c : false;
}
return !!aliasDeclarationLinks.typeOnlyDeclaration;
}
/** Indicates that a symbol directly or indirectly resolves to a type-only import or export. */
function getTypeOnlyAliasDeclaration(symbol) {
if (!(symbol.flags & 2097152 /* Alias */)) {
return undefined;
}
var links = getSymbolLinks(symbol);
return links.typeOnlyDeclaration || undefined;
}
function markExportAsReferenced(node) {
var symbol = getSymbolOfNode(node);
var target = resolveAlias(symbol);
if (target) {
var markAlias = target === unknownSymbol ||
((target.flags & 111551 /* Value */) && !isConstEnumOrConstEnumOnlyModule(target) && !getTypeOnlyAliasDeclaration(symbol));
if (markAlias) {
markAliasSymbolAsReferenced(symbol);
}
}
}
// When an alias symbol is referenced, we need to mark the entity it references as referenced and in turn repeat that until
// we reach a non-alias or an exported entity (which is always considered referenced). We do this by checking the target of
// the alias as an expression (which recursively takes us back here if the target references another alias).
function markAliasSymbolAsReferenced(symbol) {
var links = getSymbolLinks(symbol);
if (!links.referenced) {
links.referenced = true;
var node = getDeclarationOfAliasSymbol(symbol);
if (!node)
return ts.Debug.fail();
// We defer checking of the reference of an `import =` until the import itself is referenced,
// This way a chain of imports can be elided if ultimately the final input is only used in a type
// position.
if (ts.isInternalModuleImportEqualsDeclaration(node)) {
var target = resolveSymbol(symbol);
if (target === unknownSymbol || target.flags & 111551 /* Value */) {
// import foo = <symbol>
checkExpressionCached(node.moduleReference);
}
}
}
}
// Aliases that resolve to const enums are not marked as referenced because they are not emitted,
// but their usage in value positions must be tracked to determine if the import can be type-only.
function markConstEnumAliasAsReferenced(symbol) {
var links = getSymbolLinks(symbol);
if (!links.constEnumReferenced) {
links.constEnumReferenced = true;
}
}
// This function is only for imports with entity names
function getSymbolOfPartOfRightHandSideOfImportEquals(entityName, dontResolveAlias) {
// There are three things we might try to look for. In the following examples,
// the search term is enclosed in |...|:
//
// import a = |b|; // Namespace
// import a = |b.c|; // Value, type, namespace
// import a = |b.c|.d; // Namespace
if (entityName.kind === 79 /* Identifier */ && ts.isRightSideOfQualifiedNameOrPropertyAccess(entityName)) {
entityName = entityName.parent;
}
// Check for case 1 and 3 in the above example
if (entityName.kind === 79 /* Identifier */ || entityName.parent.kind === 159 /* QualifiedName */) {
return resolveEntityName(entityName, 1920 /* Namespace */, /*ignoreErrors*/ false, dontResolveAlias);
}
else {
// Case 2 in above example
// entityName.kind could be a QualifiedName or a Missing identifier
ts.Debug.assert(entityName.parent.kind === 263 /* ImportEqualsDeclaration */);
return resolveEntityName(entityName, 111551 /* Value */ | 788968 /* Type */ | 1920 /* Namespace */, /*ignoreErrors*/ false, dontResolveAlias);
}
}
function getFullyQualifiedName(symbol, containingLocation) {
return symbol.parent ? getFullyQualifiedName(symbol.parent, containingLocation) + "." + symbolToString(symbol) : symbolToString(symbol, containingLocation, /*meaning*/ undefined, 16 /* DoNotIncludeSymbolChain */ | 4 /* AllowAnyNodeKind */);
}
/**
* Resolves a qualified name and any involved aliases.
*/
function resolveEntityName(name, meaning, ignoreErrors, dontResolveAlias, location) {
if (ts.nodeIsMissing(name)) {
return undefined;
}
var namespaceMeaning = 1920 /* Namespace */ | (ts.isInJSFile(name) ? meaning & 111551 /* Value */ : 0);
var symbol;
if (name.kind === 79 /* Identifier */) {
var message = meaning === namespaceMeaning || ts.nodeIsSynthesized(name) ? ts.Diagnostics.Cannot_find_namespace_0 : getCannotFindNameDiagnosticForName(ts.getFirstIdentifier(name));
var symbolFromJSPrototype = ts.isInJSFile(name) && !ts.nodeIsSynthesized(name) ? resolveEntityNameFromAssignmentDeclaration(name, meaning) : undefined;
symbol = getMergedSymbol(resolveName(location || name, name.escapedText, meaning, ignoreErrors || symbolFromJSPrototype ? undefined : message, name, /*isUse*/ true));
if (!symbol) {
return getMergedSymbol(symbolFromJSPrototype);
}
}
else if (name.kind === 159 /* QualifiedName */ || name.kind === 204 /* PropertyAccessExpression */) {
var left = name.kind === 159 /* QualifiedName */ ? name.left : name.expression;
var right = name.kind === 159 /* QualifiedName */ ? name.right : name.name;
var namespace = resolveEntityName(left, namespaceMeaning, ignoreErrors, /*dontResolveAlias*/ false, location);
if (!namespace || ts.nodeIsMissing(right)) {
return undefined;
}
else if (namespace === unknownSymbol) {
return namespace;
}
if (namespace.valueDeclaration &&
ts.isInJSFile(namespace.valueDeclaration) &&
ts.isVariableDeclaration(namespace.valueDeclaration) &&
namespace.valueDeclaration.initializer &&
isCommonJsRequire(namespace.valueDeclaration.initializer)) {
var moduleName = namespace.valueDeclaration.initializer.arguments[0];
var moduleSym = resolveExternalModuleName(moduleName, moduleName);
if (moduleSym) {
var resolvedModuleSymbol = resolveExternalModuleSymbol(moduleSym);
if (resolvedModuleSymbol) {
namespace = resolvedModuleSymbol;
}
}
}
symbol = getMergedSymbol(getSymbol(getExportsOfSymbol(namespace), right.escapedText, meaning));
if (!symbol) {
if (!ignoreErrors) {
var namespaceName = getFullyQualifiedName(namespace);
var declarationName = ts.declarationNameToString(right);
var suggestion = getSuggestedSymbolForNonexistentModule(right, namespace);
suggestion ?
error(right, ts.Diagnostics._0_has_no_exported_member_named_1_Did_you_mean_2, namespaceName, declarationName, symbolToString(suggestion)) :
error(right, ts.Diagnostics.Namespace_0_has_no_exported_member_1, namespaceName, declarationName);
}
return undefined;
}
}
else {
throw ts.Debug.assertNever(name, "Unknown entity name kind.");
}
ts.Debug.assert((ts.getCheckFlags(symbol) & 1 /* Instantiated */) === 0, "Should never get an instantiated symbol here.");
if (!ts.nodeIsSynthesized(name) && ts.isEntityName(name) && (symbol.flags & 2097152 /* Alias */ || name.parent.kind === 269 /* ExportAssignment */)) {
markSymbolOfAliasDeclarationIfTypeOnly(ts.getAliasDeclarationFromName(name), symbol, /*finalTarget*/ undefined, /*overwriteEmpty*/ true);
}
return (symbol.flags & meaning) || dontResolveAlias ? symbol : resolveAlias(symbol);
}
/**
* 1. For prototype-property methods like `A.prototype.m = function () ...`, try to resolve names in the scope of `A` too.
* Note that prototype-property assignment to locations outside the current file (eg globals) doesn't work, so
* name resolution won't work either.
* 2. For property assignments like `{ x: function f () { } }`, try to resolve names in the scope of `f` too.
*/
function resolveEntityNameFromAssignmentDeclaration(name, meaning) {
if (isJSDocTypeReference(name.parent)) {
var secondaryLocation = getAssignmentDeclarationLocation(name.parent);
if (secondaryLocation) {
return resolveName(secondaryLocation, name.escapedText, meaning, /*nameNotFoundMessage*/ undefined, name, /*isUse*/ true);
}
}
}
function getAssignmentDeclarationLocation(node) {
var typeAlias = ts.findAncestor(node, function (node) { return !(ts.isJSDocNode(node) || node.flags & 4194304 /* JSDoc */) ? "quit" : ts.isJSDocTypeAlias(node); });
if (typeAlias) {
return;
}
var host = ts.getJSDocHost(node);
if (host &&
ts.isExpressionStatement(host) &&
ts.isBinaryExpression(host.expression) &&
ts.getAssignmentDeclarationKind(host.expression) === 3 /* PrototypeProperty */) {
// X.prototype.m = /** @param {K} p */ function () { } <-- look for K on X's declaration
var symbol = getSymbolOfNode(host.expression.left);
if (symbol) {
return getDeclarationOfJSPrototypeContainer(symbol);
}
}
if (host && (ts.isObjectLiteralMethod(host) || ts.isPropertyAssignment(host)) &&
ts.isBinaryExpression(host.parent.parent) &&
ts.getAssignmentDeclarationKind(host.parent.parent) === 6 /* Prototype */) {
// X.prototype = { /** @param {K} p */m() { } } <-- look for K on X's declaration
var symbol = getSymbolOfNode(host.parent.parent.left);
if (symbol) {
return getDeclarationOfJSPrototypeContainer(symbol);
}
}
var sig = ts.getEffectiveJSDocHost(node);
if (sig && ts.isFunctionLike(sig)) {
var symbol = getSymbolOfNode(sig);
return symbol && symbol.valueDeclaration;
}
}
function getDeclarationOfJSPrototypeContainer(symbol) {
var decl = symbol.parent.valueDeclaration;
if (!decl) {
return undefined;
}
var initializer = ts.isAssignmentDeclaration(decl) ? ts.getAssignedExpandoInitializer(decl) :
ts.hasOnlyExpressionInitializer(decl) ? ts.getDeclaredExpandoInitializer(decl) :
undefined;
return initializer || decl;
}
/**
* Get the real symbol of a declaration with an expando initializer.
*
* Normally, declarations have an associated symbol, but when a declaration has an expando
* initializer, the expando's symbol is the one that has all the members merged into it.
*/
function getExpandoSymbol(symbol) {
var decl = symbol.valueDeclaration;
if (!decl || !ts.isInJSFile(decl) || symbol.flags & 524288 /* TypeAlias */ || ts.getExpandoInitializer(decl, /*isPrototypeAssignment*/ false)) {
return undefined;
}
var init = ts.isVariableDeclaration(decl) ? ts.getDeclaredExpandoInitializer(decl) : ts.getAssignedExpandoInitializer(decl);
if (init) {
var initSymbol = getSymbolOfNode(init);
if (initSymbol) {
return mergeJSSymbols(initSymbol, symbol);
}
}
}
function resolveExternalModuleName(location, moduleReferenceExpression, ignoreErrors) {
var isClassic = ts.getEmitModuleResolutionKind(compilerOptions) === ts.ModuleResolutionKind.Classic;
var errorMessage = isClassic ?
ts.Diagnostics.Cannot_find_module_0_Did_you_mean_to_set_the_moduleResolution_option_to_node_or_to_add_aliases_to_the_paths_option
: ts.Diagnostics.Cannot_find_module_0_or_its_corresponding_type_declarations;
return resolveExternalModuleNameWorker(location, moduleReferenceExpression, ignoreErrors ? undefined : errorMessage);
}
function resolveExternalModuleNameWorker(location, moduleReferenceExpression, moduleNotFoundError, isForAugmentation) {
if (isForAugmentation === void 0) { isForAugmentation = false; }
return ts.isStringLiteralLike(moduleReferenceExpression)
? resolveExternalModule(location, moduleReferenceExpression.text, moduleNotFoundError, moduleReferenceExpression, isForAugmentation)
: undefined;
}
function resolveExternalModule(location, moduleReference, moduleNotFoundError, errorNode, isForAugmentation) {
if (isForAugmentation === void 0) { isForAugmentation = false; }
if (ts.startsWith(moduleReference, "@types/")) {
var diag = ts.Diagnostics.Cannot_import_type_declaration_files_Consider_importing_0_instead_of_1;
var withoutAtTypePrefix = ts.removePrefix(moduleReference, "@types/");
error(errorNode, diag, withoutAtTypePrefix, moduleReference);
}
var ambientModule = tryFindAmbientModule(moduleReference, /*withAugmentations*/ true);
if (ambientModule) {
return ambientModule;
}
var currentSourceFile = ts.getSourceFileOfNode(location);
var resolvedModule = ts.getResolvedModule(currentSourceFile, moduleReference); // TODO: GH#18217
var resolutionDiagnostic = resolvedModule && ts.getResolutionDiagnostic(compilerOptions, resolvedModule);
var sourceFile = resolvedModule && !resolutionDiagnostic && host.getSourceFile(resolvedModule.resolvedFileName);
if (sourceFile) {
if (sourceFile.symbol) {
if (resolvedModule.isExternalLibraryImport && !ts.resolutionExtensionIsTSOrJson(resolvedModule.extension)) {
errorOnImplicitAnyModule(/*isError*/ false, errorNode, resolvedModule, moduleReference);
}
// merged symbol is module declaration symbol combined with all augmentations
return getMergedSymbol(sourceFile.symbol);
}
if (moduleNotFoundError) {
// report errors only if it was requested
error(errorNode, ts.Diagnostics.File_0_is_not_a_module, sourceFile.fileName);
}
return undefined;
}
if (patternAmbientModules) {
var pattern = ts.findBestPatternMatch(patternAmbientModules, function (_) { return _.pattern; }, moduleReference);
if (pattern) {
// If the module reference matched a pattern ambient module ('*.foo') but there's also a
// module augmentation by the specific name requested ('a.foo'), we store the merged symbol
// by the augmentation name ('a.foo'), because asking for *.foo should not give you exports
// from a.foo.
var augmentation = patternAmbientModuleAugmentations && patternAmbientModuleAugmentations.get(moduleReference);
if (augmentation) {
return getMergedSymbol(augmentation);
}
return getMergedSymbol(pattern.symbol);
}
}
// May be an untyped module. If so, ignore resolutionDiagnostic.
if (resolvedModule && !ts.resolutionExtensionIsTSOrJson(resolvedModule.extension) && resolutionDiagnostic === undefined || resolutionDiagnostic === ts.Diagnostics.Could_not_find_a_declaration_file_for_module_0_1_implicitly_has_an_any_type) {
if (isForAugmentation) {
var diag = ts.Diagnostics.Invalid_module_name_in_augmentation_Module_0_resolves_to_an_untyped_module_at_1_which_cannot_be_augmented;
error(errorNode, diag, moduleReference, resolvedModule.resolvedFileName);
}
else {
errorOnImplicitAnyModule(/*isError*/ noImplicitAny && !!moduleNotFoundError, errorNode, resolvedModule, moduleReference);
}
// Failed imports and untyped modules are both treated in an untyped manner; only difference is whether we give a diagnostic first.
return undefined;
}
if (moduleNotFoundError) {
// See if this was possibly a projectReference redirect
if (resolvedModule) {
var redirect = host.getProjectReferenceRedirect(resolvedModule.resolvedFileName);
if (redirect) {
error(errorNode, ts.Diagnostics.Output_file_0_has_not_been_built_from_source_file_1, redirect, resolvedModule.resolvedFileName);
return undefined;
}
}
if (resolutionDiagnostic) {
error(errorNode, resolutionDiagnostic, moduleReference, resolvedModule.resolvedFileName);
}
else {
var tsExtension = ts.tryExtractTSExtension(moduleReference);
if (tsExtension) {
var diag = ts.Diagnostics.An_import_path_cannot_end_with_a_0_extension_Consider_importing_1_instead;
var importSourceWithoutExtension = ts.removeExtension(moduleReference, tsExtension);
var replacedImportSource = importSourceWithoutExtension;
/**
* Direct users to import source with .js extension if outputting an ES module.
* @see https://github.com/microsoft/TypeScript/issues/42151
*/
var moduleKind_1 = ts.getEmitModuleKind(compilerOptions);
if (moduleKind_1 >= ts.ModuleKind.ES2015) {
replacedImportSource += ".js";
}
error(errorNode, diag, tsExtension, replacedImportSource);
}
else if (!compilerOptions.resolveJsonModule &&
ts.fileExtensionIs(moduleReference, ".json" /* Json */) &&
ts.getEmitModuleResolutionKind(compilerOptions) === ts.ModuleResolutionKind.NodeJs &&
ts.hasJsonModuleEmitEnabled(compilerOptions)) {
error(errorNode, ts.Diagnostics.Cannot_find_module_0_Consider_using_resolveJsonModule_to_import_module_with_json_extension, moduleReference);
}
else {
error(errorNode, moduleNotFoundError, moduleReference);
}
}
}
return undefined;
}
function errorOnImplicitAnyModule(isError, errorNode, _a, moduleReference) {
var packageId = _a.packageId, resolvedFileName = _a.resolvedFileName;
var errorInfo = !ts.isExternalModuleNameRelative(moduleReference) && packageId
? typesPackageExists(packageId.name)
? ts.chainDiagnosticMessages(
/*details*/ undefined, ts.Diagnostics.If_the_0_package_actually_exposes_this_module_consider_sending_a_pull_request_to_amend_https_Colon_Slash_Slashgithub_com_SlashDefinitelyTyped_SlashDefinitelyTyped_Slashtree_Slashmaster_Slashtypes_Slash_1, packageId.name, ts.mangleScopedPackageName(packageId.name))
: ts.chainDiagnosticMessages(
/*details*/ undefined, ts.Diagnostics.Try_npm_i_save_dev_types_Slash_1_if_it_exists_or_add_a_new_declaration_d_ts_file_containing_declare_module_0, moduleReference, ts.mangleScopedPackageName(packageId.name))
: undefined;
errorOrSuggestion(isError, errorNode, ts.chainDiagnosticMessages(errorInfo, ts.Diagnostics.Could_not_find_a_declaration_file_for_module_0_1_implicitly_has_an_any_type, moduleReference, resolvedFileName));
}
function typesPackageExists(packageName) {
return getPackagesSet().has(ts.getTypesPackageName(packageName));
}
function resolveExternalModuleSymbol(moduleSymbol, dontResolveAlias) {
if (moduleSymbol === null || moduleSymbol === void 0 ? void 0 : moduleSymbol.exports) {
var exportEquals = resolveSymbol(moduleSymbol.exports.get("export=" /* ExportEquals */), dontResolveAlias);
var exported = getCommonJsExportEquals(getMergedSymbol(exportEquals), getMergedSymbol(moduleSymbol));
return getMergedSymbol(exported) || moduleSymbol;
}
return undefined;
}
function getCommonJsExportEquals(exported, moduleSymbol) {
if (!exported || exported === unknownSymbol || exported === moduleSymbol || moduleSymbol.exports.size === 1 || exported.flags & 2097152 /* Alias */) {
return exported;
}
var links = getSymbolLinks(exported);
if (links.cjsExportMerged) {
return links.cjsExportMerged;
}
var merged = exported.flags & 33554432 /* Transient */ ? exported : cloneSymbol(exported);
merged.flags = merged.flags | 512 /* ValueModule */;
if (merged.exports === undefined) {
merged.exports = ts.createSymbolTable();
}
moduleSymbol.exports.forEach(function (s, name) {
if (name === "export=" /* ExportEquals */)
return;
merged.exports.set(name, merged.exports.has(name) ? mergeSymbol(merged.exports.get(name), s) : s);
});
getSymbolLinks(merged).cjsExportMerged = merged;
return links.cjsExportMerged = merged;
}
// An external module with an 'export =' declaration may be referenced as an ES6 module provided the 'export ='
// references a symbol that is at least declared as a module or a variable. The target of the 'export =' may
// combine other declarations with the module or variable (e.g. a class/module, function/module, interface/variable).
function resolveESModuleSymbol(moduleSymbol, referencingLocation, dontResolveAlias, suppressInteropError) {
var symbol = resolveExternalModuleSymbol(moduleSymbol, dontResolveAlias);
if (!dontResolveAlias && symbol) {
if (!suppressInteropError && !(symbol.flags & (1536 /* Module */ | 3 /* Variable */)) && !ts.getDeclarationOfKind(symbol, 300 /* SourceFile */)) {
var compilerOptionName = moduleKind >= ts.ModuleKind.ES2015
? "allowSyntheticDefaultImports"
: "esModuleInterop";
error(referencingLocation, ts.Diagnostics.This_module_can_only_be_referenced_with_ECMAScript_imports_Slashexports_by_turning_on_the_0_flag_and_referencing_its_default_export, compilerOptionName);
return symbol;
}
if (compilerOptions.esModuleInterop) {
var referenceParent = referencingLocation.parent;
if ((ts.isImportDeclaration(referenceParent) && ts.getNamespaceDeclarationNode(referenceParent)) ||
ts.isImportCall(referenceParent)) {
var type = getTypeOfSymbol(symbol);
var sigs = getSignaturesOfStructuredType(type, 0 /* Call */);
if (!sigs || !sigs.length) {
sigs = getSignaturesOfStructuredType(type, 1 /* Construct */);
}
if (sigs && sigs.length) {
var moduleType = getTypeWithSyntheticDefaultImportType(type, symbol, moduleSymbol);
// Create a new symbol which has the module's type less the call and construct signatures
var result = createSymbol(symbol.flags, symbol.escapedName);
result.declarations = symbol.declarations ? symbol.declarations.slice() : [];
result.parent = symbol.parent;
result.target = symbol;
result.originatingImport = referenceParent;
if (symbol.valueDeclaration)
result.valueDeclaration = symbol.valueDeclaration;
if (symbol.constEnumOnlyModule)
result.constEnumOnlyModule = true;
if (symbol.members)
result.members = new ts.Map(symbol.members);
if (symbol.exports)
result.exports = new ts.Map(symbol.exports);
var resolvedModuleType = resolveStructuredTypeMembers(moduleType); // Should already be resolved from the signature checks above
result.type = createAnonymousType(result, resolvedModuleType.members, ts.emptyArray, ts.emptyArray, resolvedModuleType.indexInfos);
return result;
}
}
}
}
return symbol;
}
function hasExportAssignmentSymbol(moduleSymbol) {
return moduleSymbol.exports.get("export=" /* ExportEquals */) !== undefined;
}
function getExportsOfModuleAsArray(moduleSymbol) {
return symbolsToArray(getExportsOfModule(moduleSymbol));
}
function getExportsAndPropertiesOfModule(moduleSymbol) {
var exports = getExportsOfModuleAsArray(moduleSymbol);
var exportEquals = resolveExternalModuleSymbol(moduleSymbol);
if (exportEquals !== moduleSymbol) {
var type = getTypeOfSymbol(exportEquals);
if (shouldTreatPropertiesOfExternalModuleAsExports(type)) {
ts.addRange(exports, getPropertiesOfType(type));
}
}
return exports;
}
function forEachExportAndPropertyOfModule(moduleSymbol, cb) {
var exports = getExportsOfModule(moduleSymbol);
exports.forEach(function (symbol, key) {
if (!isReservedMemberName(key)) {
cb(symbol, key);
}
});
var exportEquals = resolveExternalModuleSymbol(moduleSymbol);
if (exportEquals !== moduleSymbol) {
var type = getTypeOfSymbol(exportEquals);
if (shouldTreatPropertiesOfExternalModuleAsExports(type)) {
getPropertiesOfType(type).forEach(function (symbol) {
cb(symbol, symbol.escapedName);
});
}
}
}
function tryGetMemberInModuleExports(memberName, moduleSymbol) {
var symbolTable = getExportsOfModule(moduleSymbol);
if (symbolTable) {
return symbolTable.get(memberName);
}
}
function tryGetMemberInModuleExportsAndProperties(memberName, moduleSymbol) {
var symbol = tryGetMemberInModuleExports(memberName, moduleSymbol);
if (symbol) {
return symbol;
}
var exportEquals = resolveExternalModuleSymbol(moduleSymbol);
if (exportEquals === moduleSymbol) {
return undefined;
}
var type = getTypeOfSymbol(exportEquals);
return shouldTreatPropertiesOfExternalModuleAsExports(type) ? getPropertyOfType(type, memberName) : undefined;
}
function shouldTreatPropertiesOfExternalModuleAsExports(resolvedExternalModuleType) {
return !(resolvedExternalModuleType.flags & 131068 /* Primitive */ ||
ts.getObjectFlags(resolvedExternalModuleType) & 1 /* Class */ ||
// `isArrayOrTupleLikeType` is too expensive to use in this auto-imports hot path
isArrayType(resolvedExternalModuleType) ||
isTupleType(resolvedExternalModuleType));
}
function getExportsOfSymbol(symbol) {
return symbol.flags & 6256 /* LateBindingContainer */ ? getResolvedMembersOrExportsOfSymbol(symbol, "resolvedExports" /* resolvedExports */) :
symbol.flags & 1536 /* Module */ ? getExportsOfModule(symbol) :
symbol.exports || emptySymbols;
}
function getExportsOfModule(moduleSymbol) {
var links = getSymbolLinks(moduleSymbol);
return links.resolvedExports || (links.resolvedExports = getExportsOfModuleWorker(moduleSymbol));
}
/**
* Extends one symbol table with another while collecting information on name collisions for error message generation into the `lookupTable` argument
* Not passing `lookupTable` and `exportNode` disables this collection, and just extends the tables
*/
function extendExportSymbols(target, source, lookupTable, exportNode) {
if (!source)
return;
source.forEach(function (sourceSymbol, id) {
if (id === "default" /* Default */)
return;
var targetSymbol = target.get(id);
if (!targetSymbol) {
target.set(id, sourceSymbol);
if (lookupTable && exportNode) {
lookupTable.set(id, {
specifierText: ts.getTextOfNode(exportNode.moduleSpecifier)
});
}
}
else if (lookupTable && exportNode && targetSymbol && resolveSymbol(targetSymbol) !== resolveSymbol(sourceSymbol)) {
var collisionTracker = lookupTable.get(id);
if (!collisionTracker.exportsWithDuplicate) {
collisionTracker.exportsWithDuplicate = [exportNode];
}
else {
collisionTracker.exportsWithDuplicate.push(exportNode);
}
}
});
}
function getExportsOfModuleWorker(moduleSymbol) {
var visitedSymbols = [];
// A module defined by an 'export=' consists of one export that needs to be resolved
moduleSymbol = resolveExternalModuleSymbol(moduleSymbol);
return visit(moduleSymbol) || emptySymbols;
// The ES6 spec permits export * declarations in a module to circularly reference the module itself. For example,
// module 'a' can 'export * from "b"' and 'b' can 'export * from "a"' without error.
function visit(symbol) {
if (!(symbol && symbol.exports && ts.pushIfUnique(visitedSymbols, symbol))) {
return;
}
var symbols = new ts.Map(symbol.exports);
// All export * declarations are collected in an __export symbol by the binder
var exportStars = symbol.exports.get("__export" /* ExportStar */);
if (exportStars) {
var nestedSymbols = ts.createSymbolTable();
var lookupTable_1 = new ts.Map();
if (exportStars.declarations) {
for (var _i = 0, _a = exportStars.declarations; _i < _a.length; _i++) {
var node = _a[_i];
var resolvedModule = resolveExternalModuleName(node, node.moduleSpecifier);
var exportedSymbols = visit(resolvedModule);
extendExportSymbols(nestedSymbols, exportedSymbols, lookupTable_1, node);
}
}
lookupTable_1.forEach(function (_a, id) {
var exportsWithDuplicate = _a.exportsWithDuplicate;
// It's not an error if the file with multiple `export *`s with duplicate names exports a member with that name itself
if (id === "export=" || !(exportsWithDuplicate && exportsWithDuplicate.length) || symbols.has(id)) {
return;
}
for (var _i = 0, exportsWithDuplicate_1 = exportsWithDuplicate; _i < exportsWithDuplicate_1.length; _i++) {
var node = exportsWithDuplicate_1[_i];
diagnostics.add(ts.createDiagnosticForNode(node, ts.Diagnostics.Module_0_has_already_exported_a_member_named_1_Consider_explicitly_re_exporting_to_resolve_the_ambiguity, lookupTable_1.get(id).specifierText, ts.unescapeLeadingUnderscores(id)));
}
});
extendExportSymbols(symbols, nestedSymbols);
}
return symbols;
}
}
function getMergedSymbol(symbol) {
var merged;
return symbol && symbol.mergeId && (merged = mergedSymbols[symbol.mergeId]) ? merged : symbol;
}
function getSymbolOfNode(node) {
return getMergedSymbol(node.symbol && getLateBoundSymbol(node.symbol));
}
function getParentOfSymbol(symbol) {
return getMergedSymbol(symbol.parent && getLateBoundSymbol(symbol.parent));
}
function getAlternativeContainingModules(symbol, enclosingDeclaration) {
var containingFile = ts.getSourceFileOfNode(enclosingDeclaration);
var id = getNodeId(containingFile);
var links = getSymbolLinks(symbol);
var results;
if (links.extendedContainersByFile && (results = links.extendedContainersByFile.get(id))) {
return results;
}
if (containingFile && containingFile.imports) {
// Try to make an import using an import already in the enclosing file, if possible
for (var _i = 0, _a = containingFile.imports; _i < _a.length; _i++) {
var importRef = _a[_i];
if (ts.nodeIsSynthesized(importRef))
continue; // Synthetic names can't be resolved by `resolveExternalModuleName` - they'll cause a debug assert if they error
var resolvedModule = resolveExternalModuleName(enclosingDeclaration, importRef, /*ignoreErrors*/ true);
if (!resolvedModule)
continue;
var ref = getAliasForSymbolInContainer(resolvedModule, symbol);
if (!ref)
continue;
results = ts.append(results, resolvedModule);
}
if (ts.length(results)) {
(links.extendedContainersByFile || (links.extendedContainersByFile = new ts.Map())).set(id, results);
return results;
}
}
if (links.extendedContainers) {
return links.extendedContainers;
}
// No results from files already being imported by this file - expand search (expensive, but not location-specific, so cached)
var otherFiles = host.getSourceFiles();
for (var _b = 0, otherFiles_1 = otherFiles; _b < otherFiles_1.length; _b++) {
var file = otherFiles_1[_b];
if (!ts.isExternalModule(file))
continue;
var sym = getSymbolOfNode(file);
var ref = getAliasForSymbolInContainer(sym, symbol);
if (!ref)
continue;
results = ts.append(results, sym);
}
return links.extendedContainers = results || ts.emptyArray;
}
/**
* Attempts to find the symbol corresponding to the container a symbol is in - usually this
* is just its' `.parent`, but for locals, this value is `undefined`
*/
function getContainersOfSymbol(symbol, enclosingDeclaration, meaning) {
var container = getParentOfSymbol(symbol);
// Type parameters end up in the `members` lists but are not externally visible
if (container && !(symbol.flags & 262144 /* TypeParameter */)) {
var additionalContainers = ts.mapDefined(container.declarations, fileSymbolIfFileSymbolExportEqualsContainer);
var reexportContainers = enclosingDeclaration && getAlternativeContainingModules(symbol, enclosingDeclaration);
var objectLiteralContainer = getVariableDeclarationOfObjectLiteral(container, meaning);
if (enclosingDeclaration &&
container.flags & getQualifiedLeftMeaning(meaning) &&
getAccessibleSymbolChain(container, enclosingDeclaration, 1920 /* Namespace */, /*externalOnly*/ false)) {
return ts.append(ts.concatenate(ts.concatenate([container], additionalContainers), reexportContainers), objectLiteralContainer); // This order expresses a preference for the real container if it is in scope
}
// we potentially have a symbol which is a member of the instance side of something - look for a variable in scope with the container's type
// which may be acting like a namespace (eg, `Symbol` acts like a namespace when looking up `Symbol.toStringTag`)
var firstVariableMatch = !(container.flags & getQualifiedLeftMeaning(meaning))
&& container.flags & 788968 /* Type */
&& getDeclaredTypeOfSymbol(container).flags & 524288 /* Object */
&& meaning === 111551 /* Value */
? forEachSymbolTableInScope(enclosingDeclaration, function (t) {
return ts.forEachEntry(t, function (s) {
if (s.flags & getQualifiedLeftMeaning(meaning) && getTypeOfSymbol(s) === getDeclaredTypeOfSymbol(container)) {
return s;
}
});
}) : undefined;
var res = firstVariableMatch ? __spreadArray(__spreadArray([firstVariableMatch], additionalContainers, true), [container], false) : __spreadArray(__spreadArray([], additionalContainers, true), [container], false);
res = ts.append(res, objectLiteralContainer);
res = ts.addRange(res, reexportContainers);
return res;
}
var candidates = ts.mapDefined(symbol.declarations, function (d) {
if (!ts.isAmbientModule(d) && d.parent && hasNonGlobalAugmentationExternalModuleSymbol(d.parent)) {
return getSymbolOfNode(d.parent);
}
if (ts.isClassExpression(d) && ts.isBinaryExpression(d.parent) && d.parent.operatorToken.kind === 63 /* EqualsToken */ && ts.isAccessExpression(d.parent.left) && ts.isEntityNameExpression(d.parent.left.expression)) {
if (ts.isModuleExportsAccessExpression(d.parent.left) || ts.isExportsIdentifier(d.parent.left.expression)) {
return getSymbolOfNode(ts.getSourceFileOfNode(d));
}
checkExpressionCached(d.parent.left.expression);
return getNodeLinks(d.parent.left.expression).resolvedSymbol;
}
});
if (!ts.length(candidates)) {
return undefined;
}
return ts.mapDefined(candidates, function (candidate) { return getAliasForSymbolInContainer(candidate, symbol) ? candidate : undefined; });
function fileSymbolIfFileSymbolExportEqualsContainer(d) {
return container && getFileSymbolIfFileSymbolExportEqualsContainer(d, container);
}
}
function getVariableDeclarationOfObjectLiteral(symbol, meaning) {
// If we're trying to reference some object literal in, eg `var a = { x: 1 }`, the symbol for the literal, `__object`, is distinct
// from the symbol of the declaration it is being assigned to. Since we can use the declaration to refer to the literal, however,
// we'd like to make that connection here - potentially causing us to paint the declaration's visibility, and therefore the literal.
var firstDecl = !!ts.length(symbol.declarations) && ts.first(symbol.declarations);
if (meaning & 111551 /* Value */ && firstDecl && firstDecl.parent && ts.isVariableDeclaration(firstDecl.parent)) {
if (ts.isObjectLiteralExpression(firstDecl) && firstDecl === firstDecl.parent.initializer || ts.isTypeLiteralNode(firstDecl) && firstDecl === firstDecl.parent.type) {
return getSymbolOfNode(firstDecl.parent);
}
}
}
function getFileSymbolIfFileSymbolExportEqualsContainer(d, container) {
var fileSymbol = getExternalModuleContainer(d);
var exported = fileSymbol && fileSymbol.exports && fileSymbol.exports.get("export=" /* ExportEquals */);
return exported && getSymbolIfSameReference(exported, container) ? fileSymbol : undefined;
}
function getAliasForSymbolInContainer(container, symbol) {
if (container === getParentOfSymbol(symbol)) {
// fast path, `symbol` is either already the alias or isn't aliased
return symbol;
}
// Check if container is a thing with an `export=` which points directly at `symbol`, and if so, return
// the container itself as the alias for the symbol
var exportEquals = container.exports && container.exports.get("export=" /* ExportEquals */);
if (exportEquals && getSymbolIfSameReference(exportEquals, symbol)) {
return container;
}
var exports = getExportsOfSymbol(container);
var quick = exports.get(symbol.escapedName);
if (quick && getSymbolIfSameReference(quick, symbol)) {
return quick;
}
return ts.forEachEntry(exports, function (exported) {
if (getSymbolIfSameReference(exported, symbol)) {
return exported;
}
});
}
/**
* Checks if two symbols, through aliasing and/or merging, refer to the same thing
*/
function getSymbolIfSameReference(s1, s2) {
if (getMergedSymbol(resolveSymbol(getMergedSymbol(s1))) === getMergedSymbol(resolveSymbol(getMergedSymbol(s2)))) {
return s1;
}
}
function getExportSymbolOfValueSymbolIfExported(symbol) {
return getMergedSymbol(symbol && (symbol.flags & 1048576 /* ExportValue */) !== 0 ? symbol.exportSymbol : symbol);
}
function symbolIsValue(symbol) {
return !!(symbol.flags & 111551 /* Value */ || symbol.flags & 2097152 /* Alias */ && resolveAlias(symbol).flags & 111551 /* Value */ && !getTypeOnlyAliasDeclaration(symbol));
}
function findConstructorDeclaration(node) {
var members = node.members;
for (var _i = 0, members_3 = members; _i < members_3.length; _i++) {
var member = members_3[_i];
if (member.kind === 169 /* Constructor */ && ts.nodeIsPresent(member.body)) {
return member;
}
}
}
function createType(flags) {
var result = new Type(checker, flags);
typeCount++;
result.id = typeCount;
if (produceDiagnostics) { // Only record types from one checker
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.recordType(result);
}
return result;
}
function createOriginType(flags) {
return new Type(checker, flags);
}
function createIntrinsicType(kind, intrinsicName, objectFlags) {
if (objectFlags === void 0) { objectFlags = 0; }
var type = createType(kind);
type.intrinsicName = intrinsicName;
type.objectFlags = objectFlags;
return type;
}
function createObjectType(objectFlags, symbol) {
var type = createType(524288 /* Object */);
type.objectFlags = objectFlags;
type.symbol = symbol;
type.members = undefined;
type.properties = undefined;
type.callSignatures = undefined;
type.constructSignatures = undefined;
type.indexInfos = undefined;
return type;
}
function createTypeofType() {
return getUnionType(ts.arrayFrom(typeofEQFacts.keys(), getStringLiteralType));
}
function createTypeParameter(symbol) {
var type = createType(262144 /* TypeParameter */);
if (symbol)
type.symbol = symbol;
return type;
}
// A reserved member name starts with two underscores, but the third character cannot be an underscore,
// @, or #. A third underscore indicates an escaped form of an identifier that started
// with at least two underscores. The @ character indicates that the name is denoted by a well known ES
// Symbol instance and the # character indicates that the name is a PrivateIdentifier.
function isReservedMemberName(name) {
return name.charCodeAt(0) === 95 /* _ */ &&
name.charCodeAt(1) === 95 /* _ */ &&
name.charCodeAt(2) !== 95 /* _ */ &&
name.charCodeAt(2) !== 64 /* at */ &&
name.charCodeAt(2) !== 35 /* hash */;
}
function getNamedMembers(members) {
var result;
members.forEach(function (symbol, id) {
if (!isReservedMemberName(id) && symbolIsValue(symbol)) {
(result || (result = [])).push(symbol);
}
});
return result || ts.emptyArray;
}
function getNamedOrIndexSignatureMembers(members) {
var result = getNamedMembers(members);
var index = getIndexSymbolFromSymbolTable(members);
return index ? ts.concatenate(result, [index]) : result;
}
function setStructuredTypeMembers(type, members, callSignatures, constructSignatures, indexInfos) {
var resolved = type;
resolved.members = members;
resolved.properties = ts.emptyArray;
resolved.callSignatures = callSignatures;
resolved.constructSignatures = constructSignatures;
resolved.indexInfos = indexInfos;
// This can loop back to getPropertyOfType() which would crash if `callSignatures` & `constructSignatures` are not initialized.
if (members !== emptySymbols)
resolved.properties = getNamedMembers(members);
return resolved;
}
function createAnonymousType(symbol, members, callSignatures, constructSignatures, indexInfos) {
return setStructuredTypeMembers(createObjectType(16 /* Anonymous */, symbol), members, callSignatures, constructSignatures, indexInfos);
}
function getResolvedTypeWithoutAbstractConstructSignatures(type) {
if (type.constructSignatures.length === 0)
return type;
if (type.objectTypeWithoutAbstractConstructSignatures)
return type.objectTypeWithoutAbstractConstructSignatures;
var constructSignatures = ts.filter(type.constructSignatures, function (signature) { return !(signature.flags & 4 /* Abstract */); });
if (type.constructSignatures === constructSignatures)
return type;
var typeCopy = createAnonymousType(type.symbol, type.members, type.callSignatures, ts.some(constructSignatures) ? constructSignatures : ts.emptyArray, type.indexInfos);
type.objectTypeWithoutAbstractConstructSignatures = typeCopy;
typeCopy.objectTypeWithoutAbstractConstructSignatures = typeCopy;
return typeCopy;
}
function forEachSymbolTableInScope(enclosingDeclaration, callback) {
var result;
var _loop_8 = function (location) {
// Locals of a source file are not in scope (because they get merged into the global symbol table)
if (location.locals && !isGlobalSourceFile(location)) {
if (result = callback(location.locals, /*ignoreQualification*/ undefined, /*isLocalNameLookup*/ true, location)) {
return { value: result };
}
}
switch (location.kind) {
case 300 /* SourceFile */:
if (!ts.isExternalOrCommonJsModule(location)) {
break;
}
// falls through
case 259 /* ModuleDeclaration */:
var sym = getSymbolOfNode(location);
// `sym` may not have exports if this module declaration is backed by the symbol for a `const` that's being rewritten
// into a namespace - in such cases, it's best to just let the namespace appear empty (the const members couldn't have referred
// to one another anyway)
if (result = callback((sym === null || sym === void 0 ? void 0 : sym.exports) || emptySymbols, /*ignoreQualification*/ undefined, /*isLocalNameLookup*/ true, location)) {
return { value: result };
}
break;
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
case 256 /* InterfaceDeclaration */:
// Type parameters are bound into `members` lists so they can merge across declarations
// This is troublesome, since in all other respects, they behave like locals :cries:
// TODO: the below is shared with similar code in `resolveName` - in fact, rephrasing all this symbol
// lookup logic in terms of `resolveName` would be nice
// The below is used to lookup type parameters within a class or interface, as they are added to the class/interface locals
// These can never be latebound, so the symbol's raw members are sufficient. `getMembersOfNode` cannot be used, as it would
// trigger resolving late-bound names, which we may already be in the process of doing while we're here!
var table_1;
// TODO: Should this filtered table be cached in some way?
(getSymbolOfNode(location).members || emptySymbols).forEach(function (memberSymbol, key) {
if (memberSymbol.flags & (788968 /* Type */ & ~67108864 /* Assignment */)) {
(table_1 || (table_1 = ts.createSymbolTable())).set(key, memberSymbol);
}
});
if (table_1 && (result = callback(table_1, /*ignoreQualification*/ undefined, /*isLocalNameLookup*/ false, location))) {
return { value: result };
}
break;
}
};
for (var location = enclosingDeclaration; location; location = location.parent) {
var state_2 = _loop_8(location);
if (typeof state_2 === "object")
return state_2.value;
}
return callback(globals, /*ignoreQualification*/ undefined, /*isLocalNameLookup*/ true);
}
function getQualifiedLeftMeaning(rightMeaning) {
// If we are looking in value space, the parent meaning is value, other wise it is namespace
return rightMeaning === 111551 /* Value */ ? 111551 /* Value */ : 1920 /* Namespace */;
}
function getAccessibleSymbolChain(symbol, enclosingDeclaration, meaning, useOnlyExternalAliasing, visitedSymbolTablesMap) {
if (visitedSymbolTablesMap === void 0) { visitedSymbolTablesMap = new ts.Map(); }
if (!(symbol && !isPropertyOrMethodDeclarationSymbol(symbol))) {
return undefined;
}
var links = getSymbolLinks(symbol);
var cache = (links.accessibleChainCache || (links.accessibleChainCache = new ts.Map()));
// Go from enclosingDeclaration to the first scope we check, so the cache is keyed off the scope and thus shared more
var firstRelevantLocation = forEachSymbolTableInScope(enclosingDeclaration, function (_, __, ___, node) { return node; });
var key = (useOnlyExternalAliasing ? 0 : 1) + "|" + (firstRelevantLocation && getNodeId(firstRelevantLocation)) + "|" + meaning;
if (cache.has(key)) {
return cache.get(key);
}
var id = getSymbolId(symbol);
var visitedSymbolTables = visitedSymbolTablesMap.get(id);
if (!visitedSymbolTables) {
visitedSymbolTablesMap.set(id, visitedSymbolTables = []);
}
var result = forEachSymbolTableInScope(enclosingDeclaration, getAccessibleSymbolChainFromSymbolTable);
cache.set(key, result);
return result;
/**
* @param {ignoreQualification} boolean Set when a symbol is being looked for through the exports of another symbol (meaning we have a route to qualify it already)
*/
function getAccessibleSymbolChainFromSymbolTable(symbols, ignoreQualification, isLocalNameLookup) {
if (!ts.pushIfUnique(visitedSymbolTables, symbols)) {
return undefined;
}
var result = trySymbolTable(symbols, ignoreQualification, isLocalNameLookup);
visitedSymbolTables.pop();
return result;
}
function canQualifySymbol(symbolFromSymbolTable, meaning) {
// If the symbol is equivalent and doesn't need further qualification, this symbol is accessible
return !needsQualification(symbolFromSymbolTable, enclosingDeclaration, meaning) ||
// If symbol needs qualification, make sure that parent is accessible, if it is then this symbol is accessible too
!!getAccessibleSymbolChain(symbolFromSymbolTable.parent, enclosingDeclaration, getQualifiedLeftMeaning(meaning), useOnlyExternalAliasing, visitedSymbolTablesMap);
}
function isAccessible(symbolFromSymbolTable, resolvedAliasSymbol, ignoreQualification) {
return (symbol === (resolvedAliasSymbol || symbolFromSymbolTable) || getMergedSymbol(symbol) === getMergedSymbol(resolvedAliasSymbol || symbolFromSymbolTable)) &&
// if the symbolFromSymbolTable is not external module (it could be if it was determined as ambient external module and would be in globals table)
// and if symbolFromSymbolTable or alias resolution matches the symbol,
// check the symbol can be qualified, it is only then this symbol is accessible
!ts.some(symbolFromSymbolTable.declarations, hasNonGlobalAugmentationExternalModuleSymbol) &&
(ignoreQualification || canQualifySymbol(getMergedSymbol(symbolFromSymbolTable), meaning));
}
function trySymbolTable(symbols, ignoreQualification, isLocalNameLookup) {
// If symbol is directly available by its name in the symbol table
if (isAccessible(symbols.get(symbol.escapedName), /*resolvedAliasSymbol*/ undefined, ignoreQualification)) {
return [symbol];
}
// Check if symbol is any of the aliases in scope
var result = ts.forEachEntry(symbols, function (symbolFromSymbolTable) {
if (symbolFromSymbolTable.flags & 2097152 /* Alias */
&& symbolFromSymbolTable.escapedName !== "export=" /* ExportEquals */
&& symbolFromSymbolTable.escapedName !== "default" /* Default */
&& !(ts.isUMDExportSymbol(symbolFromSymbolTable) && enclosingDeclaration && ts.isExternalModule(ts.getSourceFileOfNode(enclosingDeclaration)))
// If `!useOnlyExternalAliasing`, we can use any type of alias to get the name
&& (!useOnlyExternalAliasing || ts.some(symbolFromSymbolTable.declarations, ts.isExternalModuleImportEqualsDeclaration))
// If we're looking up a local name to reference directly, omit namespace reexports, otherwise when we're trawling through an export list to make a dotted name, we can keep it
&& (isLocalNameLookup ? !ts.some(symbolFromSymbolTable.declarations, ts.isNamespaceReexportDeclaration) : true)
// While exports are generally considered to be in scope, export-specifier declared symbols are _not_
// See similar comment in `resolveName` for details
&& (ignoreQualification || !ts.getDeclarationOfKind(symbolFromSymbolTable, 273 /* ExportSpecifier */))) {
var resolvedImportedSymbol = resolveAlias(symbolFromSymbolTable);
var candidate = getCandidateListForSymbol(symbolFromSymbolTable, resolvedImportedSymbol, ignoreQualification);
if (candidate) {
return candidate;
}
}
if (symbolFromSymbolTable.escapedName === symbol.escapedName && symbolFromSymbolTable.exportSymbol) {
if (isAccessible(getMergedSymbol(symbolFromSymbolTable.exportSymbol), /*aliasSymbol*/ undefined, ignoreQualification)) {
return [symbol];
}
}
});
// If there's no result and we're looking at the global symbol table, treat `globalThis` like an alias and try to lookup thru that
return result || (symbols === globals ? getCandidateListForSymbol(globalThisSymbol, globalThisSymbol, ignoreQualification) : undefined);
}
function getCandidateListForSymbol(symbolFromSymbolTable, resolvedImportedSymbol, ignoreQualification) {
if (isAccessible(symbolFromSymbolTable, resolvedImportedSymbol, ignoreQualification)) {
return [symbolFromSymbolTable];
}
// Look in the exported members, if we can find accessibleSymbolChain, symbol is accessible using this chain
// but only if the symbolFromSymbolTable can be qualified
var candidateTable = getExportsOfSymbol(resolvedImportedSymbol);
var accessibleSymbolsFromExports = candidateTable && getAccessibleSymbolChainFromSymbolTable(candidateTable, /*ignoreQualification*/ true);
if (accessibleSymbolsFromExports && canQualifySymbol(symbolFromSymbolTable, getQualifiedLeftMeaning(meaning))) {
return [symbolFromSymbolTable].concat(accessibleSymbolsFromExports);
}
}
}
function needsQualification(symbol, enclosingDeclaration, meaning) {
var qualify = false;
forEachSymbolTableInScope(enclosingDeclaration, function (symbolTable) {
// If symbol of this name is not available in the symbol table we are ok
var symbolFromSymbolTable = getMergedSymbol(symbolTable.get(symbol.escapedName));
if (!symbolFromSymbolTable) {
// Continue to the next symbol table
return false;
}
// If the symbol with this name is present it should refer to the symbol
if (symbolFromSymbolTable === symbol) {
// No need to qualify
return true;
}
// Qualify if the symbol from symbol table has same meaning as expected
symbolFromSymbolTable = (symbolFromSymbolTable.flags & 2097152 /* Alias */ && !ts.getDeclarationOfKind(symbolFromSymbolTable, 273 /* ExportSpecifier */)) ? resolveAlias(symbolFromSymbolTable) : symbolFromSymbolTable;
if (symbolFromSymbolTable.flags & meaning) {
qualify = true;
return true;
}
// Continue to the next symbol table
return false;
});
return qualify;
}
function isPropertyOrMethodDeclarationSymbol(symbol) {
if (symbol.declarations && symbol.declarations.length) {
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
switch (declaration.kind) {
case 165 /* PropertyDeclaration */:
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
continue;
default:
return false;
}
}
return true;
}
return false;
}
function isTypeSymbolAccessible(typeSymbol, enclosingDeclaration) {
var access = isSymbolAccessibleWorker(typeSymbol, enclosingDeclaration, 788968 /* Type */, /*shouldComputeAliasesToMakeVisible*/ false, /*allowModules*/ true);
return access.accessibility === 0 /* Accessible */;
}
function isValueSymbolAccessible(typeSymbol, enclosingDeclaration) {
var access = isSymbolAccessibleWorker(typeSymbol, enclosingDeclaration, 111551 /* Value */, /*shouldComputeAliasesToMakeVisible*/ false, /*allowModules*/ true);
return access.accessibility === 0 /* Accessible */;
}
function isSymbolAccessibleByFlags(typeSymbol, enclosingDeclaration, flags) {
var access = isSymbolAccessibleWorker(typeSymbol, enclosingDeclaration, flags, /*shouldComputeAliasesToMakeVisible*/ false, /*allowModules*/ false);
return access.accessibility === 0 /* Accessible */;
}
function isAnySymbolAccessible(symbols, enclosingDeclaration, initialSymbol, meaning, shouldComputeAliasesToMakeVisible, allowModules) {
if (!ts.length(symbols))
return;
var hadAccessibleChain;
var earlyModuleBail = false;
for (var _i = 0, _a = symbols; _i < _a.length; _i++) {
var symbol = _a[_i];
// Symbol is accessible if it by itself is accessible
var accessibleSymbolChain = getAccessibleSymbolChain(symbol, enclosingDeclaration, meaning, /*useOnlyExternalAliasing*/ false);
if (accessibleSymbolChain) {
hadAccessibleChain = symbol;
var hasAccessibleDeclarations = hasVisibleDeclarations(accessibleSymbolChain[0], shouldComputeAliasesToMakeVisible);
if (hasAccessibleDeclarations) {
return hasAccessibleDeclarations;
}
}
if (allowModules) {
if (ts.some(symbol.declarations, hasNonGlobalAugmentationExternalModuleSymbol)) {
if (shouldComputeAliasesToMakeVisible) {
earlyModuleBail = true;
// Generally speaking, we want to use the aliases that already exist to refer to a module, if present
// In order to do so, we need to find those aliases in order to retain them in declaration emit; so
// if we are in declaration emit, we cannot use the fast path for module visibility until we've exhausted
// all other visibility options (in order to capture the possible aliases used to reference the module)
continue;
}
// Any meaning of a module symbol is always accessible via an `import` type
return {
accessibility: 0 /* Accessible */
};
}
}
// If we haven't got the accessible symbol, it doesn't mean the symbol is actually inaccessible.
// It could be a qualified symbol and hence verify the path
// e.g.:
// module m {
// export class c {
// }
// }
// const x: typeof m.c
// In the above example when we start with checking if typeof m.c symbol is accessible,
// we are going to see if c can be accessed in scope directly.
// But it can't, hence the accessible is going to be undefined, but that doesn't mean m.c is inaccessible
// It is accessible if the parent m is accessible because then m.c can be accessed through qualification
var containers = getContainersOfSymbol(symbol, enclosingDeclaration, meaning);
var parentResult = isAnySymbolAccessible(containers, enclosingDeclaration, initialSymbol, initialSymbol === symbol ? getQualifiedLeftMeaning(meaning) : meaning, shouldComputeAliasesToMakeVisible, allowModules);
if (parentResult) {
return parentResult;
}
}
if (earlyModuleBail) {
return {
accessibility: 0 /* Accessible */
};
}
if (hadAccessibleChain) {
return {
accessibility: 1 /* NotAccessible */,
errorSymbolName: symbolToString(initialSymbol, enclosingDeclaration, meaning),
errorModuleName: hadAccessibleChain !== initialSymbol ? symbolToString(hadAccessibleChain, enclosingDeclaration, 1920 /* Namespace */) : undefined,
};
}
}
/**
* Check if the given symbol in given enclosing declaration is accessible and mark all associated alias to be visible if requested
*
* @param symbol a Symbol to check if accessible
* @param enclosingDeclaration a Node containing reference to the symbol
* @param meaning a SymbolFlags to check if such meaning of the symbol is accessible
* @param shouldComputeAliasToMakeVisible a boolean value to indicate whether to return aliases to be mark visible in case the symbol is accessible
*/
function isSymbolAccessible(symbol, enclosingDeclaration, meaning, shouldComputeAliasesToMakeVisible) {
return isSymbolAccessibleWorker(symbol, enclosingDeclaration, meaning, shouldComputeAliasesToMakeVisible, /*allowModules*/ true);
}
function isSymbolAccessibleWorker(symbol, enclosingDeclaration, meaning, shouldComputeAliasesToMakeVisible, allowModules) {
if (symbol && enclosingDeclaration) {
var result = isAnySymbolAccessible([symbol], enclosingDeclaration, symbol, meaning, shouldComputeAliasesToMakeVisible, allowModules);
if (result) {
return result;
}
// This could be a symbol that is not exported in the external module
// or it could be a symbol from different external module that is not aliased and hence cannot be named
var symbolExternalModule = ts.forEach(symbol.declarations, getExternalModuleContainer);
if (symbolExternalModule) {
var enclosingExternalModule = getExternalModuleContainer(enclosingDeclaration);
if (symbolExternalModule !== enclosingExternalModule) {
// name from different external module that is not visible
return {
accessibility: 2 /* CannotBeNamed */,
errorSymbolName: symbolToString(symbol, enclosingDeclaration, meaning),
errorModuleName: symbolToString(symbolExternalModule),
errorNode: ts.isInJSFile(enclosingDeclaration) ? enclosingDeclaration : undefined,
};
}
}
// Just a local name that is not accessible
return {
accessibility: 1 /* NotAccessible */,
errorSymbolName: symbolToString(symbol, enclosingDeclaration, meaning),
};
}
return { accessibility: 0 /* Accessible */ };
}
function getExternalModuleContainer(declaration) {
var node = ts.findAncestor(declaration, hasExternalModuleSymbol);
return node && getSymbolOfNode(node);
}
function hasExternalModuleSymbol(declaration) {
return ts.isAmbientModule(declaration) || (declaration.kind === 300 /* SourceFile */ && ts.isExternalOrCommonJsModule(declaration));
}
function hasNonGlobalAugmentationExternalModuleSymbol(declaration) {
return ts.isModuleWithStringLiteralName(declaration) || (declaration.kind === 300 /* SourceFile */ && ts.isExternalOrCommonJsModule(declaration));
}
function hasVisibleDeclarations(symbol, shouldComputeAliasToMakeVisible) {
var aliasesToMakeVisible;
if (!ts.every(ts.filter(symbol.declarations, function (d) { return d.kind !== 79 /* Identifier */; }), getIsDeclarationVisible)) {
return undefined;
}
return { accessibility: 0 /* Accessible */, aliasesToMakeVisible: aliasesToMakeVisible };
function getIsDeclarationVisible(declaration) {
var _a, _b;
if (!isDeclarationVisible(declaration)) {
// Mark the unexported alias as visible if its parent is visible
// because these kind of aliases can be used to name types in declaration file
var anyImportSyntax = getAnyImportSyntax(declaration);
if (anyImportSyntax &&
!ts.hasSyntacticModifier(anyImportSyntax, 1 /* Export */) && // import clause without export
isDeclarationVisible(anyImportSyntax.parent)) {
return addVisibleAlias(declaration, anyImportSyntax);
}
else if (ts.isVariableDeclaration(declaration) && ts.isVariableStatement(declaration.parent.parent) &&
!ts.hasSyntacticModifier(declaration.parent.parent, 1 /* Export */) && // unexported variable statement
isDeclarationVisible(declaration.parent.parent.parent)) {
return addVisibleAlias(declaration, declaration.parent.parent);
}
else if (ts.isLateVisibilityPaintedStatement(declaration) // unexported top-level statement
&& !ts.hasSyntacticModifier(declaration, 1 /* Export */)
&& isDeclarationVisible(declaration.parent)) {
return addVisibleAlias(declaration, declaration);
}
else if (symbol.flags & 2097152 /* Alias */ && ts.isBindingElement(declaration) && ts.isInJSFile(declaration) && ((_a = declaration.parent) === null || _a === void 0 ? void 0 : _a.parent) // exported import-like top-level JS require statement
&& ts.isVariableDeclaration(declaration.parent.parent)
&& ((_b = declaration.parent.parent.parent) === null || _b === void 0 ? void 0 : _b.parent) && ts.isVariableStatement(declaration.parent.parent.parent.parent)
&& !ts.hasSyntacticModifier(declaration.parent.parent.parent.parent, 1 /* Export */)
&& declaration.parent.parent.parent.parent.parent // check if the thing containing the variable statement is visible (ie, the file)
&& isDeclarationVisible(declaration.parent.parent.parent.parent.parent)) {
return addVisibleAlias(declaration, declaration.parent.parent.parent.parent);
}
// Declaration is not visible
return false;
}
return true;
}
function addVisibleAlias(declaration, aliasingStatement) {
// In function "buildTypeDisplay" where we decide whether to write type-alias or serialize types,
// we want to just check if type- alias is accessible or not but we don't care about emitting those alias at that time
// since we will do the emitting later in trackSymbol.
if (shouldComputeAliasToMakeVisible) {
getNodeLinks(declaration).isVisible = true;
aliasesToMakeVisible = ts.appendIfUnique(aliasesToMakeVisible, aliasingStatement);
}
return true;
}
}
function isEntityNameVisible(entityName, enclosingDeclaration) {
// get symbol of the first identifier of the entityName
var meaning;
if (entityName.parent.kind === 179 /* TypeQuery */ ||
ts.isExpressionWithTypeArgumentsInClassExtendsClause(entityName.parent) ||
entityName.parent.kind === 160 /* ComputedPropertyName */) {
// Typeof value
meaning = 111551 /* Value */ | 1048576 /* ExportValue */;
}
else if (entityName.kind === 159 /* QualifiedName */ || entityName.kind === 204 /* PropertyAccessExpression */ ||
entityName.parent.kind === 263 /* ImportEqualsDeclaration */) {
// Left identifier from type reference or TypeAlias
// Entity name of the import declaration
meaning = 1920 /* Namespace */;
}
else {
// Type Reference or TypeAlias entity = Identifier
meaning = 788968 /* Type */;
}
var firstIdentifier = ts.getFirstIdentifier(entityName);
var symbol = resolveName(enclosingDeclaration, firstIdentifier.escapedText, meaning, /*nodeNotFoundErrorMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ false);
if (symbol && symbol.flags & 262144 /* TypeParameter */ && meaning & 788968 /* Type */) {
return { accessibility: 0 /* Accessible */ };
}
// Verify if the symbol is accessible
return (symbol && hasVisibleDeclarations(symbol, /*shouldComputeAliasToMakeVisible*/ true)) || {
accessibility: 1 /* NotAccessible */,
errorSymbolName: ts.getTextOfNode(firstIdentifier),
errorNode: firstIdentifier
};
}
function symbolToString(symbol, enclosingDeclaration, meaning, flags, writer) {
if (flags === void 0) { flags = 4 /* AllowAnyNodeKind */; }
var nodeFlags = 70221824 /* IgnoreErrors */;
if (flags & 2 /* UseOnlyExternalAliasing */) {
nodeFlags |= 128 /* UseOnlyExternalAliasing */;
}
if (flags & 1 /* WriteTypeParametersOrArguments */) {
nodeFlags |= 512 /* WriteTypeParametersInQualifiedName */;
}
if (flags & 8 /* UseAliasDefinedOutsideCurrentScope */) {
nodeFlags |= 16384 /* UseAliasDefinedOutsideCurrentScope */;
}
if (flags & 16 /* DoNotIncludeSymbolChain */) {
nodeFlags |= 134217728 /* DoNotIncludeSymbolChain */;
}
var builder = flags & 4 /* AllowAnyNodeKind */ ? nodeBuilder.symbolToExpression : nodeBuilder.symbolToEntityName;
return writer ? symbolToStringWorker(writer).getText() : ts.usingSingleLineStringWriter(symbolToStringWorker);
function symbolToStringWorker(writer) {
var entity = builder(symbol, meaning, enclosingDeclaration, nodeFlags); // TODO: GH#18217
// add neverAsciiEscape for GH#39027
var printer = (enclosingDeclaration === null || enclosingDeclaration === void 0 ? void 0 : enclosingDeclaration.kind) === 300 /* SourceFile */ ? ts.createPrinter({ removeComments: true, neverAsciiEscape: true }) : ts.createPrinter({ removeComments: true });
var sourceFile = enclosingDeclaration && ts.getSourceFileOfNode(enclosingDeclaration);
printer.writeNode(4 /* Unspecified */, entity, /*sourceFile*/ sourceFile, writer);
return writer;
}
}
function signatureToString(signature, enclosingDeclaration, flags, kind, writer) {
if (flags === void 0) { flags = 0 /* None */; }
return writer ? signatureToStringWorker(writer).getText() : ts.usingSingleLineStringWriter(signatureToStringWorker);
function signatureToStringWorker(writer) {
var sigOutput;
if (flags & 262144 /* WriteArrowStyleSignature */) {
sigOutput = kind === 1 /* Construct */ ? 178 /* ConstructorType */ : 177 /* FunctionType */;
}
else {
sigOutput = kind === 1 /* Construct */ ? 173 /* ConstructSignature */ : 172 /* CallSignature */;
}
var sig = nodeBuilder.signatureToSignatureDeclaration(signature, sigOutput, enclosingDeclaration, toNodeBuilderFlags(flags) | 70221824 /* IgnoreErrors */ | 512 /* WriteTypeParametersInQualifiedName */);
var printer = ts.createPrinter({ removeComments: true, omitTrailingSemicolon: true });
var sourceFile = enclosingDeclaration && ts.getSourceFileOfNode(enclosingDeclaration);
printer.writeNode(4 /* Unspecified */, sig, /*sourceFile*/ sourceFile, ts.getTrailingSemicolonDeferringWriter(writer)); // TODO: GH#18217
return writer;
}
}
function typeToString(type, enclosingDeclaration, flags, writer) {
if (flags === void 0) { flags = 1048576 /* AllowUniqueESSymbolType */ | 16384 /* UseAliasDefinedOutsideCurrentScope */; }
if (writer === void 0) { writer = ts.createTextWriter(""); }
var noTruncation = compilerOptions.noErrorTruncation || flags & 1 /* NoTruncation */;
var typeNode = nodeBuilder.typeToTypeNode(type, enclosingDeclaration, toNodeBuilderFlags(flags) | 70221824 /* IgnoreErrors */ | (noTruncation ? 1 /* NoTruncation */ : 0), writer);
if (typeNode === undefined)
return ts.Debug.fail("should always get typenode");
var options = { removeComments: true };
var printer = ts.createPrinter(options);
var sourceFile = enclosingDeclaration && ts.getSourceFileOfNode(enclosingDeclaration);
printer.writeNode(4 /* Unspecified */, typeNode, /*sourceFile*/ sourceFile, writer);
var result = writer.getText();
var maxLength = noTruncation ? ts.noTruncationMaximumTruncationLength * 2 : ts.defaultMaximumTruncationLength * 2;
if (maxLength && result && result.length >= maxLength) {
return result.substr(0, maxLength - "...".length) + "...";
}
return result;
}
function getTypeNamesForErrorDisplay(left, right) {
var leftStr = symbolValueDeclarationIsContextSensitive(left.symbol) ? typeToString(left, left.symbol.valueDeclaration) : typeToString(left);
var rightStr = symbolValueDeclarationIsContextSensitive(right.symbol) ? typeToString(right, right.symbol.valueDeclaration) : typeToString(right);
if (leftStr === rightStr) {
leftStr = getTypeNameForErrorDisplay(left);
rightStr = getTypeNameForErrorDisplay(right);
}
return [leftStr, rightStr];
}
function getTypeNameForErrorDisplay(type) {
return typeToString(type, /*enclosingDeclaration*/ undefined, 64 /* UseFullyQualifiedType */);
}
function symbolValueDeclarationIsContextSensitive(symbol) {
return symbol && !!symbol.valueDeclaration && ts.isExpression(symbol.valueDeclaration) && !isContextSensitive(symbol.valueDeclaration);
}
function toNodeBuilderFlags(flags) {
if (flags === void 0) { flags = 0 /* None */; }
return flags & 814775659 /* NodeBuilderFlagsMask */;
}
function isClassInstanceSide(type) {
return !!type.symbol && !!(type.symbol.flags & 32 /* Class */) && (type === getDeclaredTypeOfClassOrInterface(type.symbol) || (!!(type.flags & 524288 /* Object */) && !!(ts.getObjectFlags(type) & 16777216 /* IsClassInstanceClone */)));
}
function createNodeBuilder() {
return {
typeToTypeNode: function (type, enclosingDeclaration, flags, tracker) {
return withContext(enclosingDeclaration, flags, tracker, function (context) { return typeToTypeNodeHelper(type, context); });
},
indexInfoToIndexSignatureDeclaration: function (indexInfo, enclosingDeclaration, flags, tracker) {
return withContext(enclosingDeclaration, flags, tracker, function (context) { return indexInfoToIndexSignatureDeclarationHelper(indexInfo, context, /*typeNode*/ undefined); });
},
signatureToSignatureDeclaration: function (signature, kind, enclosingDeclaration, flags, tracker) {
return withContext(enclosingDeclaration, flags, tracker, function (context) { return signatureToSignatureDeclarationHelper(signature, kind, context); });
},
symbolToEntityName: function (symbol, meaning, enclosingDeclaration, flags, tracker) {
return withContext(enclosingDeclaration, flags, tracker, function (context) { return symbolToName(symbol, context, meaning, /*expectsIdentifier*/ false); });
},
symbolToExpression: function (symbol, meaning, enclosingDeclaration, flags, tracker) {
return withContext(enclosingDeclaration, flags, tracker, function (context) { return symbolToExpression(symbol, context, meaning); });
},
symbolToTypeParameterDeclarations: function (symbol, enclosingDeclaration, flags, tracker) {
return withContext(enclosingDeclaration, flags, tracker, function (context) { return typeParametersToTypeParameterDeclarations(symbol, context); });
},
symbolToParameterDeclaration: function (symbol, enclosingDeclaration, flags, tracker) {
return withContext(enclosingDeclaration, flags, tracker, function (context) { return symbolToParameterDeclaration(symbol, context); });
},
typeParameterToDeclaration: function (parameter, enclosingDeclaration, flags, tracker) {
return withContext(enclosingDeclaration, flags, tracker, function (context) { return typeParameterToDeclaration(parameter, context); });
},
symbolTableToDeclarationStatements: function (symbolTable, enclosingDeclaration, flags, tracker, bundled) {
return withContext(enclosingDeclaration, flags, tracker, function (context) { return symbolTableToDeclarationStatements(symbolTable, context, bundled); });
},
};
function withContext(enclosingDeclaration, flags, tracker, cb) {
var _a, _b;
ts.Debug.assert(enclosingDeclaration === undefined || (enclosingDeclaration.flags & 8 /* Synthesized */) === 0);
var context = {
enclosingDeclaration: enclosingDeclaration,
flags: flags || 0 /* None */,
// If no full tracker is provided, fake up a dummy one with a basic limited-functionality moduleResolverHost
tracker: tracker && tracker.trackSymbol ? tracker : { trackSymbol: function () { return false; }, moduleResolverHost: flags & 134217728 /* DoNotIncludeSymbolChain */ ? {
getCommonSourceDirectory: !!host.getCommonSourceDirectory ? function () { return host.getCommonSourceDirectory(); } : function () { return ""; },
getCurrentDirectory: function () { return host.getCurrentDirectory(); },
getSymlinkCache: ts.maybeBind(host, host.getSymlinkCache),
useCaseSensitiveFileNames: ts.maybeBind(host, host.useCaseSensitiveFileNames),
redirectTargetsMap: host.redirectTargetsMap,
getProjectReferenceRedirect: function (fileName) { return host.getProjectReferenceRedirect(fileName); },
isSourceOfProjectReferenceRedirect: function (fileName) { return host.isSourceOfProjectReferenceRedirect(fileName); },
fileExists: function (fileName) { return host.fileExists(fileName); },
getFileIncludeReasons: function () { return host.getFileIncludeReasons(); },
} : undefined },
encounteredError: false,
reportedDiagnostic: false,
visitedTypes: undefined,
symbolDepth: undefined,
inferTypeParameters: undefined,
approximateLength: 0
};
context.tracker = wrapSymbolTrackerToReportForContext(context, context.tracker);
var resultingNode = cb(context);
if (context.truncating && context.flags & 1 /* NoTruncation */) {
(_b = (_a = context.tracker) === null || _a === void 0 ? void 0 : _a.reportTruncationError) === null || _b === void 0 ? void 0 : _b.call(_a);
}
return context.encounteredError ? undefined : resultingNode;
}
function wrapSymbolTrackerToReportForContext(context, tracker) {
var oldTrackSymbol = tracker.trackSymbol;
return __assign(__assign({}, tracker), { reportCyclicStructureError: wrapReportedDiagnostic(tracker.reportCyclicStructureError), reportInaccessibleThisError: wrapReportedDiagnostic(tracker.reportInaccessibleThisError), reportInaccessibleUniqueSymbolError: wrapReportedDiagnostic(tracker.reportInaccessibleUniqueSymbolError), reportLikelyUnsafeImportRequiredError: wrapReportedDiagnostic(tracker.reportLikelyUnsafeImportRequiredError), reportNonlocalAugmentation: wrapReportedDiagnostic(tracker.reportNonlocalAugmentation), reportPrivateInBaseOfClassExpression: wrapReportedDiagnostic(tracker.reportPrivateInBaseOfClassExpression), reportNonSerializableProperty: wrapReportedDiagnostic(tracker.reportNonSerializableProperty), trackSymbol: oldTrackSymbol && (function () {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
var result = oldTrackSymbol.apply(void 0, args);
if (result) {
context.reportedDiagnostic = true;
}
return result;
}) });
function wrapReportedDiagnostic(method) {
if (!method) {
return method;
}
return (function () {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
context.reportedDiagnostic = true;
return method.apply(void 0, args);
});
}
}
function checkTruncationLength(context) {
if (context.truncating)
return context.truncating;
return context.truncating = context.approximateLength > ((context.flags & 1 /* NoTruncation */) ? ts.noTruncationMaximumTruncationLength : ts.defaultMaximumTruncationLength);
}
function typeToTypeNodeHelper(type, context) {
if (cancellationToken && cancellationToken.throwIfCancellationRequested) {
cancellationToken.throwIfCancellationRequested();
}
var inTypeAlias = context.flags & 8388608 /* InTypeAlias */;
context.flags &= ~8388608 /* InTypeAlias */;
if (!type) {
if (!(context.flags & 262144 /* AllowEmptyUnionOrIntersection */)) {
context.encounteredError = true;
return undefined; // TODO: GH#18217
}
context.approximateLength += 3;
return ts.factory.createKeywordTypeNode(129 /* AnyKeyword */);
}
if (!(context.flags & 536870912 /* NoTypeReduction */)) {
type = getReducedType(type);
}
if (type.flags & 1 /* Any */) {
context.approximateLength += 3;
return ts.factory.createKeywordTypeNode(type === intrinsicMarkerType ? 137 /* IntrinsicKeyword */ : 129 /* AnyKeyword */);
}
if (type.flags & 2 /* Unknown */) {
return ts.factory.createKeywordTypeNode(153 /* UnknownKeyword */);
}
if (type.flags & 4 /* String */) {
context.approximateLength += 6;
return ts.factory.createKeywordTypeNode(148 /* StringKeyword */);
}
if (type.flags & 8 /* Number */) {
context.approximateLength += 6;
return ts.factory.createKeywordTypeNode(145 /* NumberKeyword */);
}
if (type.flags & 64 /* BigInt */) {
context.approximateLength += 6;
return ts.factory.createKeywordTypeNode(156 /* BigIntKeyword */);
}
if (type.flags & 16 /* Boolean */ && !type.aliasSymbol) {
context.approximateLength += 7;
return ts.factory.createKeywordTypeNode(132 /* BooleanKeyword */);
}
if (type.flags & 1024 /* EnumLiteral */ && !(type.flags & 1048576 /* Union */)) {
var parentSymbol = getParentOfSymbol(type.symbol);
var parentName = symbolToTypeNode(parentSymbol, context, 788968 /* Type */);
if (getDeclaredTypeOfSymbol(parentSymbol) === type) {
return parentName;
}
var memberName = ts.symbolName(type.symbol);
if (ts.isIdentifierText(memberName, 0 /* ES3 */)) {
return appendReferenceToType(parentName, ts.factory.createTypeReferenceNode(memberName, /*typeArguments*/ undefined));
}
if (ts.isImportTypeNode(parentName)) {
parentName.isTypeOf = true; // mutably update, node is freshly manufactured anyhow
return ts.factory.createIndexedAccessTypeNode(parentName, ts.factory.createLiteralTypeNode(ts.factory.createStringLiteral(memberName)));
}
else if (ts.isTypeReferenceNode(parentName)) {
return ts.factory.createIndexedAccessTypeNode(ts.factory.createTypeQueryNode(parentName.typeName), ts.factory.createLiteralTypeNode(ts.factory.createStringLiteral(memberName)));
}
else {
return ts.Debug.fail("Unhandled type node kind returned from `symbolToTypeNode`.");
}
}
if (type.flags & 1056 /* EnumLike */) {
return symbolToTypeNode(type.symbol, context, 788968 /* Type */);
}
if (type.flags & 128 /* StringLiteral */) {
context.approximateLength += (type.value.length + 2);
return ts.factory.createLiteralTypeNode(ts.setEmitFlags(ts.factory.createStringLiteral(type.value, !!(context.flags & 268435456 /* UseSingleQuotesForStringLiteralType */)), 16777216 /* NoAsciiEscaping */));
}
if (type.flags & 256 /* NumberLiteral */) {
var value = type.value;
context.approximateLength += ("" + value).length;
return ts.factory.createLiteralTypeNode(value < 0 ? ts.factory.createPrefixUnaryExpression(40 /* MinusToken */, ts.factory.createNumericLiteral(-value)) : ts.factory.createNumericLiteral(value));
}
if (type.flags & 2048 /* BigIntLiteral */) {
context.approximateLength += (ts.pseudoBigIntToString(type.value).length) + 1;
return ts.factory.createLiteralTypeNode((ts.factory.createBigIntLiteral(type.value)));
}
if (type.flags & 512 /* BooleanLiteral */) {
context.approximateLength += type.intrinsicName.length;
return ts.factory.createLiteralTypeNode(type.intrinsicName === "true" ? ts.factory.createTrue() : ts.factory.createFalse());
}
if (type.flags & 8192 /* UniqueESSymbol */) {
if (!(context.flags & 1048576 /* AllowUniqueESSymbolType */)) {
if (isValueSymbolAccessible(type.symbol, context.enclosingDeclaration)) {
context.approximateLength += 6;
return symbolToTypeNode(type.symbol, context, 111551 /* Value */);
}
if (context.tracker.reportInaccessibleUniqueSymbolError) {
context.tracker.reportInaccessibleUniqueSymbolError();
}
}
context.approximateLength += 13;
return ts.factory.createTypeOperatorNode(152 /* UniqueKeyword */, ts.factory.createKeywordTypeNode(149 /* SymbolKeyword */));
}
if (type.flags & 16384 /* Void */) {
context.approximateLength += 4;
return ts.factory.createKeywordTypeNode(114 /* VoidKeyword */);
}
if (type.flags & 32768 /* Undefined */) {
context.approximateLength += 9;
return ts.factory.createKeywordTypeNode(151 /* UndefinedKeyword */);
}
if (type.flags & 65536 /* Null */) {
context.approximateLength += 4;
return ts.factory.createLiteralTypeNode(ts.factory.createNull());
}
if (type.flags & 131072 /* Never */) {
context.approximateLength += 5;
return ts.factory.createKeywordTypeNode(142 /* NeverKeyword */);
}
if (type.flags & 4096 /* ESSymbol */) {
context.approximateLength += 6;
return ts.factory.createKeywordTypeNode(149 /* SymbolKeyword */);
}
if (type.flags & 67108864 /* NonPrimitive */) {
context.approximateLength += 6;
return ts.factory.createKeywordTypeNode(146 /* ObjectKeyword */);
}
if (isThisTypeParameter(type)) {
if (context.flags & 4194304 /* InObjectTypeLiteral */) {
if (!context.encounteredError && !(context.flags & 32768 /* AllowThisInObjectLiteral */)) {
context.encounteredError = true;
}
if (context.tracker.reportInaccessibleThisError) {
context.tracker.reportInaccessibleThisError();
}
}
context.approximateLength += 4;
return ts.factory.createThisTypeNode();
}
if (!inTypeAlias && type.aliasSymbol && (context.flags & 16384 /* UseAliasDefinedOutsideCurrentScope */ || isTypeSymbolAccessible(type.aliasSymbol, context.enclosingDeclaration))) {
var typeArgumentNodes = mapToTypeNodes(type.aliasTypeArguments, context);
if (isReservedMemberName(type.aliasSymbol.escapedName) && !(type.aliasSymbol.flags & 32 /* Class */))
return ts.factory.createTypeReferenceNode(ts.factory.createIdentifier(""), typeArgumentNodes);
return symbolToTypeNode(type.aliasSymbol, context, 788968 /* Type */, typeArgumentNodes);
}
var objectFlags = ts.getObjectFlags(type);
if (objectFlags & 4 /* Reference */) {
ts.Debug.assert(!!(type.flags & 524288 /* Object */));
return type.node ? visitAndTransformType(type, typeReferenceToTypeNode) : typeReferenceToTypeNode(type);
}
if (type.flags & 262144 /* TypeParameter */ || objectFlags & 3 /* ClassOrInterface */) {
if (type.flags & 262144 /* TypeParameter */ && ts.contains(context.inferTypeParameters, type)) {
context.approximateLength += (ts.symbolName(type.symbol).length + 6);
return ts.factory.createInferTypeNode(typeParameterToDeclarationWithConstraint(type, context, /*constraintNode*/ undefined));
}
if (context.flags & 4 /* GenerateNamesForShadowedTypeParams */ &&
type.flags & 262144 /* TypeParameter */ &&
!isTypeSymbolAccessible(type.symbol, context.enclosingDeclaration)) {
var name = typeParameterToName(type, context);
context.approximateLength += ts.idText(name).length;
return ts.factory.createTypeReferenceNode(ts.factory.createIdentifier(ts.idText(name)), /*typeArguments*/ undefined);
}
// Ignore constraint/default when creating a usage (as opposed to declaration) of a type parameter.
return type.symbol
? symbolToTypeNode(type.symbol, context, 788968 /* Type */)
: ts.factory.createTypeReferenceNode(ts.factory.createIdentifier("?"), /*typeArguments*/ undefined);
}
if (type.flags & 1048576 /* Union */ && type.origin) {
type = type.origin;
}
if (type.flags & (1048576 /* Union */ | 2097152 /* Intersection */)) {
var types = type.flags & 1048576 /* Union */ ? formatUnionTypes(type.types) : type.types;
if (ts.length(types) === 1) {
return typeToTypeNodeHelper(types[0], context);
}
var typeNodes = mapToTypeNodes(types, context, /*isBareList*/ true);
if (typeNodes && typeNodes.length > 0) {
return type.flags & 1048576 /* Union */ ? ts.factory.createUnionTypeNode(typeNodes) : ts.factory.createIntersectionTypeNode(typeNodes);
}
else {
if (!context.encounteredError && !(context.flags & 262144 /* AllowEmptyUnionOrIntersection */)) {
context.encounteredError = true;
}
return undefined; // TODO: GH#18217
}
}
if (objectFlags & (16 /* Anonymous */ | 32 /* Mapped */)) {
ts.Debug.assert(!!(type.flags & 524288 /* Object */));
// The type is an object literal type.
return createAnonymousTypeNode(type);
}
if (type.flags & 4194304 /* Index */) {
var indexedType = type.type;
context.approximateLength += 6;
var indexTypeNode = typeToTypeNodeHelper(indexedType, context);
return ts.factory.createTypeOperatorNode(139 /* KeyOfKeyword */, indexTypeNode);
}
if (type.flags & 134217728 /* TemplateLiteral */) {
var texts_1 = type.texts;
var types_1 = type.types;
var templateHead = ts.factory.createTemplateHead(texts_1[0]);
var templateSpans = ts.factory.createNodeArray(ts.map(types_1, function (t, i) { return ts.factory.createTemplateLiteralTypeSpan(typeToTypeNodeHelper(t, context), (i < types_1.length - 1 ? ts.factory.createTemplateMiddle : ts.factory.createTemplateTail)(texts_1[i + 1])); }));
context.approximateLength += 2;
return ts.factory.createTemplateLiteralType(templateHead, templateSpans);
}
if (type.flags & 268435456 /* StringMapping */) {
var typeNode = typeToTypeNodeHelper(type.type, context);
return symbolToTypeNode(type.symbol, context, 788968 /* Type */, [typeNode]);
}
if (type.flags & 8388608 /* IndexedAccess */) {
var objectTypeNode = typeToTypeNodeHelper(type.objectType, context);
var indexTypeNode = typeToTypeNodeHelper(type.indexType, context);
context.approximateLength += 2;
return ts.factory.createIndexedAccessTypeNode(objectTypeNode, indexTypeNode);
}
if (type.flags & 16777216 /* Conditional */) {
return visitAndTransformType(type, function (type) { return conditionalTypeToTypeNode(type); });
}
if (type.flags & 33554432 /* Substitution */) {
return typeToTypeNodeHelper(type.baseType, context);
}
return ts.Debug.fail("Should be unreachable.");
function conditionalTypeToTypeNode(type) {
var checkTypeNode = typeToTypeNodeHelper(type.checkType, context);
var saveInferTypeParameters = context.inferTypeParameters;
context.inferTypeParameters = type.root.inferTypeParameters;
var extendsTypeNode = typeToTypeNodeHelper(type.extendsType, context);
context.inferTypeParameters = saveInferTypeParameters;
var trueTypeNode = typeToTypeNodeOrCircularityElision(getTrueTypeFromConditionalType(type));
var falseTypeNode = typeToTypeNodeOrCircularityElision(getFalseTypeFromConditionalType(type));
context.approximateLength += 15;
return ts.factory.createConditionalTypeNode(checkTypeNode, extendsTypeNode, trueTypeNode, falseTypeNode);
}
function typeToTypeNodeOrCircularityElision(type) {
var _a, _b, _c;
if (type.flags & 1048576 /* Union */) {
if ((_a = context.visitedTypes) === null || _a === void 0 ? void 0 : _a.has(getTypeId(type))) {
if (!(context.flags & 131072 /* AllowAnonymousIdentifier */)) {
context.encounteredError = true;
(_c = (_b = context.tracker) === null || _b === void 0 ? void 0 : _b.reportCyclicStructureError) === null || _c === void 0 ? void 0 : _c.call(_b);
}
return createElidedInformationPlaceholder(context);
}
return visitAndTransformType(type, function (type) { return typeToTypeNodeHelper(type, context); });
}
return typeToTypeNodeHelper(type, context);
}
function createMappedTypeNodeFromType(type) {
ts.Debug.assert(!!(type.flags & 524288 /* Object */));
var readonlyToken = type.declaration.readonlyToken ? ts.factory.createToken(type.declaration.readonlyToken.kind) : undefined;
var questionToken = type.declaration.questionToken ? ts.factory.createToken(type.declaration.questionToken.kind) : undefined;
var appropriateConstraintTypeNode;
if (isMappedTypeWithKeyofConstraintDeclaration(type)) {
// We have a { [P in keyof T]: X }
// We do this to ensure we retain the toplevel keyof-ness of the type which may be lost due to keyof distribution during `getConstraintTypeFromMappedType`
appropriateConstraintTypeNode = ts.factory.createTypeOperatorNode(139 /* KeyOfKeyword */, typeToTypeNodeHelper(getModifiersTypeFromMappedType(type), context));
}
else {
appropriateConstraintTypeNode = typeToTypeNodeHelper(getConstraintTypeFromMappedType(type), context);
}
var typeParameterNode = typeParameterToDeclarationWithConstraint(getTypeParameterFromMappedType(type), context, appropriateConstraintTypeNode);
var nameTypeNode = type.declaration.nameType ? typeToTypeNodeHelper(getNameTypeFromMappedType(type), context) : undefined;
var templateTypeNode = typeToTypeNodeHelper(removeMissingType(getTemplateTypeFromMappedType(type), !!(getMappedTypeModifiers(type) & 4 /* IncludeOptional */)), context);
var mappedTypeNode = ts.factory.createMappedTypeNode(readonlyToken, typeParameterNode, nameTypeNode, questionToken, templateTypeNode);
context.approximateLength += 10;
return ts.setEmitFlags(mappedTypeNode, 1 /* SingleLine */);
}
function createAnonymousTypeNode(type) {
var _a;
var typeId = type.id;
var symbol = type.symbol;
if (symbol) {
var isInstanceType = isClassInstanceSide(type) ? 788968 /* Type */ : 111551 /* Value */;
if (isJSConstructor(symbol.valueDeclaration)) {
// Instance and static types share the same symbol; only add 'typeof' for the static side.
return symbolToTypeNode(symbol, context, isInstanceType);
}
// Always use 'typeof T' for type of class, enum, and module objects
else if (symbol.flags & 32 /* Class */
&& !getBaseTypeVariableOfClass(symbol)
&& !(symbol.valueDeclaration && symbol.valueDeclaration.kind === 224 /* ClassExpression */ && context.flags & 2048 /* WriteClassExpressionAsTypeLiteral */) ||
symbol.flags & (384 /* Enum */ | 512 /* ValueModule */) ||
shouldWriteTypeOfFunctionSymbol()) {
return symbolToTypeNode(symbol, context, isInstanceType);
}
else if ((_a = context.visitedTypes) === null || _a === void 0 ? void 0 : _a.has(typeId)) {
// If type is an anonymous type literal in a type alias declaration, use type alias name
var typeAlias = getTypeAliasForTypeLiteral(type);
if (typeAlias) {
// The specified symbol flags need to be reinterpreted as type flags
return symbolToTypeNode(typeAlias, context, 788968 /* Type */);
}
else {
return createElidedInformationPlaceholder(context);
}
}
else {
return visitAndTransformType(type, createTypeNodeFromObjectType);
}
}
else {
// Anonymous types without a symbol are never circular.
return createTypeNodeFromObjectType(type);
}
function shouldWriteTypeOfFunctionSymbol() {
var _a;
var isStaticMethodSymbol = !!(symbol.flags & 8192 /* Method */) && // typeof static method
ts.some(symbol.declarations, function (declaration) { return ts.isStatic(declaration); });
var isNonLocalFunctionSymbol = !!(symbol.flags & 16 /* Function */) &&
(symbol.parent || // is exported function symbol
ts.forEach(symbol.declarations, function (declaration) {
return declaration.parent.kind === 300 /* SourceFile */ || declaration.parent.kind === 260 /* ModuleBlock */;
}));
if (isStaticMethodSymbol || isNonLocalFunctionSymbol) {
// typeof is allowed only for static/non local functions
return (!!(context.flags & 4096 /* UseTypeOfFunction */) || ((_a = context.visitedTypes) === null || _a === void 0 ? void 0 : _a.has(typeId))) && // it is type of the symbol uses itself recursively
(!(context.flags & 8 /* UseStructuralFallback */) || isValueSymbolAccessible(symbol, context.enclosingDeclaration)); // And the build is going to succeed without visibility error or there is no structural fallback allowed
}
}
}
function visitAndTransformType(type, transform) {
var _a, _b;
var typeId = type.id;
var isConstructorObject = ts.getObjectFlags(type) & 16 /* Anonymous */ && type.symbol && type.symbol.flags & 32 /* Class */;
var id = ts.getObjectFlags(type) & 4 /* Reference */ && type.node ? "N" + getNodeId(type.node) :
type.flags & 16777216 /* Conditional */ ? "N" + getNodeId(type.root.node) :
type.symbol ? (isConstructorObject ? "+" : "") + getSymbolId(type.symbol) :
undefined;
// Since instantiations of the same anonymous type have the same symbol, tracking symbols instead
// of types allows us to catch circular references to instantiations of the same anonymous type
if (!context.visitedTypes) {
context.visitedTypes = new ts.Set();
}
if (id && !context.symbolDepth) {
context.symbolDepth = new ts.Map();
}
var links = context.enclosingDeclaration && getNodeLinks(context.enclosingDeclaration);
var key = getTypeId(type) + "|" + context.flags;
if (links) {
links.serializedTypes || (links.serializedTypes = new ts.Map());
}
var cachedResult = (_a = links === null || links === void 0 ? void 0 : links.serializedTypes) === null || _a === void 0 ? void 0 : _a.get(key);
if (cachedResult) {
if (cachedResult.truncating) {
context.truncating = true;
}
context.approximateLength += cachedResult.addedLength;
return deepCloneOrReuseNode(cachedResult);
}
var depth;
if (id) {
depth = context.symbolDepth.get(id) || 0;
if (depth > 10) {
return createElidedInformationPlaceholder(context);
}
context.symbolDepth.set(id, depth + 1);
}
context.visitedTypes.add(typeId);
var startLength = context.approximateLength;
var result = transform(type);
var addedLength = context.approximateLength - startLength;
if (!context.reportedDiagnostic && !context.encounteredError) {
if (context.truncating) {
result.truncating = true;
}
result.addedLength = addedLength;
(_b = links === null || links === void 0 ? void 0 : links.serializedTypes) === null || _b === void 0 ? void 0 : _b.set(key, result);
}
context.visitedTypes.delete(typeId);
if (id) {
context.symbolDepth.set(id, depth);
}
return result;
function deepCloneOrReuseNode(node) {
if (!ts.nodeIsSynthesized(node) && ts.getParseTreeNode(node) === node) {
return node;
}
return ts.setTextRange(ts.factory.cloneNode(ts.visitEachChild(node, deepCloneOrReuseNode, ts.nullTransformationContext)), node);
}
}
function createTypeNodeFromObjectType(type) {
if (isGenericMappedType(type) || type.containsError) {
return createMappedTypeNodeFromType(type);
}
var resolved = resolveStructuredTypeMembers(type);
if (!resolved.properties.length && !resolved.indexInfos.length) {
if (!resolved.callSignatures.length && !resolved.constructSignatures.length) {
context.approximateLength += 2;
return ts.setEmitFlags(ts.factory.createTypeLiteralNode(/*members*/ undefined), 1 /* SingleLine */);
}
if (resolved.callSignatures.length === 1 && !resolved.constructSignatures.length) {
var signature = resolved.callSignatures[0];
var signatureNode = signatureToSignatureDeclarationHelper(signature, 177 /* FunctionType */, context);
return signatureNode;
}
if (resolved.constructSignatures.length === 1 && !resolved.callSignatures.length) {
var signature = resolved.constructSignatures[0];
var signatureNode = signatureToSignatureDeclarationHelper(signature, 178 /* ConstructorType */, context);
return signatureNode;
}
}
var abstractSignatures = ts.filter(resolved.constructSignatures, function (signature) { return !!(signature.flags & 4 /* Abstract */); });
if (ts.some(abstractSignatures)) {
var types = ts.map(abstractSignatures, getOrCreateTypeFromSignature);
// count the number of type elements excluding abstract constructors
var typeElementCount = resolved.callSignatures.length +
(resolved.constructSignatures.length - abstractSignatures.length) +
resolved.indexInfos.length +
// exclude `prototype` when writing a class expression as a type literal, as per
// the logic in `createTypeNodesFromResolvedType`.
(context.flags & 2048 /* WriteClassExpressionAsTypeLiteral */ ?
ts.countWhere(resolved.properties, function (p) { return !(p.flags & 4194304 /* Prototype */); }) :
ts.length(resolved.properties));
// don't include an empty object literal if there were no other static-side
// properties to write, i.e. `abstract class C { }` becomes `abstract new () => {}`
// and not `(abstract new () => {}) & {}`
if (typeElementCount) {
// create a copy of the object type without any abstract construct signatures.
types.push(getResolvedTypeWithoutAbstractConstructSignatures(resolved));
}
return typeToTypeNodeHelper(getIntersectionType(types), context);
}
var savedFlags = context.flags;
context.flags |= 4194304 /* InObjectTypeLiteral */;
var members = createTypeNodesFromResolvedType(resolved);
context.flags = savedFlags;
var typeLiteralNode = ts.factory.createTypeLiteralNode(members);
context.approximateLength += 2;
ts.setEmitFlags(typeLiteralNode, (context.flags & 1024 /* MultilineObjectLiterals */) ? 0 : 1 /* SingleLine */);
return typeLiteralNode;
}
function typeReferenceToTypeNode(type) {
var typeArguments = getTypeArguments(type);
if (type.target === globalArrayType || type.target === globalReadonlyArrayType) {
if (context.flags & 2 /* WriteArrayAsGenericType */) {
var typeArgumentNode = typeToTypeNodeHelper(typeArguments[0], context);
return ts.factory.createTypeReferenceNode(type.target === globalArrayType ? "Array" : "ReadonlyArray", [typeArgumentNode]);
}
var elementType = typeToTypeNodeHelper(typeArguments[0], context);
var arrayType = ts.factory.createArrayTypeNode(elementType);
return type.target === globalArrayType ? arrayType : ts.factory.createTypeOperatorNode(143 /* ReadonlyKeyword */, arrayType);
}
else if (type.target.objectFlags & 8 /* Tuple */) {
typeArguments = ts.sameMap(typeArguments, function (t, i) { return removeMissingType(t, !!(type.target.elementFlags[i] & 2 /* Optional */)); });
if (typeArguments.length > 0) {
var arity = getTypeReferenceArity(type);
var tupleConstituentNodes = mapToTypeNodes(typeArguments.slice(0, arity), context);
if (tupleConstituentNodes) {
if (type.target.labeledElementDeclarations) {
for (var i = 0; i < tupleConstituentNodes.length; i++) {
var flags = type.target.elementFlags[i];
tupleConstituentNodes[i] = ts.factory.createNamedTupleMember(flags & 12 /* Variable */ ? ts.factory.createToken(25 /* DotDotDotToken */) : undefined, ts.factory.createIdentifier(ts.unescapeLeadingUnderscores(getTupleElementLabel(type.target.labeledElementDeclarations[i]))), flags & 2 /* Optional */ ? ts.factory.createToken(57 /* QuestionToken */) : undefined, flags & 4 /* Rest */ ? ts.factory.createArrayTypeNode(tupleConstituentNodes[i]) :
tupleConstituentNodes[i]);
}
}
else {
for (var i = 0; i < Math.min(arity, tupleConstituentNodes.length); i++) {
var flags = type.target.elementFlags[i];
tupleConstituentNodes[i] =
flags & 12 /* Variable */ ? ts.factory.createRestTypeNode(flags & 4 /* Rest */ ? ts.factory.createArrayTypeNode(tupleConstituentNodes[i]) : tupleConstituentNodes[i]) :
flags & 2 /* Optional */ ? ts.factory.createOptionalTypeNode(tupleConstituentNodes[i]) :
tupleConstituentNodes[i];
}
}
var tupleTypeNode = ts.setEmitFlags(ts.factory.createTupleTypeNode(tupleConstituentNodes), 1 /* SingleLine */);
return type.target.readonly ? ts.factory.createTypeOperatorNode(143 /* ReadonlyKeyword */, tupleTypeNode) : tupleTypeNode;
}
}
if (context.encounteredError || (context.flags & 524288 /* AllowEmptyTuple */)) {
var tupleTypeNode = ts.setEmitFlags(ts.factory.createTupleTypeNode([]), 1 /* SingleLine */);
return type.target.readonly ? ts.factory.createTypeOperatorNode(143 /* ReadonlyKeyword */, tupleTypeNode) : tupleTypeNode;
}
context.encounteredError = true;
return undefined; // TODO: GH#18217
}
else if (context.flags & 2048 /* WriteClassExpressionAsTypeLiteral */ &&
type.symbol.valueDeclaration &&
ts.isClassLike(type.symbol.valueDeclaration) &&
!isValueSymbolAccessible(type.symbol, context.enclosingDeclaration)) {
return createAnonymousTypeNode(type);
}
else {
var outerTypeParameters = type.target.outerTypeParameters;
var i = 0;
var resultType = void 0;
if (outerTypeParameters) {
var length_2 = outerTypeParameters.length;
while (i < length_2) {
// Find group of type arguments for type parameters with the same declaring container.
var start = i;
var parent = getParentSymbolOfTypeParameter(outerTypeParameters[i]);
do {
i++;
} while (i < length_2 && getParentSymbolOfTypeParameter(outerTypeParameters[i]) === parent);
// When type parameters are their own type arguments for the whole group (i.e. we have
// the default outer type arguments), we don't show the group.
if (!ts.rangeEquals(outerTypeParameters, typeArguments, start, i)) {
var typeArgumentSlice = mapToTypeNodes(typeArguments.slice(start, i), context);
var flags_3 = context.flags;
context.flags |= 16 /* ForbidIndexedAccessSymbolReferences */;
var ref = symbolToTypeNode(parent, context, 788968 /* Type */, typeArgumentSlice);
context.flags = flags_3;
resultType = !resultType ? ref : appendReferenceToType(resultType, ref);
}
}
}
var typeArgumentNodes = void 0;
if (typeArguments.length > 0) {
var typeParameterCount = (type.target.typeParameters || ts.emptyArray).length;
typeArgumentNodes = mapToTypeNodes(typeArguments.slice(i, typeParameterCount), context);
}
var flags = context.flags;
context.flags |= 16 /* ForbidIndexedAccessSymbolReferences */;
var finalRef = symbolToTypeNode(type.symbol, context, 788968 /* Type */, typeArgumentNodes);
context.flags = flags;
return !resultType ? finalRef : appendReferenceToType(resultType, finalRef);
}
}
function appendReferenceToType(root, ref) {
if (ts.isImportTypeNode(root)) {
// first shift type arguments
var typeArguments = root.typeArguments;
var qualifier = root.qualifier;
if (qualifier) {
if (ts.isIdentifier(qualifier)) {
qualifier = ts.factory.updateIdentifier(qualifier, typeArguments);
}
else {
qualifier = ts.factory.updateQualifiedName(qualifier, qualifier.left, ts.factory.updateIdentifier(qualifier.right, typeArguments));
}
}
typeArguments = ref.typeArguments;
// then move qualifiers
var ids = getAccessStack(ref);
for (var _i = 0, ids_1 = ids; _i < ids_1.length; _i++) {
var id = ids_1[_i];
qualifier = qualifier ? ts.factory.createQualifiedName(qualifier, id) : id;
}
return ts.factory.updateImportTypeNode(root, root.argument, qualifier, typeArguments, root.isTypeOf);
}
else {
// first shift type arguments
var typeArguments = root.typeArguments;
var typeName = root.typeName;
if (ts.isIdentifier(typeName)) {
typeName = ts.factory.updateIdentifier(typeName, typeArguments);
}
else {
typeName = ts.factory.updateQualifiedName(typeName, typeName.left, ts.factory.updateIdentifier(typeName.right, typeArguments));
}
typeArguments = ref.typeArguments;
// then move qualifiers
var ids = getAccessStack(ref);
for (var _a = 0, ids_2 = ids; _a < ids_2.length; _a++) {
var id = ids_2[_a];
typeName = ts.factory.createQualifiedName(typeName, id);
}
return ts.factory.updateTypeReferenceNode(root, typeName, typeArguments);
}
}
function getAccessStack(ref) {
var state = ref.typeName;
var ids = [];
while (!ts.isIdentifier(state)) {
ids.unshift(state.right);
state = state.left;
}
ids.unshift(state);
return ids;
}
function createTypeNodesFromResolvedType(resolvedType) {
if (checkTruncationLength(context)) {
return [ts.factory.createPropertySignature(/*modifiers*/ undefined, "...", /*questionToken*/ undefined, /*type*/ undefined)];
}
var typeElements = [];
for (var _i = 0, _a = resolvedType.callSignatures; _i < _a.length; _i++) {
var signature = _a[_i];
typeElements.push(signatureToSignatureDeclarationHelper(signature, 172 /* CallSignature */, context));
}
for (var _b = 0, _c = resolvedType.constructSignatures; _b < _c.length; _b++) {
var signature = _c[_b];
if (signature.flags & 4 /* Abstract */)
continue;
typeElements.push(signatureToSignatureDeclarationHelper(signature, 173 /* ConstructSignature */, context));
}
for (var _d = 0, _e = resolvedType.indexInfos; _d < _e.length; _d++) {
var info = _e[_d];
typeElements.push(indexInfoToIndexSignatureDeclarationHelper(info, context, resolvedType.objectFlags & 1024 /* ReverseMapped */ ? createElidedInformationPlaceholder(context) : undefined));
}
var properties = resolvedType.properties;
if (!properties) {
return typeElements;
}
var i = 0;
for (var _f = 0, properties_1 = properties; _f < properties_1.length; _f++) {
var propertySymbol = properties_1[_f];
i++;
if (context.flags & 2048 /* WriteClassExpressionAsTypeLiteral */) {
if (propertySymbol.flags & 4194304 /* Prototype */) {
continue;
}
if (ts.getDeclarationModifierFlagsFromSymbol(propertySymbol) & (8 /* Private */ | 16 /* Protected */) && context.tracker.reportPrivateInBaseOfClassExpression) {
context.tracker.reportPrivateInBaseOfClassExpression(ts.unescapeLeadingUnderscores(propertySymbol.escapedName));
}
}
if (checkTruncationLength(context) && (i + 2 < properties.length - 1)) {
typeElements.push(ts.factory.createPropertySignature(/*modifiers*/ undefined, "... " + (properties.length - i) + " more ...", /*questionToken*/ undefined, /*type*/ undefined));
addPropertyToElementList(properties[properties.length - 1], context, typeElements);
break;
}
addPropertyToElementList(propertySymbol, context, typeElements);
}
return typeElements.length ? typeElements : undefined;
}
}
function createElidedInformationPlaceholder(context) {
context.approximateLength += 3;
if (!(context.flags & 1 /* NoTruncation */)) {
return ts.factory.createTypeReferenceNode(ts.factory.createIdentifier("..."), /*typeArguments*/ undefined);
}
return ts.factory.createKeywordTypeNode(129 /* AnyKeyword */);
}
function shouldUsePlaceholderForProperty(propertySymbol, context) {
var _a;
// Use placeholders for reverse mapped types we've either already descended into, or which
// are nested reverse mappings within a mapping over a non-anonymous type. The later is a restriction mostly just to
// reduce the blowup in printback size from doing, eg, a deep reverse mapping over `Window`.
// Since anonymous types usually come from expressions, this allows us to preserve the output
// for deep mappings which likely come from expressions, while truncating those parts which
// come from mappings over library functions.
return !!(ts.getCheckFlags(propertySymbol) & 8192 /* ReverseMapped */)
&& (ts.contains(context.reverseMappedStack, propertySymbol)
|| (((_a = context.reverseMappedStack) === null || _a === void 0 ? void 0 : _a[0])
&& !(ts.getObjectFlags(ts.last(context.reverseMappedStack).propertyType) & 16 /* Anonymous */)));
}
function addPropertyToElementList(propertySymbol, context, typeElements) {
var _a, _b;
var propertyIsReverseMapped = !!(ts.getCheckFlags(propertySymbol) & 8192 /* ReverseMapped */);
var propertyType = shouldUsePlaceholderForProperty(propertySymbol, context) ?
anyType : getNonMissingTypeOfSymbol(propertySymbol);
var saveEnclosingDeclaration = context.enclosingDeclaration;
context.enclosingDeclaration = undefined;
if (context.tracker.trackSymbol && ts.getCheckFlags(propertySymbol) & 4096 /* Late */ && isLateBoundName(propertySymbol.escapedName)) {
if (propertySymbol.declarations) {
var decl = ts.first(propertySymbol.declarations);
if (hasLateBindableName(decl)) {
if (ts.isBinaryExpression(decl)) {
var name = ts.getNameOfDeclaration(decl);
if (name && ts.isElementAccessExpression(name) && ts.isPropertyAccessEntityNameExpression(name.argumentExpression)) {
trackComputedName(name.argumentExpression, saveEnclosingDeclaration, context);
}
}
else {
trackComputedName(decl.name.expression, saveEnclosingDeclaration, context);
}
}
}
else if ((_a = context.tracker) === null || _a === void 0 ? void 0 : _a.reportNonSerializableProperty) {
context.tracker.reportNonSerializableProperty(symbolToString(propertySymbol));
}
}
context.enclosingDeclaration = propertySymbol.valueDeclaration || ((_b = propertySymbol.declarations) === null || _b === void 0 ? void 0 : _b[0]) || saveEnclosingDeclaration;
var propertyName = getPropertyNameNodeForSymbol(propertySymbol, context);
context.enclosingDeclaration = saveEnclosingDeclaration;
context.approximateLength += (ts.symbolName(propertySymbol).length + 1);
var optionalToken = propertySymbol.flags & 16777216 /* Optional */ ? ts.factory.createToken(57 /* QuestionToken */) : undefined;
if (propertySymbol.flags & (16 /* Function */ | 8192 /* Method */) && !getPropertiesOfObjectType(propertyType).length && !isReadonlySymbol(propertySymbol)) {
var signatures = getSignaturesOfType(filterType(propertyType, function (t) { return !(t.flags & 32768 /* Undefined */); }), 0 /* Call */);
for (var _i = 0, signatures_1 = signatures; _i < signatures_1.length; _i++) {
var signature = signatures_1[_i];
var methodDeclaration = signatureToSignatureDeclarationHelper(signature, 166 /* MethodSignature */, context, { name: propertyName, questionToken: optionalToken });
typeElements.push(preserveCommentsOn(methodDeclaration));
}
}
else {
var propertyTypeNode = void 0;
if (shouldUsePlaceholderForProperty(propertySymbol, context)) {
propertyTypeNode = createElidedInformationPlaceholder(context);
}
else {
if (propertyIsReverseMapped) {
context.reverseMappedStack || (context.reverseMappedStack = []);
context.reverseMappedStack.push(propertySymbol);
}
propertyTypeNode = propertyType ? serializeTypeForDeclaration(context, propertyType, propertySymbol, saveEnclosingDeclaration) : ts.factory.createKeywordTypeNode(129 /* AnyKeyword */);
if (propertyIsReverseMapped) {
context.reverseMappedStack.pop();
}
}
var modifiers = isReadonlySymbol(propertySymbol) ? [ts.factory.createToken(143 /* ReadonlyKeyword */)] : undefined;
if (modifiers) {
context.approximateLength += 9;
}
var propertySignature = ts.factory.createPropertySignature(modifiers, propertyName, optionalToken, propertyTypeNode);
typeElements.push(preserveCommentsOn(propertySignature));
}
function preserveCommentsOn(node) {
var _a;
if (ts.some(propertySymbol.declarations, function (d) { return d.kind === 342 /* JSDocPropertyTag */; })) {
var d = (_a = propertySymbol.declarations) === null || _a === void 0 ? void 0 : _a.find(function (d) { return d.kind === 342 /* JSDocPropertyTag */; });
var commentText = ts.getTextOfJSDocComment(d.comment);
if (commentText) {
ts.setSyntheticLeadingComments(node, [{ kind: 3 /* MultiLineCommentTrivia */, text: "*\n * " + commentText.replace(/\n/g, "\n * ") + "\n ", pos: -1, end: -1, hasTrailingNewLine: true }]);
}
}
else if (propertySymbol.valueDeclaration) {
// Copy comments to node for declaration emit
ts.setCommentRange(node, propertySymbol.valueDeclaration);
}
return node;
}
}
function mapToTypeNodes(types, context, isBareList) {
if (ts.some(types)) {
if (checkTruncationLength(context)) {
if (!isBareList) {
return [ts.factory.createTypeReferenceNode("...", /*typeArguments*/ undefined)];
}
else if (types.length > 2) {
return [
typeToTypeNodeHelper(types[0], context),
ts.factory.createTypeReferenceNode("... " + (types.length - 2) + " more ...", /*typeArguments*/ undefined),
typeToTypeNodeHelper(types[types.length - 1], context)
];
}
}
var mayHaveNameCollisions = !(context.flags & 64 /* UseFullyQualifiedType */);
/** Map from type reference identifier text to [type, index in `result` where the type node is] */
var seenNames = mayHaveNameCollisions ? ts.createUnderscoreEscapedMultiMap() : undefined;
var result_5 = [];
var i = 0;
for (var _i = 0, types_2 = types; _i < types_2.length; _i++) {
var type = types_2[_i];
i++;
if (checkTruncationLength(context) && (i + 2 < types.length - 1)) {
result_5.push(ts.factory.createTypeReferenceNode("... " + (types.length - i) + " more ...", /*typeArguments*/ undefined));
var typeNode_1 = typeToTypeNodeHelper(types[types.length - 1], context);
if (typeNode_1) {
result_5.push(typeNode_1);
}
break;
}
context.approximateLength += 2; // Account for whitespace + separator
var typeNode = typeToTypeNodeHelper(type, context);
if (typeNode) {
result_5.push(typeNode);
if (seenNames && ts.isIdentifierTypeReference(typeNode)) {
seenNames.add(typeNode.typeName.escapedText, [type, result_5.length - 1]);
}
}
}
if (seenNames) {
// To avoid printing types like `[Foo, Foo]` or `Bar & Bar` where
// occurrences of the same name actually come from different
// namespaces, go through the single-identifier type reference nodes
// we just generated, and see if any names were generated more than
// once while referring to different types. If so, regenerate the
// type node for each entry by that name with the
// `UseFullyQualifiedType` flag enabled.
var saveContextFlags = context.flags;
context.flags |= 64 /* UseFullyQualifiedType */;
seenNames.forEach(function (types) {
if (!ts.arrayIsHomogeneous(types, function (_a, _b) {
var a = _a[0];
var b = _b[0];
return typesAreSameReference(a, b);
})) {
for (var _i = 0, types_3 = types; _i < types_3.length; _i++) {
var _a = types_3[_i], type = _a[0], resultIndex = _a[1];
result_5[resultIndex] = typeToTypeNodeHelper(type, context);
}
}
});
context.flags = saveContextFlags;
}
return result_5;
}
}
function typesAreSameReference(a, b) {
return a === b
|| !!a.symbol && a.symbol === b.symbol
|| !!a.aliasSymbol && a.aliasSymbol === b.aliasSymbol;
}
function indexInfoToIndexSignatureDeclarationHelper(indexInfo, context, typeNode) {
var name = ts.getNameFromIndexInfo(indexInfo) || "x";
var indexerTypeNode = typeToTypeNodeHelper(indexInfo.keyType, context);
var indexingParameter = ts.factory.createParameterDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*dotDotDotToken*/ undefined, name,
/*questionToken*/ undefined, indexerTypeNode,
/*initializer*/ undefined);
if (!typeNode) {
typeNode = typeToTypeNodeHelper(indexInfo.type || anyType, context);
}
if (!indexInfo.type && !(context.flags & 2097152 /* AllowEmptyIndexInfoType */)) {
context.encounteredError = true;
}
context.approximateLength += (name.length + 4);
return ts.factory.createIndexSignature(
/*decorators*/ undefined, indexInfo.isReadonly ? [ts.factory.createToken(143 /* ReadonlyKeyword */)] : undefined, [indexingParameter], typeNode);
}
function signatureToSignatureDeclarationHelper(signature, kind, context, options) {
var _a, _b, _c, _d;
var suppressAny = context.flags & 256 /* SuppressAnyReturnType */;
if (suppressAny)
context.flags &= ~256 /* SuppressAnyReturnType */; // suppress only toplevel `any`s
context.approximateLength += 3; // Usually a signature contributes a few more characters than this, but 3 is the minimum
var typeParameters;
var typeArguments;
if (context.flags & 32 /* WriteTypeArgumentsOfSignature */ && signature.target && signature.mapper && signature.target.typeParameters) {
typeArguments = signature.target.typeParameters.map(function (parameter) { return typeToTypeNodeHelper(instantiateType(parameter, signature.mapper), context); });
}
else {
typeParameters = signature.typeParameters && signature.typeParameters.map(function (parameter) { return typeParameterToDeclaration(parameter, context); });
}
var expandedParams = getExpandedParameters(signature, /*skipUnionExpanding*/ true)[0];
// If the expanded parameter list had a variadic in a non-trailing position, don't expand it
var parameters = (ts.some(expandedParams, function (p) { return p !== expandedParams[expandedParams.length - 1] && !!(ts.getCheckFlags(p) & 32768 /* RestParameter */); }) ? signature.parameters : expandedParams).map(function (parameter) { return symbolToParameterDeclaration(parameter, context, kind === 169 /* Constructor */, options === null || options === void 0 ? void 0 : options.privateSymbolVisitor, options === null || options === void 0 ? void 0 : options.bundledImports); });
if (signature.thisParameter) {
var thisParameter = symbolToParameterDeclaration(signature.thisParameter, context);
parameters.unshift(thisParameter);
}
var returnTypeNode;
var typePredicate = getTypePredicateOfSignature(signature);
if (typePredicate) {
var assertsModifier = typePredicate.kind === 2 /* AssertsThis */ || typePredicate.kind === 3 /* AssertsIdentifier */ ?
ts.factory.createToken(128 /* AssertsKeyword */) :
undefined;
var parameterName = typePredicate.kind === 1 /* Identifier */ || typePredicate.kind === 3 /* AssertsIdentifier */ ?
ts.setEmitFlags(ts.factory.createIdentifier(typePredicate.parameterName), 16777216 /* NoAsciiEscaping */) :
ts.factory.createThisTypeNode();
var typeNode = typePredicate.type && typeToTypeNodeHelper(typePredicate.type, context);
returnTypeNode = ts.factory.createTypePredicateNode(assertsModifier, parameterName, typeNode);
}
else {
var returnType = getReturnTypeOfSignature(signature);
if (returnType && !(suppressAny && isTypeAny(returnType))) {
returnTypeNode = serializeReturnTypeForSignature(context, returnType, signature, options === null || options === void 0 ? void 0 : options.privateSymbolVisitor, options === null || options === void 0 ? void 0 : options.bundledImports);
}
else if (!suppressAny) {
returnTypeNode = ts.factory.createKeywordTypeNode(129 /* AnyKeyword */);
}
}
var modifiers = options === null || options === void 0 ? void 0 : options.modifiers;
if ((kind === 178 /* ConstructorType */) && signature.flags & 4 /* Abstract */) {
var flags = ts.modifiersToFlags(modifiers);
modifiers = ts.factory.createModifiersFromModifierFlags(flags | 128 /* Abstract */);
}
var node = kind === 172 /* CallSignature */ ? ts.factory.createCallSignature(typeParameters, parameters, returnTypeNode) :
kind === 173 /* ConstructSignature */ ? ts.factory.createConstructSignature(typeParameters, parameters, returnTypeNode) :
kind === 166 /* MethodSignature */ ? ts.factory.createMethodSignature(modifiers, (_a = options === null || options === void 0 ? void 0 : options.name) !== null && _a !== void 0 ? _a : ts.factory.createIdentifier(""), options === null || options === void 0 ? void 0 : options.questionToken, typeParameters, parameters, returnTypeNode) :
kind === 167 /* MethodDeclaration */ ? ts.factory.createMethodDeclaration(/*decorators*/ undefined, modifiers, /*asteriskToken*/ undefined, (_b = options === null || options === void 0 ? void 0 : options.name) !== null && _b !== void 0 ? _b : ts.factory.createIdentifier(""), /*questionToken*/ undefined, typeParameters, parameters, returnTypeNode, /*body*/ undefined) :
kind === 169 /* Constructor */ ? ts.factory.createConstructorDeclaration(/*decorators*/ undefined, modifiers, parameters, /*body*/ undefined) :
kind === 170 /* GetAccessor */ ? ts.factory.createGetAccessorDeclaration(/*decorators*/ undefined, modifiers, (_c = options === null || options === void 0 ? void 0 : options.name) !== null && _c !== void 0 ? _c : ts.factory.createIdentifier(""), parameters, returnTypeNode, /*body*/ undefined) :
kind === 171 /* SetAccessor */ ? ts.factory.createSetAccessorDeclaration(/*decorators*/ undefined, modifiers, (_d = options === null || options === void 0 ? void 0 : options.name) !== null && _d !== void 0 ? _d : ts.factory.createIdentifier(""), parameters, /*body*/ undefined) :
kind === 174 /* IndexSignature */ ? ts.factory.createIndexSignature(/*decorators*/ undefined, modifiers, parameters, returnTypeNode) :
kind === 312 /* JSDocFunctionType */ ? ts.factory.createJSDocFunctionType(parameters, returnTypeNode) :
kind === 177 /* FunctionType */ ? ts.factory.createFunctionTypeNode(typeParameters, parameters, returnTypeNode !== null && returnTypeNode !== void 0 ? returnTypeNode : ts.factory.createTypeReferenceNode(ts.factory.createIdentifier(""))) :
kind === 178 /* ConstructorType */ ? ts.factory.createConstructorTypeNode(modifiers, typeParameters, parameters, returnTypeNode !== null && returnTypeNode !== void 0 ? returnTypeNode : ts.factory.createTypeReferenceNode(ts.factory.createIdentifier(""))) :
kind === 254 /* FunctionDeclaration */ ? ts.factory.createFunctionDeclaration(/*decorators*/ undefined, modifiers, /*asteriskToken*/ undefined, (options === null || options === void 0 ? void 0 : options.name) ? ts.cast(options.name, ts.isIdentifier) : ts.factory.createIdentifier(""), typeParameters, parameters, returnTypeNode, /*body*/ undefined) :
kind === 211 /* FunctionExpression */ ? ts.factory.createFunctionExpression(modifiers, /*asteriskToken*/ undefined, (options === null || options === void 0 ? void 0 : options.name) ? ts.cast(options.name, ts.isIdentifier) : ts.factory.createIdentifier(""), typeParameters, parameters, returnTypeNode, ts.factory.createBlock([])) :
kind === 212 /* ArrowFunction */ ? ts.factory.createArrowFunction(modifiers, typeParameters, parameters, returnTypeNode, /*equalsGreaterThanToken*/ undefined, ts.factory.createBlock([])) :
ts.Debug.assertNever(kind);
if (typeArguments) {
node.typeArguments = ts.factory.createNodeArray(typeArguments);
}
return node;
}
function typeParameterToDeclarationWithConstraint(type, context, constraintNode) {
var savedContextFlags = context.flags;
context.flags &= ~512 /* WriteTypeParametersInQualifiedName */; // Avoids potential infinite loop when building for a claimspace with a generic
var name = typeParameterToName(type, context);
var defaultParameter = getDefaultFromTypeParameter(type);
var defaultParameterNode = defaultParameter && typeToTypeNodeHelper(defaultParameter, context);
context.flags = savedContextFlags;
return ts.factory.createTypeParameterDeclaration(name, constraintNode, defaultParameterNode);
}
function typeParameterToDeclaration(type, context, constraint) {
if (constraint === void 0) { constraint = getConstraintOfTypeParameter(type); }
var constraintNode = constraint && typeToTypeNodeHelper(constraint, context);
return typeParameterToDeclarationWithConstraint(type, context, constraintNode);
}
function symbolToParameterDeclaration(parameterSymbol, context, preserveModifierFlags, privateSymbolVisitor, bundledImports) {
var parameterDeclaration = ts.getDeclarationOfKind(parameterSymbol, 162 /* Parameter */);
if (!parameterDeclaration && !ts.isTransientSymbol(parameterSymbol)) {
parameterDeclaration = ts.getDeclarationOfKind(parameterSymbol, 335 /* JSDocParameterTag */);
}
var parameterType = getTypeOfSymbol(parameterSymbol);
if (parameterDeclaration && isRequiredInitializedParameter(parameterDeclaration)) {
parameterType = getOptionalType(parameterType);
}
if ((context.flags & 1073741824 /* NoUndefinedOptionalParameterType */) && parameterDeclaration && !ts.isJSDocParameterTag(parameterDeclaration) && isOptionalUninitializedParameter(parameterDeclaration)) {
parameterType = getTypeWithFacts(parameterType, 524288 /* NEUndefined */);
}
var parameterTypeNode = serializeTypeForDeclaration(context, parameterType, parameterSymbol, context.enclosingDeclaration, privateSymbolVisitor, bundledImports);
var modifiers = !(context.flags & 8192 /* OmitParameterModifiers */) && preserveModifierFlags && parameterDeclaration && parameterDeclaration.modifiers ? parameterDeclaration.modifiers.map(ts.factory.cloneNode) : undefined;
var isRest = parameterDeclaration && ts.isRestParameter(parameterDeclaration) || ts.getCheckFlags(parameterSymbol) & 32768 /* RestParameter */;
var dotDotDotToken = isRest ? ts.factory.createToken(25 /* DotDotDotToken */) : undefined;
var name = parameterDeclaration ? parameterDeclaration.name ?
parameterDeclaration.name.kind === 79 /* Identifier */ ? ts.setEmitFlags(ts.factory.cloneNode(parameterDeclaration.name), 16777216 /* NoAsciiEscaping */) :
parameterDeclaration.name.kind === 159 /* QualifiedName */ ? ts.setEmitFlags(ts.factory.cloneNode(parameterDeclaration.name.right), 16777216 /* NoAsciiEscaping */) :
cloneBindingName(parameterDeclaration.name) :
ts.symbolName(parameterSymbol) :
ts.symbolName(parameterSymbol);
var isOptional = parameterDeclaration && isOptionalParameter(parameterDeclaration) || ts.getCheckFlags(parameterSymbol) & 16384 /* OptionalParameter */;
var questionToken = isOptional ? ts.factory.createToken(57 /* QuestionToken */) : undefined;
var parameterNode = ts.factory.createParameterDeclaration(
/*decorators*/ undefined, modifiers, dotDotDotToken, name, questionToken, parameterTypeNode,
/*initializer*/ undefined);
context.approximateLength += ts.symbolName(parameterSymbol).length + 3;
return parameterNode;
function cloneBindingName(node) {
return elideInitializerAndSetEmitFlags(node);
function elideInitializerAndSetEmitFlags(node) {
if (context.tracker.trackSymbol && ts.isComputedPropertyName(node) && isLateBindableName(node)) {
trackComputedName(node.expression, context.enclosingDeclaration, context);
}
var visited = ts.visitEachChild(node, elideInitializerAndSetEmitFlags, ts.nullTransformationContext, /*nodesVisitor*/ undefined, elideInitializerAndSetEmitFlags);
if (ts.isBindingElement(visited)) {
visited = ts.factory.updateBindingElement(visited, visited.dotDotDotToken, visited.propertyName, visited.name,
/*initializer*/ undefined);
}
if (!ts.nodeIsSynthesized(visited)) {
visited = ts.factory.cloneNode(visited);
}
return ts.setEmitFlags(visited, 1 /* SingleLine */ | 16777216 /* NoAsciiEscaping */);
}
}
}
function trackComputedName(accessExpression, enclosingDeclaration, context) {
if (!context.tracker.trackSymbol)
return;
// get symbol of the first identifier of the entityName
var firstIdentifier = ts.getFirstIdentifier(accessExpression);
var name = resolveName(firstIdentifier, firstIdentifier.escapedText, 111551 /* Value */ | 1048576 /* ExportValue */, /*nodeNotFoundErrorMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ true);
if (name) {
context.tracker.trackSymbol(name, enclosingDeclaration, 111551 /* Value */);
}
}
function lookupSymbolChain(symbol, context, meaning, yieldModuleSymbol) {
context.tracker.trackSymbol(symbol, context.enclosingDeclaration, meaning); // TODO: GH#18217
return lookupSymbolChainWorker(symbol, context, meaning, yieldModuleSymbol);
}
function lookupSymbolChainWorker(symbol, context, meaning, yieldModuleSymbol) {
// Try to get qualified name if the symbol is not a type parameter and there is an enclosing declaration.
var chain;
var isTypeParameter = symbol.flags & 262144 /* TypeParameter */;
if (!isTypeParameter && (context.enclosingDeclaration || context.flags & 64 /* UseFullyQualifiedType */) && !(context.flags & 134217728 /* DoNotIncludeSymbolChain */)) {
chain = ts.Debug.checkDefined(getSymbolChain(symbol, meaning, /*endOfChain*/ true));
ts.Debug.assert(chain && chain.length > 0);
}
else {
chain = [symbol];
}
return chain;
/** @param endOfChain Set to false for recursive calls; non-recursive calls should always output something. */
function getSymbolChain(symbol, meaning, endOfChain) {
var accessibleSymbolChain = getAccessibleSymbolChain(symbol, context.enclosingDeclaration, meaning, !!(context.flags & 128 /* UseOnlyExternalAliasing */));
var parentSpecifiers;
if (!accessibleSymbolChain ||
needsQualification(accessibleSymbolChain[0], context.enclosingDeclaration, accessibleSymbolChain.length === 1 ? meaning : getQualifiedLeftMeaning(meaning))) {
// Go up and add our parent.
var parents_1 = getContainersOfSymbol(accessibleSymbolChain ? accessibleSymbolChain[0] : symbol, context.enclosingDeclaration, meaning);
if (ts.length(parents_1)) {
parentSpecifiers = parents_1.map(function (symbol) {
return ts.some(symbol.declarations, hasNonGlobalAugmentationExternalModuleSymbol)
? getSpecifierForModuleSymbol(symbol, context)
: undefined;
});
var indices = parents_1.map(function (_, i) { return i; });
indices.sort(sortByBestName);
var sortedParents = indices.map(function (i) { return parents_1[i]; });
for (var _i = 0, sortedParents_1 = sortedParents; _i < sortedParents_1.length; _i++) {
var parent = sortedParents_1[_i];
var parentChain = getSymbolChain(parent, getQualifiedLeftMeaning(meaning), /*endOfChain*/ false);
if (parentChain) {
if (parent.exports && parent.exports.get("export=" /* ExportEquals */) &&
getSymbolIfSameReference(parent.exports.get("export=" /* ExportEquals */), symbol)) {
// parentChain root _is_ symbol - symbol is a module export=, so it kinda looks like it's own parent
// No need to lookup an alias for the symbol in itself
accessibleSymbolChain = parentChain;
break;
}
accessibleSymbolChain = parentChain.concat(accessibleSymbolChain || [getAliasForSymbolInContainer(parent, symbol) || symbol]);
break;
}
}
}
}
if (accessibleSymbolChain) {
return accessibleSymbolChain;
}
if (
// If this is the last part of outputting the symbol, always output. The cases apply only to parent symbols.
endOfChain ||
// If a parent symbol is an anonymous type, don't write it.
!(symbol.flags & (2048 /* TypeLiteral */ | 4096 /* ObjectLiteral */))) {
// If a parent symbol is an external module, don't write it. (We prefer just `x` vs `"foo/bar".x`.)
if (!endOfChain && !yieldModuleSymbol && !!ts.forEach(symbol.declarations, hasNonGlobalAugmentationExternalModuleSymbol)) {
return;
}
return [symbol];
}
function sortByBestName(a, b) {
var specifierA = parentSpecifiers[a];
var specifierB = parentSpecifiers[b];
if (specifierA && specifierB) {
var isBRelative = ts.pathIsRelative(specifierB);
if (ts.pathIsRelative(specifierA) === isBRelative) {
// Both relative or both non-relative, sort by number of parts
return ts.moduleSpecifiers.countPathComponents(specifierA) - ts.moduleSpecifiers.countPathComponents(specifierB);
}
if (isBRelative) {
// A is non-relative, B is relative: prefer A
return -1;
}
// A is relative, B is non-relative: prefer B
return 1;
}
return 0;
}
}
}
function typeParametersToTypeParameterDeclarations(symbol, context) {
var typeParameterNodes;
var targetSymbol = getTargetSymbol(symbol);
if (targetSymbol.flags & (32 /* Class */ | 64 /* Interface */ | 524288 /* TypeAlias */)) {
typeParameterNodes = ts.factory.createNodeArray(ts.map(getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(symbol), function (tp) { return typeParameterToDeclaration(tp, context); }));
}
return typeParameterNodes;
}
function lookupTypeParameterNodes(chain, index, context) {
var _a;
ts.Debug.assert(chain && 0 <= index && index < chain.length);
var symbol = chain[index];
var symbolId = getSymbolId(symbol);
if ((_a = context.typeParameterSymbolList) === null || _a === void 0 ? void 0 : _a.has(symbolId)) {
return undefined;
}
(context.typeParameterSymbolList || (context.typeParameterSymbolList = new ts.Set())).add(symbolId);
var typeParameterNodes;
if (context.flags & 512 /* WriteTypeParametersInQualifiedName */ && index < (chain.length - 1)) {
var parentSymbol = symbol;
var nextSymbol_1 = chain[index + 1];
if (ts.getCheckFlags(nextSymbol_1) & 1 /* Instantiated */) {
var params = getTypeParametersOfClassOrInterface(parentSymbol.flags & 2097152 /* Alias */ ? resolveAlias(parentSymbol) : parentSymbol);
typeParameterNodes = mapToTypeNodes(ts.map(params, function (t) { return getMappedType(t, nextSymbol_1.mapper); }), context);
}
else {
typeParameterNodes = typeParametersToTypeParameterDeclarations(symbol, context);
}
}
return typeParameterNodes;
}
/**
* Given A[B][C][D], finds A[B]
*/
function getTopmostIndexedAccessType(top) {
if (ts.isIndexedAccessTypeNode(top.objectType)) {
return getTopmostIndexedAccessType(top.objectType);
}
return top;
}
function getSpecifierForModuleSymbol(symbol, context) {
var _a;
var file = ts.getDeclarationOfKind(symbol, 300 /* SourceFile */);
if (!file) {
var equivalentFileSymbol = ts.firstDefined(symbol.declarations, function (d) { return getFileSymbolIfFileSymbolExportEqualsContainer(d, symbol); });
if (equivalentFileSymbol) {
file = ts.getDeclarationOfKind(equivalentFileSymbol, 300 /* SourceFile */);
}
}
if (file && file.moduleName !== undefined) {
// Use the amd name if it is available
return file.moduleName;
}
if (!file) {
if (context.tracker.trackReferencedAmbientModule) {
var ambientDecls = ts.filter(symbol.declarations, ts.isAmbientModule);
if (ts.length(ambientDecls)) {
for (var _i = 0, _b = ambientDecls; _i < _b.length; _i++) {
var decl = _b[_i];
context.tracker.trackReferencedAmbientModule(decl, symbol);
}
}
}
if (ambientModuleSymbolRegex.test(symbol.escapedName)) {
return symbol.escapedName.substring(1, symbol.escapedName.length - 1);
}
}
if (!context.enclosingDeclaration || !context.tracker.moduleResolverHost) {
// If there's no context declaration, we can't lookup a non-ambient specifier, so we just use the symbol name
if (ambientModuleSymbolRegex.test(symbol.escapedName)) {
return symbol.escapedName.substring(1, symbol.escapedName.length - 1);
}
return ts.getSourceFileOfNode(ts.getNonAugmentationDeclaration(symbol)).fileName; // A resolver may not be provided for baselines and errors - in those cases we use the fileName in full
}
var contextFile = ts.getSourceFileOfNode(ts.getOriginalNode(context.enclosingDeclaration));
var links = getSymbolLinks(symbol);
var specifier = links.specifierCache && links.specifierCache.get(contextFile.path);
if (!specifier) {
var isBundle_1 = !!ts.outFile(compilerOptions);
// For declaration bundles, we need to generate absolute paths relative to the common source dir for imports,
// just like how the declaration emitter does for the ambient module declarations - we can easily accomplish this
// using the `baseUrl` compiler option (which we would otherwise never use in declaration emit) and a non-relative
// specifier preference
var moduleResolverHost = context.tracker.moduleResolverHost;
var specifierCompilerOptions = isBundle_1 ? __assign(__assign({}, compilerOptions), { baseUrl: moduleResolverHost.getCommonSourceDirectory() }) : compilerOptions;
specifier = ts.first(ts.moduleSpecifiers.getModuleSpecifiers(symbol, checker, specifierCompilerOptions, contextFile, moduleResolverHost, { importModuleSpecifierPreference: isBundle_1 ? "non-relative" : "project-relative", importModuleSpecifierEnding: isBundle_1 ? "minimal" : undefined }));
(_a = links.specifierCache) !== null && _a !== void 0 ? _a : (links.specifierCache = new ts.Map());
links.specifierCache.set(contextFile.path, specifier);
}
return specifier;
}
function symbolToTypeNode(symbol, context, meaning, overrideTypeArguments) {
var chain = lookupSymbolChain(symbol, context, meaning, !(context.flags & 16384 /* UseAliasDefinedOutsideCurrentScope */)); // If we're using aliases outside the current scope, dont bother with the module
var isTypeOf = meaning === 111551 /* Value */;
if (ts.some(chain[0].declarations, hasNonGlobalAugmentationExternalModuleSymbol)) {
// module is root, must use `ImportTypeNode`
var nonRootParts = chain.length > 1 ? createAccessFromSymbolChain(chain, chain.length - 1, 1) : undefined;
var typeParameterNodes = overrideTypeArguments || lookupTypeParameterNodes(chain, 0, context);
var specifier = getSpecifierForModuleSymbol(chain[0], context);
if (!(context.flags & 67108864 /* AllowNodeModulesRelativePaths */) && ts.getEmitModuleResolutionKind(compilerOptions) === ts.ModuleResolutionKind.NodeJs && specifier.indexOf("/node_modules/") >= 0) {
// If ultimately we can only name the symbol with a reference that dives into a `node_modules` folder, we should error
// since declaration files with these kinds of references are liable to fail when published :(
context.encounteredError = true;
if (context.tracker.reportLikelyUnsafeImportRequiredError) {
context.tracker.reportLikelyUnsafeImportRequiredError(specifier);
}
}
var lit = ts.factory.createLiteralTypeNode(ts.factory.createStringLiteral(specifier));
if (context.tracker.trackExternalModuleSymbolOfImportTypeNode)
context.tracker.trackExternalModuleSymbolOfImportTypeNode(chain[0]);
context.approximateLength += specifier.length + 10; // specifier + import("")
if (!nonRootParts || ts.isEntityName(nonRootParts)) {
if (nonRootParts) {
var lastId = ts.isIdentifier(nonRootParts) ? nonRootParts : nonRootParts.right;
lastId.typeArguments = undefined;
}
return ts.factory.createImportTypeNode(lit, nonRootParts, typeParameterNodes, isTypeOf);
}
else {
var splitNode = getTopmostIndexedAccessType(nonRootParts);
var qualifier = splitNode.objectType.typeName;
return ts.factory.createIndexedAccessTypeNode(ts.factory.createImportTypeNode(lit, qualifier, typeParameterNodes, isTypeOf), splitNode.indexType);
}
}
var entityName = createAccessFromSymbolChain(chain, chain.length - 1, 0);
if (ts.isIndexedAccessTypeNode(entityName)) {
return entityName; // Indexed accesses can never be `typeof`
}
if (isTypeOf) {
return ts.factory.createTypeQueryNode(entityName);
}
else {
var lastId = ts.isIdentifier(entityName) ? entityName : entityName.right;
var lastTypeArgs = lastId.typeArguments;
lastId.typeArguments = undefined;
return ts.factory.createTypeReferenceNode(entityName, lastTypeArgs);
}
function createAccessFromSymbolChain(chain, index, stopper) {
var typeParameterNodes = index === (chain.length - 1) ? overrideTypeArguments : lookupTypeParameterNodes(chain, index, context);
var symbol = chain[index];
var parent = chain[index - 1];
var symbolName;
if (index === 0) {
context.flags |= 16777216 /* InInitialEntityName */;
symbolName = getNameOfSymbolAsWritten(symbol, context);
context.approximateLength += (symbolName ? symbolName.length : 0) + 1;
context.flags ^= 16777216 /* InInitialEntityName */;
}
else {
if (parent && getExportsOfSymbol(parent)) {
var exports_1 = getExportsOfSymbol(parent);
ts.forEachEntry(exports_1, function (ex, name) {
if (getSymbolIfSameReference(ex, symbol) && !isLateBoundName(name) && name !== "export=" /* ExportEquals */) {
symbolName = ts.unescapeLeadingUnderscores(name);
return true;
}
});
}
}
if (!symbolName) {
symbolName = getNameOfSymbolAsWritten(symbol, context);
}
context.approximateLength += symbolName.length + 1;
if (!(context.flags & 16 /* ForbidIndexedAccessSymbolReferences */) && parent &&
getMembersOfSymbol(parent) && getMembersOfSymbol(parent).get(symbol.escapedName) &&
getSymbolIfSameReference(getMembersOfSymbol(parent).get(symbol.escapedName), symbol)) {
// Should use an indexed access
var LHS = createAccessFromSymbolChain(chain, index - 1, stopper);
if (ts.isIndexedAccessTypeNode(LHS)) {
return ts.factory.createIndexedAccessTypeNode(LHS, ts.factory.createLiteralTypeNode(ts.factory.createStringLiteral(symbolName)));
}
else {
return ts.factory.createIndexedAccessTypeNode(ts.factory.createTypeReferenceNode(LHS, typeParameterNodes), ts.factory.createLiteralTypeNode(ts.factory.createStringLiteral(symbolName)));
}
}
var identifier = ts.setEmitFlags(ts.factory.createIdentifier(symbolName, typeParameterNodes), 16777216 /* NoAsciiEscaping */);
identifier.symbol = symbol;
if (index > stopper) {
var LHS = createAccessFromSymbolChain(chain, index - 1, stopper);
if (!ts.isEntityName(LHS)) {
return ts.Debug.fail("Impossible construct - an export of an indexed access cannot be reachable");
}
return ts.factory.createQualifiedName(LHS, identifier);
}
return identifier;
}
}
function typeParameterShadowsNameInScope(escapedName, context, type) {
var result = resolveName(context.enclosingDeclaration, escapedName, 788968 /* Type */, /*nameNotFoundArg*/ undefined, escapedName, /*isUse*/ false);
if (result) {
if (result.flags & 262144 /* TypeParameter */ && result === type.symbol) {
return false;
}
return true;
}
return false;
}
function typeParameterToName(type, context) {
var _a, _b;
if (context.flags & 4 /* GenerateNamesForShadowedTypeParams */ && context.typeParameterNames) {
var cached = context.typeParameterNames.get(getTypeId(type));
if (cached) {
return cached;
}
}
var result = symbolToName(type.symbol, context, 788968 /* Type */, /*expectsIdentifier*/ true);
if (!(result.kind & 79 /* Identifier */)) {
return ts.factory.createIdentifier("(Missing type parameter)");
}
if (context.flags & 4 /* GenerateNamesForShadowedTypeParams */) {
var rawtext = result.escapedText;
var i = ((_a = context.typeParameterNamesByTextNextNameCount) === null || _a === void 0 ? void 0 : _a.get(rawtext)) || 0;
var text = rawtext;
while (((_b = context.typeParameterNamesByText) === null || _b === void 0 ? void 0 : _b.has(text)) || typeParameterShadowsNameInScope(text, context, type)) {
i++;
text = rawtext + "_" + i;
}
if (text !== rawtext) {
result = ts.factory.createIdentifier(text, result.typeArguments);
}
// avoiding iterations of the above loop turns out to be worth it when `i` starts to get large, so we cache the max
// `i` we've used thus far, to save work later
(context.typeParameterNamesByTextNextNameCount || (context.typeParameterNamesByTextNextNameCount = new ts.Map())).set(rawtext, i);
(context.typeParameterNames || (context.typeParameterNames = new ts.Map())).set(getTypeId(type), result);
(context.typeParameterNamesByText || (context.typeParameterNamesByText = new ts.Set())).add(rawtext);
}
return result;
}
function symbolToName(symbol, context, meaning, expectsIdentifier) {
var chain = lookupSymbolChain(symbol, context, meaning);
if (expectsIdentifier && chain.length !== 1
&& !context.encounteredError
&& !(context.flags & 65536 /* AllowQualifiedNameInPlaceOfIdentifier */)) {
context.encounteredError = true;
}
return createEntityNameFromSymbolChain(chain, chain.length - 1);
function createEntityNameFromSymbolChain(chain, index) {
var typeParameterNodes = lookupTypeParameterNodes(chain, index, context);
var symbol = chain[index];
if (index === 0) {
context.flags |= 16777216 /* InInitialEntityName */;
}
var symbolName = getNameOfSymbolAsWritten(symbol, context);
if (index === 0) {
context.flags ^= 16777216 /* InInitialEntityName */;
}
var identifier = ts.setEmitFlags(ts.factory.createIdentifier(symbolName, typeParameterNodes), 16777216 /* NoAsciiEscaping */);
identifier.symbol = symbol;
return index > 0 ? ts.factory.createQualifiedName(createEntityNameFromSymbolChain(chain, index - 1), identifier) : identifier;
}
}
function symbolToExpression(symbol, context, meaning) {
var chain = lookupSymbolChain(symbol, context, meaning);
return createExpressionFromSymbolChain(chain, chain.length - 1);
function createExpressionFromSymbolChain(chain, index) {
var typeParameterNodes = lookupTypeParameterNodes(chain, index, context);
var symbol = chain[index];
if (index === 0) {
context.flags |= 16777216 /* InInitialEntityName */;
}
var symbolName = getNameOfSymbolAsWritten(symbol, context);
if (index === 0) {
context.flags ^= 16777216 /* InInitialEntityName */;
}
var firstChar = symbolName.charCodeAt(0);
if (ts.isSingleOrDoubleQuote(firstChar) && ts.some(symbol.declarations, hasNonGlobalAugmentationExternalModuleSymbol)) {
return ts.factory.createStringLiteral(getSpecifierForModuleSymbol(symbol, context));
}
var canUsePropertyAccess = firstChar === 35 /* hash */ ?
symbolName.length > 1 && ts.isIdentifierStart(symbolName.charCodeAt(1), languageVersion) :
ts.isIdentifierStart(firstChar, languageVersion);
if (index === 0 || canUsePropertyAccess) {
var identifier = ts.setEmitFlags(ts.factory.createIdentifier(symbolName, typeParameterNodes), 16777216 /* NoAsciiEscaping */);
identifier.symbol = symbol;
return index > 0 ? ts.factory.createPropertyAccessExpression(createExpressionFromSymbolChain(chain, index - 1), identifier) : identifier;
}
else {
if (firstChar === 91 /* openBracket */) {
symbolName = symbolName.substring(1, symbolName.length - 1);
firstChar = symbolName.charCodeAt(0);
}
var expression = void 0;
if (ts.isSingleOrDoubleQuote(firstChar)) {
expression = ts.factory.createStringLiteral(symbolName
.substring(1, symbolName.length - 1)
.replace(/\\./g, function (s) { return s.substring(1); }), firstChar === 39 /* singleQuote */);
}
else if (("" + +symbolName) === symbolName) {
expression = ts.factory.createNumericLiteral(+symbolName);
}
if (!expression) {
expression = ts.setEmitFlags(ts.factory.createIdentifier(symbolName, typeParameterNodes), 16777216 /* NoAsciiEscaping */);
expression.symbol = symbol;
}
return ts.factory.createElementAccessExpression(createExpressionFromSymbolChain(chain, index - 1), expression);
}
}
}
function isStringNamed(d) {
var name = ts.getNameOfDeclaration(d);
return !!name && ts.isStringLiteral(name);
}
function isSingleQuotedStringNamed(d) {
var name = ts.getNameOfDeclaration(d);
return !!(name && ts.isStringLiteral(name) && (name.singleQuote || !ts.nodeIsSynthesized(name) && ts.startsWith(ts.getTextOfNode(name, /*includeTrivia*/ false), "'")));
}
function getPropertyNameNodeForSymbol(symbol, context) {
var singleQuote = !!ts.length(symbol.declarations) && ts.every(symbol.declarations, isSingleQuotedStringNamed);
var fromNameType = getPropertyNameNodeForSymbolFromNameType(symbol, context, singleQuote);
if (fromNameType) {
return fromNameType;
}
var rawName = ts.unescapeLeadingUnderscores(symbol.escapedName);
var stringNamed = !!ts.length(symbol.declarations) && ts.every(symbol.declarations, isStringNamed);
return createPropertyNameNodeForIdentifierOrLiteral(rawName, stringNamed, singleQuote);
}
// See getNameForSymbolFromNameType for a stringy equivalent
function getPropertyNameNodeForSymbolFromNameType(symbol, context, singleQuote) {
var nameType = getSymbolLinks(symbol).nameType;
if (nameType) {
if (nameType.flags & 384 /* StringOrNumberLiteral */) {
var name = "" + nameType.value;
if (!ts.isIdentifierText(name, compilerOptions.target) && !isNumericLiteralName(name)) {
return ts.factory.createStringLiteral(name, !!singleQuote);
}
if (isNumericLiteralName(name) && ts.startsWith(name, "-")) {
return ts.factory.createComputedPropertyName(ts.factory.createNumericLiteral(+name));
}
return createPropertyNameNodeForIdentifierOrLiteral(name);
}
if (nameType.flags & 8192 /* UniqueESSymbol */) {
return ts.factory.createComputedPropertyName(symbolToExpression(nameType.symbol, context, 111551 /* Value */));
}
}
}
function createPropertyNameNodeForIdentifierOrLiteral(name, stringNamed, singleQuote) {
return ts.isIdentifierText(name, compilerOptions.target) ? ts.factory.createIdentifier(name) :
!stringNamed && isNumericLiteralName(name) && +name >= 0 ? ts.factory.createNumericLiteral(+name) :
ts.factory.createStringLiteral(name, !!singleQuote);
}
function cloneNodeBuilderContext(context) {
var initial = __assign({}, context);
// Make type parameters created within this context not consume the name outside this context
// The symbol serializer ends up creating many sibling scopes that all need "separate" contexts when
// it comes to naming things - within a normal `typeToTypeNode` call, the node builder only ever descends
// through the type tree, so the only cases where we could have used distinct sibling scopes was when there
// were multiple generic overloads with similar generated type parameter names
// The effect:
// When we write out
// export const x: <T>(x: T) => T
// export const y: <T>(x: T) => T
// we write it out like that, rather than as
// export const x: <T>(x: T) => T
// export const y: <T_1>(x: T_1) => T_1
if (initial.typeParameterNames) {
initial.typeParameterNames = new ts.Map(initial.typeParameterNames);
}
if (initial.typeParameterNamesByText) {
initial.typeParameterNamesByText = new ts.Set(initial.typeParameterNamesByText);
}
if (initial.typeParameterSymbolList) {
initial.typeParameterSymbolList = new ts.Set(initial.typeParameterSymbolList);
}
initial.tracker = wrapSymbolTrackerToReportForContext(initial, initial.tracker);
return initial;
}
function getDeclarationWithTypeAnnotation(symbol, enclosingDeclaration) {
return symbol.declarations && ts.find(symbol.declarations, function (s) { return !!ts.getEffectiveTypeAnnotationNode(s) && (!enclosingDeclaration || !!ts.findAncestor(s, function (n) { return n === enclosingDeclaration; })); });
}
function existingTypeNodeIsNotReferenceOrIsReferenceWithCompatibleTypeArgumentCount(existing, type) {
return !(ts.getObjectFlags(type) & 4 /* Reference */) || !ts.isTypeReferenceNode(existing) || ts.length(existing.typeArguments) >= getMinTypeArgumentCount(type.target.typeParameters);
}
/**
* Unlike `typeToTypeNodeHelper`, this handles setting up the `AllowUniqueESSymbolType` flag
* so a `unique symbol` is returned when appropriate for the input symbol, rather than `typeof sym`
*/
function serializeTypeForDeclaration(context, type, symbol, enclosingDeclaration, includePrivateSymbol, bundled) {
if (type !== errorType && enclosingDeclaration) {
var declWithExistingAnnotation = getDeclarationWithTypeAnnotation(symbol, enclosingDeclaration);
if (declWithExistingAnnotation && !ts.isFunctionLikeDeclaration(declWithExistingAnnotation) && !ts.isGetAccessorDeclaration(declWithExistingAnnotation)) {
// try to reuse the existing annotation
var existing = ts.getEffectiveTypeAnnotationNode(declWithExistingAnnotation);
if (getTypeFromTypeNode(existing) === type && existingTypeNodeIsNotReferenceOrIsReferenceWithCompatibleTypeArgumentCount(existing, type)) {
var result_6 = serializeExistingTypeNode(context, existing, includePrivateSymbol, bundled);
if (result_6) {
return result_6;
}
}
}
}
var oldFlags = context.flags;
if (type.flags & 8192 /* UniqueESSymbol */ &&
type.symbol === symbol && (!context.enclosingDeclaration || ts.some(symbol.declarations, function (d) { return ts.getSourceFileOfNode(d) === ts.getSourceFileOfNode(context.enclosingDeclaration); }))) {
context.flags |= 1048576 /* AllowUniqueESSymbolType */;
}
var result = typeToTypeNodeHelper(type, context);
context.flags = oldFlags;
return result;
}
function serializeReturnTypeForSignature(context, type, signature, includePrivateSymbol, bundled) {
if (type !== errorType && context.enclosingDeclaration) {
var annotation = signature.declaration && ts.getEffectiveReturnTypeNode(signature.declaration);
if (!!ts.findAncestor(annotation, function (n) { return n === context.enclosingDeclaration; }) && annotation) {
var annotated = getTypeFromTypeNode(annotation);
var thisInstantiated = annotated.flags & 262144 /* TypeParameter */ && annotated.isThisType ? instantiateType(annotated, signature.mapper) : annotated;
if (thisInstantiated === type && existingTypeNodeIsNotReferenceOrIsReferenceWithCompatibleTypeArgumentCount(annotation, type)) {
var result = serializeExistingTypeNode(context, annotation, includePrivateSymbol, bundled);
if (result) {
return result;
}
}
}
}
return typeToTypeNodeHelper(type, context);
}
function trackExistingEntityName(node, context, includePrivateSymbol) {
var _a, _b;
var introducesError = false;
var leftmost = ts.getFirstIdentifier(node);
if (ts.isInJSFile(node) && (ts.isExportsIdentifier(leftmost) || ts.isModuleExportsAccessExpression(leftmost.parent) || (ts.isQualifiedName(leftmost.parent) && ts.isModuleIdentifier(leftmost.parent.left) && ts.isExportsIdentifier(leftmost.parent.right)))) {
introducesError = true;
return { introducesError: introducesError, node: node };
}
var sym = resolveEntityName(leftmost, 67108863 /* All */, /*ignoreErrors*/ true, /*dontResolveALias*/ true);
if (sym) {
if (isSymbolAccessible(sym, context.enclosingDeclaration, 67108863 /* All */, /*shouldComputeAliasesToMakeVisible*/ false).accessibility !== 0 /* Accessible */) {
introducesError = true;
}
else {
(_b = (_a = context.tracker) === null || _a === void 0 ? void 0 : _a.trackSymbol) === null || _b === void 0 ? void 0 : _b.call(_a, sym, context.enclosingDeclaration, 67108863 /* All */);
includePrivateSymbol === null || includePrivateSymbol === void 0 ? void 0 : includePrivateSymbol(sym);
}
if (ts.isIdentifier(node)) {
var name = sym.flags & 262144 /* TypeParameter */ ? typeParameterToName(getDeclaredTypeOfSymbol(sym), context) : ts.factory.cloneNode(node);
name.symbol = sym; // for quickinfo, which uses identifier symbol information
return { introducesError: introducesError, node: ts.setEmitFlags(ts.setOriginalNode(name, node), 16777216 /* NoAsciiEscaping */) };
}
}
return { introducesError: introducesError, node: node };
}
function serializeExistingTypeNode(context, existing, includePrivateSymbol, bundled) {
if (cancellationToken && cancellationToken.throwIfCancellationRequested) {
cancellationToken.throwIfCancellationRequested();
}
var hadError = false;
var file = ts.getSourceFileOfNode(existing);
var transformed = ts.visitNode(existing, visitExistingNodeTreeSymbols);
if (hadError) {
return undefined;
}
return transformed === existing ? ts.setTextRange(ts.factory.cloneNode(existing), existing) : transformed;
function visitExistingNodeTreeSymbols(node) {
// We don't _actually_ support jsdoc namepath types, emit `any` instead
if (ts.isJSDocAllType(node) || node.kind === 314 /* JSDocNamepathType */) {
return ts.factory.createKeywordTypeNode(129 /* AnyKeyword */);
}
if (ts.isJSDocUnknownType(node)) {
return ts.factory.createKeywordTypeNode(153 /* UnknownKeyword */);
}
if (ts.isJSDocNullableType(node)) {
return ts.factory.createUnionTypeNode([ts.visitNode(node.type, visitExistingNodeTreeSymbols), ts.factory.createLiteralTypeNode(ts.factory.createNull())]);
}
if (ts.isJSDocOptionalType(node)) {
return ts.factory.createUnionTypeNode([ts.visitNode(node.type, visitExistingNodeTreeSymbols), ts.factory.createKeywordTypeNode(151 /* UndefinedKeyword */)]);
}
if (ts.isJSDocNonNullableType(node)) {
return ts.visitNode(node.type, visitExistingNodeTreeSymbols);
}
if (ts.isJSDocVariadicType(node)) {
return ts.factory.createArrayTypeNode(ts.visitNode(node.type, visitExistingNodeTreeSymbols));
}
if (ts.isJSDocTypeLiteral(node)) {
return ts.factory.createTypeLiteralNode(ts.map(node.jsDocPropertyTags, function (t) {
var name = ts.isIdentifier(t.name) ? t.name : t.name.right;
var typeViaParent = getTypeOfPropertyOfType(getTypeFromTypeNode(node), name.escapedText);
var overrideTypeNode = typeViaParent && t.typeExpression && getTypeFromTypeNode(t.typeExpression.type) !== typeViaParent ? typeToTypeNodeHelper(typeViaParent, context) : undefined;
return ts.factory.createPropertySignature(
/*modifiers*/ undefined, name, t.isBracketed || t.typeExpression && ts.isJSDocOptionalType(t.typeExpression.type) ? ts.factory.createToken(57 /* QuestionToken */) : undefined, overrideTypeNode || (t.typeExpression && ts.visitNode(t.typeExpression.type, visitExistingNodeTreeSymbols)) || ts.factory.createKeywordTypeNode(129 /* AnyKeyword */));
}));
}
if (ts.isTypeReferenceNode(node) && ts.isIdentifier(node.typeName) && node.typeName.escapedText === "") {
return ts.setOriginalNode(ts.factory.createKeywordTypeNode(129 /* AnyKeyword */), node);
}
if ((ts.isExpressionWithTypeArguments(node) || ts.isTypeReferenceNode(node)) && ts.isJSDocIndexSignature(node)) {
return ts.factory.createTypeLiteralNode([ts.factory.createIndexSignature(
/*decorators*/ undefined,
/*modifiers*/ undefined, [ts.factory.createParameterDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*dotdotdotToken*/ undefined, "x",
/*questionToken*/ undefined, ts.visitNode(node.typeArguments[0], visitExistingNodeTreeSymbols))], ts.visitNode(node.typeArguments[1], visitExistingNodeTreeSymbols))]);
}
if (ts.isJSDocFunctionType(node)) {
if (ts.isJSDocConstructSignature(node)) {
var newTypeNode_1;
return ts.factory.createConstructorTypeNode(node.modifiers, ts.visitNodes(node.typeParameters, visitExistingNodeTreeSymbols), ts.mapDefined(node.parameters, function (p, i) { return p.name && ts.isIdentifier(p.name) && p.name.escapedText === "new" ? (newTypeNode_1 = p.type, undefined) : ts.factory.createParameterDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, getEffectiveDotDotDotForParameter(p), getNameForJSDocFunctionParameter(p, i), p.questionToken, ts.visitNode(p.type, visitExistingNodeTreeSymbols),
/*initializer*/ undefined); }), ts.visitNode(newTypeNode_1 || node.type, visitExistingNodeTreeSymbols) || ts.factory.createKeywordTypeNode(129 /* AnyKeyword */));
}
else {
return ts.factory.createFunctionTypeNode(ts.visitNodes(node.typeParameters, visitExistingNodeTreeSymbols), ts.map(node.parameters, function (p, i) { return ts.factory.createParameterDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, getEffectiveDotDotDotForParameter(p), getNameForJSDocFunctionParameter(p, i), p.questionToken, ts.visitNode(p.type, visitExistingNodeTreeSymbols),
/*initializer*/ undefined); }), ts.visitNode(node.type, visitExistingNodeTreeSymbols) || ts.factory.createKeywordTypeNode(129 /* AnyKeyword */));
}
}
if (ts.isTypeReferenceNode(node) && ts.isInJSDoc(node) && (!existingTypeNodeIsNotReferenceOrIsReferenceWithCompatibleTypeArgumentCount(node, getTypeFromTypeNode(node)) || getIntendedTypeFromJSDocTypeReference(node) || unknownSymbol === resolveTypeReferenceName(getTypeReferenceName(node), 788968 /* Type */, /*ignoreErrors*/ true))) {
return ts.setOriginalNode(typeToTypeNodeHelper(getTypeFromTypeNode(node), context), node);
}
if (ts.isLiteralImportTypeNode(node)) {
var nodeSymbol = getNodeLinks(node).resolvedSymbol;
if (ts.isInJSDoc(node) &&
nodeSymbol &&
(
// The import type resolved using jsdoc fallback logic
(!node.isTypeOf && !(nodeSymbol.flags & 788968 /* Type */)) ||
// The import type had type arguments autofilled by js fallback logic
!(ts.length(node.typeArguments) >= getMinTypeArgumentCount(getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(nodeSymbol))))) {
return ts.setOriginalNode(typeToTypeNodeHelper(getTypeFromTypeNode(node), context), node);
}
return ts.factory.updateImportTypeNode(node, ts.factory.updateLiteralTypeNode(node.argument, rewriteModuleSpecifier(node, node.argument.literal)), node.qualifier, ts.visitNodes(node.typeArguments, visitExistingNodeTreeSymbols, ts.isTypeNode), node.isTypeOf);
}
if (ts.isEntityName(node) || ts.isEntityNameExpression(node)) {
var _a = trackExistingEntityName(node, context, includePrivateSymbol), introducesError = _a.introducesError, result = _a.node;
hadError = hadError || introducesError;
if (result !== node) {
return result;
}
}
if (file && ts.isTupleTypeNode(node) && (ts.getLineAndCharacterOfPosition(file, node.pos).line === ts.getLineAndCharacterOfPosition(file, node.end).line)) {
ts.setEmitFlags(node, 1 /* SingleLine */);
}
return ts.visitEachChild(node, visitExistingNodeTreeSymbols, ts.nullTransformationContext);
function getEffectiveDotDotDotForParameter(p) {
return p.dotDotDotToken || (p.type && ts.isJSDocVariadicType(p.type) ? ts.factory.createToken(25 /* DotDotDotToken */) : undefined);
}
/** Note that `new:T` parameters are not handled, but should be before calling this function. */
function getNameForJSDocFunctionParameter(p, index) {
return p.name && ts.isIdentifier(p.name) && p.name.escapedText === "this" ? "this"
: getEffectiveDotDotDotForParameter(p) ? "args"
: "arg" + index;
}
function rewriteModuleSpecifier(parent, lit) {
if (bundled) {
if (context.tracker && context.tracker.moduleResolverHost) {
var targetFile = getExternalModuleFileFromDeclaration(parent);
if (targetFile) {
var getCanonicalFileName = ts.createGetCanonicalFileName(!!host.useCaseSensitiveFileNames);
var resolverHost = {
getCanonicalFileName: getCanonicalFileName,
getCurrentDirectory: function () { return context.tracker.moduleResolverHost.getCurrentDirectory(); },
getCommonSourceDirectory: function () { return context.tracker.moduleResolverHost.getCommonSourceDirectory(); }
};
var newName = ts.getResolvedExternalModuleName(resolverHost, targetFile);
return ts.factory.createStringLiteral(newName);
}
}
}
else {
if (context.tracker && context.tracker.trackExternalModuleSymbolOfImportTypeNode) {
var moduleSym = resolveExternalModuleNameWorker(lit, lit, /*moduleNotFoundError*/ undefined);
if (moduleSym) {
context.tracker.trackExternalModuleSymbolOfImportTypeNode(moduleSym);
}
}
}
return lit;
}
}
}
function symbolTableToDeclarationStatements(symbolTable, context, bundled) {
var serializePropertySymbolForClass = makeSerializePropertySymbol(ts.factory.createPropertyDeclaration, 167 /* MethodDeclaration */, /*useAcessors*/ true);
var serializePropertySymbolForInterfaceWorker = makeSerializePropertySymbol(function (_decorators, mods, name, question, type) { return ts.factory.createPropertySignature(mods, name, question, type); }, 166 /* MethodSignature */, /*useAcessors*/ false);
// TODO: Use `setOriginalNode` on original declaration names where possible so these declarations see some kind of
// declaration mapping
// We save the enclosing declaration off here so it's not adjusted by well-meaning declaration
// emit codepaths which want to apply more specific contexts (so we can still refer to the root real declaration
// we're trying to emit from later on)
var enclosingDeclaration = context.enclosingDeclaration;
var results = [];
var visitedSymbols = new ts.Set();
var deferredPrivatesStack = [];
var oldcontext = context;
context = __assign(__assign({}, oldcontext), { usedSymbolNames: new ts.Set(oldcontext.usedSymbolNames), remappedSymbolNames: new ts.Map(), tracker: __assign(__assign({}, oldcontext.tracker), { trackSymbol: function (sym, decl, meaning) {
var accessibleResult = isSymbolAccessible(sym, decl, meaning, /*computeAliases*/ false);
if (accessibleResult.accessibility === 0 /* Accessible */) {
// Lookup the root symbol of the chain of refs we'll use to access it and serialize it
var chain = lookupSymbolChainWorker(sym, context, meaning);
if (!(sym.flags & 4 /* Property */)) {
includePrivateSymbol(chain[0]);
}
}
else if (oldcontext.tracker && oldcontext.tracker.trackSymbol) {
return oldcontext.tracker.trackSymbol(sym, decl, meaning);
}
return false;
} }) });
context.tracker = wrapSymbolTrackerToReportForContext(context, context.tracker);
ts.forEachEntry(symbolTable, function (symbol, name) {
var baseName = ts.unescapeLeadingUnderscores(name);
void getInternalSymbolName(symbol, baseName); // Called to cache values into `usedSymbolNames` and `remappedSymbolNames`
});
var addingDeclare = !bundled;
var exportEquals = symbolTable.get("export=" /* ExportEquals */);
if (exportEquals && symbolTable.size > 1 && exportEquals.flags & 2097152 /* Alias */) {
symbolTable = ts.createSymbolTable();
// Remove extraneous elements from root symbol table (they'll be mixed back in when the target of the `export=` is looked up)
symbolTable.set("export=" /* ExportEquals */, exportEquals);
}
visitSymbolTable(symbolTable);
return mergeRedundantStatements(results);
function isIdentifierAndNotUndefined(node) {
return !!node && node.kind === 79 /* Identifier */;
}
function getNamesOfDeclaration(statement) {
if (ts.isVariableStatement(statement)) {
return ts.filter(ts.map(statement.declarationList.declarations, ts.getNameOfDeclaration), isIdentifierAndNotUndefined);
}
return ts.filter([ts.getNameOfDeclaration(statement)], isIdentifierAndNotUndefined);
}
function flattenExportAssignedNamespace(statements) {
var exportAssignment = ts.find(statements, ts.isExportAssignment);
var nsIndex = ts.findIndex(statements, ts.isModuleDeclaration);
var ns = nsIndex !== -1 ? statements[nsIndex] : undefined;
if (ns && exportAssignment && exportAssignment.isExportEquals &&
ts.isIdentifier(exportAssignment.expression) && ts.isIdentifier(ns.name) && ts.idText(ns.name) === ts.idText(exportAssignment.expression) &&
ns.body && ts.isModuleBlock(ns.body)) {
// Pass 0: Correct situations where a module has both an `export = ns` and multiple top-level exports by stripping the export modifiers from
// the top-level exports and exporting them in the targeted ns, as can occur when a js file has both typedefs and `module.export` assignments
var excessExports = ts.filter(statements, function (s) { return !!(ts.getEffectiveModifierFlags(s) & 1 /* Export */); });
var name_2 = ns.name;
var body = ns.body;
if (ts.length(excessExports)) {
ns = ts.factory.updateModuleDeclaration(ns, ns.decorators, ns.modifiers, ns.name, body = ts.factory.updateModuleBlock(body, ts.factory.createNodeArray(__spreadArray(__spreadArray([], ns.body.statements, true), [ts.factory.createExportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, ts.factory.createNamedExports(ts.map(ts.flatMap(excessExports, function (e) { return getNamesOfDeclaration(e); }), function (id) { return ts.factory.createExportSpecifier(/*alias*/ undefined, id); })),
/*moduleSpecifier*/ undefined)], false))));
statements = __spreadArray(__spreadArray(__spreadArray([], statements.slice(0, nsIndex), true), [ns], false), statements.slice(nsIndex + 1), true);
}
// Pass 1: Flatten `export namespace _exports {} export = _exports;` so long as the `export=` only points at a single namespace declaration
if (!ts.find(statements, function (s) { return s !== ns && ts.nodeHasName(s, name_2); })) {
results = [];
// If the namespace contains no export assignments or declarations, and no declarations flagged with `export`, then _everything_ is exported -
// to respect this as the top level, we need to add an `export` modifier to everything
var mixinExportFlag_1 = !ts.some(body.statements, function (s) { return ts.hasSyntacticModifier(s, 1 /* Export */) || ts.isExportAssignment(s) || ts.isExportDeclaration(s); });
ts.forEach(body.statements, function (s) {
addResult(s, mixinExportFlag_1 ? 1 /* Export */ : 0 /* None */); // Recalculates the ambient (and export, if applicable from above) flag
});
statements = __spreadArray(__spreadArray([], ts.filter(statements, function (s) { return s !== ns && s !== exportAssignment; }), true), results, true);
}
}
return statements;
}
function mergeExportDeclarations(statements) {
// Pass 2: Combine all `export {}` declarations
var exports = ts.filter(statements, function (d) { return ts.isExportDeclaration(d) && !d.moduleSpecifier && !!d.exportClause && ts.isNamedExports(d.exportClause); });
if (ts.length(exports) > 1) {
var nonExports = ts.filter(statements, function (d) { return !ts.isExportDeclaration(d) || !!d.moduleSpecifier || !d.exportClause; });
statements = __spreadArray(__spreadArray([], nonExports, true), [ts.factory.createExportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, ts.factory.createNamedExports(ts.flatMap(exports, function (e) { return ts.cast(e.exportClause, ts.isNamedExports).elements; })),
/*moduleSpecifier*/ undefined)], false);
}
// Pass 2b: Also combine all `export {} from "..."` declarations as needed
var reexports = ts.filter(statements, function (d) { return ts.isExportDeclaration(d) && !!d.moduleSpecifier && !!d.exportClause && ts.isNamedExports(d.exportClause); });
if (ts.length(reexports) > 1) {
var groups = ts.group(reexports, function (decl) { return ts.isStringLiteral(decl.moduleSpecifier) ? ">" + decl.moduleSpecifier.text : ">"; });
if (groups.length !== reexports.length) {
var _loop_9 = function (group_1) {
if (group_1.length > 1) {
// remove group members from statements and then merge group members and add back to statements
statements = __spreadArray(__spreadArray([], ts.filter(statements, function (s) { return group_1.indexOf(s) === -1; }), true), [
ts.factory.createExportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, ts.factory.createNamedExports(ts.flatMap(group_1, function (e) { return ts.cast(e.exportClause, ts.isNamedExports).elements; })), group_1[0].moduleSpecifier)
], false);
}
};
for (var _i = 0, groups_1 = groups; _i < groups_1.length; _i++) {
var group_1 = groups_1[_i];
_loop_9(group_1);
}
}
}
return statements;
}
function inlineExportModifiers(statements) {
// Pass 3: Move all `export {}`'s to `export` modifiers where possible
var index = ts.findIndex(statements, function (d) { return ts.isExportDeclaration(d) && !d.moduleSpecifier && !!d.exportClause && ts.isNamedExports(d.exportClause); });
if (index >= 0) {
var exportDecl = statements[index];
var replacements = ts.mapDefined(exportDecl.exportClause.elements, function (e) {
if (!e.propertyName) {
// export {name} - look thru `statements` for `name`, and if all results can take an `export` modifier, do so and filter it
var indices = ts.indicesOf(statements);
var associatedIndices = ts.filter(indices, function (i) { return ts.nodeHasName(statements[i], e.name); });
if (ts.length(associatedIndices) && ts.every(associatedIndices, function (i) { return canHaveExportModifier(statements[i]); })) {
for (var _i = 0, associatedIndices_1 = associatedIndices; _i < associatedIndices_1.length; _i++) {
var index_1 = associatedIndices_1[_i];
statements[index_1] = addExportModifier(statements[index_1]);
}
return undefined;
}
}
return e;
});
if (!ts.length(replacements)) {
// all clauses removed, remove the export declaration
ts.orderedRemoveItemAt(statements, index);
}
else {
// some items filtered, others not - update the export declaration
statements[index] = ts.factory.updateExportDeclaration(exportDecl, exportDecl.decorators, exportDecl.modifiers, exportDecl.isTypeOnly, ts.factory.updateNamedExports(exportDecl.exportClause, replacements), exportDecl.moduleSpecifier);
}
}
return statements;
}
function mergeRedundantStatements(statements) {
statements = flattenExportAssignedNamespace(statements);
statements = mergeExportDeclarations(statements);
statements = inlineExportModifiers(statements);
// Not a cleanup, but as a final step: If there is a mix of `export` and non-`export` declarations, but no `export =` or `export {}` add a `export {};` so
// declaration privacy is respected.
if (enclosingDeclaration &&
((ts.isSourceFile(enclosingDeclaration) && ts.isExternalOrCommonJsModule(enclosingDeclaration)) || ts.isModuleDeclaration(enclosingDeclaration)) &&
(!ts.some(statements, ts.isExternalModuleIndicator) || (!ts.hasScopeMarker(statements) && ts.some(statements, ts.needsScopeMarker)))) {
statements.push(ts.createEmptyExports(ts.factory));
}
return statements;
}
function canHaveExportModifier(node) {
return ts.isEnumDeclaration(node) ||
ts.isVariableStatement(node) ||
ts.isFunctionDeclaration(node) ||
ts.isClassDeclaration(node) ||
(ts.isModuleDeclaration(node) && !ts.isExternalModuleAugmentation(node) && !ts.isGlobalScopeAugmentation(node)) ||
ts.isInterfaceDeclaration(node) ||
isTypeDeclaration(node);
}
function addExportModifier(node) {
var flags = (ts.getEffectiveModifierFlags(node) | 1 /* Export */) & ~2 /* Ambient */;
return ts.factory.updateModifiers(node, flags);
}
function removeExportModifier(node) {
var flags = ts.getEffectiveModifierFlags(node) & ~1 /* Export */;
return ts.factory.updateModifiers(node, flags);
}
function visitSymbolTable(symbolTable, suppressNewPrivateContext, propertyAsAlias) {
if (!suppressNewPrivateContext) {
deferredPrivatesStack.push(new ts.Map());
}
symbolTable.forEach(function (symbol) {
serializeSymbol(symbol, /*isPrivate*/ false, !!propertyAsAlias);
});
if (!suppressNewPrivateContext) {
// deferredPrivates will be filled up by visiting the symbol table
// And will continue to iterate as elements are added while visited `deferredPrivates`
// (As that's how a map iterator is defined to work)
deferredPrivatesStack[deferredPrivatesStack.length - 1].forEach(function (symbol) {
serializeSymbol(symbol, /*isPrivate*/ true, !!propertyAsAlias);
});
deferredPrivatesStack.pop();
}
}
function serializeSymbol(symbol, isPrivate, propertyAsAlias) {
// cache visited list based on merged symbol, since we want to use the unmerged top-level symbol, but
// still skip reserializing it if we encounter the merged product later on
var visitedSym = getMergedSymbol(symbol);
if (visitedSymbols.has(getSymbolId(visitedSym))) {
return; // Already printed
}
visitedSymbols.add(getSymbolId(visitedSym));
// Only actually serialize symbols within the correct enclosing declaration, otherwise do nothing with the out-of-context symbol
var skipMembershipCheck = !isPrivate; // We only call this on exported symbols when we know they're in the correct scope
if (skipMembershipCheck || (!!ts.length(symbol.declarations) && ts.some(symbol.declarations, function (d) { return !!ts.findAncestor(d, function (n) { return n === enclosingDeclaration; }); }))) {
var oldContext = context;
context = cloneNodeBuilderContext(context);
var result = serializeSymbolWorker(symbol, isPrivate, propertyAsAlias);
if (context.reportedDiagnostic) {
oldcontext.reportedDiagnostic = context.reportedDiagnostic; // hoist diagnostic result into outer context
}
context = oldContext;
return result;
}
}
// Synthesize declarations for a symbol - might be an Interface, a Class, a Namespace, a Type, a Variable (const, let, or var), an Alias
// or a merge of some number of those.
// An interesting challenge is ensuring that when classes merge with namespaces and interfaces, is keeping
// each symbol in only one of the representations
// Also, synthesizing a default export of some kind
// If it's an alias: emit `export default ref`
// If it's a property: emit `export default _default` with a `_default` prop
// If it's a class/interface/function: emit a class/interface/function with a `default` modifier
// These forms can merge, eg (`export default 12; export default interface A {}`)
function serializeSymbolWorker(symbol, isPrivate, propertyAsAlias) {
var _a, _b;
var symbolName = ts.unescapeLeadingUnderscores(symbol.escapedName);
var isDefault = symbol.escapedName === "default" /* Default */;
if (isPrivate && !(context.flags & 131072 /* AllowAnonymousIdentifier */) && ts.isStringANonContextualKeyword(symbolName) && !isDefault) {
// Oh no. We cannot use this symbol's name as it's name... It's likely some jsdoc had an invalid name like `export` or `default` :(
context.encounteredError = true;
// TODO: Issue error via symbol tracker?
return; // If we need to emit a private with a keyword name, we're done for, since something else will try to refer to it by that name
}
var needsPostExportDefault = isDefault && !!(symbol.flags & -113 /* ExportDoesNotSupportDefaultModifier */
|| (symbol.flags & 16 /* Function */ && ts.length(getPropertiesOfType(getTypeOfSymbol(symbol))))) && !(symbol.flags & 2097152 /* Alias */); // An alias symbol should preclude needing to make an alias ourselves
var needsExportDeclaration = !needsPostExportDefault && !isPrivate && ts.isStringANonContextualKeyword(symbolName) && !isDefault;
// `serializeVariableOrProperty` will handle adding the export declaration if it is run (since `getInternalSymbolName` will create the name mapping), so we need to ensuer we unset `needsExportDeclaration` if it is
if (needsPostExportDefault || needsExportDeclaration) {
isPrivate = true;
}
var modifierFlags = (!isPrivate ? 1 /* Export */ : 0) | (isDefault && !needsPostExportDefault ? 512 /* Default */ : 0);
var isConstMergedWithNS = symbol.flags & 1536 /* Module */ &&
symbol.flags & (2 /* BlockScopedVariable */ | 1 /* FunctionScopedVariable */ | 4 /* Property */) &&
symbol.escapedName !== "export=" /* ExportEquals */;
var isConstMergedWithNSPrintableAsSignatureMerge = isConstMergedWithNS && isTypeRepresentableAsFunctionNamespaceMerge(getTypeOfSymbol(symbol), symbol);
if (symbol.flags & (16 /* Function */ | 8192 /* Method */) || isConstMergedWithNSPrintableAsSignatureMerge) {
serializeAsFunctionNamespaceMerge(getTypeOfSymbol(symbol), symbol, getInternalSymbolName(symbol, symbolName), modifierFlags);
}
if (symbol.flags & 524288 /* TypeAlias */) {
serializeTypeAlias(symbol, symbolName, modifierFlags);
}
// Need to skip over export= symbols below - json source files get a single `Property` flagged
// symbol of name `export=` which needs to be handled like an alias. It's not great, but it is what it is.
if (symbol.flags & (2 /* BlockScopedVariable */ | 1 /* FunctionScopedVariable */ | 4 /* Property */)
&& symbol.escapedName !== "export=" /* ExportEquals */
&& !(symbol.flags & 4194304 /* Prototype */)
&& !(symbol.flags & 32 /* Class */)
&& !isConstMergedWithNSPrintableAsSignatureMerge) {
if (propertyAsAlias) {
var createdExport = serializeMaybeAliasAssignment(symbol);
if (createdExport) {
needsExportDeclaration = false;
needsPostExportDefault = false;
}
}
else {
var type = getTypeOfSymbol(symbol);
var localName = getInternalSymbolName(symbol, symbolName);
if (!(symbol.flags & 16 /* Function */) && isTypeRepresentableAsFunctionNamespaceMerge(type, symbol)) {
// If the type looks like a function declaration + ns could represent it, and it's type is sourced locally, rewrite it into a function declaration + ns
serializeAsFunctionNamespaceMerge(type, symbol, localName, modifierFlags);
}
else {
// A Class + Property merge is made for a `module.exports.Member = class {}`, and it doesn't serialize well as either a class _or_ a property symbol - in fact, _it behaves like an alias!_
// `var` is `FunctionScopedVariable`, `const` and `let` are `BlockScopedVariable`, and `module.exports.thing =` is `Property`
var flags = !(symbol.flags & 2 /* BlockScopedVariable */) ? undefined
: isConstVariable(symbol) ? 2 /* Const */
: 1 /* Let */;
var name = (needsPostExportDefault || !(symbol.flags & 4 /* Property */)) ? localName : getUnusedName(localName, symbol);
var textRange = symbol.declarations && ts.find(symbol.declarations, function (d) { return ts.isVariableDeclaration(d); });
if (textRange && ts.isVariableDeclarationList(textRange.parent) && textRange.parent.declarations.length === 1) {
textRange = textRange.parent.parent;
}
var propertyAccessRequire = (_a = symbol.declarations) === null || _a === void 0 ? void 0 : _a.find(ts.isPropertyAccessExpression);
if (propertyAccessRequire && ts.isBinaryExpression(propertyAccessRequire.parent) && ts.isIdentifier(propertyAccessRequire.parent.right)
&& ((_b = type.symbol) === null || _b === void 0 ? void 0 : _b.valueDeclaration) && ts.isSourceFile(type.symbol.valueDeclaration)) {
var alias = localName === propertyAccessRequire.parent.right.escapedText ? undefined : propertyAccessRequire.parent.right;
addResult(ts.factory.createExportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, ts.factory.createNamedExports([ts.factory.createExportSpecifier(alias, localName)])), 0 /* None */);
context.tracker.trackSymbol(type.symbol, context.enclosingDeclaration, 111551 /* Value */);
}
else {
var statement = ts.setTextRange(ts.factory.createVariableStatement(/*modifiers*/ undefined, ts.factory.createVariableDeclarationList([
ts.factory.createVariableDeclaration(name, /*exclamationToken*/ undefined, serializeTypeForDeclaration(context, type, symbol, enclosingDeclaration, includePrivateSymbol, bundled))
], flags)), textRange);
addResult(statement, name !== localName ? modifierFlags & ~1 /* Export */ : modifierFlags);
if (name !== localName && !isPrivate) {
// We rename the variable declaration we generate for Property symbols since they may have a name which
// conflicts with a local declaration. For example, given input:
// ```
// function g() {}
// module.exports.g = g
// ```
// In such a situation, we have a local variable named `g`, and a separate exported variable named `g`.
// Naively, we would emit
// ```
// function g() {}
// export const g: typeof g;
// ```
// That's obviously incorrect - the `g` in the type annotation needs to refer to the local `g`, but
// the export declaration shadows it.
// To work around that, we instead write
// ```
// function g() {}
// const g_1: typeof g;
// export { g_1 as g };
// ```
// To create an export named `g` that does _not_ shadow the local `g`
addResult(ts.factory.createExportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, ts.factory.createNamedExports([ts.factory.createExportSpecifier(name, localName)])), 0 /* None */);
needsExportDeclaration = false;
needsPostExportDefault = false;
}
}
}
}
}
if (symbol.flags & 384 /* Enum */) {
serializeEnum(symbol, symbolName, modifierFlags);
}
if (symbol.flags & 32 /* Class */) {
if (symbol.flags & 4 /* Property */
&& symbol.valueDeclaration
&& ts.isBinaryExpression(symbol.valueDeclaration.parent)
&& ts.isClassExpression(symbol.valueDeclaration.parent.right)) {
// Looks like a `module.exports.Sub = class {}` - if we serialize `symbol` as a class, the result will have no members,
// since the classiness is actually from the target of the effective alias the symbol is. yes. A BlockScopedVariable|Class|Property
// _really_ acts like an Alias, and none of a BlockScopedVariable, Class, or Property. This is the travesty of JS binding today.
serializeAsAlias(symbol, getInternalSymbolName(symbol, symbolName), modifierFlags);
}
else {
serializeAsClass(symbol, getInternalSymbolName(symbol, symbolName), modifierFlags);
}
}
if ((symbol.flags & (512 /* ValueModule */ | 1024 /* NamespaceModule */) && (!isConstMergedWithNS || isTypeOnlyNamespace(symbol))) || isConstMergedWithNSPrintableAsSignatureMerge) {
serializeModule(symbol, symbolName, modifierFlags);
}
// The class meaning serialization should handle serializing all interface members
if (symbol.flags & 64 /* Interface */ && !(symbol.flags & 32 /* Class */)) {
serializeInterface(symbol, symbolName, modifierFlags);
}
if (symbol.flags & 2097152 /* Alias */) {
serializeAsAlias(symbol, getInternalSymbolName(symbol, symbolName), modifierFlags);
}
if (symbol.flags & 4 /* Property */ && symbol.escapedName === "export=" /* ExportEquals */) {
serializeMaybeAliasAssignment(symbol);
}
if (symbol.flags & 8388608 /* ExportStar */) {
// synthesize export * from "moduleReference"
// Straightforward - only one thing to do - make an export declaration
if (symbol.declarations) {
for (var _i = 0, _c = symbol.declarations; _i < _c.length; _i++) {
var node = _c[_i];
var resolvedModule = resolveExternalModuleName(node, node.moduleSpecifier);
if (!resolvedModule)
continue;
addResult(ts.factory.createExportDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*isTypeOnly*/ false, /*exportClause*/ undefined, ts.factory.createStringLiteral(getSpecifierForModuleSymbol(resolvedModule, context))), 0 /* None */);
}
}
}
if (needsPostExportDefault) {
addResult(ts.factory.createExportAssignment(/*decorators*/ undefined, /*modifiers*/ undefined, /*isExportAssignment*/ false, ts.factory.createIdentifier(getInternalSymbolName(symbol, symbolName))), 0 /* None */);
}
else if (needsExportDeclaration) {
addResult(ts.factory.createExportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, ts.factory.createNamedExports([ts.factory.createExportSpecifier(getInternalSymbolName(symbol, symbolName), symbolName)])), 0 /* None */);
}
}
function includePrivateSymbol(symbol) {
if (ts.some(symbol.declarations, ts.isParameterDeclaration))
return;
ts.Debug.assertIsDefined(deferredPrivatesStack[deferredPrivatesStack.length - 1]);
getUnusedName(ts.unescapeLeadingUnderscores(symbol.escapedName), symbol); // Call to cache unique name for symbol
// Blanket moving (import) aliases into the root private context should work, since imports are not valid within namespaces
// (so they must have been in the root to begin with if they were real imports) cjs `require` aliases (an upcoming feature)
// will throw a wrench in this, since those may have been nested, but we'll need to synthesize them in the outer scope
// anyway, as that's the only place the import they translate to is valid. In such a case, we might need to use a unique name
// for the moved import; which hopefully the above `getUnusedName` call should produce.
var isExternalImportAlias = !!(symbol.flags & 2097152 /* Alias */) && !ts.some(symbol.declarations, function (d) {
return !!ts.findAncestor(d, ts.isExportDeclaration) ||
ts.isNamespaceExport(d) ||
(ts.isImportEqualsDeclaration(d) && !ts.isExternalModuleReference(d.moduleReference));
});
deferredPrivatesStack[isExternalImportAlias ? 0 : (deferredPrivatesStack.length - 1)].set(getSymbolId(symbol), symbol);
}
function isExportingScope(enclosingDeclaration) {
return ((ts.isSourceFile(enclosingDeclaration) && (ts.isExternalOrCommonJsModule(enclosingDeclaration) || ts.isJsonSourceFile(enclosingDeclaration))) ||
(ts.isAmbientModule(enclosingDeclaration) && !ts.isGlobalScopeAugmentation(enclosingDeclaration)));
}
// Prepends a `declare` and/or `export` modifier if the context requires it, and then adds `node` to `result` and returns `node`
function addResult(node, additionalModifierFlags) {
if (ts.canHaveModifiers(node)) {
var newModifierFlags = 0 /* None */;
var enclosingDeclaration_1 = context.enclosingDeclaration &&
(ts.isJSDocTypeAlias(context.enclosingDeclaration) ? ts.getSourceFileOfNode(context.enclosingDeclaration) : context.enclosingDeclaration);
if (additionalModifierFlags & 1 /* Export */ &&
enclosingDeclaration_1 && (isExportingScope(enclosingDeclaration_1) || ts.isModuleDeclaration(enclosingDeclaration_1)) &&
canHaveExportModifier(node)) {
// Classes, namespaces, variables, functions, interfaces, and types should all be `export`ed in a module context if not private
newModifierFlags |= 1 /* Export */;
}
if (addingDeclare && !(newModifierFlags & 1 /* Export */) &&
(!enclosingDeclaration_1 || !(enclosingDeclaration_1.flags & 8388608 /* Ambient */)) &&
(ts.isEnumDeclaration(node) || ts.isVariableStatement(node) || ts.isFunctionDeclaration(node) || ts.isClassDeclaration(node) || ts.isModuleDeclaration(node))) {
// Classes, namespaces, variables, enums, and functions all need `declare` modifiers to be valid in a declaration file top-level scope
newModifierFlags |= 2 /* Ambient */;
}
if ((additionalModifierFlags & 512 /* Default */) && (ts.isClassDeclaration(node) || ts.isInterfaceDeclaration(node) || ts.isFunctionDeclaration(node))) {
newModifierFlags |= 512 /* Default */;
}
if (newModifierFlags) {
node = ts.factory.updateModifiers(node, newModifierFlags | ts.getEffectiveModifierFlags(node));
}
}
results.push(node);
}
function serializeTypeAlias(symbol, symbolName, modifierFlags) {
var _a;
var aliasType = getDeclaredTypeOfTypeAlias(symbol);
var typeParams = getSymbolLinks(symbol).typeParameters;
var typeParamDecls = ts.map(typeParams, function (p) { return typeParameterToDeclaration(p, context); });
var jsdocAliasDecl = (_a = symbol.declarations) === null || _a === void 0 ? void 0 : _a.find(ts.isJSDocTypeAlias);
var commentText = ts.getTextOfJSDocComment(jsdocAliasDecl ? jsdocAliasDecl.comment || jsdocAliasDecl.parent.comment : undefined);
var oldFlags = context.flags;
context.flags |= 8388608 /* InTypeAlias */;
var oldEnclosingDecl = context.enclosingDeclaration;
context.enclosingDeclaration = jsdocAliasDecl;
var typeNode = jsdocAliasDecl && jsdocAliasDecl.typeExpression
&& ts.isJSDocTypeExpression(jsdocAliasDecl.typeExpression)
&& serializeExistingTypeNode(context, jsdocAliasDecl.typeExpression.type, includePrivateSymbol, bundled)
|| typeToTypeNodeHelper(aliasType, context);
addResult(ts.setSyntheticLeadingComments(ts.factory.createTypeAliasDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, getInternalSymbolName(symbol, symbolName), typeParamDecls, typeNode), !commentText ? [] : [{ kind: 3 /* MultiLineCommentTrivia */, text: "*\n * " + commentText.replace(/\n/g, "\n * ") + "\n ", pos: -1, end: -1, hasTrailingNewLine: true }]), modifierFlags);
context.flags = oldFlags;
context.enclosingDeclaration = oldEnclosingDecl;
}
function serializeInterface(symbol, symbolName, modifierFlags) {
var interfaceType = getDeclaredTypeOfClassOrInterface(symbol);
var localParams = getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(symbol);
var typeParamDecls = ts.map(localParams, function (p) { return typeParameterToDeclaration(p, context); });
var baseTypes = getBaseTypes(interfaceType);
var baseType = ts.length(baseTypes) ? getIntersectionType(baseTypes) : undefined;
var members = ts.flatMap(getPropertiesOfType(interfaceType), function (p) { return serializePropertySymbolForInterface(p, baseType); });
var callSignatures = serializeSignatures(0 /* Call */, interfaceType, baseType, 172 /* CallSignature */);
var constructSignatures = serializeSignatures(1 /* Construct */, interfaceType, baseType, 173 /* ConstructSignature */);
var indexSignatures = serializeIndexSignatures(interfaceType, baseType);
var heritageClauses = !ts.length(baseTypes) ? undefined : [ts.factory.createHeritageClause(94 /* ExtendsKeyword */, ts.mapDefined(baseTypes, function (b) { return trySerializeAsTypeReference(b, 111551 /* Value */); }))];
addResult(ts.factory.createInterfaceDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, getInternalSymbolName(symbol, symbolName), typeParamDecls, heritageClauses, __spreadArray(__spreadArray(__spreadArray(__spreadArray([], indexSignatures, true), constructSignatures, true), callSignatures, true), members, true)), modifierFlags);
}
function getNamespaceMembersForSerialization(symbol) {
return !symbol.exports ? [] : ts.filter(ts.arrayFrom(symbol.exports.values()), isNamespaceMember);
}
function isTypeOnlyNamespace(symbol) {
return ts.every(getNamespaceMembersForSerialization(symbol), function (m) { return !(resolveSymbol(m).flags & 111551 /* Value */); });
}
function serializeModule(symbol, symbolName, modifierFlags) {
var members = getNamespaceMembersForSerialization(symbol);
// Split NS members up by declaration - members whose parent symbol is the ns symbol vs those whose is not (but were added in later via merging)
var locationMap = ts.arrayToMultiMap(members, function (m) { return m.parent && m.parent === symbol ? "real" : "merged"; });
var realMembers = locationMap.get("real") || ts.emptyArray;
var mergedMembers = locationMap.get("merged") || ts.emptyArray;
// TODO: `suppressNewPrivateContext` is questionable -we need to simply be emitting privates in whatever scope they were declared in, rather
// than whatever scope we traverse to them in. That's a bit of a complex rewrite, since we're not _actually_ tracking privates at all in advance,
// so we don't even have placeholders to fill in.
if (ts.length(realMembers)) {
var localName = getInternalSymbolName(symbol, symbolName);
serializeAsNamespaceDeclaration(realMembers, localName, modifierFlags, !!(symbol.flags & (16 /* Function */ | 67108864 /* Assignment */)));
}
if (ts.length(mergedMembers)) {
var containingFile_1 = ts.getSourceFileOfNode(context.enclosingDeclaration);
var localName = getInternalSymbolName(symbol, symbolName);
var nsBody = ts.factory.createModuleBlock([ts.factory.createExportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, ts.factory.createNamedExports(ts.mapDefined(ts.filter(mergedMembers, function (n) { return n.escapedName !== "export=" /* ExportEquals */; }), function (s) {
var _a, _b;
var name = ts.unescapeLeadingUnderscores(s.escapedName);
var localName = getInternalSymbolName(s, name);
var aliasDecl = s.declarations && getDeclarationOfAliasSymbol(s);
if (containingFile_1 && (aliasDecl ? containingFile_1 !== ts.getSourceFileOfNode(aliasDecl) : !ts.some(s.declarations, function (d) { return ts.getSourceFileOfNode(d) === containingFile_1; }))) {
(_b = (_a = context.tracker) === null || _a === void 0 ? void 0 : _a.reportNonlocalAugmentation) === null || _b === void 0 ? void 0 : _b.call(_a, containingFile_1, symbol, s);
return undefined;
}
var target = aliasDecl && getTargetOfAliasDeclaration(aliasDecl, /*dontRecursivelyResolve*/ true);
includePrivateSymbol(target || s);
var targetName = target ? getInternalSymbolName(target, ts.unescapeLeadingUnderscores(target.escapedName)) : localName;
return ts.factory.createExportSpecifier(name === targetName ? undefined : targetName, name);
})))]);
addResult(ts.factory.createModuleDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, ts.factory.createIdentifier(localName), nsBody, 16 /* Namespace */), 0 /* None */);
}
}
function serializeEnum(symbol, symbolName, modifierFlags) {
addResult(ts.factory.createEnumDeclaration(
/*decorators*/ undefined, ts.factory.createModifiersFromModifierFlags(isConstEnumSymbol(symbol) ? 2048 /* Const */ : 0), getInternalSymbolName(symbol, symbolName), ts.map(ts.filter(getPropertiesOfType(getTypeOfSymbol(symbol)), function (p) { return !!(p.flags & 8 /* EnumMember */); }), function (p) {
// TODO: Handle computed names
// I hate that to get the initialized value we need to walk back to the declarations here; but there's no
// other way to get the possible const value of an enum member that I'm aware of, as the value is cached
// _on the declaration_, not on the declaration's symbol...
var initializedValue = p.declarations && p.declarations[0] && ts.isEnumMember(p.declarations[0]) ? getConstantValue(p.declarations[0]) : undefined;
return ts.factory.createEnumMember(ts.unescapeLeadingUnderscores(p.escapedName), initializedValue === undefined ? undefined :
typeof initializedValue === "string" ? ts.factory.createStringLiteral(initializedValue) :
ts.factory.createNumericLiteral(initializedValue));
})), modifierFlags);
}
function serializeAsFunctionNamespaceMerge(type, symbol, localName, modifierFlags) {
var signatures = getSignaturesOfType(type, 0 /* Call */);
for (var _i = 0, signatures_2 = signatures; _i < signatures_2.length; _i++) {
var sig = signatures_2[_i];
// Each overload becomes a separate function declaration, in order
var decl = signatureToSignatureDeclarationHelper(sig, 254 /* FunctionDeclaration */, context, { name: ts.factory.createIdentifier(localName), privateSymbolVisitor: includePrivateSymbol, bundledImports: bundled });
addResult(ts.setTextRange(decl, getSignatureTextRangeLocation(sig)), modifierFlags);
}
// Module symbol emit will take care of module-y members, provided it has exports
if (!(symbol.flags & (512 /* ValueModule */ | 1024 /* NamespaceModule */) && !!symbol.exports && !!symbol.exports.size)) {
var props = ts.filter(getPropertiesOfType(type), isNamespaceMember);
serializeAsNamespaceDeclaration(props, localName, modifierFlags, /*suppressNewPrivateContext*/ true);
}
}
function getSignatureTextRangeLocation(signature) {
if (signature.declaration && signature.declaration.parent) {
if (ts.isBinaryExpression(signature.declaration.parent) && ts.getAssignmentDeclarationKind(signature.declaration.parent) === 5 /* Property */) {
return signature.declaration.parent;
}
// for expressions assigned to `var`s, use the `var` as the text range
if (ts.isVariableDeclaration(signature.declaration.parent) && signature.declaration.parent.parent) {
return signature.declaration.parent.parent;
}
}
return signature.declaration;
}
function serializeAsNamespaceDeclaration(props, localName, modifierFlags, suppressNewPrivateContext) {
if (ts.length(props)) {
var localVsRemoteMap = ts.arrayToMultiMap(props, function (p) {
return !ts.length(p.declarations) || ts.some(p.declarations, function (d) {
return ts.getSourceFileOfNode(d) === ts.getSourceFileOfNode(context.enclosingDeclaration);
}) ? "local" : "remote";
});
var localProps = localVsRemoteMap.get("local") || ts.emptyArray;
// handle remote props first - we need to make an `import` declaration that points at the module containing each remote
// prop in the outermost scope (TODO: a namespace within a namespace would need to be appropriately handled by this)
// Example:
// import Foo_1 = require("./exporter");
// export namespace ns {
// import Foo = Foo_1.Foo;
// export { Foo };
// export const c: number;
// }
// This is needed because in JS, statements like `const x = require("./f")` support both type and value lookup, even if they're
// normally just value lookup (so it functions kinda like an alias even when it's not an alias)
// _Usually_, we'll simply print the top-level as an alias instead of a `var` in such situations, however is is theoretically
// possible to encounter a situation where a type has members from both the current file and other files - in those situations,
// emit akin to the above would be needed.
// Add a namespace
// Create namespace as non-synthetic so it is usable as an enclosing declaration
var fakespace = ts.parseNodeFactory.createModuleDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, ts.factory.createIdentifier(localName), ts.factory.createModuleBlock([]), 16 /* Namespace */);
ts.setParent(fakespace, enclosingDeclaration);
fakespace.locals = ts.createSymbolTable(props);
fakespace.symbol = props[0].parent;
var oldResults = results;
results = [];
var oldAddingDeclare = addingDeclare;
addingDeclare = false;
var subcontext = __assign(__assign({}, context), { enclosingDeclaration: fakespace });
var oldContext = context;
context = subcontext;
// TODO: implement handling for the localVsRemoteMap.get("remote") - should be difficult to trigger (see comment above), as only interesting cross-file js merges should make this possible
visitSymbolTable(ts.createSymbolTable(localProps), suppressNewPrivateContext, /*propertyAsAlias*/ true);
context = oldContext;
addingDeclare = oldAddingDeclare;
var declarations = results;
results = oldResults;
// replace namespace with synthetic version
var defaultReplaced = ts.map(declarations, function (d) { return ts.isExportAssignment(d) && !d.isExportEquals && ts.isIdentifier(d.expression) ? ts.factory.createExportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, ts.factory.createNamedExports([ts.factory.createExportSpecifier(d.expression, ts.factory.createIdentifier("default" /* Default */))])) : d; });
var exportModifierStripped = ts.every(defaultReplaced, function (d) { return ts.hasSyntacticModifier(d, 1 /* Export */); }) ? ts.map(defaultReplaced, removeExportModifier) : defaultReplaced;
fakespace = ts.factory.updateModuleDeclaration(fakespace, fakespace.decorators, fakespace.modifiers, fakespace.name, ts.factory.createModuleBlock(exportModifierStripped));
addResult(fakespace, modifierFlags); // namespaces can never be default exported
}
}
function isNamespaceMember(p) {
return !!(p.flags & (788968 /* Type */ | 1920 /* Namespace */ | 2097152 /* Alias */)) ||
!(p.flags & 4194304 /* Prototype */ || p.escapedName === "prototype" || p.valueDeclaration && ts.isStatic(p.valueDeclaration) && ts.isClassLike(p.valueDeclaration.parent));
}
function sanitizeJSDocImplements(clauses) {
var result = ts.mapDefined(clauses, function (e) {
var _a;
var oldEnclosing = context.enclosingDeclaration;
context.enclosingDeclaration = e;
var expr = e.expression;
if (ts.isEntityNameExpression(expr)) {
if (ts.isIdentifier(expr) && ts.idText(expr) === "") {
return cleanup(/*result*/ undefined); // Empty heritage clause, should be an error, but prefer emitting no heritage clauses to reemitting the empty one
}
var introducesError = void 0;
(_a = trackExistingEntityName(expr, context, includePrivateSymbol), introducesError = _a.introducesError, expr = _a.node);
if (introducesError) {
return cleanup(/*result*/ undefined);
}
}
return cleanup(ts.factory.createExpressionWithTypeArguments(expr, ts.map(e.typeArguments, function (a) {
return serializeExistingTypeNode(context, a, includePrivateSymbol, bundled)
|| typeToTypeNodeHelper(getTypeFromTypeNode(a), context);
})));
function cleanup(result) {
context.enclosingDeclaration = oldEnclosing;
return result;
}
});
if (result.length === clauses.length) {
return result;
}
return undefined;
}
function serializeAsClass(symbol, localName, modifierFlags) {
var _a, _b;
var originalDecl = (_a = symbol.declarations) === null || _a === void 0 ? void 0 : _a.find(ts.isClassLike);
var oldEnclosing = context.enclosingDeclaration;
context.enclosingDeclaration = originalDecl || oldEnclosing;
var localParams = getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(symbol);
var typeParamDecls = ts.map(localParams, function (p) { return typeParameterToDeclaration(p, context); });
var classType = getDeclaredTypeOfClassOrInterface(symbol);
var baseTypes = getBaseTypes(classType);
var originalImplements = originalDecl && ts.getEffectiveImplementsTypeNodes(originalDecl);
var implementsExpressions = originalImplements && sanitizeJSDocImplements(originalImplements)
|| ts.mapDefined(getImplementsTypes(classType), serializeImplementedType);
var staticType = getTypeOfSymbol(symbol);
var isClass = !!((_b = staticType.symbol) === null || _b === void 0 ? void 0 : _b.valueDeclaration) && ts.isClassLike(staticType.symbol.valueDeclaration);
var staticBaseType = isClass
? getBaseConstructorTypeOfClass(staticType)
: anyType;
var heritageClauses = __spreadArray(__spreadArray([], !ts.length(baseTypes) ? [] : [ts.factory.createHeritageClause(94 /* ExtendsKeyword */, ts.map(baseTypes, function (b) { return serializeBaseType(b, staticBaseType, localName); }))], true), !ts.length(implementsExpressions) ? [] : [ts.factory.createHeritageClause(117 /* ImplementsKeyword */, implementsExpressions)], true);
var symbolProps = getNonInterhitedProperties(classType, baseTypes, getPropertiesOfType(classType));
var publicSymbolProps = ts.filter(symbolProps, function (s) {
// `valueDeclaration` could be undefined if inherited from
// a union/intersection base type, but inherited properties
// don't matter here.
var valueDecl = s.valueDeclaration;
return !!valueDecl && !(ts.isNamedDeclaration(valueDecl) && ts.isPrivateIdentifier(valueDecl.name));
});
var hasPrivateIdentifier = ts.some(symbolProps, function (s) {
// `valueDeclaration` could be undefined if inherited from
// a union/intersection base type, but inherited properties
// don't matter here.
var valueDecl = s.valueDeclaration;
return !!valueDecl && ts.isNamedDeclaration(valueDecl) && ts.isPrivateIdentifier(valueDecl.name);
});
// Boil down all private properties into a single one.
var privateProperties = hasPrivateIdentifier ?
[ts.factory.createPropertyDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, ts.factory.createPrivateIdentifier("#private"),
/*questionOrExclamationToken*/ undefined,
/*type*/ undefined,
/*initializer*/ undefined)] :
ts.emptyArray;
var publicProperties = ts.flatMap(publicSymbolProps, function (p) { return serializePropertySymbolForClass(p, /*isStatic*/ false, baseTypes[0]); });
// Consider static members empty if symbol also has function or module meaning - function namespacey emit will handle statics
var staticMembers = ts.flatMap(ts.filter(getPropertiesOfType(staticType), function (p) { return !(p.flags & 4194304 /* Prototype */) && p.escapedName !== "prototype" && !isNamespaceMember(p); }), function (p) { return serializePropertySymbolForClass(p, /*isStatic*/ true, staticBaseType); });
// When we encounter an `X.prototype.y` assignment in a JS file, we bind `X` as a class regardless as to whether
// the value is ever initialized with a class or function-like value. For cases where `X` could never be
// created via `new`, we will inject a `private constructor()` declaration to indicate it is not createable.
var isNonConstructableClassLikeInJsFile = !isClass &&
!!symbol.valueDeclaration &&
ts.isInJSFile(symbol.valueDeclaration) &&
!ts.some(getSignaturesOfType(staticType, 1 /* Construct */));
var constructors = isNonConstructableClassLikeInJsFile ?
[ts.factory.createConstructorDeclaration(/*decorators*/ undefined, ts.factory.createModifiersFromModifierFlags(8 /* Private */), [], /*body*/ undefined)] :
serializeSignatures(1 /* Construct */, staticType, staticBaseType, 169 /* Constructor */);
var indexSignatures = serializeIndexSignatures(classType, baseTypes[0]);
context.enclosingDeclaration = oldEnclosing;
addResult(ts.setTextRange(ts.factory.createClassDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, localName, typeParamDecls, heritageClauses, __spreadArray(__spreadArray(__spreadArray(__spreadArray(__spreadArray([], indexSignatures, true), staticMembers, true), constructors, true), publicProperties, true), privateProperties, true)), symbol.declarations && ts.filter(symbol.declarations, function (d) { return ts.isClassDeclaration(d) || ts.isClassExpression(d); })[0]), modifierFlags);
}
function serializeAsAlias(symbol, localName, modifierFlags) {
var _a, _b, _c, _d, _e;
// synthesize an alias, eg `export { symbolName as Name }`
// need to mark the alias `symbol` points at
// as something we need to serialize as a private declaration as well
var node = getDeclarationOfAliasSymbol(symbol);
if (!node)
return ts.Debug.fail();
var target = getMergedSymbol(getTargetOfAliasDeclaration(node, /*dontRecursivelyResolve*/ true));
if (!target) {
return;
}
var verbatimTargetName = ts.unescapeLeadingUnderscores(target.escapedName);
if (verbatimTargetName === "export=" /* ExportEquals */ && (compilerOptions.esModuleInterop || compilerOptions.allowSyntheticDefaultImports)) {
// target refers to an `export=` symbol that was hoisted into a synthetic default - rename here to match
verbatimTargetName = "default" /* Default */;
}
var targetName = getInternalSymbolName(target, verbatimTargetName);
includePrivateSymbol(target); // the target may be within the same scope - attempt to serialize it first
switch (node.kind) {
case 201 /* BindingElement */:
if (((_b = (_a = node.parent) === null || _a === void 0 ? void 0 : _a.parent) === null || _b === void 0 ? void 0 : _b.kind) === 252 /* VariableDeclaration */) {
// const { SomeClass } = require('./lib');
var specifier_1 = getSpecifierForModuleSymbol(target.parent || target, context); // './lib'
var propertyName = node.propertyName;
addResult(ts.factory.createImportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, ts.factory.createImportClause(/*isTypeOnly*/ false, /*name*/ undefined, ts.factory.createNamedImports([ts.factory.createImportSpecifier(propertyName && ts.isIdentifier(propertyName) ? ts.factory.createIdentifier(ts.idText(propertyName)) : undefined, ts.factory.createIdentifier(localName))])), ts.factory.createStringLiteral(specifier_1)), 0 /* None */);
break;
}
// We don't know how to serialize this (nested?) binding element
ts.Debug.failBadSyntaxKind(((_c = node.parent) === null || _c === void 0 ? void 0 : _c.parent) || node, "Unhandled binding element grandparent kind in declaration serialization");
break;
case 292 /* ShorthandPropertyAssignment */:
if (((_e = (_d = node.parent) === null || _d === void 0 ? void 0 : _d.parent) === null || _e === void 0 ? void 0 : _e.kind) === 219 /* BinaryExpression */) {
// module.exports = { SomeClass }
serializeExportSpecifier(ts.unescapeLeadingUnderscores(symbol.escapedName), targetName);
}
break;
case 252 /* VariableDeclaration */:
// commonjs require: const x = require('y')
if (ts.isPropertyAccessExpression(node.initializer)) {
// const x = require('y').z
var initializer = node.initializer; // require('y').z
var uniqueName = ts.factory.createUniqueName(localName); // _x
var specifier_2 = getSpecifierForModuleSymbol(target.parent || target, context); // 'y'
// import _x = require('y');
addResult(ts.factory.createImportEqualsDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, uniqueName, ts.factory.createExternalModuleReference(ts.factory.createStringLiteral(specifier_2))), 0 /* None */);
// import x = _x.z
addResult(ts.factory.createImportEqualsDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, ts.factory.createIdentifier(localName), ts.factory.createQualifiedName(uniqueName, initializer.name)), modifierFlags);
break;
}
// else fall through and treat commonjs require just like import=
case 263 /* ImportEqualsDeclaration */:
// This _specifically_ only exists to handle json declarations - where we make aliases, but since
// we emit no declarations for the json document, must not refer to it in the declarations
if (target.escapedName === "export=" /* ExportEquals */ && ts.some(target.declarations, ts.isJsonSourceFile)) {
serializeMaybeAliasAssignment(symbol);
break;
}
// Could be a local `import localName = ns.member` or
// an external `import localName = require("whatever")`
var isLocalImport = !(target.flags & 512 /* ValueModule */) && !ts.isVariableDeclaration(node);
addResult(ts.factory.createImportEqualsDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, ts.factory.createIdentifier(localName), isLocalImport
? symbolToName(target, context, 67108863 /* All */, /*expectsIdentifier*/ false)
: ts.factory.createExternalModuleReference(ts.factory.createStringLiteral(getSpecifierForModuleSymbol(target, context)))), isLocalImport ? modifierFlags : 0 /* None */);
break;
case 262 /* NamespaceExportDeclaration */:
// export as namespace foo
// TODO: Not part of a file's local or export symbol tables
// Is bound into file.symbol.globalExports instead, which we don't currently traverse
addResult(ts.factory.createNamespaceExportDeclaration(ts.idText(node.name)), 0 /* None */);
break;
case 265 /* ImportClause */:
addResult(ts.factory.createImportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, ts.factory.createImportClause(/*isTypeOnly*/ false, ts.factory.createIdentifier(localName), /*namedBindings*/ undefined),
// We use `target.parent || target` below as `target.parent` is unset when the target is a module which has been export assigned
// And then made into a default by the `esModuleInterop` or `allowSyntheticDefaultImports` flag
// In such cases, the `target` refers to the module itself already
ts.factory.createStringLiteral(getSpecifierForModuleSymbol(target.parent || target, context))), 0 /* None */);
break;
case 266 /* NamespaceImport */:
addResult(ts.factory.createImportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, ts.factory.createImportClause(/*isTypeOnly*/ false, /*importClause*/ undefined, ts.factory.createNamespaceImport(ts.factory.createIdentifier(localName))), ts.factory.createStringLiteral(getSpecifierForModuleSymbol(target, context))), 0 /* None */);
break;
case 272 /* NamespaceExport */:
addResult(ts.factory.createExportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, ts.factory.createNamespaceExport(ts.factory.createIdentifier(localName)), ts.factory.createStringLiteral(getSpecifierForModuleSymbol(target, context))), 0 /* None */);
break;
case 268 /* ImportSpecifier */:
addResult(ts.factory.createImportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, ts.factory.createImportClause(
/*isTypeOnly*/ false,
/*importClause*/ undefined, ts.factory.createNamedImports([
ts.factory.createImportSpecifier(localName !== verbatimTargetName ? ts.factory.createIdentifier(verbatimTargetName) : undefined, ts.factory.createIdentifier(localName))
])), ts.factory.createStringLiteral(getSpecifierForModuleSymbol(target.parent || target, context))), 0 /* None */);
break;
case 273 /* ExportSpecifier */:
// does not use localName because the symbol name in this case refers to the name in the exports table,
// which we must exactly preserve
var specifier = node.parent.parent.moduleSpecifier;
// targetName is only used when the target is local, as otherwise the target is an alias that points at
// another file
serializeExportSpecifier(ts.unescapeLeadingUnderscores(symbol.escapedName), specifier ? verbatimTargetName : targetName, specifier && ts.isStringLiteralLike(specifier) ? ts.factory.createStringLiteral(specifier.text) : undefined);
break;
case 269 /* ExportAssignment */:
serializeMaybeAliasAssignment(symbol);
break;
case 219 /* BinaryExpression */:
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
// Could be best encoded as though an export specifier or as though an export assignment
// If name is default or export=, do an export assignment
// Otherwise do an export specifier
if (symbol.escapedName === "default" /* Default */ || symbol.escapedName === "export=" /* ExportEquals */) {
serializeMaybeAliasAssignment(symbol);
}
else {
serializeExportSpecifier(localName, targetName);
}
break;
default:
return ts.Debug.failBadSyntaxKind(node, "Unhandled alias declaration kind in symbol serializer!");
}
}
function serializeExportSpecifier(localName, targetName, specifier) {
addResult(ts.factory.createExportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, ts.factory.createNamedExports([ts.factory.createExportSpecifier(localName !== targetName ? targetName : undefined, localName)]), specifier), 0 /* None */);
}
/**
* Returns `true` if an export assignment or declaration was produced for the symbol
*/
function serializeMaybeAliasAssignment(symbol) {
if (symbol.flags & 4194304 /* Prototype */) {
return false;
}
var name = ts.unescapeLeadingUnderscores(symbol.escapedName);
var isExportEquals = name === "export=" /* ExportEquals */;
var isDefault = name === "default" /* Default */;
var isExportAssignmentCompatibleSymbolName = isExportEquals || isDefault;
// synthesize export = ref
// ref should refer to either be a locally scoped symbol which we need to emit, or
// a reference to another namespace/module which we may need to emit an `import` statement for
var aliasDecl = symbol.declarations && getDeclarationOfAliasSymbol(symbol);
// serialize what the alias points to, preserve the declaration's initializer
var target = aliasDecl && getTargetOfAliasDeclaration(aliasDecl, /*dontRecursivelyResolve*/ true);
// If the target resolves and resolves to a thing defined in this file, emit as an alias, otherwise emit as a const
if (target && ts.length(target.declarations) && ts.some(target.declarations, function (d) { return ts.getSourceFileOfNode(d) === ts.getSourceFileOfNode(enclosingDeclaration); })) {
// In case `target` refers to a namespace member, look at the declaration and serialize the leftmost symbol in it
// eg, `namespace A { export class B {} }; exports = A.B;`
// Technically, this is all that's required in the case where the assignment is an entity name expression
var expr = aliasDecl && ((ts.isExportAssignment(aliasDecl) || ts.isBinaryExpression(aliasDecl)) ? ts.getExportAssignmentExpression(aliasDecl) : ts.getPropertyAssignmentAliasLikeExpression(aliasDecl));
var first_1 = expr && ts.isEntityNameExpression(expr) ? getFirstNonModuleExportsIdentifier(expr) : undefined;
var referenced = first_1 && resolveEntityName(first_1, 67108863 /* All */, /*ignoreErrors*/ true, /*dontResolveAlias*/ true, enclosingDeclaration);
if (referenced || target) {
includePrivateSymbol(referenced || target);
}
// We disable the context's symbol tracker for the duration of this name serialization
// as, by virtue of being here, the name is required to print something, and we don't want to
// issue a visibility error on it. Only anonymous classes that an alias points at _would_ issue
// a visibility error here (as they're not visible within any scope), but we want to hoist them
// into the containing scope anyway, so we want to skip the visibility checks.
var oldTrack = context.tracker.trackSymbol;
context.tracker.trackSymbol = function () { return false; };
if (isExportAssignmentCompatibleSymbolName) {
results.push(ts.factory.createExportAssignment(
/*decorators*/ undefined,
/*modifiers*/ undefined, isExportEquals, symbolToExpression(target, context, 67108863 /* All */)));
}
else {
if (first_1 === expr && first_1) {
// serialize as `export {target as name}`
serializeExportSpecifier(name, ts.idText(first_1));
}
else if (expr && ts.isClassExpression(expr)) {
serializeExportSpecifier(name, getInternalSymbolName(target, ts.symbolName(target)));
}
else {
// serialize as `import _Ref = t.arg.et; export { _Ref as name }`
var varName = getUnusedName(name, symbol);
addResult(ts.factory.createImportEqualsDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, ts.factory.createIdentifier(varName), symbolToName(target, context, 67108863 /* All */, /*expectsIdentifier*/ false)), 0 /* None */);
serializeExportSpecifier(name, varName);
}
}
context.tracker.trackSymbol = oldTrack;
return true;
}
else {
// serialize as an anonymous property declaration
var varName = getUnusedName(name, symbol);
// We have to use `getWidenedType` here since the object within a json file is unwidened within the file
// (Unwidened types can only exist in expression contexts and should never be serialized)
var typeToSerialize = getWidenedType(getTypeOfSymbol(getMergedSymbol(symbol)));
if (isTypeRepresentableAsFunctionNamespaceMerge(typeToSerialize, symbol)) {
// If there are no index signatures and `typeToSerialize` is an object type, emit as a namespace instead of a const
serializeAsFunctionNamespaceMerge(typeToSerialize, symbol, varName, isExportAssignmentCompatibleSymbolName ? 0 /* None */ : 1 /* Export */);
}
else {
var statement = ts.factory.createVariableStatement(/*modifiers*/ undefined, ts.factory.createVariableDeclarationList([
ts.factory.createVariableDeclaration(varName, /*exclamationToken*/ undefined, serializeTypeForDeclaration(context, typeToSerialize, symbol, enclosingDeclaration, includePrivateSymbol, bundled))
], 2 /* Const */));
// Inlined JSON types exported with [module.]exports= will already emit an export=, so should use `declare`.
// Otherwise, the type itself should be exported.
addResult(statement, target && target.flags & 4 /* Property */ && target.escapedName === "export=" /* ExportEquals */ ? 2 /* Ambient */
: name === varName ? 1 /* Export */
: 0 /* None */);
}
if (isExportAssignmentCompatibleSymbolName) {
results.push(ts.factory.createExportAssignment(
/*decorators*/ undefined,
/*modifiers*/ undefined, isExportEquals, ts.factory.createIdentifier(varName)));
return true;
}
else if (name !== varName) {
serializeExportSpecifier(name, varName);
return true;
}
return false;
}
}
function isTypeRepresentableAsFunctionNamespaceMerge(typeToSerialize, hostSymbol) {
// Only object types which are not constructable, or indexable, whose members all come from the
// context source file, and whose property names are all valid identifiers and not late-bound, _and_
// whose input is not type annotated (if the input symbol has an annotation we can reuse, we should prefer it)
var ctxSrc = ts.getSourceFileOfNode(context.enclosingDeclaration);
return ts.getObjectFlags(typeToSerialize) & (16 /* Anonymous */ | 32 /* Mapped */) &&
!ts.length(getIndexInfosOfType(typeToSerialize)) &&
!isClassInstanceSide(typeToSerialize) && // While a class instance is potentially representable as a NS, prefer printing a reference to the instance type and serializing the class
!!(ts.length(ts.filter(getPropertiesOfType(typeToSerialize), isNamespaceMember)) || ts.length(getSignaturesOfType(typeToSerialize, 0 /* Call */))) &&
!ts.length(getSignaturesOfType(typeToSerialize, 1 /* Construct */)) && // TODO: could probably serialize as function + ns + class, now that that's OK
!getDeclarationWithTypeAnnotation(hostSymbol, enclosingDeclaration) &&
!(typeToSerialize.symbol && ts.some(typeToSerialize.symbol.declarations, function (d) { return ts.getSourceFileOfNode(d) !== ctxSrc; })) &&
!ts.some(getPropertiesOfType(typeToSerialize), function (p) { return isLateBoundName(p.escapedName); }) &&
!ts.some(getPropertiesOfType(typeToSerialize), function (p) { return ts.some(p.declarations, function (d) { return ts.getSourceFileOfNode(d) !== ctxSrc; }); }) &&
ts.every(getPropertiesOfType(typeToSerialize), function (p) { return ts.isIdentifierText(ts.symbolName(p), languageVersion); });
}
function makeSerializePropertySymbol(createProperty, methodKind, useAccessors) {
return function serializePropertySymbol(p, isStatic, baseType) {
var _a, _b, _c, _d, _e;
var modifierFlags = ts.getDeclarationModifierFlagsFromSymbol(p);
var isPrivate = !!(modifierFlags & 8 /* Private */);
if (isStatic && (p.flags & (788968 /* Type */ | 1920 /* Namespace */ | 2097152 /* Alias */))) {
// Only value-only-meaning symbols can be correctly encoded as class statics, type/namespace/alias meaning symbols
// need to be merged namespace members
return [];
}
if (p.flags & 4194304 /* Prototype */ ||
(baseType && getPropertyOfType(baseType, p.escapedName)
&& isReadonlySymbol(getPropertyOfType(baseType, p.escapedName)) === isReadonlySymbol(p)
&& (p.flags & 16777216 /* Optional */) === (getPropertyOfType(baseType, p.escapedName).flags & 16777216 /* Optional */)
&& isTypeIdenticalTo(getTypeOfSymbol(p), getTypeOfPropertyOfType(baseType, p.escapedName)))) {
return [];
}
var flag = (modifierFlags & ~256 /* Async */) | (isStatic ? 32 /* Static */ : 0);
var name = getPropertyNameNodeForSymbol(p, context);
var firstPropertyLikeDecl = (_a = p.declarations) === null || _a === void 0 ? void 0 : _a.find(ts.or(ts.isPropertyDeclaration, ts.isAccessor, ts.isVariableDeclaration, ts.isPropertySignature, ts.isBinaryExpression, ts.isPropertyAccessExpression));
if (p.flags & 98304 /* Accessor */ && useAccessors) {
var result = [];
if (p.flags & 65536 /* SetAccessor */) {
result.push(ts.setTextRange(ts.factory.createSetAccessorDeclaration(
/*decorators*/ undefined, ts.factory.createModifiersFromModifierFlags(flag), name, [ts.factory.createParameterDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*dotDotDotToken*/ undefined, "arg",
/*questionToken*/ undefined, isPrivate ? undefined : serializeTypeForDeclaration(context, getTypeOfSymbol(p), p, enclosingDeclaration, includePrivateSymbol, bundled))],
/*body*/ undefined), ((_b = p.declarations) === null || _b === void 0 ? void 0 : _b.find(ts.isSetAccessor)) || firstPropertyLikeDecl));
}
if (p.flags & 32768 /* GetAccessor */) {
var isPrivate_1 = modifierFlags & 8 /* Private */;
result.push(ts.setTextRange(ts.factory.createGetAccessorDeclaration(
/*decorators*/ undefined, ts.factory.createModifiersFromModifierFlags(flag), name, [], isPrivate_1 ? undefined : serializeTypeForDeclaration(context, getTypeOfSymbol(p), p, enclosingDeclaration, includePrivateSymbol, bundled),
/*body*/ undefined), ((_c = p.declarations) === null || _c === void 0 ? void 0 : _c.find(ts.isGetAccessor)) || firstPropertyLikeDecl));
}
return result;
}
// This is an else/if as accessors and properties can't merge in TS, but might in JS
// If this happens, we assume the accessor takes priority, as it imposes more constraints
else if (p.flags & (4 /* Property */ | 3 /* Variable */ | 98304 /* Accessor */)) {
return ts.setTextRange(createProperty(
/*decorators*/ undefined, ts.factory.createModifiersFromModifierFlags((isReadonlySymbol(p) ? 64 /* Readonly */ : 0) | flag), name, p.flags & 16777216 /* Optional */ ? ts.factory.createToken(57 /* QuestionToken */) : undefined, isPrivate ? undefined : serializeTypeForDeclaration(context, getTypeOfSymbol(p), p, enclosingDeclaration, includePrivateSymbol, bundled),
// TODO: https://github.com/microsoft/TypeScript/pull/32372#discussion_r328386357
// interface members can't have initializers, however class members _can_
/*initializer*/ undefined), ((_d = p.declarations) === null || _d === void 0 ? void 0 : _d.find(ts.or(ts.isPropertyDeclaration, ts.isVariableDeclaration))) || firstPropertyLikeDecl);
}
if (p.flags & (8192 /* Method */ | 16 /* Function */)) {
var type = getTypeOfSymbol(p);
var signatures = getSignaturesOfType(type, 0 /* Call */);
if (flag & 8 /* Private */) {
return ts.setTextRange(createProperty(
/*decorators*/ undefined, ts.factory.createModifiersFromModifierFlags((isReadonlySymbol(p) ? 64 /* Readonly */ : 0) | flag), name, p.flags & 16777216 /* Optional */ ? ts.factory.createToken(57 /* QuestionToken */) : undefined,
/*type*/ undefined,
/*initializer*/ undefined), ((_e = p.declarations) === null || _e === void 0 ? void 0 : _e.find(ts.isFunctionLikeDeclaration)) || signatures[0] && signatures[0].declaration || p.declarations && p.declarations[0]);
}
var results_1 = [];
for (var _i = 0, signatures_3 = signatures; _i < signatures_3.length; _i++) {
var sig = signatures_3[_i];
// Each overload becomes a separate method declaration, in order
var decl = signatureToSignatureDeclarationHelper(sig, methodKind, context, {
name: name,
questionToken: p.flags & 16777216 /* Optional */ ? ts.factory.createToken(57 /* QuestionToken */) : undefined,
modifiers: flag ? ts.factory.createModifiersFromModifierFlags(flag) : undefined
});
var location = sig.declaration && ts.isPrototypePropertyAssignment(sig.declaration.parent) ? sig.declaration.parent : sig.declaration;
results_1.push(ts.setTextRange(decl, location));
}
return results_1;
}
// The `Constructor`'s symbol isn't in the class's properties lists, obviously, since it's a signature on the static
return ts.Debug.fail("Unhandled class member kind! " + (p.__debugFlags || p.flags));
};
}
function serializePropertySymbolForInterface(p, baseType) {
return serializePropertySymbolForInterfaceWorker(p, /*isStatic*/ false, baseType);
}
function serializeSignatures(kind, input, baseType, outputKind) {
var signatures = getSignaturesOfType(input, kind);
if (kind === 1 /* Construct */) {
if (!baseType && ts.every(signatures, function (s) { return ts.length(s.parameters) === 0; })) {
return []; // No base type, every constructor is empty - elide the extraneous `constructor()`
}
if (baseType) {
// If there is a base type, if every signature in the class is identical to a signature in the baseType, elide all the declarations
var baseSigs = getSignaturesOfType(baseType, 1 /* Construct */);
if (!ts.length(baseSigs) && ts.every(signatures, function (s) { return ts.length(s.parameters) === 0; })) {
return []; // Base had no explicit signatures, if all our signatures are also implicit, return an empty list
}
if (baseSigs.length === signatures.length) {
var failed = false;
for (var i = 0; i < baseSigs.length; i++) {
if (!compareSignaturesIdentical(signatures[i], baseSigs[i], /*partialMatch*/ false, /*ignoreThisTypes*/ false, /*ignoreReturnTypes*/ true, compareTypesIdentical)) {
failed = true;
break;
}
}
if (!failed) {
return []; // Every signature was identical - elide constructor list as it is inherited
}
}
}
var privateProtected = 0;
for (var _i = 0, signatures_4 = signatures; _i < signatures_4.length; _i++) {
var s = signatures_4[_i];
if (s.declaration) {
privateProtected |= ts.getSelectedEffectiveModifierFlags(s.declaration, 8 /* Private */ | 16 /* Protected */);
}
}
if (privateProtected) {
return [ts.setTextRange(ts.factory.createConstructorDeclaration(
/*decorators*/ undefined, ts.factory.createModifiersFromModifierFlags(privateProtected),
/*parameters*/ [],
/*body*/ undefined), signatures[0].declaration)];
}
}
var results = [];
for (var _a = 0, signatures_5 = signatures; _a < signatures_5.length; _a++) {
var sig = signatures_5[_a];
// Each overload becomes a separate constructor declaration, in order
var decl = signatureToSignatureDeclarationHelper(sig, outputKind, context);
results.push(ts.setTextRange(decl, sig.declaration));
}
return results;
}
function serializeIndexSignatures(input, baseType) {
var results = [];
for (var _i = 0, _a = getIndexInfosOfType(input); _i < _a.length; _i++) {
var info = _a[_i];
if (baseType) {
var baseInfo = getIndexInfoOfType(baseType, info.keyType);
if (baseInfo) {
if (isTypeIdenticalTo(info.type, baseInfo.type)) {
continue; // elide identical index signatures
}
}
}
results.push(indexInfoToIndexSignatureDeclarationHelper(info, context, /*typeNode*/ undefined));
}
return results;
}
function serializeBaseType(t, staticType, rootName) {
var ref = trySerializeAsTypeReference(t, 111551 /* Value */);
if (ref) {
return ref;
}
var tempName = getUnusedName(rootName + "_base");
var statement = ts.factory.createVariableStatement(/*modifiers*/ undefined, ts.factory.createVariableDeclarationList([
ts.factory.createVariableDeclaration(tempName, /*exclamationToken*/ undefined, typeToTypeNodeHelper(staticType, context))
], 2 /* Const */));
addResult(statement, 0 /* None */);
return ts.factory.createExpressionWithTypeArguments(ts.factory.createIdentifier(tempName), /*typeArgs*/ undefined);
}
function trySerializeAsTypeReference(t, flags) {
var typeArgs;
var reference;
// We don't use `isValueSymbolAccessible` below. since that considers alternative containers (like modules)
// which we can't write out in a syntactically valid way as an expression
if (t.target && isSymbolAccessibleByFlags(t.target.symbol, enclosingDeclaration, flags)) {
typeArgs = ts.map(getTypeArguments(t), function (t) { return typeToTypeNodeHelper(t, context); });
reference = symbolToExpression(t.target.symbol, context, 788968 /* Type */);
}
else if (t.symbol && isSymbolAccessibleByFlags(t.symbol, enclosingDeclaration, flags)) {
reference = symbolToExpression(t.symbol, context, 788968 /* Type */);
}
if (reference) {
return ts.factory.createExpressionWithTypeArguments(reference, typeArgs);
}
}
function serializeImplementedType(t) {
var ref = trySerializeAsTypeReference(t, 788968 /* Type */);
if (ref) {
return ref;
}
if (t.symbol) {
return ts.factory.createExpressionWithTypeArguments(symbolToExpression(t.symbol, context, 788968 /* Type */), /*typeArgs*/ undefined);
}
}
function getUnusedName(input, symbol) {
var _a, _b;
var id = symbol ? getSymbolId(symbol) : undefined;
if (id) {
if (context.remappedSymbolNames.has(id)) {
return context.remappedSymbolNames.get(id);
}
}
if (symbol) {
input = getNameCandidateWorker(symbol, input);
}
var i = 0;
var original = input;
while ((_a = context.usedSymbolNames) === null || _a === void 0 ? void 0 : _a.has(input)) {
i++;
input = original + "_" + i;
}
(_b = context.usedSymbolNames) === null || _b === void 0 ? void 0 : _b.add(input);
if (id) {
context.remappedSymbolNames.set(id, input);
}
return input;
}
function getNameCandidateWorker(symbol, localName) {
if (localName === "default" /* Default */ || localName === "__class" /* Class */ || localName === "__function" /* Function */) {
var flags = context.flags;
context.flags |= 16777216 /* InInitialEntityName */;
var nameCandidate = getNameOfSymbolAsWritten(symbol, context);
context.flags = flags;
localName = nameCandidate.length > 0 && ts.isSingleOrDoubleQuote(nameCandidate.charCodeAt(0)) ? ts.stripQuotes(nameCandidate) : nameCandidate;
}
if (localName === "default" /* Default */) {
localName = "_default";
}
else if (localName === "export=" /* ExportEquals */) {
localName = "_exports";
}
localName = ts.isIdentifierText(localName, languageVersion) && !ts.isStringANonContextualKeyword(localName) ? localName : "_" + localName.replace(/[^a-zA-Z0-9]/g, "_");
return localName;
}
function getInternalSymbolName(symbol, localName) {
var id = getSymbolId(symbol);
if (context.remappedSymbolNames.has(id)) {
return context.remappedSymbolNames.get(id);
}
localName = getNameCandidateWorker(symbol, localName);
// The result of this is going to be used as the symbol's name - lock it in, so `getUnusedName` will also pick it up
context.remappedSymbolNames.set(id, localName);
return localName;
}
}
}
function typePredicateToString(typePredicate, enclosingDeclaration, flags, writer) {
if (flags === void 0) { flags = 16384 /* UseAliasDefinedOutsideCurrentScope */; }
return writer ? typePredicateToStringWorker(writer).getText() : ts.usingSingleLineStringWriter(typePredicateToStringWorker);
function typePredicateToStringWorker(writer) {
var predicate = ts.factory.createTypePredicateNode(typePredicate.kind === 2 /* AssertsThis */ || typePredicate.kind === 3 /* AssertsIdentifier */ ? ts.factory.createToken(128 /* AssertsKeyword */) : undefined, typePredicate.kind === 1 /* Identifier */ || typePredicate.kind === 3 /* AssertsIdentifier */ ? ts.factory.createIdentifier(typePredicate.parameterName) : ts.factory.createThisTypeNode(), typePredicate.type && nodeBuilder.typeToTypeNode(typePredicate.type, enclosingDeclaration, toNodeBuilderFlags(flags) | 70221824 /* IgnoreErrors */ | 512 /* WriteTypeParametersInQualifiedName */) // TODO: GH#18217
);
var printer = ts.createPrinter({ removeComments: true });
var sourceFile = enclosingDeclaration && ts.getSourceFileOfNode(enclosingDeclaration);
printer.writeNode(4 /* Unspecified */, predicate, /*sourceFile*/ sourceFile, writer);
return writer;
}
}
function formatUnionTypes(types) {
var result = [];
var flags = 0;
for (var i = 0; i < types.length; i++) {
var t = types[i];
flags |= t.flags;
if (!(t.flags & 98304 /* Nullable */)) {
if (t.flags & (512 /* BooleanLiteral */ | 1024 /* EnumLiteral */)) {
var baseType = t.flags & 512 /* BooleanLiteral */ ? booleanType : getBaseTypeOfEnumLiteralType(t);
if (baseType.flags & 1048576 /* Union */) {
var count = baseType.types.length;
if (i + count <= types.length && getRegularTypeOfLiteralType(types[i + count - 1]) === getRegularTypeOfLiteralType(baseType.types[count - 1])) {
result.push(baseType);
i += count - 1;
continue;
}
}
}
result.push(t);
}
}
if (flags & 65536 /* Null */)
result.push(nullType);
if (flags & 32768 /* Undefined */)
result.push(undefinedType);
return result || types;
}
function visibilityToString(flags) {
if (flags === 8 /* Private */) {
return "private";
}
if (flags === 16 /* Protected */) {
return "protected";
}
return "public";
}
function getTypeAliasForTypeLiteral(type) {
if (type.symbol && type.symbol.flags & 2048 /* TypeLiteral */ && type.symbol.declarations) {
var node = ts.walkUpParenthesizedTypes(type.symbol.declarations[0].parent);
if (node.kind === 257 /* TypeAliasDeclaration */) {
return getSymbolOfNode(node);
}
}
return undefined;
}
function isTopLevelInExternalModuleAugmentation(node) {
return node && node.parent &&
node.parent.kind === 260 /* ModuleBlock */ &&
ts.isExternalModuleAugmentation(node.parent.parent);
}
function isDefaultBindingContext(location) {
return location.kind === 300 /* SourceFile */ || ts.isAmbientModule(location);
}
function getNameOfSymbolFromNameType(symbol, context) {
var nameType = getSymbolLinks(symbol).nameType;
if (nameType) {
if (nameType.flags & 384 /* StringOrNumberLiteral */) {
var name = "" + nameType.value;
if (!ts.isIdentifierText(name, compilerOptions.target) && !isNumericLiteralName(name)) {
return "\"" + ts.escapeString(name, 34 /* doubleQuote */) + "\"";
}
if (isNumericLiteralName(name) && ts.startsWith(name, "-")) {
return "[" + name + "]";
}
return name;
}
if (nameType.flags & 8192 /* UniqueESSymbol */) {
return "[" + getNameOfSymbolAsWritten(nameType.symbol, context) + "]";
}
}
}
/**
* Gets a human-readable name for a symbol.
* Should *not* be used for the right-hand side of a `.` -- use `symbolName(symbol)` for that instead.
*
* Unlike `symbolName(symbol)`, this will include quotes if the name is from a string literal.
* It will also use a representation of a number as written instead of a decimal form, e.g. `0o11` instead of `9`.
*/
function getNameOfSymbolAsWritten(symbol, context) {
if (context && symbol.escapedName === "default" /* Default */ && !(context.flags & 16384 /* UseAliasDefinedOutsideCurrentScope */) &&
// If it's not the first part of an entity name, it must print as `default`
(!(context.flags & 16777216 /* InInitialEntityName */) ||
// if the symbol is synthesized, it will only be referenced externally it must print as `default`
!symbol.declarations ||
// if not in the same binding context (source file, module declaration), it must print as `default`
(context.enclosingDeclaration && ts.findAncestor(symbol.declarations[0], isDefaultBindingContext) !== ts.findAncestor(context.enclosingDeclaration, isDefaultBindingContext)))) {
return "default";
}
if (symbol.declarations && symbol.declarations.length) {
var declaration = ts.firstDefined(symbol.declarations, function (d) { return ts.getNameOfDeclaration(d) ? d : undefined; }); // Try using a declaration with a name, first
var name_3 = declaration && ts.getNameOfDeclaration(declaration);
if (declaration && name_3) {
if (ts.isCallExpression(declaration) && ts.isBindableObjectDefinePropertyCall(declaration)) {
return ts.symbolName(symbol);
}
if (ts.isComputedPropertyName(name_3) && !(ts.getCheckFlags(symbol) & 4096 /* Late */)) {
var nameType = getSymbolLinks(symbol).nameType;
if (nameType && nameType.flags & 384 /* StringOrNumberLiteral */) {
// Computed property name isn't late bound, but has a well-known name type - use name type to generate a symbol name
var result = getNameOfSymbolFromNameType(symbol, context);
if (result !== undefined) {
return result;
}
}
}
return ts.declarationNameToString(name_3);
}
if (!declaration) {
declaration = symbol.declarations[0]; // Declaration may be nameless, but we'll try anyway
}
if (declaration.parent && declaration.parent.kind === 252 /* VariableDeclaration */) {
return ts.declarationNameToString(declaration.parent.name);
}
switch (declaration.kind) {
case 224 /* ClassExpression */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
if (context && !context.encounteredError && !(context.flags & 131072 /* AllowAnonymousIdentifier */)) {
context.encounteredError = true;
}
return declaration.kind === 224 /* ClassExpression */ ? "(Anonymous class)" : "(Anonymous function)";
}
}
var name = getNameOfSymbolFromNameType(symbol, context);
return name !== undefined ? name : ts.symbolName(symbol);
}
function isDeclarationVisible(node) {
if (node) {
var links = getNodeLinks(node);
if (links.isVisible === undefined) {
links.isVisible = !!determineIfDeclarationIsVisible();
}
return links.isVisible;
}
return false;
function determineIfDeclarationIsVisible() {
switch (node.kind) {
case 333 /* JSDocCallbackTag */:
case 340 /* JSDocTypedefTag */:
case 334 /* JSDocEnumTag */:
// Top-level jsdoc type aliases are considered exported
// First parent is comment node, second is hosting declaration or token; we only care about those tokens or declarations whose parent is a source file
return !!(node.parent && node.parent.parent && node.parent.parent.parent && ts.isSourceFile(node.parent.parent.parent));
case 201 /* BindingElement */:
return isDeclarationVisible(node.parent.parent);
case 252 /* VariableDeclaration */:
if (ts.isBindingPattern(node.name) &&
!node.name.elements.length) {
// If the binding pattern is empty, this variable declaration is not visible
return false;
}
// falls through
case 259 /* ModuleDeclaration */:
case 255 /* ClassDeclaration */:
case 256 /* InterfaceDeclaration */:
case 257 /* TypeAliasDeclaration */:
case 254 /* FunctionDeclaration */:
case 258 /* EnumDeclaration */:
case 263 /* ImportEqualsDeclaration */:
// external module augmentation is always visible
if (ts.isExternalModuleAugmentation(node)) {
return true;
}
var parent = getDeclarationContainer(node);
// If the node is not exported or it is not ambient module element (except import declaration)
if (!(ts.getCombinedModifierFlags(node) & 1 /* Export */) &&
!(node.kind !== 263 /* ImportEqualsDeclaration */ && parent.kind !== 300 /* SourceFile */ && parent.flags & 8388608 /* Ambient */)) {
return isGlobalSourceFile(parent);
}
// Exported members/ambient module elements (exception import declaration) are visible if parent is visible
return isDeclarationVisible(parent);
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
if (ts.hasEffectiveModifier(node, 8 /* Private */ | 16 /* Protected */)) {
// Private/protected properties/methods are not visible
return false;
}
// Public properties/methods are visible if its parents are visible, so:
// falls through
case 169 /* Constructor */:
case 173 /* ConstructSignature */:
case 172 /* CallSignature */:
case 174 /* IndexSignature */:
case 162 /* Parameter */:
case 260 /* ModuleBlock */:
case 177 /* FunctionType */:
case 178 /* ConstructorType */:
case 180 /* TypeLiteral */:
case 176 /* TypeReference */:
case 181 /* ArrayType */:
case 182 /* TupleType */:
case 185 /* UnionType */:
case 186 /* IntersectionType */:
case 189 /* ParenthesizedType */:
case 195 /* NamedTupleMember */:
return isDeclarationVisible(node.parent);
// Default binding, import specifier and namespace import is visible
// only on demand so by default it is not visible
case 265 /* ImportClause */:
case 266 /* NamespaceImport */:
case 268 /* ImportSpecifier */:
return false;
// Type parameters are always visible
case 161 /* TypeParameter */:
// Source file and namespace export are always visible
// falls through
case 300 /* SourceFile */:
case 262 /* NamespaceExportDeclaration */:
return true;
// Export assignments do not create name bindings outside the module
case 269 /* ExportAssignment */:
return false;
default:
return false;
}
}
}
function collectLinkedAliases(node, setVisibility) {
var exportSymbol;
if (node.parent && node.parent.kind === 269 /* ExportAssignment */) {
exportSymbol = resolveName(node, node.escapedText, 111551 /* Value */ | 788968 /* Type */ | 1920 /* Namespace */ | 2097152 /* Alias */, /*nameNotFoundMessage*/ undefined, node, /*isUse*/ false);
}
else if (node.parent.kind === 273 /* ExportSpecifier */) {
exportSymbol = getTargetOfExportSpecifier(node.parent, 111551 /* Value */ | 788968 /* Type */ | 1920 /* Namespace */ | 2097152 /* Alias */);
}
var result;
var visited;
if (exportSymbol) {
visited = new ts.Set();
visited.add(getSymbolId(exportSymbol));
buildVisibleNodeList(exportSymbol.declarations);
}
return result;
function buildVisibleNodeList(declarations) {
ts.forEach(declarations, function (declaration) {
var resultNode = getAnyImportSyntax(declaration) || declaration;
if (setVisibility) {
getNodeLinks(declaration).isVisible = true;
}
else {
result = result || [];
ts.pushIfUnique(result, resultNode);
}
if (ts.isInternalModuleImportEqualsDeclaration(declaration)) {
// Add the referenced top container visible
var internalModuleReference = declaration.moduleReference;
var firstIdentifier = ts.getFirstIdentifier(internalModuleReference);
var importSymbol = resolveName(declaration, firstIdentifier.escapedText, 111551 /* Value */ | 788968 /* Type */ | 1920 /* Namespace */, undefined, undefined, /*isUse*/ false);
if (importSymbol && visited) {
if (ts.tryAddToSet(visited, getSymbolId(importSymbol))) {
buildVisibleNodeList(importSymbol.declarations);
}
}
}
});
}
}
/**
* Push an entry on the type resolution stack. If an entry with the given target and the given property name
* is already on the stack, and no entries in between already have a type, then a circularity has occurred.
* In this case, the result values of the existing entry and all entries pushed after it are changed to false,
* and the value false is returned. Otherwise, the new entry is just pushed onto the stack, and true is returned.
* In order to see if the same query has already been done before, the target object and the propertyName both
* must match the one passed in.
*
* @param target The symbol, type, or signature whose type is being queried
* @param propertyName The property name that should be used to query the target for its type
*/
function pushTypeResolution(target, propertyName) {
var resolutionCycleStartIndex = findResolutionCycleStartIndex(target, propertyName);
if (resolutionCycleStartIndex >= 0) {
// A cycle was found
var length_3 = resolutionTargets.length;
for (var i = resolutionCycleStartIndex; i < length_3; i++) {
resolutionResults[i] = false;
}
return false;
}
resolutionTargets.push(target);
resolutionResults.push(/*items*/ true);
resolutionPropertyNames.push(propertyName);
return true;
}
function findResolutionCycleStartIndex(target, propertyName) {
for (var i = resolutionTargets.length - 1; i >= 0; i--) {
if (hasType(resolutionTargets[i], resolutionPropertyNames[i])) {
return -1;
}
if (resolutionTargets[i] === target && resolutionPropertyNames[i] === propertyName) {
return i;
}
}
return -1;
}
function hasType(target, propertyName) {
switch (propertyName) {
case 0 /* Type */:
return !!getSymbolLinks(target).type;
case 5 /* EnumTagType */:
return !!(getNodeLinks(target).resolvedEnumType);
case 2 /* DeclaredType */:
return !!getSymbolLinks(target).declaredType;
case 1 /* ResolvedBaseConstructorType */:
return !!target.resolvedBaseConstructorType;
case 3 /* ResolvedReturnType */:
return !!target.resolvedReturnType;
case 4 /* ImmediateBaseConstraint */:
return !!target.immediateBaseConstraint;
case 6 /* ResolvedTypeArguments */:
return !!target.resolvedTypeArguments;
case 7 /* ResolvedBaseTypes */:
return !!target.baseTypesResolved;
}
return ts.Debug.assertNever(propertyName);
}
/**
* Pop an entry from the type resolution stack and return its associated result value. The result value will
* be true if no circularities were detected, or false if a circularity was found.
*/
function popTypeResolution() {
resolutionTargets.pop();
resolutionPropertyNames.pop();
return resolutionResults.pop();
}
function getDeclarationContainer(node) {
return ts.findAncestor(ts.getRootDeclaration(node), function (node) {
switch (node.kind) {
case 252 /* VariableDeclaration */:
case 253 /* VariableDeclarationList */:
case 268 /* ImportSpecifier */:
case 267 /* NamedImports */:
case 266 /* NamespaceImport */:
case 265 /* ImportClause */:
return false;
default:
return true;
}
}).parent;
}
function getTypeOfPrototypeProperty(prototype) {
// TypeScript 1.0 spec (April 2014): 8.4
// Every class automatically contains a static property member named 'prototype',
// the type of which is an instantiation of the class type with type Any supplied as a type argument for each type parameter.
// It is an error to explicitly declare a static property member with the name 'prototype'.
var classType = getDeclaredTypeOfSymbol(getParentOfSymbol(prototype));
return classType.typeParameters ? createTypeReference(classType, ts.map(classType.typeParameters, function (_) { return anyType; })) : classType;
}
// Return the type of the given property in the given type, or undefined if no such property exists
function getTypeOfPropertyOfType(type, name) {
var prop = getPropertyOfType(type, name);
return prop ? getTypeOfSymbol(prop) : undefined;
}
function getTypeOfPropertyOrIndexSignature(type, name) {
var _a;
return getTypeOfPropertyOfType(type, name) || ((_a = getApplicableIndexInfoForName(type, name)) === null || _a === void 0 ? void 0 : _a.type) || unknownType;
}
function isTypeAny(type) {
return type && (type.flags & 1 /* Any */) !== 0;
}
// Return the type of a binding element parent. We check SymbolLinks first to see if a type has been
// assigned by contextual typing.
function getTypeForBindingElementParent(node) {
var symbol = getSymbolOfNode(node);
return symbol && getSymbolLinks(symbol).type || getTypeForVariableLikeDeclaration(node, /*includeOptionality*/ false);
}
function getRestType(source, properties, symbol) {
source = filterType(source, function (t) { return !(t.flags & 98304 /* Nullable */); });
if (source.flags & 131072 /* Never */) {
return emptyObjectType;
}
if (source.flags & 1048576 /* Union */) {
return mapType(source, function (t) { return getRestType(t, properties, symbol); });
}
var omitKeyType = getUnionType(ts.map(properties, getLiteralTypeFromPropertyName));
if (isGenericObjectType(source) || isGenericIndexType(omitKeyType)) {
if (omitKeyType.flags & 131072 /* Never */) {
return source;
}
var omitTypeAlias = getGlobalOmitSymbol();
if (!omitTypeAlias) {
return errorType;
}
return getTypeAliasInstantiation(omitTypeAlias, [source, omitKeyType]);
}
var members = ts.createSymbolTable();
for (var _i = 0, _a = getPropertiesOfType(source); _i < _a.length; _i++) {
var prop = _a[_i];
if (!isTypeAssignableTo(getLiteralTypeFromProperty(prop, 8576 /* StringOrNumberLiteralOrUnique */), omitKeyType)
&& !(ts.getDeclarationModifierFlagsFromSymbol(prop) & (8 /* Private */ | 16 /* Protected */))
&& isSpreadableProperty(prop)) {
members.set(prop.escapedName, getSpreadSymbol(prop, /*readonly*/ false));
}
}
var result = createAnonymousType(symbol, members, ts.emptyArray, ts.emptyArray, getIndexInfosOfType(source));
result.objectFlags |= 8388608 /* ObjectRestType */;
return result;
}
function isGenericTypeWithUndefinedConstraint(type) {
return !!(type.flags & 465829888 /* Instantiable */) && maybeTypeOfKind(getBaseConstraintOfType(type) || unknownType, 32768 /* Undefined */);
}
function getNonUndefinedType(type) {
var typeOrConstraint = someType(type, isGenericTypeWithUndefinedConstraint) ? mapType(type, function (t) { return t.flags & 465829888 /* Instantiable */ ? getBaseConstraintOrType(t) : t; }) : type;
return getTypeWithFacts(typeOrConstraint, 524288 /* NEUndefined */);
}
// Determine the control flow type associated with a destructuring declaration or assignment. The following
// forms of destructuring are possible:
// let { x } = obj; // BindingElement
// let [ x ] = obj; // BindingElement
// { x } = obj; // ShorthandPropertyAssignment
// { x: v } = obj; // PropertyAssignment
// [ x ] = obj; // Expression
// We construct a synthetic element access expression corresponding to 'obj.x' such that the control
// flow analyzer doesn't have to handle all the different syntactic forms.
function getFlowTypeOfDestructuring(node, declaredType) {
var reference = getSyntheticElementAccess(node);
return reference ? getFlowTypeOfReference(reference, declaredType) : declaredType;
}
function getSyntheticElementAccess(node) {
var parentAccess = getParentElementAccess(node);
if (parentAccess && parentAccess.flowNode) {
var propName = getDestructuringPropertyName(node);
if (propName) {
var literal = ts.setTextRange(ts.parseNodeFactory.createStringLiteral(propName), node);
var lhsExpr = ts.isLeftHandSideExpression(parentAccess) ? parentAccess : ts.parseNodeFactory.createParenthesizedExpression(parentAccess);
var result = ts.setTextRange(ts.parseNodeFactory.createElementAccessExpression(lhsExpr, literal), node);
ts.setParent(literal, result);
ts.setParent(result, node);
if (lhsExpr !== parentAccess) {
ts.setParent(lhsExpr, result);
}
result.flowNode = parentAccess.flowNode;
return result;
}
}
}
function getParentElementAccess(node) {
var ancestor = node.parent.parent;
switch (ancestor.kind) {
case 201 /* BindingElement */:
case 291 /* PropertyAssignment */:
return getSyntheticElementAccess(ancestor);
case 202 /* ArrayLiteralExpression */:
return getSyntheticElementAccess(node.parent);
case 252 /* VariableDeclaration */:
return ancestor.initializer;
case 219 /* BinaryExpression */:
return ancestor.right;
}
}
function getDestructuringPropertyName(node) {
var parent = node.parent;
if (node.kind === 201 /* BindingElement */ && parent.kind === 199 /* ObjectBindingPattern */) {
return getLiteralPropertyNameText(node.propertyName || node.name);
}
if (node.kind === 291 /* PropertyAssignment */ || node.kind === 292 /* ShorthandPropertyAssignment */) {
return getLiteralPropertyNameText(node.name);
}
return "" + parent.elements.indexOf(node);
}
function getLiteralPropertyNameText(name) {
var type = getLiteralTypeFromPropertyName(name);
return type.flags & (128 /* StringLiteral */ | 256 /* NumberLiteral */) ? "" + type.value : undefined;
}
/** Return the inferred type for a binding element */
function getTypeForBindingElement(declaration) {
var pattern = declaration.parent;
var parentType = getTypeForBindingElementParent(pattern.parent);
// If no type or an any type was inferred for parent, infer that for the binding element
if (!parentType || isTypeAny(parentType)) {
return parentType;
}
// Relax null check on ambient destructuring parameters, since the parameters have no implementation and are just documentation
if (strictNullChecks && declaration.flags & 8388608 /* Ambient */ && ts.isParameterDeclaration(declaration)) {
parentType = getNonNullableType(parentType);
}
// Filter `undefined` from the type we check against if the parent has an initializer and that initializer is not possibly `undefined`
else if (strictNullChecks && pattern.parent.initializer && !(getTypeFacts(getTypeOfInitializer(pattern.parent.initializer)) & 65536 /* EQUndefined */)) {
parentType = getTypeWithFacts(parentType, 524288 /* NEUndefined */);
}
var type;
if (pattern.kind === 199 /* ObjectBindingPattern */) {
if (declaration.dotDotDotToken) {
parentType = getReducedType(parentType);
if (parentType.flags & 2 /* Unknown */ || !isValidSpreadType(parentType)) {
error(declaration, ts.Diagnostics.Rest_types_may_only_be_created_from_object_types);
return errorType;
}
var literalMembers = [];
for (var _i = 0, _a = pattern.elements; _i < _a.length; _i++) {
var element = _a[_i];
if (!element.dotDotDotToken) {
literalMembers.push(element.propertyName || element.name);
}
}
type = getRestType(parentType, literalMembers, declaration.symbol);
}
else {
// Use explicitly specified property name ({ p: xxx } form), or otherwise the implied name ({ p } form)
var name = declaration.propertyName || declaration.name;
var indexType = getLiteralTypeFromPropertyName(name);
var declaredType = getIndexedAccessType(parentType, indexType, 32 /* ExpressionPosition */, name);
type = getFlowTypeOfDestructuring(declaration, declaredType);
}
}
else {
// This elementType will be used if the specific property corresponding to this index is not
// present (aka the tuple element property). This call also checks that the parentType is in
// fact an iterable or array (depending on target language).
var elementType = checkIteratedTypeOrElementType(65 /* Destructuring */ | (declaration.dotDotDotToken ? 0 : 128 /* PossiblyOutOfBounds */), parentType, undefinedType, pattern);
var index_2 = pattern.elements.indexOf(declaration);
if (declaration.dotDotDotToken) {
// If the parent is a tuple type, the rest element has a tuple type of the
// remaining tuple element types. Otherwise, the rest element has an array type with same
// element type as the parent type.
type = everyType(parentType, isTupleType) ?
mapType(parentType, function (t) { return sliceTupleType(t, index_2); }) :
createArrayType(elementType);
}
else if (isArrayLikeType(parentType)) {
var indexType = getNumberLiteralType(index_2);
var accessFlags = 32 /* ExpressionPosition */ | (hasDefaultValue(declaration) ? 16 /* NoTupleBoundsCheck */ : 0);
var declaredType = getIndexedAccessTypeOrUndefined(parentType, indexType, accessFlags, declaration.name) || errorType;
type = getFlowTypeOfDestructuring(declaration, declaredType);
}
else {
type = elementType;
}
}
if (!declaration.initializer) {
return type;
}
if (ts.getEffectiveTypeAnnotationNode(ts.walkUpBindingElementsAndPatterns(declaration))) {
// In strict null checking mode, if a default value of a non-undefined type is specified, remove
// undefined from the final type.
return strictNullChecks && !(getFalsyFlags(checkDeclarationInitializer(declaration)) & 32768 /* Undefined */) ? getNonUndefinedType(type) : type;
}
return widenTypeInferredFromInitializer(declaration, getUnionType([getNonUndefinedType(type), checkDeclarationInitializer(declaration)], 2 /* Subtype */));
}
function getTypeForDeclarationFromJSDocComment(declaration) {
var jsdocType = ts.getJSDocType(declaration);
if (jsdocType) {
return getTypeFromTypeNode(jsdocType);
}
return undefined;
}
function isNullOrUndefined(node) {
var expr = ts.skipParentheses(node);
return expr.kind === 104 /* NullKeyword */ || expr.kind === 79 /* Identifier */ && getResolvedSymbol(expr) === undefinedSymbol;
}
function isEmptyArrayLiteral(node) {
var expr = ts.skipParentheses(node);
return expr.kind === 202 /* ArrayLiteralExpression */ && expr.elements.length === 0;
}
function addOptionality(type, isProperty, isOptional) {
if (isProperty === void 0) { isProperty = false; }
if (isOptional === void 0) { isOptional = true; }
return strictNullChecks && isOptional ? getOptionalType(type, isProperty) : type;
}
// Return the inferred type for a variable, parameter, or property declaration
function getTypeForVariableLikeDeclaration(declaration, includeOptionality) {
// A variable declared in a for..in statement is of type string, or of type keyof T when the
// right hand expression is of a type parameter type.
if (ts.isVariableDeclaration(declaration) && declaration.parent.parent.kind === 241 /* ForInStatement */) {
var indexType = getIndexType(getNonNullableTypeIfNeeded(checkExpression(declaration.parent.parent.expression)));
return indexType.flags & (262144 /* TypeParameter */ | 4194304 /* Index */) ? getExtractStringType(indexType) : stringType;
}
if (ts.isVariableDeclaration(declaration) && declaration.parent.parent.kind === 242 /* ForOfStatement */) {
// checkRightHandSideOfForOf will return undefined if the for-of expression type was
// missing properties/signatures required to get its iteratedType (like
// [Symbol.iterator] or next). This may be because we accessed properties from anyType,
// or it may have led to an error inside getElementTypeOfIterable.
var forOfStatement = declaration.parent.parent;
return checkRightHandSideOfForOf(forOfStatement) || anyType;
}
if (ts.isBindingPattern(declaration.parent)) {
return getTypeForBindingElement(declaration);
}
var isProperty = ts.isPropertyDeclaration(declaration) || ts.isPropertySignature(declaration);
var isOptional = includeOptionality && (isProperty && !!declaration.questionToken ||
ts.isParameter(declaration) && (!!declaration.questionToken || isJSDocOptionalParameter(declaration)) ||
isOptionalJSDocPropertyLikeTag(declaration));
// Use type from type annotation if one is present
var declaredType = tryGetTypeFromEffectiveTypeNode(declaration);
if (declaredType) {
return addOptionality(declaredType, isProperty, isOptional);
}
if ((noImplicitAny || ts.isInJSFile(declaration)) &&
ts.isVariableDeclaration(declaration) && !ts.isBindingPattern(declaration.name) &&
!(ts.getCombinedModifierFlags(declaration) & 1 /* Export */) && !(declaration.flags & 8388608 /* Ambient */)) {
// If --noImplicitAny is on or the declaration is in a Javascript file,
// use control flow tracked 'any' type for non-ambient, non-exported var or let variables with no
// initializer or a 'null' or 'undefined' initializer.
if (!(ts.getCombinedNodeFlags(declaration) & 2 /* Const */) && (!declaration.initializer || isNullOrUndefined(declaration.initializer))) {
return autoType;
}
// Use control flow tracked 'any[]' type for non-ambient, non-exported variables with an empty array
// literal initializer.
if (declaration.initializer && isEmptyArrayLiteral(declaration.initializer)) {
return autoArrayType;
}
}
if (ts.isParameter(declaration)) {
var func = declaration.parent;
// For a parameter of a set accessor, use the type of the get accessor if one is present
if (func.kind === 171 /* SetAccessor */ && hasBindableName(func)) {
var getter = ts.getDeclarationOfKind(getSymbolOfNode(declaration.parent), 170 /* GetAccessor */);
if (getter) {
var getterSignature = getSignatureFromDeclaration(getter);
var thisParameter = getAccessorThisParameter(func);
if (thisParameter && declaration === thisParameter) {
// Use the type from the *getter*
ts.Debug.assert(!thisParameter.type);
return getTypeOfSymbol(getterSignature.thisParameter);
}
return getReturnTypeOfSignature(getterSignature);
}
}
if (ts.isInJSFile(declaration)) {
var typeTag = ts.getJSDocType(func);
if (typeTag && ts.isFunctionTypeNode(typeTag)) {
var signature = getSignatureFromDeclaration(typeTag);
var pos = func.parameters.indexOf(declaration);
return declaration.dotDotDotToken ? getRestTypeAtPosition(signature, pos) : getTypeAtPosition(signature, pos);
}
}
// Use contextual parameter type if one is available
var type = declaration.symbol.escapedName === "this" /* This */ ? getContextualThisParameterType(func) : getContextuallyTypedParameterType(declaration);
if (type) {
return addOptionality(type, /*isProperty*/ false, isOptional);
}
}
// Use the type of the initializer expression if one is present and the declaration is
// not a parameter of a contextually typed function
if (ts.hasOnlyExpressionInitializer(declaration) && !!declaration.initializer) {
if (ts.isInJSFile(declaration) && !ts.isParameter(declaration)) {
var containerObjectType = getJSContainerObjectType(declaration, getSymbolOfNode(declaration), ts.getDeclaredExpandoInitializer(declaration));
if (containerObjectType) {
return containerObjectType;
}
}
var type = widenTypeInferredFromInitializer(declaration, checkDeclarationInitializer(declaration));
return addOptionality(type, isProperty, isOptional);
}
if (ts.isPropertyDeclaration(declaration) && (noImplicitAny || ts.isInJSFile(declaration))) {
// We have a property declaration with no type annotation or initializer, in noImplicitAny mode or a .js file.
// Use control flow analysis of this.xxx assignments in the constructor or static block to determine the type of the property.
if (!ts.hasStaticModifier(declaration)) {
var constructor = findConstructorDeclaration(declaration.parent);
var type = constructor ? getFlowTypeInConstructor(declaration.symbol, constructor) :
ts.getEffectiveModifierFlags(declaration) & 2 /* Ambient */ ? getTypeOfPropertyInBaseClass(declaration.symbol) :
undefined;
return type && addOptionality(type, /*isProperty*/ true, isOptional);
}
else {
var staticBlocks = ts.filter(declaration.parent.members, ts.isClassStaticBlockDeclaration);
var type = staticBlocks.length ? getFlowTypeInStaticBlocks(declaration.symbol, staticBlocks) :
ts.getEffectiveModifierFlags(declaration) & 2 /* Ambient */ ? getTypeOfPropertyInBaseClass(declaration.symbol) :
undefined;
return type && addOptionality(type, /*isProperty*/ true, isOptional);
}
}
if (ts.isJsxAttribute(declaration)) {
// if JSX attribute doesn't have initializer, by default the attribute will have boolean value of true.
// I.e <Elem attr /> is sugar for <Elem attr={true} />
return trueType;
}
// If the declaration specifies a binding pattern and is not a parameter of a contextually
// typed function, use the type implied by the binding pattern
if (ts.isBindingPattern(declaration.name)) {
return getTypeFromBindingPattern(declaration.name, /*includePatternInType*/ false, /*reportErrors*/ true);
}
// No type specified and nothing can be inferred
return undefined;
}
function isConstructorDeclaredProperty(symbol) {
// A property is considered a constructor declared property when all declaration sites are this.xxx assignments,
// when no declaration sites have JSDoc type annotations, and when at least one declaration site is in the body of
// a class constructor.
if (symbol.valueDeclaration && ts.isBinaryExpression(symbol.valueDeclaration)) {
var links = getSymbolLinks(symbol);
if (links.isConstructorDeclaredProperty === undefined) {
links.isConstructorDeclaredProperty = false;
links.isConstructorDeclaredProperty = !!getDeclaringConstructor(symbol) && ts.every(symbol.declarations, function (declaration) {
return ts.isBinaryExpression(declaration) &&
isPossiblyAliasedThisProperty(declaration) &&
(declaration.left.kind !== 205 /* ElementAccessExpression */ || ts.isStringOrNumericLiteralLike(declaration.left.argumentExpression)) &&
!getAnnotatedTypeForAssignmentDeclaration(/*declaredType*/ undefined, declaration, symbol, declaration);
});
}
return links.isConstructorDeclaredProperty;
}
return false;
}
function isAutoTypedProperty(symbol) {
// A property is auto-typed when its declaration has no type annotation or initializer and we're in
// noImplicitAny mode or a .js file.
var declaration = symbol.valueDeclaration;
return declaration && ts.isPropertyDeclaration(declaration) && !ts.getEffectiveTypeAnnotationNode(declaration) &&
!declaration.initializer && (noImplicitAny || ts.isInJSFile(declaration));
}
function getDeclaringConstructor(symbol) {
if (!symbol.declarations) {
return;
}
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
var container = ts.getThisContainer(declaration, /*includeArrowFunctions*/ false);
if (container && (container.kind === 169 /* Constructor */ || isJSConstructor(container))) {
return container;
}
}
;
}
/** Create a synthetic property access flow node after the last statement of the file */
function getFlowTypeFromCommonJSExport(symbol) {
var file = ts.getSourceFileOfNode(symbol.declarations[0]);
var accessName = ts.unescapeLeadingUnderscores(symbol.escapedName);
var areAllModuleExports = symbol.declarations.every(function (d) { return ts.isInJSFile(d) && ts.isAccessExpression(d) && ts.isModuleExportsAccessExpression(d.expression); });
var reference = areAllModuleExports
? ts.factory.createPropertyAccessExpression(ts.factory.createPropertyAccessExpression(ts.factory.createIdentifier("module"), ts.factory.createIdentifier("exports")), accessName)
: ts.factory.createPropertyAccessExpression(ts.factory.createIdentifier("exports"), accessName);
if (areAllModuleExports) {
ts.setParent(reference.expression.expression, reference.expression);
}
ts.setParent(reference.expression, reference);
ts.setParent(reference, file);
reference.flowNode = file.endFlowNode;
return getFlowTypeOfReference(reference, autoType, undefinedType);
}
function getFlowTypeInStaticBlocks(symbol, staticBlocks) {
var accessName = ts.startsWith(symbol.escapedName, "__#")
? ts.factory.createPrivateIdentifier(symbol.escapedName.split("@")[1])
: ts.unescapeLeadingUnderscores(symbol.escapedName);
for (var _i = 0, staticBlocks_1 = staticBlocks; _i < staticBlocks_1.length; _i++) {
var staticBlock = staticBlocks_1[_i];
var reference = ts.factory.createPropertyAccessExpression(ts.factory.createThis(), accessName);
ts.setParent(reference.expression, reference);
ts.setParent(reference, staticBlock);
reference.flowNode = staticBlock.returnFlowNode;
var flowType = getFlowTypeOfProperty(reference, symbol);
if (noImplicitAny && (flowType === autoType || flowType === autoArrayType)) {
error(symbol.valueDeclaration, ts.Diagnostics.Member_0_implicitly_has_an_1_type, symbolToString(symbol), typeToString(flowType));
}
// We don't infer a type if assignments are only null or undefined.
if (everyType(flowType, isNullableType)) {
continue;
}
return convertAutoToAny(flowType);
}
}
function getFlowTypeInConstructor(symbol, constructor) {
var accessName = ts.startsWith(symbol.escapedName, "__#")
? ts.factory.createPrivateIdentifier(symbol.escapedName.split("@")[1])
: ts.unescapeLeadingUnderscores(symbol.escapedName);
var reference = ts.factory.createPropertyAccessExpression(ts.factory.createThis(), accessName);
ts.setParent(reference.expression, reference);
ts.setParent(reference, constructor);
reference.flowNode = constructor.returnFlowNode;
var flowType = getFlowTypeOfProperty(reference, symbol);
if (noImplicitAny && (flowType === autoType || flowType === autoArrayType)) {
error(symbol.valueDeclaration, ts.Diagnostics.Member_0_implicitly_has_an_1_type, symbolToString(symbol), typeToString(flowType));
}
// We don't infer a type if assignments are only null or undefined.
return everyType(flowType, isNullableType) ? undefined : convertAutoToAny(flowType);
}
function getFlowTypeOfProperty(reference, prop) {
var initialType = (prop === null || prop === void 0 ? void 0 : prop.valueDeclaration)
&& (!isAutoTypedProperty(prop) || ts.getEffectiveModifierFlags(prop.valueDeclaration) & 2 /* Ambient */)
&& getTypeOfPropertyInBaseClass(prop)
|| undefinedType;
return getFlowTypeOfReference(reference, autoType, initialType);
}
function getWidenedTypeForAssignmentDeclaration(symbol, resolvedSymbol) {
// function/class/{} initializers are themselves containers, so they won't merge in the same way as other initializers
var container = ts.getAssignedExpandoInitializer(symbol.valueDeclaration);
if (container) {
var tag = ts.getJSDocTypeTag(container);
if (tag && tag.typeExpression) {
return getTypeFromTypeNode(tag.typeExpression);
}
var containerObjectType = symbol.valueDeclaration && getJSContainerObjectType(symbol.valueDeclaration, symbol, container);
return containerObjectType || getWidenedLiteralType(checkExpressionCached(container));
}
var type;
var definedInConstructor = false;
var definedInMethod = false;
// We use control flow analysis to determine the type of the property if the property qualifies as a constructor
// declared property and the resulting control flow type isn't just undefined or null.
if (isConstructorDeclaredProperty(symbol)) {
type = getFlowTypeInConstructor(symbol, getDeclaringConstructor(symbol));
}
if (!type) {
var types = void 0;
if (symbol.declarations) {
var jsdocType = void 0;
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
var expression = (ts.isBinaryExpression(declaration) || ts.isCallExpression(declaration)) ? declaration :
ts.isAccessExpression(declaration) ? ts.isBinaryExpression(declaration.parent) ? declaration.parent : declaration :
undefined;
if (!expression) {
continue; // Non-assignment declaration merged in (eg, an Identifier to mark the thing as a namespace) - skip over it and pull type info from elsewhere
}
var kind = ts.isAccessExpression(expression)
? ts.getAssignmentDeclarationPropertyAccessKind(expression)
: ts.getAssignmentDeclarationKind(expression);
if (kind === 4 /* ThisProperty */ || ts.isBinaryExpression(expression) && isPossiblyAliasedThisProperty(expression, kind)) {
if (isDeclarationInConstructor(expression)) {
definedInConstructor = true;
}
else {
definedInMethod = true;
}
}
if (!ts.isCallExpression(expression)) {
jsdocType = getAnnotatedTypeForAssignmentDeclaration(jsdocType, expression, symbol, declaration);
}
if (!jsdocType) {
(types || (types = [])).push((ts.isBinaryExpression(expression) || ts.isCallExpression(expression)) ? getInitializerTypeFromAssignmentDeclaration(symbol, resolvedSymbol, expression, kind) : neverType);
}
}
type = jsdocType;
}
if (!type) {
if (!ts.length(types)) {
return errorType; // No types from any declarations :(
}
var constructorTypes = definedInConstructor && symbol.declarations ? getConstructorDefinedThisAssignmentTypes(types, symbol.declarations) : undefined;
// use only the constructor types unless they were only assigned null | undefined (including widening variants)
if (definedInMethod) {
var propType = getTypeOfPropertyInBaseClass(symbol);
if (propType) {
(constructorTypes || (constructorTypes = [])).push(propType);
definedInConstructor = true;
}
}
var sourceTypes = ts.some(constructorTypes, function (t) { return !!(t.flags & ~98304 /* Nullable */); }) ? constructorTypes : types; // TODO: GH#18217
type = getUnionType(sourceTypes, 2 /* Subtype */);
}
}
var widened = getWidenedType(addOptionality(type, /*isProperty*/ false, definedInMethod && !definedInConstructor));
if (symbol.valueDeclaration && filterType(widened, function (t) { return !!(t.flags & ~98304 /* Nullable */); }) === neverType) {
reportImplicitAny(symbol.valueDeclaration, anyType);
return anyType;
}
return widened;
}
function getJSContainerObjectType(decl, symbol, init) {
var _a, _b;
if (!ts.isInJSFile(decl) || !init || !ts.isObjectLiteralExpression(init) || init.properties.length) {
return undefined;
}
var exports = ts.createSymbolTable();
while (ts.isBinaryExpression(decl) || ts.isPropertyAccessExpression(decl)) {
var s_2 = getSymbolOfNode(decl);
if ((_a = s_2 === null || s_2 === void 0 ? void 0 : s_2.exports) === null || _a === void 0 ? void 0 : _a.size) {
mergeSymbolTable(exports, s_2.exports);
}
decl = ts.isBinaryExpression(decl) ? decl.parent : decl.parent.parent;
}
var s = getSymbolOfNode(decl);
if ((_b = s === null || s === void 0 ? void 0 : s.exports) === null || _b === void 0 ? void 0 : _b.size) {
mergeSymbolTable(exports, s.exports);
}
var type = createAnonymousType(symbol, exports, ts.emptyArray, ts.emptyArray, ts.emptyArray);
type.objectFlags |= 8192 /* JSLiteral */;
return type;
}
function getAnnotatedTypeForAssignmentDeclaration(declaredType, expression, symbol, declaration) {
var _a;
var typeNode = ts.getEffectiveTypeAnnotationNode(expression.parent);
if (typeNode) {
var type = getWidenedType(getTypeFromTypeNode(typeNode));
if (!declaredType) {
return type;
}
else if (declaredType !== errorType && type !== errorType && !isTypeIdenticalTo(declaredType, type)) {
errorNextVariableOrPropertyDeclarationMustHaveSameType(/*firstDeclaration*/ undefined, declaredType, declaration, type);
}
}
if ((_a = symbol.parent) === null || _a === void 0 ? void 0 : _a.valueDeclaration) {
var typeNode_2 = ts.getEffectiveTypeAnnotationNode(symbol.parent.valueDeclaration);
if (typeNode_2) {
var annotationSymbol = getPropertyOfType(getTypeFromTypeNode(typeNode_2), symbol.escapedName);
if (annotationSymbol) {
return getNonMissingTypeOfSymbol(annotationSymbol);
}
}
}
return declaredType;
}
/** If we don't have an explicit JSDoc type, get the type from the initializer. */
function getInitializerTypeFromAssignmentDeclaration(symbol, resolvedSymbol, expression, kind) {
if (ts.isCallExpression(expression)) {
if (resolvedSymbol) {
return getTypeOfSymbol(resolvedSymbol); // This shouldn't happen except under some hopefully forbidden merges of export assignments and object define assignments
}
var objectLitType = checkExpressionCached(expression.arguments[2]);
var valueType = getTypeOfPropertyOfType(objectLitType, "value");
if (valueType) {
return valueType;
}
var getFunc = getTypeOfPropertyOfType(objectLitType, "get");
if (getFunc) {
var getSig = getSingleCallSignature(getFunc);
if (getSig) {
return getReturnTypeOfSignature(getSig);
}
}
var setFunc = getTypeOfPropertyOfType(objectLitType, "set");
if (setFunc) {
var setSig = getSingleCallSignature(setFunc);
if (setSig) {
return getTypeOfFirstParameterOfSignature(setSig);
}
}
return anyType;
}
if (containsSameNamedThisProperty(expression.left, expression.right)) {
return anyType;
}
var type = resolvedSymbol ? getTypeOfSymbol(resolvedSymbol) : getWidenedLiteralType(checkExpressionCached(expression.right));
if (type.flags & 524288 /* Object */ &&
kind === 2 /* ModuleExports */ &&
symbol.escapedName === "export=" /* ExportEquals */) {
var exportedType = resolveStructuredTypeMembers(type);
var members_4 = ts.createSymbolTable();
ts.copyEntries(exportedType.members, members_4);
var initialSize = members_4.size;
if (resolvedSymbol && !resolvedSymbol.exports) {
resolvedSymbol.exports = ts.createSymbolTable();
}
(resolvedSymbol || symbol).exports.forEach(function (s, name) {
var _a;
var exportedMember = members_4.get(name);
if (exportedMember && exportedMember !== s) {
if (s.flags & 111551 /* Value */ && exportedMember.flags & 111551 /* Value */) {
// If the member has an additional value-like declaration, union the types from the two declarations,
// but issue an error if they occurred in two different files. The purpose is to support a JS file with
// a pattern like:
//
// module.exports = { a: true };
// module.exports.a = 3;
//
// but we may have a JS file with `module.exports = { a: true }` along with a TypeScript module augmentation
// declaring an `export const a: number`. In that case, we issue a duplicate identifier error, because
// it's unclear what that's supposed to mean, so it's probably a mistake.
if (s.valueDeclaration && exportedMember.valueDeclaration && ts.getSourceFileOfNode(s.valueDeclaration) !== ts.getSourceFileOfNode(exportedMember.valueDeclaration)) {
var unescapedName = ts.unescapeLeadingUnderscores(s.escapedName);
var exportedMemberName = ((_a = ts.tryCast(exportedMember.valueDeclaration, ts.isNamedDeclaration)) === null || _a === void 0 ? void 0 : _a.name) || exportedMember.valueDeclaration;
ts.addRelatedInfo(error(s.valueDeclaration, ts.Diagnostics.Duplicate_identifier_0, unescapedName), ts.createDiagnosticForNode(exportedMemberName, ts.Diagnostics._0_was_also_declared_here, unescapedName));
ts.addRelatedInfo(error(exportedMemberName, ts.Diagnostics.Duplicate_identifier_0, unescapedName), ts.createDiagnosticForNode(s.valueDeclaration, ts.Diagnostics._0_was_also_declared_here, unescapedName));
}
var union = createSymbol(s.flags | exportedMember.flags, name);
union.type = getUnionType([getTypeOfSymbol(s), getTypeOfSymbol(exportedMember)]);
union.valueDeclaration = exportedMember.valueDeclaration;
union.declarations = ts.concatenate(exportedMember.declarations, s.declarations);
members_4.set(name, union);
}
else {
members_4.set(name, mergeSymbol(s, exportedMember));
}
}
else {
members_4.set(name, s);
}
});
var result = createAnonymousType(initialSize !== members_4.size ? undefined : exportedType.symbol, // Only set the type's symbol if it looks to be the same as the original type
members_4, exportedType.callSignatures, exportedType.constructSignatures, exportedType.indexInfos);
result.objectFlags |= (ts.getObjectFlags(type) & 8192 /* JSLiteral */); // Propagate JSLiteral flag
if (result.symbol && result.symbol.flags & 32 /* Class */ && type === getDeclaredTypeOfClassOrInterface(result.symbol)) {
result.objectFlags |= 16777216 /* IsClassInstanceClone */; // Propagate the knowledge that this type is equivalent to the symbol's class instance type
}
return result;
}
if (isEmptyArrayLiteralType(type)) {
reportImplicitAny(expression, anyArrayType);
return anyArrayType;
}
return type;
}
function containsSameNamedThisProperty(thisProperty, expression) {
return ts.isPropertyAccessExpression(thisProperty)
&& thisProperty.expression.kind === 108 /* ThisKeyword */
&& ts.forEachChildRecursively(expression, function (n) { return isMatchingReference(thisProperty, n); });
}
function isDeclarationInConstructor(expression) {
var thisContainer = ts.getThisContainer(expression, /*includeArrowFunctions*/ false);
// Properties defined in a constructor (or base constructor, or javascript constructor function) don't get undefined added.
// Function expressions that are assigned to the prototype count as methods.
return thisContainer.kind === 169 /* Constructor */ ||
thisContainer.kind === 254 /* FunctionDeclaration */ ||
(thisContainer.kind === 211 /* FunctionExpression */ && !ts.isPrototypePropertyAssignment(thisContainer.parent));
}
function getConstructorDefinedThisAssignmentTypes(types, declarations) {
ts.Debug.assert(types.length === declarations.length);
return types.filter(function (_, i) {
var declaration = declarations[i];
var expression = ts.isBinaryExpression(declaration) ? declaration :
ts.isBinaryExpression(declaration.parent) ? declaration.parent : undefined;
return expression && isDeclarationInConstructor(expression);
});
}
// Return the type implied by a binding pattern element. This is the type of the initializer of the element if
// one is present. Otherwise, if the element is itself a binding pattern, it is the type implied by the binding
// pattern. Otherwise, it is the type any.
function getTypeFromBindingElement(element, includePatternInType, reportErrors) {
if (element.initializer) {
// The type implied by a binding pattern is independent of context, so we check the initializer with no
// contextual type or, if the element itself is a binding pattern, with the type implied by that binding
// pattern.
var contextualType = ts.isBindingPattern(element.name) ? getTypeFromBindingPattern(element.name, /*includePatternInType*/ true, /*reportErrors*/ false) : unknownType;
return addOptionality(widenTypeInferredFromInitializer(element, checkDeclarationInitializer(element, contextualType)));
}
if (ts.isBindingPattern(element.name)) {
return getTypeFromBindingPattern(element.name, includePatternInType, reportErrors);
}
if (reportErrors && !declarationBelongsToPrivateAmbientMember(element)) {
reportImplicitAny(element, anyType);
}
// When we're including the pattern in the type (an indication we're obtaining a contextual type), we
// use the non-inferrable any type. Inference will never directly infer this type, but it is possible
// to infer a type that contains it, e.g. for a binding pattern like [foo] or { foo }. In such cases,
// widening of the binding pattern type substitutes a regular any for the non-inferrable any.
return includePatternInType ? nonInferrableAnyType : anyType;
}
// Return the type implied by an object binding pattern
function getTypeFromObjectBindingPattern(pattern, includePatternInType, reportErrors) {
var members = ts.createSymbolTable();
var stringIndexInfo;
var objectFlags = 128 /* ObjectLiteral */ | 262144 /* ContainsObjectOrArrayLiteral */;
ts.forEach(pattern.elements, function (e) {
var name = e.propertyName || e.name;
if (e.dotDotDotToken) {
stringIndexInfo = createIndexInfo(stringType, anyType, /*isReadonly*/ false);
return;
}
var exprType = getLiteralTypeFromPropertyName(name);
if (!isTypeUsableAsPropertyName(exprType)) {
// do not include computed properties in the implied type
objectFlags |= 512 /* ObjectLiteralPatternWithComputedProperties */;
return;
}
var text = getPropertyNameFromType(exprType);
var flags = 4 /* Property */ | (e.initializer ? 16777216 /* Optional */ : 0);
var symbol = createSymbol(flags, text);
symbol.type = getTypeFromBindingElement(e, includePatternInType, reportErrors);
symbol.bindingElement = e;
members.set(symbol.escapedName, symbol);
});
var result = createAnonymousType(undefined, members, ts.emptyArray, ts.emptyArray, stringIndexInfo ? [stringIndexInfo] : ts.emptyArray);
result.objectFlags |= objectFlags;
if (includePatternInType) {
result.pattern = pattern;
result.objectFlags |= 262144 /* ContainsObjectOrArrayLiteral */;
}
return result;
}
// Return the type implied by an array binding pattern
function getTypeFromArrayBindingPattern(pattern, includePatternInType, reportErrors) {
var elements = pattern.elements;
var lastElement = ts.lastOrUndefined(elements);
var restElement = lastElement && lastElement.kind === 201 /* BindingElement */ && lastElement.dotDotDotToken ? lastElement : undefined;
if (elements.length === 0 || elements.length === 1 && restElement) {
return languageVersion >= 2 /* ES2015 */ ? createIterableType(anyType) : anyArrayType;
}
var elementTypes = ts.map(elements, function (e) { return ts.isOmittedExpression(e) ? anyType : getTypeFromBindingElement(e, includePatternInType, reportErrors); });
var minLength = ts.findLastIndex(elements, function (e) { return !(e === restElement || ts.isOmittedExpression(e) || hasDefaultValue(e)); }, elements.length - 1) + 1;
var elementFlags = ts.map(elements, function (e, i) { return e === restElement ? 4 /* Rest */ : i >= minLength ? 2 /* Optional */ : 1 /* Required */; });
var result = createTupleType(elementTypes, elementFlags);
if (includePatternInType) {
result = cloneTypeReference(result);
result.pattern = pattern;
result.objectFlags |= 262144 /* ContainsObjectOrArrayLiteral */;
}
return result;
}
// Return the type implied by a binding pattern. This is the type implied purely by the binding pattern itself
// and without regard to its context (i.e. without regard any type annotation or initializer associated with the
// declaration in which the binding pattern is contained). For example, the implied type of [x, y] is [any, any]
// and the implied type of { x, y: z = 1 } is { x: any; y: number; }. The type implied by a binding pattern is
// used as the contextual type of an initializer associated with the binding pattern. Also, for a destructuring
// parameter with no type annotation or initializer, the type implied by the binding pattern becomes the type of
// the parameter.
function getTypeFromBindingPattern(pattern, includePatternInType, reportErrors) {
if (includePatternInType === void 0) { includePatternInType = false; }
if (reportErrors === void 0) { reportErrors = false; }
return pattern.kind === 199 /* ObjectBindingPattern */
? getTypeFromObjectBindingPattern(pattern, includePatternInType, reportErrors)
: getTypeFromArrayBindingPattern(pattern, includePatternInType, reportErrors);
}
// Return the type associated with a variable, parameter, or property declaration. In the simple case this is the type
// specified in a type annotation or inferred from an initializer. However, in the case of a destructuring declaration it
// is a bit more involved. For example:
//
// var [x, s = ""] = [1, "one"];
//
// Here, the array literal [1, "one"] is contextually typed by the type [any, string], which is the implied type of the
// binding pattern [x, s = ""]. Because the contextual type is a tuple type, the resulting type of [1, "one"] is the
// tuple type [number, string]. Thus, the type inferred for 'x' is number and the type inferred for 's' is string.
function getWidenedTypeForVariableLikeDeclaration(declaration, reportErrors) {
return widenTypeForVariableLikeDeclaration(getTypeForVariableLikeDeclaration(declaration, /*includeOptionality*/ true), declaration, reportErrors);
}
function isGlobalSymbolConstructor(node) {
var symbol = getSymbolOfNode(node);
var globalSymbol = getGlobalESSymbolConstructorTypeSymbol(/*reportErrors*/ false);
return globalSymbol && symbol && symbol === globalSymbol;
}
function widenTypeForVariableLikeDeclaration(type, declaration, reportErrors) {
if (type) {
// TODO: If back compat with pre-3.0/4.0 libs isn't required, remove the following SymbolConstructor special case transforming `symbol` into `unique symbol`
if (type.flags & 4096 /* ESSymbol */ && isGlobalSymbolConstructor(declaration.parent)) {
type = getESSymbolLikeTypeForNode(declaration);
}
if (reportErrors) {
reportErrorsFromWidening(declaration, type);
}
// always widen a 'unique symbol' type if the type was created for a different declaration.
if (type.flags & 8192 /* UniqueESSymbol */ && (ts.isBindingElement(declaration) || !declaration.type) && type.symbol !== getSymbolOfNode(declaration)) {
type = esSymbolType;
}
return getWidenedType(type);
}
// Rest parameters default to type any[], other parameters default to type any
type = ts.isParameter(declaration) && declaration.dotDotDotToken ? anyArrayType : anyType;
// Report implicit any errors unless this is a private property within an ambient declaration
if (reportErrors) {
if (!declarationBelongsToPrivateAmbientMember(declaration)) {
reportImplicitAny(declaration, type);
}
}
return type;
}
function declarationBelongsToPrivateAmbientMember(declaration) {
var root = ts.getRootDeclaration(declaration);
var memberDeclaration = root.kind === 162 /* Parameter */ ? root.parent : root;
return isPrivateWithinAmbient(memberDeclaration);
}
function tryGetTypeFromEffectiveTypeNode(declaration) {
var typeNode = ts.getEffectiveTypeAnnotationNode(declaration);
if (typeNode) {
return getTypeFromTypeNode(typeNode);
}
}
function getTypeOfVariableOrParameterOrProperty(symbol) {
var links = getSymbolLinks(symbol);
if (!links.type) {
var type = getTypeOfVariableOrParameterOrPropertyWorker(symbol);
// For a contextually typed parameter it is possible that a type has already
// been assigned (in assignTypeToParameterAndFixTypeParameters), and we want
// to preserve this type.
if (!links.type) {
links.type = type;
}
}
return links.type;
}
function getTypeOfVariableOrParameterOrPropertyWorker(symbol) {
// Handle prototype property
if (symbol.flags & 4194304 /* Prototype */) {
return getTypeOfPrototypeProperty(symbol);
}
// CommonsJS require and module both have type any.
if (symbol === requireSymbol) {
return anyType;
}
if (symbol.flags & 134217728 /* ModuleExports */ && symbol.valueDeclaration) {
var fileSymbol = getSymbolOfNode(ts.getSourceFileOfNode(symbol.valueDeclaration));
var result = createSymbol(fileSymbol.flags, "exports");
result.declarations = fileSymbol.declarations ? fileSymbol.declarations.slice() : [];
result.parent = symbol;
result.target = fileSymbol;
if (fileSymbol.valueDeclaration)
result.valueDeclaration = fileSymbol.valueDeclaration;
if (fileSymbol.members)
result.members = new ts.Map(fileSymbol.members);
if (fileSymbol.exports)
result.exports = new ts.Map(fileSymbol.exports);
var members = ts.createSymbolTable();
members.set("exports", result);
return createAnonymousType(symbol, members, ts.emptyArray, ts.emptyArray, ts.emptyArray);
}
// Handle catch clause variables
ts.Debug.assertIsDefined(symbol.valueDeclaration);
var declaration = symbol.valueDeclaration;
if (ts.isCatchClauseVariableDeclarationOrBindingElement(declaration)) {
var typeNode = ts.getEffectiveTypeAnnotationNode(declaration);
if (typeNode === undefined) {
return useUnknownInCatchVariables ? unknownType : anyType;
}
var type_1 = getTypeOfNode(typeNode);
// an errorType will make `checkTryStatement` issue an error
return isTypeAny(type_1) || type_1 === unknownType ? type_1 : errorType;
}
// Handle export default expressions
if (ts.isSourceFile(declaration) && ts.isJsonSourceFile(declaration)) {
if (!declaration.statements.length) {
return emptyObjectType;
}
return getWidenedType(getWidenedLiteralType(checkExpression(declaration.statements[0].expression)));
}
// Handle variable, parameter or property
if (!pushTypeResolution(symbol, 0 /* Type */)) {
// Symbol is property of some kind that is merged with something - should use `getTypeOfFuncClassEnumModule` and not `getTypeOfVariableOrParameterOrProperty`
if (symbol.flags & 512 /* ValueModule */ && !(symbol.flags & 67108864 /* Assignment */)) {
return getTypeOfFuncClassEnumModule(symbol);
}
return reportCircularityError(symbol);
}
var type;
if (declaration.kind === 269 /* ExportAssignment */) {
type = widenTypeForVariableLikeDeclaration(checkExpressionCached(declaration.expression), declaration);
}
else if (ts.isBinaryExpression(declaration) ||
(ts.isInJSFile(declaration) &&
(ts.isCallExpression(declaration) || (ts.isPropertyAccessExpression(declaration) || ts.isBindableStaticElementAccessExpression(declaration)) && ts.isBinaryExpression(declaration.parent)))) {
type = getWidenedTypeForAssignmentDeclaration(symbol);
}
else if (ts.isPropertyAccessExpression(declaration)
|| ts.isElementAccessExpression(declaration)
|| ts.isIdentifier(declaration)
|| ts.isStringLiteralLike(declaration)
|| ts.isNumericLiteral(declaration)
|| ts.isClassDeclaration(declaration)
|| ts.isFunctionDeclaration(declaration)
|| (ts.isMethodDeclaration(declaration) && !ts.isObjectLiteralMethod(declaration))
|| ts.isMethodSignature(declaration)
|| ts.isSourceFile(declaration)) {
// Symbol is property of some kind that is merged with something - should use `getTypeOfFuncClassEnumModule` and not `getTypeOfVariableOrParameterOrProperty`
if (symbol.flags & (16 /* Function */ | 8192 /* Method */ | 32 /* Class */ | 384 /* Enum */ | 512 /* ValueModule */)) {
return getTypeOfFuncClassEnumModule(symbol);
}
type = ts.isBinaryExpression(declaration.parent) ?
getWidenedTypeForAssignmentDeclaration(symbol) :
tryGetTypeFromEffectiveTypeNode(declaration) || anyType;
}
else if (ts.isPropertyAssignment(declaration)) {
type = tryGetTypeFromEffectiveTypeNode(declaration) || checkPropertyAssignment(declaration);
}
else if (ts.isJsxAttribute(declaration)) {
type = tryGetTypeFromEffectiveTypeNode(declaration) || checkJsxAttribute(declaration);
}
else if (ts.isShorthandPropertyAssignment(declaration)) {
type = tryGetTypeFromEffectiveTypeNode(declaration) || checkExpressionForMutableLocation(declaration.name, 0 /* Normal */);
}
else if (ts.isObjectLiteralMethod(declaration)) {
type = tryGetTypeFromEffectiveTypeNode(declaration) || checkObjectLiteralMethod(declaration, 0 /* Normal */);
}
else if (ts.isParameter(declaration)
|| ts.isPropertyDeclaration(declaration)
|| ts.isPropertySignature(declaration)
|| ts.isVariableDeclaration(declaration)
|| ts.isBindingElement(declaration)
|| ts.isJSDocPropertyLikeTag(declaration)) {
type = getWidenedTypeForVariableLikeDeclaration(declaration, /*includeOptionality*/ true);
}
// getTypeOfSymbol dispatches some JS merges incorrectly because their symbol flags are not mutually exclusive.
// Re-dispatch based on valueDeclaration.kind instead.
else if (ts.isEnumDeclaration(declaration)) {
type = getTypeOfFuncClassEnumModule(symbol);
}
else if (ts.isEnumMember(declaration)) {
type = getTypeOfEnumMember(symbol);
}
else if (ts.isAccessor(declaration)) {
type = resolveTypeOfAccessors(symbol) || ts.Debug.fail("Non-write accessor resolution must always produce a type");
}
else {
return ts.Debug.fail("Unhandled declaration kind! " + ts.Debug.formatSyntaxKind(declaration.kind) + " for " + ts.Debug.formatSymbol(symbol));
}
if (!popTypeResolution()) {
// Symbol is property of some kind that is merged with something - should use `getTypeOfFuncClassEnumModule` and not `getTypeOfVariableOrParameterOrProperty`
if (symbol.flags & 512 /* ValueModule */ && !(symbol.flags & 67108864 /* Assignment */)) {
return getTypeOfFuncClassEnumModule(symbol);
}
return reportCircularityError(symbol);
}
return type;
}
function getAnnotatedAccessorTypeNode(accessor) {
if (accessor) {
if (accessor.kind === 170 /* GetAccessor */) {
var getterTypeAnnotation = ts.getEffectiveReturnTypeNode(accessor);
return getterTypeAnnotation;
}
else {
var setterTypeAnnotation = ts.getEffectiveSetAccessorTypeAnnotationNode(accessor);
return setterTypeAnnotation;
}
}
return undefined;
}
function getAnnotatedAccessorType(accessor) {
var node = getAnnotatedAccessorTypeNode(accessor);
return node && getTypeFromTypeNode(node);
}
function getAnnotatedAccessorThisParameter(accessor) {
var parameter = getAccessorThisParameter(accessor);
return parameter && parameter.symbol;
}
function getThisTypeOfDeclaration(declaration) {
return getThisTypeOfSignature(getSignatureFromDeclaration(declaration));
}
function getTypeOfAccessors(symbol) {
var links = getSymbolLinks(symbol);
return links.type || (links.type = getTypeOfAccessorsWorker(symbol) || ts.Debug.fail("Read type of accessor must always produce a type"));
}
function getTypeOfSetAccessor(symbol) {
var links = getSymbolLinks(symbol);
return links.writeType || (links.writeType = getTypeOfAccessorsWorker(symbol, /*writing*/ true));
}
function getTypeOfAccessorsWorker(symbol, writing) {
if (writing === void 0) { writing = false; }
if (!pushTypeResolution(symbol, 0 /* Type */)) {
return errorType;
}
var type = resolveTypeOfAccessors(symbol, writing);
if (!popTypeResolution()) {
type = anyType;
if (noImplicitAny) {
var getter = ts.getDeclarationOfKind(symbol, 170 /* GetAccessor */);
error(getter, ts.Diagnostics._0_implicitly_has_return_type_any_because_it_does_not_have_a_return_type_annotation_and_is_referenced_directly_or_indirectly_in_one_of_its_return_expressions, symbolToString(symbol));
}
}
return type;
}
function resolveTypeOfAccessors(symbol, writing) {
if (writing === void 0) { writing = false; }
var getter = ts.getDeclarationOfKind(symbol, 170 /* GetAccessor */);
var setter = ts.getDeclarationOfKind(symbol, 171 /* SetAccessor */);
var setterType = getAnnotatedAccessorType(setter);
// For write operations, prioritize type annotations on the setter
if (writing && setterType) {
return instantiateTypeIfNeeded(setterType, symbol);
}
// Else defer to the getter type
if (getter && ts.isInJSFile(getter)) {
var jsDocType = getTypeForDeclarationFromJSDocComment(getter);
if (jsDocType) {
return instantiateTypeIfNeeded(jsDocType, symbol);
}
}
// Try to see if the user specified a return type on the get-accessor.
var getterType = getAnnotatedAccessorType(getter);
if (getterType) {
return instantiateTypeIfNeeded(getterType, symbol);
}
// If the user didn't specify a return type, try to use the set-accessor's parameter type.
if (setterType) {
return setterType;
}
// If there are no specified types, try to infer it from the body of the get accessor if it exists.
if (getter && getter.body) {
var returnTypeFromBody = getReturnTypeFromBody(getter);
return instantiateTypeIfNeeded(returnTypeFromBody, symbol);
}
// Otherwise, fall back to 'any'.
if (setter) {
if (!isPrivateWithinAmbient(setter)) {
errorOrSuggestion(noImplicitAny, setter, ts.Diagnostics.Property_0_implicitly_has_type_any_because_its_set_accessor_lacks_a_parameter_type_annotation, symbolToString(symbol));
}
return anyType;
}
else if (getter) {
ts.Debug.assert(!!getter, "there must exist a getter as we are current checking either setter or getter in this function");
if (!isPrivateWithinAmbient(getter)) {
errorOrSuggestion(noImplicitAny, getter, ts.Diagnostics.Property_0_implicitly_has_type_any_because_its_get_accessor_lacks_a_return_type_annotation, symbolToString(symbol));
}
return anyType;
}
return undefined;
function instantiateTypeIfNeeded(type, symbol) {
if (ts.getCheckFlags(symbol) & 1 /* Instantiated */) {
var links = getSymbolLinks(symbol);
return instantiateType(type, links.mapper);
}
return type;
}
}
function getBaseTypeVariableOfClass(symbol) {
var baseConstructorType = getBaseConstructorTypeOfClass(getDeclaredTypeOfClassOrInterface(symbol));
return baseConstructorType.flags & 8650752 /* TypeVariable */ ? baseConstructorType :
baseConstructorType.flags & 2097152 /* Intersection */ ? ts.find(baseConstructorType.types, function (t) { return !!(t.flags & 8650752 /* TypeVariable */); }) :
undefined;
}
function getTypeOfFuncClassEnumModule(symbol) {
var links = getSymbolLinks(symbol);
var originalLinks = links;
if (!links.type) {
var expando = symbol.valueDeclaration && getSymbolOfExpando(symbol.valueDeclaration, /*allowDeclaration*/ false);
if (expando) {
var merged = mergeJSSymbols(symbol, expando);
if (merged) {
// note:we overwrite links because we just cloned the symbol
symbol = links = merged;
}
}
originalLinks.type = links.type = getTypeOfFuncClassEnumModuleWorker(symbol);
}
return links.type;
}
function getTypeOfFuncClassEnumModuleWorker(symbol) {
var declaration = symbol.valueDeclaration;
if (symbol.flags & 1536 /* Module */ && ts.isShorthandAmbientModuleSymbol(symbol)) {
return anyType;
}
else if (declaration && (declaration.kind === 219 /* BinaryExpression */ ||
ts.isAccessExpression(declaration) &&
declaration.parent.kind === 219 /* BinaryExpression */)) {
return getWidenedTypeForAssignmentDeclaration(symbol);
}
else if (symbol.flags & 512 /* ValueModule */ && declaration && ts.isSourceFile(declaration) && declaration.commonJsModuleIndicator) {
var resolvedModule = resolveExternalModuleSymbol(symbol);
if (resolvedModule !== symbol) {
if (!pushTypeResolution(symbol, 0 /* Type */)) {
return errorType;
}
var exportEquals = getMergedSymbol(symbol.exports.get("export=" /* ExportEquals */));
var type_2 = getWidenedTypeForAssignmentDeclaration(exportEquals, exportEquals === resolvedModule ? undefined : resolvedModule);
if (!popTypeResolution()) {
return reportCircularityError(symbol);
}
return type_2;
}
}
var type = createObjectType(16 /* Anonymous */, symbol);
if (symbol.flags & 32 /* Class */) {
var baseTypeVariable = getBaseTypeVariableOfClass(symbol);
return baseTypeVariable ? getIntersectionType([type, baseTypeVariable]) : type;
}
else {
return strictNullChecks && symbol.flags & 16777216 /* Optional */ ? getOptionalType(type) : type;
}
}
function getTypeOfEnumMember(symbol) {
var links = getSymbolLinks(symbol);
return links.type || (links.type = getDeclaredTypeOfEnumMember(symbol));
}
function getTypeOfAlias(symbol) {
var links = getSymbolLinks(symbol);
if (!links.type) {
var targetSymbol = resolveAlias(symbol);
var exportSymbol = symbol.declarations && getTargetOfAliasDeclaration(getDeclarationOfAliasSymbol(symbol), /*dontResolveAlias*/ true);
// It only makes sense to get the type of a value symbol. If the result of resolving
// the alias is not a value, then it has no type. To get the type associated with a
// type symbol, call getDeclaredTypeOfSymbol.
// This check is important because without it, a call to getTypeOfSymbol could end
// up recursively calling getTypeOfAlias, causing a stack overflow.
links.type = (exportSymbol === null || exportSymbol === void 0 ? void 0 : exportSymbol.declarations) && isDuplicatedCommonJSExport(exportSymbol.declarations) && symbol.declarations.length ? getFlowTypeFromCommonJSExport(exportSymbol)
: isDuplicatedCommonJSExport(symbol.declarations) ? autoType
: targetSymbol.flags & 111551 /* Value */ ? getTypeOfSymbol(targetSymbol)
: errorType;
}
return links.type;
}
function getTypeOfInstantiatedSymbol(symbol) {
var links = getSymbolLinks(symbol);
if (!links.type) {
if (!pushTypeResolution(symbol, 0 /* Type */)) {
return links.type = errorType;
}
var type = instantiateType(getTypeOfSymbol(links.target), links.mapper);
if (!popTypeResolution()) {
type = reportCircularityError(symbol);
}
links.type = type;
}
return links.type;
}
function reportCircularityError(symbol) {
var declaration = symbol.valueDeclaration;
// Check if variable has type annotation that circularly references the variable itself
if (ts.getEffectiveTypeAnnotationNode(declaration)) {
error(symbol.valueDeclaration, ts.Diagnostics._0_is_referenced_directly_or_indirectly_in_its_own_type_annotation, symbolToString(symbol));
return errorType;
}
// Check if variable has initializer that circularly references the variable itself
if (noImplicitAny && (declaration.kind !== 162 /* Parameter */ || declaration.initializer)) {
error(symbol.valueDeclaration, ts.Diagnostics._0_implicitly_has_type_any_because_it_does_not_have_a_type_annotation_and_is_referenced_directly_or_indirectly_in_its_own_initializer, symbolToString(symbol));
}
// Circularities could also result from parameters in function expressions that end up
// having themselves as contextual types following type argument inference. In those cases
// we have already reported an implicit any error so we don't report anything here.
return anyType;
}
function getTypeOfSymbolWithDeferredType(symbol) {
var links = getSymbolLinks(symbol);
if (!links.type) {
ts.Debug.assertIsDefined(links.deferralParent);
ts.Debug.assertIsDefined(links.deferralConstituents);
links.type = links.deferralParent.flags & 1048576 /* Union */ ? getUnionType(links.deferralConstituents) : getIntersectionType(links.deferralConstituents);
}
return links.type;
}
function getSetAccessorTypeOfSymbol(symbol) {
if (symbol.flags & 98304 /* Accessor */) {
var type = getTypeOfSetAccessor(symbol);
if (type) {
return type;
}
}
return getTypeOfSymbol(symbol);
}
function getTypeOfSymbol(symbol) {
var checkFlags = ts.getCheckFlags(symbol);
if (checkFlags & 65536 /* DeferredType */) {
return getTypeOfSymbolWithDeferredType(symbol);
}
if (checkFlags & 1 /* Instantiated */) {
return getTypeOfInstantiatedSymbol(symbol);
}
if (checkFlags & 262144 /* Mapped */) {
return getTypeOfMappedSymbol(symbol);
}
if (checkFlags & 8192 /* ReverseMapped */) {
return getTypeOfReverseMappedSymbol(symbol);
}
if (symbol.flags & (3 /* Variable */ | 4 /* Property */)) {
return getTypeOfVariableOrParameterOrProperty(symbol);
}
if (symbol.flags & (16 /* Function */ | 8192 /* Method */ | 32 /* Class */ | 384 /* Enum */ | 512 /* ValueModule */)) {
return getTypeOfFuncClassEnumModule(symbol);
}
if (symbol.flags & 8 /* EnumMember */) {
return getTypeOfEnumMember(symbol);
}
if (symbol.flags & 98304 /* Accessor */) {
return getTypeOfAccessors(symbol);
}
if (symbol.flags & 2097152 /* Alias */) {
return getTypeOfAlias(symbol);
}
return errorType;
}
function getNonMissingTypeOfSymbol(symbol) {
return removeMissingType(getTypeOfSymbol(symbol), !!(symbol.flags & 16777216 /* Optional */));
}
function isReferenceToType(type, target) {
return type !== undefined
&& target !== undefined
&& (ts.getObjectFlags(type) & 4 /* Reference */) !== 0
&& type.target === target;
}
function getTargetType(type) {
return ts.getObjectFlags(type) & 4 /* Reference */ ? type.target : type;
}
// TODO: GH#18217 If `checkBase` is undefined, we should not call this because this will always return false.
function hasBaseType(type, checkBase) {
return check(type);
function check(type) {
if (ts.getObjectFlags(type) & (3 /* ClassOrInterface */ | 4 /* Reference */)) {
var target = getTargetType(type);
return target === checkBase || ts.some(getBaseTypes(target), check);
}
else if (type.flags & 2097152 /* Intersection */) {
return ts.some(type.types, check);
}
return false;
}
}
// Appends the type parameters given by a list of declarations to a set of type parameters and returns the resulting set.
// The function allocates a new array if the input type parameter set is undefined, but otherwise it modifies the set
// in-place and returns the same array.
function appendTypeParameters(typeParameters, declarations) {
for (var _i = 0, declarations_2 = declarations; _i < declarations_2.length; _i++) {
var declaration = declarations_2[_i];
typeParameters = ts.appendIfUnique(typeParameters, getDeclaredTypeOfTypeParameter(getSymbolOfNode(declaration)));
}
return typeParameters;
}
// Return the outer type parameters of a node or undefined if the node has no outer type parameters.
function getOuterTypeParameters(node, includeThisTypes) {
while (true) {
node = node.parent; // TODO: GH#18217 Use SourceFile kind check instead
if (node && ts.isBinaryExpression(node)) {
// prototype assignments get the outer type parameters of their constructor function
var assignmentKind = ts.getAssignmentDeclarationKind(node);
if (assignmentKind === 6 /* Prototype */ || assignmentKind === 3 /* PrototypeProperty */) {
var symbol = getSymbolOfNode(node.left);
if (symbol && symbol.parent && !ts.findAncestor(symbol.parent.valueDeclaration, function (d) { return node === d; })) {
node = symbol.parent.valueDeclaration;
}
}
}
if (!node) {
return undefined;
}
switch (node.kind) {
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
case 256 /* InterfaceDeclaration */:
case 172 /* CallSignature */:
case 173 /* ConstructSignature */:
case 166 /* MethodSignature */:
case 177 /* FunctionType */:
case 178 /* ConstructorType */:
case 312 /* JSDocFunctionType */:
case 254 /* FunctionDeclaration */:
case 167 /* MethodDeclaration */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
case 257 /* TypeAliasDeclaration */:
case 339 /* JSDocTemplateTag */:
case 340 /* JSDocTypedefTag */:
case 334 /* JSDocEnumTag */:
case 333 /* JSDocCallbackTag */:
case 193 /* MappedType */:
case 187 /* ConditionalType */: {
var outerTypeParameters = getOuterTypeParameters(node, includeThisTypes);
if (node.kind === 193 /* MappedType */) {
return ts.append(outerTypeParameters, getDeclaredTypeOfTypeParameter(getSymbolOfNode(node.typeParameter)));
}
else if (node.kind === 187 /* ConditionalType */) {
return ts.concatenate(outerTypeParameters, getInferTypeParameters(node));
}
var outerAndOwnTypeParameters = appendTypeParameters(outerTypeParameters, ts.getEffectiveTypeParameterDeclarations(node));
var thisType = includeThisTypes &&
(node.kind === 255 /* ClassDeclaration */ || node.kind === 224 /* ClassExpression */ || node.kind === 256 /* InterfaceDeclaration */ || isJSConstructor(node)) &&
getDeclaredTypeOfClassOrInterface(getSymbolOfNode(node)).thisType;
return thisType ? ts.append(outerAndOwnTypeParameters, thisType) : outerAndOwnTypeParameters;
}
case 335 /* JSDocParameterTag */:
var paramSymbol = ts.getParameterSymbolFromJSDoc(node);
if (paramSymbol) {
node = paramSymbol.valueDeclaration;
}
break;
case 315 /* JSDocComment */: {
var outerTypeParameters = getOuterTypeParameters(node, includeThisTypes);
return node.tags
? appendTypeParameters(outerTypeParameters, ts.flatMap(node.tags, function (t) { return ts.isJSDocTemplateTag(t) ? t.typeParameters : undefined; }))
: outerTypeParameters;
}
}
}
}
// The outer type parameters are those defined by enclosing generic classes, methods, or functions.
function getOuterTypeParametersOfClassOrInterface(symbol) {
var declaration = symbol.flags & 32 /* Class */ ? symbol.valueDeclaration : ts.getDeclarationOfKind(symbol, 256 /* InterfaceDeclaration */);
ts.Debug.assert(!!declaration, "Class was missing valueDeclaration -OR- non-class had no interface declarations");
return getOuterTypeParameters(declaration);
}
// The local type parameters are the combined set of type parameters from all declarations of the class,
// interface, or type alias.
function getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(symbol) {
if (!symbol.declarations) {
return;
}
var result;
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var node = _a[_i];
if (node.kind === 256 /* InterfaceDeclaration */ ||
node.kind === 255 /* ClassDeclaration */ ||
node.kind === 224 /* ClassExpression */ ||
isJSConstructor(node) ||
ts.isTypeAlias(node)) {
var declaration = node;
result = appendTypeParameters(result, ts.getEffectiveTypeParameterDeclarations(declaration));
}
}
return result;
}
// The full set of type parameters for a generic class or interface type consists of its outer type parameters plus
// its locally declared type parameters.
function getTypeParametersOfClassOrInterface(symbol) {
return ts.concatenate(getOuterTypeParametersOfClassOrInterface(symbol), getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(symbol));
}
// A type is a mixin constructor if it has a single construct signature taking no type parameters and a single
// rest parameter of type any[].
function isMixinConstructorType(type) {
var signatures = getSignaturesOfType(type, 1 /* Construct */);
if (signatures.length === 1) {
var s = signatures[0];
if (!s.typeParameters && s.parameters.length === 1 && signatureHasRestParameter(s)) {
var paramType = getTypeOfParameter(s.parameters[0]);
return isTypeAny(paramType) || getElementTypeOfArrayType(paramType) === anyType;
}
}
return false;
}
function isConstructorType(type) {
if (getSignaturesOfType(type, 1 /* Construct */).length > 0) {
return true;
}
if (type.flags & 8650752 /* TypeVariable */) {
var constraint = getBaseConstraintOfType(type);
return !!constraint && isMixinConstructorType(constraint);
}
return false;
}
function getBaseTypeNodeOfClass(type) {
return ts.getEffectiveBaseTypeNode(type.symbol.valueDeclaration);
}
function getConstructorsForTypeArguments(type, typeArgumentNodes, location) {
var typeArgCount = ts.length(typeArgumentNodes);
var isJavascript = ts.isInJSFile(location);
return ts.filter(getSignaturesOfType(type, 1 /* Construct */), function (sig) { return (isJavascript || typeArgCount >= getMinTypeArgumentCount(sig.typeParameters)) && typeArgCount <= ts.length(sig.typeParameters); });
}
function getInstantiatedConstructorsForTypeArguments(type, typeArgumentNodes, location) {
var signatures = getConstructorsForTypeArguments(type, typeArgumentNodes, location);
var typeArguments = ts.map(typeArgumentNodes, getTypeFromTypeNode);
return ts.sameMap(signatures, function (sig) { return ts.some(sig.typeParameters) ? getSignatureInstantiation(sig, typeArguments, ts.isInJSFile(location)) : sig; });
}
/**
* The base constructor of a class can resolve to
* * undefinedType if the class has no extends clause,
* * unknownType if an error occurred during resolution of the extends expression,
* * nullType if the extends expression is the null value,
* * anyType if the extends expression has type any, or
* * an object type with at least one construct signature.
*/
function getBaseConstructorTypeOfClass(type) {
if (!type.resolvedBaseConstructorType) {
var decl = type.symbol.valueDeclaration;
var extended = ts.getEffectiveBaseTypeNode(decl);
var baseTypeNode = getBaseTypeNodeOfClass(type);
if (!baseTypeNode) {
return type.resolvedBaseConstructorType = undefinedType;
}
if (!pushTypeResolution(type, 1 /* ResolvedBaseConstructorType */)) {
return errorType;
}
var baseConstructorType = checkExpression(baseTypeNode.expression);
if (extended && baseTypeNode !== extended) {
ts.Debug.assert(!extended.typeArguments); // Because this is in a JS file, and baseTypeNode is in an @extends tag
checkExpression(extended.expression);
}
if (baseConstructorType.flags & (524288 /* Object */ | 2097152 /* Intersection */)) {
// Resolving the members of a class requires us to resolve the base class of that class.
// We force resolution here such that we catch circularities now.
resolveStructuredTypeMembers(baseConstructorType);
}
if (!popTypeResolution()) {
error(type.symbol.valueDeclaration, ts.Diagnostics._0_is_referenced_directly_or_indirectly_in_its_own_base_expression, symbolToString(type.symbol));
return type.resolvedBaseConstructorType = errorType;
}
if (!(baseConstructorType.flags & 1 /* Any */) && baseConstructorType !== nullWideningType && !isConstructorType(baseConstructorType)) {
var err = error(baseTypeNode.expression, ts.Diagnostics.Type_0_is_not_a_constructor_function_type, typeToString(baseConstructorType));
if (baseConstructorType.flags & 262144 /* TypeParameter */) {
var constraint = getConstraintFromTypeParameter(baseConstructorType);
var ctorReturn = unknownType;
if (constraint) {
var ctorSig = getSignaturesOfType(constraint, 1 /* Construct */);
if (ctorSig[0]) {
ctorReturn = getReturnTypeOfSignature(ctorSig[0]);
}
}
if (baseConstructorType.symbol.declarations) {
ts.addRelatedInfo(err, ts.createDiagnosticForNode(baseConstructorType.symbol.declarations[0], ts.Diagnostics.Did_you_mean_for_0_to_be_constrained_to_type_new_args_Colon_any_1, symbolToString(baseConstructorType.symbol), typeToString(ctorReturn)));
}
}
return type.resolvedBaseConstructorType = errorType;
}
type.resolvedBaseConstructorType = baseConstructorType;
}
return type.resolvedBaseConstructorType;
}
function getImplementsTypes(type) {
var resolvedImplementsTypes = ts.emptyArray;
if (type.symbol.declarations) {
for (var _i = 0, _a = type.symbol.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
var implementsTypeNodes = ts.getEffectiveImplementsTypeNodes(declaration);
if (!implementsTypeNodes)
continue;
for (var _b = 0, implementsTypeNodes_1 = implementsTypeNodes; _b < implementsTypeNodes_1.length; _b++) {
var node = implementsTypeNodes_1[_b];
var implementsType = getTypeFromTypeNode(node);
if (implementsType !== errorType) {
if (resolvedImplementsTypes === ts.emptyArray) {
resolvedImplementsTypes = [implementsType];
}
else {
resolvedImplementsTypes.push(implementsType);
}
}
}
}
}
return resolvedImplementsTypes;
}
function reportCircularBaseType(node, type) {
error(node, ts.Diagnostics.Type_0_recursively_references_itself_as_a_base_type, typeToString(type, /*enclosingDeclaration*/ undefined, 2 /* WriteArrayAsGenericType */));
}
function getBaseTypes(type) {
if (!type.baseTypesResolved) {
if (pushTypeResolution(type, 7 /* ResolvedBaseTypes */)) {
if (type.objectFlags & 8 /* Tuple */) {
type.resolvedBaseTypes = [getTupleBaseType(type)];
}
else if (type.symbol.flags & (32 /* Class */ | 64 /* Interface */)) {
if (type.symbol.flags & 32 /* Class */) {
resolveBaseTypesOfClass(type);
}
if (type.symbol.flags & 64 /* Interface */) {
resolveBaseTypesOfInterface(type);
}
}
else {
ts.Debug.fail("type must be class or interface");
}
if (!popTypeResolution() && type.symbol.declarations) {
for (var _i = 0, _a = type.symbol.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
if (declaration.kind === 255 /* ClassDeclaration */ || declaration.kind === 256 /* InterfaceDeclaration */) {
reportCircularBaseType(declaration, type);
}
}
}
}
type.baseTypesResolved = true;
}
return type.resolvedBaseTypes;
}
function getTupleBaseType(type) {
var elementTypes = ts.sameMap(type.typeParameters, function (t, i) { return type.elementFlags[i] & 8 /* Variadic */ ? getIndexedAccessType(t, numberType) : t; });
return createArrayType(getUnionType(elementTypes || ts.emptyArray), type.readonly);
}
function resolveBaseTypesOfClass(type) {
type.resolvedBaseTypes = ts.resolvingEmptyArray;
var baseConstructorType = getApparentType(getBaseConstructorTypeOfClass(type));
if (!(baseConstructorType.flags & (524288 /* Object */ | 2097152 /* Intersection */ | 1 /* Any */))) {
return type.resolvedBaseTypes = ts.emptyArray;
}
var baseTypeNode = getBaseTypeNodeOfClass(type);
var baseType;
var originalBaseType = baseConstructorType.symbol ? getDeclaredTypeOfSymbol(baseConstructorType.symbol) : undefined;
if (baseConstructorType.symbol && baseConstructorType.symbol.flags & 32 /* Class */ &&
areAllOuterTypeParametersApplied(originalBaseType)) {
// When base constructor type is a class with no captured type arguments we know that the constructors all have the same type parameters as the
// class and all return the instance type of the class. There is no need for further checks and we can apply the
// type arguments in the same manner as a type reference to get the same error reporting experience.
baseType = getTypeFromClassOrInterfaceReference(baseTypeNode, baseConstructorType.symbol);
}
else if (baseConstructorType.flags & 1 /* Any */) {
baseType = baseConstructorType;
}
else {
// The class derives from a "class-like" constructor function, check that we have at least one construct signature
// with a matching number of type parameters and use the return type of the first instantiated signature. Elsewhere
// we check that all instantiated signatures return the same type.
var constructors = getInstantiatedConstructorsForTypeArguments(baseConstructorType, baseTypeNode.typeArguments, baseTypeNode);
if (!constructors.length) {
error(baseTypeNode.expression, ts.Diagnostics.No_base_constructor_has_the_specified_number_of_type_arguments);
return type.resolvedBaseTypes = ts.emptyArray;
}
baseType = getReturnTypeOfSignature(constructors[0]);
}
if (baseType === errorType) {
return type.resolvedBaseTypes = ts.emptyArray;
}
var reducedBaseType = getReducedType(baseType);
if (!isValidBaseType(reducedBaseType)) {
var elaboration = elaborateNeverIntersection(/*errorInfo*/ undefined, baseType);
var diagnostic = ts.chainDiagnosticMessages(elaboration, ts.Diagnostics.Base_constructor_return_type_0_is_not_an_object_type_or_intersection_of_object_types_with_statically_known_members, typeToString(reducedBaseType));
diagnostics.add(ts.createDiagnosticForNodeFromMessageChain(baseTypeNode.expression, diagnostic));
return type.resolvedBaseTypes = ts.emptyArray;
}
if (type === reducedBaseType || hasBaseType(reducedBaseType, type)) {
error(type.symbol.valueDeclaration, ts.Diagnostics.Type_0_recursively_references_itself_as_a_base_type, typeToString(type, /*enclosingDeclaration*/ undefined, 2 /* WriteArrayAsGenericType */));
return type.resolvedBaseTypes = ts.emptyArray;
}
if (type.resolvedBaseTypes === ts.resolvingEmptyArray) {
// Circular reference, likely through instantiation of default parameters
// (otherwise there'd be an error from hasBaseType) - this is fine, but `.members` should be reset
// as `getIndexedAccessType` via `instantiateType` via `getTypeFromClassOrInterfaceReference` forces a
// partial instantiation of the members without the base types fully resolved
type.members = undefined;
}
return type.resolvedBaseTypes = [reducedBaseType];
}
function areAllOuterTypeParametersApplied(type) {
// An unapplied type parameter has its symbol still the same as the matching argument symbol.
// Since parameters are applied outer-to-inner, only the last outer parameter needs to be checked.
var outerTypeParameters = type.outerTypeParameters;
if (outerTypeParameters) {
var last_1 = outerTypeParameters.length - 1;
var typeArguments = getTypeArguments(type);
return outerTypeParameters[last_1].symbol !== typeArguments[last_1].symbol;
}
return true;
}
// A valid base type is `any`, an object type or intersection of object types.
function isValidBaseType(type) {
if (type.flags & 262144 /* TypeParameter */) {
var constraint = getBaseConstraintOfType(type);
if (constraint) {
return isValidBaseType(constraint);
}
}
// TODO: Given that we allow type parmeters here now, is this `!isGenericMappedType(type)` check really needed?
// There's no reason a `T` should be allowed while a `Readonly<T>` should not.
return !!(type.flags & (524288 /* Object */ | 67108864 /* NonPrimitive */ | 1 /* Any */) && !isGenericMappedType(type) ||
type.flags & 2097152 /* Intersection */ && ts.every(type.types, isValidBaseType));
}
function resolveBaseTypesOfInterface(type) {
type.resolvedBaseTypes = type.resolvedBaseTypes || ts.emptyArray;
if (type.symbol.declarations) {
for (var _i = 0, _a = type.symbol.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
if (declaration.kind === 256 /* InterfaceDeclaration */ && ts.getInterfaceBaseTypeNodes(declaration)) {
for (var _b = 0, _c = ts.getInterfaceBaseTypeNodes(declaration); _b < _c.length; _b++) {
var node = _c[_b];
var baseType = getReducedType(getTypeFromTypeNode(node));
if (baseType !== errorType) {
if (isValidBaseType(baseType)) {
if (type !== baseType && !hasBaseType(baseType, type)) {
if (type.resolvedBaseTypes === ts.emptyArray) {
type.resolvedBaseTypes = [baseType];
}
else {
type.resolvedBaseTypes.push(baseType);
}
}
else {
reportCircularBaseType(declaration, type);
}
}
else {
error(node, ts.Diagnostics.An_interface_can_only_extend_an_object_type_or_intersection_of_object_types_with_statically_known_members);
}
}
}
}
}
}
}
/**
* Returns true if the interface given by the symbol is free of "this" references.
*
* Specifically, the result is true if the interface itself contains no references
* to "this" in its body, if all base types are interfaces,
* and if none of the base interfaces have a "this" type.
*/
function isThislessInterface(symbol) {
if (!symbol.declarations) {
return true;
}
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
if (declaration.kind === 256 /* InterfaceDeclaration */) {
if (declaration.flags & 128 /* ContainsThis */) {
return false;
}
var baseTypeNodes = ts.getInterfaceBaseTypeNodes(declaration);
if (baseTypeNodes) {
for (var _b = 0, baseTypeNodes_1 = baseTypeNodes; _b < baseTypeNodes_1.length; _b++) {
var node = baseTypeNodes_1[_b];
if (ts.isEntityNameExpression(node.expression)) {
var baseSymbol = resolveEntityName(node.expression, 788968 /* Type */, /*ignoreErrors*/ true);
if (!baseSymbol || !(baseSymbol.flags & 64 /* Interface */) || getDeclaredTypeOfClassOrInterface(baseSymbol).thisType) {
return false;
}
}
}
}
}
}
return true;
}
function getDeclaredTypeOfClassOrInterface(symbol) {
var links = getSymbolLinks(symbol);
var originalLinks = links;
if (!links.declaredType) {
var kind = symbol.flags & 32 /* Class */ ? 1 /* Class */ : 2 /* Interface */;
var merged = mergeJSSymbols(symbol, symbol.valueDeclaration && getAssignedClassSymbol(symbol.valueDeclaration));
if (merged) {
// note:we overwrite links because we just cloned the symbol
symbol = links = merged;
}
var type = originalLinks.declaredType = links.declaredType = createObjectType(kind, symbol);
var outerTypeParameters = getOuterTypeParametersOfClassOrInterface(symbol);
var localTypeParameters = getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(symbol);
// A class or interface is generic if it has type parameters or a "this" type. We always give classes a "this" type
// because it is not feasible to analyze all members to determine if the "this" type escapes the class (in particular,
// property types inferred from initializers and method return types inferred from return statements are very hard
// to exhaustively analyze). We give interfaces a "this" type if we can't definitely determine that they are free of
// "this" references.
if (outerTypeParameters || localTypeParameters || kind === 1 /* Class */ || !isThislessInterface(symbol)) {
type.objectFlags |= 4 /* Reference */;
type.typeParameters = ts.concatenate(outerTypeParameters, localTypeParameters);
type.outerTypeParameters = outerTypeParameters;
type.localTypeParameters = localTypeParameters;
type.instantiations = new ts.Map();
type.instantiations.set(getTypeListId(type.typeParameters), type);
type.target = type;
type.resolvedTypeArguments = type.typeParameters;
type.thisType = createTypeParameter(symbol);
type.thisType.isThisType = true;
type.thisType.constraint = type;
}
}
return links.declaredType;
}
function getDeclaredTypeOfTypeAlias(symbol) {
var _a;
var links = getSymbolLinks(symbol);
if (!links.declaredType) {
// Note that we use the links object as the target here because the symbol object is used as the unique
// identity for resolution of the 'type' property in SymbolLinks.
if (!pushTypeResolution(symbol, 2 /* DeclaredType */)) {
return errorType;
}
var declaration = ts.Debug.checkDefined((_a = symbol.declarations) === null || _a === void 0 ? void 0 : _a.find(ts.isTypeAlias), "Type alias symbol with no valid declaration found");
var typeNode = ts.isJSDocTypeAlias(declaration) ? declaration.typeExpression : declaration.type;
// If typeNode is missing, we will error in checkJSDocTypedefTag.
var type = typeNode ? getTypeFromTypeNode(typeNode) : errorType;
if (popTypeResolution()) {
var typeParameters = getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(symbol);
if (typeParameters) {
// Initialize the instantiation cache for generic type aliases. The declared type corresponds to
// an instantiation of the type alias with the type parameters supplied as type arguments.
links.typeParameters = typeParameters;
links.instantiations = new ts.Map();
links.instantiations.set(getTypeListId(typeParameters), type);
}
}
else {
type = errorType;
if (declaration.kind === 334 /* JSDocEnumTag */) {
error(declaration.typeExpression.type, ts.Diagnostics.Type_alias_0_circularly_references_itself, symbolToString(symbol));
}
else {
error(ts.isNamedDeclaration(declaration) ? declaration.name : declaration || declaration, ts.Diagnostics.Type_alias_0_circularly_references_itself, symbolToString(symbol));
}
}
links.declaredType = type;
}
return links.declaredType;
}
function isStringConcatExpression(expr) {
if (ts.isStringLiteralLike(expr)) {
return true;
}
else if (expr.kind === 219 /* BinaryExpression */) {
return isStringConcatExpression(expr.left) && isStringConcatExpression(expr.right);
}
return false;
}
function isLiteralEnumMember(member) {
var expr = member.initializer;
if (!expr) {
return !(member.flags & 8388608 /* Ambient */);
}
switch (expr.kind) {
case 10 /* StringLiteral */:
case 8 /* NumericLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
return true;
case 217 /* PrefixUnaryExpression */:
return expr.operator === 40 /* MinusToken */ &&
expr.operand.kind === 8 /* NumericLiteral */;
case 79 /* Identifier */:
return ts.nodeIsMissing(expr) || !!getSymbolOfNode(member.parent).exports.get(expr.escapedText);
case 219 /* BinaryExpression */:
return isStringConcatExpression(expr);
default:
return false;
}
}
function getEnumKind(symbol) {
var links = getSymbolLinks(symbol);
if (links.enumKind !== undefined) {
return links.enumKind;
}
var hasNonLiteralMember = false;
if (symbol.declarations) {
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
if (declaration.kind === 258 /* EnumDeclaration */) {
for (var _b = 0, _c = declaration.members; _b < _c.length; _b++) {
var member = _c[_b];
if (member.initializer && ts.isStringLiteralLike(member.initializer)) {
return links.enumKind = 1 /* Literal */;
}
if (!isLiteralEnumMember(member)) {
hasNonLiteralMember = true;
}
}
}
}
}
return links.enumKind = hasNonLiteralMember ? 0 /* Numeric */ : 1 /* Literal */;
}
function getBaseTypeOfEnumLiteralType(type) {
return type.flags & 1024 /* EnumLiteral */ && !(type.flags & 1048576 /* Union */) ? getDeclaredTypeOfSymbol(getParentOfSymbol(type.symbol)) : type;
}
function getDeclaredTypeOfEnum(symbol) {
var links = getSymbolLinks(symbol);
if (links.declaredType) {
return links.declaredType;
}
if (getEnumKind(symbol) === 1 /* Literal */) {
enumCount++;
var memberTypeList = [];
if (symbol.declarations) {
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
if (declaration.kind === 258 /* EnumDeclaration */) {
for (var _b = 0, _c = declaration.members; _b < _c.length; _b++) {
var member = _c[_b];
var value = getEnumMemberValue(member);
var memberType = getFreshTypeOfLiteralType(getEnumLiteralType(value !== undefined ? value : 0, enumCount, getSymbolOfNode(member)));
getSymbolLinks(getSymbolOfNode(member)).declaredType = memberType;
memberTypeList.push(getRegularTypeOfLiteralType(memberType));
}
}
}
}
if (memberTypeList.length) {
var enumType_1 = getUnionType(memberTypeList, 1 /* Literal */, symbol, /*aliasTypeArguments*/ undefined);
if (enumType_1.flags & 1048576 /* Union */) {
enumType_1.flags |= 1024 /* EnumLiteral */;
enumType_1.symbol = symbol;
}
return links.declaredType = enumType_1;
}
}
var enumType = createType(32 /* Enum */);
enumType.symbol = symbol;
return links.declaredType = enumType;
}
function getDeclaredTypeOfEnumMember(symbol) {
var links = getSymbolLinks(symbol);
if (!links.declaredType) {
var enumType = getDeclaredTypeOfEnum(getParentOfSymbol(symbol));
if (!links.declaredType) {
links.declaredType = enumType;
}
}
return links.declaredType;
}
function getDeclaredTypeOfTypeParameter(symbol) {
var links = getSymbolLinks(symbol);
return links.declaredType || (links.declaredType = createTypeParameter(symbol));
}
function getDeclaredTypeOfAlias(symbol) {
var links = getSymbolLinks(symbol);
return links.declaredType || (links.declaredType = getDeclaredTypeOfSymbol(resolveAlias(symbol)));
}
function getDeclaredTypeOfSymbol(symbol) {
return tryGetDeclaredTypeOfSymbol(symbol) || errorType;
}
function tryGetDeclaredTypeOfSymbol(symbol) {
if (symbol.flags & (32 /* Class */ | 64 /* Interface */)) {
return getDeclaredTypeOfClassOrInterface(symbol);
}
if (symbol.flags & 524288 /* TypeAlias */) {
return getDeclaredTypeOfTypeAlias(symbol);
}
if (symbol.flags & 262144 /* TypeParameter */) {
return getDeclaredTypeOfTypeParameter(symbol);
}
if (symbol.flags & 384 /* Enum */) {
return getDeclaredTypeOfEnum(symbol);
}
if (symbol.flags & 8 /* EnumMember */) {
return getDeclaredTypeOfEnumMember(symbol);
}
if (symbol.flags & 2097152 /* Alias */) {
return getDeclaredTypeOfAlias(symbol);
}
return undefined;
}
/**
* A type is free of this references if it's the any, string, number, boolean, symbol, or void keyword, a string
* literal type, an array with an element type that is free of this references, or a type reference that is
* free of this references.
*/
function isThislessType(node) {
switch (node.kind) {
case 129 /* AnyKeyword */:
case 153 /* UnknownKeyword */:
case 148 /* StringKeyword */:
case 145 /* NumberKeyword */:
case 156 /* BigIntKeyword */:
case 132 /* BooleanKeyword */:
case 149 /* SymbolKeyword */:
case 146 /* ObjectKeyword */:
case 114 /* VoidKeyword */:
case 151 /* UndefinedKeyword */:
case 142 /* NeverKeyword */:
case 194 /* LiteralType */:
return true;
case 181 /* ArrayType */:
return isThislessType(node.elementType);
case 176 /* TypeReference */:
return !node.typeArguments || node.typeArguments.every(isThislessType);
}
return false;
}
/** A type parameter is thisless if its constraint is thisless, or if it has no constraint. */
function isThislessTypeParameter(node) {
var constraint = ts.getEffectiveConstraintOfTypeParameter(node);
return !constraint || isThislessType(constraint);
}
/**
* A variable-like declaration is free of this references if it has a type annotation
* that is thisless, or if it has no type annotation and no initializer (and is thus of type any).
*/
function isThislessVariableLikeDeclaration(node) {
var typeNode = ts.getEffectiveTypeAnnotationNode(node);
return typeNode ? isThislessType(typeNode) : !ts.hasInitializer(node);
}
/**
* A function-like declaration is considered free of `this` references if it has a return type
* annotation that is free of this references and if each parameter is thisless and if
* each type parameter (if present) is thisless.
*/
function isThislessFunctionLikeDeclaration(node) {
var returnType = ts.getEffectiveReturnTypeNode(node);
var typeParameters = ts.getEffectiveTypeParameterDeclarations(node);
return (node.kind === 169 /* Constructor */ || (!!returnType && isThislessType(returnType))) &&
node.parameters.every(isThislessVariableLikeDeclaration) &&
typeParameters.every(isThislessTypeParameter);
}
/**
* Returns true if the class or interface member given by the symbol is free of "this" references. The
* function may return false for symbols that are actually free of "this" references because it is not
* feasible to perform a complete analysis in all cases. In particular, property members with types
* inferred from their initializers and function members with inferred return types are conservatively
* assumed not to be free of "this" references.
*/
function isThisless(symbol) {
if (symbol.declarations && symbol.declarations.length === 1) {
var declaration = symbol.declarations[0];
if (declaration) {
switch (declaration.kind) {
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
return isThislessVariableLikeDeclaration(declaration);
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
case 169 /* Constructor */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return isThislessFunctionLikeDeclaration(declaration);
}
}
}
return false;
}
// The mappingThisOnly flag indicates that the only type parameter being mapped is "this". When the flag is true,
// we check symbols to see if we can quickly conclude they are free of "this" references, thus needing no instantiation.
function createInstantiatedSymbolTable(symbols, mapper, mappingThisOnly) {
var result = ts.createSymbolTable();
for (var _i = 0, symbols_2 = symbols; _i < symbols_2.length; _i++) {
var symbol = symbols_2[_i];
result.set(symbol.escapedName, mappingThisOnly && isThisless(symbol) ? symbol : instantiateSymbol(symbol, mapper));
}
return result;
}
function addInheritedMembers(symbols, baseSymbols) {
for (var _i = 0, baseSymbols_1 = baseSymbols; _i < baseSymbols_1.length; _i++) {
var s = baseSymbols_1[_i];
if (!symbols.has(s.escapedName) && !isStaticPrivateIdentifierProperty(s)) {
symbols.set(s.escapedName, s);
}
}
}
function isStaticPrivateIdentifierProperty(s) {
return !!s.valueDeclaration && ts.isPrivateIdentifierClassElementDeclaration(s.valueDeclaration) && ts.isStatic(s.valueDeclaration);
}
function resolveDeclaredMembers(type) {
if (!type.declaredProperties) {
var symbol = type.symbol;
var members = getMembersOfSymbol(symbol);
type.declaredProperties = getNamedMembers(members);
// Start with signatures at empty array in case of recursive types
type.declaredCallSignatures = ts.emptyArray;
type.declaredConstructSignatures = ts.emptyArray;
type.declaredIndexInfos = ts.emptyArray;
type.declaredCallSignatures = getSignaturesOfSymbol(members.get("__call" /* Call */));
type.declaredConstructSignatures = getSignaturesOfSymbol(members.get("__new" /* New */));
type.declaredIndexInfos = getIndexInfosOfSymbol(symbol);
}
return type;
}
/**
* Indicates whether a type can be used as a property name.
*/
function isTypeUsableAsPropertyName(type) {
return !!(type.flags & 8576 /* StringOrNumberLiteralOrUnique */);
}
/**
* Indicates whether a declaration name is definitely late-bindable.
* A declaration name is only late-bindable if:
* - It is a `ComputedPropertyName`.
* - Its expression is an `Identifier` or either a `PropertyAccessExpression` an
* `ElementAccessExpression` consisting only of these same three types of nodes.
* - The type of its expression is a string or numeric literal type, or is a `unique symbol` type.
*/
function isLateBindableName(node) {
if (!ts.isComputedPropertyName(node) && !ts.isElementAccessExpression(node)) {
return false;
}
var expr = ts.isComputedPropertyName(node) ? node.expression : node.argumentExpression;
return ts.isEntityNameExpression(expr)
&& isTypeUsableAsPropertyName(ts.isComputedPropertyName(node) ? checkComputedPropertyName(node) : checkExpressionCached(expr));
}
function isLateBoundName(name) {
return name.charCodeAt(0) === 95 /* _ */ &&
name.charCodeAt(1) === 95 /* _ */ &&
name.charCodeAt(2) === 64 /* at */;
}
/**
* Indicates whether a declaration has a late-bindable dynamic name.
*/
function hasLateBindableName(node) {
var name = ts.getNameOfDeclaration(node);
return !!name && isLateBindableName(name);
}
/**
* Indicates whether a declaration has an early-bound name or a dynamic name that can be late-bound.
*/
function hasBindableName(node) {
return !ts.hasDynamicName(node) || hasLateBindableName(node);
}
/**
* Indicates whether a declaration name is a dynamic name that cannot be late-bound.
*/
function isNonBindableDynamicName(node) {
return ts.isDynamicName(node) && !isLateBindableName(node);
}
/**
* Gets the symbolic name for a member from its type.
*/
function getPropertyNameFromType(type) {
if (type.flags & 8192 /* UniqueESSymbol */) {
return type.escapedName;
}
if (type.flags & (128 /* StringLiteral */ | 256 /* NumberLiteral */)) {
return ts.escapeLeadingUnderscores("" + type.value);
}
return ts.Debug.fail();
}
/**
* Adds a declaration to a late-bound dynamic member. This performs the same function for
* late-bound members that `addDeclarationToSymbol` in binder.ts performs for early-bound
* members.
*/
function addDeclarationToLateBoundSymbol(symbol, member, symbolFlags) {
ts.Debug.assert(!!(ts.getCheckFlags(symbol) & 4096 /* Late */), "Expected a late-bound symbol.");
symbol.flags |= symbolFlags;
getSymbolLinks(member.symbol).lateSymbol = symbol;
if (!symbol.declarations) {
symbol.declarations = [member];
}
else if (!member.symbol.isReplaceableByMethod) {
symbol.declarations.push(member);
}
if (symbolFlags & 111551 /* Value */) {
if (!symbol.valueDeclaration || symbol.valueDeclaration.kind !== member.kind) {
symbol.valueDeclaration = member;
}
}
}
/**
* Performs late-binding of a dynamic member. This performs the same function for
* late-bound members that `declareSymbol` in binder.ts performs for early-bound
* members.
*
* If a symbol is a dynamic name from a computed property, we perform an additional "late"
* binding phase to attempt to resolve the name for the symbol from the type of the computed
* property's expression. If the type of the expression is a string-literal, numeric-literal,
* or unique symbol type, we can use that type as the name of the symbol.
*
* For example, given:
*
* const x = Symbol();
*
* interface I {
* [x]: number;
* }
*
* The binder gives the property `[x]: number` a special symbol with the name "__computed".
* In the late-binding phase we can type-check the expression `x` and see that it has a
* unique symbol type which we can then use as the name of the member. This allows users
* to define custom symbols that can be used in the members of an object type.
*
* @param parent The containing symbol for the member.
* @param earlySymbols The early-bound symbols of the parent.
* @param lateSymbols The late-bound symbols of the parent.
* @param decl The member to bind.
*/
function lateBindMember(parent, earlySymbols, lateSymbols, decl) {
ts.Debug.assert(!!decl.symbol, "The member is expected to have a symbol.");
var links = getNodeLinks(decl);
if (!links.resolvedSymbol) {
// In the event we attempt to resolve the late-bound name of this member recursively,
// fall back to the early-bound name of this member.
links.resolvedSymbol = decl.symbol;
var declName = ts.isBinaryExpression(decl) ? decl.left : decl.name;
var type = ts.isElementAccessExpression(declName) ? checkExpressionCached(declName.argumentExpression) : checkComputedPropertyName(declName);
if (isTypeUsableAsPropertyName(type)) {
var memberName = getPropertyNameFromType(type);
var symbolFlags = decl.symbol.flags;
// Get or add a late-bound symbol for the member. This allows us to merge late-bound accessor declarations.
var lateSymbol = lateSymbols.get(memberName);
if (!lateSymbol)
lateSymbols.set(memberName, lateSymbol = createSymbol(0 /* None */, memberName, 4096 /* Late */));
// Report an error if a late-bound member has the same name as an early-bound member,
// or if we have another early-bound symbol declaration with the same name and
// conflicting flags.
var earlySymbol = earlySymbols && earlySymbols.get(memberName);
if (lateSymbol.flags & getExcludedSymbolFlags(symbolFlags) || earlySymbol) {
// If we have an existing early-bound member, combine its declarations so that we can
// report an error at each declaration.
var declarations = earlySymbol ? ts.concatenate(earlySymbol.declarations, lateSymbol.declarations) : lateSymbol.declarations;
var name_4 = !(type.flags & 8192 /* UniqueESSymbol */) && ts.unescapeLeadingUnderscores(memberName) || ts.declarationNameToString(declName);
ts.forEach(declarations, function (declaration) { return error(ts.getNameOfDeclaration(declaration) || declaration, ts.Diagnostics.Property_0_was_also_declared_here, name_4); });
error(declName || decl, ts.Diagnostics.Duplicate_property_0, name_4);
lateSymbol = createSymbol(0 /* None */, memberName, 4096 /* Late */);
}
lateSymbol.nameType = type;
addDeclarationToLateBoundSymbol(lateSymbol, decl, symbolFlags);
if (lateSymbol.parent) {
ts.Debug.assert(lateSymbol.parent === parent, "Existing symbol parent should match new one");
}
else {
lateSymbol.parent = parent;
}
return links.resolvedSymbol = lateSymbol;
}
}
return links.resolvedSymbol;
}
function getResolvedMembersOrExportsOfSymbol(symbol, resolutionKind) {
var links = getSymbolLinks(symbol);
if (!links[resolutionKind]) {
var isStatic_1 = resolutionKind === "resolvedExports" /* resolvedExports */;
var earlySymbols = !isStatic_1 ? symbol.members :
symbol.flags & 1536 /* Module */ ? getExportsOfModuleWorker(symbol) :
symbol.exports;
// In the event we recursively resolve the members/exports of the symbol, we
// set the initial value of resolvedMembers/resolvedExports to the early-bound
// members/exports of the symbol.
links[resolutionKind] = earlySymbols || emptySymbols;
// fill in any as-yet-unresolved late-bound members.
var lateSymbols = ts.createSymbolTable();
for (var _i = 0, _a = symbol.declarations || ts.emptyArray; _i < _a.length; _i++) {
var decl = _a[_i];
var members = ts.getMembersOfDeclaration(decl);
if (members) {
for (var _b = 0, members_5 = members; _b < members_5.length; _b++) {
var member = members_5[_b];
if (isStatic_1 === ts.hasStaticModifier(member) && hasLateBindableName(member)) {
lateBindMember(symbol, earlySymbols, lateSymbols, member);
}
}
}
}
var assignments = symbol.assignmentDeclarationMembers;
if (assignments) {
var decls = ts.arrayFrom(assignments.values());
for (var _c = 0, decls_1 = decls; _c < decls_1.length; _c++) {
var member = decls_1[_c];
var assignmentKind = ts.getAssignmentDeclarationKind(member);
var isInstanceMember = assignmentKind === 3 /* PrototypeProperty */
|| ts.isBinaryExpression(member) && isPossiblyAliasedThisProperty(member, assignmentKind)
|| assignmentKind === 9 /* ObjectDefinePrototypeProperty */
|| assignmentKind === 6 /* Prototype */; // A straight `Prototype` assignment probably can never have a computed name
if (isStatic_1 === !isInstanceMember && hasLateBindableName(member)) {
lateBindMember(symbol, earlySymbols, lateSymbols, member);
}
}
}
links[resolutionKind] = combineSymbolTables(earlySymbols, lateSymbols) || emptySymbols;
}
return links[resolutionKind];
}
/**
* Gets a SymbolTable containing both the early- and late-bound members of a symbol.
*
* For a description of late-binding, see `lateBindMember`.
*/
function getMembersOfSymbol(symbol) {
return symbol.flags & 6256 /* LateBindingContainer */
? getResolvedMembersOrExportsOfSymbol(symbol, "resolvedMembers" /* resolvedMembers */)
: symbol.members || emptySymbols;
}
/**
* If a symbol is the dynamic name of the member of an object type, get the late-bound
* symbol of the member.
*
* For a description of late-binding, see `lateBindMember`.
*/
function getLateBoundSymbol(symbol) {
if (symbol.flags & 106500 /* ClassMember */ && symbol.escapedName === "__computed" /* Computed */) {
var links = getSymbolLinks(symbol);
if (!links.lateSymbol && ts.some(symbol.declarations, hasLateBindableName)) {
// force late binding of members/exports. This will set the late-bound symbol
var parent = getMergedSymbol(symbol.parent);
if (ts.some(symbol.declarations, ts.hasStaticModifier)) {
getExportsOfSymbol(parent);
}
else {
getMembersOfSymbol(parent);
}
}
return links.lateSymbol || (links.lateSymbol = symbol);
}
return symbol;
}
function getTypeWithThisArgument(type, thisArgument, needApparentType) {
if (ts.getObjectFlags(type) & 4 /* Reference */) {
var target = type.target;
var typeArguments = getTypeArguments(type);
if (ts.length(target.typeParameters) === ts.length(typeArguments)) {
var ref = createTypeReference(target, ts.concatenate(typeArguments, [thisArgument || target.thisType]));
return needApparentType ? getApparentType(ref) : ref;
}
}
else if (type.flags & 2097152 /* Intersection */) {
var types = ts.sameMap(type.types, function (t) { return getTypeWithThisArgument(t, thisArgument, needApparentType); });
return types !== type.types ? getIntersectionType(types) : type;
}
return needApparentType ? getApparentType(type) : type;
}
function resolveObjectTypeMembers(type, source, typeParameters, typeArguments) {
var mapper;
var members;
var callSignatures;
var constructSignatures;
var indexInfos;
if (ts.rangeEquals(typeParameters, typeArguments, 0, typeParameters.length)) {
members = source.symbol ? getMembersOfSymbol(source.symbol) : ts.createSymbolTable(source.declaredProperties);
callSignatures = source.declaredCallSignatures;
constructSignatures = source.declaredConstructSignatures;
indexInfos = source.declaredIndexInfos;
}
else {
mapper = createTypeMapper(typeParameters, typeArguments);
members = createInstantiatedSymbolTable(source.declaredProperties, mapper, /*mappingThisOnly*/ typeParameters.length === 1);
callSignatures = instantiateSignatures(source.declaredCallSignatures, mapper);
constructSignatures = instantiateSignatures(source.declaredConstructSignatures, mapper);
indexInfos = instantiateIndexInfos(source.declaredIndexInfos, mapper);
}
var baseTypes = getBaseTypes(source);
if (baseTypes.length) {
if (source.symbol && members === getMembersOfSymbol(source.symbol)) {
members = ts.createSymbolTable(source.declaredProperties);
}
setStructuredTypeMembers(type, members, callSignatures, constructSignatures, indexInfos);
var thisArgument = ts.lastOrUndefined(typeArguments);
for (var _i = 0, baseTypes_1 = baseTypes; _i < baseTypes_1.length; _i++) {
var baseType = baseTypes_1[_i];
var instantiatedBaseType = thisArgument ? getTypeWithThisArgument(instantiateType(baseType, mapper), thisArgument) : baseType;
addInheritedMembers(members, getPropertiesOfType(instantiatedBaseType));
callSignatures = ts.concatenate(callSignatures, getSignaturesOfType(instantiatedBaseType, 0 /* Call */));
constructSignatures = ts.concatenate(constructSignatures, getSignaturesOfType(instantiatedBaseType, 1 /* Construct */));
var inheritedIndexInfos = instantiatedBaseType !== anyType ? getIndexInfosOfType(instantiatedBaseType) : [createIndexInfo(stringType, anyType, /*isReadonly*/ false)];
indexInfos = ts.concatenate(indexInfos, ts.filter(inheritedIndexInfos, function (info) { return !findIndexInfo(indexInfos, info.keyType); }));
}
}
setStructuredTypeMembers(type, members, callSignatures, constructSignatures, indexInfos);
}
function resolveClassOrInterfaceMembers(type) {
resolveObjectTypeMembers(type, resolveDeclaredMembers(type), ts.emptyArray, ts.emptyArray);
}
function resolveTypeReferenceMembers(type) {
var source = resolveDeclaredMembers(type.target);
var typeParameters = ts.concatenate(source.typeParameters, [source.thisType]);
var typeArguments = getTypeArguments(type);
var paddedTypeArguments = typeArguments.length === typeParameters.length ? typeArguments : ts.concatenate(typeArguments, [type]);
resolveObjectTypeMembers(type, source, typeParameters, paddedTypeArguments);
}
function createSignature(declaration, typeParameters, thisParameter, parameters, resolvedReturnType, resolvedTypePredicate, minArgumentCount, flags) {
var sig = new Signature(checker, flags);
sig.declaration = declaration;
sig.typeParameters = typeParameters;
sig.parameters = parameters;
sig.thisParameter = thisParameter;
sig.resolvedReturnType = resolvedReturnType;
sig.resolvedTypePredicate = resolvedTypePredicate;
sig.minArgumentCount = minArgumentCount;
sig.resolvedMinArgumentCount = undefined;
sig.target = undefined;
sig.mapper = undefined;
sig.compositeSignatures = undefined;
sig.compositeKind = undefined;
return sig;
}
function cloneSignature(sig) {
var result = createSignature(sig.declaration, sig.typeParameters, sig.thisParameter, sig.parameters, /*resolvedReturnType*/ undefined,
/*resolvedTypePredicate*/ undefined, sig.minArgumentCount, sig.flags & 39 /* PropagatingFlags */);
result.target = sig.target;
result.mapper = sig.mapper;
result.compositeSignatures = sig.compositeSignatures;
result.compositeKind = sig.compositeKind;
return result;
}
function createUnionSignature(signature, unionSignatures) {
var result = cloneSignature(signature);
result.compositeSignatures = unionSignatures;
result.compositeKind = 1048576 /* Union */;
result.target = undefined;
result.mapper = undefined;
return result;
}
function getOptionalCallSignature(signature, callChainFlags) {
if ((signature.flags & 24 /* CallChainFlags */) === callChainFlags) {
return signature;
}
if (!signature.optionalCallSignatureCache) {
signature.optionalCallSignatureCache = {};
}
var key = callChainFlags === 8 /* IsInnerCallChain */ ? "inner" : "outer";
return signature.optionalCallSignatureCache[key]
|| (signature.optionalCallSignatureCache[key] = createOptionalCallSignature(signature, callChainFlags));
}
function createOptionalCallSignature(signature, callChainFlags) {
ts.Debug.assert(callChainFlags === 8 /* IsInnerCallChain */ || callChainFlags === 16 /* IsOuterCallChain */, "An optional call signature can either be for an inner call chain or an outer call chain, but not both.");
var result = cloneSignature(signature);
result.flags |= callChainFlags;
return result;
}
function getExpandedParameters(sig, skipUnionExpanding) {
if (signatureHasRestParameter(sig)) {
var restIndex_1 = sig.parameters.length - 1;
var restType = getTypeOfSymbol(sig.parameters[restIndex_1]);
if (isTupleType(restType)) {
return [expandSignatureParametersWithTupleMembers(restType, restIndex_1)];
}
else if (!skipUnionExpanding && restType.flags & 1048576 /* Union */ && ts.every(restType.types, isTupleType)) {
return ts.map(restType.types, function (t) { return expandSignatureParametersWithTupleMembers(t, restIndex_1); });
}
}
return [sig.parameters];
function expandSignatureParametersWithTupleMembers(restType, restIndex) {
var elementTypes = getTypeArguments(restType);
var associatedNames = restType.target.labeledElementDeclarations;
var restParams = ts.map(elementTypes, function (t, i) {
// Lookup the label from the individual tuple passed in before falling back to the signature `rest` parameter name
var tupleLabelName = !!associatedNames && getTupleElementLabel(associatedNames[i]);
var name = tupleLabelName || getParameterNameAtPosition(sig, restIndex + i, restType);
var flags = restType.target.elementFlags[i];
var checkFlags = flags & 12 /* Variable */ ? 32768 /* RestParameter */ :
flags & 2 /* Optional */ ? 16384 /* OptionalParameter */ : 0;
var symbol = createSymbol(1 /* FunctionScopedVariable */, name, checkFlags);
symbol.type = flags & 4 /* Rest */ ? createArrayType(t) : t;
return symbol;
});
return ts.concatenate(sig.parameters.slice(0, restIndex), restParams);
}
}
function getDefaultConstructSignatures(classType) {
var baseConstructorType = getBaseConstructorTypeOfClass(classType);
var baseSignatures = getSignaturesOfType(baseConstructorType, 1 /* Construct */);
var declaration = ts.getClassLikeDeclarationOfSymbol(classType.symbol);
var isAbstract = !!declaration && ts.hasSyntacticModifier(declaration, 128 /* Abstract */);
if (baseSignatures.length === 0) {
return [createSignature(undefined, classType.localTypeParameters, undefined, ts.emptyArray, classType, /*resolvedTypePredicate*/ undefined, 0, isAbstract ? 4 /* Abstract */ : 0 /* None */)];
}
var baseTypeNode = getBaseTypeNodeOfClass(classType);
var isJavaScript = ts.isInJSFile(baseTypeNode);
var typeArguments = typeArgumentsFromTypeReferenceNode(baseTypeNode);
var typeArgCount = ts.length(typeArguments);
var result = [];
for (var _i = 0, baseSignatures_1 = baseSignatures; _i < baseSignatures_1.length; _i++) {
var baseSig = baseSignatures_1[_i];
var minTypeArgumentCount = getMinTypeArgumentCount(baseSig.typeParameters);
var typeParamCount = ts.length(baseSig.typeParameters);
if (isJavaScript || typeArgCount >= minTypeArgumentCount && typeArgCount <= typeParamCount) {
var sig = typeParamCount ? createSignatureInstantiation(baseSig, fillMissingTypeArguments(typeArguments, baseSig.typeParameters, minTypeArgumentCount, isJavaScript)) : cloneSignature(baseSig);
sig.typeParameters = classType.localTypeParameters;
sig.resolvedReturnType = classType;
sig.flags = isAbstract ? sig.flags | 4 /* Abstract */ : sig.flags & ~4 /* Abstract */;
result.push(sig);
}
}
return result;
}
function findMatchingSignature(signatureList, signature, partialMatch, ignoreThisTypes, ignoreReturnTypes) {
for (var _i = 0, signatureList_1 = signatureList; _i < signatureList_1.length; _i++) {
var s = signatureList_1[_i];
if (compareSignaturesIdentical(s, signature, partialMatch, ignoreThisTypes, ignoreReturnTypes, partialMatch ? compareTypesSubtypeOf : compareTypesIdentical)) {
return s;
}
}
}
function findMatchingSignatures(signatureLists, signature, listIndex) {
if (signature.typeParameters) {
// We require an exact match for generic signatures, so we only return signatures from the first
// signature list and only if they have exact matches in the other signature lists.
if (listIndex > 0) {
return undefined;
}
for (var i = 1; i < signatureLists.length; i++) {
if (!findMatchingSignature(signatureLists[i], signature, /*partialMatch*/ false, /*ignoreThisTypes*/ false, /*ignoreReturnTypes*/ false)) {
return undefined;
}
}
return [signature];
}
var result;
for (var i = 0; i < signatureLists.length; i++) {
// Allow matching non-generic signatures to have excess parameters and different return types.
// Prefer matching this types if possible.
var match = i === listIndex ? signature : findMatchingSignature(signatureLists[i], signature, /*partialMatch*/ true, /*ignoreThisTypes*/ false, /*ignoreReturnTypes*/ true);
if (!match) {
return undefined;
}
result = ts.appendIfUnique(result, match);
}
return result;
}
// The signatures of a union type are those signatures that are present in each of the constituent types.
// Generic signatures must match exactly, but non-generic signatures are allowed to have extra optional
// parameters and may differ in return types. When signatures differ in return types, the resulting return
// type is the union of the constituent return types.
function getUnionSignatures(signatureLists) {
var result;
var indexWithLengthOverOne;
for (var i = 0; i < signatureLists.length; i++) {
if (signatureLists[i].length === 0)
return ts.emptyArray;
if (signatureLists[i].length > 1) {
indexWithLengthOverOne = indexWithLengthOverOne === undefined ? i : -1; // -1 is a signal there are multiple overload sets
}
for (var _i = 0, _a = signatureLists[i]; _i < _a.length; _i++) {
var signature = _a[_i];
// Only process signatures with parameter lists that aren't already in the result list
if (!result || !findMatchingSignature(result, signature, /*partialMatch*/ false, /*ignoreThisTypes*/ false, /*ignoreReturnTypes*/ true)) {
var unionSignatures = findMatchingSignatures(signatureLists, signature, i);
if (unionSignatures) {
var s = signature;
// Union the result types when more than one signature matches
if (unionSignatures.length > 1) {
var thisParameter = signature.thisParameter;
var firstThisParameterOfUnionSignatures = ts.forEach(unionSignatures, function (sig) { return sig.thisParameter; });
if (firstThisParameterOfUnionSignatures) {
var thisType = getIntersectionType(ts.mapDefined(unionSignatures, function (sig) { return sig.thisParameter && getTypeOfSymbol(sig.thisParameter); }));
thisParameter = createSymbolWithType(firstThisParameterOfUnionSignatures, thisType);
}
s = createUnionSignature(signature, unionSignatures);
s.thisParameter = thisParameter;
}
(result || (result = [])).push(s);
}
}
}
}
if (!ts.length(result) && indexWithLengthOverOne !== -1) {
// No sufficiently similar signature existed to subsume all the other signatures in the union - time to see if we can make a single
// signature that handles all over them. We only do this when there are overloads in only one constituent.
// (Overloads are conditional in nature and having overloads in multiple constituents would necessitate making a power set of
// signatures from the type, whose ordering would be non-obvious)
var masterList = signatureLists[indexWithLengthOverOne !== undefined ? indexWithLengthOverOne : 0];
var results = masterList.slice();
var _loop_10 = function (signatures) {
if (signatures !== masterList) {
var signature_1 = signatures[0];
ts.Debug.assert(!!signature_1, "getUnionSignatures bails early on empty signature lists and should not have empty lists on second pass");
results = !!signature_1.typeParameters && ts.some(results, function (s) { return !!s.typeParameters && !compareTypeParametersIdentical(signature_1.typeParameters, s.typeParameters); }) ? undefined : ts.map(results, function (sig) { return combineSignaturesOfUnionMembers(sig, signature_1); });
if (!results) {
return "break";
}
}
};
for (var _b = 0, signatureLists_1 = signatureLists; _b < signatureLists_1.length; _b++) {
var signatures = signatureLists_1[_b];
var state_3 = _loop_10(signatures);
if (state_3 === "break")
break;
}
result = results;
}
return result || ts.emptyArray;
}
function compareTypeParametersIdentical(sourceParams, targetParams) {
if (ts.length(sourceParams) !== ts.length(targetParams)) {
return false;
}
if (!sourceParams || !targetParams) {
return true;
}
var mapper = createTypeMapper(targetParams, sourceParams);
for (var i = 0; i < sourceParams.length; i++) {
var source = sourceParams[i];
var target = targetParams[i];
if (source === target)
continue;
// We instantiate the target type parameter constraints into the source types so we can recognize `<T, U extends T>` as the same as `<A, B extends A>`
if (!isTypeIdenticalTo(getConstraintFromTypeParameter(source) || unknownType, instantiateType(getConstraintFromTypeParameter(target) || unknownType, mapper)))
return false;
// We don't compare defaults - we just use the type parameter defaults from the first signature that seems to match.
// It might make sense to combine these defaults in the future, but doing so intelligently requires knowing
// if the parameter is used covariantly or contravariantly (so we intersect if it's used like a parameter or union if used like a return type)
// and, since it's just an inference _default_, just picking one arbitrarily works OK.
}
return true;
}
function combineUnionThisParam(left, right, mapper) {
if (!left || !right) {
return left || right;
}
// A signature `this` type might be a read or a write position... It's very possible that it should be invariant
// and we should refuse to merge signatures if there are `this` types and they do not match. However, so as to be
// permissive when calling, for now, we'll intersect the `this` types just like we do for param types in union signatures.
var thisType = getIntersectionType([getTypeOfSymbol(left), instantiateType(getTypeOfSymbol(right), mapper)]);
return createSymbolWithType(left, thisType);
}
function combineUnionParameters(left, right, mapper) {
var leftCount = getParameterCount(left);
var rightCount = getParameterCount(right);
var longest = leftCount >= rightCount ? left : right;
var shorter = longest === left ? right : left;
var longestCount = longest === left ? leftCount : rightCount;
var eitherHasEffectiveRest = (hasEffectiveRestParameter(left) || hasEffectiveRestParameter(right));
var needsExtraRestElement = eitherHasEffectiveRest && !hasEffectiveRestParameter(longest);
var params = new Array(longestCount + (needsExtraRestElement ? 1 : 0));
for (var i = 0; i < longestCount; i++) {
var longestParamType = tryGetTypeAtPosition(longest, i);
if (longest === right) {
longestParamType = instantiateType(longestParamType, mapper);
}
var shorterParamType = tryGetTypeAtPosition(shorter, i) || unknownType;
if (shorter === right) {
shorterParamType = instantiateType(shorterParamType, mapper);
}
var unionParamType = getIntersectionType([longestParamType, shorterParamType]);
var isRestParam = eitherHasEffectiveRest && !needsExtraRestElement && i === (longestCount - 1);
var isOptional = i >= getMinArgumentCount(longest) && i >= getMinArgumentCount(shorter);
var leftName = i >= leftCount ? undefined : getParameterNameAtPosition(left, i);
var rightName = i >= rightCount ? undefined : getParameterNameAtPosition(right, i);
var paramName = leftName === rightName ? leftName :
!leftName ? rightName :
!rightName ? leftName :
undefined;
var paramSymbol = createSymbol(1 /* FunctionScopedVariable */ | (isOptional && !isRestParam ? 16777216 /* Optional */ : 0), paramName || "arg" + i);
paramSymbol.type = isRestParam ? createArrayType(unionParamType) : unionParamType;
params[i] = paramSymbol;
}
if (needsExtraRestElement) {
var restParamSymbol = createSymbol(1 /* FunctionScopedVariable */, "args");
restParamSymbol.type = createArrayType(getTypeAtPosition(shorter, longestCount));
if (shorter === right) {
restParamSymbol.type = instantiateType(restParamSymbol.type, mapper);
}
params[longestCount] = restParamSymbol;
}
return params;
}
function combineSignaturesOfUnionMembers(left, right) {
var typeParams = left.typeParameters || right.typeParameters;
var paramMapper;
if (left.typeParameters && right.typeParameters) {
paramMapper = createTypeMapper(right.typeParameters, left.typeParameters);
// We just use the type parameter defaults from the first signature
}
var declaration = left.declaration;
var params = combineUnionParameters(left, right, paramMapper);
var thisParam = combineUnionThisParam(left.thisParameter, right.thisParameter, paramMapper);
var minArgCount = Math.max(left.minArgumentCount, right.minArgumentCount);
var result = createSignature(declaration, typeParams, thisParam, params,
/*resolvedReturnType*/ undefined,
/*resolvedTypePredicate*/ undefined, minArgCount, (left.flags | right.flags) & 39 /* PropagatingFlags */);
result.compositeKind = 1048576 /* Union */;
result.compositeSignatures = ts.concatenate(left.compositeKind !== 2097152 /* Intersection */ && left.compositeSignatures || [left], [right]);
if (paramMapper) {
result.mapper = left.compositeKind !== 2097152 /* Intersection */ && left.mapper && left.compositeSignatures ? combineTypeMappers(left.mapper, paramMapper) : paramMapper;
}
return result;
}
function getUnionIndexInfos(types) {
var sourceInfos = getIndexInfosOfType(types[0]);
if (sourceInfos) {
var result = [];
var _loop_11 = function (info) {
var indexType = info.keyType;
if (ts.every(types, function (t) { return !!getIndexInfoOfType(t, indexType); })) {
result.push(createIndexInfo(indexType, getUnionType(ts.map(types, function (t) { return getIndexTypeOfType(t, indexType); })), ts.some(types, function (t) { return getIndexInfoOfType(t, indexType).isReadonly; })));
}
};
for (var _i = 0, sourceInfos_1 = sourceInfos; _i < sourceInfos_1.length; _i++) {
var info = sourceInfos_1[_i];
_loop_11(info);
}
return result;
}
return ts.emptyArray;
}
function resolveUnionTypeMembers(type) {
// The members and properties collections are empty for union types. To get all properties of a union
// type use getPropertiesOfType (only the language service uses this).
var callSignatures = getUnionSignatures(ts.map(type.types, function (t) { return t === globalFunctionType ? [unknownSignature] : getSignaturesOfType(t, 0 /* Call */); }));
var constructSignatures = getUnionSignatures(ts.map(type.types, function (t) { return getSignaturesOfType(t, 1 /* Construct */); }));
var indexInfos = getUnionIndexInfos(type.types);
setStructuredTypeMembers(type, emptySymbols, callSignatures, constructSignatures, indexInfos);
}
function intersectTypes(type1, type2) {
return !type1 ? type2 : !type2 ? type1 : getIntersectionType([type1, type2]);
}
function findMixins(types) {
var constructorTypeCount = ts.countWhere(types, function (t) { return getSignaturesOfType(t, 1 /* Construct */).length > 0; });
var mixinFlags = ts.map(types, isMixinConstructorType);
if (constructorTypeCount > 0 && constructorTypeCount === ts.countWhere(mixinFlags, function (b) { return b; })) {
var firstMixinIndex = mixinFlags.indexOf(/*searchElement*/ true);
mixinFlags[firstMixinIndex] = false;
}
return mixinFlags;
}
function includeMixinType(type, types, mixinFlags, index) {
var mixedTypes = [];
for (var i = 0; i < types.length; i++) {
if (i === index) {
mixedTypes.push(type);
}
else if (mixinFlags[i]) {
mixedTypes.push(getReturnTypeOfSignature(getSignaturesOfType(types[i], 1 /* Construct */)[0]));
}
}
return getIntersectionType(mixedTypes);
}
function resolveIntersectionTypeMembers(type) {
// The members and properties collections are empty for intersection types. To get all properties of an
// intersection type use getPropertiesOfType (only the language service uses this).
var callSignatures;
var constructSignatures;
var indexInfos;
var types = type.types;
var mixinFlags = findMixins(types);
var mixinCount = ts.countWhere(mixinFlags, function (b) { return b; });
var _loop_12 = function (i) {
var t = type.types[i];
// When an intersection type contains mixin constructor types, the construct signatures from
// those types are discarded and their return types are mixed into the return types of all
// other construct signatures in the intersection type. For example, the intersection type
// '{ new(...args: any[]) => A } & { new(s: string) => B }' has a single construct signature
// 'new(s: string) => A & B'.
if (!mixinFlags[i]) {
var signatures = getSignaturesOfType(t, 1 /* Construct */);
if (signatures.length && mixinCount > 0) {
signatures = ts.map(signatures, function (s) {
var clone = cloneSignature(s);
clone.resolvedReturnType = includeMixinType(getReturnTypeOfSignature(s), types, mixinFlags, i);
return clone;
});
}
constructSignatures = appendSignatures(constructSignatures, signatures);
}
callSignatures = appendSignatures(callSignatures, getSignaturesOfType(t, 0 /* Call */));
indexInfos = ts.reduceLeft(getIndexInfosOfType(t), function (infos, newInfo) { return appendIndexInfo(infos, newInfo, /*union*/ false); }, indexInfos);
};
for (var i = 0; i < types.length; i++) {
_loop_12(i);
}
setStructuredTypeMembers(type, emptySymbols, callSignatures || ts.emptyArray, constructSignatures || ts.emptyArray, indexInfos || ts.emptyArray);
}
function appendSignatures(signatures, newSignatures) {
var _loop_13 = function (sig) {
if (!signatures || ts.every(signatures, function (s) { return !compareSignaturesIdentical(s, sig, /*partialMatch*/ false, /*ignoreThisTypes*/ false, /*ignoreReturnTypes*/ false, compareTypesIdentical); })) {
signatures = ts.append(signatures, sig);
}
};
for (var _i = 0, newSignatures_1 = newSignatures; _i < newSignatures_1.length; _i++) {
var sig = newSignatures_1[_i];
_loop_13(sig);
}
return signatures;
}
function appendIndexInfo(indexInfos, newInfo, union) {
if (indexInfos) {
for (var i = 0; i < indexInfos.length; i++) {
var info = indexInfos[i];
if (info.keyType === newInfo.keyType) {
indexInfos[i] = createIndexInfo(info.keyType, union ? getUnionType([info.type, newInfo.type]) : getIntersectionType([info.type, newInfo.type]), union ? info.isReadonly || newInfo.isReadonly : info.isReadonly && newInfo.isReadonly);
return indexInfos;
}
}
}
return ts.append(indexInfos, newInfo);
}
/**
* Converts an AnonymousType to a ResolvedType.
*/
function resolveAnonymousTypeMembers(type) {
var symbol = getMergedSymbol(type.symbol);
if (type.target) {
setStructuredTypeMembers(type, emptySymbols, ts.emptyArray, ts.emptyArray, ts.emptyArray);
var members = createInstantiatedSymbolTable(getPropertiesOfObjectType(type.target), type.mapper, /*mappingThisOnly*/ false);
var callSignatures = instantiateSignatures(getSignaturesOfType(type.target, 0 /* Call */), type.mapper);
var constructSignatures = instantiateSignatures(getSignaturesOfType(type.target, 1 /* Construct */), type.mapper);
var indexInfos = instantiateIndexInfos(getIndexInfosOfType(type.target), type.mapper);
setStructuredTypeMembers(type, members, callSignatures, constructSignatures, indexInfos);
}
else if (symbol.flags & 2048 /* TypeLiteral */) {
setStructuredTypeMembers(type, emptySymbols, ts.emptyArray, ts.emptyArray, ts.emptyArray);
var members = getMembersOfSymbol(symbol);
var callSignatures = getSignaturesOfSymbol(members.get("__call" /* Call */));
var constructSignatures = getSignaturesOfSymbol(members.get("__new" /* New */));
var indexInfos = getIndexInfosOfSymbol(symbol);
setStructuredTypeMembers(type, members, callSignatures, constructSignatures, indexInfos);
}
else {
// Combinations of function, class, enum and module
var members = emptySymbols;
var indexInfos = void 0;
if (symbol.exports) {
members = getExportsOfSymbol(symbol);
if (symbol === globalThisSymbol) {
var varsOnly_1 = new ts.Map();
members.forEach(function (p) {
if (!(p.flags & 418 /* BlockScoped */)) {
varsOnly_1.set(p.escapedName, p);
}
});
members = varsOnly_1;
}
}
var baseConstructorIndexInfo = void 0;
setStructuredTypeMembers(type, members, ts.emptyArray, ts.emptyArray, ts.emptyArray);
if (symbol.flags & 32 /* Class */) {
var classType = getDeclaredTypeOfClassOrInterface(symbol);
var baseConstructorType = getBaseConstructorTypeOfClass(classType);
if (baseConstructorType.flags & (524288 /* Object */ | 2097152 /* Intersection */ | 8650752 /* TypeVariable */)) {
members = ts.createSymbolTable(getNamedOrIndexSignatureMembers(members));
addInheritedMembers(members, getPropertiesOfType(baseConstructorType));
}
else if (baseConstructorType === anyType) {
baseConstructorIndexInfo = createIndexInfo(stringType, anyType, /*isReadonly*/ false);
}
}
var indexSymbol = getIndexSymbolFromSymbolTable(members);
if (indexSymbol) {
indexInfos = getIndexInfosOfIndexSymbol(indexSymbol);
}
else {
if (baseConstructorIndexInfo) {
indexInfos = ts.append(indexInfos, baseConstructorIndexInfo);
}
if (symbol.flags & 384 /* Enum */ && (getDeclaredTypeOfSymbol(symbol).flags & 32 /* Enum */ ||
ts.some(type.properties, function (prop) { return !!(getTypeOfSymbol(prop).flags & 296 /* NumberLike */); }))) {
indexInfos = ts.append(indexInfos, enumNumberIndexInfo);
}
}
setStructuredTypeMembers(type, members, ts.emptyArray, ts.emptyArray, indexInfos || ts.emptyArray);
// We resolve the members before computing the signatures because a signature may use
// typeof with a qualified name expression that circularly references the type we are
// in the process of resolving (see issue #6072). The temporarily empty signature list
// will never be observed because a qualified name can't reference signatures.
if (symbol.flags & (16 /* Function */ | 8192 /* Method */)) {
type.callSignatures = getSignaturesOfSymbol(symbol);
}
// And likewise for construct signatures for classes
if (symbol.flags & 32 /* Class */) {
var classType_1 = getDeclaredTypeOfClassOrInterface(symbol);
var constructSignatures = symbol.members ? getSignaturesOfSymbol(symbol.members.get("__constructor" /* Constructor */)) : ts.emptyArray;
if (symbol.flags & 16 /* Function */) {
constructSignatures = ts.addRange(constructSignatures.slice(), ts.mapDefined(type.callSignatures, function (sig) { return isJSConstructor(sig.declaration) ?
createSignature(sig.declaration, sig.typeParameters, sig.thisParameter, sig.parameters, classType_1, /*resolvedTypePredicate*/ undefined, sig.minArgumentCount, sig.flags & 39 /* PropagatingFlags */) :
undefined; }));
}
if (!constructSignatures.length) {
constructSignatures = getDefaultConstructSignatures(classType_1);
}
type.constructSignatures = constructSignatures;
}
}
}
function replaceIndexedAccess(instantiable, type, replacement) {
// map type.indexType to 0
// map type.objectType to `[TReplacement]`
// thus making the indexed access `[TReplacement][0]` or `TReplacement`
return instantiateType(instantiable, createTypeMapper([type.indexType, type.objectType], [getNumberLiteralType(0), createTupleType([replacement])]));
}
function resolveReverseMappedTypeMembers(type) {
var indexInfo = getIndexInfoOfType(type.source, stringType);
var modifiers = getMappedTypeModifiers(type.mappedType);
var readonlyMask = modifiers & 1 /* IncludeReadonly */ ? false : true;
var optionalMask = modifiers & 4 /* IncludeOptional */ ? 0 : 16777216 /* Optional */;
var indexInfos = indexInfo ? [createIndexInfo(stringType, inferReverseMappedType(indexInfo.type, type.mappedType, type.constraintType), readonlyMask && indexInfo.isReadonly)] : ts.emptyArray;
var members = ts.createSymbolTable();
for (var _i = 0, _a = getPropertiesOfType(type.source); _i < _a.length; _i++) {
var prop = _a[_i];
var checkFlags = 8192 /* ReverseMapped */ | (readonlyMask && isReadonlySymbol(prop) ? 8 /* Readonly */ : 0);
var inferredProp = createSymbol(4 /* Property */ | prop.flags & optionalMask, prop.escapedName, checkFlags);
inferredProp.declarations = prop.declarations;
inferredProp.nameType = getSymbolLinks(prop).nameType;
inferredProp.propertyType = getTypeOfSymbol(prop);
if (type.constraintType.type.flags & 8388608 /* IndexedAccess */
&& type.constraintType.type.objectType.flags & 262144 /* TypeParameter */
&& type.constraintType.type.indexType.flags & 262144 /* TypeParameter */) {
// A reverse mapping of `{[K in keyof T[K_1]]: T[K_1]}` is the same as that of `{[K in keyof T]: T}`, since all we care about is
// inferring to the "type parameter" (or indexed access) shared by the constraint and template. So, to reduce the number of
// type identities produced, we simplify such indexed access occurences
var newTypeParam = type.constraintType.type.objectType;
var newMappedType = replaceIndexedAccess(type.mappedType, type.constraintType.type, newTypeParam);
inferredProp.mappedType = newMappedType;
inferredProp.constraintType = getIndexType(newTypeParam);
}
else {
inferredProp.mappedType = type.mappedType;
inferredProp.constraintType = type.constraintType;
}
members.set(prop.escapedName, inferredProp);
}
setStructuredTypeMembers(type, members, ts.emptyArray, ts.emptyArray, indexInfos);
}
// Return the lower bound of the key type in a mapped type. Intuitively, the lower
// bound includes those keys that are known to always be present, for example because
// because of constraints on type parameters (e.g. 'keyof T' for a constrained T).
function getLowerBoundOfKeyType(type) {
if (type.flags & 4194304 /* Index */) {
var t = getApparentType(type.type);
return isGenericTupleType(t) ? getKnownKeysOfTupleType(t) : getIndexType(t);
}
if (type.flags & 16777216 /* Conditional */) {
if (type.root.isDistributive) {
var checkType = type.checkType;
var constraint = getLowerBoundOfKeyType(checkType);
if (constraint !== checkType) {
return getConditionalTypeInstantiation(type, prependTypeMapping(type.root.checkType, constraint, type.mapper));
}
}
return type;
}
if (type.flags & 1048576 /* Union */) {
return mapType(type, getLowerBoundOfKeyType);
}
if (type.flags & 2097152 /* Intersection */) {
return getIntersectionType(ts.sameMap(type.types, getLowerBoundOfKeyType));
}
return type;
}
function getIsLateCheckFlag(s) {
return ts.getCheckFlags(s) & 4096 /* Late */;
}
/** Resolve the members of a mapped type { [P in K]: T } */
function resolveMappedTypeMembers(type) {
var members = ts.createSymbolTable();
var indexInfos;
// Resolve upfront such that recursive references see an empty object type.
setStructuredTypeMembers(type, emptySymbols, ts.emptyArray, ts.emptyArray, ts.emptyArray);
// In { [P in K]: T }, we refer to P as the type parameter type, K as the constraint type,
// and T as the template type.
var typeParameter = getTypeParameterFromMappedType(type);
var constraintType = getConstraintTypeFromMappedType(type);
var nameType = getNameTypeFromMappedType(type.target || type);
var templateType = getTemplateTypeFromMappedType(type.target || type);
var modifiersType = getApparentType(getModifiersTypeFromMappedType(type)); // The 'T' in 'keyof T'
var templateModifiers = getMappedTypeModifiers(type);
var include = keyofStringsOnly ? 128 /* StringLiteral */ : 8576 /* StringOrNumberLiteralOrUnique */;
if (isMappedTypeWithKeyofConstraintDeclaration(type)) {
// We have a { [P in keyof T]: X }
for (var _i = 0, _a = getPropertiesOfType(modifiersType); _i < _a.length; _i++) {
var prop = _a[_i];
addMemberForKeyType(getLiteralTypeFromProperty(prop, include));
}
if (modifiersType.flags & 1 /* Any */) {
addMemberForKeyType(stringType);
}
else {
for (var _b = 0, _c = getIndexInfosOfType(modifiersType); _b < _c.length; _b++) {
var info = _c[_b];
if (!keyofStringsOnly || info.keyType.flags & (4 /* String */ | 134217728 /* TemplateLiteral */)) {
addMemberForKeyType(info.keyType);
}
}
}
}
else {
forEachType(getLowerBoundOfKeyType(constraintType), addMemberForKeyType);
}
setStructuredTypeMembers(type, members, ts.emptyArray, ts.emptyArray, indexInfos || ts.emptyArray);
function addMemberForKeyType(keyType) {
var propNameType = nameType ? instantiateType(nameType, appendTypeMapping(type.mapper, typeParameter, keyType)) : keyType;
forEachType(propNameType, function (t) { return addMemberForKeyTypeWorker(keyType, t); });
}
function addMemberForKeyTypeWorker(keyType, propNameType) {
// If the current iteration type constituent is a string literal type, create a property.
// Otherwise, for type string create a string index signature.
if (isTypeUsableAsPropertyName(propNameType)) {
var propName = getPropertyNameFromType(propNameType);
// String enum members from separate enums with identical values
// are distinct types with the same property name. Make the resulting
// property symbol's name type be the union of those enum member types.
var existingProp = members.get(propName);
if (existingProp) {
existingProp.nameType = getUnionType([existingProp.nameType, propNameType]);
existingProp.keyType = getUnionType([existingProp.keyType, keyType]);
}
else {
var modifiersProp = isTypeUsableAsPropertyName(keyType) ? getPropertyOfType(modifiersType, getPropertyNameFromType(keyType)) : undefined;
var isOptional = !!(templateModifiers & 4 /* IncludeOptional */ ||
!(templateModifiers & 8 /* ExcludeOptional */) && modifiersProp && modifiersProp.flags & 16777216 /* Optional */);
var isReadonly = !!(templateModifiers & 1 /* IncludeReadonly */ ||
!(templateModifiers & 2 /* ExcludeReadonly */) && modifiersProp && isReadonlySymbol(modifiersProp));
var stripOptional = strictNullChecks && !isOptional && modifiersProp && modifiersProp.flags & 16777216 /* Optional */;
var lateFlag = modifiersProp ? getIsLateCheckFlag(modifiersProp) : 0;
var prop = createSymbol(4 /* Property */ | (isOptional ? 16777216 /* Optional */ : 0), propName, lateFlag | 262144 /* Mapped */ | (isReadonly ? 8 /* Readonly */ : 0) | (stripOptional ? 524288 /* StripOptional */ : 0));
prop.mappedType = type;
prop.nameType = propNameType;
prop.keyType = keyType;
if (modifiersProp) {
prop.syntheticOrigin = modifiersProp;
// If the mapped type has an `as XXX` clause, the property name likely won't match the declaration name and
// multiple properties may map to the same name. Thus, we attach no declarations to the symbol.
prop.declarations = nameType ? undefined : modifiersProp.declarations;
}
members.set(propName, prop);
}
}
else if (isValidIndexKeyType(propNameType) || propNameType.flags & (1 /* Any */ | 32 /* Enum */)) {
var indexKeyType = propNameType.flags & (1 /* Any */ | 4 /* String */) ? stringType :
propNameType.flags & (8 /* Number */ | 32 /* Enum */) ? numberType :
propNameType;
var propType = instantiateType(templateType, appendTypeMapping(type.mapper, typeParameter, keyType));
var indexInfo = createIndexInfo(indexKeyType, propType, !!(templateModifiers & 1 /* IncludeReadonly */));
indexInfos = appendIndexInfo(indexInfos, indexInfo, /*union*/ true);
}
}
}
function getTypeOfMappedSymbol(symbol) {
if (!symbol.type) {
var mappedType = symbol.mappedType;
if (!pushTypeResolution(symbol, 0 /* Type */)) {
mappedType.containsError = true;
return errorType;
}
var templateType = getTemplateTypeFromMappedType(mappedType.target || mappedType);
var mapper = appendTypeMapping(mappedType.mapper, getTypeParameterFromMappedType(mappedType), symbol.keyType);
var propType = instantiateType(templateType, mapper);
// When creating an optional property in strictNullChecks mode, if 'undefined' isn't assignable to the
// type, we include 'undefined' in the type. Similarly, when creating a non-optional property in strictNullChecks
// mode, if the underlying property is optional we remove 'undefined' from the type.
var type = strictNullChecks && symbol.flags & 16777216 /* Optional */ && !maybeTypeOfKind(propType, 32768 /* Undefined */ | 16384 /* Void */) ? getOptionalType(propType, /*isProperty*/ true) :
symbol.checkFlags & 524288 /* StripOptional */ ? removeMissingOrUndefinedType(propType) :
propType;
if (!popTypeResolution()) {
error(currentNode, ts.Diagnostics.Type_of_property_0_circularly_references_itself_in_mapped_type_1, symbolToString(symbol), typeToString(mappedType));
type = errorType;
}
symbol.type = type;
}
return symbol.type;
}
function getTypeParameterFromMappedType(type) {
return type.typeParameter ||
(type.typeParameter = getDeclaredTypeOfTypeParameter(getSymbolOfNode(type.declaration.typeParameter)));
}
function getConstraintTypeFromMappedType(type) {
return type.constraintType ||
(type.constraintType = getConstraintOfTypeParameter(getTypeParameterFromMappedType(type)) || errorType);
}
function getNameTypeFromMappedType(type) {
return type.declaration.nameType ?
type.nameType || (type.nameType = instantiateType(getTypeFromTypeNode(type.declaration.nameType), type.mapper)) :
undefined;
}
function getTemplateTypeFromMappedType(type) {
return type.templateType ||
(type.templateType = type.declaration.type ?
instantiateType(addOptionality(getTypeFromTypeNode(type.declaration.type), /*isProperty*/ true, !!(getMappedTypeModifiers(type) & 4 /* IncludeOptional */)), type.mapper) :
errorType);
}
function getConstraintDeclarationForMappedType(type) {
return ts.getEffectiveConstraintOfTypeParameter(type.declaration.typeParameter);
}
function isMappedTypeWithKeyofConstraintDeclaration(type) {
var constraintDeclaration = getConstraintDeclarationForMappedType(type); // TODO: GH#18217
return constraintDeclaration.kind === 191 /* TypeOperator */ &&
constraintDeclaration.operator === 139 /* KeyOfKeyword */;
}
function getModifiersTypeFromMappedType(type) {
if (!type.modifiersType) {
if (isMappedTypeWithKeyofConstraintDeclaration(type)) {
// If the constraint declaration is a 'keyof T' node, the modifiers type is T. We check
// AST nodes here because, when T is a non-generic type, the logic below eagerly resolves
// 'keyof T' to a literal union type and we can't recover T from that type.
type.modifiersType = instantiateType(getTypeFromTypeNode(getConstraintDeclarationForMappedType(type).type), type.mapper);
}
else {
// Otherwise, get the declared constraint type, and if the constraint type is a type parameter,
// get the constraint of that type parameter. If the resulting type is an indexed type 'keyof T',
// the modifiers type is T. Otherwise, the modifiers type is unknown.
var declaredType = getTypeFromMappedTypeNode(type.declaration);
var constraint = getConstraintTypeFromMappedType(declaredType);
var extendedConstraint = constraint && constraint.flags & 262144 /* TypeParameter */ ? getConstraintOfTypeParameter(constraint) : constraint;
type.modifiersType = extendedConstraint && extendedConstraint.flags & 4194304 /* Index */ ? instantiateType(extendedConstraint.type, type.mapper) : unknownType;
}
}
return type.modifiersType;
}
function getMappedTypeModifiers(type) {
var declaration = type.declaration;
return (declaration.readonlyToken ? declaration.readonlyToken.kind === 40 /* MinusToken */ ? 2 /* ExcludeReadonly */ : 1 /* IncludeReadonly */ : 0) |
(declaration.questionToken ? declaration.questionToken.kind === 40 /* MinusToken */ ? 8 /* ExcludeOptional */ : 4 /* IncludeOptional */ : 0);
}
function getMappedTypeOptionality(type) {
var modifiers = getMappedTypeModifiers(type);
return modifiers & 8 /* ExcludeOptional */ ? -1 : modifiers & 4 /* IncludeOptional */ ? 1 : 0;
}
function getCombinedMappedTypeOptionality(type) {
var optionality = getMappedTypeOptionality(type);
var modifiersType = getModifiersTypeFromMappedType(type);
return optionality || (isGenericMappedType(modifiersType) ? getMappedTypeOptionality(modifiersType) : 0);
}
function isPartialMappedType(type) {
return !!(ts.getObjectFlags(type) & 32 /* Mapped */ && getMappedTypeModifiers(type) & 4 /* IncludeOptional */);
}
function isGenericMappedType(type) {
return !!(ts.getObjectFlags(type) & 32 /* Mapped */) && isGenericIndexType(getConstraintTypeFromMappedType(type));
}
function resolveStructuredTypeMembers(type) {
if (!type.members) {
if (type.flags & 524288 /* Object */) {
if (type.objectFlags & 4 /* Reference */) {
resolveTypeReferenceMembers(type);
}
else if (type.objectFlags & 3 /* ClassOrInterface */) {
resolveClassOrInterfaceMembers(type);
}
else if (type.objectFlags & 1024 /* ReverseMapped */) {
resolveReverseMappedTypeMembers(type);
}
else if (type.objectFlags & 16 /* Anonymous */) {
resolveAnonymousTypeMembers(type);
}
else if (type.objectFlags & 32 /* Mapped */) {
resolveMappedTypeMembers(type);
}
}
else if (type.flags & 1048576 /* Union */) {
resolveUnionTypeMembers(type);
}
else if (type.flags & 2097152 /* Intersection */) {
resolveIntersectionTypeMembers(type);
}
}
return type;
}
/** Return properties of an object type or an empty array for other types */
function getPropertiesOfObjectType(type) {
if (type.flags & 524288 /* Object */) {
return resolveStructuredTypeMembers(type).properties;
}
return ts.emptyArray;
}
/** If the given type is an object type and that type has a property by the given name,
* return the symbol for that property. Otherwise return undefined.
*/
function getPropertyOfObjectType(type, name) {
if (type.flags & 524288 /* Object */) {
var resolved = resolveStructuredTypeMembers(type);
var symbol = resolved.members.get(name);
if (symbol && symbolIsValue(symbol)) {
return symbol;
}
}
}
function getPropertiesOfUnionOrIntersectionType(type) {
if (!type.resolvedProperties) {
var members = ts.createSymbolTable();
for (var _i = 0, _a = type.types; _i < _a.length; _i++) {
var current = _a[_i];
for (var _b = 0, _c = getPropertiesOfType(current); _b < _c.length; _b++) {
var prop = _c[_b];
if (!members.has(prop.escapedName)) {
var combinedProp = getPropertyOfUnionOrIntersectionType(type, prop.escapedName);
if (combinedProp) {
members.set(prop.escapedName, combinedProp);
}
}
}
// The properties of a union type are those that are present in all constituent types, so
// we only need to check the properties of the first type without index signature
if (type.flags & 1048576 /* Union */ && getIndexInfosOfType(current).length === 0) {
break;
}
}
type.resolvedProperties = getNamedMembers(members);
}
return type.resolvedProperties;
}
function getPropertiesOfType(type) {
type = getReducedApparentType(type);
return type.flags & 3145728 /* UnionOrIntersection */ ?
getPropertiesOfUnionOrIntersectionType(type) :
getPropertiesOfObjectType(type);
}
function isTypeInvalidDueToUnionDiscriminant(contextualType, obj) {
var list = obj.properties;
return list.some(function (property) {
var nameType = property.name && getLiteralTypeFromPropertyName(property.name);
var name = nameType && isTypeUsableAsPropertyName(nameType) ? getPropertyNameFromType(nameType) : undefined;
var expected = name === undefined ? undefined : getTypeOfPropertyOfType(contextualType, name);
return !!expected && isLiteralType(expected) && !isTypeAssignableTo(getTypeOfNode(property), expected);
});
}
function getAllPossiblePropertiesOfTypes(types) {
var unionType = getUnionType(types);
if (!(unionType.flags & 1048576 /* Union */)) {
return getAugmentedPropertiesOfType(unionType);
}
var props = ts.createSymbolTable();
for (var _i = 0, types_4 = types; _i < types_4.length; _i++) {
var memberType = types_4[_i];
for (var _a = 0, _b = getAugmentedPropertiesOfType(memberType); _a < _b.length; _a++) {
var escapedName = _b[_a].escapedName;
if (!props.has(escapedName)) {
var prop = createUnionOrIntersectionProperty(unionType, escapedName);
// May be undefined if the property is private
if (prop)
props.set(escapedName, prop);
}
}
}
return ts.arrayFrom(props.values());
}
function getConstraintOfType(type) {
return type.flags & 262144 /* TypeParameter */ ? getConstraintOfTypeParameter(type) :
type.flags & 8388608 /* IndexedAccess */ ? getConstraintOfIndexedAccess(type) :
type.flags & 16777216 /* Conditional */ ? getConstraintOfConditionalType(type) :
getBaseConstraintOfType(type);
}
function getConstraintOfTypeParameter(typeParameter) {
return hasNonCircularBaseConstraint(typeParameter) ? getConstraintFromTypeParameter(typeParameter) : undefined;
}
function getConstraintOfIndexedAccess(type) {
return hasNonCircularBaseConstraint(type) ? getConstraintFromIndexedAccess(type) : undefined;
}
function getSimplifiedTypeOrConstraint(type) {
var simplified = getSimplifiedType(type, /*writing*/ false);
return simplified !== type ? simplified : getConstraintOfType(type);
}
function getConstraintFromIndexedAccess(type) {
var indexConstraint = getSimplifiedTypeOrConstraint(type.indexType);
if (indexConstraint && indexConstraint !== type.indexType) {
var indexedAccess = getIndexedAccessTypeOrUndefined(type.objectType, indexConstraint, type.accessFlags);
if (indexedAccess) {
return indexedAccess;
}
}
var objectConstraint = getSimplifiedTypeOrConstraint(type.objectType);
if (objectConstraint && objectConstraint !== type.objectType) {
return getIndexedAccessTypeOrUndefined(objectConstraint, type.indexType, type.accessFlags);
}
return undefined;
}
function getDefaultConstraintOfConditionalType(type) {
if (!type.resolvedDefaultConstraint) {
// An `any` branch of a conditional type would normally be viral - specifically, without special handling here,
// a conditional type with a single branch of type `any` would be assignable to anything, since it's constraint would simplify to
// just `any`. This result is _usually_ unwanted - so instead here we elide an `any` branch from the constraint type,
// in effect treating `any` like `never` rather than `unknown` in this location.
var trueConstraint = getInferredTrueTypeFromConditionalType(type);
var falseConstraint = getFalseTypeFromConditionalType(type);
type.resolvedDefaultConstraint = isTypeAny(trueConstraint) ? falseConstraint : isTypeAny(falseConstraint) ? trueConstraint : getUnionType([trueConstraint, falseConstraint]);
}
return type.resolvedDefaultConstraint;
}
function getConstraintOfDistributiveConditionalType(type) {
// Check if we have a conditional type of the form 'T extends U ? X : Y', where T is a constrained
// type parameter. If so, create an instantiation of the conditional type where T is replaced
// with its constraint. We do this because if the constraint is a union type it will be distributed
// over the conditional type and possibly reduced. For example, 'T extends undefined ? never : T'
// removes 'undefined' from T.
// We skip returning a distributive constraint for a restrictive instantiation of a conditional type
// as the constraint for all type params (check type included) have been replace with `unknown`, which
// is going to produce even more false positive/negative results than the distribute constraint already does.
// Please note: the distributive constraint is a kludge for emulating what a negated type could to do filter
// a union - once negated types exist and are applied to the conditional false branch, this "constraint"
// likely doesn't need to exist.
if (type.root.isDistributive && type.restrictiveInstantiation !== type) {
var simplified = getSimplifiedType(type.checkType, /*writing*/ false);
var constraint = simplified === type.checkType ? getConstraintOfType(simplified) : simplified;
if (constraint && constraint !== type.checkType) {
var instantiated = getConditionalTypeInstantiation(type, prependTypeMapping(type.root.checkType, constraint, type.mapper));
if (!(instantiated.flags & 131072 /* Never */)) {
return instantiated;
}
}
}
return undefined;
}
function getConstraintFromConditionalType(type) {
return getConstraintOfDistributiveConditionalType(type) || getDefaultConstraintOfConditionalType(type);
}
function getConstraintOfConditionalType(type) {
return hasNonCircularBaseConstraint(type) ? getConstraintFromConditionalType(type) : undefined;
}
function getEffectiveConstraintOfIntersection(types, targetIsUnion) {
var constraints;
var hasDisjointDomainType = false;
for (var _i = 0, types_5 = types; _i < types_5.length; _i++) {
var t = types_5[_i];
if (t.flags & 465829888 /* Instantiable */) {
// We keep following constraints as long as we have an instantiable type that is known
// not to be circular or infinite (hence we stop on index access types).
var constraint = getConstraintOfType(t);
while (constraint && constraint.flags & (262144 /* TypeParameter */ | 4194304 /* Index */ | 16777216 /* Conditional */)) {
constraint = getConstraintOfType(constraint);
}
if (constraint) {
constraints = ts.append(constraints, constraint);
if (targetIsUnion) {
constraints = ts.append(constraints, t);
}
}
}
else if (t.flags & 469892092 /* DisjointDomains */) {
hasDisjointDomainType = true;
}
}
// If the target is a union type or if we are intersecting with types belonging to one of the
// disjoint domains, we may end up producing a constraint that hasn't been examined before.
if (constraints && (targetIsUnion || hasDisjointDomainType)) {
if (hasDisjointDomainType) {
// We add any types belong to one of the disjoint domains because they might cause the final
// intersection operation to reduce the union constraints.
for (var _a = 0, types_6 = types; _a < types_6.length; _a++) {
var t = types_6[_a];
if (t.flags & 469892092 /* DisjointDomains */) {
constraints = ts.append(constraints, t);
}
}
}
return getIntersectionType(constraints);
}
return undefined;
}
function getBaseConstraintOfType(type) {
if (type.flags & (58982400 /* InstantiableNonPrimitive */ | 3145728 /* UnionOrIntersection */ | 134217728 /* TemplateLiteral */ | 268435456 /* StringMapping */)) {
var constraint = getResolvedBaseConstraint(type);
return constraint !== noConstraintType && constraint !== circularConstraintType ? constraint : undefined;
}
return type.flags & 4194304 /* Index */ ? keyofConstraintType : undefined;
}
/**
* This is similar to `getBaseConstraintOfType` except it returns the input type if there's no base constraint, instead of `undefined`
* It also doesn't map indexes to `string`, as where this is used this would be unneeded (and likely undesirable)
*/
function getBaseConstraintOrType(type) {
return getBaseConstraintOfType(type) || type;
}
function hasNonCircularBaseConstraint(type) {
return getResolvedBaseConstraint(type) !== circularConstraintType;
}
/**
* Return the resolved base constraint of a type variable. The noConstraintType singleton is returned if the
* type variable has no constraint, and the circularConstraintType singleton is returned if the constraint
* circularly references the type variable.
*/
function getResolvedBaseConstraint(type) {
if (type.resolvedBaseConstraint) {
return type.resolvedBaseConstraint;
}
var stack = [];
return type.resolvedBaseConstraint = getTypeWithThisArgument(getImmediateBaseConstraint(type), type);
function getImmediateBaseConstraint(t) {
if (!t.immediateBaseConstraint) {
if (!pushTypeResolution(t, 4 /* ImmediateBaseConstraint */)) {
return circularConstraintType;
}
var result = void 0;
// We always explore at least 10 levels of nested constraints. Thereafter, we continue to explore
// up to 50 levels of nested constraints provided there are no "deeply nested" types on the stack
// (i.e. no types for which five instantiations have been recorded on the stack). If we reach 50
// levels of nesting, we are presumably exploring a repeating pattern with a long cycle that hasn't
// yet triggered the deeply nested limiter. We have no test cases that actually get to 50 levels of
// nesting, so it is effectively just a safety stop.
if (stack.length < 10 || stack.length < 50 && !isDeeplyNestedType(t, stack, stack.length)) {
stack.push(t);
result = computeBaseConstraint(getSimplifiedType(t, /*writing*/ false));
stack.pop();
}
if (!popTypeResolution()) {
if (t.flags & 262144 /* TypeParameter */) {
var errorNode = getConstraintDeclaration(t);
if (errorNode) {
var diagnostic = error(errorNode, ts.Diagnostics.Type_parameter_0_has_a_circular_constraint, typeToString(t));
if (currentNode && !ts.isNodeDescendantOf(errorNode, currentNode) && !ts.isNodeDescendantOf(currentNode, errorNode)) {
ts.addRelatedInfo(diagnostic, ts.createDiagnosticForNode(currentNode, ts.Diagnostics.Circularity_originates_in_type_at_this_location));
}
}
}
result = circularConstraintType;
}
t.immediateBaseConstraint = result || noConstraintType;
}
return t.immediateBaseConstraint;
}
function getBaseConstraint(t) {
var c = getImmediateBaseConstraint(t);
return c !== noConstraintType && c !== circularConstraintType ? c : undefined;
}
function computeBaseConstraint(t) {
if (t.flags & 262144 /* TypeParameter */) {
var constraint = getConstraintFromTypeParameter(t);
return t.isThisType || !constraint ?
constraint :
getBaseConstraint(constraint);
}
if (t.flags & 3145728 /* UnionOrIntersection */) {
var types = t.types;
var baseTypes = [];
var different = false;
for (var _i = 0, types_7 = types; _i < types_7.length; _i++) {
var type_3 = types_7[_i];
var baseType = getBaseConstraint(type_3);
if (baseType) {
if (baseType !== type_3) {
different = true;
}
baseTypes.push(baseType);
}
else {
different = true;
}
}
if (!different) {
return t;
}
return t.flags & 1048576 /* Union */ && baseTypes.length === types.length ? getUnionType(baseTypes) :
t.flags & 2097152 /* Intersection */ && baseTypes.length ? getIntersectionType(baseTypes) :
undefined;
}
if (t.flags & 4194304 /* Index */) {
return keyofConstraintType;
}
if (t.flags & 134217728 /* TemplateLiteral */) {
var types = t.types;
var constraints = ts.mapDefined(types, getBaseConstraint);
return constraints.length === types.length ? getTemplateLiteralType(t.texts, constraints) : stringType;
}
if (t.flags & 268435456 /* StringMapping */) {
var constraint = getBaseConstraint(t.type);
return constraint ? getStringMappingType(t.symbol, constraint) : stringType;
}
if (t.flags & 8388608 /* IndexedAccess */) {
var baseObjectType = getBaseConstraint(t.objectType);
var baseIndexType = getBaseConstraint(t.indexType);
var baseIndexedAccess = baseObjectType && baseIndexType && getIndexedAccessTypeOrUndefined(baseObjectType, baseIndexType, t.accessFlags);
return baseIndexedAccess && getBaseConstraint(baseIndexedAccess);
}
if (t.flags & 16777216 /* Conditional */) {
var constraint = getConstraintFromConditionalType(t);
return constraint && getBaseConstraint(constraint);
}
if (t.flags & 33554432 /* Substitution */) {
return getBaseConstraint(t.substitute);
}
return t;
}
}
function getApparentTypeOfIntersectionType(type) {
return type.resolvedApparentType || (type.resolvedApparentType = getTypeWithThisArgument(type, type, /*apparentType*/ true));
}
function getResolvedTypeParameterDefault(typeParameter) {
if (!typeParameter.default) {
if (typeParameter.target) {
var targetDefault = getResolvedTypeParameterDefault(typeParameter.target);
typeParameter.default = targetDefault ? instantiateType(targetDefault, typeParameter.mapper) : noConstraintType;
}
else {
// To block recursion, set the initial value to the resolvingDefaultType.
typeParameter.default = resolvingDefaultType;
var defaultDeclaration = typeParameter.symbol && ts.forEach(typeParameter.symbol.declarations, function (decl) { return ts.isTypeParameterDeclaration(decl) && decl.default; });
var defaultType = defaultDeclaration ? getTypeFromTypeNode(defaultDeclaration) : noConstraintType;
if (typeParameter.default === resolvingDefaultType) {
// If we have not been called recursively, set the correct default type.
typeParameter.default = defaultType;
}
}
}
else if (typeParameter.default === resolvingDefaultType) {
// If we are called recursively for this type parameter, mark the default as circular.
typeParameter.default = circularConstraintType;
}
return typeParameter.default;
}
/**
* Gets the default type for a type parameter.
*
* If the type parameter is the result of an instantiation, this gets the instantiated
* default type of its target. If the type parameter has no default type or the default is
* circular, `undefined` is returned.
*/
function getDefaultFromTypeParameter(typeParameter) {
var defaultType = getResolvedTypeParameterDefault(typeParameter);
return defaultType !== noConstraintType && defaultType !== circularConstraintType ? defaultType : undefined;
}
function hasNonCircularTypeParameterDefault(typeParameter) {
return getResolvedTypeParameterDefault(typeParameter) !== circularConstraintType;
}
/**
* Indicates whether the declaration of a typeParameter has a default type.
*/
function hasTypeParameterDefault(typeParameter) {
return !!(typeParameter.symbol && ts.forEach(typeParameter.symbol.declarations, function (decl) { return ts.isTypeParameterDeclaration(decl) && decl.default; }));
}
function getApparentTypeOfMappedType(type) {
return type.resolvedApparentType || (type.resolvedApparentType = getResolvedApparentTypeOfMappedType(type));
}
function getResolvedApparentTypeOfMappedType(type) {
var typeVariable = getHomomorphicTypeVariable(type);
if (typeVariable && !type.declaration.nameType) {
var constraint = getConstraintOfTypeParameter(typeVariable);
if (constraint && (isArrayType(constraint) || isTupleType(constraint))) {
return instantiateType(type, prependTypeMapping(typeVariable, constraint, type.mapper));
}
}
return type;
}
/**
* For a type parameter, return the base constraint of the type parameter. For the string, number,
* boolean, and symbol primitive types, return the corresponding object types. Otherwise return the
* type itself.
*/
function getApparentType(type) {
var t = type.flags & 465829888 /* Instantiable */ ? getBaseConstraintOfType(type) || unknownType : type;
return ts.getObjectFlags(t) & 32 /* Mapped */ ? getApparentTypeOfMappedType(t) :
t.flags & 2097152 /* Intersection */ ? getApparentTypeOfIntersectionType(t) :
t.flags & 402653316 /* StringLike */ ? globalStringType :
t.flags & 296 /* NumberLike */ ? globalNumberType :
t.flags & 2112 /* BigIntLike */ ? getGlobalBigIntType(/*reportErrors*/ languageVersion >= 7 /* ES2020 */) :
t.flags & 528 /* BooleanLike */ ? globalBooleanType :
t.flags & 12288 /* ESSymbolLike */ ? getGlobalESSymbolType(/*reportErrors*/ languageVersion >= 2 /* ES2015 */) :
t.flags & 67108864 /* NonPrimitive */ ? emptyObjectType :
t.flags & 4194304 /* Index */ ? keyofConstraintType :
t.flags & 2 /* Unknown */ && !strictNullChecks ? emptyObjectType :
t;
}
function getReducedApparentType(type) {
// Since getApparentType may return a non-reduced union or intersection type, we need to perform
// type reduction both before and after obtaining the apparent type. For example, given a type parameter
// 'T extends A | B', the type 'T & X' becomes 'A & X | B & X' after obtaining the apparent type, and
// that type may need further reduction to remove empty intersections.
return getReducedType(getApparentType(getReducedType(type)));
}
function createUnionOrIntersectionProperty(containingType, name, skipObjectFunctionPropertyAugment) {
var _a, _b;
var singleProp;
var propSet;
var indexTypes;
var isUnion = containingType.flags & 1048576 /* Union */;
// Flags we want to propagate to the result if they exist in all source symbols
var optionalFlag = isUnion ? 0 /* None */ : 16777216 /* Optional */;
var syntheticFlag = 4 /* SyntheticMethod */;
var checkFlags = 0;
var mergedInstantiations = false;
for (var _i = 0, _c = containingType.types; _i < _c.length; _i++) {
var current = _c[_i];
var type = getApparentType(current);
if (!(type === errorType || type.flags & 131072 /* Never */)) {
var prop = getPropertyOfType(type, name, skipObjectFunctionPropertyAugment);
var modifiers = prop ? ts.getDeclarationModifierFlagsFromSymbol(prop) : 0;
if (prop) {
if (isUnion) {
optionalFlag |= (prop.flags & 16777216 /* Optional */);
}
else {
optionalFlag &= prop.flags;
}
if (!singleProp) {
singleProp = prop;
}
else if (prop !== singleProp) {
var isInstantiation = (getTargetSymbol(prop) || prop) === (getTargetSymbol(singleProp) || singleProp);
// If the symbols are instances of one another with identical types - consider the symbols
// equivalent and just use the first one, which thus allows us to avoid eliding private
// members when intersecting a (this-)instantiations of a class with it's raw base or another instance
if (isInstantiation && compareProperties(singleProp, prop, function (a, b) { return a === b ? -1 /* True */ : 0 /* False */; }) === -1 /* True */) {
// If we merged instantiations of a generic type, we replicate the symbol parent resetting behavior we used
// to do when we recorded multiple distinct symbols so that we still get, eg, `Array<T>.length` printed
// back and not `Array<string>.length` when we're looking at a `.length` access on a `string[] | number[]`
mergedInstantiations = !!singleProp.parent && !!ts.length(getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(singleProp.parent));
}
else {
if (!propSet) {
propSet = new ts.Map();
propSet.set(getSymbolId(singleProp), singleProp);
}
var id = getSymbolId(prop);
if (!propSet.has(id)) {
propSet.set(id, prop);
}
}
}
checkFlags |= (isReadonlySymbol(prop) ? 8 /* Readonly */ : 0) |
(!(modifiers & 24 /* NonPublicAccessibilityModifier */) ? 256 /* ContainsPublic */ : 0) |
(modifiers & 16 /* Protected */ ? 512 /* ContainsProtected */ : 0) |
(modifiers & 8 /* Private */ ? 1024 /* ContainsPrivate */ : 0) |
(modifiers & 32 /* Static */ ? 2048 /* ContainsStatic */ : 0);
if (!isPrototypeProperty(prop)) {
syntheticFlag = 2 /* SyntheticProperty */;
}
}
else if (isUnion) {
var indexInfo = !isLateBoundName(name) && getApplicableIndexInfoForName(type, name);
if (indexInfo) {
checkFlags |= 32 /* WritePartial */ | (indexInfo.isReadonly ? 8 /* Readonly */ : 0);
indexTypes = ts.append(indexTypes, isTupleType(type) ? getRestTypeOfTupleType(type) || undefinedType : indexInfo.type);
}
else if (isObjectLiteralType(type) && !(ts.getObjectFlags(type) & 4194304 /* ContainsSpread */)) {
checkFlags |= 32 /* WritePartial */;
indexTypes = ts.append(indexTypes, undefinedType);
}
else {
checkFlags |= 16 /* ReadPartial */;
}
}
}
}
if (!singleProp || isUnion && (propSet || checkFlags & 48 /* Partial */) && checkFlags & (1024 /* ContainsPrivate */ | 512 /* ContainsProtected */)) {
// No property was found, or, in a union, a property has a private or protected declaration in one
// constituent, but is missing or has a different declaration in another constituent.
return undefined;
}
if (!propSet && !(checkFlags & 16 /* ReadPartial */) && !indexTypes) {
if (mergedInstantiations) {
// No symbol from a union/intersection should have a `.parent` set (since unions/intersections don't act as symbol parents)
// Unless that parent is "reconstituted" from the "first value declaration" on the symbol (which is likely different than its instantiated parent!)
// They also have a `.containingType` set, which affects some services endpoints behavior, like `getRootSymbol`
var clone_1 = createSymbolWithType(singleProp, singleProp.type);
clone_1.parent = (_b = (_a = singleProp.valueDeclaration) === null || _a === void 0 ? void 0 : _a.symbol) === null || _b === void 0 ? void 0 : _b.parent;
clone_1.containingType = containingType;
clone_1.mapper = singleProp.mapper;
return clone_1;
}
else {
return singleProp;
}
}
var props = propSet ? ts.arrayFrom(propSet.values()) : [singleProp];
var declarations;
var firstType;
var nameType;
var propTypes = [];
var firstValueDeclaration;
var hasNonUniformValueDeclaration = false;
for (var _d = 0, props_1 = props; _d < props_1.length; _d++) {
var prop = props_1[_d];
if (!firstValueDeclaration) {
firstValueDeclaration = prop.valueDeclaration;
}
else if (prop.valueDeclaration && prop.valueDeclaration !== firstValueDeclaration) {
hasNonUniformValueDeclaration = true;
}
declarations = ts.addRange(declarations, prop.declarations);
var type = getTypeOfSymbol(prop);
if (!firstType) {
firstType = type;
nameType = getSymbolLinks(prop).nameType;
}
else if (type !== firstType) {
checkFlags |= 64 /* HasNonUniformType */;
}
if (isLiteralType(type)) {
checkFlags |= 128 /* HasLiteralType */;
}
if (type.flags & 131072 /* Never */) {
checkFlags |= 131072 /* HasNeverType */;
}
propTypes.push(type);
}
ts.addRange(propTypes, indexTypes);
var result = createSymbol(4 /* Property */ | optionalFlag, name, syntheticFlag | checkFlags);
result.containingType = containingType;
if (!hasNonUniformValueDeclaration && firstValueDeclaration) {
result.valueDeclaration = firstValueDeclaration;
// Inherit information about parent type.
if (firstValueDeclaration.symbol.parent) {
result.parent = firstValueDeclaration.symbol.parent;
}
}
result.declarations = declarations;
result.nameType = nameType;
if (propTypes.length > 2) {
// When `propTypes` has the potential to explode in size when normalized, defer normalization until absolutely needed
result.checkFlags |= 65536 /* DeferredType */;
result.deferralParent = containingType;
result.deferralConstituents = propTypes;
}
else {
result.type = isUnion ? getUnionType(propTypes) : getIntersectionType(propTypes);
}
return result;
}
// Return the symbol for a given property in a union or intersection type, or undefined if the property
// does not exist in any constituent type. Note that the returned property may only be present in some
// constituents, in which case the isPartial flag is set when the containing type is union type. We need
// these partial properties when identifying discriminant properties, but otherwise they are filtered out
// and do not appear to be present in the union type.
function getUnionOrIntersectionProperty(type, name, skipObjectFunctionPropertyAugment) {
var _a, _b;
var property = ((_a = type.propertyCacheWithoutObjectFunctionPropertyAugment) === null || _a === void 0 ? void 0 : _a.get(name)) ||
!skipObjectFunctionPropertyAugment ? (_b = type.propertyCache) === null || _b === void 0 ? void 0 : _b.get(name) : undefined;
if (!property) {
property = createUnionOrIntersectionProperty(type, name, skipObjectFunctionPropertyAugment);
if (property) {
var properties = skipObjectFunctionPropertyAugment ? type.propertyCacheWithoutObjectFunctionPropertyAugment || (type.propertyCacheWithoutObjectFunctionPropertyAugment = ts.createSymbolTable()) : type.propertyCache || (type.propertyCache = ts.createSymbolTable());
properties.set(name, property);
}
}
return property;
}
function getPropertyOfUnionOrIntersectionType(type, name, skipObjectFunctionPropertyAugment) {
var property = getUnionOrIntersectionProperty(type, name, skipObjectFunctionPropertyAugment);
// We need to filter out partial properties in union types
return property && !(ts.getCheckFlags(property) & 16 /* ReadPartial */) ? property : undefined;
}
/**
* Return the reduced form of the given type. For a union type, it is a union of the normalized constituent types.
* For an intersection of types containing one or more mututally exclusive discriminant properties, it is 'never'.
* For all other types, it is simply the type itself. Discriminant properties are considered mutually exclusive when
* no constituent property has type 'never', but the intersection of the constituent property types is 'never'.
*/
function getReducedType(type) {
if (type.flags & 1048576 /* Union */ && type.objectFlags & 33554432 /* ContainsIntersections */) {
return type.resolvedReducedType || (type.resolvedReducedType = getReducedUnionType(type));
}
else if (type.flags & 2097152 /* Intersection */) {
if (!(type.objectFlags & 33554432 /* IsNeverIntersectionComputed */)) {
type.objectFlags |= 33554432 /* IsNeverIntersectionComputed */ |
(ts.some(getPropertiesOfUnionOrIntersectionType(type), isNeverReducedProperty) ? 67108864 /* IsNeverIntersection */ : 0);
}
return type.objectFlags & 67108864 /* IsNeverIntersection */ ? neverType : type;
}
return type;
}
function getReducedUnionType(unionType) {
var reducedTypes = ts.sameMap(unionType.types, getReducedType);
if (reducedTypes === unionType.types) {
return unionType;
}
var reduced = getUnionType(reducedTypes);
if (reduced.flags & 1048576 /* Union */) {
reduced.resolvedReducedType = reduced;
}
return reduced;
}
function isNeverReducedProperty(prop) {
return isDiscriminantWithNeverType(prop) || isConflictingPrivateProperty(prop);
}
function isDiscriminantWithNeverType(prop) {
// Return true for a synthetic non-optional property with non-uniform types, where at least one is
// a literal type and none is never, that reduces to never.
return !(prop.flags & 16777216 /* Optional */) &&
(ts.getCheckFlags(prop) & (192 /* Discriminant */ | 131072 /* HasNeverType */)) === 192 /* Discriminant */ &&
!!(getTypeOfSymbol(prop).flags & 131072 /* Never */);
}
function isConflictingPrivateProperty(prop) {
// Return true for a synthetic property with multiple declarations, at least one of which is private.
return !prop.valueDeclaration && !!(ts.getCheckFlags(prop) & 1024 /* ContainsPrivate */);
}
function elaborateNeverIntersection(errorInfo, type) {
if (type.flags & 2097152 /* Intersection */ && ts.getObjectFlags(type) & 67108864 /* IsNeverIntersection */) {
var neverProp = ts.find(getPropertiesOfUnionOrIntersectionType(type), isDiscriminantWithNeverType);
if (neverProp) {
return ts.chainDiagnosticMessages(errorInfo, ts.Diagnostics.The_intersection_0_was_reduced_to_never_because_property_1_has_conflicting_types_in_some_constituents, typeToString(type, /*enclosingDeclaration*/ undefined, 536870912 /* NoTypeReduction */), symbolToString(neverProp));
}
var privateProp = ts.find(getPropertiesOfUnionOrIntersectionType(type), isConflictingPrivateProperty);
if (privateProp) {
return ts.chainDiagnosticMessages(errorInfo, ts.Diagnostics.The_intersection_0_was_reduced_to_never_because_property_1_exists_in_multiple_constituents_and_is_private_in_some, typeToString(type, /*enclosingDeclaration*/ undefined, 536870912 /* NoTypeReduction */), symbolToString(privateProp));
}
}
return errorInfo;
}
/**
* Return the symbol for the property with the given name in the given type. Creates synthetic union properties when
* necessary, maps primitive types and type parameters are to their apparent types, and augments with properties from
* Object and Function as appropriate.
*
* @param type a type to look up property from
* @param name a name of property to look up in a given type
*/
function getPropertyOfType(type, name, skipObjectFunctionPropertyAugment) {
type = getReducedApparentType(type);
if (type.flags & 524288 /* Object */) {
var resolved = resolveStructuredTypeMembers(type);
var symbol = resolved.members.get(name);
if (symbol && symbolIsValue(symbol)) {
return symbol;
}
if (skipObjectFunctionPropertyAugment)
return undefined;
var functionType = resolved === anyFunctionType ? globalFunctionType :
resolved.callSignatures.length ? globalCallableFunctionType :
resolved.constructSignatures.length ? globalNewableFunctionType :
undefined;
if (functionType) {
var symbol_1 = getPropertyOfObjectType(functionType, name);
if (symbol_1) {
return symbol_1;
}
}
return getPropertyOfObjectType(globalObjectType, name);
}
if (type.flags & 3145728 /* UnionOrIntersection */) {
return getPropertyOfUnionOrIntersectionType(type, name, skipObjectFunctionPropertyAugment);
}
return undefined;
}
function getSignaturesOfStructuredType(type, kind) {
if (type.flags & 3670016 /* StructuredType */) {
var resolved = resolveStructuredTypeMembers(type);
return kind === 0 /* Call */ ? resolved.callSignatures : resolved.constructSignatures;
}
return ts.emptyArray;
}
/**
* Return the signatures of the given kind in the given type. Creates synthetic union signatures when necessary and
* maps primitive types and type parameters are to their apparent types.
*/
function getSignaturesOfType(type, kind) {
return getSignaturesOfStructuredType(getReducedApparentType(type), kind);
}
function findIndexInfo(indexInfos, keyType) {
return ts.find(indexInfos, function (info) { return info.keyType === keyType; });
}
function findApplicableIndexInfo(indexInfos, keyType) {
// Index signatures for type 'string' are considered only when no other index signatures apply.
var stringIndexInfo;
var applicableInfo;
var applicableInfos;
for (var _i = 0, indexInfos_1 = indexInfos; _i < indexInfos_1.length; _i++) {
var info = indexInfos_1[_i];
if (info.keyType === stringType) {
stringIndexInfo = info;
}
else if (isApplicableIndexType(keyType, info.keyType)) {
if (!applicableInfo) {
applicableInfo = info;
}
else {
(applicableInfos || (applicableInfos = [applicableInfo])).push(info);
}
}
}
// When more than one index signature is applicable we create a synthetic IndexInfo. Instead of computing
// the intersected key type, we just use unknownType for the key type as nothing actually depends on the
// keyType property of the returned IndexInfo.
return applicableInfos ? createIndexInfo(unknownType, getIntersectionType(ts.map(applicableInfos, function (info) { return info.type; })), ts.reduceLeft(applicableInfos, function (isReadonly, info) { return isReadonly && info.isReadonly; }, /*initial*/ true)) :
applicableInfo ? applicableInfo :
stringIndexInfo && isApplicableIndexType(keyType, stringType) ? stringIndexInfo :
undefined;
}
function isApplicableIndexType(source, target) {
// A 'string' index signature applies to types assignable to 'string' or 'number', and a 'number' index
// signature applies to types assignable to 'number' and numeric string literal types.
return isTypeAssignableTo(source, target) ||
target === stringType && isTypeAssignableTo(source, numberType) ||
target === numberType && !!(source.flags & 128 /* StringLiteral */) && isNumericLiteralName(source.value);
}
function getIndexInfosOfStructuredType(type) {
if (type.flags & 3670016 /* StructuredType */) {
var resolved = resolveStructuredTypeMembers(type);
return resolved.indexInfos;
}
return ts.emptyArray;
}
function getIndexInfosOfType(type) {
return getIndexInfosOfStructuredType(getReducedApparentType(type));
}
// Return the indexing info of the given kind in the given type. Creates synthetic union index types when necessary and
// maps primitive types and type parameters are to their apparent types.
function getIndexInfoOfType(type, keyType) {
return findIndexInfo(getIndexInfosOfType(type), keyType);
}
// Return the index type of the given kind in the given type. Creates synthetic union index types when necessary and
// maps primitive types and type parameters are to their apparent types.
function getIndexTypeOfType(type, keyType) {
var _a;
return (_a = getIndexInfoOfType(type, keyType)) === null || _a === void 0 ? void 0 : _a.type;
}
function getApplicableIndexInfos(type, keyType) {
return getIndexInfosOfType(type).filter(function (info) { return isApplicableIndexType(keyType, info.keyType); });
}
function getApplicableIndexInfo(type, keyType) {
return findApplicableIndexInfo(getIndexInfosOfType(type), keyType);
}
function getApplicableIndexInfoForName(type, name) {
return getApplicableIndexInfo(type, isLateBoundName(name) ? esSymbolType : getStringLiteralType(ts.unescapeLeadingUnderscores(name)));
}
// Return list of type parameters with duplicates removed (duplicate identifier errors are generated in the actual
// type checking functions).
function getTypeParametersFromDeclaration(declaration) {
var result;
for (var _i = 0, _a = ts.getEffectiveTypeParameterDeclarations(declaration); _i < _a.length; _i++) {
var node = _a[_i];
result = ts.appendIfUnique(result, getDeclaredTypeOfTypeParameter(node.symbol));
}
return result;
}
function symbolsToArray(symbols) {
var result = [];
symbols.forEach(function (symbol, id) {
if (!isReservedMemberName(id)) {
result.push(symbol);
}
});
return result;
}
function isJSDocOptionalParameter(node) {
return ts.isInJSFile(node) && (
// node.type should only be a JSDocOptionalType when node is a parameter of a JSDocFunctionType
node.type && node.type.kind === 311 /* JSDocOptionalType */
|| ts.getJSDocParameterTags(node).some(function (_a) {
var isBracketed = _a.isBracketed, typeExpression = _a.typeExpression;
return isBracketed || !!typeExpression && typeExpression.type.kind === 311 /* JSDocOptionalType */;
}));
}
function tryFindAmbientModule(moduleName, withAugmentations) {
if (ts.isExternalModuleNameRelative(moduleName)) {
return undefined;
}
var symbol = getSymbol(globals, '"' + moduleName + '"', 512 /* ValueModule */);
// merged symbol is module declaration symbol combined with all augmentations
return symbol && withAugmentations ? getMergedSymbol(symbol) : symbol;
}
function isOptionalParameter(node) {
if (ts.hasQuestionToken(node) || isOptionalJSDocPropertyLikeTag(node) || isJSDocOptionalParameter(node)) {
return true;
}
if (node.initializer) {
var signature = getSignatureFromDeclaration(node.parent);
var parameterIndex = node.parent.parameters.indexOf(node);
ts.Debug.assert(parameterIndex >= 0);
// Only consider syntactic or instantiated parameters as optional, not `void` parameters as this function is used
// in grammar checks and checking for `void` too early results in parameter types widening too early
// and causes some noImplicitAny errors to be lost.
return parameterIndex >= getMinArgumentCount(signature, 1 /* StrongArityForUntypedJS */ | 2 /* VoidIsNonOptional */);
}
var iife = ts.getImmediatelyInvokedFunctionExpression(node.parent);
if (iife) {
return !node.type &&
!node.dotDotDotToken &&
node.parent.parameters.indexOf(node) >= iife.arguments.length;
}
return false;
}
function isOptionalPropertyDeclaration(node) {
return ts.isPropertyDeclaration(node) && node.questionToken;
}
function isOptionalJSDocPropertyLikeTag(node) {
if (!ts.isJSDocPropertyLikeTag(node)) {
return false;
}
var isBracketed = node.isBracketed, typeExpression = node.typeExpression;
return isBracketed || !!typeExpression && typeExpression.type.kind === 311 /* JSDocOptionalType */;
}
function createTypePredicate(kind, parameterName, parameterIndex, type) {
return { kind: kind, parameterName: parameterName, parameterIndex: parameterIndex, type: type };
}
/**
* Gets the minimum number of type arguments needed to satisfy all non-optional type
* parameters.
*/
function getMinTypeArgumentCount(typeParameters) {
var minTypeArgumentCount = 0;
if (typeParameters) {
for (var i = 0; i < typeParameters.length; i++) {
if (!hasTypeParameterDefault(typeParameters[i])) {
minTypeArgumentCount = i + 1;
}
}
}
return minTypeArgumentCount;
}
function fillMissingTypeArguments(typeArguments, typeParameters, minTypeArgumentCount, isJavaScriptImplicitAny) {
var numTypeParameters = ts.length(typeParameters);
if (!numTypeParameters) {
return [];
}
var numTypeArguments = ts.length(typeArguments);
if (isJavaScriptImplicitAny || (numTypeArguments >= minTypeArgumentCount && numTypeArguments <= numTypeParameters)) {
var result = typeArguments ? typeArguments.slice() : [];
// Map invalid forward references in default types to the error type
for (var i = numTypeArguments; i < numTypeParameters; i++) {
result[i] = errorType;
}
var baseDefaultType = getDefaultTypeArgumentType(isJavaScriptImplicitAny);
for (var i = numTypeArguments; i < numTypeParameters; i++) {
var defaultType = getDefaultFromTypeParameter(typeParameters[i]);
if (isJavaScriptImplicitAny && defaultType && (isTypeIdenticalTo(defaultType, unknownType) || isTypeIdenticalTo(defaultType, emptyObjectType))) {
defaultType = anyType;
}
result[i] = defaultType ? instantiateType(defaultType, createTypeMapper(typeParameters, result)) : baseDefaultType;
}
result.length = typeParameters.length;
return result;
}
return typeArguments && typeArguments.slice();
}
function getSignatureFromDeclaration(declaration) {
var links = getNodeLinks(declaration);
if (!links.resolvedSignature) {
var parameters = [];
var flags = 0 /* None */;
var minArgumentCount = 0;
var thisParameter = void 0;
var hasThisParameter = false;
var iife = ts.getImmediatelyInvokedFunctionExpression(declaration);
var isJSConstructSignature = ts.isJSDocConstructSignature(declaration);
var isUntypedSignatureInJSFile = !iife &&
ts.isInJSFile(declaration) &&
ts.isValueSignatureDeclaration(declaration) &&
!ts.hasJSDocParameterTags(declaration) &&
!ts.getJSDocType(declaration);
if (isUntypedSignatureInJSFile) {
flags |= 32 /* IsUntypedSignatureInJSFile */;
}
// If this is a JSDoc construct signature, then skip the first parameter in the
// parameter list. The first parameter represents the return type of the construct
// signature.
for (var i = isJSConstructSignature ? 1 : 0; i < declaration.parameters.length; i++) {
var param = declaration.parameters[i];
var paramSymbol = param.symbol;
var type = ts.isJSDocParameterTag(param) ? (param.typeExpression && param.typeExpression.type) : param.type;
// Include parameter symbol instead of property symbol in the signature
if (paramSymbol && !!(paramSymbol.flags & 4 /* Property */) && !ts.isBindingPattern(param.name)) {
var resolvedSymbol = resolveName(param, paramSymbol.escapedName, 111551 /* Value */, undefined, undefined, /*isUse*/ false);
paramSymbol = resolvedSymbol;
}
if (i === 0 && paramSymbol.escapedName === "this" /* This */) {
hasThisParameter = true;
thisParameter = param.symbol;
}
else {
parameters.push(paramSymbol);
}
if (type && type.kind === 194 /* LiteralType */) {
flags |= 2 /* HasLiteralTypes */;
}
// Record a new minimum argument count if this is not an optional parameter
var isOptionalParameter_1 = isOptionalJSDocPropertyLikeTag(param) ||
param.initializer || param.questionToken || ts.isRestParameter(param) ||
iife && parameters.length > iife.arguments.length && !type ||
isJSDocOptionalParameter(param);
if (!isOptionalParameter_1) {
minArgumentCount = parameters.length;
}
}
// If only one accessor includes a this-type annotation, the other behaves as if it had the same type annotation
if ((declaration.kind === 170 /* GetAccessor */ || declaration.kind === 171 /* SetAccessor */) &&
hasBindableName(declaration) &&
(!hasThisParameter || !thisParameter)) {
var otherKind = declaration.kind === 170 /* GetAccessor */ ? 171 /* SetAccessor */ : 170 /* GetAccessor */;
var other = ts.getDeclarationOfKind(getSymbolOfNode(declaration), otherKind);
if (other) {
thisParameter = getAnnotatedAccessorThisParameter(other);
}
}
var classType = declaration.kind === 169 /* Constructor */ ?
getDeclaredTypeOfClassOrInterface(getMergedSymbol(declaration.parent.symbol))
: undefined;
var typeParameters = classType ? classType.localTypeParameters : getTypeParametersFromDeclaration(declaration);
if (ts.hasRestParameter(declaration) || ts.isInJSFile(declaration) && maybeAddJsSyntheticRestParameter(declaration, parameters)) {
flags |= 1 /* HasRestParameter */;
}
if (ts.isConstructorTypeNode(declaration) && ts.hasSyntacticModifier(declaration, 128 /* Abstract */) ||
ts.isConstructorDeclaration(declaration) && ts.hasSyntacticModifier(declaration.parent, 128 /* Abstract */)) {
flags |= 4 /* Abstract */;
}
links.resolvedSignature = createSignature(declaration, typeParameters, thisParameter, parameters,
/*resolvedReturnType*/ undefined, /*resolvedTypePredicate*/ undefined, minArgumentCount, flags);
}
return links.resolvedSignature;
}
/**
* A JS function gets a synthetic rest parameter if it references `arguments` AND:
* 1. It has no parameters but at least one `@param` with a type that starts with `...`
* OR
* 2. It has at least one parameter, and the last parameter has a matching `@param` with a type that starts with `...`
*/
function maybeAddJsSyntheticRestParameter(declaration, parameters) {
if (ts.isJSDocSignature(declaration) || !containsArgumentsReference(declaration)) {
return false;
}
var lastParam = ts.lastOrUndefined(declaration.parameters);
var lastParamTags = lastParam ? ts.getJSDocParameterTags(lastParam) : ts.getJSDocTags(declaration).filter(ts.isJSDocParameterTag);
var lastParamVariadicType = ts.firstDefined(lastParamTags, function (p) {
return p.typeExpression && ts.isJSDocVariadicType(p.typeExpression.type) ? p.typeExpression.type : undefined;
});
var syntheticArgsSymbol = createSymbol(3 /* Variable */, "args", 32768 /* RestParameter */);
syntheticArgsSymbol.type = lastParamVariadicType ? createArrayType(getTypeFromTypeNode(lastParamVariadicType.type)) : anyArrayType;
if (lastParamVariadicType) {
// Replace the last parameter with a rest parameter.
parameters.pop();
}
parameters.push(syntheticArgsSymbol);
return true;
}
function getSignatureOfTypeTag(node) {
// should be attached to a function declaration or expression
if (!(ts.isInJSFile(node) && ts.isFunctionLikeDeclaration(node)))
return undefined;
var typeTag = ts.getJSDocTypeTag(node);
return (typeTag === null || typeTag === void 0 ? void 0 : typeTag.typeExpression) && getSingleCallSignature(getTypeFromTypeNode(typeTag.typeExpression));
}
function getReturnTypeOfTypeTag(node) {
var signature = getSignatureOfTypeTag(node);
return signature && getReturnTypeOfSignature(signature);
}
function containsArgumentsReference(declaration) {
var links = getNodeLinks(declaration);
if (links.containsArgumentsReference === undefined) {
if (links.flags & 8192 /* CaptureArguments */) {
links.containsArgumentsReference = true;
}
else {
links.containsArgumentsReference = traverse(declaration.body);
}
}
return links.containsArgumentsReference;
function traverse(node) {
if (!node)
return false;
switch (node.kind) {
case 79 /* Identifier */:
return node.escapedText === argumentsSymbol.escapedName && getResolvedSymbol(node) === argumentsSymbol;
case 165 /* PropertyDeclaration */:
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return node.name.kind === 160 /* ComputedPropertyName */
&& traverse(node.name);
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
return traverse(node.expression);
default:
return !ts.nodeStartsNewLexicalEnvironment(node) && !ts.isPartOfTypeNode(node) && !!ts.forEachChild(node, traverse);
}
}
}
function getSignaturesOfSymbol(symbol) {
if (!symbol || !symbol.declarations)
return ts.emptyArray;
var result = [];
for (var i = 0; i < symbol.declarations.length; i++) {
var decl = symbol.declarations[i];
if (!ts.isFunctionLike(decl))
continue;
// Don't include signature if node is the implementation of an overloaded function. A node is considered
// an implementation node if it has a body and the previous node is of the same kind and immediately
// precedes the implementation node (i.e. has the same parent and ends where the implementation starts).
if (i > 0 && decl.body) {
var previous = symbol.declarations[i - 1];
if (decl.parent === previous.parent && decl.kind === previous.kind && decl.pos === previous.end) {
continue;
}
}
result.push(getSignatureFromDeclaration(decl));
}
return result;
}
function resolveExternalModuleTypeByLiteral(name) {
var moduleSym = resolveExternalModuleName(name, name);
if (moduleSym) {
var resolvedModuleSymbol = resolveExternalModuleSymbol(moduleSym);
if (resolvedModuleSymbol) {
return getTypeOfSymbol(resolvedModuleSymbol);
}
}
return anyType;
}
function getThisTypeOfSignature(signature) {
if (signature.thisParameter) {
return getTypeOfSymbol(signature.thisParameter);
}
}
function getTypePredicateOfSignature(signature) {
if (!signature.resolvedTypePredicate) {
if (signature.target) {
var targetTypePredicate = getTypePredicateOfSignature(signature.target);
signature.resolvedTypePredicate = targetTypePredicate ? instantiateTypePredicate(targetTypePredicate, signature.mapper) : noTypePredicate;
}
else if (signature.compositeSignatures) {
signature.resolvedTypePredicate = getUnionOrIntersectionTypePredicate(signature.compositeSignatures, signature.compositeKind) || noTypePredicate;
}
else {
var type = signature.declaration && ts.getEffectiveReturnTypeNode(signature.declaration);
var jsdocPredicate = void 0;
if (!type && ts.isInJSFile(signature.declaration)) {
var jsdocSignature = getSignatureOfTypeTag(signature.declaration);
if (jsdocSignature && signature !== jsdocSignature) {
jsdocPredicate = getTypePredicateOfSignature(jsdocSignature);
}
}
signature.resolvedTypePredicate = type && ts.isTypePredicateNode(type) ?
createTypePredicateFromTypePredicateNode(type, signature) :
jsdocPredicate || noTypePredicate;
}
ts.Debug.assert(!!signature.resolvedTypePredicate);
}
return signature.resolvedTypePredicate === noTypePredicate ? undefined : signature.resolvedTypePredicate;
}
function createTypePredicateFromTypePredicateNode(node, signature) {
var parameterName = node.parameterName;
var type = node.type && getTypeFromTypeNode(node.type);
return parameterName.kind === 190 /* ThisType */ ?
createTypePredicate(node.assertsModifier ? 2 /* AssertsThis */ : 0 /* This */, /*parameterName*/ undefined, /*parameterIndex*/ undefined, type) :
createTypePredicate(node.assertsModifier ? 3 /* AssertsIdentifier */ : 1 /* Identifier */, parameterName.escapedText, ts.findIndex(signature.parameters, function (p) { return p.escapedName === parameterName.escapedText; }), type);
}
function getUnionOrIntersectionType(types, kind, unionReduction) {
return kind !== 2097152 /* Intersection */ ? getUnionType(types, unionReduction) : getIntersectionType(types);
}
function getReturnTypeOfSignature(signature) {
if (!signature.resolvedReturnType) {
if (!pushTypeResolution(signature, 3 /* ResolvedReturnType */)) {
return errorType;
}
var type = signature.target ? instantiateType(getReturnTypeOfSignature(signature.target), signature.mapper) :
signature.compositeSignatures ? instantiateType(getUnionOrIntersectionType(ts.map(signature.compositeSignatures, getReturnTypeOfSignature), signature.compositeKind, 2 /* Subtype */), signature.mapper) :
getReturnTypeFromAnnotation(signature.declaration) ||
(ts.nodeIsMissing(signature.declaration.body) ? anyType : getReturnTypeFromBody(signature.declaration));
if (signature.flags & 8 /* IsInnerCallChain */) {
type = addOptionalTypeMarker(type);
}
else if (signature.flags & 16 /* IsOuterCallChain */) {
type = getOptionalType(type);
}
if (!popTypeResolution()) {
if (signature.declaration) {
var typeNode = ts.getEffectiveReturnTypeNode(signature.declaration);
if (typeNode) {
error(typeNode, ts.Diagnostics.Return_type_annotation_circularly_references_itself);
}
else if (noImplicitAny) {
var declaration = signature.declaration;
var name = ts.getNameOfDeclaration(declaration);
if (name) {
error(name, ts.Diagnostics._0_implicitly_has_return_type_any_because_it_does_not_have_a_return_type_annotation_and_is_referenced_directly_or_indirectly_in_one_of_its_return_expressions, ts.declarationNameToString(name));
}
else {
error(declaration, ts.Diagnostics.Function_implicitly_has_return_type_any_because_it_does_not_have_a_return_type_annotation_and_is_referenced_directly_or_indirectly_in_one_of_its_return_expressions);
}
}
}
type = anyType;
}
signature.resolvedReturnType = type;
}
return signature.resolvedReturnType;
}
function getReturnTypeFromAnnotation(declaration) {
if (declaration.kind === 169 /* Constructor */) {
return getDeclaredTypeOfClassOrInterface(getMergedSymbol(declaration.parent.symbol));
}
if (ts.isJSDocConstructSignature(declaration)) {
return getTypeFromTypeNode(declaration.parameters[0].type); // TODO: GH#18217
}
var typeNode = ts.getEffectiveReturnTypeNode(declaration);
if (typeNode) {
return getTypeFromTypeNode(typeNode);
}
if (declaration.kind === 170 /* GetAccessor */ && hasBindableName(declaration)) {
var jsDocType = ts.isInJSFile(declaration) && getTypeForDeclarationFromJSDocComment(declaration);
if (jsDocType) {
return jsDocType;
}
var setter = ts.getDeclarationOfKind(getSymbolOfNode(declaration), 171 /* SetAccessor */);
var setterType = getAnnotatedAccessorType(setter);
if (setterType) {
return setterType;
}
}
return getReturnTypeOfTypeTag(declaration);
}
function isResolvingReturnTypeOfSignature(signature) {
return !signature.resolvedReturnType && findResolutionCycleStartIndex(signature, 3 /* ResolvedReturnType */) >= 0;
}
function getRestTypeOfSignature(signature) {
return tryGetRestTypeOfSignature(signature) || anyType;
}
function tryGetRestTypeOfSignature(signature) {
if (signatureHasRestParameter(signature)) {
var sigRestType = getTypeOfSymbol(signature.parameters[signature.parameters.length - 1]);
var restType = isTupleType(sigRestType) ? getRestTypeOfTupleType(sigRestType) : sigRestType;
return restType && getIndexTypeOfType(restType, numberType);
}
return undefined;
}
function getSignatureInstantiation(signature, typeArguments, isJavascript, inferredTypeParameters) {
var instantiatedSignature = getSignatureInstantiationWithoutFillingInTypeArguments(signature, fillMissingTypeArguments(typeArguments, signature.typeParameters, getMinTypeArgumentCount(signature.typeParameters), isJavascript));
if (inferredTypeParameters) {
var returnSignature = getSingleCallOrConstructSignature(getReturnTypeOfSignature(instantiatedSignature));
if (returnSignature) {
var newReturnSignature = cloneSignature(returnSignature);
newReturnSignature.typeParameters = inferredTypeParameters;
var newInstantiatedSignature = cloneSignature(instantiatedSignature);
newInstantiatedSignature.resolvedReturnType = getOrCreateTypeFromSignature(newReturnSignature);
return newInstantiatedSignature;
}
}
return instantiatedSignature;
}
function getSignatureInstantiationWithoutFillingInTypeArguments(signature, typeArguments) {
var instantiations = signature.instantiations || (signature.instantiations = new ts.Map());
var id = getTypeListId(typeArguments);
var instantiation = instantiations.get(id);
if (!instantiation) {
instantiations.set(id, instantiation = createSignatureInstantiation(signature, typeArguments));
}
return instantiation;
}
function createSignatureInstantiation(signature, typeArguments) {
return instantiateSignature(signature, createSignatureTypeMapper(signature, typeArguments), /*eraseTypeParameters*/ true);
}
function createSignatureTypeMapper(signature, typeArguments) {
return createTypeMapper(signature.typeParameters, typeArguments);
}
function getErasedSignature(signature) {
return signature.typeParameters ?
signature.erasedSignatureCache || (signature.erasedSignatureCache = createErasedSignature(signature)) :
signature;
}
function createErasedSignature(signature) {
// Create an instantiation of the signature where all type arguments are the any type.
return instantiateSignature(signature, createTypeEraser(signature.typeParameters), /*eraseTypeParameters*/ true);
}
function getCanonicalSignature(signature) {
return signature.typeParameters ?
signature.canonicalSignatureCache || (signature.canonicalSignatureCache = createCanonicalSignature(signature)) :
signature;
}
function createCanonicalSignature(signature) {
// Create an instantiation of the signature where each unconstrained type parameter is replaced with
// its original. When a generic class or interface is instantiated, each generic method in the class or
// interface is instantiated with a fresh set of cloned type parameters (which we need to handle scenarios
// where different generations of the same type parameter are in scope). This leads to a lot of new type
// identities, and potentially a lot of work comparing those identities, so here we create an instantiation
// that uses the original type identities for all unconstrained type parameters.
return getSignatureInstantiation(signature, ts.map(signature.typeParameters, function (tp) { return tp.target && !getConstraintOfTypeParameter(tp.target) ? tp.target : tp; }), ts.isInJSFile(signature.declaration));
}
function getBaseSignature(signature) {
var typeParameters = signature.typeParameters;
if (typeParameters) {
if (signature.baseSignatureCache) {
return signature.baseSignatureCache;
}
var typeEraser = createTypeEraser(typeParameters);
var baseConstraintMapper_1 = createTypeMapper(typeParameters, ts.map(typeParameters, function (tp) { return getConstraintOfTypeParameter(tp) || unknownType; }));
var baseConstraints = ts.map(typeParameters, function (tp) { return instantiateType(tp, baseConstraintMapper_1) || unknownType; });
// Run N type params thru the immediate constraint mapper up to N times
// This way any noncircular interdependent type parameters are definitely resolved to their external dependencies
for (var i = 0; i < typeParameters.length - 1; i++) {
baseConstraints = instantiateTypes(baseConstraints, baseConstraintMapper_1);
}
// and then apply a type eraser to remove any remaining circularly dependent type parameters
baseConstraints = instantiateTypes(baseConstraints, typeEraser);
return signature.baseSignatureCache = instantiateSignature(signature, createTypeMapper(typeParameters, baseConstraints), /*eraseTypeParameters*/ true);
}
return signature;
}
function getOrCreateTypeFromSignature(signature) {
// There are two ways to declare a construct signature, one is by declaring a class constructor
// using the constructor keyword, and the other is declaring a bare construct signature in an
// object type literal or interface (using the new keyword). Each way of declaring a constructor
// will result in a different declaration kind.
if (!signature.isolatedSignatureType) {
var kind = signature.declaration ? signature.declaration.kind : 0 /* Unknown */;
var isConstructor = kind === 169 /* Constructor */ || kind === 173 /* ConstructSignature */ || kind === 178 /* ConstructorType */;
var type = createObjectType(16 /* Anonymous */);
type.members = emptySymbols;
type.properties = ts.emptyArray;
type.callSignatures = !isConstructor ? [signature] : ts.emptyArray;
type.constructSignatures = isConstructor ? [signature] : ts.emptyArray;
type.indexInfos = ts.emptyArray;
signature.isolatedSignatureType = type;
}
return signature.isolatedSignatureType;
}
function getIndexSymbol(symbol) {
return symbol.members ? getIndexSymbolFromSymbolTable(symbol.members) : undefined;
}
function getIndexSymbolFromSymbolTable(symbolTable) {
return symbolTable.get("__index" /* Index */);
}
function createIndexInfo(keyType, type, isReadonly, declaration) {
return { keyType: keyType, type: type, isReadonly: isReadonly, declaration: declaration };
}
function getIndexInfosOfSymbol(symbol) {
var indexSymbol = getIndexSymbol(symbol);
return indexSymbol ? getIndexInfosOfIndexSymbol(indexSymbol) : ts.emptyArray;
}
function getIndexInfosOfIndexSymbol(indexSymbol) {
if (indexSymbol.declarations) {
var indexInfos_2 = [];
var _loop_14 = function (declaration) {
if (declaration.parameters.length === 1) {
var parameter = declaration.parameters[0];
if (parameter.type) {
forEachType(getTypeFromTypeNode(parameter.type), function (keyType) {
if (isValidIndexKeyType(keyType) && !findIndexInfo(indexInfos_2, keyType)) {
indexInfos_2.push(createIndexInfo(keyType, declaration.type ? getTypeFromTypeNode(declaration.type) : anyType, ts.hasEffectiveModifier(declaration, 64 /* Readonly */), declaration));
}
});
}
}
};
for (var _i = 0, _a = indexSymbol.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
_loop_14(declaration);
}
return indexInfos_2;
}
return ts.emptyArray;
}
function isValidIndexKeyType(type) {
return !!(type.flags & (4 /* String */ | 8 /* Number */ | 4096 /* ESSymbol */)) || isPatternLiteralType(type) ||
!!(type.flags & 2097152 /* Intersection */) && !isGenericIndexType(type) && !isGenericObjectType(type) && ts.some(type.types, isValidIndexKeyType);
}
function getConstraintDeclaration(type) {
return ts.mapDefined(ts.filter(type.symbol && type.symbol.declarations, ts.isTypeParameterDeclaration), ts.getEffectiveConstraintOfTypeParameter)[0];
}
function getInferredTypeParameterConstraint(typeParameter) {
var _a;
var inferences;
if ((_a = typeParameter.symbol) === null || _a === void 0 ? void 0 : _a.declarations) {
for (var _i = 0, _b = typeParameter.symbol.declarations; _i < _b.length; _i++) {
var declaration = _b[_i];
if (declaration.parent.kind === 188 /* InferType */) {
// When an 'infer T' declaration is immediately contained in a type reference node
// (such as 'Foo<infer T>'), T's constraint is inferred from the constraint of the
// corresponding type parameter in 'Foo'. When multiple 'infer T' declarations are
// present, we form an intersection of the inferred constraint types.
var _c = ts.walkUpParenthesizedTypesAndGetParentAndChild(declaration.parent.parent), _d = _c[0], childTypeParameter = _d === void 0 ? declaration.parent : _d, grandParent = _c[1];
if (grandParent.kind === 176 /* TypeReference */) {
var typeReference = grandParent;
var typeParameters = getTypeParametersForTypeReference(typeReference);
if (typeParameters) {
var index = typeReference.typeArguments.indexOf(childTypeParameter);
if (index < typeParameters.length) {
var declaredConstraint = getConstraintOfTypeParameter(typeParameters[index]);
if (declaredConstraint) {
// Type parameter constraints can reference other type parameters so
// constraints need to be instantiated. If instantiation produces the
// type parameter itself, we discard that inference. For example, in
// type Foo<T extends string, U extends T> = [T, U];
// type Bar<T> = T extends Foo<infer X, infer X> ? Foo<X, X> : T;
// the instantiated constraint for U is X, so we discard that inference.
var mapper = createTypeMapper(typeParameters, getEffectiveTypeArguments(typeReference, typeParameters));
var constraint = instantiateType(declaredConstraint, mapper);
if (constraint !== typeParameter) {
inferences = ts.append(inferences, constraint);
}
}
}
}
}
// When an 'infer T' declaration is immediately contained in a rest parameter declaration, a rest type
// or a named rest tuple element, we infer an 'unknown[]' constraint.
else if (grandParent.kind === 162 /* Parameter */ && grandParent.dotDotDotToken ||
grandParent.kind === 184 /* RestType */ ||
grandParent.kind === 195 /* NamedTupleMember */ && grandParent.dotDotDotToken) {
inferences = ts.append(inferences, createArrayType(unknownType));
}
// When an 'infer T' declaration is immediately contained in a string template type, we infer a 'string'
// constraint.
else if (grandParent.kind === 197 /* TemplateLiteralTypeSpan */) {
inferences = ts.append(inferences, stringType);
}
// When an 'infer T' declaration is in the constraint position of a mapped type, we infer a 'keyof any'
// constraint.
else if (grandParent.kind === 161 /* TypeParameter */ && grandParent.parent.kind === 193 /* MappedType */) {
inferences = ts.append(inferences, keyofConstraintType);
}
// When an 'infer T' declaration is the template of a mapped type, and that mapped type is the extends
// clause of a conditional whose check type is also a mapped type, give it a constraint equal to the template
// of the check type's mapped type
else if (grandParent.kind === 193 /* MappedType */ && grandParent.type &&
ts.skipParentheses(grandParent.type) === declaration.parent && grandParent.parent.kind === 187 /* ConditionalType */ &&
grandParent.parent.extendsType === grandParent && grandParent.parent.checkType.kind === 193 /* MappedType */ &&
grandParent.parent.checkType.type) {
var checkMappedType_1 = grandParent.parent.checkType;
var nodeType = getTypeFromTypeNode(checkMappedType_1.type);
inferences = ts.append(inferences, instantiateType(nodeType, makeUnaryTypeMapper(getDeclaredTypeOfTypeParameter(getSymbolOfNode(checkMappedType_1.typeParameter)), checkMappedType_1.typeParameter.constraint ? getTypeFromTypeNode(checkMappedType_1.typeParameter.constraint) : keyofConstraintType)));
}
}
}
}
return inferences && getIntersectionType(inferences);
}
/** This is a worker function. Use getConstraintOfTypeParameter which guards against circular constraints. */
function getConstraintFromTypeParameter(typeParameter) {
if (!typeParameter.constraint) {
if (typeParameter.target) {
var targetConstraint = getConstraintOfTypeParameter(typeParameter.target);
typeParameter.constraint = targetConstraint ? instantiateType(targetConstraint, typeParameter.mapper) : noConstraintType;
}
else {
var constraintDeclaration = getConstraintDeclaration(typeParameter);
if (!constraintDeclaration) {
typeParameter.constraint = getInferredTypeParameterConstraint(typeParameter) || noConstraintType;
}
else {
var type = getTypeFromTypeNode(constraintDeclaration);
if (type.flags & 1 /* Any */ && type !== errorType) { // Allow errorType to propegate to keep downstream errors suppressed
// use keyofConstraintType as the base constraint for mapped type key constraints (unknown isn;t assignable to that, but `any` was),
// use unknown otherwise
type = constraintDeclaration.parent.parent.kind === 193 /* MappedType */ ? keyofConstraintType : unknownType;
}
typeParameter.constraint = type;
}
}
}
return typeParameter.constraint === noConstraintType ? undefined : typeParameter.constraint;
}
function getParentSymbolOfTypeParameter(typeParameter) {
var tp = ts.getDeclarationOfKind(typeParameter.symbol, 161 /* TypeParameter */);
var host = ts.isJSDocTemplateTag(tp.parent) ? ts.getHostSignatureFromJSDoc(tp.parent) : tp.parent;
return host && getSymbolOfNode(host);
}
function getTypeListId(types) {
var result = "";
if (types) {
var length_4 = types.length;
var i = 0;
while (i < length_4) {
var startId = types[i].id;
var count = 1;
while (i + count < length_4 && types[i + count].id === startId + count) {
count++;
}
if (result.length) {
result += ",";
}
result += startId;
if (count > 1) {
result += ":" + count;
}
i += count;
}
}
return result;
}
function getAliasId(aliasSymbol, aliasTypeArguments) {
return aliasSymbol ? "@" + getSymbolId(aliasSymbol) + (aliasTypeArguments ? ":" + getTypeListId(aliasTypeArguments) : "") : "";
}
// This function is used to propagate certain flags when creating new object type references and union types.
// It is only necessary to do so if a constituent type might be the undefined type, the null type, the type
// of an object literal or the anyFunctionType. This is because there are operations in the type checker
// that care about the presence of such types at arbitrary depth in a containing type.
function getPropagatingFlagsOfTypes(types, excludeKinds) {
var result = 0;
for (var _i = 0, types_8 = types; _i < types_8.length; _i++) {
var type = types_8[_i];
if (!(type.flags & excludeKinds)) {
result |= ts.getObjectFlags(type);
}
}
return result & 917504 /* PropagatingFlags */;
}
function createTypeReference(target, typeArguments) {
var id = getTypeListId(typeArguments);
var type = target.instantiations.get(id);
if (!type) {
type = createObjectType(4 /* Reference */, target.symbol);
target.instantiations.set(id, type);
type.objectFlags |= typeArguments ? getPropagatingFlagsOfTypes(typeArguments, /*excludeKinds*/ 0) : 0;
type.target = target;
type.resolvedTypeArguments = typeArguments;
}
return type;
}
function cloneTypeReference(source) {
var type = createType(source.flags);
type.symbol = source.symbol;
type.objectFlags = source.objectFlags;
type.target = source.target;
type.resolvedTypeArguments = source.resolvedTypeArguments;
return type;
}
function createDeferredTypeReference(target, node, mapper, aliasSymbol, aliasTypeArguments) {
if (!aliasSymbol) {
aliasSymbol = getAliasSymbolForTypeNode(node);
var localAliasTypeArguments = getTypeArgumentsForAliasSymbol(aliasSymbol);
aliasTypeArguments = mapper ? instantiateTypes(localAliasTypeArguments, mapper) : localAliasTypeArguments;
}
var type = createObjectType(4 /* Reference */, target.symbol);
type.target = target;
type.node = node;
type.mapper = mapper;
type.aliasSymbol = aliasSymbol;
type.aliasTypeArguments = aliasTypeArguments;
return type;
}
function getTypeArguments(type) {
var _a, _b;
if (!type.resolvedTypeArguments) {
if (!pushTypeResolution(type, 6 /* ResolvedTypeArguments */)) {
return ((_a = type.target.localTypeParameters) === null || _a === void 0 ? void 0 : _a.map(function () { return errorType; })) || ts.emptyArray;
}
var node = type.node;
var typeArguments = !node ? ts.emptyArray :
node.kind === 176 /* TypeReference */ ? ts.concatenate(type.target.outerTypeParameters, getEffectiveTypeArguments(node, type.target.localTypeParameters)) :
node.kind === 181 /* ArrayType */ ? [getTypeFromTypeNode(node.elementType)] :
ts.map(node.elements, getTypeFromTypeNode);
if (popTypeResolution()) {
type.resolvedTypeArguments = type.mapper ? instantiateTypes(typeArguments, type.mapper) : typeArguments;
}
else {
type.resolvedTypeArguments = ((_b = type.target.localTypeParameters) === null || _b === void 0 ? void 0 : _b.map(function () { return errorType; })) || ts.emptyArray;
error(type.node || currentNode, type.target.symbol ? ts.Diagnostics.Type_arguments_for_0_circularly_reference_themselves : ts.Diagnostics.Tuple_type_arguments_circularly_reference_themselves, type.target.symbol && symbolToString(type.target.symbol));
}
}
return type.resolvedTypeArguments;
}
function getTypeReferenceArity(type) {
return ts.length(type.target.typeParameters);
}
/**
* Get type from type-reference that reference to class or interface
*/
function getTypeFromClassOrInterfaceReference(node, symbol) {
var type = getDeclaredTypeOfSymbol(getMergedSymbol(symbol));
var typeParameters = type.localTypeParameters;
if (typeParameters) {
var numTypeArguments = ts.length(node.typeArguments);
var minTypeArgumentCount = getMinTypeArgumentCount(typeParameters);
var isJs = ts.isInJSFile(node);
var isJsImplicitAny = !noImplicitAny && isJs;
if (!isJsImplicitAny && (numTypeArguments < minTypeArgumentCount || numTypeArguments > typeParameters.length)) {
var missingAugmentsTag = isJs && ts.isExpressionWithTypeArguments(node) && !ts.isJSDocAugmentsTag(node.parent);
var diag = minTypeArgumentCount === typeParameters.length ?
missingAugmentsTag ?
ts.Diagnostics.Expected_0_type_arguments_provide_these_with_an_extends_tag :
ts.Diagnostics.Generic_type_0_requires_1_type_argument_s :
missingAugmentsTag ?
ts.Diagnostics.Expected_0_1_type_arguments_provide_these_with_an_extends_tag :
ts.Diagnostics.Generic_type_0_requires_between_1_and_2_type_arguments;
var typeStr = typeToString(type, /*enclosingDeclaration*/ undefined, 2 /* WriteArrayAsGenericType */);
error(node, diag, typeStr, minTypeArgumentCount, typeParameters.length);
if (!isJs) {
// TODO: Adopt same permissive behavior in TS as in JS to reduce follow-on editing experience failures (requires editing fillMissingTypeArguments)
return errorType;
}
}
if (node.kind === 176 /* TypeReference */ && isDeferredTypeReferenceNode(node, ts.length(node.typeArguments) !== typeParameters.length)) {
return createDeferredTypeReference(type, node, /*mapper*/ undefined);
}
// In a type reference, the outer type parameters of the referenced class or interface are automatically
// supplied as type arguments and the type reference only specifies arguments for the local type parameters
// of the class or interface.
var typeArguments = ts.concatenate(type.outerTypeParameters, fillMissingTypeArguments(typeArgumentsFromTypeReferenceNode(node), typeParameters, minTypeArgumentCount, isJs));
return createTypeReference(type, typeArguments);
}
return checkNoTypeArguments(node, symbol) ? type : errorType;
}
function getTypeAliasInstantiation(symbol, typeArguments, aliasSymbol, aliasTypeArguments) {
var type = getDeclaredTypeOfSymbol(symbol);
if (type === intrinsicMarkerType && intrinsicTypeKinds.has(symbol.escapedName) && typeArguments && typeArguments.length === 1) {
return getStringMappingType(symbol, typeArguments[0]);
}
var links = getSymbolLinks(symbol);
var typeParameters = links.typeParameters;
var id = getTypeListId(typeArguments) + getAliasId(aliasSymbol, aliasTypeArguments);
var instantiation = links.instantiations.get(id);
if (!instantiation) {
links.instantiations.set(id, instantiation = instantiateTypeWithAlias(type, createTypeMapper(typeParameters, fillMissingTypeArguments(typeArguments, typeParameters, getMinTypeArgumentCount(typeParameters), ts.isInJSFile(symbol.valueDeclaration))), aliasSymbol, aliasTypeArguments));
}
return instantiation;
}
/**
* Get type from reference to type alias. When a type alias is generic, the declared type of the type alias may include
* references to the type parameters of the alias. We replace those with the actual type arguments by instantiating the
* declared type. Instantiations are cached using the type identities of the type arguments as the key.
*/
function getTypeFromTypeAliasReference(node, symbol) {
var type = getDeclaredTypeOfSymbol(symbol);
var typeParameters = getSymbolLinks(symbol).typeParameters;
if (typeParameters) {
var numTypeArguments = ts.length(node.typeArguments);
var minTypeArgumentCount = getMinTypeArgumentCount(typeParameters);
if (numTypeArguments < minTypeArgumentCount || numTypeArguments > typeParameters.length) {
error(node, minTypeArgumentCount === typeParameters.length ?
ts.Diagnostics.Generic_type_0_requires_1_type_argument_s :
ts.Diagnostics.Generic_type_0_requires_between_1_and_2_type_arguments, symbolToString(symbol), minTypeArgumentCount, typeParameters.length);
return errorType;
}
// We refrain from associating a local type alias with an instantiation of a top-level type alias
// because the local alias may end up being referenced in an inferred return type where it is not
// accessible--which in turn may lead to a large structural expansion of the type when generating
// a .d.ts file. See #43622 for an example.
var aliasSymbol = getAliasSymbolForTypeNode(node);
var newAliasSymbol = aliasSymbol && (isLocalTypeAlias(symbol) || !isLocalTypeAlias(aliasSymbol)) ? aliasSymbol : undefined;
return getTypeAliasInstantiation(symbol, typeArgumentsFromTypeReferenceNode(node), newAliasSymbol, getTypeArgumentsForAliasSymbol(newAliasSymbol));
}
return checkNoTypeArguments(node, symbol) ? type : errorType;
}
function isLocalTypeAlias(symbol) {
var _a;
var declaration = (_a = symbol.declarations) === null || _a === void 0 ? void 0 : _a.find(ts.isTypeAlias);
return !!(declaration && ts.getContainingFunction(declaration));
}
function getTypeReferenceName(node) {
switch (node.kind) {
case 176 /* TypeReference */:
return node.typeName;
case 226 /* ExpressionWithTypeArguments */:
// We only support expressions that are simple qualified names. For other
// expressions this produces undefined.
var expr = node.expression;
if (ts.isEntityNameExpression(expr)) {
return expr;
}
// fall through;
}
return undefined;
}
function resolveTypeReferenceName(typeReferenceName, meaning, ignoreErrors) {
if (!typeReferenceName) {
return unknownSymbol;
}
return resolveEntityName(typeReferenceName, meaning, ignoreErrors) || unknownSymbol;
}
function getTypeReferenceType(node, symbol) {
if (symbol === unknownSymbol) {
return errorType;
}
symbol = getExpandoSymbol(symbol) || symbol;
if (symbol.flags & (32 /* Class */ | 64 /* Interface */)) {
return getTypeFromClassOrInterfaceReference(node, symbol);
}
if (symbol.flags & 524288 /* TypeAlias */) {
return getTypeFromTypeAliasReference(node, symbol);
}
// Get type from reference to named type that cannot be generic (enum or type parameter)
var res = tryGetDeclaredTypeOfSymbol(symbol);
if (res) {
return checkNoTypeArguments(node, symbol) ? getRegularTypeOfLiteralType(res) : errorType;
}
if (symbol.flags & 111551 /* Value */ && isJSDocTypeReference(node)) {
var jsdocType = getTypeFromJSDocValueReference(node, symbol);
if (jsdocType) {
return jsdocType;
}
else {
// Resolve the type reference as a Type for the purpose of reporting errors.
resolveTypeReferenceName(getTypeReferenceName(node), 788968 /* Type */);
return getTypeOfSymbol(symbol);
}
}
return errorType;
}
/**
* A JSdoc TypeReference may be to a value, but resolve it as a type anyway.
* Example: import('./b').ConstructorFunction
*/
function getTypeFromJSDocValueReference(node, symbol) {
var links = getNodeLinks(node);
if (!links.resolvedJSDocType) {
var valueType = getTypeOfSymbol(symbol);
var typeType = valueType;
if (symbol.valueDeclaration) {
var isImportTypeWithQualifier = node.kind === 198 /* ImportType */ && node.qualifier;
// valueType might not have a symbol, eg, {import('./b').STRING_LITERAL}
if (valueType.symbol && valueType.symbol !== symbol && isImportTypeWithQualifier) {
typeType = getTypeReferenceType(node, valueType.symbol);
}
}
links.resolvedJSDocType = typeType;
}
return links.resolvedJSDocType;
}
function getSubstitutionType(baseType, substitute) {
if (substitute.flags & 3 /* AnyOrUnknown */ || substitute === baseType) {
return baseType;
}
var id = getTypeId(baseType) + ">" + getTypeId(substitute);
var cached = substitutionTypes.get(id);
if (cached) {
return cached;
}
var result = createType(33554432 /* Substitution */);
result.baseType = baseType;
result.substitute = substitute;
substitutionTypes.set(id, result);
return result;
}
function isUnaryTupleTypeNode(node) {
return node.kind === 182 /* TupleType */ && node.elements.length === 1;
}
function getImpliedConstraint(type, checkNode, extendsNode) {
return isUnaryTupleTypeNode(checkNode) && isUnaryTupleTypeNode(extendsNode) ? getImpliedConstraint(type, checkNode.elements[0], extendsNode.elements[0]) :
getActualTypeVariable(getTypeFromTypeNode(checkNode)) === type ? getTypeFromTypeNode(extendsNode) :
undefined;
}
function getConditionalFlowTypeOfType(type, node) {
var constraints;
var covariant = true;
while (node && !ts.isStatement(node) && node.kind !== 315 /* JSDocComment */) {
var parent = node.parent;
// only consider variance flipped by parameter locations - `keyof` types would usually be considered variance inverting, but
// often get used in indexed accesses where they behave sortof invariantly, but our checking is lax
if (parent.kind === 162 /* Parameter */) {
covariant = !covariant;
}
// Always substitute on type parameters, regardless of variance, since even
// in contravariant positions, they may rely on substituted constraints to be valid
if ((covariant || type.flags & 8650752 /* TypeVariable */) && parent.kind === 187 /* ConditionalType */ && node === parent.trueType) {
var constraint = getImpliedConstraint(type, parent.checkType, parent.extendsType);
if (constraint) {
constraints = ts.append(constraints, constraint);
}
}
node = parent;
}
return constraints ? getSubstitutionType(type, getIntersectionType(ts.append(constraints, type))) : type;
}
function isJSDocTypeReference(node) {
return !!(node.flags & 4194304 /* JSDoc */) && (node.kind === 176 /* TypeReference */ || node.kind === 198 /* ImportType */);
}
function checkNoTypeArguments(node, symbol) {
if (node.typeArguments) {
error(node, ts.Diagnostics.Type_0_is_not_generic, symbol ? symbolToString(symbol) : node.typeName ? ts.declarationNameToString(node.typeName) : anon);
return false;
}
return true;
}
function getIntendedTypeFromJSDocTypeReference(node) {
if (ts.isIdentifier(node.typeName)) {
var typeArgs = node.typeArguments;
switch (node.typeName.escapedText) {
case "String":
checkNoTypeArguments(node);
return stringType;
case "Number":
checkNoTypeArguments(node);
return numberType;
case "Boolean":
checkNoTypeArguments(node);
return booleanType;
case "Void":
checkNoTypeArguments(node);
return voidType;
case "Undefined":
checkNoTypeArguments(node);
return undefinedType;
case "Null":
checkNoTypeArguments(node);
return nullType;
case "Function":
case "function":
checkNoTypeArguments(node);
return globalFunctionType;
case "array":
return (!typeArgs || !typeArgs.length) && !noImplicitAny ? anyArrayType : undefined;
case "promise":
return (!typeArgs || !typeArgs.length) && !noImplicitAny ? createPromiseType(anyType) : undefined;
case "Object":
if (typeArgs && typeArgs.length === 2) {
if (ts.isJSDocIndexSignature(node)) {
var indexed = getTypeFromTypeNode(typeArgs[0]);
var target = getTypeFromTypeNode(typeArgs[1]);
var indexInfo = indexed === stringType || indexed === numberType ? [createIndexInfo(indexed, target, /*isReadonly*/ false)] : ts.emptyArray;
return createAnonymousType(undefined, emptySymbols, ts.emptyArray, ts.emptyArray, indexInfo);
}
return anyType;
}
checkNoTypeArguments(node);
return !noImplicitAny ? anyType : undefined;
}
}
}
function getTypeFromJSDocNullableTypeNode(node) {
var type = getTypeFromTypeNode(node.type);
return strictNullChecks ? getNullableType(type, 65536 /* Null */) : type;
}
function getTypeFromTypeReference(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
// handle LS queries on the `const` in `x as const` by resolving to the type of `x`
if (ts.isConstTypeReference(node) && ts.isAssertionExpression(node.parent)) {
links.resolvedSymbol = unknownSymbol;
return links.resolvedType = checkExpressionCached(node.parent.expression);
}
var symbol = void 0;
var type = void 0;
var meaning = 788968 /* Type */;
if (isJSDocTypeReference(node)) {
type = getIntendedTypeFromJSDocTypeReference(node);
if (!type) {
symbol = resolveTypeReferenceName(getTypeReferenceName(node), meaning, /*ignoreErrors*/ true);
if (symbol === unknownSymbol) {
symbol = resolveTypeReferenceName(getTypeReferenceName(node), meaning | 111551 /* Value */);
}
else {
resolveTypeReferenceName(getTypeReferenceName(node), meaning); // Resolve again to mark errors, if any
}
type = getTypeReferenceType(node, symbol);
}
}
if (!type) {
symbol = resolveTypeReferenceName(getTypeReferenceName(node), meaning);
type = getTypeReferenceType(node, symbol);
}
// Cache both the resolved symbol and the resolved type. The resolved symbol is needed when we check the
// type reference in checkTypeReferenceNode.
links.resolvedSymbol = symbol;
links.resolvedType = type;
}
return links.resolvedType;
}
function typeArgumentsFromTypeReferenceNode(node) {
return ts.map(node.typeArguments, getTypeFromTypeNode);
}
function getTypeFromTypeQueryNode(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
// TypeScript 1.0 spec (April 2014): 3.6.3
// The expression is processed as an identifier expression (section 4.3)
// or property access expression(section 4.10),
// the widened type(section 3.9) of which becomes the result.
var type = ts.isThisIdentifier(node.exprName) ? checkThisExpression(node.exprName) : checkExpression(node.exprName);
links.resolvedType = getRegularTypeOfLiteralType(getWidenedType(type));
}
return links.resolvedType;
}
function getTypeOfGlobalSymbol(symbol, arity) {
function getTypeDeclaration(symbol) {
var declarations = symbol.declarations;
if (declarations) {
for (var _i = 0, declarations_3 = declarations; _i < declarations_3.length; _i++) {
var declaration = declarations_3[_i];
switch (declaration.kind) {
case 255 /* ClassDeclaration */:
case 256 /* InterfaceDeclaration */:
case 258 /* EnumDeclaration */:
return declaration;
}
}
}
}
if (!symbol) {
return arity ? emptyGenericType : emptyObjectType;
}
var type = getDeclaredTypeOfSymbol(symbol);
if (!(type.flags & 524288 /* Object */)) {
error(getTypeDeclaration(symbol), ts.Diagnostics.Global_type_0_must_be_a_class_or_interface_type, ts.symbolName(symbol));
return arity ? emptyGenericType : emptyObjectType;
}
if (ts.length(type.typeParameters) !== arity) {
error(getTypeDeclaration(symbol), ts.Diagnostics.Global_type_0_must_have_1_type_parameter_s, ts.symbolName(symbol), arity);
return arity ? emptyGenericType : emptyObjectType;
}
return type;
}
function getGlobalValueSymbol(name, reportErrors) {
return getGlobalSymbol(name, 111551 /* Value */, reportErrors ? ts.Diagnostics.Cannot_find_global_value_0 : undefined);
}
function getGlobalTypeSymbol(name, reportErrors) {
return getGlobalSymbol(name, 788968 /* Type */, reportErrors ? ts.Diagnostics.Cannot_find_global_type_0 : undefined);
}
function getGlobalSymbol(name, meaning, diagnostic) {
// Don't track references for global symbols anyway, so value if `isReference` is arbitrary
return resolveName(undefined, name, meaning, diagnostic, name, /*isUse*/ false);
}
function getGlobalType(name, arity, reportErrors) {
var symbol = getGlobalTypeSymbol(name, reportErrors);
return symbol || reportErrors ? getTypeOfGlobalSymbol(symbol, arity) : undefined;
}
function getGlobalTypedPropertyDescriptorType() {
return deferredGlobalTypedPropertyDescriptorType || (deferredGlobalTypedPropertyDescriptorType = getGlobalType("TypedPropertyDescriptor", /*arity*/ 1, /*reportErrors*/ true)) || emptyGenericType;
}
function getGlobalTemplateStringsArrayType() {
return deferredGlobalTemplateStringsArrayType || (deferredGlobalTemplateStringsArrayType = getGlobalType("TemplateStringsArray", /*arity*/ 0, /*reportErrors*/ true)) || emptyObjectType;
}
function getGlobalImportMetaType() {
return deferredGlobalImportMetaType || (deferredGlobalImportMetaType = getGlobalType("ImportMeta", /*arity*/ 0, /*reportErrors*/ true)) || emptyObjectType;
}
function getGlobalImportMetaExpressionType() {
if (!deferredGlobalImportMetaExpressionType) {
// Create a synthetic type `ImportMetaExpression { meta: MetaProperty }`
var symbol = createSymbol(0 /* None */, "ImportMetaExpression");
var importMetaType = getGlobalImportMetaType();
var metaPropertySymbol = createSymbol(4 /* Property */, "meta", 8 /* Readonly */);
metaPropertySymbol.parent = symbol;
metaPropertySymbol.type = importMetaType;
var members = ts.createSymbolTable([metaPropertySymbol]);
symbol.members = members;
deferredGlobalImportMetaExpressionType = createAnonymousType(symbol, members, ts.emptyArray, ts.emptyArray, ts.emptyArray);
}
return deferredGlobalImportMetaExpressionType;
}
function getGlobalESSymbolConstructorSymbol(reportErrors) {
return deferredGlobalESSymbolConstructorSymbol || (deferredGlobalESSymbolConstructorSymbol = getGlobalValueSymbol("Symbol", reportErrors));
}
function getGlobalESSymbolConstructorTypeSymbol(reportErrors) {
return deferredGlobalESSymbolConstructorTypeSymbol || (deferredGlobalESSymbolConstructorTypeSymbol = getGlobalTypeSymbol("SymbolConstructor", reportErrors));
}
function getGlobalESSymbolType(reportErrors) {
return deferredGlobalESSymbolType || (deferredGlobalESSymbolType = getGlobalType("Symbol", /*arity*/ 0, reportErrors)) || emptyObjectType;
}
function getGlobalPromiseType(reportErrors) {
return deferredGlobalPromiseType || (deferredGlobalPromiseType = getGlobalType("Promise", /*arity*/ 1, reportErrors)) || emptyGenericType;
}
function getGlobalPromiseLikeType(reportErrors) {
return deferredGlobalPromiseLikeType || (deferredGlobalPromiseLikeType = getGlobalType("PromiseLike", /*arity*/ 1, reportErrors)) || emptyGenericType;
}
function getGlobalPromiseConstructorSymbol(reportErrors) {
return deferredGlobalPromiseConstructorSymbol || (deferredGlobalPromiseConstructorSymbol = getGlobalValueSymbol("Promise", reportErrors));
}
function getGlobalPromiseConstructorLikeType(reportErrors) {
return deferredGlobalPromiseConstructorLikeType || (deferredGlobalPromiseConstructorLikeType = getGlobalType("PromiseConstructorLike", /*arity*/ 0, reportErrors)) || emptyObjectType;
}
function getGlobalAsyncIterableType(reportErrors) {
return deferredGlobalAsyncIterableType || (deferredGlobalAsyncIterableType = getGlobalType("AsyncIterable", /*arity*/ 1, reportErrors)) || emptyGenericType;
}
function getGlobalAsyncIteratorType(reportErrors) {
return deferredGlobalAsyncIteratorType || (deferredGlobalAsyncIteratorType = getGlobalType("AsyncIterator", /*arity*/ 3, reportErrors)) || emptyGenericType;
}
function getGlobalAsyncIterableIteratorType(reportErrors) {
return deferredGlobalAsyncIterableIteratorType || (deferredGlobalAsyncIterableIteratorType = getGlobalType("AsyncIterableIterator", /*arity*/ 1, reportErrors)) || emptyGenericType;
}
function getGlobalAsyncGeneratorType(reportErrors) {
return deferredGlobalAsyncGeneratorType || (deferredGlobalAsyncGeneratorType = getGlobalType("AsyncGenerator", /*arity*/ 3, reportErrors)) || emptyGenericType;
}
function getGlobalIterableType(reportErrors) {
return deferredGlobalIterableType || (deferredGlobalIterableType = getGlobalType("Iterable", /*arity*/ 1, reportErrors)) || emptyGenericType;
}
function getGlobalIteratorType(reportErrors) {
return deferredGlobalIteratorType || (deferredGlobalIteratorType = getGlobalType("Iterator", /*arity*/ 3, reportErrors)) || emptyGenericType;
}
function getGlobalIterableIteratorType(reportErrors) {
return deferredGlobalIterableIteratorType || (deferredGlobalIterableIteratorType = getGlobalType("IterableIterator", /*arity*/ 1, reportErrors)) || emptyGenericType;
}
function getGlobalGeneratorType(reportErrors) {
return deferredGlobalGeneratorType || (deferredGlobalGeneratorType = getGlobalType("Generator", /*arity*/ 3, reportErrors)) || emptyGenericType;
}
function getGlobalIteratorYieldResultType(reportErrors) {
return deferredGlobalIteratorYieldResultType || (deferredGlobalIteratorYieldResultType = getGlobalType("IteratorYieldResult", /*arity*/ 1, reportErrors)) || emptyGenericType;
}
function getGlobalIteratorReturnResultType(reportErrors) {
return deferredGlobalIteratorReturnResultType || (deferredGlobalIteratorReturnResultType = getGlobalType("IteratorReturnResult", /*arity*/ 1, reportErrors)) || emptyGenericType;
}
function getGlobalTypeOrUndefined(name, arity) {
if (arity === void 0) { arity = 0; }
var symbol = getGlobalSymbol(name, 788968 /* Type */, /*diagnostic*/ undefined);
return symbol && getTypeOfGlobalSymbol(symbol, arity);
}
function getGlobalExtractSymbol() {
return deferredGlobalExtractSymbol || (deferredGlobalExtractSymbol = getGlobalSymbol("Extract", 524288 /* TypeAlias */, ts.Diagnostics.Cannot_find_global_type_0)); // TODO: GH#18217
}
function getGlobalOmitSymbol() {
return deferredGlobalOmitSymbol || (deferredGlobalOmitSymbol = getGlobalSymbol("Omit", 524288 /* TypeAlias */, ts.Diagnostics.Cannot_find_global_type_0)); // TODO: GH#18217
}
function getGlobalBigIntType(reportErrors) {
return deferredGlobalBigIntType || (deferredGlobalBigIntType = getGlobalType("BigInt", /*arity*/ 0, reportErrors)) || emptyObjectType;
}
/**
* Instantiates a global type that is generic with some element type, and returns that instantiation.
*/
function createTypeFromGenericGlobalType(genericGlobalType, typeArguments) {
return genericGlobalType !== emptyGenericType ? createTypeReference(genericGlobalType, typeArguments) : emptyObjectType;
}
function createTypedPropertyDescriptorType(propertyType) {
return createTypeFromGenericGlobalType(getGlobalTypedPropertyDescriptorType(), [propertyType]);
}
function createIterableType(iteratedType) {
return createTypeFromGenericGlobalType(getGlobalIterableType(/*reportErrors*/ true), [iteratedType]);
}
function createArrayType(elementType, readonly) {
return createTypeFromGenericGlobalType(readonly ? globalReadonlyArrayType : globalArrayType, [elementType]);
}
function getTupleElementFlags(node) {
switch (node.kind) {
case 183 /* OptionalType */:
return 2 /* Optional */;
case 184 /* RestType */:
return getRestTypeElementFlags(node);
case 195 /* NamedTupleMember */:
return node.questionToken ? 2 /* Optional */ :
node.dotDotDotToken ? getRestTypeElementFlags(node) :
1 /* Required */;
default:
return 1 /* Required */;
}
}
function getRestTypeElementFlags(node) {
return getArrayElementTypeNode(node.type) ? 4 /* Rest */ : 8 /* Variadic */;
}
function getArrayOrTupleTargetType(node) {
var readonly = isReadonlyTypeOperator(node.parent);
var elementType = getArrayElementTypeNode(node);
if (elementType) {
return readonly ? globalReadonlyArrayType : globalArrayType;
}
var elementFlags = ts.map(node.elements, getTupleElementFlags);
var missingName = ts.some(node.elements, function (e) { return e.kind !== 195 /* NamedTupleMember */; });
return getTupleTargetType(elementFlags, readonly, /*associatedNames*/ missingName ? undefined : node.elements);
}
// Return true if the given type reference node is directly aliased or if it needs to be deferred
// because it is possibly contained in a circular chain of eagerly resolved types.
function isDeferredTypeReferenceNode(node, hasDefaultTypeArguments) {
return !!getAliasSymbolForTypeNode(node) || isResolvedByTypeAlias(node) && (node.kind === 181 /* ArrayType */ ? mayResolveTypeAlias(node.elementType) :
node.kind === 182 /* TupleType */ ? ts.some(node.elements, mayResolveTypeAlias) :
hasDefaultTypeArguments || ts.some(node.typeArguments, mayResolveTypeAlias));
}
// Return true when the given node is transitively contained in type constructs that eagerly
// resolve their constituent types. We include SyntaxKind.TypeReference because type arguments
// of type aliases are eagerly resolved.
function isResolvedByTypeAlias(node) {
var parent = node.parent;
switch (parent.kind) {
case 189 /* ParenthesizedType */:
case 195 /* NamedTupleMember */:
case 176 /* TypeReference */:
case 185 /* UnionType */:
case 186 /* IntersectionType */:
case 192 /* IndexedAccessType */:
case 187 /* ConditionalType */:
case 191 /* TypeOperator */:
case 181 /* ArrayType */:
case 182 /* TupleType */:
return isResolvedByTypeAlias(parent);
case 257 /* TypeAliasDeclaration */:
return true;
}
return false;
}
// Return true if resolving the given node (i.e. getTypeFromTypeNode) possibly causes resolution
// of a type alias.
function mayResolveTypeAlias(node) {
switch (node.kind) {
case 176 /* TypeReference */:
return isJSDocTypeReference(node) || !!(resolveTypeReferenceName(node.typeName, 788968 /* Type */).flags & 524288 /* TypeAlias */);
case 179 /* TypeQuery */:
return true;
case 191 /* TypeOperator */:
return node.operator !== 152 /* UniqueKeyword */ && mayResolveTypeAlias(node.type);
case 189 /* ParenthesizedType */:
case 183 /* OptionalType */:
case 195 /* NamedTupleMember */:
case 311 /* JSDocOptionalType */:
case 309 /* JSDocNullableType */:
case 310 /* JSDocNonNullableType */:
case 304 /* JSDocTypeExpression */:
return mayResolveTypeAlias(node.type);
case 184 /* RestType */:
return node.type.kind !== 181 /* ArrayType */ || mayResolveTypeAlias(node.type.elementType);
case 185 /* UnionType */:
case 186 /* IntersectionType */:
return ts.some(node.types, mayResolveTypeAlias);
case 192 /* IndexedAccessType */:
return mayResolveTypeAlias(node.objectType) || mayResolveTypeAlias(node.indexType);
case 187 /* ConditionalType */:
return mayResolveTypeAlias(node.checkType) || mayResolveTypeAlias(node.extendsType) ||
mayResolveTypeAlias(node.trueType) || mayResolveTypeAlias(node.falseType);
}
return false;
}
function getTypeFromArrayOrTupleTypeNode(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
var target = getArrayOrTupleTargetType(node);
if (target === emptyGenericType) {
links.resolvedType = emptyObjectType;
}
else if (!(node.kind === 182 /* TupleType */ && ts.some(node.elements, function (e) { return !!(getTupleElementFlags(e) & 8 /* Variadic */); })) && isDeferredTypeReferenceNode(node)) {
links.resolvedType = node.kind === 182 /* TupleType */ && node.elements.length === 0 ? target :
createDeferredTypeReference(target, node, /*mapper*/ undefined);
}
else {
var elementTypes = node.kind === 181 /* ArrayType */ ? [getTypeFromTypeNode(node.elementType)] : ts.map(node.elements, getTypeFromTypeNode);
links.resolvedType = createNormalizedTypeReference(target, elementTypes);
}
}
return links.resolvedType;
}
function isReadonlyTypeOperator(node) {
return ts.isTypeOperatorNode(node) && node.operator === 143 /* ReadonlyKeyword */;
}
function createTupleType(elementTypes, elementFlags, readonly, namedMemberDeclarations) {
if (readonly === void 0) { readonly = false; }
var tupleTarget = getTupleTargetType(elementFlags || ts.map(elementTypes, function (_) { return 1 /* Required */; }), readonly, namedMemberDeclarations);
return tupleTarget === emptyGenericType ? emptyObjectType :
elementTypes.length ? createNormalizedTypeReference(tupleTarget, elementTypes) :
tupleTarget;
}
function getTupleTargetType(elementFlags, readonly, namedMemberDeclarations) {
if (elementFlags.length === 1 && elementFlags[0] & 4 /* Rest */) {
// [...X[]] is equivalent to just X[]
return readonly ? globalReadonlyArrayType : globalArrayType;
}
var key = ts.map(elementFlags, function (f) { return f & 1 /* Required */ ? "#" : f & 2 /* Optional */ ? "?" : f & 4 /* Rest */ ? "." : "*"; }).join() +
(readonly ? "R" : "") +
(namedMemberDeclarations && namedMemberDeclarations.length ? "," + ts.map(namedMemberDeclarations, getNodeId).join(",") : "");
var type = tupleTypes.get(key);
if (!type) {
tupleTypes.set(key, type = createTupleTargetType(elementFlags, readonly, namedMemberDeclarations));
}
return type;
}
// We represent tuple types as type references to synthesized generic interface types created by
// this function. The types are of the form:
//
// interface Tuple<T0, T1, T2, ...> extends Array<T0 | T1 | T2 | ...> { 0: T0, 1: T1, 2: T2, ... }
//
// Note that the generic type created by this function has no symbol associated with it. The same
// is true for each of the synthesized type parameters.
function createTupleTargetType(elementFlags, readonly, namedMemberDeclarations) {
var arity = elementFlags.length;
var minLength = ts.countWhere(elementFlags, function (f) { return !!(f & (1 /* Required */ | 8 /* Variadic */)); });
var typeParameters;
var properties = [];
var combinedFlags = 0;
if (arity) {
typeParameters = new Array(arity);
for (var i = 0; i < arity; i++) {
var typeParameter = typeParameters[i] = createTypeParameter();
var flags = elementFlags[i];
combinedFlags |= flags;
if (!(combinedFlags & 12 /* Variable */)) {
var property = createSymbol(4 /* Property */ | (flags & 2 /* Optional */ ? 16777216 /* Optional */ : 0), "" + i, readonly ? 8 /* Readonly */ : 0);
property.tupleLabelDeclaration = namedMemberDeclarations === null || namedMemberDeclarations === void 0 ? void 0 : namedMemberDeclarations[i];
property.type = typeParameter;
properties.push(property);
}
}
}
var fixedLength = properties.length;
var lengthSymbol = createSymbol(4 /* Property */, "length");
if (combinedFlags & 12 /* Variable */) {
lengthSymbol.type = numberType;
}
else {
var literalTypes = [];
for (var i = minLength; i <= arity; i++)
literalTypes.push(getNumberLiteralType(i));
lengthSymbol.type = getUnionType(literalTypes);
}
properties.push(lengthSymbol);
var type = createObjectType(8 /* Tuple */ | 4 /* Reference */);
type.typeParameters = typeParameters;
type.outerTypeParameters = undefined;
type.localTypeParameters = typeParameters;
type.instantiations = new ts.Map();
type.instantiations.set(getTypeListId(type.typeParameters), type);
type.target = type;
type.resolvedTypeArguments = type.typeParameters;
type.thisType = createTypeParameter();
type.thisType.isThisType = true;
type.thisType.constraint = type;
type.declaredProperties = properties;
type.declaredCallSignatures = ts.emptyArray;
type.declaredConstructSignatures = ts.emptyArray;
type.declaredIndexInfos = ts.emptyArray;
type.elementFlags = elementFlags;
type.minLength = minLength;
type.fixedLength = fixedLength;
type.hasRestElement = !!(combinedFlags & 12 /* Variable */);
type.combinedFlags = combinedFlags;
type.readonly = readonly;
type.labeledElementDeclarations = namedMemberDeclarations;
return type;
}
function createNormalizedTypeReference(target, typeArguments) {
return target.objectFlags & 8 /* Tuple */ ? createNormalizedTupleType(target, typeArguments) : createTypeReference(target, typeArguments);
}
function createNormalizedTupleType(target, elementTypes) {
var _a, _b, _c;
if (!(target.combinedFlags & 14 /* NonRequired */)) {
// No need to normalize when we only have regular required elements
return createTypeReference(target, elementTypes);
}
if (target.combinedFlags & 8 /* Variadic */) {
// Transform [A, ...(X | Y | Z)] into [A, ...X] | [A, ...Y] | [A, ...Z]
var unionIndex_1 = ts.findIndex(elementTypes, function (t, i) { return !!(target.elementFlags[i] & 8 /* Variadic */ && t.flags & (131072 /* Never */ | 1048576 /* Union */)); });
if (unionIndex_1 >= 0) {
return checkCrossProductUnion(ts.map(elementTypes, function (t, i) { return target.elementFlags[i] & 8 /* Variadic */ ? t : unknownType; })) ?
mapType(elementTypes[unionIndex_1], function (t) { return createNormalizedTupleType(target, ts.replaceElement(elementTypes, unionIndex_1, t)); }) :
errorType;
}
}
// We have optional, rest, or variadic elements that may need normalizing. Normalization ensures that all variadic
// elements are generic and that the tuple type has one of the following layouts, disregarding variadic elements:
// (1) Zero or more required elements, followed by zero or more optional elements, followed by zero or one rest element.
// (2) Zero or more required elements, followed by a rest element, followed by zero or more required elements.
// In either layout, zero or more generic variadic elements may be present at any location.
var expandedTypes = [];
var expandedFlags = [];
var expandedDeclarations = [];
var lastRequiredIndex = -1;
var firstRestIndex = -1;
var lastOptionalOrRestIndex = -1;
var _loop_15 = function (i) {
var type = elementTypes[i];
var flags = target.elementFlags[i];
if (flags & 8 /* Variadic */) {
if (type.flags & 58982400 /* InstantiableNonPrimitive */ || isGenericMappedType(type)) {
// Generic variadic elements stay as they are.
addElement(type, 8 /* Variadic */, (_a = target.labeledElementDeclarations) === null || _a === void 0 ? void 0 : _a[i]);
}
else if (isTupleType(type)) {
var elements = getTypeArguments(type);
if (elements.length + expandedTypes.length >= 10000) {
error(currentNode, ts.isPartOfTypeNode(currentNode)
? ts.Diagnostics.Type_produces_a_tuple_type_that_is_too_large_to_represent
: ts.Diagnostics.Expression_produces_a_tuple_type_that_is_too_large_to_represent);
return { value: errorType };
}
// Spread variadic elements with tuple types into the resulting tuple.
ts.forEach(elements, function (t, n) { var _a; return addElement(t, type.target.elementFlags[n], (_a = type.target.labeledElementDeclarations) === null || _a === void 0 ? void 0 : _a[n]); });
}
else {
// Treat everything else as an array type and create a rest element.
addElement(isArrayLikeType(type) && getIndexTypeOfType(type, numberType) || errorType, 4 /* Rest */, (_b = target.labeledElementDeclarations) === null || _b === void 0 ? void 0 : _b[i]);
}
}
else {
// Copy other element kinds with no change.
addElement(type, flags, (_c = target.labeledElementDeclarations) === null || _c === void 0 ? void 0 : _c[i]);
}
};
for (var i = 0; i < elementTypes.length; i++) {
var state_4 = _loop_15(i);
if (typeof state_4 === "object")
return state_4.value;
}
// Turn optional elements preceding the last required element into required elements
for (var i = 0; i < lastRequiredIndex; i++) {
if (expandedFlags[i] & 2 /* Optional */)
expandedFlags[i] = 1 /* Required */;
}
if (firstRestIndex >= 0 && firstRestIndex < lastOptionalOrRestIndex) {
// Turn elements between first rest and last optional/rest into a single rest element
expandedTypes[firstRestIndex] = getUnionType(ts.sameMap(expandedTypes.slice(firstRestIndex, lastOptionalOrRestIndex + 1), function (t, i) { return expandedFlags[firstRestIndex + i] & 8 /* Variadic */ ? getIndexedAccessType(t, numberType) : t; }));
expandedTypes.splice(firstRestIndex + 1, lastOptionalOrRestIndex - firstRestIndex);
expandedFlags.splice(firstRestIndex + 1, lastOptionalOrRestIndex - firstRestIndex);
expandedDeclarations === null || expandedDeclarations === void 0 ? void 0 : expandedDeclarations.splice(firstRestIndex + 1, lastOptionalOrRestIndex - firstRestIndex);
}
var tupleTarget = getTupleTargetType(expandedFlags, target.readonly, expandedDeclarations);
return tupleTarget === emptyGenericType ? emptyObjectType :
expandedFlags.length ? createTypeReference(tupleTarget, expandedTypes) :
tupleTarget;
function addElement(type, flags, declaration) {
if (flags & 1 /* Required */) {
lastRequiredIndex = expandedFlags.length;
}
if (flags & 4 /* Rest */ && firstRestIndex < 0) {
firstRestIndex = expandedFlags.length;
}
if (flags & (2 /* Optional */ | 4 /* Rest */)) {
lastOptionalOrRestIndex = expandedFlags.length;
}
expandedTypes.push(type);
expandedFlags.push(flags);
if (expandedDeclarations && declaration) {
expandedDeclarations.push(declaration);
}
else {
expandedDeclarations = undefined;
}
}
}
function sliceTupleType(type, index, endSkipCount) {
if (endSkipCount === void 0) { endSkipCount = 0; }
var target = type.target;
var endIndex = getTypeReferenceArity(type) - endSkipCount;
return index > target.fixedLength ? getRestArrayTypeOfTupleType(type) || createTupleType(ts.emptyArray) :
createTupleType(getTypeArguments(type).slice(index, endIndex), target.elementFlags.slice(index, endIndex),
/*readonly*/ false, target.labeledElementDeclarations && target.labeledElementDeclarations.slice(index, endIndex));
}
function getKnownKeysOfTupleType(type) {
return getUnionType(ts.append(ts.arrayOf(type.target.fixedLength, function (i) { return getStringLiteralType("" + i); }), getIndexType(type.target.readonly ? globalReadonlyArrayType : globalArrayType)));
}
// Return count of starting consecutive tuple elements of the given kind(s)
function getStartElementCount(type, flags) {
var index = ts.findIndex(type.elementFlags, function (f) { return !(f & flags); });
return index >= 0 ? index : type.elementFlags.length;
}
// Return count of ending consecutive tuple elements of the given kind(s)
function getEndElementCount(type, flags) {
return type.elementFlags.length - ts.findLastIndex(type.elementFlags, function (f) { return !(f & flags); }) - 1;
}
function getTypeFromOptionalTypeNode(node) {
return addOptionality(getTypeFromTypeNode(node.type), /*isProperty*/ true);
}
function getTypeId(type) {
return type.id;
}
function containsType(types, type) {
return ts.binarySearch(types, type, getTypeId, ts.compareValues) >= 0;
}
function insertType(types, type) {
var index = ts.binarySearch(types, type, getTypeId, ts.compareValues);
if (index < 0) {
types.splice(~index, 0, type);
return true;
}
return false;
}
function addTypeToUnion(typeSet, includes, type) {
var flags = type.flags;
if (flags & 1048576 /* Union */) {
return addTypesToUnion(typeSet, includes | (isNamedUnionType(type) ? 1048576 /* Union */ : 0), type.types);
}
// We ignore 'never' types in unions
if (!(flags & 131072 /* Never */)) {
includes |= flags & 205258751 /* IncludesMask */;
if (flags & 469499904 /* StructuredOrInstantiable */)
includes |= 262144 /* IncludesStructuredOrInstantiable */;
if (type === wildcardType)
includes |= 8388608 /* IncludesWildcard */;
if (!strictNullChecks && flags & 98304 /* Nullable */) {
if (!(ts.getObjectFlags(type) & 131072 /* ContainsWideningType */))
includes |= 4194304 /* IncludesNonWideningType */;
}
else {
var len = typeSet.length;
var index = len && type.id > typeSet[len - 1].id ? ~len : ts.binarySearch(typeSet, type, getTypeId, ts.compareValues);
if (index < 0) {
typeSet.splice(~index, 0, type);
}
}
}
return includes;
}
// Add the given types to the given type set. Order is preserved, duplicates are removed,
// and nested types of the given kind are flattened into the set.
function addTypesToUnion(typeSet, includes, types) {
for (var _i = 0, types_9 = types; _i < types_9.length; _i++) {
var type = types_9[_i];
includes = addTypeToUnion(typeSet, includes, type);
}
return includes;
}
function removeSubtypes(types, hasObjectTypes) {
var id = getTypeListId(types);
var match = subtypeReductionCache.get(id);
if (match) {
return match;
}
// We assume that redundant primitive types have already been removed from the types array and that there
// are no any and unknown types in the array. Thus, the only possible supertypes for primitive types are empty
// object types, and if none of those are present we can exclude primitive types from the subtype check.
var hasEmptyObject = hasObjectTypes && ts.some(types, function (t) { return !!(t.flags & 524288 /* Object */) && !isGenericMappedType(t) && isEmptyResolvedType(resolveStructuredTypeMembers(t)); });
var len = types.length;
var i = len;
var count = 0;
while (i > 0) {
i--;
var source = types[i];
if (hasEmptyObject || source.flags & 469499904 /* StructuredOrInstantiable */) {
// Find the first property with a unit type, if any. When constituents have a property by the same name
// but of a different unit type, we can quickly disqualify them from subtype checks. This helps subtype
// reduction of large discriminated union types.
var keyProperty = source.flags & (524288 /* Object */ | 2097152 /* Intersection */ | 58982400 /* InstantiableNonPrimitive */) ?
ts.find(getPropertiesOfType(source), function (p) { return isUnitType(getTypeOfSymbol(p)); }) :
undefined;
var keyPropertyType = keyProperty && getRegularTypeOfLiteralType(getTypeOfSymbol(keyProperty));
for (var _i = 0, types_10 = types; _i < types_10.length; _i++) {
var target = types_10[_i];
if (source !== target) {
if (count === 100000) {
// After 100000 subtype checks we estimate the remaining amount of work by assuming the
// same ratio of checks per element. If the estimated number of remaining type checks is
// greater than 1M we deem the union type too complex to represent. This for example
// caps union types at 1000 unique object types.
var estimatedCount = (count / (len - i)) * len;
if (estimatedCount > 1000000) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.instant("checkTypes" /* CheckTypes */, "removeSubtypes_DepthLimit", { typeIds: types.map(function (t) { return t.id; }) });
error(currentNode, ts.Diagnostics.Expression_produces_a_union_type_that_is_too_complex_to_represent);
return undefined;
}
}
count++;
if (keyProperty && target.flags & (524288 /* Object */ | 2097152 /* Intersection */ | 58982400 /* InstantiableNonPrimitive */)) {
var t = getTypeOfPropertyOfType(target, keyProperty.escapedName);
if (t && isUnitType(t) && getRegularTypeOfLiteralType(t) !== keyPropertyType) {
continue;
}
}
if (isTypeRelatedTo(source, target, strictSubtypeRelation) && (!(ts.getObjectFlags(getTargetType(source)) & 1 /* Class */) ||
!(ts.getObjectFlags(getTargetType(target)) & 1 /* Class */) ||
isTypeDerivedFrom(source, target))) {
ts.orderedRemoveItemAt(types, i);
break;
}
}
}
}
}
subtypeReductionCache.set(id, types);
return types;
}
function removeRedundantLiteralTypes(types, includes, reduceVoidUndefined) {
var i = types.length;
while (i > 0) {
i--;
var t = types[i];
var flags = t.flags;
var remove = flags & (128 /* StringLiteral */ | 134217728 /* TemplateLiteral */ | 268435456 /* StringMapping */) && includes & 4 /* String */ ||
flags & 256 /* NumberLiteral */ && includes & 8 /* Number */ ||
flags & 2048 /* BigIntLiteral */ && includes & 64 /* BigInt */ ||
flags & 8192 /* UniqueESSymbol */ && includes & 4096 /* ESSymbol */ ||
reduceVoidUndefined && flags & 32768 /* Undefined */ && includes & 16384 /* Void */ ||
isFreshLiteralType(t) && containsType(types, t.regularType);
if (remove) {
ts.orderedRemoveItemAt(types, i);
}
}
}
function removeStringLiteralsMatchedByTemplateLiterals(types) {
var templates = ts.filter(types, isPatternLiteralType);
if (templates.length) {
var i = types.length;
var _loop_16 = function () {
i--;
var t = types[i];
if (t.flags & 128 /* StringLiteral */ && ts.some(templates, function (template) { return isTypeSubtypeOf(t, template); })) {
ts.orderedRemoveItemAt(types, i);
}
};
while (i > 0) {
_loop_16();
}
}
}
function isNamedUnionType(type) {
return !!(type.flags & 1048576 /* Union */ && (type.aliasSymbol || type.origin));
}
function addNamedUnions(namedUnions, types) {
for (var _i = 0, types_11 = types; _i < types_11.length; _i++) {
var t = types_11[_i];
if (t.flags & 1048576 /* Union */) {
var origin = t.origin;
if (t.aliasSymbol || origin && !(origin.flags & 1048576 /* Union */)) {
ts.pushIfUnique(namedUnions, t);
}
else if (origin && origin.flags & 1048576 /* Union */) {
addNamedUnions(namedUnions, origin.types);
}
}
}
}
function createOriginUnionOrIntersectionType(flags, types) {
var result = createOriginType(flags);
result.types = types;
return result;
}
// We sort and deduplicate the constituent types based on object identity. If the subtypeReduction
// flag is specified we also reduce the constituent type set to only include types that aren't subtypes
// of other types. Subtype reduction is expensive for large union types and is possible only when union
// types are known not to circularly reference themselves (as is the case with union types created by
// expression constructs such as array literals and the || and ?: operators). Named types can
// circularly reference themselves and therefore cannot be subtype reduced during their declaration.
// For example, "type Item = string | (() => Item" is a named type that circularly references itself.
function getUnionType(types, unionReduction, aliasSymbol, aliasTypeArguments, origin) {
if (unionReduction === void 0) { unionReduction = 1 /* Literal */; }
if (types.length === 0) {
return neverType;
}
if (types.length === 1) {
return types[0];
}
var typeSet = [];
var includes = addTypesToUnion(typeSet, 0, types);
if (unionReduction !== 0 /* None */) {
if (includes & 3 /* AnyOrUnknown */) {
return includes & 1 /* Any */ ? includes & 8388608 /* IncludesWildcard */ ? wildcardType : anyType : unknownType;
}
if (exactOptionalPropertyTypes && includes & 32768 /* Undefined */) {
var missingIndex = ts.binarySearch(typeSet, missingType, getTypeId, ts.compareValues);
if (missingIndex >= 0 && containsType(typeSet, undefinedType)) {
ts.orderedRemoveItemAt(typeSet, missingIndex);
}
}
if (includes & (2944 /* Literal */ | 8192 /* UniqueESSymbol */ | 134217728 /* TemplateLiteral */ | 268435456 /* StringMapping */) || includes & 16384 /* Void */ && includes & 32768 /* Undefined */) {
removeRedundantLiteralTypes(typeSet, includes, !!(unionReduction & 2 /* Subtype */));
}
if (includes & 128 /* StringLiteral */ && includes & 134217728 /* TemplateLiteral */) {
removeStringLiteralsMatchedByTemplateLiterals(typeSet);
}
if (unionReduction === 2 /* Subtype */) {
typeSet = removeSubtypes(typeSet, !!(includes & 524288 /* Object */));
if (!typeSet) {
return errorType;
}
}
if (typeSet.length === 0) {
return includes & 65536 /* Null */ ? includes & 4194304 /* IncludesNonWideningType */ ? nullType : nullWideningType :
includes & 32768 /* Undefined */ ? includes & 4194304 /* IncludesNonWideningType */ ? undefinedType : undefinedWideningType :
neverType;
}
}
if (!origin && includes & 1048576 /* Union */) {
var namedUnions = [];
addNamedUnions(namedUnions, types);
var reducedTypes = [];
var _loop_17 = function (t) {
if (!ts.some(namedUnions, function (union) { return containsType(union.types, t); })) {
reducedTypes.push(t);
}
};
for (var _i = 0, typeSet_1 = typeSet; _i < typeSet_1.length; _i++) {
var t = typeSet_1[_i];
_loop_17(t);
}
if (!aliasSymbol && namedUnions.length === 1 && reducedTypes.length === 0) {
return namedUnions[0];
}
// We create a denormalized origin type only when the union was created from one or more named unions
// (unions with alias symbols or origins) and when there is no overlap between those named unions.
var namedTypesCount = ts.reduceLeft(namedUnions, function (sum, union) { return sum + union.types.length; }, 0);
if (namedTypesCount + reducedTypes.length === typeSet.length) {
for (var _a = 0, namedUnions_1 = namedUnions; _a < namedUnions_1.length; _a++) {
var t = namedUnions_1[_a];
insertType(reducedTypes, t);
}
origin = createOriginUnionOrIntersectionType(1048576 /* Union */, reducedTypes);
}
}
var objectFlags = (includes & 468598819 /* NotPrimitiveUnion */ ? 0 : 65536 /* PrimitiveUnion */) |
(includes & 2097152 /* Intersection */ ? 33554432 /* ContainsIntersections */ : 0);
return getUnionTypeFromSortedList(typeSet, objectFlags, aliasSymbol, aliasTypeArguments, origin);
}
function getUnionOrIntersectionTypePredicate(signatures, kind) {
var first;
var types = [];
for (var _i = 0, signatures_6 = signatures; _i < signatures_6.length; _i++) {
var sig = signatures_6[_i];
var pred = getTypePredicateOfSignature(sig);
if (!pred || pred.kind === 2 /* AssertsThis */ || pred.kind === 3 /* AssertsIdentifier */) {
if (kind !== 2097152 /* Intersection */) {
continue;
}
else {
return; // intersections demand all members be type predicates for the result to have a predicate
}
}
if (first) {
if (!typePredicateKindsMatch(first, pred)) {
// No common type predicate.
return undefined;
}
}
else {
first = pred;
}
types.push(pred.type);
}
if (!first) {
// No signatures had a type predicate.
return undefined;
}
var compositeType = getUnionOrIntersectionType(types, kind);
return createTypePredicate(first.kind, first.parameterName, first.parameterIndex, compositeType);
}
function typePredicateKindsMatch(a, b) {
return a.kind === b.kind && a.parameterIndex === b.parameterIndex;
}
// This function assumes the constituent type list is sorted and deduplicated.
function getUnionTypeFromSortedList(types, objectFlags, aliasSymbol, aliasTypeArguments, origin) {
if (types.length === 0) {
return neverType;
}
if (types.length === 1) {
return types[0];
}
var typeKey = !origin ? getTypeListId(types) :
origin.flags & 1048576 /* Union */ ? "|" + getTypeListId(origin.types) :
origin.flags & 2097152 /* Intersection */ ? "&" + getTypeListId(origin.types) :
"#" + origin.type.id + "|" + getTypeListId(types); // origin type id alone is insufficient, as `keyof x` may resolve to multiple WIP values while `x` is still resolving
var id = typeKey + getAliasId(aliasSymbol, aliasTypeArguments);
var type = unionTypes.get(id);
if (!type) {
type = createType(1048576 /* Union */);
type.objectFlags = objectFlags | getPropagatingFlagsOfTypes(types, /*excludeKinds*/ 98304 /* Nullable */);
type.types = types;
type.origin = origin;
type.aliasSymbol = aliasSymbol;
type.aliasTypeArguments = aliasTypeArguments;
if (types.length === 2 && types[0].flags & 512 /* BooleanLiteral */ && types[1].flags & 512 /* BooleanLiteral */) {
type.flags |= 16 /* Boolean */;
type.intrinsicName = "boolean";
}
unionTypes.set(id, type);
}
return type;
}
function getTypeFromUnionTypeNode(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
var aliasSymbol = getAliasSymbolForTypeNode(node);
links.resolvedType = getUnionType(ts.map(node.types, getTypeFromTypeNode), 1 /* Literal */, aliasSymbol, getTypeArgumentsForAliasSymbol(aliasSymbol));
}
return links.resolvedType;
}
function addTypeToIntersection(typeSet, includes, type) {
var flags = type.flags;
if (flags & 2097152 /* Intersection */) {
return addTypesToIntersection(typeSet, includes, type.types);
}
if (isEmptyAnonymousObjectType(type)) {
if (!(includes & 16777216 /* IncludesEmptyObject */)) {
includes |= 16777216 /* IncludesEmptyObject */;
typeSet.set(type.id.toString(), type);
}
}
else {
if (flags & 3 /* AnyOrUnknown */) {
if (type === wildcardType)
includes |= 8388608 /* IncludesWildcard */;
}
else if ((strictNullChecks || !(flags & 98304 /* Nullable */)) && !typeSet.has(type.id.toString())) {
if (type.flags & 109440 /* Unit */ && includes & 109440 /* Unit */) {
// We have seen two distinct unit types which means we should reduce to an
// empty intersection. Adding TypeFlags.NonPrimitive causes that to happen.
includes |= 67108864 /* NonPrimitive */;
}
typeSet.set(type.id.toString(), type);
}
includes |= flags & 205258751 /* IncludesMask */;
}
return includes;
}
// Add the given types to the given type set. Order is preserved, freshness is removed from literal
// types, duplicates are removed, and nested types of the given kind are flattened into the set.
function addTypesToIntersection(typeSet, includes, types) {
for (var _i = 0, types_12 = types; _i < types_12.length; _i++) {
var type = types_12[_i];
includes = addTypeToIntersection(typeSet, includes, getRegularTypeOfLiteralType(type));
}
return includes;
}
function removeRedundantPrimitiveTypes(types, includes) {
var i = types.length;
while (i > 0) {
i--;
var t = types[i];
var remove = t.flags & 4 /* String */ && includes & 128 /* StringLiteral */ ||
t.flags & 8 /* Number */ && includes & 256 /* NumberLiteral */ ||
t.flags & 64 /* BigInt */ && includes & 2048 /* BigIntLiteral */ ||
t.flags & 4096 /* ESSymbol */ && includes & 8192 /* UniqueESSymbol */;
if (remove) {
ts.orderedRemoveItemAt(types, i);
}
}
}
// Check that the given type has a match in every union. A given type is matched by
// an identical type, and a literal type is additionally matched by its corresponding
// primitive type.
function eachUnionContains(unionTypes, type) {
for (var _i = 0, unionTypes_1 = unionTypes; _i < unionTypes_1.length; _i++) {
var u = unionTypes_1[_i];
if (!containsType(u.types, type)) {
var primitive = type.flags & 128 /* StringLiteral */ ? stringType :
type.flags & 256 /* NumberLiteral */ ? numberType :
type.flags & 2048 /* BigIntLiteral */ ? bigintType :
type.flags & 8192 /* UniqueESSymbol */ ? esSymbolType :
undefined;
if (!primitive || !containsType(u.types, primitive)) {
return false;
}
}
}
return true;
}
/**
* Returns `true` if the intersection of the template literals and string literals is the empty set, eg `get${string}` & "setX", and should reduce to `never`
*/
function extractRedundantTemplateLiterals(types) {
var i = types.length;
var literals = ts.filter(types, function (t) { return !!(t.flags & 128 /* StringLiteral */); });
while (i > 0) {
i--;
var t = types[i];
if (!(t.flags & 134217728 /* TemplateLiteral */))
continue;
for (var _i = 0, literals_1 = literals; _i < literals_1.length; _i++) {
var t2 = literals_1[_i];
if (isTypeSubtypeOf(t2, t)) {
// eg, ``get${T}` & "getX"` is just `"getX"`
ts.orderedRemoveItemAt(types, i);
break;
}
else if (isPatternLiteralType(t)) {
return true;
}
}
}
return false;
}
function extractIrreducible(types, flag) {
if (ts.every(types, function (t) { return !!(t.flags & 1048576 /* Union */) && ts.some(t.types, function (tt) { return !!(tt.flags & flag); }); })) {
for (var i = 0; i < types.length; i++) {
types[i] = filterType(types[i], function (t) { return !(t.flags & flag); });
}
return true;
}
return false;
}
// If the given list of types contains more than one union of primitive types, replace the
// first with a union containing an intersection of those primitive types, then remove the
// other unions and return true. Otherwise, do nothing and return false.
function intersectUnionsOfPrimitiveTypes(types) {
var unionTypes;
var index = ts.findIndex(types, function (t) { return !!(ts.getObjectFlags(t) & 65536 /* PrimitiveUnion */); });
if (index < 0) {
return false;
}
var i = index + 1;
// Remove all but the first union of primitive types and collect them in
// the unionTypes array.
while (i < types.length) {
var t = types[i];
if (ts.getObjectFlags(t) & 65536 /* PrimitiveUnion */) {
(unionTypes || (unionTypes = [types[index]])).push(t);
ts.orderedRemoveItemAt(types, i);
}
else {
i++;
}
}
// Return false if there was only one union of primitive types
if (!unionTypes) {
return false;
}
// We have more than one union of primitive types, now intersect them. For each
// type in each union we check if the type is matched in every union and if so
// we include it in the result.
var checked = [];
var result = [];
for (var _i = 0, unionTypes_2 = unionTypes; _i < unionTypes_2.length; _i++) {
var u = unionTypes_2[_i];
for (var _a = 0, _b = u.types; _a < _b.length; _a++) {
var t = _b[_a];
if (insertType(checked, t)) {
if (eachUnionContains(unionTypes, t)) {
insertType(result, t);
}
}
}
}
// Finally replace the first union with the result
types[index] = getUnionTypeFromSortedList(result, 65536 /* PrimitiveUnion */);
return true;
}
function createIntersectionType(types, aliasSymbol, aliasTypeArguments) {
var result = createType(2097152 /* Intersection */);
result.objectFlags = getPropagatingFlagsOfTypes(types, /*excludeKinds*/ 98304 /* Nullable */);
result.types = types;
result.aliasSymbol = aliasSymbol;
result.aliasTypeArguments = aliasTypeArguments;
return result;
}
// We normalize combinations of intersection and union types based on the distributive property of the '&'
// operator. Specifically, because X & (A | B) is equivalent to X & A | X & B, we can transform intersection
// types with union type constituents into equivalent union types with intersection type constituents and
// effectively ensure that union types are always at the top level in type representations.
//
// We do not perform structural deduplication on intersection types. Intersection types are created only by the &
// type operator and we can't reduce those because we want to support recursive intersection types. For example,
// a type alias of the form "type List<T> = T & { next: List<T> }" cannot be reduced during its declaration.
// Also, unlike union types, the order of the constituent types is preserved in order that overload resolution
// for intersections of types with signatures can be deterministic.
function getIntersectionType(types, aliasSymbol, aliasTypeArguments) {
var typeMembershipMap = new ts.Map();
var includes = addTypesToIntersection(typeMembershipMap, 0, types);
var typeSet = ts.arrayFrom(typeMembershipMap.values());
// An intersection type is considered empty if it contains
// the type never, or
// more than one unit type or,
// an object type and a nullable type (null or undefined), or
// a string-like type and a type known to be non-string-like, or
// a number-like type and a type known to be non-number-like, or
// a symbol-like type and a type known to be non-symbol-like, or
// a void-like type and a type known to be non-void-like, or
// a non-primitive type and a type known to be primitive.
if (includes & 131072 /* Never */) {
return ts.contains(typeSet, silentNeverType) ? silentNeverType : neverType;
}
if (strictNullChecks && includes & 98304 /* Nullable */ && includes & (524288 /* Object */ | 67108864 /* NonPrimitive */ | 16777216 /* IncludesEmptyObject */) ||
includes & 67108864 /* NonPrimitive */ && includes & (469892092 /* DisjointDomains */ & ~67108864 /* NonPrimitive */) ||
includes & 402653316 /* StringLike */ && includes & (469892092 /* DisjointDomains */ & ~402653316 /* StringLike */) ||
includes & 296 /* NumberLike */ && includes & (469892092 /* DisjointDomains */ & ~296 /* NumberLike */) ||
includes & 2112 /* BigIntLike */ && includes & (469892092 /* DisjointDomains */ & ~2112 /* BigIntLike */) ||
includes & 12288 /* ESSymbolLike */ && includes & (469892092 /* DisjointDomains */ & ~12288 /* ESSymbolLike */) ||
includes & 49152 /* VoidLike */ && includes & (469892092 /* DisjointDomains */ & ~49152 /* VoidLike */)) {
return neverType;
}
if (includes & 134217728 /* TemplateLiteral */ && includes & 128 /* StringLiteral */ && extractRedundantTemplateLiterals(typeSet)) {
return neverType;
}
if (includes & 1 /* Any */) {
return includes & 8388608 /* IncludesWildcard */ ? wildcardType : anyType;
}
if (!strictNullChecks && includes & 98304 /* Nullable */) {
return includes & 32768 /* Undefined */ ? undefinedType : nullType;
}
if (includes & 4 /* String */ && includes & 128 /* StringLiteral */ ||
includes & 8 /* Number */ && includes & 256 /* NumberLiteral */ ||
includes & 64 /* BigInt */ && includes & 2048 /* BigIntLiteral */ ||
includes & 4096 /* ESSymbol */ && includes & 8192 /* UniqueESSymbol */) {
removeRedundantPrimitiveTypes(typeSet, includes);
}
if (includes & 16777216 /* IncludesEmptyObject */ && includes & 524288 /* Object */) {
ts.orderedRemoveItemAt(typeSet, ts.findIndex(typeSet, isEmptyAnonymousObjectType));
}
if (typeSet.length === 0) {
return unknownType;
}
if (typeSet.length === 1) {
return typeSet[0];
}
var id = getTypeListId(typeSet) + getAliasId(aliasSymbol, aliasTypeArguments);
var result = intersectionTypes.get(id);
if (!result) {
if (includes & 1048576 /* Union */) {
if (intersectUnionsOfPrimitiveTypes(typeSet)) {
// When the intersection creates a reduced set (which might mean that *all* union types have
// disappeared), we restart the operation to get a new set of combined flags. Once we have
// reduced we'll never reduce again, so this occurs at most once.
result = getIntersectionType(typeSet, aliasSymbol, aliasTypeArguments);
}
else if (extractIrreducible(typeSet, 32768 /* Undefined */)) {
result = getUnionType([getIntersectionType(typeSet), undefinedType], 1 /* Literal */, aliasSymbol, aliasTypeArguments);
}
else if (extractIrreducible(typeSet, 65536 /* Null */)) {
result = getUnionType([getIntersectionType(typeSet), nullType], 1 /* Literal */, aliasSymbol, aliasTypeArguments);
}
else {
// We are attempting to construct a type of the form X & (A | B) & (C | D). Transform this into a type of
// the form X & A & C | X & A & D | X & B & C | X & B & D. If the estimated size of the resulting union type
// exceeds 100000 constituents, report an error.
if (!checkCrossProductUnion(typeSet)) {
return errorType;
}
var constituents = getCrossProductIntersections(typeSet);
// We attach a denormalized origin type when at least one constituent of the cross-product union is an
// intersection (i.e. when the intersection didn't just reduce one or more unions to smaller unions).
var origin = ts.some(constituents, function (t) { return !!(t.flags & 2097152 /* Intersection */); }) ? createOriginUnionOrIntersectionType(2097152 /* Intersection */, typeSet) : undefined;
result = getUnionType(constituents, 1 /* Literal */, aliasSymbol, aliasTypeArguments, origin);
}
}
else {
result = createIntersectionType(typeSet, aliasSymbol, aliasTypeArguments);
}
intersectionTypes.set(id, result);
}
return result;
}
function getCrossProductUnionSize(types) {
return ts.reduceLeft(types, function (n, t) { return t.flags & 1048576 /* Union */ ? n * t.types.length : t.flags & 131072 /* Never */ ? 0 : n; }, 1);
}
function checkCrossProductUnion(types) {
var size = getCrossProductUnionSize(types);
if (size >= 100000) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.instant("checkTypes" /* CheckTypes */, "checkCrossProductUnion_DepthLimit", { typeIds: types.map(function (t) { return t.id; }), size: size });
error(currentNode, ts.Diagnostics.Expression_produces_a_union_type_that_is_too_complex_to_represent);
return false;
}
return true;
}
function getCrossProductIntersections(types) {
var count = getCrossProductUnionSize(types);
var intersections = [];
for (var i = 0; i < count; i++) {
var constituents = types.slice();
var n = i;
for (var j = types.length - 1; j >= 0; j--) {
if (types[j].flags & 1048576 /* Union */) {
var sourceTypes = types[j].types;
var length_5 = sourceTypes.length;
constituents[j] = sourceTypes[n % length_5];
n = Math.floor(n / length_5);
}
}
var t = getIntersectionType(constituents);
if (!(t.flags & 131072 /* Never */))
intersections.push(t);
}
return intersections;
}
function getTypeFromIntersectionTypeNode(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
var aliasSymbol = getAliasSymbolForTypeNode(node);
links.resolvedType = getIntersectionType(ts.map(node.types, getTypeFromTypeNode), aliasSymbol, getTypeArgumentsForAliasSymbol(aliasSymbol));
}
return links.resolvedType;
}
function createIndexType(type, stringsOnly) {
var result = createType(4194304 /* Index */);
result.type = type;
result.stringsOnly = stringsOnly;
return result;
}
function createOriginIndexType(type) {
var result = createOriginType(4194304 /* Index */);
result.type = type;
return result;
}
function getIndexTypeForGenericType(type, stringsOnly) {
return stringsOnly ?
type.resolvedStringIndexType || (type.resolvedStringIndexType = createIndexType(type, /*stringsOnly*/ true)) :
type.resolvedIndexType || (type.resolvedIndexType = createIndexType(type, /*stringsOnly*/ false));
}
function instantiateTypeAsMappedNameType(nameType, type, t) {
return instantiateType(nameType, appendTypeMapping(type.mapper, getTypeParameterFromMappedType(type), t));
}
function getIndexTypeForMappedType(type, noIndexSignatures) {
var constraint = filterType(getConstraintTypeFromMappedType(type), function (t) { return !(noIndexSignatures && t.flags & (1 /* Any */ | 4 /* String */)); });
var nameType = type.declaration.nameType && getTypeFromTypeNode(type.declaration.nameType);
// If the constraint is exclusively string/number/never type(s), we need to pull the property names from the modified type and run them through the `nameType` mapper as well
// since they won't appear in the constraint, due to subtype reducing with the string/number index types
var properties = nameType && everyType(constraint, function (t) { return !!(t.flags & (4 /* String */ | 8 /* Number */ | 131072 /* Never */)); }) && getPropertiesOfType(getApparentType(getModifiersTypeFromMappedType(type)));
return nameType ?
getUnionType([mapType(constraint, function (t) { return instantiateTypeAsMappedNameType(nameType, type, t); }), mapType(getUnionType(ts.map(properties || ts.emptyArray, function (p) { return getLiteralTypeFromProperty(p, 8576 /* StringOrNumberLiteralOrUnique */); })), function (t) { return instantiateTypeAsMappedNameType(nameType, type, t); })]) :
constraint;
}
// Ordinarily we reduce a keyof M, where M is a mapped type { [P in K as N<P>]: X }, to simply N<K>. This however presumes
// that N distributes over union types, i.e. that N<A | B | C> is equivalent to N<A> | N<B> | N<C>. Specifically, we only
// want to perform the reduction when the name type of a mapped type is distributive with respect to the type variable
// introduced by the 'in' clause of the mapped type. Note that non-generic types are considered to be distributive because
// they're the same type regardless of what's being distributed over.
function hasDistributiveNameType(mappedType) {
var typeVariable = getTypeParameterFromMappedType(mappedType);
return isDistributive(getNameTypeFromMappedType(mappedType) || typeVariable);
function isDistributive(type) {
return type.flags & (3 /* AnyOrUnknown */ | 131068 /* Primitive */ | 131072 /* Never */ | 262144 /* TypeParameter */ | 524288 /* Object */ | 67108864 /* NonPrimitive */) ? true :
type.flags & 16777216 /* Conditional */ ? type.root.isDistributive && type.checkType === typeVariable :
type.flags & (3145728 /* UnionOrIntersection */ | 134217728 /* TemplateLiteral */) ? ts.every(type.types, isDistributive) :
type.flags & 8388608 /* IndexedAccess */ ? isDistributive(type.objectType) && isDistributive(type.indexType) :
type.flags & 33554432 /* Substitution */ ? isDistributive(type.substitute) :
type.flags & 268435456 /* StringMapping */ ? isDistributive(type.type) :
false;
}
}
function getLiteralTypeFromPropertyName(name) {
if (ts.isPrivateIdentifier(name)) {
return neverType;
}
return ts.isIdentifier(name) ? getStringLiteralType(ts.unescapeLeadingUnderscores(name.escapedText)) :
getRegularTypeOfLiteralType(ts.isComputedPropertyName(name) ? checkComputedPropertyName(name) : checkExpression(name));
}
function getLiteralTypeFromProperty(prop, include, includeNonPublic) {
if (includeNonPublic || !(ts.getDeclarationModifierFlagsFromSymbol(prop) & 24 /* NonPublicAccessibilityModifier */)) {
var type = getSymbolLinks(getLateBoundSymbol(prop)).nameType;
if (!type) {
var name = ts.getNameOfDeclaration(prop.valueDeclaration);
type = prop.escapedName === "default" /* Default */ ? getStringLiteralType("default") :
name && getLiteralTypeFromPropertyName(name) || (!ts.isKnownSymbol(prop) ? getStringLiteralType(ts.symbolName(prop)) : undefined);
}
if (type && type.flags & include) {
return type;
}
}
return neverType;
}
function getLiteralTypeFromProperties(type, include, includeOrigin) {
var origin = includeOrigin && (ts.getObjectFlags(type) & (3 /* ClassOrInterface */ | 4 /* Reference */) || type.aliasSymbol) ? createOriginIndexType(type) : undefined;
var propertyTypes = ts.map(getPropertiesOfType(type), function (prop) { return getLiteralTypeFromProperty(prop, include); });
var indexKeyTypes = ts.map(getIndexInfosOfType(type), function (info) { return info !== enumNumberIndexInfo && info.keyType.flags & include ?
info.keyType === stringType && include & 8 /* Number */ ? stringOrNumberType : info.keyType : neverType; });
return getUnionType(ts.concatenate(propertyTypes, indexKeyTypes), 1 /* Literal */,
/*aliasSymbol*/ undefined, /*aliasTypeArguments*/ undefined, origin);
}
function getIndexType(type, stringsOnly, noIndexSignatures) {
if (stringsOnly === void 0) { stringsOnly = keyofStringsOnly; }
type = getReducedType(type);
return type.flags & 1048576 /* Union */ ? getIntersectionType(ts.map(type.types, function (t) { return getIndexType(t, stringsOnly, noIndexSignatures); })) :
type.flags & 2097152 /* Intersection */ ? getUnionType(ts.map(type.types, function (t) { return getIndexType(t, stringsOnly, noIndexSignatures); })) :
type.flags & 58982400 /* InstantiableNonPrimitive */ || isGenericTupleType(type) || isGenericMappedType(type) && !hasDistributiveNameType(type) ? getIndexTypeForGenericType(type, stringsOnly) :
ts.getObjectFlags(type) & 32 /* Mapped */ ? getIndexTypeForMappedType(type, noIndexSignatures) :
type === wildcardType ? wildcardType :
type.flags & 2 /* Unknown */ ? neverType :
type.flags & (1 /* Any */ | 131072 /* Never */) ? keyofConstraintType :
getLiteralTypeFromProperties(type, (noIndexSignatures ? 128 /* StringLiteral */ : 402653316 /* StringLike */) | (stringsOnly ? 0 : 296 /* NumberLike */ | 12288 /* ESSymbolLike */), stringsOnly === keyofStringsOnly && !noIndexSignatures);
}
function getExtractStringType(type) {
if (keyofStringsOnly) {
return type;
}
var extractTypeAlias = getGlobalExtractSymbol();
return extractTypeAlias ? getTypeAliasInstantiation(extractTypeAlias, [type, stringType]) : stringType;
}
function getIndexTypeOrString(type) {
var indexType = getExtractStringType(getIndexType(type));
return indexType.flags & 131072 /* Never */ ? stringType : indexType;
}
function getTypeFromTypeOperatorNode(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
switch (node.operator) {
case 139 /* KeyOfKeyword */:
links.resolvedType = getIndexType(getTypeFromTypeNode(node.type));
break;
case 152 /* UniqueKeyword */:
links.resolvedType = node.type.kind === 149 /* SymbolKeyword */
? getESSymbolLikeTypeForNode(ts.walkUpParenthesizedTypes(node.parent))
: errorType;
break;
case 143 /* ReadonlyKeyword */:
links.resolvedType = getTypeFromTypeNode(node.type);
break;
default:
throw ts.Debug.assertNever(node.operator);
}
}
return links.resolvedType;
}
function getTypeFromTemplateTypeNode(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
links.resolvedType = getTemplateLiteralType(__spreadArray([node.head.text], ts.map(node.templateSpans, function (span) { return span.literal.text; }), true), ts.map(node.templateSpans, function (span) { return getTypeFromTypeNode(span.type); }));
}
return links.resolvedType;
}
function getTemplateLiteralType(texts, types) {
var unionIndex = ts.findIndex(types, function (t) { return !!(t.flags & (131072 /* Never */ | 1048576 /* Union */)); });
if (unionIndex >= 0) {
return checkCrossProductUnion(types) ?
mapType(types[unionIndex], function (t) { return getTemplateLiteralType(texts, ts.replaceElement(types, unionIndex, t)); }) :
errorType;
}
if (ts.contains(types, wildcardType)) {
return wildcardType;
}
var newTypes = [];
var newTexts = [];
var text = texts[0];
if (!addSpans(texts, types)) {
return stringType;
}
if (newTypes.length === 0) {
return getStringLiteralType(text);
}
newTexts.push(text);
if (ts.every(newTexts, function (t) { return t === ""; }) && ts.every(newTypes, function (t) { return !!(t.flags & 4 /* String */); })) {
return stringType;
}
var id = getTypeListId(newTypes) + "|" + ts.map(newTexts, function (t) { return t.length; }).join(",") + "|" + newTexts.join("");
var type = templateLiteralTypes.get(id);
if (!type) {
templateLiteralTypes.set(id, type = createTemplateLiteralType(newTexts, newTypes));
}
return type;
function addSpans(texts, types) {
for (var i = 0; i < types.length; i++) {
var t = types[i];
if (t.flags & (2944 /* Literal */ | 65536 /* Null */ | 32768 /* Undefined */)) {
text += getTemplateStringForType(t) || "";
text += texts[i + 1];
}
else if (t.flags & 134217728 /* TemplateLiteral */) {
text += t.texts[0];
if (!addSpans(t.texts, t.types))
return false;
text += texts[i + 1];
}
else if (isGenericIndexType(t) || isPatternLiteralPlaceholderType(t)) {
newTypes.push(t);
newTexts.push(text);
text = texts[i + 1];
}
else {
return false;
}
}
return true;
}
}
function getTemplateStringForType(type) {
return type.flags & 128 /* StringLiteral */ ? type.value :
type.flags & 256 /* NumberLiteral */ ? "" + type.value :
type.flags & 2048 /* BigIntLiteral */ ? ts.pseudoBigIntToString(type.value) :
type.flags & (512 /* BooleanLiteral */ | 98304 /* Nullable */) ? type.intrinsicName :
undefined;
}
function createTemplateLiteralType(texts, types) {
var type = createType(134217728 /* TemplateLiteral */);
type.texts = texts;
type.types = types;
return type;
}
function getStringMappingType(symbol, type) {
return type.flags & (1048576 /* Union */ | 131072 /* Never */) ? mapType(type, function (t) { return getStringMappingType(symbol, t); }) :
isGenericIndexType(type) ? getStringMappingTypeForGenericType(symbol, type) :
type.flags & 128 /* StringLiteral */ ? getStringLiteralType(applyStringMapping(symbol, type.value)) :
type;
}
function applyStringMapping(symbol, str) {
switch (intrinsicTypeKinds.get(symbol.escapedName)) {
case 0 /* Uppercase */: return str.toUpperCase();
case 1 /* Lowercase */: return str.toLowerCase();
case 2 /* Capitalize */: return str.charAt(0).toUpperCase() + str.slice(1);
case 3 /* Uncapitalize */: return str.charAt(0).toLowerCase() + str.slice(1);
}
return str;
}
function getStringMappingTypeForGenericType(symbol, type) {
var id = getSymbolId(symbol) + "," + getTypeId(type);
var result = stringMappingTypes.get(id);
if (!result) {
stringMappingTypes.set(id, result = createStringMappingType(symbol, type));
}
return result;
}
function createStringMappingType(symbol, type) {
var result = createType(268435456 /* StringMapping */);
result.symbol = symbol;
result.type = type;
return result;
}
function createIndexedAccessType(objectType, indexType, accessFlags, aliasSymbol, aliasTypeArguments) {
var type = createType(8388608 /* IndexedAccess */);
type.objectType = objectType;
type.indexType = indexType;
type.accessFlags = accessFlags;
type.aliasSymbol = aliasSymbol;
type.aliasTypeArguments = aliasTypeArguments;
return type;
}
/**
* Returns if a type is or consists of a JSLiteral object type
* In addition to objects which are directly literals,
* * unions where every element is a jsliteral
* * intersections where at least one element is a jsliteral
* * and instantiable types constrained to a jsliteral
* Should all count as literals and not print errors on access or assignment of possibly existing properties.
* This mirrors the behavior of the index signature propagation, to which this behaves similarly (but doesn't affect assignability or inference).
*/
function isJSLiteralType(type) {
if (noImplicitAny) {
return false; // Flag is meaningless under `noImplicitAny` mode
}
if (ts.getObjectFlags(type) & 8192 /* JSLiteral */) {
return true;
}
if (type.flags & 1048576 /* Union */) {
return ts.every(type.types, isJSLiteralType);
}
if (type.flags & 2097152 /* Intersection */) {
return ts.some(type.types, isJSLiteralType);
}
if (type.flags & 465829888 /* Instantiable */) {
var constraint = getResolvedBaseConstraint(type);
return constraint !== type && isJSLiteralType(constraint);
}
return false;
}
function getPropertyNameFromIndex(indexType, accessNode) {
return isTypeUsableAsPropertyName(indexType) ?
getPropertyNameFromType(indexType) :
accessNode && ts.isPropertyName(accessNode) ?
// late bound names are handled in the first branch, so here we only need to handle normal names
ts.getPropertyNameForPropertyNameNode(accessNode) :
undefined;
}
function isUncalledFunctionReference(node, symbol) {
if (symbol.flags & (16 /* Function */ | 8192 /* Method */)) {
var parent = ts.findAncestor(node.parent, function (n) { return !ts.isAccessExpression(n); }) || node.parent;
if (ts.isCallLikeExpression(parent)) {
return ts.isCallOrNewExpression(parent) && ts.isIdentifier(node) && hasMatchingArgument(parent, node);
}
return ts.every(symbol.declarations, function (d) { return !ts.isFunctionLike(d) || !!(ts.getCombinedNodeFlags(d) & 134217728 /* Deprecated */); });
}
return true;
}
function getPropertyTypeForIndexType(originalObjectType, objectType, indexType, fullIndexType, accessNode, accessFlags) {
var _a;
var accessExpression = accessNode && accessNode.kind === 205 /* ElementAccessExpression */ ? accessNode : undefined;
var propName = accessNode && ts.isPrivateIdentifier(accessNode) ? undefined : getPropertyNameFromIndex(indexType, accessNode);
if (propName !== undefined) {
if (accessFlags & 256 /* Contextual */) {
return getTypeOfPropertyOfContextualType(objectType, propName) || anyType;
}
var prop = getPropertyOfType(objectType, propName);
if (prop) {
if (accessFlags & 64 /* ReportDeprecated */ && accessNode && prop.declarations && getDeclarationNodeFlagsFromSymbol(prop) & 134217728 /* Deprecated */ && isUncalledFunctionReference(accessNode, prop)) {
var deprecatedNode = (_a = accessExpression === null || accessExpression === void 0 ? void 0 : accessExpression.argumentExpression) !== null && _a !== void 0 ? _a : (ts.isIndexedAccessTypeNode(accessNode) ? accessNode.indexType : accessNode);
addDeprecatedSuggestion(deprecatedNode, prop.declarations, propName);
}
if (accessExpression) {
markPropertyAsReferenced(prop, accessExpression, isSelfTypeAccess(accessExpression.expression, objectType.symbol));
if (isAssignmentToReadonlyEntity(accessExpression, prop, ts.getAssignmentTargetKind(accessExpression))) {
error(accessExpression.argumentExpression, ts.Diagnostics.Cannot_assign_to_0_because_it_is_a_read_only_property, symbolToString(prop));
return undefined;
}
if (accessFlags & 8 /* CacheSymbol */) {
getNodeLinks(accessNode).resolvedSymbol = prop;
}
if (isThisPropertyAccessInConstructor(accessExpression, prop)) {
return autoType;
}
}
var propType = getTypeOfSymbol(prop);
return accessExpression && ts.getAssignmentTargetKind(accessExpression) !== 1 /* Definite */ ?
getFlowTypeOfReference(accessExpression, propType) :
propType;
}
if (everyType(objectType, isTupleType) && isNumericLiteralName(propName) && +propName >= 0) {
if (accessNode && everyType(objectType, function (t) { return !t.target.hasRestElement; }) && !(accessFlags & 16 /* NoTupleBoundsCheck */)) {
var indexNode = getIndexNodeForAccessExpression(accessNode);
if (isTupleType(objectType)) {
error(indexNode, ts.Diagnostics.Tuple_type_0_of_length_1_has_no_element_at_index_2, typeToString(objectType), getTypeReferenceArity(objectType), ts.unescapeLeadingUnderscores(propName));
}
else {
error(indexNode, ts.Diagnostics.Property_0_does_not_exist_on_type_1, ts.unescapeLeadingUnderscores(propName), typeToString(objectType));
}
}
errorIfWritingToReadonlyIndex(getIndexInfoOfType(objectType, numberType));
return mapType(objectType, function (t) {
var restType = getRestTypeOfTupleType(t) || undefinedType;
return accessFlags & 1 /* IncludeUndefined */ ? getUnionType([restType, undefinedType]) : restType;
});
}
}
if (!(indexType.flags & 98304 /* Nullable */) && isTypeAssignableToKind(indexType, 402653316 /* StringLike */ | 296 /* NumberLike */ | 12288 /* ESSymbolLike */)) {
if (objectType.flags & (1 /* Any */ | 131072 /* Never */)) {
return objectType;
}
// If no index signature is applicable, we default to the string index signature. In effect, this means the string
// index signature applies even when accessing with a symbol-like type.
var indexInfo = getApplicableIndexInfo(objectType, indexType) || getIndexInfoOfType(objectType, stringType);
if (indexInfo) {
if (accessFlags & 2 /* NoIndexSignatures */ && indexInfo.keyType !== numberType) {
if (accessExpression) {
error(accessExpression, ts.Diagnostics.Type_0_cannot_be_used_to_index_type_1, typeToString(indexType), typeToString(originalObjectType));
}
return undefined;
}
if (accessNode && indexInfo.keyType === stringType && !isTypeAssignableToKind(indexType, 4 /* String */ | 8 /* Number */)) {
var indexNode = getIndexNodeForAccessExpression(accessNode);
error(indexNode, ts.Diagnostics.Type_0_cannot_be_used_as_an_index_type, typeToString(indexType));
return accessFlags & 1 /* IncludeUndefined */ ? getUnionType([indexInfo.type, undefinedType]) : indexInfo.type;
}
errorIfWritingToReadonlyIndex(indexInfo);
return accessFlags & 1 /* IncludeUndefined */ ? getUnionType([indexInfo.type, undefinedType]) : indexInfo.type;
}
if (indexType.flags & 131072 /* Never */) {
return neverType;
}
if (isJSLiteralType(objectType)) {
return anyType;
}
if (accessExpression && !isConstEnumObjectType(objectType)) {
if (isObjectLiteralType(objectType)) {
if (noImplicitAny && indexType.flags & (128 /* StringLiteral */ | 256 /* NumberLiteral */)) {
diagnostics.add(ts.createDiagnosticForNode(accessExpression, ts.Diagnostics.Property_0_does_not_exist_on_type_1, indexType.value, typeToString(objectType)));
return undefinedType;
}
else if (indexType.flags & (8 /* Number */ | 4 /* String */)) {
var types = ts.map(objectType.properties, function (property) {
return getTypeOfSymbol(property);
});
return getUnionType(ts.append(types, undefinedType));
}
}
if (objectType.symbol === globalThisSymbol && propName !== undefined && globalThisSymbol.exports.has(propName) && (globalThisSymbol.exports.get(propName).flags & 418 /* BlockScoped */)) {
error(accessExpression, ts.Diagnostics.Property_0_does_not_exist_on_type_1, ts.unescapeLeadingUnderscores(propName), typeToString(objectType));
}
else if (noImplicitAny && !compilerOptions.suppressImplicitAnyIndexErrors && !(accessFlags & 128 /* SuppressNoImplicitAnyError */)) {
if (propName !== undefined && typeHasStaticProperty(propName, objectType)) {
var typeName = typeToString(objectType);
error(accessExpression, ts.Diagnostics.Property_0_does_not_exist_on_type_1_Did_you_mean_to_access_the_static_member_2_instead, propName, typeName, typeName + "[" + ts.getTextOfNode(accessExpression.argumentExpression) + "]");
}
else if (getIndexTypeOfType(objectType, numberType)) {
error(accessExpression.argumentExpression, ts.Diagnostics.Element_implicitly_has_an_any_type_because_index_expression_is_not_of_type_number);
}
else {
var suggestion = void 0;
if (propName !== undefined && (suggestion = getSuggestionForNonexistentProperty(propName, objectType))) {
if (suggestion !== undefined) {
error(accessExpression.argumentExpression, ts.Diagnostics.Property_0_does_not_exist_on_type_1_Did_you_mean_2, propName, typeToString(objectType), suggestion);
}
}
else {
var suggestion_1 = getSuggestionForNonexistentIndexSignature(objectType, accessExpression, indexType);
if (suggestion_1 !== undefined) {
error(accessExpression, ts.Diagnostics.Element_implicitly_has_an_any_type_because_type_0_has_no_index_signature_Did_you_mean_to_call_1, typeToString(objectType), suggestion_1);
}
else {
var errorInfo = void 0;
if (indexType.flags & 1024 /* EnumLiteral */) {
errorInfo = ts.chainDiagnosticMessages(/* details */ undefined, ts.Diagnostics.Property_0_does_not_exist_on_type_1, "[" + typeToString(indexType) + "]", typeToString(objectType));
}
else if (indexType.flags & 8192 /* UniqueESSymbol */) {
var symbolName_2 = getFullyQualifiedName(indexType.symbol, accessExpression);
errorInfo = ts.chainDiagnosticMessages(/* details */ undefined, ts.Diagnostics.Property_0_does_not_exist_on_type_1, "[" + symbolName_2 + "]", typeToString(objectType));
}
else if (indexType.flags & 128 /* StringLiteral */) {
errorInfo = ts.chainDiagnosticMessages(/* details */ undefined, ts.Diagnostics.Property_0_does_not_exist_on_type_1, indexType.value, typeToString(objectType));
}
else if (indexType.flags & 256 /* NumberLiteral */) {
errorInfo = ts.chainDiagnosticMessages(/* details */ undefined, ts.Diagnostics.Property_0_does_not_exist_on_type_1, indexType.value, typeToString(objectType));
}
else if (indexType.flags & (8 /* Number */ | 4 /* String */)) {
errorInfo = ts.chainDiagnosticMessages(/* details */ undefined, ts.Diagnostics.No_index_signature_with_a_parameter_of_type_0_was_found_on_type_1, typeToString(indexType), typeToString(objectType));
}
errorInfo = ts.chainDiagnosticMessages(errorInfo, ts.Diagnostics.Element_implicitly_has_an_any_type_because_expression_of_type_0_can_t_be_used_to_index_type_1, typeToString(fullIndexType), typeToString(objectType));
diagnostics.add(ts.createDiagnosticForNodeFromMessageChain(accessExpression, errorInfo));
}
}
}
}
return undefined;
}
}
if (isJSLiteralType(objectType)) {
return anyType;
}
if (accessNode) {
var indexNode = getIndexNodeForAccessExpression(accessNode);
if (indexType.flags & (128 /* StringLiteral */ | 256 /* NumberLiteral */)) {
error(indexNode, ts.Diagnostics.Property_0_does_not_exist_on_type_1, "" + indexType.value, typeToString(objectType));
}
else if (indexType.flags & (4 /* String */ | 8 /* Number */)) {
error(indexNode, ts.Diagnostics.Type_0_has_no_matching_index_signature_for_type_1, typeToString(objectType), typeToString(indexType));
}
else {
error(indexNode, ts.Diagnostics.Type_0_cannot_be_used_as_an_index_type, typeToString(indexType));
}
}
if (isTypeAny(indexType)) {
return indexType;
}
return undefined;
function errorIfWritingToReadonlyIndex(indexInfo) {
if (indexInfo && indexInfo.isReadonly && accessExpression && (ts.isAssignmentTarget(accessExpression) || ts.isDeleteTarget(accessExpression))) {
error(accessExpression, ts.Diagnostics.Index_signature_in_type_0_only_permits_reading, typeToString(objectType));
}
}
}
function getIndexNodeForAccessExpression(accessNode) {
return accessNode.kind === 205 /* ElementAccessExpression */ ? accessNode.argumentExpression :
accessNode.kind === 192 /* IndexedAccessType */ ? accessNode.indexType :
accessNode.kind === 160 /* ComputedPropertyName */ ? accessNode.expression :
accessNode;
}
function isPatternLiteralPlaceholderType(type) {
return !!(type.flags & (1 /* Any */ | 4 /* String */ | 8 /* Number */ | 64 /* BigInt */));
}
function isPatternLiteralType(type) {
return !!(type.flags & 134217728 /* TemplateLiteral */) && ts.every(type.types, isPatternLiteralPlaceholderType);
}
function isGenericType(type) {
return !!getGenericObjectFlags(type);
}
function isGenericObjectType(type) {
return !!(getGenericObjectFlags(type) & 8388608 /* IsGenericObjectType */);
}
function isGenericIndexType(type) {
return !!(getGenericObjectFlags(type) & 16777216 /* IsGenericIndexType */);
}
function getGenericObjectFlags(type) {
if (type.flags & 3145728 /* UnionOrIntersection */) {
if (!(type.objectFlags & 4194304 /* IsGenericTypeComputed */)) {
type.objectFlags |= 4194304 /* IsGenericTypeComputed */ |
ts.reduceLeft(type.types, function (flags, t) { return flags | getGenericObjectFlags(t); }, 0);
}
return type.objectFlags & 25165824 /* IsGenericType */;
}
if (type.flags & 33554432 /* Substitution */) {
if (!(type.objectFlags & 4194304 /* IsGenericTypeComputed */)) {
type.objectFlags |= 4194304 /* IsGenericTypeComputed */ |
getGenericObjectFlags(type.substitute) | getGenericObjectFlags(type.baseType);
}
return type.objectFlags & 25165824 /* IsGenericType */;
}
return (type.flags & 58982400 /* InstantiableNonPrimitive */ || isGenericMappedType(type) || isGenericTupleType(type) ? 8388608 /* IsGenericObjectType */ : 0) |
(type.flags & (58982400 /* InstantiableNonPrimitive */ | 4194304 /* Index */ | 134217728 /* TemplateLiteral */ | 268435456 /* StringMapping */) && !isPatternLiteralType(type) ? 16777216 /* IsGenericIndexType */ : 0);
}
function isThisTypeParameter(type) {
return !!(type.flags & 262144 /* TypeParameter */ && type.isThisType);
}
function getSimplifiedType(type, writing) {
return type.flags & 8388608 /* IndexedAccess */ ? getSimplifiedIndexedAccessType(type, writing) :
type.flags & 16777216 /* Conditional */ ? getSimplifiedConditionalType(type, writing) :
type;
}
function distributeIndexOverObjectType(objectType, indexType, writing) {
// (T | U)[K] -> T[K] | U[K] (reading)
// (T | U)[K] -> T[K] & U[K] (writing)
// (T & U)[K] -> T[K] & U[K]
if (objectType.flags & 3145728 /* UnionOrIntersection */) {
var types = ts.map(objectType.types, function (t) { return getSimplifiedType(getIndexedAccessType(t, indexType), writing); });
return objectType.flags & 2097152 /* Intersection */ || writing ? getIntersectionType(types) : getUnionType(types);
}
}
function distributeObjectOverIndexType(objectType, indexType, writing) {
// T[A | B] -> T[A] | T[B] (reading)
// T[A | B] -> T[A] & T[B] (writing)
if (indexType.flags & 1048576 /* Union */) {
var types = ts.map(indexType.types, function (t) { return getSimplifiedType(getIndexedAccessType(objectType, t), writing); });
return writing ? getIntersectionType(types) : getUnionType(types);
}
}
// Transform an indexed access to a simpler form, if possible. Return the simpler form, or return
// the type itself if no transformation is possible. The writing flag indicates that the type is
// the target of an assignment.
function getSimplifiedIndexedAccessType(type, writing) {
var cache = writing ? "simplifiedForWriting" : "simplifiedForReading";
if (type[cache]) {
return type[cache] === circularConstraintType ? type : type[cache];
}
type[cache] = circularConstraintType;
// We recursively simplify the object type as it may in turn be an indexed access type. For example, with
// '{ [P in T]: { [Q in U]: number } }[T][U]' we want to first simplify the inner indexed access type.
var objectType = getSimplifiedType(type.objectType, writing);
var indexType = getSimplifiedType(type.indexType, writing);
// T[A | B] -> T[A] | T[B] (reading)
// T[A | B] -> T[A] & T[B] (writing)
var distributedOverIndex = distributeObjectOverIndexType(objectType, indexType, writing);
if (distributedOverIndex) {
return type[cache] = distributedOverIndex;
}
// Only do the inner distributions if the index can no longer be instantiated to cause index distribution again
if (!(indexType.flags & 465829888 /* Instantiable */)) {
// (T | U)[K] -> T[K] | U[K] (reading)
// (T | U)[K] -> T[K] & U[K] (writing)
// (T & U)[K] -> T[K] & U[K]
var distributedOverObject = distributeIndexOverObjectType(objectType, indexType, writing);
if (distributedOverObject) {
return type[cache] = distributedOverObject;
}
}
// So ultimately (reading):
// ((A & B) | C)[K1 | K2] -> ((A & B) | C)[K1] | ((A & B) | C)[K2] -> (A & B)[K1] | C[K1] | (A & B)[K2] | C[K2] -> (A[K1] & B[K1]) | C[K1] | (A[K2] & B[K2]) | C[K2]
// A generic tuple type indexed by a number exists only when the index type doesn't select a
// fixed element. We simplify to either the combined type of all elements (when the index type
// the actual number type) or to the combined type of all non-fixed elements.
if (isGenericTupleType(objectType) && indexType.flags & 296 /* NumberLike */) {
var elementType = getElementTypeOfSliceOfTupleType(objectType, indexType.flags & 8 /* Number */ ? 0 : objectType.target.fixedLength, /*endSkipCount*/ 0, writing);
if (elementType) {
return type[cache] = elementType;
}
}
// If the object type is a mapped type { [P in K]: E }, where K is generic, instantiate E using a mapper
// that substitutes the index type for P. For example, for an index access { [P in K]: Box<T[P]> }[X], we
// construct the type Box<T[X]>.
if (isGenericMappedType(objectType)) {
return type[cache] = mapType(substituteIndexedMappedType(objectType, type.indexType), function (t) { return getSimplifiedType(t, writing); });
}
return type[cache] = type;
}
function isConditionalTypeAlwaysTrueDisregardingInferTypes(type) {
var extendsInferParamMapper = type.root.inferTypeParameters && createTypeMapper(type.root.inferTypeParameters, ts.map(type.root.inferTypeParameters, function () { return wildcardType; }));
var checkType = type.checkType;
var extendsType = type.extendsType;
return isTypeAssignableTo(getRestrictiveInstantiation(checkType), getRestrictiveInstantiation(instantiateType(extendsType, extendsInferParamMapper)));
}
function getSimplifiedConditionalType(type, writing) {
var checkType = type.checkType;
var extendsType = type.extendsType;
var trueType = getTrueTypeFromConditionalType(type);
var falseType = getFalseTypeFromConditionalType(type);
// Simplifications for types of the form `T extends U ? T : never` and `T extends U ? never : T`.
if (falseType.flags & 131072 /* Never */ && getActualTypeVariable(trueType) === getActualTypeVariable(checkType)) {
if (checkType.flags & 1 /* Any */ || isTypeAssignableTo(getRestrictiveInstantiation(checkType), getRestrictiveInstantiation(extendsType))) { // Always true
return getSimplifiedType(trueType, writing);
}
else if (isIntersectionEmpty(checkType, extendsType)) { // Always false
return neverType;
}
}
else if (trueType.flags & 131072 /* Never */ && getActualTypeVariable(falseType) === getActualTypeVariable(checkType)) {
if (!(checkType.flags & 1 /* Any */) && isTypeAssignableTo(getRestrictiveInstantiation(checkType), getRestrictiveInstantiation(extendsType))) { // Always true
return neverType;
}
else if (checkType.flags & 1 /* Any */ || isIntersectionEmpty(checkType, extendsType)) { // Always false
return getSimplifiedType(falseType, writing);
}
}
return type;
}
/**
* Invokes union simplification logic to determine if an intersection is considered empty as a union constituent
*/
function isIntersectionEmpty(type1, type2) {
return !!(getUnionType([intersectTypes(type1, type2), neverType]).flags & 131072 /* Never */);
}
function substituteIndexedMappedType(objectType, index) {
var mapper = createTypeMapper([getTypeParameterFromMappedType(objectType)], [index]);
var templateMapper = combineTypeMappers(objectType.mapper, mapper);
return instantiateType(getTemplateTypeFromMappedType(objectType), templateMapper);
}
function getIndexedAccessType(objectType, indexType, accessFlags, accessNode, aliasSymbol, aliasTypeArguments) {
if (accessFlags === void 0) { accessFlags = 0 /* None */; }
return getIndexedAccessTypeOrUndefined(objectType, indexType, accessFlags, accessNode, aliasSymbol, aliasTypeArguments) || (accessNode ? errorType : unknownType);
}
function indexTypeLessThan(indexType, limit) {
return everyType(indexType, function (t) {
if (t.flags & 384 /* StringOrNumberLiteral */) {
var propName = getPropertyNameFromType(t);
if (isNumericLiteralName(propName)) {
var index = +propName;
return index >= 0 && index < limit;
}
}
return false;
});
}
function getIndexedAccessTypeOrUndefined(objectType, indexType, accessFlags, accessNode, aliasSymbol, aliasTypeArguments) {
if (accessFlags === void 0) { accessFlags = 0 /* None */; }
if (objectType === wildcardType || indexType === wildcardType) {
return wildcardType;
}
// If the object type has a string index signature and no other members we know that the result will
// always be the type of that index signature and we can simplify accordingly.
if (isStringIndexSignatureOnlyType(objectType) && !(indexType.flags & 98304 /* Nullable */) && isTypeAssignableToKind(indexType, 4 /* String */ | 8 /* Number */)) {
indexType = stringType;
}
// In noUncheckedIndexedAccess mode, indexed access operations that occur in an expression in a read position and resolve to
// an index signature have 'undefined' included in their type.
if (compilerOptions.noUncheckedIndexedAccess && accessFlags & 32 /* ExpressionPosition */)
accessFlags |= 1 /* IncludeUndefined */;
// If the index type is generic, or if the object type is generic and doesn't originate in an expression and
// the operation isn't exclusively indexing the fixed (non-variadic) portion of a tuple type, we are performing
// a higher-order index access where we cannot meaningfully access the properties of the object type. Note that
// for a generic T and a non-generic K, we eagerly resolve T[K] if it originates in an expression. This is to
// preserve backwards compatibility. For example, an element access 'this["foo"]' has always been resolved
// eagerly using the constraint type of 'this' at the given location.
if (isGenericIndexType(indexType) || (accessNode && accessNode.kind !== 192 /* IndexedAccessType */ ?
isGenericTupleType(objectType) && !indexTypeLessThan(indexType, objectType.target.fixedLength) :
isGenericObjectType(objectType) && !(isTupleType(objectType) && indexTypeLessThan(indexType, objectType.target.fixedLength)))) {
if (objectType.flags & 3 /* AnyOrUnknown */) {
return objectType;
}
// Defer the operation by creating an indexed access type.
var persistentAccessFlags = accessFlags & 1 /* Persistent */;
var id = objectType.id + "," + indexType.id + "," + persistentAccessFlags + getAliasId(aliasSymbol, aliasTypeArguments);
var type = indexedAccessTypes.get(id);
if (!type) {
indexedAccessTypes.set(id, type = createIndexedAccessType(objectType, indexType, persistentAccessFlags, aliasSymbol, aliasTypeArguments));
}
return type;
}
// In the following we resolve T[K] to the type of the property in T selected by K.
// We treat boolean as different from other unions to improve errors;
// skipping straight to getPropertyTypeForIndexType gives errors with 'boolean' instead of 'true'.
var apparentObjectType = getReducedApparentType(objectType);
if (indexType.flags & 1048576 /* Union */ && !(indexType.flags & 16 /* Boolean */)) {
var propTypes = [];
var wasMissingProp = false;
for (var _i = 0, _a = indexType.types; _i < _a.length; _i++) {
var t = _a[_i];
var propType = getPropertyTypeForIndexType(objectType, apparentObjectType, t, indexType, accessNode, accessFlags | (wasMissingProp ? 128 /* SuppressNoImplicitAnyError */ : 0));
if (propType) {
propTypes.push(propType);
}
else if (!accessNode) {
// If there's no error node, we can immeditely stop, since error reporting is off
return undefined;
}
else {
// Otherwise we set a flag and return at the end of the loop so we still mark all errors
wasMissingProp = true;
}
}
if (wasMissingProp) {
return undefined;
}
return accessFlags & 4 /* Writing */
? getIntersectionType(propTypes, aliasSymbol, aliasTypeArguments)
: getUnionType(propTypes, 1 /* Literal */, aliasSymbol, aliasTypeArguments);
}
return getPropertyTypeForIndexType(objectType, apparentObjectType, indexType, indexType, accessNode, accessFlags | 8 /* CacheSymbol */ | 64 /* ReportDeprecated */);
}
function getTypeFromIndexedAccessTypeNode(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
var objectType = getTypeFromTypeNode(node.objectType);
var indexType = getTypeFromTypeNode(node.indexType);
var potentialAlias = getAliasSymbolForTypeNode(node);
var resolved = getIndexedAccessType(objectType, indexType, 0 /* None */, node, potentialAlias, getTypeArgumentsForAliasSymbol(potentialAlias));
links.resolvedType = resolved.flags & 8388608 /* IndexedAccess */ &&
resolved.objectType === objectType &&
resolved.indexType === indexType ?
getConditionalFlowTypeOfType(resolved, node) : resolved;
}
return links.resolvedType;
}
function getTypeFromMappedTypeNode(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
var type = createObjectType(32 /* Mapped */, node.symbol);
type.declaration = node;
type.aliasSymbol = getAliasSymbolForTypeNode(node);
type.aliasTypeArguments = getTypeArgumentsForAliasSymbol(type.aliasSymbol);
links.resolvedType = type;
// Eagerly resolve the constraint type which forces an error if the constraint type circularly
// references itself through one or more type aliases.
getConstraintTypeFromMappedType(type);
}
return links.resolvedType;
}
function getActualTypeVariable(type) {
if (type.flags & 33554432 /* Substitution */) {
return type.baseType;
}
if (type.flags & 8388608 /* IndexedAccess */ && (type.objectType.flags & 33554432 /* Substitution */ ||
type.indexType.flags & 33554432 /* Substitution */)) {
return getIndexedAccessType(getActualTypeVariable(type.objectType), getActualTypeVariable(type.indexType));
}
return type;
}
function isTypicalNondistributiveConditional(root) {
return !root.isDistributive && isSingletonTupleType(root.node.checkType) && isSingletonTupleType(root.node.extendsType);
}
function isSingletonTupleType(node) {
return ts.isTupleTypeNode(node) && ts.length(node.elements) === 1 && !ts.isOptionalTypeNode(node.elements[0]) && !ts.isRestTypeNode(node.elements[0]);
}
/**
* We syntactually check for common nondistributive conditional shapes and unwrap them into
* the intended comparison - we do this so we can check if the unwrapped types are generic or
* not and appropriately defer condition calculation
*/
function unwrapNondistributiveConditionalTuple(root, type) {
return isTypicalNondistributiveConditional(root) && isTupleType(type) ? getTypeArguments(type)[0] : type;
}
function getConditionalType(root, mapper, aliasSymbol, aliasTypeArguments) {
var result;
var extraTypes;
// We loop here for an immediately nested conditional type in the false position, effectively treating
// types of the form 'A extends B ? X : C extends D ? Y : E extends F ? Z : ...' as a single construct for
// purposes of resolution. This means such types aren't subject to the instantiation depth limiter.
while (true) {
var isUnwrapped = isTypicalNondistributiveConditional(root);
var checkType = instantiateType(unwrapNondistributiveConditionalTuple(root, getActualTypeVariable(root.checkType)), mapper);
var checkTypeInstantiable = isGenericType(checkType);
var extendsType = instantiateType(unwrapNondistributiveConditionalTuple(root, root.extendsType), mapper);
if (checkType === wildcardType || extendsType === wildcardType) {
return wildcardType;
}
var combinedMapper = void 0;
if (root.inferTypeParameters) {
var context = createInferenceContext(root.inferTypeParameters, /*signature*/ undefined, 0 /* None */);
if (!checkTypeInstantiable) {
// We don't want inferences from constraints as they may cause us to eagerly resolve the
// conditional type instead of deferring resolution. Also, we always want strict function
// types rules (i.e. proper contravariance) for inferences.
inferTypes(context.inferences, checkType, extendsType, 512 /* NoConstraints */ | 1024 /* AlwaysStrict */);
}
// It's possible for 'infer T' type paramteters to be given uninstantiated constraints when the
// those type parameters are used in type references (see getInferredTypeParameterConstraint). For
// that reason we need context.mapper to be first in the combined mapper. See #42636 for examples.
combinedMapper = mapper ? combineTypeMappers(context.mapper, mapper) : context.mapper;
}
// Instantiate the extends type including inferences for 'infer T' type parameters
var inferredExtendsType = combinedMapper ? instantiateType(unwrapNondistributiveConditionalTuple(root, root.extendsType), combinedMapper) : extendsType;
// We attempt to resolve the conditional type only when the check and extends types are non-generic
if (!checkTypeInstantiable && !isGenericType(inferredExtendsType)) {
// Return falseType for a definitely false extends check. We check an instantiations of the two
// types with type parameters mapped to the wildcard type, the most permissive instantiations
// possible (the wildcard type is assignable to and from all types). If those are not related,
// then no instantiations will be and we can just return the false branch type.
if (!(inferredExtendsType.flags & 3 /* AnyOrUnknown */) && ((checkType.flags & 1 /* Any */ && !isUnwrapped) || !isTypeAssignableTo(getPermissiveInstantiation(checkType), getPermissiveInstantiation(inferredExtendsType)))) {
// Return union of trueType and falseType for 'any' since it matches anything
if (checkType.flags & 1 /* Any */ && !isUnwrapped) {
(extraTypes || (extraTypes = [])).push(instantiateType(getTypeFromTypeNode(root.node.trueType), combinedMapper || mapper));
}
// If falseType is an immediately nested conditional type that isn't distributive or has an
// identical checkType, switch to that type and loop.
var falseType_1 = getTypeFromTypeNode(root.node.falseType);
if (falseType_1.flags & 16777216 /* Conditional */) {
var newRoot = falseType_1.root;
if (newRoot.node.parent === root.node && (!newRoot.isDistributive || newRoot.checkType === root.checkType)) {
root = newRoot;
continue;
}
}
result = instantiateType(falseType_1, mapper);
break;
}
// Return trueType for a definitely true extends check. We check instantiations of the two
// types with type parameters mapped to their restrictive form, i.e. a form of the type parameter
// that has no constraint. This ensures that, for example, the type
// type Foo<T extends { x: any }> = T extends { x: string } ? string : number
// doesn't immediately resolve to 'string' instead of being deferred.
if (inferredExtendsType.flags & 3 /* AnyOrUnknown */ || isTypeAssignableTo(getRestrictiveInstantiation(checkType), getRestrictiveInstantiation(inferredExtendsType))) {
result = instantiateType(getTypeFromTypeNode(root.node.trueType), combinedMapper || mapper);
break;
}
}
// Return a deferred type for a check that is neither definitely true nor definitely false
result = createType(16777216 /* Conditional */);
result.root = root;
result.checkType = instantiateType(root.checkType, mapper);
result.extendsType = instantiateType(root.extendsType, mapper);
result.mapper = mapper;
result.combinedMapper = combinedMapper;
result.aliasSymbol = aliasSymbol || root.aliasSymbol;
result.aliasTypeArguments = aliasSymbol ? aliasTypeArguments : instantiateTypes(root.aliasTypeArguments, mapper); // TODO: GH#18217
break;
}
return extraTypes ? getUnionType(ts.append(extraTypes, result)) : result;
}
function getTrueTypeFromConditionalType(type) {
return type.resolvedTrueType || (type.resolvedTrueType = instantiateType(getTypeFromTypeNode(type.root.node.trueType), type.mapper));
}
function getFalseTypeFromConditionalType(type) {
return type.resolvedFalseType || (type.resolvedFalseType = instantiateType(getTypeFromTypeNode(type.root.node.falseType), type.mapper));
}
function getInferredTrueTypeFromConditionalType(type) {
return type.resolvedInferredTrueType || (type.resolvedInferredTrueType = type.combinedMapper ? instantiateType(getTypeFromTypeNode(type.root.node.trueType), type.combinedMapper) : getTrueTypeFromConditionalType(type));
}
function getInferTypeParameters(node) {
var result;
if (node.locals) {
node.locals.forEach(function (symbol) {
if (symbol.flags & 262144 /* TypeParameter */) {
result = ts.append(result, getDeclaredTypeOfSymbol(symbol));
}
});
}
return result;
}
function getTypeFromConditionalTypeNode(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
var checkType = getTypeFromTypeNode(node.checkType);
var aliasSymbol = getAliasSymbolForTypeNode(node);
var aliasTypeArguments = getTypeArgumentsForAliasSymbol(aliasSymbol);
var allOuterTypeParameters = getOuterTypeParameters(node, /*includeThisTypes*/ true);
var outerTypeParameters = aliasTypeArguments ? allOuterTypeParameters : ts.filter(allOuterTypeParameters, function (tp) { return isTypeParameterPossiblyReferenced(tp, node); });
var root = {
node: node,
checkType: checkType,
extendsType: getTypeFromTypeNode(node.extendsType),
isDistributive: !!(checkType.flags & 262144 /* TypeParameter */),
inferTypeParameters: getInferTypeParameters(node),
outerTypeParameters: outerTypeParameters,
instantiations: undefined,
aliasSymbol: aliasSymbol,
aliasTypeArguments: aliasTypeArguments
};
links.resolvedType = getConditionalType(root, /*mapper*/ undefined);
if (outerTypeParameters) {
root.instantiations = new ts.Map();
root.instantiations.set(getTypeListId(outerTypeParameters), links.resolvedType);
}
}
return links.resolvedType;
}
function getTypeFromInferTypeNode(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
links.resolvedType = getDeclaredTypeOfTypeParameter(getSymbolOfNode(node.typeParameter));
}
return links.resolvedType;
}
function getIdentifierChain(node) {
if (ts.isIdentifier(node)) {
return [node];
}
else {
return ts.append(getIdentifierChain(node.left), node.right);
}
}
function getTypeFromImportTypeNode(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
if (node.isTypeOf && node.typeArguments) { // Only the non-typeof form can make use of type arguments
error(node, ts.Diagnostics.Type_arguments_cannot_be_used_here);
links.resolvedSymbol = unknownSymbol;
return links.resolvedType = errorType;
}
if (!ts.isLiteralImportTypeNode(node)) {
error(node.argument, ts.Diagnostics.String_literal_expected);
links.resolvedSymbol = unknownSymbol;
return links.resolvedType = errorType;
}
var targetMeaning = node.isTypeOf ? 111551 /* Value */ : node.flags & 4194304 /* JSDoc */ ? 111551 /* Value */ | 788968 /* Type */ : 788968 /* Type */;
// TODO: Future work: support unions/generics/whatever via a deferred import-type
var innerModuleSymbol = resolveExternalModuleName(node, node.argument.literal);
if (!innerModuleSymbol) {
links.resolvedSymbol = unknownSymbol;
return links.resolvedType = errorType;
}
var moduleSymbol = resolveExternalModuleSymbol(innerModuleSymbol, /*dontResolveAlias*/ false);
if (!ts.nodeIsMissing(node.qualifier)) {
var nameStack = getIdentifierChain(node.qualifier);
var currentNamespace = moduleSymbol;
var current = void 0;
while (current = nameStack.shift()) {
var meaning = nameStack.length ? 1920 /* Namespace */ : targetMeaning;
// typeof a.b.c is normally resolved using `checkExpression` which in turn defers to `checkQualifiedName`
// That, in turn, ultimately uses `getPropertyOfType` on the type of the symbol, which differs slightly from
// the `exports` lookup process that only looks up namespace members which is used for most type references
var mergedResolvedSymbol = getMergedSymbol(resolveSymbol(currentNamespace));
var next = node.isTypeOf
? getPropertyOfType(getTypeOfSymbol(mergedResolvedSymbol), current.escapedText)
: getSymbol(getExportsOfSymbol(mergedResolvedSymbol), current.escapedText, meaning);
if (!next) {
error(current, ts.Diagnostics.Namespace_0_has_no_exported_member_1, getFullyQualifiedName(currentNamespace), ts.declarationNameToString(current));
return links.resolvedType = errorType;
}
getNodeLinks(current).resolvedSymbol = next;
getNodeLinks(current.parent).resolvedSymbol = next;
currentNamespace = next;
}
links.resolvedType = resolveImportSymbolType(node, links, currentNamespace, targetMeaning);
}
else {
if (moduleSymbol.flags & targetMeaning) {
links.resolvedType = resolveImportSymbolType(node, links, moduleSymbol, targetMeaning);
}
else {
var errorMessage = targetMeaning === 111551 /* Value */
? ts.Diagnostics.Module_0_does_not_refer_to_a_value_but_is_used_as_a_value_here
: ts.Diagnostics.Module_0_does_not_refer_to_a_type_but_is_used_as_a_type_here_Did_you_mean_typeof_import_0;
error(node, errorMessage, node.argument.literal.text);
links.resolvedSymbol = unknownSymbol;
links.resolvedType = errorType;
}
}
}
return links.resolvedType;
}
function resolveImportSymbolType(node, links, symbol, meaning) {
var resolvedSymbol = resolveSymbol(symbol);
links.resolvedSymbol = resolvedSymbol;
if (meaning === 111551 /* Value */) {
return getTypeOfSymbol(symbol); // intentionally doesn't use resolved symbol so type is cached as expected on the alias
}
else {
return getTypeReferenceType(node, resolvedSymbol); // getTypeReferenceType doesn't handle aliases - it must get the resolved symbol
}
}
function getTypeFromTypeLiteralOrFunctionOrConstructorTypeNode(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
// Deferred resolution of members is handled by resolveObjectTypeMembers
var aliasSymbol = getAliasSymbolForTypeNode(node);
if (getMembersOfSymbol(node.symbol).size === 0 && !aliasSymbol) {
links.resolvedType = emptyTypeLiteralType;
}
else {
var type = createObjectType(16 /* Anonymous */, node.symbol);
type.aliasSymbol = aliasSymbol;
type.aliasTypeArguments = getTypeArgumentsForAliasSymbol(aliasSymbol);
if (ts.isJSDocTypeLiteral(node) && node.isArrayType) {
type = createArrayType(type);
}
links.resolvedType = type;
}
}
return links.resolvedType;
}
function getAliasSymbolForTypeNode(node) {
var host = node.parent;
while (ts.isParenthesizedTypeNode(host) || ts.isJSDocTypeExpression(host) || ts.isTypeOperatorNode(host) && host.operator === 143 /* ReadonlyKeyword */) {
host = host.parent;
}
return ts.isTypeAlias(host) ? getSymbolOfNode(host) : undefined;
}
function getTypeArgumentsForAliasSymbol(symbol) {
return symbol ? getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(symbol) : undefined;
}
function isNonGenericObjectType(type) {
return !!(type.flags & 524288 /* Object */) && !isGenericMappedType(type);
}
function isEmptyObjectTypeOrSpreadsIntoEmptyObject(type) {
return isEmptyObjectType(type) || !!(type.flags & (65536 /* Null */ | 32768 /* Undefined */ | 528 /* BooleanLike */ | 296 /* NumberLike */ | 2112 /* BigIntLike */ | 402653316 /* StringLike */ | 1056 /* EnumLike */ | 67108864 /* NonPrimitive */ | 4194304 /* Index */));
}
function tryMergeUnionOfObjectTypeAndEmptyObject(type, readonly) {
if (!(type.flags & 1048576 /* Union */)) {
return type;
}
if (ts.every(type.types, isEmptyObjectTypeOrSpreadsIntoEmptyObject)) {
return ts.find(type.types, isEmptyObjectType) || emptyObjectType;
}
var firstType = ts.find(type.types, function (t) { return !isEmptyObjectTypeOrSpreadsIntoEmptyObject(t); });
if (!firstType) {
return type;
}
var secondType = ts.find(type.types, function (t) { return t !== firstType && !isEmptyObjectTypeOrSpreadsIntoEmptyObject(t); });
if (secondType) {
return type;
}
return getAnonymousPartialType(firstType);
function getAnonymousPartialType(type) {
// gets the type as if it had been spread, but where everything in the spread is made optional
var members = ts.createSymbolTable();
for (var _i = 0, _a = getPropertiesOfType(type); _i < _a.length; _i++) {
var prop = _a[_i];
if (ts.getDeclarationModifierFlagsFromSymbol(prop) & (8 /* Private */ | 16 /* Protected */)) {
// do nothing, skip privates
}
else if (isSpreadableProperty(prop)) {
var isSetonlyAccessor = prop.flags & 65536 /* SetAccessor */ && !(prop.flags & 32768 /* GetAccessor */);
var flags = 4 /* Property */ | 16777216 /* Optional */;
var result = createSymbol(flags, prop.escapedName, getIsLateCheckFlag(prop) | (readonly ? 8 /* Readonly */ : 0));
result.type = isSetonlyAccessor ? undefinedType : addOptionality(getTypeOfSymbol(prop), /*isProperty*/ true);
result.declarations = prop.declarations;
result.nameType = getSymbolLinks(prop).nameType;
result.syntheticOrigin = prop;
members.set(prop.escapedName, result);
}
}
var spread = createAnonymousType(type.symbol, members, ts.emptyArray, ts.emptyArray, getIndexInfosOfType(type));
spread.objectFlags |= 128 /* ObjectLiteral */ | 262144 /* ContainsObjectOrArrayLiteral */;
return spread;
}
}
/**
* Since the source of spread types are object literals, which are not binary,
* this function should be called in a left folding style, with left = previous result of getSpreadType
* and right = the new element to be spread.
*/
function getSpreadType(left, right, symbol, objectFlags, readonly) {
if (left.flags & 1 /* Any */ || right.flags & 1 /* Any */) {
return anyType;
}
if (left.flags & 2 /* Unknown */ || right.flags & 2 /* Unknown */) {
return unknownType;
}
if (left.flags & 131072 /* Never */) {
return right;
}
if (right.flags & 131072 /* Never */) {
return left;
}
left = tryMergeUnionOfObjectTypeAndEmptyObject(left, readonly);
if (left.flags & 1048576 /* Union */) {
return checkCrossProductUnion([left, right])
? mapType(left, function (t) { return getSpreadType(t, right, symbol, objectFlags, readonly); })
: errorType;
}
right = tryMergeUnionOfObjectTypeAndEmptyObject(right, readonly);
if (right.flags & 1048576 /* Union */) {
return checkCrossProductUnion([left, right])
? mapType(right, function (t) { return getSpreadType(left, t, symbol, objectFlags, readonly); })
: errorType;
}
if (right.flags & (528 /* BooleanLike */ | 296 /* NumberLike */ | 2112 /* BigIntLike */ | 402653316 /* StringLike */ | 1056 /* EnumLike */ | 67108864 /* NonPrimitive */ | 4194304 /* Index */)) {
return left;
}
if (isGenericObjectType(left) || isGenericObjectType(right)) {
if (isEmptyObjectType(left)) {
return right;
}
// When the left type is an intersection, we may need to merge the last constituent of the
// intersection with the right type. For example when the left type is 'T & { a: string }'
// and the right type is '{ b: string }' we produce 'T & { a: string, b: string }'.
if (left.flags & 2097152 /* Intersection */) {
var types = left.types;
var lastLeft = types[types.length - 1];
if (isNonGenericObjectType(lastLeft) && isNonGenericObjectType(right)) {
return getIntersectionType(ts.concatenate(types.slice(0, types.length - 1), [getSpreadType(lastLeft, right, symbol, objectFlags, readonly)]));
}
}
return getIntersectionType([left, right]);
}
var members = ts.createSymbolTable();
var skippedPrivateMembers = new ts.Set();
var indexInfos = left === emptyObjectType ? getIndexInfosOfType(right) : getUnionIndexInfos([left, right]);
for (var _i = 0, _a = getPropertiesOfType(right); _i < _a.length; _i++) {
var rightProp = _a[_i];
if (ts.getDeclarationModifierFlagsFromSymbol(rightProp) & (8 /* Private */ | 16 /* Protected */)) {
skippedPrivateMembers.add(rightProp.escapedName);
}
else if (isSpreadableProperty(rightProp)) {
members.set(rightProp.escapedName, getSpreadSymbol(rightProp, readonly));
}
}
for (var _b = 0, _c = getPropertiesOfType(left); _b < _c.length; _b++) {
var leftProp = _c[_b];
if (skippedPrivateMembers.has(leftProp.escapedName) || !isSpreadableProperty(leftProp)) {
continue;
}
if (members.has(leftProp.escapedName)) {
var rightProp = members.get(leftProp.escapedName);
var rightType = getTypeOfSymbol(rightProp);
if (rightProp.flags & 16777216 /* Optional */) {
var declarations = ts.concatenate(leftProp.declarations, rightProp.declarations);
var flags = 4 /* Property */ | (leftProp.flags & 16777216 /* Optional */);
var result = createSymbol(flags, leftProp.escapedName);
result.type = getUnionType([getTypeOfSymbol(leftProp), removeMissingOrUndefinedType(rightType)]);
result.leftSpread = leftProp;
result.rightSpread = rightProp;
result.declarations = declarations;
result.nameType = getSymbolLinks(leftProp).nameType;
members.set(leftProp.escapedName, result);
}
}
else {
members.set(leftProp.escapedName, getSpreadSymbol(leftProp, readonly));
}
}
var spread = createAnonymousType(symbol, members, ts.emptyArray, ts.emptyArray, ts.sameMap(indexInfos, function (info) { return getIndexInfoWithReadonly(info, readonly); }));
spread.objectFlags |= 128 /* ObjectLiteral */ | 262144 /* ContainsObjectOrArrayLiteral */ | 4194304 /* ContainsSpread */ | objectFlags;
return spread;
}
/** We approximate own properties as non-methods plus methods that are inside the object literal */
function isSpreadableProperty(prop) {
var _a;
return !ts.some(prop.declarations, ts.isPrivateIdentifierClassElementDeclaration) &&
(!(prop.flags & (8192 /* Method */ | 32768 /* GetAccessor */ | 65536 /* SetAccessor */)) ||
!((_a = prop.declarations) === null || _a === void 0 ? void 0 : _a.some(function (decl) { return ts.isClassLike(decl.parent); })));
}
function getSpreadSymbol(prop, readonly) {
var isSetonlyAccessor = prop.flags & 65536 /* SetAccessor */ && !(prop.flags & 32768 /* GetAccessor */);
if (!isSetonlyAccessor && readonly === isReadonlySymbol(prop)) {
return prop;
}
var flags = 4 /* Property */ | (prop.flags & 16777216 /* Optional */);
var result = createSymbol(flags, prop.escapedName, getIsLateCheckFlag(prop) | (readonly ? 8 /* Readonly */ : 0));
result.type = isSetonlyAccessor ? undefinedType : getTypeOfSymbol(prop);
result.declarations = prop.declarations;
result.nameType = getSymbolLinks(prop).nameType;
result.syntheticOrigin = prop;
return result;
}
function getIndexInfoWithReadonly(info, readonly) {
return info.isReadonly !== readonly ? createIndexInfo(info.keyType, info.type, readonly, info.declaration) : info;
}
function createLiteralType(flags, value, symbol, regularType) {
var type = createType(flags);
type.symbol = symbol;
type.value = value;
type.regularType = regularType || type;
return type;
}
function getFreshTypeOfLiteralType(type) {
if (type.flags & 2944 /* Literal */) {
if (!type.freshType) {
var freshType = createLiteralType(type.flags, type.value, type.symbol, type);
freshType.freshType = freshType;
type.freshType = freshType;
}
return type.freshType;
}
return type;
}
function getRegularTypeOfLiteralType(type) {
return type.flags & 2944 /* Literal */ ? type.regularType :
type.flags & 1048576 /* Union */ ? (type.regularType || (type.regularType = mapType(type, getRegularTypeOfLiteralType))) :
type;
}
function isFreshLiteralType(type) {
return !!(type.flags & 2944 /* Literal */) && type.freshType === type;
}
function getStringLiteralType(value) {
var type;
return stringLiteralTypes.get(value) ||
(stringLiteralTypes.set(value, type = createLiteralType(128 /* StringLiteral */, value)), type);
}
function getNumberLiteralType(value) {
var type;
return numberLiteralTypes.get(value) ||
(numberLiteralTypes.set(value, type = createLiteralType(256 /* NumberLiteral */, value)), type);
}
function getBigIntLiteralType(value) {
var type;
var key = ts.pseudoBigIntToString(value);
return bigIntLiteralTypes.get(key) ||
(bigIntLiteralTypes.set(key, type = createLiteralType(2048 /* BigIntLiteral */, value)), type);
}
function getEnumLiteralType(value, enumId, symbol) {
var type;
var qualifier = typeof value === "string" ? "@" : "#";
var key = enumId + qualifier + value;
var flags = 1024 /* EnumLiteral */ | (typeof value === "string" ? 128 /* StringLiteral */ : 256 /* NumberLiteral */);
return enumLiteralTypes.get(key) ||
(enumLiteralTypes.set(key, type = createLiteralType(flags, value, symbol)), type);
}
function getTypeFromLiteralTypeNode(node) {
if (node.literal.kind === 104 /* NullKeyword */) {
return nullType;
}
var links = getNodeLinks(node);
if (!links.resolvedType) {
links.resolvedType = getRegularTypeOfLiteralType(checkExpression(node.literal));
}
return links.resolvedType;
}
function createUniqueESSymbolType(symbol) {
var type = createType(8192 /* UniqueESSymbol */);
type.symbol = symbol;
type.escapedName = "__@" + type.symbol.escapedName + "@" + getSymbolId(type.symbol);
return type;
}
function getESSymbolLikeTypeForNode(node) {
if (ts.isValidESSymbolDeclaration(node)) {
var symbol = getSymbolOfNode(node);
var links = getSymbolLinks(symbol);
return links.uniqueESSymbolType || (links.uniqueESSymbolType = createUniqueESSymbolType(symbol));
}
return esSymbolType;
}
function getThisType(node) {
var container = ts.getThisContainer(node, /*includeArrowFunctions*/ false);
var parent = container && container.parent;
if (parent && (ts.isClassLike(parent) || parent.kind === 256 /* InterfaceDeclaration */)) {
if (!ts.isStatic(container) &&
(!ts.isConstructorDeclaration(container) || ts.isNodeDescendantOf(node, container.body))) {
return getDeclaredTypeOfClassOrInterface(getSymbolOfNode(parent)).thisType;
}
}
// inside x.prototype = { ... }
if (parent && ts.isObjectLiteralExpression(parent) && ts.isBinaryExpression(parent.parent) && ts.getAssignmentDeclarationKind(parent.parent) === 6 /* Prototype */) {
return getDeclaredTypeOfClassOrInterface(getSymbolOfNode(parent.parent.left).parent).thisType;
}
// /** @return {this} */
// x.prototype.m = function() { ... }
var host = node.flags & 4194304 /* JSDoc */ ? ts.getHostSignatureFromJSDoc(node) : undefined;
if (host && ts.isFunctionExpression(host) && ts.isBinaryExpression(host.parent) && ts.getAssignmentDeclarationKind(host.parent) === 3 /* PrototypeProperty */) {
return getDeclaredTypeOfClassOrInterface(getSymbolOfNode(host.parent.left).parent).thisType;
}
// inside constructor function C() { ... }
if (isJSConstructor(container) && ts.isNodeDescendantOf(node, container.body)) {
return getDeclaredTypeOfClassOrInterface(getSymbolOfNode(container)).thisType;
}
error(node, ts.Diagnostics.A_this_type_is_available_only_in_a_non_static_member_of_a_class_or_interface);
return errorType;
}
function getTypeFromThisTypeNode(node) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
links.resolvedType = getThisType(node);
}
return links.resolvedType;
}
function getTypeFromRestTypeNode(node) {
return getTypeFromTypeNode(getArrayElementTypeNode(node.type) || node.type);
}
function getArrayElementTypeNode(node) {
switch (node.kind) {
case 189 /* ParenthesizedType */:
return getArrayElementTypeNode(node.type);
case 182 /* TupleType */:
if (node.elements.length === 1) {
node = node.elements[0];
if (node.kind === 184 /* RestType */ || node.kind === 195 /* NamedTupleMember */ && node.dotDotDotToken) {
return getArrayElementTypeNode(node.type);
}
}
break;
case 181 /* ArrayType */:
return node.elementType;
}
return undefined;
}
function getTypeFromNamedTupleTypeNode(node) {
var links = getNodeLinks(node);
return links.resolvedType || (links.resolvedType =
node.dotDotDotToken ? getTypeFromRestTypeNode(node) :
addOptionality(getTypeFromTypeNode(node.type), /*isProperty*/ true, !!node.questionToken));
}
function getTypeFromTypeNode(node) {
return getConditionalFlowTypeOfType(getTypeFromTypeNodeWorker(node), node);
}
function getTypeFromTypeNodeWorker(node) {
switch (node.kind) {
case 129 /* AnyKeyword */:
case 307 /* JSDocAllType */:
case 308 /* JSDocUnknownType */:
return anyType;
case 153 /* UnknownKeyword */:
return unknownType;
case 148 /* StringKeyword */:
return stringType;
case 145 /* NumberKeyword */:
return numberType;
case 156 /* BigIntKeyword */:
return bigintType;
case 132 /* BooleanKeyword */:
return booleanType;
case 149 /* SymbolKeyword */:
return esSymbolType;
case 114 /* VoidKeyword */:
return voidType;
case 151 /* UndefinedKeyword */:
return undefinedType;
case 104 /* NullKeyword */:
// TODO(rbuckton): `NullKeyword` is no longer a `TypeNode`, but we defensively allow it here because of incorrect casts in the Language Service.
return nullType;
case 142 /* NeverKeyword */:
return neverType;
case 146 /* ObjectKeyword */:
return node.flags & 131072 /* JavaScriptFile */ && !noImplicitAny ? anyType : nonPrimitiveType;
case 137 /* IntrinsicKeyword */:
return intrinsicMarkerType;
case 190 /* ThisType */:
case 108 /* ThisKeyword */:
// TODO(rbuckton): `ThisKeyword` is no longer a `TypeNode`, but we defensively allow it here because of incorrect casts in the Language Service and because of `isPartOfTypeNode`.
return getTypeFromThisTypeNode(node);
case 194 /* LiteralType */:
return getTypeFromLiteralTypeNode(node);
case 176 /* TypeReference */:
return getTypeFromTypeReference(node);
case 175 /* TypePredicate */:
return node.assertsModifier ? voidType : booleanType;
case 226 /* ExpressionWithTypeArguments */:
return getTypeFromTypeReference(node);
case 179 /* TypeQuery */:
return getTypeFromTypeQueryNode(node);
case 181 /* ArrayType */:
case 182 /* TupleType */:
return getTypeFromArrayOrTupleTypeNode(node);
case 183 /* OptionalType */:
return getTypeFromOptionalTypeNode(node);
case 185 /* UnionType */:
return getTypeFromUnionTypeNode(node);
case 186 /* IntersectionType */:
return getTypeFromIntersectionTypeNode(node);
case 309 /* JSDocNullableType */:
return getTypeFromJSDocNullableTypeNode(node);
case 311 /* JSDocOptionalType */:
return addOptionality(getTypeFromTypeNode(node.type));
case 195 /* NamedTupleMember */:
return getTypeFromNamedTupleTypeNode(node);
case 189 /* ParenthesizedType */:
case 310 /* JSDocNonNullableType */:
case 304 /* JSDocTypeExpression */:
return getTypeFromTypeNode(node.type);
case 184 /* RestType */:
return getTypeFromRestTypeNode(node);
case 313 /* JSDocVariadicType */:
return getTypeFromJSDocVariadicType(node);
case 177 /* FunctionType */:
case 178 /* ConstructorType */:
case 180 /* TypeLiteral */:
case 317 /* JSDocTypeLiteral */:
case 312 /* JSDocFunctionType */:
case 318 /* JSDocSignature */:
return getTypeFromTypeLiteralOrFunctionOrConstructorTypeNode(node);
case 191 /* TypeOperator */:
return getTypeFromTypeOperatorNode(node);
case 192 /* IndexedAccessType */:
return getTypeFromIndexedAccessTypeNode(node);
case 193 /* MappedType */:
return getTypeFromMappedTypeNode(node);
case 187 /* ConditionalType */:
return getTypeFromConditionalTypeNode(node);
case 188 /* InferType */:
return getTypeFromInferTypeNode(node);
case 196 /* TemplateLiteralType */:
return getTypeFromTemplateTypeNode(node);
case 198 /* ImportType */:
return getTypeFromImportTypeNode(node);
// This function assumes that an identifier, qualified name, or property access expression is a type expression
// Callers should first ensure this by calling `isPartOfTypeNode`
// TODO(rbuckton): These aren't valid TypeNodes, but we treat them as such because of `isPartOfTypeNode`, which returns `true` for things that aren't `TypeNode`s.
case 79 /* Identifier */:
case 159 /* QualifiedName */:
case 204 /* PropertyAccessExpression */:
var symbol = getSymbolAtLocation(node);
return symbol ? getDeclaredTypeOfSymbol(symbol) : errorType;
default:
return errorType;
}
}
function instantiateList(items, mapper, instantiator) {
if (items && items.length) {
for (var i = 0; i < items.length; i++) {
var item = items[i];
var mapped = instantiator(item, mapper);
if (item !== mapped) {
var result = i === 0 ? [] : items.slice(0, i);
result.push(mapped);
for (i++; i < items.length; i++) {
result.push(instantiator(items[i], mapper));
}
return result;
}
}
}
return items;
}
function instantiateTypes(types, mapper) {
return instantiateList(types, mapper, instantiateType);
}
function instantiateSignatures(signatures, mapper) {
return instantiateList(signatures, mapper, instantiateSignature);
}
function instantiateIndexInfos(indexInfos, mapper) {
return instantiateList(indexInfos, mapper, instantiateIndexInfo);
}
function createTypeMapper(sources, targets) {
return sources.length === 1 ? makeUnaryTypeMapper(sources[0], targets ? targets[0] : anyType) : makeArrayTypeMapper(sources, targets);
}
function getMappedType(type, mapper) {
switch (mapper.kind) {
case 0 /* Simple */:
return type === mapper.source ? mapper.target : type;
case 1 /* Array */:
var sources = mapper.sources;
var targets = mapper.targets;
for (var i = 0; i < sources.length; i++) {
if (type === sources[i]) {
return targets ? targets[i] : anyType;
}
}
return type;
case 2 /* Function */:
return mapper.func(type);
case 3 /* Composite */:
case 4 /* Merged */:
var t1 = getMappedType(type, mapper.mapper1);
return t1 !== type && mapper.kind === 3 /* Composite */ ? instantiateType(t1, mapper.mapper2) : getMappedType(t1, mapper.mapper2);
}
}
function makeUnaryTypeMapper(source, target) {
return { kind: 0 /* Simple */, source: source, target: target };
}
function makeArrayTypeMapper(sources, targets) {
return { kind: 1 /* Array */, sources: sources, targets: targets };
}
function makeFunctionTypeMapper(func) {
return { kind: 2 /* Function */, func: func };
}
function makeCompositeTypeMapper(kind, mapper1, mapper2) {
return { kind: kind, mapper1: mapper1, mapper2: mapper2 };
}
function createTypeEraser(sources) {
return createTypeMapper(sources, /*targets*/ undefined);
}
/**
* Maps forward-references to later types parameters to the empty object type.
* This is used during inference when instantiating type parameter defaults.
*/
function createBackreferenceMapper(context, index) {
return makeFunctionTypeMapper(function (t) { return ts.findIndex(context.inferences, function (info) { return info.typeParameter === t; }) >= index ? unknownType : t; });
}
function combineTypeMappers(mapper1, mapper2) {
return mapper1 ? makeCompositeTypeMapper(3 /* Composite */, mapper1, mapper2) : mapper2;
}
function mergeTypeMappers(mapper1, mapper2) {
return mapper1 ? makeCompositeTypeMapper(4 /* Merged */, mapper1, mapper2) : mapper2;
}
function prependTypeMapping(source, target, mapper) {
return !mapper ? makeUnaryTypeMapper(source, target) : makeCompositeTypeMapper(4 /* Merged */, makeUnaryTypeMapper(source, target), mapper);
}
function appendTypeMapping(mapper, source, target) {
return !mapper ? makeUnaryTypeMapper(source, target) : makeCompositeTypeMapper(4 /* Merged */, mapper, makeUnaryTypeMapper(source, target));
}
function getRestrictiveTypeParameter(tp) {
return tp.constraint === unknownType ? tp : tp.restrictiveInstantiation || (tp.restrictiveInstantiation = createTypeParameter(tp.symbol),
tp.restrictiveInstantiation.constraint = unknownType,
tp.restrictiveInstantiation);
}
function cloneTypeParameter(typeParameter) {
var result = createTypeParameter(typeParameter.symbol);
result.target = typeParameter;
return result;
}
function instantiateTypePredicate(predicate, mapper) {
return createTypePredicate(predicate.kind, predicate.parameterName, predicate.parameterIndex, instantiateType(predicate.type, mapper));
}
function instantiateSignature(signature, mapper, eraseTypeParameters) {
var freshTypeParameters;
if (signature.typeParameters && !eraseTypeParameters) {
// First create a fresh set of type parameters, then include a mapping from the old to the
// new type parameters in the mapper function. Finally store this mapper in the new type
// parameters such that we can use it when instantiating constraints.
freshTypeParameters = ts.map(signature.typeParameters, cloneTypeParameter);
mapper = combineTypeMappers(createTypeMapper(signature.typeParameters, freshTypeParameters), mapper);
for (var _i = 0, freshTypeParameters_1 = freshTypeParameters; _i < freshTypeParameters_1.length; _i++) {
var tp = freshTypeParameters_1[_i];
tp.mapper = mapper;
}
}
// Don't compute resolvedReturnType and resolvedTypePredicate now,
// because using `mapper` now could trigger inferences to become fixed. (See `createInferenceContext`.)
// See GH#17600.
var result = createSignature(signature.declaration, freshTypeParameters, signature.thisParameter && instantiateSymbol(signature.thisParameter, mapper), instantiateList(signature.parameters, mapper, instantiateSymbol),
/*resolvedReturnType*/ undefined,
/*resolvedTypePredicate*/ undefined, signature.minArgumentCount, signature.flags & 39 /* PropagatingFlags */);
result.target = signature;
result.mapper = mapper;
return result;
}
function instantiateSymbol(symbol, mapper) {
var links = getSymbolLinks(symbol);
if (links.type && !couldContainTypeVariables(links.type)) {
// If the type of the symbol is already resolved, and if that type could not possibly
// be affected by instantiation, simply return the symbol itself.
return symbol;
}
if (ts.getCheckFlags(symbol) & 1 /* Instantiated */) {
// If symbol being instantiated is itself a instantiation, fetch the original target and combine the
// type mappers. This ensures that original type identities are properly preserved and that aliases
// always reference a non-aliases.
symbol = links.target;
mapper = combineTypeMappers(links.mapper, mapper);
}
// Keep the flags from the symbol we're instantiating. Mark that is instantiated, and
// also transient so that we can just store data on it directly.
var result = createSymbol(symbol.flags, symbol.escapedName, 1 /* Instantiated */ | ts.getCheckFlags(symbol) & (8 /* Readonly */ | 4096 /* Late */ | 16384 /* OptionalParameter */ | 32768 /* RestParameter */));
result.declarations = symbol.declarations;
result.parent = symbol.parent;
result.target = symbol;
result.mapper = mapper;
if (symbol.valueDeclaration) {
result.valueDeclaration = symbol.valueDeclaration;
}
if (links.nameType) {
result.nameType = links.nameType;
}
return result;
}
function getObjectTypeInstantiation(type, mapper, aliasSymbol, aliasTypeArguments) {
var declaration = type.objectFlags & 4 /* Reference */ ? type.node : type.symbol.declarations[0];
var links = getNodeLinks(declaration);
var target = type.objectFlags & 4 /* Reference */ ? links.resolvedType :
type.objectFlags & 64 /* Instantiated */ ? type.target : type;
var typeParameters = links.outerTypeParameters;
if (!typeParameters) {
// The first time an anonymous type is instantiated we compute and store a list of the type
// parameters that are in scope (and therefore potentially referenced). For type literals that
// aren't the right hand side of a generic type alias declaration we optimize by reducing the
// set of type parameters to those that are possibly referenced in the literal.
var outerTypeParameters = getOuterTypeParameters(declaration, /*includeThisTypes*/ true);
if (isJSConstructor(declaration)) {
var templateTagParameters = getTypeParametersFromDeclaration(declaration);
outerTypeParameters = ts.addRange(outerTypeParameters, templateTagParameters);
}
typeParameters = outerTypeParameters || ts.emptyArray;
var allDeclarations_1 = type.objectFlags & 4 /* Reference */ ? [declaration] : type.symbol.declarations;
typeParameters = (target.objectFlags & 4 /* Reference */ || target.symbol.flags & 8192 /* Method */ || target.symbol.flags & 2048 /* TypeLiteral */) && !target.aliasTypeArguments ?
ts.filter(typeParameters, function (tp) { return ts.some(allDeclarations_1, function (d) { return isTypeParameterPossiblyReferenced(tp, d); }); }) :
typeParameters;
links.outerTypeParameters = typeParameters;
}
if (typeParameters.length) {
// We are instantiating an anonymous type that has one or more type parameters in scope. Apply the
// mapper to the type parameters to produce the effective list of type arguments, and compute the
// instantiation cache key from the type IDs of the type arguments.
var combinedMapper_1 = combineTypeMappers(type.mapper, mapper);
var typeArguments = ts.map(typeParameters, function (t) { return getMappedType(t, combinedMapper_1); });
var newAliasSymbol = aliasSymbol || type.aliasSymbol;
var newAliasTypeArguments = aliasSymbol ? aliasTypeArguments : instantiateTypes(type.aliasTypeArguments, mapper);
var id = getTypeListId(typeArguments) + getAliasId(newAliasSymbol, newAliasTypeArguments);
if (!target.instantiations) {
target.instantiations = new ts.Map();
target.instantiations.set(getTypeListId(typeParameters) + getAliasId(target.aliasSymbol, target.aliasTypeArguments), target);
}
var result = target.instantiations.get(id);
if (!result) {
var newMapper = createTypeMapper(typeParameters, typeArguments);
result = target.objectFlags & 4 /* Reference */ ? createDeferredTypeReference(type.target, type.node, newMapper, newAliasSymbol, newAliasTypeArguments) :
target.objectFlags & 32 /* Mapped */ ? instantiateMappedType(target, newMapper, newAliasSymbol, newAliasTypeArguments) :
instantiateAnonymousType(target, newMapper, newAliasSymbol, newAliasTypeArguments);
target.instantiations.set(id, result);
}
return result;
}
return type;
}
function maybeTypeParameterReference(node) {
return !(node.parent.kind === 176 /* TypeReference */ && node.parent.typeArguments && node === node.parent.typeName ||
node.parent.kind === 198 /* ImportType */ && node.parent.typeArguments && node === node.parent.qualifier);
}
function isTypeParameterPossiblyReferenced(tp, node) {
// If the type parameter doesn't have exactly one declaration, if there are invening statement blocks
// between the node and the type parameter declaration, if the node contains actual references to the
// type parameter, or if the node contains type queries, we consider the type parameter possibly referenced.
if (tp.symbol && tp.symbol.declarations && tp.symbol.declarations.length === 1) {
var container = tp.symbol.declarations[0].parent;
for (var n = node; n !== container; n = n.parent) {
if (!n || n.kind === 233 /* Block */ || n.kind === 187 /* ConditionalType */ && ts.forEachChild(n.extendsType, containsReference)) {
return true;
}
}
return containsReference(node);
}
return true;
function containsReference(node) {
switch (node.kind) {
case 190 /* ThisType */:
return !!tp.isThisType;
case 79 /* Identifier */:
return !tp.isThisType && ts.isPartOfTypeNode(node) && maybeTypeParameterReference(node) &&
getTypeFromTypeNodeWorker(node) === tp; // use worker because we're looking for === equality
case 179 /* TypeQuery */:
return true;
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
return !node.type && !!node.body ||
ts.some(node.typeParameters, containsReference) ||
ts.some(node.parameters, containsReference) ||
!!node.type && containsReference(node.type);
}
return !!ts.forEachChild(node, containsReference);
}
}
function getHomomorphicTypeVariable(type) {
var constraintType = getConstraintTypeFromMappedType(type);
if (constraintType.flags & 4194304 /* Index */) {
var typeVariable = getActualTypeVariable(constraintType.type);
if (typeVariable.flags & 262144 /* TypeParameter */) {
return typeVariable;
}
}
return undefined;
}
function instantiateMappedType(type, mapper, aliasSymbol, aliasTypeArguments) {
// For a homomorphic mapped type { [P in keyof T]: X }, where T is some type variable, the mapping
// operation depends on T as follows:
// * If T is a primitive type no mapping is performed and the result is simply T.
// * If T is a union type we distribute the mapped type over the union.
// * If T is an array we map to an array where the element type has been transformed.
// * If T is a tuple we map to a tuple where the element types have been transformed.
// * Otherwise we map to an object type where the type of each property has been transformed.
// For example, when T is instantiated to a union type A | B, we produce { [P in keyof A]: X } |
// { [P in keyof B]: X }, and when when T is instantiated to a union type A | undefined, we produce
// { [P in keyof A]: X } | undefined.
var typeVariable = getHomomorphicTypeVariable(type);
if (typeVariable) {
var mappedTypeVariable = instantiateType(typeVariable, mapper);
if (typeVariable !== mappedTypeVariable) {
return mapTypeWithAlias(getReducedType(mappedTypeVariable), function (t) {
if (t.flags & (3 /* AnyOrUnknown */ | 58982400 /* InstantiableNonPrimitive */ | 524288 /* Object */ | 2097152 /* Intersection */) && t !== wildcardType && t !== errorType) {
if (!type.declaration.nameType) {
if (isArrayType(t)) {
return instantiateMappedArrayType(t, type, prependTypeMapping(typeVariable, t, mapper));
}
if (isGenericTupleType(t)) {
return instantiateMappedGenericTupleType(t, type, typeVariable, mapper);
}
if (isTupleType(t)) {
return instantiateMappedTupleType(t, type, prependTypeMapping(typeVariable, t, mapper));
}
}
return instantiateAnonymousType(type, prependTypeMapping(typeVariable, t, mapper));
}
return t;
}, aliasSymbol, aliasTypeArguments);
}
}
// If the constraint type of the instantiation is the wildcard type, return the wildcard type.
return instantiateType(getConstraintTypeFromMappedType(type), mapper) === wildcardType ? wildcardType : instantiateAnonymousType(type, mapper, aliasSymbol, aliasTypeArguments);
}
function getModifiedReadonlyState(state, modifiers) {
return modifiers & 1 /* IncludeReadonly */ ? true : modifiers & 2 /* ExcludeReadonly */ ? false : state;
}
function instantiateMappedGenericTupleType(tupleType, mappedType, typeVariable, mapper) {
// When a tuple type is generic (i.e. when it contains variadic elements), we want to eagerly map the
// non-generic elements and defer mapping the generic elements. In order to facilitate this, we transform
// M<[A, B?, ...T, ...C[]] into [...M<[A]>, ...M<[B?]>, ...M<T>, ...M<C[]>] and then rely on tuple type
// normalization to resolve the non-generic parts of the resulting tuple.
var elementFlags = tupleType.target.elementFlags;
var elementTypes = ts.map(getTypeArguments(tupleType), function (t, i) {
var singleton = elementFlags[i] & 8 /* Variadic */ ? t :
elementFlags[i] & 4 /* Rest */ ? createArrayType(t) :
createTupleType([t], [elementFlags[i]]);
// The singleton is never a generic tuple type, so it is safe to recurse here.
return instantiateMappedType(mappedType, prependTypeMapping(typeVariable, singleton, mapper));
});
var newReadonly = getModifiedReadonlyState(tupleType.target.readonly, getMappedTypeModifiers(mappedType));
return createTupleType(elementTypes, ts.map(elementTypes, function (_) { return 8 /* Variadic */; }), newReadonly);
}
function instantiateMappedArrayType(arrayType, mappedType, mapper) {
var elementType = instantiateMappedTypeTemplate(mappedType, numberType, /*isOptional*/ true, mapper);
return elementType === errorType ? errorType :
createArrayType(elementType, getModifiedReadonlyState(isReadonlyArrayType(arrayType), getMappedTypeModifiers(mappedType)));
}
function instantiateMappedTupleType(tupleType, mappedType, mapper) {
var elementFlags = tupleType.target.elementFlags;
var elementTypes = ts.map(getTypeArguments(tupleType), function (_, i) {
return instantiateMappedTypeTemplate(mappedType, getStringLiteralType("" + i), !!(elementFlags[i] & 2 /* Optional */), mapper);
});
var modifiers = getMappedTypeModifiers(mappedType);
var newTupleModifiers = modifiers & 4 /* IncludeOptional */ ? ts.map(elementFlags, function (f) { return f & 1 /* Required */ ? 2 /* Optional */ : f; }) :
modifiers & 8 /* ExcludeOptional */ ? ts.map(elementFlags, function (f) { return f & 2 /* Optional */ ? 1 /* Required */ : f; }) :
elementFlags;
var newReadonly = getModifiedReadonlyState(tupleType.target.readonly, modifiers);
return ts.contains(elementTypes, errorType) ? errorType :
createTupleType(elementTypes, newTupleModifiers, newReadonly, tupleType.target.labeledElementDeclarations);
}
function instantiateMappedTypeTemplate(type, key, isOptional, mapper) {
var templateMapper = appendTypeMapping(mapper, getTypeParameterFromMappedType(type), key);
var propType = instantiateType(getTemplateTypeFromMappedType(type.target || type), templateMapper);
var modifiers = getMappedTypeModifiers(type);
return strictNullChecks && modifiers & 4 /* IncludeOptional */ && !maybeTypeOfKind(propType, 32768 /* Undefined */ | 16384 /* Void */) ? getOptionalType(propType, /*isProperty*/ true) :
strictNullChecks && modifiers & 8 /* ExcludeOptional */ && isOptional ? getTypeWithFacts(propType, 524288 /* NEUndefined */) :
propType;
}
function instantiateAnonymousType(type, mapper, aliasSymbol, aliasTypeArguments) {
var result = createObjectType(type.objectFlags | 64 /* Instantiated */, type.symbol);
if (type.objectFlags & 32 /* Mapped */) {
result.declaration = type.declaration;
// C.f. instantiateSignature
var origTypeParameter = getTypeParameterFromMappedType(type);
var freshTypeParameter = cloneTypeParameter(origTypeParameter);
result.typeParameter = freshTypeParameter;
mapper = combineTypeMappers(makeUnaryTypeMapper(origTypeParameter, freshTypeParameter), mapper);
freshTypeParameter.mapper = mapper;
}
result.target = type;
result.mapper = mapper;
result.aliasSymbol = aliasSymbol || type.aliasSymbol;
result.aliasTypeArguments = aliasSymbol ? aliasTypeArguments : instantiateTypes(type.aliasTypeArguments, mapper);
return result;
}
function getConditionalTypeInstantiation(type, mapper, aliasSymbol, aliasTypeArguments) {
var root = type.root;
if (root.outerTypeParameters) {
// We are instantiating a conditional type that has one or more type parameters in scope. Apply the
// mapper to the type parameters to produce the effective list of type arguments, and compute the
// instantiation cache key from the type IDs of the type arguments.
var typeArguments = ts.map(root.outerTypeParameters, function (t) { return getMappedType(t, mapper); });
var id = getTypeListId(typeArguments) + getAliasId(aliasSymbol, aliasTypeArguments);
var result = root.instantiations.get(id);
if (!result) {
var newMapper = createTypeMapper(root.outerTypeParameters, typeArguments);
result = instantiateConditionalType(root, newMapper, aliasSymbol, aliasTypeArguments);
root.instantiations.set(id, result);
}
return result;
}
return type;
}
function instantiateConditionalType(root, mapper, aliasSymbol, aliasTypeArguments) {
// Check if we have a conditional type where the check type is a naked type parameter. If so,
// the conditional type is distributive over union types and when T is instantiated to a union
// type A | B, we produce (A extends U ? X : Y) | (B extends U ? X : Y).
if (root.isDistributive) {
var checkType_1 = root.checkType;
var instantiatedType = getMappedType(checkType_1, mapper);
if (checkType_1 !== instantiatedType && instantiatedType.flags & (1048576 /* Union */ | 131072 /* Never */)) {
return mapTypeWithAlias(instantiatedType, function (t) { return getConditionalType(root, prependTypeMapping(checkType_1, t, mapper)); }, aliasSymbol, aliasTypeArguments);
}
}
return getConditionalType(root, mapper, aliasSymbol, aliasTypeArguments);
}
function instantiateType(type, mapper) {
return type && mapper ? instantiateTypeWithAlias(type, mapper, /*aliasSymbol*/ undefined, /*aliasTypeArguments*/ undefined) : type;
}
function instantiateTypeWithAlias(type, mapper, aliasSymbol, aliasTypeArguments) {
if (!couldContainTypeVariables(type)) {
return type;
}
if (instantiationDepth === 50 || instantiationCount >= 5000000) {
// We have reached 50 recursive type instantiations and there is a very high likelyhood we're dealing
// with a combination of infinite generic types that perpetually generate new type identities. We stop
// the recursion here by yielding the error type.
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.instant("checkTypes" /* CheckTypes */, "instantiateType_DepthLimit", { typeId: type.id, instantiationDepth: instantiationDepth, instantiationCount: instantiationCount });
error(currentNode, ts.Diagnostics.Type_instantiation_is_excessively_deep_and_possibly_infinite);
return errorType;
}
totalInstantiationCount++;
instantiationCount++;
instantiationDepth++;
var result = instantiateTypeWorker(type, mapper, aliasSymbol, aliasTypeArguments);
instantiationDepth--;
return result;
}
function instantiateTypeWorker(type, mapper, aliasSymbol, aliasTypeArguments) {
var flags = type.flags;
if (flags & 262144 /* TypeParameter */) {
return getMappedType(type, mapper);
}
if (flags & 524288 /* Object */) {
var objectFlags = type.objectFlags;
if (objectFlags & (4 /* Reference */ | 16 /* Anonymous */ | 32 /* Mapped */)) {
if (objectFlags & 4 /* Reference */ && !type.node) {
var resolvedTypeArguments = type.resolvedTypeArguments;
var newTypeArguments = instantiateTypes(resolvedTypeArguments, mapper);
return newTypeArguments !== resolvedTypeArguments ? createNormalizedTypeReference(type.target, newTypeArguments) : type;
}
if (objectFlags & 1024 /* ReverseMapped */) {
return instantiateReverseMappedType(type, mapper);
}
return getObjectTypeInstantiation(type, mapper, aliasSymbol, aliasTypeArguments);
}
return type;
}
if (flags & 3145728 /* UnionOrIntersection */) {
var origin = type.flags & 1048576 /* Union */ ? type.origin : undefined;
var types = origin && origin.flags & 3145728 /* UnionOrIntersection */ ? origin.types : type.types;
var newTypes = instantiateTypes(types, mapper);
if (newTypes === types && aliasSymbol === type.aliasSymbol) {
return type;
}
var newAliasSymbol = aliasSymbol || type.aliasSymbol;
var newAliasTypeArguments = aliasSymbol ? aliasTypeArguments : instantiateTypes(type.aliasTypeArguments, mapper);
return flags & 2097152 /* Intersection */ || origin && origin.flags & 2097152 /* Intersection */ ?
getIntersectionType(newTypes, newAliasSymbol, newAliasTypeArguments) :
getUnionType(newTypes, 1 /* Literal */, newAliasSymbol, newAliasTypeArguments);
}
if (flags & 4194304 /* Index */) {
return getIndexType(instantiateType(type.type, mapper));
}
if (flags & 134217728 /* TemplateLiteral */) {
return getTemplateLiteralType(type.texts, instantiateTypes(type.types, mapper));
}
if (flags & 268435456 /* StringMapping */) {
return getStringMappingType(type.symbol, instantiateType(type.type, mapper));
}
if (flags & 8388608 /* IndexedAccess */) {
var newAliasSymbol = aliasSymbol || type.aliasSymbol;
var newAliasTypeArguments = aliasSymbol ? aliasTypeArguments : instantiateTypes(type.aliasTypeArguments, mapper);
return getIndexedAccessType(instantiateType(type.objectType, mapper), instantiateType(type.indexType, mapper), type.accessFlags, /*accessNode*/ undefined, newAliasSymbol, newAliasTypeArguments);
}
if (flags & 16777216 /* Conditional */) {
return getConditionalTypeInstantiation(type, combineTypeMappers(type.mapper, mapper), aliasSymbol, aliasTypeArguments);
}
if (flags & 33554432 /* Substitution */) {
var maybeVariable = instantiateType(type.baseType, mapper);
if (maybeVariable.flags & 8650752 /* TypeVariable */) {
return getSubstitutionType(maybeVariable, instantiateType(type.substitute, mapper));
}
else {
var sub = instantiateType(type.substitute, mapper);
if (sub.flags & 3 /* AnyOrUnknown */ || isTypeAssignableTo(getRestrictiveInstantiation(maybeVariable), getRestrictiveInstantiation(sub))) {
return maybeVariable;
}
return sub;
}
}
return type;
}
function instantiateReverseMappedType(type, mapper) {
var innerMappedType = instantiateType(type.mappedType, mapper);
if (!(ts.getObjectFlags(innerMappedType) & 32 /* Mapped */)) {
return type;
}
var innerIndexType = instantiateType(type.constraintType, mapper);
if (!(innerIndexType.flags & 4194304 /* Index */)) {
return type;
}
var instantiated = inferTypeForHomomorphicMappedType(instantiateType(type.source, mapper), innerMappedType, innerIndexType);
if (instantiated) {
return instantiated;
}
return type; // Nested invocation of `inferTypeForHomomorphicMappedType` or the `source` instantiated into something unmappable
}
function getPermissiveInstantiation(type) {
return type.flags & (131068 /* Primitive */ | 3 /* AnyOrUnknown */ | 131072 /* Never */) ? type :
type.permissiveInstantiation || (type.permissiveInstantiation = instantiateType(type, permissiveMapper));
}
function getRestrictiveInstantiation(type) {
if (type.flags & (131068 /* Primitive */ | 3 /* AnyOrUnknown */ | 131072 /* Never */)) {
return type;
}
if (type.restrictiveInstantiation) {
return type.restrictiveInstantiation;
}
type.restrictiveInstantiation = instantiateType(type, restrictiveMapper);
// We set the following so we don't attempt to set the restrictive instance of a restrictive instance
// which is redundant - we'll produce new type identities, but all type params have already been mapped.
// This also gives us a way to detect restrictive instances upon comparisons and _disable_ the "distributeive constraint"
// assignability check for them, which is distinctly unsafe, as once you have a restrctive instance, all the type parameters
// are constrained to `unknown` and produce tons of false positives/negatives!
type.restrictiveInstantiation.restrictiveInstantiation = type.restrictiveInstantiation;
return type.restrictiveInstantiation;
}
function instantiateIndexInfo(info, mapper) {
return createIndexInfo(info.keyType, instantiateType(info.type, mapper), info.isReadonly, info.declaration);
}
// Returns true if the given expression contains (at any level of nesting) a function or arrow expression
// that is subject to contextual typing.
function isContextSensitive(node) {
ts.Debug.assert(node.kind !== 167 /* MethodDeclaration */ || ts.isObjectLiteralMethod(node));
switch (node.kind) {
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
case 167 /* MethodDeclaration */:
case 254 /* FunctionDeclaration */: // Function declarations can have context when annotated with a jsdoc @type
return isContextSensitiveFunctionLikeDeclaration(node);
case 203 /* ObjectLiteralExpression */:
return ts.some(node.properties, isContextSensitive);
case 202 /* ArrayLiteralExpression */:
return ts.some(node.elements, isContextSensitive);
case 220 /* ConditionalExpression */:
return isContextSensitive(node.whenTrue) ||
isContextSensitive(node.whenFalse);
case 219 /* BinaryExpression */:
return (node.operatorToken.kind === 56 /* BarBarToken */ || node.operatorToken.kind === 60 /* QuestionQuestionToken */) &&
(isContextSensitive(node.left) || isContextSensitive(node.right));
case 291 /* PropertyAssignment */:
return isContextSensitive(node.initializer);
case 210 /* ParenthesizedExpression */:
return isContextSensitive(node.expression);
case 284 /* JsxAttributes */:
return ts.some(node.properties, isContextSensitive) || ts.isJsxOpeningElement(node.parent) && ts.some(node.parent.parent.children, isContextSensitive);
case 283 /* JsxAttribute */: {
// If there is no initializer, JSX attribute has a boolean value of true which is not context sensitive.
var initializer = node.initializer;
return !!initializer && isContextSensitive(initializer);
}
case 286 /* JsxExpression */: {
// It is possible to that node.expression is undefined (e.g <div x={} />)
var expression = node.expression;
return !!expression && isContextSensitive(expression);
}
}
return false;
}
function isContextSensitiveFunctionLikeDeclaration(node) {
return (!ts.isFunctionDeclaration(node) || ts.isInJSFile(node) && !!getTypeForDeclarationFromJSDocComment(node)) &&
(ts.hasContextSensitiveParameters(node) || hasContextSensitiveReturnExpression(node));
}
function hasContextSensitiveReturnExpression(node) {
// TODO(anhans): A block should be context-sensitive if it has a context-sensitive return value.
return !node.typeParameters && !ts.getEffectiveReturnTypeNode(node) && !!node.body && node.body.kind !== 233 /* Block */ && isContextSensitive(node.body);
}
function isContextSensitiveFunctionOrObjectLiteralMethod(func) {
return (ts.isInJSFile(func) && ts.isFunctionDeclaration(func) || isFunctionExpressionOrArrowFunction(func) || ts.isObjectLiteralMethod(func)) &&
isContextSensitiveFunctionLikeDeclaration(func);
}
function getTypeWithoutSignatures(type) {
if (type.flags & 524288 /* Object */) {
var resolved = resolveStructuredTypeMembers(type);
if (resolved.constructSignatures.length || resolved.callSignatures.length) {
var result = createObjectType(16 /* Anonymous */, type.symbol);
result.members = resolved.members;
result.properties = resolved.properties;
result.callSignatures = ts.emptyArray;
result.constructSignatures = ts.emptyArray;
result.indexInfos = ts.emptyArray;
return result;
}
}
else if (type.flags & 2097152 /* Intersection */) {
return getIntersectionType(ts.map(type.types, getTypeWithoutSignatures));
}
return type;
}
// TYPE CHECKING
function isTypeIdenticalTo(source, target) {
return isTypeRelatedTo(source, target, identityRelation);
}
function compareTypesIdentical(source, target) {
return isTypeRelatedTo(source, target, identityRelation) ? -1 /* True */ : 0 /* False */;
}
function compareTypesAssignable(source, target) {
return isTypeRelatedTo(source, target, assignableRelation) ? -1 /* True */ : 0 /* False */;
}
function compareTypesSubtypeOf(source, target) {
return isTypeRelatedTo(source, target, subtypeRelation) ? -1 /* True */ : 0 /* False */;
}
function isTypeSubtypeOf(source, target) {
return isTypeRelatedTo(source, target, subtypeRelation);
}
function isTypeAssignableTo(source, target) {
return isTypeRelatedTo(source, target, assignableRelation);
}
// An object type S is considered to be derived from an object type T if
// S is a union type and every constituent of S is derived from T,
// T is a union type and S is derived from at least one constituent of T, or
// S is a type variable with a base constraint that is derived from T,
// T is one of the global types Object and Function and S is a subtype of T, or
// T occurs directly or indirectly in an 'extends' clause of S.
// Note that this check ignores type parameters and only considers the
// inheritance hierarchy.
function isTypeDerivedFrom(source, target) {
return source.flags & 1048576 /* Union */ ? ts.every(source.types, function (t) { return isTypeDerivedFrom(t, target); }) :
target.flags & 1048576 /* Union */ ? ts.some(target.types, function (t) { return isTypeDerivedFrom(source, t); }) :
source.flags & 58982400 /* InstantiableNonPrimitive */ ? isTypeDerivedFrom(getBaseConstraintOfType(source) || unknownType, target) :
target === globalObjectType ? !!(source.flags & (524288 /* Object */ | 67108864 /* NonPrimitive */)) :
target === globalFunctionType ? !!(source.flags & 524288 /* Object */) && isFunctionObjectType(source) :
hasBaseType(source, getTargetType(target)) || (isArrayType(target) && !isReadonlyArrayType(target) && isTypeDerivedFrom(source, globalReadonlyArrayType));
}
/**
* This is *not* a bi-directional relationship.
* If one needs to check both directions for comparability, use a second call to this function or 'checkTypeComparableTo'.
*
* A type S is comparable to a type T if some (but not necessarily all) of the possible values of S are also possible values of T.
* It is used to check following cases:
* - the types of the left and right sides of equality/inequality operators (`===`, `!==`, `==`, `!=`).
* - the types of `case` clause expressions and their respective `switch` expressions.
* - the type of an expression in a type assertion with the type being asserted.
*/
function isTypeComparableTo(source, target) {
return isTypeRelatedTo(source, target, comparableRelation);
}
function areTypesComparable(type1, type2) {
return isTypeComparableTo(type1, type2) || isTypeComparableTo(type2, type1);
}
function checkTypeAssignableTo(source, target, errorNode, headMessage, containingMessageChain, errorOutputObject) {
return checkTypeRelatedTo(source, target, assignableRelation, errorNode, headMessage, containingMessageChain, errorOutputObject);
}
/**
* Like `checkTypeAssignableTo`, but if it would issue an error, instead performs structural comparisons of the types using the given expression node to
* attempt to issue more specific errors on, for example, specific object literal properties or tuple members.
*/
function checkTypeAssignableToAndOptionallyElaborate(source, target, errorNode, expr, headMessage, containingMessageChain) {
return checkTypeRelatedToAndOptionallyElaborate(source, target, assignableRelation, errorNode, expr, headMessage, containingMessageChain, /*errorOutputContainer*/ undefined);
}
function checkTypeRelatedToAndOptionallyElaborate(source, target, relation, errorNode, expr, headMessage, containingMessageChain, errorOutputContainer) {
if (isTypeRelatedTo(source, target, relation))
return true;
if (!errorNode || !elaborateError(expr, source, target, relation, headMessage, containingMessageChain, errorOutputContainer)) {
return checkTypeRelatedTo(source, target, relation, errorNode, headMessage, containingMessageChain, errorOutputContainer);
}
return false;
}
function isOrHasGenericConditional(type) {
return !!(type.flags & 16777216 /* Conditional */ || (type.flags & 2097152 /* Intersection */ && ts.some(type.types, isOrHasGenericConditional)));
}
function elaborateError(node, source, target, relation, headMessage, containingMessageChain, errorOutputContainer) {
if (!node || isOrHasGenericConditional(target))
return false;
if (!checkTypeRelatedTo(source, target, relation, /*errorNode*/ undefined)
&& elaborateDidYouMeanToCallOrConstruct(node, source, target, relation, headMessage, containingMessageChain, errorOutputContainer)) {
return true;
}
switch (node.kind) {
case 286 /* JsxExpression */:
case 210 /* ParenthesizedExpression */:
return elaborateError(node.expression, source, target, relation, headMessage, containingMessageChain, errorOutputContainer);
case 219 /* BinaryExpression */:
switch (node.operatorToken.kind) {
case 63 /* EqualsToken */:
case 27 /* CommaToken */:
return elaborateError(node.right, source, target, relation, headMessage, containingMessageChain, errorOutputContainer);
}
break;
case 203 /* ObjectLiteralExpression */:
return elaborateObjectLiteral(node, source, target, relation, containingMessageChain, errorOutputContainer);
case 202 /* ArrayLiteralExpression */:
return elaborateArrayLiteral(node, source, target, relation, containingMessageChain, errorOutputContainer);
case 284 /* JsxAttributes */:
return elaborateJsxComponents(node, source, target, relation, containingMessageChain, errorOutputContainer);
case 212 /* ArrowFunction */:
return elaborateArrowFunction(node, source, target, relation, containingMessageChain, errorOutputContainer);
}
return false;
}
function elaborateDidYouMeanToCallOrConstruct(node, source, target, relation, headMessage, containingMessageChain, errorOutputContainer) {
var callSignatures = getSignaturesOfType(source, 0 /* Call */);
var constructSignatures = getSignaturesOfType(source, 1 /* Construct */);
for (var _i = 0, _a = [constructSignatures, callSignatures]; _i < _a.length; _i++) {
var signatures = _a[_i];
if (ts.some(signatures, function (s) {
var returnType = getReturnTypeOfSignature(s);
return !(returnType.flags & (1 /* Any */ | 131072 /* Never */)) && checkTypeRelatedTo(returnType, target, relation, /*errorNode*/ undefined);
})) {
var resultObj = errorOutputContainer || {};
checkTypeAssignableTo(source, target, node, headMessage, containingMessageChain, resultObj);
var diagnostic = resultObj.errors[resultObj.errors.length - 1];
ts.addRelatedInfo(diagnostic, ts.createDiagnosticForNode(node, signatures === constructSignatures ? ts.Diagnostics.Did_you_mean_to_use_new_with_this_expression : ts.Diagnostics.Did_you_mean_to_call_this_expression));
return true;
}
}
return false;
}
function elaborateArrowFunction(node, source, target, relation, containingMessageChain, errorOutputContainer) {
// Don't elaborate blocks
if (ts.isBlock(node.body)) {
return false;
}
// Or functions with annotated parameter types
if (ts.some(node.parameters, ts.hasType)) {
return false;
}
var sourceSig = getSingleCallSignature(source);
if (!sourceSig) {
return false;
}
var targetSignatures = getSignaturesOfType(target, 0 /* Call */);
if (!ts.length(targetSignatures)) {
return false;
}
var returnExpression = node.body;
var sourceReturn = getReturnTypeOfSignature(sourceSig);
var targetReturn = getUnionType(ts.map(targetSignatures, getReturnTypeOfSignature));
if (!checkTypeRelatedTo(sourceReturn, targetReturn, relation, /*errorNode*/ undefined)) {
var elaborated = returnExpression && elaborateError(returnExpression, sourceReturn, targetReturn, relation, /*headMessage*/ undefined, containingMessageChain, errorOutputContainer);
if (elaborated) {
return elaborated;
}
var resultObj = errorOutputContainer || {};
checkTypeRelatedTo(sourceReturn, targetReturn, relation, returnExpression, /*message*/ undefined, containingMessageChain, resultObj);
if (resultObj.errors) {
if (target.symbol && ts.length(target.symbol.declarations)) {
ts.addRelatedInfo(resultObj.errors[resultObj.errors.length - 1], ts.createDiagnosticForNode(target.symbol.declarations[0], ts.Diagnostics.The_expected_type_comes_from_the_return_type_of_this_signature));
}
if ((ts.getFunctionFlags(node) & 2 /* Async */) === 0
// exclude cases where source itself is promisy - this way we don't make a suggestion when relating
// an IPromise and a Promise that are slightly different
&& !getTypeOfPropertyOfType(sourceReturn, "then")
&& checkTypeRelatedTo(createPromiseType(sourceReturn), targetReturn, relation, /*errorNode*/ undefined)) {
ts.addRelatedInfo(resultObj.errors[resultObj.errors.length - 1], ts.createDiagnosticForNode(node, ts.Diagnostics.Did_you_mean_to_mark_this_function_as_async));
}
return true;
}
}
return false;
}
function getBestMatchIndexedAccessTypeOrUndefined(source, target, nameType) {
var idx = getIndexedAccessTypeOrUndefined(target, nameType);
if (idx) {
return idx;
}
if (target.flags & 1048576 /* Union */) {
var best = getBestMatchingType(source, target);
if (best) {
return getIndexedAccessTypeOrUndefined(best, nameType);
}
}
}
function checkExpressionForMutableLocationWithContextualType(next, sourcePropType) {
next.contextualType = sourcePropType;
try {
return checkExpressionForMutableLocation(next, 1 /* Contextual */, sourcePropType);
}
finally {
next.contextualType = undefined;
}
}
/**
* For every element returned from the iterator, checks that element to issue an error on a property of that element's type
* If that element would issue an error, we first attempt to dive into that element's inner expression and issue a more specific error by recuring into `elaborateError`
* Otherwise, we issue an error on _every_ element which fail the assignability check
*/
function elaborateElementwise(iterator, source, target, relation, containingMessageChain, errorOutputContainer) {
// Assignability failure - check each prop individually, and if that fails, fall back on the bad error span
var reportedError = false;
for (var status = iterator.next(); !status.done; status = iterator.next()) {
var _a = status.value, prop = _a.errorNode, next = _a.innerExpression, nameType = _a.nameType, errorMessage = _a.errorMessage;
var targetPropType = getBestMatchIndexedAccessTypeOrUndefined(source, target, nameType);
if (!targetPropType || targetPropType.flags & 8388608 /* IndexedAccess */)
continue; // Don't elaborate on indexes on generic variables
var sourcePropType = getIndexedAccessTypeOrUndefined(source, nameType);
if (!sourcePropType)
continue;
var propName = getPropertyNameFromIndex(nameType, /*accessNode*/ undefined);
var targetIsOptional = !!(propName && (getPropertyOfType(target, propName) || unknownSymbol).flags & 16777216 /* Optional */);
var sourceIsOptional = !!(propName && (getPropertyOfType(source, propName) || unknownSymbol).flags & 16777216 /* Optional */);
targetPropType = removeMissingType(targetPropType, targetIsOptional);
sourcePropType = removeMissingType(sourcePropType, targetIsOptional && sourceIsOptional);
if (!checkTypeRelatedTo(sourcePropType, targetPropType, relation, /*errorNode*/ undefined)) {
var elaborated = next && elaborateError(next, sourcePropType, targetPropType, relation, /*headMessage*/ undefined, containingMessageChain, errorOutputContainer);
if (elaborated) {
reportedError = true;
}
else {
// Issue error on the prop itself, since the prop couldn't elaborate the error
var resultObj = errorOutputContainer || {};
// Use the expression type, if available
var specificSource = next ? checkExpressionForMutableLocationWithContextualType(next, sourcePropType) : sourcePropType;
var result = checkTypeRelatedTo(specificSource, targetPropType, relation, prop, errorMessage, containingMessageChain, resultObj);
if (result && specificSource !== sourcePropType) {
// If for whatever reason the expression type doesn't yield an error, make sure we still issue an error on the sourcePropType
checkTypeRelatedTo(sourcePropType, targetPropType, relation, prop, errorMessage, containingMessageChain, resultObj);
}
if (resultObj.errors) {
var reportedDiag = resultObj.errors[resultObj.errors.length - 1];
var propertyName = isTypeUsableAsPropertyName(nameType) ? getPropertyNameFromType(nameType) : undefined;
var targetProp = propertyName !== undefined ? getPropertyOfType(target, propertyName) : undefined;
var issuedElaboration = false;
if (!targetProp) {
var indexInfo = getApplicableIndexInfo(target, nameType);
if (indexInfo && indexInfo.declaration && !ts.getSourceFileOfNode(indexInfo.declaration).hasNoDefaultLib) {
issuedElaboration = true;
ts.addRelatedInfo(reportedDiag, ts.createDiagnosticForNode(indexInfo.declaration, ts.Diagnostics.The_expected_type_comes_from_this_index_signature));
}
}
if (!issuedElaboration && (targetProp && ts.length(targetProp.declarations) || target.symbol && ts.length(target.symbol.declarations))) {
var targetNode = targetProp && ts.length(targetProp.declarations) ? targetProp.declarations[0] : target.symbol.declarations[0];
if (!ts.getSourceFileOfNode(targetNode).hasNoDefaultLib) {
ts.addRelatedInfo(reportedDiag, ts.createDiagnosticForNode(targetNode, ts.Diagnostics.The_expected_type_comes_from_property_0_which_is_declared_here_on_type_1, propertyName && !(nameType.flags & 8192 /* UniqueESSymbol */) ? ts.unescapeLeadingUnderscores(propertyName) : typeToString(nameType), typeToString(target)));
}
}
}
reportedError = true;
}
}
}
return reportedError;
}
function generateJsxAttributes(node) {
var _i, _a, prop;
return __generator(this, function (_b) {
switch (_b.label) {
case 0:
if (!ts.length(node.properties))
return [2 /*return*/];
_i = 0, _a = node.properties;
_b.label = 1;
case 1:
if (!(_i < _a.length)) return [3 /*break*/, 4];
prop = _a[_i];
if (ts.isJsxSpreadAttribute(prop) || isHyphenatedJsxName(ts.idText(prop.name)))
return [3 /*break*/, 3];
return [4 /*yield*/, { errorNode: prop.name, innerExpression: prop.initializer, nameType: getStringLiteralType(ts.idText(prop.name)) }];
case 2:
_b.sent();
_b.label = 3;
case 3:
_i++;
return [3 /*break*/, 1];
case 4: return [2 /*return*/];
}
});
}
function generateJsxChildren(node, getInvalidTextDiagnostic) {
var memberOffset, i, child, nameType, elem;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
if (!ts.length(node.children))
return [2 /*return*/];
memberOffset = 0;
i = 0;
_a.label = 1;
case 1:
if (!(i < node.children.length)) return [3 /*break*/, 5];
child = node.children[i];
nameType = getNumberLiteralType(i - memberOffset);
elem = getElaborationElementForJsxChild(child, nameType, getInvalidTextDiagnostic);
if (!elem) return [3 /*break*/, 3];
return [4 /*yield*/, elem];
case 2:
_a.sent();
return [3 /*break*/, 4];
case 3:
memberOffset++;
_a.label = 4;
case 4:
i++;
return [3 /*break*/, 1];
case 5: return [2 /*return*/];
}
});
}
function getElaborationElementForJsxChild(child, nameType, getInvalidTextDiagnostic) {
switch (child.kind) {
case 286 /* JsxExpression */:
// child is of the type of the expression
return { errorNode: child, innerExpression: child.expression, nameType: nameType };
case 11 /* JsxText */:
if (child.containsOnlyTriviaWhiteSpaces) {
break; // Whitespace only jsx text isn't real jsx text
}
// child is a string
return { errorNode: child, innerExpression: undefined, nameType: nameType, errorMessage: getInvalidTextDiagnostic() };
case 276 /* JsxElement */:
case 277 /* JsxSelfClosingElement */:
case 280 /* JsxFragment */:
// child is of type JSX.Element
return { errorNode: child, innerExpression: child, nameType: nameType };
default:
return ts.Debug.assertNever(child, "Found invalid jsx child");
}
}
function elaborateJsxComponents(node, source, target, relation, containingMessageChain, errorOutputContainer) {
var result = elaborateElementwise(generateJsxAttributes(node), source, target, relation, containingMessageChain, errorOutputContainer);
var invalidTextDiagnostic;
if (ts.isJsxOpeningElement(node.parent) && ts.isJsxElement(node.parent.parent)) {
var containingElement = node.parent.parent;
var childPropName = getJsxElementChildrenPropertyName(getJsxNamespaceAt(node));
var childrenPropName = childPropName === undefined ? "children" : ts.unescapeLeadingUnderscores(childPropName);
var childrenNameType = getStringLiteralType(childrenPropName);
var childrenTargetType = getIndexedAccessType(target, childrenNameType);
var validChildren = ts.getSemanticJsxChildren(containingElement.children);
if (!ts.length(validChildren)) {
return result;
}
var moreThanOneRealChildren = ts.length(validChildren) > 1;
var arrayLikeTargetParts = filterType(childrenTargetType, isArrayOrTupleLikeType);
var nonArrayLikeTargetParts = filterType(childrenTargetType, function (t) { return !isArrayOrTupleLikeType(t); });
if (moreThanOneRealChildren) {
if (arrayLikeTargetParts !== neverType) {
var realSource = createTupleType(checkJsxChildren(containingElement, 0 /* Normal */));
var children = generateJsxChildren(containingElement, getInvalidTextualChildDiagnostic);
result = elaborateElementwise(children, realSource, arrayLikeTargetParts, relation, containingMessageChain, errorOutputContainer) || result;
}
else if (!isTypeRelatedTo(getIndexedAccessType(source, childrenNameType), childrenTargetType, relation)) {
// arity mismatch
result = true;
var diag = error(containingElement.openingElement.tagName, ts.Diagnostics.This_JSX_tag_s_0_prop_expects_a_single_child_of_type_1_but_multiple_children_were_provided, childrenPropName, typeToString(childrenTargetType));
if (errorOutputContainer && errorOutputContainer.skipLogging) {
(errorOutputContainer.errors || (errorOutputContainer.errors = [])).push(diag);
}
}
}
else {
if (nonArrayLikeTargetParts !== neverType) {
var child = validChildren[0];
var elem_1 = getElaborationElementForJsxChild(child, childrenNameType, getInvalidTextualChildDiagnostic);
if (elem_1) {
result = elaborateElementwise((function () { return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, elem_1];
case 1:
_a.sent();
return [2 /*return*/];
}
}); })(), source, target, relation, containingMessageChain, errorOutputContainer) || result;
}
}
else if (!isTypeRelatedTo(getIndexedAccessType(source, childrenNameType), childrenTargetType, relation)) {
// arity mismatch
result = true;
var diag = error(containingElement.openingElement.tagName, ts.Diagnostics.This_JSX_tag_s_0_prop_expects_type_1_which_requires_multiple_children_but_only_a_single_child_was_provided, childrenPropName, typeToString(childrenTargetType));
if (errorOutputContainer && errorOutputContainer.skipLogging) {
(errorOutputContainer.errors || (errorOutputContainer.errors = [])).push(diag);
}
}
}
}
return result;
function getInvalidTextualChildDiagnostic() {
if (!invalidTextDiagnostic) {
var tagNameText = ts.getTextOfNode(node.parent.tagName);
var childPropName = getJsxElementChildrenPropertyName(getJsxNamespaceAt(node));
var childrenPropName = childPropName === undefined ? "children" : ts.unescapeLeadingUnderscores(childPropName);
var childrenTargetType = getIndexedAccessType(target, getStringLiteralType(childrenPropName));
var diagnostic = ts.Diagnostics._0_components_don_t_accept_text_as_child_elements_Text_in_JSX_has_the_type_string_but_the_expected_type_of_1_is_2;
invalidTextDiagnostic = __assign(__assign({}, diagnostic), { key: "!!ALREADY FORMATTED!!", message: ts.formatMessage(/*_dummy*/ undefined, diagnostic, tagNameText, childrenPropName, typeToString(childrenTargetType)) });
}
return invalidTextDiagnostic;
}
}
function generateLimitedTupleElements(node, target) {
var len, i, elem, nameType;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
len = ts.length(node.elements);
if (!len)
return [2 /*return*/];
i = 0;
_a.label = 1;
case 1:
if (!(i < len)) return [3 /*break*/, 4];
// Skip elements which do not exist in the target - a length error on the tuple overall is likely better than an error on a mismatched index signature
if (isTupleLikeType(target) && !getPropertyOfType(target, ("" + i)))
return [3 /*break*/, 3];
elem = node.elements[i];
if (ts.isOmittedExpression(elem))
return [3 /*break*/, 3];
nameType = getNumberLiteralType(i);
return [4 /*yield*/, { errorNode: elem, innerExpression: elem, nameType: nameType }];
case 2:
_a.sent();
_a.label = 3;
case 3:
i++;
return [3 /*break*/, 1];
case 4: return [2 /*return*/];
}
});
}
function elaborateArrayLiteral(node, source, target, relation, containingMessageChain, errorOutputContainer) {
if (target.flags & 131068 /* Primitive */)
return false;
if (isTupleLikeType(source)) {
return elaborateElementwise(generateLimitedTupleElements(node, target), source, target, relation, containingMessageChain, errorOutputContainer);
}
// recreate a tuple from the elements, if possible
// Since we're re-doing the expression type, we need to reapply the contextual type
var oldContext = node.contextualType;
node.contextualType = target;
try {
var tupleizedType = checkArrayLiteral(node, 1 /* Contextual */, /*forceTuple*/ true);
node.contextualType = oldContext;
if (isTupleLikeType(tupleizedType)) {
return elaborateElementwise(generateLimitedTupleElements(node, target), tupleizedType, target, relation, containingMessageChain, errorOutputContainer);
}
return false;
}
finally {
node.contextualType = oldContext;
}
}
function generateObjectLiteralElements(node) {
var _i, _a, prop, type, _b;
return __generator(this, function (_c) {
switch (_c.label) {
case 0:
if (!ts.length(node.properties))
return [2 /*return*/];
_i = 0, _a = node.properties;
_c.label = 1;
case 1:
if (!(_i < _a.length)) return [3 /*break*/, 8];
prop = _a[_i];
if (ts.isSpreadAssignment(prop))
return [3 /*break*/, 7];
type = getLiteralTypeFromProperty(getSymbolOfNode(prop), 8576 /* StringOrNumberLiteralOrUnique */);
if (!type || (type.flags & 131072 /* Never */)) {
return [3 /*break*/, 7];
}
_b = prop.kind;
switch (_b) {
case 171 /* SetAccessor */: return [3 /*break*/, 2];
case 170 /* GetAccessor */: return [3 /*break*/, 2];
case 167 /* MethodDeclaration */: return [3 /*break*/, 2];
case 292 /* ShorthandPropertyAssignment */: return [3 /*break*/, 2];
case 291 /* PropertyAssignment */: return [3 /*break*/, 4];
}
return [3 /*break*/, 6];
case 2: return [4 /*yield*/, { errorNode: prop.name, innerExpression: undefined, nameType: type }];
case 3:
_c.sent();
return [3 /*break*/, 7];
case 4: return [4 /*yield*/, { errorNode: prop.name, innerExpression: prop.initializer, nameType: type, errorMessage: ts.isComputedNonLiteralName(prop.name) ? ts.Diagnostics.Type_of_computed_property_s_value_is_0_which_is_not_assignable_to_type_1 : undefined }];
case 5:
_c.sent();
return [3 /*break*/, 7];
case 6:
ts.Debug.assertNever(prop);
_c.label = 7;
case 7:
_i++;
return [3 /*break*/, 1];
case 8: return [2 /*return*/];
}
});
}
function elaborateObjectLiteral(node, source, target, relation, containingMessageChain, errorOutputContainer) {
if (target.flags & 131068 /* Primitive */)
return false;
return elaborateElementwise(generateObjectLiteralElements(node), source, target, relation, containingMessageChain, errorOutputContainer);
}
/**
* This is *not* a bi-directional relationship.
* If one needs to check both directions for comparability, use a second call to this function or 'isTypeComparableTo'.
*/
function checkTypeComparableTo(source, target, errorNode, headMessage, containingMessageChain) {
return checkTypeRelatedTo(source, target, comparableRelation, errorNode, headMessage, containingMessageChain);
}
function isSignatureAssignableTo(source, target, ignoreReturnTypes) {
return compareSignaturesRelated(source, target, ignoreReturnTypes ? 4 /* IgnoreReturnTypes */ : 0, /*reportErrors*/ false,
/*errorReporter*/ undefined, /*errorReporter*/ undefined, compareTypesAssignable, /*reportUnreliableMarkers*/ undefined) !== 0 /* False */;
}
/**
* Returns true if `s` is `(...args: any[]) => any` or `(this: any, ...args: any[]) => any`
*/
function isAnySignature(s) {
return !s.typeParameters && (!s.thisParameter || isTypeAny(getTypeOfParameter(s.thisParameter))) && s.parameters.length === 1 &&
signatureHasRestParameter(s) && (getTypeOfParameter(s.parameters[0]) === anyArrayType || isTypeAny(getTypeOfParameter(s.parameters[0]))) &&
isTypeAny(getReturnTypeOfSignature(s));
}
/**
* See signatureRelatedTo, compareSignaturesIdentical
*/
function compareSignaturesRelated(source, target, checkMode, reportErrors, errorReporter, incompatibleErrorReporter, compareTypes, reportUnreliableMarkers) {
// TODO (drosen): De-duplicate code between related functions.
if (source === target) {
return -1 /* True */;
}
if (isAnySignature(target)) {
return -1 /* True */;
}
var targetCount = getParameterCount(target);
var sourceHasMoreParameters = !hasEffectiveRestParameter(target) &&
(checkMode & 8 /* StrictArity */ ? hasEffectiveRestParameter(source) || getParameterCount(source) > targetCount : getMinArgumentCount(source) > targetCount);
if (sourceHasMoreParameters) {
return 0 /* False */;
}
if (source.typeParameters && source.typeParameters !== target.typeParameters) {
target = getCanonicalSignature(target);
source = instantiateSignatureInContextOf(source, target, /*inferenceContext*/ undefined, compareTypes);
}
var sourceCount = getParameterCount(source);
var sourceRestType = getNonArrayRestType(source);
var targetRestType = getNonArrayRestType(target);
if (sourceRestType || targetRestType) {
void instantiateType(sourceRestType || targetRestType, reportUnreliableMarkers);
}
if (sourceRestType && targetRestType && sourceCount !== targetCount) {
// We're not able to relate misaligned complex rest parameters
return 0 /* False */;
}
var kind = target.declaration ? target.declaration.kind : 0 /* Unknown */;
var strictVariance = !(checkMode & 3 /* Callback */) && strictFunctionTypes && kind !== 167 /* MethodDeclaration */ &&
kind !== 166 /* MethodSignature */ && kind !== 169 /* Constructor */;
var result = -1 /* True */;
var sourceThisType = getThisTypeOfSignature(source);
if (sourceThisType && sourceThisType !== voidType) {
var targetThisType = getThisTypeOfSignature(target);
if (targetThisType) {
// void sources are assignable to anything.
var related = !strictVariance && compareTypes(sourceThisType, targetThisType, /*reportErrors*/ false)
|| compareTypes(targetThisType, sourceThisType, reportErrors);
if (!related) {
if (reportErrors) {
errorReporter(ts.Diagnostics.The_this_types_of_each_signature_are_incompatible);
}
return 0 /* False */;
}
result &= related;
}
}
var paramCount = sourceRestType || targetRestType ? Math.min(sourceCount, targetCount) : Math.max(sourceCount, targetCount);
var restIndex = sourceRestType || targetRestType ? paramCount - 1 : -1;
for (var i = 0; i < paramCount; i++) {
var sourceType = i === restIndex ? getRestTypeAtPosition(source, i) : tryGetTypeAtPosition(source, i);
var targetType = i === restIndex ? getRestTypeAtPosition(target, i) : tryGetTypeAtPosition(target, i);
if (sourceType && targetType) {
// In order to ensure that any generic type Foo<T> is at least co-variant with respect to T no matter
// how Foo uses T, we need to relate parameters bi-variantly (given that parameters are input positions,
// they naturally relate only contra-variantly). However, if the source and target parameters both have
// function types with a single call signature, we know we are relating two callback parameters. In
// that case it is sufficient to only relate the parameters of the signatures co-variantly because,
// similar to return values, callback parameters are output positions. This means that a Promise<T>,
// where T is used only in callback parameter positions, will be co-variant (as opposed to bi-variant)
// with respect to T.
var sourceSig = checkMode & 3 /* Callback */ ? undefined : getSingleCallSignature(getNonNullableType(sourceType));
var targetSig = checkMode & 3 /* Callback */ ? undefined : getSingleCallSignature(getNonNullableType(targetType));
var callbacks = sourceSig && targetSig && !getTypePredicateOfSignature(sourceSig) && !getTypePredicateOfSignature(targetSig) &&
(getFalsyFlags(sourceType) & 98304 /* Nullable */) === (getFalsyFlags(targetType) & 98304 /* Nullable */);
var related = callbacks ?
compareSignaturesRelated(targetSig, sourceSig, (checkMode & 8 /* StrictArity */) | (strictVariance ? 2 /* StrictCallback */ : 1 /* BivariantCallback */), reportErrors, errorReporter, incompatibleErrorReporter, compareTypes, reportUnreliableMarkers) :
!(checkMode & 3 /* Callback */) && !strictVariance && compareTypes(sourceType, targetType, /*reportErrors*/ false) || compareTypes(targetType, sourceType, reportErrors);
// With strict arity, (x: number | undefined) => void is a subtype of (x?: number | undefined) => void
if (related && checkMode & 8 /* StrictArity */ && i >= getMinArgumentCount(source) && i < getMinArgumentCount(target) && compareTypes(sourceType, targetType, /*reportErrors*/ false)) {
related = 0 /* False */;
}
if (!related) {
if (reportErrors) {
errorReporter(ts.Diagnostics.Types_of_parameters_0_and_1_are_incompatible, ts.unescapeLeadingUnderscores(getParameterNameAtPosition(source, i)), ts.unescapeLeadingUnderscores(getParameterNameAtPosition(target, i)));
}
return 0 /* False */;
}
result &= related;
}
}
if (!(checkMode & 4 /* IgnoreReturnTypes */)) {
// If a signature resolution is already in-flight, skip issuing a circularity error
// here and just use the `any` type directly
var targetReturnType = isResolvingReturnTypeOfSignature(target) ? anyType
: target.declaration && isJSConstructor(target.declaration) ? getDeclaredTypeOfClassOrInterface(getMergedSymbol(target.declaration.symbol))
: getReturnTypeOfSignature(target);
if (targetReturnType === voidType) {
return result;
}
var sourceReturnType = isResolvingReturnTypeOfSignature(source) ? anyType
: source.declaration && isJSConstructor(source.declaration) ? getDeclaredTypeOfClassOrInterface(getMergedSymbol(source.declaration.symbol))
: getReturnTypeOfSignature(source);
// The following block preserves behavior forbidding boolean returning functions from being assignable to type guard returning functions
var targetTypePredicate = getTypePredicateOfSignature(target);
if (targetTypePredicate) {
var sourceTypePredicate = getTypePredicateOfSignature(source);
if (sourceTypePredicate) {
result &= compareTypePredicateRelatedTo(sourceTypePredicate, targetTypePredicate, reportErrors, errorReporter, compareTypes);
}
else if (ts.isIdentifierTypePredicate(targetTypePredicate)) {
if (reportErrors) {
errorReporter(ts.Diagnostics.Signature_0_must_be_a_type_predicate, signatureToString(source));
}
return 0 /* False */;
}
}
else {
// When relating callback signatures, we still need to relate return types bi-variantly as otherwise
// the containing type wouldn't be co-variant. For example, interface Foo<T> { add(cb: () => T): void }
// wouldn't be co-variant for T without this rule.
result &= checkMode & 1 /* BivariantCallback */ && compareTypes(targetReturnType, sourceReturnType, /*reportErrors*/ false) ||
compareTypes(sourceReturnType, targetReturnType, reportErrors);
if (!result && reportErrors && incompatibleErrorReporter) {
incompatibleErrorReporter(sourceReturnType, targetReturnType);
}
}
}
return result;
}
function compareTypePredicateRelatedTo(source, target, reportErrors, errorReporter, compareTypes) {
if (source.kind !== target.kind) {
if (reportErrors) {
errorReporter(ts.Diagnostics.A_this_based_type_guard_is_not_compatible_with_a_parameter_based_type_guard);
errorReporter(ts.Diagnostics.Type_predicate_0_is_not_assignable_to_1, typePredicateToString(source), typePredicateToString(target));
}
return 0 /* False */;
}
if (source.kind === 1 /* Identifier */ || source.kind === 3 /* AssertsIdentifier */) {
if (source.parameterIndex !== target.parameterIndex) {
if (reportErrors) {
errorReporter(ts.Diagnostics.Parameter_0_is_not_in_the_same_position_as_parameter_1, source.parameterName, target.parameterName);
errorReporter(ts.Diagnostics.Type_predicate_0_is_not_assignable_to_1, typePredicateToString(source), typePredicateToString(target));
}
return 0 /* False */;
}
}
var related = source.type === target.type ? -1 /* True */ :
source.type && target.type ? compareTypes(source.type, target.type, reportErrors) :
0 /* False */;
if (related === 0 /* False */ && reportErrors) {
errorReporter(ts.Diagnostics.Type_predicate_0_is_not_assignable_to_1, typePredicateToString(source), typePredicateToString(target));
}
return related;
}
function isImplementationCompatibleWithOverload(implementation, overload) {
var erasedSource = getErasedSignature(implementation);
var erasedTarget = getErasedSignature(overload);
// First see if the return types are compatible in either direction.
var sourceReturnType = getReturnTypeOfSignature(erasedSource);
var targetReturnType = getReturnTypeOfSignature(erasedTarget);
if (targetReturnType === voidType
|| isTypeRelatedTo(targetReturnType, sourceReturnType, assignableRelation)
|| isTypeRelatedTo(sourceReturnType, targetReturnType, assignableRelation)) {
return isSignatureAssignableTo(erasedSource, erasedTarget, /*ignoreReturnTypes*/ true);
}
return false;
}
function isEmptyResolvedType(t) {
return t !== anyFunctionType &&
t.properties.length === 0 &&
t.callSignatures.length === 0 &&
t.constructSignatures.length === 0 &&
t.indexInfos.length === 0;
}
function isEmptyObjectType(type) {
return type.flags & 524288 /* Object */ ? !isGenericMappedType(type) && isEmptyResolvedType(resolveStructuredTypeMembers(type)) :
type.flags & 67108864 /* NonPrimitive */ ? true :
type.flags & 1048576 /* Union */ ? ts.some(type.types, isEmptyObjectType) :
type.flags & 2097152 /* Intersection */ ? ts.every(type.types, isEmptyObjectType) :
false;
}
function isEmptyAnonymousObjectType(type) {
return !!(ts.getObjectFlags(type) & 16 /* Anonymous */ && (type.members && isEmptyResolvedType(type) ||
type.symbol && type.symbol.flags & 2048 /* TypeLiteral */ && getMembersOfSymbol(type.symbol).size === 0));
}
function isStringIndexSignatureOnlyType(type) {
return type.flags & 524288 /* Object */ && !isGenericMappedType(type) && getPropertiesOfType(type).length === 0 && getIndexInfosOfType(type).length === 1 && !!getIndexInfoOfType(type, stringType) ||
type.flags & 3145728 /* UnionOrIntersection */ && ts.every(type.types, isStringIndexSignatureOnlyType) ||
false;
}
function isEnumTypeRelatedTo(sourceSymbol, targetSymbol, errorReporter) {
if (sourceSymbol === targetSymbol) {
return true;
}
var id = getSymbolId(sourceSymbol) + "," + getSymbolId(targetSymbol);
var entry = enumRelation.get(id);
if (entry !== undefined && !(!(entry & 4 /* Reported */) && entry & 2 /* Failed */ && errorReporter)) {
return !!(entry & 1 /* Succeeded */);
}
if (sourceSymbol.escapedName !== targetSymbol.escapedName || !(sourceSymbol.flags & 256 /* RegularEnum */) || !(targetSymbol.flags & 256 /* RegularEnum */)) {
enumRelation.set(id, 2 /* Failed */ | 4 /* Reported */);
return false;
}
var targetEnumType = getTypeOfSymbol(targetSymbol);
for (var _i = 0, _a = getPropertiesOfType(getTypeOfSymbol(sourceSymbol)); _i < _a.length; _i++) {
var property = _a[_i];
if (property.flags & 8 /* EnumMember */) {
var targetProperty = getPropertyOfType(targetEnumType, property.escapedName);
if (!targetProperty || !(targetProperty.flags & 8 /* EnumMember */)) {
if (errorReporter) {
errorReporter(ts.Diagnostics.Property_0_is_missing_in_type_1, ts.symbolName(property), typeToString(getDeclaredTypeOfSymbol(targetSymbol), /*enclosingDeclaration*/ undefined, 64 /* UseFullyQualifiedType */));
enumRelation.set(id, 2 /* Failed */ | 4 /* Reported */);
}
else {
enumRelation.set(id, 2 /* Failed */);
}
return false;
}
}
}
enumRelation.set(id, 1 /* Succeeded */);
return true;
}
function isSimpleTypeRelatedTo(source, target, relation, errorReporter) {
var s = source.flags;
var t = target.flags;
if (t & 3 /* AnyOrUnknown */ || s & 131072 /* Never */ || source === wildcardType)
return true;
if (t & 131072 /* Never */)
return false;
if (s & 402653316 /* StringLike */ && t & 4 /* String */)
return true;
if (s & 128 /* StringLiteral */ && s & 1024 /* EnumLiteral */ &&
t & 128 /* StringLiteral */ && !(t & 1024 /* EnumLiteral */) &&
source.value === target.value)
return true;
if (s & 296 /* NumberLike */ && t & 8 /* Number */)
return true;
if (s & 256 /* NumberLiteral */ && s & 1024 /* EnumLiteral */ &&
t & 256 /* NumberLiteral */ && !(t & 1024 /* EnumLiteral */) &&
source.value === target.value)
return true;
if (s & 2112 /* BigIntLike */ && t & 64 /* BigInt */)
return true;
if (s & 528 /* BooleanLike */ && t & 16 /* Boolean */)
return true;
if (s & 12288 /* ESSymbolLike */ && t & 4096 /* ESSymbol */)
return true;
if (s & 32 /* Enum */ && t & 32 /* Enum */ && isEnumTypeRelatedTo(source.symbol, target.symbol, errorReporter))
return true;
if (s & 1024 /* EnumLiteral */ && t & 1024 /* EnumLiteral */) {
if (s & 1048576 /* Union */ && t & 1048576 /* Union */ && isEnumTypeRelatedTo(source.symbol, target.symbol, errorReporter))
return true;
if (s & 2944 /* Literal */ && t & 2944 /* Literal */ &&
source.value === target.value &&
isEnumTypeRelatedTo(getParentOfSymbol(source.symbol), getParentOfSymbol(target.symbol), errorReporter))
return true;
}
if (s & 32768 /* Undefined */ && (!strictNullChecks || t & (32768 /* Undefined */ | 16384 /* Void */)))
return true;
if (s & 65536 /* Null */ && (!strictNullChecks || t & 65536 /* Null */))
return true;
if (s & 524288 /* Object */ && t & 67108864 /* NonPrimitive */)
return true;
if (relation === assignableRelation || relation === comparableRelation) {
if (s & 1 /* Any */)
return true;
// Type number or any numeric literal type is assignable to any numeric enum type or any
// numeric enum literal type. This rule exists for backwards compatibility reasons because
// bit-flag enum types sometimes look like literal enum types with numeric literal values.
if (s & (8 /* Number */ | 256 /* NumberLiteral */) && !(s & 1024 /* EnumLiteral */) && (t & 32 /* Enum */ || relation === assignableRelation && t & 256 /* NumberLiteral */ && t & 1024 /* EnumLiteral */))
return true;
}
return false;
}
function isTypeRelatedTo(source, target, relation) {
if (isFreshLiteralType(source)) {
source = source.regularType;
}
if (isFreshLiteralType(target)) {
target = target.regularType;
}
if (source === target) {
return true;
}
if (relation !== identityRelation) {
if (relation === comparableRelation && !(target.flags & 131072 /* Never */) && isSimpleTypeRelatedTo(target, source, relation) || isSimpleTypeRelatedTo(source, target, relation)) {
return true;
}
}
else {
if (source.flags !== target.flags)
return false;
if (source.flags & 67358815 /* Singleton */)
return true;
}
if (source.flags & 524288 /* Object */ && target.flags & 524288 /* Object */) {
var related = relation.get(getRelationKey(source, target, 0 /* None */, relation));
if (related !== undefined) {
return !!(related & 1 /* Succeeded */);
}
}
if (source.flags & 469499904 /* StructuredOrInstantiable */ || target.flags & 469499904 /* StructuredOrInstantiable */) {
return checkTypeRelatedTo(source, target, relation, /*errorNode*/ undefined);
}
return false;
}
function isIgnoredJsxProperty(source, sourceProp) {
return ts.getObjectFlags(source) & 2048 /* JsxAttributes */ && isHyphenatedJsxName(sourceProp.escapedName);
}
function getNormalizedType(type, writing) {
while (true) {
var t = isFreshLiteralType(type) ? type.regularType :
ts.getObjectFlags(type) & 4 /* Reference */ && type.node ? createTypeReference(type.target, getTypeArguments(type)) :
type.flags & 3145728 /* UnionOrIntersection */ ? getReducedType(type) :
type.flags & 33554432 /* Substitution */ ? writing ? type.baseType : type.substitute :
type.flags & 25165824 /* Simplifiable */ ? getSimplifiedType(type, writing) :
type;
t = getSingleBaseForNonAugmentingSubtype(t) || t;
if (t === type)
break;
type = t;
}
return type;
}
/**
* Checks if 'source' is related to 'target' (e.g.: is a assignable to).
* @param source The left-hand-side of the relation.
* @param target The right-hand-side of the relation.
* @param relation The relation considered. One of 'identityRelation', 'subtypeRelation', 'assignableRelation', or 'comparableRelation'.
* Used as both to determine which checks are performed and as a cache of previously computed results.
* @param errorNode The suggested node upon which all errors will be reported, if defined. This may or may not be the actual node used.
* @param headMessage If the error chain should be prepended by a head message, then headMessage will be used.
* @param containingMessageChain A chain of errors to prepend any new errors found.
* @param errorOutputContainer Return the diagnostic. Do not log if 'skipLogging' is truthy.
*/
function checkTypeRelatedTo(source, target, relation, errorNode, headMessage, containingMessageChain, errorOutputContainer) {
var errorInfo;
var relatedInfo;
var maybeKeys;
var sourceStack;
var targetStack;
var maybeCount = 0;
var depth = 0;
var expandingFlags = 0 /* None */;
var overflow = false;
var overrideNextErrorInfo = 0; // How many `reportRelationError` calls should be skipped in the elaboration pyramid
var lastSkippedInfo;
var incompatibleStack = [];
var inPropertyCheck = false;
ts.Debug.assert(relation !== identityRelation || !errorNode, "no error reporting in identity checking");
var result = isRelatedTo(source, target, /*reportErrors*/ !!errorNode, headMessage);
if (incompatibleStack.length) {
reportIncompatibleStack();
}
if (overflow) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.instant("checkTypes" /* CheckTypes */, "checkTypeRelatedTo_DepthLimit", { sourceId: source.id, targetId: target.id, depth: depth });
var diag = error(errorNode || currentNode, ts.Diagnostics.Excessive_stack_depth_comparing_types_0_and_1, typeToString(source), typeToString(target));
if (errorOutputContainer) {
(errorOutputContainer.errors || (errorOutputContainer.errors = [])).push(diag);
}
}
else if (errorInfo) {
if (containingMessageChain) {
var chain = containingMessageChain();
if (chain) {
ts.concatenateDiagnosticMessageChains(chain, errorInfo);
errorInfo = chain;
}
}
var relatedInformation = void 0;
// Check if we should issue an extra diagnostic to produce a quickfix for a slightly incorrect import statement
if (headMessage && errorNode && !result && source.symbol) {
var links = getSymbolLinks(source.symbol);
if (links.originatingImport && !ts.isImportCall(links.originatingImport)) {
var helpfulRetry = checkTypeRelatedTo(getTypeOfSymbol(links.target), target, relation, /*errorNode*/ undefined);
if (helpfulRetry) {
// Likely an incorrect import. Issue a helpful diagnostic to produce a quickfix to change the import
var diag_1 = ts.createDiagnosticForNode(links.originatingImport, ts.Diagnostics.Type_originates_at_this_import_A_namespace_style_import_cannot_be_called_or_constructed_and_will_cause_a_failure_at_runtime_Consider_using_a_default_import_or_import_require_here_instead);
relatedInformation = ts.append(relatedInformation, diag_1); // Cause the error to appear with the error that triggered it
}
}
}
var diag = ts.createDiagnosticForNodeFromMessageChain(errorNode, errorInfo, relatedInformation);
if (relatedInfo) {
ts.addRelatedInfo.apply(void 0, __spreadArray([diag], relatedInfo, false));
}
if (errorOutputContainer) {
(errorOutputContainer.errors || (errorOutputContainer.errors = [])).push(diag);
}
if (!errorOutputContainer || !errorOutputContainer.skipLogging) {
diagnostics.add(diag);
}
}
if (errorNode && errorOutputContainer && errorOutputContainer.skipLogging && result === 0 /* False */) {
ts.Debug.assert(!!errorOutputContainer.errors, "missed opportunity to interact with error.");
}
return result !== 0 /* False */;
function resetErrorInfo(saved) {
errorInfo = saved.errorInfo;
lastSkippedInfo = saved.lastSkippedInfo;
incompatibleStack = saved.incompatibleStack;
overrideNextErrorInfo = saved.overrideNextErrorInfo;
relatedInfo = saved.relatedInfo;
}
function captureErrorCalculationState() {
return {
errorInfo: errorInfo,
lastSkippedInfo: lastSkippedInfo,
incompatibleStack: incompatibleStack.slice(),
overrideNextErrorInfo: overrideNextErrorInfo,
relatedInfo: !relatedInfo ? undefined : relatedInfo.slice()
};
}
function reportIncompatibleError(message, arg0, arg1, arg2, arg3) {
overrideNextErrorInfo++; // Suppress the next relation error
lastSkippedInfo = undefined; // Reset skipped info cache
incompatibleStack.push([message, arg0, arg1, arg2, arg3]);
}
function reportIncompatibleStack() {
var stack = incompatibleStack;
incompatibleStack = [];
var info = lastSkippedInfo;
lastSkippedInfo = undefined;
if (stack.length === 1) {
reportError.apply(void 0, stack[0]);
if (info) {
// Actually do the last relation error
reportRelationError.apply(void 0, __spreadArray([/*headMessage*/ undefined], info, false));
}
return;
}
// The first error will be the innermost, while the last will be the outermost - so by popping off the end,
// we can build from left to right
var path = "";
var secondaryRootErrors = [];
while (stack.length) {
var _a = stack.pop(), msg = _a[0], args = _a.slice(1);
switch (msg.code) {
case ts.Diagnostics.Types_of_property_0_are_incompatible.code: {
// Parenthesize a `new` if there is one
if (path.indexOf("new ") === 0) {
path = "(" + path + ")";
}
var str = "" + args[0];
// If leading, just print back the arg (irrespective of if it's a valid identifier)
if (path.length === 0) {
path = "" + str;
}
// Otherwise write a dotted name if possible
else if (ts.isIdentifierText(str, compilerOptions.target)) {
path = path + "." + str;
}
// Failing that, check if the name is already a computed name
else if (str[0] === "[" && str[str.length - 1] === "]") {
path = "" + path + str;
}
// And finally write out a computed name as a last resort
else {
path = path + "[" + str + "]";
}
break;
}
case ts.Diagnostics.Call_signature_return_types_0_and_1_are_incompatible.code:
case ts.Diagnostics.Construct_signature_return_types_0_and_1_are_incompatible.code:
case ts.Diagnostics.Call_signatures_with_no_arguments_have_incompatible_return_types_0_and_1.code:
case ts.Diagnostics.Construct_signatures_with_no_arguments_have_incompatible_return_types_0_and_1.code: {
if (path.length === 0) {
// Don't flatten signature compatability errors at the start of a chain - instead prefer
// to unify (the with no arguments bit is excessive for printback) and print them back
var mappedMsg = msg;
if (msg.code === ts.Diagnostics.Call_signatures_with_no_arguments_have_incompatible_return_types_0_and_1.code) {
mappedMsg = ts.Diagnostics.Call_signature_return_types_0_and_1_are_incompatible;
}
else if (msg.code === ts.Diagnostics.Construct_signatures_with_no_arguments_have_incompatible_return_types_0_and_1.code) {
mappedMsg = ts.Diagnostics.Construct_signature_return_types_0_and_1_are_incompatible;
}
secondaryRootErrors.unshift([mappedMsg, args[0], args[1]]);
}
else {
var prefix = (msg.code === ts.Diagnostics.Construct_signature_return_types_0_and_1_are_incompatible.code ||
msg.code === ts.Diagnostics.Construct_signatures_with_no_arguments_have_incompatible_return_types_0_and_1.code)
? "new "
: "";
var params = (msg.code === ts.Diagnostics.Call_signatures_with_no_arguments_have_incompatible_return_types_0_and_1.code ||
msg.code === ts.Diagnostics.Construct_signatures_with_no_arguments_have_incompatible_return_types_0_and_1.code)
? ""
: "...";
path = "" + prefix + path + "(" + params + ")";
}
break;
}
case ts.Diagnostics.Type_at_position_0_in_source_is_not_compatible_with_type_at_position_1_in_target.code: {
secondaryRootErrors.unshift([ts.Diagnostics.Type_at_position_0_in_source_is_not_compatible_with_type_at_position_1_in_target, args[0], args[1]]);
break;
}
case ts.Diagnostics.Type_at_positions_0_through_1_in_source_is_not_compatible_with_type_at_position_2_in_target.code: {
secondaryRootErrors.unshift([ts.Diagnostics.Type_at_positions_0_through_1_in_source_is_not_compatible_with_type_at_position_2_in_target, args[0], args[1], args[2]]);
break;
}
default:
return ts.Debug.fail("Unhandled Diagnostic: " + msg.code);
}
}
if (path) {
reportError(path[path.length - 1] === ")"
? ts.Diagnostics.The_types_returned_by_0_are_incompatible_between_these_types
: ts.Diagnostics.The_types_of_0_are_incompatible_between_these_types, path);
}
else {
// Remove the innermost secondary error as it will duplicate the error already reported by `reportRelationError` on entry
secondaryRootErrors.shift();
}
for (var _i = 0, secondaryRootErrors_1 = secondaryRootErrors; _i < secondaryRootErrors_1.length; _i++) {
var _b = secondaryRootErrors_1[_i], msg = _b[0], args = _b.slice(1);
var originalValue = msg.elidedInCompatabilityPyramid;
msg.elidedInCompatabilityPyramid = false; // Temporarily override elision to ensure error is reported
reportError.apply(void 0, __spreadArray([msg], args, false));
msg.elidedInCompatabilityPyramid = originalValue;
}
if (info) {
// Actually do the last relation error
reportRelationError.apply(void 0, __spreadArray([/*headMessage*/ undefined], info, false));
}
}
function reportError(message, arg0, arg1, arg2, arg3) {
ts.Debug.assert(!!errorNode);
if (incompatibleStack.length)
reportIncompatibleStack();
if (message.elidedInCompatabilityPyramid)
return;
errorInfo = ts.chainDiagnosticMessages(errorInfo, message, arg0, arg1, arg2, arg3);
}
function associateRelatedInfo(info) {
ts.Debug.assert(!!errorInfo);
if (!relatedInfo) {
relatedInfo = [info];
}
else {
relatedInfo.push(info);
}
}
function reportRelationError(message, source, target) {
if (incompatibleStack.length)
reportIncompatibleStack();
var _a = getTypeNamesForErrorDisplay(source, target), sourceType = _a[0], targetType = _a[1];
var generalizedSource = source;
var generalizedSourceType = sourceType;
if (isLiteralType(source) && !typeCouldHaveTopLevelSingletonTypes(target)) {
generalizedSource = getBaseTypeOfLiteralType(source);
ts.Debug.assert(!isTypeAssignableTo(generalizedSource, target), "generalized source shouldn't be assignable");
generalizedSourceType = getTypeNameForErrorDisplay(generalizedSource);
}
if (target.flags & 262144 /* TypeParameter */) {
var constraint = getBaseConstraintOfType(target);
var needsOriginalSource = void 0;
if (constraint && (isTypeAssignableTo(generalizedSource, constraint) || (needsOriginalSource = isTypeAssignableTo(source, constraint)))) {
reportError(ts.Diagnostics._0_is_assignable_to_the_constraint_of_type_1_but_1_could_be_instantiated_with_a_different_subtype_of_constraint_2, needsOriginalSource ? sourceType : generalizedSourceType, targetType, typeToString(constraint));
}
else {
errorInfo = undefined;
reportError(ts.Diagnostics._0_could_be_instantiated_with_an_arbitrary_type_which_could_be_unrelated_to_1, targetType, generalizedSourceType);
}
}
if (!message) {
if (relation === comparableRelation) {
message = ts.Diagnostics.Type_0_is_not_comparable_to_type_1;
}
else if (sourceType === targetType) {
message = ts.Diagnostics.Type_0_is_not_assignable_to_type_1_Two_different_types_with_this_name_exist_but_they_are_unrelated;
}
else {
message = ts.Diagnostics.Type_0_is_not_assignable_to_type_1;
}
}
reportError(message, generalizedSourceType, targetType);
}
function tryElaborateErrorsForPrimitivesAndObjects(source, target) {
var sourceType = symbolValueDeclarationIsContextSensitive(source.symbol) ? typeToString(source, source.symbol.valueDeclaration) : typeToString(source);
var targetType = symbolValueDeclarationIsContextSensitive(target.symbol) ? typeToString(target, target.symbol.valueDeclaration) : typeToString(target);
if ((globalStringType === source && stringType === target) ||
(globalNumberType === source && numberType === target) ||
(globalBooleanType === source && booleanType === target) ||
(getGlobalESSymbolType(/*reportErrors*/ false) === source && esSymbolType === target)) {
reportError(ts.Diagnostics._0_is_a_primitive_but_1_is_a_wrapper_object_Prefer_using_0_when_possible, targetType, sourceType);
}
}
/**
* Try and elaborate array and tuple errors. Returns false
* if we have found an elaboration, or we should ignore
* any other elaborations when relating the `source` and
* `target` types.
*/
function tryElaborateArrayLikeErrors(source, target, reportErrors) {
/**
* The spec for elaboration is:
* - If the source is a readonly tuple and the target is a mutable array or tuple, elaborate on mutability and skip property elaborations.
* - If the source is a tuple then skip property elaborations if the target is an array or tuple.
* - If the source is a readonly array and the target is a mutable array or tuple, elaborate on mutability and skip property elaborations.
* - If the source an array then skip property elaborations if the target is a tuple.
*/
if (isTupleType(source)) {
if (source.target.readonly && isMutableArrayOrTuple(target)) {
if (reportErrors) {
reportError(ts.Diagnostics.The_type_0_is_readonly_and_cannot_be_assigned_to_the_mutable_type_1, typeToString(source), typeToString(target));
}
return false;
}
return isTupleType(target) || isArrayType(target);
}
if (isReadonlyArrayType(source) && isMutableArrayOrTuple(target)) {
if (reportErrors) {
reportError(ts.Diagnostics.The_type_0_is_readonly_and_cannot_be_assigned_to_the_mutable_type_1, typeToString(source), typeToString(target));
}
return false;
}
if (isTupleType(target)) {
return isArrayType(source);
}
return true;
}
/**
* Compare two types and return
* * Ternary.True if they are related with no assumptions,
* * Ternary.Maybe if they are related with assumptions of other relationships, or
* * Ternary.False if they are not related.
*/
function isRelatedTo(originalSource, originalTarget, reportErrors, headMessage, intersectionState) {
if (reportErrors === void 0) { reportErrors = false; }
if (intersectionState === void 0) { intersectionState = 0 /* None */; }
// Before normalization: if `source` is type an object type, and `target` is primitive,
// skip all the checks we don't need and just return `isSimpleTypeRelatedTo` result
if (originalSource.flags & 524288 /* Object */ && originalTarget.flags & 131068 /* Primitive */) {
if (isSimpleTypeRelatedTo(originalSource, originalTarget, relation, reportErrors ? reportError : undefined)) {
return -1 /* True */;
}
reportErrorResults(originalSource, originalTarget, 0 /* False */, !!(ts.getObjectFlags(originalSource) & 2048 /* JsxAttributes */));
return 0 /* False */;
}
// Normalize the source and target types: Turn fresh literal types into regular literal types,
// turn deferred type references into regular type references, simplify indexed access and
// conditional types, and resolve substitution types to either the substitution (on the source
// side) or the type variable (on the target side).
var source = getNormalizedType(originalSource, /*writing*/ false);
var target = getNormalizedType(originalTarget, /*writing*/ true);
if (source === target)
return -1 /* True */;
if (relation === identityRelation) {
return isIdenticalTo(source, target);
}
// We fastpath comparing a type parameter to exactly its constraint, as this is _super_ common,
// and otherwise, for type parameters in large unions, causes us to need to compare the union to itself,
// as we break down the _target_ union first, _then_ get the source constraint - so for every
// member of the target, we attempt to find a match in the source. This avoids that in cases where
// the target is exactly the constraint.
if (source.flags & 262144 /* TypeParameter */ && getConstraintOfType(source) === target) {
return -1 /* True */;
}
// Try to see if we're relating something like `Foo` -> `Bar | null | undefined`.
// If so, reporting the `null` and `undefined` in the type is hardly useful.
// First, see if we're even relating an object type to a union.
// Then see if the target is stripped down to a single non-union type.
// Note
// * We actually want to remove null and undefined naively here (rather than using getNonNullableType),
// since we don't want to end up with a worse error like "`Foo` is not assignable to `NonNullable<T>`"
// when dealing with generics.
// * We also don't deal with primitive source types, since we already halt elaboration below.
if (target.flags & 1048576 /* Union */ && source.flags & 524288 /* Object */ &&
target.types.length <= 3 && maybeTypeOfKind(target, 98304 /* Nullable */)) {
var nullStrippedTarget = extractTypesOfKind(target, ~98304 /* Nullable */);
if (!(nullStrippedTarget.flags & (1048576 /* Union */ | 131072 /* Never */))) {
target = getNormalizedType(nullStrippedTarget, /*writing*/ true);
}
if (source === nullStrippedTarget)
return -1 /* True */;
}
if (relation === comparableRelation && !(target.flags & 131072 /* Never */) && isSimpleTypeRelatedTo(target, source, relation) ||
isSimpleTypeRelatedTo(source, target, relation, reportErrors ? reportError : undefined))
return -1 /* True */;
var isComparingJsxAttributes = !!(ts.getObjectFlags(source) & 2048 /* JsxAttributes */);
var isPerformingExcessPropertyChecks = !(intersectionState & 2 /* Target */) && (isObjectLiteralType(source) && ts.getObjectFlags(source) & 16384 /* FreshLiteral */);
if (isPerformingExcessPropertyChecks) {
if (hasExcessProperties(source, target, reportErrors)) {
if (reportErrors) {
reportRelationError(headMessage, source, originalTarget.aliasSymbol ? originalTarget : target);
}
return 0 /* False */;
}
}
var isPerformingCommonPropertyChecks = relation !== comparableRelation && !(intersectionState & 2 /* Target */) &&
source.flags & (131068 /* Primitive */ | 524288 /* Object */ | 2097152 /* Intersection */) && source !== globalObjectType &&
target.flags & (524288 /* Object */ | 2097152 /* Intersection */) && isWeakType(target) &&
(getPropertiesOfType(source).length > 0 || typeHasCallOrConstructSignatures(source));
if (isPerformingCommonPropertyChecks && !hasCommonProperties(source, target, isComparingJsxAttributes)) {
if (reportErrors) {
var sourceString = typeToString(originalSource.aliasSymbol ? originalSource : source);
var targetString = typeToString(originalTarget.aliasSymbol ? originalTarget : target);
var calls = getSignaturesOfType(source, 0 /* Call */);
var constructs = getSignaturesOfType(source, 1 /* Construct */);
if (calls.length > 0 && isRelatedTo(getReturnTypeOfSignature(calls[0]), target, /*reportErrors*/ false) ||
constructs.length > 0 && isRelatedTo(getReturnTypeOfSignature(constructs[0]), target, /*reportErrors*/ false)) {
reportError(ts.Diagnostics.Value_of_type_0_has_no_properties_in_common_with_type_1_Did_you_mean_to_call_it, sourceString, targetString);
}
else {
reportError(ts.Diagnostics.Type_0_has_no_properties_in_common_with_type_1, sourceString, targetString);
}
}
return 0 /* False */;
}
traceUnionsOrIntersectionsTooLarge(source, target);
var result = 0 /* False */;
var saveErrorInfo = captureErrorCalculationState();
// Note that these checks are specifically ordered to produce correct results. In particular,
// we need to deconstruct unions before intersections (because unions are always at the top),
// and we need to handle "each" relations before "some" relations for the same kind of type.
if (source.flags & 3145728 /* UnionOrIntersection */ || target.flags & 3145728 /* UnionOrIntersection */) {
result = getConstituentCount(source) * getConstituentCount(target) >= 4 ?
recursiveTypeRelatedTo(source, target, reportErrors, intersectionState | 8 /* UnionIntersectionCheck */) :
structuredTypeRelatedTo(source, target, reportErrors, intersectionState | 8 /* UnionIntersectionCheck */);
}
if (!result && !(source.flags & 1048576 /* Union */) && (source.flags & (469499904 /* StructuredOrInstantiable */) || target.flags & 469499904 /* StructuredOrInstantiable */)) {
if (result = recursiveTypeRelatedTo(source, target, reportErrors, intersectionState)) {
resetErrorInfo(saveErrorInfo);
}
}
if (!result && source.flags & (2097152 /* Intersection */ | 262144 /* TypeParameter */)) {
// The combined constraint of an intersection type is the intersection of the constraints of
// the constituents. When an intersection type contains instantiable types with union type
// constraints, there are situations where we need to examine the combined constraint. One is
// when the target is a union type. Another is when the intersection contains types belonging
// to one of the disjoint domains. For example, given type variables T and U, each with the
// constraint 'string | number', the combined constraint of 'T & U' is 'string | number' and
// we need to check this constraint against a union on the target side. Also, given a type
// variable V constrained to 'string | number', 'V & number' has a combined constraint of
// 'string & number | number & number' which reduces to just 'number'.
// This also handles type parameters, as a type parameter with a union constraint compared against a union
// needs to have its constraint hoisted into an intersection with said type parameter, this way
// the type param can be compared with itself in the target (with the influence of its constraint to match other parts)
// For example, if `T extends 1 | 2` and `U extends 2 | 3` and we compare `T & U` to `T & U & (1 | 2 | 3)`
var constraint = getEffectiveConstraintOfIntersection(source.flags & 2097152 /* Intersection */ ? source.types : [source], !!(target.flags & 1048576 /* Union */));
if (constraint && (source.flags & 2097152 /* Intersection */ || target.flags & 1048576 /* Union */)) {
if (everyType(constraint, function (c) { return c !== source; })) { // Skip comparison if expansion contains the source itself
// TODO: Stack errors so we get a pyramid for the "normal" comparison above, _and_ a second for this
if (result = isRelatedTo(constraint, target, /*reportErrors*/ false, /*headMessage*/ undefined, intersectionState)) {
resetErrorInfo(saveErrorInfo);
}
}
}
}
// For certain combinations involving intersections and optional, excess, or mismatched properties we need
// an extra property check where the intersection is viewed as a single object. The following are motivating
// examples that all should be errors, but aren't without this extra property check:
//
// let obj: { a: { x: string } } & { c: number } = { a: { x: 'hello', y: 2 }, c: 5 }; // Nested excess property
//
// declare let wrong: { a: { y: string } };
// let weak: { a?: { x?: number } } & { c?: string } = wrong; // Nested weak object type
//
// function foo<T extends object>(x: { a?: string }, y: T & { a: boolean }) {
// x = y; // Mismatched property in source intersection
// }
//
// We suppress recursive intersection property checks because they can generate lots of work when relating
// recursive intersections that are structurally similar but not exactly identical. See #37854.
if (result && !inPropertyCheck && (target.flags & 2097152 /* Intersection */ && (isPerformingExcessPropertyChecks || isPerformingCommonPropertyChecks) ||
isNonGenericObjectType(target) && !isArrayType(target) && !isTupleType(target) && source.flags & 2097152 /* Intersection */ && getApparentType(source).flags & 3670016 /* StructuredType */ && !ts.some(source.types, function (t) { return !!(ts.getObjectFlags(t) & 524288 /* NonInferrableType */); }))) {
inPropertyCheck = true;
result &= recursiveTypeRelatedTo(source, target, reportErrors, 4 /* PropertyCheck */);
inPropertyCheck = false;
}
reportErrorResults(source, target, result, isComparingJsxAttributes);
return result;
function reportErrorResults(source, target, result, isComparingJsxAttributes) {
if (!result && reportErrors) {
var sourceHasBase = !!getSingleBaseForNonAugmentingSubtype(originalSource);
var targetHasBase = !!getSingleBaseForNonAugmentingSubtype(originalTarget);
source = (originalSource.aliasSymbol || sourceHasBase) ? originalSource : source;
target = (originalTarget.aliasSymbol || targetHasBase) ? originalTarget : target;
var maybeSuppress = overrideNextErrorInfo > 0;
if (maybeSuppress) {
overrideNextErrorInfo--;
}
if (source.flags & 524288 /* Object */ && target.flags & 524288 /* Object */) {
var currentError = errorInfo;
tryElaborateArrayLikeErrors(source, target, reportErrors);
if (errorInfo !== currentError) {
maybeSuppress = !!errorInfo;
}
}
if (source.flags & 524288 /* Object */ && target.flags & 131068 /* Primitive */) {
tryElaborateErrorsForPrimitivesAndObjects(source, target);
}
else if (source.symbol && source.flags & 524288 /* Object */ && globalObjectType === source) {
reportError(ts.Diagnostics.The_Object_type_is_assignable_to_very_few_other_types_Did_you_mean_to_use_the_any_type_instead);
}
else if (isComparingJsxAttributes && target.flags & 2097152 /* Intersection */) {
var targetTypes = target.types;
var intrinsicAttributes = getJsxType(JsxNames.IntrinsicAttributes, errorNode);
var intrinsicClassAttributes = getJsxType(JsxNames.IntrinsicClassAttributes, errorNode);
if (intrinsicAttributes !== errorType && intrinsicClassAttributes !== errorType &&
(ts.contains(targetTypes, intrinsicAttributes) || ts.contains(targetTypes, intrinsicClassAttributes))) {
// do not report top error
return result;
}
}
else {
errorInfo = elaborateNeverIntersection(errorInfo, originalTarget);
}
if (!headMessage && maybeSuppress) {
lastSkippedInfo = [source, target];
// Used by, eg, missing property checking to replace the top-level message with a more informative one
return result;
}
reportRelationError(headMessage, source, target);
}
}
}
function traceUnionsOrIntersectionsTooLarge(source, target) {
if (!ts.tracing) {
return;
}
if ((source.flags & 3145728 /* UnionOrIntersection */) && (target.flags & 3145728 /* UnionOrIntersection */)) {
var sourceUnionOrIntersection = source;
var targetUnionOrIntersection = target;
if (sourceUnionOrIntersection.objectFlags & targetUnionOrIntersection.objectFlags & 65536 /* PrimitiveUnion */) {
// There's a fast path for comparing primitive unions
return;
}
var sourceSize = sourceUnionOrIntersection.types.length;
var targetSize = targetUnionOrIntersection.types.length;
if (sourceSize * targetSize > 1E6) {
ts.tracing.instant("checkTypes" /* CheckTypes */, "traceUnionsOrIntersectionsTooLarge_DepthLimit", {
sourceId: source.id,
sourceSize: sourceSize,
targetId: target.id,
targetSize: targetSize,
pos: errorNode === null || errorNode === void 0 ? void 0 : errorNode.pos,
end: errorNode === null || errorNode === void 0 ? void 0 : errorNode.end
});
}
}
}
function isIdenticalTo(source, target) {
if (source.flags !== target.flags)
return 0 /* False */;
if (source.flags & 67358815 /* Singleton */)
return -1 /* True */;
traceUnionsOrIntersectionsTooLarge(source, target);
if (source.flags & 3145728 /* UnionOrIntersection */) {
var result_7 = eachTypeRelatedToSomeType(source, target);
if (result_7) {
result_7 &= eachTypeRelatedToSomeType(target, source);
}
return result_7;
}
return recursiveTypeRelatedTo(source, target, /*reportErrors*/ false, 0 /* None */);
}
function getTypeOfPropertyInTypes(types, name) {
var appendPropType = function (propTypes, type) {
var _a;
type = getApparentType(type);
var prop = type.flags & 3145728 /* UnionOrIntersection */ ? getPropertyOfUnionOrIntersectionType(type, name) : getPropertyOfObjectType(type, name);
var propType = prop && getTypeOfSymbol(prop) || ((_a = getApplicableIndexInfoForName(type, name)) === null || _a === void 0 ? void 0 : _a.type) || undefinedType;
return ts.append(propTypes, propType);
};
return getUnionType(ts.reduceLeft(types, appendPropType, /*initial*/ undefined) || ts.emptyArray);
}
function hasExcessProperties(source, target, reportErrors) {
var _a;
if (!isExcessPropertyCheckTarget(target) || !noImplicitAny && ts.getObjectFlags(target) & 8192 /* JSLiteral */) {
return false; // Disable excess property checks on JS literals to simulate having an implicit "index signature" - but only outside of noImplicitAny
}
var isComparingJsxAttributes = !!(ts.getObjectFlags(source) & 2048 /* JsxAttributes */);
if ((relation === assignableRelation || relation === comparableRelation) &&
(isTypeSubsetOf(globalObjectType, target) || (!isComparingJsxAttributes && isEmptyObjectType(target)))) {
return false;
}
var reducedTarget = target;
var checkTypes;
if (target.flags & 1048576 /* Union */) {
reducedTarget = findMatchingDiscriminantType(source, target, isRelatedTo) || filterPrimitivesIfContainsNonPrimitive(target);
checkTypes = reducedTarget.flags & 1048576 /* Union */ ? reducedTarget.types : [reducedTarget];
}
var _loop_18 = function (prop) {
if (shouldCheckAsExcessProperty(prop, source.symbol) && !isIgnoredJsxProperty(source, prop)) {
if (!isKnownProperty(reducedTarget, prop.escapedName, isComparingJsxAttributes)) {
if (reportErrors) {
// Report error in terms of object types in the target as those are the only ones
// we check in isKnownProperty.
var errorTarget = filterType(reducedTarget, isExcessPropertyCheckTarget);
// We know *exactly* where things went wrong when comparing the types.
// Use this property as the error node as this will be more helpful in
// reasoning about what went wrong.
if (!errorNode)
return { value: ts.Debug.fail() };
if (ts.isJsxAttributes(errorNode) || ts.isJsxOpeningLikeElement(errorNode) || ts.isJsxOpeningLikeElement(errorNode.parent)) {
// JsxAttributes has an object-literal flag and undergo same type-assignablity check as normal object-literal.
// However, using an object-literal error message will be very confusing to the users so we give different a message.
if (prop.valueDeclaration && ts.isJsxAttribute(prop.valueDeclaration) && ts.getSourceFileOfNode(errorNode) === ts.getSourceFileOfNode(prop.valueDeclaration.name)) {
// Note that extraneous children (as in `<NoChild>extra</NoChild>`) don't pass this check,
// since `children` is a SyntaxKind.PropertySignature instead of a SyntaxKind.JsxAttribute.
errorNode = prop.valueDeclaration.name;
}
var propName = symbolToString(prop);
var suggestionSymbol = getSuggestedSymbolForNonexistentJSXAttribute(propName, errorTarget);
var suggestion = suggestionSymbol ? symbolToString(suggestionSymbol) : undefined;
if (suggestion) {
reportError(ts.Diagnostics.Property_0_does_not_exist_on_type_1_Did_you_mean_2, propName, typeToString(errorTarget), suggestion);
}
else {
reportError(ts.Diagnostics.Property_0_does_not_exist_on_type_1, propName, typeToString(errorTarget));
}
}
else {
// use the property's value declaration if the property is assigned inside the literal itself
var objectLiteralDeclaration_1 = ((_a = source.symbol) === null || _a === void 0 ? void 0 : _a.declarations) && ts.firstOrUndefined(source.symbol.declarations);
var suggestion = void 0;
if (prop.valueDeclaration && ts.findAncestor(prop.valueDeclaration, function (d) { return d === objectLiteralDeclaration_1; }) && ts.getSourceFileOfNode(objectLiteralDeclaration_1) === ts.getSourceFileOfNode(errorNode)) {
var propDeclaration = prop.valueDeclaration;
ts.Debug.assertNode(propDeclaration, ts.isObjectLiteralElementLike);
errorNode = propDeclaration;
var name = propDeclaration.name;
if (ts.isIdentifier(name)) {
suggestion = getSuggestionForNonexistentProperty(name, errorTarget);
}
}
if (suggestion !== undefined) {
reportError(ts.Diagnostics.Object_literal_may_only_specify_known_properties_but_0_does_not_exist_in_type_1_Did_you_mean_to_write_2, symbolToString(prop), typeToString(errorTarget), suggestion);
}
else {
reportError(ts.Diagnostics.Object_literal_may_only_specify_known_properties_and_0_does_not_exist_in_type_1, symbolToString(prop), typeToString(errorTarget));
}
}
}
return { value: true };
}
if (checkTypes && !isRelatedTo(getTypeOfSymbol(prop), getTypeOfPropertyInTypes(checkTypes, prop.escapedName), reportErrors)) {
if (reportErrors) {
reportIncompatibleError(ts.Diagnostics.Types_of_property_0_are_incompatible, symbolToString(prop));
}
return { value: true };
}
}
};
for (var _i = 0, _b = getPropertiesOfType(source); _i < _b.length; _i++) {
var prop = _b[_i];
var state_5 = _loop_18(prop);
if (typeof state_5 === "object")
return state_5.value;
}
return false;
}
function shouldCheckAsExcessProperty(prop, container) {
return prop.valueDeclaration && container.valueDeclaration && prop.valueDeclaration.parent === container.valueDeclaration;
}
function eachTypeRelatedToSomeType(source, target) {
var result = -1 /* True */;
var sourceTypes = source.types;
for (var _i = 0, sourceTypes_1 = sourceTypes; _i < sourceTypes_1.length; _i++) {
var sourceType = sourceTypes_1[_i];
var related = typeRelatedToSomeType(sourceType, target, /*reportErrors*/ false);
if (!related) {
return 0 /* False */;
}
result &= related;
}
return result;
}
function typeRelatedToSomeType(source, target, reportErrors) {
var targetTypes = target.types;
if (target.flags & 1048576 /* Union */) {
if (containsType(targetTypes, source)) {
return -1 /* True */;
}
var match = getMatchingUnionConstituentForType(target, source);
if (match) {
var related = isRelatedTo(source, match, /*reportErrors*/ false);
if (related) {
return related;
}
}
}
for (var _i = 0, targetTypes_1 = targetTypes; _i < targetTypes_1.length; _i++) {
var type = targetTypes_1[_i];
var related = isRelatedTo(source, type, /*reportErrors*/ false);
if (related) {
return related;
}
}
if (reportErrors) {
var bestMatchingType = getBestMatchingType(source, target, isRelatedTo);
isRelatedTo(source, bestMatchingType || targetTypes[targetTypes.length - 1], /*reportErrors*/ true);
}
return 0 /* False */;
}
function typeRelatedToEachType(source, target, reportErrors, intersectionState) {
var result = -1 /* True */;
var targetTypes = target.types;
for (var _i = 0, targetTypes_2 = targetTypes; _i < targetTypes_2.length; _i++) {
var targetType = targetTypes_2[_i];
var related = isRelatedTo(source, targetType, reportErrors, /*headMessage*/ undefined, intersectionState);
if (!related) {
return 0 /* False */;
}
result &= related;
}
return result;
}
function someTypeRelatedToType(source, target, reportErrors, intersectionState) {
var sourceTypes = source.types;
if (source.flags & 1048576 /* Union */ && containsType(sourceTypes, target)) {
return -1 /* True */;
}
var len = sourceTypes.length;
for (var i = 0; i < len; i++) {
var related = isRelatedTo(sourceTypes[i], target, reportErrors && i === len - 1, /*headMessage*/ undefined, intersectionState);
if (related) {
return related;
}
}
return 0 /* False */;
}
function getUndefinedStrippedTargetIfNeeded(source, target) {
// As a builtin type, `undefined` is a very low type ID - making it almsot always first, making this a very fast check to see
// if we need to strip `undefined` from the target
if (source.flags & 1048576 /* Union */ && target.flags & 1048576 /* Union */ &&
!(source.types[0].flags & 32768 /* Undefined */) && target.types[0].flags & 32768 /* Undefined */) {
return extractTypesOfKind(target, ~32768 /* Undefined */);
}
return target;
}
function eachTypeRelatedToType(source, target, reportErrors, intersectionState) {
var result = -1 /* True */;
var sourceTypes = source.types;
// We strip `undefined` from the target if the `source` trivially doesn't contain it for our correspondence-checking fastpath
// since `undefined` is frequently added by optionality and would otherwise spoil a potentially useful correspondence
var undefinedStrippedTarget = getUndefinedStrippedTargetIfNeeded(source, target);
for (var i = 0; i < sourceTypes.length; i++) {
var sourceType = sourceTypes[i];
if (undefinedStrippedTarget.flags & 1048576 /* Union */ && sourceTypes.length >= undefinedStrippedTarget.types.length && sourceTypes.length % undefinedStrippedTarget.types.length === 0) {
// many unions are mappings of one another; in such cases, simply comparing members at the same index can shortcut the comparison
// such unions will have identical lengths, and their corresponding elements will match up. Another common scenario is where a large
// union has a union of objects intersected with it. In such cases, if the input was, eg `("a" | "b" | "c") & (string | boolean | {} | {whatever})`,
// the result will have the structure `"a" | "b" | "c" | "a" & {} | "b" & {} | "c" & {} | "a" & {whatever} | "b" & {whatever} | "c" & {whatever}`
// - the resulting union has a length which is a multiple of the original union, and the elements correspond modulo the length of the original union
var related_1 = isRelatedTo(sourceType, undefinedStrippedTarget.types[i % undefinedStrippedTarget.types.length], /*reportErrors*/ false, /*headMessage*/ undefined, intersectionState);
if (related_1) {
result &= related_1;
continue;
}
}
var related = isRelatedTo(sourceType, target, reportErrors, /*headMessage*/ undefined, intersectionState);
if (!related) {
return 0 /* False */;
}
result &= related;
}
return result;
}
function typeArgumentsRelatedTo(sources, targets, variances, reportErrors, intersectionState) {
if (sources === void 0) { sources = ts.emptyArray; }
if (targets === void 0) { targets = ts.emptyArray; }
if (variances === void 0) { variances = ts.emptyArray; }
if (sources.length !== targets.length && relation === identityRelation) {
return 0 /* False */;
}
var length = sources.length <= targets.length ? sources.length : targets.length;
var result = -1 /* True */;
for (var i = 0; i < length; i++) {
// When variance information isn't available we default to covariance. This happens
// in the process of computing variance information for recursive types and when
// comparing 'this' type arguments.
var varianceFlags = i < variances.length ? variances[i] : 1 /* Covariant */;
var variance = varianceFlags & 7 /* VarianceMask */;
// We ignore arguments for independent type parameters (because they're never witnessed).
if (variance !== 4 /* Independent */) {
var s = sources[i];
var t = targets[i];
var related = -1 /* True */;
if (varianceFlags & 8 /* Unmeasurable */) {
// Even an `Unmeasurable` variance works out without a structural check if the source and target are _identical_.
// We can't simply assume invariance, because `Unmeasurable` marks nonlinear relations, for example, a relation tained by
// the `-?` modifier in a mapped type (where, no matter how the inputs are related, the outputs still might not be)
related = relation === identityRelation ? isRelatedTo(s, t, /*reportErrors*/ false) : compareTypesIdentical(s, t);
}
else if (variance === 1 /* Covariant */) {
related = isRelatedTo(s, t, reportErrors, /*headMessage*/ undefined, intersectionState);
}
else if (variance === 2 /* Contravariant */) {
related = isRelatedTo(t, s, reportErrors, /*headMessage*/ undefined, intersectionState);
}
else if (variance === 3 /* Bivariant */) {
// In the bivariant case we first compare contravariantly without reporting
// errors. Then, if that doesn't succeed, we compare covariantly with error
// reporting. Thus, error elaboration will be based on the the covariant check,
// which is generally easier to reason about.
related = isRelatedTo(t, s, /*reportErrors*/ false);
if (!related) {
related = isRelatedTo(s, t, reportErrors, /*headMessage*/ undefined, intersectionState);
}
}
else {
// In the invariant case we first compare covariantly, and only when that
// succeeds do we proceed to compare contravariantly. Thus, error elaboration
// will typically be based on the covariant check.
related = isRelatedTo(s, t, reportErrors, /*headMessage*/ undefined, intersectionState);
if (related) {
related &= isRelatedTo(t, s, reportErrors, /*headMessage*/ undefined, intersectionState);
}
}
if (!related) {
return 0 /* False */;
}
result &= related;
}
}
return result;
}
// Determine if possibly recursive types are related. First, check if the result is already available in the global cache.
// Second, check if we have already started a comparison of the given two types in which case we assume the result to be true.
// Third, check if both types are part of deeply nested chains of generic type instantiations and if so assume the types are
// equal and infinitely expanding. Fourth, if we have reached a depth of 100 nested comparisons, assume we have runaway recursion
// and issue an error. Otherwise, actually compare the structure of the two types.
function recursiveTypeRelatedTo(source, target, reportErrors, intersectionState) {
if (overflow) {
return 0 /* False */;
}
var id = getRelationKey(source, target, intersectionState | (inPropertyCheck ? 16 /* InPropertyCheck */ : 0), relation);
var entry = relation.get(id);
if (entry !== undefined) {
if (reportErrors && entry & 2 /* Failed */ && !(entry & 4 /* Reported */)) {
// We are elaborating errors and the cached result is an unreported failure. The result will be reported
// as a failure, and should be updated as a reported failure by the bottom of this function.
}
else {
if (outofbandVarianceMarkerHandler) {
// We're in the middle of variance checking - integrate any unmeasurable/unreliable flags from this cached component
var saved = entry & 24 /* ReportsMask */;
if (saved & 8 /* ReportsUnmeasurable */) {
instantiateType(source, makeFunctionTypeMapper(reportUnmeasurableMarkers));
}
if (saved & 16 /* ReportsUnreliable */) {
instantiateType(source, makeFunctionTypeMapper(reportUnreliableMarkers));
}
}
return entry & 1 /* Succeeded */ ? -1 /* True */ : 0 /* False */;
}
}
if (!maybeKeys) {
maybeKeys = [];
sourceStack = [];
targetStack = [];
}
else {
// generate a key where all type parameter id positions are replaced with unconstrained type parameter ids
// this isn't perfect - nested type references passed as type arguments will muck up the indexes and thus
// prevent finding matches- but it should hit up the common cases
var broadestEquivalentId = id.split(",").map(function (i) { return i.replace(/-\d+/g, function (_match, offset) {
var index = ts.length(id.slice(0, offset).match(/[-=]/g) || undefined);
return "=" + index;
}); }).join(",");
for (var i = 0; i < maybeCount; i++) {
// If source and target are already being compared, consider them related with assumptions
if (id === maybeKeys[i] || broadestEquivalentId === maybeKeys[i]) {
return 3 /* Maybe */;
}
}
if (depth === 100) {
overflow = true;
return 0 /* False */;
}
}
var maybeStart = maybeCount;
maybeKeys[maybeCount] = id;
maybeCount++;
sourceStack[depth] = source;
targetStack[depth] = target;
depth++;
var saveExpandingFlags = expandingFlags;
if (!(expandingFlags & 1 /* Source */) && isDeeplyNestedType(source, sourceStack, depth))
expandingFlags |= 1 /* Source */;
if (!(expandingFlags & 2 /* Target */) && isDeeplyNestedType(target, targetStack, depth))
expandingFlags |= 2 /* Target */;
var originalHandler;
var propagatingVarianceFlags = 0;
if (outofbandVarianceMarkerHandler) {
originalHandler = outofbandVarianceMarkerHandler;
outofbandVarianceMarkerHandler = function (onlyUnreliable) {
propagatingVarianceFlags |= onlyUnreliable ? 16 /* ReportsUnreliable */ : 8 /* ReportsUnmeasurable */;
return originalHandler(onlyUnreliable);
};
}
if (expandingFlags === 3 /* Both */) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.instant("checkTypes" /* CheckTypes */, "recursiveTypeRelatedTo_DepthLimit", {
sourceId: source.id,
sourceIdStack: sourceStack.map(function (t) { return t.id; }),
targetId: target.id,
targetIdStack: targetStack.map(function (t) { return t.id; }),
depth: depth,
});
}
var result = expandingFlags !== 3 /* Both */ ? structuredTypeRelatedTo(source, target, reportErrors, intersectionState) : 3 /* Maybe */;
if (outofbandVarianceMarkerHandler) {
outofbandVarianceMarkerHandler = originalHandler;
}
expandingFlags = saveExpandingFlags;
depth--;
if (result) {
if (result === -1 /* True */ || depth === 0) {
if (result === -1 /* True */ || result === 3 /* Maybe */) {
// If result is definitely true, record all maybe keys as having succeeded. Also, record Ternary.Maybe
// results as having succeeded once we reach depth 0, but never record Ternary.Unknown results.
for (var i = maybeStart; i < maybeCount; i++) {
relation.set(maybeKeys[i], 1 /* Succeeded */ | propagatingVarianceFlags);
}
}
maybeCount = maybeStart;
}
}
else {
// A false result goes straight into global cache (when something is false under
// assumptions it will also be false without assumptions)
relation.set(id, (reportErrors ? 4 /* Reported */ : 0) | 2 /* Failed */ | propagatingVarianceFlags);
maybeCount = maybeStart;
}
return result;
}
function structuredTypeRelatedTo(source, target, reportErrors, intersectionState) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("checkTypes" /* CheckTypes */, "structuredTypeRelatedTo", { sourceId: source.id, targetId: target.id });
var result = structuredTypeRelatedToWorker(source, target, reportErrors, intersectionState);
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
return result;
}
function structuredTypeRelatedToWorker(source, target, reportErrors, intersectionState) {
if (intersectionState & 4 /* PropertyCheck */) {
return propertiesRelatedTo(source, target, reportErrors, /*excludedProperties*/ undefined, 0 /* None */);
}
if (intersectionState & 8 /* UnionIntersectionCheck */) {
// Note that these checks are specifically ordered to produce correct results. In particular,
// we need to deconstruct unions before intersections (because unions are always at the top),
// and we need to handle "each" relations before "some" relations for the same kind of type.
if (source.flags & 1048576 /* Union */) {
return relation === comparableRelation ?
someTypeRelatedToType(source, target, reportErrors && !(source.flags & 131068 /* Primitive */), intersectionState & ~8 /* UnionIntersectionCheck */) :
eachTypeRelatedToType(source, target, reportErrors && !(source.flags & 131068 /* Primitive */), intersectionState & ~8 /* UnionIntersectionCheck */);
}
if (target.flags & 1048576 /* Union */) {
return typeRelatedToSomeType(getRegularTypeOfObjectLiteral(source), target, reportErrors && !(source.flags & 131068 /* Primitive */) && !(target.flags & 131068 /* Primitive */));
}
if (target.flags & 2097152 /* Intersection */) {
return typeRelatedToEachType(getRegularTypeOfObjectLiteral(source), target, reportErrors, 2 /* Target */);
}
// Source is an intersection. For the comparable relation, if the target is a primitive type we hoist the
// constraints of all non-primitive types in the source into a new intersection. We do this because the
// intersection may further constrain the constraints of the non-primitive types. For example, given a type
// parameter 'T extends 1 | 2', the intersection 'T & 1' should be reduced to '1' such that it doesn't
// appear to be comparable to '2'.
if (relation === comparableRelation && target.flags & 131068 /* Primitive */) {
var constraints = ts.sameMap(source.types, getBaseConstraintOrType);
if (constraints !== source.types) {
source = getIntersectionType(constraints);
if (!(source.flags & 2097152 /* Intersection */)) {
return isRelatedTo(source, target, /*reportErrors*/ false);
}
}
}
// Check to see if any constituents of the intersection are immediately related to the target.
//
// Don't report errors though. Checking whether a constituent is related to the source is not actually
// useful and leads to some confusing error messages. Instead it is better to let the below checks
// take care of this, or to not elaborate at all. For instance,
//
// - For an object type (such as 'C = A & B'), users are usually more interested in structural errors.
//
// - For a union type (such as '(A | B) = (C & D)'), it's better to hold onto the whole intersection
// than to report that 'D' is not assignable to 'A' or 'B'.
//
// - For a primitive type or type parameter (such as 'number = A & B') there is no point in
// breaking the intersection apart.
return someTypeRelatedToType(source, target, /*reportErrors*/ false, 1 /* Source */);
}
var flags = source.flags & target.flags;
if (relation === identityRelation && !(flags & 524288 /* Object */)) {
if (flags & 4194304 /* Index */) {
return isRelatedTo(source.type, target.type, /*reportErrors*/ false);
}
var result_8 = 0 /* False */;
if (flags & 8388608 /* IndexedAccess */) {
if (result_8 = isRelatedTo(source.objectType, target.objectType, /*reportErrors*/ false)) {
if (result_8 &= isRelatedTo(source.indexType, target.indexType, /*reportErrors*/ false)) {
return result_8;
}
}
}
if (flags & 16777216 /* Conditional */) {
if (source.root.isDistributive === target.root.isDistributive) {
if (result_8 = isRelatedTo(source.checkType, target.checkType, /*reportErrors*/ false)) {
if (result_8 &= isRelatedTo(source.extendsType, target.extendsType, /*reportErrors*/ false)) {
if (result_8 &= isRelatedTo(getTrueTypeFromConditionalType(source), getTrueTypeFromConditionalType(target), /*reportErrors*/ false)) {
if (result_8 &= isRelatedTo(getFalseTypeFromConditionalType(source), getFalseTypeFromConditionalType(target), /*reportErrors*/ false)) {
return result_8;
}
}
}
}
}
}
if (flags & 33554432 /* Substitution */) {
return isRelatedTo(source.substitute, target.substitute, /*reportErrors*/ false);
}
return 0 /* False */;
}
var result;
var originalErrorInfo;
var varianceCheckFailed = false;
var saveErrorInfo = captureErrorCalculationState();
// We limit alias variance probing to only object and conditional types since their alias behavior
// is more predictable than other, interned types, which may or may not have an alias depending on
// the order in which things were checked.
if (source.flags & (524288 /* Object */ | 16777216 /* Conditional */) && source.aliasSymbol &&
source.aliasTypeArguments && source.aliasSymbol === target.aliasSymbol &&
!(source.aliasTypeArgumentsContainsMarker || target.aliasTypeArgumentsContainsMarker)) {
var variances = getAliasVariances(source.aliasSymbol);
if (variances === ts.emptyArray) {
return 1 /* Unknown */;
}
var varianceResult = relateVariances(source.aliasTypeArguments, target.aliasTypeArguments, variances, intersectionState);
if (varianceResult !== undefined) {
return varianceResult;
}
}
// For a generic type T and a type U that is assignable to T, [...U] is assignable to T, U is assignable to readonly [...T],
// and U is assignable to [...T] when U is constrained to a mutable array or tuple type.
if (isSingleElementGenericTupleType(source) && !source.target.readonly && (result = isRelatedTo(getTypeArguments(source)[0], target)) ||
isSingleElementGenericTupleType(target) && (target.target.readonly || isMutableArrayOrTuple(getBaseConstraintOfType(source) || source)) && (result = isRelatedTo(source, getTypeArguments(target)[0]))) {
return result;
}
if (target.flags & 262144 /* TypeParameter */) {
// A source type { [P in Q]: X } is related to a target type T if keyof T is related to Q and X is related to T[Q].
if (ts.getObjectFlags(source) & 32 /* Mapped */ && !source.declaration.nameType && isRelatedTo(getIndexType(target), getConstraintTypeFromMappedType(source))) {
if (!(getMappedTypeModifiers(source) & 4 /* IncludeOptional */)) {
var templateType = getTemplateTypeFromMappedType(source);
var indexedAccessType = getIndexedAccessType(target, getTypeParameterFromMappedType(source));
if (result = isRelatedTo(templateType, indexedAccessType, reportErrors)) {
return result;
}
}
}
}
else if (target.flags & 4194304 /* Index */) {
var targetType = target.type;
// A keyof S is related to a keyof T if T is related to S.
if (source.flags & 4194304 /* Index */) {
if (result = isRelatedTo(targetType, source.type, /*reportErrors*/ false)) {
return result;
}
}
if (isTupleType(targetType)) {
// An index type can have a tuple type target when the tuple type contains variadic elements.
// Check if the source is related to the known keys of the tuple type.
if (result = isRelatedTo(source, getKnownKeysOfTupleType(targetType), reportErrors)) {
return result;
}
}
else {
// A type S is assignable to keyof T if S is assignable to keyof C, where C is the
// simplified form of T or, if T doesn't simplify, the constraint of T.
var constraint = getSimplifiedTypeOrConstraint(targetType);
if (constraint) {
// We require Ternary.True here such that circular constraints don't cause
// false positives. For example, given 'T extends { [K in keyof T]: string }',
// 'keyof T' has itself as its constraint and produces a Ternary.Maybe when
// related to other types.
if (isRelatedTo(source, getIndexType(constraint, target.stringsOnly), reportErrors) === -1 /* True */) {
return -1 /* True */;
}
}
}
}
else if (target.flags & 8388608 /* IndexedAccess */) {
if (source.flags & 8388608 /* IndexedAccess */) {
// Relate components directly before falling back to constraint relationships
// A type S[K] is related to a type T[J] if S is related to T and K is related to J.
if (result = isRelatedTo(source.objectType, target.objectType, reportErrors)) {
result &= isRelatedTo(source.indexType, target.indexType, reportErrors);
}
if (result) {
resetErrorInfo(saveErrorInfo);
return result;
}
if (reportErrors) {
originalErrorInfo = errorInfo;
}
}
// A type S is related to a type T[K] if S is related to C, where C is the base
// constraint of T[K] for writing.
if (relation === assignableRelation || relation === comparableRelation) {
var objectType = target.objectType;
var indexType = target.indexType;
var baseObjectType = getBaseConstraintOfType(objectType) || objectType;
var baseIndexType = getBaseConstraintOfType(indexType) || indexType;
if (!isGenericObjectType(baseObjectType) && !isGenericIndexType(baseIndexType)) {
var accessFlags = 4 /* Writing */ | (baseObjectType !== objectType ? 2 /* NoIndexSignatures */ : 0);
var constraint = getIndexedAccessTypeOrUndefined(baseObjectType, baseIndexType, accessFlags);
if (constraint) {
if (reportErrors && originalErrorInfo) {
// create a new chain for the constraint error
resetErrorInfo(saveErrorInfo);
}
if (result = isRelatedTo(source, constraint, reportErrors)) {
return result;
}
// prefer the shorter chain of the constraint comparison chain, and the direct comparison chain
if (reportErrors && originalErrorInfo && errorInfo) {
errorInfo = countMessageChainBreadth([originalErrorInfo]) <= countMessageChainBreadth([errorInfo]) ? originalErrorInfo : errorInfo;
}
}
}
}
if (reportErrors) {
originalErrorInfo = undefined;
}
}
else if (isGenericMappedType(target) && !target.declaration.nameType) {
// A source type T is related to a target type { [P in X]: T[P] }
var template = getTemplateTypeFromMappedType(target);
var modifiers = getMappedTypeModifiers(target);
if (!(modifiers & 8 /* ExcludeOptional */)) {
if (template.flags & 8388608 /* IndexedAccess */ && template.objectType === source &&
template.indexType === getTypeParameterFromMappedType(target)) {
return -1 /* True */;
}
if (!isGenericMappedType(source)) {
var targetConstraint = getConstraintTypeFromMappedType(target);
var sourceKeys = getIndexType(source, /*stringsOnly*/ undefined, /*noIndexSignatures*/ true);
var includeOptional = modifiers & 4 /* IncludeOptional */;
var filteredByApplicability = includeOptional ? intersectTypes(targetConstraint, sourceKeys) : undefined;
// A source type T is related to a target type { [P in Q]: X } if Q is related to keyof T and T[Q] is related to X.
// A source type T is related to a target type { [P in Q]?: X } if some constituent Q' of Q is related to keyof T and T[Q'] is related to X.
if (includeOptional
? !(filteredByApplicability.flags & 131072 /* Never */)
: isRelatedTo(targetConstraint, sourceKeys)) {
var templateType = getTemplateTypeFromMappedType(target);
var typeParameter = getTypeParameterFromMappedType(target);
// Fastpath: When the template has the form Obj[P] where P is the mapped type parameter, directly compare `source` with `Obj`
// to avoid creating the (potentially very large) number of new intermediate types made by manufacturing `source[P]`
var nonNullComponent = extractTypesOfKind(templateType, ~98304 /* Nullable */);
if (nonNullComponent.flags & 8388608 /* IndexedAccess */ && nonNullComponent.indexType === typeParameter) {
if (result = isRelatedTo(source, nonNullComponent.objectType, reportErrors)) {
return result;
}
}
else {
var indexingType = filteredByApplicability ? getIntersectionType([filteredByApplicability, typeParameter]) : typeParameter;
var indexedAccessType = getIndexedAccessType(source, indexingType);
if (result = isRelatedTo(indexedAccessType, templateType, reportErrors)) {
return result;
}
}
}
originalErrorInfo = errorInfo;
resetErrorInfo(saveErrorInfo);
}
}
}
else if (target.flags & 16777216 /* Conditional */) {
var c = target;
// Check if the conditional is always true or always false but still deferred for distribution purposes
var skipTrue = !isTypeAssignableTo(getPermissiveInstantiation(c.checkType), getPermissiveInstantiation(c.extendsType));
var skipFalse = !skipTrue && isConditionalTypeAlwaysTrueDisregardingInferTypes(c);
// Instantiate with a replacement mapper if the conditional is distributive, replacing the check type with a clone of itself,
// this way {x: string | number, y: string | number} -> (T extends T ? { x: T, y: T } : never) appropriately _fails_ when
// T = string | number (since that will end up distributing and producing `{x: string, y: string} | {x: number, y: number}`,
// to which `{x: string | number, y: string | number}` isn't assignable)
var distributionMapper = void 0;
var checkVar = getActualTypeVariable(c.root.checkType);
if (c.root.isDistributive && checkVar.flags & 262144 /* TypeParameter */) {
var newParam = cloneTypeParameter(checkVar);
distributionMapper = prependTypeMapping(checkVar, newParam, c.mapper);
newParam.mapper = distributionMapper;
}
// TODO: Find a nice way to include potential conditional type breakdowns in error output, if they seem good (they usually don't)
var localResult = void 0;
if (skipTrue || (localResult = isRelatedTo(source, distributionMapper ? instantiateType(getTypeFromTypeNode(c.root.node.trueType), distributionMapper) : getTrueTypeFromConditionalType(c), /*reportErrors*/ false))) {
if (!skipFalse) {
localResult = (localResult || 3 /* Maybe */) & isRelatedTo(source, distributionMapper ? instantiateType(getTypeFromTypeNode(c.root.node.falseType), distributionMapper) : getFalseTypeFromConditionalType(c), /*reportErrors*/ false);
}
}
if (localResult) {
resetErrorInfo(saveErrorInfo);
return localResult;
}
}
else if (target.flags & 134217728 /* TemplateLiteral */) {
if (source.flags & 134217728 /* TemplateLiteral */) {
// Report unreliable variance for type variables referenced in template literal type placeholders.
// For example, `foo-${number}` is related to `foo-${string}` even though number isn't related to string.
instantiateType(source, makeFunctionTypeMapper(reportUnreliableMarkers));
}
var result_9 = inferTypesFromTemplateLiteralType(source, target);
if (result_9 && ts.every(result_9, function (r, i) { return isValidTypeForTemplateLiteralPlaceholder(r, target.types[i]); })) {
return -1 /* True */;
}
}
if (source.flags & 8650752 /* TypeVariable */) {
// IndexedAccess comparisons are handled above in the `target.flags & TypeFlage.IndexedAccess` branch
if (!(source.flags & 8388608 /* IndexedAccess */ && target.flags & 8388608 /* IndexedAccess */)) {
var constraint = getConstraintOfType(source);
if (!constraint || (source.flags & 262144 /* TypeParameter */ && constraint.flags & 1 /* Any */)) {
// A type variable with no constraint is not related to the non-primitive object type.
if (result = isRelatedTo(emptyObjectType, extractTypesOfKind(target, ~67108864 /* NonPrimitive */))) {
resetErrorInfo(saveErrorInfo);
return result;
}
}
// hi-speed no-this-instantiation check (less accurate, but avoids costly `this`-instantiation when the constraint will suffice), see #28231 for report on why this is needed
else if (result = isRelatedTo(constraint, target, /*reportErrors*/ false, /*headMessage*/ undefined, intersectionState)) {
resetErrorInfo(saveErrorInfo);
return result;
}
// slower, fuller, this-instantiated check (necessary when comparing raw `this` types from base classes), see `subclassWithPolymorphicThisIsAssignable.ts` test for example
else if (result = isRelatedTo(getTypeWithThisArgument(constraint, source), target, reportErrors && !(target.flags & source.flags & 262144 /* TypeParameter */), /*headMessage*/ undefined, intersectionState)) {
resetErrorInfo(saveErrorInfo);
return result;
}
}
}
else if (source.flags & 4194304 /* Index */) {
if (result = isRelatedTo(keyofConstraintType, target, reportErrors)) {
resetErrorInfo(saveErrorInfo);
return result;
}
}
else if (source.flags & 134217728 /* TemplateLiteral */) {
if (!(target.flags & 134217728 /* TemplateLiteral */)) {
var baseConstraint = getBaseConstraintOfType(source);
var constraint = baseConstraint && baseConstraint !== source ? baseConstraint : stringType;
if (result = isRelatedTo(constraint, target, reportErrors)) {
resetErrorInfo(saveErrorInfo);
return result;
}
}
}
else if (source.flags & 268435456 /* StringMapping */) {
if (target.flags & 268435456 /* StringMapping */ && source.symbol === target.symbol) {
if (result = isRelatedTo(source.type, target.type, reportErrors)) {
resetErrorInfo(saveErrorInfo);
return result;
}
}
else {
var constraint = getBaseConstraintOfType(source);
if (constraint && (result = isRelatedTo(constraint, target, reportErrors))) {
resetErrorInfo(saveErrorInfo);
return result;
}
}
}
else if (source.flags & 16777216 /* Conditional */) {
if (target.flags & 16777216 /* Conditional */) {
// Two conditional types 'T1 extends U1 ? X1 : Y1' and 'T2 extends U2 ? X2 : Y2' are related if
// one of T1 and T2 is related to the other, U1 and U2 are identical types, X1 is related to X2,
// and Y1 is related to Y2.
var sourceParams = source.root.inferTypeParameters;
var sourceExtends = source.extendsType;
var mapper = void 0;
if (sourceParams) {
// If the source has infer type parameters, we instantiate them in the context of the target
var ctx = createInferenceContext(sourceParams, /*signature*/ undefined, 0 /* None */, isRelatedTo);
inferTypes(ctx.inferences, target.extendsType, sourceExtends, 512 /* NoConstraints */ | 1024 /* AlwaysStrict */);
sourceExtends = instantiateType(sourceExtends, ctx.mapper);
mapper = ctx.mapper;
}
if (isTypeIdenticalTo(sourceExtends, target.extendsType) &&
(isRelatedTo(source.checkType, target.checkType) || isRelatedTo(target.checkType, source.checkType))) {
if (result = isRelatedTo(instantiateType(getTrueTypeFromConditionalType(source), mapper), getTrueTypeFromConditionalType(target), reportErrors)) {
result &= isRelatedTo(getFalseTypeFromConditionalType(source), getFalseTypeFromConditionalType(target), reportErrors);
}
if (result) {
resetErrorInfo(saveErrorInfo);
return result;
}
}
}
else {
// conditionals aren't related to one another via distributive constraint as it is much too inaccurate and allows way
// more assignments than are desirable (since it maps the source check type to its constraint, it loses information)
var distributiveConstraint = getConstraintOfDistributiveConditionalType(source);
if (distributiveConstraint) {
if (result = isRelatedTo(distributiveConstraint, target, reportErrors)) {
resetErrorInfo(saveErrorInfo);
return result;
}
}
}
// conditionals _can_ be related to one another via normal constraint, as, eg, `A extends B ? O : never` should be assignable to `O`
// when `O` is a conditional (`never` is trivially aissgnable to `O`, as is `O`!).
var defaultConstraint = getDefaultConstraintOfConditionalType(source);
if (defaultConstraint) {
if (result = isRelatedTo(defaultConstraint, target, reportErrors)) {
resetErrorInfo(saveErrorInfo);
return result;
}
}
}
else {
// An empty object type is related to any mapped type that includes a '?' modifier.
if (relation !== subtypeRelation && relation !== strictSubtypeRelation && isPartialMappedType(target) && isEmptyObjectType(source)) {
return -1 /* True */;
}
if (isGenericMappedType(target)) {
if (isGenericMappedType(source)) {
if (result = mappedTypeRelatedTo(source, target, reportErrors)) {
resetErrorInfo(saveErrorInfo);
return result;
}
}
return 0 /* False */;
}
var sourceIsPrimitive = !!(source.flags & 131068 /* Primitive */);
if (relation !== identityRelation) {
source = getApparentType(source);
}
else if (isGenericMappedType(source)) {
return 0 /* False */;
}
if (ts.getObjectFlags(source) & 4 /* Reference */ && ts.getObjectFlags(target) & 4 /* Reference */ && source.target === target.target &&
!isTupleType(source) && !(ts.getObjectFlags(source) & 4096 /* MarkerType */ || ts.getObjectFlags(target) & 4096 /* MarkerType */)) {
// We have type references to the same generic type, and the type references are not marker
// type references (which are intended by be compared structurally). Obtain the variance
// information for the type parameters and relate the type arguments accordingly.
var variances = getVariances(source.target);
// We return Ternary.Maybe for a recursive invocation of getVariances (signalled by emptyArray). This
// effectively means we measure variance only from type parameter occurrences that aren't nested in
// recursive instantiations of the generic type.
if (variances === ts.emptyArray) {
return 1 /* Unknown */;
}
var varianceResult = relateVariances(getTypeArguments(source), getTypeArguments(target), variances, intersectionState);
if (varianceResult !== undefined) {
return varianceResult;
}
}
else if (isReadonlyArrayType(target) ? isArrayType(source) || isTupleType(source) : isArrayType(target) && isTupleType(source) && !source.target.readonly) {
if (relation !== identityRelation) {
return isRelatedTo(getIndexTypeOfType(source, numberType) || anyType, getIndexTypeOfType(target, numberType) || anyType, reportErrors);
}
else {
// By flags alone, we know that the `target` is a readonly array while the source is a normal array or tuple
// or `target` is an array and source is a tuple - in both cases the types cannot be identical, by construction
return 0 /* False */;
}
}
// Consider a fresh empty object literal type "closed" under the subtype relationship - this way `{} <- {[idx: string]: any} <- fresh({})`
// and not `{} <- fresh({}) <- {[idx: string]: any}`
else if ((relation === subtypeRelation || relation === strictSubtypeRelation) && isEmptyObjectType(target) && ts.getObjectFlags(target) & 16384 /* FreshLiteral */ && !isEmptyObjectType(source)) {
return 0 /* False */;
}
// Even if relationship doesn't hold for unions, intersections, or generic type references,
// it may hold in a structural comparison.
// In a check of the form X = A & B, we will have previously checked if A relates to X or B relates
// to X. Failing both of those we want to check if the aggregation of A and B's members structurally
// relates to X. Thus, we include intersection types on the source side here.
if (source.flags & (524288 /* Object */ | 2097152 /* Intersection */) && target.flags & 524288 /* Object */) {
// Report structural errors only if we haven't reported any errors yet
var reportStructuralErrors = reportErrors && errorInfo === saveErrorInfo.errorInfo && !sourceIsPrimitive;
result = propertiesRelatedTo(source, target, reportStructuralErrors, /*excludedProperties*/ undefined, intersectionState);
if (result) {
result &= signaturesRelatedTo(source, target, 0 /* Call */, reportStructuralErrors);
if (result) {
result &= signaturesRelatedTo(source, target, 1 /* Construct */, reportStructuralErrors);
if (result) {
result &= indexSignaturesRelatedTo(source, target, sourceIsPrimitive, reportStructuralErrors, intersectionState);
}
}
}
if (varianceCheckFailed && result) {
errorInfo = originalErrorInfo || errorInfo || saveErrorInfo.errorInfo; // Use variance error (there is no structural one) and return false
}
else if (result) {
return result;
}
}
// If S is an object type and T is a discriminated union, S may be related to T if
// there exists a constituent of T for every combination of the discriminants of S
// with respect to T. We do not report errors here, as we will use the existing
// error result from checking each constituent of the union.
if (source.flags & (524288 /* Object */ | 2097152 /* Intersection */) && target.flags & 1048576 /* Union */) {
var objectOnlyTarget = extractTypesOfKind(target, 524288 /* Object */ | 2097152 /* Intersection */ | 33554432 /* Substitution */);
if (objectOnlyTarget.flags & 1048576 /* Union */) {
var result_10 = typeRelatedToDiscriminatedType(source, objectOnlyTarget);
if (result_10) {
return result_10;
}
}
}
}
return 0 /* False */;
function countMessageChainBreadth(info) {
if (!info)
return 0;
return ts.reduceLeft(info, function (value, chain) { return value + 1 + countMessageChainBreadth(chain.next); }, 0);
}
function relateVariances(sourceTypeArguments, targetTypeArguments, variances, intersectionState) {
if (result = typeArgumentsRelatedTo(sourceTypeArguments, targetTypeArguments, variances, reportErrors, intersectionState)) {
return result;
}
if (ts.some(variances, function (v) { return !!(v & 24 /* AllowsStructuralFallback */); })) {
// If some type parameter was `Unmeasurable` or `Unreliable`, and we couldn't pass by assuming it was identical, then we
// have to allow a structural fallback check
// We elide the variance-based error elaborations, since those might not be too helpful, since we'll potentially
// be assuming identity of the type parameter.
originalErrorInfo = undefined;
resetErrorInfo(saveErrorInfo);
return undefined;
}
var allowStructuralFallback = targetTypeArguments && hasCovariantVoidArgument(targetTypeArguments, variances);
varianceCheckFailed = !allowStructuralFallback;
// The type arguments did not relate appropriately, but it may be because we have no variance
// information (in which case typeArgumentsRelatedTo defaulted to covariance for all type
// arguments). It might also be the case that the target type has a 'void' type argument for
// a covariant type parameter that is only used in return positions within the generic type
// (in which case any type argument is permitted on the source side). In those cases we proceed
// with a structural comparison. Otherwise, we know for certain the instantiations aren't
// related and we can return here.
if (variances !== ts.emptyArray && !allowStructuralFallback) {
// In some cases generic types that are covariant in regular type checking mode become
// invariant in --strictFunctionTypes mode because one or more type parameters are used in
// both co- and contravariant positions. In order to make it easier to diagnose *why* such
// types are invariant, if any of the type parameters are invariant we reset the reported
// errors and instead force a structural comparison (which will include elaborations that
// reveal the reason).
// We can switch on `reportErrors` here, since varianceCheckFailed guarantees we return `False`,
// we can return `False` early here to skip calculating the structural error message we don't need.
if (varianceCheckFailed && !(reportErrors && ts.some(variances, function (v) { return (v & 7 /* VarianceMask */) === 0 /* Invariant */; }))) {
return 0 /* False */;
}
// We remember the original error information so we can restore it in case the structural
// comparison unexpectedly succeeds. This can happen when the structural comparison result
// is a Ternary.Maybe for example caused by the recursion depth limiter.
originalErrorInfo = errorInfo;
resetErrorInfo(saveErrorInfo);
}
}
}
function reportUnmeasurableMarkers(p) {
if (outofbandVarianceMarkerHandler && (p === markerSuperType || p === markerSubType || p === markerOtherType)) {
outofbandVarianceMarkerHandler(/*onlyUnreliable*/ false);
}
return p;
}
function reportUnreliableMarkers(p) {
if (outofbandVarianceMarkerHandler && (p === markerSuperType || p === markerSubType || p === markerOtherType)) {
outofbandVarianceMarkerHandler(/*onlyUnreliable*/ true);
}
return p;
}
// A type [P in S]: X is related to a type [Q in T]: Y if T is related to S and X' is
// related to Y, where X' is an instantiation of X in which P is replaced with Q. Notice
// that S and T are contra-variant whereas X and Y are co-variant.
function mappedTypeRelatedTo(source, target, reportErrors) {
var modifiersRelated = relation === comparableRelation || (relation === identityRelation ? getMappedTypeModifiers(source) === getMappedTypeModifiers(target) :
getCombinedMappedTypeOptionality(source) <= getCombinedMappedTypeOptionality(target));
if (modifiersRelated) {
var result_11;
var targetConstraint = getConstraintTypeFromMappedType(target);
var sourceConstraint = instantiateType(getConstraintTypeFromMappedType(source), makeFunctionTypeMapper(getCombinedMappedTypeOptionality(source) < 0 ? reportUnmeasurableMarkers : reportUnreliableMarkers));
if (result_11 = isRelatedTo(targetConstraint, sourceConstraint, reportErrors)) {
var mapper = createTypeMapper([getTypeParameterFromMappedType(source)], [getTypeParameterFromMappedType(target)]);
if (instantiateType(getNameTypeFromMappedType(source), mapper) === instantiateType(getNameTypeFromMappedType(target), mapper)) {
return result_11 & isRelatedTo(instantiateType(getTemplateTypeFromMappedType(source), mapper), getTemplateTypeFromMappedType(target), reportErrors);
}
}
}
return 0 /* False */;
}
function typeRelatedToDiscriminatedType(source, target) {
// 1. Generate the combinations of discriminant properties & types 'source' can satisfy.
// a. If the number of combinations is above a set limit, the comparison is too complex.
// 2. Filter 'target' to the subset of types whose discriminants exist in the matrix.
// a. If 'target' does not satisfy all discriminants in the matrix, 'source' is not related.
// 3. For each type in the filtered 'target', determine if all non-discriminant properties of
// 'target' are related to a property in 'source'.
//
// NOTE: See ~/tests/cases/conformance/types/typeRelationships/assignmentCompatibility/assignmentCompatWithDiscriminatedUnion.ts
// for examples.
var sourceProperties = getPropertiesOfType(source);
var sourcePropertiesFiltered = findDiscriminantProperties(sourceProperties, target);
if (!sourcePropertiesFiltered)
return 0 /* False */;
// Though we could compute the number of combinations as we generate
// the matrix, this would incur additional memory overhead due to
// array allocations. To reduce this overhead, we first compute
// the number of combinations to ensure we will not surpass our
// fixed limit before incurring the cost of any allocations:
var numCombinations = 1;
for (var _i = 0, sourcePropertiesFiltered_1 = sourcePropertiesFiltered; _i < sourcePropertiesFiltered_1.length; _i++) {
var sourceProperty = sourcePropertiesFiltered_1[_i];
numCombinations *= countTypes(getNonMissingTypeOfSymbol(sourceProperty));
if (numCombinations > 25) {
// We've reached the complexity limit.
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.instant("checkTypes" /* CheckTypes */, "typeRelatedToDiscriminatedType_DepthLimit", { sourceId: source.id, targetId: target.id, numCombinations: numCombinations });
return 0 /* False */;
}
}
// Compute the set of types for each discriminant property.
var sourceDiscriminantTypes = new Array(sourcePropertiesFiltered.length);
var excludedProperties = new ts.Set();
for (var i = 0; i < sourcePropertiesFiltered.length; i++) {
var sourceProperty = sourcePropertiesFiltered[i];
var sourcePropertyType = getNonMissingTypeOfSymbol(sourceProperty);
sourceDiscriminantTypes[i] = sourcePropertyType.flags & 1048576 /* Union */
? sourcePropertyType.types
: [sourcePropertyType];
excludedProperties.add(sourceProperty.escapedName);
}
// Match each combination of the cartesian product of discriminant properties to one or more
// constituents of 'target'. If any combination does not have a match then 'source' is not relatable.
var discriminantCombinations = ts.cartesianProduct(sourceDiscriminantTypes);
var matchingTypes = [];
var _loop_19 = function (combination) {
var hasMatch = false;
outer: for (var _c = 0, _d = target.types; _c < _d.length; _c++) {
var type = _d[_c];
var _loop_20 = function (i) {
var sourceProperty = sourcePropertiesFiltered[i];
var targetProperty = getPropertyOfType(type, sourceProperty.escapedName);
if (!targetProperty)
return "continue-outer";
if (sourceProperty === targetProperty)
return "continue";
// We compare the source property to the target in the context of a single discriminant type.
var related = propertyRelatedTo(source, target, sourceProperty, targetProperty, function (_) { return combination[i]; }, /*reportErrors*/ false, 0 /* None */, /*skipOptional*/ strictNullChecks || relation === comparableRelation);
// If the target property could not be found, or if the properties were not related,
// then this constituent is not a match.
if (!related) {
return "continue-outer";
}
};
for (var i = 0; i < sourcePropertiesFiltered.length; i++) {
var state_7 = _loop_20(i);
switch (state_7) {
case "continue-outer": continue outer;
}
}
ts.pushIfUnique(matchingTypes, type, ts.equateValues);
hasMatch = true;
}
if (!hasMatch) {
return { value: 0 /* False */ };
}
};
for (var _a = 0, discriminantCombinations_1 = discriminantCombinations; _a < discriminantCombinations_1.length; _a++) {
var combination = discriminantCombinations_1[_a];
var state_6 = _loop_19(combination);
if (typeof state_6 === "object")
return state_6.value;
}
// Compare the remaining non-discriminant properties of each match.
var result = -1 /* True */;
for (var _b = 0, matchingTypes_1 = matchingTypes; _b < matchingTypes_1.length; _b++) {
var type = matchingTypes_1[_b];
result &= propertiesRelatedTo(source, type, /*reportErrors*/ false, excludedProperties, 0 /* None */);
if (result) {
result &= signaturesRelatedTo(source, type, 0 /* Call */, /*reportStructuralErrors*/ false);
if (result) {
result &= signaturesRelatedTo(source, type, 1 /* Construct */, /*reportStructuralErrors*/ false);
if (result && !(isTupleType(source) && isTupleType(type))) {
// Comparing numeric index types when both `source` and `type` are tuples is unnecessary as the
// element types should be sufficiently covered by `propertiesRelatedTo`. It also causes problems
// with index type assignability as the types for the excluded discriminants are still included
// in the index type.
result &= indexSignaturesRelatedTo(source, type, /*sourceIsPrimitive*/ false, /*reportStructuralErrors*/ false, 0 /* None */);
}
}
}
if (!result) {
return result;
}
}
return result;
}
function excludeProperties(properties, excludedProperties) {
if (!excludedProperties || properties.length === 0)
return properties;
var result;
for (var i = 0; i < properties.length; i++) {
if (!excludedProperties.has(properties[i].escapedName)) {
if (result) {
result.push(properties[i]);
}
}
else if (!result) {
result = properties.slice(0, i);
}
}
return result || properties;
}
function isPropertySymbolTypeRelated(sourceProp, targetProp, getTypeOfSourceProperty, reportErrors, intersectionState) {
var targetIsOptional = strictNullChecks && !!(ts.getCheckFlags(targetProp) & 48 /* Partial */);
var effectiveTarget = addOptionality(getNonMissingTypeOfSymbol(targetProp), /*isProperty*/ false, targetIsOptional);
var effectiveSource = getTypeOfSourceProperty(sourceProp);
return isRelatedTo(effectiveSource, effectiveTarget, reportErrors, /*headMessage*/ undefined, intersectionState);
}
function propertyRelatedTo(source, target, sourceProp, targetProp, getTypeOfSourceProperty, reportErrors, intersectionState, skipOptional) {
var sourcePropFlags = ts.getDeclarationModifierFlagsFromSymbol(sourceProp);
var targetPropFlags = ts.getDeclarationModifierFlagsFromSymbol(targetProp);
if (sourcePropFlags & 8 /* Private */ || targetPropFlags & 8 /* Private */) {
if (sourceProp.valueDeclaration !== targetProp.valueDeclaration) {
if (reportErrors) {
if (sourcePropFlags & 8 /* Private */ && targetPropFlags & 8 /* Private */) {
reportError(ts.Diagnostics.Types_have_separate_declarations_of_a_private_property_0, symbolToString(targetProp));
}
else {
reportError(ts.Diagnostics.Property_0_is_private_in_type_1_but_not_in_type_2, symbolToString(targetProp), typeToString(sourcePropFlags & 8 /* Private */ ? source : target), typeToString(sourcePropFlags & 8 /* Private */ ? target : source));
}
}
return 0 /* False */;
}
}
else if (targetPropFlags & 16 /* Protected */) {
if (!isValidOverrideOf(sourceProp, targetProp)) {
if (reportErrors) {
reportError(ts.Diagnostics.Property_0_is_protected_but_type_1_is_not_a_class_derived_from_2, symbolToString(targetProp), typeToString(getDeclaringClass(sourceProp) || source), typeToString(getDeclaringClass(targetProp) || target));
}
return 0 /* False */;
}
}
else if (sourcePropFlags & 16 /* Protected */) {
if (reportErrors) {
reportError(ts.Diagnostics.Property_0_is_protected_in_type_1_but_public_in_type_2, symbolToString(targetProp), typeToString(source), typeToString(target));
}
return 0 /* False */;
}
// If the target comes from a partial union prop, allow `undefined` in the target type
var related = isPropertySymbolTypeRelated(sourceProp, targetProp, getTypeOfSourceProperty, reportErrors, intersectionState);
if (!related) {
if (reportErrors) {
reportIncompatibleError(ts.Diagnostics.Types_of_property_0_are_incompatible, symbolToString(targetProp));
}
return 0 /* False */;
}
// When checking for comparability, be more lenient with optional properties.
if (!skipOptional && sourceProp.flags & 16777216 /* Optional */ && !(targetProp.flags & 16777216 /* Optional */)) {
// TypeScript 1.0 spec (April 2014): 3.8.3
// S is a subtype of a type T, and T is a supertype of S if ...
// S' and T are object types and, for each member M in T..
// M is a property and S' contains a property N where
// if M is a required property, N is also a required property
// (M - property in T)
// (N - property in S)
if (reportErrors) {
reportError(ts.Diagnostics.Property_0_is_optional_in_type_1_but_required_in_type_2, symbolToString(targetProp), typeToString(source), typeToString(target));
}
return 0 /* False */;
}
return related;
}
function reportUnmatchedProperty(source, target, unmatchedProperty, requireOptionalProperties) {
var shouldSkipElaboration = false;
// give specific error in case where private names have the same description
if (unmatchedProperty.valueDeclaration
&& ts.isNamedDeclaration(unmatchedProperty.valueDeclaration)
&& ts.isPrivateIdentifier(unmatchedProperty.valueDeclaration.name)
&& source.symbol
&& source.symbol.flags & 32 /* Class */) {
var privateIdentifierDescription = unmatchedProperty.valueDeclaration.name.escapedText;
var symbolTableKey = ts.getSymbolNameForPrivateIdentifier(source.symbol, privateIdentifierDescription);
if (symbolTableKey && getPropertyOfType(source, symbolTableKey)) {
var sourceName = ts.factory.getDeclarationName(source.symbol.valueDeclaration);
var targetName = ts.factory.getDeclarationName(target.symbol.valueDeclaration);
reportError(ts.Diagnostics.Property_0_in_type_1_refers_to_a_different_member_that_cannot_be_accessed_from_within_type_2, diagnosticName(privateIdentifierDescription), diagnosticName(sourceName.escapedText === "" ? anon : sourceName), diagnosticName(targetName.escapedText === "" ? anon : targetName));
return;
}
}
var props = ts.arrayFrom(getUnmatchedProperties(source, target, requireOptionalProperties, /*matchDiscriminantProperties*/ false));
if (!headMessage || (headMessage.code !== ts.Diagnostics.Class_0_incorrectly_implements_interface_1.code &&
headMessage.code !== ts.Diagnostics.Class_0_incorrectly_implements_class_1_Did_you_mean_to_extend_1_and_inherit_its_members_as_a_subclass.code)) {
shouldSkipElaboration = true; // Retain top-level error for interface implementing issues, otherwise omit it
}
if (props.length === 1) {
var propName = symbolToString(unmatchedProperty);
reportError.apply(void 0, __spreadArray([ts.Diagnostics.Property_0_is_missing_in_type_1_but_required_in_type_2, propName], getTypeNamesForErrorDisplay(source, target), false));
if (ts.length(unmatchedProperty.declarations)) {
associateRelatedInfo(ts.createDiagnosticForNode(unmatchedProperty.declarations[0], ts.Diagnostics._0_is_declared_here, propName));
}
if (shouldSkipElaboration && errorInfo) {
overrideNextErrorInfo++;
}
}
else if (tryElaborateArrayLikeErrors(source, target, /*reportErrors*/ false)) {
if (props.length > 5) { // arbitrary cutoff for too-long list form
reportError(ts.Diagnostics.Type_0_is_missing_the_following_properties_from_type_1_Colon_2_and_3_more, typeToString(source), typeToString(target), ts.map(props.slice(0, 4), function (p) { return symbolToString(p); }).join(", "), props.length - 4);
}
else {
reportError(ts.Diagnostics.Type_0_is_missing_the_following_properties_from_type_1_Colon_2, typeToString(source), typeToString(target), ts.map(props, function (p) { return symbolToString(p); }).join(", "));
}
if (shouldSkipElaboration && errorInfo) {
overrideNextErrorInfo++;
}
}
// No array like or unmatched property error - just issue top level error (errorInfo = undefined)
}
function propertiesRelatedTo(source, target, reportErrors, excludedProperties, intersectionState) {
if (relation === identityRelation) {
return propertiesIdenticalTo(source, target, excludedProperties);
}
var result = -1 /* True */;
if (isTupleType(target)) {
if (isArrayType(source) || isTupleType(source)) {
if (!target.target.readonly && (isReadonlyArrayType(source) || isTupleType(source) && source.target.readonly)) {
return 0 /* False */;
}
var sourceArity = getTypeReferenceArity(source);
var targetArity = getTypeReferenceArity(target);
var sourceRestFlag = isTupleType(source) ? source.target.combinedFlags & 4 /* Rest */ : 4 /* Rest */;
var targetRestFlag = target.target.combinedFlags & 4 /* Rest */;
var sourceMinLength = isTupleType(source) ? source.target.minLength : 0;
var targetMinLength = target.target.minLength;
if (!sourceRestFlag && sourceArity < targetMinLength) {
if (reportErrors) {
reportError(ts.Diagnostics.Source_has_0_element_s_but_target_requires_1, sourceArity, targetMinLength);
}
return 0 /* False */;
}
if (!targetRestFlag && targetArity < sourceMinLength) {
if (reportErrors) {
reportError(ts.Diagnostics.Source_has_0_element_s_but_target_allows_only_1, sourceMinLength, targetArity);
}
return 0 /* False */;
}
if (!targetRestFlag && (sourceRestFlag || targetArity < sourceArity)) {
if (reportErrors) {
if (sourceMinLength < targetMinLength) {
reportError(ts.Diagnostics.Target_requires_0_element_s_but_source_may_have_fewer, targetMinLength);
}
else {
reportError(ts.Diagnostics.Target_allows_only_0_element_s_but_source_may_have_more, targetArity);
}
}
return 0 /* False */;
}
var sourceTypeArguments = getTypeArguments(source);
var targetTypeArguments = getTypeArguments(target);
var startCount = Math.min(isTupleType(source) ? getStartElementCount(source.target, 11 /* NonRest */) : 0, getStartElementCount(target.target, 11 /* NonRest */));
var endCount = Math.min(isTupleType(source) ? getEndElementCount(source.target, 11 /* NonRest */) : 0, targetRestFlag ? getEndElementCount(target.target, 11 /* NonRest */) : 0);
var canExcludeDiscriminants = !!excludedProperties;
for (var i = 0; i < targetArity; i++) {
var sourceIndex = i < targetArity - endCount ? i : i + sourceArity - targetArity;
var sourceFlags = isTupleType(source) && (i < startCount || i >= targetArity - endCount) ? source.target.elementFlags[sourceIndex] : 4 /* Rest */;
var targetFlags = target.target.elementFlags[i];
if (targetFlags & 8 /* Variadic */ && !(sourceFlags & 8 /* Variadic */)) {
if (reportErrors) {
reportError(ts.Diagnostics.Source_provides_no_match_for_variadic_element_at_position_0_in_target, i);
}
return 0 /* False */;
}
if (sourceFlags & 8 /* Variadic */ && !(targetFlags & 12 /* Variable */)) {
if (reportErrors) {
reportError(ts.Diagnostics.Variadic_element_at_position_0_in_source_does_not_match_element_at_position_1_in_target, sourceIndex, i);
}
return 0 /* False */;
}
if (targetFlags & 1 /* Required */ && !(sourceFlags & 1 /* Required */)) {
if (reportErrors) {
reportError(ts.Diagnostics.Source_provides_no_match_for_required_element_at_position_0_in_target, i);
}
return 0 /* False */;
}
// We can only exclude discriminant properties if we have not yet encountered a variable-length element.
if (canExcludeDiscriminants) {
if (sourceFlags & 12 /* Variable */ || targetFlags & 12 /* Variable */) {
canExcludeDiscriminants = false;
}
if (canExcludeDiscriminants && (excludedProperties === null || excludedProperties === void 0 ? void 0 : excludedProperties.has(("" + i)))) {
continue;
}
}
var sourceType = !isTupleType(source) ? sourceTypeArguments[0] :
i < startCount || i >= targetArity - endCount ? removeMissingType(sourceTypeArguments[sourceIndex], !!(sourceFlags & targetFlags & 2 /* Optional */)) :
getElementTypeOfSliceOfTupleType(source, startCount, endCount) || neverType;
var targetType = targetTypeArguments[i];
var targetCheckType = sourceFlags & 8 /* Variadic */ && targetFlags & 4 /* Rest */ ? createArrayType(targetType) :
removeMissingType(targetType, !!(targetFlags & 2 /* Optional */));
var related = isRelatedTo(sourceType, targetCheckType, reportErrors, /*headMessage*/ undefined, intersectionState);
if (!related) {
if (reportErrors && (targetArity > 1 || sourceArity > 1)) {
if (i < startCount || i >= targetArity - endCount || sourceArity - startCount - endCount === 1) {
reportIncompatibleError(ts.Diagnostics.Type_at_position_0_in_source_is_not_compatible_with_type_at_position_1_in_target, sourceIndex, i);
}
else {
reportIncompatibleError(ts.Diagnostics.Type_at_positions_0_through_1_in_source_is_not_compatible_with_type_at_position_2_in_target, startCount, sourceArity - endCount - 1, i);
}
}
return 0 /* False */;
}
result &= related;
}
return result;
}
if (target.target.combinedFlags & 12 /* Variable */) {
return 0 /* False */;
}
}
var requireOptionalProperties = (relation === subtypeRelation || relation === strictSubtypeRelation) && !isObjectLiteralType(source) && !isEmptyArrayLiteralType(source) && !isTupleType(source);
var unmatchedProperty = getUnmatchedProperty(source, target, requireOptionalProperties, /*matchDiscriminantProperties*/ false);
if (unmatchedProperty) {
if (reportErrors) {
reportUnmatchedProperty(source, target, unmatchedProperty, requireOptionalProperties);
}
return 0 /* False */;
}
if (isObjectLiteralType(target)) {
for (var _i = 0, _a = excludeProperties(getPropertiesOfType(source), excludedProperties); _i < _a.length; _i++) {
var sourceProp = _a[_i];
if (!getPropertyOfObjectType(target, sourceProp.escapedName)) {
var sourceType = getTypeOfSymbol(sourceProp);
if (!(sourceType.flags & 32768 /* Undefined */)) {
if (reportErrors) {
reportError(ts.Diagnostics.Property_0_does_not_exist_on_type_1, symbolToString(sourceProp), typeToString(target));
}
return 0 /* False */;
}
}
}
}
// We only call this for union target types when we're attempting to do excess property checking - in those cases, we want to get _all possible props_
// from the target union, across all members
var properties = getPropertiesOfType(target);
var numericNamesOnly = isTupleType(source) && isTupleType(target);
for (var _b = 0, _c = excludeProperties(properties, excludedProperties); _b < _c.length; _b++) {
var targetProp = _c[_b];
var name = targetProp.escapedName;
if (!(targetProp.flags & 4194304 /* Prototype */) && (!numericNamesOnly || isNumericLiteralName(name) || name === "length")) {
var sourceProp = getPropertyOfType(source, name);
if (sourceProp && sourceProp !== targetProp) {
var related = propertyRelatedTo(source, target, sourceProp, targetProp, getNonMissingTypeOfSymbol, reportErrors, intersectionState, relation === comparableRelation);
if (!related) {
return 0 /* False */;
}
result &= related;
}
}
}
return result;
}
function propertiesIdenticalTo(source, target, excludedProperties) {
if (!(source.flags & 524288 /* Object */ && target.flags & 524288 /* Object */)) {
return 0 /* False */;
}
var sourceProperties = excludeProperties(getPropertiesOfObjectType(source), excludedProperties);
var targetProperties = excludeProperties(getPropertiesOfObjectType(target), excludedProperties);
if (sourceProperties.length !== targetProperties.length) {
return 0 /* False */;
}
var result = -1 /* True */;
for (var _i = 0, sourceProperties_1 = sourceProperties; _i < sourceProperties_1.length; _i++) {
var sourceProp = sourceProperties_1[_i];
var targetProp = getPropertyOfObjectType(target, sourceProp.escapedName);
if (!targetProp) {
return 0 /* False */;
}
var related = compareProperties(sourceProp, targetProp, isRelatedTo);
if (!related) {
return 0 /* False */;
}
result &= related;
}
return result;
}
function signaturesRelatedTo(source, target, kind, reportErrors) {
var _a, _b;
if (relation === identityRelation) {
return signaturesIdenticalTo(source, target, kind);
}
if (target === anyFunctionType || source === anyFunctionType) {
return -1 /* True */;
}
var sourceIsJSConstructor = source.symbol && isJSConstructor(source.symbol.valueDeclaration);
var targetIsJSConstructor = target.symbol && isJSConstructor(target.symbol.valueDeclaration);
var sourceSignatures = getSignaturesOfType(source, (sourceIsJSConstructor && kind === 1 /* Construct */) ?
0 /* Call */ : kind);
var targetSignatures = getSignaturesOfType(target, (targetIsJSConstructor && kind === 1 /* Construct */) ?
0 /* Call */ : kind);
if (kind === 1 /* Construct */ && sourceSignatures.length && targetSignatures.length) {
var sourceIsAbstract = !!(sourceSignatures[0].flags & 4 /* Abstract */);
var targetIsAbstract = !!(targetSignatures[0].flags & 4 /* Abstract */);
if (sourceIsAbstract && !targetIsAbstract) {
// An abstract constructor type is not assignable to a non-abstract constructor type
// as it would otherwise be possible to new an abstract class. Note that the assignability
// check we perform for an extends clause excludes construct signatures from the target,
// so this check never proceeds.
if (reportErrors) {
reportError(ts.Diagnostics.Cannot_assign_an_abstract_constructor_type_to_a_non_abstract_constructor_type);
}
return 0 /* False */;
}
if (!constructorVisibilitiesAreCompatible(sourceSignatures[0], targetSignatures[0], reportErrors)) {
return 0 /* False */;
}
}
var result = -1 /* True */;
var saveErrorInfo = captureErrorCalculationState();
var incompatibleReporter = kind === 1 /* Construct */ ? reportIncompatibleConstructSignatureReturn : reportIncompatibleCallSignatureReturn;
var sourceObjectFlags = ts.getObjectFlags(source);
var targetObjectFlags = ts.getObjectFlags(target);
if (sourceObjectFlags & 64 /* Instantiated */ && targetObjectFlags & 64 /* Instantiated */ && source.symbol === target.symbol) {
// We have instantiations of the same anonymous type (which typically will be the type of a
// method). Simply do a pairwise comparison of the signatures in the two signature lists instead
// of the much more expensive N * M comparison matrix we explore below. We erase type parameters
// as they are known to always be the same.
for (var i = 0; i < targetSignatures.length; i++) {
var related = signatureRelatedTo(sourceSignatures[i], targetSignatures[i], /*erase*/ true, reportErrors, incompatibleReporter(sourceSignatures[i], targetSignatures[i]));
if (!related) {
return 0 /* False */;
}
result &= related;
}
}
else if (sourceSignatures.length === 1 && targetSignatures.length === 1) {
// For simple functions (functions with a single signature) we only erase type parameters for
// the comparable relation. Otherwise, if the source signature is generic, we instantiate it
// in the context of the target signature before checking the relationship. Ideally we'd do
// this regardless of the number of signatures, but the potential costs are prohibitive due
// to the quadratic nature of the logic below.
var eraseGenerics = relation === comparableRelation || !!compilerOptions.noStrictGenericChecks;
var sourceSignature = ts.first(sourceSignatures);
var targetSignature = ts.first(targetSignatures);
result = signatureRelatedTo(sourceSignature, targetSignature, eraseGenerics, reportErrors, incompatibleReporter(sourceSignature, targetSignature));
if (!result && reportErrors && kind === 1 /* Construct */ && (sourceObjectFlags & targetObjectFlags) &&
(((_a = targetSignature.declaration) === null || _a === void 0 ? void 0 : _a.kind) === 169 /* Constructor */ || ((_b = sourceSignature.declaration) === null || _b === void 0 ? void 0 : _b.kind) === 169 /* Constructor */)) {
var constructSignatureToString = function (signature) {
return signatureToString(signature, /*enclosingDeclaration*/ undefined, 262144 /* WriteArrowStyleSignature */, kind);
};
reportError(ts.Diagnostics.Type_0_is_not_assignable_to_type_1, constructSignatureToString(sourceSignature), constructSignatureToString(targetSignature));
reportError(ts.Diagnostics.Types_of_construct_signatures_are_incompatible);
return result;
}
}
else {
outer: for (var _i = 0, targetSignatures_1 = targetSignatures; _i < targetSignatures_1.length; _i++) {
var t = targetSignatures_1[_i];
// Only elaborate errors from the first failure
var shouldElaborateErrors = reportErrors;
for (var _c = 0, sourceSignatures_1 = sourceSignatures; _c < sourceSignatures_1.length; _c++) {
var s = sourceSignatures_1[_c];
var related = signatureRelatedTo(s, t, /*erase*/ true, shouldElaborateErrors, incompatibleReporter(s, t));
if (related) {
result &= related;
resetErrorInfo(saveErrorInfo);
continue outer;
}
shouldElaborateErrors = false;
}
if (shouldElaborateErrors) {
reportError(ts.Diagnostics.Type_0_provides_no_match_for_the_signature_1, typeToString(source), signatureToString(t, /*enclosingDeclaration*/ undefined, /*flags*/ undefined, kind));
}
return 0 /* False */;
}
}
return result;
}
function reportIncompatibleCallSignatureReturn(siga, sigb) {
if (siga.parameters.length === 0 && sigb.parameters.length === 0) {
return function (source, target) { return reportIncompatibleError(ts.Diagnostics.Call_signatures_with_no_arguments_have_incompatible_return_types_0_and_1, typeToString(source), typeToString(target)); };
}
return function (source, target) { return reportIncompatibleError(ts.Diagnostics.Call_signature_return_types_0_and_1_are_incompatible, typeToString(source), typeToString(target)); };
}
function reportIncompatibleConstructSignatureReturn(siga, sigb) {
if (siga.parameters.length === 0 && sigb.parameters.length === 0) {
return function (source, target) { return reportIncompatibleError(ts.Diagnostics.Construct_signatures_with_no_arguments_have_incompatible_return_types_0_and_1, typeToString(source), typeToString(target)); };
}
return function (source, target) { return reportIncompatibleError(ts.Diagnostics.Construct_signature_return_types_0_and_1_are_incompatible, typeToString(source), typeToString(target)); };
}
/**
* See signatureAssignableTo, compareSignaturesIdentical
*/
function signatureRelatedTo(source, target, erase, reportErrors, incompatibleReporter) {
return compareSignaturesRelated(erase ? getErasedSignature(source) : source, erase ? getErasedSignature(target) : target, relation === strictSubtypeRelation ? 8 /* StrictArity */ : 0, reportErrors, reportError, incompatibleReporter, isRelatedTo, makeFunctionTypeMapper(reportUnreliableMarkers));
}
function signaturesIdenticalTo(source, target, kind) {
var sourceSignatures = getSignaturesOfType(source, kind);
var targetSignatures = getSignaturesOfType(target, kind);
if (sourceSignatures.length !== targetSignatures.length) {
return 0 /* False */;
}
var result = -1 /* True */;
for (var i = 0; i < sourceSignatures.length; i++) {
var related = compareSignaturesIdentical(sourceSignatures[i], targetSignatures[i], /*partialMatch*/ false, /*ignoreThisTypes*/ false, /*ignoreReturnTypes*/ false, isRelatedTo);
if (!related) {
return 0 /* False */;
}
result &= related;
}
return result;
}
function membersRelatedToIndexInfo(source, targetInfo, reportErrors) {
var result = -1 /* True */;
var keyType = targetInfo.keyType;
var props = source.flags & 2097152 /* Intersection */ ? getPropertiesOfUnionOrIntersectionType(source) : getPropertiesOfObjectType(source);
for (var _i = 0, props_2 = props; _i < props_2.length; _i++) {
var prop = props_2[_i];
// Skip over ignored JSX and symbol-named members
if (isIgnoredJsxProperty(source, prop)) {
continue;
}
if (isApplicableIndexType(getLiteralTypeFromProperty(prop, 8576 /* StringOrNumberLiteralOrUnique */), keyType)) {
var propType = getNonMissingTypeOfSymbol(prop);
var type = exactOptionalPropertyTypes || propType.flags & 32768 /* Undefined */ || keyType === numberType || !(prop.flags & 16777216 /* Optional */)
? propType
: getTypeWithFacts(propType, 524288 /* NEUndefined */);
var related = isRelatedTo(type, targetInfo.type, reportErrors);
if (!related) {
if (reportErrors) {
reportError(ts.Diagnostics.Property_0_is_incompatible_with_index_signature, symbolToString(prop));
}
return 0 /* False */;
}
result &= related;
}
}
for (var _a = 0, _b = getIndexInfosOfType(source); _a < _b.length; _a++) {
var info = _b[_a];
if (isApplicableIndexType(info.keyType, keyType)) {
var related = indexInfoRelatedTo(info, targetInfo, reportErrors);
if (!related) {
return 0 /* False */;
}
result &= related;
}
}
return result;
}
function indexInfoRelatedTo(sourceInfo, targetInfo, reportErrors) {
var related = isRelatedTo(sourceInfo.type, targetInfo.type, reportErrors);
if (!related && reportErrors) {
if (sourceInfo.keyType === targetInfo.keyType) {
reportError(ts.Diagnostics._0_index_signatures_are_incompatible, typeToString(sourceInfo.keyType));
}
else {
reportError(ts.Diagnostics._0_and_1_index_signatures_are_incompatible, typeToString(sourceInfo.keyType), typeToString(targetInfo.keyType));
}
}
return related;
}
function indexSignaturesRelatedTo(source, target, sourceIsPrimitive, reportErrors, intersectionState) {
if (relation === identityRelation) {
return indexSignaturesIdenticalTo(source, target);
}
var indexInfos = getIndexInfosOfType(target);
var targetHasStringIndex = ts.some(indexInfos, function (info) { return info.keyType === stringType; });
var result = -1 /* True */;
for (var _i = 0, indexInfos_3 = indexInfos; _i < indexInfos_3.length; _i++) {
var targetInfo = indexInfos_3[_i];
var related = !sourceIsPrimitive && targetHasStringIndex && targetInfo.type.flags & 1 /* Any */ ? -1 /* True */ :
isGenericMappedType(source) && targetHasStringIndex ? isRelatedTo(getTemplateTypeFromMappedType(source), targetInfo.type, reportErrors) :
typeRelatedToIndexInfo(source, targetInfo, reportErrors, intersectionState);
if (!related) {
return 0 /* False */;
}
result &= related;
}
return result;
}
function typeRelatedToIndexInfo(source, targetInfo, reportErrors, intersectionState) {
var sourceInfo = getApplicableIndexInfo(source, targetInfo.keyType);
if (sourceInfo) {
return indexInfoRelatedTo(sourceInfo, targetInfo, reportErrors);
}
if (!(intersectionState & 1 /* Source */) && isObjectTypeWithInferableIndex(source)) {
// Intersection constituents are never considered to have an inferred index signature
return membersRelatedToIndexInfo(source, targetInfo, reportErrors);
}
if (reportErrors) {
reportError(ts.Diagnostics.Index_signature_for_type_0_is_missing_in_type_1, typeToString(targetInfo.keyType), typeToString(source));
}
return 0 /* False */;
}
function indexSignaturesIdenticalTo(source, target) {
var sourceInfos = getIndexInfosOfType(source);
var targetInfos = getIndexInfosOfType(target);
if (sourceInfos.length !== targetInfos.length) {
return 0 /* False */;
}
for (var _i = 0, targetInfos_1 = targetInfos; _i < targetInfos_1.length; _i++) {
var targetInfo = targetInfos_1[_i];
var sourceInfo = getIndexInfoOfType(source, targetInfo.keyType);
if (!(sourceInfo && isRelatedTo(sourceInfo.type, targetInfo.type) && sourceInfo.isReadonly === targetInfo.isReadonly)) {
return 0 /* False */;
}
}
return -1 /* True */;
}
function constructorVisibilitiesAreCompatible(sourceSignature, targetSignature, reportErrors) {
if (!sourceSignature.declaration || !targetSignature.declaration) {
return true;
}
var sourceAccessibility = ts.getSelectedEffectiveModifierFlags(sourceSignature.declaration, 24 /* NonPublicAccessibilityModifier */);
var targetAccessibility = ts.getSelectedEffectiveModifierFlags(targetSignature.declaration, 24 /* NonPublicAccessibilityModifier */);
// A public, protected and private signature is assignable to a private signature.
if (targetAccessibility === 8 /* Private */) {
return true;
}
// A public and protected signature is assignable to a protected signature.
if (targetAccessibility === 16 /* Protected */ && sourceAccessibility !== 8 /* Private */) {
return true;
}
// Only a public signature is assignable to public signature.
if (targetAccessibility !== 16 /* Protected */ && !sourceAccessibility) {
return true;
}
if (reportErrors) {
reportError(ts.Diagnostics.Cannot_assign_a_0_constructor_type_to_a_1_constructor_type, visibilityToString(sourceAccessibility), visibilityToString(targetAccessibility));
}
return false;
}
}
function typeCouldHaveTopLevelSingletonTypes(type) {
// Okay, yes, 'boolean' is a union of 'true | false', but that's not useful
// in error reporting scenarios. If you need to use this function but that detail matters,
// feel free to add a flag.
if (type.flags & 16 /* Boolean */) {
return false;
}
if (type.flags & 3145728 /* UnionOrIntersection */) {
return !!ts.forEach(type.types, typeCouldHaveTopLevelSingletonTypes);
}
if (type.flags & 465829888 /* Instantiable */) {
var constraint = getConstraintOfType(type);
if (constraint && constraint !== type) {
return typeCouldHaveTopLevelSingletonTypes(constraint);
}
}
return isUnitType(type) || !!(type.flags & 134217728 /* TemplateLiteral */);
}
function getBestMatchingType(source, target, isRelatedTo) {
if (isRelatedTo === void 0) { isRelatedTo = compareTypesAssignable; }
return findMatchingDiscriminantType(source, target, isRelatedTo, /*skipPartial*/ true) ||
findMatchingTypeReferenceOrTypeAliasReference(source, target) ||
findBestTypeForObjectLiteral(source, target) ||
findBestTypeForInvokable(source, target) ||
findMostOverlappyType(source, target);
}
function discriminateTypeByDiscriminableItems(target, discriminators, related, defaultValue, skipPartial) {
// undefined=unknown, true=discriminated, false=not discriminated
// The state of each type progresses from left to right. Discriminated types stop at 'true'.
var discriminable = target.types.map(function (_) { return undefined; });
for (var _i = 0, discriminators_1 = discriminators; _i < discriminators_1.length; _i++) {
var _a = discriminators_1[_i], getDiscriminatingType = _a[0], propertyName = _a[1];
var targetProp = getUnionOrIntersectionProperty(target, propertyName);
if (skipPartial && targetProp && ts.getCheckFlags(targetProp) & 16 /* ReadPartial */) {
continue;
}
var i = 0;
for (var _b = 0, _c = target.types; _b < _c.length; _b++) {
var type = _c[_b];
var targetType = getTypeOfPropertyOfType(type, propertyName);
if (targetType && related(getDiscriminatingType(), targetType)) {
discriminable[i] = discriminable[i] === undefined ? true : discriminable[i];
}
else {
discriminable[i] = false;
}
i++;
}
}
var match = discriminable.indexOf(/*searchElement*/ true);
if (match === -1) {
return defaultValue;
}
// make sure exactly 1 matches before returning it
var nextMatch = discriminable.indexOf(/*searchElement*/ true, match + 1);
while (nextMatch !== -1) {
if (!isTypeIdenticalTo(target.types[match], target.types[nextMatch])) {
return defaultValue;
}
nextMatch = discriminable.indexOf(/*searchElement*/ true, nextMatch + 1);
}
return target.types[match];
}
/**
* A type is 'weak' if it is an object type with at least one optional property
* and no required properties, call/construct signatures or index signatures
*/
function isWeakType(type) {
if (type.flags & 524288 /* Object */) {
var resolved = resolveStructuredTypeMembers(type);
return resolved.callSignatures.length === 0 && resolved.constructSignatures.length === 0 && resolved.indexInfos.length === 0 &&
resolved.properties.length > 0 && ts.every(resolved.properties, function (p) { return !!(p.flags & 16777216 /* Optional */); });
}
if (type.flags & 2097152 /* Intersection */) {
return ts.every(type.types, isWeakType);
}
return false;
}
function hasCommonProperties(source, target, isComparingJsxAttributes) {
for (var _i = 0, _a = getPropertiesOfType(source); _i < _a.length; _i++) {
var prop = _a[_i];
if (isKnownProperty(target, prop.escapedName, isComparingJsxAttributes)) {
return true;
}
}
return false;
}
// Return a type reference where the source type parameter is replaced with the target marker
// type, and flag the result as a marker type reference.
function getMarkerTypeReference(type, source, target) {
var result = createTypeReference(type, ts.map(type.typeParameters, function (t) { return t === source ? target : t; }));
result.objectFlags |= 4096 /* MarkerType */;
return result;
}
function getAliasVariances(symbol) {
var links = getSymbolLinks(symbol);
return getVariancesWorker(links.typeParameters, links, function (_links, param, marker) {
var type = getTypeAliasInstantiation(symbol, instantiateTypes(links.typeParameters, makeUnaryTypeMapper(param, marker)));
type.aliasTypeArgumentsContainsMarker = true;
return type;
});
}
// Return an array containing the variance of each type parameter. The variance is effectively
// a digest of the type comparisons that occur for each type argument when instantiations of the
// generic type are structurally compared. We infer the variance information by comparing
// instantiations of the generic type for type arguments with known relations. The function
// returns the emptyArray singleton when invoked recursively for the given generic type.
function getVariancesWorker(typeParameters, cache, createMarkerType) {
var _a, _b, _c;
if (typeParameters === void 0) { typeParameters = ts.emptyArray; }
var variances = cache.variances;
if (!variances) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("checkTypes" /* CheckTypes */, "getVariancesWorker", { arity: typeParameters.length, id: (_c = (_a = cache.id) !== null && _a !== void 0 ? _a : (_b = cache.declaredType) === null || _b === void 0 ? void 0 : _b.id) !== null && _c !== void 0 ? _c : -1 });
// The emptyArray singleton is used to signal a recursive invocation.
cache.variances = ts.emptyArray;
variances = [];
var _loop_21 = function (tp) {
var unmeasurable = false;
var unreliable = false;
var oldHandler = outofbandVarianceMarkerHandler;
outofbandVarianceMarkerHandler = function (onlyUnreliable) { return onlyUnreliable ? unreliable = true : unmeasurable = true; };
// We first compare instantiations where the type parameter is replaced with
// marker types that have a known subtype relationship. From this we can infer
// invariance, covariance, contravariance or bivariance.
var typeWithSuper = createMarkerType(cache, tp, markerSuperType);
var typeWithSub = createMarkerType(cache, tp, markerSubType);
var variance = (isTypeAssignableTo(typeWithSub, typeWithSuper) ? 1 /* Covariant */ : 0) |
(isTypeAssignableTo(typeWithSuper, typeWithSub) ? 2 /* Contravariant */ : 0);
// If the instantiations appear to be related bivariantly it may be because the
// type parameter is independent (i.e. it isn't witnessed anywhere in the generic
// type). To determine this we compare instantiations where the type parameter is
// replaced with marker types that are known to be unrelated.
if (variance === 3 /* Bivariant */ && isTypeAssignableTo(createMarkerType(cache, tp, markerOtherType), typeWithSuper)) {
variance = 4 /* Independent */;
}
outofbandVarianceMarkerHandler = oldHandler;
if (unmeasurable || unreliable) {
if (unmeasurable) {
variance |= 8 /* Unmeasurable */;
}
if (unreliable) {
variance |= 16 /* Unreliable */;
}
}
variances.push(variance);
};
for (var _i = 0, typeParameters_1 = typeParameters; _i < typeParameters_1.length; _i++) {
var tp = typeParameters_1[_i];
_loop_21(tp);
}
cache.variances = variances;
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
}
return variances;
}
function getVariances(type) {
// Arrays and tuples are known to be covariant, no need to spend time computing this.
if (type === globalArrayType || type === globalReadonlyArrayType || type.objectFlags & 8 /* Tuple */) {
return arrayVariances;
}
return getVariancesWorker(type.typeParameters, type, getMarkerTypeReference);
}
// Return true if the given type reference has a 'void' type argument for a covariant type parameter.
// See comment at call in recursiveTypeRelatedTo for when this case matters.
function hasCovariantVoidArgument(typeArguments, variances) {
for (var i = 0; i < variances.length; i++) {
if ((variances[i] & 7 /* VarianceMask */) === 1 /* Covariant */ && typeArguments[i].flags & 16384 /* Void */) {
return true;
}
}
return false;
}
function isUnconstrainedTypeParameter(type) {
return type.flags & 262144 /* TypeParameter */ && !getConstraintOfTypeParameter(type);
}
function isNonDeferredTypeReference(type) {
return !!(ts.getObjectFlags(type) & 4 /* Reference */) && !type.node;
}
function isTypeReferenceWithGenericArguments(type) {
return isNonDeferredTypeReference(type) && ts.some(getTypeArguments(type), function (t) { return !!(t.flags & 262144 /* TypeParameter */) || isTypeReferenceWithGenericArguments(t); });
}
/**
* getTypeReferenceId(A<T, number, U>) returns "111=0-12=1"
* where A.id=111 and number.id=12
*/
function getTypeReferenceId(type, typeParameters, depth) {
if (depth === void 0) { depth = 0; }
var result = "" + type.target.id;
for (var _i = 0, _a = getTypeArguments(type); _i < _a.length; _i++) {
var t = _a[_i];
if (isUnconstrainedTypeParameter(t)) {
var index = typeParameters.indexOf(t);
if (index < 0) {
index = typeParameters.length;
typeParameters.push(t);
}
result += "=" + index;
}
else if (depth < 4 && isTypeReferenceWithGenericArguments(t)) {
result += "<" + getTypeReferenceId(t, typeParameters, depth + 1) + ">";
}
else {
result += "-" + t.id;
}
}
return result;
}
/**
* To improve caching, the relation key for two generic types uses the target's id plus ids of the type parameters.
* For other cases, the types ids are used.
*/
function getRelationKey(source, target, intersectionState, relation) {
if (relation === identityRelation && source.id > target.id) {
var temp = source;
source = target;
target = temp;
}
var postFix = intersectionState ? ":" + intersectionState : "";
if (isTypeReferenceWithGenericArguments(source) && isTypeReferenceWithGenericArguments(target)) {
var typeParameters = [];
return getTypeReferenceId(source, typeParameters) + "," + getTypeReferenceId(target, typeParameters) + postFix;
}
return source.id + "," + target.id + postFix;
}
// Invoke the callback for each underlying property symbol of the given symbol and return the first
// value that isn't undefined.
function forEachProperty(prop, callback) {
if (ts.getCheckFlags(prop) & 6 /* Synthetic */) {
for (var _i = 0, _a = prop.containingType.types; _i < _a.length; _i++) {
var t = _a[_i];
var p = getPropertyOfType(t, prop.escapedName);
var result = p && forEachProperty(p, callback);
if (result) {
return result;
}
}
return undefined;
}
return callback(prop);
}
// Return the declaring class type of a property or undefined if property not declared in class
function getDeclaringClass(prop) {
return prop.parent && prop.parent.flags & 32 /* Class */ ? getDeclaredTypeOfSymbol(getParentOfSymbol(prop)) : undefined;
}
// Return the inherited type of the given property or undefined if property doesn't exist in a base class.
function getTypeOfPropertyInBaseClass(property) {
var classType = getDeclaringClass(property);
var baseClassType = classType && getBaseTypes(classType)[0];
return baseClassType && getTypeOfPropertyOfType(baseClassType, property.escapedName);
}
// Return true if some underlying source property is declared in a class that derives
// from the given base class.
function isPropertyInClassDerivedFrom(prop, baseClass) {
return forEachProperty(prop, function (sp) {
var sourceClass = getDeclaringClass(sp);
return sourceClass ? hasBaseType(sourceClass, baseClass) : false;
});
}
// Return true if source property is a valid override of protected parts of target property.
function isValidOverrideOf(sourceProp, targetProp) {
return !forEachProperty(targetProp, function (tp) { return ts.getDeclarationModifierFlagsFromSymbol(tp) & 16 /* Protected */ ?
!isPropertyInClassDerivedFrom(sourceProp, getDeclaringClass(tp)) : false; });
}
// Return true if the given class derives from each of the declaring classes of the protected
// constituents of the given property.
function isClassDerivedFromDeclaringClasses(checkClass, prop, writing) {
return forEachProperty(prop, function (p) { return ts.getDeclarationModifierFlagsFromSymbol(p, writing) & 16 /* Protected */ ?
!hasBaseType(checkClass, getDeclaringClass(p)) : false; }) ? undefined : checkClass;
}
// Return true if the given type is deeply nested. We consider this to be the case when structural type comparisons
// for 5 or more occurrences or instantiations of the type have been recorded on the given stack. It is possible,
// though highly unlikely, for this test to be true in a situation where a chain of instantiations is not infinitely
// expanding. Effectively, we will generate a false positive when two types are structurally equal to at least 5
// levels, but unequal at some level beyond that.
// In addition, this will also detect when an indexed access has been chained off of 5 or more times (which is essentially
// the dual of the structural comparison), and likewise mark the type as deeply nested, potentially adding false positives
// for finite but deeply expanding indexed accesses (eg, for `Q[P1][P2][P3][P4][P5]`).
// It also detects when a recursive type reference has expanded 5 or more times, eg, if the true branch of
// `type A<T> = null extends T ? [A<NonNullable<T>>] : [T]`
// has expanded into `[A<NonNullable<NonNullable<NonNullable<NonNullable<NonNullable<T>>>>>>]`
// in such cases we need to terminate the expansion, and we do so here.
function isDeeplyNestedType(type, stack, depth) {
if (depth >= 5) {
var identity_1 = getRecursionIdentity(type);
var count = 0;
for (var i = 0; i < depth; i++) {
if (getRecursionIdentity(stack[i]) === identity_1) {
count++;
if (count >= 5) {
return true;
}
}
}
}
return false;
}
// The recursion identity of a type is an object identity that is shared among multiple instantiations of the type.
// We track recursion identities in order to identify deeply nested and possibly infinite type instantiations with
// the same origin. For example, when type parameters are in scope in an object type such as { x: T }, all
// instantiations of that type have the same recursion identity. The default recursion identity is the object
// identity of the type, meaning that every type is unique. Generally, types with constituents that could circularly
// reference the type have a recursion identity that differs from the object identity.
function getRecursionIdentity(type) {
// Object and array literals are known not to contain recursive references and don't need a recursion identity.
if (type.flags & 524288 /* Object */ && !isObjectOrArrayLiteralType(type)) {
if (ts.getObjectFlags(type) && 4 /* Reference */ && type.node) {
// Deferred type references are tracked through their associated AST node. This gives us finer
// granularity than using their associated target because each manifest type reference has a
// unique AST node.
return type.node;
}
if (type.symbol && !(ts.getObjectFlags(type) & 16 /* Anonymous */ && type.symbol.flags & 32 /* Class */)) {
// We track all object types that have an associated symbol (representing the origin of the type), but
// exclude the static side of classes from this check since it shares its symbol with the instance side.
return type.symbol;
}
if (isTupleType(type)) {
// Tuple types are tracked through their target type
return type.target;
}
}
if (type.flags & 262144 /* TypeParameter */) {
return type.symbol;
}
if (type.flags & 8388608 /* IndexedAccess */) {
// Identity is the leftmost object type in a chain of indexed accesses, eg, in A[P][Q] it is A
do {
type = type.objectType;
} while (type.flags & 8388608 /* IndexedAccess */);
return type;
}
if (type.flags & 16777216 /* Conditional */) {
// The root object represents the origin of the conditional type
return type.root;
}
return type;
}
function isPropertyIdenticalTo(sourceProp, targetProp) {
return compareProperties(sourceProp, targetProp, compareTypesIdentical) !== 0 /* False */;
}
function compareProperties(sourceProp, targetProp, compareTypes) {
// Two members are considered identical when
// - they are public properties with identical names, optionality, and types,
// - they are private or protected properties originating in the same declaration and having identical types
if (sourceProp === targetProp) {
return -1 /* True */;
}
var sourcePropAccessibility = ts.getDeclarationModifierFlagsFromSymbol(sourceProp) & 24 /* NonPublicAccessibilityModifier */;
var targetPropAccessibility = ts.getDeclarationModifierFlagsFromSymbol(targetProp) & 24 /* NonPublicAccessibilityModifier */;
if (sourcePropAccessibility !== targetPropAccessibility) {
return 0 /* False */;
}
if (sourcePropAccessibility) {
if (getTargetSymbol(sourceProp) !== getTargetSymbol(targetProp)) {
return 0 /* False */;
}
}
else {
if ((sourceProp.flags & 16777216 /* Optional */) !== (targetProp.flags & 16777216 /* Optional */)) {
return 0 /* False */;
}
}
if (isReadonlySymbol(sourceProp) !== isReadonlySymbol(targetProp)) {
return 0 /* False */;
}
return compareTypes(getTypeOfSymbol(sourceProp), getTypeOfSymbol(targetProp));
}
function isMatchingSignature(source, target, partialMatch) {
var sourceParameterCount = getParameterCount(source);
var targetParameterCount = getParameterCount(target);
var sourceMinArgumentCount = getMinArgumentCount(source);
var targetMinArgumentCount = getMinArgumentCount(target);
var sourceHasRestParameter = hasEffectiveRestParameter(source);
var targetHasRestParameter = hasEffectiveRestParameter(target);
// A source signature matches a target signature if the two signatures have the same number of required,
// optional, and rest parameters.
if (sourceParameterCount === targetParameterCount &&
sourceMinArgumentCount === targetMinArgumentCount &&
sourceHasRestParameter === targetHasRestParameter) {
return true;
}
// A source signature partially matches a target signature if the target signature has no fewer required
// parameters
if (partialMatch && sourceMinArgumentCount <= targetMinArgumentCount) {
return true;
}
return false;
}
/**
* See signatureRelatedTo, compareSignaturesIdentical
*/
function compareSignaturesIdentical(source, target, partialMatch, ignoreThisTypes, ignoreReturnTypes, compareTypes) {
// TODO (drosen): De-duplicate code between related functions.
if (source === target) {
return -1 /* True */;
}
if (!(isMatchingSignature(source, target, partialMatch))) {
return 0 /* False */;
}
// Check that the two signatures have the same number of type parameters.
if (ts.length(source.typeParameters) !== ts.length(target.typeParameters)) {
return 0 /* False */;
}
// Check that type parameter constraints and defaults match. If they do, instantiate the source
// signature with the type parameters of the target signature and continue the comparison.
if (target.typeParameters) {
var mapper = createTypeMapper(source.typeParameters, target.typeParameters);
for (var i = 0; i < target.typeParameters.length; i++) {
var s = source.typeParameters[i];
var t = target.typeParameters[i];
if (!(s === t || compareTypes(instantiateType(getConstraintFromTypeParameter(s), mapper) || unknownType, getConstraintFromTypeParameter(t) || unknownType) &&
compareTypes(instantiateType(getDefaultFromTypeParameter(s), mapper) || unknownType, getDefaultFromTypeParameter(t) || unknownType))) {
return 0 /* False */;
}
}
source = instantiateSignature(source, mapper, /*eraseTypeParameters*/ true);
}
var result = -1 /* True */;
if (!ignoreThisTypes) {
var sourceThisType = getThisTypeOfSignature(source);
if (sourceThisType) {
var targetThisType = getThisTypeOfSignature(target);
if (targetThisType) {
var related = compareTypes(sourceThisType, targetThisType);
if (!related) {
return 0 /* False */;
}
result &= related;
}
}
}
var targetLen = getParameterCount(target);
for (var i = 0; i < targetLen; i++) {
var s = getTypeAtPosition(source, i);
var t = getTypeAtPosition(target, i);
var related = compareTypes(t, s);
if (!related) {
return 0 /* False */;
}
result &= related;
}
if (!ignoreReturnTypes) {
var sourceTypePredicate = getTypePredicateOfSignature(source);
var targetTypePredicate = getTypePredicateOfSignature(target);
result &= sourceTypePredicate || targetTypePredicate ?
compareTypePredicatesIdentical(sourceTypePredicate, targetTypePredicate, compareTypes) :
compareTypes(getReturnTypeOfSignature(source), getReturnTypeOfSignature(target));
}
return result;
}
function compareTypePredicatesIdentical(source, target, compareTypes) {
return !(source && target && typePredicateKindsMatch(source, target)) ? 0 /* False */ :
source.type === target.type ? -1 /* True */ :
source.type && target.type ? compareTypes(source.type, target.type) :
0 /* False */;
}
function literalTypesWithSameBaseType(types) {
var commonBaseType;
for (var _i = 0, types_13 = types; _i < types_13.length; _i++) {
var t = types_13[_i];
var baseType = getBaseTypeOfLiteralType(t);
if (!commonBaseType) {
commonBaseType = baseType;
}
if (baseType === t || baseType !== commonBaseType) {
return false;
}
}
return true;
}
// When the candidate types are all literal types with the same base type, return a union
// of those literal types. Otherwise, return the leftmost type for which no type to the
// right is a supertype.
function getSupertypeOrUnion(types) {
if (types.length === 1) {
return types[0];
}
return literalTypesWithSameBaseType(types) ?
getUnionType(types) :
ts.reduceLeft(types, function (s, t) { return isTypeSubtypeOf(s, t) ? t : s; });
}
function getCommonSupertype(types) {
if (!strictNullChecks) {
return getSupertypeOrUnion(types);
}
var primaryTypes = ts.filter(types, function (t) { return !(t.flags & 98304 /* Nullable */); });
return primaryTypes.length ?
getNullableType(getSupertypeOrUnion(primaryTypes), getFalsyFlagsOfTypes(types) & 98304 /* Nullable */) :
getUnionType(types, 2 /* Subtype */);
}
// Return the leftmost type for which no type to the right is a subtype.
function getCommonSubtype(types) {
return ts.reduceLeft(types, function (s, t) { return isTypeSubtypeOf(t, s) ? t : s; });
}
function isArrayType(type) {
return !!(ts.getObjectFlags(type) & 4 /* Reference */) && (type.target === globalArrayType || type.target === globalReadonlyArrayType);
}
function isReadonlyArrayType(type) {
return !!(ts.getObjectFlags(type) & 4 /* Reference */) && type.target === globalReadonlyArrayType;
}
function isMutableArrayOrTuple(type) {
return isArrayType(type) && !isReadonlyArrayType(type) || isTupleType(type) && !type.target.readonly;
}
function getElementTypeOfArrayType(type) {
return isArrayType(type) ? getTypeArguments(type)[0] : undefined;
}
function isArrayLikeType(type) {
// A type is array-like if it is a reference to the global Array or global ReadonlyArray type,
// or if it is not the undefined or null type and if it is assignable to ReadonlyArray<any>
return isArrayType(type) || !(type.flags & 98304 /* Nullable */) && isTypeAssignableTo(type, anyReadonlyArrayType);
}
function getSingleBaseForNonAugmentingSubtype(type) {
if (!(ts.getObjectFlags(type) & 4 /* Reference */) || !(ts.getObjectFlags(type.target) & 3 /* ClassOrInterface */)) {
return undefined;
}
if (ts.getObjectFlags(type) & 33554432 /* IdenticalBaseTypeCalculated */) {
return ts.getObjectFlags(type) & 67108864 /* IdenticalBaseTypeExists */ ? type.cachedEquivalentBaseType : undefined;
}
type.objectFlags |= 33554432 /* IdenticalBaseTypeCalculated */;
var target = type.target;
if (ts.getObjectFlags(target) & 1 /* Class */) {
var baseTypeNode = getBaseTypeNodeOfClass(target);
// A base type expression may circularly reference the class itself (e.g. as an argument to function call), so we only
// check for base types specified as simple qualified names.
if (baseTypeNode && baseTypeNode.expression.kind !== 79 /* Identifier */ && baseTypeNode.expression.kind !== 204 /* PropertyAccessExpression */) {
return undefined;
}
}
var bases = getBaseTypes(target);
if (bases.length !== 1) {
return undefined;
}
if (getMembersOfSymbol(type.symbol).size) {
return undefined; // If the interface has any members, they may subtype members in the base, so we should do a full structural comparison
}
var instantiatedBase = !ts.length(target.typeParameters) ? bases[0] : instantiateType(bases[0], createTypeMapper(target.typeParameters, getTypeArguments(type).slice(0, target.typeParameters.length)));
if (ts.length(getTypeArguments(type)) > ts.length(target.typeParameters)) {
instantiatedBase = getTypeWithThisArgument(instantiatedBase, ts.last(getTypeArguments(type)));
}
type.objectFlags |= 67108864 /* IdenticalBaseTypeExists */;
return type.cachedEquivalentBaseType = instantiatedBase;
}
function isEmptyLiteralType(type) {
return strictNullChecks ? type === implicitNeverType : type === undefinedWideningType;
}
function isEmptyArrayLiteralType(type) {
var elementType = getElementTypeOfArrayType(type);
return !!elementType && isEmptyLiteralType(elementType);
}
function isTupleLikeType(type) {
return isTupleType(type) || !!getPropertyOfType(type, "0");
}
function isArrayOrTupleLikeType(type) {
return isArrayLikeType(type) || isTupleLikeType(type);
}
function getTupleElementType(type, index) {
var propType = getTypeOfPropertyOfType(type, "" + index);
if (propType) {
return propType;
}
if (everyType(type, isTupleType)) {
return mapType(type, function (t) { return getRestTypeOfTupleType(t) || undefinedType; });
}
return undefined;
}
function isNeitherUnitTypeNorNever(type) {
return !(type.flags & (109440 /* Unit */ | 131072 /* Never */));
}
function isUnitType(type) {
return !!(type.flags & 109440 /* Unit */);
}
function isUnitLikeType(type) {
return type.flags & 2097152 /* Intersection */ ? ts.some(type.types, isUnitType) :
!!(type.flags & 109440 /* Unit */);
}
function extractUnitType(type) {
return type.flags & 2097152 /* Intersection */ ? ts.find(type.types, isUnitType) || type : type;
}
function isLiteralType(type) {
return type.flags & 16 /* Boolean */ ? true :
type.flags & 1048576 /* Union */ ? type.flags & 1024 /* EnumLiteral */ ? true : ts.every(type.types, isUnitType) :
isUnitType(type);
}
function getBaseTypeOfLiteralType(type) {
return type.flags & 1024 /* EnumLiteral */ ? getBaseTypeOfEnumLiteralType(type) :
type.flags & 128 /* StringLiteral */ ? stringType :
type.flags & 256 /* NumberLiteral */ ? numberType :
type.flags & 2048 /* BigIntLiteral */ ? bigintType :
type.flags & 512 /* BooleanLiteral */ ? booleanType :
type.flags & 1048576 /* Union */ ? mapType(type, getBaseTypeOfLiteralType) :
type;
}
function getWidenedLiteralType(type) {
return type.flags & 1024 /* EnumLiteral */ && isFreshLiteralType(type) ? getBaseTypeOfEnumLiteralType(type) :
type.flags & 128 /* StringLiteral */ && isFreshLiteralType(type) ? stringType :
type.flags & 256 /* NumberLiteral */ && isFreshLiteralType(type) ? numberType :
type.flags & 2048 /* BigIntLiteral */ && isFreshLiteralType(type) ? bigintType :
type.flags & 512 /* BooleanLiteral */ && isFreshLiteralType(type) ? booleanType :
type.flags & 1048576 /* Union */ ? mapType(type, getWidenedLiteralType) :
type;
}
function getWidenedUniqueESSymbolType(type) {
return type.flags & 8192 /* UniqueESSymbol */ ? esSymbolType :
type.flags & 1048576 /* Union */ ? mapType(type, getWidenedUniqueESSymbolType) :
type;
}
function getWidenedLiteralLikeTypeForContextualType(type, contextualType) {
if (!isLiteralOfContextualType(type, contextualType)) {
type = getWidenedUniqueESSymbolType(getWidenedLiteralType(type));
}
return type;
}
function getWidenedLiteralLikeTypeForContextualReturnTypeIfNeeded(type, contextualSignatureReturnType, isAsync) {
if (type && isUnitType(type)) {
var contextualType = !contextualSignatureReturnType ? undefined :
isAsync ? getPromisedTypeOfPromise(contextualSignatureReturnType) :
contextualSignatureReturnType;
type = getWidenedLiteralLikeTypeForContextualType(type, contextualType);
}
return type;
}
function getWidenedLiteralLikeTypeForContextualIterationTypeIfNeeded(type, contextualSignatureReturnType, kind, isAsyncGenerator) {
if (type && isUnitType(type)) {
var contextualType = !contextualSignatureReturnType ? undefined :
getIterationTypeOfGeneratorFunctionReturnType(kind, contextualSignatureReturnType, isAsyncGenerator);
type = getWidenedLiteralLikeTypeForContextualType(type, contextualType);
}
return type;
}
/**
* Check if a Type was written as a tuple type literal.
* Prefer using isTupleLikeType() unless the use of `elementTypes`/`getTypeArguments` is required.
*/
function isTupleType(type) {
return !!(ts.getObjectFlags(type) & 4 /* Reference */ && type.target.objectFlags & 8 /* Tuple */);
}
function isGenericTupleType(type) {
return isTupleType(type) && !!(type.target.combinedFlags & 8 /* Variadic */);
}
function isSingleElementGenericTupleType(type) {
return isGenericTupleType(type) && type.target.elementFlags.length === 1;
}
function getRestTypeOfTupleType(type) {
return getElementTypeOfSliceOfTupleType(type, type.target.fixedLength);
}
function getRestArrayTypeOfTupleType(type) {
var restType = getRestTypeOfTupleType(type);
return restType && createArrayType(restType);
}
function getElementTypeOfSliceOfTupleType(type, index, endSkipCount, writing) {
if (endSkipCount === void 0) { endSkipCount = 0; }
if (writing === void 0) { writing = false; }
var length = getTypeReferenceArity(type) - endSkipCount;
if (index < length) {
var typeArguments = getTypeArguments(type);
var elementTypes = [];
for (var i = index; i < length; i++) {
var t = typeArguments[i];
elementTypes.push(type.target.elementFlags[i] & 8 /* Variadic */ ? getIndexedAccessType(t, numberType) : t);
}
return writing ? getIntersectionType(elementTypes) : getUnionType(elementTypes);
}
return undefined;
}
function isTupleTypeStructureMatching(t1, t2) {
return getTypeReferenceArity(t1) === getTypeReferenceArity(t2) &&
ts.every(t1.target.elementFlags, function (f, i) { return (f & 12 /* Variable */) === (t2.target.elementFlags[i] & 12 /* Variable */); });
}
function isZeroBigInt(_a) {
var value = _a.value;
return value.base10Value === "0";
}
function getFalsyFlagsOfTypes(types) {
var result = 0;
for (var _i = 0, types_14 = types; _i < types_14.length; _i++) {
var t = types_14[_i];
result |= getFalsyFlags(t);
}
return result;
}
// Returns the String, Number, Boolean, StringLiteral, NumberLiteral, BooleanLiteral, Void, Undefined, or Null
// flags for the string, number, boolean, "", 0, false, void, undefined, or null types respectively. Returns
// no flags for all other types (including non-falsy literal types).
function getFalsyFlags(type) {
return type.flags & 1048576 /* Union */ ? getFalsyFlagsOfTypes(type.types) :
type.flags & 128 /* StringLiteral */ ? type.value === "" ? 128 /* StringLiteral */ : 0 :
type.flags & 256 /* NumberLiteral */ ? type.value === 0 ? 256 /* NumberLiteral */ : 0 :
type.flags & 2048 /* BigIntLiteral */ ? isZeroBigInt(type) ? 2048 /* BigIntLiteral */ : 0 :
type.flags & 512 /* BooleanLiteral */ ? (type === falseType || type === regularFalseType) ? 512 /* BooleanLiteral */ : 0 :
type.flags & 117724 /* PossiblyFalsy */;
}
function removeDefinitelyFalsyTypes(type) {
return getFalsyFlags(type) & 117632 /* DefinitelyFalsy */ ?
filterType(type, function (t) { return !(getFalsyFlags(t) & 117632 /* DefinitelyFalsy */); }) :
type;
}
function extractDefinitelyFalsyTypes(type) {
return mapType(type, getDefinitelyFalsyPartOfType);
}
function getDefinitelyFalsyPartOfType(type) {
return type.flags & 4 /* String */ ? emptyStringType :
type.flags & 8 /* Number */ ? zeroType :
type.flags & 64 /* BigInt */ ? zeroBigIntType :
type === regularFalseType ||
type === falseType ||
type.flags & (16384 /* Void */ | 32768 /* Undefined */ | 65536 /* Null */ | 3 /* AnyOrUnknown */) ||
type.flags & 128 /* StringLiteral */ && type.value === "" ||
type.flags & 256 /* NumberLiteral */ && type.value === 0 ||
type.flags & 2048 /* BigIntLiteral */ && isZeroBigInt(type) ? type :
neverType;
}
/**
* Add undefined or null or both to a type if they are missing.
* @param type - type to add undefined and/or null to if not present
* @param flags - Either TypeFlags.Undefined or TypeFlags.Null, or both
*/
function getNullableType(type, flags) {
var missing = (flags & ~type.flags) & (32768 /* Undefined */ | 65536 /* Null */);
return missing === 0 ? type :
missing === 32768 /* Undefined */ ? getUnionType([type, undefinedType]) :
missing === 65536 /* Null */ ? getUnionType([type, nullType]) :
getUnionType([type, undefinedType, nullType]);
}
function getOptionalType(type, isProperty) {
if (isProperty === void 0) { isProperty = false; }
ts.Debug.assert(strictNullChecks);
return type.flags & 32768 /* Undefined */ ? type : getUnionType([type, isProperty ? missingType : undefinedType]);
}
function getGlobalNonNullableTypeInstantiation(type) {
// First reduce away any constituents that are assignable to 'undefined' or 'null'. This not only eliminates
// 'undefined' and 'null', but also higher-order types such as a type parameter 'U extends undefined | null'
// that isn't eliminated by a NonNullable<T> instantiation.
var reducedType = getTypeWithFacts(type, 2097152 /* NEUndefinedOrNull */);
if (!deferredGlobalNonNullableTypeAlias) {
deferredGlobalNonNullableTypeAlias = getGlobalSymbol("NonNullable", 524288 /* TypeAlias */, /*diagnostic*/ undefined) || unknownSymbol;
}
// If the NonNullable<T> type is available, return an instantiation. Otherwise just return the reduced type.
return deferredGlobalNonNullableTypeAlias !== unknownSymbol ?
getTypeAliasInstantiation(deferredGlobalNonNullableTypeAlias, [reducedType]) :
reducedType;
}
function getNonNullableType(type) {
return strictNullChecks ? getGlobalNonNullableTypeInstantiation(type) : type;
}
function addOptionalTypeMarker(type) {
return strictNullChecks ? getUnionType([type, optionalType]) : type;
}
function removeOptionalTypeMarker(type) {
return strictNullChecks ? removeType(type, optionalType) : type;
}
function propagateOptionalTypeMarker(type, node, wasOptional) {
return wasOptional ? ts.isOutermostOptionalChain(node) ? getOptionalType(type) : addOptionalTypeMarker(type) : type;
}
function getOptionalExpressionType(exprType, expression) {
return ts.isExpressionOfOptionalChainRoot(expression) ? getNonNullableType(exprType) :
ts.isOptionalChain(expression) ? removeOptionalTypeMarker(exprType) :
exprType;
}
function removeMissingType(type, isOptional) {
return exactOptionalPropertyTypes && isOptional ? removeType(type, missingType) : type;
}
function containsMissingType(type) {
return exactOptionalPropertyTypes && (type === missingType || type.flags & 1048576 /* Union */ && containsType(type.types, missingType));
}
function removeMissingOrUndefinedType(type) {
return exactOptionalPropertyTypes ? removeType(type, missingType) : getTypeWithFacts(type, 524288 /* NEUndefined */);
}
/**
* Is source potentially coercible to target type under `==`.
* Assumes that `source` is a constituent of a union, hence
* the boolean literal flag on the LHS, but not on the RHS.
*
* This does not fully replicate the semantics of `==`. The
* intention is to catch cases that are clearly not right.
*
* Comparing (string | number) to number should not remove the
* string element.
*
* Comparing (string | number) to 1 will remove the string
* element, though this is not sound. This is a pragmatic
* choice.
*
* @see narrowTypeByEquality
*
* @param source
* @param target
*/
function isCoercibleUnderDoubleEquals(source, target) {
return ((source.flags & (8 /* Number */ | 4 /* String */ | 512 /* BooleanLiteral */)) !== 0)
&& ((target.flags & (8 /* Number */ | 4 /* String */ | 16 /* Boolean */)) !== 0);
}
/**
* Return true if type was inferred from an object literal, written as an object type literal, or is the shape of a module
* with no call or construct signatures.
*/
function isObjectTypeWithInferableIndex(type) {
return type.flags & 2097152 /* Intersection */ ? ts.every(type.types, isObjectTypeWithInferableIndex) :
!!(type.symbol && (type.symbol.flags & (4096 /* ObjectLiteral */ | 2048 /* TypeLiteral */ | 384 /* Enum */ | 512 /* ValueModule */)) !== 0 &&
!typeHasCallOrConstructSignatures(type)) || !!(ts.getObjectFlags(type) & 1024 /* ReverseMapped */ && isObjectTypeWithInferableIndex(type.source));
}
function createSymbolWithType(source, type) {
var symbol = createSymbol(source.flags, source.escapedName, ts.getCheckFlags(source) & 8 /* Readonly */);
symbol.declarations = source.declarations;
symbol.parent = source.parent;
symbol.type = type;
symbol.target = source;
if (source.valueDeclaration) {
symbol.valueDeclaration = source.valueDeclaration;
}
var nameType = getSymbolLinks(source).nameType;
if (nameType) {
symbol.nameType = nameType;
}
return symbol;
}
function transformTypeOfMembers(type, f) {
var members = ts.createSymbolTable();
for (var _i = 0, _a = getPropertiesOfObjectType(type); _i < _a.length; _i++) {
var property = _a[_i];
var original = getTypeOfSymbol(property);
var updated = f(original);
members.set(property.escapedName, updated === original ? property : createSymbolWithType(property, updated));
}
return members;
}
/**
* If the the provided object literal is subject to the excess properties check,
* create a new that is exempt. Recursively mark object literal members as exempt.
* Leave signatures alone since they are not subject to the check.
*/
function getRegularTypeOfObjectLiteral(type) {
if (!(isObjectLiteralType(type) && ts.getObjectFlags(type) & 16384 /* FreshLiteral */)) {
return type;
}
var regularType = type.regularType;
if (regularType) {
return regularType;
}
var resolved = type;
var members = transformTypeOfMembers(type, getRegularTypeOfObjectLiteral);
var regularNew = createAnonymousType(resolved.symbol, members, resolved.callSignatures, resolved.constructSignatures, resolved.indexInfos);
regularNew.flags = resolved.flags;
regularNew.objectFlags |= resolved.objectFlags & ~16384 /* FreshLiteral */;
type.regularType = regularNew;
return regularNew;
}
function createWideningContext(parent, propertyName, siblings) {
return { parent: parent, propertyName: propertyName, siblings: siblings, resolvedProperties: undefined };
}
function getSiblingsOfContext(context) {
if (!context.siblings) {
var siblings_1 = [];
for (var _i = 0, _a = getSiblingsOfContext(context.parent); _i < _a.length; _i++) {
var type = _a[_i];
if (isObjectLiteralType(type)) {
var prop = getPropertyOfObjectType(type, context.propertyName);
if (prop) {
forEachType(getTypeOfSymbol(prop), function (t) {
siblings_1.push(t);
});
}
}
}
context.siblings = siblings_1;
}
return context.siblings;
}
function getPropertiesOfContext(context) {
if (!context.resolvedProperties) {
var names = new ts.Map();
for (var _i = 0, _a = getSiblingsOfContext(context); _i < _a.length; _i++) {
var t = _a[_i];
if (isObjectLiteralType(t) && !(ts.getObjectFlags(t) & 4194304 /* ContainsSpread */)) {
for (var _b = 0, _c = getPropertiesOfType(t); _b < _c.length; _b++) {
var prop = _c[_b];
names.set(prop.escapedName, prop);
}
}
}
context.resolvedProperties = ts.arrayFrom(names.values());
}
return context.resolvedProperties;
}
function getWidenedProperty(prop, context) {
if (!(prop.flags & 4 /* Property */)) {
// Since get accessors already widen their return value there is no need to
// widen accessor based properties here.
return prop;
}
var original = getTypeOfSymbol(prop);
var propContext = context && createWideningContext(context, prop.escapedName, /*siblings*/ undefined);
var widened = getWidenedTypeWithContext(original, propContext);
return widened === original ? prop : createSymbolWithType(prop, widened);
}
function getUndefinedProperty(prop) {
var cached = undefinedProperties.get(prop.escapedName);
if (cached) {
return cached;
}
var result = createSymbolWithType(prop, missingType);
result.flags |= 16777216 /* Optional */;
undefinedProperties.set(prop.escapedName, result);
return result;
}
function getWidenedTypeOfObjectLiteral(type, context) {
var members = ts.createSymbolTable();
for (var _i = 0, _a = getPropertiesOfObjectType(type); _i < _a.length; _i++) {
var prop = _a[_i];
members.set(prop.escapedName, getWidenedProperty(prop, context));
}
if (context) {
for (var _b = 0, _c = getPropertiesOfContext(context); _b < _c.length; _b++) {
var prop = _c[_b];
if (!members.has(prop.escapedName)) {
members.set(prop.escapedName, getUndefinedProperty(prop));
}
}
}
var result = createAnonymousType(type.symbol, members, ts.emptyArray, ts.emptyArray, ts.sameMap(getIndexInfosOfType(type), function (info) { return createIndexInfo(info.keyType, getWidenedType(info.type), info.isReadonly); }));
result.objectFlags |= (ts.getObjectFlags(type) & (8192 /* JSLiteral */ | 524288 /* NonInferrableType */)); // Retain js literal flag through widening
return result;
}
function getWidenedType(type) {
return getWidenedTypeWithContext(type, /*context*/ undefined);
}
function getWidenedTypeWithContext(type, context) {
if (ts.getObjectFlags(type) & 393216 /* RequiresWidening */) {
if (context === undefined && type.widened) {
return type.widened;
}
var result = void 0;
if (type.flags & (1 /* Any */ | 98304 /* Nullable */)) {
result = anyType;
}
else if (isObjectLiteralType(type)) {
result = getWidenedTypeOfObjectLiteral(type, context);
}
else if (type.flags & 1048576 /* Union */) {
var unionContext_1 = context || createWideningContext(/*parent*/ undefined, /*propertyName*/ undefined, type.types);
var widenedTypes = ts.sameMap(type.types, function (t) { return t.flags & 98304 /* Nullable */ ? t : getWidenedTypeWithContext(t, unionContext_1); });
// Widening an empty object literal transitions from a highly restrictive type to
// a highly inclusive one. For that reason we perform subtype reduction here if the
// union includes empty object types (e.g. reducing {} | string to just {}).
result = getUnionType(widenedTypes, ts.some(widenedTypes, isEmptyObjectType) ? 2 /* Subtype */ : 1 /* Literal */);
}
else if (type.flags & 2097152 /* Intersection */) {
result = getIntersectionType(ts.sameMap(type.types, getWidenedType));
}
else if (isArrayType(type) || isTupleType(type)) {
result = createTypeReference(type.target, ts.sameMap(getTypeArguments(type), getWidenedType));
}
if (result && context === undefined) {
type.widened = result;
}
return result || type;
}
return type;
}
/**
* Reports implicit any errors that occur as a result of widening 'null' and 'undefined'
* to 'any'. A call to reportWideningErrorsInType is normally accompanied by a call to
* getWidenedType. But in some cases getWidenedType is called without reporting errors
* (type argument inference is an example).
*
* The return value indicates whether an error was in fact reported. The particular circumstances
* are on a best effort basis. Currently, if the null or undefined that causes widening is inside
* an object literal property (arbitrarily deeply), this function reports an error. If no error is
* reported, reportImplicitAnyError is a suitable fallback to report a general error.
*/
function reportWideningErrorsInType(type) {
var errorReported = false;
if (ts.getObjectFlags(type) & 131072 /* ContainsWideningType */) {
if (type.flags & 1048576 /* Union */) {
if (ts.some(type.types, isEmptyObjectType)) {
errorReported = true;
}
else {
for (var _i = 0, _a = type.types; _i < _a.length; _i++) {
var t = _a[_i];
if (reportWideningErrorsInType(t)) {
errorReported = true;
}
}
}
}
if (isArrayType(type) || isTupleType(type)) {
for (var _b = 0, _c = getTypeArguments(type); _b < _c.length; _b++) {
var t = _c[_b];
if (reportWideningErrorsInType(t)) {
errorReported = true;
}
}
}
if (isObjectLiteralType(type)) {
for (var _d = 0, _e = getPropertiesOfObjectType(type); _d < _e.length; _d++) {
var p = _e[_d];
var t = getTypeOfSymbol(p);
if (ts.getObjectFlags(t) & 131072 /* ContainsWideningType */) {
if (!reportWideningErrorsInType(t)) {
error(p.valueDeclaration, ts.Diagnostics.Object_literal_s_property_0_implicitly_has_an_1_type, symbolToString(p), typeToString(getWidenedType(t)));
}
errorReported = true;
}
}
}
}
return errorReported;
}
function reportImplicitAny(declaration, type, wideningKind) {
var typeAsString = typeToString(getWidenedType(type));
if (ts.isInJSFile(declaration) && !ts.isCheckJsEnabledForFile(ts.getSourceFileOfNode(declaration), compilerOptions)) {
// Only report implicit any errors/suggestions in TS and ts-check JS files
return;
}
var diagnostic;
switch (declaration.kind) {
case 219 /* BinaryExpression */:
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
diagnostic = noImplicitAny ? ts.Diagnostics.Member_0_implicitly_has_an_1_type : ts.Diagnostics.Member_0_implicitly_has_an_1_type_but_a_better_type_may_be_inferred_from_usage;
break;
case 162 /* Parameter */:
var param = declaration;
if (ts.isIdentifier(param.name) &&
(ts.isCallSignatureDeclaration(param.parent) || ts.isMethodSignature(param.parent) || ts.isFunctionTypeNode(param.parent)) &&
param.parent.parameters.indexOf(param) > -1 &&
(resolveName(param, param.name.escapedText, 788968 /* Type */, undefined, param.name.escapedText, /*isUse*/ true) ||
param.name.originalKeywordKind && ts.isTypeNodeKind(param.name.originalKeywordKind))) {
var newName = "arg" + param.parent.parameters.indexOf(param);
errorOrSuggestion(noImplicitAny, declaration, ts.Diagnostics.Parameter_has_a_name_but_no_type_Did_you_mean_0_Colon_1, newName, ts.declarationNameToString(param.name));
return;
}
diagnostic = declaration.dotDotDotToken ?
noImplicitAny ? ts.Diagnostics.Rest_parameter_0_implicitly_has_an_any_type : ts.Diagnostics.Rest_parameter_0_implicitly_has_an_any_type_but_a_better_type_may_be_inferred_from_usage :
noImplicitAny ? ts.Diagnostics.Parameter_0_implicitly_has_an_1_type : ts.Diagnostics.Parameter_0_implicitly_has_an_1_type_but_a_better_type_may_be_inferred_from_usage;
break;
case 201 /* BindingElement */:
diagnostic = ts.Diagnostics.Binding_element_0_implicitly_has_an_1_type;
if (!noImplicitAny) {
// Don't issue a suggestion for binding elements since the codefix doesn't yet support them.
return;
}
break;
case 312 /* JSDocFunctionType */:
error(declaration, ts.Diagnostics.Function_type_which_lacks_return_type_annotation_implicitly_has_an_0_return_type, typeAsString);
return;
case 254 /* FunctionDeclaration */:
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
if (noImplicitAny && !declaration.name) {
if (wideningKind === 3 /* GeneratorYield */) {
error(declaration, ts.Diagnostics.Generator_implicitly_has_yield_type_0_because_it_does_not_yield_any_values_Consider_supplying_a_return_type_annotation, typeAsString);
}
else {
error(declaration, ts.Diagnostics.Function_expression_which_lacks_return_type_annotation_implicitly_has_an_0_return_type, typeAsString);
}
return;
}
diagnostic = !noImplicitAny ? ts.Diagnostics._0_implicitly_has_an_1_return_type_but_a_better_type_may_be_inferred_from_usage :
wideningKind === 3 /* GeneratorYield */ ? ts.Diagnostics._0_which_lacks_return_type_annotation_implicitly_has_an_1_yield_type :
ts.Diagnostics._0_which_lacks_return_type_annotation_implicitly_has_an_1_return_type;
break;
case 193 /* MappedType */:
if (noImplicitAny) {
error(declaration, ts.Diagnostics.Mapped_object_type_implicitly_has_an_any_template_type);
}
return;
default:
diagnostic = noImplicitAny ? ts.Diagnostics.Variable_0_implicitly_has_an_1_type : ts.Diagnostics.Variable_0_implicitly_has_an_1_type_but_a_better_type_may_be_inferred_from_usage;
}
errorOrSuggestion(noImplicitAny, declaration, diagnostic, ts.declarationNameToString(ts.getNameOfDeclaration(declaration)), typeAsString);
}
function reportErrorsFromWidening(declaration, type, wideningKind) {
if (produceDiagnostics && noImplicitAny && ts.getObjectFlags(type) & 131072 /* ContainsWideningType */ && (!wideningKind || !getContextualSignatureForFunctionLikeDeclaration(declaration))) {
// Report implicit any error within type if possible, otherwise report error on declaration
if (!reportWideningErrorsInType(type)) {
reportImplicitAny(declaration, type, wideningKind);
}
}
}
function applyToParameterTypes(source, target, callback) {
var sourceCount = getParameterCount(source);
var targetCount = getParameterCount(target);
var sourceRestType = getEffectiveRestType(source);
var targetRestType = getEffectiveRestType(target);
var targetNonRestCount = targetRestType ? targetCount - 1 : targetCount;
var paramCount = sourceRestType ? targetNonRestCount : Math.min(sourceCount, targetNonRestCount);
var sourceThisType = getThisTypeOfSignature(source);
if (sourceThisType) {
var targetThisType = getThisTypeOfSignature(target);
if (targetThisType) {
callback(sourceThisType, targetThisType);
}
}
for (var i = 0; i < paramCount; i++) {
callback(getTypeAtPosition(source, i), getTypeAtPosition(target, i));
}
if (targetRestType) {
callback(getRestTypeAtPosition(source, paramCount), targetRestType);
}
}
function applyToReturnTypes(source, target, callback) {
var sourceTypePredicate = getTypePredicateOfSignature(source);
var targetTypePredicate = getTypePredicateOfSignature(target);
if (sourceTypePredicate && targetTypePredicate && typePredicateKindsMatch(sourceTypePredicate, targetTypePredicate) && sourceTypePredicate.type && targetTypePredicate.type) {
callback(sourceTypePredicate.type, targetTypePredicate.type);
}
else {
callback(getReturnTypeOfSignature(source), getReturnTypeOfSignature(target));
}
}
function createInferenceContext(typeParameters, signature, flags, compareTypes) {
return createInferenceContextWorker(typeParameters.map(createInferenceInfo), signature, flags, compareTypes || compareTypesAssignable);
}
function cloneInferenceContext(context, extraFlags) {
if (extraFlags === void 0) { extraFlags = 0; }
return context && createInferenceContextWorker(ts.map(context.inferences, cloneInferenceInfo), context.signature, context.flags | extraFlags, context.compareTypes);
}
function createInferenceContextWorker(inferences, signature, flags, compareTypes) {
var context = {
inferences: inferences,
signature: signature,
flags: flags,
compareTypes: compareTypes,
mapper: makeFunctionTypeMapper(function (t) { return mapToInferredType(context, t, /*fix*/ true); }),
nonFixingMapper: makeFunctionTypeMapper(function (t) { return mapToInferredType(context, t, /*fix*/ false); }),
};
return context;
}
function mapToInferredType(context, t, fix) {
var inferences = context.inferences;
for (var i = 0; i < inferences.length; i++) {
var inference = inferences[i];
if (t === inference.typeParameter) {
if (fix && !inference.isFixed) {
clearCachedInferences(inferences);
inference.isFixed = true;
}
return getInferredType(context, i);
}
}
return t;
}
function clearCachedInferences(inferences) {
for (var _i = 0, inferences_1 = inferences; _i < inferences_1.length; _i++) {
var inference = inferences_1[_i];
if (!inference.isFixed) {
inference.inferredType = undefined;
}
}
}
function createInferenceInfo(typeParameter) {
return {
typeParameter: typeParameter,
candidates: undefined,
contraCandidates: undefined,
inferredType: undefined,
priority: undefined,
topLevel: true,
isFixed: false,
impliedArity: undefined
};
}
function cloneInferenceInfo(inference) {
return {
typeParameter: inference.typeParameter,
candidates: inference.candidates && inference.candidates.slice(),
contraCandidates: inference.contraCandidates && inference.contraCandidates.slice(),
inferredType: inference.inferredType,
priority: inference.priority,
topLevel: inference.topLevel,
isFixed: inference.isFixed,
impliedArity: inference.impliedArity
};
}
function cloneInferredPartOfContext(context) {
var inferences = ts.filter(context.inferences, hasInferenceCandidates);
return inferences.length ?
createInferenceContextWorker(ts.map(inferences, cloneInferenceInfo), context.signature, context.flags, context.compareTypes) :
undefined;
}
function getMapperFromContext(context) {
return context && context.mapper;
}
// Return true if the given type could possibly reference a type parameter for which
// we perform type inference (i.e. a type parameter of a generic function). We cache
// results for union and intersection types for performance reasons.
function couldContainTypeVariables(type) {
var objectFlags = ts.getObjectFlags(type);
if (objectFlags & 1048576 /* CouldContainTypeVariablesComputed */) {
return !!(objectFlags & 2097152 /* CouldContainTypeVariables */);
}
var result = !!(type.flags & 465829888 /* Instantiable */ ||
type.flags & 524288 /* Object */ && !isNonGenericTopLevelType(type) && (objectFlags & 4 /* Reference */ && (type.node || ts.forEach(getTypeArguments(type), couldContainTypeVariables)) ||
objectFlags & 16 /* Anonymous */ && type.symbol && type.symbol.flags & (16 /* Function */ | 8192 /* Method */ | 32 /* Class */ | 2048 /* TypeLiteral */ | 4096 /* ObjectLiteral */) && type.symbol.declarations ||
objectFlags & (32 /* Mapped */ | 1024 /* ReverseMapped */ | 8388608 /* ObjectRestType */)) ||
type.flags & 3145728 /* UnionOrIntersection */ && !(type.flags & 1024 /* EnumLiteral */) && !isNonGenericTopLevelType(type) && ts.some(type.types, couldContainTypeVariables));
if (type.flags & 3899393 /* ObjectFlagsType */) {
type.objectFlags |= 1048576 /* CouldContainTypeVariablesComputed */ | (result ? 2097152 /* CouldContainTypeVariables */ : 0);
}
return result;
}
function isNonGenericTopLevelType(type) {
if (type.aliasSymbol && !type.aliasTypeArguments) {
var declaration = ts.getDeclarationOfKind(type.aliasSymbol, 257 /* TypeAliasDeclaration */);
return !!(declaration && ts.findAncestor(declaration.parent, function (n) { return n.kind === 300 /* SourceFile */ ? true : n.kind === 259 /* ModuleDeclaration */ ? false : "quit"; }));
}
return false;
}
function isTypeParameterAtTopLevel(type, typeParameter) {
return !!(type === typeParameter ||
type.flags & 3145728 /* UnionOrIntersection */ && ts.some(type.types, function (t) { return isTypeParameterAtTopLevel(t, typeParameter); }) ||
type.flags & 16777216 /* Conditional */ && (getTrueTypeFromConditionalType(type) === typeParameter || getFalseTypeFromConditionalType(type) === typeParameter));
}
/** Create an object with properties named in the string literal type. Every property has type `any` */
function createEmptyObjectTypeFromStringLiteral(type) {
var members = ts.createSymbolTable();
forEachType(type, function (t) {
if (!(t.flags & 128 /* StringLiteral */)) {
return;
}
var name = ts.escapeLeadingUnderscores(t.value);
var literalProp = createSymbol(4 /* Property */, name);
literalProp.type = anyType;
if (t.symbol) {
literalProp.declarations = t.symbol.declarations;
literalProp.valueDeclaration = t.symbol.valueDeclaration;
}
members.set(name, literalProp);
});
var indexInfos = type.flags & 4 /* String */ ? [createIndexInfo(stringType, emptyObjectType, /*isReadonly*/ false)] : ts.emptyArray;
return createAnonymousType(undefined, members, ts.emptyArray, ts.emptyArray, indexInfos);
}
/**
* Infer a suitable input type for a homomorphic mapped type { [P in keyof T]: X }. We construct
* an object type with the same set of properties as the source type, where the type of each
* property is computed by inferring from the source property type to X for the type
* variable T[P] (i.e. we treat the type T[P] as the type variable we're inferring for).
*/
function inferTypeForHomomorphicMappedType(source, target, constraint) {
if (inInferTypeForHomomorphicMappedType) {
return undefined;
}
var key = source.id + "," + target.id + "," + constraint.id;
if (reverseMappedCache.has(key)) {
return reverseMappedCache.get(key);
}
inInferTypeForHomomorphicMappedType = true;
var type = createReverseMappedType(source, target, constraint);
inInferTypeForHomomorphicMappedType = false;
reverseMappedCache.set(key, type);
return type;
}
// We consider a type to be partially inferable if it isn't marked non-inferable or if it is
// an object literal type with at least one property of an inferable type. For example, an object
// literal { a: 123, b: x => true } is marked non-inferable because it contains a context sensitive
// arrow function, but is considered partially inferable because property 'a' has an inferable type.
function isPartiallyInferableType(type) {
return !(ts.getObjectFlags(type) & 524288 /* NonInferrableType */) ||
isObjectLiteralType(type) && ts.some(getPropertiesOfType(type), function (prop) { return isPartiallyInferableType(getTypeOfSymbol(prop)); }) ||
isTupleType(type) && ts.some(getTypeArguments(type), isPartiallyInferableType);
}
function createReverseMappedType(source, target, constraint) {
// We consider a source type reverse mappable if it has a string index signature or if
// it has one or more properties and is of a partially inferable type.
if (!(getIndexInfoOfType(source, stringType) || getPropertiesOfType(source).length !== 0 && isPartiallyInferableType(source))) {
return undefined;
}
// For arrays and tuples we infer new arrays and tuples where the reverse mapping has been
// applied to the element type(s).
if (isArrayType(source)) {
return createArrayType(inferReverseMappedType(getTypeArguments(source)[0], target, constraint), isReadonlyArrayType(source));
}
if (isTupleType(source)) {
var elementTypes = ts.map(getTypeArguments(source), function (t) { return inferReverseMappedType(t, target, constraint); });
var elementFlags = getMappedTypeModifiers(target) & 4 /* IncludeOptional */ ?
ts.sameMap(source.target.elementFlags, function (f) { return f & 2 /* Optional */ ? 1 /* Required */ : f; }) :
source.target.elementFlags;
return createTupleType(elementTypes, elementFlags, source.target.readonly, source.target.labeledElementDeclarations);
}
// For all other object types we infer a new object type where the reverse mapping has been
// applied to the type of each property.
var reversed = createObjectType(1024 /* ReverseMapped */ | 16 /* Anonymous */, /*symbol*/ undefined);
reversed.source = source;
reversed.mappedType = target;
reversed.constraintType = constraint;
return reversed;
}
function getTypeOfReverseMappedSymbol(symbol) {
var links = getSymbolLinks(symbol);
if (!links.type) {
links.type = inferReverseMappedType(symbol.propertyType, symbol.mappedType, symbol.constraintType);
}
return links.type;
}
function inferReverseMappedType(sourceType, target, constraint) {
var typeParameter = getIndexedAccessType(constraint.type, getTypeParameterFromMappedType(target));
var templateType = getTemplateTypeFromMappedType(target);
var inference = createInferenceInfo(typeParameter);
inferTypes([inference], sourceType, templateType);
return getTypeFromInference(inference) || unknownType;
}
function getUnmatchedProperties(source, target, requireOptionalProperties, matchDiscriminantProperties) {
var properties, _i, properties_2, targetProp, sourceProp, targetType, sourceType;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
properties = getPropertiesOfType(target);
_i = 0, properties_2 = properties;
_a.label = 1;
case 1:
if (!(_i < properties_2.length)) return [3 /*break*/, 6];
targetProp = properties_2[_i];
// TODO: remove this when we support static private identifier fields and find other solutions to get privateNamesAndStaticFields test to pass
if (isStaticPrivateIdentifierProperty(targetProp)) {
return [3 /*break*/, 5];
}
if (!(requireOptionalProperties || !(targetProp.flags & 16777216 /* Optional */ || ts.getCheckFlags(targetProp) & 48 /* Partial */))) return [3 /*break*/, 5];
sourceProp = getPropertyOfType(source, targetProp.escapedName);
if (!!sourceProp) return [3 /*break*/, 3];
return [4 /*yield*/, targetProp];
case 2:
_a.sent();
return [3 /*break*/, 5];
case 3:
if (!matchDiscriminantProperties) return [3 /*break*/, 5];
targetType = getTypeOfSymbol(targetProp);
if (!(targetType.flags & 109440 /* Unit */)) return [3 /*break*/, 5];
sourceType = getTypeOfSymbol(sourceProp);
if (!!(sourceType.flags & 1 /* Any */ || getRegularTypeOfLiteralType(sourceType) === getRegularTypeOfLiteralType(targetType))) return [3 /*break*/, 5];
return [4 /*yield*/, targetProp];
case 4:
_a.sent();
_a.label = 5;
case 5:
_i++;
return [3 /*break*/, 1];
case 6: return [2 /*return*/];
}
});
}
function getUnmatchedProperty(source, target, requireOptionalProperties, matchDiscriminantProperties) {
var result = getUnmatchedProperties(source, target, requireOptionalProperties, matchDiscriminantProperties).next();
if (!result.done)
return result.value;
}
function tupleTypesDefinitelyUnrelated(source, target) {
return !(target.target.combinedFlags & 8 /* Variadic */) && target.target.minLength > source.target.minLength ||
!target.target.hasRestElement && (source.target.hasRestElement || target.target.fixedLength < source.target.fixedLength);
}
function typesDefinitelyUnrelated(source, target) {
// Two tuple types with incompatible arities are definitely unrelated.
// Two object types that each have a property that is unmatched in the other are definitely unrelated.
return isTupleType(source) && isTupleType(target) ? tupleTypesDefinitelyUnrelated(source, target) :
!!getUnmatchedProperty(source, target, /*requireOptionalProperties*/ false, /*matchDiscriminantProperties*/ true) &&
!!getUnmatchedProperty(target, source, /*requireOptionalProperties*/ false, /*matchDiscriminantProperties*/ false);
}
function getTypeFromInference(inference) {
return inference.candidates ? getUnionType(inference.candidates, 2 /* Subtype */) :
inference.contraCandidates ? getIntersectionType(inference.contraCandidates) :
undefined;
}
function hasSkipDirectInferenceFlag(node) {
return !!getNodeLinks(node).skipDirectInference;
}
function isFromInferenceBlockedSource(type) {
return !!(type.symbol && ts.some(type.symbol.declarations, hasSkipDirectInferenceFlag));
}
function isValidBigIntString(s) {
var scanner = ts.createScanner(99 /* ESNext */, /*skipTrivia*/ false);
var success = true;
scanner.setOnError(function () { return success = false; });
scanner.setText(s + "n");
var result = scanner.scan();
if (result === 40 /* MinusToken */) {
result = scanner.scan();
}
var flags = scanner.getTokenFlags();
// validate that
// * scanning proceeded without error
// * a bigint can be scanned, and that when it is scanned, it is
// * the full length of the input string (so the scanner is one character beyond the augmented input length)
// * it does not contain a numeric seperator (the `BigInt` constructor does not accept a numeric seperator in its input)
return success && result === 9 /* BigIntLiteral */ && scanner.getTextPos() === (s.length + 1) && !(flags & 512 /* ContainsSeparator */);
}
function isValidTypeForTemplateLiteralPlaceholder(source, target) {
if (source === target || target.flags & (1 /* Any */ | 4 /* String */)) {
return true;
}
if (source.flags & 128 /* StringLiteral */) {
var value = source.value;
return !!(target.flags & 8 /* Number */ && value !== "" && isFinite(+value) ||
target.flags & 64 /* BigInt */ && value !== "" && isValidBigIntString(value) ||
target.flags & (512 /* BooleanLiteral */ | 98304 /* Nullable */) && value === target.intrinsicName);
}
if (source.flags & 134217728 /* TemplateLiteral */) {
var texts = source.texts;
return texts.length === 2 && texts[0] === "" && texts[1] === "" && isTypeAssignableTo(source.types[0], target);
}
return isTypeAssignableTo(source, target);
}
function inferTypesFromTemplateLiteralType(source, target) {
return source.flags & 128 /* StringLiteral */ ? inferFromLiteralPartsToTemplateLiteral([source.value], ts.emptyArray, target) :
source.flags & 134217728 /* TemplateLiteral */ ?
ts.arraysEqual(source.texts, target.texts) ? ts.map(source.types, getStringLikeTypeForType) :
inferFromLiteralPartsToTemplateLiteral(source.texts, source.types, target) :
undefined;
}
function getStringLikeTypeForType(type) {
return type.flags & (1 /* Any */ | 402653316 /* StringLike */) ? type : getTemplateLiteralType(["", ""], [type]);
}
// This function infers from the text parts and type parts of a source literal to a target template literal. The number
// of text parts is always one more than the number of type parts, and a source string literal is treated as a source
// with one text part and zero type parts. The function returns an array of inferred string or template literal types
// corresponding to the placeholders in the target template literal, or undefined if the source doesn't match the target.
//
// We first check that the starting source text part matches the starting target text part, and that the ending source
// text part ends matches the ending target text part. We then iterate through the remaining target text parts, finding
// a match for each in the source and inferring string or template literal types created from the segments of the source
// that occur between the matches. During this iteration, seg holds the index of the current text part in the sourceTexts
// array and pos holds the current character position in the current text part.
//
// Consider inference from type `<<${string}>.<${number}-${number}>>` to type `<${string}.${string}>`, i.e.
// sourceTexts = ['<<', '>.<', '-', '>>']
// sourceTypes = [string, number, number]
// target.texts = ['<', '.', '>']
// We first match '<' in the target to the start of '<<' in the source and '>' in the target to the end of '>>' in
// the source. The first match for the '.' in target occurs at character 1 in the source text part at index 1, and thus
// the first inference is the template literal type `<${string}>`. The remainder of the source makes up the second
// inference, the template literal type `<${number}-${number}>`.
function inferFromLiteralPartsToTemplateLiteral(sourceTexts, sourceTypes, target) {
var lastSourceIndex = sourceTexts.length - 1;
var sourceStartText = sourceTexts[0];
var sourceEndText = sourceTexts[lastSourceIndex];
var targetTexts = target.texts;
var lastTargetIndex = targetTexts.length - 1;
var targetStartText = targetTexts[0];
var targetEndText = targetTexts[lastTargetIndex];
if (lastSourceIndex === 0 && sourceStartText.length < targetStartText.length + targetEndText.length ||
!sourceStartText.startsWith(targetStartText) || !sourceEndText.endsWith(targetEndText))
return undefined;
var remainingEndText = sourceEndText.slice(0, sourceEndText.length - targetEndText.length);
var matches = [];
var seg = 0;
var pos = targetStartText.length;
for (var i = 1; i < lastTargetIndex; i++) {
var delim = targetTexts[i];
if (delim.length > 0) {
var s = seg;
var p = pos;
while (true) {
p = getSourceText(s).indexOf(delim, p);
if (p >= 0)
break;
s++;
if (s === sourceTexts.length)
return undefined;
p = 0;
}
addMatch(s, p);
pos += delim.length;
}
else if (pos < getSourceText(seg).length) {
addMatch(seg, pos + 1);
}
else if (seg < lastSourceIndex) {
addMatch(seg + 1, 0);
}
else {
return undefined;
}
}
addMatch(lastSourceIndex, getSourceText(lastSourceIndex).length);
return matches;
function getSourceText(index) {
return index < lastSourceIndex ? sourceTexts[index] : remainingEndText;
}
function addMatch(s, p) {
var matchType = s === seg ?
getStringLiteralType(getSourceText(s).slice(pos, p)) :
getTemplateLiteralType(__spreadArray(__spreadArray([sourceTexts[seg].slice(pos)], sourceTexts.slice(seg + 1, s), true), [getSourceText(s).slice(0, p)], false), sourceTypes.slice(seg, s));
matches.push(matchType);
seg = s;
pos = p;
}
}
function inferTypes(inferences, originalSource, originalTarget, priority, contravariant) {
if (priority === void 0) { priority = 0; }
if (contravariant === void 0) { contravariant = false; }
var bivariant = false;
var propagationType;
var inferencePriority = 2048 /* MaxValue */;
var allowComplexConstraintInference = true;
var visited;
var sourceStack;
var targetStack;
var expandingFlags = 0 /* None */;
inferFromTypes(originalSource, originalTarget);
function inferFromTypes(source, target) {
if (!couldContainTypeVariables(target)) {
return;
}
if (source === wildcardType) {
// We are inferring from an 'any' type. We want to infer this type for every type parameter
// referenced in the target type, so we record it as the propagation type and infer from the
// target to itself. Then, as we find candidates we substitute the propagation type.
var savePropagationType = propagationType;
propagationType = source;
inferFromTypes(target, target);
propagationType = savePropagationType;
return;
}
if (source.aliasSymbol && source.aliasTypeArguments && source.aliasSymbol === target.aliasSymbol) {
// Source and target are types originating in the same generic type alias declaration.
// Simply infer from source type arguments to target type arguments.
inferFromTypeArguments(source.aliasTypeArguments, target.aliasTypeArguments, getAliasVariances(source.aliasSymbol));
return;
}
if (source === target && source.flags & 3145728 /* UnionOrIntersection */) {
// When source and target are the same union or intersection type, just relate each constituent
// type to itself.
for (var _i = 0, _a = source.types; _i < _a.length; _i++) {
var t = _a[_i];
inferFromTypes(t, t);
}
return;
}
if (target.flags & 1048576 /* Union */) {
// First, infer between identically matching source and target constituents and remove the
// matching types.
var _b = inferFromMatchingTypes(source.flags & 1048576 /* Union */ ? source.types : [source], target.types, isTypeOrBaseIdenticalTo), tempSources = _b[0], tempTargets = _b[1];
// Next, infer between closely matching source and target constituents and remove
// the matching types. Types closely match when they are instantiations of the same
// object type or instantiations of the same type alias.
var _c = inferFromMatchingTypes(tempSources, tempTargets, isTypeCloselyMatchedBy), sources = _c[0], targets = _c[1];
if (targets.length === 0) {
return;
}
target = getUnionType(targets);
if (sources.length === 0) {
// All source constituents have been matched and there is nothing further to infer from.
// However, simply making no inferences is undesirable because it could ultimately mean
// inferring a type parameter constraint. Instead, make a lower priority inference from
// the full source to whatever remains in the target. For example, when inferring from
// string to 'string | T', make a lower priority inference of string for T.
inferWithPriority(source, target, 1 /* NakedTypeVariable */);
return;
}
source = getUnionType(sources);
}
else if (target.flags & 2097152 /* Intersection */ && ts.some(target.types, function (t) { return !!getInferenceInfoForType(t) || (isGenericMappedType(t) && !!getInferenceInfoForType(getHomomorphicTypeVariable(t) || neverType)); })) {
// We reduce intersection types only when they contain naked type parameters. For example, when
// inferring from 'string[] & { extra: any }' to 'string[] & T' we want to remove string[] and
// infer { extra: any } for T. But when inferring to 'string[] & Iterable<T>' we want to keep the
// string[] on the source side and infer string for T.
// Likewise, we consider a homomorphic mapped type constrainted to the target type parameter as similar to a "naked type variable"
// in such scenarios.
if (!(source.flags & 1048576 /* Union */)) {
// Infer between identically matching source and target constituents and remove the matching types.
var _d = inferFromMatchingTypes(source.flags & 2097152 /* Intersection */ ? source.types : [source], target.types, isTypeIdenticalTo), sources = _d[0], targets = _d[1];
if (sources.length === 0 || targets.length === 0) {
return;
}
source = getIntersectionType(sources);
target = getIntersectionType(targets);
}
}
else if (target.flags & (8388608 /* IndexedAccess */ | 33554432 /* Substitution */)) {
target = getActualTypeVariable(target);
}
if (target.flags & 8650752 /* TypeVariable */) {
// If target is a type parameter, make an inference, unless the source type contains
// the anyFunctionType (the wildcard type that's used to avoid contextually typing functions).
// Because the anyFunctionType is internal, it should not be exposed to the user by adding
// it as an inference candidate. Hopefully, a better candidate will come along that does
// not contain anyFunctionType when we come back to this argument for its second round
// of inference. Also, we exclude inferences for silentNeverType (which is used as a wildcard
// when constructing types from type parameters that had no inference candidates).
if (ts.getObjectFlags(source) & 524288 /* NonInferrableType */ || source === nonInferrableAnyType || source === silentNeverType ||
(priority & 128 /* ReturnType */ && (source === autoType || source === autoArrayType)) || isFromInferenceBlockedSource(source)) {
return;
}
var inference = getInferenceInfoForType(target);
if (inference) {
if (!inference.isFixed) {
if (inference.priority === undefined || priority < inference.priority) {
inference.candidates = undefined;
inference.contraCandidates = undefined;
inference.topLevel = true;
inference.priority = priority;
}
if (priority === inference.priority) {
var candidate = propagationType || source;
// We make contravariant inferences only if we are in a pure contravariant position,
// i.e. only if we have not descended into a bivariant position.
if (contravariant && !bivariant) {
if (!ts.contains(inference.contraCandidates, candidate)) {
inference.contraCandidates = ts.append(inference.contraCandidates, candidate);
clearCachedInferences(inferences);
}
}
else if (!ts.contains(inference.candidates, candidate)) {
inference.candidates = ts.append(inference.candidates, candidate);
clearCachedInferences(inferences);
}
}
if (!(priority & 128 /* ReturnType */) && target.flags & 262144 /* TypeParameter */ && inference.topLevel && !isTypeParameterAtTopLevel(originalTarget, target)) {
inference.topLevel = false;
clearCachedInferences(inferences);
}
}
inferencePriority = Math.min(inferencePriority, priority);
return;
}
else {
// Infer to the simplified version of an indexed access, if possible, to (hopefully) expose more bare type parameters to the inference engine
var simplified = getSimplifiedType(target, /*writing*/ false);
if (simplified !== target) {
invokeOnce(source, simplified, inferFromTypes);
}
else if (target.flags & 8388608 /* IndexedAccess */) {
var indexType = getSimplifiedType(target.indexType, /*writing*/ false);
// Generally simplifications of instantiable indexes are avoided to keep relationship checking correct, however if our target is an access, we can consider
// that key of that access to be "instantiated", since we're looking to find the infernce goal in any way we can.
if (indexType.flags & 465829888 /* Instantiable */) {
var simplified_1 = distributeIndexOverObjectType(getSimplifiedType(target.objectType, /*writing*/ false), indexType, /*writing*/ false);
if (simplified_1 && simplified_1 !== target) {
invokeOnce(source, simplified_1, inferFromTypes);
}
}
}
}
}
if (ts.getObjectFlags(source) & 4 /* Reference */ && ts.getObjectFlags(target) & 4 /* Reference */ && (source.target === target.target || isArrayType(source) && isArrayType(target)) &&
!(source.node && target.node)) {
// If source and target are references to the same generic type, infer from type arguments
inferFromTypeArguments(getTypeArguments(source), getTypeArguments(target), getVariances(source.target));
}
else if (source.flags & 4194304 /* Index */ && target.flags & 4194304 /* Index */) {
contravariant = !contravariant;
inferFromTypes(source.type, target.type);
contravariant = !contravariant;
}
else if ((isLiteralType(source) || source.flags & 4 /* String */) && target.flags & 4194304 /* Index */) {
var empty = createEmptyObjectTypeFromStringLiteral(source);
contravariant = !contravariant;
inferWithPriority(empty, target.type, 256 /* LiteralKeyof */);
contravariant = !contravariant;
}
else if (source.flags & 8388608 /* IndexedAccess */ && target.flags & 8388608 /* IndexedAccess */) {
inferFromTypes(source.objectType, target.objectType);
inferFromTypes(source.indexType, target.indexType);
}
else if (source.flags & 268435456 /* StringMapping */ && target.flags & 268435456 /* StringMapping */) {
if (source.symbol === target.symbol) {
inferFromTypes(source.type, target.type);
}
}
else if (source.flags & 33554432 /* Substitution */) {
inferFromTypes(source.baseType, target);
var oldPriority = priority;
priority |= 4 /* SubstituteSource */;
inferFromTypes(source.substitute, target); // Make substitute inference at a lower priority
priority = oldPriority;
}
else if (target.flags & 16777216 /* Conditional */) {
invokeOnce(source, target, inferToConditionalType);
}
else if (target.flags & 3145728 /* UnionOrIntersection */) {
inferToMultipleTypes(source, target.types, target.flags);
}
else if (source.flags & 1048576 /* Union */) {
// Source is a union or intersection type, infer from each constituent type
var sourceTypes = source.types;
for (var _e = 0, sourceTypes_2 = sourceTypes; _e < sourceTypes_2.length; _e++) {
var sourceType = sourceTypes_2[_e];
inferFromTypes(sourceType, target);
}
}
else if (target.flags & 134217728 /* TemplateLiteral */) {
inferToTemplateLiteralType(source, target);
}
else {
source = getReducedType(source);
if (!(priority & 512 /* NoConstraints */ && source.flags & (2097152 /* Intersection */ | 465829888 /* Instantiable */))) {
var apparentSource = getApparentType(source);
// getApparentType can return _any_ type, since an indexed access or conditional may simplify to any other type.
// If that occurs and it doesn't simplify to an object or intersection, we'll need to restart `inferFromTypes`
// with the simplified source.
if (apparentSource !== source && allowComplexConstraintInference && !(apparentSource.flags & (524288 /* Object */ | 2097152 /* Intersection */))) {
// TODO: The `allowComplexConstraintInference` flag is a hack! This forbids inference from complex constraints within constraints!
// This isn't required algorithmically, but rather is used to lower the memory burden caused by performing inference
// that is _too good_ in projects with complicated constraints (eg, fp-ts). In such cases, if we did not limit ourselves
// here, we might produce more valid inferences for types, causing us to do more checks and perform more instantiations
// (in addition to the extra stack depth here) which, in turn, can push the already close process over its limit.
// TL;DR: If we ever become generally more memory efficient (or our resource budget ever increases), we should just
// remove this `allowComplexConstraintInference` flag.
allowComplexConstraintInference = false;
return inferFromTypes(apparentSource, target);
}
source = apparentSource;
}
if (source.flags & (524288 /* Object */ | 2097152 /* Intersection */)) {
invokeOnce(source, target, inferFromObjectTypes);
}
}
}
function inferWithPriority(source, target, newPriority) {
var savePriority = priority;
priority |= newPriority;
inferFromTypes(source, target);
priority = savePriority;
}
function invokeOnce(source, target, action) {
var key = source.id + "," + target.id;
var status = visited && visited.get(key);
if (status !== undefined) {
inferencePriority = Math.min(inferencePriority, status);
return;
}
(visited || (visited = new ts.Map())).set(key, -1 /* Circularity */);
var saveInferencePriority = inferencePriority;
inferencePriority = 2048 /* MaxValue */;
// We stop inferring and report a circularity if we encounter duplicate recursion identities on both
// the source side and the target side.
var saveExpandingFlags = expandingFlags;
var sourceIdentity = getRecursionIdentity(source);
var targetIdentity = getRecursionIdentity(target);
if (ts.contains(sourceStack, sourceIdentity))
expandingFlags |= 1 /* Source */;
if (ts.contains(targetStack, targetIdentity))
expandingFlags |= 2 /* Target */;
if (expandingFlags !== 3 /* Both */) {
(sourceStack || (sourceStack = [])).push(sourceIdentity);
(targetStack || (targetStack = [])).push(targetIdentity);
action(source, target);
targetStack.pop();
sourceStack.pop();
}
else {
inferencePriority = -1 /* Circularity */;
}
expandingFlags = saveExpandingFlags;
visited.set(key, inferencePriority);
inferencePriority = Math.min(inferencePriority, saveInferencePriority);
}
function inferFromMatchingTypes(sources, targets, matches) {
var matchedSources;
var matchedTargets;
for (var _i = 0, targets_1 = targets; _i < targets_1.length; _i++) {
var t = targets_1[_i];
for (var _a = 0, sources_1 = sources; _a < sources_1.length; _a++) {
var s = sources_1[_a];
if (matches(s, t)) {
inferFromTypes(s, t);
matchedSources = ts.appendIfUnique(matchedSources, s);
matchedTargets = ts.appendIfUnique(matchedTargets, t);
}
}
}
return [
matchedSources ? ts.filter(sources, function (t) { return !ts.contains(matchedSources, t); }) : sources,
matchedTargets ? ts.filter(targets, function (t) { return !ts.contains(matchedTargets, t); }) : targets,
];
}
function inferFromTypeArguments(sourceTypes, targetTypes, variances) {
var count = sourceTypes.length < targetTypes.length ? sourceTypes.length : targetTypes.length;
for (var i = 0; i < count; i++) {
if (i < variances.length && (variances[i] & 7 /* VarianceMask */) === 2 /* Contravariant */) {
inferFromContravariantTypes(sourceTypes[i], targetTypes[i]);
}
else {
inferFromTypes(sourceTypes[i], targetTypes[i]);
}
}
}
function inferFromContravariantTypes(source, target) {
if (strictFunctionTypes || priority & 1024 /* AlwaysStrict */) {
contravariant = !contravariant;
inferFromTypes(source, target);
contravariant = !contravariant;
}
else {
inferFromTypes(source, target);
}
}
function getInferenceInfoForType(type) {
if (type.flags & 8650752 /* TypeVariable */) {
for (var _i = 0, inferences_2 = inferences; _i < inferences_2.length; _i++) {
var inference = inferences_2[_i];
if (type === inference.typeParameter) {
return inference;
}
}
}
return undefined;
}
function getSingleTypeVariableFromIntersectionTypes(types) {
var typeVariable;
for (var _i = 0, types_15 = types; _i < types_15.length; _i++) {
var type = types_15[_i];
var t = type.flags & 2097152 /* Intersection */ && ts.find(type.types, function (t) { return !!getInferenceInfoForType(t); });
if (!t || typeVariable && t !== typeVariable) {
return undefined;
}
typeVariable = t;
}
return typeVariable;
}
function inferToMultipleTypes(source, targets, targetFlags) {
var typeVariableCount = 0;
if (targetFlags & 1048576 /* Union */) {
var nakedTypeVariable = void 0;
var sources = source.flags & 1048576 /* Union */ ? source.types : [source];
var matched_1 = new Array(sources.length);
var inferenceCircularity = false;
// First infer to types that are not naked type variables. For each source type we
// track whether inferences were made from that particular type to some target with
// equal priority (i.e. of equal quality) to what we would infer for a naked type
// parameter.
for (var _i = 0, targets_2 = targets; _i < targets_2.length; _i++) {
var t = targets_2[_i];
if (getInferenceInfoForType(t)) {
nakedTypeVariable = t;
typeVariableCount++;
}
else {
for (var i = 0; i < sources.length; i++) {
var saveInferencePriority = inferencePriority;
inferencePriority = 2048 /* MaxValue */;
inferFromTypes(sources[i], t);
if (inferencePriority === priority)
matched_1[i] = true;
inferenceCircularity = inferenceCircularity || inferencePriority === -1 /* Circularity */;
inferencePriority = Math.min(inferencePriority, saveInferencePriority);
}
}
}
if (typeVariableCount === 0) {
// If every target is an intersection of types containing a single naked type variable,
// make a lower priority inference to that type variable. This handles inferring from
// 'A | B' to 'T & (X | Y)' where we want to infer 'A | B' for T.
var intersectionTypeVariable = getSingleTypeVariableFromIntersectionTypes(targets);
if (intersectionTypeVariable) {
inferWithPriority(source, intersectionTypeVariable, 1 /* NakedTypeVariable */);
}
return;
}
// If the target has a single naked type variable and no inference circularities were
// encountered above (meaning we explored the types fully), create a union of the source
// types from which no inferences have been made so far and infer from that union to the
// naked type variable.
if (typeVariableCount === 1 && !inferenceCircularity) {
var unmatched = ts.flatMap(sources, function (s, i) { return matched_1[i] ? undefined : s; });
if (unmatched.length) {
inferFromTypes(getUnionType(unmatched), nakedTypeVariable);
return;
}
}
}
else {
// We infer from types that are not naked type variables first so that inferences we
// make from nested naked type variables and given slightly higher priority by virtue
// of being first in the candidates array.
for (var _a = 0, targets_3 = targets; _a < targets_3.length; _a++) {
var t = targets_3[_a];
if (getInferenceInfoForType(t)) {
typeVariableCount++;
}
else {
inferFromTypes(source, t);
}
}
}
// Inferences directly to naked type variables are given lower priority as they are
// less specific. For example, when inferring from Promise<string> to T | Promise<T>,
// we want to infer string for T, not Promise<string> | string. For intersection types
// we only infer to single naked type variables.
if (targetFlags & 2097152 /* Intersection */ ? typeVariableCount === 1 : typeVariableCount > 0) {
for (var _b = 0, targets_4 = targets; _b < targets_4.length; _b++) {
var t = targets_4[_b];
if (getInferenceInfoForType(t)) {
inferWithPriority(source, t, 1 /* NakedTypeVariable */);
}
}
}
}
function inferToMappedType(source, target, constraintType) {
if (constraintType.flags & 1048576 /* Union */) {
var result = false;
for (var _i = 0, _a = constraintType.types; _i < _a.length; _i++) {
var type = _a[_i];
result = inferToMappedType(source, target, type) || result;
}
return result;
}
if (constraintType.flags & 4194304 /* Index */) {
// We're inferring from some source type S to a homomorphic mapped type { [P in keyof T]: X },
// where T is a type variable. Use inferTypeForHomomorphicMappedType to infer a suitable source
// type and then make a secondary inference from that type to T. We make a secondary inference
// such that direct inferences to T get priority over inferences to Partial<T>, for example.
var inference = getInferenceInfoForType(constraintType.type);
if (inference && !inference.isFixed && !isFromInferenceBlockedSource(source)) {
var inferredType = inferTypeForHomomorphicMappedType(source, target, constraintType);
if (inferredType) {
// We assign a lower priority to inferences made from types containing non-inferrable
// types because we may only have a partial result (i.e. we may have failed to make
// reverse inferences for some properties).
inferWithPriority(inferredType, inference.typeParameter, ts.getObjectFlags(source) & 524288 /* NonInferrableType */ ?
16 /* PartialHomomorphicMappedType */ :
8 /* HomomorphicMappedType */);
}
}
return true;
}
if (constraintType.flags & 262144 /* TypeParameter */) {
// We're inferring from some source type S to a mapped type { [P in K]: X }, where K is a type
// parameter. First infer from 'keyof S' to K.
inferWithPriority(getIndexType(source), constraintType, 32 /* MappedTypeConstraint */);
// If K is constrained to a type C, also infer to C. Thus, for a mapped type { [P in K]: X },
// where K extends keyof T, we make the same inferences as for a homomorphic mapped type
// { [P in keyof T]: X }. This enables us to make meaningful inferences when the target is a
// Pick<T, K>.
var extendedConstraint = getConstraintOfType(constraintType);
if (extendedConstraint && inferToMappedType(source, target, extendedConstraint)) {
return true;
}
// If no inferences can be made to K's constraint, infer from a union of the property types
// in the source to the template type X.
var propTypes = ts.map(getPropertiesOfType(source), getTypeOfSymbol);
var indexTypes = ts.map(getIndexInfosOfType(source), function (info) { return info !== enumNumberIndexInfo ? info.type : neverType; });
inferFromTypes(getUnionType(ts.concatenate(propTypes, indexTypes)), getTemplateTypeFromMappedType(target));
return true;
}
return false;
}
function inferToConditionalType(source, target) {
if (source.flags & 16777216 /* Conditional */) {
inferFromTypes(source.checkType, target.checkType);
inferFromTypes(source.extendsType, target.extendsType);
inferFromTypes(getTrueTypeFromConditionalType(source), getTrueTypeFromConditionalType(target));
inferFromTypes(getFalseTypeFromConditionalType(source), getFalseTypeFromConditionalType(target));
}
else {
var savePriority = priority;
priority |= contravariant ? 64 /* ContravariantConditional */ : 0;
var targetTypes = [getTrueTypeFromConditionalType(target), getFalseTypeFromConditionalType(target)];
inferToMultipleTypes(source, targetTypes, target.flags);
priority = savePriority;
}
}
function inferToTemplateLiteralType(source, target) {
var matches = inferTypesFromTemplateLiteralType(source, target);
var types = target.types;
for (var i = 0; i < types.length; i++) {
inferFromTypes(matches ? matches[i] : neverType, types[i]);
}
}
function inferFromObjectTypes(source, target) {
if (ts.getObjectFlags(source) & 4 /* Reference */ && ts.getObjectFlags(target) & 4 /* Reference */ && (source.target === target.target || isArrayType(source) && isArrayType(target))) {
// If source and target are references to the same generic type, infer from type arguments
inferFromTypeArguments(getTypeArguments(source), getTypeArguments(target), getVariances(source.target));
return;
}
if (isGenericMappedType(source) && isGenericMappedType(target)) {
// The source and target types are generic types { [P in S]: X } and { [P in T]: Y }, so we infer
// from S to T and from X to Y.
inferFromTypes(getConstraintTypeFromMappedType(source), getConstraintTypeFromMappedType(target));
inferFromTypes(getTemplateTypeFromMappedType(source), getTemplateTypeFromMappedType(target));
var sourceNameType = getNameTypeFromMappedType(source);
var targetNameType = getNameTypeFromMappedType(target);
if (sourceNameType && targetNameType)
inferFromTypes(sourceNameType, targetNameType);
}
if (ts.getObjectFlags(target) & 32 /* Mapped */ && !target.declaration.nameType) {
var constraintType = getConstraintTypeFromMappedType(target);
if (inferToMappedType(source, target, constraintType)) {
return;
}
}
// Infer from the members of source and target only if the two types are possibly related
if (!typesDefinitelyUnrelated(source, target)) {
if (isArrayType(source) || isTupleType(source)) {
if (isTupleType(target)) {
var sourceArity = getTypeReferenceArity(source);
var targetArity = getTypeReferenceArity(target);
var elementTypes = getTypeArguments(target);
var elementFlags = target.target.elementFlags;
// When source and target are tuple types with the same structure (fixed, variadic, and rest are matched
// to the same kind in each position), simply infer between the element types.
if (isTupleType(source) && isTupleTypeStructureMatching(source, target)) {
for (var i = 0; i < targetArity; i++) {
inferFromTypes(getTypeArguments(source)[i], elementTypes[i]);
}
return;
}
var startLength = isTupleType(source) ? Math.min(source.target.fixedLength, target.target.fixedLength) : 0;
var endLength = Math.min(isTupleType(source) ? getEndElementCount(source.target, 3 /* Fixed */) : 0, target.target.hasRestElement ? getEndElementCount(target.target, 3 /* Fixed */) : 0);
// Infer between starting fixed elements.
for (var i = 0; i < startLength; i++) {
inferFromTypes(getTypeArguments(source)[i], elementTypes[i]);
}
if (!isTupleType(source) || sourceArity - startLength - endLength === 1 && source.target.elementFlags[startLength] & 4 /* Rest */) {
// Single rest element remains in source, infer from that to every element in target
var restType = getTypeArguments(source)[startLength];
for (var i = startLength; i < targetArity - endLength; i++) {
inferFromTypes(elementFlags[i] & 8 /* Variadic */ ? createArrayType(restType) : restType, elementTypes[i]);
}
}
else {
var middleLength = targetArity - startLength - endLength;
if (middleLength === 2 && elementFlags[startLength] & elementFlags[startLength + 1] & 8 /* Variadic */ && isTupleType(source)) {
// Middle of target is [...T, ...U] and source is tuple type
var targetInfo = getInferenceInfoForType(elementTypes[startLength]);
if (targetInfo && targetInfo.impliedArity !== undefined) {
// Infer slices from source based on implied arity of T.
inferFromTypes(sliceTupleType(source, startLength, endLength + sourceArity - targetInfo.impliedArity), elementTypes[startLength]);
inferFromTypes(sliceTupleType(source, startLength + targetInfo.impliedArity, endLength), elementTypes[startLength + 1]);
}
}
else if (middleLength === 1 && elementFlags[startLength] & 8 /* Variadic */) {
// Middle of target is exactly one variadic element. Infer the slice between the fixed parts in the source.
// If target ends in optional element(s), make a lower priority a speculative inference.
var endsInOptional = target.target.elementFlags[targetArity - 1] & 2 /* Optional */;
var sourceSlice = isTupleType(source) ? sliceTupleType(source, startLength, endLength) : createArrayType(getTypeArguments(source)[0]);
inferWithPriority(sourceSlice, elementTypes[startLength], endsInOptional ? 2 /* SpeculativeTuple */ : 0);
}
else if (middleLength === 1 && elementFlags[startLength] & 4 /* Rest */) {
// Middle of target is exactly one rest element. If middle of source is not empty, infer union of middle element types.
var restType = isTupleType(source) ? getElementTypeOfSliceOfTupleType(source, startLength, endLength) : getTypeArguments(source)[0];
if (restType) {
inferFromTypes(restType, elementTypes[startLength]);
}
}
}
// Infer between ending fixed elements
for (var i = 0; i < endLength; i++) {
inferFromTypes(getTypeArguments(source)[sourceArity - i - 1], elementTypes[targetArity - i - 1]);
}
return;
}
if (isArrayType(target)) {
inferFromIndexTypes(source, target);
return;
}
}
inferFromProperties(source, target);
inferFromSignatures(source, target, 0 /* Call */);
inferFromSignatures(source, target, 1 /* Construct */);
inferFromIndexTypes(source, target);
}
}
function inferFromProperties(source, target) {
var properties = getPropertiesOfObjectType(target);
for (var _i = 0, properties_3 = properties; _i < properties_3.length; _i++) {
var targetProp = properties_3[_i];
var sourceProp = getPropertyOfType(source, targetProp.escapedName);
if (sourceProp) {
inferFromTypes(getTypeOfSymbol(sourceProp), getTypeOfSymbol(targetProp));
}
}
}
function inferFromSignatures(source, target, kind) {
var sourceSignatures = getSignaturesOfType(source, kind);
var targetSignatures = getSignaturesOfType(target, kind);
var sourceLen = sourceSignatures.length;
var targetLen = targetSignatures.length;
var len = sourceLen < targetLen ? sourceLen : targetLen;
var skipParameters = !!(ts.getObjectFlags(source) & 524288 /* NonInferrableType */);
for (var i = 0; i < len; i++) {
inferFromSignature(getBaseSignature(sourceSignatures[sourceLen - len + i]), getErasedSignature(targetSignatures[targetLen - len + i]), skipParameters);
}
}
function inferFromSignature(source, target, skipParameters) {
if (!skipParameters) {
var saveBivariant = bivariant;
var kind = target.declaration ? target.declaration.kind : 0 /* Unknown */;
// Once we descend into a bivariant signature we remain bivariant for all nested inferences
bivariant = bivariant || kind === 167 /* MethodDeclaration */ || kind === 166 /* MethodSignature */ || kind === 169 /* Constructor */;
applyToParameterTypes(source, target, inferFromContravariantTypes);
bivariant = saveBivariant;
}
applyToReturnTypes(source, target, inferFromTypes);
}
function inferFromIndexTypes(source, target) {
// Inferences across mapped type index signatures are pretty much the same a inferences to homomorphic variables
var priority = (ts.getObjectFlags(source) & ts.getObjectFlags(target) & 32 /* Mapped */) ? 8 /* HomomorphicMappedType */ : 0;
var indexInfos = getIndexInfosOfType(target);
if (isObjectTypeWithInferableIndex(source)) {
for (var _i = 0, indexInfos_4 = indexInfos; _i < indexInfos_4.length; _i++) {
var targetInfo = indexInfos_4[_i];
var propTypes = [];
for (var _a = 0, _b = getPropertiesOfType(source); _a < _b.length; _a++) {
var prop = _b[_a];
if (isApplicableIndexType(getLiteralTypeFromProperty(prop, 8576 /* StringOrNumberLiteralOrUnique */), targetInfo.keyType)) {
var propType = getTypeOfSymbol(prop);
propTypes.push(prop.flags & 16777216 /* Optional */ ? removeMissingOrUndefinedType(propType) : propType);
}
}
for (var _c = 0, _d = getIndexInfosOfType(source); _c < _d.length; _c++) {
var info = _d[_c];
if (isApplicableIndexType(info.keyType, targetInfo.keyType)) {
propTypes.push(info.type);
}
}
if (propTypes.length) {
inferWithPriority(getUnionType(propTypes), targetInfo.type, priority);
}
}
}
for (var _e = 0, indexInfos_5 = indexInfos; _e < indexInfos_5.length; _e++) {
var targetInfo = indexInfos_5[_e];
var sourceInfo = getApplicableIndexInfo(source, targetInfo.keyType);
if (sourceInfo) {
inferWithPriority(sourceInfo.type, targetInfo.type, priority);
}
}
}
}
function isTypeOrBaseIdenticalTo(s, t) {
return exactOptionalPropertyTypes && t === missingType ? s === t :
(isTypeIdenticalTo(s, t) || !!(t.flags & 4 /* String */ && s.flags & 128 /* StringLiteral */ || t.flags & 8 /* Number */ && s.flags & 256 /* NumberLiteral */));
}
function isTypeCloselyMatchedBy(s, t) {
return !!(s.flags & 524288 /* Object */ && t.flags & 524288 /* Object */ && s.symbol && s.symbol === t.symbol ||
s.aliasSymbol && s.aliasTypeArguments && s.aliasSymbol === t.aliasSymbol);
}
function hasPrimitiveConstraint(type) {
var constraint = getConstraintOfTypeParameter(type);
return !!constraint && maybeTypeOfKind(constraint.flags & 16777216 /* Conditional */ ? getDefaultConstraintOfConditionalType(constraint) : constraint, 131068 /* Primitive */ | 4194304 /* Index */ | 134217728 /* TemplateLiteral */ | 268435456 /* StringMapping */);
}
function isObjectLiteralType(type) {
return !!(ts.getObjectFlags(type) & 128 /* ObjectLiteral */);
}
function isObjectOrArrayLiteralType(type) {
return !!(ts.getObjectFlags(type) & (128 /* ObjectLiteral */ | 32768 /* ArrayLiteral */));
}
function unionObjectAndArrayLiteralCandidates(candidates) {
if (candidates.length > 1) {
var objectLiterals = ts.filter(candidates, isObjectOrArrayLiteralType);
if (objectLiterals.length) {
var literalsType = getUnionType(objectLiterals, 2 /* Subtype */);
return ts.concatenate(ts.filter(candidates, function (t) { return !isObjectOrArrayLiteralType(t); }), [literalsType]);
}
}
return candidates;
}
function getContravariantInference(inference) {
return inference.priority & 416 /* PriorityImpliesCombination */ ? getIntersectionType(inference.contraCandidates) : getCommonSubtype(inference.contraCandidates);
}
function getCovariantInference(inference, signature) {
// Extract all object and array literal types and replace them with a single widened and normalized type.
var candidates = unionObjectAndArrayLiteralCandidates(inference.candidates);
// We widen inferred literal types if
// all inferences were made to top-level occurrences of the type parameter, and
// the type parameter has no constraint or its constraint includes no primitive or literal types, and
// the type parameter was fixed during inference or does not occur at top-level in the return type.
var primitiveConstraint = hasPrimitiveConstraint(inference.typeParameter);
var widenLiteralTypes = !primitiveConstraint && inference.topLevel &&
(inference.isFixed || !isTypeParameterAtTopLevel(getReturnTypeOfSignature(signature), inference.typeParameter));
var baseCandidates = primitiveConstraint ? ts.sameMap(candidates, getRegularTypeOfLiteralType) :
widenLiteralTypes ? ts.sameMap(candidates, getWidenedLiteralType) :
candidates;
// If all inferences were made from a position that implies a combined result, infer a union type.
// Otherwise, infer a common supertype.
var unwidenedType = inference.priority & 416 /* PriorityImpliesCombination */ ?
getUnionType(baseCandidates, 2 /* Subtype */) :
getCommonSupertype(baseCandidates);
return getWidenedType(unwidenedType);
}
function getInferredType(context, index) {
var inference = context.inferences[index];
if (!inference.inferredType) {
var inferredType = void 0;
var signature = context.signature;
if (signature) {
var inferredCovariantType = inference.candidates ? getCovariantInference(inference, signature) : undefined;
if (inference.contraCandidates) {
var inferredContravariantType = getContravariantInference(inference);
// If we have both co- and contra-variant inferences, we prefer the contra-variant inference
// unless the co-variant inference is a subtype and not 'never'.
inferredType = inferredCovariantType && !(inferredCovariantType.flags & 131072 /* Never */) &&
isTypeSubtypeOf(inferredCovariantType, inferredContravariantType) ?
inferredCovariantType : inferredContravariantType;
}
else if (inferredCovariantType) {
inferredType = inferredCovariantType;
}
else if (context.flags & 1 /* NoDefault */) {
// We use silentNeverType as the wildcard that signals no inferences.
inferredType = silentNeverType;
}
else {
// Infer either the default or the empty object type when no inferences were
// made. It is important to remember that in this case, inference still
// succeeds, meaning there is no error for not having inference candidates. An
// inference error only occurs when there are *conflicting* candidates, i.e.
// candidates with no common supertype.
var defaultType = getDefaultFromTypeParameter(inference.typeParameter);
if (defaultType) {
// Instantiate the default type. Any forward reference to a type
// parameter should be instantiated to the empty object type.
inferredType = instantiateType(defaultType, mergeTypeMappers(createBackreferenceMapper(context, index), context.nonFixingMapper));
}
}
}
else {
inferredType = getTypeFromInference(inference);
}
inference.inferredType = inferredType || getDefaultTypeArgumentType(!!(context.flags & 2 /* AnyDefault */));
var constraint = getConstraintOfTypeParameter(inference.typeParameter);
if (constraint) {
var instantiatedConstraint = instantiateType(constraint, context.nonFixingMapper);
if (!inferredType || !context.compareTypes(inferredType, getTypeWithThisArgument(instantiatedConstraint, inferredType))) {
inference.inferredType = inferredType = instantiatedConstraint;
}
}
}
return inference.inferredType;
}
function getDefaultTypeArgumentType(isInJavaScriptFile) {
return isInJavaScriptFile ? anyType : unknownType;
}
function getInferredTypes(context) {
var result = [];
for (var i = 0; i < context.inferences.length; i++) {
result.push(getInferredType(context, i));
}
return result;
}
// EXPRESSION TYPE CHECKING
function getCannotFindNameDiagnosticForName(node) {
switch (node.escapedText) {
case "document":
case "console":
return ts.Diagnostics.Cannot_find_name_0_Do_you_need_to_change_your_target_library_Try_changing_the_lib_compiler_option_to_include_dom;
case "$":
return compilerOptions.types
? ts.Diagnostics.Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_jQuery_Try_npm_i_save_dev_types_Slashjquery_and_then_add_jquery_to_the_types_field_in_your_tsconfig
: ts.Diagnostics.Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_jQuery_Try_npm_i_save_dev_types_Slashjquery;
case "describe":
case "suite":
case "it":
case "test":
return compilerOptions.types
? ts.Diagnostics.Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_a_test_runner_Try_npm_i_save_dev_types_Slashjest_or_npm_i_save_dev_types_Slashmocha_and_then_add_jest_or_mocha_to_the_types_field_in_your_tsconfig
: ts.Diagnostics.Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_a_test_runner_Try_npm_i_save_dev_types_Slashjest_or_npm_i_save_dev_types_Slashmocha;
case "process":
case "require":
case "Buffer":
case "module":
return compilerOptions.types
? ts.Diagnostics.Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_node_Try_npm_i_save_dev_types_Slashnode_and_then_add_node_to_the_types_field_in_your_tsconfig
: ts.Diagnostics.Cannot_find_name_0_Do_you_need_to_install_type_definitions_for_node_Try_npm_i_save_dev_types_Slashnode;
case "Map":
case "Set":
case "Promise":
case "Symbol":
case "WeakMap":
case "WeakSet":
case "Iterator":
case "AsyncIterator":
case "SharedArrayBuffer":
case "Atomics":
case "AsyncIterable":
case "AsyncIterableIterator":
case "AsyncGenerator":
case "AsyncGeneratorFunction":
case "BigInt":
case "Reflect":
case "BigInt64Array":
case "BigUint64Array":
return ts.Diagnostics.Cannot_find_name_0_Do_you_need_to_change_your_target_library_Try_changing_the_lib_compiler_option_to_1_or_later;
default:
if (node.parent.kind === 292 /* ShorthandPropertyAssignment */) {
return ts.Diagnostics.No_value_exists_in_scope_for_the_shorthand_property_0_Either_declare_one_or_provide_an_initializer;
}
else {
return ts.Diagnostics.Cannot_find_name_0;
}
}
}
function getResolvedSymbol(node) {
var links = getNodeLinks(node);
if (!links.resolvedSymbol) {
links.resolvedSymbol = !ts.nodeIsMissing(node) &&
resolveName(node, node.escapedText, 111551 /* Value */ | 1048576 /* ExportValue */, getCannotFindNameDiagnosticForName(node), node, !ts.isWriteOnlyAccess(node),
/*excludeGlobals*/ false,
/*issueSuggestions*/ true) || unknownSymbol;
}
return links.resolvedSymbol;
}
function isInTypeQuery(node) {
// TypeScript 1.0 spec (April 2014): 3.6.3
// A type query consists of the keyword typeof followed by an expression.
// The expression is restricted to a single identifier or a sequence of identifiers separated by periods
return !!ts.findAncestor(node, function (n) { return n.kind === 179 /* TypeQuery */ ? true : n.kind === 79 /* Identifier */ || n.kind === 159 /* QualifiedName */ ? false : "quit"; });
}
// Return the flow cache key for a "dotted name" (i.e. a sequence of identifiers
// separated by dots). The key consists of the id of the symbol referenced by the
// leftmost identifier followed by zero or more property names separated by dots.
// The result is undefined if the reference isn't a dotted name.
function getFlowCacheKey(node, declaredType, initialType, flowContainer) {
switch (node.kind) {
case 79 /* Identifier */:
var symbol = getResolvedSymbol(node);
return symbol !== unknownSymbol ? (flowContainer ? getNodeId(flowContainer) : "-1") + "|" + getTypeId(declaredType) + "|" + getTypeId(initialType) + "|" + getSymbolId(symbol) : undefined;
case 108 /* ThisKeyword */:
return "0|" + (flowContainer ? getNodeId(flowContainer) : "-1") + "|" + getTypeId(declaredType) + "|" + getTypeId(initialType);
case 228 /* NonNullExpression */:
case 210 /* ParenthesizedExpression */:
return getFlowCacheKey(node.expression, declaredType, initialType, flowContainer);
case 159 /* QualifiedName */:
var left = getFlowCacheKey(node.left, declaredType, initialType, flowContainer);
return left && left + "." + node.right.escapedText;
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
var propName = getAccessedPropertyName(node);
if (propName !== undefined) {
var key = getFlowCacheKey(node.expression, declaredType, initialType, flowContainer);
return key && key + "." + propName;
}
}
return undefined;
}
function isMatchingReference(source, target) {
switch (target.kind) {
case 210 /* ParenthesizedExpression */:
case 228 /* NonNullExpression */:
return isMatchingReference(source, target.expression);
case 219 /* BinaryExpression */:
return (ts.isAssignmentExpression(target) && isMatchingReference(source, target.left)) ||
(ts.isBinaryExpression(target) && target.operatorToken.kind === 27 /* CommaToken */ && isMatchingReference(source, target.right));
}
switch (source.kind) {
case 229 /* MetaProperty */:
return target.kind === 229 /* MetaProperty */
&& source.keywordToken === target.keywordToken
&& source.name.escapedText === target.name.escapedText;
case 79 /* Identifier */:
case 80 /* PrivateIdentifier */:
return ts.isThisInTypeQuery(source) ?
target.kind === 108 /* ThisKeyword */ :
target.kind === 79 /* Identifier */ && getResolvedSymbol(source) === getResolvedSymbol(target) ||
(target.kind === 252 /* VariableDeclaration */ || target.kind === 201 /* BindingElement */) &&
getExportSymbolOfValueSymbolIfExported(getResolvedSymbol(source)) === getSymbolOfNode(target);
case 108 /* ThisKeyword */:
return target.kind === 108 /* ThisKeyword */;
case 106 /* SuperKeyword */:
return target.kind === 106 /* SuperKeyword */;
case 228 /* NonNullExpression */:
case 210 /* ParenthesizedExpression */:
return isMatchingReference(source.expression, target);
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
return ts.isAccessExpression(target) &&
getAccessedPropertyName(source) === getAccessedPropertyName(target) &&
isMatchingReference(source.expression, target.expression);
case 159 /* QualifiedName */:
return ts.isAccessExpression(target) &&
source.right.escapedText === getAccessedPropertyName(target) &&
isMatchingReference(source.left, target.expression);
case 219 /* BinaryExpression */:
return (ts.isBinaryExpression(source) && source.operatorToken.kind === 27 /* CommaToken */ && isMatchingReference(source.right, target));
}
return false;
}
// Given a source x, check if target matches x or is an && operation with an operand that matches x.
function containsTruthyCheck(source, target) {
return isMatchingReference(source, target) ||
(target.kind === 219 /* BinaryExpression */ && target.operatorToken.kind === 55 /* AmpersandAmpersandToken */ &&
(containsTruthyCheck(source, target.left) || containsTruthyCheck(source, target.right)));
}
function getPropertyAccess(expr) {
if (ts.isAccessExpression(expr)) {
return expr;
}
if (ts.isIdentifier(expr)) {
var symbol = getResolvedSymbol(expr);
if (isConstVariable(symbol)) {
var declaration = symbol.valueDeclaration;
// Given 'const x = obj.kind', allow 'x' as an alias for 'obj.kind'
if (ts.isVariableDeclaration(declaration) && !declaration.type && declaration.initializer && ts.isAccessExpression(declaration.initializer)) {
return declaration.initializer;
}
// Given 'const { kind: x } = obj', allow 'x' as an alias for 'obj.kind'
if (ts.isBindingElement(declaration) && !declaration.initializer) {
var parent = declaration.parent.parent;
if (ts.isVariableDeclaration(parent) && !parent.type && parent.initializer && (ts.isIdentifier(parent.initializer) || ts.isAccessExpression(parent.initializer))) {
return declaration;
}
}
}
}
return undefined;
}
function getAccessedPropertyName(access) {
var propertyName;
return access.kind === 204 /* PropertyAccessExpression */ ? access.name.escapedText :
access.kind === 205 /* ElementAccessExpression */ && ts.isStringOrNumericLiteralLike(access.argumentExpression) ? ts.escapeLeadingUnderscores(access.argumentExpression.text) :
access.kind === 201 /* BindingElement */ && (propertyName = getDestructuringPropertyName(access)) ? ts.escapeLeadingUnderscores(propertyName) :
undefined;
}
function containsMatchingReference(source, target) {
while (ts.isAccessExpression(source)) {
source = source.expression;
if (isMatchingReference(source, target)) {
return true;
}
}
return false;
}
function optionalChainContainsReference(source, target) {
while (ts.isOptionalChain(source)) {
source = source.expression;
if (isMatchingReference(source, target)) {
return true;
}
}
return false;
}
function isDiscriminantProperty(type, name) {
if (type && type.flags & 1048576 /* Union */) {
var prop = getUnionOrIntersectionProperty(type, name);
if (prop && ts.getCheckFlags(prop) & 2 /* SyntheticProperty */) {
if (prop.isDiscriminantProperty === undefined) {
prop.isDiscriminantProperty =
(prop.checkFlags & 192 /* Discriminant */) === 192 /* Discriminant */ &&
!maybeTypeOfKind(getTypeOfSymbol(prop), 465829888 /* Instantiable */ & ~134217728 /* TemplateLiteral */);
}
return !!prop.isDiscriminantProperty;
}
}
return false;
}
function findDiscriminantProperties(sourceProperties, target) {
var result;
for (var _i = 0, sourceProperties_2 = sourceProperties; _i < sourceProperties_2.length; _i++) {
var sourceProperty = sourceProperties_2[_i];
if (isDiscriminantProperty(target, sourceProperty.escapedName)) {
if (result) {
result.push(sourceProperty);
continue;
}
result = [sourceProperty];
}
}
return result;
}
// Given a set of constituent types and a property name, create and return a map keyed by the literal
// types of the property by that name in each constituent type. No map is returned if some key property
// has a non-literal type or if less than 10 or less than 50% of the constituents have a unique key.
// Entries with duplicate keys have unknownType as the value.
function mapTypesByKeyProperty(types, name) {
var map = new ts.Map();
var count = 0;
var _loop_22 = function (type) {
if (type.flags & (524288 /* Object */ | 2097152 /* Intersection */ | 58982400 /* InstantiableNonPrimitive */)) {
var discriminant = getTypeOfPropertyOfType(type, name);
if (discriminant) {
if (!isLiteralType(discriminant)) {
return { value: undefined };
}
var duplicate_1 = false;
forEachType(discriminant, function (t) {
var id = getTypeId(getRegularTypeOfLiteralType(t));
var existing = map.get(id);
if (!existing) {
map.set(id, type);
}
else if (existing !== unknownType) {
map.set(id, unknownType);
duplicate_1 = true;
}
});
if (!duplicate_1)
count++;
}
}
};
for (var _i = 0, types_16 = types; _i < types_16.length; _i++) {
var type = types_16[_i];
var state_8 = _loop_22(type);
if (typeof state_8 === "object")
return state_8.value;
}
return count >= 10 && count * 2 >= types.length ? map : undefined;
}
// Return the name of a discriminant property for which it was possible and feasible to construct a map of
// constituent types keyed by the literal types of the property by that name in each constituent type.
function getKeyPropertyName(unionType) {
var types = unionType.types;
// We only construct maps for large unions with non-primitive constituents.
if (types.length < 10 || ts.getObjectFlags(unionType) & 65536 /* PrimitiveUnion */) {
return undefined;
}
if (unionType.keyPropertyName === undefined) {
// The candidate key property name is the name of the first property with a unit type in one of the
// constituent types.
var keyPropertyName = ts.forEach(types, function (t) {
return t.flags & (524288 /* Object */ | 58982400 /* InstantiableNonPrimitive */) ?
ts.forEach(getPropertiesOfType(t), function (p) { return isUnitType(getTypeOfSymbol(p)) ? p.escapedName : undefined; }) :
undefined;
});
var mapByKeyProperty = keyPropertyName && mapTypesByKeyProperty(types, keyPropertyName);
unionType.keyPropertyName = mapByKeyProperty ? keyPropertyName : "";
unionType.constituentMap = mapByKeyProperty;
}
return unionType.keyPropertyName.length ? unionType.keyPropertyName : undefined;
}
// Given a union type for which getKeyPropertyName returned a non-undefined result, return the constituent
// that corresponds to the given key type for that property name.
function getConstituentTypeForKeyType(unionType, keyType) {
var _a;
var result = (_a = unionType.constituentMap) === null || _a === void 0 ? void 0 : _a.get(getTypeId(getRegularTypeOfLiteralType(keyType)));
return result !== unknownType ? result : undefined;
}
function getMatchingUnionConstituentForType(unionType, type) {
var keyPropertyName = getKeyPropertyName(unionType);
var propType = keyPropertyName && getTypeOfPropertyOfType(type, keyPropertyName);
return propType && getConstituentTypeForKeyType(unionType, propType);
}
function getMatchingUnionConstituentForObjectLiteral(unionType, node) {
var keyPropertyName = getKeyPropertyName(unionType);
var propNode = keyPropertyName && ts.find(node.properties, function (p) { return p.symbol && p.kind === 291 /* PropertyAssignment */ &&
p.symbol.escapedName === keyPropertyName && isPossiblyDiscriminantValue(p.initializer); });
var propType = propNode && getTypeOfExpression(propNode.initializer);
return propType && getConstituentTypeForKeyType(unionType, propType);
}
function isOrContainsMatchingReference(source, target) {
return isMatchingReference(source, target) || containsMatchingReference(source, target);
}
function hasMatchingArgument(expression, reference) {
if (expression.arguments) {
for (var _i = 0, _a = expression.arguments; _i < _a.length; _i++) {
var argument = _a[_i];
if (isOrContainsMatchingReference(reference, argument)) {
return true;
}
}
}
if (expression.expression.kind === 204 /* PropertyAccessExpression */ &&
isOrContainsMatchingReference(reference, expression.expression.expression)) {
return true;
}
return false;
}
function getFlowNodeId(flow) {
if (!flow.id || flow.id < 0) {
flow.id = nextFlowId;
nextFlowId++;
}
return flow.id;
}
function typeMaybeAssignableTo(source, target) {
if (!(source.flags & 1048576 /* Union */)) {
return isTypeAssignableTo(source, target);
}
for (var _i = 0, _a = source.types; _i < _a.length; _i++) {
var t = _a[_i];
if (isTypeAssignableTo(t, target)) {
return true;
}
}
return false;
}
// Remove those constituent types of declaredType to which no constituent type of assignedType is assignable.
// For example, when a variable of type number | string | boolean is assigned a value of type number | boolean,
// we remove type string.
function getAssignmentReducedType(declaredType, assignedType) {
if (declaredType !== assignedType) {
if (assignedType.flags & 131072 /* Never */) {
return assignedType;
}
var reducedType = filterType(declaredType, function (t) { return typeMaybeAssignableTo(assignedType, t); });
if (assignedType.flags & 512 /* BooleanLiteral */ && isFreshLiteralType(assignedType)) {
reducedType = mapType(reducedType, getFreshTypeOfLiteralType); // Ensure that if the assignment is a fresh type, that we narrow to fresh types
}
// Our crude heuristic produces an invalid result in some cases: see GH#26130.
// For now, when that happens, we give up and don't narrow at all. (This also
// means we'll never narrow for erroneous assignments where the assigned type
// is not assignable to the declared type.)
if (isTypeAssignableTo(assignedType, reducedType)) {
return reducedType;
}
}
return declaredType;
}
function isFunctionObjectType(type) {
// We do a quick check for a "bind" property before performing the more expensive subtype
// check. This gives us a quicker out in the common case where an object type is not a function.
var resolved = resolveStructuredTypeMembers(type);
return !!(resolved.callSignatures.length || resolved.constructSignatures.length ||
resolved.members.get("bind") && isTypeSubtypeOf(type, globalFunctionType));
}
function getTypeFacts(type, ignoreObjects) {
if (ignoreObjects === void 0) { ignoreObjects = false; }
var flags = type.flags;
if (flags & 4 /* String */) {
return strictNullChecks ? 16317953 /* StringStrictFacts */ : 16776705 /* StringFacts */;
}
if (flags & 128 /* StringLiteral */) {
var isEmpty = type.value === "";
return strictNullChecks ?
isEmpty ? 12123649 /* EmptyStringStrictFacts */ : 7929345 /* NonEmptyStringStrictFacts */ :
isEmpty ? 12582401 /* EmptyStringFacts */ : 16776705 /* NonEmptyStringFacts */;
}
if (flags & (8 /* Number */ | 32 /* Enum */)) {
return strictNullChecks ? 16317698 /* NumberStrictFacts */ : 16776450 /* NumberFacts */;
}
if (flags & 256 /* NumberLiteral */) {
var isZero = type.value === 0;
return strictNullChecks ?
isZero ? 12123394 /* ZeroNumberStrictFacts */ : 7929090 /* NonZeroNumberStrictFacts */ :
isZero ? 12582146 /* ZeroNumberFacts */ : 16776450 /* NonZeroNumberFacts */;
}
if (flags & 64 /* BigInt */) {
return strictNullChecks ? 16317188 /* BigIntStrictFacts */ : 16775940 /* BigIntFacts */;
}
if (flags & 2048 /* BigIntLiteral */) {
var isZero = isZeroBigInt(type);
return strictNullChecks ?
isZero ? 12122884 /* ZeroBigIntStrictFacts */ : 7928580 /* NonZeroBigIntStrictFacts */ :
isZero ? 12581636 /* ZeroBigIntFacts */ : 16775940 /* NonZeroBigIntFacts */;
}
if (flags & 16 /* Boolean */) {
return strictNullChecks ? 16316168 /* BooleanStrictFacts */ : 16774920 /* BooleanFacts */;
}
if (flags & 528 /* BooleanLike */) {
return strictNullChecks ?
(type === falseType || type === regularFalseType) ? 12121864 /* FalseStrictFacts */ : 7927560 /* TrueStrictFacts */ :
(type === falseType || type === regularFalseType) ? 12580616 /* FalseFacts */ : 16774920 /* TrueFacts */;
}
if (flags & 524288 /* Object */ && !ignoreObjects) {
return ts.getObjectFlags(type) & 16 /* Anonymous */ && isEmptyObjectType(type) ?
strictNullChecks ? 16318463 /* EmptyObjectStrictFacts */ : 16777215 /* EmptyObjectFacts */ :
isFunctionObjectType(type) ?
strictNullChecks ? 7880640 /* FunctionStrictFacts */ : 16728000 /* FunctionFacts */ :
strictNullChecks ? 7888800 /* ObjectStrictFacts */ : 16736160 /* ObjectFacts */;
}
if (flags & (16384 /* Void */ | 32768 /* Undefined */)) {
return 9830144 /* UndefinedFacts */;
}
if (flags & 65536 /* Null */) {
return 9363232 /* NullFacts */;
}
if (flags & 12288 /* ESSymbolLike */) {
return strictNullChecks ? 7925520 /* SymbolStrictFacts */ : 16772880 /* SymbolFacts */;
}
if (flags & 67108864 /* NonPrimitive */) {
return strictNullChecks ? 7888800 /* ObjectStrictFacts */ : 16736160 /* ObjectFacts */;
}
if (flags & 131072 /* Never */) {
return 0 /* None */;
}
if (flags & 465829888 /* Instantiable */) {
return !isPatternLiteralType(type) ? getTypeFacts(getBaseConstraintOfType(type) || unknownType, ignoreObjects) :
strictNullChecks ? 7929345 /* NonEmptyStringStrictFacts */ : 16776705 /* NonEmptyStringFacts */;
}
if (flags & 1048576 /* Union */) {
return ts.reduceLeft(type.types, function (facts, t) { return facts | getTypeFacts(t, ignoreObjects); }, 0 /* None */);
}
if (flags & 2097152 /* Intersection */) {
// When an intersection contains a primitive type we ignore object type constituents as they are
// presumably type tags. For example, in string & { __kind__: "name" } we ignore the object type.
ignoreObjects || (ignoreObjects = maybeTypeOfKind(type, 131068 /* Primitive */));
return ts.reduceLeft(type.types, function (facts, t) { return facts & getTypeFacts(t, ignoreObjects); }, 16777215 /* All */);
}
return 16777215 /* All */;
}
function getTypeWithFacts(type, include) {
return filterType(type, function (t) { return (getTypeFacts(t) & include) !== 0; });
}
function getTypeWithDefault(type, defaultExpression) {
return defaultExpression ?
getUnionType([getNonUndefinedType(type), getTypeOfExpression(defaultExpression)]) :
type;
}
function getTypeOfDestructuredProperty(type, name) {
var _a;
var nameType = getLiteralTypeFromPropertyName(name);
if (!isTypeUsableAsPropertyName(nameType))
return errorType;
var text = getPropertyNameFromType(nameType);
return getTypeOfPropertyOfType(type, text) || includeUndefinedInIndexSignature((_a = getApplicableIndexInfoForName(type, text)) === null || _a === void 0 ? void 0 : _a.type) || errorType;
}
function getTypeOfDestructuredArrayElement(type, index) {
return everyType(type, isTupleLikeType) && getTupleElementType(type, index) ||
includeUndefinedInIndexSignature(checkIteratedTypeOrElementType(65 /* Destructuring */, type, undefinedType, /*errorNode*/ undefined)) ||
errorType;
}
function includeUndefinedInIndexSignature(type) {
if (!type)
return type;
return compilerOptions.noUncheckedIndexedAccess ?
getUnionType([type, undefinedType]) :
type;
}
function getTypeOfDestructuredSpreadExpression(type) {
return createArrayType(checkIteratedTypeOrElementType(65 /* Destructuring */, type, undefinedType, /*errorNode*/ undefined) || errorType);
}
function getAssignedTypeOfBinaryExpression(node) {
var isDestructuringDefaultAssignment = node.parent.kind === 202 /* ArrayLiteralExpression */ && isDestructuringAssignmentTarget(node.parent) ||
node.parent.kind === 291 /* PropertyAssignment */ && isDestructuringAssignmentTarget(node.parent.parent);
return isDestructuringDefaultAssignment ?
getTypeWithDefault(getAssignedType(node), node.right) :
getTypeOfExpression(node.right);
}
function isDestructuringAssignmentTarget(parent) {
return parent.parent.kind === 219 /* BinaryExpression */ && parent.parent.left === parent ||
parent.parent.kind === 242 /* ForOfStatement */ && parent.parent.initializer === parent;
}
function getAssignedTypeOfArrayLiteralElement(node, element) {
return getTypeOfDestructuredArrayElement(getAssignedType(node), node.elements.indexOf(element));
}
function getAssignedTypeOfSpreadExpression(node) {
return getTypeOfDestructuredSpreadExpression(getAssignedType(node.parent));
}
function getAssignedTypeOfPropertyAssignment(node) {
return getTypeOfDestructuredProperty(getAssignedType(node.parent), node.name);
}
function getAssignedTypeOfShorthandPropertyAssignment(node) {
return getTypeWithDefault(getAssignedTypeOfPropertyAssignment(node), node.objectAssignmentInitializer);
}
function getAssignedType(node) {
var parent = node.parent;
switch (parent.kind) {
case 241 /* ForInStatement */:
return stringType;
case 242 /* ForOfStatement */:
return checkRightHandSideOfForOf(parent) || errorType;
case 219 /* BinaryExpression */:
return getAssignedTypeOfBinaryExpression(parent);
case 213 /* DeleteExpression */:
return undefinedType;
case 202 /* ArrayLiteralExpression */:
return getAssignedTypeOfArrayLiteralElement(parent, node);
case 223 /* SpreadElement */:
return getAssignedTypeOfSpreadExpression(parent);
case 291 /* PropertyAssignment */:
return getAssignedTypeOfPropertyAssignment(parent);
case 292 /* ShorthandPropertyAssignment */:
return getAssignedTypeOfShorthandPropertyAssignment(parent);
}
return errorType;
}
function getInitialTypeOfBindingElement(node) {
var pattern = node.parent;
var parentType = getInitialType(pattern.parent);
var type = pattern.kind === 199 /* ObjectBindingPattern */ ?
getTypeOfDestructuredProperty(parentType, node.propertyName || node.name) :
!node.dotDotDotToken ?
getTypeOfDestructuredArrayElement(parentType, pattern.elements.indexOf(node)) :
getTypeOfDestructuredSpreadExpression(parentType);
return getTypeWithDefault(type, node.initializer);
}
function getTypeOfInitializer(node) {
// Return the cached type if one is available. If the type of the variable was inferred
// from its initializer, we'll already have cached the type. Otherwise we compute it now
// without caching such that transient types are reflected.
var links = getNodeLinks(node);
return links.resolvedType || getTypeOfExpression(node);
}
function getInitialTypeOfVariableDeclaration(node) {
if (node.initializer) {
return getTypeOfInitializer(node.initializer);
}
if (node.parent.parent.kind === 241 /* ForInStatement */) {
return stringType;
}
if (node.parent.parent.kind === 242 /* ForOfStatement */) {
return checkRightHandSideOfForOf(node.parent.parent) || errorType;
}
return errorType;
}
function getInitialType(node) {
return node.kind === 252 /* VariableDeclaration */ ?
getInitialTypeOfVariableDeclaration(node) :
getInitialTypeOfBindingElement(node);
}
function isEmptyArrayAssignment(node) {
return node.kind === 252 /* VariableDeclaration */ && node.initializer &&
isEmptyArrayLiteral(node.initializer) ||
node.kind !== 201 /* BindingElement */ && node.parent.kind === 219 /* BinaryExpression */ &&
isEmptyArrayLiteral(node.parent.right);
}
function getReferenceCandidate(node) {
switch (node.kind) {
case 210 /* ParenthesizedExpression */:
return getReferenceCandidate(node.expression);
case 219 /* BinaryExpression */:
switch (node.operatorToken.kind) {
case 63 /* EqualsToken */:
case 75 /* BarBarEqualsToken */:
case 76 /* AmpersandAmpersandEqualsToken */:
case 77 /* QuestionQuestionEqualsToken */:
return getReferenceCandidate(node.left);
case 27 /* CommaToken */:
return getReferenceCandidate(node.right);
}
}
return node;
}
function getReferenceRoot(node) {
var parent = node.parent;
return parent.kind === 210 /* ParenthesizedExpression */ ||
parent.kind === 219 /* BinaryExpression */ && parent.operatorToken.kind === 63 /* EqualsToken */ && parent.left === node ||
parent.kind === 219 /* BinaryExpression */ && parent.operatorToken.kind === 27 /* CommaToken */ && parent.right === node ?
getReferenceRoot(parent) : node;
}
function getTypeOfSwitchClause(clause) {
if (clause.kind === 287 /* CaseClause */) {
return getRegularTypeOfLiteralType(getTypeOfExpression(clause.expression));
}
return neverType;
}
function getSwitchClauseTypes(switchStatement) {
var links = getNodeLinks(switchStatement);
if (!links.switchTypes) {
links.switchTypes = [];
for (var _i = 0, _a = switchStatement.caseBlock.clauses; _i < _a.length; _i++) {
var clause = _a[_i];
links.switchTypes.push(getTypeOfSwitchClause(clause));
}
}
return links.switchTypes;
}
function getSwitchClauseTypeOfWitnesses(switchStatement, retainDefault) {
var witnesses = [];
for (var _i = 0, _a = switchStatement.caseBlock.clauses; _i < _a.length; _i++) {
var clause = _a[_i];
if (clause.kind === 287 /* CaseClause */) {
if (ts.isStringLiteralLike(clause.expression)) {
witnesses.push(clause.expression.text);
continue;
}
return ts.emptyArray;
}
if (retainDefault)
witnesses.push(/*explicitDefaultStatement*/ undefined);
}
return witnesses;
}
function eachTypeContainedIn(source, types) {
return source.flags & 1048576 /* Union */ ? !ts.forEach(source.types, function (t) { return !ts.contains(types, t); }) : ts.contains(types, source);
}
function isTypeSubsetOf(source, target) {
return source === target || target.flags & 1048576 /* Union */ && isTypeSubsetOfUnion(source, target);
}
function isTypeSubsetOfUnion(source, target) {
if (source.flags & 1048576 /* Union */) {
for (var _i = 0, _a = source.types; _i < _a.length; _i++) {
var t = _a[_i];
if (!containsType(target.types, t)) {
return false;
}
}
return true;
}
if (source.flags & 1024 /* EnumLiteral */ && getBaseTypeOfEnumLiteralType(source) === target) {
return true;
}
return containsType(target.types, source);
}
function forEachType(type, f) {
return type.flags & 1048576 /* Union */ ? ts.forEach(type.types, f) : f(type);
}
function someType(type, f) {
return type.flags & 1048576 /* Union */ ? ts.some(type.types, f) : f(type);
}
function everyType(type, f) {
return type.flags & 1048576 /* Union */ ? ts.every(type.types, f) : f(type);
}
function everyContainedType(type, f) {
return type.flags & 3145728 /* UnionOrIntersection */ ? ts.every(type.types, f) : f(type);
}
function filterType(type, f) {
if (type.flags & 1048576 /* Union */) {
var types = type.types;
var filtered = ts.filter(types, f);
if (filtered === types) {
return type;
}
var origin = type.origin;
var newOrigin = void 0;
if (origin && origin.flags & 1048576 /* Union */) {
// If the origin type is a (denormalized) union type, filter its non-union constituents. If that ends
// up removing a smaller number of types than in the normalized constituent set (meaning some of the
// filtered types are within nested unions in the origin), then we can't construct a new origin type.
// Otherwise, if we have exactly one type left in the origin set, return that as the filtered type.
// Otherwise, construct a new filtered origin type.
var originTypes = origin.types;
var originFiltered = ts.filter(originTypes, function (t) { return !!(t.flags & 1048576 /* Union */) || f(t); });
if (originTypes.length - originFiltered.length === types.length - filtered.length) {
if (originFiltered.length === 1) {
return originFiltered[0];
}
newOrigin = createOriginUnionOrIntersectionType(1048576 /* Union */, originFiltered);
}
}
return getUnionTypeFromSortedList(filtered, type.objectFlags, /*aliasSymbol*/ undefined, /*aliasTypeArguments*/ undefined, newOrigin);
}
return type.flags & 131072 /* Never */ || f(type) ? type : neverType;
}
function removeType(type, targetType) {
return filterType(type, function (t) { return t !== targetType; });
}
function countTypes(type) {
return type.flags & 1048576 /* Union */ ? type.types.length : 1;
}
function mapType(type, mapper, noReductions) {
if (type.flags & 131072 /* Never */) {
return type;
}
if (!(type.flags & 1048576 /* Union */)) {
return mapper(type);
}
var origin = type.origin;
var types = origin && origin.flags & 1048576 /* Union */ ? origin.types : type.types;
var mappedTypes;
var changed = false;
for (var _i = 0, types_17 = types; _i < types_17.length; _i++) {
var t = types_17[_i];
var mapped = t.flags & 1048576 /* Union */ ? mapType(t, mapper, noReductions) : mapper(t);
changed || (changed = t !== mapped);
if (mapped) {
if (!mappedTypes) {
mappedTypes = [mapped];
}
else {
mappedTypes.push(mapped);
}
}
}
return changed ? mappedTypes && getUnionType(mappedTypes, noReductions ? 0 /* None */ : 1 /* Literal */) : type;
}
function mapTypeWithAlias(type, mapper, aliasSymbol, aliasTypeArguments) {
return type.flags & 1048576 /* Union */ && aliasSymbol ?
getUnionType(ts.map(type.types, mapper), 1 /* Literal */, aliasSymbol, aliasTypeArguments) :
mapType(type, mapper);
}
function getConstituentCount(type) {
return type.flags & 3145728 /* UnionOrIntersection */ ? type.types.length : 1;
}
function extractTypesOfKind(type, kind) {
return filterType(type, function (t) { return (t.flags & kind) !== 0; });
}
// Return a new type in which occurrences of the string and number primitive types in
// typeWithPrimitives have been replaced with occurrences of string literals and numeric
// literals in typeWithLiterals, respectively.
function replacePrimitivesWithLiterals(typeWithPrimitives, typeWithLiterals) {
if (isTypeSubsetOf(stringType, typeWithPrimitives) && maybeTypeOfKind(typeWithLiterals, 128 /* StringLiteral */) ||
isTypeSubsetOf(numberType, typeWithPrimitives) && maybeTypeOfKind(typeWithLiterals, 256 /* NumberLiteral */) ||
isTypeSubsetOf(bigintType, typeWithPrimitives) && maybeTypeOfKind(typeWithLiterals, 2048 /* BigIntLiteral */)) {
return mapType(typeWithPrimitives, function (t) {
return t.flags & 4 /* String */ ? extractTypesOfKind(typeWithLiterals, 4 /* String */ | 128 /* StringLiteral */) :
t.flags & 8 /* Number */ ? extractTypesOfKind(typeWithLiterals, 8 /* Number */ | 256 /* NumberLiteral */) :
t.flags & 64 /* BigInt */ ? extractTypesOfKind(typeWithLiterals, 64 /* BigInt */ | 2048 /* BigIntLiteral */) : t;
});
}
return typeWithPrimitives;
}
function isIncomplete(flowType) {
return flowType.flags === 0;
}
function getTypeFromFlowType(flowType) {
return flowType.flags === 0 ? flowType.type : flowType;
}
function createFlowType(type, incomplete) {
return incomplete ? { flags: 0, type: type.flags & 131072 /* Never */ ? silentNeverType : type } : type;
}
// An evolving array type tracks the element types that have so far been seen in an
// 'x.push(value)' or 'x[n] = value' operation along the control flow graph. Evolving
// array types are ultimately converted into manifest array types (using getFinalArrayType)
// and never escape the getFlowTypeOfReference function.
function createEvolvingArrayType(elementType) {
var result = createObjectType(256 /* EvolvingArray */);
result.elementType = elementType;
return result;
}
function getEvolvingArrayType(elementType) {
return evolvingArrayTypes[elementType.id] || (evolvingArrayTypes[elementType.id] = createEvolvingArrayType(elementType));
}
// When adding evolving array element types we do not perform subtype reduction. Instead,
// we defer subtype reduction until the evolving array type is finalized into a manifest
// array type.
function addEvolvingArrayElementType(evolvingArrayType, node) {
var elementType = getRegularTypeOfObjectLiteral(getBaseTypeOfLiteralType(getContextFreeTypeOfExpression(node)));
return isTypeSubsetOf(elementType, evolvingArrayType.elementType) ? evolvingArrayType : getEvolvingArrayType(getUnionType([evolvingArrayType.elementType, elementType]));
}
function createFinalArrayType(elementType) {
return elementType.flags & 131072 /* Never */ ?
autoArrayType :
createArrayType(elementType.flags & 1048576 /* Union */ ?
getUnionType(elementType.types, 2 /* Subtype */) :
elementType);
}
// We perform subtype reduction upon obtaining the final array type from an evolving array type.
function getFinalArrayType(evolvingArrayType) {
return evolvingArrayType.finalArrayType || (evolvingArrayType.finalArrayType = createFinalArrayType(evolvingArrayType.elementType));
}
function finalizeEvolvingArrayType(type) {
return ts.getObjectFlags(type) & 256 /* EvolvingArray */ ? getFinalArrayType(type) : type;
}
function getElementTypeOfEvolvingArrayType(type) {
return ts.getObjectFlags(type) & 256 /* EvolvingArray */ ? type.elementType : neverType;
}
function isEvolvingArrayTypeList(types) {
var hasEvolvingArrayType = false;
for (var _i = 0, types_18 = types; _i < types_18.length; _i++) {
var t = types_18[_i];
if (!(t.flags & 131072 /* Never */)) {
if (!(ts.getObjectFlags(t) & 256 /* EvolvingArray */)) {
return false;
}
hasEvolvingArrayType = true;
}
}
return hasEvolvingArrayType;
}
// Return true if the given node is 'x' in an 'x.length', x.push(value)', 'x.unshift(value)' or
// 'x[n] = value' operation, where 'n' is an expression of type any, undefined, or a number-like type.
function isEvolvingArrayOperationTarget(node) {
var root = getReferenceRoot(node);
var parent = root.parent;
var isLengthPushOrUnshift = ts.isPropertyAccessExpression(parent) && (parent.name.escapedText === "length" ||
parent.parent.kind === 206 /* CallExpression */
&& ts.isIdentifier(parent.name)
&& ts.isPushOrUnshiftIdentifier(parent.name));
var isElementAssignment = parent.kind === 205 /* ElementAccessExpression */ &&
parent.expression === root &&
parent.parent.kind === 219 /* BinaryExpression */ &&
parent.parent.operatorToken.kind === 63 /* EqualsToken */ &&
parent.parent.left === parent &&
!ts.isAssignmentTarget(parent.parent) &&
isTypeAssignableToKind(getTypeOfExpression(parent.argumentExpression), 296 /* NumberLike */);
return isLengthPushOrUnshift || isElementAssignment;
}
function isDeclarationWithExplicitTypeAnnotation(declaration) {
return (declaration.kind === 252 /* VariableDeclaration */ || declaration.kind === 162 /* Parameter */ ||
declaration.kind === 165 /* PropertyDeclaration */ || declaration.kind === 164 /* PropertySignature */) &&
!!ts.getEffectiveTypeAnnotationNode(declaration);
}
function getExplicitTypeOfSymbol(symbol, diagnostic) {
if (symbol.flags & (16 /* Function */ | 8192 /* Method */ | 32 /* Class */ | 512 /* ValueModule */)) {
return getTypeOfSymbol(symbol);
}
if (symbol.flags & (3 /* Variable */ | 4 /* Property */)) {
if (ts.getCheckFlags(symbol) & 262144 /* Mapped */) {
var origin = symbol.syntheticOrigin;
if (origin && getExplicitTypeOfSymbol(origin)) {
return getTypeOfSymbol(symbol);
}
}
var declaration = symbol.valueDeclaration;
if (declaration) {
if (isDeclarationWithExplicitTypeAnnotation(declaration)) {
return getTypeOfSymbol(symbol);
}
if (ts.isVariableDeclaration(declaration) && declaration.parent.parent.kind === 242 /* ForOfStatement */) {
var statement = declaration.parent.parent;
var expressionType = getTypeOfDottedName(statement.expression, /*diagnostic*/ undefined);
if (expressionType) {
var use = statement.awaitModifier ? 15 /* ForAwaitOf */ : 13 /* ForOf */;
return checkIteratedTypeOrElementType(use, expressionType, undefinedType, /*errorNode*/ undefined);
}
}
if (diagnostic) {
ts.addRelatedInfo(diagnostic, ts.createDiagnosticForNode(declaration, ts.Diagnostics._0_needs_an_explicit_type_annotation, symbolToString(symbol)));
}
}
}
}
// We require the dotted function name in an assertion expression to be comprised of identifiers
// that reference function, method, class or value module symbols; or variable, property or
// parameter symbols with declarations that have explicit type annotations. Such references are
// resolvable with no possibility of triggering circularities in control flow analysis.
function getTypeOfDottedName(node, diagnostic) {
if (!(node.flags & 16777216 /* InWithStatement */)) {
switch (node.kind) {
case 79 /* Identifier */:
var symbol = getExportSymbolOfValueSymbolIfExported(getResolvedSymbol(node));
return getExplicitTypeOfSymbol(symbol.flags & 2097152 /* Alias */ ? resolveAlias(symbol) : symbol, diagnostic);
case 108 /* ThisKeyword */:
return getExplicitThisType(node);
case 106 /* SuperKeyword */:
return checkSuperExpression(node);
case 204 /* PropertyAccessExpression */: {
var type = getTypeOfDottedName(node.expression, diagnostic);
if (type) {
var name = node.name;
var prop = void 0;
if (ts.isPrivateIdentifier(name)) {
if (!type.symbol) {
return undefined;
}
prop = getPropertyOfType(type, ts.getSymbolNameForPrivateIdentifier(type.symbol, name.escapedText));
}
else {
prop = getPropertyOfType(type, name.escapedText);
}
return prop && getExplicitTypeOfSymbol(prop, diagnostic);
}
return undefined;
}
case 210 /* ParenthesizedExpression */:
return getTypeOfDottedName(node.expression, diagnostic);
}
}
}
function getEffectsSignature(node) {
var links = getNodeLinks(node);
var signature = links.effectsSignature;
if (signature === undefined) {
// A call expression parented by an expression statement is a potential assertion. Other call
// expressions are potential type predicate function calls. In order to avoid triggering
// circularities in control flow analysis, we use getTypeOfDottedName when resolving the call
// target expression of an assertion.
var funcType = void 0;
if (node.parent.kind === 236 /* ExpressionStatement */) {
funcType = getTypeOfDottedName(node.expression, /*diagnostic*/ undefined);
}
else if (node.expression.kind !== 106 /* SuperKeyword */) {
if (ts.isOptionalChain(node)) {
funcType = checkNonNullType(getOptionalExpressionType(checkExpression(node.expression), node.expression), node.expression);
}
else {
funcType = checkNonNullExpression(node.expression);
}
}
var signatures = getSignaturesOfType(funcType && getApparentType(funcType) || unknownType, 0 /* Call */);
var candidate = signatures.length === 1 && !signatures[0].typeParameters ? signatures[0] :
ts.some(signatures, hasTypePredicateOrNeverReturnType) ? getResolvedSignature(node) :
undefined;
signature = links.effectsSignature = candidate && hasTypePredicateOrNeverReturnType(candidate) ? candidate : unknownSignature;
}
return signature === unknownSignature ? undefined : signature;
}
function hasTypePredicateOrNeverReturnType(signature) {
return !!(getTypePredicateOfSignature(signature) ||
signature.declaration && (getReturnTypeFromAnnotation(signature.declaration) || unknownType).flags & 131072 /* Never */);
}
function getTypePredicateArgument(predicate, callExpression) {
if (predicate.kind === 1 /* Identifier */ || predicate.kind === 3 /* AssertsIdentifier */) {
return callExpression.arguments[predicate.parameterIndex];
}
var invokedExpression = ts.skipParentheses(callExpression.expression);
return ts.isAccessExpression(invokedExpression) ? ts.skipParentheses(invokedExpression.expression) : undefined;
}
function reportFlowControlError(node) {
var block = ts.findAncestor(node, ts.isFunctionOrModuleBlock);
var sourceFile = ts.getSourceFileOfNode(node);
var span = ts.getSpanOfTokenAtPosition(sourceFile, block.statements.pos);
diagnostics.add(ts.createFileDiagnostic(sourceFile, span.start, span.length, ts.Diagnostics.The_containing_function_or_module_body_is_too_large_for_control_flow_analysis));
}
function isReachableFlowNode(flow) {
var result = isReachableFlowNodeWorker(flow, /*noCacheCheck*/ false);
lastFlowNode = flow;
lastFlowNodeReachable = result;
return result;
}
function isFalseExpression(expr) {
var node = ts.skipParentheses(expr);
return node.kind === 95 /* FalseKeyword */ || node.kind === 219 /* BinaryExpression */ && (node.operatorToken.kind === 55 /* AmpersandAmpersandToken */ && (isFalseExpression(node.left) || isFalseExpression(node.right)) ||
node.operatorToken.kind === 56 /* BarBarToken */ && isFalseExpression(node.left) && isFalseExpression(node.right));
}
function isReachableFlowNodeWorker(flow, noCacheCheck) {
while (true) {
if (flow === lastFlowNode) {
return lastFlowNodeReachable;
}
var flags = flow.flags;
if (flags & 4096 /* Shared */) {
if (!noCacheCheck) {
var id = getFlowNodeId(flow);
var reachable = flowNodeReachable[id];
return reachable !== undefined ? reachable : (flowNodeReachable[id] = isReachableFlowNodeWorker(flow, /*noCacheCheck*/ true));
}
noCacheCheck = false;
}
if (flags & (16 /* Assignment */ | 96 /* Condition */ | 256 /* ArrayMutation */)) {
flow = flow.antecedent;
}
else if (flags & 512 /* Call */) {
var signature = getEffectsSignature(flow.node);
if (signature) {
var predicate = getTypePredicateOfSignature(signature);
if (predicate && predicate.kind === 3 /* AssertsIdentifier */ && !predicate.type) {
var predicateArgument = flow.node.arguments[predicate.parameterIndex];
if (predicateArgument && isFalseExpression(predicateArgument)) {
return false;
}
}
if (getReturnTypeOfSignature(signature).flags & 131072 /* Never */) {
return false;
}
}
flow = flow.antecedent;
}
else if (flags & 4 /* BranchLabel */) {
// A branching point is reachable if any branch is reachable.
return ts.some(flow.antecedents, function (f) { return isReachableFlowNodeWorker(f, /*noCacheCheck*/ false); });
}
else if (flags & 8 /* LoopLabel */) {
var antecedents = flow.antecedents;
if (antecedents === undefined || antecedents.length === 0) {
return false;
}
// A loop is reachable if the control flow path that leads to the top is reachable.
flow = antecedents[0];
}
else if (flags & 128 /* SwitchClause */) {
// The control flow path representing an unmatched value in a switch statement with
// no default clause is unreachable if the switch statement is exhaustive.
if (flow.clauseStart === flow.clauseEnd && isExhaustiveSwitchStatement(flow.switchStatement)) {
return false;
}
flow = flow.antecedent;
}
else if (flags & 1024 /* ReduceLabel */) {
// Cache is unreliable once we start adjusting labels
lastFlowNode = undefined;
var target = flow.target;
var saveAntecedents = target.antecedents;
target.antecedents = flow.antecedents;
var result = isReachableFlowNodeWorker(flow.antecedent, /*noCacheCheck*/ false);
target.antecedents = saveAntecedents;
return result;
}
else {
return !(flags & 1 /* Unreachable */);
}
}
}
// Return true if the given flow node is preceded by a 'super(...)' call in every possible code path
// leading to the node.
function isPostSuperFlowNode(flow, noCacheCheck) {
while (true) {
var flags = flow.flags;
if (flags & 4096 /* Shared */) {
if (!noCacheCheck) {
var id = getFlowNodeId(flow);
var postSuper = flowNodePostSuper[id];
return postSuper !== undefined ? postSuper : (flowNodePostSuper[id] = isPostSuperFlowNode(flow, /*noCacheCheck*/ true));
}
noCacheCheck = false;
}
if (flags & (16 /* Assignment */ | 96 /* Condition */ | 256 /* ArrayMutation */ | 128 /* SwitchClause */)) {
flow = flow.antecedent;
}
else if (flags & 512 /* Call */) {
if (flow.node.expression.kind === 106 /* SuperKeyword */) {
return true;
}
flow = flow.antecedent;
}
else if (flags & 4 /* BranchLabel */) {
// A branching point is post-super if every branch is post-super.
return ts.every(flow.antecedents, function (f) { return isPostSuperFlowNode(f, /*noCacheCheck*/ false); });
}
else if (flags & 8 /* LoopLabel */) {
// A loop is post-super if the control flow path that leads to the top is post-super.
flow = flow.antecedents[0];
}
else if (flags & 1024 /* ReduceLabel */) {
var target = flow.target;
var saveAntecedents = target.antecedents;
target.antecedents = flow.antecedents;
var result = isPostSuperFlowNode(flow.antecedent, /*noCacheCheck*/ false);
target.antecedents = saveAntecedents;
return result;
}
else {
// Unreachable nodes are considered post-super to silence errors
return !!(flags & 1 /* Unreachable */);
}
}
}
function isConstantReference(node) {
switch (node.kind) {
case 79 /* Identifier */:
var symbol = getResolvedSymbol(node);
return isConstVariable(symbol) || !!symbol.valueDeclaration && ts.getRootDeclaration(symbol.valueDeclaration).kind === 162 /* Parameter */ && !isParameterAssigned(symbol);
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
// The resolvedSymbol property is initialized by checkPropertyAccess or checkElementAccess before we get here.
return isConstantReference(node.expression) && isReadonlySymbol(getNodeLinks(node).resolvedSymbol || unknownSymbol);
}
return false;
}
function getFlowTypeOfReference(reference, declaredType, initialType, flowContainer) {
if (initialType === void 0) { initialType = declaredType; }
var key;
var isKeySet = false;
var flowDepth = 0;
var inlineLevel = 0;
if (flowAnalysisDisabled) {
return errorType;
}
if (!reference.flowNode) {
return declaredType;
}
flowInvocationCount++;
var sharedFlowStart = sharedFlowCount;
var evolvedType = getTypeFromFlowType(getTypeAtFlowNode(reference.flowNode));
sharedFlowCount = sharedFlowStart;
// When the reference is 'x' in an 'x.length', 'x.push(value)', 'x.unshift(value)' or x[n] = value' operation,
// we give type 'any[]' to 'x' instead of using the type determined by control flow analysis such that operations
// on empty arrays are possible without implicit any errors and new element types can be inferred without
// type mismatch errors.
var resultType = ts.getObjectFlags(evolvedType) & 256 /* EvolvingArray */ && isEvolvingArrayOperationTarget(reference) ? autoArrayType : finalizeEvolvingArrayType(evolvedType);
if (resultType === unreachableNeverType || reference.parent && reference.parent.kind === 228 /* NonNullExpression */ && !(resultType.flags & 131072 /* Never */) && getTypeWithFacts(resultType, 2097152 /* NEUndefinedOrNull */).flags & 131072 /* Never */) {
return declaredType;
}
return resultType;
function getOrSetCacheKey() {
if (isKeySet) {
return key;
}
isKeySet = true;
return key = getFlowCacheKey(reference, declaredType, initialType, flowContainer);
}
function getTypeAtFlowNode(flow) {
if (flowDepth === 2000) {
// We have made 2000 recursive invocations. To avoid overflowing the call stack we report an error
// and disable further control flow analysis in the containing function or module body.
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.instant("checkTypes" /* CheckTypes */, "getTypeAtFlowNode_DepthLimit", { flowId: flow.id });
flowAnalysisDisabled = true;
reportFlowControlError(reference);
return errorType;
}
flowDepth++;
var sharedFlow;
while (true) {
var flags = flow.flags;
if (flags & 4096 /* Shared */) {
// We cache results of flow type resolution for shared nodes that were previously visited in
// the same getFlowTypeOfReference invocation. A node is considered shared when it is the
// antecedent of more than one node.
for (var i = sharedFlowStart; i < sharedFlowCount; i++) {
if (sharedFlowNodes[i] === flow) {
flowDepth--;
return sharedFlowTypes[i];
}
}
sharedFlow = flow;
}
var type = void 0;
if (flags & 16 /* Assignment */) {
type = getTypeAtFlowAssignment(flow);
if (!type) {
flow = flow.antecedent;
continue;
}
}
else if (flags & 512 /* Call */) {
type = getTypeAtFlowCall(flow);
if (!type) {
flow = flow.antecedent;
continue;
}
}
else if (flags & 96 /* Condition */) {
type = getTypeAtFlowCondition(flow);
}
else if (flags & 128 /* SwitchClause */) {
type = getTypeAtSwitchClause(flow);
}
else if (flags & 12 /* Label */) {
if (flow.antecedents.length === 1) {
flow = flow.antecedents[0];
continue;
}
type = flags & 4 /* BranchLabel */ ?
getTypeAtFlowBranchLabel(flow) :
getTypeAtFlowLoopLabel(flow);
}
else if (flags & 256 /* ArrayMutation */) {
type = getTypeAtFlowArrayMutation(flow);
if (!type) {
flow = flow.antecedent;
continue;
}
}
else if (flags & 1024 /* ReduceLabel */) {
var target = flow.target;
var saveAntecedents = target.antecedents;
target.antecedents = flow.antecedents;
type = getTypeAtFlowNode(flow.antecedent);
target.antecedents = saveAntecedents;
}
else if (flags & 2 /* Start */) {
// Check if we should continue with the control flow of the containing function.
var container = flow.node;
if (container && container !== flowContainer &&
reference.kind !== 204 /* PropertyAccessExpression */ &&
reference.kind !== 205 /* ElementAccessExpression */ &&
reference.kind !== 108 /* ThisKeyword */) {
flow = container.flowNode;
continue;
}
// At the top of the flow we have the initial type.
type = initialType;
}
else {
// Unreachable code errors are reported in the binding phase. Here we
// simply return the non-auto declared type to reduce follow-on errors.
type = convertAutoToAny(declaredType);
}
if (sharedFlow) {
// Record visited node and the associated type in the cache.
sharedFlowNodes[sharedFlowCount] = sharedFlow;
sharedFlowTypes[sharedFlowCount] = type;
sharedFlowCount++;
}
flowDepth--;
return type;
}
}
function getInitialOrAssignedType(flow) {
var node = flow.node;
return getNarrowableTypeForReference(node.kind === 252 /* VariableDeclaration */ || node.kind === 201 /* BindingElement */ ?
getInitialType(node) :
getAssignedType(node), reference);
}
function getTypeAtFlowAssignment(flow) {
var node = flow.node;
// Assignments only narrow the computed type if the declared type is a union type. Thus, we
// only need to evaluate the assigned type if the declared type is a union type.
if (isMatchingReference(reference, node)) {
if (!isReachableFlowNode(flow)) {
return unreachableNeverType;
}
if (ts.getAssignmentTargetKind(node) === 2 /* Compound */) {
var flowType = getTypeAtFlowNode(flow.antecedent);
return createFlowType(getBaseTypeOfLiteralType(getTypeFromFlowType(flowType)), isIncomplete(flowType));
}
if (declaredType === autoType || declaredType === autoArrayType) {
if (isEmptyArrayAssignment(node)) {
return getEvolvingArrayType(neverType);
}
var assignedType = getWidenedLiteralType(getInitialOrAssignedType(flow));
return isTypeAssignableTo(assignedType, declaredType) ? assignedType : anyArrayType;
}
if (declaredType.flags & 1048576 /* Union */) {
return getAssignmentReducedType(declaredType, getInitialOrAssignedType(flow));
}
return declaredType;
}
// We didn't have a direct match. However, if the reference is a dotted name, this
// may be an assignment to a left hand part of the reference. For example, for a
// reference 'x.y.z', we may be at an assignment to 'x.y' or 'x'. In that case,
// return the declared type.
if (containsMatchingReference(reference, node)) {
if (!isReachableFlowNode(flow)) {
return unreachableNeverType;
}
// A matching dotted name might also be an expando property on a function *expression*,
// in which case we continue control flow analysis back to the function's declaration
if (ts.isVariableDeclaration(node) && (ts.isInJSFile(node) || ts.isVarConst(node))) {
var init = ts.getDeclaredExpandoInitializer(node);
if (init && (init.kind === 211 /* FunctionExpression */ || init.kind === 212 /* ArrowFunction */)) {
return getTypeAtFlowNode(flow.antecedent);
}
}
return declaredType;
}
// for (const _ in ref) acts as a nonnull on ref
if (ts.isVariableDeclaration(node) && node.parent.parent.kind === 241 /* ForInStatement */ && isMatchingReference(reference, node.parent.parent.expression)) {
return getNonNullableTypeIfNeeded(getTypeFromFlowType(getTypeAtFlowNode(flow.antecedent)));
}
// Assignment doesn't affect reference
return undefined;
}
function narrowTypeByAssertion(type, expr) {
var node = ts.skipParentheses(expr);
if (node.kind === 95 /* FalseKeyword */) {
return unreachableNeverType;
}
if (node.kind === 219 /* BinaryExpression */) {
if (node.operatorToken.kind === 55 /* AmpersandAmpersandToken */) {
return narrowTypeByAssertion(narrowTypeByAssertion(type, node.left), node.right);
}
if (node.operatorToken.kind === 56 /* BarBarToken */) {
return getUnionType([narrowTypeByAssertion(type, node.left), narrowTypeByAssertion(type, node.right)]);
}
}
return narrowType(type, node, /*assumeTrue*/ true);
}
function getTypeAtFlowCall(flow) {
var signature = getEffectsSignature(flow.node);
if (signature) {
var predicate = getTypePredicateOfSignature(signature);
if (predicate && (predicate.kind === 2 /* AssertsThis */ || predicate.kind === 3 /* AssertsIdentifier */)) {
var flowType = getTypeAtFlowNode(flow.antecedent);
var type = finalizeEvolvingArrayType(getTypeFromFlowType(flowType));
var narrowedType = predicate.type ? narrowTypeByTypePredicate(type, predicate, flow.node, /*assumeTrue*/ true) :
predicate.kind === 3 /* AssertsIdentifier */ && predicate.parameterIndex >= 0 && predicate.parameterIndex < flow.node.arguments.length ? narrowTypeByAssertion(type, flow.node.arguments[predicate.parameterIndex]) :
type;
return narrowedType === type ? flowType : createFlowType(narrowedType, isIncomplete(flowType));
}
if (getReturnTypeOfSignature(signature).flags & 131072 /* Never */) {
return unreachableNeverType;
}
}
return undefined;
}
function getTypeAtFlowArrayMutation(flow) {
if (declaredType === autoType || declaredType === autoArrayType) {
var node = flow.node;
var expr = node.kind === 206 /* CallExpression */ ?
node.expression.expression :
node.left.expression;
if (isMatchingReference(reference, getReferenceCandidate(expr))) {
var flowType = getTypeAtFlowNode(flow.antecedent);
var type = getTypeFromFlowType(flowType);
if (ts.getObjectFlags(type) & 256 /* EvolvingArray */) {
var evolvedType_1 = type;
if (node.kind === 206 /* CallExpression */) {
for (var _i = 0, _a = node.arguments; _i < _a.length; _i++) {
var arg = _a[_i];
evolvedType_1 = addEvolvingArrayElementType(evolvedType_1, arg);
}
}
else {
// We must get the context free expression type so as to not recur in an uncached fashion on the LHS (which causes exponential blowup in compile time)
var indexType = getContextFreeTypeOfExpression(node.left.argumentExpression);
if (isTypeAssignableToKind(indexType, 296 /* NumberLike */)) {
evolvedType_1 = addEvolvingArrayElementType(evolvedType_1, node.right);
}
}
return evolvedType_1 === type ? flowType : createFlowType(evolvedType_1, isIncomplete(flowType));
}
return flowType;
}
}
return undefined;
}
function getTypeAtFlowCondition(flow) {
var flowType = getTypeAtFlowNode(flow.antecedent);
var type = getTypeFromFlowType(flowType);
if (type.flags & 131072 /* Never */) {
return flowType;
}
// If we have an antecedent type (meaning we're reachable in some way), we first
// attempt to narrow the antecedent type. If that produces the never type, and if
// the antecedent type is incomplete (i.e. a transient type in a loop), then we
// take the type guard as an indication that control *could* reach here once we
// have the complete type. We proceed by switching to the silent never type which
// doesn't report errors when operators are applied to it. Note that this is the
// *only* place a silent never type is ever generated.
var assumeTrue = (flow.flags & 32 /* TrueCondition */) !== 0;
var nonEvolvingType = finalizeEvolvingArrayType(type);
var narrowedType = narrowType(nonEvolvingType, flow.node, assumeTrue);
if (narrowedType === nonEvolvingType) {
return flowType;
}
return createFlowType(narrowedType, isIncomplete(flowType));
}
function getTypeAtSwitchClause(flow) {
var expr = flow.switchStatement.expression;
var flowType = getTypeAtFlowNode(flow.antecedent);
var type = getTypeFromFlowType(flowType);
if (isMatchingReference(reference, expr)) {
type = narrowTypeBySwitchOnDiscriminant(type, flow.switchStatement, flow.clauseStart, flow.clauseEnd);
}
else if (expr.kind === 214 /* TypeOfExpression */ && isMatchingReference(reference, expr.expression)) {
type = narrowBySwitchOnTypeOf(type, flow.switchStatement, flow.clauseStart, flow.clauseEnd);
}
else {
if (strictNullChecks) {
if (optionalChainContainsReference(expr, reference)) {
type = narrowTypeBySwitchOptionalChainContainment(type, flow.switchStatement, flow.clauseStart, flow.clauseEnd, function (t) { return !(t.flags & (32768 /* Undefined */ | 131072 /* Never */)); });
}
else if (expr.kind === 214 /* TypeOfExpression */ && optionalChainContainsReference(expr.expression, reference)) {
type = narrowTypeBySwitchOptionalChainContainment(type, flow.switchStatement, flow.clauseStart, flow.clauseEnd, function (t) { return !(t.flags & 131072 /* Never */ || t.flags & 128 /* StringLiteral */ && t.value === "undefined"); });
}
}
var access = getDiscriminantPropertyAccess(expr, type);
if (access) {
type = narrowTypeBySwitchOnDiscriminantProperty(type, access, flow.switchStatement, flow.clauseStart, flow.clauseEnd);
}
}
return createFlowType(type, isIncomplete(flowType));
}
function getTypeAtFlowBranchLabel(flow) {
var antecedentTypes = [];
var subtypeReduction = false;
var seenIncomplete = false;
var bypassFlow;
for (var _i = 0, _a = flow.antecedents; _i < _a.length; _i++) {
var antecedent = _a[_i];
if (!bypassFlow && antecedent.flags & 128 /* SwitchClause */ && antecedent.clauseStart === antecedent.clauseEnd) {
// The antecedent is the bypass branch of a potentially exhaustive switch statement.
bypassFlow = antecedent;
continue;
}
var flowType = getTypeAtFlowNode(antecedent);
var type = getTypeFromFlowType(flowType);
// If the type at a particular antecedent path is the declared type and the
// reference is known to always be assigned (i.e. when declared and initial types
// are the same), there is no reason to process more antecedents since the only
// possible outcome is subtypes that will be removed in the final union type anyway.
if (type === declaredType && declaredType === initialType) {
return type;
}
ts.pushIfUnique(antecedentTypes, type);
// If an antecedent type is not a subset of the declared type, we need to perform
// subtype reduction. This happens when a "foreign" type is injected into the control
// flow using the instanceof operator or a user defined type predicate.
if (!isTypeSubsetOf(type, declaredType)) {
subtypeReduction = true;
}
if (isIncomplete(flowType)) {
seenIncomplete = true;
}
}
if (bypassFlow) {
var flowType = getTypeAtFlowNode(bypassFlow);
var type = getTypeFromFlowType(flowType);
// If the bypass flow contributes a type we haven't seen yet and the switch statement
// isn't exhaustive, process the bypass flow type. Since exhaustiveness checks increase
// the risk of circularities, we only want to perform them when they make a difference.
if (!ts.contains(antecedentTypes, type) && !isExhaustiveSwitchStatement(bypassFlow.switchStatement)) {
if (type === declaredType && declaredType === initialType) {
return type;
}
antecedentTypes.push(type);
if (!isTypeSubsetOf(type, declaredType)) {
subtypeReduction = true;
}
if (isIncomplete(flowType)) {
seenIncomplete = true;
}
}
}
return createFlowType(getUnionOrEvolvingArrayType(antecedentTypes, subtypeReduction ? 2 /* Subtype */ : 1 /* Literal */), seenIncomplete);
}
function getTypeAtFlowLoopLabel(flow) {
// If we have previously computed the control flow type for the reference at
// this flow loop junction, return the cached type.
var id = getFlowNodeId(flow);
var cache = flowLoopCaches[id] || (flowLoopCaches[id] = new ts.Map());
var key = getOrSetCacheKey();
if (!key) {
// No cache key is generated when binding patterns are in unnarrowable situations
return declaredType;
}
var cached = cache.get(key);
if (cached) {
return cached;
}
// If this flow loop junction and reference are already being processed, return
// the union of the types computed for each branch so far, marked as incomplete.
// It is possible to see an empty array in cases where loops are nested and the
// back edge of the outer loop reaches an inner loop that is already being analyzed.
// In such cases we restart the analysis of the inner loop, which will then see
// a non-empty in-process array for the outer loop and eventually terminate because
// the first antecedent of a loop junction is always the non-looping control flow
// path that leads to the top.
for (var i = flowLoopStart; i < flowLoopCount; i++) {
if (flowLoopNodes[i] === flow && flowLoopKeys[i] === key && flowLoopTypes[i].length) {
return createFlowType(getUnionOrEvolvingArrayType(flowLoopTypes[i], 1 /* Literal */), /*incomplete*/ true);
}
}
// Add the flow loop junction and reference to the in-process stack and analyze
// each antecedent code path.
var antecedentTypes = [];
var subtypeReduction = false;
var firstAntecedentType;
for (var _i = 0, _a = flow.antecedents; _i < _a.length; _i++) {
var antecedent = _a[_i];
var flowType = void 0;
if (!firstAntecedentType) {
// The first antecedent of a loop junction is always the non-looping control
// flow path that leads to the top.
flowType = firstAntecedentType = getTypeAtFlowNode(antecedent);
}
else {
// All but the first antecedent are the looping control flow paths that lead
// back to the loop junction. We track these on the flow loop stack.
flowLoopNodes[flowLoopCount] = flow;
flowLoopKeys[flowLoopCount] = key;
flowLoopTypes[flowLoopCount] = antecedentTypes;
flowLoopCount++;
var saveFlowTypeCache = flowTypeCache;
flowTypeCache = undefined;
flowType = getTypeAtFlowNode(antecedent);
flowTypeCache = saveFlowTypeCache;
flowLoopCount--;
// If we see a value appear in the cache it is a sign that control flow analysis
// was restarted and completed by checkExpressionCached. We can simply pick up
// the resulting type and bail out.
var cached_1 = cache.get(key);
if (cached_1) {
return cached_1;
}
}
var type = getTypeFromFlowType(flowType);
ts.pushIfUnique(antecedentTypes, type);
// If an antecedent type is not a subset of the declared type, we need to perform
// subtype reduction. This happens when a "foreign" type is injected into the control
// flow using the instanceof operator or a user defined type predicate.
if (!isTypeSubsetOf(type, declaredType)) {
subtypeReduction = true;
}
// If the type at a particular antecedent path is the declared type there is no
// reason to process more antecedents since the only possible outcome is subtypes
// that will be removed in the final union type anyway.
if (type === declaredType) {
break;
}
}
// The result is incomplete if the first antecedent (the non-looping control flow path)
// is incomplete.
var result = getUnionOrEvolvingArrayType(antecedentTypes, subtypeReduction ? 2 /* Subtype */ : 1 /* Literal */);
if (isIncomplete(firstAntecedentType)) {
return createFlowType(result, /*incomplete*/ true);
}
cache.set(key, result);
return result;
}
// At flow control branch or loop junctions, if the type along every antecedent code path
// is an evolving array type, we construct a combined evolving array type. Otherwise we
// finalize all evolving array types.
function getUnionOrEvolvingArrayType(types, subtypeReduction) {
if (isEvolvingArrayTypeList(types)) {
return getEvolvingArrayType(getUnionType(ts.map(types, getElementTypeOfEvolvingArrayType)));
}
var result = getUnionType(ts.sameMap(types, finalizeEvolvingArrayType), subtypeReduction);
if (result !== declaredType && result.flags & declaredType.flags & 1048576 /* Union */ && ts.arraysEqual(result.types, declaredType.types)) {
return declaredType;
}
return result;
}
function getDiscriminantPropertyAccess(expr, computedType) {
var access, name;
var type = declaredType.flags & 1048576 /* Union */ ? declaredType : computedType;
return type.flags & 1048576 /* Union */ && (access = getPropertyAccess(expr)) && (name = getAccessedPropertyName(access)) &&
isMatchingReference(reference, ts.isAccessExpression(access) ? access.expression : access.parent.parent.initializer) &&
isDiscriminantProperty(type, name) ?
access : undefined;
}
function narrowTypeByDiscriminant(type, access, narrowType) {
var propName = getAccessedPropertyName(access);
if (propName === undefined) {
return type;
}
var removeNullable = strictNullChecks && ts.isOptionalChain(access) && maybeTypeOfKind(type, 98304 /* Nullable */);
var propType = getTypeOfPropertyOfType(removeNullable ? getTypeWithFacts(type, 2097152 /* NEUndefinedOrNull */) : type, propName);
if (!propType) {
return type;
}
propType = removeNullable ? getOptionalType(propType) : propType;
var narrowedPropType = narrowType(propType);
return filterType(type, function (t) {
var discriminantType = getTypeOfPropertyOrIndexSignature(t, propName);
return !(discriminantType.flags & 131072 /* Never */) && isTypeComparableTo(discriminantType, narrowedPropType);
});
}
function narrowTypeByDiscriminantProperty(type, access, operator, value, assumeTrue) {
if ((operator === 36 /* EqualsEqualsEqualsToken */ || operator === 37 /* ExclamationEqualsEqualsToken */) && type.flags & 1048576 /* Union */) {
var keyPropertyName = getKeyPropertyName(type);
if (keyPropertyName && keyPropertyName === getAccessedPropertyName(access)) {
var candidate = getConstituentTypeForKeyType(type, getTypeOfExpression(value));
if (candidate) {
return operator === (assumeTrue ? 36 /* EqualsEqualsEqualsToken */ : 37 /* ExclamationEqualsEqualsToken */) ? candidate :
isUnitType(getTypeOfPropertyOfType(candidate, keyPropertyName) || unknownType) ? removeType(type, candidate) :
type;
}
}
}
return narrowTypeByDiscriminant(type, access, function (t) { return narrowTypeByEquality(t, operator, value, assumeTrue); });
}
function narrowTypeBySwitchOnDiscriminantProperty(type, access, switchStatement, clauseStart, clauseEnd) {
if (clauseStart < clauseEnd && type.flags & 1048576 /* Union */ && getKeyPropertyName(type) === getAccessedPropertyName(access)) {
var clauseTypes = getSwitchClauseTypes(switchStatement).slice(clauseStart, clauseEnd);
var candidate = getUnionType(ts.map(clauseTypes, function (t) { return getConstituentTypeForKeyType(type, t) || unknownType; }));
if (candidate !== unknownType) {
return candidate;
}
}
return narrowTypeByDiscriminant(type, access, function (t) { return narrowTypeBySwitchOnDiscriminant(t, switchStatement, clauseStart, clauseEnd); });
}
function narrowTypeByTruthiness(type, expr, assumeTrue) {
if (isMatchingReference(reference, expr)) {
return getTypeWithFacts(type, assumeTrue ? 4194304 /* Truthy */ : 8388608 /* Falsy */);
}
if (strictNullChecks && assumeTrue && optionalChainContainsReference(expr, reference)) {
type = getTypeWithFacts(type, 2097152 /* NEUndefinedOrNull */);
}
var access = getDiscriminantPropertyAccess(expr, type);
if (access) {
return narrowTypeByDiscriminant(type, access, function (t) { return getTypeWithFacts(t, assumeTrue ? 4194304 /* Truthy */ : 8388608 /* Falsy */); });
}
return type;
}
function isTypePresencePossible(type, propName, assumeTrue) {
var prop = getPropertyOfType(type, propName);
if (prop) {
return prop.flags & 16777216 /* Optional */ ? true : assumeTrue;
}
return getApplicableIndexInfoForName(type, propName) ? true : !assumeTrue;
}
function narrowByInKeyword(type, name, assumeTrue) {
if (type.flags & 1048576 /* Union */
|| type.flags & 524288 /* Object */ && declaredType !== type
|| isThisTypeParameter(type)
|| type.flags & 2097152 /* Intersection */ && ts.every(type.types, function (t) { return t.symbol !== globalThisSymbol; })) {
return filterType(type, function (t) { return isTypePresencePossible(t, name, assumeTrue); });
}
return type;
}
function narrowTypeByBinaryExpression(type, expr, assumeTrue) {
switch (expr.operatorToken.kind) {
case 63 /* EqualsToken */:
case 75 /* BarBarEqualsToken */:
case 76 /* AmpersandAmpersandEqualsToken */:
case 77 /* QuestionQuestionEqualsToken */:
return narrowTypeByTruthiness(narrowType(type, expr.right, assumeTrue), expr.left, assumeTrue);
case 34 /* EqualsEqualsToken */:
case 35 /* ExclamationEqualsToken */:
case 36 /* EqualsEqualsEqualsToken */:
case 37 /* ExclamationEqualsEqualsToken */:
var operator = expr.operatorToken.kind;
var left = getReferenceCandidate(expr.left);
var right = getReferenceCandidate(expr.right);
if (left.kind === 214 /* TypeOfExpression */ && ts.isStringLiteralLike(right)) {
return narrowTypeByTypeof(type, left, operator, right, assumeTrue);
}
if (right.kind === 214 /* TypeOfExpression */ && ts.isStringLiteralLike(left)) {
return narrowTypeByTypeof(type, right, operator, left, assumeTrue);
}
if (isMatchingReference(reference, left)) {
return narrowTypeByEquality(type, operator, right, assumeTrue);
}
if (isMatchingReference(reference, right)) {
return narrowTypeByEquality(type, operator, left, assumeTrue);
}
if (strictNullChecks) {
if (optionalChainContainsReference(left, reference)) {
type = narrowTypeByOptionalChainContainment(type, operator, right, assumeTrue);
}
else if (optionalChainContainsReference(right, reference)) {
type = narrowTypeByOptionalChainContainment(type, operator, left, assumeTrue);
}
}
var leftAccess = getDiscriminantPropertyAccess(left, type);
if (leftAccess) {
return narrowTypeByDiscriminantProperty(type, leftAccess, operator, right, assumeTrue);
}
var rightAccess = getDiscriminantPropertyAccess(right, type);
if (rightAccess) {
return narrowTypeByDiscriminantProperty(type, rightAccess, operator, left, assumeTrue);
}
if (isMatchingConstructorReference(left)) {
return narrowTypeByConstructor(type, operator, right, assumeTrue);
}
if (isMatchingConstructorReference(right)) {
return narrowTypeByConstructor(type, operator, left, assumeTrue);
}
break;
case 102 /* InstanceOfKeyword */:
return narrowTypeByInstanceof(type, expr, assumeTrue);
case 101 /* InKeyword */:
var target = getReferenceCandidate(expr.right);
var leftType = getTypeOfNode(expr.left);
if (leftType.flags & 128 /* StringLiteral */) {
var name = ts.escapeLeadingUnderscores(leftType.value);
if (containsMissingType(type) && ts.isAccessExpression(reference) && isMatchingReference(reference.expression, target) &&
getAccessedPropertyName(reference) === name) {
return getTypeWithFacts(type, assumeTrue ? 524288 /* NEUndefined */ : 65536 /* EQUndefined */);
}
if (isMatchingReference(reference, target)) {
return narrowByInKeyword(type, name, assumeTrue);
}
}
break;
case 27 /* CommaToken */:
return narrowType(type, expr.right, assumeTrue);
// Ordinarily we won't see && and || expressions in control flow analysis because the Binder breaks those
// expressions down to individual conditional control flows. However, we may encounter them when analyzing
// aliased conditional expressions.
case 55 /* AmpersandAmpersandToken */:
return assumeTrue ?
narrowType(narrowType(type, expr.left, /*assumeTrue*/ true), expr.right, /*assumeTrue*/ true) :
getUnionType([narrowType(type, expr.left, /*assumeTrue*/ false), narrowType(type, expr.right, /*assumeTrue*/ false)]);
case 56 /* BarBarToken */:
return assumeTrue ?
getUnionType([narrowType(type, expr.left, /*assumeTrue*/ true), narrowType(type, expr.right, /*assumeTrue*/ true)]) :
narrowType(narrowType(type, expr.left, /*assumeTrue*/ false), expr.right, /*assumeTrue*/ false);
}
return type;
}
function narrowTypeByOptionalChainContainment(type, operator, value, assumeTrue) {
// We are in a branch of obj?.foo === value (or any one of the other equality operators). We narrow obj as follows:
// When operator is === and type of value excludes undefined, null and undefined is removed from type of obj in true branch.
// When operator is !== and type of value excludes undefined, null and undefined is removed from type of obj in false branch.
// When operator is == and type of value excludes null and undefined, null and undefined is removed from type of obj in true branch.
// When operator is != and type of value excludes null and undefined, null and undefined is removed from type of obj in false branch.
// When operator is === and type of value is undefined, null and undefined is removed from type of obj in false branch.
// When operator is !== and type of value is undefined, null and undefined is removed from type of obj in true branch.
// When operator is == and type of value is null or undefined, null and undefined is removed from type of obj in false branch.
// When operator is != and type of value is null or undefined, null and undefined is removed from type of obj in true branch.
var equalsOperator = operator === 34 /* EqualsEqualsToken */ || operator === 36 /* EqualsEqualsEqualsToken */;
var nullableFlags = operator === 34 /* EqualsEqualsToken */ || operator === 35 /* ExclamationEqualsToken */ ? 98304 /* Nullable */ : 32768 /* Undefined */;
var valueType = getTypeOfExpression(value);
// Note that we include any and unknown in the exclusion test because their domain includes null and undefined.
var removeNullable = equalsOperator !== assumeTrue && everyType(valueType, function (t) { return !!(t.flags & nullableFlags); }) ||
equalsOperator === assumeTrue && everyType(valueType, function (t) { return !(t.flags & (3 /* AnyOrUnknown */ | nullableFlags)); });
return removeNullable ? getTypeWithFacts(type, 2097152 /* NEUndefinedOrNull */) : type;
}
function narrowTypeByEquality(type, operator, value, assumeTrue) {
if (type.flags & 1 /* Any */) {
return type;
}
if (operator === 35 /* ExclamationEqualsToken */ || operator === 37 /* ExclamationEqualsEqualsToken */) {
assumeTrue = !assumeTrue;
}
var valueType = getTypeOfExpression(value);
if ((type.flags & 2 /* Unknown */) && assumeTrue && (operator === 36 /* EqualsEqualsEqualsToken */ || operator === 37 /* ExclamationEqualsEqualsToken */)) {
if (valueType.flags & (131068 /* Primitive */ | 67108864 /* NonPrimitive */)) {
return valueType;
}
if (valueType.flags & 524288 /* Object */) {
return nonPrimitiveType;
}
return type;
}
if (valueType.flags & 98304 /* Nullable */) {
if (!strictNullChecks) {
return type;
}
var doubleEquals = operator === 34 /* EqualsEqualsToken */ || operator === 35 /* ExclamationEqualsToken */;
var facts = doubleEquals ?
assumeTrue ? 262144 /* EQUndefinedOrNull */ : 2097152 /* NEUndefinedOrNull */ :
valueType.flags & 65536 /* Null */ ?
assumeTrue ? 131072 /* EQNull */ : 1048576 /* NENull */ :
assumeTrue ? 65536 /* EQUndefined */ : 524288 /* NEUndefined */;
return getTypeWithFacts(type, facts);
}
if (assumeTrue) {
var filterFn = operator === 34 /* EqualsEqualsToken */ ?
function (t) { return areTypesComparable(t, valueType) || isCoercibleUnderDoubleEquals(t, valueType); } :
function (t) { return areTypesComparable(t, valueType); };
return replacePrimitivesWithLiterals(filterType(type, filterFn), valueType);
}
if (isUnitType(valueType)) {
return filterType(type, function (t) { return !(isUnitLikeType(t) && areTypesComparable(t, valueType)); });
}
return type;
}
function narrowTypeByTypeof(type, typeOfExpr, operator, literal, assumeTrue) {
// We have '==', '!=', '===', or !==' operator with 'typeof xxx' and string literal operands
if (operator === 35 /* ExclamationEqualsToken */ || operator === 37 /* ExclamationEqualsEqualsToken */) {
assumeTrue = !assumeTrue;
}
var target = getReferenceCandidate(typeOfExpr.expression);
if (!isMatchingReference(reference, target)) {
if (strictNullChecks && optionalChainContainsReference(target, reference) && assumeTrue === (literal.text !== "undefined")) {
return getTypeWithFacts(type, 2097152 /* NEUndefinedOrNull */);
}
return type;
}
if (type.flags & 1 /* Any */ && literal.text === "function") {
return type;
}
if (assumeTrue && type.flags & 2 /* Unknown */ && literal.text === "object") {
// The pattern x && typeof x === 'object', where x is of type unknown, narrows x to type object. We don't
// need to check for the reverse typeof x === 'object' && x since that already narrows correctly.
if (typeOfExpr.parent.parent.kind === 219 /* BinaryExpression */) {
var expr = typeOfExpr.parent.parent;
if (expr.operatorToken.kind === 55 /* AmpersandAmpersandToken */ && expr.right === typeOfExpr.parent && containsTruthyCheck(reference, expr.left)) {
return nonPrimitiveType;
}
}
return getUnionType([nonPrimitiveType, nullType]);
}
var facts = assumeTrue ?
typeofEQFacts.get(literal.text) || 128 /* TypeofEQHostObject */ :
typeofNEFacts.get(literal.text) || 32768 /* TypeofNEHostObject */;
var impliedType = getImpliedTypeFromTypeofGuard(type, literal.text);
return getTypeWithFacts(assumeTrue && impliedType ? mapType(type, narrowUnionMemberByTypeof(impliedType)) : type, facts);
}
function narrowTypeBySwitchOptionalChainContainment(type, switchStatement, clauseStart, clauseEnd, clauseCheck) {
var everyClauseChecks = clauseStart !== clauseEnd && ts.every(getSwitchClauseTypes(switchStatement).slice(clauseStart, clauseEnd), clauseCheck);
return everyClauseChecks ? getTypeWithFacts(type, 2097152 /* NEUndefinedOrNull */) : type;
}
function narrowTypeBySwitchOnDiscriminant(type, switchStatement, clauseStart, clauseEnd) {
// We only narrow if all case expressions specify
// values with unit types, except for the case where
// `type` is unknown. In this instance we map object
// types to the nonPrimitive type and narrow with that.
var switchTypes = getSwitchClauseTypes(switchStatement);
if (!switchTypes.length) {
return type;
}
var clauseTypes = switchTypes.slice(clauseStart, clauseEnd);
var hasDefaultClause = clauseStart === clauseEnd || ts.contains(clauseTypes, neverType);
if ((type.flags & 2 /* Unknown */) && !hasDefaultClause) {
var groundClauseTypes = void 0;
for (var i = 0; i < clauseTypes.length; i += 1) {
var t = clauseTypes[i];
if (t.flags & (131068 /* Primitive */ | 67108864 /* NonPrimitive */)) {
if (groundClauseTypes !== undefined) {
groundClauseTypes.push(t);
}
}
else if (t.flags & 524288 /* Object */) {
if (groundClauseTypes === undefined) {
groundClauseTypes = clauseTypes.slice(0, i);
}
groundClauseTypes.push(nonPrimitiveType);
}
else {
return type;
}
}
return getUnionType(groundClauseTypes === undefined ? clauseTypes : groundClauseTypes);
}
var discriminantType = getUnionType(clauseTypes);
var caseType = discriminantType.flags & 131072 /* Never */ ? neverType :
replacePrimitivesWithLiterals(filterType(type, function (t) { return areTypesComparable(discriminantType, t); }), discriminantType);
if (!hasDefaultClause) {
return caseType;
}
var defaultType = filterType(type, function (t) { return !(isUnitLikeType(t) && ts.contains(switchTypes, getRegularTypeOfLiteralType(extractUnitType(t)))); });
return caseType.flags & 131072 /* Never */ ? defaultType : getUnionType([caseType, defaultType]);
}
function getImpliedTypeFromTypeofGuard(type, text) {
switch (text) {
case "function":
return type.flags & 1 /* Any */ ? type : globalFunctionType;
case "object":
return type.flags & 2 /* Unknown */ ? getUnionType([nonPrimitiveType, nullType]) : type;
default:
return typeofTypesByName.get(text);
}
}
// When narrowing a union type by a `typeof` guard using type-facts alone, constituent types that are
// super-types of the implied guard will be retained in the final type: this is because type-facts only
// filter. Instead, we would like to replace those union constituents with the more precise type implied by
// the guard. For example: narrowing `{} | undefined` by `"boolean"` should produce the type `boolean`, not
// the filtered type `{}`. For this reason we narrow constituents of the union individually, in addition to
// filtering by type-facts.
function narrowUnionMemberByTypeof(candidate) {
return function (type) {
if (isTypeSubtypeOf(type, candidate)) {
return type;
}
if (isTypeSubtypeOf(candidate, type)) {
return candidate;
}
if (type.flags & 465829888 /* Instantiable */) {
var constraint = getBaseConstraintOfType(type) || anyType;
if (isTypeSubtypeOf(candidate, constraint)) {
return getIntersectionType([type, candidate]);
}
}
return type;
};
}
function narrowBySwitchOnTypeOf(type, switchStatement, clauseStart, clauseEnd) {
var switchWitnesses = getSwitchClauseTypeOfWitnesses(switchStatement, /*retainDefault*/ true);
if (!switchWitnesses.length) {
return type;
}
// Equal start and end denotes implicit fallthrough; undefined marks explicit default clause
var defaultCaseLocation = ts.findIndex(switchWitnesses, function (elem) { return elem === undefined; });
var hasDefaultClause = clauseStart === clauseEnd || (defaultCaseLocation >= clauseStart && defaultCaseLocation < clauseEnd);
var clauseWitnesses;
var switchFacts;
if (defaultCaseLocation > -1) {
// We no longer need the undefined denoting an explicit default case. Remove the undefined and
// fix-up clauseStart and clauseEnd. This means that we don't have to worry about undefined in the
// witness array.
var witnesses = switchWitnesses.filter(function (witness) { return witness !== undefined; });
// The adjusted clause start and end after removing the `default` statement.
var fixedClauseStart = defaultCaseLocation < clauseStart ? clauseStart - 1 : clauseStart;
var fixedClauseEnd = defaultCaseLocation < clauseEnd ? clauseEnd - 1 : clauseEnd;
clauseWitnesses = witnesses.slice(fixedClauseStart, fixedClauseEnd);
switchFacts = getFactsFromTypeofSwitch(fixedClauseStart, fixedClauseEnd, witnesses, hasDefaultClause);
}
else {
clauseWitnesses = switchWitnesses.slice(clauseStart, clauseEnd);
switchFacts = getFactsFromTypeofSwitch(clauseStart, clauseEnd, switchWitnesses, hasDefaultClause);
}
if (hasDefaultClause) {
return filterType(type, function (t) { return (getTypeFacts(t) & switchFacts) === switchFacts; });
}
/*
The implied type is the raw type suggested by a
value being caught in this clause.
When the clause contains a default case we ignore
the implied type and try to narrow using any facts
we can learn: see `switchFacts`.
Example:
switch (typeof x) {
case 'number':
case 'string': break;
default: break;
case 'number':
case 'boolean': break
}
In the first clause (case `number` and `string`) the
implied type is number | string.
In the default clause we de not compute an implied type.
In the third clause (case `number` and `boolean`)
the naive implied type is number | boolean, however
we use the type facts to narrow the implied type to
boolean. We know that number cannot be selected
because it is caught in the first clause.
*/
var impliedType = getTypeWithFacts(getUnionType(clauseWitnesses.map(function (text) { return getImpliedTypeFromTypeofGuard(type, text) || type; })), switchFacts);
return getTypeWithFacts(mapType(type, narrowUnionMemberByTypeof(impliedType)), switchFacts);
}
function isMatchingConstructorReference(expr) {
return (ts.isPropertyAccessExpression(expr) && ts.idText(expr.name) === "constructor" ||
ts.isElementAccessExpression(expr) && ts.isStringLiteralLike(expr.argumentExpression) && expr.argumentExpression.text === "constructor") &&
isMatchingReference(reference, expr.expression);
}
function narrowTypeByConstructor(type, operator, identifier, assumeTrue) {
// Do not narrow when checking inequality.
if (assumeTrue ? (operator !== 34 /* EqualsEqualsToken */ && operator !== 36 /* EqualsEqualsEqualsToken */) : (operator !== 35 /* ExclamationEqualsToken */ && operator !== 37 /* ExclamationEqualsEqualsToken */)) {
return type;
}
// Get the type of the constructor identifier expression, if it is not a function then do not narrow.
var identifierType = getTypeOfExpression(identifier);
if (!isFunctionType(identifierType) && !isConstructorType(identifierType)) {
return type;
}
// Get the prototype property of the type identifier so we can find out its type.
var prototypeProperty = getPropertyOfType(identifierType, "prototype");
if (!prototypeProperty) {
return type;
}
// Get the type of the prototype, if it is undefined, or the global `Object` or `Function` types then do not narrow.
var prototypeType = getTypeOfSymbol(prototypeProperty);
var candidate = !isTypeAny(prototypeType) ? prototypeType : undefined;
if (!candidate || candidate === globalObjectType || candidate === globalFunctionType) {
return type;
}
// If the type that is being narrowed is `any` then just return the `candidate` type since every type is a subtype of `any`.
if (isTypeAny(type)) {
return candidate;
}
// Filter out types that are not considered to be "constructed by" the `candidate` type.
return filterType(type, function (t) { return isConstructedBy(t, candidate); });
function isConstructedBy(source, target) {
// If either the source or target type are a class type then we need to check that they are the same exact type.
// This is because you may have a class `A` that defines some set of properties, and another class `B`
// that defines the same set of properties as class `A`, in that case they are structurally the same
// type, but when you do something like `instanceOfA.constructor === B` it will return false.
if (source.flags & 524288 /* Object */ && ts.getObjectFlags(source) & 1 /* Class */ ||
target.flags & 524288 /* Object */ && ts.getObjectFlags(target) & 1 /* Class */) {
return source.symbol === target.symbol;
}
// For all other types just check that the `source` type is a subtype of the `target` type.
return isTypeSubtypeOf(source, target);
}
}
function narrowTypeByInstanceof(type, expr, assumeTrue) {
var left = getReferenceCandidate(expr.left);
if (!isMatchingReference(reference, left)) {
if (assumeTrue && strictNullChecks && optionalChainContainsReference(left, reference)) {
return getTypeWithFacts(type, 2097152 /* NEUndefinedOrNull */);
}
return type;
}
// Check that right operand is a function type with a prototype property
var rightType = getTypeOfExpression(expr.right);
if (!isTypeDerivedFrom(rightType, globalFunctionType)) {
return type;
}
var targetType;
var prototypeProperty = getPropertyOfType(rightType, "prototype");
if (prototypeProperty) {
// Target type is type of the prototype property
var prototypePropertyType = getTypeOfSymbol(prototypeProperty);
if (!isTypeAny(prototypePropertyType)) {
targetType = prototypePropertyType;
}
}
// Don't narrow from 'any' if the target type is exactly 'Object' or 'Function'
if (isTypeAny(type) && (targetType === globalObjectType || targetType === globalFunctionType)) {
return type;
}
if (!targetType) {
var constructSignatures = getSignaturesOfType(rightType, 1 /* Construct */);
targetType = constructSignatures.length ?
getUnionType(ts.map(constructSignatures, function (signature) { return getReturnTypeOfSignature(getErasedSignature(signature)); })) :
emptyObjectType;
}
// We can't narrow a union based off instanceof without negated types see #31576 for more info
if (!assumeTrue && rightType.flags & 1048576 /* Union */) {
var nonConstructorTypeInUnion = ts.find(rightType.types, function (t) { return !isConstructorType(t); });
if (!nonConstructorTypeInUnion)
return type;
}
return getNarrowedType(type, targetType, assumeTrue, isTypeDerivedFrom);
}
function getNarrowedType(type, candidate, assumeTrue, isRelated) {
if (!assumeTrue) {
return filterType(type, function (t) {
if (!isRelated(t, candidate)) {
return true;
}
var constraint = getBaseConstraintOfType(t);
if (constraint && constraint !== t) {
return !isRelated(constraint, candidate);
}
return false;
});
}
// If the current type is a union type, remove all constituents that couldn't be instances of
// the candidate type. If one or more constituents remain, return a union of those.
if (type.flags & 1048576 /* Union */) {
var assignableType = filterType(type, function (t) { return isRelated(t, candidate); });
if (!(assignableType.flags & 131072 /* Never */)) {
return assignableType;
}
}
// If the candidate type is a subtype of the target type, narrow to the candidate type.
// Otherwise, if the target type is assignable to the candidate type, keep the target type.
// Otherwise, if the candidate type is assignable to the target type, narrow to the candidate
// type. Otherwise, the types are completely unrelated, so narrow to an intersection of the
// two types.
return isTypeSubtypeOf(candidate, type) ? candidate :
isTypeAssignableTo(type, candidate) ? type :
isTypeAssignableTo(candidate, type) ? candidate :
getIntersectionType([type, candidate]);
}
function narrowTypeByCallExpression(type, callExpression, assumeTrue) {
if (hasMatchingArgument(callExpression, reference)) {
var signature = assumeTrue || !ts.isCallChain(callExpression) ? getEffectsSignature(callExpression) : undefined;
var predicate = signature && getTypePredicateOfSignature(signature);
if (predicate && (predicate.kind === 0 /* This */ || predicate.kind === 1 /* Identifier */)) {
return narrowTypeByTypePredicate(type, predicate, callExpression, assumeTrue);
}
}
if (containsMissingType(type) && ts.isAccessExpression(reference) && ts.isPropertyAccessExpression(callExpression.expression)) {
var callAccess = callExpression.expression;
if (isMatchingReference(reference.expression, getReferenceCandidate(callAccess.expression)) &&
ts.isIdentifier(callAccess.name) && callAccess.name.escapedText === "hasOwnProperty" && callExpression.arguments.length === 1) {
var argument = callExpression.arguments[0];
if (ts.isStringLiteralLike(argument) && getAccessedPropertyName(reference) === ts.escapeLeadingUnderscores(argument.text)) {
return getTypeWithFacts(type, assumeTrue ? 524288 /* NEUndefined */ : 65536 /* EQUndefined */);
}
}
}
return type;
}
function narrowTypeByTypePredicate(type, predicate, callExpression, assumeTrue) {
// Don't narrow from 'any' if the predicate type is exactly 'Object' or 'Function'
if (predicate.type && !(isTypeAny(type) && (predicate.type === globalObjectType || predicate.type === globalFunctionType))) {
var predicateArgument = getTypePredicateArgument(predicate, callExpression);
if (predicateArgument) {
if (isMatchingReference(reference, predicateArgument)) {
return getNarrowedType(type, predicate.type, assumeTrue, isTypeSubtypeOf);
}
if (strictNullChecks && assumeTrue && optionalChainContainsReference(predicateArgument, reference) &&
!(getTypeFacts(predicate.type) & 65536 /* EQUndefined */)) {
type = getTypeWithFacts(type, 2097152 /* NEUndefinedOrNull */);
}
var access = getDiscriminantPropertyAccess(predicateArgument, type);
if (access) {
return narrowTypeByDiscriminant(type, access, function (t) { return getNarrowedType(t, predicate.type, assumeTrue, isTypeSubtypeOf); });
}
}
}
return type;
}
// Narrow the given type based on the given expression having the assumed boolean value. The returned type
// will be a subtype or the same type as the argument.
function narrowType(type, expr, assumeTrue) {
// for `a?.b`, we emulate a synthetic `a !== null && a !== undefined` condition for `a`
if (ts.isExpressionOfOptionalChainRoot(expr) ||
ts.isBinaryExpression(expr.parent) && expr.parent.operatorToken.kind === 60 /* QuestionQuestionToken */ && expr.parent.left === expr) {
return narrowTypeByOptionality(type, expr, assumeTrue);
}
switch (expr.kind) {
case 79 /* Identifier */:
// When narrowing a reference to a const variable, non-assigned parameter, or readonly property, we inline
// up to five levels of aliased conditional expressions that are themselves declared as const variables.
if (!isMatchingReference(reference, expr) && inlineLevel < 5) {
var symbol = getResolvedSymbol(expr);
if (isConstVariable(symbol)) {
var declaration = symbol.valueDeclaration;
if (declaration && ts.isVariableDeclaration(declaration) && !declaration.type && declaration.initializer && isConstantReference(reference)) {
inlineLevel++;
var result = narrowType(type, declaration.initializer, assumeTrue);
inlineLevel--;
return result;
}
}
}
// falls through
case 108 /* ThisKeyword */:
case 106 /* SuperKeyword */:
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
return narrowTypeByTruthiness(type, expr, assumeTrue);
case 206 /* CallExpression */:
return narrowTypeByCallExpression(type, expr, assumeTrue);
case 210 /* ParenthesizedExpression */:
case 228 /* NonNullExpression */:
return narrowType(type, expr.expression, assumeTrue);
case 219 /* BinaryExpression */:
return narrowTypeByBinaryExpression(type, expr, assumeTrue);
case 217 /* PrefixUnaryExpression */:
if (expr.operator === 53 /* ExclamationToken */) {
return narrowType(type, expr.operand, !assumeTrue);
}
break;
}
return type;
}
function narrowTypeByOptionality(type, expr, assumePresent) {
if (isMatchingReference(reference, expr)) {
return getTypeWithFacts(type, assumePresent ? 2097152 /* NEUndefinedOrNull */ : 262144 /* EQUndefinedOrNull */);
}
var access = getDiscriminantPropertyAccess(expr, type);
if (access) {
return narrowTypeByDiscriminant(type, access, function (t) { return getTypeWithFacts(t, assumePresent ? 2097152 /* NEUndefinedOrNull */ : 262144 /* EQUndefinedOrNull */); });
}
return type;
}
}
function getTypeOfSymbolAtLocation(symbol, location) {
symbol = symbol.exportSymbol || symbol;
// If we have an identifier or a property access at the given location, if the location is
// an dotted name expression, and if the location is not an assignment target, obtain the type
// of the expression (which will reflect control flow analysis). If the expression indeed
// resolved to the given symbol, return the narrowed type.
if (location.kind === 79 /* Identifier */ || location.kind === 80 /* PrivateIdentifier */) {
if (ts.isRightSideOfQualifiedNameOrPropertyAccess(location)) {
location = location.parent;
}
if (ts.isExpressionNode(location) && (!ts.isAssignmentTarget(location) || ts.isWriteAccess(location))) {
var type = getTypeOfExpression(location);
if (getExportSymbolOfValueSymbolIfExported(getNodeLinks(location).resolvedSymbol) === symbol) {
return type;
}
}
}
if (ts.isDeclarationName(location) && ts.isSetAccessor(location.parent) && getAnnotatedAccessorTypeNode(location.parent)) {
return resolveTypeOfAccessors(location.parent.symbol, /*writing*/ true);
}
// The location isn't a reference to the given symbol, meaning we're being asked
// a hypothetical question of what type the symbol would have if there was a reference
// to it at the given location. Since we have no control flow information for the
// hypothetical reference (control flow information is created and attached by the
// binder), we simply return the declared type of the symbol.
return getNonMissingTypeOfSymbol(symbol);
}
function getControlFlowContainer(node) {
return ts.findAncestor(node.parent, function (node) {
return ts.isFunctionLike(node) && !ts.getImmediatelyInvokedFunctionExpression(node) ||
node.kind === 260 /* ModuleBlock */ ||
node.kind === 300 /* SourceFile */ ||
node.kind === 165 /* PropertyDeclaration */;
});
}
// Check if a parameter is assigned anywhere within its declaring function.
function isParameterAssigned(symbol) {
if (!symbol.valueDeclaration) {
return false;
}
var func = ts.getRootDeclaration(symbol.valueDeclaration).parent;
var links = getNodeLinks(func);
if (!(links.flags & 8388608 /* AssignmentsMarked */)) {
links.flags |= 8388608 /* AssignmentsMarked */;
if (!hasParentWithAssignmentsMarked(func)) {
markParameterAssignments(func);
}
}
return symbol.isAssigned || false;
}
function hasParentWithAssignmentsMarked(node) {
return !!ts.findAncestor(node.parent, function (node) { return ts.isFunctionLike(node) && !!(getNodeLinks(node).flags & 8388608 /* AssignmentsMarked */); });
}
function markParameterAssignments(node) {
if (node.kind === 79 /* Identifier */) {
if (ts.isAssignmentTarget(node)) {
var symbol = getResolvedSymbol(node);
if (symbol.valueDeclaration && ts.getRootDeclaration(symbol.valueDeclaration).kind === 162 /* Parameter */) {
symbol.isAssigned = true;
}
}
}
else {
ts.forEachChild(node, markParameterAssignments);
}
}
function isConstVariable(symbol) {
return symbol.flags & 3 /* Variable */ && (getDeclarationNodeFlagsFromSymbol(symbol) & 2 /* Const */) !== 0;
}
/** remove undefined from the annotated type of a parameter when there is an initializer (that doesn't include undefined) */
function removeOptionalityFromDeclaredType(declaredType, declaration) {
if (pushTypeResolution(declaration.symbol, 2 /* DeclaredType */)) {
var annotationIncludesUndefined = strictNullChecks &&
declaration.kind === 162 /* Parameter */ &&
declaration.initializer &&
getFalsyFlags(declaredType) & 32768 /* Undefined */ &&
!(getFalsyFlags(checkExpression(declaration.initializer)) & 32768 /* Undefined */);
popTypeResolution();
return annotationIncludesUndefined ? getTypeWithFacts(declaredType, 524288 /* NEUndefined */) : declaredType;
}
else {
reportCircularityError(declaration.symbol);
return declaredType;
}
}
function isConstraintPosition(type, node) {
var parent = node.parent;
// In an element access obj[x], we consider obj to be in a constraint position, except when obj is of
// a generic type without a nullable constraint and x is a generic type. This is because when both obj
// and x are of generic types T and K, we want the resulting type to be T[K].
return parent.kind === 204 /* PropertyAccessExpression */ ||
parent.kind === 206 /* CallExpression */ && parent.expression === node ||
parent.kind === 205 /* ElementAccessExpression */ && parent.expression === node &&
!(isGenericTypeWithoutNullableConstraint(type) && isGenericIndexType(getTypeOfExpression(parent.argumentExpression)));
}
function isGenericTypeWithUnionConstraint(type) {
return !!(type.flags & 465829888 /* Instantiable */ && getBaseConstraintOrType(type).flags & (98304 /* Nullable */ | 1048576 /* Union */));
}
function isGenericTypeWithoutNullableConstraint(type) {
return !!(type.flags & 465829888 /* Instantiable */ && !maybeTypeOfKind(getBaseConstraintOrType(type), 98304 /* Nullable */));
}
function hasNonBindingPatternContextualTypeWithNoGenericTypes(node) {
// Computing the contextual type for a child of a JSX element involves resolving the type of the
// element's tag name, so we exclude that here to avoid circularities.
var contextualType = (ts.isIdentifier(node) || ts.isPropertyAccessExpression(node) || ts.isElementAccessExpression(node)) &&
!((ts.isJsxOpeningElement(node.parent) || ts.isJsxSelfClosingElement(node.parent)) && node.parent.tagName === node) &&
getContextualType(node, 8 /* SkipBindingPatterns */);
return contextualType && !isGenericType(contextualType);
}
function getNarrowableTypeForReference(type, reference, checkMode) {
// When the type of a reference is or contains an instantiable type with a union type constraint, and
// when the reference is in a constraint position (where it is known we'll obtain the apparent type) or
// has a contextual type containing no top-level instantiables (meaning constraints will determine
// assignability), we substitute constraints for all instantiables in the type of the reference to give
// control flow analysis an opportunity to narrow it further. For example, for a reference of a type
// parameter type 'T extends string | undefined' with a contextual type 'string', we substitute
// 'string | undefined' to give control flow analysis the opportunity to narrow to type 'string'.
var substituteConstraints = !(checkMode && checkMode & 2 /* Inferential */) &&
someType(type, isGenericTypeWithUnionConstraint) &&
(isConstraintPosition(type, reference) || hasNonBindingPatternContextualTypeWithNoGenericTypes(reference));
return substituteConstraints ? mapType(type, function (t) { return t.flags & 465829888 /* Instantiable */ ? getBaseConstraintOrType(t) : t; }) : type;
}
function isExportOrExportExpression(location) {
return !!ts.findAncestor(location, function (e) { return e.parent && ts.isExportAssignment(e.parent) && e.parent.expression === e && ts.isEntityNameExpression(e); });
}
function markAliasReferenced(symbol, location) {
if (isNonLocalAlias(symbol, /*excludes*/ 111551 /* Value */) && !isInTypeQuery(location) && !getTypeOnlyAliasDeclaration(symbol)) {
var target = resolveAlias(symbol);
if (target.flags & 111551 /* Value */) {
// An alias resolving to a const enum cannot be elided if (1) 'isolatedModules' is enabled
// (because the const enum value will not be inlined), or if (2) the alias is an export
// of a const enum declaration that will be preserved.
if (compilerOptions.isolatedModules ||
ts.shouldPreserveConstEnums(compilerOptions) && isExportOrExportExpression(location) ||
!isConstEnumOrConstEnumOnlyModule(target)) {
markAliasSymbolAsReferenced(symbol);
}
else {
markConstEnumAliasAsReferenced(symbol);
}
}
}
}
function checkIdentifier(node, checkMode) {
var symbol = getResolvedSymbol(node);
if (symbol === unknownSymbol) {
return errorType;
}
// As noted in ECMAScript 6 language spec, arrow functions never have an arguments objects.
// Although in down-level emit of arrow function, we emit it using function expression which means that
// arguments objects will be bound to the inner object; emitting arrow function natively in ES6, arguments objects
// will be bound to non-arrow function that contain this arrow function. This results in inconsistent behavior.
// To avoid that we will give an error to users if they use arguments objects in arrow function so that they
// can explicitly bound arguments objects
if (symbol === argumentsSymbol) {
if (isInPropertyInitializerOrClassStaticBlock(node)) {
error(node, ts.Diagnostics.arguments_cannot_be_referenced_in_property_initializers);
return errorType;
}
var container = ts.getContainingFunction(node);
if (languageVersion < 2 /* ES2015 */) {
if (container.kind === 212 /* ArrowFunction */) {
error(node, ts.Diagnostics.The_arguments_object_cannot_be_referenced_in_an_arrow_function_in_ES3_and_ES5_Consider_using_a_standard_function_expression);
}
else if (ts.hasSyntacticModifier(container, 256 /* Async */)) {
error(node, ts.Diagnostics.The_arguments_object_cannot_be_referenced_in_an_async_function_or_method_in_ES3_and_ES5_Consider_using_a_standard_function_or_method);
}
}
getNodeLinks(container).flags |= 8192 /* CaptureArguments */;
return getTypeOfSymbol(symbol);
}
// We should only mark aliases as referenced if there isn't a local value declaration
// for the symbol. Also, don't mark any property access expression LHS - checkPropertyAccessExpression will handle that
if (!(node.parent && ts.isPropertyAccessExpression(node.parent) && node.parent.expression === node)) {
markAliasReferenced(symbol, node);
}
var localOrExportSymbol = getExportSymbolOfValueSymbolIfExported(symbol);
var sourceSymbol = localOrExportSymbol.flags & 2097152 /* Alias */ ? resolveAlias(localOrExportSymbol) : localOrExportSymbol;
if (sourceSymbol.declarations && getDeclarationNodeFlagsFromSymbol(sourceSymbol) & 134217728 /* Deprecated */ && isUncalledFunctionReference(node, sourceSymbol)) {
addDeprecatedSuggestion(node, sourceSymbol.declarations, node.escapedText);
}
var declaration = localOrExportSymbol.valueDeclaration;
if (declaration && localOrExportSymbol.flags & 32 /* Class */) {
// Due to the emit for class decorators, any reference to the class from inside of the class body
// must instead be rewritten to point to a temporary variable to avoid issues with the double-bind
// behavior of class names in ES6.
if (declaration.kind === 255 /* ClassDeclaration */
&& ts.nodeIsDecorated(declaration)) {
var container = ts.getContainingClass(node);
while (container !== undefined) {
if (container === declaration && container.name !== node) {
getNodeLinks(declaration).flags |= 16777216 /* ClassWithConstructorReference */;
getNodeLinks(node).flags |= 33554432 /* ConstructorReferenceInClass */;
break;
}
container = ts.getContainingClass(container);
}
}
else if (declaration.kind === 224 /* ClassExpression */) {
// When we emit a class expression with static members that contain a reference
// to the constructor in the initializer, we will need to substitute that
// binding with an alias as the class name is not in scope.
var container = ts.getThisContainer(node, /*includeArrowFunctions*/ false);
while (container.kind !== 300 /* SourceFile */) {
if (container.parent === declaration) {
if (ts.isPropertyDeclaration(container) && ts.isStatic(container) || ts.isClassStaticBlockDeclaration(container)) {
getNodeLinks(declaration).flags |= 16777216 /* ClassWithConstructorReference */;
getNodeLinks(node).flags |= 33554432 /* ConstructorReferenceInClass */;
}
break;
}
container = ts.getThisContainer(container, /*includeArrowFunctions*/ false);
}
}
}
checkNestedBlockScopedBinding(node, symbol);
var type = getTypeOfSymbol(localOrExportSymbol);
var assignmentKind = ts.getAssignmentTargetKind(node);
if (assignmentKind) {
if (!(localOrExportSymbol.flags & 3 /* Variable */) &&
!(ts.isInJSFile(node) && localOrExportSymbol.flags & 512 /* ValueModule */)) {
var assignmentError = localOrExportSymbol.flags & 384 /* Enum */ ? ts.Diagnostics.Cannot_assign_to_0_because_it_is_an_enum
: localOrExportSymbol.flags & 32 /* Class */ ? ts.Diagnostics.Cannot_assign_to_0_because_it_is_a_class
: localOrExportSymbol.flags & 1536 /* Module */ ? ts.Diagnostics.Cannot_assign_to_0_because_it_is_a_namespace
: localOrExportSymbol.flags & 16 /* Function */ ? ts.Diagnostics.Cannot_assign_to_0_because_it_is_a_function
: localOrExportSymbol.flags & 2097152 /* Alias */ ? ts.Diagnostics.Cannot_assign_to_0_because_it_is_an_import
: ts.Diagnostics.Cannot_assign_to_0_because_it_is_not_a_variable;
error(node, assignmentError, symbolToString(symbol));
return errorType;
}
if (isReadonlySymbol(localOrExportSymbol)) {
if (localOrExportSymbol.flags & 3 /* Variable */) {
error(node, ts.Diagnostics.Cannot_assign_to_0_because_it_is_a_constant, symbolToString(symbol));
}
else {
error(node, ts.Diagnostics.Cannot_assign_to_0_because_it_is_a_read_only_property, symbolToString(symbol));
}
return errorType;
}
}
var isAlias = localOrExportSymbol.flags & 2097152 /* Alias */;
// We only narrow variables and parameters occurring in a non-assignment position. For all other
// entities we simply return the declared type.
if (localOrExportSymbol.flags & 3 /* Variable */) {
if (assignmentKind === 1 /* Definite */) {
return type;
}
}
else if (isAlias) {
declaration = getDeclarationOfAliasSymbol(symbol);
}
else {
return type;
}
if (!declaration) {
return type;
}
type = getNarrowableTypeForReference(type, node, checkMode);
// The declaration container is the innermost function that encloses the declaration of the variable
// or parameter. The flow container is the innermost function starting with which we analyze the control
// flow graph to determine the control flow based type.
var isParameter = ts.getRootDeclaration(declaration).kind === 162 /* Parameter */;
var declarationContainer = getControlFlowContainer(declaration);
var flowContainer = getControlFlowContainer(node);
var isOuterVariable = flowContainer !== declarationContainer;
var isSpreadDestructuringAssignmentTarget = node.parent && node.parent.parent && ts.isSpreadAssignment(node.parent) && isDestructuringAssignmentTarget(node.parent.parent);
var isModuleExports = symbol.flags & 134217728 /* ModuleExports */;
// When the control flow originates in a function expression or arrow function and we are referencing
// a const variable or parameter from an outer function, we extend the origin of the control flow
// analysis to include the immediately enclosing function.
while (flowContainer !== declarationContainer && (flowContainer.kind === 211 /* FunctionExpression */ ||
flowContainer.kind === 212 /* ArrowFunction */ || ts.isObjectLiteralOrClassExpressionMethod(flowContainer)) &&
(isConstVariable(localOrExportSymbol) && type !== autoArrayType || isParameter && !isParameterAssigned(localOrExportSymbol))) {
flowContainer = getControlFlowContainer(flowContainer);
}
// We only look for uninitialized variables in strict null checking mode, and only when we can analyze
// the entire control flow graph from the variable's declaration (i.e. when the flow container and
// declaration container are the same).
var assumeInitialized = isParameter || isAlias || isOuterVariable || isSpreadDestructuringAssignmentTarget || isModuleExports || ts.isBindingElement(declaration) ||
type !== autoType && type !== autoArrayType && (!strictNullChecks || (type.flags & (3 /* AnyOrUnknown */ | 16384 /* Void */)) !== 0 ||
isInTypeQuery(node) || node.parent.kind === 273 /* ExportSpecifier */) ||
node.parent.kind === 228 /* NonNullExpression */ ||
declaration.kind === 252 /* VariableDeclaration */ && declaration.exclamationToken ||
declaration.flags & 8388608 /* Ambient */;
var initialType = assumeInitialized ? (isParameter ? removeOptionalityFromDeclaredType(type, declaration) : type) :
type === autoType || type === autoArrayType ? undefinedType :
getOptionalType(type);
var flowType = getFlowTypeOfReference(node, type, initialType, flowContainer);
// A variable is considered uninitialized when it is possible to analyze the entire control flow graph
// from declaration to use, and when the variable's declared type doesn't include undefined but the
// control flow based type does include undefined.
if (!isEvolvingArrayOperationTarget(node) && (type === autoType || type === autoArrayType)) {
if (flowType === autoType || flowType === autoArrayType) {
if (noImplicitAny) {
error(ts.getNameOfDeclaration(declaration), ts.Diagnostics.Variable_0_implicitly_has_type_1_in_some_locations_where_its_type_cannot_be_determined, symbolToString(symbol), typeToString(flowType));
error(node, ts.Diagnostics.Variable_0_implicitly_has_an_1_type, symbolToString(symbol), typeToString(flowType));
}
return convertAutoToAny(flowType);
}
}
else if (!assumeInitialized && !(getFalsyFlags(type) & 32768 /* Undefined */) && getFalsyFlags(flowType) & 32768 /* Undefined */) {
error(node, ts.Diagnostics.Variable_0_is_used_before_being_assigned, symbolToString(symbol));
// Return the declared type to reduce follow-on errors
return type;
}
return assignmentKind ? getBaseTypeOfLiteralType(flowType) : flowType;
}
function isInsideFunctionOrInstancePropertyInitializer(node, threshold) {
return !!ts.findAncestor(node, function (n) { return n === threshold ? "quit" : ts.isFunctionLike(n) || (n.parent && ts.isPropertyDeclaration(n.parent) && !ts.hasStaticModifier(n.parent) && n.parent.initializer === n); });
}
function getPartOfForStatementContainingNode(node, container) {
return ts.findAncestor(node, function (n) { return n === container ? "quit" : n === container.initializer || n === container.condition || n === container.incrementor || n === container.statement; });
}
function getEnclosingIterationStatement(node) {
return ts.findAncestor(node, function (n) { return (!n || ts.nodeStartsNewLexicalEnvironment(n)) ? "quit" : ts.isIterationStatement(n, /*lookInLabeledStatements*/ false); });
}
function checkNestedBlockScopedBinding(node, symbol) {
if (languageVersion >= 2 /* ES2015 */ ||
(symbol.flags & (2 /* BlockScopedVariable */ | 32 /* Class */)) === 0 ||
!symbol.valueDeclaration ||
ts.isSourceFile(symbol.valueDeclaration) ||
symbol.valueDeclaration.parent.kind === 290 /* CatchClause */) {
return;
}
// 1. walk from the use site up to the declaration and check
// if there is anything function like between declaration and use-site (is binding/class is captured in function).
// 2. walk from the declaration up to the boundary of lexical environment and check
// if there is an iteration statement in between declaration and boundary (is binding/class declared inside iteration statement)
var container = ts.getEnclosingBlockScopeContainer(symbol.valueDeclaration);
var isCaptured = isInsideFunctionOrInstancePropertyInitializer(node, container);
var enclosingIterationStatement = getEnclosingIterationStatement(container);
if (enclosingIterationStatement) {
if (isCaptured) {
// mark iteration statement as containing block-scoped binding captured in some function
var capturesBlockScopeBindingInLoopBody = true;
if (ts.isForStatement(container)) {
var varDeclList = ts.getAncestor(symbol.valueDeclaration, 253 /* VariableDeclarationList */);
if (varDeclList && varDeclList.parent === container) {
var part = getPartOfForStatementContainingNode(node.parent, container);
if (part) {
var links = getNodeLinks(part);
links.flags |= 131072 /* ContainsCapturedBlockScopeBinding */;
var capturedBindings = links.capturedBlockScopeBindings || (links.capturedBlockScopeBindings = []);
ts.pushIfUnique(capturedBindings, symbol);
if (part === container.initializer) {
capturesBlockScopeBindingInLoopBody = false; // Initializer is outside of loop body
}
}
}
}
if (capturesBlockScopeBindingInLoopBody) {
getNodeLinks(enclosingIterationStatement).flags |= 65536 /* LoopWithCapturedBlockScopedBinding */;
}
}
// mark variables that are declared in loop initializer and reassigned inside the body of ForStatement.
// if body of ForStatement will be converted to function then we'll need a extra machinery to propagate reassigned values back.
if (ts.isForStatement(container)) {
var varDeclList = ts.getAncestor(symbol.valueDeclaration, 253 /* VariableDeclarationList */);
if (varDeclList && varDeclList.parent === container && isAssignedInBodyOfForStatement(node, container)) {
getNodeLinks(symbol.valueDeclaration).flags |= 4194304 /* NeedsLoopOutParameter */;
}
}
// set 'declared inside loop' bit on the block-scoped binding
getNodeLinks(symbol.valueDeclaration).flags |= 524288 /* BlockScopedBindingInLoop */;
}
if (isCaptured) {
getNodeLinks(symbol.valueDeclaration).flags |= 262144 /* CapturedBlockScopedBinding */;
}
}
function isBindingCapturedByNode(node, decl) {
var links = getNodeLinks(node);
return !!links && ts.contains(links.capturedBlockScopeBindings, getSymbolOfNode(decl));
}
function isAssignedInBodyOfForStatement(node, container) {
// skip parenthesized nodes
var current = node;
while (current.parent.kind === 210 /* ParenthesizedExpression */) {
current = current.parent;
}
// check if node is used as LHS in some assignment expression
var isAssigned = false;
if (ts.isAssignmentTarget(current)) {
isAssigned = true;
}
else if ((current.parent.kind === 217 /* PrefixUnaryExpression */ || current.parent.kind === 218 /* PostfixUnaryExpression */)) {
var expr = current.parent;
isAssigned = expr.operator === 45 /* PlusPlusToken */ || expr.operator === 46 /* MinusMinusToken */;
}
if (!isAssigned) {
return false;
}
// at this point we know that node is the target of assignment
// now check that modification happens inside the statement part of the ForStatement
return !!ts.findAncestor(current, function (n) { return n === container ? "quit" : n === container.statement; });
}
function captureLexicalThis(node, container) {
getNodeLinks(node).flags |= 2 /* LexicalThis */;
if (container.kind === 165 /* PropertyDeclaration */ || container.kind === 169 /* Constructor */) {
var classNode = container.parent;
getNodeLinks(classNode).flags |= 4 /* CaptureThis */;
}
else {
getNodeLinks(container).flags |= 4 /* CaptureThis */;
}
}
function findFirstSuperCall(node) {
return ts.isSuperCall(node) ? node :
ts.isFunctionLike(node) ? undefined :
ts.forEachChild(node, findFirstSuperCall);
}
/**
* Check if the given class-declaration extends null then return true.
* Otherwise, return false
* @param classDecl a class declaration to check if it extends null
*/
function classDeclarationExtendsNull(classDecl) {
var classSymbol = getSymbolOfNode(classDecl);
var classInstanceType = getDeclaredTypeOfSymbol(classSymbol);
var baseConstructorType = getBaseConstructorTypeOfClass(classInstanceType);
return baseConstructorType === nullWideningType;
}
function checkThisBeforeSuper(node, container, diagnosticMessage) {
var containingClassDecl = container.parent;
var baseTypeNode = ts.getClassExtendsHeritageElement(containingClassDecl);
// If a containing class does not have extends clause or the class extends null
// skip checking whether super statement is called before "this" accessing.
if (baseTypeNode && !classDeclarationExtendsNull(containingClassDecl)) {
if (node.flowNode && !isPostSuperFlowNode(node.flowNode, /*noCacheCheck*/ false)) {
error(node, diagnosticMessage);
}
}
}
function checkThisInStaticClassFieldInitializerInDecoratedClass(thisExpression, container) {
if (ts.isPropertyDeclaration(container) && ts.hasStaticModifier(container) &&
container.initializer && ts.textRangeContainsPositionInclusive(container.initializer, thisExpression.pos) && ts.length(container.parent.decorators)) {
error(thisExpression, ts.Diagnostics.Cannot_use_this_in_a_static_property_initializer_of_a_decorated_class);
}
}
function checkThisExpression(node) {
var isNodeInTypeQuery = isInTypeQuery(node);
// Stop at the first arrow function so that we can
// tell whether 'this' needs to be captured.
var container = ts.getThisContainer(node, /* includeArrowFunctions */ true);
var capturedByArrowFunction = false;
if (container.kind === 169 /* Constructor */) {
checkThisBeforeSuper(node, container, ts.Diagnostics.super_must_be_called_before_accessing_this_in_the_constructor_of_a_derived_class);
}
// Now skip arrow functions to get the "real" owner of 'this'.
if (container.kind === 212 /* ArrowFunction */) {
container = ts.getThisContainer(container, /* includeArrowFunctions */ false);
capturedByArrowFunction = true;
}
checkThisInStaticClassFieldInitializerInDecoratedClass(node, container);
switch (container.kind) {
case 259 /* ModuleDeclaration */:
error(node, ts.Diagnostics.this_cannot_be_referenced_in_a_module_or_namespace_body);
// do not return here so in case if lexical this is captured - it will be reflected in flags on NodeLinks
break;
case 258 /* EnumDeclaration */:
error(node, ts.Diagnostics.this_cannot_be_referenced_in_current_location);
// do not return here so in case if lexical this is captured - it will be reflected in flags on NodeLinks
break;
case 169 /* Constructor */:
if (isInConstructorArgumentInitializer(node, container)) {
error(node, ts.Diagnostics.this_cannot_be_referenced_in_constructor_arguments);
// do not return here so in case if lexical this is captured - it will be reflected in flags on NodeLinks
}
break;
case 160 /* ComputedPropertyName */:
error(node, ts.Diagnostics.this_cannot_be_referenced_in_a_computed_property_name);
break;
}
// When targeting es6, mark that we'll need to capture `this` in its lexically bound scope.
if (!isNodeInTypeQuery && capturedByArrowFunction && languageVersion < 2 /* ES2015 */) {
captureLexicalThis(node, container);
}
var type = tryGetThisTypeAt(node, /*includeGlobalThis*/ true, container);
if (noImplicitThis) {
var globalThisType_1 = getTypeOfSymbol(globalThisSymbol);
if (type === globalThisType_1 && capturedByArrowFunction) {
error(node, ts.Diagnostics.The_containing_arrow_function_captures_the_global_value_of_this);
}
else if (!type) {
// With noImplicitThis, functions may not reference 'this' if it has type 'any'
var diag = error(node, ts.Diagnostics.this_implicitly_has_type_any_because_it_does_not_have_a_type_annotation);
if (!ts.isSourceFile(container)) {
var outsideThis = tryGetThisTypeAt(container);
if (outsideThis && outsideThis !== globalThisType_1) {
ts.addRelatedInfo(diag, ts.createDiagnosticForNode(container, ts.Diagnostics.An_outer_value_of_this_is_shadowed_by_this_container));
}
}
}
}
return type || anyType;
}
function tryGetThisTypeAt(node, includeGlobalThis, container) {
if (includeGlobalThis === void 0) { includeGlobalThis = true; }
if (container === void 0) { container = ts.getThisContainer(node, /*includeArrowFunctions*/ false); }
var isInJS = ts.isInJSFile(node);
if (ts.isFunctionLike(container) &&
(!isInParameterInitializerBeforeContainingFunction(node) || ts.getThisParameter(container))) {
var thisType = getThisTypeOfDeclaration(container) || isInJS && getTypeForThisExpressionFromJSDoc(container);
// Note: a parameter initializer should refer to class-this unless function-this is explicitly annotated.
// If this is a function in a JS file, it might be a class method.
if (!thisType) {
var className = getClassNameFromPrototypeMethod(container);
if (isInJS && className) {
var classSymbol = checkExpression(className).symbol;
if (classSymbol && classSymbol.members && (classSymbol.flags & 16 /* Function */)) {
thisType = getDeclaredTypeOfSymbol(classSymbol).thisType;
}
}
else if (isJSConstructor(container)) {
thisType = getDeclaredTypeOfSymbol(getMergedSymbol(container.symbol)).thisType;
}
thisType || (thisType = getContextualThisParameterType(container));
}
if (thisType) {
return getFlowTypeOfReference(node, thisType);
}
}
if (ts.isClassLike(container.parent)) {
var symbol = getSymbolOfNode(container.parent);
var type = ts.isStatic(container) ? getTypeOfSymbol(symbol) : getDeclaredTypeOfSymbol(symbol).thisType;
return getFlowTypeOfReference(node, type);
}
if (ts.isSourceFile(container)) {
// look up in the source file's locals or exports
if (container.commonJsModuleIndicator) {
var fileSymbol = getSymbolOfNode(container);
return fileSymbol && getTypeOfSymbol(fileSymbol);
}
else if (container.externalModuleIndicator) {
// TODO: Maybe issue a better error than 'object is possibly undefined'
return undefinedType;
}
else if (includeGlobalThis) {
return getTypeOfSymbol(globalThisSymbol);
}
}
}
function getExplicitThisType(node) {
var container = ts.getThisContainer(node, /*includeArrowFunctions*/ false);
if (ts.isFunctionLike(container)) {
var signature = getSignatureFromDeclaration(container);
if (signature.thisParameter) {
return getExplicitTypeOfSymbol(signature.thisParameter);
}
}
if (ts.isClassLike(container.parent)) {
var symbol = getSymbolOfNode(container.parent);
return ts.isStatic(container) ? getTypeOfSymbol(symbol) : getDeclaredTypeOfSymbol(symbol).thisType;
}
}
function getClassNameFromPrototypeMethod(container) {
// Check if it's the RHS of a x.prototype.y = function [name]() { .... }
if (container.kind === 211 /* FunctionExpression */ &&
ts.isBinaryExpression(container.parent) &&
ts.getAssignmentDeclarationKind(container.parent) === 3 /* PrototypeProperty */) {
// Get the 'x' of 'x.prototype.y = container'
return container.parent // x.prototype.y = container
.left // x.prototype.y
.expression // x.prototype
.expression; // x
}
// x.prototype = { method() { } }
else if (container.kind === 167 /* MethodDeclaration */ &&
container.parent.kind === 203 /* ObjectLiteralExpression */ &&
ts.isBinaryExpression(container.parent.parent) &&
ts.getAssignmentDeclarationKind(container.parent.parent) === 6 /* Prototype */) {
return container.parent.parent.left.expression;
}
// x.prototype = { method: function() { } }
else if (container.kind === 211 /* FunctionExpression */ &&
container.parent.kind === 291 /* PropertyAssignment */ &&
container.parent.parent.kind === 203 /* ObjectLiteralExpression */ &&
ts.isBinaryExpression(container.parent.parent.parent) &&
ts.getAssignmentDeclarationKind(container.parent.parent.parent) === 6 /* Prototype */) {
return container.parent.parent.parent.left.expression;
}
// Object.defineProperty(x, "method", { value: function() { } });
// Object.defineProperty(x, "method", { set: (x: () => void) => void });
// Object.defineProperty(x, "method", { get: () => function() { }) });
else if (container.kind === 211 /* FunctionExpression */ &&
ts.isPropertyAssignment(container.parent) &&
ts.isIdentifier(container.parent.name) &&
(container.parent.name.escapedText === "value" || container.parent.name.escapedText === "get" || container.parent.name.escapedText === "set") &&
ts.isObjectLiteralExpression(container.parent.parent) &&
ts.isCallExpression(container.parent.parent.parent) &&
container.parent.parent.parent.arguments[2] === container.parent.parent &&
ts.getAssignmentDeclarationKind(container.parent.parent.parent) === 9 /* ObjectDefinePrototypeProperty */) {
return container.parent.parent.parent.arguments[0].expression;
}
// Object.defineProperty(x, "method", { value() { } });
// Object.defineProperty(x, "method", { set(x: () => void) {} });
// Object.defineProperty(x, "method", { get() { return () => {} } });
else if (ts.isMethodDeclaration(container) &&
ts.isIdentifier(container.name) &&
(container.name.escapedText === "value" || container.name.escapedText === "get" || container.name.escapedText === "set") &&
ts.isObjectLiteralExpression(container.parent) &&
ts.isCallExpression(container.parent.parent) &&
container.parent.parent.arguments[2] === container.parent &&
ts.getAssignmentDeclarationKind(container.parent.parent) === 9 /* ObjectDefinePrototypeProperty */) {
return container.parent.parent.arguments[0].expression;
}
}
function getTypeForThisExpressionFromJSDoc(node) {
var jsdocType = ts.getJSDocType(node);
if (jsdocType && jsdocType.kind === 312 /* JSDocFunctionType */) {
var jsDocFunctionType = jsdocType;
if (jsDocFunctionType.parameters.length > 0 &&
jsDocFunctionType.parameters[0].name &&
jsDocFunctionType.parameters[0].name.escapedText === "this" /* This */) {
return getTypeFromTypeNode(jsDocFunctionType.parameters[0].type);
}
}
var thisTag = ts.getJSDocThisTag(node);
if (thisTag && thisTag.typeExpression) {
return getTypeFromTypeNode(thisTag.typeExpression);
}
}
function isInConstructorArgumentInitializer(node, constructorDecl) {
return !!ts.findAncestor(node, function (n) { return ts.isFunctionLikeDeclaration(n) ? "quit" : n.kind === 162 /* Parameter */ && n.parent === constructorDecl; });
}
function checkSuperExpression(node) {
var isCallExpression = node.parent.kind === 206 /* CallExpression */ && node.parent.expression === node;
var immediateContainer = ts.getSuperContainer(node, /*stopOnFunctions*/ true);
var container = immediateContainer;
var needToCaptureLexicalThis = false;
// adjust the container reference in case if super is used inside arrow functions with arbitrarily deep nesting
if (!isCallExpression) {
while (container && container.kind === 212 /* ArrowFunction */) {
container = ts.getSuperContainer(container, /*stopOnFunctions*/ true);
needToCaptureLexicalThis = languageVersion < 2 /* ES2015 */;
}
}
var canUseSuperExpression = isLegalUsageOfSuperExpression(container);
var nodeCheckFlag = 0;
if (!canUseSuperExpression) {
// issue more specific error if super is used in computed property name
// class A { foo() { return "1" }}
// class B {
// [super.foo()]() {}
// }
var current = ts.findAncestor(node, function (n) { return n === container ? "quit" : n.kind === 160 /* ComputedPropertyName */; });
if (current && current.kind === 160 /* ComputedPropertyName */) {
error(node, ts.Diagnostics.super_cannot_be_referenced_in_a_computed_property_name);
}
else if (isCallExpression) {
error(node, ts.Diagnostics.Super_calls_are_not_permitted_outside_constructors_or_in_nested_functions_inside_constructors);
}
else if (!container || !container.parent || !(ts.isClassLike(container.parent) || container.parent.kind === 203 /* ObjectLiteralExpression */)) {
error(node, ts.Diagnostics.super_can_only_be_referenced_in_members_of_derived_classes_or_object_literal_expressions);
}
else {
error(node, ts.Diagnostics.super_property_access_is_permitted_only_in_a_constructor_member_function_or_member_accessor_of_a_derived_class);
}
return errorType;
}
if (!isCallExpression && immediateContainer.kind === 169 /* Constructor */) {
checkThisBeforeSuper(node, container, ts.Diagnostics.super_must_be_called_before_accessing_a_property_of_super_in_the_constructor_of_a_derived_class);
}
if (ts.isStatic(container) || isCallExpression) {
nodeCheckFlag = 512 /* SuperStatic */;
if (!isCallExpression &&
languageVersion >= 2 /* ES2015 */ && languageVersion <= 8 /* ES2021 */ &&
(ts.isPropertyDeclaration(container) || ts.isClassStaticBlockDeclaration(container))) {
// for `super.x` or `super[x]` in a static initializer, mark all enclosing
// block scope containers so that we can report potential collisions with
// `Reflect`.
ts.forEachEnclosingBlockScopeContainer(node.parent, function (current) {
if (!ts.isSourceFile(current) || ts.isExternalOrCommonJsModule(current)) {
getNodeLinks(current).flags |= 134217728 /* ContainsSuperPropertyInStaticInitializer */;
}
});
}
}
else {
nodeCheckFlag = 256 /* SuperInstance */;
}
getNodeLinks(node).flags |= nodeCheckFlag;
// Due to how we emit async functions, we need to specialize the emit for an async method that contains a `super` reference.
// This is due to the fact that we emit the body of an async function inside of a generator function. As generator
// functions cannot reference `super`, we emit a helper inside of the method body, but outside of the generator. This helper
// uses an arrow function, which is permitted to reference `super`.
//
// There are two primary ways we can access `super` from within an async method. The first is getting the value of a property
// or indexed access on super, either as part of a right-hand-side expression or call expression. The second is when setting the value
// of a property or indexed access, either as part of an assignment expression or destructuring assignment.
//
// The simplest case is reading a value, in which case we will emit something like the following:
//
// // ts
// ...
// async asyncMethod() {
// let x = await super.asyncMethod();
// return x;
// }
// ...
//
// // js
// ...
// asyncMethod() {
// const _super = Object.create(null, {
// asyncMethod: { get: () => super.asyncMethod },
// });
// return __awaiter(this, arguments, Promise, function *() {
// let x = yield _super.asyncMethod.call(this);
// return x;
// });
// }
// ...
//
// The more complex case is when we wish to assign a value, especially as part of a destructuring assignment. As both cases
// are legal in ES6, but also likely less frequent, we only emit setters if there is an assignment:
//
// // ts
// ...
// async asyncMethod(ar: Promise<any[]>) {
// [super.a, super.b] = await ar;
// }
// ...
//
// // js
// ...
// asyncMethod(ar) {
// const _super = Object.create(null, {
// a: { get: () => super.a, set: (v) => super.a = v },
// b: { get: () => super.b, set: (v) => super.b = v }
// };
// return __awaiter(this, arguments, Promise, function *() {
// [_super.a, _super.b] = yield ar;
// });
// }
// ...
//
// Creating an object that has getter and setters instead of just an accessor function is required for destructuring assignments
// as a call expression cannot be used as the target of a destructuring assignment while a property access can.
//
// For element access expressions (`super[x]`), we emit a generic helper that forwards the element access in both situations.
if (container.kind === 167 /* MethodDeclaration */ && ts.hasSyntacticModifier(container, 256 /* Async */)) {
if (ts.isSuperProperty(node.parent) && ts.isAssignmentTarget(node.parent)) {
getNodeLinks(container).flags |= 4096 /* AsyncMethodWithSuperBinding */;
}
else {
getNodeLinks(container).flags |= 2048 /* AsyncMethodWithSuper */;
}
}
if (needToCaptureLexicalThis) {
// call expressions are allowed only in constructors so they should always capture correct 'this'
// super property access expressions can also appear in arrow functions -
// in this case they should also use correct lexical this
captureLexicalThis(node.parent, container);
}
if (container.parent.kind === 203 /* ObjectLiteralExpression */) {
if (languageVersion < 2 /* ES2015 */) {
error(node, ts.Diagnostics.super_is_only_allowed_in_members_of_object_literal_expressions_when_option_target_is_ES2015_or_higher);
return errorType;
}
else {
// for object literal assume that type of 'super' is 'any'
return anyType;
}
}
// at this point the only legal case for parent is ClassLikeDeclaration
var classLikeDeclaration = container.parent;
if (!ts.getClassExtendsHeritageElement(classLikeDeclaration)) {
error(node, ts.Diagnostics.super_can_only_be_referenced_in_a_derived_class);
return errorType;
}
var classType = getDeclaredTypeOfSymbol(getSymbolOfNode(classLikeDeclaration));
var baseClassType = classType && getBaseTypes(classType)[0];
if (!baseClassType) {
return errorType;
}
if (container.kind === 169 /* Constructor */ && isInConstructorArgumentInitializer(node, container)) {
// issue custom error message for super property access in constructor arguments (to be aligned with old compiler)
error(node, ts.Diagnostics.super_cannot_be_referenced_in_constructor_arguments);
return errorType;
}
return nodeCheckFlag === 512 /* SuperStatic */
? getBaseConstructorTypeOfClass(classType)
: getTypeWithThisArgument(baseClassType, classType.thisType);
function isLegalUsageOfSuperExpression(container) {
if (!container) {
return false;
}
if (isCallExpression) {
// TS 1.0 SPEC (April 2014): 4.8.1
// Super calls are only permitted in constructors of derived classes
return container.kind === 169 /* Constructor */;
}
else {
// TS 1.0 SPEC (April 2014)
// 'super' property access is allowed
// - In a constructor, instance member function, instance member accessor, or instance member variable initializer where this references a derived class instance
// - In a static member function or static member accessor
// topmost container must be something that is directly nested in the class declaration\object literal expression
if (ts.isClassLike(container.parent) || container.parent.kind === 203 /* ObjectLiteralExpression */) {
if (ts.isStatic(container)) {
return container.kind === 167 /* MethodDeclaration */ ||
container.kind === 166 /* MethodSignature */ ||
container.kind === 170 /* GetAccessor */ ||
container.kind === 171 /* SetAccessor */ ||
container.kind === 165 /* PropertyDeclaration */ ||
container.kind === 168 /* ClassStaticBlockDeclaration */;
}
else {
return container.kind === 167 /* MethodDeclaration */ ||
container.kind === 166 /* MethodSignature */ ||
container.kind === 170 /* GetAccessor */ ||
container.kind === 171 /* SetAccessor */ ||
container.kind === 165 /* PropertyDeclaration */ ||
container.kind === 164 /* PropertySignature */ ||
container.kind === 169 /* Constructor */;
}
}
}
return false;
}
}
function getContainingObjectLiteral(func) {
return (func.kind === 167 /* MethodDeclaration */ ||
func.kind === 170 /* GetAccessor */ ||
func.kind === 171 /* SetAccessor */) && func.parent.kind === 203 /* ObjectLiteralExpression */ ? func.parent :
func.kind === 211 /* FunctionExpression */ && func.parent.kind === 291 /* PropertyAssignment */ ? func.parent.parent :
undefined;
}
function getThisTypeArgument(type) {
return ts.getObjectFlags(type) & 4 /* Reference */ && type.target === globalThisType ? getTypeArguments(type)[0] : undefined;
}
function getThisTypeFromContextualType(type) {
return mapType(type, function (t) {
return t.flags & 2097152 /* Intersection */ ? ts.forEach(t.types, getThisTypeArgument) : getThisTypeArgument(t);
});
}
function getContextualThisParameterType(func) {
if (func.kind === 212 /* ArrowFunction */) {
return undefined;
}
if (isContextSensitiveFunctionOrObjectLiteralMethod(func)) {
var contextualSignature = getContextualSignature(func);
if (contextualSignature) {
var thisParameter = contextualSignature.thisParameter;
if (thisParameter) {
return getTypeOfSymbol(thisParameter);
}
}
}
var inJs = ts.isInJSFile(func);
if (noImplicitThis || inJs) {
var containingLiteral = getContainingObjectLiteral(func);
if (containingLiteral) {
// We have an object literal method. Check if the containing object literal has a contextual type
// that includes a ThisType<T>. If so, T is the contextual type for 'this'. We continue looking in
// any directly enclosing object literals.
var contextualType = getApparentTypeOfContextualType(containingLiteral);
var literal = containingLiteral;
var type = contextualType;
while (type) {
var thisType = getThisTypeFromContextualType(type);
if (thisType) {
return instantiateType(thisType, getMapperFromContext(getInferenceContext(containingLiteral)));
}
if (literal.parent.kind !== 291 /* PropertyAssignment */) {
break;
}
literal = literal.parent.parent;
type = getApparentTypeOfContextualType(literal);
}
// There was no contextual ThisType<T> for the containing object literal, so the contextual type
// for 'this' is the non-null form of the contextual type for the containing object literal or
// the type of the object literal itself.
return getWidenedType(contextualType ? getNonNullableType(contextualType) : checkExpressionCached(containingLiteral));
}
// In an assignment of the form 'obj.xxx = function(...)' or 'obj[xxx] = function(...)', the
// contextual type for 'this' is 'obj'.
var parent = ts.walkUpParenthesizedExpressions(func.parent);
if (parent.kind === 219 /* BinaryExpression */ && parent.operatorToken.kind === 63 /* EqualsToken */) {
var target = parent.left;
if (ts.isAccessExpression(target)) {
var expression = target.expression;
// Don't contextually type `this` as `exports` in `exports.Point = function(x, y) { this.x = x; this.y = y; }`
if (inJs && ts.isIdentifier(expression)) {
var sourceFile = ts.getSourceFileOfNode(parent);
if (sourceFile.commonJsModuleIndicator && getResolvedSymbol(expression) === sourceFile.symbol) {
return undefined;
}
}
return getWidenedType(checkExpressionCached(expression));
}
}
}
return undefined;
}
// Return contextual type of parameter or undefined if no contextual type is available
function getContextuallyTypedParameterType(parameter) {
var func = parameter.parent;
if (!isContextSensitiveFunctionOrObjectLiteralMethod(func)) {
return undefined;
}
var iife = ts.getImmediatelyInvokedFunctionExpression(func);
if (iife && iife.arguments) {
var args = getEffectiveCallArguments(iife);
var indexOfParameter = func.parameters.indexOf(parameter);
if (parameter.dotDotDotToken) {
return getSpreadArgumentType(args, indexOfParameter, args.length, anyType, /*context*/ undefined, 0 /* Normal */);
}
var links = getNodeLinks(iife);
var cached = links.resolvedSignature;
links.resolvedSignature = anySignature;
var type = indexOfParameter < args.length ?
getWidenedLiteralType(checkExpression(args[indexOfParameter])) :
parameter.initializer ? undefined : undefinedWideningType;
links.resolvedSignature = cached;
return type;
}
var contextualSignature = getContextualSignature(func);
if (contextualSignature) {
var index = func.parameters.indexOf(parameter) - (ts.getThisParameter(func) ? 1 : 0);
return parameter.dotDotDotToken && ts.lastOrUndefined(func.parameters) === parameter ?
getRestTypeAtPosition(contextualSignature, index) :
tryGetTypeAtPosition(contextualSignature, index);
}
}
function getContextualTypeForVariableLikeDeclaration(declaration) {
var typeNode = ts.getEffectiveTypeAnnotationNode(declaration);
if (typeNode) {
return getTypeFromTypeNode(typeNode);
}
switch (declaration.kind) {
case 162 /* Parameter */:
return getContextuallyTypedParameterType(declaration);
case 201 /* BindingElement */:
return getContextualTypeForBindingElement(declaration);
case 165 /* PropertyDeclaration */:
if (ts.isStatic(declaration)) {
return getContextualTypeForStaticPropertyDeclaration(declaration);
}
// By default, do nothing and return undefined - only the above cases have context implied by a parent
}
}
function getContextualTypeForBindingElement(declaration) {
var parent = declaration.parent.parent;
var name = declaration.propertyName || declaration.name;
var parentType = getContextualTypeForVariableLikeDeclaration(parent) ||
parent.kind !== 201 /* BindingElement */ && parent.initializer && checkDeclarationInitializer(parent);
if (!parentType || ts.isBindingPattern(name) || ts.isComputedNonLiteralName(name))
return undefined;
if (parent.name.kind === 200 /* ArrayBindingPattern */) {
var index = ts.indexOfNode(declaration.parent.elements, declaration);
if (index < 0)
return undefined;
return getContextualTypeForElementExpression(parentType, index);
}
var nameType = getLiteralTypeFromPropertyName(name);
if (isTypeUsableAsPropertyName(nameType)) {
var text = getPropertyNameFromType(nameType);
return getTypeOfPropertyOfType(parentType, text);
}
}
function getContextualTypeForStaticPropertyDeclaration(declaration) {
var parentType = ts.isExpression(declaration.parent) && getContextualType(declaration.parent);
if (!parentType)
return undefined;
return getTypeOfPropertyOfContextualType(parentType, getSymbolOfNode(declaration).escapedName);
}
// In a variable, parameter or property declaration with a type annotation,
// the contextual type of an initializer expression is the type of the variable, parameter or property.
// Otherwise, in a parameter declaration of a contextually typed function expression,
// the contextual type of an initializer expression is the contextual type of the parameter.
// Otherwise, in a variable or parameter declaration with a binding pattern name,
// the contextual type of an initializer expression is the type implied by the binding pattern.
// Otherwise, in a binding pattern inside a variable or parameter declaration,
// the contextual type of an initializer expression is the type annotation of the containing declaration, if present.
function getContextualTypeForInitializerExpression(node, contextFlags) {
var declaration = node.parent;
if (ts.hasInitializer(declaration) && node === declaration.initializer) {
var result = getContextualTypeForVariableLikeDeclaration(declaration);
if (result) {
return result;
}
if (!(contextFlags & 8 /* SkipBindingPatterns */) && ts.isBindingPattern(declaration.name)) { // This is less a contextual type and more an implied shape - in some cases, this may be undesirable
return getTypeFromBindingPattern(declaration.name, /*includePatternInType*/ true, /*reportErrors*/ false);
}
}
return undefined;
}
function getContextualTypeForReturnExpression(node) {
var func = ts.getContainingFunction(node);
if (func) {
var contextualReturnType = getContextualReturnType(func);
if (contextualReturnType) {
var functionFlags = ts.getFunctionFlags(func);
if (functionFlags & 1 /* Generator */) { // Generator or AsyncGenerator function
var use = functionFlags & 2 /* Async */ ? 2 /* AsyncGeneratorReturnType */ : 1 /* GeneratorReturnType */;
var iterationTypes = getIterationTypesOfIterable(contextualReturnType, use, /*errorNode*/ undefined);
if (!iterationTypes) {
return undefined;
}
contextualReturnType = iterationTypes.returnType;
// falls through to unwrap Promise for AsyncGenerators
}
if (functionFlags & 2 /* Async */) { // Async function or AsyncGenerator function
var contextualAwaitedType = mapType(contextualReturnType, getAwaitedType);
return contextualAwaitedType && getUnionType([contextualAwaitedType, createPromiseLikeType(contextualAwaitedType)]);
}
return contextualReturnType; // Regular function or Generator function
}
}
return undefined;
}
function getContextualTypeForAwaitOperand(node, contextFlags) {
var contextualType = getContextualType(node, contextFlags);
if (contextualType) {
var contextualAwaitedType = getAwaitedType(contextualType);
return contextualAwaitedType && getUnionType([contextualAwaitedType, createPromiseLikeType(contextualAwaitedType)]);
}
return undefined;
}
function getContextualTypeForYieldOperand(node) {
var func = ts.getContainingFunction(node);
if (func) {
var functionFlags = ts.getFunctionFlags(func);
var contextualReturnType = getContextualReturnType(func);
if (contextualReturnType) {
return node.asteriskToken
? contextualReturnType
: getIterationTypeOfGeneratorFunctionReturnType(0 /* Yield */, contextualReturnType, (functionFlags & 2 /* Async */) !== 0);
}
}
return undefined;
}
function isInParameterInitializerBeforeContainingFunction(node) {
var inBindingInitializer = false;
while (node.parent && !ts.isFunctionLike(node.parent)) {
if (ts.isParameter(node.parent) && (inBindingInitializer || node.parent.initializer === node)) {
return true;
}
if (ts.isBindingElement(node.parent) && node.parent.initializer === node) {
inBindingInitializer = true;
}
node = node.parent;
}
return false;
}
function getContextualIterationType(kind, functionDecl) {
var isAsync = !!(ts.getFunctionFlags(functionDecl) & 2 /* Async */);
var contextualReturnType = getContextualReturnType(functionDecl);
if (contextualReturnType) {
return getIterationTypeOfGeneratorFunctionReturnType(kind, contextualReturnType, isAsync)
|| undefined;
}
return undefined;
}
function getContextualReturnType(functionDecl) {
// If the containing function has a return type annotation, is a constructor, or is a get accessor whose
// corresponding set accessor has a type annotation, return statements in the function are contextually typed
var returnType = getReturnTypeFromAnnotation(functionDecl);
if (returnType) {
return returnType;
}
// Otherwise, if the containing function is contextually typed by a function type with exactly one call signature
// and that call signature is non-generic, return statements are contextually typed by the return type of the signature
var signature = getContextualSignatureForFunctionLikeDeclaration(functionDecl);
if (signature && !isResolvingReturnTypeOfSignature(signature)) {
return getReturnTypeOfSignature(signature);
}
return undefined;
}
// In a typed function call, an argument or substitution expression is contextually typed by the type of the corresponding parameter.
function getContextualTypeForArgument(callTarget, arg) {
var args = getEffectiveCallArguments(callTarget);
var argIndex = args.indexOf(arg); // -1 for e.g. the expression of a CallExpression, or the tag of a TaggedTemplateExpression
return argIndex === -1 ? undefined : getContextualTypeForArgumentAtIndex(callTarget, argIndex);
}
function getContextualTypeForArgumentAtIndex(callTarget, argIndex) {
// If we're already in the process of resolving the given signature, don't resolve again as
// that could cause infinite recursion. Instead, return anySignature.
var signature = getNodeLinks(callTarget).resolvedSignature === resolvingSignature ? resolvingSignature : getResolvedSignature(callTarget);
if (ts.isJsxOpeningLikeElement(callTarget) && argIndex === 0) {
return getEffectiveFirstArgumentForJsxSignature(signature, callTarget);
}
var restIndex = signature.parameters.length - 1;
return signatureHasRestParameter(signature) && argIndex >= restIndex ?
getIndexedAccessType(getTypeOfSymbol(signature.parameters[restIndex]), getNumberLiteralType(argIndex - restIndex), 256 /* Contextual */) :
getTypeAtPosition(signature, argIndex);
}
function getContextualTypeForSubstitutionExpression(template, substitutionExpression) {
if (template.parent.kind === 208 /* TaggedTemplateExpression */) {
return getContextualTypeForArgument(template.parent, substitutionExpression);
}
return undefined;
}
function getContextualTypeForBinaryOperand(node, contextFlags) {
var binaryExpression = node.parent;
var left = binaryExpression.left, operatorToken = binaryExpression.operatorToken, right = binaryExpression.right;
switch (operatorToken.kind) {
case 63 /* EqualsToken */:
case 76 /* AmpersandAmpersandEqualsToken */:
case 75 /* BarBarEqualsToken */:
case 77 /* QuestionQuestionEqualsToken */:
return node === right ? getContextualTypeForAssignmentDeclaration(binaryExpression) : undefined;
case 56 /* BarBarToken */:
case 60 /* QuestionQuestionToken */:
// When an || expression has a contextual type, the operands are contextually typed by that type, except
// when that type originates in a binding pattern, the right operand is contextually typed by the type of
// the left operand. When an || expression has no contextual type, the right operand is contextually typed
// by the type of the left operand, except for the special case of Javascript declarations of the form
// `namespace.prop = namespace.prop || {}`.
var type = getContextualType(binaryExpression, contextFlags);
return node === right && (type && type.pattern || !type && !ts.isDefaultedExpandoInitializer(binaryExpression)) ?
getTypeOfExpression(left) : type;
case 55 /* AmpersandAmpersandToken */:
case 27 /* CommaToken */:
return node === right ? getContextualType(binaryExpression, contextFlags) : undefined;
default:
return undefined;
}
}
/**
* Try to find a resolved symbol for an expression without also resolving its type, as
* getSymbolAtLocation would (as that could be reentrant into contextual typing)
*/
function getSymbolForExpression(e) {
if (e.symbol) {
return e.symbol;
}
if (ts.isIdentifier(e)) {
return getResolvedSymbol(e);
}
if (ts.isPropertyAccessExpression(e)) {
var lhsType = getTypeOfExpression(e.expression);
return ts.isPrivateIdentifier(e.name) ? tryGetPrivateIdentifierPropertyOfType(lhsType, e.name) : getPropertyOfType(lhsType, e.name.escapedText);
}
return undefined;
function tryGetPrivateIdentifierPropertyOfType(type, id) {
var lexicallyScopedSymbol = lookupSymbolForPrivateIdentifierDeclaration(id.escapedText, id);
return lexicallyScopedSymbol && getPrivateIdentifierPropertyOfType(type, lexicallyScopedSymbol);
}
}
// In an assignment expression, the right operand is contextually typed by the type of the left operand.
// Don't do this for assignment declarations unless there is a type tag on the assignment, to avoid circularity from checking the right operand.
function getContextualTypeForAssignmentDeclaration(binaryExpression) {
var _a, _b;
var kind = ts.getAssignmentDeclarationKind(binaryExpression);
switch (kind) {
case 0 /* None */:
case 4 /* ThisProperty */:
var lhsSymbol = getSymbolForExpression(binaryExpression.left);
var decl = lhsSymbol && lhsSymbol.valueDeclaration;
// Unannotated, uninitialized property declarations have a type implied by their usage in the constructor.
// We avoid calling back into `getTypeOfExpression` and reentering contextual typing to avoid a bogus circularity error in that case.
if (decl && (ts.isPropertyDeclaration(decl) || ts.isPropertySignature(decl))) {
var overallAnnotation = ts.getEffectiveTypeAnnotationNode(decl);
return (overallAnnotation && instantiateType(getTypeFromTypeNode(overallAnnotation), getSymbolLinks(lhsSymbol).mapper)) ||
(decl.initializer && getTypeOfExpression(binaryExpression.left));
}
if (kind === 0 /* None */) {
return getTypeOfExpression(binaryExpression.left);
}
return getContextualTypeForThisPropertyAssignment(binaryExpression);
case 5 /* Property */:
if (isPossiblyAliasedThisProperty(binaryExpression, kind)) {
return getContextualTypeForThisPropertyAssignment(binaryExpression);
}
// If `binaryExpression.left` was assigned a symbol, then this is a new declaration; otherwise it is an assignment to an existing declaration.
// See `bindStaticPropertyAssignment` in `binder.ts`.
else if (!binaryExpression.left.symbol) {
return getTypeOfExpression(binaryExpression.left);
}
else {
var decl_1 = binaryExpression.left.symbol.valueDeclaration;
if (!decl_1) {
return undefined;
}
var lhs = ts.cast(binaryExpression.left, ts.isAccessExpression);
var overallAnnotation = ts.getEffectiveTypeAnnotationNode(decl_1);
if (overallAnnotation) {
return getTypeFromTypeNode(overallAnnotation);
}
else if (ts.isIdentifier(lhs.expression)) {
var id = lhs.expression;
var parentSymbol = resolveName(id, id.escapedText, 111551 /* Value */, undefined, id.escapedText, /*isUse*/ true);
if (parentSymbol) {
var annotated_1 = parentSymbol.valueDeclaration && ts.getEffectiveTypeAnnotationNode(parentSymbol.valueDeclaration);
if (annotated_1) {
var nameStr = ts.getElementOrPropertyAccessName(lhs);
if (nameStr !== undefined) {
return getTypeOfPropertyOfContextualType(getTypeFromTypeNode(annotated_1), nameStr);
}
}
return undefined;
}
}
return ts.isInJSFile(decl_1) ? undefined : getTypeOfExpression(binaryExpression.left);
}
case 1 /* ExportsProperty */:
case 6 /* Prototype */:
case 3 /* PrototypeProperty */:
var valueDeclaration = (_a = binaryExpression.left.symbol) === null || _a === void 0 ? void 0 : _a.valueDeclaration;
// falls through
case 2 /* ModuleExports */:
valueDeclaration || (valueDeclaration = (_b = binaryExpression.symbol) === null || _b === void 0 ? void 0 : _b.valueDeclaration);
var annotated = valueDeclaration && ts.getEffectiveTypeAnnotationNode(valueDeclaration);
return annotated ? getTypeFromTypeNode(annotated) : undefined;
case 7 /* ObjectDefinePropertyValue */:
case 8 /* ObjectDefinePropertyExports */:
case 9 /* ObjectDefinePrototypeProperty */:
return ts.Debug.fail("Does not apply");
default:
return ts.Debug.assertNever(kind);
}
}
function isPossiblyAliasedThisProperty(declaration, kind) {
if (kind === void 0) { kind = ts.getAssignmentDeclarationKind(declaration); }
if (kind === 4 /* ThisProperty */) {
return true;
}
if (!ts.isInJSFile(declaration) || kind !== 5 /* Property */ || !ts.isIdentifier(declaration.left.expression)) {
return false;
}
var name = declaration.left.expression.escapedText;
var symbol = resolveName(declaration.left, name, 111551 /* Value */, undefined, undefined, /*isUse*/ true, /*excludeGlobals*/ true);
return ts.isThisInitializedDeclaration(symbol === null || symbol === void 0 ? void 0 : symbol.valueDeclaration);
}
function getContextualTypeForThisPropertyAssignment(binaryExpression) {
if (!binaryExpression.symbol)
return getTypeOfExpression(binaryExpression.left);
if (binaryExpression.symbol.valueDeclaration) {
var annotated = ts.getEffectiveTypeAnnotationNode(binaryExpression.symbol.valueDeclaration);
if (annotated) {
var type = getTypeFromTypeNode(annotated);
if (type) {
return type;
}
}
}
var thisAccess = ts.cast(binaryExpression.left, ts.isAccessExpression);
if (!ts.isObjectLiteralMethod(ts.getThisContainer(thisAccess.expression, /*includeArrowFunctions*/ false))) {
return undefined;
}
var thisType = checkThisExpression(thisAccess.expression);
var nameStr = ts.getElementOrPropertyAccessName(thisAccess);
return nameStr !== undefined && getTypeOfPropertyOfContextualType(thisType, nameStr) || undefined;
}
function isCircularMappedProperty(symbol) {
return !!(ts.getCheckFlags(symbol) & 262144 /* Mapped */ && !symbol.type && findResolutionCycleStartIndex(symbol, 0 /* Type */) >= 0);
}
function getTypeOfPropertyOfContextualType(type, name) {
return mapType(type, function (t) {
var _a;
if (isGenericMappedType(t)) {
var constraint = getConstraintTypeFromMappedType(t);
var constraintOfConstraint = getBaseConstraintOfType(constraint) || constraint;
var propertyNameType = getStringLiteralType(ts.unescapeLeadingUnderscores(name));
if (isTypeAssignableTo(propertyNameType, constraintOfConstraint)) {
return substituteIndexedMappedType(t, propertyNameType);
}
}
else if (t.flags & 3670016 /* StructuredType */) {
var prop = getPropertyOfType(t, name);
if (prop) {
return isCircularMappedProperty(prop) ? undefined : getTypeOfSymbol(prop);
}
if (isTupleType(t)) {
var restType = getRestTypeOfTupleType(t);
if (restType && isNumericLiteralName(name) && +name >= 0) {
return restType;
}
}
return (_a = findApplicableIndexInfo(getIndexInfosOfStructuredType(t), getStringLiteralType(ts.unescapeLeadingUnderscores(name)))) === null || _a === void 0 ? void 0 : _a.type;
}
return undefined;
}, /*noReductions*/ true);
}
// In an object literal contextually typed by a type T, the contextual type of a property assignment is the type of
// the matching property in T, if one exists. Otherwise, it is the type of the numeric index signature in T, if one
// exists. Otherwise, it is the type of the string index signature in T, if one exists.
function getContextualTypeForObjectLiteralMethod(node, contextFlags) {
ts.Debug.assert(ts.isObjectLiteralMethod(node));
if (node.flags & 16777216 /* InWithStatement */) {
// We cannot answer semantic questions within a with block, do not proceed any further
return undefined;
}
return getContextualTypeForObjectLiteralElement(node, contextFlags);
}
function getContextualTypeForObjectLiteralElement(element, contextFlags) {
var objectLiteral = element.parent;
var propertyAssignmentType = ts.isPropertyAssignment(element) && getContextualTypeForVariableLikeDeclaration(element);
if (propertyAssignmentType) {
return propertyAssignmentType;
}
var type = getApparentTypeOfContextualType(objectLiteral, contextFlags);
if (type) {
if (hasBindableName(element)) {
// For a (non-symbol) computed property, there is no reason to look up the name
// in the type. It will just be "__computed", which does not appear in any
// SymbolTable.
return getTypeOfPropertyOfContextualType(type, getSymbolOfNode(element).escapedName);
}
if (element.name) {
var nameType_1 = getLiteralTypeFromPropertyName(element.name);
// We avoid calling getApplicableIndexInfo here because it performs potentially expensive intersection reduction.
return mapType(type, function (t) { var _a; return (_a = findApplicableIndexInfo(getIndexInfosOfStructuredType(t), nameType_1)) === null || _a === void 0 ? void 0 : _a.type; }, /*noReductions*/ true);
}
}
return undefined;
}
// In an array literal contextually typed by a type T, the contextual type of an element expression at index N is
// the type of the property with the numeric name N in T, if one exists. Otherwise, if T has a numeric index signature,
// it is the type of the numeric index signature in T. Otherwise, in ES6 and higher, the contextual type is the iterated
// type of T.
function getContextualTypeForElementExpression(arrayContextualType, index) {
return arrayContextualType && (getTypeOfPropertyOfContextualType(arrayContextualType, "" + index)
|| mapType(arrayContextualType, function (t) { return getIteratedTypeOrElementType(1 /* Element */, t, undefinedType, /*errorNode*/ undefined, /*checkAssignability*/ false); },
/*noReductions*/ true));
}
// In a contextually typed conditional expression, the true/false expressions are contextually typed by the same type.
function getContextualTypeForConditionalOperand(node, contextFlags) {
var conditional = node.parent;
return node === conditional.whenTrue || node === conditional.whenFalse ? getContextualType(conditional, contextFlags) : undefined;
}
function getContextualTypeForChildJsxExpression(node, child) {
var attributesType = getApparentTypeOfContextualType(node.openingElement.tagName);
// JSX expression is in children of JSX Element, we will look for an "children" attribute (we get the name from JSX.ElementAttributesProperty)
var jsxChildrenPropertyName = getJsxElementChildrenPropertyName(getJsxNamespaceAt(node));
if (!(attributesType && !isTypeAny(attributesType) && jsxChildrenPropertyName && jsxChildrenPropertyName !== "")) {
return undefined;
}
var realChildren = ts.getSemanticJsxChildren(node.children);
var childIndex = realChildren.indexOf(child);
var childFieldType = getTypeOfPropertyOfContextualType(attributesType, jsxChildrenPropertyName);
return childFieldType && (realChildren.length === 1 ? childFieldType : mapType(childFieldType, function (t) {
if (isArrayLikeType(t)) {
return getIndexedAccessType(t, getNumberLiteralType(childIndex));
}
else {
return t;
}
}, /*noReductions*/ true));
}
function getContextualTypeForJsxExpression(node) {
var exprParent = node.parent;
return ts.isJsxAttributeLike(exprParent)
? getContextualType(node)
: ts.isJsxElement(exprParent)
? getContextualTypeForChildJsxExpression(exprParent, node)
: undefined;
}
function getContextualTypeForJsxAttribute(attribute) {
// When we trying to resolve JsxOpeningLikeElement as a stateless function element, we will already give its attributes a contextual type
// which is a type of the parameter of the signature we are trying out.
// If there is no contextual type (e.g. we are trying to resolve stateful component), get attributes type from resolving element's tagName
if (ts.isJsxAttribute(attribute)) {
var attributesType = getApparentTypeOfContextualType(attribute.parent);
if (!attributesType || isTypeAny(attributesType)) {
return undefined;
}
return getTypeOfPropertyOfContextualType(attributesType, attribute.name.escapedText);
}
else {
return getContextualType(attribute.parent);
}
}
// Return true if the given expression is possibly a discriminant value. We limit the kinds of
// expressions we check to those that don't depend on their contextual type in order not to cause
// recursive (and possibly infinite) invocations of getContextualType.
function isPossiblyDiscriminantValue(node) {
switch (node.kind) {
case 10 /* StringLiteral */:
case 8 /* NumericLiteral */:
case 9 /* BigIntLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
case 110 /* TrueKeyword */:
case 95 /* FalseKeyword */:
case 104 /* NullKeyword */:
case 79 /* Identifier */:
case 151 /* UndefinedKeyword */:
return true;
case 204 /* PropertyAccessExpression */:
case 210 /* ParenthesizedExpression */:
return isPossiblyDiscriminantValue(node.expression);
case 286 /* JsxExpression */:
return !node.expression || isPossiblyDiscriminantValue(node.expression);
}
return false;
}
function discriminateContextualTypeByObjectMembers(node, contextualType) {
return getMatchingUnionConstituentForObjectLiteral(contextualType, node) || discriminateTypeByDiscriminableItems(contextualType, ts.concatenate(ts.map(ts.filter(node.properties, function (p) { return !!p.symbol && p.kind === 291 /* PropertyAssignment */ && isPossiblyDiscriminantValue(p.initializer) && isDiscriminantProperty(contextualType, p.symbol.escapedName); }), function (prop) { return [function () { return getContextFreeTypeOfExpression(prop.initializer); }, prop.symbol.escapedName]; }), ts.map(ts.filter(getPropertiesOfType(contextualType), function (s) { var _a; return !!(s.flags & 16777216 /* Optional */) && !!((_a = node === null || node === void 0 ? void 0 : node.symbol) === null || _a === void 0 ? void 0 : _a.members) && !node.symbol.members.has(s.escapedName) && isDiscriminantProperty(contextualType, s.escapedName); }), function (s) { return [function () { return undefinedType; }, s.escapedName]; })), isTypeAssignableTo, contextualType);
}
function discriminateContextualTypeByJSXAttributes(node, contextualType) {
return discriminateTypeByDiscriminableItems(contextualType, ts.concatenate(ts.map(ts.filter(node.properties, function (p) { return !!p.symbol && p.kind === 283 /* JsxAttribute */ && isDiscriminantProperty(contextualType, p.symbol.escapedName) && (!p.initializer || isPossiblyDiscriminantValue(p.initializer)); }), function (prop) { return [!prop.initializer ? (function () { return trueType; }) : (function () { return checkExpression(prop.initializer); }), prop.symbol.escapedName]; }), ts.map(ts.filter(getPropertiesOfType(contextualType), function (s) { var _a; return !!(s.flags & 16777216 /* Optional */) && !!((_a = node === null || node === void 0 ? void 0 : node.symbol) === null || _a === void 0 ? void 0 : _a.members) && !node.symbol.members.has(s.escapedName) && isDiscriminantProperty(contextualType, s.escapedName); }), function (s) { return [function () { return undefinedType; }, s.escapedName]; })), isTypeAssignableTo, contextualType);
}
// Return the contextual type for a given expression node. During overload resolution, a contextual type may temporarily
// be "pushed" onto a node using the contextualType property.
function getApparentTypeOfContextualType(node, contextFlags) {
var contextualType = ts.isObjectLiteralMethod(node) ?
getContextualTypeForObjectLiteralMethod(node, contextFlags) :
getContextualType(node, contextFlags);
var instantiatedType = instantiateContextualType(contextualType, node, contextFlags);
if (instantiatedType && !(contextFlags && contextFlags & 2 /* NoConstraints */ && instantiatedType.flags & 8650752 /* TypeVariable */)) {
var apparentType = mapType(instantiatedType, getApparentType, /*noReductions*/ true);
return apparentType.flags & 1048576 /* Union */ && ts.isObjectLiteralExpression(node) ? discriminateContextualTypeByObjectMembers(node, apparentType) :
apparentType.flags & 1048576 /* Union */ && ts.isJsxAttributes(node) ? discriminateContextualTypeByJSXAttributes(node, apparentType) :
apparentType;
}
}
// If the given contextual type contains instantiable types and if a mapper representing
// return type inferences is available, instantiate those types using that mapper.
function instantiateContextualType(contextualType, node, contextFlags) {
if (contextualType && maybeTypeOfKind(contextualType, 465829888 /* Instantiable */)) {
var inferenceContext = getInferenceContext(node);
// If no inferences have been made, nothing is gained from instantiating as type parameters
// would just be replaced with their defaults similar to the apparent type.
if (inferenceContext && ts.some(inferenceContext.inferences, hasInferenceCandidates)) {
// For contextual signatures we incorporate all inferences made so far, e.g. from return
// types as well as arguments to the left in a function call.
if (contextFlags && contextFlags & 1 /* Signature */) {
return instantiateInstantiableTypes(contextualType, inferenceContext.nonFixingMapper);
}
// For other purposes (e.g. determining whether to produce literal types) we only
// incorporate inferences made from the return type in a function call.
if (inferenceContext.returnMapper) {
return instantiateInstantiableTypes(contextualType, inferenceContext.returnMapper);
}
}
}
return contextualType;
}
// This function is similar to instantiateType, except that (a) it only instantiates types that
// are classified as instantiable (i.e. it doesn't instantiate object types), and (b) it performs
// no reductions on instantiated union types.
function instantiateInstantiableTypes(type, mapper) {
if (type.flags & 465829888 /* Instantiable */) {
return instantiateType(type, mapper);
}
if (type.flags & 1048576 /* Union */) {
return getUnionType(ts.map(type.types, function (t) { return instantiateInstantiableTypes(t, mapper); }), 0 /* None */);
}
if (type.flags & 2097152 /* Intersection */) {
return getIntersectionType(ts.map(type.types, function (t) { return instantiateInstantiableTypes(t, mapper); }));
}
return type;
}
/**
* Whoa! Do you really want to use this function?
*
* Unless you're trying to get the *non-apparent* type for a
* value-literal type or you're authoring relevant portions of this algorithm,
* you probably meant to use 'getApparentTypeOfContextualType'.
* Otherwise this may not be very useful.
*
* In cases where you *are* working on this function, you should understand
* when it is appropriate to use 'getContextualType' and 'getApparentTypeOfContextualType'.
*
* - Use 'getContextualType' when you are simply going to propagate the result to the expression.
* - Use 'getApparentTypeOfContextualType' when you're going to need the members of the type.
*
* @param node the expression whose contextual type will be returned.
* @returns the contextual type of an expression.
*/
function getContextualType(node, contextFlags) {
if (node.flags & 16777216 /* InWithStatement */) {
// We cannot answer semantic questions within a with block, do not proceed any further
return undefined;
}
if (node.contextualType) {
return node.contextualType;
}
var parent = node.parent;
switch (parent.kind) {
case 252 /* VariableDeclaration */:
case 162 /* Parameter */:
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
case 201 /* BindingElement */:
return getContextualTypeForInitializerExpression(node, contextFlags);
case 212 /* ArrowFunction */:
case 245 /* ReturnStatement */:
return getContextualTypeForReturnExpression(node);
case 222 /* YieldExpression */:
return getContextualTypeForYieldOperand(parent);
case 216 /* AwaitExpression */:
return getContextualTypeForAwaitOperand(parent, contextFlags);
case 206 /* CallExpression */:
if (parent.expression.kind === 100 /* ImportKeyword */) {
return stringType;
}
/* falls through */
case 207 /* NewExpression */:
return getContextualTypeForArgument(parent, node);
case 209 /* TypeAssertionExpression */:
case 227 /* AsExpression */:
return ts.isConstTypeReference(parent.type) ? tryFindWhenConstTypeReference(parent) : getTypeFromTypeNode(parent.type);
case 219 /* BinaryExpression */:
return getContextualTypeForBinaryOperand(node, contextFlags);
case 291 /* PropertyAssignment */:
case 292 /* ShorthandPropertyAssignment */:
return getContextualTypeForObjectLiteralElement(parent, contextFlags);
case 293 /* SpreadAssignment */:
return getContextualType(parent.parent, contextFlags);
case 202 /* ArrayLiteralExpression */: {
var arrayLiteral = parent;
var type = getApparentTypeOfContextualType(arrayLiteral, contextFlags);
return getContextualTypeForElementExpression(type, ts.indexOfNode(arrayLiteral.elements, node));
}
case 220 /* ConditionalExpression */:
return getContextualTypeForConditionalOperand(node, contextFlags);
case 231 /* TemplateSpan */:
ts.Debug.assert(parent.parent.kind === 221 /* TemplateExpression */);
return getContextualTypeForSubstitutionExpression(parent.parent, node);
case 210 /* ParenthesizedExpression */: {
// Like in `checkParenthesizedExpression`, an `/** @type {xyz} */` comment before a parenthesized expression acts as a type cast.
var tag = ts.isInJSFile(parent) ? ts.getJSDocTypeTag(parent) : undefined;
return tag ? getTypeFromTypeNode(tag.typeExpression.type) : getContextualType(parent, contextFlags);
}
case 228 /* NonNullExpression */:
return getContextualType(parent, contextFlags);
case 286 /* JsxExpression */:
return getContextualTypeForJsxExpression(parent);
case 283 /* JsxAttribute */:
case 285 /* JsxSpreadAttribute */:
return getContextualTypeForJsxAttribute(parent);
case 278 /* JsxOpeningElement */:
case 277 /* JsxSelfClosingElement */:
return getContextualJsxElementAttributesType(parent, contextFlags);
}
return undefined;
function tryFindWhenConstTypeReference(node) {
return getContextualType(node);
}
}
function getInferenceContext(node) {
var ancestor = ts.findAncestor(node, function (n) { return !!n.inferenceContext; });
return ancestor && ancestor.inferenceContext;
}
function getContextualJsxElementAttributesType(node, contextFlags) {
if (ts.isJsxOpeningElement(node) && node.parent.contextualType && contextFlags !== 4 /* Completions */) {
// Contextually applied type is moved from attributes up to the outer jsx attributes so when walking up from the children they get hit
// _However_ to hit them from the _attributes_ we must look for them here; otherwise we'll used the declared type
// (as below) instead!
return node.parent.contextualType;
}
return getContextualTypeForArgumentAtIndex(node, 0);
}
function getEffectiveFirstArgumentForJsxSignature(signature, node) {
return getJsxReferenceKind(node) !== 0 /* Component */
? getJsxPropsTypeFromCallSignature(signature, node)
: getJsxPropsTypeFromClassType(signature, node);
}
function getJsxPropsTypeFromCallSignature(sig, context) {
var propsType = getTypeOfFirstParameterOfSignatureWithFallback(sig, unknownType);
propsType = getJsxManagedAttributesFromLocatedAttributes(context, getJsxNamespaceAt(context), propsType);
var intrinsicAttribs = getJsxType(JsxNames.IntrinsicAttributes, context);
if (intrinsicAttribs !== errorType) {
propsType = intersectTypes(intrinsicAttribs, propsType);
}
return propsType;
}
function getJsxPropsTypeForSignatureFromMember(sig, forcedLookupLocation) {
if (sig.compositeSignatures) {
// JSX Elements using the legacy `props`-field based lookup (eg, react class components) need to treat the `props` member as an input
// instead of an output position when resolving the signature. We need to go back to the input signatures of the composite signature,
// get the type of `props` on each return type individually, and then _intersect them_, rather than union them (as would normally occur
// for a union signature). It's an unfortunate quirk of looking in the output of the signature for the type we want to use for the input.
// The default behavior of `getTypeOfFirstParameterOfSignatureWithFallback` when no `props` member name is defined is much more sane.
var results = [];
for (var _i = 0, _a = sig.compositeSignatures; _i < _a.length; _i++) {
var signature = _a[_i];
var instance = getReturnTypeOfSignature(signature);
if (isTypeAny(instance)) {
return instance;
}
var propType = getTypeOfPropertyOfType(instance, forcedLookupLocation);
if (!propType) {
return;
}
results.push(propType);
}
return getIntersectionType(results); // Same result for both union and intersection signatures
}
var instanceType = getReturnTypeOfSignature(sig);
return isTypeAny(instanceType) ? instanceType : getTypeOfPropertyOfType(instanceType, forcedLookupLocation);
}
function getStaticTypeOfReferencedJsxConstructor(context) {
if (isJsxIntrinsicIdentifier(context.tagName)) {
var result = getIntrinsicAttributesTypeFromJsxOpeningLikeElement(context);
var fakeSignature = createSignatureForJSXIntrinsic(context, result);
return getOrCreateTypeFromSignature(fakeSignature);
}
var tagType = checkExpressionCached(context.tagName);
if (tagType.flags & 128 /* StringLiteral */) {
var result = getIntrinsicAttributesTypeFromStringLiteralType(tagType, context);
if (!result) {
return errorType;
}
var fakeSignature = createSignatureForJSXIntrinsic(context, result);
return getOrCreateTypeFromSignature(fakeSignature);
}
return tagType;
}
function getJsxManagedAttributesFromLocatedAttributes(context, ns, attributesType) {
var managedSym = getJsxLibraryManagedAttributes(ns);
if (managedSym) {
var declaredManagedType = getDeclaredTypeOfSymbol(managedSym); // fetches interface type, or initializes symbol links type parmaeters
var ctorType = getStaticTypeOfReferencedJsxConstructor(context);
if (managedSym.flags & 524288 /* TypeAlias */) {
var params = getSymbolLinks(managedSym).typeParameters;
if (ts.length(params) >= 2) {
var args = fillMissingTypeArguments([ctorType, attributesType], params, 2, ts.isInJSFile(context));
return getTypeAliasInstantiation(managedSym, args);
}
}
if (ts.length(declaredManagedType.typeParameters) >= 2) {
var args = fillMissingTypeArguments([ctorType, attributesType], declaredManagedType.typeParameters, 2, ts.isInJSFile(context));
return createTypeReference(declaredManagedType, args);
}
}
return attributesType;
}
function getJsxPropsTypeFromClassType(sig, context) {
var ns = getJsxNamespaceAt(context);
var forcedLookupLocation = getJsxElementPropertiesName(ns);
var attributesType = forcedLookupLocation === undefined
// If there is no type ElementAttributesProperty, return the type of the first parameter of the signature, which should be the props type
? getTypeOfFirstParameterOfSignatureWithFallback(sig, unknownType)
: forcedLookupLocation === ""
// If there is no e.g. 'props' member in ElementAttributesProperty, use the element class type instead
? getReturnTypeOfSignature(sig)
// Otherwise get the type of the property on the signature return type
: getJsxPropsTypeForSignatureFromMember(sig, forcedLookupLocation);
if (!attributesType) {
// There is no property named 'props' on this instance type
if (!!forcedLookupLocation && !!ts.length(context.attributes.properties)) {
error(context, ts.Diagnostics.JSX_element_class_does_not_support_attributes_because_it_does_not_have_a_0_property, ts.unescapeLeadingUnderscores(forcedLookupLocation));
}
return unknownType;
}
attributesType = getJsxManagedAttributesFromLocatedAttributes(context, ns, attributesType);
if (isTypeAny(attributesType)) {
// Props is of type 'any' or unknown
return attributesType;
}
else {
// Normal case -- add in IntrinsicClassElements<T> and IntrinsicElements
var apparentAttributesType = attributesType;
var intrinsicClassAttribs = getJsxType(JsxNames.IntrinsicClassAttributes, context);
if (intrinsicClassAttribs !== errorType) {
var typeParams = getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(intrinsicClassAttribs.symbol);
var hostClassType = getReturnTypeOfSignature(sig);
apparentAttributesType = intersectTypes(typeParams
? createTypeReference(intrinsicClassAttribs, fillMissingTypeArguments([hostClassType], typeParams, getMinTypeArgumentCount(typeParams), ts.isInJSFile(context)))
: intrinsicClassAttribs, apparentAttributesType);
}
var intrinsicAttribs = getJsxType(JsxNames.IntrinsicAttributes, context);
if (intrinsicAttribs !== errorType) {
apparentAttributesType = intersectTypes(intrinsicAttribs, apparentAttributesType);
}
return apparentAttributesType;
}
}
function getIntersectedSignatures(signatures) {
return ts.getStrictOptionValue(compilerOptions, "noImplicitAny")
? ts.reduceLeft(signatures, function (left, right) {
return left === right || !left ? left
: compareTypeParametersIdentical(left.typeParameters, right.typeParameters) ? combineSignaturesOfIntersectionMembers(left, right)
: undefined;
})
: undefined;
}
function combineIntersectionThisParam(left, right, mapper) {
if (!left || !right) {
return left || right;
}
// A signature `this` type might be a read or a write position... It's very possible that it should be invariant
// and we should refuse to merge signatures if there are `this` types and they do not match. However, so as to be
// pessimistic when contextual typing, for now, we'll union the `this` types.
var thisType = getUnionType([getTypeOfSymbol(left), instantiateType(getTypeOfSymbol(right), mapper)]);
return createSymbolWithType(left, thisType);
}
function combineIntersectionParameters(left, right, mapper) {
var leftCount = getParameterCount(left);
var rightCount = getParameterCount(right);
var longest = leftCount >= rightCount ? left : right;
var shorter = longest === left ? right : left;
var longestCount = longest === left ? leftCount : rightCount;
var eitherHasEffectiveRest = (hasEffectiveRestParameter(left) || hasEffectiveRestParameter(right));
var needsExtraRestElement = eitherHasEffectiveRest && !hasEffectiveRestParameter(longest);
var params = new Array(longestCount + (needsExtraRestElement ? 1 : 0));
for (var i = 0; i < longestCount; i++) {
var longestParamType = tryGetTypeAtPosition(longest, i);
if (longest === right) {
longestParamType = instantiateType(longestParamType, mapper);
}
var shorterParamType = tryGetTypeAtPosition(shorter, i) || unknownType;
if (shorter === right) {
shorterParamType = instantiateType(shorterParamType, mapper);
}
var unionParamType = getUnionType([longestParamType, shorterParamType]);
var isRestParam = eitherHasEffectiveRest && !needsExtraRestElement && i === (longestCount - 1);
var isOptional = i >= getMinArgumentCount(longest) && i >= getMinArgumentCount(shorter);
var leftName = i >= leftCount ? undefined : getParameterNameAtPosition(left, i);
var rightName = i >= rightCount ? undefined : getParameterNameAtPosition(right, i);
var paramName = leftName === rightName ? leftName :
!leftName ? rightName :
!rightName ? leftName :
undefined;
var paramSymbol = createSymbol(1 /* FunctionScopedVariable */ | (isOptional && !isRestParam ? 16777216 /* Optional */ : 0), paramName || "arg" + i);
paramSymbol.type = isRestParam ? createArrayType(unionParamType) : unionParamType;
params[i] = paramSymbol;
}
if (needsExtraRestElement) {
var restParamSymbol = createSymbol(1 /* FunctionScopedVariable */, "args");
restParamSymbol.type = createArrayType(getTypeAtPosition(shorter, longestCount));
if (shorter === right) {
restParamSymbol.type = instantiateType(restParamSymbol.type, mapper);
}
params[longestCount] = restParamSymbol;
}
return params;
}
function combineSignaturesOfIntersectionMembers(left, right) {
var typeParams = left.typeParameters || right.typeParameters;
var paramMapper;
if (left.typeParameters && right.typeParameters) {
paramMapper = createTypeMapper(right.typeParameters, left.typeParameters);
// We just use the type parameter defaults from the first signature
}
var declaration = left.declaration;
var params = combineIntersectionParameters(left, right, paramMapper);
var thisParam = combineIntersectionThisParam(left.thisParameter, right.thisParameter, paramMapper);
var minArgCount = Math.max(left.minArgumentCount, right.minArgumentCount);
var result = createSignature(declaration, typeParams, thisParam, params,
/*resolvedReturnType*/ undefined,
/*resolvedTypePredicate*/ undefined, minArgCount, (left.flags | right.flags) & 39 /* PropagatingFlags */);
result.compositeKind = 2097152 /* Intersection */;
result.compositeSignatures = ts.concatenate(left.compositeKind === 2097152 /* Intersection */ && left.compositeSignatures || [left], [right]);
if (paramMapper) {
result.mapper = left.compositeKind === 2097152 /* Intersection */ && left.mapper && left.compositeSignatures ? combineTypeMappers(left.mapper, paramMapper) : paramMapper;
}
return result;
}
// If the given type is an object or union type with a single signature, and if that signature has at
// least as many parameters as the given function, return the signature. Otherwise return undefined.
function getContextualCallSignature(type, node) {
var signatures = getSignaturesOfType(type, 0 /* Call */);
var applicableByArity = ts.filter(signatures, function (s) { return !isAritySmaller(s, node); });
return applicableByArity.length === 1 ? applicableByArity[0] : getIntersectedSignatures(applicableByArity);
}
/** If the contextual signature has fewer parameters than the function expression, do not use it */
function isAritySmaller(signature, target) {
var targetParameterCount = 0;
for (; targetParameterCount < target.parameters.length; targetParameterCount++) {
var param = target.parameters[targetParameterCount];
if (param.initializer || param.questionToken || param.dotDotDotToken || isJSDocOptionalParameter(param)) {
break;
}
}
if (target.parameters.length && ts.parameterIsThisKeyword(target.parameters[0])) {
targetParameterCount--;
}
return !hasEffectiveRestParameter(signature) && getParameterCount(signature) < targetParameterCount;
}
function isFunctionExpressionOrArrowFunction(node) {
return node.kind === 211 /* FunctionExpression */ || node.kind === 212 /* ArrowFunction */;
}
function getContextualSignatureForFunctionLikeDeclaration(node) {
// Only function expressions, arrow functions, and object literal methods are contextually typed.
return isFunctionExpressionOrArrowFunction(node) || ts.isObjectLiteralMethod(node)
? getContextualSignature(node)
: undefined;
}
// Return the contextual signature for a given expression node. A contextual type provides a
// contextual signature if it has a single call signature and if that call signature is non-generic.
// If the contextual type is a union type, get the signature from each type possible and if they are
// all identical ignoring their return type, the result is same signature but with return type as
// union type of return types from these signatures
function getContextualSignature(node) {
ts.Debug.assert(node.kind !== 167 /* MethodDeclaration */ || ts.isObjectLiteralMethod(node));
var typeTagSignature = getSignatureOfTypeTag(node);
if (typeTagSignature) {
return typeTagSignature;
}
var type = getApparentTypeOfContextualType(node, 1 /* Signature */);
if (!type) {
return undefined;
}
if (!(type.flags & 1048576 /* Union */)) {
return getContextualCallSignature(type, node);
}
var signatureList;
var types = type.types;
for (var _i = 0, types_19 = types; _i < types_19.length; _i++) {
var current = types_19[_i];
var signature = getContextualCallSignature(current, node);
if (signature) {
if (!signatureList) {
// This signature will contribute to contextual union signature
signatureList = [signature];
}
else if (!compareSignaturesIdentical(signatureList[0], signature, /*partialMatch*/ false, /*ignoreThisTypes*/ true, /*ignoreReturnTypes*/ true, compareTypesIdentical)) {
// Signatures aren't identical, do not use
return undefined;
}
else {
// Use this signature for contextual union signature
signatureList.push(signature);
}
}
}
// Result is union of signatures collected (return type is union of return types of this signature set)
if (signatureList) {
return signatureList.length === 1 ? signatureList[0] : createUnionSignature(signatureList[0], signatureList);
}
}
function checkSpreadExpression(node, checkMode) {
if (languageVersion < 2 /* ES2015 */) {
checkExternalEmitHelpers(node, compilerOptions.downlevelIteration ? 1536 /* SpreadIncludes */ : 1024 /* SpreadArray */);
}
var arrayOrIterableType = checkExpression(node.expression, checkMode);
return checkIteratedTypeOrElementType(33 /* Spread */, arrayOrIterableType, undefinedType, node.expression);
}
function checkSyntheticExpression(node) {
return node.isSpread ? getIndexedAccessType(node.type, numberType) : node.type;
}
function hasDefaultValue(node) {
return (node.kind === 201 /* BindingElement */ && !!node.initializer) ||
(node.kind === 219 /* BinaryExpression */ && node.operatorToken.kind === 63 /* EqualsToken */);
}
function checkArrayLiteral(node, checkMode, forceTuple) {
var elements = node.elements;
var elementCount = elements.length;
var elementTypes = [];
var elementFlags = [];
var contextualType = getApparentTypeOfContextualType(node);
var inDestructuringPattern = ts.isAssignmentTarget(node);
var inConstContext = isConstContext(node);
var hasOmittedExpression = false;
for (var i = 0; i < elementCount; i++) {
var e = elements[i];
if (e.kind === 223 /* SpreadElement */) {
if (languageVersion < 2 /* ES2015 */) {
checkExternalEmitHelpers(e, compilerOptions.downlevelIteration ? 1536 /* SpreadIncludes */ : 1024 /* SpreadArray */);
}
var spreadType = checkExpression(e.expression, checkMode, forceTuple);
if (isArrayLikeType(spreadType)) {
elementTypes.push(spreadType);
elementFlags.push(8 /* Variadic */);
}
else if (inDestructuringPattern) {
// Given the following situation:
// var c: {};
// [...c] = ["", 0];
//
// c is represented in the tree as a spread element in an array literal.
// But c really functions as a rest element, and its purpose is to provide
// a contextual type for the right hand side of the assignment. Therefore,
// instead of calling checkExpression on "...c", which will give an error
// if c is not iterable/array-like, we need to act as if we are trying to
// get the contextual element type from it. So we do something similar to
// getContextualTypeForElementExpression, which will crucially not error
// if there is no index type / iterated type.
var restElementType = getIndexTypeOfType(spreadType, numberType) ||
getIteratedTypeOrElementType(65 /* Destructuring */, spreadType, undefinedType, /*errorNode*/ undefined, /*checkAssignability*/ false) ||
unknownType;
elementTypes.push(restElementType);
elementFlags.push(4 /* Rest */);
}
else {
elementTypes.push(checkIteratedTypeOrElementType(33 /* Spread */, spreadType, undefinedType, e.expression));
elementFlags.push(4 /* Rest */);
}
}
else if (exactOptionalPropertyTypes && e.kind === 225 /* OmittedExpression */) {
hasOmittedExpression = true;
elementTypes.push(missingType);
elementFlags.push(2 /* Optional */);
}
else {
var elementContextualType = getContextualTypeForElementExpression(contextualType, elementTypes.length);
var type = checkExpressionForMutableLocation(e, checkMode, elementContextualType, forceTuple);
elementTypes.push(addOptionality(type, /*isProperty*/ true, hasOmittedExpression));
elementFlags.push(hasOmittedExpression ? 2 /* Optional */ : 1 /* Required */);
}
}
if (inDestructuringPattern) {
return createTupleType(elementTypes, elementFlags);
}
if (forceTuple || inConstContext || contextualType && someType(contextualType, isTupleLikeType)) {
return createArrayLiteralType(createTupleType(elementTypes, elementFlags, /*readonly*/ inConstContext));
}
return createArrayLiteralType(createArrayType(elementTypes.length ?
getUnionType(ts.sameMap(elementTypes, function (t, i) { return elementFlags[i] & 8 /* Variadic */ ? getIndexedAccessTypeOrUndefined(t, numberType) || anyType : t; }), 2 /* Subtype */) :
strictNullChecks ? implicitNeverType : undefinedWideningType, inConstContext));
}
function createArrayLiteralType(type) {
if (!(ts.getObjectFlags(type) & 4 /* Reference */)) {
return type;
}
var literalType = type.literalType;
if (!literalType) {
literalType = type.literalType = cloneTypeReference(type);
literalType.objectFlags |= 32768 /* ArrayLiteral */ | 262144 /* ContainsObjectOrArrayLiteral */;
}
return literalType;
}
function isNumericName(name) {
switch (name.kind) {
case 160 /* ComputedPropertyName */:
return isNumericComputedName(name);
case 79 /* Identifier */:
return isNumericLiteralName(name.escapedText);
case 8 /* NumericLiteral */:
case 10 /* StringLiteral */:
return isNumericLiteralName(name.text);
default:
return false;
}
}
function isNumericComputedName(name) {
// It seems odd to consider an expression of type Any to result in a numeric name,
// but this behavior is consistent with checkIndexedAccess
return isTypeAssignableToKind(checkComputedPropertyName(name), 296 /* NumberLike */);
}
function isNumericLiteralName(name) {
// The intent of numeric names is that
// - they are names with text in a numeric form, and that
// - setting properties/indexing with them is always equivalent to doing so with the numeric literal 'numLit',
// acquired by applying the abstract 'ToNumber' operation on the name's text.
//
// The subtlety is in the latter portion, as we cannot reliably say that anything that looks like a numeric literal is a numeric name.
// In fact, it is the case that the text of the name must be equal to 'ToString(numLit)' for this to hold.
//
// Consider the property name '"0xF00D"'. When one indexes with '0xF00D', they are actually indexing with the value of 'ToString(0xF00D)'
// according to the ECMAScript specification, so it is actually as if the user indexed with the string '"61453"'.
// Thus, the text of all numeric literals equivalent to '61543' such as '0xF00D', '0xf00D', '0170015', etc. are not valid numeric names
// because their 'ToString' representation is not equal to their original text.
// This is motivated by ECMA-262 sections 9.3.1, 9.8.1, 11.1.5, and 11.2.1.
//
// Here, we test whether 'ToString(ToNumber(name))' is exactly equal to 'name'.
// The '+' prefix operator is equivalent here to applying the abstract ToNumber operation.
// Applying the 'toString()' method on a number gives us the abstract ToString operation on a number.
//
// Note that this accepts the values 'Infinity', '-Infinity', and 'NaN', and that this is intentional.
// This is desired behavior, because when indexing with them as numeric entities, you are indexing
// with the strings '"Infinity"', '"-Infinity"', and '"NaN"' respectively.
return (+name).toString() === name;
}
function checkComputedPropertyName(node) {
var links = getNodeLinks(node.expression);
if (!links.resolvedType) {
links.resolvedType = checkExpression(node.expression);
// The computed property name of a non-static class field within a loop must be stored in a block-scoped binding.
// (It needs to be bound at class evaluation time.)
if (ts.isPropertyDeclaration(node.parent) && !ts.hasStaticModifier(node.parent) && ts.isClassExpression(node.parent.parent)) {
var container = ts.getEnclosingBlockScopeContainer(node.parent.parent);
var enclosingIterationStatement = getEnclosingIterationStatement(container);
if (enclosingIterationStatement) {
// The computed field name will use a block scoped binding which can be unique for each iteration of the loop.
getNodeLinks(enclosingIterationStatement).flags |= 65536 /* LoopWithCapturedBlockScopedBinding */;
// The generated variable which stores the computed field name must be block-scoped.
getNodeLinks(node).flags |= 524288 /* BlockScopedBindingInLoop */;
// The generated variable which stores the class must be block-scoped.
getNodeLinks(node.parent.parent).flags |= 524288 /* BlockScopedBindingInLoop */;
}
}
// This will allow types number, string, symbol or any. It will also allow enums, the unknown
// type, and any union of these types (like string | number).
if (links.resolvedType.flags & 98304 /* Nullable */ ||
!isTypeAssignableToKind(links.resolvedType, 402653316 /* StringLike */ | 296 /* NumberLike */ | 12288 /* ESSymbolLike */) &&
!isTypeAssignableTo(links.resolvedType, stringNumberSymbolType)) {
error(node, ts.Diagnostics.A_computed_property_name_must_be_of_type_string_number_symbol_or_any);
}
}
return links.resolvedType;
}
function isSymbolWithNumericName(symbol) {
var _a;
var firstDecl = (_a = symbol.declarations) === null || _a === void 0 ? void 0 : _a[0];
return isNumericLiteralName(symbol.escapedName) || (firstDecl && ts.isNamedDeclaration(firstDecl) && isNumericName(firstDecl.name));
}
function isSymbolWithSymbolName(symbol) {
var _a;
var firstDecl = (_a = symbol.declarations) === null || _a === void 0 ? void 0 : _a[0];
return ts.isKnownSymbol(symbol) || (firstDecl && ts.isNamedDeclaration(firstDecl) && ts.isComputedPropertyName(firstDecl.name) &&
isTypeAssignableToKind(checkComputedPropertyName(firstDecl.name), 4096 /* ESSymbol */));
}
function getObjectLiteralIndexInfo(node, offset, properties, keyType) {
var propTypes = [];
for (var i = offset; i < properties.length; i++) {
var prop = properties[i];
if (keyType === stringType && !isSymbolWithSymbolName(prop) ||
keyType === numberType && isSymbolWithNumericName(prop) ||
keyType === esSymbolType && isSymbolWithSymbolName(prop)) {
propTypes.push(getTypeOfSymbol(properties[i]));
}
}
var unionType = propTypes.length ? getUnionType(propTypes, 2 /* Subtype */) : undefinedType;
return createIndexInfo(keyType, unionType, isConstContext(node));
}
function getImmediateAliasedSymbol(symbol) {
ts.Debug.assert((symbol.flags & 2097152 /* Alias */) !== 0, "Should only get Alias here.");
var links = getSymbolLinks(symbol);
if (!links.immediateTarget) {
var node = getDeclarationOfAliasSymbol(symbol);
if (!node)
return ts.Debug.fail();
links.immediateTarget = getTargetOfAliasDeclaration(node, /*dontRecursivelyResolve*/ true);
}
return links.immediateTarget;
}
function checkObjectLiteral(node, checkMode) {
var inDestructuringPattern = ts.isAssignmentTarget(node);
// Grammar checking
checkGrammarObjectLiteralExpression(node, inDestructuringPattern);
var allPropertiesTable = strictNullChecks ? ts.createSymbolTable() : undefined;
var propertiesTable = ts.createSymbolTable();
var propertiesArray = [];
var spread = emptyObjectType;
var contextualType = getApparentTypeOfContextualType(node);
var contextualTypeHasPattern = contextualType && contextualType.pattern &&
(contextualType.pattern.kind === 199 /* ObjectBindingPattern */ || contextualType.pattern.kind === 203 /* ObjectLiteralExpression */);
var inConstContext = isConstContext(node);
var checkFlags = inConstContext ? 8 /* Readonly */ : 0;
var isInJavascript = ts.isInJSFile(node) && !ts.isInJsonFile(node);
var enumTag = ts.getJSDocEnumTag(node);
var isJSObjectLiteral = !contextualType && isInJavascript && !enumTag;
var objectFlags = freshObjectLiteralFlag;
var patternWithComputedProperties = false;
var hasComputedStringProperty = false;
var hasComputedNumberProperty = false;
var hasComputedSymbolProperty = false;
// Spreads may cause an early bail; ensure computed names are always checked (this is cached)
// As otherwise they may not be checked until exports for the type at this position are retrieved,
// which may never occur.
for (var _i = 0, _a = node.properties; _i < _a.length; _i++) {
var elem = _a[_i];
if (elem.name && ts.isComputedPropertyName(elem.name)) {
checkComputedPropertyName(elem.name);
}
}
var offset = 0;
for (var _b = 0, _c = node.properties; _b < _c.length; _b++) {
var memberDecl = _c[_b];
var member = getSymbolOfNode(memberDecl);
var computedNameType = memberDecl.name && memberDecl.name.kind === 160 /* ComputedPropertyName */ ?
checkComputedPropertyName(memberDecl.name) : undefined;
if (memberDecl.kind === 291 /* PropertyAssignment */ ||
memberDecl.kind === 292 /* ShorthandPropertyAssignment */ ||
ts.isObjectLiteralMethod(memberDecl)) {
var type = memberDecl.kind === 291 /* PropertyAssignment */ ? checkPropertyAssignment(memberDecl, checkMode) :
// avoid resolving the left side of the ShorthandPropertyAssignment outside of the destructuring
// for error recovery purposes. For example, if a user wrote `{ a = 100 }` instead of `{ a: 100 }`.
// we don't want to say "could not find 'a'".
memberDecl.kind === 292 /* ShorthandPropertyAssignment */ ? checkExpressionForMutableLocation(!inDestructuringPattern && memberDecl.objectAssignmentInitializer ? memberDecl.objectAssignmentInitializer : memberDecl.name, checkMode) :
checkObjectLiteralMethod(memberDecl, checkMode);
if (isInJavascript) {
var jsDocType = getTypeForDeclarationFromJSDocComment(memberDecl);
if (jsDocType) {
checkTypeAssignableTo(type, jsDocType, memberDecl);
type = jsDocType;
}
else if (enumTag && enumTag.typeExpression) {
checkTypeAssignableTo(type, getTypeFromTypeNode(enumTag.typeExpression), memberDecl);
}
}
objectFlags |= ts.getObjectFlags(type) & 917504 /* PropagatingFlags */;
var nameType = computedNameType && isTypeUsableAsPropertyName(computedNameType) ? computedNameType : undefined;
var prop = nameType ?
createSymbol(4 /* Property */ | member.flags, getPropertyNameFromType(nameType), checkFlags | 4096 /* Late */) :
createSymbol(4 /* Property */ | member.flags, member.escapedName, checkFlags);
if (nameType) {
prop.nameType = nameType;
}
if (inDestructuringPattern) {
// If object literal is an assignment pattern and if the assignment pattern specifies a default value
// for the property, make the property optional.
var isOptional = (memberDecl.kind === 291 /* PropertyAssignment */ && hasDefaultValue(memberDecl.initializer)) ||
(memberDecl.kind === 292 /* ShorthandPropertyAssignment */ && memberDecl.objectAssignmentInitializer);
if (isOptional) {
prop.flags |= 16777216 /* Optional */;
}
}
else if (contextualTypeHasPattern && !(ts.getObjectFlags(contextualType) & 512 /* ObjectLiteralPatternWithComputedProperties */)) {
// If object literal is contextually typed by the implied type of a binding pattern, and if the
// binding pattern specifies a default value for the property, make the property optional.
var impliedProp = getPropertyOfType(contextualType, member.escapedName);
if (impliedProp) {
prop.flags |= impliedProp.flags & 16777216 /* Optional */;
}
else if (!compilerOptions.suppressExcessPropertyErrors && !getIndexInfoOfType(contextualType, stringType)) {
error(memberDecl.name, ts.Diagnostics.Object_literal_may_only_specify_known_properties_and_0_does_not_exist_in_type_1, symbolToString(member), typeToString(contextualType));
}
}
prop.declarations = member.declarations;
prop.parent = member.parent;
if (member.valueDeclaration) {
prop.valueDeclaration = member.valueDeclaration;
}
prop.type = type;
prop.target = member;
member = prop;
allPropertiesTable === null || allPropertiesTable === void 0 ? void 0 : allPropertiesTable.set(prop.escapedName, prop);
}
else if (memberDecl.kind === 293 /* SpreadAssignment */) {
if (languageVersion < 2 /* ES2015 */) {
checkExternalEmitHelpers(memberDecl, 2 /* Assign */);
}
if (propertiesArray.length > 0) {
spread = getSpreadType(spread, createObjectLiteralType(), node.symbol, objectFlags, inConstContext);
propertiesArray = [];
propertiesTable = ts.createSymbolTable();
hasComputedStringProperty = false;
hasComputedNumberProperty = false;
hasComputedSymbolProperty = false;
}
var type = getReducedType(checkExpression(memberDecl.expression));
if (isValidSpreadType(type)) {
var mergedType = tryMergeUnionOfObjectTypeAndEmptyObject(type, inConstContext);
if (allPropertiesTable) {
checkSpreadPropOverrides(mergedType, allPropertiesTable, memberDecl);
}
offset = propertiesArray.length;
if (spread === errorType) {
continue;
}
spread = getSpreadType(spread, mergedType, node.symbol, objectFlags, inConstContext);
}
else {
error(memberDecl, ts.Diagnostics.Spread_types_may_only_be_created_from_object_types);
spread = errorType;
}
continue;
}
else {
// TypeScript 1.0 spec (April 2014)
// A get accessor declaration is processed in the same manner as
// an ordinary function declaration(section 6.1) with no parameters.
// A set accessor declaration is processed in the same manner
// as an ordinary function declaration with a single parameter and a Void return type.
ts.Debug.assert(memberDecl.kind === 170 /* GetAccessor */ || memberDecl.kind === 171 /* SetAccessor */);
checkNodeDeferred(memberDecl);
}
if (computedNameType && !(computedNameType.flags & 8576 /* StringOrNumberLiteralOrUnique */)) {
if (isTypeAssignableTo(computedNameType, stringNumberSymbolType)) {
if (isTypeAssignableTo(computedNameType, numberType)) {
hasComputedNumberProperty = true;
}
else if (isTypeAssignableTo(computedNameType, esSymbolType)) {
hasComputedSymbolProperty = true;
}
else {
hasComputedStringProperty = true;
}
if (inDestructuringPattern) {
patternWithComputedProperties = true;
}
}
}
else {
propertiesTable.set(member.escapedName, member);
}
propertiesArray.push(member);
}
// If object literal is contextually typed by the implied type of a binding pattern, augment the result
// type with those properties for which the binding pattern specifies a default value.
// If the object literal is spread into another object literal, skip this step and let the top-level object
// literal handle it instead.
if (contextualTypeHasPattern && node.parent.kind !== 293 /* SpreadAssignment */) {
for (var _d = 0, _e = getPropertiesOfType(contextualType); _d < _e.length; _d++) {
var prop = _e[_d];
if (!propertiesTable.get(prop.escapedName) && !getPropertyOfType(spread, prop.escapedName)) {
if (!(prop.flags & 16777216 /* Optional */)) {
error(prop.valueDeclaration || prop.bindingElement, ts.Diagnostics.Initializer_provides_no_value_for_this_binding_element_and_the_binding_element_has_no_default_value);
}
propertiesTable.set(prop.escapedName, prop);
propertiesArray.push(prop);
}
}
}
if (spread === errorType) {
return errorType;
}
if (spread !== emptyObjectType) {
if (propertiesArray.length > 0) {
spread = getSpreadType(spread, createObjectLiteralType(), node.symbol, objectFlags, inConstContext);
propertiesArray = [];
propertiesTable = ts.createSymbolTable();
hasComputedStringProperty = false;
hasComputedNumberProperty = false;
}
// remap the raw emptyObjectType fed in at the top into a fresh empty object literal type, unique to this use site
return mapType(spread, function (t) { return t === emptyObjectType ? createObjectLiteralType() : t; });
}
return createObjectLiteralType();
function createObjectLiteralType() {
var indexInfos = [];
if (hasComputedStringProperty)
indexInfos.push(getObjectLiteralIndexInfo(node, offset, propertiesArray, stringType));
if (hasComputedNumberProperty)
indexInfos.push(getObjectLiteralIndexInfo(node, offset, propertiesArray, numberType));
if (hasComputedSymbolProperty)
indexInfos.push(getObjectLiteralIndexInfo(node, offset, propertiesArray, esSymbolType));
var result = createAnonymousType(node.symbol, propertiesTable, ts.emptyArray, ts.emptyArray, indexInfos);
result.objectFlags |= objectFlags | 128 /* ObjectLiteral */ | 262144 /* ContainsObjectOrArrayLiteral */;
if (isJSObjectLiteral) {
result.objectFlags |= 8192 /* JSLiteral */;
}
if (patternWithComputedProperties) {
result.objectFlags |= 512 /* ObjectLiteralPatternWithComputedProperties */;
}
if (inDestructuringPattern) {
result.pattern = node;
}
return result;
}
}
function isValidSpreadType(type) {
if (type.flags & 465829888 /* Instantiable */) {
var constraint = getBaseConstraintOfType(type);
if (constraint !== undefined) {
return isValidSpreadType(constraint);
}
}
return !!(type.flags & (1 /* Any */ | 67108864 /* NonPrimitive */ | 524288 /* Object */ | 58982400 /* InstantiableNonPrimitive */) ||
getFalsyFlags(type) & 117632 /* DefinitelyFalsy */ && isValidSpreadType(removeDefinitelyFalsyTypes(type)) ||
type.flags & 3145728 /* UnionOrIntersection */ && ts.every(type.types, isValidSpreadType));
}
function checkJsxSelfClosingElementDeferred(node) {
checkJsxOpeningLikeElementOrOpeningFragment(node);
}
function checkJsxSelfClosingElement(node, _checkMode) {
checkNodeDeferred(node);
return getJsxElementTypeAt(node) || anyType;
}
function checkJsxElementDeferred(node) {
// Check attributes
checkJsxOpeningLikeElementOrOpeningFragment(node.openingElement);
// Perform resolution on the closing tag so that rename/go to definition/etc work
if (isJsxIntrinsicIdentifier(node.closingElement.tagName)) {
getIntrinsicTagSymbol(node.closingElement);
}
else {
checkExpression(node.closingElement.tagName);
}
checkJsxChildren(node);
}
function checkJsxElement(node, _checkMode) {
checkNodeDeferred(node);
return getJsxElementTypeAt(node) || anyType;
}
function checkJsxFragment(node) {
checkJsxOpeningLikeElementOrOpeningFragment(node.openingFragment);
// by default, jsx:'react' will use jsxFactory = React.createElement and jsxFragmentFactory = React.Fragment
// if jsxFactory compiler option is provided, ensure jsxFragmentFactory compiler option or @jsxFrag pragma is provided too
var nodeSourceFile = ts.getSourceFileOfNode(node);
if (ts.getJSXTransformEnabled(compilerOptions) && (compilerOptions.jsxFactory || nodeSourceFile.pragmas.has("jsx"))
&& !compilerOptions.jsxFragmentFactory && !nodeSourceFile.pragmas.has("jsxfrag")) {
error(node, compilerOptions.jsxFactory
? ts.Diagnostics.The_jsxFragmentFactory_compiler_option_must_be_provided_to_use_JSX_fragments_with_the_jsxFactory_compiler_option
: ts.Diagnostics.An_jsxFrag_pragma_is_required_when_using_an_jsx_pragma_with_JSX_fragments);
}
checkJsxChildren(node);
return getJsxElementTypeAt(node) || anyType;
}
function isHyphenatedJsxName(name) {
return ts.stringContains(name, "-");
}
/**
* Returns true iff React would emit this tag name as a string rather than an identifier or qualified name
*/
function isJsxIntrinsicIdentifier(tagName) {
return tagName.kind === 79 /* Identifier */ && ts.isIntrinsicJsxName(tagName.escapedText);
}
function checkJsxAttribute(node, checkMode) {
return node.initializer
? checkExpressionForMutableLocation(node.initializer, checkMode)
: trueType; // <Elem attr /> is sugar for <Elem attr={true} />
}
/**
* Get attributes type of the JSX opening-like element. The result is from resolving "attributes" property of the opening-like element.
*
* @param openingLikeElement a JSX opening-like element
* @param filter a function to remove attributes that will not participate in checking whether attributes are assignable
* @return an anonymous type (similar to the one returned by checkObjectLiteral) in which its properties are attributes property.
* @remarks Because this function calls getSpreadType, it needs to use the same checks as checkObjectLiteral,
* which also calls getSpreadType.
*/
function createJsxAttributesTypeFromAttributesProperty(openingLikeElement, checkMode) {
var attributes = openingLikeElement.attributes;
var allAttributesTable = strictNullChecks ? ts.createSymbolTable() : undefined;
var attributesTable = ts.createSymbolTable();
var spread = emptyJsxObjectType;
var hasSpreadAnyType = false;
var typeToIntersect;
var explicitlySpecifyChildrenAttribute = false;
var objectFlags = 2048 /* JsxAttributes */;
var jsxChildrenPropertyName = getJsxElementChildrenPropertyName(getJsxNamespaceAt(openingLikeElement));
for (var _i = 0, _a = attributes.properties; _i < _a.length; _i++) {
var attributeDecl = _a[_i];
var member = attributeDecl.symbol;
if (ts.isJsxAttribute(attributeDecl)) {
var exprType = checkJsxAttribute(attributeDecl, checkMode);
objectFlags |= ts.getObjectFlags(exprType) & 917504 /* PropagatingFlags */;
var attributeSymbol = createSymbol(4 /* Property */ | member.flags, member.escapedName);
attributeSymbol.declarations = member.declarations;
attributeSymbol.parent = member.parent;
if (member.valueDeclaration) {
attributeSymbol.valueDeclaration = member.valueDeclaration;
}
attributeSymbol.type = exprType;
attributeSymbol.target = member;
attributesTable.set(attributeSymbol.escapedName, attributeSymbol);
allAttributesTable === null || allAttributesTable === void 0 ? void 0 : allAttributesTable.set(attributeSymbol.escapedName, attributeSymbol);
if (attributeDecl.name.escapedText === jsxChildrenPropertyName) {
explicitlySpecifyChildrenAttribute = true;
}
}
else {
ts.Debug.assert(attributeDecl.kind === 285 /* JsxSpreadAttribute */);
if (attributesTable.size > 0) {
spread = getSpreadType(spread, createJsxAttributesType(), attributes.symbol, objectFlags, /*readonly*/ false);
attributesTable = ts.createSymbolTable();
}
var exprType = getReducedType(checkExpressionCached(attributeDecl.expression, checkMode));
if (isTypeAny(exprType)) {
hasSpreadAnyType = true;
}
if (isValidSpreadType(exprType)) {
spread = getSpreadType(spread, exprType, attributes.symbol, objectFlags, /*readonly*/ false);
if (allAttributesTable) {
checkSpreadPropOverrides(exprType, allAttributesTable, attributeDecl);
}
}
else {
typeToIntersect = typeToIntersect ? getIntersectionType([typeToIntersect, exprType]) : exprType;
}
}
}
if (!hasSpreadAnyType) {
if (attributesTable.size > 0) {
spread = getSpreadType(spread, createJsxAttributesType(), attributes.symbol, objectFlags, /*readonly*/ false);
}
}
// Handle children attribute
var parent = openingLikeElement.parent.kind === 276 /* JsxElement */ ? openingLikeElement.parent : undefined;
// We have to check that openingElement of the parent is the one we are visiting as this may not be true for selfClosingElement
if (parent && parent.openingElement === openingLikeElement && parent.children.length > 0) {
var childrenTypes = checkJsxChildren(parent, checkMode);
if (!hasSpreadAnyType && jsxChildrenPropertyName && jsxChildrenPropertyName !== "") {
// Error if there is a attribute named "children" explicitly specified and children element.
// This is because children element will overwrite the value from attributes.
// Note: we will not warn "children" attribute overwritten if "children" attribute is specified in object spread.
if (explicitlySpecifyChildrenAttribute) {
error(attributes, ts.Diagnostics._0_are_specified_twice_The_attribute_named_0_will_be_overwritten, ts.unescapeLeadingUnderscores(jsxChildrenPropertyName));
}
var contextualType = getApparentTypeOfContextualType(openingLikeElement.attributes);
var childrenContextualType = contextualType && getTypeOfPropertyOfContextualType(contextualType, jsxChildrenPropertyName);
// If there are children in the body of JSX element, create dummy attribute "children" with the union of children types so that it will pass the attribute checking process
var childrenPropSymbol = createSymbol(4 /* Property */, jsxChildrenPropertyName);
childrenPropSymbol.type = childrenTypes.length === 1 ? childrenTypes[0] :
childrenContextualType && someType(childrenContextualType, isTupleLikeType) ? createTupleType(childrenTypes) :
createArrayType(getUnionType(childrenTypes));
// Fake up a property declaration for the children
childrenPropSymbol.valueDeclaration = ts.factory.createPropertySignature(/*modifiers*/ undefined, ts.unescapeLeadingUnderscores(jsxChildrenPropertyName), /*questionToken*/ undefined, /*type*/ undefined);
ts.setParent(childrenPropSymbol.valueDeclaration, attributes);
childrenPropSymbol.valueDeclaration.symbol = childrenPropSymbol;
var childPropMap = ts.createSymbolTable();
childPropMap.set(jsxChildrenPropertyName, childrenPropSymbol);
spread = getSpreadType(spread, createAnonymousType(attributes.symbol, childPropMap, ts.emptyArray, ts.emptyArray, ts.emptyArray), attributes.symbol, objectFlags, /*readonly*/ false);
}
}
if (hasSpreadAnyType) {
return anyType;
}
if (typeToIntersect && spread !== emptyJsxObjectType) {
return getIntersectionType([typeToIntersect, spread]);
}
return typeToIntersect || (spread === emptyJsxObjectType ? createJsxAttributesType() : spread);
/**
* Create anonymous type from given attributes symbol table.
* @param symbol a symbol of JsxAttributes containing attributes corresponding to attributesTable
* @param attributesTable a symbol table of attributes property
*/
function createJsxAttributesType() {
objectFlags |= freshObjectLiteralFlag;
var result = createAnonymousType(attributes.symbol, attributesTable, ts.emptyArray, ts.emptyArray, ts.emptyArray);
result.objectFlags |= objectFlags | 128 /* ObjectLiteral */ | 262144 /* ContainsObjectOrArrayLiteral */;
return result;
}
}
function checkJsxChildren(node, checkMode) {
var childrenTypes = [];
for (var _i = 0, _a = node.children; _i < _a.length; _i++) {
var child = _a[_i];
// In React, JSX text that contains only whitespaces will be ignored so we don't want to type-check that
// because then type of children property will have constituent of string type.
if (child.kind === 11 /* JsxText */) {
if (!child.containsOnlyTriviaWhiteSpaces) {
childrenTypes.push(stringType);
}
}
else if (child.kind === 286 /* JsxExpression */ && !child.expression) {
continue; // empty jsx expressions don't *really* count as present children
}
else {
childrenTypes.push(checkExpressionForMutableLocation(child, checkMode));
}
}
return childrenTypes;
}
function checkSpreadPropOverrides(type, props, spread) {
for (var _i = 0, _a = getPropertiesOfType(type); _i < _a.length; _i++) {
var right = _a[_i];
if (!(right.flags & 16777216 /* Optional */)) {
var left = props.get(right.escapedName);
if (left) {
var diagnostic = error(left.valueDeclaration, ts.Diagnostics._0_is_specified_more_than_once_so_this_usage_will_be_overwritten, ts.unescapeLeadingUnderscores(left.escapedName));
ts.addRelatedInfo(diagnostic, ts.createDiagnosticForNode(spread, ts.Diagnostics.This_spread_always_overwrites_this_property));
}
}
}
}
/**
* Check attributes property of opening-like element. This function is called during chooseOverload to get call signature of a JSX opening-like element.
* (See "checkApplicableSignatureForJsxOpeningLikeElement" for how the function is used)
* @param node a JSXAttributes to be resolved of its type
*/
function checkJsxAttributes(node, checkMode) {
return createJsxAttributesTypeFromAttributesProperty(node.parent, checkMode);
}
function getJsxType(name, location) {
var namespace = getJsxNamespaceAt(location);
var exports = namespace && getExportsOfSymbol(namespace);
var typeSymbol = exports && getSymbol(exports, name, 788968 /* Type */);
return typeSymbol ? getDeclaredTypeOfSymbol(typeSymbol) : errorType;
}
/**
* Looks up an intrinsic tag name and returns a symbol that either points to an intrinsic
* property (in which case nodeLinks.jsxFlags will be IntrinsicNamedElement) or an intrinsic
* string index signature (in which case nodeLinks.jsxFlags will be IntrinsicIndexedElement).
* May also return unknownSymbol if both of these lookups fail.
*/
function getIntrinsicTagSymbol(node) {
var links = getNodeLinks(node);
if (!links.resolvedSymbol) {
var intrinsicElementsType = getJsxType(JsxNames.IntrinsicElements, node);
if (intrinsicElementsType !== errorType) {
// Property case
if (!ts.isIdentifier(node.tagName))
return ts.Debug.fail();
var intrinsicProp = getPropertyOfType(intrinsicElementsType, node.tagName.escapedText);
if (intrinsicProp) {
links.jsxFlags |= 1 /* IntrinsicNamedElement */;
return links.resolvedSymbol = intrinsicProp;
}
// Intrinsic string indexer case
var indexSignatureType = getIndexTypeOfType(intrinsicElementsType, stringType);
if (indexSignatureType) {
links.jsxFlags |= 2 /* IntrinsicIndexedElement */;
return links.resolvedSymbol = intrinsicElementsType.symbol;
}
// Wasn't found
error(node, ts.Diagnostics.Property_0_does_not_exist_on_type_1, ts.idText(node.tagName), "JSX." + JsxNames.IntrinsicElements);
return links.resolvedSymbol = unknownSymbol;
}
else {
if (noImplicitAny) {
error(node, ts.Diagnostics.JSX_element_implicitly_has_type_any_because_no_interface_JSX_0_exists, ts.unescapeLeadingUnderscores(JsxNames.IntrinsicElements));
}
return links.resolvedSymbol = unknownSymbol;
}
}
return links.resolvedSymbol;
}
function getJsxNamespaceContainerForImplicitImport(location) {
var file = location && ts.getSourceFileOfNode(location);
var links = file && getNodeLinks(file);
if (links && links.jsxImplicitImportContainer === false) {
return undefined;
}
if (links && links.jsxImplicitImportContainer) {
return links.jsxImplicitImportContainer;
}
var runtimeImportSpecifier = ts.getJSXRuntimeImport(ts.getJSXImplicitImportBase(compilerOptions, file), compilerOptions);
if (!runtimeImportSpecifier) {
return undefined;
}
var isClassic = ts.getEmitModuleResolutionKind(compilerOptions) === ts.ModuleResolutionKind.Classic;
var errorMessage = isClassic
? ts.Diagnostics.Cannot_find_module_0_Did_you_mean_to_set_the_moduleResolution_option_to_node_or_to_add_aliases_to_the_paths_option
: ts.Diagnostics.Cannot_find_module_0_or_its_corresponding_type_declarations;
var mod = resolveExternalModule(location, runtimeImportSpecifier, errorMessage, location);
var result = mod && mod !== unknownSymbol ? getMergedSymbol(resolveSymbol(mod)) : undefined;
if (links) {
links.jsxImplicitImportContainer = result || false;
}
return result;
}
function getJsxNamespaceAt(location) {
var links = location && getNodeLinks(location);
if (links && links.jsxNamespace) {
return links.jsxNamespace;
}
if (!links || links.jsxNamespace !== false) {
var resolvedNamespace = getJsxNamespaceContainerForImplicitImport(location);
if (!resolvedNamespace || resolvedNamespace === unknownSymbol) {
var namespaceName = getJsxNamespace(location);
resolvedNamespace = resolveName(location, namespaceName, 1920 /* Namespace */, /*diagnosticMessage*/ undefined, namespaceName, /*isUse*/ false);
}
if (resolvedNamespace) {
var candidate = resolveSymbol(getSymbol(getExportsOfSymbol(resolveSymbol(resolvedNamespace)), JsxNames.JSX, 1920 /* Namespace */));
if (candidate && candidate !== unknownSymbol) {
if (links) {
links.jsxNamespace = candidate;
}
return candidate;
}
}
if (links) {
links.jsxNamespace = false;
}
}
// JSX global fallback
var s = resolveSymbol(getGlobalSymbol(JsxNames.JSX, 1920 /* Namespace */, /*diagnosticMessage*/ undefined));
if (s === unknownSymbol) {
return undefined; // TODO: GH#18217
}
return s; // TODO: GH#18217
}
/**
* Look into JSX namespace and then look for container with matching name as nameOfAttribPropContainer.
* Get a single property from that container if existed. Report an error if there are more than one property.
*
* @param nameOfAttribPropContainer a string of value JsxNames.ElementAttributesPropertyNameContainer or JsxNames.ElementChildrenAttributeNameContainer
* if other string is given or the container doesn't exist, return undefined.
*/
function getNameFromJsxElementAttributesContainer(nameOfAttribPropContainer, jsxNamespace) {
// JSX.ElementAttributesProperty | JSX.ElementChildrenAttribute [symbol]
var jsxElementAttribPropInterfaceSym = jsxNamespace && getSymbol(jsxNamespace.exports, nameOfAttribPropContainer, 788968 /* Type */);
// JSX.ElementAttributesProperty | JSX.ElementChildrenAttribute [type]
var jsxElementAttribPropInterfaceType = jsxElementAttribPropInterfaceSym && getDeclaredTypeOfSymbol(jsxElementAttribPropInterfaceSym);
// The properties of JSX.ElementAttributesProperty | JSX.ElementChildrenAttribute
var propertiesOfJsxElementAttribPropInterface = jsxElementAttribPropInterfaceType && getPropertiesOfType(jsxElementAttribPropInterfaceType);
if (propertiesOfJsxElementAttribPropInterface) {
// Element Attributes has zero properties, so the element attributes type will be the class instance type
if (propertiesOfJsxElementAttribPropInterface.length === 0) {
return "";
}
// Element Attributes has one property, so the element attributes type will be the type of the corresponding
// property of the class instance type
else if (propertiesOfJsxElementAttribPropInterface.length === 1) {
return propertiesOfJsxElementAttribPropInterface[0].escapedName;
}
else if (propertiesOfJsxElementAttribPropInterface.length > 1 && jsxElementAttribPropInterfaceSym.declarations) {
// More than one property on ElementAttributesProperty is an error
error(jsxElementAttribPropInterfaceSym.declarations[0], ts.Diagnostics.The_global_type_JSX_0_may_not_have_more_than_one_property, ts.unescapeLeadingUnderscores(nameOfAttribPropContainer));
}
}
return undefined;
}
function getJsxLibraryManagedAttributes(jsxNamespace) {
// JSX.LibraryManagedAttributes [symbol]
return jsxNamespace && getSymbol(jsxNamespace.exports, JsxNames.LibraryManagedAttributes, 788968 /* Type */);
}
/// e.g. "props" for React.d.ts,
/// or 'undefined' if ElementAttributesProperty doesn't exist (which means all
/// non-intrinsic elements' attributes type is 'any'),
/// or '' if it has 0 properties (which means every
/// non-intrinsic elements' attributes type is the element instance type)
function getJsxElementPropertiesName(jsxNamespace) {
return getNameFromJsxElementAttributesContainer(JsxNames.ElementAttributesPropertyNameContainer, jsxNamespace);
}
function getJsxElementChildrenPropertyName(jsxNamespace) {
return getNameFromJsxElementAttributesContainer(JsxNames.ElementChildrenAttributeNameContainer, jsxNamespace);
}
function getUninstantiatedJsxSignaturesOfType(elementType, caller) {
if (elementType.flags & 4 /* String */) {
return [anySignature];
}
else if (elementType.flags & 128 /* StringLiteral */) {
var intrinsicType = getIntrinsicAttributesTypeFromStringLiteralType(elementType, caller);
if (!intrinsicType) {
error(caller, ts.Diagnostics.Property_0_does_not_exist_on_type_1, elementType.value, "JSX." + JsxNames.IntrinsicElements);
return ts.emptyArray;
}
else {
var fakeSignature = createSignatureForJSXIntrinsic(caller, intrinsicType);
return [fakeSignature];
}
}
var apparentElemType = getApparentType(elementType);
// Resolve the signatures, preferring constructor
var signatures = getSignaturesOfType(apparentElemType, 1 /* Construct */);
if (signatures.length === 0) {
// No construct signatures, try call signatures
signatures = getSignaturesOfType(apparentElemType, 0 /* Call */);
}
if (signatures.length === 0 && apparentElemType.flags & 1048576 /* Union */) {
// If each member has some combination of new/call signatures; make a union signature list for those
signatures = getUnionSignatures(ts.map(apparentElemType.types, function (t) { return getUninstantiatedJsxSignaturesOfType(t, caller); }));
}
return signatures;
}
function getIntrinsicAttributesTypeFromStringLiteralType(type, location) {
// If the elemType is a stringLiteral type, we can then provide a check to make sure that the string literal type is one of the Jsx intrinsic element type
// For example:
// var CustomTag: "h1" = "h1";
// <CustomTag> Hello World </CustomTag>
var intrinsicElementsType = getJsxType(JsxNames.IntrinsicElements, location);
if (intrinsicElementsType !== errorType) {
var stringLiteralTypeName = type.value;
var intrinsicProp = getPropertyOfType(intrinsicElementsType, ts.escapeLeadingUnderscores(stringLiteralTypeName));
if (intrinsicProp) {
return getTypeOfSymbol(intrinsicProp);
}
var indexSignatureType = getIndexTypeOfType(intrinsicElementsType, stringType);
if (indexSignatureType) {
return indexSignatureType;
}
return undefined;
}
// If we need to report an error, we already done so here. So just return any to prevent any more error downstream
return anyType;
}
function checkJsxReturnAssignableToAppropriateBound(refKind, elemInstanceType, openingLikeElement) {
if (refKind === 1 /* Function */) {
var sfcReturnConstraint = getJsxStatelessElementTypeAt(openingLikeElement);
if (sfcReturnConstraint) {
checkTypeRelatedTo(elemInstanceType, sfcReturnConstraint, assignableRelation, openingLikeElement.tagName, ts.Diagnostics.Its_return_type_0_is_not_a_valid_JSX_element, generateInitialErrorChain);
}
}
else if (refKind === 0 /* Component */) {
var classConstraint = getJsxElementClassTypeAt(openingLikeElement);
if (classConstraint) {
// Issue an error if this return type isn't assignable to JSX.ElementClass, failing that
checkTypeRelatedTo(elemInstanceType, classConstraint, assignableRelation, openingLikeElement.tagName, ts.Diagnostics.Its_instance_type_0_is_not_a_valid_JSX_element, generateInitialErrorChain);
}
}
else { // Mixed
var sfcReturnConstraint = getJsxStatelessElementTypeAt(openingLikeElement);
var classConstraint = getJsxElementClassTypeAt(openingLikeElement);
if (!sfcReturnConstraint || !classConstraint) {
return;
}
var combined = getUnionType([sfcReturnConstraint, classConstraint]);
checkTypeRelatedTo(elemInstanceType, combined, assignableRelation, openingLikeElement.tagName, ts.Diagnostics.Its_element_type_0_is_not_a_valid_JSX_element, generateInitialErrorChain);
}
function generateInitialErrorChain() {
var componentName = ts.getTextOfNode(openingLikeElement.tagName);
return ts.chainDiagnosticMessages(/* details */ undefined, ts.Diagnostics._0_cannot_be_used_as_a_JSX_component, componentName);
}
}
/**
* Get attributes type of the given intrinsic opening-like Jsx element by resolving the tag name.
* The function is intended to be called from a function which has checked that the opening element is an intrinsic element.
* @param node an intrinsic JSX opening-like element
*/
function getIntrinsicAttributesTypeFromJsxOpeningLikeElement(node) {
ts.Debug.assert(isJsxIntrinsicIdentifier(node.tagName));
var links = getNodeLinks(node);
if (!links.resolvedJsxElementAttributesType) {
var symbol = getIntrinsicTagSymbol(node);
if (links.jsxFlags & 1 /* IntrinsicNamedElement */) {
return links.resolvedJsxElementAttributesType = getTypeOfSymbol(symbol) || errorType;
}
else if (links.jsxFlags & 2 /* IntrinsicIndexedElement */) {
return links.resolvedJsxElementAttributesType =
getIndexTypeOfType(getJsxType(JsxNames.IntrinsicElements, node), stringType) || errorType;
}
else {
return links.resolvedJsxElementAttributesType = errorType;
}
}
return links.resolvedJsxElementAttributesType;
}
function getJsxElementClassTypeAt(location) {
var type = getJsxType(JsxNames.ElementClass, location);
if (type === errorType)
return undefined;
return type;
}
function getJsxElementTypeAt(location) {
return getJsxType(JsxNames.Element, location);
}
function getJsxStatelessElementTypeAt(location) {
var jsxElementType = getJsxElementTypeAt(location);
if (jsxElementType) {
return getUnionType([jsxElementType, nullType]);
}
}
/**
* Returns all the properties of the Jsx.IntrinsicElements interface
*/
function getJsxIntrinsicTagNamesAt(location) {
var intrinsics = getJsxType(JsxNames.IntrinsicElements, location);
return intrinsics ? getPropertiesOfType(intrinsics) : ts.emptyArray;
}
function checkJsxPreconditions(errorNode) {
// Preconditions for using JSX
if ((compilerOptions.jsx || 0 /* None */) === 0 /* None */) {
error(errorNode, ts.Diagnostics.Cannot_use_JSX_unless_the_jsx_flag_is_provided);
}
if (getJsxElementTypeAt(errorNode) === undefined) {
if (noImplicitAny) {
error(errorNode, ts.Diagnostics.JSX_element_implicitly_has_type_any_because_the_global_type_JSX_Element_does_not_exist);
}
}
}
function checkJsxOpeningLikeElementOrOpeningFragment(node) {
var isNodeOpeningLikeElement = ts.isJsxOpeningLikeElement(node);
if (isNodeOpeningLikeElement) {
checkGrammarJsxElement(node);
}
checkJsxPreconditions(node);
if (!getJsxNamespaceContainerForImplicitImport(node)) {
// The reactNamespace/jsxFactory's root symbol should be marked as 'used' so we don't incorrectly elide its import.
// And if there is no reactNamespace/jsxFactory's symbol in scope when targeting React emit, we should issue an error.
var jsxFactoryRefErr = diagnostics && compilerOptions.jsx === 2 /* React */ ? ts.Diagnostics.Cannot_find_name_0 : undefined;
var jsxFactoryNamespace = getJsxNamespace(node);
var jsxFactoryLocation = isNodeOpeningLikeElement ? node.tagName : node;
// allow null as jsxFragmentFactory
var jsxFactorySym = void 0;
if (!(ts.isJsxOpeningFragment(node) && jsxFactoryNamespace === "null")) {
jsxFactorySym = resolveName(jsxFactoryLocation, jsxFactoryNamespace, 111551 /* Value */, jsxFactoryRefErr, jsxFactoryNamespace, /*isUse*/ true);
}
if (jsxFactorySym) {
// Mark local symbol as referenced here because it might not have been marked
// if jsx emit was not jsxFactory as there wont be error being emitted
jsxFactorySym.isReferenced = 67108863 /* All */;
// If react/jsxFactory symbol is alias, mark it as refereced
if (jsxFactorySym.flags & 2097152 /* Alias */ && !getTypeOnlyAliasDeclaration(jsxFactorySym)) {
markAliasSymbolAsReferenced(jsxFactorySym);
}
}
}
if (isNodeOpeningLikeElement) {
var jsxOpeningLikeNode = node;
var sig = getResolvedSignature(jsxOpeningLikeNode);
checkDeprecatedSignature(sig, node);
checkJsxReturnAssignableToAppropriateBound(getJsxReferenceKind(jsxOpeningLikeNode), getReturnTypeOfSignature(sig), jsxOpeningLikeNode);
}
}
/**
* Check if a property with the given name is known anywhere in the given type. In an object type, a property
* is considered known if
* 1. the object type is empty and the check is for assignability, or
* 2. if the object type has index signatures, or
* 3. if the property is actually declared in the object type
* (this means that 'toString', for example, is not usually a known property).
* 4. In a union or intersection type,
* a property is considered known if it is known in any constituent type.
* @param targetType a type to search a given name in
* @param name a property name to search
* @param isComparingJsxAttributes a boolean flag indicating whether we are searching in JsxAttributesType
*/
function isKnownProperty(targetType, name, isComparingJsxAttributes) {
if (targetType.flags & 524288 /* Object */) {
// For backwards compatibility a symbol-named property is satisfied by a string index signature. This
// is incorrect and inconsistent with element access expressions, where it is an error, so eventually
// we should remove this exception.
if (getPropertyOfObjectType(targetType, name) ||
getApplicableIndexInfoForName(targetType, name) ||
isLateBoundName(name) && getIndexInfoOfType(targetType, stringType) ||
isComparingJsxAttributes && isHyphenatedJsxName(name)) {
// For JSXAttributes, if the attribute has a hyphenated name, consider that the attribute to be known.
return true;
}
}
else if (targetType.flags & 3145728 /* UnionOrIntersection */ && isExcessPropertyCheckTarget(targetType)) {
for (var _i = 0, _a = targetType.types; _i < _a.length; _i++) {
var t = _a[_i];
if (isKnownProperty(t, name, isComparingJsxAttributes)) {
return true;
}
}
}
return false;
}
function isExcessPropertyCheckTarget(type) {
return !!(type.flags & 524288 /* Object */ && !(ts.getObjectFlags(type) & 512 /* ObjectLiteralPatternWithComputedProperties */) ||
type.flags & 67108864 /* NonPrimitive */ ||
type.flags & 1048576 /* Union */ && ts.some(type.types, isExcessPropertyCheckTarget) ||
type.flags & 2097152 /* Intersection */ && ts.every(type.types, isExcessPropertyCheckTarget));
}
function checkJsxExpression(node, checkMode) {
checkGrammarJsxExpression(node);
if (node.expression) {
var type = checkExpression(node.expression, checkMode);
if (node.dotDotDotToken && type !== anyType && !isArrayType(type)) {
error(node, ts.Diagnostics.JSX_spread_child_must_be_an_array_type);
}
return type;
}
else {
return errorType;
}
}
function getDeclarationNodeFlagsFromSymbol(s) {
return s.valueDeclaration ? ts.getCombinedNodeFlags(s.valueDeclaration) : 0;
}
/**
* Return whether this symbol is a member of a prototype somewhere
* Note that this is not tracked well within the compiler, so the answer may be incorrect.
*/
function isPrototypeProperty(symbol) {
if (symbol.flags & 8192 /* Method */ || ts.getCheckFlags(symbol) & 4 /* SyntheticMethod */) {
return true;
}
if (ts.isInJSFile(symbol.valueDeclaration)) {
var parent = symbol.valueDeclaration.parent;
return parent && ts.isBinaryExpression(parent) &&
ts.getAssignmentDeclarationKind(parent) === 3 /* PrototypeProperty */;
}
}
/**
* Check whether the requested property access is valid.
* Returns true if node is a valid property access, and false otherwise.
* @param node The node to be checked.
* @param isSuper True if the access is from `super.`.
* @param type The type of the object whose property is being accessed. (Not the type of the property.)
* @param prop The symbol for the property being accessed.
*/
function checkPropertyAccessibility(node, isSuper, writing, type, prop, reportError) {
if (reportError === void 0) { reportError = true; }
var flags = ts.getDeclarationModifierFlagsFromSymbol(prop, writing);
var errorNode = node.kind === 159 /* QualifiedName */ ? node.right :
node.kind === 198 /* ImportType */ ? node :
node.kind === 201 /* BindingElement */ && node.propertyName ? node.propertyName : node.name;
if (isSuper) {
// TS 1.0 spec (April 2014): 4.8.2
// - In a constructor, instance member function, instance member accessor, or
// instance member variable initializer where this references a derived class instance,
// a super property access is permitted and must specify a public instance member function of the base class.
// - In a static member function or static member accessor
// where this references the constructor function object of a derived class,
// a super property access is permitted and must specify a public static member function of the base class.
if (languageVersion < 2 /* ES2015 */) {
if (symbolHasNonMethodDeclaration(prop)) {
if (reportError) {
error(errorNode, ts.Diagnostics.Only_public_and_protected_methods_of_the_base_class_are_accessible_via_the_super_keyword);
}
return false;
}
}
if (flags & 128 /* Abstract */) {
// A method cannot be accessed in a super property access if the method is abstract.
// This error could mask a private property access error. But, a member
// cannot simultaneously be private and abstract, so this will trigger an
// additional error elsewhere.
if (reportError) {
error(errorNode, ts.Diagnostics.Abstract_method_0_in_class_1_cannot_be_accessed_via_super_expression, symbolToString(prop), typeToString(getDeclaringClass(prop)));
}
return false;
}
}
// Referencing abstract properties within their own constructors is not allowed
if ((flags & 128 /* Abstract */) && symbolHasNonMethodDeclaration(prop) &&
(ts.isThisProperty(node) || ts.isThisInitializedObjectBindingExpression(node) || ts.isObjectBindingPattern(node.parent) && ts.isThisInitializedDeclaration(node.parent.parent))) {
var declaringClassDeclaration = ts.getClassLikeDeclarationOfSymbol(getParentOfSymbol(prop));
if (declaringClassDeclaration && isNodeUsedDuringClassInitialization(node)) {
if (reportError) {
error(errorNode, ts.Diagnostics.Abstract_property_0_in_class_1_cannot_be_accessed_in_the_constructor, symbolToString(prop), ts.getTextOfIdentifierOrLiteral(declaringClassDeclaration.name)); // TODO: GH#18217
}
return false;
}
}
// Public properties are otherwise accessible.
if (!(flags & 24 /* NonPublicAccessibilityModifier */)) {
return true;
}
// Property is known to be private or protected at this point
// Private property is accessible if the property is within the declaring class
if (flags & 8 /* Private */) {
var declaringClassDeclaration = ts.getClassLikeDeclarationOfSymbol(getParentOfSymbol(prop));
if (!isNodeWithinClass(node, declaringClassDeclaration)) {
if (reportError) {
error(errorNode, ts.Diagnostics.Property_0_is_private_and_only_accessible_within_class_1, symbolToString(prop), typeToString(getDeclaringClass(prop)));
}
return false;
}
return true;
}
// Property is known to be protected at this point
// All protected properties of a supertype are accessible in a super access
if (isSuper) {
return true;
}
// Find the first enclosing class that has the declaring classes of the protected constituents
// of the property as base classes
var enclosingClass = forEachEnclosingClass(node, function (enclosingDeclaration) {
var enclosingClass = getDeclaredTypeOfSymbol(getSymbolOfNode(enclosingDeclaration));
return isClassDerivedFromDeclaringClasses(enclosingClass, prop, writing) ? enclosingClass : undefined;
});
// A protected property is accessible if the property is within the declaring class or classes derived from it
if (!enclosingClass) {
// allow PropertyAccessibility if context is in function with this parameter
// static member access is disallow
var thisParameter = void 0;
if (flags & 32 /* Static */ || !(thisParameter = getThisParameterFromNodeContext(node)) || !thisParameter.type) {
if (reportError) {
error(errorNode, ts.Diagnostics.Property_0_is_protected_and_only_accessible_within_class_1_and_its_subclasses, symbolToString(prop), typeToString(getDeclaringClass(prop) || type));
}
return false;
}
var thisType = getTypeFromTypeNode(thisParameter.type);
enclosingClass = ((thisType.flags & 262144 /* TypeParameter */) ? getConstraintOfTypeParameter(thisType) : thisType).target;
}
// No further restrictions for static properties
if (flags & 32 /* Static */) {
return true;
}
if (type.flags & 262144 /* TypeParameter */) {
// get the original type -- represented as the type constraint of the 'this' type
type = type.isThisType ? getConstraintOfTypeParameter(type) : getBaseConstraintOfType(type); // TODO: GH#18217 Use a different variable that's allowed to be undefined
}
if (!type || !hasBaseType(type, enclosingClass)) {
if (reportError) {
error(errorNode, ts.Diagnostics.Property_0_is_protected_and_only_accessible_through_an_instance_of_class_1_This_is_an_instance_of_class_2, symbolToString(prop), typeToString(enclosingClass), typeToString(type));
}
return false;
}
return true;
}
function getThisParameterFromNodeContext(node) {
var thisContainer = ts.getThisContainer(node, /* includeArrowFunctions */ false);
return thisContainer && ts.isFunctionLike(thisContainer) ? ts.getThisParameter(thisContainer) : undefined;
}
function symbolHasNonMethodDeclaration(symbol) {
return !!forEachProperty(symbol, function (prop) { return !(prop.flags & 8192 /* Method */); });
}
function checkNonNullExpression(node) {
return checkNonNullType(checkExpression(node), node);
}
function isNullableType(type) {
return !!((strictNullChecks ? getFalsyFlags(type) : type.flags) & 98304 /* Nullable */);
}
function getNonNullableTypeIfNeeded(type) {
return isNullableType(type) ? getNonNullableType(type) : type;
}
function reportObjectPossiblyNullOrUndefinedError(node, flags) {
error(node, flags & 32768 /* Undefined */ ? flags & 65536 /* Null */ ?
ts.Diagnostics.Object_is_possibly_null_or_undefined :
ts.Diagnostics.Object_is_possibly_undefined :
ts.Diagnostics.Object_is_possibly_null);
}
function reportCannotInvokePossiblyNullOrUndefinedError(node, flags) {
error(node, flags & 32768 /* Undefined */ ? flags & 65536 /* Null */ ?
ts.Diagnostics.Cannot_invoke_an_object_which_is_possibly_null_or_undefined :
ts.Diagnostics.Cannot_invoke_an_object_which_is_possibly_undefined :
ts.Diagnostics.Cannot_invoke_an_object_which_is_possibly_null);
}
function checkNonNullTypeWithReporter(type, node, reportError) {
if (strictNullChecks && type.flags & 2 /* Unknown */) {
error(node, ts.Diagnostics.Object_is_of_type_unknown);
return errorType;
}
var kind = (strictNullChecks ? getFalsyFlags(type) : type.flags) & 98304 /* Nullable */;
if (kind) {
reportError(node, kind);
var t = getNonNullableType(type);
return t.flags & (98304 /* Nullable */ | 131072 /* Never */) ? errorType : t;
}
return type;
}
function checkNonNullType(type, node) {
return checkNonNullTypeWithReporter(type, node, reportObjectPossiblyNullOrUndefinedError);
}
function checkNonNullNonVoidType(type, node) {
var nonNullType = checkNonNullType(type, node);
if (nonNullType !== errorType && nonNullType.flags & 16384 /* Void */) {
error(node, ts.Diagnostics.Object_is_possibly_undefined);
}
return nonNullType;
}
function checkPropertyAccessExpression(node, checkMode) {
return node.flags & 32 /* OptionalChain */ ? checkPropertyAccessChain(node, checkMode) :
checkPropertyAccessExpressionOrQualifiedName(node, node.expression, checkNonNullExpression(node.expression), node.name, checkMode);
}
function checkPropertyAccessChain(node, checkMode) {
var leftType = checkExpression(node.expression);
var nonOptionalType = getOptionalExpressionType(leftType, node.expression);
return propagateOptionalTypeMarker(checkPropertyAccessExpressionOrQualifiedName(node, node.expression, checkNonNullType(nonOptionalType, node.expression), node.name, checkMode), node, nonOptionalType !== leftType);
}
function checkQualifiedName(node, checkMode) {
var leftType = ts.isPartOfTypeQuery(node) && ts.isThisIdentifier(node.left) ? checkNonNullType(checkThisExpression(node.left), node.left) : checkNonNullExpression(node.left);
return checkPropertyAccessExpressionOrQualifiedName(node, node.left, leftType, node.right, checkMode);
}
function isMethodAccessForCall(node) {
while (node.parent.kind === 210 /* ParenthesizedExpression */) {
node = node.parent;
}
return ts.isCallOrNewExpression(node.parent) && node.parent.expression === node;
}
// Lookup the private identifier lexically.
function lookupSymbolForPrivateIdentifierDeclaration(propName, location) {
for (var containingClass = ts.getContainingClass(location); !!containingClass; containingClass = ts.getContainingClass(containingClass)) {
var symbol = containingClass.symbol;
var name = ts.getSymbolNameForPrivateIdentifier(symbol, propName);
var prop = (symbol.members && symbol.members.get(name)) || (symbol.exports && symbol.exports.get(name));
if (prop) {
return prop;
}
}
}
function getPrivateIdentifierPropertyOfType(leftType, lexicallyScopedIdentifier) {
return getPropertyOfType(leftType, lexicallyScopedIdentifier.escapedName);
}
function checkPrivateIdentifierPropertyAccess(leftType, right, lexicallyScopedIdentifier) {
// Either the identifier could not be looked up in the lexical scope OR the lexically scoped identifier did not exist on the type.
// Find a private identifier with the same description on the type.
var propertyOnType;
var properties = getPropertiesOfType(leftType);
if (properties) {
ts.forEach(properties, function (symbol) {
var decl = symbol.valueDeclaration;
if (decl && ts.isNamedDeclaration(decl) && ts.isPrivateIdentifier(decl.name) && decl.name.escapedText === right.escapedText) {
propertyOnType = symbol;
return true;
}
});
}
var diagName = diagnosticName(right);
if (propertyOnType) {
var typeValueDecl = ts.Debug.checkDefined(propertyOnType.valueDeclaration);
var typeClass_1 = ts.Debug.checkDefined(ts.getContainingClass(typeValueDecl));
// We found a private identifier property with the same description.
// Either:
// - There is a lexically scoped private identifier AND it shadows the one we found on the type.
// - It is an attempt to access the private identifier outside of the class.
if (lexicallyScopedIdentifier === null || lexicallyScopedIdentifier === void 0 ? void 0 : lexicallyScopedIdentifier.valueDeclaration) {
var lexicalValueDecl = lexicallyScopedIdentifier.valueDeclaration;
var lexicalClass = ts.getContainingClass(lexicalValueDecl);
ts.Debug.assert(!!lexicalClass);
if (ts.findAncestor(lexicalClass, function (n) { return typeClass_1 === n; })) {
var diagnostic = error(right, ts.Diagnostics.The_property_0_cannot_be_accessed_on_type_1_within_this_class_because_it_is_shadowed_by_another_private_identifier_with_the_same_spelling, diagName, typeToString(leftType));
ts.addRelatedInfo(diagnostic, ts.createDiagnosticForNode(lexicalValueDecl, ts.Diagnostics.The_shadowing_declaration_of_0_is_defined_here, diagName), ts.createDiagnosticForNode(typeValueDecl, ts.Diagnostics.The_declaration_of_0_that_you_probably_intended_to_use_is_defined_here, diagName));
return true;
}
}
error(right, ts.Diagnostics.Property_0_is_not_accessible_outside_class_1_because_it_has_a_private_identifier, diagName, diagnosticName(typeClass_1.name || anon));
return true;
}
return false;
}
function isThisPropertyAccessInConstructor(node, prop) {
return (isConstructorDeclaredProperty(prop) || ts.isThisProperty(node) && isAutoTypedProperty(prop))
&& ts.getThisContainer(node, /*includeArrowFunctions*/ true) === getDeclaringConstructor(prop);
}
function checkPropertyAccessExpressionOrQualifiedName(node, left, leftType, right, checkMode) {
var parentSymbol = getNodeLinks(left).resolvedSymbol;
var assignmentKind = ts.getAssignmentTargetKind(node);
var apparentType = getApparentType(assignmentKind !== 0 /* None */ || isMethodAccessForCall(node) ? getWidenedType(leftType) : leftType);
var isAnyLike = isTypeAny(apparentType) || apparentType === silentNeverType;
var prop;
if (ts.isPrivateIdentifier(right)) {
if (languageVersion < 99 /* ESNext */) {
if (assignmentKind !== 0 /* None */) {
checkExternalEmitHelpers(node, 1048576 /* ClassPrivateFieldSet */);
}
if (assignmentKind !== 1 /* Definite */) {
checkExternalEmitHelpers(node, 524288 /* ClassPrivateFieldGet */);
}
}
var lexicallyScopedSymbol = lookupSymbolForPrivateIdentifierDeclaration(right.escapedText, right);
if (assignmentKind && lexicallyScopedSymbol && lexicallyScopedSymbol.valueDeclaration && ts.isMethodDeclaration(lexicallyScopedSymbol.valueDeclaration)) {
grammarErrorOnNode(right, ts.Diagnostics.Cannot_assign_to_private_method_0_Private_methods_are_not_writable, ts.idText(right));
}
if ((lexicallyScopedSymbol === null || lexicallyScopedSymbol === void 0 ? void 0 : lexicallyScopedSymbol.valueDeclaration) && (compilerOptions.target === 99 /* ESNext */ && !useDefineForClassFields)) {
var lexicalClass_1 = ts.getContainingClass(lexicallyScopedSymbol.valueDeclaration);
var parentStaticFieldInitializer = ts.findAncestor(node, function (n) {
if (n === lexicalClass_1)
return "quit";
if (ts.isPropertyDeclaration(n.parent) && ts.hasStaticModifier(n.parent) && n.parent.initializer === n && n.parent.parent === lexicalClass_1) {
return true;
}
return false;
});
if (parentStaticFieldInitializer) {
var parentStaticFieldInitializerSymbol = getSymbolOfNode(parentStaticFieldInitializer.parent);
ts.Debug.assert(parentStaticFieldInitializerSymbol, "Initializer without declaration symbol");
var diagnostic = error(node, ts.Diagnostics.Property_0_may_not_be_used_in_a_static_property_s_initializer_in_the_same_class_when_target_is_esnext_and_useDefineForClassFields_is_false, ts.symbolName(lexicallyScopedSymbol));
ts.addRelatedInfo(diagnostic, ts.createDiagnosticForNode(parentStaticFieldInitializer.parent, ts.Diagnostics.Initializer_for_property_0, ts.symbolName(parentStaticFieldInitializerSymbol)));
}
}
if (isAnyLike) {
if (lexicallyScopedSymbol) {
return apparentType;
}
if (!ts.getContainingClass(right)) {
grammarErrorOnNode(right, ts.Diagnostics.Private_identifiers_are_not_allowed_outside_class_bodies);
return anyType;
}
}
prop = lexicallyScopedSymbol ? getPrivateIdentifierPropertyOfType(leftType, lexicallyScopedSymbol) : undefined;
// Check for private-identifier-specific shadowing and lexical-scoping errors.
if (!prop && checkPrivateIdentifierPropertyAccess(leftType, right, lexicallyScopedSymbol)) {
return errorType;
}
else {
var isSetonlyAccessor = prop && prop.flags & 65536 /* SetAccessor */ && !(prop.flags & 32768 /* GetAccessor */);
if (isSetonlyAccessor && assignmentKind !== 1 /* Definite */) {
error(node, ts.Diagnostics.Private_accessor_was_defined_without_a_getter);
}
}
}
else {
if (isAnyLike) {
if (ts.isIdentifier(left) && parentSymbol) {
markAliasReferenced(parentSymbol, node);
}
return apparentType;
}
prop = getPropertyOfType(apparentType, right.escapedText);
}
// In `Foo.Bar.Baz`, 'Foo' is not referenced if 'Bar' is a const enum or a module containing only const enums.
// The exceptions are:
// 1. if 'isolatedModules' is enabled, because the const enum value will not be inlined, and
// 2. if 'preserveConstEnums' is enabled and the expression is itself an export, e.g. `export = Foo.Bar.Baz`.
if (ts.isIdentifier(left) && parentSymbol && (compilerOptions.isolatedModules || !(prop && isConstEnumOrConstEnumOnlyModule(prop)) || ts.shouldPreserveConstEnums(compilerOptions) && isExportOrExportExpression(node))) {
markAliasReferenced(parentSymbol, node);
}
var propType;
if (!prop) {
var indexInfo = !ts.isPrivateIdentifier(right) && (assignmentKind === 0 /* None */ || !isGenericObjectType(leftType) || isThisTypeParameter(leftType)) ?
getApplicableIndexInfoForName(apparentType, right.escapedText) : undefined;
if (!(indexInfo && indexInfo.type)) {
var isUncheckedJS = isUncheckedJSSuggestion(node, leftType.symbol, /*excludeClasses*/ true);
if (!isUncheckedJS && isJSLiteralType(leftType)) {
return anyType;
}
if (leftType.symbol === globalThisSymbol) {
if (globalThisSymbol.exports.has(right.escapedText) && (globalThisSymbol.exports.get(right.escapedText).flags & 418 /* BlockScoped */)) {
error(right, ts.Diagnostics.Property_0_does_not_exist_on_type_1, ts.unescapeLeadingUnderscores(right.escapedText), typeToString(leftType));
}
else if (noImplicitAny) {
error(right, ts.Diagnostics.Element_implicitly_has_an_any_type_because_type_0_has_no_index_signature, typeToString(leftType));
}
return anyType;
}
if (right.escapedText && !checkAndReportErrorForExtendingInterface(node)) {
reportNonexistentProperty(right, isThisTypeParameter(leftType) ? apparentType : leftType, isUncheckedJS);
}
return errorType;
}
if (indexInfo.isReadonly && (ts.isAssignmentTarget(node) || ts.isDeleteTarget(node))) {
error(node, ts.Diagnostics.Index_signature_in_type_0_only_permits_reading, typeToString(apparentType));
}
propType = (compilerOptions.noUncheckedIndexedAccess && !ts.isAssignmentTarget(node)) ? getUnionType([indexInfo.type, undefinedType]) : indexInfo.type;
if (compilerOptions.noPropertyAccessFromIndexSignature && ts.isPropertyAccessExpression(node)) {
error(right, ts.Diagnostics.Property_0_comes_from_an_index_signature_so_it_must_be_accessed_with_0, ts.unescapeLeadingUnderscores(right.escapedText));
}
}
else {
if (prop.declarations && getDeclarationNodeFlagsFromSymbol(prop) & 134217728 /* Deprecated */ && isUncalledFunctionReference(node, prop)) {
addDeprecatedSuggestion(right, prop.declarations, right.escapedText);
}
checkPropertyNotUsedBeforeDeclaration(prop, node, right);
markPropertyAsReferenced(prop, node, isSelfTypeAccess(left, parentSymbol));
getNodeLinks(node).resolvedSymbol = prop;
var writing = ts.isWriteAccess(node);
checkPropertyAccessibility(node, left.kind === 106 /* SuperKeyword */, writing, apparentType, prop);
if (isAssignmentToReadonlyEntity(node, prop, assignmentKind)) {
error(right, ts.Diagnostics.Cannot_assign_to_0_because_it_is_a_read_only_property, ts.idText(right));
return errorType;
}
propType = isThisPropertyAccessInConstructor(node, prop) ? autoType : writing ? getSetAccessorTypeOfSymbol(prop) : getTypeOfSymbol(prop);
}
return getFlowTypeOfAccessExpression(node, prop, propType, right, checkMode);
}
/**
* Determines whether a did-you-mean error should be a suggestion in an unchecked JS file.
* Only applies to unchecked JS files without checkJS, // @ts-check or // @ts-nocheck
* It does not suggest when the suggestion:
* - Is from a global file that is different from the reference file, or
* - (optionally) Is a class, or is a this.x property access expression
*/
function isUncheckedJSSuggestion(node, suggestion, excludeClasses) {
var file = ts.getSourceFileOfNode(node);
if (file) {
if (compilerOptions.checkJs === undefined && file.checkJsDirective === undefined && (file.scriptKind === 1 /* JS */ || file.scriptKind === 2 /* JSX */)) {
var declarationFile = ts.forEach(suggestion === null || suggestion === void 0 ? void 0 : suggestion.declarations, ts.getSourceFileOfNode);
return !(file !== declarationFile && !!declarationFile && isGlobalSourceFile(declarationFile))
&& !(excludeClasses && suggestion && suggestion.flags & 32 /* Class */)
&& !(!!node && excludeClasses && ts.isPropertyAccessExpression(node) && node.expression.kind === 108 /* ThisKeyword */);
}
}
return false;
}
function getFlowTypeOfAccessExpression(node, prop, propType, errorNode, checkMode) {
// Only compute control flow type if this is a property access expression that isn't an
// assignment target, and the referenced property was declared as a variable, property,
// accessor, or optional method.
var assignmentKind = ts.getAssignmentTargetKind(node);
if (assignmentKind === 1 /* Definite */) {
return removeMissingType(propType, !!(prop && prop.flags & 16777216 /* Optional */));
}
if (prop &&
!(prop.flags & (3 /* Variable */ | 4 /* Property */ | 98304 /* Accessor */))
&& !(prop.flags & 8192 /* Method */ && propType.flags & 1048576 /* Union */)
&& !isDuplicatedCommonJSExport(prop.declarations)) {
return propType;
}
if (propType === autoType) {
return getFlowTypeOfProperty(node, prop);
}
propType = getNarrowableTypeForReference(propType, node, checkMode);
// If strict null checks and strict property initialization checks are enabled, if we have
// a this.xxx property access, if the property is an instance property without an initializer,
// and if we are in a constructor of the same class as the property declaration, assume that
// the property is uninitialized at the top of the control flow.
var assumeUninitialized = false;
if (strictNullChecks && strictPropertyInitialization && ts.isAccessExpression(node) && node.expression.kind === 108 /* ThisKeyword */) {
var declaration = prop && prop.valueDeclaration;
if (declaration && isPropertyWithoutInitializer(declaration)) {
if (!ts.isStatic(declaration)) {
var flowContainer = getControlFlowContainer(node);
if (flowContainer.kind === 169 /* Constructor */ && flowContainer.parent === declaration.parent && !(declaration.flags & 8388608 /* Ambient */)) {
assumeUninitialized = true;
}
}
}
}
else if (strictNullChecks && prop && prop.valueDeclaration &&
ts.isPropertyAccessExpression(prop.valueDeclaration) &&
ts.getAssignmentDeclarationPropertyAccessKind(prop.valueDeclaration) &&
getControlFlowContainer(node) === getControlFlowContainer(prop.valueDeclaration)) {
assumeUninitialized = true;
}
var flowType = getFlowTypeOfReference(node, propType, assumeUninitialized ? getOptionalType(propType) : propType);
if (assumeUninitialized && !(getFalsyFlags(propType) & 32768 /* Undefined */) && getFalsyFlags(flowType) & 32768 /* Undefined */) {
error(errorNode, ts.Diagnostics.Property_0_is_used_before_being_assigned, symbolToString(prop)); // TODO: GH#18217
// Return the declared type to reduce follow-on errors
return propType;
}
return assignmentKind ? getBaseTypeOfLiteralType(flowType) : flowType;
}
function checkPropertyNotUsedBeforeDeclaration(prop, node, right) {
var valueDeclaration = prop.valueDeclaration;
if (!valueDeclaration || ts.getSourceFileOfNode(node).isDeclarationFile) {
return;
}
var diagnosticMessage;
var declarationName = ts.idText(right);
if (isInPropertyInitializerOrClassStaticBlock(node)
&& !isOptionalPropertyDeclaration(valueDeclaration)
&& !(ts.isAccessExpression(node) && ts.isAccessExpression(node.expression))
&& !isBlockScopedNameDeclaredBeforeUse(valueDeclaration, right)
&& (compilerOptions.useDefineForClassFields || !isPropertyDeclaredInAncestorClass(prop))) {
diagnosticMessage = error(right, ts.Diagnostics.Property_0_is_used_before_its_initialization, declarationName);
}
else if (valueDeclaration.kind === 255 /* ClassDeclaration */ &&
node.parent.kind !== 176 /* TypeReference */ &&
!(valueDeclaration.flags & 8388608 /* Ambient */) &&
!isBlockScopedNameDeclaredBeforeUse(valueDeclaration, right)) {
diagnosticMessage = error(right, ts.Diagnostics.Class_0_used_before_its_declaration, declarationName);
}
if (diagnosticMessage) {
ts.addRelatedInfo(diagnosticMessage, ts.createDiagnosticForNode(valueDeclaration, ts.Diagnostics._0_is_declared_here, declarationName));
}
}
function isInPropertyInitializerOrClassStaticBlock(node) {
return !!ts.findAncestor(node, function (node) {
switch (node.kind) {
case 165 /* PropertyDeclaration */:
return true;
case 291 /* PropertyAssignment */:
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 293 /* SpreadAssignment */:
case 160 /* ComputedPropertyName */:
case 231 /* TemplateSpan */:
case 286 /* JsxExpression */:
case 283 /* JsxAttribute */:
case 284 /* JsxAttributes */:
case 285 /* JsxSpreadAttribute */:
case 278 /* JsxOpeningElement */:
case 226 /* ExpressionWithTypeArguments */:
case 289 /* HeritageClause */:
return false;
case 212 /* ArrowFunction */:
case 236 /* ExpressionStatement */:
return ts.isBlock(node.parent) && ts.isClassStaticBlockDeclaration(node.parent.parent) ? true : "quit";
default:
return ts.isExpressionNode(node) ? false : "quit";
}
});
}
/**
* It's possible that "prop.valueDeclaration" is a local declaration, but the property was also declared in a superclass.
* In that case we won't consider it used before its declaration, because it gets its value from the superclass' declaration.
*/
function isPropertyDeclaredInAncestorClass(prop) {
if (!(prop.parent.flags & 32 /* Class */)) {
return false;
}
var classType = getTypeOfSymbol(prop.parent);
while (true) {
classType = classType.symbol && getSuperClass(classType);
if (!classType) {
return false;
}
var superProperty = getPropertyOfType(classType, prop.escapedName);
if (superProperty && superProperty.valueDeclaration) {
return true;
}
}
}
function getSuperClass(classType) {
var x = getBaseTypes(classType);
if (x.length === 0) {
return undefined;
}
return getIntersectionType(x);
}
function reportNonexistentProperty(propNode, containingType, isUncheckedJS) {
var errorInfo;
var relatedInfo;
if (!ts.isPrivateIdentifier(propNode) && containingType.flags & 1048576 /* Union */ && !(containingType.flags & 131068 /* Primitive */)) {
for (var _i = 0, _a = containingType.types; _i < _a.length; _i++) {
var subtype = _a[_i];
if (!getPropertyOfType(subtype, propNode.escapedText) && !getApplicableIndexInfoForName(subtype, propNode.escapedText)) {
errorInfo = ts.chainDiagnosticMessages(errorInfo, ts.Diagnostics.Property_0_does_not_exist_on_type_1, ts.declarationNameToString(propNode), typeToString(subtype));
break;
}
}
}
if (typeHasStaticProperty(propNode.escapedText, containingType)) {
var propName = ts.declarationNameToString(propNode);
var typeName = typeToString(containingType);
errorInfo = ts.chainDiagnosticMessages(errorInfo, ts.Diagnostics.Property_0_does_not_exist_on_type_1_Did_you_mean_to_access_the_static_member_2_instead, propName, typeName, typeName + "." + propName);
}
else {
var promisedType = getPromisedTypeOfPromise(containingType);
if (promisedType && getPropertyOfType(promisedType, propNode.escapedText)) {
errorInfo = ts.chainDiagnosticMessages(errorInfo, ts.Diagnostics.Property_0_does_not_exist_on_type_1, ts.declarationNameToString(propNode), typeToString(containingType));
relatedInfo = ts.createDiagnosticForNode(propNode, ts.Diagnostics.Did_you_forget_to_use_await);
}
else {
var missingProperty = ts.declarationNameToString(propNode);
var container = typeToString(containingType);
var libSuggestion = getSuggestedLibForNonExistentProperty(missingProperty, containingType);
if (libSuggestion !== undefined) {
errorInfo = ts.chainDiagnosticMessages(errorInfo, ts.Diagnostics.Property_0_does_not_exist_on_type_1_Do_you_need_to_change_your_target_library_Try_changing_the_lib_compiler_option_to_2_or_later, missingProperty, container, libSuggestion);
}
else {
var suggestion = getSuggestedSymbolForNonexistentProperty(propNode, containingType);
if (suggestion !== undefined) {
var suggestedName = ts.symbolName(suggestion);
var message = isUncheckedJS ? ts.Diagnostics.Property_0_may_not_exist_on_type_1_Did_you_mean_2 : ts.Diagnostics.Property_0_does_not_exist_on_type_1_Did_you_mean_2;
errorInfo = ts.chainDiagnosticMessages(errorInfo, message, missingProperty, container, suggestedName);
relatedInfo = suggestion.valueDeclaration && ts.createDiagnosticForNode(suggestion.valueDeclaration, ts.Diagnostics._0_is_declared_here, suggestedName);
}
else {
var diagnostic = containerSeemsToBeEmptyDomElement(containingType)
? ts.Diagnostics.Property_0_does_not_exist_on_type_1_Try_changing_the_lib_compiler_option_to_include_dom
: ts.Diagnostics.Property_0_does_not_exist_on_type_1;
errorInfo = ts.chainDiagnosticMessages(elaborateNeverIntersection(errorInfo, containingType), diagnostic, missingProperty, container);
}
}
}
}
var resultDiagnostic = ts.createDiagnosticForNodeFromMessageChain(propNode, errorInfo);
if (relatedInfo) {
ts.addRelatedInfo(resultDiagnostic, relatedInfo);
}
addErrorOrSuggestion(!isUncheckedJS, resultDiagnostic);
}
function containerSeemsToBeEmptyDomElement(containingType) {
return (compilerOptions.lib && !compilerOptions.lib.includes("dom")) &&
everyContainedType(containingType, function (type) { return type.symbol && /^(EventTarget|Node|((HTML[a-zA-Z]*)?Element))$/.test(ts.unescapeLeadingUnderscores(type.symbol.escapedName)); }) &&
isEmptyObjectType(containingType);
}
function typeHasStaticProperty(propName, containingType) {
var prop = containingType.symbol && getPropertyOfType(getTypeOfSymbol(containingType.symbol), propName);
return prop !== undefined && !!prop.valueDeclaration && ts.isStatic(prop.valueDeclaration);
}
function getSuggestedLibForNonExistentName(name) {
var missingName = diagnosticName(name);
var allFeatures = ts.getScriptTargetFeatures();
var libTargets = ts.getOwnKeys(allFeatures);
for (var _i = 0, libTargets_1 = libTargets; _i < libTargets_1.length; _i++) {
var libTarget = libTargets_1[_i];
var containingTypes = ts.getOwnKeys(allFeatures[libTarget]);
if (containingTypes !== undefined && ts.contains(containingTypes, missingName)) {
return libTarget;
}
}
}
function getSuggestedLibForNonExistentProperty(missingProperty, containingType) {
var container = getApparentType(containingType).symbol;
if (!container) {
return undefined;
}
var allFeatures = ts.getScriptTargetFeatures();
var libTargets = ts.getOwnKeys(allFeatures);
for (var _i = 0, libTargets_2 = libTargets; _i < libTargets_2.length; _i++) {
var libTarget = libTargets_2[_i];
var featuresOfLib = allFeatures[libTarget];
var featuresOfContainingType = featuresOfLib[ts.symbolName(container)];
if (featuresOfContainingType !== undefined && ts.contains(featuresOfContainingType, missingProperty)) {
return libTarget;
}
}
}
function getSuggestedSymbolForNonexistentClassMember(name, baseType) {
return getSpellingSuggestionForName(name, getPropertiesOfType(baseType), 106500 /* ClassMember */);
}
function getSuggestedSymbolForNonexistentProperty(name, containingType) {
var props = getPropertiesOfType(containingType);
if (typeof name !== "string") {
var parent_2 = name.parent;
if (ts.isPropertyAccessExpression(parent_2)) {
props = ts.filter(props, function (prop) { return isValidPropertyAccessForCompletions(parent_2, containingType, prop); });
}
name = ts.idText(name);
}
return getSpellingSuggestionForName(name, props, 111551 /* Value */);
}
function getSuggestedSymbolForNonexistentJSXAttribute(name, containingType) {
var strName = ts.isString(name) ? name : ts.idText(name);
var properties = getPropertiesOfType(containingType);
var jsxSpecific = strName === "for" ? ts.find(properties, function (x) { return ts.symbolName(x) === "htmlFor"; })
: strName === "class" ? ts.find(properties, function (x) { return ts.symbolName(x) === "className"; })
: undefined;
return jsxSpecific !== null && jsxSpecific !== void 0 ? jsxSpecific : getSpellingSuggestionForName(strName, properties, 111551 /* Value */);
}
function getSuggestionForNonexistentProperty(name, containingType) {
var suggestion = getSuggestedSymbolForNonexistentProperty(name, containingType);
return suggestion && ts.symbolName(suggestion);
}
function getSuggestedSymbolForNonexistentSymbol(location, outerName, meaning) {
ts.Debug.assert(outerName !== undefined, "outername should always be defined");
var result = resolveNameHelper(location, outerName, meaning, /*nameNotFoundMessage*/ undefined, outerName, /*isUse*/ false, /*excludeGlobals*/ false, function (symbols, name, meaning) {
ts.Debug.assertEqual(outerName, name, "name should equal outerName");
var symbol = getSymbol(symbols, name, meaning);
// Sometimes the symbol is found when location is a return type of a function: `typeof x` and `x` is declared in the body of the function
// So the table *contains* `x` but `x` isn't actually in scope.
// However, resolveNameHelper will continue and call this callback again, so we'll eventually get a correct suggestion.
return symbol || getSpellingSuggestionForName(ts.unescapeLeadingUnderscores(name), ts.arrayFrom(symbols.values()), meaning);
});
return result;
}
function getSuggestionForNonexistentSymbol(location, outerName, meaning) {
var symbolResult = getSuggestedSymbolForNonexistentSymbol(location, outerName, meaning);
return symbolResult && ts.symbolName(symbolResult);
}
function getSuggestedSymbolForNonexistentModule(name, targetModule) {
return targetModule.exports && getSpellingSuggestionForName(ts.idText(name), getExportsOfModuleAsArray(targetModule), 2623475 /* ModuleMember */);
}
function getSuggestionForNonexistentExport(name, targetModule) {
var suggestion = getSuggestedSymbolForNonexistentModule(name, targetModule);
return suggestion && ts.symbolName(suggestion);
}
function getSuggestionForNonexistentIndexSignature(objectType, expr, keyedType) {
// check if object type has setter or getter
function hasProp(name) {
var prop = getPropertyOfObjectType(objectType, name);
if (prop) {
var s = getSingleCallSignature(getTypeOfSymbol(prop));
return !!s && getMinArgumentCount(s) >= 1 && isTypeAssignableTo(keyedType, getTypeAtPosition(s, 0));
}
return false;
}
;
var suggestedMethod = ts.isAssignmentTarget(expr) ? "set" : "get";
if (!hasProp(suggestedMethod)) {
return undefined;
}
var suggestion = ts.tryGetPropertyAccessOrIdentifierToString(expr.expression);
if (suggestion === undefined) {
suggestion = suggestedMethod;
}
else {
suggestion += "." + suggestedMethod;
}
return suggestion;
}
/**
* Given a name and a list of symbols whose names are *not* equal to the name, return a spelling suggestion if there is one that is close enough.
* Names less than length 3 only check for case-insensitive equality, not levenshtein distance.
*
* If there is a candidate that's the same except for case, return that.
* If there is a candidate that's within one edit of the name, return that.
* Otherwise, return the candidate with the smallest Levenshtein distance,
* except for candidates:
* * With no name
* * Whose meaning doesn't match the `meaning` parameter.
* * Whose length differs from the target name by more than 0.34 of the length of the name.
* * Whose levenshtein distance is more than 0.4 of the length of the name
* (0.4 allows 1 substitution/transposition for every 5 characters,
* and 1 insertion/deletion at 3 characters)
*/
function getSpellingSuggestionForName(name, symbols, meaning) {
return ts.getSpellingSuggestion(name, symbols, getCandidateName);
function getCandidateName(candidate) {
var candidateName = ts.symbolName(candidate);
if (ts.startsWith(candidateName, "\"")) {
return undefined;
}
if (candidate.flags & meaning) {
return candidateName;
}
if (candidate.flags & 2097152 /* Alias */) {
var alias = tryResolveAlias(candidate);
if (alias && alias.flags & meaning) {
return candidateName;
}
}
return undefined;
}
}
function markPropertyAsReferenced(prop, nodeForCheckWriteOnly, isSelfTypeAccess) {
var valueDeclaration = prop && (prop.flags & 106500 /* ClassMember */) && prop.valueDeclaration;
if (!valueDeclaration) {
return;
}
var hasPrivateModifier = ts.hasEffectiveModifier(valueDeclaration, 8 /* Private */);
var hasPrivateIdentifier = prop.valueDeclaration && ts.isNamedDeclaration(prop.valueDeclaration) && ts.isPrivateIdentifier(prop.valueDeclaration.name);
if (!hasPrivateModifier && !hasPrivateIdentifier) {
return;
}
if (nodeForCheckWriteOnly && ts.isWriteOnlyAccess(nodeForCheckWriteOnly) && !(prop.flags & 65536 /* SetAccessor */)) {
return;
}
if (isSelfTypeAccess) {
// Find any FunctionLikeDeclaration because those create a new 'this' binding. But this should only matter for methods (or getters/setters).
var containingMethod = ts.findAncestor(nodeForCheckWriteOnly, ts.isFunctionLikeDeclaration);
if (containingMethod && containingMethod.symbol === prop) {
return;
}
}
(ts.getCheckFlags(prop) & 1 /* Instantiated */ ? getSymbolLinks(prop).target : prop).isReferenced = 67108863 /* All */;
}
function isSelfTypeAccess(name, parent) {
return name.kind === 108 /* ThisKeyword */
|| !!parent && ts.isEntityNameExpression(name) && parent === getResolvedSymbol(ts.getFirstIdentifier(name));
}
function isValidPropertyAccess(node, propertyName) {
switch (node.kind) {
case 204 /* PropertyAccessExpression */:
return isValidPropertyAccessWithType(node, node.expression.kind === 106 /* SuperKeyword */, propertyName, getWidenedType(checkExpression(node.expression)));
case 159 /* QualifiedName */:
return isValidPropertyAccessWithType(node, /*isSuper*/ false, propertyName, getWidenedType(checkExpression(node.left)));
case 198 /* ImportType */:
return isValidPropertyAccessWithType(node, /*isSuper*/ false, propertyName, getTypeFromTypeNode(node));
}
}
function isValidPropertyAccessForCompletions(node, type, property) {
return isValidPropertyAccessWithType(node, node.kind === 204 /* PropertyAccessExpression */ && node.expression.kind === 106 /* SuperKeyword */, property.escapedName, type);
// Previously we validated the 'this' type of methods but this adversely affected performance. See #31377 for more context.
}
function isValidPropertyAccessWithType(node, isSuper, propertyName, type) {
if (type === errorType || isTypeAny(type)) {
return true;
}
var prop = getPropertyOfType(type, propertyName);
if (prop) {
if (prop.valueDeclaration && ts.isPrivateIdentifierClassElementDeclaration(prop.valueDeclaration)) {
var declClass_1 = ts.getContainingClass(prop.valueDeclaration);
return !ts.isOptionalChain(node) && !!ts.findAncestor(node, function (parent) { return parent === declClass_1; });
}
return checkPropertyAccessibility(node, isSuper, /*writing*/ false, type, prop, /* reportError */ false);
}
// In js files properties of unions are allowed in completion
return ts.isInJSFile(node) && (type.flags & 1048576 /* Union */) !== 0 && type.types.some(function (elementType) { return isValidPropertyAccessWithType(node, isSuper, propertyName, elementType); });
}
/**
* Return the symbol of the for-in variable declared or referenced by the given for-in statement.
*/
function getForInVariableSymbol(node) {
var initializer = node.initializer;
if (initializer.kind === 253 /* VariableDeclarationList */) {
var variable = initializer.declarations[0];
if (variable && !ts.isBindingPattern(variable.name)) {
return getSymbolOfNode(variable);
}
}
else if (initializer.kind === 79 /* Identifier */) {
return getResolvedSymbol(initializer);
}
return undefined;
}
/**
* Return true if the given type is considered to have numeric property names.
*/
function hasNumericPropertyNames(type) {
return getIndexInfosOfType(type).length === 1 && !!getIndexInfoOfType(type, numberType);
}
/**
* Return true if given node is an expression consisting of an identifier (possibly parenthesized)
* that references a for-in variable for an object with numeric property names.
*/
function isForInVariableForNumericPropertyNames(expr) {
var e = ts.skipParentheses(expr);
if (e.kind === 79 /* Identifier */) {
var symbol = getResolvedSymbol(e);
if (symbol.flags & 3 /* Variable */) {
var child = expr;
var node = expr.parent;
while (node) {
if (node.kind === 241 /* ForInStatement */ &&
child === node.statement &&
getForInVariableSymbol(node) === symbol &&
hasNumericPropertyNames(getTypeOfExpression(node.expression))) {
return true;
}
child = node;
node = node.parent;
}
}
}
return false;
}
function checkIndexedAccess(node, checkMode) {
return node.flags & 32 /* OptionalChain */ ? checkElementAccessChain(node, checkMode) :
checkElementAccessExpression(node, checkNonNullExpression(node.expression), checkMode);
}
function checkElementAccessChain(node, checkMode) {
var exprType = checkExpression(node.expression);
var nonOptionalType = getOptionalExpressionType(exprType, node.expression);
return propagateOptionalTypeMarker(checkElementAccessExpression(node, checkNonNullType(nonOptionalType, node.expression), checkMode), node, nonOptionalType !== exprType);
}
function checkElementAccessExpression(node, exprType, checkMode) {
var objectType = ts.getAssignmentTargetKind(node) !== 0 /* None */ || isMethodAccessForCall(node) ? getWidenedType(exprType) : exprType;
var indexExpression = node.argumentExpression;
var indexType = checkExpression(indexExpression);
if (objectType === errorType || objectType === silentNeverType) {
return objectType;
}
if (isConstEnumObjectType(objectType) && !ts.isStringLiteralLike(indexExpression)) {
error(indexExpression, ts.Diagnostics.A_const_enum_member_can_only_be_accessed_using_a_string_literal);
return errorType;
}
var effectiveIndexType = isForInVariableForNumericPropertyNames(indexExpression) ? numberType : indexType;
var accessFlags = ts.isAssignmentTarget(node) ?
4 /* Writing */ | (isGenericObjectType(objectType) && !isThisTypeParameter(objectType) ? 2 /* NoIndexSignatures */ : 0) :
32 /* ExpressionPosition */;
var indexedAccessType = getIndexedAccessTypeOrUndefined(objectType, effectiveIndexType, accessFlags, node) || errorType;
return checkIndexedAccessIndexType(getFlowTypeOfAccessExpression(node, getNodeLinks(node).resolvedSymbol, indexedAccessType, indexExpression, checkMode), node);
}
function callLikeExpressionMayHaveTypeArguments(node) {
return ts.isCallOrNewExpression(node) || ts.isTaggedTemplateExpression(node) || ts.isJsxOpeningLikeElement(node);
}
function resolveUntypedCall(node) {
if (callLikeExpressionMayHaveTypeArguments(node)) {
// Check type arguments even though we will give an error that untyped calls may not accept type arguments.
// This gets us diagnostics for the type arguments and marks them as referenced.
ts.forEach(node.typeArguments, checkSourceElement);
}
if (node.kind === 208 /* TaggedTemplateExpression */) {
checkExpression(node.template);
}
else if (ts.isJsxOpeningLikeElement(node)) {
checkExpression(node.attributes);
}
else if (node.kind !== 163 /* Decorator */) {
ts.forEach(node.arguments, function (argument) {
checkExpression(argument);
});
}
return anySignature;
}
function resolveErrorCall(node) {
resolveUntypedCall(node);
return unknownSignature;
}
// Re-order candidate signatures into the result array. Assumes the result array to be empty.
// The candidate list orders groups in reverse, but within a group signatures are kept in declaration order
// A nit here is that we reorder only signatures that belong to the same symbol,
// so order how inherited signatures are processed is still preserved.
// interface A { (x: string): void }
// interface B extends A { (x: 'foo'): string }
// const b: B;
// b('foo') // <- here overloads should be processed as [(x:'foo'): string, (x: string): void]
function reorderCandidates(signatures, result, callChainFlags) {
var lastParent;
var lastSymbol;
var cutoffIndex = 0;
var index;
var specializedIndex = -1;
var spliceIndex;
ts.Debug.assert(!result.length);
for (var _i = 0, signatures_7 = signatures; _i < signatures_7.length; _i++) {
var signature = signatures_7[_i];
var symbol = signature.declaration && getSymbolOfNode(signature.declaration);
var parent = signature.declaration && signature.declaration.parent;
if (!lastSymbol || symbol === lastSymbol) {
if (lastParent && parent === lastParent) {
index = index + 1;
}
else {
lastParent = parent;
index = cutoffIndex;
}
}
else {
// current declaration belongs to a different symbol
// set cutoffIndex so re-orderings in the future won't change result set from 0 to cutoffIndex
index = cutoffIndex = result.length;
lastParent = parent;
}
lastSymbol = symbol;
// specialized signatures always need to be placed before non-specialized signatures regardless
// of the cutoff position; see GH#1133
if (signatureHasLiteralTypes(signature)) {
specializedIndex++;
spliceIndex = specializedIndex;
// The cutoff index always needs to be greater than or equal to the specialized signature index
// in order to prevent non-specialized signatures from being added before a specialized
// signature.
cutoffIndex++;
}
else {
spliceIndex = index;
}
result.splice(spliceIndex, 0, callChainFlags ? getOptionalCallSignature(signature, callChainFlags) : signature);
}
}
function isSpreadArgument(arg) {
return !!arg && (arg.kind === 223 /* SpreadElement */ || arg.kind === 230 /* SyntheticExpression */ && arg.isSpread);
}
function getSpreadArgumentIndex(args) {
return ts.findIndex(args, isSpreadArgument);
}
function acceptsVoid(t) {
return !!(t.flags & 16384 /* Void */);
}
function acceptsVoidUndefinedUnknownOrAny(t) {
return !!(t.flags & (16384 /* Void */ | 32768 /* Undefined */ | 2 /* Unknown */ | 1 /* Any */));
}
function hasCorrectArity(node, args, signature, signatureHelpTrailingComma) {
if (signatureHelpTrailingComma === void 0) { signatureHelpTrailingComma = false; }
var argCount;
var callIsIncomplete = false; // In incomplete call we want to be lenient when we have too few arguments
var effectiveParameterCount = getParameterCount(signature);
var effectiveMinimumArguments = getMinArgumentCount(signature);
if (node.kind === 208 /* TaggedTemplateExpression */) {
argCount = args.length;
if (node.template.kind === 221 /* TemplateExpression */) {
// If a tagged template expression lacks a tail literal, the call is incomplete.
// Specifically, a template only can end in a TemplateTail or a Missing literal.
var lastSpan = ts.last(node.template.templateSpans); // we should always have at least one span.
callIsIncomplete = ts.nodeIsMissing(lastSpan.literal) || !!lastSpan.literal.isUnterminated;
}
else {
// If the template didn't end in a backtick, or its beginning occurred right prior to EOF,
// then this might actually turn out to be a TemplateHead in the future;
// so we consider the call to be incomplete.
var templateLiteral = node.template;
ts.Debug.assert(templateLiteral.kind === 14 /* NoSubstitutionTemplateLiteral */);
callIsIncomplete = !!templateLiteral.isUnterminated;
}
}
else if (node.kind === 163 /* Decorator */) {
argCount = getDecoratorArgumentCount(node, signature);
}
else if (ts.isJsxOpeningLikeElement(node)) {
callIsIncomplete = node.attributes.end === node.end;
if (callIsIncomplete) {
return true;
}
argCount = effectiveMinimumArguments === 0 ? args.length : 1;
effectiveParameterCount = args.length === 0 ? effectiveParameterCount : 1; // class may have argumentless ctor functions - still resolve ctor and compare vs props member type
effectiveMinimumArguments = Math.min(effectiveMinimumArguments, 1); // sfc may specify context argument - handled by framework and not typechecked
}
else if (!node.arguments) {
// This only happens when we have something of the form: 'new C'
ts.Debug.assert(node.kind === 207 /* NewExpression */);
return getMinArgumentCount(signature) === 0;
}
else {
argCount = signatureHelpTrailingComma ? args.length + 1 : args.length;
// If we are missing the close parenthesis, the call is incomplete.
callIsIncomplete = node.arguments.end === node.end;
// If a spread argument is present, check that it corresponds to a rest parameter or at least that it's in the valid range.
var spreadArgIndex = getSpreadArgumentIndex(args);
if (spreadArgIndex >= 0) {
return spreadArgIndex >= getMinArgumentCount(signature) && (hasEffectiveRestParameter(signature) || spreadArgIndex < getParameterCount(signature));
}
}
// Too many arguments implies incorrect arity.
if (!hasEffectiveRestParameter(signature) && argCount > effectiveParameterCount) {
return false;
}
// If the call is incomplete, we should skip the lower bound check.
// JSX signatures can have extra parameters provided by the library which we don't check
if (callIsIncomplete || argCount >= effectiveMinimumArguments) {
return true;
}
for (var i = argCount; i < effectiveMinimumArguments; i++) {
var type = getTypeAtPosition(signature, i);
if (filterType(type, ts.isInJSFile(node) && !strictNullChecks ? acceptsVoidUndefinedUnknownOrAny : acceptsVoid).flags & 131072 /* Never */) {
return false;
}
}
return true;
}
function hasCorrectTypeArgumentArity(signature, typeArguments) {
// If the user supplied type arguments, but the number of type arguments does not match
// the declared number of type parameters, the call has an incorrect arity.
var numTypeParameters = ts.length(signature.typeParameters);
var minTypeArgumentCount = getMinTypeArgumentCount(signature.typeParameters);
return !ts.some(typeArguments) ||
(typeArguments.length >= minTypeArgumentCount && typeArguments.length <= numTypeParameters);
}
// If type has a single call signature and no other members, return that signature. Otherwise, return undefined.
function getSingleCallSignature(type) {
return getSingleSignature(type, 0 /* Call */, /*allowMembers*/ false);
}
function getSingleCallOrConstructSignature(type) {
return getSingleSignature(type, 0 /* Call */, /*allowMembers*/ false) ||
getSingleSignature(type, 1 /* Construct */, /*allowMembers*/ false);
}
function getSingleSignature(type, kind, allowMembers) {
if (type.flags & 524288 /* Object */) {
var resolved = resolveStructuredTypeMembers(type);
if (allowMembers || resolved.properties.length === 0 && resolved.indexInfos.length === 0) {
if (kind === 0 /* Call */ && resolved.callSignatures.length === 1 && resolved.constructSignatures.length === 0) {
return resolved.callSignatures[0];
}
if (kind === 1 /* Construct */ && resolved.constructSignatures.length === 1 && resolved.callSignatures.length === 0) {
return resolved.constructSignatures[0];
}
}
}
return undefined;
}
// Instantiate a generic signature in the context of a non-generic signature (section 3.8.5 in TypeScript spec)
function instantiateSignatureInContextOf(signature, contextualSignature, inferenceContext, compareTypes) {
var context = createInferenceContext(signature.typeParameters, signature, 0 /* None */, compareTypes);
// We clone the inferenceContext to avoid fixing. For example, when the source signature is <T>(x: T) => T[] and
// the contextual signature is (...args: A) => B, we want to infer the element type of A's constraint (say 'any')
// for T but leave it possible to later infer '[any]' back to A.
var restType = getEffectiveRestType(contextualSignature);
var mapper = inferenceContext && (restType && restType.flags & 262144 /* TypeParameter */ ? inferenceContext.nonFixingMapper : inferenceContext.mapper);
var sourceSignature = mapper ? instantiateSignature(contextualSignature, mapper) : contextualSignature;
applyToParameterTypes(sourceSignature, signature, function (source, target) {
// Type parameters from outer context referenced by source type are fixed by instantiation of the source type
inferTypes(context.inferences, source, target);
});
if (!inferenceContext) {
applyToReturnTypes(contextualSignature, signature, function (source, target) {
inferTypes(context.inferences, source, target, 128 /* ReturnType */);
});
}
return getSignatureInstantiation(signature, getInferredTypes(context), ts.isInJSFile(contextualSignature.declaration));
}
function inferJsxTypeArguments(node, signature, checkMode, context) {
var paramType = getEffectiveFirstArgumentForJsxSignature(signature, node);
var checkAttrType = checkExpressionWithContextualType(node.attributes, paramType, context, checkMode);
inferTypes(context.inferences, checkAttrType, paramType);
return getInferredTypes(context);
}
function getThisArgumentType(thisArgumentNode) {
if (!thisArgumentNode) {
return voidType;
}
var thisArgumentType = checkExpression(thisArgumentNode);
return ts.isOptionalChainRoot(thisArgumentNode.parent) ? getNonNullableType(thisArgumentType) :
ts.isOptionalChain(thisArgumentNode.parent) ? removeOptionalTypeMarker(thisArgumentType) :
thisArgumentType;
}
function inferTypeArguments(node, signature, args, checkMode, context) {
if (ts.isJsxOpeningLikeElement(node)) {
return inferJsxTypeArguments(node, signature, checkMode, context);
}
// If a contextual type is available, infer from that type to the return type of the call expression. For
// example, given a 'function wrap<T, U>(cb: (x: T) => U): (x: T) => U' and a call expression
// 'let f: (x: string) => number = wrap(s => s.length)', we infer from the declared type of 'f' to the
// return type of 'wrap'.
if (node.kind !== 163 /* Decorator */) {
var contextualType = getContextualType(node, ts.every(signature.typeParameters, function (p) { return !!getDefaultFromTypeParameter(p); }) ? 8 /* SkipBindingPatterns */ : 0 /* None */);
if (contextualType) {
// We clone the inference context to avoid disturbing a resolution in progress for an
// outer call expression. Effectively we just want a snapshot of whatever has been
// inferred for any outer call expression so far.
var outerContext = getInferenceContext(node);
var outerMapper = getMapperFromContext(cloneInferenceContext(outerContext, 1 /* NoDefault */));
var instantiatedType = instantiateType(contextualType, outerMapper);
// If the contextual type is a generic function type with a single call signature, we
// instantiate the type with its own type parameters and type arguments. This ensures that
// the type parameters are not erased to type any during type inference such that they can
// be inferred as actual types from the contextual type. For example:
// declare function arrayMap<T, U>(f: (x: T) => U): (a: T[]) => U[];
// const boxElements: <A>(a: A[]) => { value: A }[] = arrayMap(value => ({ value }));
// Above, the type of the 'value' parameter is inferred to be 'A'.
var contextualSignature = getSingleCallSignature(instantiatedType);
var inferenceSourceType = contextualSignature && contextualSignature.typeParameters ?
getOrCreateTypeFromSignature(getSignatureInstantiationWithoutFillingInTypeArguments(contextualSignature, contextualSignature.typeParameters)) :
instantiatedType;
var inferenceTargetType = getReturnTypeOfSignature(signature);
// Inferences made from return types have lower priority than all other inferences.
inferTypes(context.inferences, inferenceSourceType, inferenceTargetType, 128 /* ReturnType */);
// Create a type mapper for instantiating generic contextual types using the inferences made
// from the return type. We need a separate inference pass here because (a) instantiation of
// the source type uses the outer context's return mapper (which excludes inferences made from
// outer arguments), and (b) we don't want any further inferences going into this context.
var returnContext = createInferenceContext(signature.typeParameters, signature, context.flags);
var returnSourceType = instantiateType(contextualType, outerContext && outerContext.returnMapper);
inferTypes(returnContext.inferences, returnSourceType, inferenceTargetType);
context.returnMapper = ts.some(returnContext.inferences, hasInferenceCandidates) ? getMapperFromContext(cloneInferredPartOfContext(returnContext)) : undefined;
}
}
var restType = getNonArrayRestType(signature);
var argCount = restType ? Math.min(getParameterCount(signature) - 1, args.length) : args.length;
if (restType && restType.flags & 262144 /* TypeParameter */) {
var info = ts.find(context.inferences, function (info) { return info.typeParameter === restType; });
if (info) {
info.impliedArity = ts.findIndex(args, isSpreadArgument, argCount) < 0 ? args.length - argCount : undefined;
}
}
var thisType = getThisTypeOfSignature(signature);
if (thisType) {
var thisArgumentNode = getThisArgumentOfCall(node);
inferTypes(context.inferences, getThisArgumentType(thisArgumentNode), thisType);
}
for (var i = 0; i < argCount; i++) {
var arg = args[i];
if (arg.kind !== 225 /* OmittedExpression */) {
var paramType = getTypeAtPosition(signature, i);
var argType = checkExpressionWithContextualType(arg, paramType, context, checkMode);
inferTypes(context.inferences, argType, paramType);
}
}
if (restType) {
var spreadType = getSpreadArgumentType(args, argCount, args.length, restType, context, checkMode);
inferTypes(context.inferences, spreadType, restType);
}
return getInferredTypes(context);
}
function getMutableArrayOrTupleType(type) {
return type.flags & 1048576 /* Union */ ? mapType(type, getMutableArrayOrTupleType) :
type.flags & 1 /* Any */ || isMutableArrayOrTuple(getBaseConstraintOfType(type) || type) ? type :
isTupleType(type) ? createTupleType(getTypeArguments(type), type.target.elementFlags, /*readonly*/ false, type.target.labeledElementDeclarations) :
createTupleType([type], [8 /* Variadic */]);
}
function getSpreadArgumentType(args, index, argCount, restType, context, checkMode) {
if (index >= argCount - 1) {
var arg = args[argCount - 1];
if (isSpreadArgument(arg)) {
// We are inferring from a spread expression in the last argument position, i.e. both the parameter
// and the argument are ...x forms.
return getMutableArrayOrTupleType(arg.kind === 230 /* SyntheticExpression */ ? arg.type :
checkExpressionWithContextualType(arg.expression, restType, context, checkMode));
}
}
var types = [];
var flags = [];
var names = [];
for (var i = index; i < argCount; i++) {
var arg = args[i];
if (isSpreadArgument(arg)) {
var spreadType = arg.kind === 230 /* SyntheticExpression */ ? arg.type : checkExpression(arg.expression);
if (isArrayLikeType(spreadType)) {
types.push(spreadType);
flags.push(8 /* Variadic */);
}
else {
types.push(checkIteratedTypeOrElementType(33 /* Spread */, spreadType, undefinedType, arg.kind === 223 /* SpreadElement */ ? arg.expression : arg));
flags.push(4 /* Rest */);
}
}
else {
var contextualType = getIndexedAccessType(restType, getNumberLiteralType(i - index), 256 /* Contextual */);
var argType = checkExpressionWithContextualType(arg, contextualType, context, checkMode);
var hasPrimitiveContextualType = maybeTypeOfKind(contextualType, 131068 /* Primitive */ | 4194304 /* Index */ | 134217728 /* TemplateLiteral */ | 268435456 /* StringMapping */);
types.push(hasPrimitiveContextualType ? getRegularTypeOfLiteralType(argType) : getWidenedLiteralType(argType));
flags.push(1 /* Required */);
}
if (arg.kind === 230 /* SyntheticExpression */ && arg.tupleNameSource) {
names.push(arg.tupleNameSource);
}
}
return createTupleType(types, flags, /*readonly*/ false, ts.length(names) === ts.length(types) ? names : undefined);
}
function checkTypeArguments(signature, typeArgumentNodes, reportErrors, headMessage) {
var isJavascript = ts.isInJSFile(signature.declaration);
var typeParameters = signature.typeParameters;
var typeArgumentTypes = fillMissingTypeArguments(ts.map(typeArgumentNodes, getTypeFromTypeNode), typeParameters, getMinTypeArgumentCount(typeParameters), isJavascript);
var mapper;
for (var i = 0; i < typeArgumentNodes.length; i++) {
ts.Debug.assert(typeParameters[i] !== undefined, "Should not call checkTypeArguments with too many type arguments");
var constraint = getConstraintOfTypeParameter(typeParameters[i]);
if (constraint) {
var errorInfo = reportErrors && headMessage ? (function () { return ts.chainDiagnosticMessages(/*details*/ undefined, ts.Diagnostics.Type_0_does_not_satisfy_the_constraint_1); }) : undefined;
var typeArgumentHeadMessage = headMessage || ts.Diagnostics.Type_0_does_not_satisfy_the_constraint_1;
if (!mapper) {
mapper = createTypeMapper(typeParameters, typeArgumentTypes);
}
var typeArgument = typeArgumentTypes[i];
if (!checkTypeAssignableTo(typeArgument, getTypeWithThisArgument(instantiateType(constraint, mapper), typeArgument), reportErrors ? typeArgumentNodes[i] : undefined, typeArgumentHeadMessage, errorInfo)) {
return undefined;
}
}
}
return typeArgumentTypes;
}
function getJsxReferenceKind(node) {
if (isJsxIntrinsicIdentifier(node.tagName)) {
return 2 /* Mixed */;
}
var tagType = getApparentType(checkExpression(node.tagName));
if (ts.length(getSignaturesOfType(tagType, 1 /* Construct */))) {
return 0 /* Component */;
}
if (ts.length(getSignaturesOfType(tagType, 0 /* Call */))) {
return 1 /* Function */;
}
return 2 /* Mixed */;
}
/**
* Check if the given signature can possibly be a signature called by the JSX opening-like element.
* @param node a JSX opening-like element we are trying to figure its call signature
* @param signature a candidate signature we are trying whether it is a call signature
* @param relation a relationship to check parameter and argument type
*/
function checkApplicableSignatureForJsxOpeningLikeElement(node, signature, relation, checkMode, reportErrors, containingMessageChain, errorOutputContainer) {
// Stateless function components can have maximum of three arguments: "props", "context", and "updater".
// However "context" and "updater" are implicit and can't be specify by users. Only the first parameter, props,
// can be specified by users through attributes property.
var paramType = getEffectiveFirstArgumentForJsxSignature(signature, node);
var attributesType = checkExpressionWithContextualType(node.attributes, paramType, /*inferenceContext*/ undefined, checkMode);
return checkTagNameDoesNotExpectTooManyArguments() && checkTypeRelatedToAndOptionallyElaborate(attributesType, paramType, relation, reportErrors ? node.tagName : undefined, node.attributes,
/*headMessage*/ undefined, containingMessageChain, errorOutputContainer);
function checkTagNameDoesNotExpectTooManyArguments() {
var _a;
if (getJsxNamespaceContainerForImplicitImport(node)) {
return true; // factory is implicitly jsx/jsxdev - assume it fits the bill, since we don't strongly look for the jsx/jsxs/jsxDEV factory APIs anywhere else (at least not yet)
}
var tagType = ts.isJsxOpeningElement(node) || ts.isJsxSelfClosingElement(node) && !isJsxIntrinsicIdentifier(node.tagName) ? checkExpression(node.tagName) : undefined;
if (!tagType) {
return true;
}
var tagCallSignatures = getSignaturesOfType(tagType, 0 /* Call */);
if (!ts.length(tagCallSignatures)) {
return true;
}
var factory = getJsxFactoryEntity(node);
if (!factory) {
return true;
}
var factorySymbol = resolveEntityName(factory, 111551 /* Value */, /*ignoreErrors*/ true, /*dontResolveAlias*/ false, node);
if (!factorySymbol) {
return true;
}
var factoryType = getTypeOfSymbol(factorySymbol);
var callSignatures = getSignaturesOfType(factoryType, 0 /* Call */);
if (!ts.length(callSignatures)) {
return true;
}
var hasFirstParamSignatures = false;
var maxParamCount = 0;
// Check that _some_ first parameter expects a FC-like thing, and that some overload of the SFC expects an acceptable number of arguments
for (var _i = 0, callSignatures_1 = callSignatures; _i < callSignatures_1.length; _i++) {
var sig = callSignatures_1[_i];
var firstparam = getTypeAtPosition(sig, 0);
var signaturesOfParam = getSignaturesOfType(firstparam, 0 /* Call */);
if (!ts.length(signaturesOfParam))
continue;
for (var _b = 0, signaturesOfParam_1 = signaturesOfParam; _b < signaturesOfParam_1.length; _b++) {
var paramSig = signaturesOfParam_1[_b];
hasFirstParamSignatures = true;
if (hasEffectiveRestParameter(paramSig)) {
return true; // some signature has a rest param, so function components can have an arbitrary number of arguments
}
var paramCount = getParameterCount(paramSig);
if (paramCount > maxParamCount) {
maxParamCount = paramCount;
}
}
}
if (!hasFirstParamSignatures) {
// Not a single signature had a first parameter which expected a signature - for back compat, and
// to guard against generic factories which won't have signatures directly, do not error
return true;
}
var absoluteMinArgCount = Infinity;
for (var _c = 0, tagCallSignatures_1 = tagCallSignatures; _c < tagCallSignatures_1.length; _c++) {
var tagSig = tagCallSignatures_1[_c];
var tagRequiredArgCount = getMinArgumentCount(tagSig);
if (tagRequiredArgCount < absoluteMinArgCount) {
absoluteMinArgCount = tagRequiredArgCount;
}
}
if (absoluteMinArgCount <= maxParamCount) {
return true; // some signature accepts the number of arguments the function component provides
}
if (reportErrors) {
var diag = ts.createDiagnosticForNode(node.tagName, ts.Diagnostics.Tag_0_expects_at_least_1_arguments_but_the_JSX_factory_2_provides_at_most_3, ts.entityNameToString(node.tagName), absoluteMinArgCount, ts.entityNameToString(factory), maxParamCount);
var tagNameDeclaration = (_a = getSymbolAtLocation(node.tagName)) === null || _a === void 0 ? void 0 : _a.valueDeclaration;
if (tagNameDeclaration) {
ts.addRelatedInfo(diag, ts.createDiagnosticForNode(tagNameDeclaration, ts.Diagnostics._0_is_declared_here, ts.entityNameToString(node.tagName)));
}
if (errorOutputContainer && errorOutputContainer.skipLogging) {
(errorOutputContainer.errors || (errorOutputContainer.errors = [])).push(diag);
}
if (!errorOutputContainer.skipLogging) {
diagnostics.add(diag);
}
}
return false;
}
}
function getSignatureApplicabilityError(node, args, signature, relation, checkMode, reportErrors, containingMessageChain) {
var errorOutputContainer = { errors: undefined, skipLogging: true };
if (ts.isJsxOpeningLikeElement(node)) {
if (!checkApplicableSignatureForJsxOpeningLikeElement(node, signature, relation, checkMode, reportErrors, containingMessageChain, errorOutputContainer)) {
ts.Debug.assert(!reportErrors || !!errorOutputContainer.errors, "jsx should have errors when reporting errors");
return errorOutputContainer.errors || ts.emptyArray;
}
return undefined;
}
var thisType = getThisTypeOfSignature(signature);
if (thisType && thisType !== voidType && node.kind !== 207 /* NewExpression */) {
// If the called expression is not of the form `x.f` or `x["f"]`, then sourceType = voidType
// If the signature's 'this' type is voidType, then the check is skipped -- anything is compatible.
// If the expression is a new expression, then the check is skipped.
var thisArgumentNode = getThisArgumentOfCall(node);
var thisArgumentType = getThisArgumentType(thisArgumentNode);
var errorNode = reportErrors ? (thisArgumentNode || node) : undefined;
var headMessage_1 = ts.Diagnostics.The_this_context_of_type_0_is_not_assignable_to_method_s_this_of_type_1;
if (!checkTypeRelatedTo(thisArgumentType, thisType, relation, errorNode, headMessage_1, containingMessageChain, errorOutputContainer)) {
ts.Debug.assert(!reportErrors || !!errorOutputContainer.errors, "this parameter should have errors when reporting errors");
return errorOutputContainer.errors || ts.emptyArray;
}
}
var headMessage = ts.Diagnostics.Argument_of_type_0_is_not_assignable_to_parameter_of_type_1;
var restType = getNonArrayRestType(signature);
var argCount = restType ? Math.min(getParameterCount(signature) - 1, args.length) : args.length;
for (var i = 0; i < argCount; i++) {
var arg = args[i];
if (arg.kind !== 225 /* OmittedExpression */) {
var paramType = getTypeAtPosition(signature, i);
var argType = checkExpressionWithContextualType(arg, paramType, /*inferenceContext*/ undefined, checkMode);
// If one or more arguments are still excluded (as indicated by CheckMode.SkipContextSensitive),
// we obtain the regular type of any object literal arguments because we may not have inferred complete
// parameter types yet and therefore excess property checks may yield false positives (see #17041).
var checkArgType = checkMode & 4 /* SkipContextSensitive */ ? getRegularTypeOfObjectLiteral(argType) : argType;
if (!checkTypeRelatedToAndOptionallyElaborate(checkArgType, paramType, relation, reportErrors ? arg : undefined, arg, headMessage, containingMessageChain, errorOutputContainer)) {
ts.Debug.assert(!reportErrors || !!errorOutputContainer.errors, "parameter should have errors when reporting errors");
maybeAddMissingAwaitInfo(arg, checkArgType, paramType);
return errorOutputContainer.errors || ts.emptyArray;
}
}
}
if (restType) {
var spreadType = getSpreadArgumentType(args, argCount, args.length, restType, /*context*/ undefined, checkMode);
var restArgCount = args.length - argCount;
var errorNode = !reportErrors ? undefined :
restArgCount === 0 ? node :
restArgCount === 1 ? args[argCount] :
ts.setTextRangePosEnd(createSyntheticExpression(node, spreadType), args[argCount].pos, args[args.length - 1].end);
if (!checkTypeRelatedTo(spreadType, restType, relation, errorNode, headMessage, /*containingMessageChain*/ undefined, errorOutputContainer)) {
ts.Debug.assert(!reportErrors || !!errorOutputContainer.errors, "rest parameter should have errors when reporting errors");
maybeAddMissingAwaitInfo(errorNode, spreadType, restType);
return errorOutputContainer.errors || ts.emptyArray;
}
}
return undefined;
function maybeAddMissingAwaitInfo(errorNode, source, target) {
if (errorNode && reportErrors && errorOutputContainer.errors && errorOutputContainer.errors.length) {
// Bail if target is Promise-like---something else is wrong
if (getAwaitedTypeOfPromise(target)) {
return;
}
var awaitedTypeOfSource = getAwaitedTypeOfPromise(source);
if (awaitedTypeOfSource && isTypeRelatedTo(awaitedTypeOfSource, target, relation)) {
ts.addRelatedInfo(errorOutputContainer.errors[0], ts.createDiagnosticForNode(errorNode, ts.Diagnostics.Did_you_forget_to_use_await));
}
}
}
}
/**
* Returns the this argument in calls like x.f(...) and x[f](...). Undefined otherwise.
*/
function getThisArgumentOfCall(node) {
var expression = node.kind === 206 /* CallExpression */ ? node.expression :
node.kind === 208 /* TaggedTemplateExpression */ ? node.tag : undefined;
if (expression) {
var callee = ts.skipOuterExpressions(expression);
if (ts.isAccessExpression(callee)) {
return callee.expression;
}
}
}
function createSyntheticExpression(parent, type, isSpread, tupleNameSource) {
var result = ts.parseNodeFactory.createSyntheticExpression(type, isSpread, tupleNameSource);
ts.setTextRange(result, parent);
ts.setParent(result, parent);
return result;
}
/**
* Returns the effective arguments for an expression that works like a function invocation.
*/
function getEffectiveCallArguments(node) {
if (node.kind === 208 /* TaggedTemplateExpression */) {
var template = node.template;
var args_3 = [createSyntheticExpression(template, getGlobalTemplateStringsArrayType())];
if (template.kind === 221 /* TemplateExpression */) {
ts.forEach(template.templateSpans, function (span) {
args_3.push(span.expression);
});
}
return args_3;
}
if (node.kind === 163 /* Decorator */) {
return getEffectiveDecoratorArguments(node);
}
if (ts.isJsxOpeningLikeElement(node)) {
return node.attributes.properties.length > 0 || (ts.isJsxOpeningElement(node) && node.parent.children.length > 0) ? [node.attributes] : ts.emptyArray;
}
var args = node.arguments || ts.emptyArray;
var spreadIndex = getSpreadArgumentIndex(args);
if (spreadIndex >= 0) {
// Create synthetic arguments from spreads of tuple types.
var effectiveArgs_1 = args.slice(0, spreadIndex);
var _loop_23 = function (i) {
var arg = args[i];
// We can call checkExpressionCached because spread expressions never have a contextual type.
var spreadType = arg.kind === 223 /* SpreadElement */ && (flowLoopCount ? checkExpression(arg.expression) : checkExpressionCached(arg.expression));
if (spreadType && isTupleType(spreadType)) {
ts.forEach(getTypeArguments(spreadType), function (t, i) {
var _a;
var flags = spreadType.target.elementFlags[i];
var syntheticArg = createSyntheticExpression(arg, flags & 4 /* Rest */ ? createArrayType(t) : t, !!(flags & 12 /* Variable */), (_a = spreadType.target.labeledElementDeclarations) === null || _a === void 0 ? void 0 : _a[i]);
effectiveArgs_1.push(syntheticArg);
});
}
else {
effectiveArgs_1.push(arg);
}
};
for (var i = spreadIndex; i < args.length; i++) {
_loop_23(i);
}
return effectiveArgs_1;
}
return args;
}
/**
* Returns the synthetic argument list for a decorator invocation.
*/
function getEffectiveDecoratorArguments(node) {
var parent = node.parent;
var expr = node.expression;
switch (parent.kind) {
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
// For a class decorator, the `target` is the type of the class (e.g. the
// "static" or "constructor" side of the class).
return [
createSyntheticExpression(expr, getTypeOfSymbol(getSymbolOfNode(parent)))
];
case 162 /* Parameter */:
// A parameter declaration decorator will have three arguments (see
// `ParameterDecorator` in core.d.ts).
var func = parent.parent;
return [
createSyntheticExpression(expr, parent.parent.kind === 169 /* Constructor */ ? getTypeOfSymbol(getSymbolOfNode(func)) : errorType),
createSyntheticExpression(expr, anyType),
createSyntheticExpression(expr, numberType)
];
case 165 /* PropertyDeclaration */:
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
// A method or accessor declaration decorator will have two or three arguments (see
// `PropertyDecorator` and `MethodDecorator` in core.d.ts). If we are emitting decorators
// for ES3, we will only pass two arguments.
var hasPropDesc = parent.kind !== 165 /* PropertyDeclaration */ && languageVersion !== 0 /* ES3 */;
return [
createSyntheticExpression(expr, getParentTypeOfClassElement(parent)),
createSyntheticExpression(expr, getClassElementPropertyKeyType(parent)),
createSyntheticExpression(expr, hasPropDesc ? createTypedPropertyDescriptorType(getTypeOfNode(parent)) : anyType)
];
}
return ts.Debug.fail();
}
/**
* Returns the argument count for a decorator node that works like a function invocation.
*/
function getDecoratorArgumentCount(node, signature) {
switch (node.parent.kind) {
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
return 1;
case 165 /* PropertyDeclaration */:
return 2;
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
// For ES3 or decorators with only two parameters we supply only two arguments
return languageVersion === 0 /* ES3 */ || signature.parameters.length <= 2 ? 2 : 3;
case 162 /* Parameter */:
return 3;
default:
return ts.Debug.fail();
}
}
function getDiagnosticSpanForCallNode(node, doNotIncludeArguments) {
var start;
var length;
var sourceFile = ts.getSourceFileOfNode(node);
if (ts.isPropertyAccessExpression(node.expression)) {
var nameSpan = ts.getErrorSpanForNode(sourceFile, node.expression.name);
start = nameSpan.start;
length = doNotIncludeArguments ? nameSpan.length : node.end - start;
}
else {
var expressionSpan = ts.getErrorSpanForNode(sourceFile, node.expression);
start = expressionSpan.start;
length = doNotIncludeArguments ? expressionSpan.length : node.end - start;
}
return { start: start, length: length, sourceFile: sourceFile };
}
function getDiagnosticForCallNode(node, message, arg0, arg1, arg2, arg3) {
if (ts.isCallExpression(node)) {
var _a = getDiagnosticSpanForCallNode(node), sourceFile = _a.sourceFile, start = _a.start, length_6 = _a.length;
return ts.createFileDiagnostic(sourceFile, start, length_6, message, arg0, arg1, arg2, arg3);
}
else {
return ts.createDiagnosticForNode(node, message, arg0, arg1, arg2, arg3);
}
}
function isPromiseResolveArityError(node) {
if (!ts.isCallExpression(node) || !ts.isIdentifier(node.expression))
return false;
var symbol = resolveName(node.expression, node.expression.escapedText, 111551 /* Value */, undefined, undefined, false);
var decl = symbol === null || symbol === void 0 ? void 0 : symbol.valueDeclaration;
if (!decl || !ts.isParameter(decl) || !isFunctionExpressionOrArrowFunction(decl.parent) || !ts.isNewExpression(decl.parent.parent) || !ts.isIdentifier(decl.parent.parent.expression)) {
return false;
}
var globalPromiseSymbol = getGlobalPromiseConstructorSymbol(/*reportErrors*/ false);
if (!globalPromiseSymbol)
return false;
var constructorSymbol = getSymbolAtLocation(decl.parent.parent.expression, /*ignoreErrors*/ true);
return constructorSymbol === globalPromiseSymbol;
}
function getArgumentArityError(node, signatures, args) {
var _a;
var spreadIndex = getSpreadArgumentIndex(args);
if (spreadIndex > -1) {
return ts.createDiagnosticForNode(args[spreadIndex], ts.Diagnostics.A_spread_argument_must_either_have_a_tuple_type_or_be_passed_to_a_rest_parameter);
}
var min = Number.POSITIVE_INFINITY; // smallest parameter count
var max = Number.NEGATIVE_INFINITY; // largest parameter count
var maxBelow = Number.NEGATIVE_INFINITY; // largest parameter count that is smaller than the number of arguments
var minAbove = Number.POSITIVE_INFINITY; // smallest parameter count that is larger than the number of arguments
var closestSignature;
for (var _i = 0, signatures_8 = signatures; _i < signatures_8.length; _i++) {
var sig = signatures_8[_i];
var minParameter = getMinArgumentCount(sig);
var maxParameter = getParameterCount(sig);
// smallest/largest parameter counts
if (minParameter < min) {
min = minParameter;
closestSignature = sig;
}
max = Math.max(max, maxParameter);
// shortest parameter count *longer than the call*/longest parameter count *shorter than the call*
if (minParameter < args.length && minParameter > maxBelow)
maxBelow = minParameter;
if (args.length < maxParameter && maxParameter < minAbove)
minAbove = maxParameter;
}
var hasRestParameter = ts.some(signatures, hasEffectiveRestParameter);
var parameterRange = hasRestParameter ? min
: min < max ? min + "-" + max
: min;
var error = hasRestParameter ? ts.Diagnostics.Expected_at_least_0_arguments_but_got_1
: parameterRange === 1 && args.length === 0 && isPromiseResolveArityError(node) ? ts.Diagnostics.Expected_0_arguments_but_got_1_Did_you_forget_to_include_void_in_your_type_argument_to_Promise
: ts.Diagnostics.Expected_0_arguments_but_got_1;
if (min < args.length && args.length < max) {
// between min and max, but with no matching overload
return getDiagnosticForCallNode(node, ts.Diagnostics.No_overload_expects_0_arguments_but_overloads_do_exist_that_expect_either_1_or_2_arguments, args.length, maxBelow, minAbove);
}
else if (args.length < min) {
// too short: put the error span on the call expression, not any of the args
var diagnostic = getDiagnosticForCallNode(node, error, parameterRange, args.length);
var parameter = (_a = closestSignature === null || closestSignature === void 0 ? void 0 : closestSignature.declaration) === null || _a === void 0 ? void 0 : _a.parameters[closestSignature.thisParameter ? args.length + 1 : args.length];
if (parameter) {
var parameterError = ts.createDiagnosticForNode(parameter, ts.isBindingPattern(parameter.name) ? ts.Diagnostics.An_argument_matching_this_binding_pattern_was_not_provided
: ts.isRestParameter(parameter) ? ts.Diagnostics.Arguments_for_the_rest_parameter_0_were_not_provided
: ts.Diagnostics.An_argument_for_0_was_not_provided, !parameter.name ? args.length : !ts.isBindingPattern(parameter.name) ? ts.idText(ts.getFirstIdentifier(parameter.name)) : undefined);
return ts.addRelatedInfo(diagnostic, parameterError);
}
return diagnostic;
}
else {
// too long; error goes on the excess parameters
var errorSpan = ts.factory.createNodeArray(args.slice(max));
var pos = ts.first(errorSpan).pos;
var end = ts.last(errorSpan).end;
if (end === pos) {
end++;
}
ts.setTextRangePosEnd(errorSpan, pos, end);
return ts.createDiagnosticForNodeArray(ts.getSourceFileOfNode(node), errorSpan, error, parameterRange, args.length);
}
}
function getTypeArgumentArityError(node, signatures, typeArguments) {
var argCount = typeArguments.length;
// No overloads exist
if (signatures.length === 1) {
var sig = signatures[0];
var min_1 = getMinTypeArgumentCount(sig.typeParameters);
var max = ts.length(sig.typeParameters);
return ts.createDiagnosticForNodeArray(ts.getSourceFileOfNode(node), typeArguments, ts.Diagnostics.Expected_0_type_arguments_but_got_1, min_1 < max ? min_1 + "-" + max : min_1, argCount);
}
// Overloads exist
var belowArgCount = -Infinity;
var aboveArgCount = Infinity;
for (var _i = 0, signatures_9 = signatures; _i < signatures_9.length; _i++) {
var sig = signatures_9[_i];
var min_2 = getMinTypeArgumentCount(sig.typeParameters);
var max = ts.length(sig.typeParameters);
if (min_2 > argCount) {
aboveArgCount = Math.min(aboveArgCount, min_2);
}
else if (max < argCount) {
belowArgCount = Math.max(belowArgCount, max);
}
}
if (belowArgCount !== -Infinity && aboveArgCount !== Infinity) {
return ts.createDiagnosticForNodeArray(ts.getSourceFileOfNode(node), typeArguments, ts.Diagnostics.No_overload_expects_0_type_arguments_but_overloads_do_exist_that_expect_either_1_or_2_type_arguments, argCount, belowArgCount, aboveArgCount);
}
return ts.createDiagnosticForNodeArray(ts.getSourceFileOfNode(node), typeArguments, ts.Diagnostics.Expected_0_type_arguments_but_got_1, belowArgCount === -Infinity ? aboveArgCount : belowArgCount, argCount);
}
function resolveCall(node, signatures, candidatesOutArray, checkMode, callChainFlags, fallbackError) {
var isTaggedTemplate = node.kind === 208 /* TaggedTemplateExpression */;
var isDecorator = node.kind === 163 /* Decorator */;
var isJsxOpeningOrSelfClosingElement = ts.isJsxOpeningLikeElement(node);
var reportErrors = !candidatesOutArray && produceDiagnostics;
var typeArguments;
if (!isDecorator) {
typeArguments = node.typeArguments;
// We already perform checking on the type arguments on the class declaration itself.
if (isTaggedTemplate || isJsxOpeningOrSelfClosingElement || node.expression.kind !== 106 /* SuperKeyword */) {
ts.forEach(typeArguments, checkSourceElement);
}
}
var candidates = candidatesOutArray || [];
// reorderCandidates fills up the candidates array directly
reorderCandidates(signatures, candidates, callChainFlags);
if (!candidates.length) {
if (reportErrors) {
diagnostics.add(getDiagnosticForCallNode(node, ts.Diagnostics.Call_target_does_not_contain_any_signatures));
}
return resolveErrorCall(node);
}
var args = getEffectiveCallArguments(node);
// The excludeArgument array contains true for each context sensitive argument (an argument
// is context sensitive it is susceptible to a one-time permanent contextual typing).
//
// The idea is that we will perform type argument inference & assignability checking once
// without using the susceptible parameters that are functions, and once more for those
// parameters, contextually typing each as we go along.
//
// For a tagged template, then the first argument be 'undefined' if necessary because it
// represents a TemplateStringsArray.
//
// For a decorator, no arguments are susceptible to contextual typing due to the fact
// decorators are applied to a declaration by the emitter, and not to an expression.
var isSingleNonGenericCandidate = candidates.length === 1 && !candidates[0].typeParameters;
var argCheckMode = !isDecorator && !isSingleNonGenericCandidate && ts.some(args, isContextSensitive) ? 4 /* SkipContextSensitive */ : 0 /* Normal */;
// The following variables are captured and modified by calls to chooseOverload.
// If overload resolution or type argument inference fails, we want to report the
// best error possible. The best error is one which says that an argument was not
// assignable to a parameter. This implies that everything else about the overload
// was fine. So if there is any overload that is only incorrect because of an
// argument, we will report an error on that one.
//
// function foo(s: string): void;
// function foo(n: number): void; // Report argument error on this overload
// function foo(): void;
// foo(true);
//
// If none of the overloads even made it that far, there are two possibilities.
// There was a problem with type arguments for some overload, in which case
// report an error on that. Or none of the overloads even had correct arity,
// in which case give an arity error.
//
// function foo<T extends string>(x: T): void; // Report type argument error
// function foo(): void;
// foo<number>(0);
//
var candidatesForArgumentError;
var candidateForArgumentArityError;
var candidateForTypeArgumentError;
var result;
// If we are in signature help, a trailing comma indicates that we intend to provide another argument,
// so we will only accept overloads with arity at least 1 higher than the current number of provided arguments.
var signatureHelpTrailingComma = !!(checkMode & 16 /* IsForSignatureHelp */) && node.kind === 206 /* CallExpression */ && node.arguments.hasTrailingComma;
// Section 4.12.1:
// if the candidate list contains one or more signatures for which the type of each argument
// expression is a subtype of each corresponding parameter type, the return type of the first
// of those signatures becomes the return type of the function call.
// Otherwise, the return type of the first signature in the candidate list becomes the return
// type of the function call.
//
// Whether the call is an error is determined by assignability of the arguments. The subtype pass
// is just important for choosing the best signature. So in the case where there is only one
// signature, the subtype pass is useless. So skipping it is an optimization.
if (candidates.length > 1) {
result = chooseOverload(candidates, subtypeRelation, isSingleNonGenericCandidate, signatureHelpTrailingComma);
}
if (!result) {
result = chooseOverload(candidates, assignableRelation, isSingleNonGenericCandidate, signatureHelpTrailingComma);
}
if (result) {
return result;
}
// No signatures were applicable. Now report errors based on the last applicable signature with
// no arguments excluded from assignability checks.
// If candidate is undefined, it means that no candidates had a suitable arity. In that case,
// skip the checkApplicableSignature check.
if (reportErrors) {
if (candidatesForArgumentError) {
if (candidatesForArgumentError.length === 1 || candidatesForArgumentError.length > 3) {
var last_2 = candidatesForArgumentError[candidatesForArgumentError.length - 1];
var chain_1;
if (candidatesForArgumentError.length > 3) {
chain_1 = ts.chainDiagnosticMessages(chain_1, ts.Diagnostics.The_last_overload_gave_the_following_error);
chain_1 = ts.chainDiagnosticMessages(chain_1, ts.Diagnostics.No_overload_matches_this_call);
}
var diags = getSignatureApplicabilityError(node, args, last_2, assignableRelation, 0 /* Normal */, /*reportErrors*/ true, function () { return chain_1; });
if (diags) {
for (var _i = 0, diags_1 = diags; _i < diags_1.length; _i++) {
var d = diags_1[_i];
if (last_2.declaration && candidatesForArgumentError.length > 3) {
ts.addRelatedInfo(d, ts.createDiagnosticForNode(last_2.declaration, ts.Diagnostics.The_last_overload_is_declared_here));
}
addImplementationSuccessElaboration(last_2, d);
diagnostics.add(d);
}
}
else {
ts.Debug.fail("No error for last overload signature");
}
}
else {
var allDiagnostics = [];
var max = 0;
var min_3 = Number.MAX_VALUE;
var minIndex = 0;
var i_1 = 0;
var _loop_24 = function (c) {
var chain_2 = function () { return ts.chainDiagnosticMessages(/*details*/ undefined, ts.Diagnostics.Overload_0_of_1_2_gave_the_following_error, i_1 + 1, candidates.length, signatureToString(c)); };
var diags_2 = getSignatureApplicabilityError(node, args, c, assignableRelation, 0 /* Normal */, /*reportErrors*/ true, chain_2);
if (diags_2) {
if (diags_2.length <= min_3) {
min_3 = diags_2.length;
minIndex = i_1;
}
max = Math.max(max, diags_2.length);
allDiagnostics.push(diags_2);
}
else {
ts.Debug.fail("No error for 3 or fewer overload signatures");
}
i_1++;
};
for (var _a = 0, candidatesForArgumentError_1 = candidatesForArgumentError; _a < candidatesForArgumentError_1.length; _a++) {
var c = candidatesForArgumentError_1[_a];
_loop_24(c);
}
var diags_3 = max > 1 ? allDiagnostics[minIndex] : ts.flatten(allDiagnostics);
ts.Debug.assert(diags_3.length > 0, "No errors reported for 3 or fewer overload signatures");
var chain = ts.chainDiagnosticMessages(ts.map(diags_3, function (d) { return typeof d.messageText === "string" ? d : d.messageText; }), ts.Diagnostics.No_overload_matches_this_call);
// The below is a spread to guarantee we get a new (mutable) array - our `flatMap` helper tries to do "smart" optimizations where it reuses input
// arrays and the emptyArray singleton where possible, which is decidedly not what we want while we're still constructing this diagnostic
var related = __spreadArray([], ts.flatMap(diags_3, function (d) { return d.relatedInformation; }), true);
var diag = void 0;
if (ts.every(diags_3, function (d) { return d.start === diags_3[0].start && d.length === diags_3[0].length && d.file === diags_3[0].file; })) {
var _b = diags_3[0], file = _b.file, start = _b.start, length_7 = _b.length;
diag = { file: file, start: start, length: length_7, code: chain.code, category: chain.category, messageText: chain, relatedInformation: related };
}
else {
diag = ts.createDiagnosticForNodeFromMessageChain(node, chain, related);
}
addImplementationSuccessElaboration(candidatesForArgumentError[0], diag);
diagnostics.add(diag);
}
}
else if (candidateForArgumentArityError) {
diagnostics.add(getArgumentArityError(node, [candidateForArgumentArityError], args));
}
else if (candidateForTypeArgumentError) {
checkTypeArguments(candidateForTypeArgumentError, node.typeArguments, /*reportErrors*/ true, fallbackError);
}
else {
var signaturesWithCorrectTypeArgumentArity = ts.filter(signatures, function (s) { return hasCorrectTypeArgumentArity(s, typeArguments); });
if (signaturesWithCorrectTypeArgumentArity.length === 0) {
diagnostics.add(getTypeArgumentArityError(node, signatures, typeArguments));
}
else if (!isDecorator) {
diagnostics.add(getArgumentArityError(node, signaturesWithCorrectTypeArgumentArity, args));
}
else if (fallbackError) {
diagnostics.add(getDiagnosticForCallNode(node, fallbackError));
}
}
}
return getCandidateForOverloadFailure(node, candidates, args, !!candidatesOutArray);
function addImplementationSuccessElaboration(failed, diagnostic) {
var _a, _b;
var oldCandidatesForArgumentError = candidatesForArgumentError;
var oldCandidateForArgumentArityError = candidateForArgumentArityError;
var oldCandidateForTypeArgumentError = candidateForTypeArgumentError;
var failedSignatureDeclarations = ((_b = (_a = failed.declaration) === null || _a === void 0 ? void 0 : _a.symbol) === null || _b === void 0 ? void 0 : _b.declarations) || ts.emptyArray;
var isOverload = failedSignatureDeclarations.length > 1;
var implDecl = isOverload ? ts.find(failedSignatureDeclarations, function (d) { return ts.isFunctionLikeDeclaration(d) && ts.nodeIsPresent(d.body); }) : undefined;
if (implDecl) {
var candidate = getSignatureFromDeclaration(implDecl);
var isSingleNonGenericCandidate_1 = !candidate.typeParameters;
if (chooseOverload([candidate], assignableRelation, isSingleNonGenericCandidate_1)) {
ts.addRelatedInfo(diagnostic, ts.createDiagnosticForNode(implDecl, ts.Diagnostics.The_call_would_have_succeeded_against_this_implementation_but_implementation_signatures_of_overloads_are_not_externally_visible));
}
}
candidatesForArgumentError = oldCandidatesForArgumentError;
candidateForArgumentArityError = oldCandidateForArgumentArityError;
candidateForTypeArgumentError = oldCandidateForTypeArgumentError;
}
function chooseOverload(candidates, relation, isSingleNonGenericCandidate, signatureHelpTrailingComma) {
if (signatureHelpTrailingComma === void 0) { signatureHelpTrailingComma = false; }
candidatesForArgumentError = undefined;
candidateForArgumentArityError = undefined;
candidateForTypeArgumentError = undefined;
if (isSingleNonGenericCandidate) {
var candidate = candidates[0];
if (ts.some(typeArguments) || !hasCorrectArity(node, args, candidate, signatureHelpTrailingComma)) {
return undefined;
}
if (getSignatureApplicabilityError(node, args, candidate, relation, 0 /* Normal */, /*reportErrors*/ false, /*containingMessageChain*/ undefined)) {
candidatesForArgumentError = [candidate];
return undefined;
}
return candidate;
}
for (var candidateIndex = 0; candidateIndex < candidates.length; candidateIndex++) {
var candidate = candidates[candidateIndex];
if (!hasCorrectTypeArgumentArity(candidate, typeArguments) || !hasCorrectArity(node, args, candidate, signatureHelpTrailingComma)) {
continue;
}
var checkCandidate = void 0;
var inferenceContext = void 0;
if (candidate.typeParameters) {
var typeArgumentTypes = void 0;
if (ts.some(typeArguments)) {
typeArgumentTypes = checkTypeArguments(candidate, typeArguments, /*reportErrors*/ false);
if (!typeArgumentTypes) {
candidateForTypeArgumentError = candidate;
continue;
}
}
else {
inferenceContext = createInferenceContext(candidate.typeParameters, candidate, /*flags*/ ts.isInJSFile(node) ? 2 /* AnyDefault */ : 0 /* None */);
typeArgumentTypes = inferTypeArguments(node, candidate, args, argCheckMode | 8 /* SkipGenericFunctions */, inferenceContext);
argCheckMode |= inferenceContext.flags & 4 /* SkippedGenericFunction */ ? 8 /* SkipGenericFunctions */ : 0 /* Normal */;
}
checkCandidate = getSignatureInstantiation(candidate, typeArgumentTypes, ts.isInJSFile(candidate.declaration), inferenceContext && inferenceContext.inferredTypeParameters);
// If the original signature has a generic rest type, instantiation may produce a
// signature with different arity and we need to perform another arity check.
if (getNonArrayRestType(candidate) && !hasCorrectArity(node, args, checkCandidate, signatureHelpTrailingComma)) {
candidateForArgumentArityError = checkCandidate;
continue;
}
}
else {
checkCandidate = candidate;
}
if (getSignatureApplicabilityError(node, args, checkCandidate, relation, argCheckMode, /*reportErrors*/ false, /*containingMessageChain*/ undefined)) {
// Give preference to error candidates that have no rest parameters (as they are more specific)
(candidatesForArgumentError || (candidatesForArgumentError = [])).push(checkCandidate);
continue;
}
if (argCheckMode) {
// If one or more context sensitive arguments were excluded, we start including
// them now (and keeping do so for any subsequent candidates) and perform a second
// round of type inference and applicability checking for this particular candidate.
argCheckMode = 0 /* Normal */;
if (inferenceContext) {
var typeArgumentTypes = inferTypeArguments(node, candidate, args, argCheckMode, inferenceContext);
checkCandidate = getSignatureInstantiation(candidate, typeArgumentTypes, ts.isInJSFile(candidate.declaration), inferenceContext && inferenceContext.inferredTypeParameters);
// If the original signature has a generic rest type, instantiation may produce a
// signature with different arity and we need to perform another arity check.
if (getNonArrayRestType(candidate) && !hasCorrectArity(node, args, checkCandidate, signatureHelpTrailingComma)) {
candidateForArgumentArityError = checkCandidate;
continue;
}
}
if (getSignatureApplicabilityError(node, args, checkCandidate, relation, argCheckMode, /*reportErrors*/ false, /*containingMessageChain*/ undefined)) {
// Give preference to error candidates that have no rest parameters (as they are more specific)
(candidatesForArgumentError || (candidatesForArgumentError = [])).push(checkCandidate);
continue;
}
}
candidates[candidateIndex] = checkCandidate;
return checkCandidate;
}
return undefined;
}
}
// No signature was applicable. We have already reported the errors for the invalid signature.
function getCandidateForOverloadFailure(node, candidates, args, hasCandidatesOutArray) {
ts.Debug.assert(candidates.length > 0); // Else should not have called this.
checkNodeDeferred(node);
// Normally we will combine overloads. Skip this if they have type parameters since that's hard to combine.
// Don't do this if there is a `candidatesOutArray`,
// because then we want the chosen best candidate to be one of the overloads, not a combination.
return hasCandidatesOutArray || candidates.length === 1 || candidates.some(function (c) { return !!c.typeParameters; })
? pickLongestCandidateSignature(node, candidates, args)
: createUnionOfSignaturesForOverloadFailure(candidates);
}
function createUnionOfSignaturesForOverloadFailure(candidates) {
var thisParameters = ts.mapDefined(candidates, function (c) { return c.thisParameter; });
var thisParameter;
if (thisParameters.length) {
thisParameter = createCombinedSymbolFromTypes(thisParameters, thisParameters.map(getTypeOfParameter));
}
var _a = ts.minAndMax(candidates, getNumNonRestParameters), minArgumentCount = _a.min, maxNonRestParam = _a.max;
var parameters = [];
var _loop_25 = function (i) {
var symbols = ts.mapDefined(candidates, function (s) { return signatureHasRestParameter(s) ?
i < s.parameters.length - 1 ? s.parameters[i] : ts.last(s.parameters) :
i < s.parameters.length ? s.parameters[i] : undefined; });
ts.Debug.assert(symbols.length !== 0);
parameters.push(createCombinedSymbolFromTypes(symbols, ts.mapDefined(candidates, function (candidate) { return tryGetTypeAtPosition(candidate, i); })));
};
for (var i = 0; i < maxNonRestParam; i++) {
_loop_25(i);
}
var restParameterSymbols = ts.mapDefined(candidates, function (c) { return signatureHasRestParameter(c) ? ts.last(c.parameters) : undefined; });
var flags = 0 /* None */;
if (restParameterSymbols.length !== 0) {
var type = createArrayType(getUnionType(ts.mapDefined(candidates, tryGetRestTypeOfSignature), 2 /* Subtype */));
parameters.push(createCombinedSymbolForOverloadFailure(restParameterSymbols, type));
flags |= 1 /* HasRestParameter */;
}
if (candidates.some(signatureHasLiteralTypes)) {
flags |= 2 /* HasLiteralTypes */;
}
return createSignature(candidates[0].declaration,
/*typeParameters*/ undefined, // Before calling this we tested for `!candidates.some(c => !!c.typeParameters)`.
thisParameter, parameters,
/*resolvedReturnType*/ getIntersectionType(candidates.map(getReturnTypeOfSignature)),
/*typePredicate*/ undefined, minArgumentCount, flags);
}
function getNumNonRestParameters(signature) {
var numParams = signature.parameters.length;
return signatureHasRestParameter(signature) ? numParams - 1 : numParams;
}
function createCombinedSymbolFromTypes(sources, types) {
return createCombinedSymbolForOverloadFailure(sources, getUnionType(types, 2 /* Subtype */));
}
function createCombinedSymbolForOverloadFailure(sources, type) {
// This function is currently only used for erroneous overloads, so it's good enough to just use the first source.
return createSymbolWithType(ts.first(sources), type);
}
function pickLongestCandidateSignature(node, candidates, args) {
// Pick the longest signature. This way we can get a contextual type for cases like:
// declare function f(a: { xa: number; xb: number; }, b: number);
// f({ |
// Also, use explicitly-supplied type arguments if they are provided, so we can get a contextual signature in cases like:
// declare function f<T>(k: keyof T);
// f<Foo>("
var bestIndex = getLongestCandidateIndex(candidates, apparentArgumentCount === undefined ? args.length : apparentArgumentCount);
var candidate = candidates[bestIndex];
var typeParameters = candidate.typeParameters;
if (!typeParameters) {
return candidate;
}
var typeArgumentNodes = callLikeExpressionMayHaveTypeArguments(node) ? node.typeArguments : undefined;
var instantiated = typeArgumentNodes
? createSignatureInstantiation(candidate, getTypeArgumentsFromNodes(typeArgumentNodes, typeParameters, ts.isInJSFile(node)))
: inferSignatureInstantiationForOverloadFailure(node, typeParameters, candidate, args);
candidates[bestIndex] = instantiated;
return instantiated;
}
function getTypeArgumentsFromNodes(typeArgumentNodes, typeParameters, isJs) {
var typeArguments = typeArgumentNodes.map(getTypeOfNode);
while (typeArguments.length > typeParameters.length) {
typeArguments.pop();
}
while (typeArguments.length < typeParameters.length) {
typeArguments.push(getConstraintOfTypeParameter(typeParameters[typeArguments.length]) || getDefaultTypeArgumentType(isJs));
}
return typeArguments;
}
function inferSignatureInstantiationForOverloadFailure(node, typeParameters, candidate, args) {
var inferenceContext = createInferenceContext(typeParameters, candidate, /*flags*/ ts.isInJSFile(node) ? 2 /* AnyDefault */ : 0 /* None */);
var typeArgumentTypes = inferTypeArguments(node, candidate, args, 4 /* SkipContextSensitive */ | 8 /* SkipGenericFunctions */, inferenceContext);
return createSignatureInstantiation(candidate, typeArgumentTypes);
}
function getLongestCandidateIndex(candidates, argsCount) {
var maxParamsIndex = -1;
var maxParams = -1;
for (var i = 0; i < candidates.length; i++) {
var candidate = candidates[i];
var paramCount = getParameterCount(candidate);
if (hasEffectiveRestParameter(candidate) || paramCount >= argsCount) {
return i;
}
if (paramCount > maxParams) {
maxParams = paramCount;
maxParamsIndex = i;
}
}
return maxParamsIndex;
}
function resolveCallExpression(node, candidatesOutArray, checkMode) {
if (node.expression.kind === 106 /* SuperKeyword */) {
var superType = checkSuperExpression(node.expression);
if (isTypeAny(superType)) {
for (var _i = 0, _a = node.arguments; _i < _a.length; _i++) {
var arg = _a[_i];
checkExpression(arg); // Still visit arguments so they get marked for visibility, etc
}
return anySignature;
}
if (superType !== errorType) {
// In super call, the candidate signatures are the matching arity signatures of the base constructor function instantiated
// with the type arguments specified in the extends clause.
var baseTypeNode = ts.getEffectiveBaseTypeNode(ts.getContainingClass(node));
if (baseTypeNode) {
var baseConstructors = getInstantiatedConstructorsForTypeArguments(superType, baseTypeNode.typeArguments, baseTypeNode);
return resolveCall(node, baseConstructors, candidatesOutArray, checkMode, 0 /* None */);
}
}
return resolveUntypedCall(node);
}
var callChainFlags;
var funcType = checkExpression(node.expression);
if (ts.isCallChain(node)) {
var nonOptionalType = getOptionalExpressionType(funcType, node.expression);
callChainFlags = nonOptionalType === funcType ? 0 /* None */ :
ts.isOutermostOptionalChain(node) ? 16 /* IsOuterCallChain */ :
8 /* IsInnerCallChain */;
funcType = nonOptionalType;
}
else {
callChainFlags = 0 /* None */;
}
funcType = checkNonNullTypeWithReporter(funcType, node.expression, reportCannotInvokePossiblyNullOrUndefinedError);
if (funcType === silentNeverType) {
return silentNeverSignature;
}
var apparentType = getApparentType(funcType);
if (apparentType === errorType) {
// Another error has already been reported
return resolveErrorCall(node);
}
// Technically, this signatures list may be incomplete. We are taking the apparent type,
// but we are not including call signatures that may have been added to the Object or
// Function interface, since they have none by default. This is a bit of a leap of faith
// that the user will not add any.
var callSignatures = getSignaturesOfType(apparentType, 0 /* Call */);
var numConstructSignatures = getSignaturesOfType(apparentType, 1 /* Construct */).length;
// TS 1.0 Spec: 4.12
// In an untyped function call no TypeArgs are permitted, Args can be any argument list, no contextual
// types are provided for the argument expressions, and the result is always of type Any.
if (isUntypedFunctionCall(funcType, apparentType, callSignatures.length, numConstructSignatures)) {
// The unknownType indicates that an error already occurred (and was reported). No
// need to report another error in this case.
if (funcType !== errorType && node.typeArguments) {
error(node, ts.Diagnostics.Untyped_function_calls_may_not_accept_type_arguments);
}
return resolveUntypedCall(node);
}
// If FuncExpr's apparent type(section 3.8.1) is a function type, the call is a typed function call.
// TypeScript employs overload resolution in typed function calls in order to support functions
// with multiple call signatures.
if (!callSignatures.length) {
if (numConstructSignatures) {
error(node, ts.Diagnostics.Value_of_type_0_is_not_callable_Did_you_mean_to_include_new, typeToString(funcType));
}
else {
var relatedInformation = void 0;
if (node.arguments.length === 1) {
var text = ts.getSourceFileOfNode(node).text;
if (ts.isLineBreak(text.charCodeAt(ts.skipTrivia(text, node.expression.end, /* stopAfterLineBreak */ true) - 1))) {
relatedInformation = ts.createDiagnosticForNode(node.expression, ts.Diagnostics.Are_you_missing_a_semicolon);
}
}
invocationError(node.expression, apparentType, 0 /* Call */, relatedInformation);
}
return resolveErrorCall(node);
}
// When a call to a generic function is an argument to an outer call to a generic function for which
// inference is in process, we have a choice to make. If the inner call relies on inferences made from
// its contextual type to its return type, deferring the inner call processing allows the best possible
// contextual type to accumulate. But if the outer call relies on inferences made from the return type of
// the inner call, the inner call should be processed early. There's no sure way to know which choice is
// right (only a full unification algorithm can determine that), so we resort to the following heuristic:
// If no type arguments are specified in the inner call and at least one call signature is generic and
// returns a function type, we choose to defer processing. This narrowly permits function composition
// operators to flow inferences through return types, but otherwise processes calls right away. We
// use the resolvingSignature singleton to indicate that we deferred processing. This result will be
// propagated out and eventually turned into nonInferrableType (a type that is assignable to anything and
// from which we never make inferences).
if (checkMode & 8 /* SkipGenericFunctions */ && !node.typeArguments && callSignatures.some(isGenericFunctionReturningFunction)) {
skippedGenericFunction(node, checkMode);
return resolvingSignature;
}
// If the function is explicitly marked with `@class`, then it must be constructed.
if (callSignatures.some(function (sig) { return ts.isInJSFile(sig.declaration) && !!ts.getJSDocClassTag(sig.declaration); })) {
error(node, ts.Diagnostics.Value_of_type_0_is_not_callable_Did_you_mean_to_include_new, typeToString(funcType));
return resolveErrorCall(node);
}
return resolveCall(node, callSignatures, candidatesOutArray, checkMode, callChainFlags);
}
function isGenericFunctionReturningFunction(signature) {
return !!(signature.typeParameters && isFunctionType(getReturnTypeOfSignature(signature)));
}
/**
* TS 1.0 spec: 4.12
* If FuncExpr is of type Any, or of an object type that has no call or construct signatures
* but is a subtype of the Function interface, the call is an untyped function call.
*/
function isUntypedFunctionCall(funcType, apparentFuncType, numCallSignatures, numConstructSignatures) {
// We exclude union types because we may have a union of function types that happen to have no common signatures.
return isTypeAny(funcType) || isTypeAny(apparentFuncType) && !!(funcType.flags & 262144 /* TypeParameter */) ||
!numCallSignatures && !numConstructSignatures && !(apparentFuncType.flags & 1048576 /* Union */) && !(getReducedType(apparentFuncType).flags & 131072 /* Never */) && isTypeAssignableTo(funcType, globalFunctionType);
}
function resolveNewExpression(node, candidatesOutArray, checkMode) {
if (node.arguments && languageVersion < 1 /* ES5 */) {
var spreadIndex = getSpreadArgumentIndex(node.arguments);
if (spreadIndex >= 0) {
error(node.arguments[spreadIndex], ts.Diagnostics.Spread_operator_in_new_expressions_is_only_available_when_targeting_ECMAScript_5_and_higher);
}
}
var expressionType = checkNonNullExpression(node.expression);
if (expressionType === silentNeverType) {
return silentNeverSignature;
}
// If expressionType's apparent type(section 3.8.1) is an object type with one or
// more construct signatures, the expression is processed in the same manner as a
// function call, but using the construct signatures as the initial set of candidate
// signatures for overload resolution. The result type of the function call becomes
// the result type of the operation.
expressionType = getApparentType(expressionType);
if (expressionType === errorType) {
// Another error has already been reported
return resolveErrorCall(node);
}
// TS 1.0 spec: 4.11
// If expressionType is of type Any, Args can be any argument
// list and the result of the operation is of type Any.
if (isTypeAny(expressionType)) {
if (node.typeArguments) {
error(node, ts.Diagnostics.Untyped_function_calls_may_not_accept_type_arguments);
}
return resolveUntypedCall(node);
}
// Technically, this signatures list may be incomplete. We are taking the apparent type,
// but we are not including construct signatures that may have been added to the Object or
// Function interface, since they have none by default. This is a bit of a leap of faith
// that the user will not add any.
var constructSignatures = getSignaturesOfType(expressionType, 1 /* Construct */);
if (constructSignatures.length) {
if (!isConstructorAccessible(node, constructSignatures[0])) {
return resolveErrorCall(node);
}
// If the expression is a class of abstract type, or an abstract construct signature,
// then it cannot be instantiated.
// In the case of a merged class-module or class-interface declaration,
// only the class declaration node will have the Abstract flag set.
if (constructSignatures.some(function (signature) { return signature.flags & 4 /* Abstract */; })) {
error(node, ts.Diagnostics.Cannot_create_an_instance_of_an_abstract_class);
return resolveErrorCall(node);
}
var valueDecl = expressionType.symbol && ts.getClassLikeDeclarationOfSymbol(expressionType.symbol);
if (valueDecl && ts.hasSyntacticModifier(valueDecl, 128 /* Abstract */)) {
error(node, ts.Diagnostics.Cannot_create_an_instance_of_an_abstract_class);
return resolveErrorCall(node);
}
return resolveCall(node, constructSignatures, candidatesOutArray, checkMode, 0 /* None */);
}
// If expressionType's apparent type is an object type with no construct signatures but
// one or more call signatures, the expression is processed as a function call. A compile-time
// error occurs if the result of the function call is not Void. The type of the result of the
// operation is Any. It is an error to have a Void this type.
var callSignatures = getSignaturesOfType(expressionType, 0 /* Call */);
if (callSignatures.length) {
var signature = resolveCall(node, callSignatures, candidatesOutArray, checkMode, 0 /* None */);
if (!noImplicitAny) {
if (signature.declaration && !isJSConstructor(signature.declaration) && getReturnTypeOfSignature(signature) !== voidType) {
error(node, ts.Diagnostics.Only_a_void_function_can_be_called_with_the_new_keyword);
}
if (getThisTypeOfSignature(signature) === voidType) {
error(node, ts.Diagnostics.A_function_that_is_called_with_the_new_keyword_cannot_have_a_this_type_that_is_void);
}
}
return signature;
}
invocationError(node.expression, expressionType, 1 /* Construct */);
return resolveErrorCall(node);
}
function typeHasProtectedAccessibleBase(target, type) {
var baseTypes = getBaseTypes(type);
if (!ts.length(baseTypes)) {
return false;
}
var firstBase = baseTypes[0];
if (firstBase.flags & 2097152 /* Intersection */) {
var types = firstBase.types;
var mixinFlags = findMixins(types);
var i = 0;
for (var _i = 0, _a = firstBase.types; _i < _a.length; _i++) {
var intersectionMember = _a[_i];
// We want to ignore mixin ctors
if (!mixinFlags[i]) {
if (ts.getObjectFlags(intersectionMember) & (1 /* Class */ | 2 /* Interface */)) {
if (intersectionMember.symbol === target) {
return true;
}
if (typeHasProtectedAccessibleBase(target, intersectionMember)) {
return true;
}
}
}
i++;
}
return false;
}
if (firstBase.symbol === target) {
return true;
}
return typeHasProtectedAccessibleBase(target, firstBase);
}
function isConstructorAccessible(node, signature) {
if (!signature || !signature.declaration) {
return true;
}
var declaration = signature.declaration;
var modifiers = ts.getSelectedEffectiveModifierFlags(declaration, 24 /* NonPublicAccessibilityModifier */);
// (1) Public constructors and (2) constructor functions are always accessible.
if (!modifiers || declaration.kind !== 169 /* Constructor */) {
return true;
}
var declaringClassDeclaration = ts.getClassLikeDeclarationOfSymbol(declaration.parent.symbol);
var declaringClass = getDeclaredTypeOfSymbol(declaration.parent.symbol);
// A private or protected constructor can only be instantiated within its own class (or a subclass, for protected)
if (!isNodeWithinClass(node, declaringClassDeclaration)) {
var containingClass = ts.getContainingClass(node);
if (containingClass && modifiers & 16 /* Protected */) {
var containingType = getTypeOfNode(containingClass);
if (typeHasProtectedAccessibleBase(declaration.parent.symbol, containingType)) {
return true;
}
}
if (modifiers & 8 /* Private */) {
error(node, ts.Diagnostics.Constructor_of_class_0_is_private_and_only_accessible_within_the_class_declaration, typeToString(declaringClass));
}
if (modifiers & 16 /* Protected */) {
error(node, ts.Diagnostics.Constructor_of_class_0_is_protected_and_only_accessible_within_the_class_declaration, typeToString(declaringClass));
}
return false;
}
return true;
}
function invocationErrorDetails(errorTarget, apparentType, kind) {
var errorInfo;
var isCall = kind === 0 /* Call */;
var awaitedType = getAwaitedType(apparentType);
var maybeMissingAwait = awaitedType && getSignaturesOfType(awaitedType, kind).length > 0;
if (apparentType.flags & 1048576 /* Union */) {
var types = apparentType.types;
var hasSignatures = false;
for (var _i = 0, types_20 = types; _i < types_20.length; _i++) {
var constituent = types_20[_i];
var signatures = getSignaturesOfType(constituent, kind);
if (signatures.length !== 0) {
hasSignatures = true;
if (errorInfo) {
// Bail early if we already have an error, no chance of "No constituent of type is callable"
break;
}
}
else {
// Error on the first non callable constituent only
if (!errorInfo) {
errorInfo = ts.chainDiagnosticMessages(errorInfo, isCall ?
ts.Diagnostics.Type_0_has_no_call_signatures :
ts.Diagnostics.Type_0_has_no_construct_signatures, typeToString(constituent));
errorInfo = ts.chainDiagnosticMessages(errorInfo, isCall ?
ts.Diagnostics.Not_all_constituents_of_type_0_are_callable :
ts.Diagnostics.Not_all_constituents_of_type_0_are_constructable, typeToString(apparentType));
}
if (hasSignatures) {
// Bail early if we already found a siganture, no chance of "No constituent of type is callable"
break;
}
}
}
if (!hasSignatures) {
errorInfo = ts.chainDiagnosticMessages(
/* detials */ undefined, isCall ?
ts.Diagnostics.No_constituent_of_type_0_is_callable :
ts.Diagnostics.No_constituent_of_type_0_is_constructable, typeToString(apparentType));
}
if (!errorInfo) {
errorInfo = ts.chainDiagnosticMessages(errorInfo, isCall ?
ts.Diagnostics.Each_member_of_the_union_type_0_has_signatures_but_none_of_those_signatures_are_compatible_with_each_other :
ts.Diagnostics.Each_member_of_the_union_type_0_has_construct_signatures_but_none_of_those_signatures_are_compatible_with_each_other, typeToString(apparentType));
}
}
else {
errorInfo = ts.chainDiagnosticMessages(errorInfo, isCall ?
ts.Diagnostics.Type_0_has_no_call_signatures :
ts.Diagnostics.Type_0_has_no_construct_signatures, typeToString(apparentType));
}
var headMessage = isCall ? ts.Diagnostics.This_expression_is_not_callable : ts.Diagnostics.This_expression_is_not_constructable;
// Diagnose get accessors incorrectly called as functions
if (ts.isCallExpression(errorTarget.parent) && errorTarget.parent.arguments.length === 0) {
var resolvedSymbol = getNodeLinks(errorTarget).resolvedSymbol;
if (resolvedSymbol && resolvedSymbol.flags & 32768 /* GetAccessor */) {
headMessage = ts.Diagnostics.This_expression_is_not_callable_because_it_is_a_get_accessor_Did_you_mean_to_use_it_without;
}
}
return {
messageChain: ts.chainDiagnosticMessages(errorInfo, headMessage),
relatedMessage: maybeMissingAwait ? ts.Diagnostics.Did_you_forget_to_use_await : undefined,
};
}
function invocationError(errorTarget, apparentType, kind, relatedInformation) {
var _a = invocationErrorDetails(errorTarget, apparentType, kind), messageChain = _a.messageChain, relatedInfo = _a.relatedMessage;
var diagnostic = ts.createDiagnosticForNodeFromMessageChain(errorTarget, messageChain);
if (relatedInfo) {
ts.addRelatedInfo(diagnostic, ts.createDiagnosticForNode(errorTarget, relatedInfo));
}
if (ts.isCallExpression(errorTarget.parent)) {
var _b = getDiagnosticSpanForCallNode(errorTarget.parent, /* doNotIncludeArguments */ true), start = _b.start, length_8 = _b.length;
diagnostic.start = start;
diagnostic.length = length_8;
}
diagnostics.add(diagnostic);
invocationErrorRecovery(apparentType, kind, relatedInformation ? ts.addRelatedInfo(diagnostic, relatedInformation) : diagnostic);
}
function invocationErrorRecovery(apparentType, kind, diagnostic) {
if (!apparentType.symbol) {
return;
}
var importNode = getSymbolLinks(apparentType.symbol).originatingImport;
// Create a diagnostic on the originating import if possible onto which we can attach a quickfix
// An import call expression cannot be rewritten into another form to correct the error - the only solution is to use `.default` at the use-site
if (importNode && !ts.isImportCall(importNode)) {
var sigs = getSignaturesOfType(getTypeOfSymbol(getSymbolLinks(apparentType.symbol).target), kind);
if (!sigs || !sigs.length)
return;
ts.addRelatedInfo(diagnostic, ts.createDiagnosticForNode(importNode, ts.Diagnostics.Type_originates_at_this_import_A_namespace_style_import_cannot_be_called_or_constructed_and_will_cause_a_failure_at_runtime_Consider_using_a_default_import_or_import_require_here_instead));
}
}
function resolveTaggedTemplateExpression(node, candidatesOutArray, checkMode) {
var tagType = checkExpression(node.tag);
var apparentType = getApparentType(tagType);
if (apparentType === errorType) {
// Another error has already been reported
return resolveErrorCall(node);
}
var callSignatures = getSignaturesOfType(apparentType, 0 /* Call */);
var numConstructSignatures = getSignaturesOfType(apparentType, 1 /* Construct */).length;
if (isUntypedFunctionCall(tagType, apparentType, callSignatures.length, numConstructSignatures)) {
return resolveUntypedCall(node);
}
if (!callSignatures.length) {
if (ts.isArrayLiteralExpression(node.parent)) {
var diagnostic = ts.createDiagnosticForNode(node.tag, ts.Diagnostics.It_is_likely_that_you_are_missing_a_comma_to_separate_these_two_template_expressions_They_form_a_tagged_template_expression_which_cannot_be_invoked);
diagnostics.add(diagnostic);
return resolveErrorCall(node);
}
invocationError(node.tag, apparentType, 0 /* Call */);
return resolveErrorCall(node);
}
return resolveCall(node, callSignatures, candidatesOutArray, checkMode, 0 /* None */);
}
/**
* Gets the localized diagnostic head message to use for errors when resolving a decorator as a call expression.
*/
function getDiagnosticHeadMessageForDecoratorResolution(node) {
switch (node.parent.kind) {
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
return ts.Diagnostics.Unable_to_resolve_signature_of_class_decorator_when_called_as_an_expression;
case 162 /* Parameter */:
return ts.Diagnostics.Unable_to_resolve_signature_of_parameter_decorator_when_called_as_an_expression;
case 165 /* PropertyDeclaration */:
return ts.Diagnostics.Unable_to_resolve_signature_of_property_decorator_when_called_as_an_expression;
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return ts.Diagnostics.Unable_to_resolve_signature_of_method_decorator_when_called_as_an_expression;
default:
return ts.Debug.fail();
}
}
/**
* Resolves a decorator as if it were a call expression.
*/
function resolveDecorator(node, candidatesOutArray, checkMode) {
var funcType = checkExpression(node.expression);
var apparentType = getApparentType(funcType);
if (apparentType === errorType) {
return resolveErrorCall(node);
}
var callSignatures = getSignaturesOfType(apparentType, 0 /* Call */);
var numConstructSignatures = getSignaturesOfType(apparentType, 1 /* Construct */).length;
if (isUntypedFunctionCall(funcType, apparentType, callSignatures.length, numConstructSignatures)) {
return resolveUntypedCall(node);
}
if (isPotentiallyUncalledDecorator(node, callSignatures)) {
var nodeStr = ts.getTextOfNode(node.expression, /*includeTrivia*/ false);
error(node, ts.Diagnostics._0_accepts_too_few_arguments_to_be_used_as_a_decorator_here_Did_you_mean_to_call_it_first_and_write_0, nodeStr);
return resolveErrorCall(node);
}
var headMessage = getDiagnosticHeadMessageForDecoratorResolution(node);
if (!callSignatures.length) {
var errorDetails = invocationErrorDetails(node.expression, apparentType, 0 /* Call */);
var messageChain = ts.chainDiagnosticMessages(errorDetails.messageChain, headMessage);
var diag = ts.createDiagnosticForNodeFromMessageChain(node.expression, messageChain);
if (errorDetails.relatedMessage) {
ts.addRelatedInfo(diag, ts.createDiagnosticForNode(node.expression, errorDetails.relatedMessage));
}
diagnostics.add(diag);
invocationErrorRecovery(apparentType, 0 /* Call */, diag);
return resolveErrorCall(node);
}
return resolveCall(node, callSignatures, candidatesOutArray, checkMode, 0 /* None */, headMessage);
}
function createSignatureForJSXIntrinsic(node, result) {
var namespace = getJsxNamespaceAt(node);
var exports = namespace && getExportsOfSymbol(namespace);
// We fake up a SFC signature for each intrinsic, however a more specific per-element signature drawn from the JSX declaration
// file would probably be preferable.
var typeSymbol = exports && getSymbol(exports, JsxNames.Element, 788968 /* Type */);
var returnNode = typeSymbol && nodeBuilder.symbolToEntityName(typeSymbol, 788968 /* Type */, node);
var declaration = ts.factory.createFunctionTypeNode(/*typeParameters*/ undefined, [ts.factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotdotdot*/ undefined, "props", /*questionMark*/ undefined, nodeBuilder.typeToTypeNode(result, node))], returnNode ? ts.factory.createTypeReferenceNode(returnNode, /*typeArguments*/ undefined) : ts.factory.createKeywordTypeNode(129 /* AnyKeyword */));
var parameterSymbol = createSymbol(1 /* FunctionScopedVariable */, "props");
parameterSymbol.type = result;
return createSignature(declaration,
/*typeParameters*/ undefined,
/*thisParameter*/ undefined, [parameterSymbol], typeSymbol ? getDeclaredTypeOfSymbol(typeSymbol) : errorType,
/*returnTypePredicate*/ undefined, 1, 0 /* None */);
}
function resolveJsxOpeningLikeElement(node, candidatesOutArray, checkMode) {
if (isJsxIntrinsicIdentifier(node.tagName)) {
var result = getIntrinsicAttributesTypeFromJsxOpeningLikeElement(node);
var fakeSignature = createSignatureForJSXIntrinsic(node, result);
checkTypeAssignableToAndOptionallyElaborate(checkExpressionWithContextualType(node.attributes, getEffectiveFirstArgumentForJsxSignature(fakeSignature, node), /*mapper*/ undefined, 0 /* Normal */), result, node.tagName, node.attributes);
if (ts.length(node.typeArguments)) {
ts.forEach(node.typeArguments, checkSourceElement);
diagnostics.add(ts.createDiagnosticForNodeArray(ts.getSourceFileOfNode(node), node.typeArguments, ts.Diagnostics.Expected_0_type_arguments_but_got_1, 0, ts.length(node.typeArguments)));
}
return fakeSignature;
}
var exprTypes = checkExpression(node.tagName);
var apparentType = getApparentType(exprTypes);
if (apparentType === errorType) {
return resolveErrorCall(node);
}
var signatures = getUninstantiatedJsxSignaturesOfType(exprTypes, node);
if (isUntypedFunctionCall(exprTypes, apparentType, signatures.length, /*constructSignatures*/ 0)) {
return resolveUntypedCall(node);
}
if (signatures.length === 0) {
// We found no signatures at all, which is an error
error(node.tagName, ts.Diagnostics.JSX_element_type_0_does_not_have_any_construct_or_call_signatures, ts.getTextOfNode(node.tagName));
return resolveErrorCall(node);
}
return resolveCall(node, signatures, candidatesOutArray, checkMode, 0 /* None */);
}
/**
* Sometimes, we have a decorator that could accept zero arguments,
* but is receiving too many arguments as part of the decorator invocation.
* In those cases, a user may have meant to *call* the expression before using it as a decorator.
*/
function isPotentiallyUncalledDecorator(decorator, signatures) {
return signatures.length && ts.every(signatures, function (signature) {
return signature.minArgumentCount === 0 &&
!signatureHasRestParameter(signature) &&
signature.parameters.length < getDecoratorArgumentCount(decorator, signature);
});
}
function resolveSignature(node, candidatesOutArray, checkMode) {
switch (node.kind) {
case 206 /* CallExpression */:
return resolveCallExpression(node, candidatesOutArray, checkMode);
case 207 /* NewExpression */:
return resolveNewExpression(node, candidatesOutArray, checkMode);
case 208 /* TaggedTemplateExpression */:
return resolveTaggedTemplateExpression(node, candidatesOutArray, checkMode);
case 163 /* Decorator */:
return resolveDecorator(node, candidatesOutArray, checkMode);
case 278 /* JsxOpeningElement */:
case 277 /* JsxSelfClosingElement */:
return resolveJsxOpeningLikeElement(node, candidatesOutArray, checkMode);
}
throw ts.Debug.assertNever(node, "Branch in 'resolveSignature' should be unreachable.");
}
/**
* Resolve a signature of a given call-like expression.
* @param node a call-like expression to try resolve a signature for
* @param candidatesOutArray an array of signature to be filled in by the function. It is passed by signature help in the language service;
* the function will fill it up with appropriate candidate signatures
* @return a signature of the call-like expression or undefined if one can't be found
*/
function getResolvedSignature(node, candidatesOutArray, checkMode) {
var links = getNodeLinks(node);
// If getResolvedSignature has already been called, we will have cached the resolvedSignature.
// However, it is possible that either candidatesOutArray was not passed in the first time,
// or that a different candidatesOutArray was passed in. Therefore, we need to redo the work
// to correctly fill the candidatesOutArray.
var cached = links.resolvedSignature;
if (cached && cached !== resolvingSignature && !candidatesOutArray) {
return cached;
}
links.resolvedSignature = resolvingSignature;
var result = resolveSignature(node, candidatesOutArray, checkMode || 0 /* Normal */);
// When CheckMode.SkipGenericFunctions is set we use resolvingSignature to indicate that call
// resolution should be deferred.
if (result !== resolvingSignature) {
// If signature resolution originated in control flow type analysis (for example to compute the
// assigned type in a flow assignment) we don't cache the result as it may be based on temporary
// types from the control flow analysis.
links.resolvedSignature = flowLoopStart === flowLoopCount ? result : cached;
}
return result;
}
/**
* Indicates whether a declaration can be treated as a constructor in a JavaScript
* file.
*/
function isJSConstructor(node) {
var _a;
if (!node || !ts.isInJSFile(node)) {
return false;
}
var func = ts.isFunctionDeclaration(node) || ts.isFunctionExpression(node) ? node :
ts.isVariableDeclaration(node) && node.initializer && ts.isFunctionExpression(node.initializer) ? node.initializer :
undefined;
if (func) {
// If the node has a @class tag, treat it like a constructor.
if (ts.getJSDocClassTag(node))
return true;
// If the symbol of the node has members, treat it like a constructor.
var symbol = getSymbolOfNode(func);
return !!((_a = symbol === null || symbol === void 0 ? void 0 : symbol.members) === null || _a === void 0 ? void 0 : _a.size);
}
return false;
}
function mergeJSSymbols(target, source) {
var _a, _b;
if (source) {
var links = getSymbolLinks(source);
if (!links.inferredClassSymbol || !links.inferredClassSymbol.has(getSymbolId(target))) {
var inferred = ts.isTransientSymbol(target) ? target : cloneSymbol(target);
inferred.exports = inferred.exports || ts.createSymbolTable();
inferred.members = inferred.members || ts.createSymbolTable();
inferred.flags |= source.flags & 32 /* Class */;
if ((_a = source.exports) === null || _a === void 0 ? void 0 : _a.size) {
mergeSymbolTable(inferred.exports, source.exports);
}
if ((_b = source.members) === null || _b === void 0 ? void 0 : _b.size) {
mergeSymbolTable(inferred.members, source.members);
}
(links.inferredClassSymbol || (links.inferredClassSymbol = new ts.Map())).set(getSymbolId(inferred), inferred);
return inferred;
}
return links.inferredClassSymbol.get(getSymbolId(target));
}
}
function getAssignedClassSymbol(decl) {
var _a;
var assignmentSymbol = decl && getSymbolOfExpando(decl, /*allowDeclaration*/ true);
var prototype = (_a = assignmentSymbol === null || assignmentSymbol === void 0 ? void 0 : assignmentSymbol.exports) === null || _a === void 0 ? void 0 : _a.get("prototype");
var init = (prototype === null || prototype === void 0 ? void 0 : prototype.valueDeclaration) && getAssignedJSPrototype(prototype.valueDeclaration);
return init ? getSymbolOfNode(init) : undefined;
}
function getSymbolOfExpando(node, allowDeclaration) {
if (!node.parent) {
return undefined;
}
var name;
var decl;
if (ts.isVariableDeclaration(node.parent) && node.parent.initializer === node) {
if (!ts.isInJSFile(node) && !(ts.isVarConst(node.parent) && ts.isFunctionLikeDeclaration(node))) {
return undefined;
}
name = node.parent.name;
decl = node.parent;
}
else if (ts.isBinaryExpression(node.parent)) {
var parentNode = node.parent;
var parentNodeOperator = node.parent.operatorToken.kind;
if (parentNodeOperator === 63 /* EqualsToken */ && (allowDeclaration || parentNode.right === node)) {
name = parentNode.left;
decl = name;
}
else if (parentNodeOperator === 56 /* BarBarToken */ || parentNodeOperator === 60 /* QuestionQuestionToken */) {
if (ts.isVariableDeclaration(parentNode.parent) && parentNode.parent.initializer === parentNode) {
name = parentNode.parent.name;
decl = parentNode.parent;
}
else if (ts.isBinaryExpression(parentNode.parent) && parentNode.parent.operatorToken.kind === 63 /* EqualsToken */ && (allowDeclaration || parentNode.parent.right === parentNode)) {
name = parentNode.parent.left;
decl = name;
}
if (!name || !ts.isBindableStaticNameExpression(name) || !ts.isSameEntityName(name, parentNode.left)) {
return undefined;
}
}
}
else if (allowDeclaration && ts.isFunctionDeclaration(node)) {
name = node.name;
decl = node;
}
if (!decl || !name || (!allowDeclaration && !ts.getExpandoInitializer(node, ts.isPrototypeAccess(name)))) {
return undefined;
}
return getSymbolOfNode(decl);
}
function getAssignedJSPrototype(node) {
if (!node.parent) {
return false;
}
var parent = node.parent;
while (parent && parent.kind === 204 /* PropertyAccessExpression */) {
parent = parent.parent;
}
if (parent && ts.isBinaryExpression(parent) && ts.isPrototypeAccess(parent.left) && parent.operatorToken.kind === 63 /* EqualsToken */) {
var right = ts.getInitializerOfBinaryExpression(parent);
return ts.isObjectLiteralExpression(right) && right;
}
}
/**
* Syntactically and semantically checks a call or new expression.
* @param node The call/new expression to be checked.
* @returns On success, the expression's signature's return type. On failure, anyType.
*/
function checkCallExpression(node, checkMode) {
var _a;
if (!checkGrammarTypeArguments(node, node.typeArguments))
checkGrammarArguments(node.arguments);
var signature = getResolvedSignature(node, /*candidatesOutArray*/ undefined, checkMode);
if (signature === resolvingSignature) {
// CheckMode.SkipGenericFunctions is enabled and this is a call to a generic function that
// returns a function type. We defer checking and return nonInferrableType.
return nonInferrableType;
}
checkDeprecatedSignature(signature, node);
if (node.expression.kind === 106 /* SuperKeyword */) {
return voidType;
}
if (node.kind === 207 /* NewExpression */) {
var declaration = signature.declaration;
if (declaration &&
declaration.kind !== 169 /* Constructor */ &&
declaration.kind !== 173 /* ConstructSignature */ &&
declaration.kind !== 178 /* ConstructorType */ &&
!ts.isJSDocConstructSignature(declaration) &&
!isJSConstructor(declaration)) {
// When resolved signature is a call signature (and not a construct signature) the result type is any
if (noImplicitAny) {
error(node, ts.Diagnostics.new_expression_whose_target_lacks_a_construct_signature_implicitly_has_an_any_type);
}
return anyType;
}
}
// In JavaScript files, calls to any identifier 'require' are treated as external module imports
if (ts.isInJSFile(node) && isCommonJsRequire(node)) {
return resolveExternalModuleTypeByLiteral(node.arguments[0]);
}
var returnType = getReturnTypeOfSignature(signature);
// Treat any call to the global 'Symbol' function that is part of a const variable or readonly property
// as a fresh unique symbol literal type.
if (returnType.flags & 12288 /* ESSymbolLike */ && isSymbolOrSymbolForCall(node)) {
return getESSymbolLikeTypeForNode(ts.walkUpParenthesizedExpressions(node.parent));
}
if (node.kind === 206 /* CallExpression */ && !node.questionDotToken && node.parent.kind === 236 /* ExpressionStatement */ &&
returnType.flags & 16384 /* Void */ && getTypePredicateOfSignature(signature)) {
if (!ts.isDottedName(node.expression)) {
error(node.expression, ts.Diagnostics.Assertions_require_the_call_target_to_be_an_identifier_or_qualified_name);
}
else if (!getEffectsSignature(node)) {
var diagnostic = error(node.expression, ts.Diagnostics.Assertions_require_every_name_in_the_call_target_to_be_declared_with_an_explicit_type_annotation);
getTypeOfDottedName(node.expression, diagnostic);
}
}
if (ts.isInJSFile(node)) {
var jsSymbol = getSymbolOfExpando(node, /*allowDeclaration*/ false);
if ((_a = jsSymbol === null || jsSymbol === void 0 ? void 0 : jsSymbol.exports) === null || _a === void 0 ? void 0 : _a.size) {
var jsAssignmentType = createAnonymousType(jsSymbol, jsSymbol.exports, ts.emptyArray, ts.emptyArray, ts.emptyArray);
jsAssignmentType.objectFlags |= 8192 /* JSLiteral */;
return getIntersectionType([returnType, jsAssignmentType]);
}
}
return returnType;
}
function checkDeprecatedSignature(signature, node) {
if (signature.declaration && signature.declaration.flags & 134217728 /* Deprecated */) {
var suggestionNode = getDeprecatedSuggestionNode(node);
var name = ts.tryGetPropertyAccessOrIdentifierToString(ts.getInvokedExpression(node));
addDeprecatedSuggestionWithSignature(suggestionNode, signature.declaration, name, signatureToString(signature));
}
}
function getDeprecatedSuggestionNode(node) {
node = ts.skipParentheses(node);
switch (node.kind) {
case 206 /* CallExpression */:
case 163 /* Decorator */:
case 207 /* NewExpression */:
return getDeprecatedSuggestionNode(node.expression);
case 208 /* TaggedTemplateExpression */:
return getDeprecatedSuggestionNode(node.tag);
case 278 /* JsxOpeningElement */:
case 277 /* JsxSelfClosingElement */:
return getDeprecatedSuggestionNode(node.tagName);
case 205 /* ElementAccessExpression */:
return node.argumentExpression;
case 204 /* PropertyAccessExpression */:
return node.name;
case 176 /* TypeReference */:
var typeReference = node;
return ts.isQualifiedName(typeReference.typeName) ? typeReference.typeName.right : typeReference;
default:
return node;
}
}
function isSymbolOrSymbolForCall(node) {
if (!ts.isCallExpression(node))
return false;
var left = node.expression;
if (ts.isPropertyAccessExpression(left) && left.name.escapedText === "for") {
left = left.expression;
}
if (!ts.isIdentifier(left) || left.escapedText !== "Symbol") {
return false;
}
// make sure `Symbol` is the global symbol
var globalESSymbol = getGlobalESSymbolConstructorSymbol(/*reportErrors*/ false);
if (!globalESSymbol) {
return false;
}
return globalESSymbol === resolveName(left, "Symbol", 111551 /* Value */, /*nameNotFoundMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ false);
}
function checkImportCallExpression(node) {
// Check grammar of dynamic import
if (!checkGrammarArguments(node.arguments))
checkGrammarImportCallExpression(node);
if (node.arguments.length === 0) {
return createPromiseReturnType(node, anyType);
}
var specifier = node.arguments[0];
var specifierType = checkExpressionCached(specifier);
// Even though multiple arguments is grammatically incorrect, type-check extra arguments for completion
for (var i = 1; i < node.arguments.length; ++i) {
checkExpressionCached(node.arguments[i]);
}
if (specifierType.flags & 32768 /* Undefined */ || specifierType.flags & 65536 /* Null */ || !isTypeAssignableTo(specifierType, stringType)) {
error(specifier, ts.Diagnostics.Dynamic_import_s_specifier_must_be_of_type_string_but_here_has_type_0, typeToString(specifierType));
}
// resolveExternalModuleName will return undefined if the moduleReferenceExpression is not a string literal
var moduleSymbol = resolveExternalModuleName(node, specifier);
if (moduleSymbol) {
var esModuleSymbol = resolveESModuleSymbol(moduleSymbol, specifier, /*dontRecursivelyResolve*/ true, /*suppressUsageError*/ false);
if (esModuleSymbol) {
return createPromiseReturnType(node, getTypeWithSyntheticDefaultImportType(getTypeOfSymbol(esModuleSymbol), esModuleSymbol, moduleSymbol));
}
}
return createPromiseReturnType(node, anyType);
}
function getTypeWithSyntheticDefaultImportType(type, symbol, originalSymbol) {
var _a;
if (allowSyntheticDefaultImports && type && type !== errorType) {
var synthType = type;
if (!synthType.syntheticType) {
var file = (_a = originalSymbol.declarations) === null || _a === void 0 ? void 0 : _a.find(ts.isSourceFile);
var hasSyntheticDefault = canHaveSyntheticDefault(file, originalSymbol, /*dontResolveAlias*/ false);
if (hasSyntheticDefault) {
var memberTable = ts.createSymbolTable();
var newSymbol = createSymbol(2097152 /* Alias */, "default" /* Default */);
newSymbol.parent = originalSymbol;
newSymbol.nameType = getStringLiteralType("default");
newSymbol.target = resolveSymbol(symbol);
memberTable.set("default" /* Default */, newSymbol);
var anonymousSymbol = createSymbol(2048 /* TypeLiteral */, "__type" /* Type */);
var defaultContainingObject = createAnonymousType(anonymousSymbol, memberTable, ts.emptyArray, ts.emptyArray, ts.emptyArray);
anonymousSymbol.type = defaultContainingObject;
synthType.syntheticType = isValidSpreadType(type) ? getSpreadType(type, defaultContainingObject, anonymousSymbol, /*objectFlags*/ 0, /*readonly*/ false) : defaultContainingObject;
}
else {
synthType.syntheticType = type;
}
}
return synthType.syntheticType;
}
return type;
}
function isCommonJsRequire(node) {
if (!ts.isRequireCall(node, /*checkArgumentIsStringLiteralLike*/ true)) {
return false;
}
// Make sure require is not a local function
if (!ts.isIdentifier(node.expression))
return ts.Debug.fail();
var resolvedRequire = resolveName(node.expression, node.expression.escapedText, 111551 /* Value */, /*nameNotFoundMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ true); // TODO: GH#18217
if (resolvedRequire === requireSymbol) {
return true;
}
// project includes symbol named 'require' - make sure that it is ambient and local non-alias
if (resolvedRequire.flags & 2097152 /* Alias */) {
return false;
}
var targetDeclarationKind = resolvedRequire.flags & 16 /* Function */
? 254 /* FunctionDeclaration */
: resolvedRequire.flags & 3 /* Variable */
? 252 /* VariableDeclaration */
: 0 /* Unknown */;
if (targetDeclarationKind !== 0 /* Unknown */) {
var decl = ts.getDeclarationOfKind(resolvedRequire, targetDeclarationKind);
// function/variable declaration should be ambient
return !!decl && !!(decl.flags & 8388608 /* Ambient */);
}
return false;
}
function checkTaggedTemplateExpression(node) {
if (!checkGrammarTaggedTemplateChain(node))
checkGrammarTypeArguments(node, node.typeArguments);
if (languageVersion < 2 /* ES2015 */) {
checkExternalEmitHelpers(node, 262144 /* MakeTemplateObject */);
}
var signature = getResolvedSignature(node);
checkDeprecatedSignature(signature, node);
return getReturnTypeOfSignature(signature);
}
function checkAssertion(node) {
return checkAssertionWorker(node, node.type, node.expression);
}
function isValidConstAssertionArgument(node) {
switch (node.kind) {
case 10 /* StringLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
case 8 /* NumericLiteral */:
case 9 /* BigIntLiteral */:
case 110 /* TrueKeyword */:
case 95 /* FalseKeyword */:
case 202 /* ArrayLiteralExpression */:
case 203 /* ObjectLiteralExpression */:
case 221 /* TemplateExpression */:
return true;
case 210 /* ParenthesizedExpression */:
return isValidConstAssertionArgument(node.expression);
case 217 /* PrefixUnaryExpression */:
var op = node.operator;
var arg = node.operand;
return op === 40 /* MinusToken */ && (arg.kind === 8 /* NumericLiteral */ || arg.kind === 9 /* BigIntLiteral */) ||
op === 39 /* PlusToken */ && arg.kind === 8 /* NumericLiteral */;
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
var expr = node.expression;
if (ts.isIdentifier(expr)) {
var symbol = getSymbolAtLocation(expr);
if (symbol && symbol.flags & 2097152 /* Alias */) {
symbol = resolveAlias(symbol);
}
return !!(symbol && (symbol.flags & 384 /* Enum */) && getEnumKind(symbol) === 1 /* Literal */);
}
}
return false;
}
function checkAssertionWorker(errNode, type, expression, checkMode) {
var exprType = checkExpression(expression, checkMode);
if (ts.isConstTypeReference(type)) {
if (!isValidConstAssertionArgument(expression)) {
error(expression, ts.Diagnostics.A_const_assertions_can_only_be_applied_to_references_to_enum_members_or_string_number_boolean_array_or_object_literals);
}
return getRegularTypeOfLiteralType(exprType);
}
checkSourceElement(type);
exprType = getRegularTypeOfObjectLiteral(getBaseTypeOfLiteralType(exprType));
var targetType = getTypeFromTypeNode(type);
if (produceDiagnostics && targetType !== errorType) {
var widenedType = getWidenedType(exprType);
if (!isTypeComparableTo(targetType, widenedType)) {
checkTypeComparableTo(exprType, targetType, errNode, ts.Diagnostics.Conversion_of_type_0_to_type_1_may_be_a_mistake_because_neither_type_sufficiently_overlaps_with_the_other_If_this_was_intentional_convert_the_expression_to_unknown_first);
}
}
return targetType;
}
function checkNonNullChain(node) {
var leftType = checkExpression(node.expression);
var nonOptionalType = getOptionalExpressionType(leftType, node.expression);
return propagateOptionalTypeMarker(getNonNullableType(nonOptionalType), node, nonOptionalType !== leftType);
}
function checkNonNullAssertion(node) {
return node.flags & 32 /* OptionalChain */ ? checkNonNullChain(node) :
getNonNullableType(checkExpression(node.expression));
}
function checkMetaProperty(node) {
checkGrammarMetaProperty(node);
if (node.keywordToken === 103 /* NewKeyword */) {
return checkNewTargetMetaProperty(node);
}
if (node.keywordToken === 100 /* ImportKeyword */) {
return checkImportMetaProperty(node);
}
return ts.Debug.assertNever(node.keywordToken);
}
function checkMetaPropertyKeyword(node) {
switch (node.keywordToken) {
case 100 /* ImportKeyword */:
return getGlobalImportMetaExpressionType();
case 103 /* NewKeyword */:
var type = checkNewTargetMetaProperty(node);
return type === errorType ? errorType : createNewTargetExpressionType(type);
default:
ts.Debug.assertNever(node.keywordToken);
}
}
function checkNewTargetMetaProperty(node) {
var container = ts.getNewTargetContainer(node);
if (!container) {
error(node, ts.Diagnostics.Meta_property_0_is_only_allowed_in_the_body_of_a_function_declaration_function_expression_or_constructor, "new.target");
return errorType;
}
else if (container.kind === 169 /* Constructor */) {
var symbol = getSymbolOfNode(container.parent);
return getTypeOfSymbol(symbol);
}
else {
var symbol = getSymbolOfNode(container);
return getTypeOfSymbol(symbol);
}
}
function checkImportMetaProperty(node) {
if (moduleKind !== ts.ModuleKind.ES2020 && moduleKind !== ts.ModuleKind.ESNext && moduleKind !== ts.ModuleKind.System) {
error(node, ts.Diagnostics.The_import_meta_meta_property_is_only_allowed_when_the_module_option_is_es2020_esnext_or_system);
}
var file = ts.getSourceFileOfNode(node);
ts.Debug.assert(!!(file.flags & 2097152 /* PossiblyContainsImportMeta */), "Containing file is missing import meta node flag.");
return node.name.escapedText === "meta" ? getGlobalImportMetaType() : errorType;
}
function getTypeOfParameter(symbol) {
var type = getTypeOfSymbol(symbol);
if (strictNullChecks) {
var declaration = symbol.valueDeclaration;
if (declaration && ts.hasInitializer(declaration)) {
return getOptionalType(type);
}
}
return type;
}
function getTupleElementLabel(d) {
ts.Debug.assert(ts.isIdentifier(d.name)); // Parameter declarations could be binding patterns, but we only allow identifier names
return d.name.escapedText;
}
function getParameterNameAtPosition(signature, pos, overrideRestType) {
var paramCount = signature.parameters.length - (signatureHasRestParameter(signature) ? 1 : 0);
if (pos < paramCount) {
return signature.parameters[pos].escapedName;
}
var restParameter = signature.parameters[paramCount] || unknownSymbol;
var restType = overrideRestType || getTypeOfSymbol(restParameter);
if (isTupleType(restType)) {
var associatedNames = restType.target.labeledElementDeclarations;
var index = pos - paramCount;
return associatedNames && getTupleElementLabel(associatedNames[index]) || restParameter.escapedName + "_" + index;
}
return restParameter.escapedName;
}
function getParameterIdentifierNameAtPosition(signature, pos) {
var paramCount = signature.parameters.length - (signatureHasRestParameter(signature) ? 1 : 0);
if (pos < paramCount) {
var param = signature.parameters[pos];
return isParameterDeclarationWithIdentifierName(param) ? [param.escapedName, false] : undefined;
}
var restParameter = signature.parameters[paramCount] || unknownSymbol;
if (!isParameterDeclarationWithIdentifierName(restParameter)) {
return undefined;
}
var restType = getTypeOfSymbol(restParameter);
if (isTupleType(restType)) {
var associatedNames = restType.target.labeledElementDeclarations;
var index = pos - paramCount;
var associatedName = associatedNames === null || associatedNames === void 0 ? void 0 : associatedNames[index];
var isRestTupleElement = !!(associatedName === null || associatedName === void 0 ? void 0 : associatedName.dotDotDotToken);
return associatedName ? [
getTupleElementLabel(associatedName),
isRestTupleElement
] : undefined;
}
if (pos === paramCount) {
return [restParameter.escapedName, true];
}
return undefined;
}
function isParameterDeclarationWithIdentifierName(symbol) {
return symbol.valueDeclaration && ts.isParameter(symbol.valueDeclaration) && ts.isIdentifier(symbol.valueDeclaration.name);
}
function isValidDeclarationForTupleLabel(d) {
return d.kind === 195 /* NamedTupleMember */ || (ts.isParameter(d) && d.name && ts.isIdentifier(d.name));
}
function getNameableDeclarationAtPosition(signature, pos) {
var paramCount = signature.parameters.length - (signatureHasRestParameter(signature) ? 1 : 0);
if (pos < paramCount) {
var decl = signature.parameters[pos].valueDeclaration;
return decl && isValidDeclarationForTupleLabel(decl) ? decl : undefined;
}
var restParameter = signature.parameters[paramCount] || unknownSymbol;
var restType = getTypeOfSymbol(restParameter);
if (isTupleType(restType)) {
var associatedNames = restType.target.labeledElementDeclarations;
var index = pos - paramCount;
return associatedNames && associatedNames[index];
}
return restParameter.valueDeclaration && isValidDeclarationForTupleLabel(restParameter.valueDeclaration) ? restParameter.valueDeclaration : undefined;
}
function getTypeAtPosition(signature, pos) {
return tryGetTypeAtPosition(signature, pos) || anyType;
}
function tryGetTypeAtPosition(signature, pos) {
var paramCount = signature.parameters.length - (signatureHasRestParameter(signature) ? 1 : 0);
if (pos < paramCount) {
return getTypeOfParameter(signature.parameters[pos]);
}
if (signatureHasRestParameter(signature)) {
// We want to return the value undefined for an out of bounds parameter position,
// so we need to check bounds here before calling getIndexedAccessType (which
// otherwise would return the type 'undefined').
var restType = getTypeOfSymbol(signature.parameters[paramCount]);
var index = pos - paramCount;
if (!isTupleType(restType) || restType.target.hasRestElement || index < restType.target.fixedLength) {
return getIndexedAccessType(restType, getNumberLiteralType(index));
}
}
return undefined;
}
function getRestTypeAtPosition(source, pos) {
var parameterCount = getParameterCount(source);
var minArgumentCount = getMinArgumentCount(source);
var restType = getEffectiveRestType(source);
if (restType && pos >= parameterCount - 1) {
return pos === parameterCount - 1 ? restType : createArrayType(getIndexedAccessType(restType, numberType));
}
var types = [];
var flags = [];
var names = [];
for (var i = pos; i < parameterCount; i++) {
if (!restType || i < parameterCount - 1) {
types.push(getTypeAtPosition(source, i));
flags.push(i < minArgumentCount ? 1 /* Required */ : 2 /* Optional */);
}
else {
types.push(restType);
flags.push(8 /* Variadic */);
}
var name = getNameableDeclarationAtPosition(source, i);
if (name) {
names.push(name);
}
}
return createTupleType(types, flags, /*readonly*/ false, ts.length(names) === ts.length(types) ? names : undefined);
}
// Return the number of parameters in a signature. The rest parameter, if present, counts as one
// parameter. For example, the parameter count of (x: number, y: number, ...z: string[]) is 3 and
// the parameter count of (x: number, ...args: [number, ...string[], boolean])) is also 3. In the
// latter example, the effective rest type is [...string[], boolean].
function getParameterCount(signature) {
var length = signature.parameters.length;
if (signatureHasRestParameter(signature)) {
var restType = getTypeOfSymbol(signature.parameters[length - 1]);
if (isTupleType(restType)) {
return length + restType.target.fixedLength - (restType.target.hasRestElement ? 0 : 1);
}
}
return length;
}
function getMinArgumentCount(signature, flags) {
var strongArityForUntypedJS = flags & 1 /* StrongArityForUntypedJS */;
var voidIsNonOptional = flags & 2 /* VoidIsNonOptional */;
if (voidIsNonOptional || signature.resolvedMinArgumentCount === undefined) {
var minArgumentCount = void 0;
if (signatureHasRestParameter(signature)) {
var restType = getTypeOfSymbol(signature.parameters[signature.parameters.length - 1]);
if (isTupleType(restType)) {
var firstOptionalIndex = ts.findIndex(restType.target.elementFlags, function (f) { return !(f & 1 /* Required */); });
var requiredCount = firstOptionalIndex < 0 ? restType.target.fixedLength : firstOptionalIndex;
if (requiredCount > 0) {
minArgumentCount = signature.parameters.length - 1 + requiredCount;
}
}
}
if (minArgumentCount === undefined) {
if (!strongArityForUntypedJS && signature.flags & 32 /* IsUntypedSignatureInJSFile */) {
return 0;
}
minArgumentCount = signature.minArgumentCount;
}
if (voidIsNonOptional) {
return minArgumentCount;
}
for (var i = minArgumentCount - 1; i >= 0; i--) {
var type = getTypeAtPosition(signature, i);
if (filterType(type, acceptsVoid).flags & 131072 /* Never */) {
break;
}
minArgumentCount = i;
}
signature.resolvedMinArgumentCount = minArgumentCount;
}
return signature.resolvedMinArgumentCount;
}
function hasEffectiveRestParameter(signature) {
if (signatureHasRestParameter(signature)) {
var restType = getTypeOfSymbol(signature.parameters[signature.parameters.length - 1]);
return !isTupleType(restType) || restType.target.hasRestElement;
}
return false;
}
function getEffectiveRestType(signature) {
if (signatureHasRestParameter(signature)) {
var restType = getTypeOfSymbol(signature.parameters[signature.parameters.length - 1]);
if (!isTupleType(restType)) {
return restType;
}
if (restType.target.hasRestElement) {
return sliceTupleType(restType, restType.target.fixedLength);
}
}
return undefined;
}
function getNonArrayRestType(signature) {
var restType = getEffectiveRestType(signature);
return restType && !isArrayType(restType) && !isTypeAny(restType) && (getReducedType(restType).flags & 131072 /* Never */) === 0 ? restType : undefined;
}
function getTypeOfFirstParameterOfSignature(signature) {
return getTypeOfFirstParameterOfSignatureWithFallback(signature, neverType);
}
function getTypeOfFirstParameterOfSignatureWithFallback(signature, fallbackType) {
return signature.parameters.length > 0 ? getTypeAtPosition(signature, 0) : fallbackType;
}
function inferFromAnnotatedParameters(signature, context, inferenceContext) {
var len = signature.parameters.length - (signatureHasRestParameter(signature) ? 1 : 0);
for (var i = 0; i < len; i++) {
var declaration = signature.parameters[i].valueDeclaration;
if (declaration.type) {
var typeNode = ts.getEffectiveTypeAnnotationNode(declaration);
if (typeNode) {
inferTypes(inferenceContext.inferences, getTypeFromTypeNode(typeNode), getTypeAtPosition(context, i));
}
}
}
var restType = getEffectiveRestType(context);
if (restType && restType.flags & 262144 /* TypeParameter */) {
// The contextual signature has a generic rest parameter. We first instantiate the contextual
// signature (without fixing type parameters) and assign types to contextually typed parameters.
var instantiatedContext = instantiateSignature(context, inferenceContext.nonFixingMapper);
assignContextualParameterTypes(signature, instantiatedContext);
// We then infer from a tuple type representing the parameters that correspond to the contextual
// rest parameter.
var restPos = getParameterCount(context) - 1;
inferTypes(inferenceContext.inferences, getRestTypeAtPosition(signature, restPos), restType);
}
}
function assignContextualParameterTypes(signature, context) {
if (context.typeParameters) {
if (!signature.typeParameters) {
signature.typeParameters = context.typeParameters;
}
else {
return; // This signature has already has a contextual inference performed and cached on it!
}
}
if (context.thisParameter) {
var parameter = signature.thisParameter;
if (!parameter || parameter.valueDeclaration && !parameter.valueDeclaration.type) {
if (!parameter) {
signature.thisParameter = createSymbolWithType(context.thisParameter, /*type*/ undefined);
}
assignParameterType(signature.thisParameter, getTypeOfSymbol(context.thisParameter));
}
}
var len = signature.parameters.length - (signatureHasRestParameter(signature) ? 1 : 0);
for (var i = 0; i < len; i++) {
var parameter = signature.parameters[i];
if (!ts.getEffectiveTypeAnnotationNode(parameter.valueDeclaration)) {
var contextualParameterType = tryGetTypeAtPosition(context, i);
assignParameterType(parameter, contextualParameterType);
}
}
if (signatureHasRestParameter(signature)) {
// parameter might be a transient symbol generated by use of `arguments` in the function body.
var parameter = ts.last(signature.parameters);
if (ts.isTransientSymbol(parameter) || !ts.getEffectiveTypeAnnotationNode(parameter.valueDeclaration)) {
var contextualParameterType = getRestTypeAtPosition(context, len);
assignParameterType(parameter, contextualParameterType);
}
}
}
function assignNonContextualParameterTypes(signature) {
if (signature.thisParameter) {
assignParameterType(signature.thisParameter);
}
for (var _i = 0, _a = signature.parameters; _i < _a.length; _i++) {
var parameter = _a[_i];
assignParameterType(parameter);
}
}
function assignParameterType(parameter, type) {
var links = getSymbolLinks(parameter);
if (!links.type) {
var declaration = parameter.valueDeclaration;
links.type = type || getWidenedTypeForVariableLikeDeclaration(declaration, /*includeOptionality*/ true);
if (declaration.name.kind !== 79 /* Identifier */) {
// if inference didn't come up with anything but unknown, fall back to the binding pattern if present.
if (links.type === unknownType) {
links.type = getTypeFromBindingPattern(declaration.name);
}
assignBindingElementTypes(declaration.name);
}
}
}
// When contextual typing assigns a type to a parameter that contains a binding pattern, we also need to push
// the destructured type into the contained binding elements.
function assignBindingElementTypes(pattern) {
for (var _i = 0, _a = pattern.elements; _i < _a.length; _i++) {
var element = _a[_i];
if (!ts.isOmittedExpression(element)) {
if (element.name.kind === 79 /* Identifier */) {
getSymbolLinks(getSymbolOfNode(element)).type = getTypeForBindingElement(element);
}
else {
assignBindingElementTypes(element.name);
}
}
}
}
function createPromiseType(promisedType) {
// creates a `Promise<T>` type where `T` is the promisedType argument
var globalPromiseType = getGlobalPromiseType(/*reportErrors*/ true);
if (globalPromiseType !== emptyGenericType) {
// if the promised type is itself a promise, get the underlying type; otherwise, fallback to the promised type
promisedType = getAwaitedType(promisedType) || unknownType;
return createTypeReference(globalPromiseType, [promisedType]);
}
return unknownType;
}
function createPromiseLikeType(promisedType) {
// creates a `PromiseLike<T>` type where `T` is the promisedType argument
var globalPromiseLikeType = getGlobalPromiseLikeType(/*reportErrors*/ true);
if (globalPromiseLikeType !== emptyGenericType) {
// if the promised type is itself a promise, get the underlying type; otherwise, fallback to the promised type
promisedType = getAwaitedType(promisedType) || unknownType;
return createTypeReference(globalPromiseLikeType, [promisedType]);
}
return unknownType;
}
function createPromiseReturnType(func, promisedType) {
var promiseType = createPromiseType(promisedType);
if (promiseType === unknownType) {
error(func, ts.isImportCall(func) ?
ts.Diagnostics.A_dynamic_import_call_returns_a_Promise_Make_sure_you_have_a_declaration_for_Promise_or_include_ES2015_in_your_lib_option :
ts.Diagnostics.An_async_function_or_method_must_return_a_Promise_Make_sure_you_have_a_declaration_for_Promise_or_include_ES2015_in_your_lib_option);
return errorType;
}
else if (!getGlobalPromiseConstructorSymbol(/*reportErrors*/ true)) {
error(func, ts.isImportCall(func) ?
ts.Diagnostics.A_dynamic_import_call_in_ES5_SlashES3_requires_the_Promise_constructor_Make_sure_you_have_a_declaration_for_the_Promise_constructor_or_include_ES2015_in_your_lib_option :
ts.Diagnostics.An_async_function_or_method_in_ES5_SlashES3_requires_the_Promise_constructor_Make_sure_you_have_a_declaration_for_the_Promise_constructor_or_include_ES2015_in_your_lib_option);
}
return promiseType;
}
function createNewTargetExpressionType(targetType) {
// Create a synthetic type `NewTargetExpression { target: TargetType; }`
var symbol = createSymbol(0 /* None */, "NewTargetExpression");
var targetPropertySymbol = createSymbol(4 /* Property */, "target", 8 /* Readonly */);
targetPropertySymbol.parent = symbol;
targetPropertySymbol.type = targetType;
var members = ts.createSymbolTable([targetPropertySymbol]);
symbol.members = members;
return createAnonymousType(symbol, members, ts.emptyArray, ts.emptyArray, ts.emptyArray);
}
function getReturnTypeFromBody(func, checkMode) {
if (!func.body) {
return errorType;
}
var functionFlags = ts.getFunctionFlags(func);
var isAsync = (functionFlags & 2 /* Async */) !== 0;
var isGenerator = (functionFlags & 1 /* Generator */) !== 0;
var returnType;
var yieldType;
var nextType;
var fallbackReturnType = voidType;
if (func.body.kind !== 233 /* Block */) { // Async or normal arrow function
returnType = checkExpressionCached(func.body, checkMode && checkMode & ~8 /* SkipGenericFunctions */);
if (isAsync) {
// From within an async function you can return either a non-promise value or a promise. Any
// Promise/A+ compatible implementation will always assimilate any foreign promise, so the
// return type of the body should be unwrapped to its awaited type, which we will wrap in
// the native Promise<T> type later in this function.
returnType = checkAwaitedType(returnType, /*errorNode*/ func, ts.Diagnostics.The_return_type_of_an_async_function_must_either_be_a_valid_promise_or_must_not_contain_a_callable_then_member);
}
}
else if (isGenerator) { // Generator or AsyncGenerator function
var returnTypes = checkAndAggregateReturnExpressionTypes(func, checkMode);
if (!returnTypes) {
fallbackReturnType = neverType;
}
else if (returnTypes.length > 0) {
returnType = getUnionType(returnTypes, 2 /* Subtype */);
}
var _a = checkAndAggregateYieldOperandTypes(func, checkMode), yieldTypes = _a.yieldTypes, nextTypes = _a.nextTypes;
yieldType = ts.some(yieldTypes) ? getUnionType(yieldTypes, 2 /* Subtype */) : undefined;
nextType = ts.some(nextTypes) ? getIntersectionType(nextTypes) : undefined;
}
else { // Async or normal function
var types = checkAndAggregateReturnExpressionTypes(func, checkMode);
if (!types) {
// For an async function, the return type will not be never, but rather a Promise for never.
return functionFlags & 2 /* Async */
? createPromiseReturnType(func, neverType) // Async function
: neverType; // Normal function
}
if (types.length === 0) {
// For an async function, the return type will not be void, but rather a Promise for void.
return functionFlags & 2 /* Async */
? createPromiseReturnType(func, voidType) // Async function
: voidType; // Normal function
}
// Return a union of the return expression types.
returnType = getUnionType(types, 2 /* Subtype */);
}
if (returnType || yieldType || nextType) {
if (yieldType)
reportErrorsFromWidening(func, yieldType, 3 /* GeneratorYield */);
if (returnType)
reportErrorsFromWidening(func, returnType, 1 /* FunctionReturn */);
if (nextType)
reportErrorsFromWidening(func, nextType, 2 /* GeneratorNext */);
if (returnType && isUnitType(returnType) ||
yieldType && isUnitType(yieldType) ||
nextType && isUnitType(nextType)) {
var contextualSignature = getContextualSignatureForFunctionLikeDeclaration(func);
var contextualType = !contextualSignature ? undefined :
contextualSignature === getSignatureFromDeclaration(func) ? isGenerator ? undefined : returnType :
instantiateContextualType(getReturnTypeOfSignature(contextualSignature), func);
if (isGenerator) {
yieldType = getWidenedLiteralLikeTypeForContextualIterationTypeIfNeeded(yieldType, contextualType, 0 /* Yield */, isAsync);
returnType = getWidenedLiteralLikeTypeForContextualIterationTypeIfNeeded(returnType, contextualType, 1 /* Return */, isAsync);
nextType = getWidenedLiteralLikeTypeForContextualIterationTypeIfNeeded(nextType, contextualType, 2 /* Next */, isAsync);
}
else {
returnType = getWidenedLiteralLikeTypeForContextualReturnTypeIfNeeded(returnType, contextualType, isAsync);
}
}
if (yieldType)
yieldType = getWidenedType(yieldType);
if (returnType)
returnType = getWidenedType(returnType);
if (nextType)
nextType = getWidenedType(nextType);
}
if (isGenerator) {
return createGeneratorReturnType(yieldType || neverType, returnType || fallbackReturnType, nextType || getContextualIterationType(2 /* Next */, func) || unknownType, isAsync);
}
else {
// From within an async function you can return either a non-promise value or a promise. Any
// Promise/A+ compatible implementation will always assimilate any foreign promise, so the
// return type of the body is awaited type of the body, wrapped in a native Promise<T> type.
return isAsync
? createPromiseType(returnType || fallbackReturnType)
: returnType || fallbackReturnType;
}
}
function createGeneratorReturnType(yieldType, returnType, nextType, isAsyncGenerator) {
var resolver = isAsyncGenerator ? asyncIterationTypesResolver : syncIterationTypesResolver;
var globalGeneratorType = resolver.getGlobalGeneratorType(/*reportErrors*/ false);
yieldType = resolver.resolveIterationType(yieldType, /*errorNode*/ undefined) || unknownType;
returnType = resolver.resolveIterationType(returnType, /*errorNode*/ undefined) || unknownType;
nextType = resolver.resolveIterationType(nextType, /*errorNode*/ undefined) || unknownType;
if (globalGeneratorType === emptyGenericType) {
// Fall back to the global IterableIterator if returnType is assignable to the expected return iteration
// type of IterableIterator, and the expected next iteration type of IterableIterator is assignable to
// nextType.
var globalType = resolver.getGlobalIterableIteratorType(/*reportErrors*/ false);
var iterationTypes = globalType !== emptyGenericType ? getIterationTypesOfGlobalIterableType(globalType, resolver) : undefined;
var iterableIteratorReturnType = iterationTypes ? iterationTypes.returnType : anyType;
var iterableIteratorNextType = iterationTypes ? iterationTypes.nextType : undefinedType;
if (isTypeAssignableTo(returnType, iterableIteratorReturnType) &&
isTypeAssignableTo(iterableIteratorNextType, nextType)) {
if (globalType !== emptyGenericType) {
return createTypeFromGenericGlobalType(globalType, [yieldType]);
}
// The global IterableIterator type doesn't exist, so report an error
resolver.getGlobalIterableIteratorType(/*reportErrors*/ true);
return emptyObjectType;
}
// The global Generator type doesn't exist, so report an error
resolver.getGlobalGeneratorType(/*reportErrors*/ true);
return emptyObjectType;
}
return createTypeFromGenericGlobalType(globalGeneratorType, [yieldType, returnType, nextType]);
}
function checkAndAggregateYieldOperandTypes(func, checkMode) {
var yieldTypes = [];
var nextTypes = [];
var isAsync = (ts.getFunctionFlags(func) & 2 /* Async */) !== 0;
ts.forEachYieldExpression(func.body, function (yieldExpression) {
var yieldExpressionType = yieldExpression.expression ? checkExpression(yieldExpression.expression, checkMode) : undefinedWideningType;
ts.pushIfUnique(yieldTypes, getYieldedTypeOfYieldExpression(yieldExpression, yieldExpressionType, anyType, isAsync));
var nextType;
if (yieldExpression.asteriskToken) {
var iterationTypes = getIterationTypesOfIterable(yieldExpressionType, isAsync ? 19 /* AsyncYieldStar */ : 17 /* YieldStar */, yieldExpression.expression);
nextType = iterationTypes && iterationTypes.nextType;
}
else {
nextType = getContextualType(yieldExpression);
}
if (nextType)
ts.pushIfUnique(nextTypes, nextType);
});
return { yieldTypes: yieldTypes, nextTypes: nextTypes };
}
function getYieldedTypeOfYieldExpression(node, expressionType, sentType, isAsync) {
var errorNode = node.expression || node;
// A `yield*` expression effectively yields everything that its operand yields
var yieldedType = node.asteriskToken ? checkIteratedTypeOrElementType(isAsync ? 19 /* AsyncYieldStar */ : 17 /* YieldStar */, expressionType, sentType, errorNode) : expressionType;
return !isAsync ? yieldedType : getAwaitedType(yieldedType, errorNode, node.asteriskToken
? ts.Diagnostics.Type_of_iterated_elements_of_a_yield_Asterisk_operand_must_either_be_a_valid_promise_or_must_not_contain_a_callable_then_member
: ts.Diagnostics.Type_of_yield_operand_in_an_async_generator_must_either_be_a_valid_promise_or_must_not_contain_a_callable_then_member);
}
/**
* Collect the TypeFacts learned from a typeof switch with
* total clauses `witnesses`, and the active clause ranging
* from `start` to `end`. Parameter `hasDefault` denotes
* whether the active clause contains a default clause.
*/
function getFactsFromTypeofSwitch(start, end, witnesses, hasDefault) {
var facts = 0 /* None */;
// When in the default we only collect inequality facts
// because default is 'in theory' a set of infinite
// equalities.
if (hasDefault) {
// Value is not equal to any types after the active clause.
for (var i = end; i < witnesses.length; i++) {
facts |= typeofNEFacts.get(witnesses[i]) || 32768 /* TypeofNEHostObject */;
}
// Remove inequalities for types that appear in the
// active clause because they appear before other
// types collected so far.
for (var i = start; i < end; i++) {
facts &= ~(typeofNEFacts.get(witnesses[i]) || 0);
}
// Add inequalities for types before the active clause unconditionally.
for (var i = 0; i < start; i++) {
facts |= typeofNEFacts.get(witnesses[i]) || 32768 /* TypeofNEHostObject */;
}
}
// When in an active clause without default the set of
// equalities is finite.
else {
// Add equalities for all types in the active clause.
for (var i = start; i < end; i++) {
facts |= typeofEQFacts.get(witnesses[i]) || 128 /* TypeofEQHostObject */;
}
// Remove equalities for types that appear before the
// active clause.
for (var i = 0; i < start; i++) {
facts &= ~(typeofEQFacts.get(witnesses[i]) || 0);
}
}
return facts;
}
function isExhaustiveSwitchStatement(node) {
var links = getNodeLinks(node);
return links.isExhaustive !== undefined ? links.isExhaustive : (links.isExhaustive = computeExhaustiveSwitchStatement(node));
}
function computeExhaustiveSwitchStatement(node) {
if (node.expression.kind === 214 /* TypeOfExpression */) {
var operandType = getTypeOfExpression(node.expression.expression);
var witnesses = getSwitchClauseTypeOfWitnesses(node, /*retainDefault*/ false);
// notEqualFacts states that the type of the switched value is not equal to every type in the switch.
var notEqualFacts_1 = getFactsFromTypeofSwitch(0, 0, witnesses, /*hasDefault*/ true);
var type_4 = getBaseConstraintOfType(operandType) || operandType;
// Take any/unknown as a special condition. Or maybe we could change `type` to a union containing all primitive types.
if (type_4.flags & 3 /* AnyOrUnknown */) {
return (556800 /* AllTypeofNE */ & notEqualFacts_1) === 556800 /* AllTypeofNE */;
}
return !!(filterType(type_4, function (t) { return (getTypeFacts(t) & notEqualFacts_1) === notEqualFacts_1; }).flags & 131072 /* Never */);
}
var type = getTypeOfExpression(node.expression);
if (!isLiteralType(type)) {
return false;
}
var switchTypes = getSwitchClauseTypes(node);
if (!switchTypes.length || ts.some(switchTypes, isNeitherUnitTypeNorNever)) {
return false;
}
return eachTypeContainedIn(mapType(type, getRegularTypeOfLiteralType), switchTypes);
}
function functionHasImplicitReturn(func) {
return func.endFlowNode && isReachableFlowNode(func.endFlowNode);
}
/** NOTE: Return value of `[]` means a different thing than `undefined`. `[]` means func returns `void`, `undefined` means it returns `never`. */
function checkAndAggregateReturnExpressionTypes(func, checkMode) {
var functionFlags = ts.getFunctionFlags(func);
var aggregatedTypes = [];
var hasReturnWithNoExpression = functionHasImplicitReturn(func);
var hasReturnOfTypeNever = false;
ts.forEachReturnStatement(func.body, function (returnStatement) {
var expr = returnStatement.expression;
if (expr) {
var type = checkExpressionCached(expr, checkMode && checkMode & ~8 /* SkipGenericFunctions */);
if (functionFlags & 2 /* Async */) {
// From within an async function you can return either a non-promise value or a promise. Any
// Promise/A+ compatible implementation will always assimilate any foreign promise, so the
// return type of the body should be unwrapped to its awaited type, which should be wrapped in
// the native Promise<T> type by the caller.
type = checkAwaitedType(type, func, ts.Diagnostics.The_return_type_of_an_async_function_must_either_be_a_valid_promise_or_must_not_contain_a_callable_then_member);
}
if (type.flags & 131072 /* Never */) {
hasReturnOfTypeNever = true;
}
ts.pushIfUnique(aggregatedTypes, type);
}
else {
hasReturnWithNoExpression = true;
}
});
if (aggregatedTypes.length === 0 && !hasReturnWithNoExpression && (hasReturnOfTypeNever || mayReturnNever(func))) {
return undefined;
}
if (strictNullChecks && aggregatedTypes.length && hasReturnWithNoExpression &&
!(isJSConstructor(func) && aggregatedTypes.some(function (t) { return t.symbol === func.symbol; }))) {
// Javascript "callable constructors", containing eg `if (!(this instanceof A)) return new A()` should not add undefined
ts.pushIfUnique(aggregatedTypes, undefinedType);
}
return aggregatedTypes;
}
function mayReturnNever(func) {
switch (func.kind) {
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
return true;
case 167 /* MethodDeclaration */:
return func.parent.kind === 203 /* ObjectLiteralExpression */;
default:
return false;
}
}
/**
* TypeScript Specification 1.0 (6.3) - July 2014
* An explicitly typed function whose return type isn't the Void type,
* the Any type, or a union type containing the Void or Any type as a constituent
* must have at least one return statement somewhere in its body.
* An exception to this rule is if the function implementation consists of a single 'throw' statement.
*
* @param returnType - return type of the function, can be undefined if return type is not explicitly specified
*/
function checkAllCodePathsInNonVoidFunctionReturnOrThrow(func, returnType) {
if (!produceDiagnostics) {
return;
}
var functionFlags = ts.getFunctionFlags(func);
var type = returnType && unwrapReturnType(returnType, functionFlags);
// Functions with with an explicitly specified 'void' or 'any' return type don't need any return expressions.
if (type && maybeTypeOfKind(type, 1 /* Any */ | 16384 /* Void */)) {
return;
}
// If all we have is a function signature, or an arrow function with an expression body, then there is nothing to check.
// also if HasImplicitReturn flag is not set this means that all codepaths in function body end with return or throw
if (func.kind === 166 /* MethodSignature */ || ts.nodeIsMissing(func.body) || func.body.kind !== 233 /* Block */ || !functionHasImplicitReturn(func)) {
return;
}
var hasExplicitReturn = func.flags & 512 /* HasExplicitReturn */;
var errorNode = ts.getEffectiveReturnTypeNode(func) || func;
if (type && type.flags & 131072 /* Never */) {
error(errorNode, ts.Diagnostics.A_function_returning_never_cannot_have_a_reachable_end_point);
}
else if (type && !hasExplicitReturn) {
// minimal check: function has syntactic return type annotation and no explicit return statements in the body
// this function does not conform to the specification.
error(errorNode, ts.Diagnostics.A_function_whose_declared_type_is_neither_void_nor_any_must_return_a_value);
}
else if (type && strictNullChecks && !isTypeAssignableTo(undefinedType, type)) {
error(errorNode, ts.Diagnostics.Function_lacks_ending_return_statement_and_return_type_does_not_include_undefined);
}
else if (compilerOptions.noImplicitReturns) {
if (!type) {
// If return type annotation is omitted check if function has any explicit return statements.
// If it does not have any - its inferred return type is void - don't do any checks.
// Otherwise get inferred return type from function body and report error only if it is not void / anytype
if (!hasExplicitReturn) {
return;
}
var inferredReturnType = getReturnTypeOfSignature(getSignatureFromDeclaration(func));
if (isUnwrappedReturnTypeVoidOrAny(func, inferredReturnType)) {
return;
}
}
error(errorNode, ts.Diagnostics.Not_all_code_paths_return_a_value);
}
}
function checkFunctionExpressionOrObjectLiteralMethod(node, checkMode) {
ts.Debug.assert(node.kind !== 167 /* MethodDeclaration */ || ts.isObjectLiteralMethod(node));
checkNodeDeferred(node);
if (ts.isFunctionExpression(node)) {
checkCollisionsForDeclarationName(node, node.name);
}
// The identityMapper object is used to indicate that function expressions are wildcards
if (checkMode && checkMode & 4 /* SkipContextSensitive */ && isContextSensitive(node)) {
// Skip parameters, return signature with return type that retains noncontextual parts so inferences can still be drawn in an early stage
if (!ts.getEffectiveReturnTypeNode(node) && !ts.hasContextSensitiveParameters(node)) {
// Return plain anyFunctionType if there is no possibility we'll make inferences from the return type
var contextualSignature = getContextualSignature(node);
if (contextualSignature && couldContainTypeVariables(getReturnTypeOfSignature(contextualSignature))) {
var links = getNodeLinks(node);
if (links.contextFreeType) {
return links.contextFreeType;
}
var returnType = getReturnTypeFromBody(node, checkMode);
var returnOnlySignature = createSignature(undefined, undefined, undefined, ts.emptyArray, returnType, /*resolvedTypePredicate*/ undefined, 0, 0 /* None */);
var returnOnlyType = createAnonymousType(node.symbol, emptySymbols, [returnOnlySignature], ts.emptyArray, ts.emptyArray);
returnOnlyType.objectFlags |= 524288 /* NonInferrableType */;
return links.contextFreeType = returnOnlyType;
}
}
return anyFunctionType;
}
// Grammar checking
var hasGrammarError = checkGrammarFunctionLikeDeclaration(node);
if (!hasGrammarError && node.kind === 211 /* FunctionExpression */) {
checkGrammarForGenerator(node);
}
contextuallyCheckFunctionExpressionOrObjectLiteralMethod(node, checkMode);
return getTypeOfSymbol(getSymbolOfNode(node));
}
function contextuallyCheckFunctionExpressionOrObjectLiteralMethod(node, checkMode) {
var links = getNodeLinks(node);
// Check if function expression is contextually typed and assign parameter types if so.
if (!(links.flags & 1024 /* ContextChecked */)) {
var contextualSignature = getContextualSignature(node);
// If a type check is started at a function expression that is an argument of a function call, obtaining the
// contextual type may recursively get back to here during overload resolution of the call. If so, we will have
// already assigned contextual types.
if (!(links.flags & 1024 /* ContextChecked */)) {
links.flags |= 1024 /* ContextChecked */;
var signature = ts.firstOrUndefined(getSignaturesOfType(getTypeOfSymbol(getSymbolOfNode(node)), 0 /* Call */));
if (!signature) {
return;
}
if (isContextSensitive(node)) {
if (contextualSignature) {
var inferenceContext = getInferenceContext(node);
if (checkMode && checkMode & 2 /* Inferential */) {
inferFromAnnotatedParameters(signature, contextualSignature, inferenceContext);
}
var instantiatedContextualSignature = inferenceContext ?
instantiateSignature(contextualSignature, inferenceContext.mapper) : contextualSignature;
assignContextualParameterTypes(signature, instantiatedContextualSignature);
}
else {
// Force resolution of all parameter types such that the absence of a contextual type is consistently reflected.
assignNonContextualParameterTypes(signature);
}
}
if (contextualSignature && !getReturnTypeFromAnnotation(node) && !signature.resolvedReturnType) {
var returnType = getReturnTypeFromBody(node, checkMode);
if (!signature.resolvedReturnType) {
signature.resolvedReturnType = returnType;
}
}
checkSignatureDeclaration(node);
}
}
}
function checkFunctionExpressionOrObjectLiteralMethodDeferred(node) {
ts.Debug.assert(node.kind !== 167 /* MethodDeclaration */ || ts.isObjectLiteralMethod(node));
var functionFlags = ts.getFunctionFlags(node);
var returnType = getReturnTypeFromAnnotation(node);
checkAllCodePathsInNonVoidFunctionReturnOrThrow(node, returnType);
if (node.body) {
if (!ts.getEffectiveReturnTypeNode(node)) {
// There are some checks that are only performed in getReturnTypeFromBody, that may produce errors
// we need. An example is the noImplicitAny errors resulting from widening the return expression
// of a function. Because checking of function expression bodies is deferred, there was never an
// appropriate time to do this during the main walk of the file (see the comment at the top of
// checkFunctionExpressionBodies). So it must be done now.
getReturnTypeOfSignature(getSignatureFromDeclaration(node));
}
if (node.body.kind === 233 /* Block */) {
checkSourceElement(node.body);
}
else {
// From within an async function you can return either a non-promise value or a promise. Any
// Promise/A+ compatible implementation will always assimilate any foreign promise, so we
// should not be checking assignability of a promise to the return type. Instead, we need to
// check assignability of the awaited type of the expression body against the promised type of
// its return type annotation.
var exprType = checkExpression(node.body);
var returnOrPromisedType = returnType && unwrapReturnType(returnType, functionFlags);
if (returnOrPromisedType) {
if ((functionFlags & 3 /* AsyncGenerator */) === 2 /* Async */) { // Async function
var awaitedType = checkAwaitedType(exprType, node.body, ts.Diagnostics.The_return_type_of_an_async_function_must_either_be_a_valid_promise_or_must_not_contain_a_callable_then_member);
checkTypeAssignableToAndOptionallyElaborate(awaitedType, returnOrPromisedType, node.body, node.body);
}
else { // Normal function
checkTypeAssignableToAndOptionallyElaborate(exprType, returnOrPromisedType, node.body, node.body);
}
}
}
}
}
function checkArithmeticOperandType(operand, type, diagnostic, isAwaitValid) {
if (isAwaitValid === void 0) { isAwaitValid = false; }
if (!isTypeAssignableTo(type, numberOrBigIntType)) {
var awaitedType = isAwaitValid && getAwaitedTypeOfPromise(type);
errorAndMaybeSuggestAwait(operand, !!awaitedType && isTypeAssignableTo(awaitedType, numberOrBigIntType), diagnostic);
return false;
}
return true;
}
function isReadonlyAssignmentDeclaration(d) {
if (!ts.isCallExpression(d)) {
return false;
}
if (!ts.isBindableObjectDefinePropertyCall(d)) {
return false;
}
var objectLitType = checkExpressionCached(d.arguments[2]);
var valueType = getTypeOfPropertyOfType(objectLitType, "value");
if (valueType) {
var writableProp = getPropertyOfType(objectLitType, "writable");
var writableType = writableProp && getTypeOfSymbol(writableProp);
if (!writableType || writableType === falseType || writableType === regularFalseType) {
return true;
}
// We include this definition whereupon we walk back and check the type at the declaration because
// The usual definition of `Object.defineProperty` will _not_ cause literal types to be preserved in the
// argument types, should the type be contextualized by the call itself.
if (writableProp && writableProp.valueDeclaration && ts.isPropertyAssignment(writableProp.valueDeclaration)) {
var initializer = writableProp.valueDeclaration.initializer;
var rawOriginalType = checkExpression(initializer);
if (rawOriginalType === falseType || rawOriginalType === regularFalseType) {
return true;
}
}
return false;
}
var setProp = getPropertyOfType(objectLitType, "set");
return !setProp;
}
function isReadonlySymbol(symbol) {
// The following symbols are considered read-only:
// Properties with a 'readonly' modifier
// Variables declared with 'const'
// Get accessors without matching set accessors
// Enum members
// Object.defineProperty assignments with writable false or no setter
// Unions and intersections of the above (unions and intersections eagerly set isReadonly on creation)
return !!(ts.getCheckFlags(symbol) & 8 /* Readonly */ ||
symbol.flags & 4 /* Property */ && ts.getDeclarationModifierFlagsFromSymbol(symbol) & 64 /* Readonly */ ||
symbol.flags & 3 /* Variable */ && getDeclarationNodeFlagsFromSymbol(symbol) & 2 /* Const */ ||
symbol.flags & 98304 /* Accessor */ && !(symbol.flags & 65536 /* SetAccessor */) ||
symbol.flags & 8 /* EnumMember */ ||
ts.some(symbol.declarations, isReadonlyAssignmentDeclaration));
}
function isAssignmentToReadonlyEntity(expr, symbol, assignmentKind) {
var _a, _b;
if (assignmentKind === 0 /* None */) {
// no assigment means it doesn't matter whether the entity is readonly
return false;
}
if (isReadonlySymbol(symbol)) {
// Allow assignments to readonly properties within constructors of the same class declaration.
if (symbol.flags & 4 /* Property */ &&
ts.isAccessExpression(expr) &&
expr.expression.kind === 108 /* ThisKeyword */) {
// Look for if this is the constructor for the class that `symbol` is a property of.
var ctor = ts.getContainingFunction(expr);
if (!(ctor && (ctor.kind === 169 /* Constructor */ || isJSConstructor(ctor)))) {
return true;
}
if (symbol.valueDeclaration) {
var isAssignmentDeclaration_1 = ts.isBinaryExpression(symbol.valueDeclaration);
var isLocalPropertyDeclaration = ctor.parent === symbol.valueDeclaration.parent;
var isLocalParameterProperty = ctor === symbol.valueDeclaration.parent;
var isLocalThisPropertyAssignment = isAssignmentDeclaration_1 && ((_a = symbol.parent) === null || _a === void 0 ? void 0 : _a.valueDeclaration) === ctor.parent;
var isLocalThisPropertyAssignmentConstructorFunction = isAssignmentDeclaration_1 && ((_b = symbol.parent) === null || _b === void 0 ? void 0 : _b.valueDeclaration) === ctor;
var isWriteableSymbol = isLocalPropertyDeclaration
|| isLocalParameterProperty
|| isLocalThisPropertyAssignment
|| isLocalThisPropertyAssignmentConstructorFunction;
return !isWriteableSymbol;
}
}
return true;
}
if (ts.isAccessExpression(expr)) {
// references through namespace import should be readonly
var node = ts.skipParentheses(expr.expression);
if (node.kind === 79 /* Identifier */) {
var symbol_2 = getNodeLinks(node).resolvedSymbol;
if (symbol_2.flags & 2097152 /* Alias */) {
var declaration = getDeclarationOfAliasSymbol(symbol_2);
return !!declaration && declaration.kind === 266 /* NamespaceImport */;
}
}
}
return false;
}
function checkReferenceExpression(expr, invalidReferenceMessage, invalidOptionalChainMessage) {
// References are combinations of identifiers, parentheses, and property accesses.
var node = ts.skipOuterExpressions(expr, 6 /* Assertions */ | 1 /* Parentheses */);
if (node.kind !== 79 /* Identifier */ && !ts.isAccessExpression(node)) {
error(expr, invalidReferenceMessage);
return false;
}
if (node.flags & 32 /* OptionalChain */) {
error(expr, invalidOptionalChainMessage);
return false;
}
return true;
}
function checkDeleteExpression(node) {
checkExpression(node.expression);
var expr = ts.skipParentheses(node.expression);
if (!ts.isAccessExpression(expr)) {
error(expr, ts.Diagnostics.The_operand_of_a_delete_operator_must_be_a_property_reference);
return booleanType;
}
if (ts.isPropertyAccessExpression(expr) && ts.isPrivateIdentifier(expr.name)) {
error(expr, ts.Diagnostics.The_operand_of_a_delete_operator_cannot_be_a_private_identifier);
}
var links = getNodeLinks(expr);
var symbol = getExportSymbolOfValueSymbolIfExported(links.resolvedSymbol);
if (symbol) {
if (isReadonlySymbol(symbol)) {
error(expr, ts.Diagnostics.The_operand_of_a_delete_operator_cannot_be_a_read_only_property);
}
checkDeleteExpressionMustBeOptional(expr, symbol);
}
return booleanType;
}
function checkDeleteExpressionMustBeOptional(expr, symbol) {
var type = getTypeOfSymbol(symbol);
if (strictNullChecks &&
!(type.flags & (3 /* AnyOrUnknown */ | 131072 /* Never */)) &&
!(exactOptionalPropertyTypes ? symbol.flags & 16777216 /* Optional */ : getFalsyFlags(type) & 32768 /* Undefined */)) {
error(expr, ts.Diagnostics.The_operand_of_a_delete_operator_must_be_optional);
}
}
function checkTypeOfExpression(node) {
checkExpression(node.expression);
return typeofType;
}
function checkVoidExpression(node) {
checkExpression(node.expression);
return undefinedWideningType;
}
function checkAwaitExpression(node) {
// Grammar checking
if (produceDiagnostics) {
var container = ts.getContainingFunctionOrClassStaticBlock(node);
if (container && ts.isClassStaticBlockDeclaration(container)) {
error(node, ts.Diagnostics.Await_expression_cannot_be_used_inside_a_class_static_block);
}
else if (!(node.flags & 32768 /* AwaitContext */)) {
if (ts.isInTopLevelContext(node)) {
var sourceFile = ts.getSourceFileOfNode(node);
if (!hasParseDiagnostics(sourceFile)) {
var span = void 0;
if (!ts.isEffectiveExternalModule(sourceFile, compilerOptions)) {
if (!span)
span = ts.getSpanOfTokenAtPosition(sourceFile, node.pos);
var diagnostic = ts.createFileDiagnostic(sourceFile, span.start, span.length, ts.Diagnostics.await_expressions_are_only_allowed_at_the_top_level_of_a_file_when_that_file_is_a_module_but_this_file_has_no_imports_or_exports_Consider_adding_an_empty_export_to_make_this_file_a_module);
diagnostics.add(diagnostic);
}
if ((moduleKind !== ts.ModuleKind.ESNext && moduleKind !== ts.ModuleKind.System) || languageVersion < 4 /* ES2017 */) {
span = ts.getSpanOfTokenAtPosition(sourceFile, node.pos);
var diagnostic = ts.createFileDiagnostic(sourceFile, span.start, span.length, ts.Diagnostics.Top_level_await_expressions_are_only_allowed_when_the_module_option_is_set_to_esnext_or_system_and_the_target_option_is_set_to_es2017_or_higher);
diagnostics.add(diagnostic);
}
}
}
else {
// use of 'await' in non-async function
var sourceFile = ts.getSourceFileOfNode(node);
if (!hasParseDiagnostics(sourceFile)) {
var span = ts.getSpanOfTokenAtPosition(sourceFile, node.pos);
var diagnostic = ts.createFileDiagnostic(sourceFile, span.start, span.length, ts.Diagnostics.await_expressions_are_only_allowed_within_async_functions_and_at_the_top_levels_of_modules);
if (container && container.kind !== 169 /* Constructor */ && (ts.getFunctionFlags(container) & 2 /* Async */) === 0) {
var relatedInfo = ts.createDiagnosticForNode(container, ts.Diagnostics.Did_you_mean_to_mark_this_function_as_async);
ts.addRelatedInfo(diagnostic, relatedInfo);
}
diagnostics.add(diagnostic);
}
}
}
if (isInParameterInitializerBeforeContainingFunction(node)) {
error(node, ts.Diagnostics.await_expressions_cannot_be_used_in_a_parameter_initializer);
}
}
var operandType = checkExpression(node.expression);
var awaitedType = checkAwaitedType(operandType, node, ts.Diagnostics.Type_of_await_operand_must_either_be_a_valid_promise_or_must_not_contain_a_callable_then_member);
if (awaitedType === operandType && awaitedType !== errorType && !(operandType.flags & 3 /* AnyOrUnknown */)) {
addErrorOrSuggestion(/*isError*/ false, ts.createDiagnosticForNode(node, ts.Diagnostics.await_has_no_effect_on_the_type_of_this_expression));
}
return awaitedType;
}
function checkPrefixUnaryExpression(node) {
var operandType = checkExpression(node.operand);
if (operandType === silentNeverType) {
return silentNeverType;
}
switch (node.operand.kind) {
case 8 /* NumericLiteral */:
switch (node.operator) {
case 40 /* MinusToken */:
return getFreshTypeOfLiteralType(getNumberLiteralType(-node.operand.text));
case 39 /* PlusToken */:
return getFreshTypeOfLiteralType(getNumberLiteralType(+node.operand.text));
}
break;
case 9 /* BigIntLiteral */:
if (node.operator === 40 /* MinusToken */) {
return getFreshTypeOfLiteralType(getBigIntLiteralType({
negative: true,
base10Value: ts.parsePseudoBigInt(node.operand.text)
}));
}
}
switch (node.operator) {
case 39 /* PlusToken */:
case 40 /* MinusToken */:
case 54 /* TildeToken */:
checkNonNullType(operandType, node.operand);
if (maybeTypeOfKind(operandType, 12288 /* ESSymbolLike */)) {
error(node.operand, ts.Diagnostics.The_0_operator_cannot_be_applied_to_type_symbol, ts.tokenToString(node.operator));
}
if (node.operator === 39 /* PlusToken */) {
if (maybeTypeOfKind(operandType, 2112 /* BigIntLike */)) {
error(node.operand, ts.Diagnostics.Operator_0_cannot_be_applied_to_type_1, ts.tokenToString(node.operator), typeToString(getBaseTypeOfLiteralType(operandType)));
}
return numberType;
}
return getUnaryResultType(operandType);
case 53 /* ExclamationToken */:
checkTruthinessExpression(node.operand);
var facts = getTypeFacts(operandType) & (4194304 /* Truthy */ | 8388608 /* Falsy */);
return facts === 4194304 /* Truthy */ ? falseType :
facts === 8388608 /* Falsy */ ? trueType :
booleanType;
case 45 /* PlusPlusToken */:
case 46 /* MinusMinusToken */:
var ok = checkArithmeticOperandType(node.operand, checkNonNullType(operandType, node.operand), ts.Diagnostics.An_arithmetic_operand_must_be_of_type_any_number_bigint_or_an_enum_type);
if (ok) {
// run check only if former checks succeeded to avoid reporting cascading errors
checkReferenceExpression(node.operand, ts.Diagnostics.The_operand_of_an_increment_or_decrement_operator_must_be_a_variable_or_a_property_access, ts.Diagnostics.The_operand_of_an_increment_or_decrement_operator_may_not_be_an_optional_property_access);
}
return getUnaryResultType(operandType);
}
return errorType;
}
function checkPostfixUnaryExpression(node) {
var operandType = checkExpression(node.operand);
if (operandType === silentNeverType) {
return silentNeverType;
}
var ok = checkArithmeticOperandType(node.operand, checkNonNullType(operandType, node.operand), ts.Diagnostics.An_arithmetic_operand_must_be_of_type_any_number_bigint_or_an_enum_type);
if (ok) {
// run check only if former checks succeeded to avoid reporting cascading errors
checkReferenceExpression(node.operand, ts.Diagnostics.The_operand_of_an_increment_or_decrement_operator_must_be_a_variable_or_a_property_access, ts.Diagnostics.The_operand_of_an_increment_or_decrement_operator_may_not_be_an_optional_property_access);
}
return getUnaryResultType(operandType);
}
function getUnaryResultType(operandType) {
if (maybeTypeOfKind(operandType, 2112 /* BigIntLike */)) {
return isTypeAssignableToKind(operandType, 3 /* AnyOrUnknown */) || maybeTypeOfKind(operandType, 296 /* NumberLike */)
? numberOrBigIntType
: bigintType;
}
// If it's not a bigint type, implicit coercion will result in a number
return numberType;
}
// Return true if type might be of the given kind. A union or intersection type might be of a given
// kind if at least one constituent type is of the given kind.
function maybeTypeOfKind(type, kind) {
if (type.flags & kind) {
return true;
}
if (type.flags & 3145728 /* UnionOrIntersection */) {
var types = type.types;
for (var _i = 0, types_21 = types; _i < types_21.length; _i++) {
var t = types_21[_i];
if (maybeTypeOfKind(t, kind)) {
return true;
}
}
}
return false;
}
function isTypeAssignableToKind(source, kind, strict) {
if (source.flags & kind) {
return true;
}
if (strict && source.flags & (3 /* AnyOrUnknown */ | 16384 /* Void */ | 32768 /* Undefined */ | 65536 /* Null */)) {
return false;
}
return !!(kind & 296 /* NumberLike */) && isTypeAssignableTo(source, numberType) ||
!!(kind & 2112 /* BigIntLike */) && isTypeAssignableTo(source, bigintType) ||
!!(kind & 402653316 /* StringLike */) && isTypeAssignableTo(source, stringType) ||
!!(kind & 528 /* BooleanLike */) && isTypeAssignableTo(source, booleanType) ||
!!(kind & 16384 /* Void */) && isTypeAssignableTo(source, voidType) ||
!!(kind & 131072 /* Never */) && isTypeAssignableTo(source, neverType) ||
!!(kind & 65536 /* Null */) && isTypeAssignableTo(source, nullType) ||
!!(kind & 32768 /* Undefined */) && isTypeAssignableTo(source, undefinedType) ||
!!(kind & 4096 /* ESSymbol */) && isTypeAssignableTo(source, esSymbolType) ||
!!(kind & 67108864 /* NonPrimitive */) && isTypeAssignableTo(source, nonPrimitiveType);
}
function allTypesAssignableToKind(source, kind, strict) {
return source.flags & 1048576 /* Union */ ?
ts.every(source.types, function (subType) { return allTypesAssignableToKind(subType, kind, strict); }) :
isTypeAssignableToKind(source, kind, strict);
}
function isConstEnumObjectType(type) {
return !!(ts.getObjectFlags(type) & 16 /* Anonymous */) && !!type.symbol && isConstEnumSymbol(type.symbol);
}
function isConstEnumSymbol(symbol) {
return (symbol.flags & 128 /* ConstEnum */) !== 0;
}
function checkInstanceOfExpression(left, right, leftType, rightType) {
if (leftType === silentNeverType || rightType === silentNeverType) {
return silentNeverType;
}
// TypeScript 1.0 spec (April 2014): 4.15.4
// The instanceof operator requires the left operand to be of type Any, an object type, or a type parameter type,
// and the right operand to be of type Any, a subtype of the 'Function' interface type, or have a call or construct signature.
// The result is always of the Boolean primitive type.
// NOTE: do not raise error if leftType is unknown as related error was already reported
if (!isTypeAny(leftType) &&
allTypesAssignableToKind(leftType, 131068 /* Primitive */)) {
error(left, ts.Diagnostics.The_left_hand_side_of_an_instanceof_expression_must_be_of_type_any_an_object_type_or_a_type_parameter);
}
// NOTE: do not raise error if right is unknown as related error was already reported
if (!(isTypeAny(rightType) || typeHasCallOrConstructSignatures(rightType) || isTypeSubtypeOf(rightType, globalFunctionType))) {
error(right, ts.Diagnostics.The_right_hand_side_of_an_instanceof_expression_must_be_of_type_any_or_of_a_type_assignable_to_the_Function_interface_type);
}
return booleanType;
}
function checkInExpression(left, right, leftType, rightType) {
if (leftType === silentNeverType || rightType === silentNeverType) {
return silentNeverType;
}
leftType = checkNonNullType(leftType, left);
rightType = checkNonNullType(rightType, right);
// TypeScript 1.0 spec (April 2014): 4.15.5
// The in operator requires the left operand to be of type Any, the String primitive type, or the Number primitive type,
// and the right operand to be
//
// 1. assignable to the non-primitive type,
// 2. an unconstrained type parameter,
// 3. a union or intersection including one or more type parameters, whose constituents are all assignable to the
// the non-primitive type, or are unconstrainted type parameters, or have constraints assignable to the
// non-primitive type, or
// 4. a type parameter whose constraint is
// i. an object type,
// ii. the non-primitive type, or
// iii. a union or intersection with at least one constituent assignable to an object or non-primitive type.
//
// The divergent behavior for type parameters and unions containing type parameters is a workaround for type
// parameters not being narrowable. If the right operand is a concrete type, we can error if there is any chance
// it is a primitive. But if the operand is a type parameter, it cannot be narrowed, so we don't issue an error
// unless *all* instantiations would result in an error.
//
// The result is always of the Boolean primitive type.
if (!(allTypesAssignableToKind(leftType, 402653316 /* StringLike */ | 296 /* NumberLike */ | 12288 /* ESSymbolLike */) ||
isTypeAssignableToKind(leftType, 4194304 /* Index */ | 134217728 /* TemplateLiteral */ | 268435456 /* StringMapping */ | 262144 /* TypeParameter */))) {
error(left, ts.Diagnostics.The_left_hand_side_of_an_in_expression_must_be_of_type_any_string_number_or_symbol);
}
var rightTypeConstraint = getConstraintOfType(rightType);
if (!allTypesAssignableToKind(rightType, 67108864 /* NonPrimitive */ | 58982400 /* InstantiableNonPrimitive */) ||
rightTypeConstraint && (isTypeAssignableToKind(rightType, 3145728 /* UnionOrIntersection */) && !allTypesAssignableToKind(rightTypeConstraint, 67108864 /* NonPrimitive */ | 58982400 /* InstantiableNonPrimitive */) ||
!maybeTypeOfKind(rightTypeConstraint, 67108864 /* NonPrimitive */ | 58982400 /* InstantiableNonPrimitive */ | 524288 /* Object */))) {
error(right, ts.Diagnostics.The_right_hand_side_of_an_in_expression_must_not_be_a_primitive);
}
return booleanType;
}
function checkObjectLiteralAssignment(node, sourceType, rightIsThis) {
var properties = node.properties;
if (strictNullChecks && properties.length === 0) {
return checkNonNullType(sourceType, node);
}
for (var i = 0; i < properties.length; i++) {
checkObjectLiteralDestructuringPropertyAssignment(node, sourceType, i, properties, rightIsThis);
}
return sourceType;
}
/** Note: If property cannot be a SpreadAssignment, then allProperties does not need to be provided */
function checkObjectLiteralDestructuringPropertyAssignment(node, objectLiteralType, propertyIndex, allProperties, rightIsThis) {
if (rightIsThis === void 0) { rightIsThis = false; }
var properties = node.properties;
var property = properties[propertyIndex];
if (property.kind === 291 /* PropertyAssignment */ || property.kind === 292 /* ShorthandPropertyAssignment */) {
var name = property.name;
var exprType = getLiteralTypeFromPropertyName(name);
if (isTypeUsableAsPropertyName(exprType)) {
var text = getPropertyNameFromType(exprType);
var prop = getPropertyOfType(objectLiteralType, text);
if (prop) {
markPropertyAsReferenced(prop, property, rightIsThis);
checkPropertyAccessibility(property, /*isSuper*/ false, /*writing*/ true, objectLiteralType, prop);
}
}
var elementType = getIndexedAccessType(objectLiteralType, exprType, 32 /* ExpressionPosition */, name);
var type = getFlowTypeOfDestructuring(property, elementType);
return checkDestructuringAssignment(property.kind === 292 /* ShorthandPropertyAssignment */ ? property : property.initializer, type);
}
else if (property.kind === 293 /* SpreadAssignment */) {
if (propertyIndex < properties.length - 1) {
error(property, ts.Diagnostics.A_rest_element_must_be_last_in_a_destructuring_pattern);
}
else {
if (languageVersion < 99 /* ESNext */) {
checkExternalEmitHelpers(property, 4 /* Rest */);
}
var nonRestNames = [];
if (allProperties) {
for (var _i = 0, allProperties_1 = allProperties; _i < allProperties_1.length; _i++) {
var otherProperty = allProperties_1[_i];
if (!ts.isSpreadAssignment(otherProperty)) {
nonRestNames.push(otherProperty.name);
}
}
}
var type = getRestType(objectLiteralType, nonRestNames, objectLiteralType.symbol);
checkGrammarForDisallowedTrailingComma(allProperties, ts.Diagnostics.A_rest_parameter_or_binding_pattern_may_not_have_a_trailing_comma);
return checkDestructuringAssignment(property.expression, type);
}
}
else {
error(property, ts.Diagnostics.Property_assignment_expected);
}
}
function checkArrayLiteralAssignment(node, sourceType, checkMode) {
var elements = node.elements;
if (languageVersion < 2 /* ES2015 */ && compilerOptions.downlevelIteration) {
checkExternalEmitHelpers(node, 512 /* Read */);
}
// This elementType will be used if the specific property corresponding to this index is not
// present (aka the tuple element property). This call also checks that the parentType is in
// fact an iterable or array (depending on target language).
var possiblyOutOfBoundsType = checkIteratedTypeOrElementType(65 /* Destructuring */ | 128 /* PossiblyOutOfBounds */, sourceType, undefinedType, node) || errorType;
var inBoundsType = compilerOptions.noUncheckedIndexedAccess ? undefined : possiblyOutOfBoundsType;
for (var i = 0; i < elements.length; i++) {
var type = possiblyOutOfBoundsType;
if (node.elements[i].kind === 223 /* SpreadElement */) {
type = inBoundsType = inBoundsType !== null && inBoundsType !== void 0 ? inBoundsType : (checkIteratedTypeOrElementType(65 /* Destructuring */, sourceType, undefinedType, node) || errorType);
}
checkArrayLiteralDestructuringElementAssignment(node, sourceType, i, type, checkMode);
}
return sourceType;
}
function checkArrayLiteralDestructuringElementAssignment(node, sourceType, elementIndex, elementType, checkMode) {
var elements = node.elements;
var element = elements[elementIndex];
if (element.kind !== 225 /* OmittedExpression */) {
if (element.kind !== 223 /* SpreadElement */) {
var indexType = getNumberLiteralType(elementIndex);
if (isArrayLikeType(sourceType)) {
// We create a synthetic expression so that getIndexedAccessType doesn't get confused
// when the element is a SyntaxKind.ElementAccessExpression.
var accessFlags = 32 /* ExpressionPosition */ | (hasDefaultValue(element) ? 16 /* NoTupleBoundsCheck */ : 0);
var elementType_2 = getIndexedAccessTypeOrUndefined(sourceType, indexType, accessFlags, createSyntheticExpression(element, indexType)) || errorType;
var assignedType = hasDefaultValue(element) ? getTypeWithFacts(elementType_2, 524288 /* NEUndefined */) : elementType_2;
var type = getFlowTypeOfDestructuring(element, assignedType);
return checkDestructuringAssignment(element, type, checkMode);
}
return checkDestructuringAssignment(element, elementType, checkMode);
}
if (elementIndex < elements.length - 1) {
error(element, ts.Diagnostics.A_rest_element_must_be_last_in_a_destructuring_pattern);
}
else {
var restExpression = element.expression;
if (restExpression.kind === 219 /* BinaryExpression */ && restExpression.operatorToken.kind === 63 /* EqualsToken */) {
error(restExpression.operatorToken, ts.Diagnostics.A_rest_element_cannot_have_an_initializer);
}
else {
checkGrammarForDisallowedTrailingComma(node.elements, ts.Diagnostics.A_rest_parameter_or_binding_pattern_may_not_have_a_trailing_comma);
var type = everyType(sourceType, isTupleType) ?
mapType(sourceType, function (t) { return sliceTupleType(t, elementIndex); }) :
createArrayType(elementType);
return checkDestructuringAssignment(restExpression, type, checkMode);
}
}
}
return undefined;
}
function checkDestructuringAssignment(exprOrAssignment, sourceType, checkMode, rightIsThis) {
var target;
if (exprOrAssignment.kind === 292 /* ShorthandPropertyAssignment */) {
var prop = exprOrAssignment;
if (prop.objectAssignmentInitializer) {
// In strict null checking mode, if a default value of a non-undefined type is specified, remove
// undefined from the final type.
if (strictNullChecks &&
!(getFalsyFlags(checkExpression(prop.objectAssignmentInitializer)) & 32768 /* Undefined */)) {
sourceType = getTypeWithFacts(sourceType, 524288 /* NEUndefined */);
}
checkBinaryLikeExpression(prop.name, prop.equalsToken, prop.objectAssignmentInitializer, checkMode);
}
target = exprOrAssignment.name;
}
else {
target = exprOrAssignment;
}
if (target.kind === 219 /* BinaryExpression */ && target.operatorToken.kind === 63 /* EqualsToken */) {
checkBinaryExpression(target, checkMode);
target = target.left;
}
if (target.kind === 203 /* ObjectLiteralExpression */) {
return checkObjectLiteralAssignment(target, sourceType, rightIsThis);
}
if (target.kind === 202 /* ArrayLiteralExpression */) {
return checkArrayLiteralAssignment(target, sourceType, checkMode);
}
return checkReferenceAssignment(target, sourceType, checkMode);
}
function checkReferenceAssignment(target, sourceType, checkMode) {
var targetType = checkExpression(target, checkMode);
var error = target.parent.kind === 293 /* SpreadAssignment */ ?
ts.Diagnostics.The_target_of_an_object_rest_assignment_must_be_a_variable_or_a_property_access :
ts.Diagnostics.The_left_hand_side_of_an_assignment_expression_must_be_a_variable_or_a_property_access;
var optionalError = target.parent.kind === 293 /* SpreadAssignment */ ?
ts.Diagnostics.The_target_of_an_object_rest_assignment_may_not_be_an_optional_property_access :
ts.Diagnostics.The_left_hand_side_of_an_assignment_expression_may_not_be_an_optional_property_access;
if (checkReferenceExpression(target, error, optionalError)) {
checkTypeAssignableToAndOptionallyElaborate(sourceType, targetType, target, target);
}
if (ts.isPrivateIdentifierPropertyAccessExpression(target)) {
checkExternalEmitHelpers(target.parent, 1048576 /* ClassPrivateFieldSet */);
}
return sourceType;
}
/**
* This is a *shallow* check: An expression is side-effect-free if the
* evaluation of the expression *itself* cannot produce side effects.
* For example, x++ / 3 is side-effect free because the / operator
* does not have side effects.
* The intent is to "smell test" an expression for correctness in positions where
* its value is discarded (e.g. the left side of the comma operator).
*/
function isSideEffectFree(node) {
node = ts.skipParentheses(node);
switch (node.kind) {
case 79 /* Identifier */:
case 10 /* StringLiteral */:
case 13 /* RegularExpressionLiteral */:
case 208 /* TaggedTemplateExpression */:
case 221 /* TemplateExpression */:
case 14 /* NoSubstitutionTemplateLiteral */:
case 8 /* NumericLiteral */:
case 9 /* BigIntLiteral */:
case 110 /* TrueKeyword */:
case 95 /* FalseKeyword */:
case 104 /* NullKeyword */:
case 151 /* UndefinedKeyword */:
case 211 /* FunctionExpression */:
case 224 /* ClassExpression */:
case 212 /* ArrowFunction */:
case 202 /* ArrayLiteralExpression */:
case 203 /* ObjectLiteralExpression */:
case 214 /* TypeOfExpression */:
case 228 /* NonNullExpression */:
case 277 /* JsxSelfClosingElement */:
case 276 /* JsxElement */:
return true;
case 220 /* ConditionalExpression */:
return isSideEffectFree(node.whenTrue) &&
isSideEffectFree(node.whenFalse);
case 219 /* BinaryExpression */:
if (ts.isAssignmentOperator(node.operatorToken.kind)) {
return false;
}
return isSideEffectFree(node.left) &&
isSideEffectFree(node.right);
case 217 /* PrefixUnaryExpression */:
case 218 /* PostfixUnaryExpression */:
// Unary operators ~, !, +, and - have no side effects.
// The rest do.
switch (node.operator) {
case 53 /* ExclamationToken */:
case 39 /* PlusToken */:
case 40 /* MinusToken */:
case 54 /* TildeToken */:
return true;
}
return false;
// Some forms listed here for clarity
case 215 /* VoidExpression */: // Explicit opt-out
case 209 /* TypeAssertionExpression */: // Not SEF, but can produce useful type warnings
case 227 /* AsExpression */: // Not SEF, but can produce useful type warnings
default:
return false;
}
}
function isTypeEqualityComparableTo(source, target) {
return (target.flags & 98304 /* Nullable */) !== 0 || isTypeComparableTo(source, target);
}
function createCheckBinaryExpression() {
var trampoline = ts.createBinaryExpressionTrampoline(onEnter, onLeft, onOperator, onRight, onExit, foldState);
return function (node, checkMode) {
var result = trampoline(node, checkMode);
ts.Debug.assertIsDefined(result);
return result;
};
function onEnter(node, state, checkMode) {
if (state) {
state.stackIndex++;
state.skip = false;
setLeftType(state, /*type*/ undefined);
setLastResult(state, /*type*/ undefined);
}
else {
state = {
checkMode: checkMode,
skip: false,
stackIndex: 0,
typeStack: [undefined, undefined],
};
}
if (ts.isInJSFile(node) && ts.getAssignedExpandoInitializer(node)) {
state.skip = true;
setLastResult(state, checkExpression(node.right, checkMode));
return state;
}
checkGrammarNullishCoalesceWithLogicalExpression(node);
var operator = node.operatorToken.kind;
if (operator === 63 /* EqualsToken */ && (node.left.kind === 203 /* ObjectLiteralExpression */ || node.left.kind === 202 /* ArrayLiteralExpression */)) {
state.skip = true;
setLastResult(state, checkDestructuringAssignment(node.left, checkExpression(node.right, checkMode), checkMode, node.right.kind === 108 /* ThisKeyword */));
return state;
}
return state;
}
function onLeft(left, state, _node) {
if (!state.skip) {
return maybeCheckExpression(state, left);
}
}
function onOperator(operatorToken, state, node) {
if (!state.skip) {
var leftType = getLastResult(state);
ts.Debug.assertIsDefined(leftType);
setLeftType(state, leftType);
setLastResult(state, /*type*/ undefined);
var operator = operatorToken.kind;
if (operator === 55 /* AmpersandAmpersandToken */ || operator === 56 /* BarBarToken */ || operator === 60 /* QuestionQuestionToken */) {
if (operator === 55 /* AmpersandAmpersandToken */) {
var parent = ts.walkUpParenthesizedExpressions(node.parent);
checkTestingKnownTruthyCallableOrAwaitableType(node.left, leftType, ts.isIfStatement(parent) ? parent.thenStatement : undefined);
}
checkTruthinessOfType(leftType, node.left);
}
}
}
function onRight(right, state, _node) {
if (!state.skip) {
return maybeCheckExpression(state, right);
}
}
function onExit(node, state) {
var result;
if (state.skip) {
result = getLastResult(state);
}
else {
var leftType = getLeftType(state);
ts.Debug.assertIsDefined(leftType);
var rightType = getLastResult(state);
ts.Debug.assertIsDefined(rightType);
result = checkBinaryLikeExpressionWorker(node.left, node.operatorToken, node.right, leftType, rightType, node);
}
state.skip = false;
setLeftType(state, /*type*/ undefined);
setLastResult(state, /*type*/ undefined);
state.stackIndex--;
return result;
}
function foldState(state, result, _side) {
setLastResult(state, result);
return state;
}
function maybeCheckExpression(state, node) {
if (ts.isBinaryExpression(node)) {
return node;
}
setLastResult(state, checkExpression(node, state.checkMode));
}
function getLeftType(state) {
return state.typeStack[state.stackIndex];
}
function setLeftType(state, type) {
state.typeStack[state.stackIndex] = type;
}
function getLastResult(state) {
return state.typeStack[state.stackIndex + 1];
}
function setLastResult(state, type) {
// To reduce overhead, reuse the next stack entry to store the
// last result. This avoids the overhead of an additional property
// on `WorkArea` and reuses empty stack entries as we walk back up
// the stack.
state.typeStack[state.stackIndex + 1] = type;
}
}
function checkGrammarNullishCoalesceWithLogicalExpression(node) {
var left = node.left, operatorToken = node.operatorToken, right = node.right;
if (operatorToken.kind === 60 /* QuestionQuestionToken */) {
if (ts.isBinaryExpression(left) && (left.operatorToken.kind === 56 /* BarBarToken */ || left.operatorToken.kind === 55 /* AmpersandAmpersandToken */)) {
grammarErrorOnNode(left, ts.Diagnostics._0_and_1_operations_cannot_be_mixed_without_parentheses, ts.tokenToString(left.operatorToken.kind), ts.tokenToString(operatorToken.kind));
}
if (ts.isBinaryExpression(right) && (right.operatorToken.kind === 56 /* BarBarToken */ || right.operatorToken.kind === 55 /* AmpersandAmpersandToken */)) {
grammarErrorOnNode(right, ts.Diagnostics._0_and_1_operations_cannot_be_mixed_without_parentheses, ts.tokenToString(right.operatorToken.kind), ts.tokenToString(operatorToken.kind));
}
}
}
// Note that this and `checkBinaryExpression` above should behave mostly the same, except this elides some
// expression-wide checks and does not use a work stack to fold nested binary expressions into the same callstack frame
function checkBinaryLikeExpression(left, operatorToken, right, checkMode, errorNode) {
var operator = operatorToken.kind;
if (operator === 63 /* EqualsToken */ && (left.kind === 203 /* ObjectLiteralExpression */ || left.kind === 202 /* ArrayLiteralExpression */)) {
return checkDestructuringAssignment(left, checkExpression(right, checkMode), checkMode, right.kind === 108 /* ThisKeyword */);
}
var leftType;
if (operator === 55 /* AmpersandAmpersandToken */ || operator === 56 /* BarBarToken */ || operator === 60 /* QuestionQuestionToken */) {
leftType = checkTruthinessExpression(left, checkMode);
}
else {
leftType = checkExpression(left, checkMode);
}
var rightType = checkExpression(right, checkMode);
return checkBinaryLikeExpressionWorker(left, operatorToken, right, leftType, rightType, errorNode);
}
function checkBinaryLikeExpressionWorker(left, operatorToken, right, leftType, rightType, errorNode) {
var operator = operatorToken.kind;
switch (operator) {
case 41 /* AsteriskToken */:
case 42 /* AsteriskAsteriskToken */:
case 66 /* AsteriskEqualsToken */:
case 67 /* AsteriskAsteriskEqualsToken */:
case 43 /* SlashToken */:
case 68 /* SlashEqualsToken */:
case 44 /* PercentToken */:
case 69 /* PercentEqualsToken */:
case 40 /* MinusToken */:
case 65 /* MinusEqualsToken */:
case 47 /* LessThanLessThanToken */:
case 70 /* LessThanLessThanEqualsToken */:
case 48 /* GreaterThanGreaterThanToken */:
case 71 /* GreaterThanGreaterThanEqualsToken */:
case 49 /* GreaterThanGreaterThanGreaterThanToken */:
case 72 /* GreaterThanGreaterThanGreaterThanEqualsToken */:
case 51 /* BarToken */:
case 74 /* BarEqualsToken */:
case 52 /* CaretToken */:
case 78 /* CaretEqualsToken */:
case 50 /* AmpersandToken */:
case 73 /* AmpersandEqualsToken */:
if (leftType === silentNeverType || rightType === silentNeverType) {
return silentNeverType;
}
leftType = checkNonNullType(leftType, left);
rightType = checkNonNullType(rightType, right);
var suggestedOperator = void 0;
// if a user tries to apply a bitwise operator to 2 boolean operands
// try and return them a helpful suggestion
if ((leftType.flags & 528 /* BooleanLike */) &&
(rightType.flags & 528 /* BooleanLike */) &&
(suggestedOperator = getSuggestedBooleanOperator(operatorToken.kind)) !== undefined) {
error(errorNode || operatorToken, ts.Diagnostics.The_0_operator_is_not_allowed_for_boolean_types_Consider_using_1_instead, ts.tokenToString(operatorToken.kind), ts.tokenToString(suggestedOperator));
return numberType;
}
else {
// otherwise just check each operand separately and report errors as normal
var leftOk = checkArithmeticOperandType(left, leftType, ts.Diagnostics.The_left_hand_side_of_an_arithmetic_operation_must_be_of_type_any_number_bigint_or_an_enum_type, /*isAwaitValid*/ true);
var rightOk = checkArithmeticOperandType(right, rightType, ts.Diagnostics.The_right_hand_side_of_an_arithmetic_operation_must_be_of_type_any_number_bigint_or_an_enum_type, /*isAwaitValid*/ true);
var resultType_1;
// If both are any or unknown, allow operation; assume it will resolve to number
if ((isTypeAssignableToKind(leftType, 3 /* AnyOrUnknown */) && isTypeAssignableToKind(rightType, 3 /* AnyOrUnknown */)) ||
// Or, if neither could be bigint, implicit coercion results in a number result
!(maybeTypeOfKind(leftType, 2112 /* BigIntLike */) || maybeTypeOfKind(rightType, 2112 /* BigIntLike */))) {
resultType_1 = numberType;
}
// At least one is assignable to bigint, so check that both are
else if (bothAreBigIntLike(leftType, rightType)) {
switch (operator) {
case 49 /* GreaterThanGreaterThanGreaterThanToken */:
case 72 /* GreaterThanGreaterThanGreaterThanEqualsToken */:
reportOperatorError();
break;
case 42 /* AsteriskAsteriskToken */:
case 67 /* AsteriskAsteriskEqualsToken */:
if (languageVersion < 3 /* ES2016 */) {
error(errorNode, ts.Diagnostics.Exponentiation_cannot_be_performed_on_bigint_values_unless_the_target_option_is_set_to_es2016_or_later);
}
}
resultType_1 = bigintType;
}
// Exactly one of leftType/rightType is assignable to bigint
else {
reportOperatorError(bothAreBigIntLike);
resultType_1 = errorType;
}
if (leftOk && rightOk) {
checkAssignmentOperator(resultType_1);
}
return resultType_1;
}
case 39 /* PlusToken */:
case 64 /* PlusEqualsToken */:
if (leftType === silentNeverType || rightType === silentNeverType) {
return silentNeverType;
}
if (!isTypeAssignableToKind(leftType, 402653316 /* StringLike */) && !isTypeAssignableToKind(rightType, 402653316 /* StringLike */)) {
leftType = checkNonNullType(leftType, left);
rightType = checkNonNullType(rightType, right);
}
var resultType = void 0;
if (isTypeAssignableToKind(leftType, 296 /* NumberLike */, /*strict*/ true) && isTypeAssignableToKind(rightType, 296 /* NumberLike */, /*strict*/ true)) {
// Operands of an enum type are treated as having the primitive type Number.
// If both operands are of the Number primitive type, the result is of the Number primitive type.
resultType = numberType;
}
else if (isTypeAssignableToKind(leftType, 2112 /* BigIntLike */, /*strict*/ true) && isTypeAssignableToKind(rightType, 2112 /* BigIntLike */, /*strict*/ true)) {
// If both operands are of the BigInt primitive type, the result is of the BigInt primitive type.
resultType = bigintType;
}
else if (isTypeAssignableToKind(leftType, 402653316 /* StringLike */, /*strict*/ true) || isTypeAssignableToKind(rightType, 402653316 /* StringLike */, /*strict*/ true)) {
// If one or both operands are of the String primitive type, the result is of the String primitive type.
resultType = stringType;
}
else if (isTypeAny(leftType) || isTypeAny(rightType)) {
// Otherwise, the result is of type Any.
// NOTE: unknown type here denotes error type. Old compiler treated this case as any type so do we.
resultType = leftType === errorType || rightType === errorType ? errorType : anyType;
}
// Symbols are not allowed at all in arithmetic expressions
if (resultType && !checkForDisallowedESSymbolOperand(operator)) {
return resultType;
}
if (!resultType) {
// Types that have a reasonably good chance of being a valid operand type.
// If both types have an awaited type of one of these, we'll assume the user
// might be missing an await without doing an exhaustive check that inserting
// await(s) will actually be a completely valid binary expression.
var closeEnoughKind_1 = 296 /* NumberLike */ | 2112 /* BigIntLike */ | 402653316 /* StringLike */ | 3 /* AnyOrUnknown */;
reportOperatorError(function (left, right) {
return isTypeAssignableToKind(left, closeEnoughKind_1) &&
isTypeAssignableToKind(right, closeEnoughKind_1);
});
return anyType;
}
if (operator === 64 /* PlusEqualsToken */) {
checkAssignmentOperator(resultType);
}
return resultType;
case 29 /* LessThanToken */:
case 31 /* GreaterThanToken */:
case 32 /* LessThanEqualsToken */:
case 33 /* GreaterThanEqualsToken */:
if (checkForDisallowedESSymbolOperand(operator)) {
leftType = getBaseTypeOfLiteralType(checkNonNullType(leftType, left));
rightType = getBaseTypeOfLiteralType(checkNonNullType(rightType, right));
reportOperatorErrorUnless(function (left, right) {
return isTypeComparableTo(left, right) || isTypeComparableTo(right, left) || (isTypeAssignableTo(left, numberOrBigIntType) && isTypeAssignableTo(right, numberOrBigIntType));
});
}
return booleanType;
case 34 /* EqualsEqualsToken */:
case 35 /* ExclamationEqualsToken */:
case 36 /* EqualsEqualsEqualsToken */:
case 37 /* ExclamationEqualsEqualsToken */:
reportOperatorErrorUnless(function (left, right) { return isTypeEqualityComparableTo(left, right) || isTypeEqualityComparableTo(right, left); });
return booleanType;
case 102 /* InstanceOfKeyword */:
return checkInstanceOfExpression(left, right, leftType, rightType);
case 101 /* InKeyword */:
return checkInExpression(left, right, leftType, rightType);
case 55 /* AmpersandAmpersandToken */:
case 76 /* AmpersandAmpersandEqualsToken */: {
var resultType_2 = getTypeFacts(leftType) & 4194304 /* Truthy */ ?
getUnionType([extractDefinitelyFalsyTypes(strictNullChecks ? leftType : getBaseTypeOfLiteralType(rightType)), rightType]) :
leftType;
if (operator === 76 /* AmpersandAmpersandEqualsToken */) {
checkAssignmentOperator(rightType);
}
return resultType_2;
}
case 56 /* BarBarToken */:
case 75 /* BarBarEqualsToken */: {
var resultType_3 = getTypeFacts(leftType) & 8388608 /* Falsy */ ?
getUnionType([removeDefinitelyFalsyTypes(leftType), rightType], 2 /* Subtype */) :
leftType;
if (operator === 75 /* BarBarEqualsToken */) {
checkAssignmentOperator(rightType);
}
return resultType_3;
}
case 60 /* QuestionQuestionToken */:
case 77 /* QuestionQuestionEqualsToken */: {
var resultType_4 = getTypeFacts(leftType) & 262144 /* EQUndefinedOrNull */ ?
getUnionType([getNonNullableType(leftType), rightType], 2 /* Subtype */) :
leftType;
if (operator === 77 /* QuestionQuestionEqualsToken */) {
checkAssignmentOperator(rightType);
}
return resultType_4;
}
case 63 /* EqualsToken */:
var declKind = ts.isBinaryExpression(left.parent) ? ts.getAssignmentDeclarationKind(left.parent) : 0 /* None */;
checkAssignmentDeclaration(declKind, rightType);
if (isAssignmentDeclaration(declKind)) {
if (!(rightType.flags & 524288 /* Object */) ||
declKind !== 2 /* ModuleExports */ &&
declKind !== 6 /* Prototype */ &&
!isEmptyObjectType(rightType) &&
!isFunctionObjectType(rightType) &&
!(ts.getObjectFlags(rightType) & 1 /* Class */)) {
// don't check assignability of module.exports=, C.prototype=, or expando types because they will necessarily be incomplete
checkAssignmentOperator(rightType);
}
return leftType;
}
else {
checkAssignmentOperator(rightType);
return getRegularTypeOfObjectLiteral(rightType);
}
case 27 /* CommaToken */:
if (!compilerOptions.allowUnreachableCode && isSideEffectFree(left) && !isEvalNode(right)) {
var sf = ts.getSourceFileOfNode(left);
var sourceText = sf.text;
var start_3 = ts.skipTrivia(sourceText, left.pos);
var isInDiag2657 = sf.parseDiagnostics.some(function (diag) {
if (diag.code !== ts.Diagnostics.JSX_expressions_must_have_one_parent_element.code)
return false;
return ts.textSpanContainsPosition(diag, start_3);
});
if (!isInDiag2657)
error(left, ts.Diagnostics.Left_side_of_comma_operator_is_unused_and_has_no_side_effects);
}
return rightType;
default:
return ts.Debug.fail();
}
function bothAreBigIntLike(left, right) {
return isTypeAssignableToKind(left, 2112 /* BigIntLike */) && isTypeAssignableToKind(right, 2112 /* BigIntLike */);
}
function checkAssignmentDeclaration(kind, rightType) {
if (kind === 2 /* ModuleExports */) {
for (var _i = 0, _a = getPropertiesOfObjectType(rightType); _i < _a.length; _i++) {
var prop = _a[_i];
var propType = getTypeOfSymbol(prop);
if (propType.symbol && propType.symbol.flags & 32 /* Class */) {
var name = prop.escapedName;
var symbol = resolveName(prop.valueDeclaration, name, 788968 /* Type */, undefined, name, /*isUse*/ false);
if ((symbol === null || symbol === void 0 ? void 0 : symbol.declarations) && symbol.declarations.some(ts.isJSDocTypedefTag)) {
addDuplicateDeclarationErrorsForSymbols(symbol, ts.Diagnostics.Duplicate_identifier_0, ts.unescapeLeadingUnderscores(name), prop);
addDuplicateDeclarationErrorsForSymbols(prop, ts.Diagnostics.Duplicate_identifier_0, ts.unescapeLeadingUnderscores(name), symbol);
}
}
}
}
}
function isEvalNode(node) {
return node.kind === 79 /* Identifier */ && node.escapedText === "eval";
}
// Return true if there was no error, false if there was an error.
function checkForDisallowedESSymbolOperand(operator) {
var offendingSymbolOperand = maybeTypeOfKind(leftType, 12288 /* ESSymbolLike */) ? left :
maybeTypeOfKind(rightType, 12288 /* ESSymbolLike */) ? right :
undefined;
if (offendingSymbolOperand) {
error(offendingSymbolOperand, ts.Diagnostics.The_0_operator_cannot_be_applied_to_type_symbol, ts.tokenToString(operator));
return false;
}
return true;
}
function getSuggestedBooleanOperator(operator) {
switch (operator) {
case 51 /* BarToken */:
case 74 /* BarEqualsToken */:
return 56 /* BarBarToken */;
case 52 /* CaretToken */:
case 78 /* CaretEqualsToken */:
return 37 /* ExclamationEqualsEqualsToken */;
case 50 /* AmpersandToken */:
case 73 /* AmpersandEqualsToken */:
return 55 /* AmpersandAmpersandToken */;
default:
return undefined;
}
}
function checkAssignmentOperator(valueType) {
if (produceDiagnostics && ts.isAssignmentOperator(operator)) {
// TypeScript 1.0 spec (April 2014): 4.17
// An assignment of the form
// VarExpr = ValueExpr
// requires VarExpr to be classified as a reference
// A compound assignment furthermore requires VarExpr to be classified as a reference (section 4.1)
// and the type of the non-compound operation to be assignable to the type of VarExpr.
if (checkReferenceExpression(left, ts.Diagnostics.The_left_hand_side_of_an_assignment_expression_must_be_a_variable_or_a_property_access, ts.Diagnostics.The_left_hand_side_of_an_assignment_expression_may_not_be_an_optional_property_access)
&& (!ts.isIdentifier(left) || ts.unescapeLeadingUnderscores(left.escapedText) !== "exports")) {
// to avoid cascading errors check assignability only if 'isReference' check succeeded and no errors were reported
checkTypeAssignableToAndOptionallyElaborate(valueType, leftType, left, right);
}
}
}
function isAssignmentDeclaration(kind) {
var _a;
switch (kind) {
case 2 /* ModuleExports */:
return true;
case 1 /* ExportsProperty */:
case 5 /* Property */:
case 6 /* Prototype */:
case 3 /* PrototypeProperty */:
case 4 /* ThisProperty */:
var symbol = getSymbolOfNode(left);
var init = ts.getAssignedExpandoInitializer(right);
return !!init && ts.isObjectLiteralExpression(init) &&
!!((_a = symbol === null || symbol === void 0 ? void 0 : symbol.exports) === null || _a === void 0 ? void 0 : _a.size);
default:
return false;
}
}
/**
* Returns true if an error is reported
*/
function reportOperatorErrorUnless(typesAreCompatible) {
if (!typesAreCompatible(leftType, rightType)) {
reportOperatorError(typesAreCompatible);
return true;
}
return false;
}
function reportOperatorError(isRelated) {
var _a;
var wouldWorkWithAwait = false;
var errNode = errorNode || operatorToken;
if (isRelated) {
var awaitedLeftType = getAwaitedType(leftType);
var awaitedRightType = getAwaitedType(rightType);
wouldWorkWithAwait = !(awaitedLeftType === leftType && awaitedRightType === rightType)
&& !!(awaitedLeftType && awaitedRightType)
&& isRelated(awaitedLeftType, awaitedRightType);
}
var effectiveLeft = leftType;
var effectiveRight = rightType;
if (!wouldWorkWithAwait && isRelated) {
_a = getBaseTypesIfUnrelated(leftType, rightType, isRelated), effectiveLeft = _a[0], effectiveRight = _a[1];
}
var _b = getTypeNamesForErrorDisplay(effectiveLeft, effectiveRight), leftStr = _b[0], rightStr = _b[1];
if (!tryGiveBetterPrimaryError(errNode, wouldWorkWithAwait, leftStr, rightStr)) {
errorAndMaybeSuggestAwait(errNode, wouldWorkWithAwait, ts.Diagnostics.Operator_0_cannot_be_applied_to_types_1_and_2, ts.tokenToString(operatorToken.kind), leftStr, rightStr);
}
}
function tryGiveBetterPrimaryError(errNode, maybeMissingAwait, leftStr, rightStr) {
var typeName;
switch (operatorToken.kind) {
case 36 /* EqualsEqualsEqualsToken */:
case 34 /* EqualsEqualsToken */:
typeName = "false";
break;
case 37 /* ExclamationEqualsEqualsToken */:
case 35 /* ExclamationEqualsToken */:
typeName = "true";
}
if (typeName) {
return errorAndMaybeSuggestAwait(errNode, maybeMissingAwait, ts.Diagnostics.This_condition_will_always_return_0_since_the_types_1_and_2_have_no_overlap, typeName, leftStr, rightStr);
}
return undefined;
}
}
function getBaseTypesIfUnrelated(leftType, rightType, isRelated) {
var effectiveLeft = leftType;
var effectiveRight = rightType;
var leftBase = getBaseTypeOfLiteralType(leftType);
var rightBase = getBaseTypeOfLiteralType(rightType);
if (!isRelated(leftBase, rightBase)) {
effectiveLeft = leftBase;
effectiveRight = rightBase;
}
return [effectiveLeft, effectiveRight];
}
function checkYieldExpression(node) {
// Grammar checking
if (produceDiagnostics) {
if (!(node.flags & 8192 /* YieldContext */)) {
grammarErrorOnFirstToken(node, ts.Diagnostics.A_yield_expression_is_only_allowed_in_a_generator_body);
}
if (isInParameterInitializerBeforeContainingFunction(node)) {
error(node, ts.Diagnostics.yield_expressions_cannot_be_used_in_a_parameter_initializer);
}
}
var func = ts.getContainingFunction(node);
if (!func)
return anyType;
var functionFlags = ts.getFunctionFlags(func);
if (!(functionFlags & 1 /* Generator */)) {
// If the user's code is syntactically correct, the func should always have a star. After all, we are in a yield context.
return anyType;
}
var isAsync = (functionFlags & 2 /* Async */) !== 0;
if (node.asteriskToken) {
// Async generator functions prior to ESNext require the __await, __asyncDelegator,
// and __asyncValues helpers
if (isAsync && languageVersion < 99 /* ESNext */) {
checkExternalEmitHelpers(node, 26624 /* AsyncDelegatorIncludes */);
}
// Generator functions prior to ES2015 require the __values helper
if (!isAsync && languageVersion < 2 /* ES2015 */ && compilerOptions.downlevelIteration) {
checkExternalEmitHelpers(node, 256 /* Values */);
}
}
// There is no point in doing an assignability check if the function
// has no explicit return type because the return type is directly computed
// from the yield expressions.
var returnType = getReturnTypeFromAnnotation(func);
var iterationTypes = returnType && getIterationTypesOfGeneratorFunctionReturnType(returnType, isAsync);
var signatureYieldType = iterationTypes && iterationTypes.yieldType || anyType;
var signatureNextType = iterationTypes && iterationTypes.nextType || anyType;
var resolvedSignatureNextType = isAsync ? getAwaitedType(signatureNextType) || anyType : signatureNextType;
var yieldExpressionType = node.expression ? checkExpression(node.expression) : undefinedWideningType;
var yieldedType = getYieldedTypeOfYieldExpression(node, yieldExpressionType, resolvedSignatureNextType, isAsync);
if (returnType && yieldedType) {
checkTypeAssignableToAndOptionallyElaborate(yieldedType, signatureYieldType, node.expression || node, node.expression);
}
if (node.asteriskToken) {
var use = isAsync ? 19 /* AsyncYieldStar */ : 17 /* YieldStar */;
return getIterationTypeOfIterable(use, 1 /* Return */, yieldExpressionType, node.expression)
|| anyType;
}
else if (returnType) {
return getIterationTypeOfGeneratorFunctionReturnType(2 /* Next */, returnType, isAsync)
|| anyType;
}
var type = getContextualIterationType(2 /* Next */, func);
if (!type) {
type = anyType;
if (produceDiagnostics && noImplicitAny && !ts.expressionResultIsUnused(node)) {
var contextualType = getContextualType(node);
if (!contextualType || isTypeAny(contextualType)) {
error(node, ts.Diagnostics.yield_expression_implicitly_results_in_an_any_type_because_its_containing_generator_lacks_a_return_type_annotation);
}
}
}
return type;
}
function checkConditionalExpression(node, checkMode) {
var type = checkTruthinessExpression(node.condition);
checkTestingKnownTruthyCallableOrAwaitableType(node.condition, type, node.whenTrue);
var type1 = checkExpression(node.whenTrue, checkMode);
var type2 = checkExpression(node.whenFalse, checkMode);
return getUnionType([type1, type2], 2 /* Subtype */);
}
function isTemplateLiteralContext(node) {
var parent = node.parent;
return ts.isParenthesizedExpression(parent) && isTemplateLiteralContext(parent) ||
ts.isElementAccessExpression(parent) && parent.argumentExpression === node;
}
function checkTemplateExpression(node) {
var texts = [node.head.text];
var types = [];
for (var _i = 0, _a = node.templateSpans; _i < _a.length; _i++) {
var span = _a[_i];
var type = checkExpression(span.expression);
if (maybeTypeOfKind(type, 12288 /* ESSymbolLike */)) {
error(span.expression, ts.Diagnostics.Implicit_conversion_of_a_symbol_to_a_string_will_fail_at_runtime_Consider_wrapping_this_expression_in_String);
}
texts.push(span.literal.text);
types.push(isTypeAssignableTo(type, templateConstraintType) ? type : stringType);
}
return isConstContext(node) || isTemplateLiteralContext(node) || someType(getContextualType(node) || unknownType, isTemplateLiteralContextualType) ? getTemplateLiteralType(texts, types) : stringType;
}
function isTemplateLiteralContextualType(type) {
return !!(type.flags & (128 /* StringLiteral */ | 134217728 /* TemplateLiteral */) ||
type.flags & 58982400 /* InstantiableNonPrimitive */ && maybeTypeOfKind(getBaseConstraintOfType(type) || unknownType, 402653316 /* StringLike */));
}
function getContextNode(node) {
if (node.kind === 284 /* JsxAttributes */ && !ts.isJsxSelfClosingElement(node.parent)) {
return node.parent.parent; // Needs to be the root JsxElement, so it encompasses the attributes _and_ the children (which are essentially part of the attributes)
}
return node;
}
function checkExpressionWithContextualType(node, contextualType, inferenceContext, checkMode) {
var context = getContextNode(node);
var saveContextualType = context.contextualType;
var saveInferenceContext = context.inferenceContext;
try {
context.contextualType = contextualType;
context.inferenceContext = inferenceContext;
var type = checkExpression(node, checkMode | 1 /* Contextual */ | (inferenceContext ? 2 /* Inferential */ : 0));
// We strip literal freshness when an appropriate contextual type is present such that contextually typed
// literals always preserve their literal types (otherwise they might widen during type inference). An alternative
// here would be to not mark contextually typed literals as fresh in the first place.
var result = maybeTypeOfKind(type, 2944 /* Literal */) && isLiteralOfContextualType(type, instantiateContextualType(contextualType, node)) ?
getRegularTypeOfLiteralType(type) : type;
return result;
}
finally {
// In the event our operation is canceled or some other exception occurs, reset the contextual type
// so that we do not accidentally hold onto an instance of the checker, as a Type created in the services layer
// may hold onto the checker that created it.
context.contextualType = saveContextualType;
context.inferenceContext = saveInferenceContext;
}
}
function checkExpressionCached(node, checkMode) {
var links = getNodeLinks(node);
if (!links.resolvedType) {
if (checkMode && checkMode !== 0 /* Normal */) {
return checkExpression(node, checkMode);
}
// When computing a type that we're going to cache, we need to ignore any ongoing control flow
// analysis because variables may have transient types in indeterminable states. Moving flowLoopStart
// to the top of the stack ensures all transient types are computed from a known point.
var saveFlowLoopStart = flowLoopStart;
var saveFlowTypeCache = flowTypeCache;
flowLoopStart = flowLoopCount;
flowTypeCache = undefined;
links.resolvedType = checkExpression(node, checkMode);
flowTypeCache = saveFlowTypeCache;
flowLoopStart = saveFlowLoopStart;
}
return links.resolvedType;
}
function isTypeAssertion(node) {
node = ts.skipParentheses(node);
return node.kind === 209 /* TypeAssertionExpression */ || node.kind === 227 /* AsExpression */;
}
function checkDeclarationInitializer(declaration, contextualType) {
var initializer = ts.getEffectiveInitializer(declaration);
var type = getQuickTypeOfExpression(initializer) ||
(contextualType ? checkExpressionWithContextualType(initializer, contextualType, /*inferenceContext*/ undefined, 0 /* Normal */) : checkExpressionCached(initializer));
return ts.isParameter(declaration) && declaration.name.kind === 200 /* ArrayBindingPattern */ &&
isTupleType(type) && !type.target.hasRestElement && getTypeReferenceArity(type) < declaration.name.elements.length ?
padTupleType(type, declaration.name) : type;
}
function padTupleType(type, pattern) {
var patternElements = pattern.elements;
var elementTypes = getTypeArguments(type).slice();
var elementFlags = type.target.elementFlags.slice();
for (var i = getTypeReferenceArity(type); i < patternElements.length; i++) {
var e = patternElements[i];
if (i < patternElements.length - 1 || !(e.kind === 201 /* BindingElement */ && e.dotDotDotToken)) {
elementTypes.push(!ts.isOmittedExpression(e) && hasDefaultValue(e) ? getTypeFromBindingElement(e, /*includePatternInType*/ false, /*reportErrors*/ false) : anyType);
elementFlags.push(2 /* Optional */);
if (!ts.isOmittedExpression(e) && !hasDefaultValue(e)) {
reportImplicitAny(e, anyType);
}
}
}
return createTupleType(elementTypes, elementFlags, type.target.readonly);
}
function widenTypeInferredFromInitializer(declaration, type) {
var widened = ts.getCombinedNodeFlags(declaration) & 2 /* Const */ || ts.isDeclarationReadonly(declaration) ? type : getWidenedLiteralType(type);
if (ts.isInJSFile(declaration)) {
if (isEmptyLiteralType(widened)) {
reportImplicitAny(declaration, anyType);
return anyType;
}
else if (isEmptyArrayLiteralType(widened)) {
reportImplicitAny(declaration, anyArrayType);
return anyArrayType;
}
}
return widened;
}
function isLiteralOfContextualType(candidateType, contextualType) {
if (contextualType) {
if (contextualType.flags & 3145728 /* UnionOrIntersection */) {
var types = contextualType.types;
return ts.some(types, function (t) { return isLiteralOfContextualType(candidateType, t); });
}
if (contextualType.flags & 58982400 /* InstantiableNonPrimitive */) {
// If the contextual type is a type variable constrained to a primitive type, consider
// this a literal context for literals of that primitive type. For example, given a
// type parameter 'T extends string', infer string literal types for T.
var constraint = getBaseConstraintOfType(contextualType) || unknownType;
return maybeTypeOfKind(constraint, 4 /* String */) && maybeTypeOfKind(candidateType, 128 /* StringLiteral */) ||
maybeTypeOfKind(constraint, 8 /* Number */) && maybeTypeOfKind(candidateType, 256 /* NumberLiteral */) ||
maybeTypeOfKind(constraint, 64 /* BigInt */) && maybeTypeOfKind(candidateType, 2048 /* BigIntLiteral */) ||
maybeTypeOfKind(constraint, 4096 /* ESSymbol */) && maybeTypeOfKind(candidateType, 8192 /* UniqueESSymbol */) ||
isLiteralOfContextualType(candidateType, constraint);
}
// If the contextual type is a literal of a particular primitive type, we consider this a
// literal context for all literals of that primitive type.
return !!(contextualType.flags & (128 /* StringLiteral */ | 4194304 /* Index */ | 134217728 /* TemplateLiteral */ | 268435456 /* StringMapping */) && maybeTypeOfKind(candidateType, 128 /* StringLiteral */) ||
contextualType.flags & 256 /* NumberLiteral */ && maybeTypeOfKind(candidateType, 256 /* NumberLiteral */) ||
contextualType.flags & 2048 /* BigIntLiteral */ && maybeTypeOfKind(candidateType, 2048 /* BigIntLiteral */) ||
contextualType.flags & 512 /* BooleanLiteral */ && maybeTypeOfKind(candidateType, 512 /* BooleanLiteral */) ||
contextualType.flags & 8192 /* UniqueESSymbol */ && maybeTypeOfKind(candidateType, 8192 /* UniqueESSymbol */));
}
return false;
}
function isConstContext(node) {
var parent = node.parent;
return ts.isAssertionExpression(parent) && ts.isConstTypeReference(parent.type) ||
(ts.isParenthesizedExpression(parent) || ts.isArrayLiteralExpression(parent) || ts.isSpreadElement(parent)) && isConstContext(parent) ||
(ts.isPropertyAssignment(parent) || ts.isShorthandPropertyAssignment(parent) || ts.isTemplateSpan(parent)) && isConstContext(parent.parent);
}
function checkExpressionForMutableLocation(node, checkMode, contextualType, forceTuple) {
var type = checkExpression(node, checkMode, forceTuple);
return isConstContext(node) ? getRegularTypeOfLiteralType(type) :
isTypeAssertion(node) ? type :
getWidenedLiteralLikeTypeForContextualType(type, instantiateContextualType(arguments.length === 2 ? getContextualType(node) : contextualType, node));
}
function checkPropertyAssignment(node, checkMode) {
// Do not use hasDynamicName here, because that returns false for well known symbols.
// We want to perform checkComputedPropertyName for all computed properties, including
// well known symbols.
if (node.name.kind === 160 /* ComputedPropertyName */) {
checkComputedPropertyName(node.name);
}
return checkExpressionForMutableLocation(node.initializer, checkMode);
}
function checkObjectLiteralMethod(node, checkMode) {
// Grammar checking
checkGrammarMethod(node);
// Do not use hasDynamicName here, because that returns false for well known symbols.
// We want to perform checkComputedPropertyName for all computed properties, including
// well known symbols.
if (node.name.kind === 160 /* ComputedPropertyName */) {
checkComputedPropertyName(node.name);
}
var uninstantiatedType = checkFunctionExpressionOrObjectLiteralMethod(node, checkMode);
return instantiateTypeWithSingleGenericCallSignature(node, uninstantiatedType, checkMode);
}
function instantiateTypeWithSingleGenericCallSignature(node, type, checkMode) {
if (checkMode && checkMode & (2 /* Inferential */ | 8 /* SkipGenericFunctions */)) {
var callSignature = getSingleSignature(type, 0 /* Call */, /*allowMembers*/ true);
var constructSignature = getSingleSignature(type, 1 /* Construct */, /*allowMembers*/ true);
var signature = callSignature || constructSignature;
if (signature && signature.typeParameters) {
var contextualType = getApparentTypeOfContextualType(node, 2 /* NoConstraints */);
if (contextualType) {
var contextualSignature = getSingleSignature(getNonNullableType(contextualType), callSignature ? 0 /* Call */ : 1 /* Construct */, /*allowMembers*/ false);
if (contextualSignature && !contextualSignature.typeParameters) {
if (checkMode & 8 /* SkipGenericFunctions */) {
skippedGenericFunction(node, checkMode);
return anyFunctionType;
}
var context = getInferenceContext(node);
// We have an expression that is an argument of a generic function for which we are performing
// type argument inference. The expression is of a function type with a single generic call
// signature and a contextual function type with a single non-generic call signature. Now check
// if the outer function returns a function type with a single non-generic call signature and
// if some of the outer function type parameters have no inferences so far. If so, we can
// potentially add inferred type parameters to the outer function return type.
var returnType = context.signature && getReturnTypeOfSignature(context.signature);
var returnSignature = returnType && getSingleCallOrConstructSignature(returnType);
if (returnSignature && !returnSignature.typeParameters && !ts.every(context.inferences, hasInferenceCandidates)) {
// Instantiate the signature with its own type parameters as type arguments, possibly
// renaming the type parameters to ensure they have unique names.
var uniqueTypeParameters = getUniqueTypeParameters(context, signature.typeParameters);
var instantiatedSignature = getSignatureInstantiationWithoutFillingInTypeArguments(signature, uniqueTypeParameters);
// Infer from the parameters of the instantiated signature to the parameters of the
// contextual signature starting with an empty set of inference candidates.
var inferences_3 = ts.map(context.inferences, function (info) { return createInferenceInfo(info.typeParameter); });
applyToParameterTypes(instantiatedSignature, contextualSignature, function (source, target) {
inferTypes(inferences_3, source, target, /*priority*/ 0, /*contravariant*/ true);
});
if (ts.some(inferences_3, hasInferenceCandidates)) {
// We have inference candidates, indicating that one or more type parameters are referenced
// in the parameter types of the contextual signature. Now also infer from the return type.
applyToReturnTypes(instantiatedSignature, contextualSignature, function (source, target) {
inferTypes(inferences_3, source, target);
});
// If the type parameters for which we produced candidates do not have any inferences yet,
// we adopt the new inference candidates and add the type parameters of the expression type
// to the set of inferred type parameters for the outer function return type.
if (!hasOverlappingInferences(context.inferences, inferences_3)) {
mergeInferences(context.inferences, inferences_3);
context.inferredTypeParameters = ts.concatenate(context.inferredTypeParameters, uniqueTypeParameters);
return getOrCreateTypeFromSignature(instantiatedSignature);
}
}
}
return getOrCreateTypeFromSignature(instantiateSignatureInContextOf(signature, contextualSignature, context));
}
}
}
}
return type;
}
function skippedGenericFunction(node, checkMode) {
if (checkMode & 2 /* Inferential */) {
// We have skipped a generic function during inferential typing. Obtain the inference context and
// indicate this has occurred such that we know a second pass of inference is be needed.
var context = getInferenceContext(node);
context.flags |= 4 /* SkippedGenericFunction */;
}
}
function hasInferenceCandidates(info) {
return !!(info.candidates || info.contraCandidates);
}
function hasOverlappingInferences(a, b) {
for (var i = 0; i < a.length; i++) {
if (hasInferenceCandidates(a[i]) && hasInferenceCandidates(b[i])) {
return true;
}
}
return false;
}
function mergeInferences(target, source) {
for (var i = 0; i < target.length; i++) {
if (!hasInferenceCandidates(target[i]) && hasInferenceCandidates(source[i])) {
target[i] = source[i];
}
}
}
function getUniqueTypeParameters(context, typeParameters) {
var result = [];
var oldTypeParameters;
var newTypeParameters;
for (var _i = 0, typeParameters_2 = typeParameters; _i < typeParameters_2.length; _i++) {
var tp = typeParameters_2[_i];
var name = tp.symbol.escapedName;
if (hasTypeParameterByName(context.inferredTypeParameters, name) || hasTypeParameterByName(result, name)) {
var newName = getUniqueTypeParameterName(ts.concatenate(context.inferredTypeParameters, result), name);
var symbol = createSymbol(262144 /* TypeParameter */, newName);
var newTypeParameter = createTypeParameter(symbol);
newTypeParameter.target = tp;
oldTypeParameters = ts.append(oldTypeParameters, tp);
newTypeParameters = ts.append(newTypeParameters, newTypeParameter);
result.push(newTypeParameter);
}
else {
result.push(tp);
}
}
if (newTypeParameters) {
var mapper = createTypeMapper(oldTypeParameters, newTypeParameters);
for (var _a = 0, newTypeParameters_1 = newTypeParameters; _a < newTypeParameters_1.length; _a++) {
var tp = newTypeParameters_1[_a];
tp.mapper = mapper;
}
}
return result;
}
function hasTypeParameterByName(typeParameters, name) {
return ts.some(typeParameters, function (tp) { return tp.symbol.escapedName === name; });
}
function getUniqueTypeParameterName(typeParameters, baseName) {
var len = baseName.length;
while (len > 1 && baseName.charCodeAt(len - 1) >= 48 /* _0 */ && baseName.charCodeAt(len - 1) <= 57 /* _9 */)
len--;
var s = baseName.slice(0, len);
for (var index = 1; true; index++) {
var augmentedName = s + index;
if (!hasTypeParameterByName(typeParameters, augmentedName)) {
return augmentedName;
}
}
}
function getReturnTypeOfSingleNonGenericCallSignature(funcType) {
var signature = getSingleCallSignature(funcType);
if (signature && !signature.typeParameters) {
return getReturnTypeOfSignature(signature);
}
}
function getReturnTypeOfSingleNonGenericSignatureOfCallChain(expr) {
var funcType = checkExpression(expr.expression);
var nonOptionalType = getOptionalExpressionType(funcType, expr.expression);
var returnType = getReturnTypeOfSingleNonGenericCallSignature(funcType);
return returnType && propagateOptionalTypeMarker(returnType, expr, nonOptionalType !== funcType);
}
/**
* Returns the type of an expression. Unlike checkExpression, this function is simply concerned
* with computing the type and may not fully check all contained sub-expressions for errors.
*/
function getTypeOfExpression(node) {
// Don't bother caching types that require no flow analysis and are quick to compute.
var quickType = getQuickTypeOfExpression(node);
if (quickType) {
return quickType;
}
// If a type has been cached for the node, return it.
if (node.flags & 67108864 /* TypeCached */ && flowTypeCache) {
var cachedType = flowTypeCache[getNodeId(node)];
if (cachedType) {
return cachedType;
}
}
var startInvocationCount = flowInvocationCount;
var type = checkExpression(node);
// If control flow analysis was required to determine the type, it is worth caching.
if (flowInvocationCount !== startInvocationCount) {
var cache = flowTypeCache || (flowTypeCache = []);
cache[getNodeId(node)] = type;
ts.setNodeFlags(node, node.flags | 67108864 /* TypeCached */);
}
return type;
}
function getQuickTypeOfExpression(node) {
var expr = ts.skipParentheses(node);
// Optimize for the common case of a call to a function with a single non-generic call
// signature where we can just fetch the return type without checking the arguments.
if (ts.isCallExpression(expr) && expr.expression.kind !== 106 /* SuperKeyword */ && !ts.isRequireCall(expr, /*checkArgumentIsStringLiteralLike*/ true) && !isSymbolOrSymbolForCall(expr)) {
var type = ts.isCallChain(expr) ? getReturnTypeOfSingleNonGenericSignatureOfCallChain(expr) :
getReturnTypeOfSingleNonGenericCallSignature(checkNonNullExpression(expr.expression));
if (type) {
return type;
}
}
else if (ts.isAssertionExpression(expr) && !ts.isConstTypeReference(expr.type)) {
return getTypeFromTypeNode(expr.type);
}
else if (node.kind === 8 /* NumericLiteral */ || node.kind === 10 /* StringLiteral */ ||
node.kind === 110 /* TrueKeyword */ || node.kind === 95 /* FalseKeyword */) {
return checkExpression(node);
}
return undefined;
}
/**
* Returns the type of an expression. Unlike checkExpression, this function is simply concerned
* with computing the type and may not fully check all contained sub-expressions for errors.
* It is intended for uses where you know there is no contextual type,
* and requesting the contextual type might cause a circularity or other bad behaviour.
* It sets the contextual type of the node to any before calling getTypeOfExpression.
*/
function getContextFreeTypeOfExpression(node) {
var links = getNodeLinks(node);
if (links.contextFreeType) {
return links.contextFreeType;
}
var saveContextualType = node.contextualType;
node.contextualType = anyType;
try {
var type = links.contextFreeType = checkExpression(node, 4 /* SkipContextSensitive */);
return type;
}
finally {
// In the event our operation is canceled or some other exception occurs, reset the contextual type
// so that we do not accidentally hold onto an instance of the checker, as a Type created in the services layer
// may hold onto the checker that created it.
node.contextualType = saveContextualType;
}
}
function checkExpression(node, checkMode, forceTuple) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("check" /* Check */, "checkExpression", { kind: node.kind, pos: node.pos, end: node.end });
var saveCurrentNode = currentNode;
currentNode = node;
instantiationCount = 0;
var uninstantiatedType = checkExpressionWorker(node, checkMode, forceTuple);
var type = instantiateTypeWithSingleGenericCallSignature(node, uninstantiatedType, checkMode);
if (isConstEnumObjectType(type)) {
checkConstEnumAccess(node, type);
}
currentNode = saveCurrentNode;
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
return type;
}
function checkConstEnumAccess(node, type) {
// enum object type for const enums are only permitted in:
// - 'left' in property access
// - 'object' in indexed access
// - target in rhs of import statement
var ok = (node.parent.kind === 204 /* PropertyAccessExpression */ && node.parent.expression === node) ||
(node.parent.kind === 205 /* ElementAccessExpression */ && node.parent.expression === node) ||
((node.kind === 79 /* Identifier */ || node.kind === 159 /* QualifiedName */) && isInRightSideOfImportOrExportAssignment(node) ||
(node.parent.kind === 179 /* TypeQuery */ && node.parent.exprName === node)) ||
(node.parent.kind === 273 /* ExportSpecifier */); // We allow reexporting const enums
if (!ok) {
error(node, ts.Diagnostics.const_enums_can_only_be_used_in_property_or_index_access_expressions_or_the_right_hand_side_of_an_import_declaration_or_export_assignment_or_type_query);
}
if (compilerOptions.isolatedModules) {
ts.Debug.assert(!!(type.symbol.flags & 128 /* ConstEnum */));
var constEnumDeclaration = type.symbol.valueDeclaration;
if (constEnumDeclaration.flags & 8388608 /* Ambient */) {
error(node, ts.Diagnostics.Cannot_access_ambient_const_enums_when_the_isolatedModules_flag_is_provided);
}
}
}
function checkParenthesizedExpression(node, checkMode) {
var tag = ts.isInJSFile(node) ? ts.getJSDocTypeTag(node) : undefined;
if (tag) {
return checkAssertionWorker(tag.typeExpression.type, tag.typeExpression.type, node.expression, checkMode);
}
return checkExpression(node.expression, checkMode);
}
function checkExpressionWorker(node, checkMode, forceTuple) {
var kind = node.kind;
if (cancellationToken) {
// Only bother checking on a few construct kinds. We don't want to be excessively
// hitting the cancellation token on every node we check.
switch (kind) {
case 224 /* ClassExpression */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
cancellationToken.throwIfCancellationRequested();
}
}
switch (kind) {
case 79 /* Identifier */:
return checkIdentifier(node, checkMode);
case 108 /* ThisKeyword */:
return checkThisExpression(node);
case 106 /* SuperKeyword */:
return checkSuperExpression(node);
case 104 /* NullKeyword */:
return nullWideningType;
case 14 /* NoSubstitutionTemplateLiteral */:
case 10 /* StringLiteral */:
return getFreshTypeOfLiteralType(getStringLiteralType(node.text));
case 8 /* NumericLiteral */:
checkGrammarNumericLiteral(node);
return getFreshTypeOfLiteralType(getNumberLiteralType(+node.text));
case 9 /* BigIntLiteral */:
checkGrammarBigIntLiteral(node);
return getFreshTypeOfLiteralType(getBigIntLiteralType({
negative: false,
base10Value: ts.parsePseudoBigInt(node.text)
}));
case 110 /* TrueKeyword */:
return trueType;
case 95 /* FalseKeyword */:
return falseType;
case 221 /* TemplateExpression */:
return checkTemplateExpression(node);
case 13 /* RegularExpressionLiteral */:
return globalRegExpType;
case 202 /* ArrayLiteralExpression */:
return checkArrayLiteral(node, checkMode, forceTuple);
case 203 /* ObjectLiteralExpression */:
return checkObjectLiteral(node, checkMode);
case 204 /* PropertyAccessExpression */:
return checkPropertyAccessExpression(node, checkMode);
case 159 /* QualifiedName */:
return checkQualifiedName(node, checkMode);
case 205 /* ElementAccessExpression */:
return checkIndexedAccess(node, checkMode);
case 206 /* CallExpression */:
if (node.expression.kind === 100 /* ImportKeyword */) {
return checkImportCallExpression(node);
}
// falls through
case 207 /* NewExpression */:
return checkCallExpression(node, checkMode);
case 208 /* TaggedTemplateExpression */:
return checkTaggedTemplateExpression(node);
case 210 /* ParenthesizedExpression */:
return checkParenthesizedExpression(node, checkMode);
case 224 /* ClassExpression */:
return checkClassExpression(node);
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
return checkFunctionExpressionOrObjectLiteralMethod(node, checkMode);
case 214 /* TypeOfExpression */:
return checkTypeOfExpression(node);
case 209 /* TypeAssertionExpression */:
case 227 /* AsExpression */:
return checkAssertion(node);
case 228 /* NonNullExpression */:
return checkNonNullAssertion(node);
case 229 /* MetaProperty */:
return checkMetaProperty(node);
case 213 /* DeleteExpression */:
return checkDeleteExpression(node);
case 215 /* VoidExpression */:
return checkVoidExpression(node);
case 216 /* AwaitExpression */:
return checkAwaitExpression(node);
case 217 /* PrefixUnaryExpression */:
return checkPrefixUnaryExpression(node);
case 218 /* PostfixUnaryExpression */:
return checkPostfixUnaryExpression(node);
case 219 /* BinaryExpression */:
return checkBinaryExpression(node, checkMode);
case 220 /* ConditionalExpression */:
return checkConditionalExpression(node, checkMode);
case 223 /* SpreadElement */:
return checkSpreadExpression(node, checkMode);
case 225 /* OmittedExpression */:
return undefinedWideningType;
case 222 /* YieldExpression */:
return checkYieldExpression(node);
case 230 /* SyntheticExpression */:
return checkSyntheticExpression(node);
case 286 /* JsxExpression */:
return checkJsxExpression(node, checkMode);
case 276 /* JsxElement */:
return checkJsxElement(node, checkMode);
case 277 /* JsxSelfClosingElement */:
return checkJsxSelfClosingElement(node, checkMode);
case 280 /* JsxFragment */:
return checkJsxFragment(node);
case 284 /* JsxAttributes */:
return checkJsxAttributes(node, checkMode);
case 278 /* JsxOpeningElement */:
ts.Debug.fail("Shouldn't ever directly check a JsxOpeningElement");
}
return errorType;
}
// DECLARATION AND STATEMENT TYPE CHECKING
function checkTypeParameter(node) {
// Grammar Checking
if (node.expression) {
grammarErrorOnFirstToken(node.expression, ts.Diagnostics.Type_expected);
}
checkSourceElement(node.constraint);
checkSourceElement(node.default);
var typeParameter = getDeclaredTypeOfTypeParameter(getSymbolOfNode(node));
// Resolve base constraint to reveal circularity errors
getBaseConstraintOfType(typeParameter);
if (!hasNonCircularTypeParameterDefault(typeParameter)) {
error(node.default, ts.Diagnostics.Type_parameter_0_has_a_circular_default, typeToString(typeParameter));
}
var constraintType = getConstraintOfTypeParameter(typeParameter);
var defaultType = getDefaultFromTypeParameter(typeParameter);
if (constraintType && defaultType) {
checkTypeAssignableTo(defaultType, getTypeWithThisArgument(instantiateType(constraintType, makeUnaryTypeMapper(typeParameter, defaultType)), defaultType), node.default, ts.Diagnostics.Type_0_does_not_satisfy_the_constraint_1);
}
if (produceDiagnostics) {
checkTypeNameIsReserved(node.name, ts.Diagnostics.Type_parameter_name_cannot_be_0);
}
}
function checkParameter(node) {
// Grammar checking
// It is a SyntaxError if the Identifier "eval" or the Identifier "arguments" occurs as the
// Identifier in a PropertySetParameterList of a PropertyAssignment that is contained in strict code
// or if its FunctionBody is strict code(11.1.5).
checkGrammarDecoratorsAndModifiers(node);
checkVariableLikeDeclaration(node);
var func = ts.getContainingFunction(node);
if (ts.hasSyntacticModifier(node, 16476 /* ParameterPropertyModifier */)) {
if (!(func.kind === 169 /* Constructor */ && ts.nodeIsPresent(func.body))) {
error(node, ts.Diagnostics.A_parameter_property_is_only_allowed_in_a_constructor_implementation);
}
if (func.kind === 169 /* Constructor */ && ts.isIdentifier(node.name) && node.name.escapedText === "constructor") {
error(node.name, ts.Diagnostics.constructor_cannot_be_used_as_a_parameter_property_name);
}
}
if (node.questionToken && ts.isBindingPattern(node.name) && func.body) {
error(node, ts.Diagnostics.A_binding_pattern_parameter_cannot_be_optional_in_an_implementation_signature);
}
if (node.name && ts.isIdentifier(node.name) && (node.name.escapedText === "this" || node.name.escapedText === "new")) {
if (func.parameters.indexOf(node) !== 0) {
error(node, ts.Diagnostics.A_0_parameter_must_be_the_first_parameter, node.name.escapedText);
}
if (func.kind === 169 /* Constructor */ || func.kind === 173 /* ConstructSignature */ || func.kind === 178 /* ConstructorType */) {
error(node, ts.Diagnostics.A_constructor_cannot_have_a_this_parameter);
}
if (func.kind === 212 /* ArrowFunction */) {
error(node, ts.Diagnostics.An_arrow_function_cannot_have_a_this_parameter);
}
if (func.kind === 170 /* GetAccessor */ || func.kind === 171 /* SetAccessor */) {
error(node, ts.Diagnostics.get_and_set_accessors_cannot_declare_this_parameters);
}
}
// Only check rest parameter type if it's not a binding pattern. Since binding patterns are
// not allowed in a rest parameter, we already have an error from checkGrammarParameterList.
if (node.dotDotDotToken && !ts.isBindingPattern(node.name) && !isTypeAssignableTo(getReducedType(getTypeOfSymbol(node.symbol)), anyReadonlyArrayType)) {
error(node, ts.Diagnostics.A_rest_parameter_must_be_of_an_array_type);
}
}
function checkTypePredicate(node) {
var parent = getTypePredicateParent(node);
if (!parent) {
// The parent must not be valid.
error(node, ts.Diagnostics.A_type_predicate_is_only_allowed_in_return_type_position_for_functions_and_methods);
return;
}
var signature = getSignatureFromDeclaration(parent);
var typePredicate = getTypePredicateOfSignature(signature);
if (!typePredicate) {
return;
}
checkSourceElement(node.type);
var parameterName = node.parameterName;
if (typePredicate.kind === 0 /* This */ || typePredicate.kind === 2 /* AssertsThis */) {
getTypeFromThisTypeNode(parameterName);
}
else {
if (typePredicate.parameterIndex >= 0) {
if (signatureHasRestParameter(signature) && typePredicate.parameterIndex === signature.parameters.length - 1) {
error(parameterName, ts.Diagnostics.A_type_predicate_cannot_reference_a_rest_parameter);
}
else {
if (typePredicate.type) {
var leadingError = function () { return ts.chainDiagnosticMessages(/*details*/ undefined, ts.Diagnostics.A_type_predicate_s_type_must_be_assignable_to_its_parameter_s_type); };
checkTypeAssignableTo(typePredicate.type, getTypeOfSymbol(signature.parameters[typePredicate.parameterIndex]), node.type,
/*headMessage*/ undefined, leadingError);
}
}
}
else if (parameterName) {
var hasReportedError = false;
for (var _i = 0, _a = parent.parameters; _i < _a.length; _i++) {
var name = _a[_i].name;
if (ts.isBindingPattern(name) &&
checkIfTypePredicateVariableIsDeclaredInBindingPattern(name, parameterName, typePredicate.parameterName)) {
hasReportedError = true;
break;
}
}
if (!hasReportedError) {
error(node.parameterName, ts.Diagnostics.Cannot_find_parameter_0, typePredicate.parameterName);
}
}
}
}
function getTypePredicateParent(node) {
switch (node.parent.kind) {
case 212 /* ArrowFunction */:
case 172 /* CallSignature */:
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
case 177 /* FunctionType */:
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
var parent = node.parent;
if (node === parent.type) {
return parent;
}
}
}
function checkIfTypePredicateVariableIsDeclaredInBindingPattern(pattern, predicateVariableNode, predicateVariableName) {
for (var _i = 0, _a = pattern.elements; _i < _a.length; _i++) {
var element = _a[_i];
if (ts.isOmittedExpression(element)) {
continue;
}
var name = element.name;
if (name.kind === 79 /* Identifier */ && name.escapedText === predicateVariableName) {
error(predicateVariableNode, ts.Diagnostics.A_type_predicate_cannot_reference_element_0_in_a_binding_pattern, predicateVariableName);
return true;
}
else if (name.kind === 200 /* ArrayBindingPattern */ || name.kind === 199 /* ObjectBindingPattern */) {
if (checkIfTypePredicateVariableIsDeclaredInBindingPattern(name, predicateVariableNode, predicateVariableName)) {
return true;
}
}
}
}
function checkSignatureDeclaration(node) {
// Grammar checking
if (node.kind === 174 /* IndexSignature */) {
checkGrammarIndexSignature(node);
}
// TODO (yuisu): Remove this check in else-if when SyntaxKind.Construct is moved and ambient context is handled
else if (node.kind === 177 /* FunctionType */ || node.kind === 254 /* FunctionDeclaration */ || node.kind === 178 /* ConstructorType */ ||
node.kind === 172 /* CallSignature */ || node.kind === 169 /* Constructor */ ||
node.kind === 173 /* ConstructSignature */) {
checkGrammarFunctionLikeDeclaration(node);
}
var functionFlags = ts.getFunctionFlags(node);
if (!(functionFlags & 4 /* Invalid */)) {
// Async generators prior to ESNext require the __await and __asyncGenerator helpers
if ((functionFlags & 3 /* AsyncGenerator */) === 3 /* AsyncGenerator */ && languageVersion < 99 /* ESNext */) {
checkExternalEmitHelpers(node, 6144 /* AsyncGeneratorIncludes */);
}
// Async functions prior to ES2017 require the __awaiter helper
if ((functionFlags & 3 /* AsyncGenerator */) === 2 /* Async */ && languageVersion < 4 /* ES2017 */) {
checkExternalEmitHelpers(node, 64 /* Awaiter */);
}
// Generator functions, Async functions, and Async Generator functions prior to
// ES2015 require the __generator helper
if ((functionFlags & 3 /* AsyncGenerator */) !== 0 /* Normal */ && languageVersion < 2 /* ES2015 */) {
checkExternalEmitHelpers(node, 128 /* Generator */);
}
}
checkTypeParameters(node.typeParameters);
ts.forEach(node.parameters, checkParameter);
// TODO(rbuckton): Should we start checking JSDoc types?
if (node.type) {
checkSourceElement(node.type);
}
if (produceDiagnostics) {
checkCollisionWithArgumentsInGeneratedCode(node);
var returnTypeNode = ts.getEffectiveReturnTypeNode(node);
if (noImplicitAny && !returnTypeNode) {
switch (node.kind) {
case 173 /* ConstructSignature */:
error(node, ts.Diagnostics.Construct_signature_which_lacks_return_type_annotation_implicitly_has_an_any_return_type);
break;
case 172 /* CallSignature */:
error(node, ts.Diagnostics.Call_signature_which_lacks_return_type_annotation_implicitly_has_an_any_return_type);
break;
}
}
if (returnTypeNode) {
var functionFlags_1 = ts.getFunctionFlags(node);
if ((functionFlags_1 & (4 /* Invalid */ | 1 /* Generator */)) === 1 /* Generator */) {
var returnType = getTypeFromTypeNode(returnTypeNode);
if (returnType === voidType) {
error(returnTypeNode, ts.Diagnostics.A_generator_cannot_have_a_void_type_annotation);
}
else {
// Naively, one could check that Generator<any, any, any> is assignable to the return type annotation.
// However, that would not catch the error in the following case.
//
// interface BadGenerator extends Iterable<number>, Iterator<string> { }
// function* g(): BadGenerator { } // Iterable and Iterator have different types!
//
var generatorYieldType = getIterationTypeOfGeneratorFunctionReturnType(0 /* Yield */, returnType, (functionFlags_1 & 2 /* Async */) !== 0) || anyType;
var generatorReturnType = getIterationTypeOfGeneratorFunctionReturnType(1 /* Return */, returnType, (functionFlags_1 & 2 /* Async */) !== 0) || generatorYieldType;
var generatorNextType = getIterationTypeOfGeneratorFunctionReturnType(2 /* Next */, returnType, (functionFlags_1 & 2 /* Async */) !== 0) || unknownType;
var generatorInstantiation = createGeneratorReturnType(generatorYieldType, generatorReturnType, generatorNextType, !!(functionFlags_1 & 2 /* Async */));
checkTypeAssignableTo(generatorInstantiation, returnType, returnTypeNode);
}
}
else if ((functionFlags_1 & 3 /* AsyncGenerator */) === 2 /* Async */) {
checkAsyncFunctionReturnType(node, returnTypeNode);
}
}
if (node.kind !== 174 /* IndexSignature */ && node.kind !== 312 /* JSDocFunctionType */) {
registerForUnusedIdentifiersCheck(node);
}
}
}
function checkClassForDuplicateDeclarations(node) {
var instanceNames = new ts.Map();
var staticNames = new ts.Map();
// instance and static private identifiers share the same scope
var privateIdentifiers = new ts.Map();
for (var _i = 0, _a = node.members; _i < _a.length; _i++) {
var member = _a[_i];
if (member.kind === 169 /* Constructor */) {
for (var _b = 0, _c = member.parameters; _b < _c.length; _b++) {
var param = _c[_b];
if (ts.isParameterPropertyDeclaration(param, member) && !ts.isBindingPattern(param.name)) {
addName(instanceNames, param.name, param.name.escapedText, 3 /* GetOrSetAccessor */);
}
}
}
else {
var isStaticMember = ts.isStatic(member);
var name = member.name;
if (!name) {
continue;
}
var isPrivate = ts.isPrivateIdentifier(name);
var privateStaticFlags = isPrivate && isStaticMember ? 16 /* PrivateStatic */ : 0;
var names = isPrivate ? privateIdentifiers :
isStaticMember ? staticNames :
instanceNames;
var memberName = name && ts.getPropertyNameForPropertyNameNode(name);
if (memberName) {
switch (member.kind) {
case 170 /* GetAccessor */:
addName(names, name, memberName, 1 /* GetAccessor */ | privateStaticFlags);
break;
case 171 /* SetAccessor */:
addName(names, name, memberName, 2 /* SetAccessor */ | privateStaticFlags);
break;
case 165 /* PropertyDeclaration */:
addName(names, name, memberName, 3 /* GetOrSetAccessor */ | privateStaticFlags);
break;
case 167 /* MethodDeclaration */:
addName(names, name, memberName, 8 /* Method */ | privateStaticFlags);
break;
}
}
}
}
function addName(names, location, name, meaning) {
var prev = names.get(name);
if (prev) {
// For private identifiers, do not allow mixing of static and instance members with the same name
if ((prev & 16 /* PrivateStatic */) !== (meaning & 16 /* PrivateStatic */)) {
error(location, ts.Diagnostics.Duplicate_identifier_0_Static_and_instance_elements_cannot_share_the_same_private_name, ts.getTextOfNode(location));
}
else {
var prevIsMethod = !!(prev & 8 /* Method */);
var isMethod = !!(meaning & 8 /* Method */);
if (prevIsMethod || isMethod) {
if (prevIsMethod !== isMethod) {
error(location, ts.Diagnostics.Duplicate_identifier_0, ts.getTextOfNode(location));
}
// If this is a method/method duplication is might be an overload, so this will be handled when overloads are considered
}
else if (prev & meaning & ~16 /* PrivateStatic */) {
error(location, ts.Diagnostics.Duplicate_identifier_0, ts.getTextOfNode(location));
}
else {
names.set(name, prev | meaning);
}
}
}
else {
names.set(name, meaning);
}
}
}
/**
* Static members being set on a constructor function may conflict with built-in properties
* of Function. Esp. in ECMAScript 5 there are non-configurable and non-writable
* built-in properties. This check issues a transpile error when a class has a static
* member with the same name as a non-writable built-in property.
*
* @see http://www.ecma-international.org/ecma-262/5.1/#sec-15.3.3
* @see http://www.ecma-international.org/ecma-262/5.1/#sec-15.3.5
* @see http://www.ecma-international.org/ecma-262/6.0/#sec-properties-of-the-function-constructor
* @see http://www.ecma-international.org/ecma-262/6.0/#sec-function-instances
*/
function checkClassForStaticPropertyNameConflicts(node) {
for (var _i = 0, _a = node.members; _i < _a.length; _i++) {
var member = _a[_i];
var memberNameNode = member.name;
var isStaticMember = ts.isStatic(member);
if (isStaticMember && memberNameNode) {
var memberName = ts.getPropertyNameForPropertyNameNode(memberNameNode);
switch (memberName) {
case "name":
case "length":
case "caller":
case "arguments":
case "prototype":
var message = ts.Diagnostics.Static_property_0_conflicts_with_built_in_property_Function_0_of_constructor_function_1;
var className = getNameOfSymbolAsWritten(getSymbolOfNode(node));
error(memberNameNode, message, memberName, className);
break;
}
}
}
}
function checkObjectTypeForDuplicateDeclarations(node) {
var names = new ts.Map();
for (var _i = 0, _a = node.members; _i < _a.length; _i++) {
var member = _a[_i];
if (member.kind === 164 /* PropertySignature */) {
var memberName = void 0;
var name = member.name;
switch (name.kind) {
case 10 /* StringLiteral */:
case 8 /* NumericLiteral */:
memberName = name.text;
break;
case 79 /* Identifier */:
memberName = ts.idText(name);
break;
default:
continue;
}
if (names.get(memberName)) {
error(ts.getNameOfDeclaration(member.symbol.valueDeclaration), ts.Diagnostics.Duplicate_identifier_0, memberName);
error(member.name, ts.Diagnostics.Duplicate_identifier_0, memberName);
}
else {
names.set(memberName, true);
}
}
}
}
function checkTypeForDuplicateIndexSignatures(node) {
if (node.kind === 256 /* InterfaceDeclaration */) {
var nodeSymbol = getSymbolOfNode(node);
// in case of merging interface declaration it is possible that we'll enter this check procedure several times for every declaration
// to prevent this run check only for the first declaration of a given kind
if (nodeSymbol.declarations && nodeSymbol.declarations.length > 0 && nodeSymbol.declarations[0] !== node) {
return;
}
}
// TypeScript 1.0 spec (April 2014)
// 3.7.4: An object type can contain at most one string index signature and one numeric index signature.
// 8.5: A class declaration can have at most one string index member declaration and one numeric index member declaration
var indexSymbol = getIndexSymbol(getSymbolOfNode(node));
if (indexSymbol === null || indexSymbol === void 0 ? void 0 : indexSymbol.declarations) {
var indexSignatureMap_1 = new ts.Map();
var _loop_26 = function (declaration) {
if (declaration.parameters.length === 1 && declaration.parameters[0].type) {
forEachType(getTypeFromTypeNode(declaration.parameters[0].type), function (type) {
var entry = indexSignatureMap_1.get(getTypeId(type));
if (entry) {
entry.declarations.push(declaration);
}
else {
indexSignatureMap_1.set(getTypeId(type), { type: type, declarations: [declaration] });
}
});
}
};
for (var _i = 0, _a = indexSymbol.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
_loop_26(declaration);
}
indexSignatureMap_1.forEach(function (entry) {
if (entry.declarations.length > 1) {
for (var _i = 0, _a = entry.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
error(declaration, ts.Diagnostics.Duplicate_index_signature_for_type_0, typeToString(entry.type));
}
}
});
}
}
function checkPropertyDeclaration(node) {
// Grammar checking
if (!checkGrammarDecoratorsAndModifiers(node) && !checkGrammarProperty(node))
checkGrammarComputedPropertyName(node.name);
checkVariableLikeDeclaration(node);
setNodeLinksForPrivateIdentifierScope(node);
if (ts.isPrivateIdentifier(node.name) && ts.hasStaticModifier(node) && node.initializer && languageVersion === 99 /* ESNext */ && !compilerOptions.useDefineForClassFields) {
error(node.initializer, ts.Diagnostics.Static_fields_with_private_names_can_t_have_initializers_when_the_useDefineForClassFields_flag_is_not_specified_with_a_target_of_esnext_Consider_adding_the_useDefineForClassFields_flag);
}
// property signatures already report "initializer not allowed in ambient context" elsewhere
if (ts.hasSyntacticModifier(node, 128 /* Abstract */) && node.kind === 165 /* PropertyDeclaration */ && node.initializer) {
error(node, ts.Diagnostics.Property_0_cannot_have_an_initializer_because_it_is_marked_abstract, ts.declarationNameToString(node.name));
}
}
function checkPropertySignature(node) {
if (ts.isPrivateIdentifier(node.name)) {
error(node, ts.Diagnostics.Private_identifiers_are_not_allowed_outside_class_bodies);
}
return checkPropertyDeclaration(node);
}
function checkMethodDeclaration(node) {
// Grammar checking
if (!checkGrammarMethod(node))
checkGrammarComputedPropertyName(node.name);
// Grammar checking for modifiers is done inside the function checkGrammarFunctionLikeDeclaration
checkFunctionOrMethodDeclaration(node);
// method signatures already report "implementation not allowed in ambient context" elsewhere
if (ts.hasSyntacticModifier(node, 128 /* Abstract */) && node.kind === 167 /* MethodDeclaration */ && node.body) {
error(node, ts.Diagnostics.Method_0_cannot_have_an_implementation_because_it_is_marked_abstract, ts.declarationNameToString(node.name));
}
// Private named methods are only allowed in class declarations
if (ts.isPrivateIdentifier(node.name) && !ts.getContainingClass(node)) {
error(node, ts.Diagnostics.Private_identifiers_are_not_allowed_outside_class_bodies);
}
setNodeLinksForPrivateIdentifierScope(node);
}
function setNodeLinksForPrivateIdentifierScope(node) {
if (ts.isPrivateIdentifier(node.name) && languageVersion < 99 /* ESNext */) {
for (var lexicalScope = ts.getEnclosingBlockScopeContainer(node); !!lexicalScope; lexicalScope = ts.getEnclosingBlockScopeContainer(lexicalScope)) {
getNodeLinks(lexicalScope).flags |= 67108864 /* ContainsClassWithPrivateIdentifiers */;
}
// If this is a private element in a class expression inside the body of a loop,
// then we must use a block-scoped binding to store the additional variables required
// to transform private elements.
if (ts.isClassExpression(node.parent)) {
var enclosingIterationStatement = getEnclosingIterationStatement(node.parent);
if (enclosingIterationStatement) {
getNodeLinks(node.name).flags |= 524288 /* BlockScopedBindingInLoop */;
getNodeLinks(enclosingIterationStatement).flags |= 65536 /* LoopWithCapturedBlockScopedBinding */;
}
}
}
}
function checkClassStaticBlockDeclaration(node) {
checkGrammarDecoratorsAndModifiers(node);
ts.forEachChild(node, checkSourceElement);
}
function checkConstructorDeclaration(node) {
// Grammar check on signature of constructor and modifier of the constructor is done in checkSignatureDeclaration function.
checkSignatureDeclaration(node);
// Grammar check for checking only related to constructorDeclaration
if (!checkGrammarConstructorTypeParameters(node))
checkGrammarConstructorTypeAnnotation(node);
checkSourceElement(node.body);
var symbol = getSymbolOfNode(node);
var firstDeclaration = ts.getDeclarationOfKind(symbol, node.kind);
// Only type check the symbol once
if (node === firstDeclaration) {
checkFunctionOrConstructorSymbol(symbol);
}
// exit early in the case of signature - super checks are not relevant to them
if (ts.nodeIsMissing(node.body)) {
return;
}
if (!produceDiagnostics) {
return;
}
function isInstancePropertyWithInitializerOrPrivateIdentifierProperty(n) {
if (ts.isPrivateIdentifierClassElementDeclaration(n)) {
return true;
}
return n.kind === 165 /* PropertyDeclaration */ &&
!ts.isStatic(n) &&
!!n.initializer;
}
// TS 1.0 spec (April 2014): 8.3.2
// Constructors of classes with no extends clause may not contain super calls, whereas
// constructors of derived classes must contain at least one super call somewhere in their function body.
var containingClassDecl = node.parent;
if (ts.getClassExtendsHeritageElement(containingClassDecl)) {
captureLexicalThis(node.parent, containingClassDecl);
var classExtendsNull = classDeclarationExtendsNull(containingClassDecl);
var superCall = findFirstSuperCall(node.body);
if (superCall) {
if (classExtendsNull) {
error(superCall, ts.Diagnostics.A_constructor_cannot_contain_a_super_call_when_its_class_extends_null);
}
// The first statement in the body of a constructor (excluding prologue directives) must be a super call
// if both of the following are true:
// - The containing class is a derived class.
// - The constructor declares parameter properties
// or the containing class declares instance member variables with initializers.
var superCallShouldBeFirst = (compilerOptions.target !== 99 /* ESNext */ || !useDefineForClassFields) &&
(ts.some(node.parent.members, isInstancePropertyWithInitializerOrPrivateIdentifierProperty) ||
ts.some(node.parameters, function (p) { return ts.hasSyntacticModifier(p, 16476 /* ParameterPropertyModifier */); }));
// Skip past any prologue directives to find the first statement
// to ensure that it was a super call.
if (superCallShouldBeFirst) {
var statements = node.body.statements;
var superCallStatement = void 0;
for (var _i = 0, statements_4 = statements; _i < statements_4.length; _i++) {
var statement = statements_4[_i];
if (statement.kind === 236 /* ExpressionStatement */ && ts.isSuperCall(statement.expression)) {
superCallStatement = statement;
break;
}
if (!ts.isPrologueDirective(statement)) {
break;
}
}
if (!superCallStatement) {
error(node, ts.Diagnostics.A_super_call_must_be_the_first_statement_in_the_constructor_when_a_class_contains_initialized_properties_parameter_properties_or_private_identifiers);
}
}
}
else if (!classExtendsNull) {
error(node, ts.Diagnostics.Constructors_for_derived_classes_must_contain_a_super_call);
}
}
}
function checkAccessorDeclaration(node) {
if (produceDiagnostics) {
// Grammar checking accessors
if (!checkGrammarFunctionLikeDeclaration(node) && !checkGrammarAccessor(node))
checkGrammarComputedPropertyName(node.name);
checkDecorators(node);
checkSignatureDeclaration(node);
if (node.kind === 170 /* GetAccessor */) {
if (!(node.flags & 8388608 /* Ambient */) && ts.nodeIsPresent(node.body) && (node.flags & 256 /* HasImplicitReturn */)) {
if (!(node.flags & 512 /* HasExplicitReturn */)) {
error(node.name, ts.Diagnostics.A_get_accessor_must_return_a_value);
}
}
}
// Do not use hasDynamicName here, because that returns false for well known symbols.
// We want to perform checkComputedPropertyName for all computed properties, including
// well known symbols.
if (node.name.kind === 160 /* ComputedPropertyName */) {
checkComputedPropertyName(node.name);
}
if (hasBindableName(node)) {
// TypeScript 1.0 spec (April 2014): 8.4.3
// Accessors for the same member name must specify the same accessibility.
var symbol = getSymbolOfNode(node);
var getter = ts.getDeclarationOfKind(symbol, 170 /* GetAccessor */);
var setter = ts.getDeclarationOfKind(symbol, 171 /* SetAccessor */);
if (getter && setter && !(getNodeCheckFlags(getter) & 1 /* TypeChecked */)) {
getNodeLinks(getter).flags |= 1 /* TypeChecked */;
var getterFlags = ts.getEffectiveModifierFlags(getter);
var setterFlags = ts.getEffectiveModifierFlags(setter);
if ((getterFlags & 128 /* Abstract */) !== (setterFlags & 128 /* Abstract */)) {
error(getter.name, ts.Diagnostics.Accessors_must_both_be_abstract_or_non_abstract);
error(setter.name, ts.Diagnostics.Accessors_must_both_be_abstract_or_non_abstract);
}
if (((getterFlags & 16 /* Protected */) && !(setterFlags & (16 /* Protected */ | 8 /* Private */))) ||
((getterFlags & 8 /* Private */) && !(setterFlags & 8 /* Private */))) {
error(getter.name, ts.Diagnostics.A_get_accessor_must_be_at_least_as_accessible_as_the_setter);
error(setter.name, ts.Diagnostics.A_get_accessor_must_be_at_least_as_accessible_as_the_setter);
}
var getterType = getAnnotatedAccessorType(getter);
var setterType = getAnnotatedAccessorType(setter);
if (getterType && setterType) {
checkTypeAssignableTo(getterType, setterType, getter, ts.Diagnostics.The_return_type_of_a_get_accessor_must_be_assignable_to_its_set_accessor_type);
}
}
}
var returnType = getTypeOfAccessors(getSymbolOfNode(node));
if (node.kind === 170 /* GetAccessor */) {
checkAllCodePathsInNonVoidFunctionReturnOrThrow(node, returnType);
}
}
checkSourceElement(node.body);
setNodeLinksForPrivateIdentifierScope(node);
}
function checkMissingDeclaration(node) {
checkDecorators(node);
}
function getEffectiveTypeArguments(node, typeParameters) {
return fillMissingTypeArguments(ts.map(node.typeArguments, getTypeFromTypeNode), typeParameters, getMinTypeArgumentCount(typeParameters), ts.isInJSFile(node));
}
function checkTypeArgumentConstraints(node, typeParameters) {
var typeArguments;
var mapper;
var result = true;
for (var i = 0; i < typeParameters.length; i++) {
var constraint = getConstraintOfTypeParameter(typeParameters[i]);
if (constraint) {
if (!typeArguments) {
typeArguments = getEffectiveTypeArguments(node, typeParameters);
mapper = createTypeMapper(typeParameters, typeArguments);
}
result = result && checkTypeAssignableTo(typeArguments[i], instantiateType(constraint, mapper), node.typeArguments[i], ts.Diagnostics.Type_0_does_not_satisfy_the_constraint_1);
}
}
return result;
}
function getTypeParametersForTypeReference(node) {
var type = getTypeFromTypeReference(node);
if (type !== errorType) {
var symbol = getNodeLinks(node).resolvedSymbol;
if (symbol) {
return symbol.flags & 524288 /* TypeAlias */ && getSymbolLinks(symbol).typeParameters ||
(ts.getObjectFlags(type) & 4 /* Reference */ ? type.target.localTypeParameters : undefined);
}
}
return undefined;
}
function checkTypeReferenceNode(node) {
checkGrammarTypeArguments(node, node.typeArguments);
if (node.kind === 176 /* TypeReference */ && node.typeName.jsdocDotPos !== undefined && !ts.isInJSFile(node) && !ts.isInJSDoc(node)) {
grammarErrorAtPos(node, node.typeName.jsdocDotPos, 1, ts.Diagnostics.JSDoc_types_can_only_be_used_inside_documentation_comments);
}
ts.forEach(node.typeArguments, checkSourceElement);
var type = getTypeFromTypeReference(node);
if (type !== errorType) {
if (node.typeArguments && produceDiagnostics) {
var typeParameters = getTypeParametersForTypeReference(node);
if (typeParameters) {
checkTypeArgumentConstraints(node, typeParameters);
}
}
var symbol = getNodeLinks(node).resolvedSymbol;
if (symbol) {
if (ts.some(symbol.declarations, function (d) { return isTypeDeclaration(d) && !!(d.flags & 134217728 /* Deprecated */); })) {
addDeprecatedSuggestion(getDeprecatedSuggestionNode(node), symbol.declarations, symbol.escapedName);
}
if (type.flags & 32 /* Enum */ && symbol.flags & 8 /* EnumMember */) {
error(node, ts.Diagnostics.Enum_type_0_has_members_with_initializers_that_are_not_literals, typeToString(type));
}
}
}
}
function getTypeArgumentConstraint(node) {
var typeReferenceNode = ts.tryCast(node.parent, ts.isTypeReferenceType);
if (!typeReferenceNode)
return undefined;
var typeParameters = getTypeParametersForTypeReference(typeReferenceNode); // TODO: GH#18217
var constraint = getConstraintOfTypeParameter(typeParameters[typeReferenceNode.typeArguments.indexOf(node)]);
return constraint && instantiateType(constraint, createTypeMapper(typeParameters, getEffectiveTypeArguments(typeReferenceNode, typeParameters)));
}
function checkTypeQuery(node) {
getTypeFromTypeQueryNode(node);
}
function checkTypeLiteral(node) {
ts.forEach(node.members, checkSourceElement);
if (produceDiagnostics) {
var type = getTypeFromTypeLiteralOrFunctionOrConstructorTypeNode(node);
checkIndexConstraints(type);
checkTypeForDuplicateIndexSignatures(node);
checkObjectTypeForDuplicateDeclarations(node);
}
}
function checkArrayType(node) {
checkSourceElement(node.elementType);
}
function checkTupleType(node) {
var elementTypes = node.elements;
var seenOptionalElement = false;
var seenRestElement = false;
var hasNamedElement = ts.some(elementTypes, ts.isNamedTupleMember);
for (var _i = 0, elementTypes_1 = elementTypes; _i < elementTypes_1.length; _i++) {
var e = elementTypes_1[_i];
if (e.kind !== 195 /* NamedTupleMember */ && hasNamedElement) {
grammarErrorOnNode(e, ts.Diagnostics.Tuple_members_must_all_have_names_or_all_not_have_names);
break;
}
var flags = getTupleElementFlags(e);
if (flags & 8 /* Variadic */) {
var type = getTypeFromTypeNode(e.type);
if (!isArrayLikeType(type)) {
error(e, ts.Diagnostics.A_rest_element_type_must_be_an_array_type);
break;
}
if (isArrayType(type) || isTupleType(type) && type.target.combinedFlags & 4 /* Rest */) {
seenRestElement = true;
}
}
else if (flags & 4 /* Rest */) {
if (seenRestElement) {
grammarErrorOnNode(e, ts.Diagnostics.A_rest_element_cannot_follow_another_rest_element);
break;
}
seenRestElement = true;
}
else if (flags & 2 /* Optional */) {
if (seenRestElement) {
grammarErrorOnNode(e, ts.Diagnostics.An_optional_element_cannot_follow_a_rest_element);
break;
}
seenOptionalElement = true;
}
else if (seenOptionalElement) {
grammarErrorOnNode(e, ts.Diagnostics.A_required_element_cannot_follow_an_optional_element);
break;
}
}
ts.forEach(node.elements, checkSourceElement);
getTypeFromTypeNode(node);
}
function checkUnionOrIntersectionType(node) {
ts.forEach(node.types, checkSourceElement);
getTypeFromTypeNode(node);
}
function checkIndexedAccessIndexType(type, accessNode) {
if (!(type.flags & 8388608 /* IndexedAccess */)) {
return type;
}
// Check if the index type is assignable to 'keyof T' for the object type.
var objectType = type.objectType;
var indexType = type.indexType;
if (isTypeAssignableTo(indexType, getIndexType(objectType, /*stringsOnly*/ false))) {
if (accessNode.kind === 205 /* ElementAccessExpression */ && ts.isAssignmentTarget(accessNode) &&
ts.getObjectFlags(objectType) & 32 /* Mapped */ && getMappedTypeModifiers(objectType) & 1 /* IncludeReadonly */) {
error(accessNode, ts.Diagnostics.Index_signature_in_type_0_only_permits_reading, typeToString(objectType));
}
return type;
}
// Check if we're indexing with a numeric type and if either object or index types
// is a generic type with a constraint that has a numeric index signature.
var apparentObjectType = getApparentType(objectType);
if (getIndexInfoOfType(apparentObjectType, numberType) && isTypeAssignableToKind(indexType, 296 /* NumberLike */)) {
return type;
}
if (isGenericObjectType(objectType)) {
var propertyName_1 = getPropertyNameFromIndex(indexType, accessNode);
if (propertyName_1) {
var propertySymbol = forEachType(apparentObjectType, function (t) { return getPropertyOfType(t, propertyName_1); });
if (propertySymbol && ts.getDeclarationModifierFlagsFromSymbol(propertySymbol) & 24 /* NonPublicAccessibilityModifier */) {
error(accessNode, ts.Diagnostics.Private_or_protected_member_0_cannot_be_accessed_on_a_type_parameter, ts.unescapeLeadingUnderscores(propertyName_1));
return errorType;
}
}
}
error(accessNode, ts.Diagnostics.Type_0_cannot_be_used_to_index_type_1, typeToString(indexType), typeToString(objectType));
return errorType;
}
function checkIndexedAccessType(node) {
checkSourceElement(node.objectType);
checkSourceElement(node.indexType);
checkIndexedAccessIndexType(getTypeFromIndexedAccessTypeNode(node), node);
}
function checkMappedType(node) {
checkSourceElement(node.typeParameter);
checkSourceElement(node.nameType);
checkSourceElement(node.type);
if (!node.type) {
reportImplicitAny(node, anyType);
}
var type = getTypeFromMappedTypeNode(node);
var nameType = getNameTypeFromMappedType(type);
if (nameType) {
checkTypeAssignableTo(nameType, keyofConstraintType, node.nameType);
}
else {
var constraintType = getConstraintTypeFromMappedType(type);
checkTypeAssignableTo(constraintType, keyofConstraintType, ts.getEffectiveConstraintOfTypeParameter(node.typeParameter));
}
}
function checkThisType(node) {
getTypeFromThisTypeNode(node);
}
function checkTypeOperator(node) {
checkGrammarTypeOperatorNode(node);
checkSourceElement(node.type);
}
function checkConditionalType(node) {
ts.forEachChild(node, checkSourceElement);
}
function checkInferType(node) {
if (!ts.findAncestor(node, function (n) { return n.parent && n.parent.kind === 187 /* ConditionalType */ && n.parent.extendsType === n; })) {
grammarErrorOnNode(node, ts.Diagnostics.infer_declarations_are_only_permitted_in_the_extends_clause_of_a_conditional_type);
}
checkSourceElement(node.typeParameter);
registerForUnusedIdentifiersCheck(node);
}
function checkTemplateLiteralType(node) {
for (var _i = 0, _a = node.templateSpans; _i < _a.length; _i++) {
var span = _a[_i];
checkSourceElement(span.type);
var type = getTypeFromTypeNode(span.type);
checkTypeAssignableTo(type, templateConstraintType, span.type);
}
getTypeFromTypeNode(node);
}
function checkImportType(node) {
checkSourceElement(node.argument);
getTypeFromTypeNode(node);
}
function checkNamedTupleMember(node) {
if (node.dotDotDotToken && node.questionToken) {
grammarErrorOnNode(node, ts.Diagnostics.A_tuple_member_cannot_be_both_optional_and_rest);
}
if (node.type.kind === 183 /* OptionalType */) {
grammarErrorOnNode(node.type, ts.Diagnostics.A_labeled_tuple_element_is_declared_as_optional_with_a_question_mark_after_the_name_and_before_the_colon_rather_than_after_the_type);
}
if (node.type.kind === 184 /* RestType */) {
grammarErrorOnNode(node.type, ts.Diagnostics.A_labeled_tuple_element_is_declared_as_rest_with_a_before_the_name_rather_than_before_the_type);
}
checkSourceElement(node.type);
getTypeFromTypeNode(node);
}
function isPrivateWithinAmbient(node) {
return (ts.hasEffectiveModifier(node, 8 /* Private */) || ts.isPrivateIdentifierClassElementDeclaration(node)) && !!(node.flags & 8388608 /* Ambient */);
}
function getEffectiveDeclarationFlags(n, flagsToCheck) {
var flags = ts.getCombinedModifierFlags(n);
// children of classes (even ambient classes) should not be marked as ambient or export
// because those flags have no useful semantics there.
if (n.parent.kind !== 256 /* InterfaceDeclaration */ &&
n.parent.kind !== 255 /* ClassDeclaration */ &&
n.parent.kind !== 224 /* ClassExpression */ &&
n.flags & 8388608 /* Ambient */) {
if (!(flags & 2 /* Ambient */) && !(ts.isModuleBlock(n.parent) && ts.isModuleDeclaration(n.parent.parent) && ts.isGlobalScopeAugmentation(n.parent.parent))) {
// It is nested in an ambient context, which means it is automatically exported
flags |= 1 /* Export */;
}
flags |= 2 /* Ambient */;
}
return flags & flagsToCheck;
}
function checkFunctionOrConstructorSymbol(symbol) {
if (!produceDiagnostics) {
return;
}
function getCanonicalOverload(overloads, implementation) {
// Consider the canonical set of flags to be the flags of the bodyDeclaration or the first declaration
// Error on all deviations from this canonical set of flags
// The caveat is that if some overloads are defined in lib.d.ts, we don't want to
// report the errors on those. To achieve this, we will say that the implementation is
// the canonical signature only if it is in the same container as the first overload
var implementationSharesContainerWithFirstOverload = implementation !== undefined && implementation.parent === overloads[0].parent;
return implementationSharesContainerWithFirstOverload ? implementation : overloads[0];
}
function checkFlagAgreementBetweenOverloads(overloads, implementation, flagsToCheck, someOverloadFlags, allOverloadFlags) {
// Error if some overloads have a flag that is not shared by all overloads. To find the
// deviations, we XOR someOverloadFlags with allOverloadFlags
var someButNotAllOverloadFlags = someOverloadFlags ^ allOverloadFlags;
if (someButNotAllOverloadFlags !== 0) {
var canonicalFlags_1 = getEffectiveDeclarationFlags(getCanonicalOverload(overloads, implementation), flagsToCheck);
ts.forEach(overloads, function (o) {
var deviation = getEffectiveDeclarationFlags(o, flagsToCheck) ^ canonicalFlags_1;
if (deviation & 1 /* Export */) {
error(ts.getNameOfDeclaration(o), ts.Diagnostics.Overload_signatures_must_all_be_exported_or_non_exported);
}
else if (deviation & 2 /* Ambient */) {
error(ts.getNameOfDeclaration(o), ts.Diagnostics.Overload_signatures_must_all_be_ambient_or_non_ambient);
}
else if (deviation & (8 /* Private */ | 16 /* Protected */)) {
error(ts.getNameOfDeclaration(o) || o, ts.Diagnostics.Overload_signatures_must_all_be_public_private_or_protected);
}
else if (deviation & 128 /* Abstract */) {
error(ts.getNameOfDeclaration(o), ts.Diagnostics.Overload_signatures_must_all_be_abstract_or_non_abstract);
}
});
}
}
function checkQuestionTokenAgreementBetweenOverloads(overloads, implementation, someHaveQuestionToken, allHaveQuestionToken) {
if (someHaveQuestionToken !== allHaveQuestionToken) {
var canonicalHasQuestionToken_1 = ts.hasQuestionToken(getCanonicalOverload(overloads, implementation));
ts.forEach(overloads, function (o) {
var deviation = ts.hasQuestionToken(o) !== canonicalHasQuestionToken_1;
if (deviation) {
error(ts.getNameOfDeclaration(o), ts.Diagnostics.Overload_signatures_must_all_be_optional_or_required);
}
});
}
}
var flagsToCheck = 1 /* Export */ | 2 /* Ambient */ | 8 /* Private */ | 16 /* Protected */ | 128 /* Abstract */;
var someNodeFlags = 0 /* None */;
var allNodeFlags = flagsToCheck;
var someHaveQuestionToken = false;
var allHaveQuestionToken = true;
var hasOverloads = false;
var bodyDeclaration;
var lastSeenNonAmbientDeclaration;
var previousDeclaration;
var declarations = symbol.declarations;
var isConstructor = (symbol.flags & 16384 /* Constructor */) !== 0;
function reportImplementationExpectedError(node) {
if (node.name && ts.nodeIsMissing(node.name)) {
return;
}
var seen = false;
var subsequentNode = ts.forEachChild(node.parent, function (c) {
if (seen) {
return c;
}
else {
seen = c === node;
}
});
// We may be here because of some extra nodes between overloads that could not be parsed into a valid node.
// In this case the subsequent node is not really consecutive (.pos !== node.end), and we must ignore it here.
if (subsequentNode && subsequentNode.pos === node.end) {
if (subsequentNode.kind === node.kind) {
var errorNode_1 = subsequentNode.name || subsequentNode;
var subsequentName = subsequentNode.name;
if (node.name && subsequentName && (
// both are private identifiers
ts.isPrivateIdentifier(node.name) && ts.isPrivateIdentifier(subsequentName) && node.name.escapedText === subsequentName.escapedText ||
// Both are computed property names
// TODO: GH#17345: These are methods, so handle computed name case. (`Always allowing computed property names is *not* the correct behavior!)
ts.isComputedPropertyName(node.name) && ts.isComputedPropertyName(subsequentName) ||
// Both are literal property names that are the same.
ts.isPropertyNameLiteral(node.name) && ts.isPropertyNameLiteral(subsequentName) &&
ts.getEscapedTextOfIdentifierOrLiteral(node.name) === ts.getEscapedTextOfIdentifierOrLiteral(subsequentName))) {
var reportError = (node.kind === 167 /* MethodDeclaration */ || node.kind === 166 /* MethodSignature */) &&
ts.isStatic(node) !== ts.isStatic(subsequentNode);
// we can get here in two cases
// 1. mixed static and instance class members
// 2. something with the same name was defined before the set of overloads that prevents them from merging
// here we'll report error only for the first case since for second we should already report error in binder
if (reportError) {
var diagnostic = ts.isStatic(node) ? ts.Diagnostics.Function_overload_must_be_static : ts.Diagnostics.Function_overload_must_not_be_static;
error(errorNode_1, diagnostic);
}
return;
}
if (ts.nodeIsPresent(subsequentNode.body)) {
error(errorNode_1, ts.Diagnostics.Function_implementation_name_must_be_0, ts.declarationNameToString(node.name));
return;
}
}
}
var errorNode = node.name || node;
if (isConstructor) {
error(errorNode, ts.Diagnostics.Constructor_implementation_is_missing);
}
else {
// Report different errors regarding non-consecutive blocks of declarations depending on whether
// the node in question is abstract.
if (ts.hasSyntacticModifier(node, 128 /* Abstract */)) {
error(errorNode, ts.Diagnostics.All_declarations_of_an_abstract_method_must_be_consecutive);
}
else {
error(errorNode, ts.Diagnostics.Function_implementation_is_missing_or_not_immediately_following_the_declaration);
}
}
}
var duplicateFunctionDeclaration = false;
var multipleConstructorImplementation = false;
var hasNonAmbientClass = false;
var functionDeclarations = [];
if (declarations) {
for (var _i = 0, declarations_4 = declarations; _i < declarations_4.length; _i++) {
var current = declarations_4[_i];
var node = current;
var inAmbientContext = node.flags & 8388608 /* Ambient */;
var inAmbientContextOrInterface = node.parent && (node.parent.kind === 256 /* InterfaceDeclaration */ || node.parent.kind === 180 /* TypeLiteral */) || inAmbientContext;
if (inAmbientContextOrInterface) {
// check if declarations are consecutive only if they are non-ambient
// 1. ambient declarations can be interleaved
// i.e. this is legal
// declare function foo();
// declare function bar();
// declare function foo();
// 2. mixing ambient and non-ambient declarations is a separate error that will be reported - do not want to report an extra one
previousDeclaration = undefined;
}
if ((node.kind === 255 /* ClassDeclaration */ || node.kind === 224 /* ClassExpression */) && !inAmbientContext) {
hasNonAmbientClass = true;
}
if (node.kind === 254 /* FunctionDeclaration */ || node.kind === 167 /* MethodDeclaration */ || node.kind === 166 /* MethodSignature */ || node.kind === 169 /* Constructor */) {
functionDeclarations.push(node);
var currentNodeFlags = getEffectiveDeclarationFlags(node, flagsToCheck);
someNodeFlags |= currentNodeFlags;
allNodeFlags &= currentNodeFlags;
someHaveQuestionToken = someHaveQuestionToken || ts.hasQuestionToken(node);
allHaveQuestionToken = allHaveQuestionToken && ts.hasQuestionToken(node);
var bodyIsPresent = ts.nodeIsPresent(node.body);
if (bodyIsPresent && bodyDeclaration) {
if (isConstructor) {
multipleConstructorImplementation = true;
}
else {
duplicateFunctionDeclaration = true;
}
}
else if ((previousDeclaration === null || previousDeclaration === void 0 ? void 0 : previousDeclaration.parent) === node.parent && previousDeclaration.end !== node.pos) {
reportImplementationExpectedError(previousDeclaration);
}
if (bodyIsPresent) {
if (!bodyDeclaration) {
bodyDeclaration = node;
}
}
else {
hasOverloads = true;
}
previousDeclaration = node;
if (!inAmbientContextOrInterface) {
lastSeenNonAmbientDeclaration = node;
}
}
}
}
if (multipleConstructorImplementation) {
ts.forEach(functionDeclarations, function (declaration) {
error(declaration, ts.Diagnostics.Multiple_constructor_implementations_are_not_allowed);
});
}
if (duplicateFunctionDeclaration) {
ts.forEach(functionDeclarations, function (declaration) {
error(ts.getNameOfDeclaration(declaration) || declaration, ts.Diagnostics.Duplicate_function_implementation);
});
}
if (hasNonAmbientClass && !isConstructor && symbol.flags & 16 /* Function */ && declarations) {
var relatedDiagnostics_1 = ts.filter(declarations, function (d) { return d.kind === 255 /* ClassDeclaration */; })
.map(function (d) { return ts.createDiagnosticForNode(d, ts.Diagnostics.Consider_adding_a_declare_modifier_to_this_class); });
ts.forEach(declarations, function (declaration) {
var diagnostic = declaration.kind === 255 /* ClassDeclaration */
? ts.Diagnostics.Class_declaration_cannot_implement_overload_list_for_0
: declaration.kind === 254 /* FunctionDeclaration */
? ts.Diagnostics.Function_with_bodies_can_only_merge_with_classes_that_are_ambient
: undefined;
if (diagnostic) {
ts.addRelatedInfo.apply(void 0, __spreadArray([error(ts.getNameOfDeclaration(declaration) || declaration, diagnostic, ts.symbolName(symbol))], relatedDiagnostics_1, false));
}
});
}
// Abstract methods can't have an implementation -- in particular, they don't need one.
if (lastSeenNonAmbientDeclaration && !lastSeenNonAmbientDeclaration.body &&
!ts.hasSyntacticModifier(lastSeenNonAmbientDeclaration, 128 /* Abstract */) && !lastSeenNonAmbientDeclaration.questionToken) {
reportImplementationExpectedError(lastSeenNonAmbientDeclaration);
}
if (hasOverloads) {
if (declarations) {
checkFlagAgreementBetweenOverloads(declarations, bodyDeclaration, flagsToCheck, someNodeFlags, allNodeFlags);
checkQuestionTokenAgreementBetweenOverloads(declarations, bodyDeclaration, someHaveQuestionToken, allHaveQuestionToken);
}
if (bodyDeclaration) {
var signatures = getSignaturesOfSymbol(symbol);
var bodySignature = getSignatureFromDeclaration(bodyDeclaration);
for (var _a = 0, signatures_10 = signatures; _a < signatures_10.length; _a++) {
var signature = signatures_10[_a];
if (!isImplementationCompatibleWithOverload(bodySignature, signature)) {
ts.addRelatedInfo(error(signature.declaration, ts.Diagnostics.This_overload_signature_is_not_compatible_with_its_implementation_signature), ts.createDiagnosticForNode(bodyDeclaration, ts.Diagnostics.The_implementation_signature_is_declared_here));
break;
}
}
}
}
}
function checkExportsOnMergedDeclarations(node) {
if (!produceDiagnostics) {
return;
}
// if localSymbol is defined on node then node itself is exported - check is required
var symbol = node.localSymbol;
if (!symbol) {
// local symbol is undefined => this declaration is non-exported.
// however symbol might contain other declarations that are exported
symbol = getSymbolOfNode(node);
if (!symbol.exportSymbol) {
// this is a pure local symbol (all declarations are non-exported) - no need to check anything
return;
}
}
// run the check only for the first declaration in the list
if (ts.getDeclarationOfKind(symbol, node.kind) !== node) {
return;
}
var exportedDeclarationSpaces = 0 /* None */;
var nonExportedDeclarationSpaces = 0 /* None */;
var defaultExportedDeclarationSpaces = 0 /* None */;
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var d = _a[_i];
var declarationSpaces = getDeclarationSpaces(d);
var effectiveDeclarationFlags = getEffectiveDeclarationFlags(d, 1 /* Export */ | 512 /* Default */);
if (effectiveDeclarationFlags & 1 /* Export */) {
if (effectiveDeclarationFlags & 512 /* Default */) {
defaultExportedDeclarationSpaces |= declarationSpaces;
}
else {
exportedDeclarationSpaces |= declarationSpaces;
}
}
else {
nonExportedDeclarationSpaces |= declarationSpaces;
}
}
// Spaces for anything not declared a 'default export'.
var nonDefaultExportedDeclarationSpaces = exportedDeclarationSpaces | nonExportedDeclarationSpaces;
var commonDeclarationSpacesForExportsAndLocals = exportedDeclarationSpaces & nonExportedDeclarationSpaces;
var commonDeclarationSpacesForDefaultAndNonDefault = defaultExportedDeclarationSpaces & nonDefaultExportedDeclarationSpaces;
if (commonDeclarationSpacesForExportsAndLocals || commonDeclarationSpacesForDefaultAndNonDefault) {
// declaration spaces for exported and non-exported declarations intersect
for (var _b = 0, _c = symbol.declarations; _b < _c.length; _b++) {
var d = _c[_b];
var declarationSpaces = getDeclarationSpaces(d);
var name = ts.getNameOfDeclaration(d);
// Only error on the declarations that contributed to the intersecting spaces.
if (declarationSpaces & commonDeclarationSpacesForDefaultAndNonDefault) {
error(name, ts.Diagnostics.Merged_declaration_0_cannot_include_a_default_export_declaration_Consider_adding_a_separate_export_default_0_declaration_instead, ts.declarationNameToString(name));
}
else if (declarationSpaces & commonDeclarationSpacesForExportsAndLocals) {
error(name, ts.Diagnostics.Individual_declarations_in_merged_declaration_0_must_be_all_exported_or_all_local, ts.declarationNameToString(name));
}
}
}
function getDeclarationSpaces(decl) {
var d = decl;
switch (d.kind) {
case 256 /* InterfaceDeclaration */:
case 257 /* TypeAliasDeclaration */:
// A jsdoc typedef and callback are, by definition, type aliases.
// falls through
case 340 /* JSDocTypedefTag */:
case 333 /* JSDocCallbackTag */:
case 334 /* JSDocEnumTag */:
return 2 /* ExportType */;
case 259 /* ModuleDeclaration */:
return ts.isAmbientModule(d) || ts.getModuleInstanceState(d) !== 0 /* NonInstantiated */
? 4 /* ExportNamespace */ | 1 /* ExportValue */
: 4 /* ExportNamespace */;
case 255 /* ClassDeclaration */:
case 258 /* EnumDeclaration */:
case 294 /* EnumMember */:
return 2 /* ExportType */ | 1 /* ExportValue */;
case 300 /* SourceFile */:
return 2 /* ExportType */ | 1 /* ExportValue */ | 4 /* ExportNamespace */;
case 269 /* ExportAssignment */:
case 219 /* BinaryExpression */:
var node_2 = d;
var expression = ts.isExportAssignment(node_2) ? node_2.expression : node_2.right;
// Export assigned entity name expressions act as aliases and should fall through, otherwise they export values
if (!ts.isEntityNameExpression(expression)) {
return 1 /* ExportValue */;
}
d = expression;
// The below options all declare an Alias, which is allowed to merge with other values within the importing module.
// falls through
case 263 /* ImportEqualsDeclaration */:
case 266 /* NamespaceImport */:
case 265 /* ImportClause */:
var result_12 = 0 /* None */;
var target = resolveAlias(getSymbolOfNode(d));
ts.forEach(target.declarations, function (d) { result_12 |= getDeclarationSpaces(d); });
return result_12;
case 252 /* VariableDeclaration */:
case 201 /* BindingElement */:
case 254 /* FunctionDeclaration */:
case 268 /* ImportSpecifier */: // https://github.com/Microsoft/TypeScript/pull/7591
case 79 /* Identifier */: // https://github.com/microsoft/TypeScript/issues/36098
// Identifiers are used as declarations of assignment declarations whose parents may be
// SyntaxKind.CallExpression - `Object.defineProperty(thing, "aField", {value: 42});`
// SyntaxKind.ElementAccessExpression - `thing["aField"] = 42;` or `thing["aField"];` (with a doc comment on it)
// or SyntaxKind.PropertyAccessExpression - `thing.aField = 42;`
// all of which are pretty much always values, or at least imply a value meaning.
// It may be apprpriate to treat these as aliases in the future.
return 1 /* ExportValue */;
default:
return ts.Debug.failBadSyntaxKind(d);
}
}
}
function getAwaitedTypeOfPromise(type, errorNode, diagnosticMessage, arg0) {
var promisedType = getPromisedTypeOfPromise(type, errorNode);
return promisedType && getAwaitedType(promisedType, errorNode, diagnosticMessage, arg0);
}
/**
* Gets the "promised type" of a promise.
* @param type The type of the promise.
* @remarks The "promised type" of a type is the type of the "value" parameter of the "onfulfilled" callback.
*/
function getPromisedTypeOfPromise(type, errorNode) {
//
// { // type
// then( // thenFunction
// onfulfilled: ( // onfulfilledParameterType
// value: T // valueParameterType
// ) => any
// ): any;
// }
//
if (isTypeAny(type)) {
return undefined;
}
var typeAsPromise = type;
if (typeAsPromise.promisedTypeOfPromise) {
return typeAsPromise.promisedTypeOfPromise;
}
if (isReferenceToType(type, getGlobalPromiseType(/*reportErrors*/ false))) {
return typeAsPromise.promisedTypeOfPromise = getTypeArguments(type)[0];
}
var thenFunction = getTypeOfPropertyOfType(type, "then"); // TODO: GH#18217
if (isTypeAny(thenFunction)) {
return undefined;
}
var thenSignatures = thenFunction ? getSignaturesOfType(thenFunction, 0 /* Call */) : ts.emptyArray;
if (thenSignatures.length === 0) {
if (errorNode) {
error(errorNode, ts.Diagnostics.A_promise_must_have_a_then_method);
}
return undefined;
}
var onfulfilledParameterType = getTypeWithFacts(getUnionType(ts.map(thenSignatures, getTypeOfFirstParameterOfSignature)), 2097152 /* NEUndefinedOrNull */);
if (isTypeAny(onfulfilledParameterType)) {
return undefined;
}
var onfulfilledParameterSignatures = getSignaturesOfType(onfulfilledParameterType, 0 /* Call */);
if (onfulfilledParameterSignatures.length === 0) {
if (errorNode) {
error(errorNode, ts.Diagnostics.The_first_parameter_of_the_then_method_of_a_promise_must_be_a_callback);
}
return undefined;
}
return typeAsPromise.promisedTypeOfPromise = getUnionType(ts.map(onfulfilledParameterSignatures, getTypeOfFirstParameterOfSignature), 2 /* Subtype */);
}
/**
* Gets the "awaited type" of a type.
* @param type The type to await.
* @remarks The "awaited type" of an expression is its "promised type" if the expression is a
* Promise-like type; otherwise, it is the type of the expression. This is used to reflect
* The runtime behavior of the `await` keyword.
*/
function checkAwaitedType(type, errorNode, diagnosticMessage, arg0) {
var awaitedType = getAwaitedType(type, errorNode, diagnosticMessage, arg0);
return awaitedType || errorType;
}
/**
* Determines whether a type has a callable `then` member.
*/
function isThenableType(type) {
var thenFunction = getTypeOfPropertyOfType(type, "then");
return !!thenFunction && getSignaturesOfType(getTypeWithFacts(thenFunction, 2097152 /* NEUndefinedOrNull */), 0 /* Call */).length > 0;
}
/**
* Gets the "awaited type" of a type.
*
* The "awaited type" of an expression is its "promised type" if the expression is a
* Promise-like type; otherwise, it is the type of the expression. If the "promised
* type" is itself a Promise-like, the "promised type" is recursively unwrapped until a
* non-promise type is found.
*
* This is used to reflect the runtime behavior of the `await` keyword.
*/
function getAwaitedType(type, errorNode, diagnosticMessage, arg0) {
if (isTypeAny(type)) {
return type;
}
var typeAsAwaitable = type;
if (typeAsAwaitable.awaitedTypeOfType) {
return typeAsAwaitable.awaitedTypeOfType;
}
// For a union, get a union of the awaited types of each constituent.
//
return typeAsAwaitable.awaitedTypeOfType =
mapType(type, errorNode ? function (constituentType) { return getAwaitedTypeWorker(constituentType, errorNode, diagnosticMessage, arg0); } : getAwaitedTypeWorker);
}
function getAwaitedTypeWorker(type, errorNode, diagnosticMessage, arg0) {
var typeAsAwaitable = type;
if (typeAsAwaitable.awaitedTypeOfType) {
return typeAsAwaitable.awaitedTypeOfType;
}
var promisedType = getPromisedTypeOfPromise(type);
if (promisedType) {
if (type.id === promisedType.id || awaitedTypeStack.lastIndexOf(promisedType.id) >= 0) {
// Verify that we don't have a bad actor in the form of a promise whose
// promised type is the same as the promise type, or a mutually recursive
// promise. If so, we return undefined as we cannot guess the shape. If this
// were the actual case in the JavaScript, this Promise would never resolve.
//
// An example of a bad actor with a singly-recursive promise type might
// be:
//
// interface BadPromise {
// then(
// onfulfilled: (value: BadPromise) => any,
// onrejected: (error: any) => any): BadPromise;
// }
//
// The above interface will pass the PromiseLike check, and return a
// promised type of `BadPromise`. Since this is a self reference, we
// don't want to keep recursing ad infinitum.
//
// An example of a bad actor in the form of a mutually-recursive
// promise type might be:
//
// interface BadPromiseA {
// then(
// onfulfilled: (value: BadPromiseB) => any,
// onrejected: (error: any) => any): BadPromiseB;
// }
//
// interface BadPromiseB {
// then(
// onfulfilled: (value: BadPromiseA) => any,
// onrejected: (error: any) => any): BadPromiseA;
// }
//
if (errorNode) {
error(errorNode, ts.Diagnostics.Type_is_referenced_directly_or_indirectly_in_the_fulfillment_callback_of_its_own_then_method);
}
return undefined;
}
// Keep track of the type we're about to unwrap to avoid bad recursive promise types.
// See the comments above for more information.
awaitedTypeStack.push(type.id);
var awaitedType = getAwaitedType(promisedType, errorNode, diagnosticMessage, arg0);
awaitedTypeStack.pop();
if (!awaitedType) {
return undefined;
}
return typeAsAwaitable.awaitedTypeOfType = awaitedType;
}
// The type was not a promise, so it could not be unwrapped any further.
// As long as the type does not have a callable "then" property, it is
// safe to return the type; otherwise, an error is reported and we return
// undefined.
//
// An example of a non-promise "thenable" might be:
//
// await { then(): void {} }
//
// The "thenable" does not match the minimal definition for a promise. When
// a Promise/A+-compatible or ES6 promise tries to adopt this value, the promise
// will never settle. We treat this as an error to help flag an early indicator
// of a runtime problem. If the user wants to return this value from an async
// function, they would need to wrap it in some other value. If they want it to
// be treated as a promise, they can cast to <any>.
if (isThenableType(type)) {
if (errorNode) {
if (!diagnosticMessage)
return ts.Debug.fail();
error(errorNode, diagnosticMessage, arg0);
}
return undefined;
}
return typeAsAwaitable.awaitedTypeOfType = type;
}
/**
* Checks the return type of an async function to ensure it is a compatible
* Promise implementation.
*
* This checks that an async function has a valid Promise-compatible return type.
* An async function has a valid Promise-compatible return type if the resolved value
* of the return type has a construct signature that takes in an `initializer` function
* that in turn supplies a `resolve` function as one of its arguments and results in an
* object with a callable `then` signature.
*
* @param node The signature to check
*/
function checkAsyncFunctionReturnType(node, returnTypeNode) {
// As part of our emit for an async function, we will need to emit the entity name of
// the return type annotation as an expression. To meet the necessary runtime semantics
// for __awaiter, we must also check that the type of the declaration (e.g. the static
// side or "constructor" of the promise type) is compatible `PromiseConstructorLike`.
//
// An example might be (from lib.es6.d.ts):
//
// interface Promise<T> { ... }
// interface PromiseConstructor {
// new <T>(...): Promise<T>;
// }
// declare var Promise: PromiseConstructor;
//
// When an async function declares a return type annotation of `Promise<T>`, we
// need to get the type of the `Promise` variable declaration above, which would
// be `PromiseConstructor`.
//
// The same case applies to a class:
//
// declare class Promise<T> {
// constructor(...);
// then<U>(...): Promise<U>;
// }
//
var returnType = getTypeFromTypeNode(returnTypeNode);
if (languageVersion >= 2 /* ES2015 */) {
if (returnType === errorType) {
return;
}
var globalPromiseType = getGlobalPromiseType(/*reportErrors*/ true);
if (globalPromiseType !== emptyGenericType && !isReferenceToType(returnType, globalPromiseType)) {
// The promise type was not a valid type reference to the global promise type, so we
// report an error and return the unknown type.
error(returnTypeNode, ts.Diagnostics.The_return_type_of_an_async_function_or_method_must_be_the_global_Promise_T_type_Did_you_mean_to_write_Promise_0, typeToString(getAwaitedType(returnType) || voidType));
return;
}
}
else {
// Always mark the type node as referenced if it points to a value
markTypeNodeAsReferenced(returnTypeNode);
if (returnType === errorType) {
return;
}
var promiseConstructorName = ts.getEntityNameFromTypeNode(returnTypeNode);
if (promiseConstructorName === undefined) {
error(returnTypeNode, ts.Diagnostics.Type_0_is_not_a_valid_async_function_return_type_in_ES5_SlashES3_because_it_does_not_refer_to_a_Promise_compatible_constructor_value, typeToString(returnType));
return;
}
var promiseConstructorSymbol = resolveEntityName(promiseConstructorName, 111551 /* Value */, /*ignoreErrors*/ true);
var promiseConstructorType = promiseConstructorSymbol ? getTypeOfSymbol(promiseConstructorSymbol) : errorType;
if (promiseConstructorType === errorType) {
if (promiseConstructorName.kind === 79 /* Identifier */ && promiseConstructorName.escapedText === "Promise" && getTargetType(returnType) === getGlobalPromiseType(/*reportErrors*/ false)) {
error(returnTypeNode, ts.Diagnostics.An_async_function_or_method_in_ES5_SlashES3_requires_the_Promise_constructor_Make_sure_you_have_a_declaration_for_the_Promise_constructor_or_include_ES2015_in_your_lib_option);
}
else {
error(returnTypeNode, ts.Diagnostics.Type_0_is_not_a_valid_async_function_return_type_in_ES5_SlashES3_because_it_does_not_refer_to_a_Promise_compatible_constructor_value, ts.entityNameToString(promiseConstructorName));
}
return;
}
var globalPromiseConstructorLikeType = getGlobalPromiseConstructorLikeType(/*reportErrors*/ true);
if (globalPromiseConstructorLikeType === emptyObjectType) {
// If we couldn't resolve the global PromiseConstructorLike type we cannot verify
// compatibility with __awaiter.
error(returnTypeNode, ts.Diagnostics.Type_0_is_not_a_valid_async_function_return_type_in_ES5_SlashES3_because_it_does_not_refer_to_a_Promise_compatible_constructor_value, ts.entityNameToString(promiseConstructorName));
return;
}
if (!checkTypeAssignableTo(promiseConstructorType, globalPromiseConstructorLikeType, returnTypeNode, ts.Diagnostics.Type_0_is_not_a_valid_async_function_return_type_in_ES5_SlashES3_because_it_does_not_refer_to_a_Promise_compatible_constructor_value)) {
return;
}
// Verify there is no local declaration that could collide with the promise constructor.
var rootName = promiseConstructorName && ts.getFirstIdentifier(promiseConstructorName);
var collidingSymbol = getSymbol(node.locals, rootName.escapedText, 111551 /* Value */);
if (collidingSymbol) {
error(collidingSymbol.valueDeclaration, ts.Diagnostics.Duplicate_identifier_0_Compiler_uses_declaration_1_to_support_async_functions, ts.idText(rootName), ts.entityNameToString(promiseConstructorName));
return;
}
}
checkAwaitedType(returnType, node, ts.Diagnostics.The_return_type_of_an_async_function_must_either_be_a_valid_promise_or_must_not_contain_a_callable_then_member);
}
/** Check a decorator */
function checkDecorator(node) {
var signature = getResolvedSignature(node);
checkDeprecatedSignature(signature, node);
var returnType = getReturnTypeOfSignature(signature);
if (returnType.flags & 1 /* Any */) {
return;
}
var expectedReturnType;
var headMessage = getDiagnosticHeadMessageForDecoratorResolution(node);
var errorInfo;
switch (node.parent.kind) {
case 255 /* ClassDeclaration */:
var classSymbol = getSymbolOfNode(node.parent);
var classConstructorType = getTypeOfSymbol(classSymbol);
expectedReturnType = getUnionType([classConstructorType, voidType]);
break;
case 162 /* Parameter */:
expectedReturnType = voidType;
errorInfo = ts.chainDiagnosticMessages(
/*details*/ undefined, ts.Diagnostics.The_return_type_of_a_parameter_decorator_function_must_be_either_void_or_any);
break;
case 165 /* PropertyDeclaration */:
expectedReturnType = voidType;
errorInfo = ts.chainDiagnosticMessages(
/*details*/ undefined, ts.Diagnostics.The_return_type_of_a_property_decorator_function_must_be_either_void_or_any);
break;
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
var methodType = getTypeOfNode(node.parent);
var descriptorType = createTypedPropertyDescriptorType(methodType);
expectedReturnType = getUnionType([descriptorType, voidType]);
break;
default:
return ts.Debug.fail();
}
checkTypeAssignableTo(returnType, expectedReturnType, node, headMessage, function () { return errorInfo; });
}
/**
* If a TypeNode can be resolved to a value symbol imported from an external module, it is
* marked as referenced to prevent import elision.
*/
function markTypeNodeAsReferenced(node) {
markEntityNameOrEntityExpressionAsReference(node && ts.getEntityNameFromTypeNode(node));
}
function markEntityNameOrEntityExpressionAsReference(typeName) {
if (!typeName)
return;
var rootName = ts.getFirstIdentifier(typeName);
var meaning = (typeName.kind === 79 /* Identifier */ ? 788968 /* Type */ : 1920 /* Namespace */) | 2097152 /* Alias */;
var rootSymbol = resolveName(rootName, rootName.escapedText, meaning, /*nameNotFoundMessage*/ undefined, /*nameArg*/ undefined, /*isReference*/ true);
if (rootSymbol
&& rootSymbol.flags & 2097152 /* Alias */
&& symbolIsValue(rootSymbol)
&& !isConstEnumOrConstEnumOnlyModule(resolveAlias(rootSymbol))
&& !getTypeOnlyAliasDeclaration(rootSymbol)) {
markAliasSymbolAsReferenced(rootSymbol);
}
}
/**
* This function marks the type used for metadata decorator as referenced if it is import
* from external module.
* This is different from markTypeNodeAsReferenced because it tries to simplify type nodes in
* union and intersection type
* @param node
*/
function markDecoratorMedataDataTypeNodeAsReferenced(node) {
var entityName = getEntityNameForDecoratorMetadata(node);
if (entityName && ts.isEntityName(entityName)) {
markEntityNameOrEntityExpressionAsReference(entityName);
}
}
function getEntityNameForDecoratorMetadata(node) {
if (node) {
switch (node.kind) {
case 186 /* IntersectionType */:
case 185 /* UnionType */:
return getEntityNameForDecoratorMetadataFromTypeList(node.types);
case 187 /* ConditionalType */:
return getEntityNameForDecoratorMetadataFromTypeList([node.trueType, node.falseType]);
case 189 /* ParenthesizedType */:
case 195 /* NamedTupleMember */:
return getEntityNameForDecoratorMetadata(node.type);
case 176 /* TypeReference */:
return node.typeName;
}
}
}
function getEntityNameForDecoratorMetadataFromTypeList(types) {
var commonEntityName;
for (var _i = 0, types_22 = types; _i < types_22.length; _i++) {
var typeNode = types_22[_i];
while (typeNode.kind === 189 /* ParenthesizedType */ || typeNode.kind === 195 /* NamedTupleMember */) {
typeNode = typeNode.type; // Skip parens if need be
}
if (typeNode.kind === 142 /* NeverKeyword */) {
continue; // Always elide `never` from the union/intersection if possible
}
if (!strictNullChecks && (typeNode.kind === 194 /* LiteralType */ && typeNode.literal.kind === 104 /* NullKeyword */ || typeNode.kind === 151 /* UndefinedKeyword */)) {
continue; // Elide null and undefined from unions for metadata, just like what we did prior to the implementation of strict null checks
}
var individualEntityName = getEntityNameForDecoratorMetadata(typeNode);
if (!individualEntityName) {
// Individual is something like string number
// So it would be serialized to either that type or object
// Safe to return here
return undefined;
}
if (commonEntityName) {
// Note this is in sync with the transformation that happens for type node.
// Keep this in sync with serializeUnionOrIntersectionType
// Verify if they refer to same entity and is identifier
// return undefined if they dont match because we would emit object
if (!ts.isIdentifier(commonEntityName) ||
!ts.isIdentifier(individualEntityName) ||
commonEntityName.escapedText !== individualEntityName.escapedText) {
return undefined;
}
}
else {
commonEntityName = individualEntityName;
}
}
return commonEntityName;
}
function getParameterTypeNodeForDecoratorCheck(node) {
var typeNode = ts.getEffectiveTypeAnnotationNode(node);
return ts.isRestParameter(node) ? ts.getRestParameterElementType(typeNode) : typeNode;
}
/** Check the decorators of a node */
function checkDecorators(node) {
if (!node.decorators) {
return;
}
// skip this check for nodes that cannot have decorators. These should have already had an error reported by
// checkGrammarDecorators.
if (!ts.nodeCanBeDecorated(node, node.parent, node.parent.parent)) {
return;
}
if (!compilerOptions.experimentalDecorators) {
error(node, ts.Diagnostics.Experimental_support_for_decorators_is_a_feature_that_is_subject_to_change_in_a_future_release_Set_the_experimentalDecorators_option_in_your_tsconfig_or_jsconfig_to_remove_this_warning);
}
var firstDecorator = node.decorators[0];
checkExternalEmitHelpers(firstDecorator, 8 /* Decorate */);
if (node.kind === 162 /* Parameter */) {
checkExternalEmitHelpers(firstDecorator, 32 /* Param */);
}
if (compilerOptions.emitDecoratorMetadata) {
checkExternalEmitHelpers(firstDecorator, 16 /* Metadata */);
// we only need to perform these checks if we are emitting serialized type metadata for the target of a decorator.
switch (node.kind) {
case 255 /* ClassDeclaration */:
var constructor = ts.getFirstConstructorWithBody(node);
if (constructor) {
for (var _i = 0, _a = constructor.parameters; _i < _a.length; _i++) {
var parameter = _a[_i];
markDecoratorMedataDataTypeNodeAsReferenced(getParameterTypeNodeForDecoratorCheck(parameter));
}
}
break;
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
var otherKind = node.kind === 170 /* GetAccessor */ ? 171 /* SetAccessor */ : 170 /* GetAccessor */;
var otherAccessor = ts.getDeclarationOfKind(getSymbolOfNode(node), otherKind);
markDecoratorMedataDataTypeNodeAsReferenced(getAnnotatedAccessorTypeNode(node) || otherAccessor && getAnnotatedAccessorTypeNode(otherAccessor));
break;
case 167 /* MethodDeclaration */:
for (var _b = 0, _c = node.parameters; _b < _c.length; _b++) {
var parameter = _c[_b];
markDecoratorMedataDataTypeNodeAsReferenced(getParameterTypeNodeForDecoratorCheck(parameter));
}
markDecoratorMedataDataTypeNodeAsReferenced(ts.getEffectiveReturnTypeNode(node));
break;
case 165 /* PropertyDeclaration */:
markDecoratorMedataDataTypeNodeAsReferenced(ts.getEffectiveTypeAnnotationNode(node));
break;
case 162 /* Parameter */:
markDecoratorMedataDataTypeNodeAsReferenced(getParameterTypeNodeForDecoratorCheck(node));
var containingSignature = node.parent;
for (var _d = 0, _e = containingSignature.parameters; _d < _e.length; _d++) {
var parameter = _e[_d];
markDecoratorMedataDataTypeNodeAsReferenced(getParameterTypeNodeForDecoratorCheck(parameter));
}
break;
}
}
ts.forEach(node.decorators, checkDecorator);
}
function checkFunctionDeclaration(node) {
if (produceDiagnostics) {
checkFunctionOrMethodDeclaration(node);
checkGrammarForGenerator(node);
checkCollisionsForDeclarationName(node, node.name);
}
}
function checkJSDocTypeAliasTag(node) {
if (!node.typeExpression) {
// If the node had `@property` tags, `typeExpression` would have been set to the first property tag.
error(node.name, ts.Diagnostics.JSDoc_typedef_tag_should_either_have_a_type_annotation_or_be_followed_by_property_or_member_tags);
}
if (node.name) {
checkTypeNameIsReserved(node.name, ts.Diagnostics.Type_alias_name_cannot_be_0);
}
checkSourceElement(node.typeExpression);
}
function checkJSDocTemplateTag(node) {
checkSourceElement(node.constraint);
for (var _i = 0, _a = node.typeParameters; _i < _a.length; _i++) {
var tp = _a[_i];
checkSourceElement(tp);
}
}
function checkJSDocTypeTag(node) {
checkSourceElement(node.typeExpression);
}
function checkJSDocParameterTag(node) {
checkSourceElement(node.typeExpression);
if (!ts.getParameterSymbolFromJSDoc(node)) {
var decl = ts.getHostSignatureFromJSDoc(node);
// don't issue an error for invalid hosts -- just functions --
// and give a better error message when the host function mentions `arguments`
// but the tag doesn't have an array type
if (decl) {
var i = ts.getJSDocTags(decl).filter(ts.isJSDocParameterTag).indexOf(node);
if (i > -1 && i < decl.parameters.length && ts.isBindingPattern(decl.parameters[i].name)) {
return;
}
if (!containsArgumentsReference(decl)) {
if (ts.isQualifiedName(node.name)) {
error(node.name, ts.Diagnostics.Qualified_name_0_is_not_allowed_without_a_leading_param_object_1, ts.entityNameToString(node.name), ts.entityNameToString(node.name.left));
}
else {
error(node.name, ts.Diagnostics.JSDoc_param_tag_has_name_0_but_there_is_no_parameter_with_that_name, ts.idText(node.name));
}
}
else if (ts.findLast(ts.getJSDocTags(decl), ts.isJSDocParameterTag) === node &&
node.typeExpression && node.typeExpression.type &&
!isArrayType(getTypeFromTypeNode(node.typeExpression.type))) {
error(node.name, ts.Diagnostics.JSDoc_param_tag_has_name_0_but_there_is_no_parameter_with_that_name_It_would_match_arguments_if_it_had_an_array_type, ts.idText(node.name.kind === 159 /* QualifiedName */ ? node.name.right : node.name));
}
}
}
}
function checkJSDocPropertyTag(node) {
checkSourceElement(node.typeExpression);
}
function checkJSDocFunctionType(node) {
if (produceDiagnostics && !node.type && !ts.isJSDocConstructSignature(node)) {
reportImplicitAny(node, anyType);
}
checkSignatureDeclaration(node);
}
function checkJSDocImplementsTag(node) {
var classLike = ts.getEffectiveJSDocHost(node);
if (!classLike || !ts.isClassDeclaration(classLike) && !ts.isClassExpression(classLike)) {
error(classLike, ts.Diagnostics.JSDoc_0_is_not_attached_to_a_class, ts.idText(node.tagName));
}
}
function checkJSDocAugmentsTag(node) {
var classLike = ts.getEffectiveJSDocHost(node);
if (!classLike || !ts.isClassDeclaration(classLike) && !ts.isClassExpression(classLike)) {
error(classLike, ts.Diagnostics.JSDoc_0_is_not_attached_to_a_class, ts.idText(node.tagName));
return;
}
var augmentsTags = ts.getJSDocTags(classLike).filter(ts.isJSDocAugmentsTag);
ts.Debug.assert(augmentsTags.length > 0);
if (augmentsTags.length > 1) {
error(augmentsTags[1], ts.Diagnostics.Class_declarations_cannot_have_more_than_one_augments_or_extends_tag);
}
var name = getIdentifierFromEntityNameExpression(node.class.expression);
var extend = ts.getClassExtendsHeritageElement(classLike);
if (extend) {
var className = getIdentifierFromEntityNameExpression(extend.expression);
if (className && name.escapedText !== className.escapedText) {
error(name, ts.Diagnostics.JSDoc_0_1_does_not_match_the_extends_2_clause, ts.idText(node.tagName), ts.idText(name), ts.idText(className));
}
}
}
function getIdentifierFromEntityNameExpression(node) {
switch (node.kind) {
case 79 /* Identifier */:
return node;
case 204 /* PropertyAccessExpression */:
return node.name;
default:
return undefined;
}
}
function checkFunctionOrMethodDeclaration(node) {
var _a;
checkDecorators(node);
checkSignatureDeclaration(node);
var functionFlags = ts.getFunctionFlags(node);
// Do not use hasDynamicName here, because that returns false for well known symbols.
// We want to perform checkComputedPropertyName for all computed properties, including
// well known symbols.
if (node.name && node.name.kind === 160 /* ComputedPropertyName */) {
// This check will account for methods in class/interface declarations,
// as well as accessors in classes/object literals
checkComputedPropertyName(node.name);
}
if (hasBindableName(node)) {
// first we want to check the local symbol that contain this declaration
// - if node.localSymbol !== undefined - this is current declaration is exported and localSymbol points to the local symbol
// - if node.localSymbol === undefined - this node is non-exported so we can just pick the result of getSymbolOfNode
var symbol = getSymbolOfNode(node);
var localSymbol = node.localSymbol || symbol;
// Since the javascript won't do semantic analysis like typescript,
// if the javascript file comes before the typescript file and both contain same name functions,
// checkFunctionOrConstructorSymbol wouldn't be called if we didnt ignore javascript function.
var firstDeclaration = (_a = localSymbol.declarations) === null || _a === void 0 ? void 0 : _a.find(
// Get first non javascript function declaration
function (declaration) { return declaration.kind === node.kind && !(declaration.flags & 131072 /* JavaScriptFile */); });
// Only type check the symbol once
if (node === firstDeclaration) {
checkFunctionOrConstructorSymbol(localSymbol);
}
if (symbol.parent) {
// run check on export symbol to check that modifiers agree across all exported declarations
checkFunctionOrConstructorSymbol(symbol);
}
}
var body = node.kind === 166 /* MethodSignature */ ? undefined : node.body;
checkSourceElement(body);
checkAllCodePathsInNonVoidFunctionReturnOrThrow(node, getReturnTypeFromAnnotation(node));
if (produceDiagnostics && !ts.getEffectiveReturnTypeNode(node)) {
// Report an implicit any error if there is no body, no explicit return type, and node is not a private method
// in an ambient context
if (ts.nodeIsMissing(body) && !isPrivateWithinAmbient(node)) {
reportImplicitAny(node, anyType);
}
if (functionFlags & 1 /* Generator */ && ts.nodeIsPresent(body)) {
// A generator with a body and no type annotation can still cause errors. It can error if the
// yielded values have no common supertype, or it can give an implicit any error if it has no
// yielded values. The only way to trigger these errors is to try checking its return type.
getReturnTypeOfSignature(getSignatureFromDeclaration(node));
}
}
// A js function declaration can have a @type tag instead of a return type node, but that type must have a call signature
if (ts.isInJSFile(node)) {
var typeTag = ts.getJSDocTypeTag(node);
if (typeTag && typeTag.typeExpression && !getContextualCallSignature(getTypeFromTypeNode(typeTag.typeExpression), node)) {
error(typeTag.typeExpression.type, ts.Diagnostics.The_type_of_a_function_declaration_must_match_the_function_s_signature);
}
}
}
function registerForUnusedIdentifiersCheck(node) {
// May be in a call such as getTypeOfNode that happened to call this. But potentiallyUnusedIdentifiers is only defined in the scope of `checkSourceFile`.
if (produceDiagnostics) {
var sourceFile = ts.getSourceFileOfNode(node);
var potentiallyUnusedIdentifiers = allPotentiallyUnusedIdentifiers.get(sourceFile.path);
if (!potentiallyUnusedIdentifiers) {
potentiallyUnusedIdentifiers = [];
allPotentiallyUnusedIdentifiers.set(sourceFile.path, potentiallyUnusedIdentifiers);
}
// TODO: GH#22580
// Debug.assert(addToSeen(seenPotentiallyUnusedIdentifiers, getNodeId(node)), "Adding potentially-unused identifier twice");
potentiallyUnusedIdentifiers.push(node);
}
}
function checkUnusedIdentifiers(potentiallyUnusedIdentifiers, addDiagnostic) {
for (var _i = 0, potentiallyUnusedIdentifiers_1 = potentiallyUnusedIdentifiers; _i < potentiallyUnusedIdentifiers_1.length; _i++) {
var node = potentiallyUnusedIdentifiers_1[_i];
switch (node.kind) {
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
checkUnusedClassMembers(node, addDiagnostic);
checkUnusedTypeParameters(node, addDiagnostic);
break;
case 300 /* SourceFile */:
case 259 /* ModuleDeclaration */:
case 233 /* Block */:
case 261 /* CaseBlock */:
case 240 /* ForStatement */:
case 241 /* ForInStatement */:
case 242 /* ForOfStatement */:
checkUnusedLocalsAndParameters(node, addDiagnostic);
break;
case 169 /* Constructor */:
case 211 /* FunctionExpression */:
case 254 /* FunctionDeclaration */:
case 212 /* ArrowFunction */:
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
if (node.body) { // Don't report unused parameters in overloads
checkUnusedLocalsAndParameters(node, addDiagnostic);
}
checkUnusedTypeParameters(node, addDiagnostic);
break;
case 166 /* MethodSignature */:
case 172 /* CallSignature */:
case 173 /* ConstructSignature */:
case 177 /* FunctionType */:
case 178 /* ConstructorType */:
case 257 /* TypeAliasDeclaration */:
case 256 /* InterfaceDeclaration */:
checkUnusedTypeParameters(node, addDiagnostic);
break;
case 188 /* InferType */:
checkUnusedInferTypeParameter(node, addDiagnostic);
break;
default:
ts.Debug.assertNever(node, "Node should not have been registered for unused identifiers check");
}
}
}
function errorUnusedLocal(declaration, name, addDiagnostic) {
var node = ts.getNameOfDeclaration(declaration) || declaration;
var message = isTypeDeclaration(declaration) ? ts.Diagnostics._0_is_declared_but_never_used : ts.Diagnostics._0_is_declared_but_its_value_is_never_read;
addDiagnostic(declaration, 0 /* Local */, ts.createDiagnosticForNode(node, message, name));
}
function isIdentifierThatStartsWithUnderscore(node) {
return ts.isIdentifier(node) && ts.idText(node).charCodeAt(0) === 95 /* _ */;
}
function checkUnusedClassMembers(node, addDiagnostic) {
for (var _i = 0, _a = node.members; _i < _a.length; _i++) {
var member = _a[_i];
switch (member.kind) {
case 167 /* MethodDeclaration */:
case 165 /* PropertyDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
if (member.kind === 171 /* SetAccessor */ && member.symbol.flags & 32768 /* GetAccessor */) {
// Already would have reported an error on the getter.
break;
}
var symbol = getSymbolOfNode(member);
if (!symbol.isReferenced
&& (ts.hasEffectiveModifier(member, 8 /* Private */) || ts.isNamedDeclaration(member) && ts.isPrivateIdentifier(member.name))
&& !(member.flags & 8388608 /* Ambient */)) {
addDiagnostic(member, 0 /* Local */, ts.createDiagnosticForNode(member.name, ts.Diagnostics._0_is_declared_but_its_value_is_never_read, symbolToString(symbol)));
}
break;
case 169 /* Constructor */:
for (var _b = 0, _c = member.parameters; _b < _c.length; _b++) {
var parameter = _c[_b];
if (!parameter.symbol.isReferenced && ts.hasSyntacticModifier(parameter, 8 /* Private */)) {
addDiagnostic(parameter, 0 /* Local */, ts.createDiagnosticForNode(parameter.name, ts.Diagnostics.Property_0_is_declared_but_its_value_is_never_read, ts.symbolName(parameter.symbol)));
}
}
break;
case 174 /* IndexSignature */:
case 232 /* SemicolonClassElement */:
case 168 /* ClassStaticBlockDeclaration */:
// Can't be private
break;
default:
ts.Debug.fail("Unexpected class member");
}
}
}
function checkUnusedInferTypeParameter(node, addDiagnostic) {
var typeParameter = node.typeParameter;
if (isTypeParameterUnused(typeParameter)) {
addDiagnostic(node, 1 /* Parameter */, ts.createDiagnosticForNode(node, ts.Diagnostics._0_is_declared_but_its_value_is_never_read, ts.idText(typeParameter.name)));
}
}
function checkUnusedTypeParameters(node, addDiagnostic) {
// Only report errors on the last declaration for the type parameter container;
// this ensures that all uses have been accounted for.
var declarations = getSymbolOfNode(node).declarations;
if (!declarations || ts.last(declarations) !== node)
return;
var typeParameters = ts.getEffectiveTypeParameterDeclarations(node);
var seenParentsWithEveryUnused = new ts.Set();
for (var _i = 0, typeParameters_3 = typeParameters; _i < typeParameters_3.length; _i++) {
var typeParameter = typeParameters_3[_i];
if (!isTypeParameterUnused(typeParameter))
continue;
var name = ts.idText(typeParameter.name);
var parent = typeParameter.parent;
if (parent.kind !== 188 /* InferType */ && parent.typeParameters.every(isTypeParameterUnused)) {
if (ts.tryAddToSet(seenParentsWithEveryUnused, parent)) {
var sourceFile = ts.getSourceFileOfNode(parent);
var range = ts.isJSDocTemplateTag(parent)
// Whole @template tag
? ts.rangeOfNode(parent)
// Include the `<>` in the error message
: ts.rangeOfTypeParameters(sourceFile, parent.typeParameters);
var only = parent.typeParameters.length === 1;
//TODO: following line is possible reason for bug #41974, unusedTypeParameters_TemplateTag
var message = only ? ts.Diagnostics._0_is_declared_but_its_value_is_never_read : ts.Diagnostics.All_type_parameters_are_unused;
var arg0 = only ? name : undefined;
addDiagnostic(typeParameter, 1 /* Parameter */, ts.createFileDiagnostic(sourceFile, range.pos, range.end - range.pos, message, arg0));
}
}
else {
//TODO: following line is possible reason for bug #41974, unusedTypeParameters_TemplateTag
addDiagnostic(typeParameter, 1 /* Parameter */, ts.createDiagnosticForNode(typeParameter, ts.Diagnostics._0_is_declared_but_its_value_is_never_read, name));
}
}
}
function isTypeParameterUnused(typeParameter) {
return !(getMergedSymbol(typeParameter.symbol).isReferenced & 262144 /* TypeParameter */) && !isIdentifierThatStartsWithUnderscore(typeParameter.name);
}
function addToGroup(map, key, value, getKey) {
var keyString = String(getKey(key));
var group = map.get(keyString);
if (group) {
group[1].push(value);
}
else {
map.set(keyString, [key, [value]]);
}
}
function tryGetRootParameterDeclaration(node) {
return ts.tryCast(ts.getRootDeclaration(node), ts.isParameter);
}
function isValidUnusedLocalDeclaration(declaration) {
if (ts.isBindingElement(declaration)) {
if (ts.isObjectBindingPattern(declaration.parent)) {
/**
* ignore starts with underscore names _
* const { a: _a } = { a: 1 }
*/
return !!(declaration.propertyName && isIdentifierThatStartsWithUnderscore(declaration.name));
}
return isIdentifierThatStartsWithUnderscore(declaration.name);
}
return ts.isAmbientModule(declaration) ||
(ts.isVariableDeclaration(declaration) && ts.isForInOrOfStatement(declaration.parent.parent) || isImportedDeclaration(declaration)) && isIdentifierThatStartsWithUnderscore(declaration.name);
}
function checkUnusedLocalsAndParameters(nodeWithLocals, addDiagnostic) {
// Ideally we could use the ImportClause directly as a key, but must wait until we have full ES6 maps. So must store key along with value.
var unusedImports = new ts.Map();
var unusedDestructures = new ts.Map();
var unusedVariables = new ts.Map();
nodeWithLocals.locals.forEach(function (local) {
// If it's purely a type parameter, ignore, will be checked in `checkUnusedTypeParameters`.
// If it's a type parameter merged with a parameter, check if the parameter-side is used.
if (local.flags & 262144 /* TypeParameter */ ? !(local.flags & 3 /* Variable */ && !(local.isReferenced & 3 /* Variable */)) : local.isReferenced || local.exportSymbol) {
return;
}
if (local.declarations) {
for (var _i = 0, _a = local.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
if (isValidUnusedLocalDeclaration(declaration)) {
continue;
}
if (isImportedDeclaration(declaration)) {
addToGroup(unusedImports, importClauseFromImported(declaration), declaration, getNodeId);
}
else if (ts.isBindingElement(declaration) && ts.isObjectBindingPattern(declaration.parent)) {
// In `{ a, ...b }, `a` is considered used since it removes a property from `b`. `b` may still be unused though.
var lastElement = ts.last(declaration.parent.elements);
if (declaration === lastElement || !ts.last(declaration.parent.elements).dotDotDotToken) {
addToGroup(unusedDestructures, declaration.parent, declaration, getNodeId);
}
}
else if (ts.isVariableDeclaration(declaration)) {
addToGroup(unusedVariables, declaration.parent, declaration, getNodeId);
}
else {
var parameter = local.valueDeclaration && tryGetRootParameterDeclaration(local.valueDeclaration);
var name = local.valueDeclaration && ts.getNameOfDeclaration(local.valueDeclaration);
if (parameter && name) {
if (!ts.isParameterPropertyDeclaration(parameter, parameter.parent) && !ts.parameterIsThisKeyword(parameter) && !isIdentifierThatStartsWithUnderscore(name)) {
if (ts.isBindingElement(declaration) && ts.isArrayBindingPattern(declaration.parent)) {
addToGroup(unusedDestructures, declaration.parent, declaration, getNodeId);
}
else {
addDiagnostic(parameter, 1 /* Parameter */, ts.createDiagnosticForNode(name, ts.Diagnostics._0_is_declared_but_its_value_is_never_read, ts.symbolName(local)));
}
}
}
else {
errorUnusedLocal(declaration, ts.symbolName(local), addDiagnostic);
}
}
}
}
});
unusedImports.forEach(function (_a) {
var importClause = _a[0], unuseds = _a[1];
var importDecl = importClause.parent;
var nDeclarations = (importClause.name ? 1 : 0) +
(importClause.namedBindings ?
(importClause.namedBindings.kind === 266 /* NamespaceImport */ ? 1 : importClause.namedBindings.elements.length)
: 0);
if (nDeclarations === unuseds.length) {
addDiagnostic(importDecl, 0 /* Local */, unuseds.length === 1
? ts.createDiagnosticForNode(importDecl, ts.Diagnostics._0_is_declared_but_its_value_is_never_read, ts.idText(ts.first(unuseds).name))
: ts.createDiagnosticForNode(importDecl, ts.Diagnostics.All_imports_in_import_declaration_are_unused));
}
else {
for (var _i = 0, unuseds_1 = unuseds; _i < unuseds_1.length; _i++) {
var unused = unuseds_1[_i];
errorUnusedLocal(unused, ts.idText(unused.name), addDiagnostic);
}
}
});
unusedDestructures.forEach(function (_a) {
var bindingPattern = _a[0], bindingElements = _a[1];
var kind = tryGetRootParameterDeclaration(bindingPattern.parent) ? 1 /* Parameter */ : 0 /* Local */;
if (bindingPattern.elements.length === bindingElements.length) {
if (bindingElements.length === 1 && bindingPattern.parent.kind === 252 /* VariableDeclaration */ && bindingPattern.parent.parent.kind === 253 /* VariableDeclarationList */) {
addToGroup(unusedVariables, bindingPattern.parent.parent, bindingPattern.parent, getNodeId);
}
else {
addDiagnostic(bindingPattern, kind, bindingElements.length === 1
? ts.createDiagnosticForNode(bindingPattern, ts.Diagnostics._0_is_declared_but_its_value_is_never_read, bindingNameText(ts.first(bindingElements).name))
: ts.createDiagnosticForNode(bindingPattern, ts.Diagnostics.All_destructured_elements_are_unused));
}
}
else {
for (var _i = 0, bindingElements_1 = bindingElements; _i < bindingElements_1.length; _i++) {
var e = bindingElements_1[_i];
addDiagnostic(e, kind, ts.createDiagnosticForNode(e, ts.Diagnostics._0_is_declared_but_its_value_is_never_read, bindingNameText(e.name)));
}
}
});
unusedVariables.forEach(function (_a) {
var declarationList = _a[0], declarations = _a[1];
if (declarationList.declarations.length === declarations.length) {
addDiagnostic(declarationList, 0 /* Local */, declarations.length === 1
? ts.createDiagnosticForNode(ts.first(declarations).name, ts.Diagnostics._0_is_declared_but_its_value_is_never_read, bindingNameText(ts.first(declarations).name))
: ts.createDiagnosticForNode(declarationList.parent.kind === 235 /* VariableStatement */ ? declarationList.parent : declarationList, ts.Diagnostics.All_variables_are_unused));
}
else {
for (var _i = 0, declarations_5 = declarations; _i < declarations_5.length; _i++) {
var decl = declarations_5[_i];
addDiagnostic(decl, 0 /* Local */, ts.createDiagnosticForNode(decl, ts.Diagnostics._0_is_declared_but_its_value_is_never_read, bindingNameText(decl.name)));
}
}
});
}
function bindingNameText(name) {
switch (name.kind) {
case 79 /* Identifier */:
return ts.idText(name);
case 200 /* ArrayBindingPattern */:
case 199 /* ObjectBindingPattern */:
return bindingNameText(ts.cast(ts.first(name.elements), ts.isBindingElement).name);
default:
return ts.Debug.assertNever(name);
}
}
function isImportedDeclaration(node) {
return node.kind === 265 /* ImportClause */ || node.kind === 268 /* ImportSpecifier */ || node.kind === 266 /* NamespaceImport */;
}
function importClauseFromImported(decl) {
return decl.kind === 265 /* ImportClause */ ? decl : decl.kind === 266 /* NamespaceImport */ ? decl.parent : decl.parent.parent;
}
function checkBlock(node) {
// Grammar checking for SyntaxKind.Block
if (node.kind === 233 /* Block */) {
checkGrammarStatementInAmbientContext(node);
}
if (ts.isFunctionOrModuleBlock(node)) {
var saveFlowAnalysisDisabled = flowAnalysisDisabled;
ts.forEach(node.statements, checkSourceElement);
flowAnalysisDisabled = saveFlowAnalysisDisabled;
}
else {
ts.forEach(node.statements, checkSourceElement);
}
if (node.locals) {
registerForUnusedIdentifiersCheck(node);
}
}
function checkCollisionWithArgumentsInGeneratedCode(node) {
// no rest parameters \ declaration context \ overload - no codegen impact
if (languageVersion >= 2 /* ES2015 */ || !ts.hasRestParameter(node) || node.flags & 8388608 /* Ambient */ || ts.nodeIsMissing(node.body)) {
return;
}
ts.forEach(node.parameters, function (p) {
if (p.name && !ts.isBindingPattern(p.name) && p.name.escapedText === argumentsSymbol.escapedName) {
errorSkippedOn("noEmit", p, ts.Diagnostics.Duplicate_identifier_arguments_Compiler_uses_arguments_to_initialize_rest_parameters);
}
});
}
/**
* Checks whether an {@link Identifier}, in the context of another {@link Node}, would collide with a runtime value
* of {@link name} in an outer scope. This is used to check for collisions for downlevel transformations that
* require names like `Object`, `Promise`, `Reflect`, `require`, `exports`, etc.
*/
function needCollisionCheckForIdentifier(node, identifier, name) {
if ((identifier === null || identifier === void 0 ? void 0 : identifier.escapedText) !== name) {
return false;
}
if (node.kind === 165 /* PropertyDeclaration */ ||
node.kind === 164 /* PropertySignature */ ||
node.kind === 167 /* MethodDeclaration */ ||
node.kind === 166 /* MethodSignature */ ||
node.kind === 170 /* GetAccessor */ ||
node.kind === 171 /* SetAccessor */ ||
node.kind === 291 /* PropertyAssignment */) {
// it is ok to have member named '_super', '_this', `Promise`, etc. - member access is always qualified
return false;
}
if (node.flags & 8388608 /* Ambient */) {
// ambient context - no codegen impact
return false;
}
if (ts.isImportClause(node) || ts.isImportEqualsDeclaration(node) || ts.isImportSpecifier(node)) {
// type-only imports do not require collision checks against runtime values.
if (ts.isTypeOnlyImportOrExportDeclaration(node)) {
return false;
}
}
var root = ts.getRootDeclaration(node);
if (ts.isParameter(root) && ts.nodeIsMissing(root.parent.body)) {
// just an overload - no codegen impact
return false;
}
return true;
}
// this function will run after checking the source file so 'CaptureThis' is correct for all nodes
function checkIfThisIsCapturedInEnclosingScope(node) {
ts.findAncestor(node, function (current) {
if (getNodeCheckFlags(current) & 4 /* CaptureThis */) {
var isDeclaration_1 = node.kind !== 79 /* Identifier */;
if (isDeclaration_1) {
error(ts.getNameOfDeclaration(node), ts.Diagnostics.Duplicate_identifier_this_Compiler_uses_variable_declaration_this_to_capture_this_reference);
}
else {
error(node, ts.Diagnostics.Expression_resolves_to_variable_declaration_this_that_compiler_uses_to_capture_this_reference);
}
return true;
}
return false;
});
}
function checkIfNewTargetIsCapturedInEnclosingScope(node) {
ts.findAncestor(node, function (current) {
if (getNodeCheckFlags(current) & 8 /* CaptureNewTarget */) {
var isDeclaration_2 = node.kind !== 79 /* Identifier */;
if (isDeclaration_2) {
error(ts.getNameOfDeclaration(node), ts.Diagnostics.Duplicate_identifier_newTarget_Compiler_uses_variable_declaration_newTarget_to_capture_new_target_meta_property_reference);
}
else {
error(node, ts.Diagnostics.Expression_resolves_to_variable_declaration_newTarget_that_compiler_uses_to_capture_new_target_meta_property_reference);
}
return true;
}
return false;
});
}
function checkCollisionWithRequireExportsInGeneratedCode(node, name) {
// No need to check for require or exports for ES6 modules and later
if (moduleKind >= ts.ModuleKind.ES2015) {
return;
}
if (!name || !needCollisionCheckForIdentifier(node, name, "require") && !needCollisionCheckForIdentifier(node, name, "exports")) {
return;
}
// Uninstantiated modules shouldnt do this check
if (ts.isModuleDeclaration(node) && ts.getModuleInstanceState(node) !== 1 /* Instantiated */) {
return;
}
// In case of variable declaration, node.parent is variable statement so look at the variable statement's parent
var parent = getDeclarationContainer(node);
if (parent.kind === 300 /* SourceFile */ && ts.isExternalOrCommonJsModule(parent)) {
// If the declaration happens to be in external module, report error that require and exports are reserved keywords
errorSkippedOn("noEmit", name, ts.Diagnostics.Duplicate_identifier_0_Compiler_reserves_name_1_in_top_level_scope_of_a_module, ts.declarationNameToString(name), ts.declarationNameToString(name));
}
}
function checkCollisionWithGlobalPromiseInGeneratedCode(node, name) {
if (!name || languageVersion >= 4 /* ES2017 */ || !needCollisionCheckForIdentifier(node, name, "Promise")) {
return;
}
// Uninstantiated modules shouldnt do this check
if (ts.isModuleDeclaration(node) && ts.getModuleInstanceState(node) !== 1 /* Instantiated */) {
return;
}
// In case of variable declaration, node.parent is variable statement so look at the variable statement's parent
var parent = getDeclarationContainer(node);
if (parent.kind === 300 /* SourceFile */ && ts.isExternalOrCommonJsModule(parent) && parent.flags & 2048 /* HasAsyncFunctions */) {
// If the declaration happens to be in external module, report error that Promise is a reserved identifier.
errorSkippedOn("noEmit", name, ts.Diagnostics.Duplicate_identifier_0_Compiler_reserves_name_1_in_top_level_scope_of_a_module_containing_async_functions, ts.declarationNameToString(name), ts.declarationNameToString(name));
}
}
function recordPotentialCollisionWithWeakMapSetInGeneratedCode(node, name) {
if (languageVersion <= 8 /* ES2021 */
&& (needCollisionCheckForIdentifier(node, name, "WeakMap") || needCollisionCheckForIdentifier(node, name, "WeakSet"))) {
potentialWeakMapSetCollisions.push(node);
}
}
function checkWeakMapSetCollision(node) {
var enclosingBlockScope = ts.getEnclosingBlockScopeContainer(node);
if (getNodeCheckFlags(enclosingBlockScope) & 67108864 /* ContainsClassWithPrivateIdentifiers */) {
ts.Debug.assert(ts.isNamedDeclaration(node) && ts.isIdentifier(node.name) && typeof node.name.escapedText === "string", "The target of a WeakMap/WeakSet collision check should be an identifier");
errorSkippedOn("noEmit", node, ts.Diagnostics.Compiler_reserves_name_0_when_emitting_private_identifier_downlevel, node.name.escapedText);
}
}
function recordPotentialCollisionWithReflectInGeneratedCode(node, name) {
if (name && languageVersion >= 2 /* ES2015 */ && languageVersion <= 8 /* ES2021 */
&& needCollisionCheckForIdentifier(node, name, "Reflect")) {
potentialReflectCollisions.push(node);
}
}
function checkReflectCollision(node) {
var hasCollision = false;
if (ts.isClassExpression(node)) {
// ClassExpression names don't contribute to their containers, but do matter for any of their block-scoped members.
for (var _i = 0, _a = node.members; _i < _a.length; _i++) {
var member = _a[_i];
if (getNodeCheckFlags(member) & 134217728 /* ContainsSuperPropertyInStaticInitializer */) {
hasCollision = true;
break;
}
}
}
else if (ts.isFunctionExpression(node)) {
// FunctionExpression names don't contribute to their containers, but do matter for their contents
if (getNodeCheckFlags(node) & 134217728 /* ContainsSuperPropertyInStaticInitializer */) {
hasCollision = true;
}
}
else {
var container = ts.getEnclosingBlockScopeContainer(node);
if (container && getNodeCheckFlags(container) & 134217728 /* ContainsSuperPropertyInStaticInitializer */) {
hasCollision = true;
}
}
if (hasCollision) {
ts.Debug.assert(ts.isNamedDeclaration(node) && ts.isIdentifier(node.name), "The target of a Reflect collision check should be an identifier");
errorSkippedOn("noEmit", node, ts.Diagnostics.Duplicate_identifier_0_Compiler_reserves_name_1_when_emitting_super_references_in_static_initializers, ts.declarationNameToString(node.name), "Reflect");
}
}
function checkCollisionsForDeclarationName(node, name) {
if (!name)
return;
checkCollisionWithRequireExportsInGeneratedCode(node, name);
checkCollisionWithGlobalPromiseInGeneratedCode(node, name);
recordPotentialCollisionWithWeakMapSetInGeneratedCode(node, name);
recordPotentialCollisionWithReflectInGeneratedCode(node, name);
if (ts.isClassLike(node)) {
checkTypeNameIsReserved(name, ts.Diagnostics.Class_name_cannot_be_0);
if (!(node.flags & 8388608 /* Ambient */)) {
checkClassNameCollisionWithObject(name);
}
}
else if (ts.isEnumDeclaration(node)) {
checkTypeNameIsReserved(name, ts.Diagnostics.Enum_name_cannot_be_0);
}
}
function checkVarDeclaredNamesNotShadowed(node) {
// - ScriptBody : StatementList
// It is a Syntax Error if any element of the LexicallyDeclaredNames of StatementList
// also occurs in the VarDeclaredNames of StatementList.
// - Block : { StatementList }
// It is a Syntax Error if any element of the LexicallyDeclaredNames of StatementList
// also occurs in the VarDeclaredNames of StatementList.
// Variable declarations are hoisted to the top of their function scope. They can shadow
// block scoped declarations, which bind tighter. this will not be flagged as duplicate definition
// by the binder as the declaration scope is different.
// A non-initialized declaration is a no-op as the block declaration will resolve before the var
// declaration. the problem is if the declaration has an initializer. this will act as a write to the
// block declared value. this is fine for let, but not const.
// Only consider declarations with initializers, uninitialized const declarations will not
// step on a let/const variable.
// Do not consider const and const declarations, as duplicate block-scoped declarations
// are handled by the binder.
// We are only looking for const declarations that step on let\const declarations from a
// different scope. e.g.:
// {
// const x = 0; // localDeclarationSymbol obtained after name resolution will correspond to this declaration
// const x = 0; // symbol for this declaration will be 'symbol'
// }
// skip block-scoped variables and parameters
if ((ts.getCombinedNodeFlags(node) & 3 /* BlockScoped */) !== 0 || ts.isParameterDeclaration(node)) {
return;
}
// skip variable declarations that don't have initializers
// NOTE: in ES6 spec initializer is required in variable declarations where name is binding pattern
// so we'll always treat binding elements as initialized
if (node.kind === 252 /* VariableDeclaration */ && !node.initializer) {
return;
}
var symbol = getSymbolOfNode(node);
if (symbol.flags & 1 /* FunctionScopedVariable */) {
if (!ts.isIdentifier(node.name))
return ts.Debug.fail();
var localDeclarationSymbol = resolveName(node, node.name.escapedText, 3 /* Variable */, /*nodeNotFoundErrorMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ false);
if (localDeclarationSymbol &&
localDeclarationSymbol !== symbol &&
localDeclarationSymbol.flags & 2 /* BlockScopedVariable */) {
if (getDeclarationNodeFlagsFromSymbol(localDeclarationSymbol) & 3 /* BlockScoped */) {
var varDeclList = ts.getAncestor(localDeclarationSymbol.valueDeclaration, 253 /* VariableDeclarationList */);
var container = varDeclList.parent.kind === 235 /* VariableStatement */ && varDeclList.parent.parent
? varDeclList.parent.parent
: undefined;
// names of block-scoped and function scoped variables can collide only
// if block scoped variable is defined in the function\module\source file scope (because of variable hoisting)
var namesShareScope = container &&
(container.kind === 233 /* Block */ && ts.isFunctionLike(container.parent) ||
container.kind === 260 /* ModuleBlock */ ||
container.kind === 259 /* ModuleDeclaration */ ||
container.kind === 300 /* SourceFile */);
// here we know that function scoped variable is shadowed by block scoped one
// if they are defined in the same scope - binder has already reported redeclaration error
// otherwise if variable has an initializer - show error that initialization will fail
// since LHS will be block scoped name instead of function scoped
if (!namesShareScope) {
var name = symbolToString(localDeclarationSymbol);
error(node, ts.Diagnostics.Cannot_initialize_outer_scoped_variable_0_in_the_same_scope_as_block_scoped_declaration_1, name, name);
}
}
}
}
}
function convertAutoToAny(type) {
return type === autoType ? anyType : type === autoArrayType ? anyArrayType : type;
}
// Check variable, parameter, or property declaration
function checkVariableLikeDeclaration(node) {
var _a;
checkDecorators(node);
if (!ts.isBindingElement(node)) {
checkSourceElement(node.type);
}
// JSDoc `function(string, string): string` syntax results in parameters with no name
if (!node.name) {
return;
}
// For a computed property, just check the initializer and exit
// Do not use hasDynamicName here, because that returns false for well known symbols.
// We want to perform checkComputedPropertyName for all computed properties, including
// well known symbols.
if (node.name.kind === 160 /* ComputedPropertyName */) {
checkComputedPropertyName(node.name);
if (node.initializer) {
checkExpressionCached(node.initializer);
}
}
if (ts.isBindingElement(node)) {
if (ts.isObjectBindingPattern(node.parent) && node.dotDotDotToken && languageVersion < 5 /* ES2018 */) {
checkExternalEmitHelpers(node, 4 /* Rest */);
}
// check computed properties inside property names of binding elements
if (node.propertyName && node.propertyName.kind === 160 /* ComputedPropertyName */) {
checkComputedPropertyName(node.propertyName);
}
// check private/protected variable access
var parent = node.parent.parent;
var parentType = getTypeForBindingElementParent(parent);
var name = node.propertyName || node.name;
if (parentType && !ts.isBindingPattern(name)) {
var exprType = getLiteralTypeFromPropertyName(name);
if (isTypeUsableAsPropertyName(exprType)) {
var nameText = getPropertyNameFromType(exprType);
var property = getPropertyOfType(parentType, nameText);
if (property) {
markPropertyAsReferenced(property, /*nodeForCheckWriteOnly*/ undefined, /*isSelfTypeAccess*/ false); // A destructuring is never a write-only reference.
checkPropertyAccessibility(node, !!parent.initializer && parent.initializer.kind === 106 /* SuperKeyword */, /*writing*/ false, parentType, property);
}
}
}
}
// For a binding pattern, check contained binding elements
if (ts.isBindingPattern(node.name)) {
if (node.name.kind === 200 /* ArrayBindingPattern */ && languageVersion < 2 /* ES2015 */ && compilerOptions.downlevelIteration) {
checkExternalEmitHelpers(node, 512 /* Read */);
}
ts.forEach(node.name.elements, checkSourceElement);
}
// For a parameter declaration with an initializer, error and exit if the containing function doesn't have a body
if (node.initializer && ts.isParameterDeclaration(node) && ts.nodeIsMissing(ts.getContainingFunction(node).body)) {
error(node, ts.Diagnostics.A_parameter_initializer_is_only_allowed_in_a_function_or_constructor_implementation);
return;
}
// For a binding pattern, validate the initializer and exit
if (ts.isBindingPattern(node.name)) {
var needCheckInitializer = node.initializer && node.parent.parent.kind !== 241 /* ForInStatement */;
var needCheckWidenedType = node.name.elements.length === 0;
if (needCheckInitializer || needCheckWidenedType) {
// Don't validate for-in initializer as it is already an error
var widenedType = getWidenedTypeForVariableLikeDeclaration(node);
if (needCheckInitializer) {
var initializerType = checkExpressionCached(node.initializer);
if (strictNullChecks && needCheckWidenedType) {
checkNonNullNonVoidType(initializerType, node);
}
else {
checkTypeAssignableToAndOptionallyElaborate(initializerType, getWidenedTypeForVariableLikeDeclaration(node), node, node.initializer);
}
}
// check the binding pattern with empty elements
if (needCheckWidenedType) {
if (ts.isArrayBindingPattern(node.name)) {
checkIteratedTypeOrElementType(65 /* Destructuring */, widenedType, undefinedType, node);
}
else if (strictNullChecks) {
checkNonNullNonVoidType(widenedType, node);
}
}
}
return;
}
// For a commonjs `const x = require`, validate the alias and exit
var symbol = getSymbolOfNode(node);
if (symbol.flags & 2097152 /* Alias */ && ts.isRequireVariableDeclaration(node)) {
checkAliasSymbol(node);
return;
}
var type = convertAutoToAny(getTypeOfSymbol(symbol));
if (node === symbol.valueDeclaration) {
// Node is the primary declaration of the symbol, just validate the initializer
// Don't validate for-in initializer as it is already an error
var initializer = ts.getEffectiveInitializer(node);
if (initializer) {
var isJSObjectLiteralInitializer = ts.isInJSFile(node) &&
ts.isObjectLiteralExpression(initializer) &&
(initializer.properties.length === 0 || ts.isPrototypeAccess(node.name)) &&
!!((_a = symbol.exports) === null || _a === void 0 ? void 0 : _a.size);
if (!isJSObjectLiteralInitializer && node.parent.parent.kind !== 241 /* ForInStatement */) {
checkTypeAssignableToAndOptionallyElaborate(checkExpressionCached(initializer), type, node, initializer, /*headMessage*/ undefined);
}
}
if (symbol.declarations && symbol.declarations.length > 1) {
if (ts.some(symbol.declarations, function (d) { return d !== node && ts.isVariableLike(d) && !areDeclarationFlagsIdentical(d, node); })) {
error(node.name, ts.Diagnostics.All_declarations_of_0_must_have_identical_modifiers, ts.declarationNameToString(node.name));
}
}
}
else {
// Node is a secondary declaration, check that type is identical to primary declaration and check that
// initializer is consistent with type associated with the node
var declarationType = convertAutoToAny(getWidenedTypeForVariableLikeDeclaration(node));
if (type !== errorType && declarationType !== errorType &&
!isTypeIdenticalTo(type, declarationType) &&
!(symbol.flags & 67108864 /* Assignment */)) {
errorNextVariableOrPropertyDeclarationMustHaveSameType(symbol.valueDeclaration, type, node, declarationType);
}
if (node.initializer) {
checkTypeAssignableToAndOptionallyElaborate(checkExpressionCached(node.initializer), declarationType, node, node.initializer, /*headMessage*/ undefined);
}
if (symbol.valueDeclaration && !areDeclarationFlagsIdentical(node, symbol.valueDeclaration)) {
error(node.name, ts.Diagnostics.All_declarations_of_0_must_have_identical_modifiers, ts.declarationNameToString(node.name));
}
}
if (node.kind !== 165 /* PropertyDeclaration */ && node.kind !== 164 /* PropertySignature */) {
// We know we don't have a binding pattern or computed name here
checkExportsOnMergedDeclarations(node);
if (node.kind === 252 /* VariableDeclaration */ || node.kind === 201 /* BindingElement */) {
checkVarDeclaredNamesNotShadowed(node);
}
checkCollisionsForDeclarationName(node, node.name);
}
}
function errorNextVariableOrPropertyDeclarationMustHaveSameType(firstDeclaration, firstType, nextDeclaration, nextType) {
var nextDeclarationName = ts.getNameOfDeclaration(nextDeclaration);
var message = nextDeclaration.kind === 165 /* PropertyDeclaration */ || nextDeclaration.kind === 164 /* PropertySignature */
? ts.Diagnostics.Subsequent_property_declarations_must_have_the_same_type_Property_0_must_be_of_type_1_but_here_has_type_2
: ts.Diagnostics.Subsequent_variable_declarations_must_have_the_same_type_Variable_0_must_be_of_type_1_but_here_has_type_2;
var declName = ts.declarationNameToString(nextDeclarationName);
var err = error(nextDeclarationName, message, declName, typeToString(firstType), typeToString(nextType));
if (firstDeclaration) {
ts.addRelatedInfo(err, ts.createDiagnosticForNode(firstDeclaration, ts.Diagnostics._0_was_also_declared_here, declName));
}
}
function areDeclarationFlagsIdentical(left, right) {
if ((left.kind === 162 /* Parameter */ && right.kind === 252 /* VariableDeclaration */) ||
(left.kind === 252 /* VariableDeclaration */ && right.kind === 162 /* Parameter */)) {
// Differences in optionality between parameters and variables are allowed.
return true;
}
if (ts.hasQuestionToken(left) !== ts.hasQuestionToken(right)) {
return false;
}
var interestingFlags = 8 /* Private */ |
16 /* Protected */ |
256 /* Async */ |
128 /* Abstract */ |
64 /* Readonly */ |
32 /* Static */;
return ts.getSelectedEffectiveModifierFlags(left, interestingFlags) === ts.getSelectedEffectiveModifierFlags(right, interestingFlags);
}
function checkVariableDeclaration(node) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("check" /* Check */, "checkVariableDeclaration", { kind: node.kind, pos: node.pos, end: node.end });
checkGrammarVariableDeclaration(node);
checkVariableLikeDeclaration(node);
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
}
function checkBindingElement(node) {
checkGrammarBindingElement(node);
return checkVariableLikeDeclaration(node);
}
function checkVariableStatement(node) {
// Grammar checking
if (!checkGrammarDecoratorsAndModifiers(node) && !checkGrammarVariableDeclarationList(node.declarationList))
checkGrammarForDisallowedLetOrConstStatement(node);
ts.forEach(node.declarationList.declarations, checkSourceElement);
}
function checkExpressionStatement(node) {
// Grammar checking
checkGrammarStatementInAmbientContext(node);
checkExpression(node.expression);
}
function checkIfStatement(node) {
// Grammar checking
checkGrammarStatementInAmbientContext(node);
var type = checkTruthinessExpression(node.expression);
checkTestingKnownTruthyCallableOrAwaitableType(node.expression, type, node.thenStatement);
checkSourceElement(node.thenStatement);
if (node.thenStatement.kind === 234 /* EmptyStatement */) {
error(node.thenStatement, ts.Diagnostics.The_body_of_an_if_statement_cannot_be_the_empty_statement);
}
checkSourceElement(node.elseStatement);
}
function checkTestingKnownTruthyCallableOrAwaitableType(condExpr, type, body) {
if (!strictNullChecks)
return;
if (getFalsyFlags(type))
return;
var location = ts.isBinaryExpression(condExpr) ? condExpr.right : condExpr;
if (ts.isPropertyAccessExpression(location) && ts.isAssertionExpression(ts.skipParentheses(location.expression))) {
return;
}
var testedNode = ts.isIdentifier(location) ? location
: ts.isPropertyAccessExpression(location) ? location.name
: ts.isBinaryExpression(location) && ts.isIdentifier(location.right) ? location.right
: undefined;
// While it technically should be invalid for any known-truthy value
// to be tested, we de-scope to functions and Promises unreferenced in
// the block as a heuristic to identify the most common bugs. There
// are too many false positives for values sourced from type
// definitions without strictNullChecks otherwise.
var callSignatures = getSignaturesOfType(type, 0 /* Call */);
var isPromise = !!getAwaitedTypeOfPromise(type);
if (callSignatures.length === 0 && !isPromise) {
return;
}
var testedSymbol = testedNode && getSymbolAtLocation(testedNode);
if (!testedSymbol && !isPromise) {
return;
}
var isUsed = testedSymbol && ts.isBinaryExpression(condExpr.parent) && isSymbolUsedInBinaryExpressionChain(condExpr.parent, testedSymbol)
|| testedSymbol && body && isSymbolUsedInConditionBody(condExpr, body, testedNode, testedSymbol);
if (!isUsed) {
if (isPromise) {
errorAndMaybeSuggestAwait(location,
/*maybeMissingAwait*/ true, ts.Diagnostics.This_condition_will_always_return_true_since_this_0_is_always_defined, getTypeNameForErrorDisplay(type));
}
else {
error(location, ts.Diagnostics.This_condition_will_always_return_true_since_this_function_is_always_defined_Did_you_mean_to_call_it_instead);
}
}
}
function isSymbolUsedInConditionBody(expr, body, testedNode, testedSymbol) {
return !!ts.forEachChild(body, function check(childNode) {
if (ts.isIdentifier(childNode)) {
var childSymbol = getSymbolAtLocation(childNode);
if (childSymbol && childSymbol === testedSymbol) {
// If the test was a simple identifier, the above check is sufficient
if (ts.isIdentifier(expr)) {
return true;
}
// Otherwise we need to ensure the symbol is called on the same target
var testedExpression = testedNode.parent;
var childExpression = childNode.parent;
while (testedExpression && childExpression) {
if (ts.isIdentifier(testedExpression) && ts.isIdentifier(childExpression) ||
testedExpression.kind === 108 /* ThisKeyword */ && childExpression.kind === 108 /* ThisKeyword */) {
return getSymbolAtLocation(testedExpression) === getSymbolAtLocation(childExpression);
}
else if (ts.isPropertyAccessExpression(testedExpression) && ts.isPropertyAccessExpression(childExpression)) {
if (getSymbolAtLocation(testedExpression.name) !== getSymbolAtLocation(childExpression.name)) {
return false;
}
childExpression = childExpression.expression;
testedExpression = testedExpression.expression;
}
else if (ts.isCallExpression(testedExpression) && ts.isCallExpression(childExpression)) {
childExpression = childExpression.expression;
testedExpression = testedExpression.expression;
}
else {
return false;
}
}
}
}
return ts.forEachChild(childNode, check);
});
}
function isSymbolUsedInBinaryExpressionChain(node, testedSymbol) {
while (ts.isBinaryExpression(node) && node.operatorToken.kind === 55 /* AmpersandAmpersandToken */) {
var isUsed = ts.forEachChild(node.right, function visit(child) {
if (ts.isIdentifier(child)) {
var symbol = getSymbolAtLocation(child);
if (symbol && symbol === testedSymbol) {
return true;
}
}
return ts.forEachChild(child, visit);
});
if (isUsed) {
return true;
}
node = node.parent;
}
return false;
}
function checkDoStatement(node) {
// Grammar checking
checkGrammarStatementInAmbientContext(node);
checkSourceElement(node.statement);
checkTruthinessExpression(node.expression);
}
function checkWhileStatement(node) {
// Grammar checking
checkGrammarStatementInAmbientContext(node);
checkTruthinessExpression(node.expression);
checkSourceElement(node.statement);
}
function checkTruthinessOfType(type, node) {
if (type.flags & 16384 /* Void */) {
error(node, ts.Diagnostics.An_expression_of_type_void_cannot_be_tested_for_truthiness);
}
return type;
}
function checkTruthinessExpression(node, checkMode) {
return checkTruthinessOfType(checkExpression(node, checkMode), node);
}
function checkForStatement(node) {
// Grammar checking
if (!checkGrammarStatementInAmbientContext(node)) {
if (node.initializer && node.initializer.kind === 253 /* VariableDeclarationList */) {
checkGrammarVariableDeclarationList(node.initializer);
}
}
if (node.initializer) {
if (node.initializer.kind === 253 /* VariableDeclarationList */) {
ts.forEach(node.initializer.declarations, checkVariableDeclaration);
}
else {
checkExpression(node.initializer);
}
}
if (node.condition)
checkTruthinessExpression(node.condition);
if (node.incrementor)
checkExpression(node.incrementor);
checkSourceElement(node.statement);
if (node.locals) {
registerForUnusedIdentifiersCheck(node);
}
}
function checkForOfStatement(node) {
checkGrammarForInOrForOfStatement(node);
var container = ts.getContainingFunctionOrClassStaticBlock(node);
if (node.awaitModifier) {
if (container && ts.isClassStaticBlockDeclaration(container)) {
grammarErrorOnNode(node.awaitModifier, ts.Diagnostics.For_await_loops_cannot_be_used_inside_a_class_static_block);
}
else {
var functionFlags = ts.getFunctionFlags(container);
if ((functionFlags & (4 /* Invalid */ | 2 /* Async */)) === 2 /* Async */ && languageVersion < 99 /* ESNext */) {
// for..await..of in an async function or async generator function prior to ESNext requires the __asyncValues helper
checkExternalEmitHelpers(node, 16384 /* ForAwaitOfIncludes */);
}
}
}
else if (compilerOptions.downlevelIteration && languageVersion < 2 /* ES2015 */) {
// for..of prior to ES2015 requires the __values helper when downlevelIteration is enabled
checkExternalEmitHelpers(node, 256 /* ForOfIncludes */);
}
// Check the LHS and RHS
// If the LHS is a declaration, just check it as a variable declaration, which will in turn check the RHS
// via checkRightHandSideOfForOf.
// If the LHS is an expression, check the LHS, as a destructuring assignment or as a reference.
// Then check that the RHS is assignable to it.
if (node.initializer.kind === 253 /* VariableDeclarationList */) {
checkForInOrForOfVariableDeclaration(node);
}
else {
var varExpr = node.initializer;
var iteratedType = checkRightHandSideOfForOf(node);
// There may be a destructuring assignment on the left side
if (varExpr.kind === 202 /* ArrayLiteralExpression */ || varExpr.kind === 203 /* ObjectLiteralExpression */) {
// iteratedType may be undefined. In this case, we still want to check the structure of
// varExpr, in particular making sure it's a valid LeftHandSideExpression. But we'd like
// to short circuit the type relation checking as much as possible, so we pass the unknownType.
checkDestructuringAssignment(varExpr, iteratedType || errorType);
}
else {
var leftType = checkExpression(varExpr);
checkReferenceExpression(varExpr, ts.Diagnostics.The_left_hand_side_of_a_for_of_statement_must_be_a_variable_or_a_property_access, ts.Diagnostics.The_left_hand_side_of_a_for_of_statement_may_not_be_an_optional_property_access);
// iteratedType will be undefined if the rightType was missing properties/signatures
// required to get its iteratedType (like [Symbol.iterator] or next). This may be
// because we accessed properties from anyType, or it may have led to an error inside
// getElementTypeOfIterable.
if (iteratedType) {
checkTypeAssignableToAndOptionallyElaborate(iteratedType, leftType, varExpr, node.expression);
}
}
}
checkSourceElement(node.statement);
if (node.locals) {
registerForUnusedIdentifiersCheck(node);
}
}
function checkForInStatement(node) {
// Grammar checking
checkGrammarForInOrForOfStatement(node);
var rightType = getNonNullableTypeIfNeeded(checkExpression(node.expression));
// TypeScript 1.0 spec (April 2014): 5.4
// In a 'for-in' statement of the form
// for (let VarDecl in Expr) Statement
// VarDecl must be a variable declaration without a type annotation that declares a variable of type Any,
// and Expr must be an expression of type Any, an object type, or a type parameter type.
if (node.initializer.kind === 253 /* VariableDeclarationList */) {
var variable = node.initializer.declarations[0];
if (variable && ts.isBindingPattern(variable.name)) {
error(variable.name, ts.Diagnostics.The_left_hand_side_of_a_for_in_statement_cannot_be_a_destructuring_pattern);
}
checkForInOrForOfVariableDeclaration(node);
}
else {
// In a 'for-in' statement of the form
// for (Var in Expr) Statement
// Var must be an expression classified as a reference of type Any or the String primitive type,
// and Expr must be an expression of type Any, an object type, or a type parameter type.
var varExpr = node.initializer;
var leftType = checkExpression(varExpr);
if (varExpr.kind === 202 /* ArrayLiteralExpression */ || varExpr.kind === 203 /* ObjectLiteralExpression */) {
error(varExpr, ts.Diagnostics.The_left_hand_side_of_a_for_in_statement_cannot_be_a_destructuring_pattern);
}
else if (!isTypeAssignableTo(getIndexTypeOrString(rightType), leftType)) {
error(varExpr, ts.Diagnostics.The_left_hand_side_of_a_for_in_statement_must_be_of_type_string_or_any);
}
else {
// run check only former check succeeded to avoid cascading errors
checkReferenceExpression(varExpr, ts.Diagnostics.The_left_hand_side_of_a_for_in_statement_must_be_a_variable_or_a_property_access, ts.Diagnostics.The_left_hand_side_of_a_for_in_statement_may_not_be_an_optional_property_access);
}
}
// unknownType is returned i.e. if node.expression is identifier whose name cannot be resolved
// in this case error about missing name is already reported - do not report extra one
if (rightType === neverType || !isTypeAssignableToKind(rightType, 67108864 /* NonPrimitive */ | 58982400 /* InstantiableNonPrimitive */)) {
error(node.expression, ts.Diagnostics.The_right_hand_side_of_a_for_in_statement_must_be_of_type_any_an_object_type_or_a_type_parameter_but_here_has_type_0, typeToString(rightType));
}
checkSourceElement(node.statement);
if (node.locals) {
registerForUnusedIdentifiersCheck(node);
}
}
function checkForInOrForOfVariableDeclaration(iterationStatement) {
var variableDeclarationList = iterationStatement.initializer;
// checkGrammarForInOrForOfStatement will check that there is exactly one declaration.
if (variableDeclarationList.declarations.length >= 1) {
var decl = variableDeclarationList.declarations[0];
checkVariableDeclaration(decl);
}
}
function checkRightHandSideOfForOf(statement) {
var use = statement.awaitModifier ? 15 /* ForAwaitOf */ : 13 /* ForOf */;
return checkIteratedTypeOrElementType(use, checkNonNullExpression(statement.expression), undefinedType, statement.expression);
}
function checkIteratedTypeOrElementType(use, inputType, sentType, errorNode) {
if (isTypeAny(inputType)) {
return inputType;
}
return getIteratedTypeOrElementType(use, inputType, sentType, errorNode, /*checkAssignability*/ true) || anyType;
}
/**
* When consuming an iterable type in a for..of, spread, or iterator destructuring assignment
* we want to get the iterated type of an iterable for ES2015 or later, or the iterated type
* of a iterable (if defined globally) or element type of an array like for ES2015 or earlier.
*/
function getIteratedTypeOrElementType(use, inputType, sentType, errorNode, checkAssignability) {
var allowAsyncIterables = (use & 2 /* AllowsAsyncIterablesFlag */) !== 0;
if (inputType === neverType) {
reportTypeNotIterableError(errorNode, inputType, allowAsyncIterables); // TODO: GH#18217
return undefined;
}
var uplevelIteration = languageVersion >= 2 /* ES2015 */;
var downlevelIteration = !uplevelIteration && compilerOptions.downlevelIteration;
var possibleOutOfBounds = compilerOptions.noUncheckedIndexedAccess && !!(use & 128 /* PossiblyOutOfBounds */);
// Get the iterated type of an `Iterable<T>` or `IterableIterator<T>` only in ES2015
// or higher, when inside of an async generator or for-await-if, or when
// downlevelIteration is requested.
if (uplevelIteration || downlevelIteration || allowAsyncIterables) {
// We only report errors for an invalid iterable type in ES2015 or higher.
var iterationTypes = getIterationTypesOfIterable(inputType, use, uplevelIteration ? errorNode : undefined);
if (checkAssignability) {
if (iterationTypes) {
var diagnostic = use & 8 /* ForOfFlag */ ? ts.Diagnostics.Cannot_iterate_value_because_the_next_method_of_its_iterator_expects_type_1_but_for_of_will_always_send_0 :
use & 32 /* SpreadFlag */ ? ts.Diagnostics.Cannot_iterate_value_because_the_next_method_of_its_iterator_expects_type_1_but_array_spread_will_always_send_0 :
use & 64 /* DestructuringFlag */ ? ts.Diagnostics.Cannot_iterate_value_because_the_next_method_of_its_iterator_expects_type_1_but_array_destructuring_will_always_send_0 :
use & 16 /* YieldStarFlag */ ? ts.Diagnostics.Cannot_delegate_iteration_to_value_because_the_next_method_of_its_iterator_expects_type_1_but_the_containing_generator_will_always_send_0 :
undefined;
if (diagnostic) {
checkTypeAssignableTo(sentType, iterationTypes.nextType, errorNode, diagnostic);
}
}
}
if (iterationTypes || uplevelIteration) {
return possibleOutOfBounds ? includeUndefinedInIndexSignature(iterationTypes && iterationTypes.yieldType) : (iterationTypes && iterationTypes.yieldType);
}
}
var arrayType = inputType;
var reportedError = false;
var hasStringConstituent = false;
// If strings are permitted, remove any string-like constituents from the array type.
// This allows us to find other non-string element types from an array unioned with
// a string.
if (use & 4 /* AllowsStringInputFlag */) {
if (arrayType.flags & 1048576 /* Union */) {
// After we remove all types that are StringLike, we will know if there was a string constituent
// based on whether the result of filter is a new array.
var arrayTypes = inputType.types;
var filteredTypes = ts.filter(arrayTypes, function (t) { return !(t.flags & 402653316 /* StringLike */); });
if (filteredTypes !== arrayTypes) {
arrayType = getUnionType(filteredTypes, 2 /* Subtype */);
}
}
else if (arrayType.flags & 402653316 /* StringLike */) {
arrayType = neverType;
}
hasStringConstituent = arrayType !== inputType;
if (hasStringConstituent) {
if (languageVersion < 1 /* ES5 */) {
if (errorNode) {
error(errorNode, ts.Diagnostics.Using_a_string_in_a_for_of_statement_is_only_supported_in_ECMAScript_5_and_higher);
reportedError = true;
}
}
// Now that we've removed all the StringLike types, if no constituents remain, then the entire
// arrayOrStringType was a string.
if (arrayType.flags & 131072 /* Never */) {
return possibleOutOfBounds ? includeUndefinedInIndexSignature(stringType) : stringType;
}
}
}
if (!isArrayLikeType(arrayType)) {
if (errorNode && !reportedError) {
// Which error we report depends on whether we allow strings or if there was a
// string constituent. For example, if the input type is number | string, we
// want to say that number is not an array type. But if the input was just
// number and string input is allowed, we want to say that number is not an
// array type or a string type.
var allowsStrings = !!(use & 4 /* AllowsStringInputFlag */) && !hasStringConstituent;
var _a = getIterationDiagnosticDetails(allowsStrings, downlevelIteration), defaultDiagnostic = _a[0], maybeMissingAwait = _a[1];
errorAndMaybeSuggestAwait(errorNode, maybeMissingAwait && !!getAwaitedTypeOfPromise(arrayType), defaultDiagnostic, typeToString(arrayType));
}
return hasStringConstituent ? possibleOutOfBounds ? includeUndefinedInIndexSignature(stringType) : stringType : undefined;
}
var arrayElementType = getIndexTypeOfType(arrayType, numberType);
if (hasStringConstituent && arrayElementType) {
// This is just an optimization for the case where arrayOrStringType is string | string[]
if (arrayElementType.flags & 402653316 /* StringLike */ && !compilerOptions.noUncheckedIndexedAccess) {
return stringType;
}
return getUnionType(possibleOutOfBounds ? [arrayElementType, stringType, undefinedType] : [arrayElementType, stringType], 2 /* Subtype */);
}
return (use & 128 /* PossiblyOutOfBounds */) ? includeUndefinedInIndexSignature(arrayElementType) : arrayElementType;
function getIterationDiagnosticDetails(allowsStrings, downlevelIteration) {
var _a;
if (downlevelIteration) {
return allowsStrings
? [ts.Diagnostics.Type_0_is_not_an_array_type_or_a_string_type_or_does_not_have_a_Symbol_iterator_method_that_returns_an_iterator, true]
: [ts.Diagnostics.Type_0_is_not_an_array_type_or_does_not_have_a_Symbol_iterator_method_that_returns_an_iterator, true];
}
var yieldType = getIterationTypeOfIterable(use, 0 /* Yield */, inputType, /*errorNode*/ undefined);
if (yieldType) {
return [ts.Diagnostics.Type_0_is_not_an_array_type_or_a_string_type_Use_compiler_option_downlevelIteration_to_allow_iterating_of_iterators, false];
}
if (isES2015OrLaterIterable((_a = inputType.symbol) === null || _a === void 0 ? void 0 : _a.escapedName)) {
return [ts.Diagnostics.Type_0_can_only_be_iterated_through_when_using_the_downlevelIteration_flag_or_with_a_target_of_es2015_or_higher, true];
}
return allowsStrings
? [ts.Diagnostics.Type_0_is_not_an_array_type_or_a_string_type, true]
: [ts.Diagnostics.Type_0_is_not_an_array_type, true];
}
}
function isES2015OrLaterIterable(n) {
switch (n) {
case "Float32Array":
case "Float64Array":
case "Int16Array":
case "Int32Array":
case "Int8Array":
case "NodeList":
case "Uint16Array":
case "Uint32Array":
case "Uint8Array":
case "Uint8ClampedArray":
return true;
}
return false;
}
/**
* Gets the requested "iteration type" from an `Iterable`-like or `AsyncIterable`-like type.
*/
function getIterationTypeOfIterable(use, typeKind, inputType, errorNode) {
if (isTypeAny(inputType)) {
return undefined;
}
var iterationTypes = getIterationTypesOfIterable(inputType, use, errorNode);
return iterationTypes && iterationTypes[getIterationTypesKeyFromIterationTypeKind(typeKind)];
}
function createIterationTypes(yieldType, returnType, nextType) {
// `yieldType` and `returnType` are defaulted to `neverType` they each will be combined
// via `getUnionType` when merging iteration types. `nextType` is defined as `unknownType`
// as it is combined via `getIntersectionType` when merging iteration types.
if (yieldType === void 0) { yieldType = neverType; }
if (returnType === void 0) { returnType = neverType; }
if (nextType === void 0) { nextType = unknownType; }
// Use the cache only for intrinsic types to keep it small as they are likely to be
// more frequently created (i.e. `Iterator<number, void, unknown>`). Iteration types
// are also cached on the type they are requested for, so we shouldn't need to maintain
// the cache for less-frequently used types.
if (yieldType.flags & 67359327 /* Intrinsic */ &&
returnType.flags & (1 /* Any */ | 131072 /* Never */ | 2 /* Unknown */ | 16384 /* Void */ | 32768 /* Undefined */) &&
nextType.flags & (1 /* Any */ | 131072 /* Never */ | 2 /* Unknown */ | 16384 /* Void */ | 32768 /* Undefined */)) {
var id = getTypeListId([yieldType, returnType, nextType]);
var iterationTypes = iterationTypesCache.get(id);
if (!iterationTypes) {
iterationTypes = { yieldType: yieldType, returnType: returnType, nextType: nextType };
iterationTypesCache.set(id, iterationTypes);
}
return iterationTypes;
}
return { yieldType: yieldType, returnType: returnType, nextType: nextType };
}
/**
* Combines multiple `IterationTypes` records.
*
* If `array` is empty or all elements are missing or are references to `noIterationTypes`,
* then `noIterationTypes` is returned. Otherwise, an `IterationTypes` record is returned
* for the combined iteration types.
*/
function combineIterationTypes(array) {
var yieldTypes;
var returnTypes;
var nextTypes;
for (var _i = 0, array_11 = array; _i < array_11.length; _i++) {
var iterationTypes = array_11[_i];
if (iterationTypes === undefined || iterationTypes === noIterationTypes) {
continue;
}
if (iterationTypes === anyIterationTypes) {
return anyIterationTypes;
}
yieldTypes = ts.append(yieldTypes, iterationTypes.yieldType);
returnTypes = ts.append(returnTypes, iterationTypes.returnType);
nextTypes = ts.append(nextTypes, iterationTypes.nextType);
}
if (yieldTypes || returnTypes || nextTypes) {
return createIterationTypes(yieldTypes && getUnionType(yieldTypes), returnTypes && getUnionType(returnTypes), nextTypes && getIntersectionType(nextTypes));
}
return noIterationTypes;
}
function getCachedIterationTypes(type, cacheKey) {
return type[cacheKey];
}
function setCachedIterationTypes(type, cacheKey, cachedTypes) {
return type[cacheKey] = cachedTypes;
}
/**
* Gets the *yield*, *return*, and *next* types from an `Iterable`-like or `AsyncIterable`-like type.
*
* At every level that involves analyzing return types of signatures, we union the return types of all the signatures.
*
* Another thing to note is that at any step of this process, we could run into a dead end,
* meaning either the property is missing, or we run into the anyType. If either of these things
* happens, we return `undefined` to signal that we could not find the iteration type. If a property
* is missing, and the previous step did not result in `any`, then we also give an error if the
* caller requested it. Then the caller can decide what to do in the case where there is no iterated
* type.
*
* For a **for-of** statement, `yield*` (in a normal generator), spread, array
* destructuring, or normal generator we will only ever look for a `[Symbol.iterator]()`
* method.
*
* For an async generator we will only ever look at the `[Symbol.asyncIterator]()` method.
*
* For a **for-await-of** statement or a `yield*` in an async generator we will look for
* the `[Symbol.asyncIterator]()` method first, and then the `[Symbol.iterator]()` method.
*/
function getIterationTypesOfIterable(type, use, errorNode) {
if (isTypeAny(type)) {
return anyIterationTypes;
}
if (!(type.flags & 1048576 /* Union */)) {
var iterationTypes_1 = getIterationTypesOfIterableWorker(type, use, errorNode);
if (iterationTypes_1 === noIterationTypes) {
if (errorNode) {
reportTypeNotIterableError(errorNode, type, !!(use & 2 /* AllowsAsyncIterablesFlag */));
}
return undefined;
}
return iterationTypes_1;
}
var cacheKey = use & 2 /* AllowsAsyncIterablesFlag */ ? "iterationTypesOfAsyncIterable" : "iterationTypesOfIterable";
var cachedTypes = getCachedIterationTypes(type, cacheKey);
if (cachedTypes)
return cachedTypes === noIterationTypes ? undefined : cachedTypes;
var allIterationTypes;
for (var _i = 0, _a = type.types; _i < _a.length; _i++) {
var constituent = _a[_i];
var iterationTypes_2 = getIterationTypesOfIterableWorker(constituent, use, errorNode);
if (iterationTypes_2 === noIterationTypes) {
if (errorNode) {
reportTypeNotIterableError(errorNode, type, !!(use & 2 /* AllowsAsyncIterablesFlag */));
}
setCachedIterationTypes(type, cacheKey, noIterationTypes);
return undefined;
}
else {
allIterationTypes = ts.append(allIterationTypes, iterationTypes_2);
}
}
var iterationTypes = allIterationTypes ? combineIterationTypes(allIterationTypes) : noIterationTypes;
setCachedIterationTypes(type, cacheKey, iterationTypes);
return iterationTypes === noIterationTypes ? undefined : iterationTypes;
}
function getAsyncFromSyncIterationTypes(iterationTypes, errorNode) {
if (iterationTypes === noIterationTypes)
return noIterationTypes;
if (iterationTypes === anyIterationTypes)
return anyIterationTypes;
var yieldType = iterationTypes.yieldType, returnType = iterationTypes.returnType, nextType = iterationTypes.nextType;
return createIterationTypes(getAwaitedType(yieldType, errorNode) || anyType, getAwaitedType(returnType, errorNode) || anyType, nextType);
}
/**
* Gets the *yield*, *return*, and *next* types from a non-union type.
*
* If we are unable to find the *yield*, *return*, and *next* types, `noIterationTypes` is
* returned to indicate to the caller that it should report an error. Otherwise, an
* `IterationTypes` record is returned.
*
* NOTE: You probably don't want to call this directly and should be calling
* `getIterationTypesOfIterable` instead.
*/
function getIterationTypesOfIterableWorker(type, use, errorNode) {
if (isTypeAny(type)) {
return anyIterationTypes;
}
if (use & 2 /* AllowsAsyncIterablesFlag */) {
var iterationTypes = getIterationTypesOfIterableCached(type, asyncIterationTypesResolver) ||
getIterationTypesOfIterableFast(type, asyncIterationTypesResolver);
if (iterationTypes) {
return iterationTypes;
}
}
if (use & 1 /* AllowsSyncIterablesFlag */) {
var iterationTypes = getIterationTypesOfIterableCached(type, syncIterationTypesResolver) ||
getIterationTypesOfIterableFast(type, syncIterationTypesResolver);
if (iterationTypes) {
if (use & 2 /* AllowsAsyncIterablesFlag */) {
// for a sync iterable in an async context, only use the cached types if they are valid.
if (iterationTypes !== noIterationTypes) {
return setCachedIterationTypes(type, "iterationTypesOfAsyncIterable", getAsyncFromSyncIterationTypes(iterationTypes, errorNode));
}
}
else {
return iterationTypes;
}
}
}
if (use & 2 /* AllowsAsyncIterablesFlag */) {
var iterationTypes = getIterationTypesOfIterableSlow(type, asyncIterationTypesResolver, errorNode);
if (iterationTypes !== noIterationTypes) {
return iterationTypes;
}
}
if (use & 1 /* AllowsSyncIterablesFlag */) {
var iterationTypes = getIterationTypesOfIterableSlow(type, syncIterationTypesResolver, errorNode);
if (iterationTypes !== noIterationTypes) {
if (use & 2 /* AllowsAsyncIterablesFlag */) {
return setCachedIterationTypes(type, "iterationTypesOfAsyncIterable", iterationTypes
? getAsyncFromSyncIterationTypes(iterationTypes, errorNode)
: noIterationTypes);
}
else {
return iterationTypes;
}
}
}
return noIterationTypes;
}
/**
* Gets the *yield*, *return*, and *next* types of an `Iterable`-like or
* `AsyncIterable`-like type from the cache.
*
* NOTE: You probably don't want to call this directly and should be calling
* `getIterationTypesOfIterable` instead.
*/
function getIterationTypesOfIterableCached(type, resolver) {
return getCachedIterationTypes(type, resolver.iterableCacheKey);
}
function getIterationTypesOfGlobalIterableType(globalType, resolver) {
var globalIterationTypes = getIterationTypesOfIterableCached(globalType, resolver) ||
getIterationTypesOfIterableSlow(globalType, resolver, /*errorNode*/ undefined);
return globalIterationTypes === noIterationTypes ? defaultIterationTypes : globalIterationTypes;
}
/**
* Gets the *yield*, *return*, and *next* types of an `Iterable`-like or `AsyncIterable`-like
* type from from common heuristics.
*
* If we previously analyzed this type and found no iteration types, `noIterationTypes` is
* returned. If we found iteration types, an `IterationTypes` record is returned.
* Otherwise, we return `undefined` to indicate to the caller it should perform a more
* exhaustive analysis.
*
* NOTE: You probably don't want to call this directly and should be calling
* `getIterationTypesOfIterable` instead.
*/
function getIterationTypesOfIterableFast(type, resolver) {
// As an optimization, if the type is an instantiation of one of the following global types, then
// just grab its related type argument:
// - `Iterable<T>` or `AsyncIterable<T>`
// - `IterableIterator<T>` or `AsyncIterableIterator<T>`
var globalType;
if (isReferenceToType(type, globalType = resolver.getGlobalIterableType(/*reportErrors*/ false)) ||
isReferenceToType(type, globalType = resolver.getGlobalIterableIteratorType(/*reportErrors*/ false))) {
var yieldType = getTypeArguments(type)[0];
// The "return" and "next" types of `Iterable` and `IterableIterator` are defined by the
// iteration types of their `[Symbol.iterator]()` method. The same is true for their async cousins.
// While we define these as `any` and `undefined` in our libs by default, a custom lib *could* use
// different definitions.
var _a = getIterationTypesOfGlobalIterableType(globalType, resolver), returnType = _a.returnType, nextType = _a.nextType;
return setCachedIterationTypes(type, resolver.iterableCacheKey, createIterationTypes(yieldType, returnType, nextType));
}
// As an optimization, if the type is an instantiation of the following global type, then
// just grab its related type arguments:
// - `Generator<T, TReturn, TNext>` or `AsyncGenerator<T, TReturn, TNext>`
if (isReferenceToType(type, resolver.getGlobalGeneratorType(/*reportErrors*/ false))) {
var _b = getTypeArguments(type), yieldType = _b[0], returnType = _b[1], nextType = _b[2];
return setCachedIterationTypes(type, resolver.iterableCacheKey, createIterationTypes(yieldType, returnType, nextType));
}
}
function getPropertyNameForKnownSymbolName(symbolName) {
var ctorType = getGlobalESSymbolConstructorSymbol(/*reportErrors*/ false);
var uniqueType = ctorType && getTypeOfPropertyOfType(getTypeOfSymbol(ctorType), ts.escapeLeadingUnderscores(symbolName));
return uniqueType && isTypeUsableAsPropertyName(uniqueType) ? getPropertyNameFromType(uniqueType) : "__@" + symbolName;
}
/**
* Gets the *yield*, *return*, and *next* types of an `Iterable`-like or `AsyncIterable`-like
* type from its members.
*
* If we successfully found the *yield*, *return*, and *next* types, an `IterationTypes`
* record is returned. Otherwise, `noIterationTypes` is returned.
*
* NOTE: You probably don't want to call this directly and should be calling
* `getIterationTypesOfIterable` instead.
*/
function getIterationTypesOfIterableSlow(type, resolver, errorNode) {
var _a;
var method = getPropertyOfType(type, getPropertyNameForKnownSymbolName(resolver.iteratorSymbolName));
var methodType = method && !(method.flags & 16777216 /* Optional */) ? getTypeOfSymbol(method) : undefined;
if (isTypeAny(methodType)) {
return setCachedIterationTypes(type, resolver.iterableCacheKey, anyIterationTypes);
}
var signatures = methodType ? getSignaturesOfType(methodType, 0 /* Call */) : undefined;
if (!ts.some(signatures)) {
return setCachedIterationTypes(type, resolver.iterableCacheKey, noIterationTypes);
}
var iteratorType = getIntersectionType(ts.map(signatures, getReturnTypeOfSignature));
var iterationTypes = (_a = getIterationTypesOfIterator(iteratorType, resolver, errorNode)) !== null && _a !== void 0 ? _a : noIterationTypes;
return setCachedIterationTypes(type, resolver.iterableCacheKey, iterationTypes);
}
function reportTypeNotIterableError(errorNode, type, allowAsyncIterables) {
var message = allowAsyncIterables
? ts.Diagnostics.Type_0_must_have_a_Symbol_asyncIterator_method_that_returns_an_async_iterator
: ts.Diagnostics.Type_0_must_have_a_Symbol_iterator_method_that_returns_an_iterator;
errorAndMaybeSuggestAwait(errorNode, !!getAwaitedTypeOfPromise(type), message, typeToString(type));
}
/**
* Gets the *yield*, *return*, and *next* types from an `Iterator`-like or `AsyncIterator`-like type.
*
* If we successfully found the *yield*, *return*, and *next* types, an `IterationTypes`
* record is returned. Otherwise, `undefined` is returned.
*/
function getIterationTypesOfIterator(type, resolver, errorNode) {
if (isTypeAny(type)) {
return anyIterationTypes;
}
var iterationTypes = getIterationTypesOfIteratorCached(type, resolver) ||
getIterationTypesOfIteratorFast(type, resolver) ||
getIterationTypesOfIteratorSlow(type, resolver, errorNode);
return iterationTypes === noIterationTypes ? undefined : iterationTypes;
}
/**
* Gets the iteration types of an `Iterator`-like or `AsyncIterator`-like type from the
* cache.
*
* NOTE: You probably don't want to call this directly and should be calling
* `getIterationTypesOfIterator` instead.
*/
function getIterationTypesOfIteratorCached(type, resolver) {
return getCachedIterationTypes(type, resolver.iteratorCacheKey);
}
/**
* Gets the iteration types of an `Iterator`-like or `AsyncIterator`-like type from the
* cache or from common heuristics.
*
* If we previously analyzed this type and found no iteration types, `noIterationTypes` is
* returned. If we found iteration types, an `IterationTypes` record is returned.
* Otherwise, we return `undefined` to indicate to the caller it should perform a more
* exhaustive analysis.
*
* NOTE: You probably don't want to call this directly and should be calling
* `getIterationTypesOfIterator` instead.
*/
function getIterationTypesOfIteratorFast(type, resolver) {
// As an optimization, if the type is an instantiation of one of the following global types,
// then just grab its related type argument:
// - `IterableIterator<T>` or `AsyncIterableIterator<T>`
// - `Iterator<T, TReturn, TNext>` or `AsyncIterator<T, TReturn, TNext>`
// - `Generator<T, TReturn, TNext>` or `AsyncGenerator<T, TReturn, TNext>`
var globalType = resolver.getGlobalIterableIteratorType(/*reportErrors*/ false);
if (isReferenceToType(type, globalType)) {
var yieldType = getTypeArguments(type)[0];
// The "return" and "next" types of `IterableIterator` and `AsyncIterableIterator` are defined by the
// iteration types of their `next`, `return`, and `throw` methods. While we define these as `any`
// and `undefined` in our libs by default, a custom lib *could* use different definitions.
var globalIterationTypes = getIterationTypesOfIteratorCached(globalType, resolver) ||
getIterationTypesOfIteratorSlow(globalType, resolver, /*errorNode*/ undefined);
var _a = globalIterationTypes === noIterationTypes ? defaultIterationTypes : globalIterationTypes, returnType = _a.returnType, nextType = _a.nextType;
return setCachedIterationTypes(type, resolver.iteratorCacheKey, createIterationTypes(yieldType, returnType, nextType));
}
if (isReferenceToType(type, resolver.getGlobalIteratorType(/*reportErrors*/ false)) ||
isReferenceToType(type, resolver.getGlobalGeneratorType(/*reportErrors*/ false))) {
var _b = getTypeArguments(type), yieldType = _b[0], returnType = _b[1], nextType = _b[2];
return setCachedIterationTypes(type, resolver.iteratorCacheKey, createIterationTypes(yieldType, returnType, nextType));
}
}
function isIteratorResult(type, kind) {
// From https://tc39.github.io/ecma262/#sec-iteratorresult-interface:
// > [done] is the result status of an iterator `next` method call. If the end of the iterator was reached `done` is `true`.
// > If the end was not reached `done` is `false` and a value is available.
// > If a `done` property (either own or inherited) does not exist, it is consider to have the value `false`.
var doneType = getTypeOfPropertyOfType(type, "done") || falseType;
return isTypeAssignableTo(kind === 0 /* Yield */ ? falseType : trueType, doneType);
}
function isYieldIteratorResult(type) {
return isIteratorResult(type, 0 /* Yield */);
}
function isReturnIteratorResult(type) {
return isIteratorResult(type, 1 /* Return */);
}
/**
* Gets the *yield* and *return* types of an `IteratorResult`-like type.
*
* If we are unable to determine a *yield* or a *return* type, `noIterationTypes` is
* returned to indicate to the caller that it should handle the error. Otherwise, an
* `IterationTypes` record is returned.
*/
function getIterationTypesOfIteratorResult(type) {
if (isTypeAny(type)) {
return anyIterationTypes;
}
var cachedTypes = getCachedIterationTypes(type, "iterationTypesOfIteratorResult");
if (cachedTypes) {
return cachedTypes;
}
// As an optimization, if the type is an instantiation of one of the global `IteratorYieldResult<T>`
// or `IteratorReturnResult<TReturn>` types, then just grab its type argument.
if (isReferenceToType(type, getGlobalIteratorYieldResultType(/*reportErrors*/ false))) {
var yieldType_1 = getTypeArguments(type)[0];
return setCachedIterationTypes(type, "iterationTypesOfIteratorResult", createIterationTypes(yieldType_1, /*returnType*/ undefined, /*nextType*/ undefined));
}
if (isReferenceToType(type, getGlobalIteratorReturnResultType(/*reportErrors*/ false))) {
var returnType_1 = getTypeArguments(type)[0];
return setCachedIterationTypes(type, "iterationTypesOfIteratorResult", createIterationTypes(/*yieldType*/ undefined, returnType_1, /*nextType*/ undefined));
}
// Choose any constituents that can produce the requested iteration type.
var yieldIteratorResult = filterType(type, isYieldIteratorResult);
var yieldType = yieldIteratorResult !== neverType ? getTypeOfPropertyOfType(yieldIteratorResult, "value") : undefined;
var returnIteratorResult = filterType(type, isReturnIteratorResult);
var returnType = returnIteratorResult !== neverType ? getTypeOfPropertyOfType(returnIteratorResult, "value") : undefined;
if (!yieldType && !returnType) {
return setCachedIterationTypes(type, "iterationTypesOfIteratorResult", noIterationTypes);
}
// From https://tc39.github.io/ecma262/#sec-iteratorresult-interface
// > ... If the iterator does not have a return value, `value` is `undefined`. In that case, the
// > `value` property may be absent from the conforming object if it does not inherit an explicit
// > `value` property.
return setCachedIterationTypes(type, "iterationTypesOfIteratorResult", createIterationTypes(yieldType, returnType || voidType, /*nextType*/ undefined));
}
/**
* Gets the *yield*, *return*, and *next* types of a the `next()`, `return()`, or
* `throw()` method of an `Iterator`-like or `AsyncIterator`-like type.
*
* If we successfully found the *yield*, *return*, and *next* types, an `IterationTypes`
* record is returned. Otherwise, we return `undefined`.
*/
function getIterationTypesOfMethod(type, resolver, methodName, errorNode) {
var _a, _b, _c, _d;
var method = getPropertyOfType(type, methodName);
// Ignore 'return' or 'throw' if they are missing.
if (!method && methodName !== "next") {
return undefined;
}
var methodType = method && !(methodName === "next" && (method.flags & 16777216 /* Optional */))
? methodName === "next" ? getTypeOfSymbol(method) : getTypeWithFacts(getTypeOfSymbol(method), 2097152 /* NEUndefinedOrNull */)
: undefined;
if (isTypeAny(methodType)) {
// `return()` and `throw()` don't provide a *next* type.
return methodName === "next" ? anyIterationTypes : anyIterationTypesExceptNext;
}
// Both async and non-async iterators *must* have a `next` method.
var methodSignatures = methodType ? getSignaturesOfType(methodType, 0 /* Call */) : ts.emptyArray;
if (methodSignatures.length === 0) {
if (errorNode) {
var diagnostic = methodName === "next"
? resolver.mustHaveANextMethodDiagnostic
: resolver.mustBeAMethodDiagnostic;
error(errorNode, diagnostic, methodName);
}
return methodName === "next" ? anyIterationTypes : undefined;
}
// If the method signature comes exclusively from the global iterator or generator type,
// create iteration types from its type arguments like `getIterationTypesOfIteratorFast`
// does (so as to remove `undefined` from the next and return types). We arrive here when
// a contextual type for a generator was not a direct reference to one of those global types,
// but looking up `methodType` referred to one of them (and nothing else). E.g., in
// `interface SpecialIterator extends Iterator<number> {}`, `SpecialIterator` is not a
// reference to `Iterator`, but its `next` member derives exclusively from `Iterator`.
if ((methodType === null || methodType === void 0 ? void 0 : methodType.symbol) && methodSignatures.length === 1) {
var globalGeneratorType = resolver.getGlobalGeneratorType(/*reportErrors*/ false);
var globalIteratorType = resolver.getGlobalIteratorType(/*reportErrors*/ false);
var isGeneratorMethod = ((_b = (_a = globalGeneratorType.symbol) === null || _a === void 0 ? void 0 : _a.members) === null || _b === void 0 ? void 0 : _b.get(methodName)) === methodType.symbol;
var isIteratorMethod = !isGeneratorMethod && ((_d = (_c = globalIteratorType.symbol) === null || _c === void 0 ? void 0 : _c.members) === null || _d === void 0 ? void 0 : _d.get(methodName)) === methodType.symbol;
if (isGeneratorMethod || isIteratorMethod) {
var globalType = isGeneratorMethod ? globalGeneratorType : globalIteratorType;
var mapper = methodType.mapper;
return createIterationTypes(getMappedType(globalType.typeParameters[0], mapper), getMappedType(globalType.typeParameters[1], mapper), methodName === "next" ? getMappedType(globalType.typeParameters[2], mapper) : undefined);
}
}
// Extract the first parameter and return type of each signature.
var methodParameterTypes;
var methodReturnTypes;
for (var _i = 0, methodSignatures_1 = methodSignatures; _i < methodSignatures_1.length; _i++) {
var signature = methodSignatures_1[_i];
if (methodName !== "throw" && ts.some(signature.parameters)) {
methodParameterTypes = ts.append(methodParameterTypes, getTypeAtPosition(signature, 0));
}
methodReturnTypes = ts.append(methodReturnTypes, getReturnTypeOfSignature(signature));
}
// Resolve the *next* or *return* type from the first parameter of a `next()` or
// `return()` method, respectively.
var returnTypes;
var nextType;
if (methodName !== "throw") {
var methodParameterType = methodParameterTypes ? getUnionType(methodParameterTypes) : unknownType;
if (methodName === "next") {
// The value of `next(value)` is *not* awaited by async generators
nextType = methodParameterType;
}
else if (methodName === "return") {
// The value of `return(value)` *is* awaited by async generators
var resolvedMethodParameterType = resolver.resolveIterationType(methodParameterType, errorNode) || anyType;
returnTypes = ts.append(returnTypes, resolvedMethodParameterType);
}
}
// Resolve the *yield* and *return* types from the return type of the method (i.e. `IteratorResult`)
var yieldType;
var methodReturnType = methodReturnTypes ? getIntersectionType(methodReturnTypes) : neverType;
var resolvedMethodReturnType = resolver.resolveIterationType(methodReturnType, errorNode) || anyType;
var iterationTypes = getIterationTypesOfIteratorResult(resolvedMethodReturnType);
if (iterationTypes === noIterationTypes) {
if (errorNode) {
error(errorNode, resolver.mustHaveAValueDiagnostic, methodName);
}
yieldType = anyType;
returnTypes = ts.append(returnTypes, anyType);
}
else {
yieldType = iterationTypes.yieldType;
returnTypes = ts.append(returnTypes, iterationTypes.returnType);
}
return createIterationTypes(yieldType, getUnionType(returnTypes), nextType);
}
/**
* Gets the *yield*, *return*, and *next* types of an `Iterator`-like or `AsyncIterator`-like
* type from its members.
*
* If we successfully found the *yield*, *return*, and *next* types, an `IterationTypes`
* record is returned. Otherwise, `noIterationTypes` is returned.
*
* NOTE: You probably don't want to call this directly and should be calling
* `getIterationTypesOfIterator` instead.
*/
function getIterationTypesOfIteratorSlow(type, resolver, errorNode) {
var iterationTypes = combineIterationTypes([
getIterationTypesOfMethod(type, resolver, "next", errorNode),
getIterationTypesOfMethod(type, resolver, "return", errorNode),
getIterationTypesOfMethod(type, resolver, "throw", errorNode),
]);
return setCachedIterationTypes(type, resolver.iteratorCacheKey, iterationTypes);
}
/**
* Gets the requested "iteration type" from a type that is either `Iterable`-like, `Iterator`-like,
* `IterableIterator`-like, or `Generator`-like (for a non-async generator); or `AsyncIterable`-like,
* `AsyncIterator`-like, `AsyncIterableIterator`-like, or `AsyncGenerator`-like (for an async generator).
*/
function getIterationTypeOfGeneratorFunctionReturnType(kind, returnType, isAsyncGenerator) {
if (isTypeAny(returnType)) {
return undefined;
}
var iterationTypes = getIterationTypesOfGeneratorFunctionReturnType(returnType, isAsyncGenerator);
return iterationTypes && iterationTypes[getIterationTypesKeyFromIterationTypeKind(kind)];
}
function getIterationTypesOfGeneratorFunctionReturnType(type, isAsyncGenerator) {
if (isTypeAny(type)) {
return anyIterationTypes;
}
var use = isAsyncGenerator ? 2 /* AsyncGeneratorReturnType */ : 1 /* GeneratorReturnType */;
var resolver = isAsyncGenerator ? asyncIterationTypesResolver : syncIterationTypesResolver;
return getIterationTypesOfIterable(type, use, /*errorNode*/ undefined) ||
getIterationTypesOfIterator(type, resolver, /*errorNode*/ undefined);
}
function checkBreakOrContinueStatement(node) {
// Grammar checking
if (!checkGrammarStatementInAmbientContext(node))
checkGrammarBreakOrContinueStatement(node);
// TODO: Check that target label is valid
}
function unwrapReturnType(returnType, functionFlags) {
var _a, _b;
var isGenerator = !!(functionFlags & 1 /* Generator */);
var isAsync = !!(functionFlags & 2 /* Async */);
return isGenerator ? (_a = getIterationTypeOfGeneratorFunctionReturnType(1 /* Return */, returnType, isAsync)) !== null && _a !== void 0 ? _a : errorType :
isAsync ? (_b = getAwaitedType(returnType)) !== null && _b !== void 0 ? _b : errorType :
returnType;
}
function isUnwrappedReturnTypeVoidOrAny(func, returnType) {
var unwrappedReturnType = unwrapReturnType(returnType, ts.getFunctionFlags(func));
return !!unwrappedReturnType && maybeTypeOfKind(unwrappedReturnType, 16384 /* Void */ | 3 /* AnyOrUnknown */);
}
function checkReturnStatement(node) {
var _a;
// Grammar checking
if (checkGrammarStatementInAmbientContext(node)) {
return;
}
var container = ts.getContainingFunctionOrClassStaticBlock(node);
if (container && ts.isClassStaticBlockDeclaration(container)) {
grammarErrorOnFirstToken(node, ts.Diagnostics.A_return_statement_cannot_be_used_inside_a_class_static_block);
return;
}
if (!container) {
grammarErrorOnFirstToken(node, ts.Diagnostics.A_return_statement_can_only_be_used_within_a_function_body);
return;
}
var signature = getSignatureFromDeclaration(container);
var returnType = getReturnTypeOfSignature(signature);
var functionFlags = ts.getFunctionFlags(container);
if (strictNullChecks || node.expression || returnType.flags & 131072 /* Never */) {
var exprType = node.expression ? checkExpressionCached(node.expression) : undefinedType;
if (container.kind === 171 /* SetAccessor */) {
if (node.expression) {
error(node, ts.Diagnostics.Setters_cannot_return_a_value);
}
}
else if (container.kind === 169 /* Constructor */) {
if (node.expression && !checkTypeAssignableToAndOptionallyElaborate(exprType, returnType, node, node.expression)) {
error(node, ts.Diagnostics.Return_type_of_constructor_signature_must_be_assignable_to_the_instance_type_of_the_class);
}
}
else if (getReturnTypeFromAnnotation(container)) {
var unwrappedReturnType = (_a = unwrapReturnType(returnType, functionFlags)) !== null && _a !== void 0 ? _a : returnType;
var unwrappedExprType = functionFlags & 2 /* Async */
? checkAwaitedType(exprType, node, ts.Diagnostics.The_return_type_of_an_async_function_must_either_be_a_valid_promise_or_must_not_contain_a_callable_then_member)
: exprType;
if (unwrappedReturnType) {
// If the function has a return type, but promisedType is
// undefined, an error will be reported in checkAsyncFunctionReturnType
// so we don't need to report one here.
checkTypeAssignableToAndOptionallyElaborate(unwrappedExprType, unwrappedReturnType, node, node.expression);
}
}
}
else if (container.kind !== 169 /* Constructor */ && compilerOptions.noImplicitReturns && !isUnwrappedReturnTypeVoidOrAny(container, returnType)) {
// The function has a return type, but the return statement doesn't have an expression.
error(node, ts.Diagnostics.Not_all_code_paths_return_a_value);
}
}
function checkWithStatement(node) {
// Grammar checking for withStatement
if (!checkGrammarStatementInAmbientContext(node)) {
if (node.flags & 32768 /* AwaitContext */) {
grammarErrorOnFirstToken(node, ts.Diagnostics.with_statements_are_not_allowed_in_an_async_function_block);
}
}
checkExpression(node.expression);
var sourceFile = ts.getSourceFileOfNode(node);
if (!hasParseDiagnostics(sourceFile)) {
var start = ts.getSpanOfTokenAtPosition(sourceFile, node.pos).start;
var end = node.statement.pos;
grammarErrorAtPos(sourceFile, start, end - start, ts.Diagnostics.The_with_statement_is_not_supported_All_symbols_in_a_with_block_will_have_type_any);
}
}
function checkSwitchStatement(node) {
// Grammar checking
checkGrammarStatementInAmbientContext(node);
var firstDefaultClause;
var hasDuplicateDefaultClause = false;
var expressionType = checkExpression(node.expression);
var expressionIsLiteral = isLiteralType(expressionType);
ts.forEach(node.caseBlock.clauses, function (clause) {
// Grammar check for duplicate default clauses, skip if we already report duplicate default clause
if (clause.kind === 288 /* DefaultClause */ && !hasDuplicateDefaultClause) {
if (firstDefaultClause === undefined) {
firstDefaultClause = clause;
}
else {
grammarErrorOnNode(clause, ts.Diagnostics.A_default_clause_cannot_appear_more_than_once_in_a_switch_statement);
hasDuplicateDefaultClause = true;
}
}
if (produceDiagnostics && clause.kind === 287 /* CaseClause */) {
// TypeScript 1.0 spec (April 2014): 5.9
// In a 'switch' statement, each 'case' expression must be of a type that is comparable
// to or from the type of the 'switch' expression.
var caseType = checkExpression(clause.expression);
var caseIsLiteral = isLiteralType(caseType);
var comparedExpressionType = expressionType;
if (!caseIsLiteral || !expressionIsLiteral) {
caseType = caseIsLiteral ? getBaseTypeOfLiteralType(caseType) : caseType;
comparedExpressionType = getBaseTypeOfLiteralType(expressionType);
}
if (!isTypeEqualityComparableTo(comparedExpressionType, caseType)) {
// expressionType is not comparable to caseType, try the reversed check and report errors if it fails
checkTypeComparableTo(caseType, comparedExpressionType, clause.expression, /*headMessage*/ undefined);
}
}
ts.forEach(clause.statements, checkSourceElement);
if (compilerOptions.noFallthroughCasesInSwitch && clause.fallthroughFlowNode && isReachableFlowNode(clause.fallthroughFlowNode)) {
error(clause, ts.Diagnostics.Fallthrough_case_in_switch);
}
});
if (node.caseBlock.locals) {
registerForUnusedIdentifiersCheck(node.caseBlock);
}
}
function checkLabeledStatement(node) {
// Grammar checking
if (!checkGrammarStatementInAmbientContext(node)) {
ts.findAncestor(node.parent, function (current) {
if (ts.isFunctionLike(current)) {
return "quit";
}
if (current.kind === 248 /* LabeledStatement */ && current.label.escapedText === node.label.escapedText) {
grammarErrorOnNode(node.label, ts.Diagnostics.Duplicate_label_0, ts.getTextOfNode(node.label));
return true;
}
return false;
});
}
// ensure that label is unique
checkSourceElement(node.statement);
}
function checkThrowStatement(node) {
// Grammar checking
if (!checkGrammarStatementInAmbientContext(node)) {
if (ts.isIdentifier(node.expression) && !node.expression.escapedText) {
grammarErrorAfterFirstToken(node, ts.Diagnostics.Line_break_not_permitted_here);
}
}
if (node.expression) {
checkExpression(node.expression);
}
}
function checkTryStatement(node) {
// Grammar checking
checkGrammarStatementInAmbientContext(node);
checkBlock(node.tryBlock);
var catchClause = node.catchClause;
if (catchClause) {
// Grammar checking
if (catchClause.variableDeclaration) {
var declaration = catchClause.variableDeclaration;
var typeNode = ts.getEffectiveTypeAnnotationNode(ts.getRootDeclaration(declaration));
if (typeNode) {
var type = getTypeForVariableLikeDeclaration(declaration, /*includeOptionality*/ false);
if (type && !(type.flags & 3 /* AnyOrUnknown */)) {
grammarErrorOnFirstToken(typeNode, ts.Diagnostics.Catch_clause_variable_type_annotation_must_be_any_or_unknown_if_specified);
}
}
else if (declaration.initializer) {
grammarErrorOnFirstToken(declaration.initializer, ts.Diagnostics.Catch_clause_variable_cannot_have_an_initializer);
}
else {
var blockLocals_1 = catchClause.block.locals;
if (blockLocals_1) {
ts.forEachKey(catchClause.locals, function (caughtName) {
var blockLocal = blockLocals_1.get(caughtName);
if ((blockLocal === null || blockLocal === void 0 ? void 0 : blockLocal.valueDeclaration) && (blockLocal.flags & 2 /* BlockScopedVariable */) !== 0) {
grammarErrorOnNode(blockLocal.valueDeclaration, ts.Diagnostics.Cannot_redeclare_identifier_0_in_catch_clause, caughtName);
}
});
}
}
}
checkBlock(catchClause.block);
}
if (node.finallyBlock) {
checkBlock(node.finallyBlock);
}
}
function checkIndexConstraints(type, isStaticIndex) {
var indexInfos = getIndexInfosOfType(type);
if (indexInfos.length === 0) {
return;
}
for (var _i = 0, _a = getPropertiesOfObjectType(type); _i < _a.length; _i++) {
var prop = _a[_i];
if (!(isStaticIndex && prop.flags & 4194304 /* Prototype */)) {
checkIndexConstraintForProperty(type, prop, getLiteralTypeFromProperty(prop, 8576 /* StringOrNumberLiteralOrUnique */, /*includeNonPublic*/ true), getNonMissingTypeOfSymbol(prop));
}
}
var typeDeclaration = type.symbol.valueDeclaration;
if (typeDeclaration && ts.isClassLike(typeDeclaration)) {
for (var _b = 0, _c = typeDeclaration.members; _b < _c.length; _b++) {
var member = _c[_b];
// Only process instance properties with computed names here. Static properties cannot be in conflict with indexers,
// and properties with literal names were already checked.
if (!ts.isStatic(member) && !hasBindableName(member)) {
var symbol = getSymbolOfNode(member);
checkIndexConstraintForProperty(type, symbol, getTypeOfExpression(member.name.expression), getNonMissingTypeOfSymbol(symbol));
}
}
}
if (indexInfos.length > 1) {
for (var _d = 0, indexInfos_6 = indexInfos; _d < indexInfos_6.length; _d++) {
var info = indexInfos_6[_d];
checkIndexConstraintForIndexSignature(type, info);
}
}
}
function checkIndexConstraintForProperty(type, prop, propNameType, propType) {
var declaration = prop.valueDeclaration;
var name = ts.getNameOfDeclaration(declaration);
if (name && ts.isPrivateIdentifier(name)) {
return;
}
var indexInfos = getApplicableIndexInfos(type, propNameType);
var interfaceDeclaration = ts.getObjectFlags(type) & 2 /* Interface */ ? ts.getDeclarationOfKind(type.symbol, 256 /* InterfaceDeclaration */) : undefined;
var localPropDeclaration = declaration && declaration.kind === 219 /* BinaryExpression */ ||
name && name.kind === 160 /* ComputedPropertyName */ || getParentOfSymbol(prop) === type.symbol ? declaration : undefined;
var _loop_27 = function (info) {
var localIndexDeclaration = info.declaration && getParentOfSymbol(getSymbolOfNode(info.declaration)) === type.symbol ? info.declaration : undefined;
// We check only when (a) the property is declared in the containing type, or (b) the applicable index signature is declared
// in the containing type, or (c) the containing type is an interface and no base interface contains both the property and
// the index signature (i.e. property and index signature are declared in separate inherited interfaces).
var errorNode = localPropDeclaration || localIndexDeclaration ||
(interfaceDeclaration && !ts.some(getBaseTypes(type), function (base) { return !!getPropertyOfObjectType(base, prop.escapedName) && !!getIndexTypeOfType(base, info.keyType); }) ? interfaceDeclaration : undefined);
if (errorNode && !isTypeAssignableTo(propType, info.type)) {
error(errorNode, ts.Diagnostics.Property_0_of_type_1_is_not_assignable_to_2_index_type_3, symbolToString(prop), typeToString(propType), typeToString(info.keyType), typeToString(info.type));
}
};
for (var _i = 0, indexInfos_7 = indexInfos; _i < indexInfos_7.length; _i++) {
var info = indexInfos_7[_i];
_loop_27(info);
}
}
function checkIndexConstraintForIndexSignature(type, checkInfo) {
var declaration = checkInfo.declaration;
var indexInfos = getApplicableIndexInfos(type, checkInfo.keyType);
var interfaceDeclaration = ts.getObjectFlags(type) & 2 /* Interface */ ? ts.getDeclarationOfKind(type.symbol, 256 /* InterfaceDeclaration */) : undefined;
var localCheckDeclaration = declaration && getParentOfSymbol(getSymbolOfNode(declaration)) === type.symbol ? declaration : undefined;
var _loop_28 = function (info) {
if (info === checkInfo)
return "continue";
var localIndexDeclaration = info.declaration && getParentOfSymbol(getSymbolOfNode(info.declaration)) === type.symbol ? info.declaration : undefined;
// We check only when (a) the check index signature is declared in the containing type, or (b) the applicable index
// signature is declared in the containing type, or (c) the containing type is an interface and no base interface contains
// both index signatures (i.e. the index signatures are declared in separate inherited interfaces).
var errorNode = localCheckDeclaration || localIndexDeclaration ||
(interfaceDeclaration && !ts.some(getBaseTypes(type), function (base) { return !!getIndexInfoOfType(base, checkInfo.keyType) && !!getIndexTypeOfType(base, info.keyType); }) ? interfaceDeclaration : undefined);
if (errorNode && !isTypeAssignableTo(checkInfo.type, info.type)) {
error(errorNode, ts.Diagnostics._0_index_type_1_is_not_assignable_to_2_index_type_3, typeToString(checkInfo.keyType), typeToString(checkInfo.type), typeToString(info.keyType), typeToString(info.type));
}
};
for (var _i = 0, indexInfos_8 = indexInfos; _i < indexInfos_8.length; _i++) {
var info = indexInfos_8[_i];
_loop_28(info);
}
}
function checkTypeNameIsReserved(name, message) {
// TS 1.0 spec (April 2014): 3.6.1
// The predefined type keywords are reserved and cannot be used as names of user defined types.
switch (name.escapedText) {
case "any":
case "unknown":
case "never":
case "number":
case "bigint":
case "boolean":
case "string":
case "symbol":
case "void":
case "object":
error(name, message, name.escapedText);
}
}
/**
* The name cannot be used as 'Object' of user defined types with special target.
*/
function checkClassNameCollisionWithObject(name) {
if (languageVersion === 1 /* ES5 */ && name.escapedText === "Object"
&& moduleKind < ts.ModuleKind.ES2015) {
error(name, ts.Diagnostics.Class_name_cannot_be_Object_when_targeting_ES5_with_module_0, ts.ModuleKind[moduleKind]); // https://github.com/Microsoft/TypeScript/issues/17494
}
}
/**
* Check each type parameter and check that type parameters have no duplicate type parameter declarations
*/
function checkTypeParameters(typeParameterDeclarations) {
if (typeParameterDeclarations) {
var seenDefault = false;
for (var i = 0; i < typeParameterDeclarations.length; i++) {
var node = typeParameterDeclarations[i];
checkTypeParameter(node);
if (produceDiagnostics) {
if (node.default) {
seenDefault = true;
checkTypeParametersNotReferenced(node.default, typeParameterDeclarations, i);
}
else if (seenDefault) {
error(node, ts.Diagnostics.Required_type_parameters_may_not_follow_optional_type_parameters);
}
for (var j = 0; j < i; j++) {
if (typeParameterDeclarations[j].symbol === node.symbol) {
error(node.name, ts.Diagnostics.Duplicate_identifier_0, ts.declarationNameToString(node.name));
}
}
}
}
}
}
/** Check that type parameter defaults only reference previously declared type parameters */
function checkTypeParametersNotReferenced(root, typeParameters, index) {
visit(root);
function visit(node) {
if (node.kind === 176 /* TypeReference */) {
var type = getTypeFromTypeReference(node);
if (type.flags & 262144 /* TypeParameter */) {
for (var i = index; i < typeParameters.length; i++) {
if (type.symbol === getSymbolOfNode(typeParameters[i])) {
error(node, ts.Diagnostics.Type_parameter_defaults_can_only_reference_previously_declared_type_parameters);
}
}
}
}
ts.forEachChild(node, visit);
}
}
/** Check that type parameter lists are identical across multiple declarations */
function checkTypeParameterListsIdentical(symbol) {
if (symbol.declarations && symbol.declarations.length === 1) {
return;
}
var links = getSymbolLinks(symbol);
if (!links.typeParametersChecked) {
links.typeParametersChecked = true;
var declarations = getClassOrInterfaceDeclarationsOfSymbol(symbol);
if (!declarations || declarations.length <= 1) {
return;
}
var type = getDeclaredTypeOfSymbol(symbol);
if (!areTypeParametersIdentical(declarations, type.localTypeParameters)) {
// Report an error on every conflicting declaration.
var name = symbolToString(symbol);
for (var _i = 0, declarations_6 = declarations; _i < declarations_6.length; _i++) {
var declaration = declarations_6[_i];
error(declaration.name, ts.Diagnostics.All_declarations_of_0_must_have_identical_type_parameters, name);
}
}
}
}
function areTypeParametersIdentical(declarations, targetParameters) {
var maxTypeArgumentCount = ts.length(targetParameters);
var minTypeArgumentCount = getMinTypeArgumentCount(targetParameters);
for (var _i = 0, declarations_7 = declarations; _i < declarations_7.length; _i++) {
var declaration = declarations_7[_i];
// If this declaration has too few or too many type parameters, we report an error
var sourceParameters = ts.getEffectiveTypeParameterDeclarations(declaration);
var numTypeParameters = sourceParameters.length;
if (numTypeParameters < minTypeArgumentCount || numTypeParameters > maxTypeArgumentCount) {
return false;
}
for (var i = 0; i < numTypeParameters; i++) {
var source = sourceParameters[i];
var target = targetParameters[i];
// If the type parameter node does not have the same as the resolved type
// parameter at this position, we report an error.
if (source.name.escapedText !== target.symbol.escapedName) {
return false;
}
// If the type parameter node does not have an identical constraint as the resolved
// type parameter at this position, we report an error.
var constraint = ts.getEffectiveConstraintOfTypeParameter(source);
var sourceConstraint = constraint && getTypeFromTypeNode(constraint);
var targetConstraint = getConstraintOfTypeParameter(target);
// relax check if later interface augmentation has no constraint, it's more broad and is OK to merge with
// a more constrained interface (this could be generalized to a full hierarchy check, but that's maybe overkill)
if (sourceConstraint && targetConstraint && !isTypeIdenticalTo(sourceConstraint, targetConstraint)) {
return false;
}
// If the type parameter node has a default and it is not identical to the default
// for the type parameter at this position, we report an error.
var sourceDefault = source.default && getTypeFromTypeNode(source.default);
var targetDefault = getDefaultFromTypeParameter(target);
if (sourceDefault && targetDefault && !isTypeIdenticalTo(sourceDefault, targetDefault)) {
return false;
}
}
}
return true;
}
function checkClassExpression(node) {
checkClassLikeDeclaration(node);
checkNodeDeferred(node);
return getTypeOfSymbol(getSymbolOfNode(node));
}
function checkClassExpressionDeferred(node) {
ts.forEach(node.members, checkSourceElement);
registerForUnusedIdentifiersCheck(node);
}
function checkClassDeclaration(node) {
if (ts.some(node.decorators) && ts.some(node.members, function (p) { return ts.hasStaticModifier(p) && ts.isPrivateIdentifierClassElementDeclaration(p); })) {
grammarErrorOnNode(node.decorators[0], ts.Diagnostics.Class_decorators_can_t_be_used_with_static_private_identifier_Consider_removing_the_experimental_decorator);
}
if (!node.name && !ts.hasSyntacticModifier(node, 512 /* Default */)) {
grammarErrorOnFirstToken(node, ts.Diagnostics.A_class_declaration_without_the_default_modifier_must_have_a_name);
}
checkClassLikeDeclaration(node);
ts.forEach(node.members, checkSourceElement);
registerForUnusedIdentifiersCheck(node);
}
function checkClassLikeDeclaration(node) {
checkGrammarClassLikeDeclaration(node);
checkDecorators(node);
checkCollisionsForDeclarationName(node, node.name);
checkTypeParameters(ts.getEffectiveTypeParameterDeclarations(node));
checkExportsOnMergedDeclarations(node);
var symbol = getSymbolOfNode(node);
var type = getDeclaredTypeOfSymbol(symbol);
var typeWithThis = getTypeWithThisArgument(type);
var staticType = getTypeOfSymbol(symbol);
checkTypeParameterListsIdentical(symbol);
checkFunctionOrConstructorSymbol(symbol);
checkClassForDuplicateDeclarations(node);
// Only check for reserved static identifiers on non-ambient context.
var nodeInAmbientContext = !!(node.flags & 8388608 /* Ambient */);
if (!nodeInAmbientContext) {
checkClassForStaticPropertyNameConflicts(node);
}
var baseTypeNode = ts.getEffectiveBaseTypeNode(node);
if (baseTypeNode) {
ts.forEach(baseTypeNode.typeArguments, checkSourceElement);
if (languageVersion < 2 /* ES2015 */) {
checkExternalEmitHelpers(baseTypeNode.parent, 1 /* Extends */);
}
// check both @extends and extends if both are specified.
var extendsNode = ts.getClassExtendsHeritageElement(node);
if (extendsNode && extendsNode !== baseTypeNode) {
checkExpression(extendsNode.expression);
}
var baseTypes = getBaseTypes(type);
if (baseTypes.length && produceDiagnostics) {
var baseType_1 = baseTypes[0];
var baseConstructorType = getBaseConstructorTypeOfClass(type);
var staticBaseType = getApparentType(baseConstructorType);
checkBaseTypeAccessibility(staticBaseType, baseTypeNode);
checkSourceElement(baseTypeNode.expression);
if (ts.some(baseTypeNode.typeArguments)) {
ts.forEach(baseTypeNode.typeArguments, checkSourceElement);
for (var _i = 0, _a = getConstructorsForTypeArguments(staticBaseType, baseTypeNode.typeArguments, baseTypeNode); _i < _a.length; _i++) {
var constructor = _a[_i];
if (!checkTypeArgumentConstraints(baseTypeNode, constructor.typeParameters)) {
break;
}
}
}
var baseWithThis = getTypeWithThisArgument(baseType_1, type.thisType);
if (!checkTypeAssignableTo(typeWithThis, baseWithThis, /*errorNode*/ undefined)) {
issueMemberSpecificError(node, typeWithThis, baseWithThis, ts.Diagnostics.Class_0_incorrectly_extends_base_class_1);
}
else {
// Report static side error only when instance type is assignable
checkTypeAssignableTo(staticType, getTypeWithoutSignatures(staticBaseType), node.name || node, ts.Diagnostics.Class_static_side_0_incorrectly_extends_base_class_static_side_1);
}
if (baseConstructorType.flags & 8650752 /* TypeVariable */) {
if (!isMixinConstructorType(staticType)) {
error(node.name || node, ts.Diagnostics.A_mixin_class_must_have_a_constructor_with_a_single_rest_parameter_of_type_any);
}
else {
var constructSignatures = getSignaturesOfType(baseConstructorType, 1 /* Construct */);
if (constructSignatures.some(function (signature) { return signature.flags & 4 /* Abstract */; }) && !ts.hasSyntacticModifier(node, 128 /* Abstract */)) {
error(node.name || node, ts.Diagnostics.A_mixin_class_that_extends_from_a_type_variable_containing_an_abstract_construct_signature_must_also_be_declared_abstract);
}
}
}
if (!(staticBaseType.symbol && staticBaseType.symbol.flags & 32 /* Class */) && !(baseConstructorType.flags & 8650752 /* TypeVariable */)) {
// When the static base type is a "class-like" constructor function (but not actually a class), we verify
// that all instantiated base constructor signatures return the same type.
var constructors = getInstantiatedConstructorsForTypeArguments(staticBaseType, baseTypeNode.typeArguments, baseTypeNode);
if (ts.forEach(constructors, function (sig) { return !isJSConstructor(sig.declaration) && !isTypeIdenticalTo(getReturnTypeOfSignature(sig), baseType_1); })) {
error(baseTypeNode.expression, ts.Diagnostics.Base_constructors_must_all_have_the_same_return_type);
}
}
checkKindsOfPropertyMemberOverrides(type, baseType_1);
}
}
checkMembersForMissingOverrideModifier(node, type, typeWithThis, staticType);
var implementedTypeNodes = ts.getEffectiveImplementsTypeNodes(node);
if (implementedTypeNodes) {
for (var _b = 0, implementedTypeNodes_1 = implementedTypeNodes; _b < implementedTypeNodes_1.length; _b++) {
var typeRefNode = implementedTypeNodes_1[_b];
if (!ts.isEntityNameExpression(typeRefNode.expression) || ts.isOptionalChain(typeRefNode.expression)) {
error(typeRefNode.expression, ts.Diagnostics.A_class_can_only_implement_an_identifier_Slashqualified_name_with_optional_type_arguments);
}
checkTypeReferenceNode(typeRefNode);
if (produceDiagnostics) {
var t = getReducedType(getTypeFromTypeNode(typeRefNode));
if (t !== errorType) {
if (isValidBaseType(t)) {
var genericDiag = t.symbol && t.symbol.flags & 32 /* Class */ ?
ts.Diagnostics.Class_0_incorrectly_implements_class_1_Did_you_mean_to_extend_1_and_inherit_its_members_as_a_subclass :
ts.Diagnostics.Class_0_incorrectly_implements_interface_1;
var baseWithThis = getTypeWithThisArgument(t, type.thisType);
if (!checkTypeAssignableTo(typeWithThis, baseWithThis, /*errorNode*/ undefined)) {
issueMemberSpecificError(node, typeWithThis, baseWithThis, genericDiag);
}
}
else {
error(typeRefNode, ts.Diagnostics.A_class_can_only_implement_an_object_type_or_intersection_of_object_types_with_statically_known_members);
}
}
}
}
}
if (produceDiagnostics) {
checkIndexConstraints(type);
checkIndexConstraints(staticType, /*isStaticIndex*/ true);
checkTypeForDuplicateIndexSignatures(node);
checkPropertyInitialization(node);
}
}
function checkMembersForMissingOverrideModifier(node, type, typeWithThis, staticType) {
var nodeInAmbientContext = !!(node.flags & 8388608 /* Ambient */);
var baseTypeNode = ts.getEffectiveBaseTypeNode(node);
var baseTypes = baseTypeNode && getBaseTypes(type);
var baseWithThis = (baseTypes === null || baseTypes === void 0 ? void 0 : baseTypes.length) ? getTypeWithThisArgument(ts.first(baseTypes), type.thisType) : undefined;
var baseStaticType = getBaseConstructorTypeOfClass(type);
var _loop_29 = function (member) {
if (ts.hasAmbientModifier(member)) {
return "continue";
}
if (ts.isConstructorDeclaration(member)) {
ts.forEach(member.parameters, function (param) {
if (ts.isParameterPropertyDeclaration(param, member)) {
checkClassMember(param, /*memberIsParameterProperty*/ true);
}
});
}
checkClassMember(member);
};
for (var _i = 0, _a = node.members; _i < _a.length; _i++) {
var member = _a[_i];
_loop_29(member);
}
function checkClassMember(member, memberIsParameterProperty) {
var hasOverride = ts.hasOverrideModifier(member);
var hasStatic = ts.isStatic(member);
if (baseWithThis && (hasOverride || compilerOptions.noImplicitOverride)) {
var declaredProp = member.name && getSymbolAtLocation(member.name) || getSymbolAtLocation(member);
if (!declaredProp) {
return;
}
var thisType = hasStatic ? staticType : typeWithThis;
var baseType = hasStatic ? baseStaticType : baseWithThis;
var prop = getPropertyOfType(thisType, declaredProp.escapedName);
var baseProp = getPropertyOfType(baseType, declaredProp.escapedName);
var baseClassName = typeToString(baseWithThis);
if (prop && !baseProp && hasOverride) {
var suggestion = getSuggestedSymbolForNonexistentClassMember(ts.symbolName(declaredProp), baseType);
suggestion ?
error(member, ts.Diagnostics.This_member_cannot_have_an_override_modifier_because_it_is_not_declared_in_the_base_class_0_Did_you_mean_1, baseClassName, symbolToString(suggestion)) :
error(member, ts.Diagnostics.This_member_cannot_have_an_override_modifier_because_it_is_not_declared_in_the_base_class_0, baseClassName);
}
else if (prop && (baseProp === null || baseProp === void 0 ? void 0 : baseProp.declarations) && compilerOptions.noImplicitOverride && !nodeInAmbientContext) {
var baseHasAbstract = ts.some(baseProp.declarations, function (d) { return ts.hasAbstractModifier(d); });
if (hasOverride) {
return;
}
if (!baseHasAbstract) {
var diag = memberIsParameterProperty ?
ts.Diagnostics.This_parameter_property_must_have_an_override_modifier_because_it_overrides_a_member_in_base_class_0 :
ts.Diagnostics.This_member_must_have_an_override_modifier_because_it_overrides_a_member_in_the_base_class_0;
error(member, diag, baseClassName);
}
else if (ts.hasAbstractModifier(member) && baseHasAbstract) {
error(member, ts.Diagnostics.This_member_must_have_an_override_modifier_because_it_overrides_an_abstract_method_that_is_declared_in_the_base_class_0, baseClassName);
}
}
}
else if (hasOverride) {
var className = typeToString(type);
error(member, ts.Diagnostics.This_member_cannot_have_an_override_modifier_because_its_containing_class_0_does_not_extend_another_class, className);
}
}
}
function issueMemberSpecificError(node, typeWithThis, baseWithThis, broadDiag) {
// iterate over all implemented properties and issue errors on each one which isn't compatible, rather than the class as a whole, if possible
var issuedMemberError = false;
var _loop_30 = function (member) {
if (ts.isStatic(member)) {
return "continue";
}
var declaredProp = member.name && getSymbolAtLocation(member.name) || getSymbolAtLocation(member);
if (declaredProp) {
var prop = getPropertyOfType(typeWithThis, declaredProp.escapedName);
var baseProp = getPropertyOfType(baseWithThis, declaredProp.escapedName);
if (prop && baseProp) {
var rootChain = function () { return ts.chainDiagnosticMessages(
/*details*/ undefined, ts.Diagnostics.Property_0_in_type_1_is_not_assignable_to_the_same_property_in_base_type_2, symbolToString(declaredProp), typeToString(typeWithThis), typeToString(baseWithThis)); };
if (!checkTypeAssignableTo(getTypeOfSymbol(prop), getTypeOfSymbol(baseProp), member.name || member, /*message*/ undefined, rootChain)) {
issuedMemberError = true;
}
}
}
};
for (var _i = 0, _a = node.members; _i < _a.length; _i++) {
var member = _a[_i];
_loop_30(member);
}
if (!issuedMemberError) {
// check again with diagnostics to generate a less-specific error
checkTypeAssignableTo(typeWithThis, baseWithThis, node.name || node, broadDiag);
}
}
function checkBaseTypeAccessibility(type, node) {
var signatures = getSignaturesOfType(type, 1 /* Construct */);
if (signatures.length) {
var declaration = signatures[0].declaration;
if (declaration && ts.hasEffectiveModifier(declaration, 8 /* Private */)) {
var typeClassDeclaration = ts.getClassLikeDeclarationOfSymbol(type.symbol);
if (!isNodeWithinClass(node, typeClassDeclaration)) {
error(node, ts.Diagnostics.Cannot_extend_a_class_0_Class_constructor_is_marked_as_private, getFullyQualifiedName(type.symbol));
}
}
}
}
function getTargetSymbol(s) {
// if symbol is instantiated its flags are not copied from the 'target'
// so we'll need to get back original 'target' symbol to work with correct set of flags
return ts.getCheckFlags(s) & 1 /* Instantiated */ ? s.target : s;
}
function getClassOrInterfaceDeclarationsOfSymbol(symbol) {
return ts.filter(symbol.declarations, function (d) {
return d.kind === 255 /* ClassDeclaration */ || d.kind === 256 /* InterfaceDeclaration */;
});
}
function checkKindsOfPropertyMemberOverrides(type, baseType) {
// TypeScript 1.0 spec (April 2014): 8.2.3
// A derived class inherits all members from its base class it doesn't override.
// Inheritance means that a derived class implicitly contains all non - overridden members of the base class.
// Both public and private property members are inherited, but only public property members can be overridden.
// A property member in a derived class is said to override a property member in a base class
// when the derived class property member has the same name and kind(instance or static)
// as the base class property member.
// The type of an overriding property member must be assignable(section 3.8.4)
// to the type of the overridden property member, or otherwise a compile - time error occurs.
// Base class instance member functions can be overridden by derived class instance member functions,
// but not by other kinds of members.
// Base class instance member variables and accessors can be overridden by
// derived class instance member variables and accessors, but not by other kinds of members.
var _a, _b;
// NOTE: assignability is checked in checkClassDeclaration
var baseProperties = getPropertiesOfType(baseType);
basePropertyCheck: for (var _i = 0, baseProperties_1 = baseProperties; _i < baseProperties_1.length; _i++) {
var baseProperty = baseProperties_1[_i];
var base = getTargetSymbol(baseProperty);
if (base.flags & 4194304 /* Prototype */) {
continue;
}
var baseSymbol = getPropertyOfObjectType(type, base.escapedName);
if (!baseSymbol) {
continue;
}
var derived = getTargetSymbol(baseSymbol);
var baseDeclarationFlags = ts.getDeclarationModifierFlagsFromSymbol(base);
ts.Debug.assert(!!derived, "derived should point to something, even if it is the base class' declaration.");
// In order to resolve whether the inherited method was overridden in the base class or not,
// we compare the Symbols obtained. Since getTargetSymbol returns the symbol on the *uninstantiated*
// type declaration, derived and base resolve to the same symbol even in the case of generic classes.
if (derived === base) {
// derived class inherits base without override/redeclaration
var derivedClassDecl = ts.getClassLikeDeclarationOfSymbol(type.symbol);
// It is an error to inherit an abstract member without implementing it or being declared abstract.
// If there is no declaration for the derived class (as in the case of class expressions),
// then the class cannot be declared abstract.
if (baseDeclarationFlags & 128 /* Abstract */ && (!derivedClassDecl || !ts.hasSyntacticModifier(derivedClassDecl, 128 /* Abstract */))) {
// Searches other base types for a declaration that would satisfy the inherited abstract member.
// (The class may have more than one base type via declaration merging with an interface with the
// same name.)
for (var _c = 0, _d = getBaseTypes(type); _c < _d.length; _c++) {
var otherBaseType = _d[_c];
if (otherBaseType === baseType)
continue;
var baseSymbol_1 = getPropertyOfObjectType(otherBaseType, base.escapedName);
var derivedElsewhere = baseSymbol_1 && getTargetSymbol(baseSymbol_1);
if (derivedElsewhere && derivedElsewhere !== base) {
continue basePropertyCheck;
}
}
if (derivedClassDecl.kind === 224 /* ClassExpression */) {
error(derivedClassDecl, ts.Diagnostics.Non_abstract_class_expression_does_not_implement_inherited_abstract_member_0_from_class_1, symbolToString(baseProperty), typeToString(baseType));
}
else {
error(derivedClassDecl, ts.Diagnostics.Non_abstract_class_0_does_not_implement_inherited_abstract_member_1_from_class_2, typeToString(type), symbolToString(baseProperty), typeToString(baseType));
}
}
}
else {
// derived overrides base.
var derivedDeclarationFlags = ts.getDeclarationModifierFlagsFromSymbol(derived);
if (baseDeclarationFlags & 8 /* Private */ || derivedDeclarationFlags & 8 /* Private */) {
// either base or derived property is private - not override, skip it
continue;
}
var errorMessage = void 0;
var basePropertyFlags = base.flags & 98308 /* PropertyOrAccessor */;
var derivedPropertyFlags = derived.flags & 98308 /* PropertyOrAccessor */;
if (basePropertyFlags && derivedPropertyFlags) {
// property/accessor is overridden with property/accessor
if (baseDeclarationFlags & 128 /* Abstract */ && !(base.valueDeclaration && ts.isPropertyDeclaration(base.valueDeclaration) && base.valueDeclaration.initializer)
|| base.valueDeclaration && base.valueDeclaration.parent.kind === 256 /* InterfaceDeclaration */
|| derived.valueDeclaration && ts.isBinaryExpression(derived.valueDeclaration)) {
// when the base property is abstract or from an interface, base/derived flags don't need to match
// same when the derived property is from an assignment
continue;
}
var overriddenInstanceProperty = basePropertyFlags !== 4 /* Property */ && derivedPropertyFlags === 4 /* Property */;
var overriddenInstanceAccessor = basePropertyFlags === 4 /* Property */ && derivedPropertyFlags !== 4 /* Property */;
if (overriddenInstanceProperty || overriddenInstanceAccessor) {
var errorMessage_1 = overriddenInstanceProperty ?
ts.Diagnostics._0_is_defined_as_an_accessor_in_class_1_but_is_overridden_here_in_2_as_an_instance_property :
ts.Diagnostics._0_is_defined_as_a_property_in_class_1_but_is_overridden_here_in_2_as_an_accessor;
error(ts.getNameOfDeclaration(derived.valueDeclaration) || derived.valueDeclaration, errorMessage_1, symbolToString(base), typeToString(baseType), typeToString(type));
}
else if (useDefineForClassFields) {
var uninitialized = (_a = derived.declarations) === null || _a === void 0 ? void 0 : _a.find(function (d) { return d.kind === 165 /* PropertyDeclaration */ && !d.initializer; });
if (uninitialized
&& !(derived.flags & 33554432 /* Transient */)
&& !(baseDeclarationFlags & 128 /* Abstract */)
&& !(derivedDeclarationFlags & 128 /* Abstract */)
&& !((_b = derived.declarations) === null || _b === void 0 ? void 0 : _b.some(function (d) { return !!(d.flags & 8388608 /* Ambient */); }))) {
var constructor = findConstructorDeclaration(ts.getClassLikeDeclarationOfSymbol(type.symbol));
var propName = uninitialized.name;
if (uninitialized.exclamationToken
|| !constructor
|| !ts.isIdentifier(propName)
|| !strictNullChecks
|| !isPropertyInitializedInConstructor(propName, type, constructor)) {
var errorMessage_2 = ts.Diagnostics.Property_0_will_overwrite_the_base_property_in_1_If_this_is_intentional_add_an_initializer_Otherwise_add_a_declare_modifier_or_remove_the_redundant_declaration;
error(ts.getNameOfDeclaration(derived.valueDeclaration) || derived.valueDeclaration, errorMessage_2, symbolToString(base), typeToString(baseType));
}
}
}
// correct case
continue;
}
else if (isPrototypeProperty(base)) {
if (isPrototypeProperty(derived) || derived.flags & 4 /* Property */) {
// method is overridden with method or property -- correct case
continue;
}
else {
ts.Debug.assert(!!(derived.flags & 98304 /* Accessor */));
errorMessage = ts.Diagnostics.Class_0_defines_instance_member_function_1_but_extended_class_2_defines_it_as_instance_member_accessor;
}
}
else if (base.flags & 98304 /* Accessor */) {
errorMessage = ts.Diagnostics.Class_0_defines_instance_member_accessor_1_but_extended_class_2_defines_it_as_instance_member_function;
}
else {
errorMessage = ts.Diagnostics.Class_0_defines_instance_member_property_1_but_extended_class_2_defines_it_as_instance_member_function;
}
error(ts.getNameOfDeclaration(derived.valueDeclaration) || derived.valueDeclaration, errorMessage, typeToString(baseType), symbolToString(base), typeToString(type));
}
}
}
function getNonInterhitedProperties(type, baseTypes, properties) {
if (!ts.length(baseTypes)) {
return properties;
}
var seen = new ts.Map();
ts.forEach(properties, function (p) { seen.set(p.escapedName, p); });
for (var _i = 0, baseTypes_2 = baseTypes; _i < baseTypes_2.length; _i++) {
var base = baseTypes_2[_i];
var properties_5 = getPropertiesOfType(getTypeWithThisArgument(base, type.thisType));
for (var _a = 0, properties_4 = properties_5; _a < properties_4.length; _a++) {
var prop = properties_4[_a];
var existing = seen.get(prop.escapedName);
if (existing && !isPropertyIdenticalTo(existing, prop)) {
seen.delete(prop.escapedName);
}
}
}
return ts.arrayFrom(seen.values());
}
function checkInheritedPropertiesAreIdentical(type, typeNode) {
var baseTypes = getBaseTypes(type);
if (baseTypes.length < 2) {
return true;
}
var seen = new ts.Map();
ts.forEach(resolveDeclaredMembers(type).declaredProperties, function (p) { seen.set(p.escapedName, { prop: p, containingType: type }); });
var ok = true;
for (var _i = 0, baseTypes_3 = baseTypes; _i < baseTypes_3.length; _i++) {
var base = baseTypes_3[_i];
var properties = getPropertiesOfType(getTypeWithThisArgument(base, type.thisType));
for (var _a = 0, properties_6 = properties; _a < properties_6.length; _a++) {
var prop = properties_6[_a];
var existing = seen.get(prop.escapedName);
if (!existing) {
seen.set(prop.escapedName, { prop: prop, containingType: base });
}
else {
var isInheritedProperty = existing.containingType !== type;
if (isInheritedProperty && !isPropertyIdenticalTo(existing.prop, prop)) {
ok = false;
var typeName1 = typeToString(existing.containingType);
var typeName2 = typeToString(base);
var errorInfo = ts.chainDiagnosticMessages(/*details*/ undefined, ts.Diagnostics.Named_property_0_of_types_1_and_2_are_not_identical, symbolToString(prop), typeName1, typeName2);
errorInfo = ts.chainDiagnosticMessages(errorInfo, ts.Diagnostics.Interface_0_cannot_simultaneously_extend_types_1_and_2, typeToString(type), typeName1, typeName2);
diagnostics.add(ts.createDiagnosticForNodeFromMessageChain(typeNode, errorInfo));
}
}
}
}
return ok;
}
function checkPropertyInitialization(node) {
if (!strictNullChecks || !strictPropertyInitialization || node.flags & 8388608 /* Ambient */) {
return;
}
var constructor = findConstructorDeclaration(node);
for (var _i = 0, _a = node.members; _i < _a.length; _i++) {
var member = _a[_i];
if (ts.getEffectiveModifierFlags(member) & 2 /* Ambient */) {
continue;
}
if (!ts.isStatic(member) && isPropertyWithoutInitializer(member)) {
var propName = member.name;
if (ts.isIdentifier(propName) || ts.isPrivateIdentifier(propName)) {
var type = getTypeOfSymbol(getSymbolOfNode(member));
if (!(type.flags & 3 /* AnyOrUnknown */ || getFalsyFlags(type) & 32768 /* Undefined */)) {
if (!constructor || !isPropertyInitializedInConstructor(propName, type, constructor)) {
error(member.name, ts.Diagnostics.Property_0_has_no_initializer_and_is_not_definitely_assigned_in_the_constructor, ts.declarationNameToString(propName));
}
}
}
}
}
}
function isPropertyWithoutInitializer(node) {
return node.kind === 165 /* PropertyDeclaration */ &&
!ts.hasAbstractModifier(node) &&
!node.exclamationToken &&
!node.initializer;
}
function isPropertyInitializedInStaticBlocks(propName, propType, staticBlocks, startPos, endPos) {
for (var _i = 0, staticBlocks_2 = staticBlocks; _i < staticBlocks_2.length; _i++) {
var staticBlock = staticBlocks_2[_i];
// static block must be within the provided range as they are evaluated in document order (unlike constructors)
if (staticBlock.pos >= startPos && staticBlock.pos <= endPos) {
var reference = ts.factory.createPropertyAccessExpression(ts.factory.createThis(), propName);
ts.setParent(reference.expression, reference);
ts.setParent(reference, staticBlock);
reference.flowNode = staticBlock.returnFlowNode;
var flowType = getFlowTypeOfReference(reference, propType, getOptionalType(propType));
if (!(getFalsyFlags(flowType) & 32768 /* Undefined */)) {
return true;
}
}
}
return false;
}
function isPropertyInitializedInConstructor(propName, propType, constructor) {
var reference = ts.factory.createPropertyAccessExpression(ts.factory.createThis(), propName);
ts.setParent(reference.expression, reference);
ts.setParent(reference, constructor);
reference.flowNode = constructor.returnFlowNode;
var flowType = getFlowTypeOfReference(reference, propType, getOptionalType(propType));
return !(getFalsyFlags(flowType) & 32768 /* Undefined */);
}
function checkInterfaceDeclaration(node) {
// Grammar checking
if (!checkGrammarDecoratorsAndModifiers(node))
checkGrammarInterfaceDeclaration(node);
checkTypeParameters(node.typeParameters);
if (produceDiagnostics) {
checkTypeNameIsReserved(node.name, ts.Diagnostics.Interface_name_cannot_be_0);
checkExportsOnMergedDeclarations(node);
var symbol = getSymbolOfNode(node);
checkTypeParameterListsIdentical(symbol);
// Only check this symbol once
var firstInterfaceDecl = ts.getDeclarationOfKind(symbol, 256 /* InterfaceDeclaration */);
if (node === firstInterfaceDecl) {
var type = getDeclaredTypeOfSymbol(symbol);
var typeWithThis = getTypeWithThisArgument(type);
// run subsequent checks only if first set succeeded
if (checkInheritedPropertiesAreIdentical(type, node.name)) {
for (var _i = 0, _a = getBaseTypes(type); _i < _a.length; _i++) {
var baseType = _a[_i];
checkTypeAssignableTo(typeWithThis, getTypeWithThisArgument(baseType, type.thisType), node.name, ts.Diagnostics.Interface_0_incorrectly_extends_interface_1);
}
checkIndexConstraints(type);
}
}
checkObjectTypeForDuplicateDeclarations(node);
}
ts.forEach(ts.getInterfaceBaseTypeNodes(node), function (heritageElement) {
if (!ts.isEntityNameExpression(heritageElement.expression) || ts.isOptionalChain(heritageElement.expression)) {
error(heritageElement.expression, ts.Diagnostics.An_interface_can_only_extend_an_identifier_Slashqualified_name_with_optional_type_arguments);
}
checkTypeReferenceNode(heritageElement);
});
ts.forEach(node.members, checkSourceElement);
if (produceDiagnostics) {
checkTypeForDuplicateIndexSignatures(node);
registerForUnusedIdentifiersCheck(node);
}
}
function checkTypeAliasDeclaration(node) {
// Grammar checking
checkGrammarDecoratorsAndModifiers(node);
checkTypeNameIsReserved(node.name, ts.Diagnostics.Type_alias_name_cannot_be_0);
checkExportsOnMergedDeclarations(node);
checkTypeParameters(node.typeParameters);
if (node.type.kind === 137 /* IntrinsicKeyword */) {
if (!intrinsicTypeKinds.has(node.name.escapedText) || ts.length(node.typeParameters) !== 1) {
error(node.type, ts.Diagnostics.The_intrinsic_keyword_can_only_be_used_to_declare_compiler_provided_intrinsic_types);
}
}
else {
checkSourceElement(node.type);
registerForUnusedIdentifiersCheck(node);
}
}
function computeEnumMemberValues(node) {
var nodeLinks = getNodeLinks(node);
if (!(nodeLinks.flags & 16384 /* EnumValuesComputed */)) {
nodeLinks.flags |= 16384 /* EnumValuesComputed */;
var autoValue = 0;
for (var _i = 0, _a = node.members; _i < _a.length; _i++) {
var member = _a[_i];
var value = computeMemberValue(member, autoValue);
getNodeLinks(member).enumMemberValue = value;
autoValue = typeof value === "number" ? value + 1 : undefined;
}
}
}
function computeMemberValue(member, autoValue) {
if (ts.isComputedNonLiteralName(member.name)) {
error(member.name, ts.Diagnostics.Computed_property_names_are_not_allowed_in_enums);
}
else {
var text = ts.getTextOfPropertyName(member.name);
if (isNumericLiteralName(text) && !ts.isInfinityOrNaNString(text)) {
error(member.name, ts.Diagnostics.An_enum_member_cannot_have_a_numeric_name);
}
}
if (member.initializer) {
return computeConstantValue(member);
}
// In ambient non-const numeric enum declarations, enum members without initializers are
// considered computed members (as opposed to having auto-incremented values).
if (member.parent.flags & 8388608 /* Ambient */ && !ts.isEnumConst(member.parent) && getEnumKind(getSymbolOfNode(member.parent)) === 0 /* Numeric */) {
return undefined;
}
// If the member declaration specifies no value, the member is considered a constant enum member.
// If the member is the first member in the enum declaration, it is assigned the value zero.
// Otherwise, it is assigned the value of the immediately preceding member plus one, and an error
// occurs if the immediately preceding member is not a constant enum member.
if (autoValue !== undefined) {
return autoValue;
}
error(member.name, ts.Diagnostics.Enum_member_must_have_initializer);
return undefined;
}
function computeConstantValue(member) {
var enumKind = getEnumKind(getSymbolOfNode(member.parent));
var isConstEnum = ts.isEnumConst(member.parent);
var initializer = member.initializer;
var value = enumKind === 1 /* Literal */ && !isLiteralEnumMember(member) ? undefined : evaluate(initializer);
if (value !== undefined) {
if (isConstEnum && typeof value === "number" && !isFinite(value)) {
error(initializer, isNaN(value) ?
ts.Diagnostics.const_enum_member_initializer_was_evaluated_to_disallowed_value_NaN :
ts.Diagnostics.const_enum_member_initializer_was_evaluated_to_a_non_finite_value);
}
}
else if (enumKind === 1 /* Literal */) {
error(initializer, ts.Diagnostics.Computed_values_are_not_permitted_in_an_enum_with_string_valued_members);
return 0;
}
else if (isConstEnum) {
error(initializer, ts.Diagnostics.const_enum_member_initializers_can_only_contain_literal_values_and_other_computed_enum_values);
}
else if (member.parent.flags & 8388608 /* Ambient */) {
error(initializer, ts.Diagnostics.In_ambient_enum_declarations_member_initializer_must_be_constant_expression);
}
else {
// Only here do we need to check that the initializer is assignable to the enum type.
var source = checkExpression(initializer);
if (!isTypeAssignableToKind(source, 296 /* NumberLike */)) {
error(initializer, ts.Diagnostics.Only_numeric_enums_can_have_computed_members_but_this_expression_has_type_0_If_you_do_not_need_exhaustiveness_checks_consider_using_an_object_literal_instead, typeToString(source));
}
else {
checkTypeAssignableTo(source, getDeclaredTypeOfSymbol(getSymbolOfNode(member.parent)), initializer, /*headMessage*/ undefined);
}
}
return value;
function evaluate(expr) {
switch (expr.kind) {
case 217 /* PrefixUnaryExpression */:
var value_2 = evaluate(expr.operand);
if (typeof value_2 === "number") {
switch (expr.operator) {
case 39 /* PlusToken */: return value_2;
case 40 /* MinusToken */: return -value_2;
case 54 /* TildeToken */: return ~value_2;
}
}
break;
case 219 /* BinaryExpression */:
var left = evaluate(expr.left);
var right = evaluate(expr.right);
if (typeof left === "number" && typeof right === "number") {
switch (expr.operatorToken.kind) {
case 51 /* BarToken */: return left | right;
case 50 /* AmpersandToken */: return left & right;
case 48 /* GreaterThanGreaterThanToken */: return left >> right;
case 49 /* GreaterThanGreaterThanGreaterThanToken */: return left >>> right;
case 47 /* LessThanLessThanToken */: return left << right;
case 52 /* CaretToken */: return left ^ right;
case 41 /* AsteriskToken */: return left * right;
case 43 /* SlashToken */: return left / right;
case 39 /* PlusToken */: return left + right;
case 40 /* MinusToken */: return left - right;
case 44 /* PercentToken */: return left % right;
case 42 /* AsteriskAsteriskToken */: return Math.pow(left, right);
}
}
else if (typeof left === "string" && typeof right === "string" && expr.operatorToken.kind === 39 /* PlusToken */) {
return left + right;
}
break;
case 10 /* StringLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
return expr.text;
case 8 /* NumericLiteral */:
checkGrammarNumericLiteral(expr);
return +expr.text;
case 210 /* ParenthesizedExpression */:
return evaluate(expr.expression);
case 79 /* Identifier */:
var identifier = expr;
if (ts.isInfinityOrNaNString(identifier.escapedText)) {
return +(identifier.escapedText);
}
return ts.nodeIsMissing(expr) ? 0 : evaluateEnumMember(expr, getSymbolOfNode(member.parent), identifier.escapedText);
case 205 /* ElementAccessExpression */:
case 204 /* PropertyAccessExpression */:
var ex = expr;
if (isConstantMemberAccess(ex)) {
var type = getTypeOfExpression(ex.expression);
if (type.symbol && type.symbol.flags & 384 /* Enum */) {
var name = void 0;
if (ex.kind === 204 /* PropertyAccessExpression */) {
name = ex.name.escapedText;
}
else {
name = ts.escapeLeadingUnderscores(ts.cast(ex.argumentExpression, ts.isLiteralExpression).text);
}
return evaluateEnumMember(expr, type.symbol, name);
}
}
break;
}
return undefined;
}
function evaluateEnumMember(expr, enumSymbol, name) {
var memberSymbol = enumSymbol.exports.get(name);
if (memberSymbol) {
var declaration = memberSymbol.valueDeclaration;
if (declaration !== member) {
if (declaration && isBlockScopedNameDeclaredBeforeUse(declaration, member)) {
return getEnumMemberValue(declaration);
}
error(expr, ts.Diagnostics.A_member_initializer_in_a_enum_declaration_cannot_reference_members_declared_after_it_including_members_defined_in_other_enums);
return 0;
}
else {
error(expr, ts.Diagnostics.Property_0_is_used_before_being_assigned, symbolToString(memberSymbol));
}
}
return undefined;
}
}
function isConstantMemberAccess(node) {
return node.kind === 79 /* Identifier */ ||
node.kind === 204 /* PropertyAccessExpression */ && isConstantMemberAccess(node.expression) ||
node.kind === 205 /* ElementAccessExpression */ && isConstantMemberAccess(node.expression) &&
ts.isStringLiteralLike(node.argumentExpression);
}
function checkEnumDeclaration(node) {
if (!produceDiagnostics) {
return;
}
// Grammar checking
checkGrammarDecoratorsAndModifiers(node);
checkCollisionsForDeclarationName(node, node.name);
checkExportsOnMergedDeclarations(node);
node.members.forEach(checkEnumMember);
computeEnumMemberValues(node);
// Spec 2014 - Section 9.3:
// It isn't possible for one enum declaration to continue the automatic numbering sequence of another,
// and when an enum type has multiple declarations, only one declaration is permitted to omit a value
// for the first member.
//
// Only perform this check once per symbol
var enumSymbol = getSymbolOfNode(node);
var firstDeclaration = ts.getDeclarationOfKind(enumSymbol, node.kind);
if (node === firstDeclaration) {
if (enumSymbol.declarations && enumSymbol.declarations.length > 1) {
var enumIsConst_1 = ts.isEnumConst(node);
// check that const is placed\omitted on all enum declarations
ts.forEach(enumSymbol.declarations, function (decl) {
if (ts.isEnumDeclaration(decl) && ts.isEnumConst(decl) !== enumIsConst_1) {
error(ts.getNameOfDeclaration(decl), ts.Diagnostics.Enum_declarations_must_all_be_const_or_non_const);
}
});
}
var seenEnumMissingInitialInitializer_1 = false;
ts.forEach(enumSymbol.declarations, function (declaration) {
// return true if we hit a violation of the rule, false otherwise
if (declaration.kind !== 258 /* EnumDeclaration */) {
return false;
}
var enumDeclaration = declaration;
if (!enumDeclaration.members.length) {
return false;
}
var firstEnumMember = enumDeclaration.members[0];
if (!firstEnumMember.initializer) {
if (seenEnumMissingInitialInitializer_1) {
error(firstEnumMember.name, ts.Diagnostics.In_an_enum_with_multiple_declarations_only_one_declaration_can_omit_an_initializer_for_its_first_enum_element);
}
else {
seenEnumMissingInitialInitializer_1 = true;
}
}
});
}
}
function checkEnumMember(node) {
if (ts.isPrivateIdentifier(node.name)) {
error(node, ts.Diagnostics.An_enum_member_cannot_be_named_with_a_private_identifier);
}
}
function getFirstNonAmbientClassOrFunctionDeclaration(symbol) {
var declarations = symbol.declarations;
if (declarations) {
for (var _i = 0, declarations_8 = declarations; _i < declarations_8.length; _i++) {
var declaration = declarations_8[_i];
if ((declaration.kind === 255 /* ClassDeclaration */ ||
(declaration.kind === 254 /* FunctionDeclaration */ && ts.nodeIsPresent(declaration.body))) &&
!(declaration.flags & 8388608 /* Ambient */)) {
return declaration;
}
}
}
return undefined;
}
function inSameLexicalScope(node1, node2) {
var container1 = ts.getEnclosingBlockScopeContainer(node1);
var container2 = ts.getEnclosingBlockScopeContainer(node2);
if (isGlobalSourceFile(container1)) {
return isGlobalSourceFile(container2);
}
else if (isGlobalSourceFile(container2)) {
return false;
}
else {
return container1 === container2;
}
}
function checkModuleDeclaration(node) {
if (produceDiagnostics) {
// Grammar checking
var isGlobalAugmentation = ts.isGlobalScopeAugmentation(node);
var inAmbientContext = node.flags & 8388608 /* Ambient */;
if (isGlobalAugmentation && !inAmbientContext) {
error(node.name, ts.Diagnostics.Augmentations_for_the_global_scope_should_have_declare_modifier_unless_they_appear_in_already_ambient_context);
}
var isAmbientExternalModule = ts.isAmbientModule(node);
var contextErrorMessage = isAmbientExternalModule
? ts.Diagnostics.An_ambient_module_declaration_is_only_allowed_at_the_top_level_in_a_file
: ts.Diagnostics.A_namespace_declaration_is_only_allowed_in_a_namespace_or_module;
if (checkGrammarModuleElementContext(node, contextErrorMessage)) {
// If we hit a module declaration in an illegal context, just bail out to avoid cascading errors.
return;
}
if (!checkGrammarDecoratorsAndModifiers(node)) {
if (!inAmbientContext && node.name.kind === 10 /* StringLiteral */) {
grammarErrorOnNode(node.name, ts.Diagnostics.Only_ambient_modules_can_use_quoted_names);
}
}
if (ts.isIdentifier(node.name)) {
checkCollisionsForDeclarationName(node, node.name);
}
checkExportsOnMergedDeclarations(node);
var symbol = getSymbolOfNode(node);
// The following checks only apply on a non-ambient instantiated module declaration.
if (symbol.flags & 512 /* ValueModule */
&& !inAmbientContext
&& symbol.declarations
&& symbol.declarations.length > 1
&& isInstantiatedModule(node, ts.shouldPreserveConstEnums(compilerOptions))) {
var firstNonAmbientClassOrFunc = getFirstNonAmbientClassOrFunctionDeclaration(symbol);
if (firstNonAmbientClassOrFunc) {
if (ts.getSourceFileOfNode(node) !== ts.getSourceFileOfNode(firstNonAmbientClassOrFunc)) {
error(node.name, ts.Diagnostics.A_namespace_declaration_cannot_be_in_a_different_file_from_a_class_or_function_with_which_it_is_merged);
}
else if (node.pos < firstNonAmbientClassOrFunc.pos) {
error(node.name, ts.Diagnostics.A_namespace_declaration_cannot_be_located_prior_to_a_class_or_function_with_which_it_is_merged);
}
}
// if the module merges with a class declaration in the same lexical scope,
// we need to track this to ensure the correct emit.
var mergedClass = ts.getDeclarationOfKind(symbol, 255 /* ClassDeclaration */);
if (mergedClass &&
inSameLexicalScope(node, mergedClass)) {
getNodeLinks(node).flags |= 32768 /* LexicalModuleMergesWithClass */;
}
}
if (isAmbientExternalModule) {
if (ts.isExternalModuleAugmentation(node)) {
// body of the augmentation should be checked for consistency only if augmentation was applied to its target (either global scope or module)
// otherwise we'll be swamped in cascading errors.
// We can detect if augmentation was applied using following rules:
// - augmentation for a global scope is always applied
// - augmentation for some external module is applied if symbol for augmentation is merged (it was combined with target module).
var checkBody = isGlobalAugmentation || (getSymbolOfNode(node).flags & 33554432 /* Transient */);
if (checkBody && node.body) {
for (var _i = 0, _a = node.body.statements; _i < _a.length; _i++) {
var statement = _a[_i];
checkModuleAugmentationElement(statement, isGlobalAugmentation);
}
}
}
else if (isGlobalSourceFile(node.parent)) {
if (isGlobalAugmentation) {
error(node.name, ts.Diagnostics.Augmentations_for_the_global_scope_can_only_be_directly_nested_in_external_modules_or_ambient_module_declarations);
}
else if (ts.isExternalModuleNameRelative(ts.getTextOfIdentifierOrLiteral(node.name))) {
error(node.name, ts.Diagnostics.Ambient_module_declaration_cannot_specify_relative_module_name);
}
}
else {
if (isGlobalAugmentation) {
error(node.name, ts.Diagnostics.Augmentations_for_the_global_scope_can_only_be_directly_nested_in_external_modules_or_ambient_module_declarations);
}
else {
// Node is not an augmentation and is not located on the script level.
// This means that this is declaration of ambient module that is located in other module or namespace which is prohibited.
error(node.name, ts.Diagnostics.Ambient_modules_cannot_be_nested_in_other_modules_or_namespaces);
}
}
}
}
if (node.body) {
checkSourceElement(node.body);
if (!ts.isGlobalScopeAugmentation(node)) {
registerForUnusedIdentifiersCheck(node);
}
}
}
function checkModuleAugmentationElement(node, isGlobalAugmentation) {
var _a;
switch (node.kind) {
case 235 /* VariableStatement */:
// error each individual name in variable statement instead of marking the entire variable statement
for (var _i = 0, _b = node.declarationList.declarations; _i < _b.length; _i++) {
var decl = _b[_i];
checkModuleAugmentationElement(decl, isGlobalAugmentation);
}
break;
case 269 /* ExportAssignment */:
case 270 /* ExportDeclaration */:
grammarErrorOnFirstToken(node, ts.Diagnostics.Exports_and_export_assignments_are_not_permitted_in_module_augmentations);
break;
case 263 /* ImportEqualsDeclaration */:
case 264 /* ImportDeclaration */:
grammarErrorOnFirstToken(node, ts.Diagnostics.Imports_are_not_permitted_in_module_augmentations_Consider_moving_them_to_the_enclosing_external_module);
break;
case 201 /* BindingElement */:
case 252 /* VariableDeclaration */:
var name = node.name;
if (ts.isBindingPattern(name)) {
for (var _c = 0, _d = name.elements; _c < _d.length; _c++) {
var el = _d[_c];
// mark individual names in binding pattern
checkModuleAugmentationElement(el, isGlobalAugmentation);
}
break;
}
// falls through
case 255 /* ClassDeclaration */:
case 258 /* EnumDeclaration */:
case 254 /* FunctionDeclaration */:
case 256 /* InterfaceDeclaration */:
case 259 /* ModuleDeclaration */:
case 257 /* TypeAliasDeclaration */:
if (isGlobalAugmentation) {
return;
}
var symbol = getSymbolOfNode(node);
if (symbol) {
// module augmentations cannot introduce new names on the top level scope of the module
// this is done it two steps
// 1. quick check - if symbol for node is not merged - this is local symbol to this augmentation - report error
// 2. main check - report error if value declaration of the parent symbol is module augmentation)
var reportError = !(symbol.flags & 33554432 /* Transient */);
if (!reportError) {
// symbol should not originate in augmentation
reportError = !!((_a = symbol.parent) === null || _a === void 0 ? void 0 : _a.declarations) && ts.isExternalModuleAugmentation(symbol.parent.declarations[0]);
}
}
break;
}
}
function getFirstNonModuleExportsIdentifier(node) {
switch (node.kind) {
case 79 /* Identifier */:
return node;
case 159 /* QualifiedName */:
do {
node = node.left;
} while (node.kind !== 79 /* Identifier */);
return node;
case 204 /* PropertyAccessExpression */:
do {
if (ts.isModuleExportsAccessExpression(node.expression) && !ts.isPrivateIdentifier(node.name)) {
return node.name;
}
node = node.expression;
} while (node.kind !== 79 /* Identifier */);
return node;
}
}
function checkExternalImportOrExportDeclaration(node) {
var moduleName = ts.getExternalModuleName(node);
if (!moduleName || ts.nodeIsMissing(moduleName)) {
// Should be a parse error.
return false;
}
if (!ts.isStringLiteral(moduleName)) {
error(moduleName, ts.Diagnostics.String_literal_expected);
return false;
}
var inAmbientExternalModule = node.parent.kind === 260 /* ModuleBlock */ && ts.isAmbientModule(node.parent.parent);
if (node.parent.kind !== 300 /* SourceFile */ && !inAmbientExternalModule) {
error(moduleName, node.kind === 270 /* ExportDeclaration */ ?
ts.Diagnostics.Export_declarations_are_not_permitted_in_a_namespace :
ts.Diagnostics.Import_declarations_in_a_namespace_cannot_reference_a_module);
return false;
}
if (inAmbientExternalModule && ts.isExternalModuleNameRelative(moduleName.text)) {
// we have already reported errors on top level imports/exports in external module augmentations in checkModuleDeclaration
// no need to do this again.
if (!isTopLevelInExternalModuleAugmentation(node)) {
// TypeScript 1.0 spec (April 2013): 12.1.6
// An ExternalImportDeclaration in an AmbientExternalModuleDeclaration may reference
// other external modules only through top - level external module names.
// Relative external module names are not permitted.
error(node, ts.Diagnostics.Import_or_export_declaration_in_an_ambient_module_declaration_cannot_reference_module_through_relative_module_name);
return false;
}
}
return true;
}
function checkAliasSymbol(node) {
var _a;
var symbol = getSymbolOfNode(node);
var target = resolveAlias(symbol);
if (target !== unknownSymbol) {
// For external modules, `symbol` represents the local symbol for an alias.
// This local symbol will merge any other local declarations (excluding other aliases)
// and symbol.flags will contains combined representation for all merged declaration.
// Based on symbol.flags we can compute a set of excluded meanings (meaning that resolved alias should not have,
// otherwise it will conflict with some local declaration). Note that in addition to normal flags we include matching SymbolFlags.Export*
// in order to prevent collisions with declarations that were exported from the current module (they still contribute to local names).
symbol = getMergedSymbol(symbol.exportSymbol || symbol);
var excludedMeanings = (symbol.flags & (111551 /* Value */ | 1048576 /* ExportValue */) ? 111551 /* Value */ : 0) |
(symbol.flags & 788968 /* Type */ ? 788968 /* Type */ : 0) |
(symbol.flags & 1920 /* Namespace */ ? 1920 /* Namespace */ : 0);
if (target.flags & excludedMeanings) {
var message = node.kind === 273 /* ExportSpecifier */ ?
ts.Diagnostics.Export_declaration_conflicts_with_exported_declaration_of_0 :
ts.Diagnostics.Import_declaration_conflicts_with_local_declaration_of_0;
error(node, message, symbolToString(symbol));
}
// Don't allow to re-export something with no value side when `--isolatedModules` is set.
if (compilerOptions.isolatedModules
&& node.kind === 273 /* ExportSpecifier */
&& !node.parent.parent.isTypeOnly
&& !(target.flags & 111551 /* Value */)
&& !(node.flags & 8388608 /* Ambient */)) {
error(node, ts.Diagnostics.Re_exporting_a_type_when_the_isolatedModules_flag_is_provided_requires_using_export_type);
}
if (ts.isImportSpecifier(node) && ((_a = target.declarations) === null || _a === void 0 ? void 0 : _a.every(function (d) { return !!(ts.getCombinedNodeFlags(d) & 134217728 /* Deprecated */); }))) {
addDeprecatedSuggestion(node.name, target.declarations, symbol.escapedName);
}
}
}
function checkImportBinding(node) {
checkCollisionsForDeclarationName(node, node.name);
checkAliasSymbol(node);
if (node.kind === 268 /* ImportSpecifier */ &&
ts.idText(node.propertyName || node.name) === "default" &&
compilerOptions.esModuleInterop &&
moduleKind !== ts.ModuleKind.System && moduleKind < ts.ModuleKind.ES2015) {
checkExternalEmitHelpers(node, 131072 /* ImportDefault */);
}
}
function checkImportDeclaration(node) {
if (checkGrammarModuleElementContext(node, ts.Diagnostics.An_import_declaration_can_only_be_used_in_a_namespace_or_module)) {
// If we hit an import declaration in an illegal context, just bail out to avoid cascading errors.
return;
}
if (!checkGrammarDecoratorsAndModifiers(node) && ts.hasEffectiveModifiers(node)) {
grammarErrorOnFirstToken(node, ts.Diagnostics.An_import_declaration_cannot_have_modifiers);
}
if (checkExternalImportOrExportDeclaration(node)) {
var importClause = node.importClause;
if (importClause && !checkGrammarImportClause(importClause)) {
if (importClause.name) {
checkImportBinding(importClause);
}
if (importClause.namedBindings) {
if (importClause.namedBindings.kind === 266 /* NamespaceImport */) {
checkImportBinding(importClause.namedBindings);
if (moduleKind !== ts.ModuleKind.System && moduleKind < ts.ModuleKind.ES2015 && compilerOptions.esModuleInterop) {
// import * as ns from "foo";
checkExternalEmitHelpers(node, 65536 /* ImportStar */);
}
}
else {
var moduleExisted = resolveExternalModuleName(node, node.moduleSpecifier);
if (moduleExisted) {
ts.forEach(importClause.namedBindings.elements, checkImportBinding);
}
}
}
}
}
}
function checkImportEqualsDeclaration(node) {
if (checkGrammarModuleElementContext(node, ts.Diagnostics.An_import_declaration_can_only_be_used_in_a_namespace_or_module)) {
// If we hit an import declaration in an illegal context, just bail out to avoid cascading errors.
return;
}
checkGrammarDecoratorsAndModifiers(node);
if (ts.isInternalModuleImportEqualsDeclaration(node) || checkExternalImportOrExportDeclaration(node)) {
checkImportBinding(node);
if (ts.hasSyntacticModifier(node, 1 /* Export */)) {
markExportAsReferenced(node);
}
if (node.moduleReference.kind !== 275 /* ExternalModuleReference */) {
var target = resolveAlias(getSymbolOfNode(node));
if (target !== unknownSymbol) {
if (target.flags & 111551 /* Value */) {
// Target is a value symbol, check that it is not hidden by a local declaration with the same name
var moduleName = ts.getFirstIdentifier(node.moduleReference);
if (!(resolveEntityName(moduleName, 111551 /* Value */ | 1920 /* Namespace */).flags & 1920 /* Namespace */)) {
error(moduleName, ts.Diagnostics.Module_0_is_hidden_by_a_local_declaration_with_the_same_name, ts.declarationNameToString(moduleName));
}
}
if (target.flags & 788968 /* Type */) {
checkTypeNameIsReserved(node.name, ts.Diagnostics.Import_name_cannot_be_0);
}
}
if (node.isTypeOnly) {
grammarErrorOnNode(node, ts.Diagnostics.An_import_alias_cannot_use_import_type);
}
}
else {
if (moduleKind >= ts.ModuleKind.ES2015 && !node.isTypeOnly && !(node.flags & 8388608 /* Ambient */)) {
// Import equals declaration is deprecated in es6 or above
grammarErrorOnNode(node, ts.Diagnostics.Import_assignment_cannot_be_used_when_targeting_ECMAScript_modules_Consider_using_import_Asterisk_as_ns_from_mod_import_a_from_mod_import_d_from_mod_or_another_module_format_instead);
}
}
}
}
function checkExportDeclaration(node) {
if (checkGrammarModuleElementContext(node, ts.Diagnostics.An_export_declaration_can_only_be_used_in_a_module)) {
// If we hit an export in an illegal context, just bail out to avoid cascading errors.
return;
}
if (!checkGrammarDecoratorsAndModifiers(node) && ts.hasEffectiveModifiers(node)) {
grammarErrorOnFirstToken(node, ts.Diagnostics.An_export_declaration_cannot_have_modifiers);
}
if (node.moduleSpecifier && node.exportClause && ts.isNamedExports(node.exportClause) && ts.length(node.exportClause.elements) && languageVersion === 0 /* ES3 */) {
checkExternalEmitHelpers(node, 2097152 /* CreateBinding */);
}
checkGrammarExportDeclaration(node);
if (!node.moduleSpecifier || checkExternalImportOrExportDeclaration(node)) {
if (node.exportClause && !ts.isNamespaceExport(node.exportClause)) {
// export { x, y }
// export { x, y } from "foo"
ts.forEach(node.exportClause.elements, checkExportSpecifier);
var inAmbientExternalModule = node.parent.kind === 260 /* ModuleBlock */ && ts.isAmbientModule(node.parent.parent);
var inAmbientNamespaceDeclaration = !inAmbientExternalModule && node.parent.kind === 260 /* ModuleBlock */ &&
!node.moduleSpecifier && node.flags & 8388608 /* Ambient */;
if (node.parent.kind !== 300 /* SourceFile */ && !inAmbientExternalModule && !inAmbientNamespaceDeclaration) {
error(node, ts.Diagnostics.Export_declarations_are_not_permitted_in_a_namespace);
}
}
else {
// export * from "foo"
// export * as ns from "foo";
var moduleSymbol = resolveExternalModuleName(node, node.moduleSpecifier);
if (moduleSymbol && hasExportAssignmentSymbol(moduleSymbol)) {
error(node.moduleSpecifier, ts.Diagnostics.Module_0_uses_export_and_cannot_be_used_with_export_Asterisk, symbolToString(moduleSymbol));
}
else if (node.exportClause) {
checkAliasSymbol(node.exportClause);
}
if (moduleKind !== ts.ModuleKind.System && moduleKind < ts.ModuleKind.ES2015) {
if (node.exportClause) {
// export * as ns from "foo";
// For ES2015 modules, we emit it as a pair of `import * as a_1 ...; export { a_1 as ns }` and don't need the helper.
// We only use the helper here when in esModuleInterop
if (compilerOptions.esModuleInterop) {
checkExternalEmitHelpers(node, 65536 /* ImportStar */);
}
}
else {
// export * from "foo"
checkExternalEmitHelpers(node, 32768 /* ExportStar */);
}
}
}
}
}
function checkGrammarExportDeclaration(node) {
var _a;
var isTypeOnlyExportStar = node.isTypeOnly && ((_a = node.exportClause) === null || _a === void 0 ? void 0 : _a.kind) !== 271 /* NamedExports */;
if (isTypeOnlyExportStar) {
grammarErrorOnNode(node, ts.Diagnostics.Only_named_exports_may_use_export_type);
}
return !isTypeOnlyExportStar;
}
function checkGrammarModuleElementContext(node, errorMessage) {
var isInAppropriateContext = node.parent.kind === 300 /* SourceFile */ || node.parent.kind === 260 /* ModuleBlock */ || node.parent.kind === 259 /* ModuleDeclaration */;
if (!isInAppropriateContext) {
grammarErrorOnFirstToken(node, errorMessage);
}
return !isInAppropriateContext;
}
function importClauseContainsReferencedImport(importClause) {
return ts.forEachImportClauseDeclaration(importClause, function (declaration) {
return !!getSymbolOfNode(declaration).isReferenced;
});
}
function importClauseContainsConstEnumUsedAsValue(importClause) {
return ts.forEachImportClauseDeclaration(importClause, function (declaration) {
return !!getSymbolLinks(getSymbolOfNode(declaration)).constEnumReferenced;
});
}
function canConvertImportDeclarationToTypeOnly(statement) {
return ts.isImportDeclaration(statement) &&
statement.importClause &&
!statement.importClause.isTypeOnly &&
importClauseContainsReferencedImport(statement.importClause) &&
!isReferencedAliasDeclaration(statement.importClause, /*checkChildren*/ true) &&
!importClauseContainsConstEnumUsedAsValue(statement.importClause);
}
function canConvertImportEqualsDeclarationToTypeOnly(statement) {
return ts.isImportEqualsDeclaration(statement) &&
ts.isExternalModuleReference(statement.moduleReference) &&
!statement.isTypeOnly &&
getSymbolOfNode(statement).isReferenced &&
!isReferencedAliasDeclaration(statement, /*checkChildren*/ false) &&
!getSymbolLinks(getSymbolOfNode(statement)).constEnumReferenced;
}
function checkImportsForTypeOnlyConversion(sourceFile) {
for (var _i = 0, _a = sourceFile.statements; _i < _a.length; _i++) {
var statement = _a[_i];
if (canConvertImportDeclarationToTypeOnly(statement) || canConvertImportEqualsDeclarationToTypeOnly(statement)) {
error(statement, ts.Diagnostics.This_import_is_never_used_as_a_value_and_must_use_import_type_because_importsNotUsedAsValues_is_set_to_error);
}
}
}
function checkExportSpecifier(node) {
checkAliasSymbol(node);
if (ts.getEmitDeclarations(compilerOptions)) {
collectLinkedAliases(node.propertyName || node.name, /*setVisibility*/ true);
}
if (!node.parent.parent.moduleSpecifier) {
var exportedName = node.propertyName || node.name;
// find immediate value referenced by exported name (SymbolFlags.Alias is set so we don't chase down aliases)
var symbol = resolveName(exportedName, exportedName.escapedText, 111551 /* Value */ | 788968 /* Type */ | 1920 /* Namespace */ | 2097152 /* Alias */,
/*nameNotFoundMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ true);
if (symbol && (symbol === undefinedSymbol || symbol === globalThisSymbol || symbol.declarations && isGlobalSourceFile(getDeclarationContainer(symbol.declarations[0])))) {
error(exportedName, ts.Diagnostics.Cannot_export_0_Only_local_declarations_can_be_exported_from_a_module, ts.idText(exportedName));
}
else {
markExportAsReferenced(node);
var target = symbol && (symbol.flags & 2097152 /* Alias */ ? resolveAlias(symbol) : symbol);
if (!target || target === unknownSymbol || target.flags & 111551 /* Value */) {
checkExpressionCached(node.propertyName || node.name);
}
}
}
else {
if (compilerOptions.esModuleInterop &&
moduleKind !== ts.ModuleKind.System &&
moduleKind < ts.ModuleKind.ES2015 &&
ts.idText(node.propertyName || node.name) === "default") {
checkExternalEmitHelpers(node, 131072 /* ImportDefault */);
}
}
}
function checkExportAssignment(node) {
var illegalContextMessage = node.isExportEquals
? ts.Diagnostics.An_export_assignment_must_be_at_the_top_level_of_a_file_or_module_declaration
: ts.Diagnostics.A_default_export_must_be_at_the_top_level_of_a_file_or_module_declaration;
if (checkGrammarModuleElementContext(node, illegalContextMessage)) {
// If we hit an export assignment in an illegal context, just bail out to avoid cascading errors.
return;
}
var container = node.parent.kind === 300 /* SourceFile */ ? node.parent : node.parent.parent;
if (container.kind === 259 /* ModuleDeclaration */ && !ts.isAmbientModule(container)) {
if (node.isExportEquals) {
error(node, ts.Diagnostics.An_export_assignment_cannot_be_used_in_a_namespace);
}
else {
error(node, ts.Diagnostics.A_default_export_can_only_be_used_in_an_ECMAScript_style_module);
}
return;
}
// Grammar checking
if (!checkGrammarDecoratorsAndModifiers(node) && ts.hasEffectiveModifiers(node)) {
grammarErrorOnFirstToken(node, ts.Diagnostics.An_export_assignment_cannot_have_modifiers);
}
if (node.expression.kind === 79 /* Identifier */) {
var id = node.expression;
var sym = resolveEntityName(id, 67108863 /* All */, /*ignoreErrors*/ true, /*dontResolveAlias*/ true, node);
if (sym) {
markAliasReferenced(sym, id);
// If not a value, we're interpreting the identifier as a type export, along the lines of (`export { Id as default }`)
var target = sym.flags & 2097152 /* Alias */ ? resolveAlias(sym) : sym;
if (target === unknownSymbol || target.flags & 111551 /* Value */) {
// However if it is a value, we need to check it's being used correctly
checkExpressionCached(node.expression);
}
}
else {
checkExpressionCached(node.expression); // doesn't resolve, check as expression to mark as error
}
if (ts.getEmitDeclarations(compilerOptions)) {
collectLinkedAliases(node.expression, /*setVisibility*/ true);
}
}
else {
checkExpressionCached(node.expression);
}
checkExternalModuleExports(container);
if ((node.flags & 8388608 /* Ambient */) && !ts.isEntityNameExpression(node.expression)) {
grammarErrorOnNode(node.expression, ts.Diagnostics.The_expression_of_an_export_assignment_must_be_an_identifier_or_qualified_name_in_an_ambient_context);
}
if (node.isExportEquals && !(node.flags & 8388608 /* Ambient */)) {
if (moduleKind >= ts.ModuleKind.ES2015) {
// export assignment is not supported in es6 modules
grammarErrorOnNode(node, ts.Diagnostics.Export_assignment_cannot_be_used_when_targeting_ECMAScript_modules_Consider_using_export_default_or_another_module_format_instead);
}
else if (moduleKind === ts.ModuleKind.System) {
// system modules does not support export assignment
grammarErrorOnNode(node, ts.Diagnostics.Export_assignment_is_not_supported_when_module_flag_is_system);
}
}
}
function hasExportedMembers(moduleSymbol) {
return ts.forEachEntry(moduleSymbol.exports, function (_, id) { return id !== "export="; });
}
function checkExternalModuleExports(node) {
var moduleSymbol = getSymbolOfNode(node);
var links = getSymbolLinks(moduleSymbol);
if (!links.exportsChecked) {
var exportEqualsSymbol = moduleSymbol.exports.get("export=");
if (exportEqualsSymbol && hasExportedMembers(moduleSymbol)) {
var declaration = getDeclarationOfAliasSymbol(exportEqualsSymbol) || exportEqualsSymbol.valueDeclaration;
if (declaration && !isTopLevelInExternalModuleAugmentation(declaration) && !ts.isInJSFile(declaration)) {
error(declaration, ts.Diagnostics.An_export_assignment_cannot_be_used_in_a_module_with_other_exported_elements);
}
}
// Checks for export * conflicts
var exports_2 = getExportsOfModule(moduleSymbol);
if (exports_2) {
exports_2.forEach(function (_a, id) {
var declarations = _a.declarations, flags = _a.flags;
if (id === "__export") {
return;
}
// ECMA262: 15.2.1.1 It is a Syntax Error if the ExportedNames of ModuleItemList contains any duplicate entries.
// (TS Exceptions: namespaces, function overloads, enums, and interfaces)
if (flags & (1920 /* Namespace */ | 64 /* Interface */ | 384 /* Enum */)) {
return;
}
var exportedDeclarationsCount = ts.countWhere(declarations, isNotOverloadAndNotAccessor);
if (flags & 524288 /* TypeAlias */ && exportedDeclarationsCount <= 2) {
// it is legal to merge type alias with other values
// so count should be either 1 (just type alias) or 2 (type alias + merged value)
return;
}
if (exportedDeclarationsCount > 1) {
if (!isDuplicatedCommonJSExport(declarations)) {
for (var _i = 0, _b = declarations; _i < _b.length; _i++) {
var declaration = _b[_i];
if (isNotOverload(declaration)) {
diagnostics.add(ts.createDiagnosticForNode(declaration, ts.Diagnostics.Cannot_redeclare_exported_variable_0, ts.unescapeLeadingUnderscores(id)));
}
}
}
}
});
}
links.exportsChecked = true;
}
}
function isDuplicatedCommonJSExport(declarations) {
return declarations
&& declarations.length > 1
&& declarations.every(function (d) { return ts.isInJSFile(d) && ts.isAccessExpression(d) && (ts.isExportsIdentifier(d.expression) || ts.isModuleExportsAccessExpression(d.expression)); });
}
function checkSourceElement(node) {
if (node) {
var saveCurrentNode = currentNode;
currentNode = node;
instantiationCount = 0;
checkSourceElementWorker(node);
currentNode = saveCurrentNode;
}
}
function checkSourceElementWorker(node) {
if (ts.isInJSFile(node)) {
ts.forEach(node.jsDoc, function (_a) {
var tags = _a.tags;
return ts.forEach(tags, checkSourceElement);
});
}
var kind = node.kind;
if (cancellationToken) {
// Only bother checking on a few construct kinds. We don't want to be excessively
// hitting the cancellation token on every node we check.
switch (kind) {
case 259 /* ModuleDeclaration */:
case 255 /* ClassDeclaration */:
case 256 /* InterfaceDeclaration */:
case 254 /* FunctionDeclaration */:
cancellationToken.throwIfCancellationRequested();
}
}
if (kind >= 235 /* FirstStatement */ && kind <= 251 /* LastStatement */ && node.flowNode && !isReachableFlowNode(node.flowNode)) {
errorOrSuggestion(compilerOptions.allowUnreachableCode === false, node, ts.Diagnostics.Unreachable_code_detected);
}
switch (kind) {
case 161 /* TypeParameter */:
return checkTypeParameter(node);
case 162 /* Parameter */:
return checkParameter(node);
case 165 /* PropertyDeclaration */:
return checkPropertyDeclaration(node);
case 164 /* PropertySignature */:
return checkPropertySignature(node);
case 178 /* ConstructorType */:
case 177 /* FunctionType */:
case 172 /* CallSignature */:
case 173 /* ConstructSignature */:
case 174 /* IndexSignature */:
return checkSignatureDeclaration(node);
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
return checkMethodDeclaration(node);
case 168 /* ClassStaticBlockDeclaration */:
return checkClassStaticBlockDeclaration(node);
case 169 /* Constructor */:
return checkConstructorDeclaration(node);
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return checkAccessorDeclaration(node);
case 176 /* TypeReference */:
return checkTypeReferenceNode(node);
case 175 /* TypePredicate */:
return checkTypePredicate(node);
case 179 /* TypeQuery */:
return checkTypeQuery(node);
case 180 /* TypeLiteral */:
return checkTypeLiteral(node);
case 181 /* ArrayType */:
return checkArrayType(node);
case 182 /* TupleType */:
return checkTupleType(node);
case 185 /* UnionType */:
case 186 /* IntersectionType */:
return checkUnionOrIntersectionType(node);
case 189 /* ParenthesizedType */:
case 183 /* OptionalType */:
case 184 /* RestType */:
return checkSourceElement(node.type);
case 190 /* ThisType */:
return checkThisType(node);
case 191 /* TypeOperator */:
return checkTypeOperator(node);
case 187 /* ConditionalType */:
return checkConditionalType(node);
case 188 /* InferType */:
return checkInferType(node);
case 196 /* TemplateLiteralType */:
return checkTemplateLiteralType(node);
case 198 /* ImportType */:
return checkImportType(node);
case 195 /* NamedTupleMember */:
return checkNamedTupleMember(node);
case 323 /* JSDocAugmentsTag */:
return checkJSDocAugmentsTag(node);
case 324 /* JSDocImplementsTag */:
return checkJSDocImplementsTag(node);
case 340 /* JSDocTypedefTag */:
case 333 /* JSDocCallbackTag */:
case 334 /* JSDocEnumTag */:
return checkJSDocTypeAliasTag(node);
case 339 /* JSDocTemplateTag */:
return checkJSDocTemplateTag(node);
case 338 /* JSDocTypeTag */:
return checkJSDocTypeTag(node);
case 335 /* JSDocParameterTag */:
return checkJSDocParameterTag(node);
case 342 /* JSDocPropertyTag */:
return checkJSDocPropertyTag(node);
case 312 /* JSDocFunctionType */:
checkJSDocFunctionType(node);
// falls through
case 310 /* JSDocNonNullableType */:
case 309 /* JSDocNullableType */:
case 307 /* JSDocAllType */:
case 308 /* JSDocUnknownType */:
case 317 /* JSDocTypeLiteral */:
checkJSDocTypeIsInJsFile(node);
ts.forEachChild(node, checkSourceElement);
return;
case 313 /* JSDocVariadicType */:
checkJSDocVariadicType(node);
return;
case 304 /* JSDocTypeExpression */:
return checkSourceElement(node.type);
case 192 /* IndexedAccessType */:
return checkIndexedAccessType(node);
case 193 /* MappedType */:
return checkMappedType(node);
case 254 /* FunctionDeclaration */:
return checkFunctionDeclaration(node);
case 233 /* Block */:
case 260 /* ModuleBlock */:
return checkBlock(node);
case 235 /* VariableStatement */:
return checkVariableStatement(node);
case 236 /* ExpressionStatement */:
return checkExpressionStatement(node);
case 237 /* IfStatement */:
return checkIfStatement(node);
case 238 /* DoStatement */:
return checkDoStatement(node);
case 239 /* WhileStatement */:
return checkWhileStatement(node);
case 240 /* ForStatement */:
return checkForStatement(node);
case 241 /* ForInStatement */:
return checkForInStatement(node);
case 242 /* ForOfStatement */:
return checkForOfStatement(node);
case 243 /* ContinueStatement */:
case 244 /* BreakStatement */:
return checkBreakOrContinueStatement(node);
case 245 /* ReturnStatement */:
return checkReturnStatement(node);
case 246 /* WithStatement */:
return checkWithStatement(node);
case 247 /* SwitchStatement */:
return checkSwitchStatement(node);
case 248 /* LabeledStatement */:
return checkLabeledStatement(node);
case 249 /* ThrowStatement */:
return checkThrowStatement(node);
case 250 /* TryStatement */:
return checkTryStatement(node);
case 252 /* VariableDeclaration */:
return checkVariableDeclaration(node);
case 201 /* BindingElement */:
return checkBindingElement(node);
case 255 /* ClassDeclaration */:
return checkClassDeclaration(node);
case 256 /* InterfaceDeclaration */:
return checkInterfaceDeclaration(node);
case 257 /* TypeAliasDeclaration */:
return checkTypeAliasDeclaration(node);
case 258 /* EnumDeclaration */:
return checkEnumDeclaration(node);
case 259 /* ModuleDeclaration */:
return checkModuleDeclaration(node);
case 264 /* ImportDeclaration */:
return checkImportDeclaration(node);
case 263 /* ImportEqualsDeclaration */:
return checkImportEqualsDeclaration(node);
case 270 /* ExportDeclaration */:
return checkExportDeclaration(node);
case 269 /* ExportAssignment */:
return checkExportAssignment(node);
case 234 /* EmptyStatement */:
case 251 /* DebuggerStatement */:
checkGrammarStatementInAmbientContext(node);
return;
case 274 /* MissingDeclaration */:
return checkMissingDeclaration(node);
}
}
function checkJSDocTypeIsInJsFile(node) {
if (!ts.isInJSFile(node)) {
grammarErrorOnNode(node, ts.Diagnostics.JSDoc_types_can_only_be_used_inside_documentation_comments);
}
}
function checkJSDocVariadicType(node) {
checkJSDocTypeIsInJsFile(node);
checkSourceElement(node.type);
// Only legal location is in the *last* parameter tag or last parameter of a JSDoc function.
var parent = node.parent;
if (ts.isParameter(parent) && ts.isJSDocFunctionType(parent.parent)) {
if (ts.last(parent.parent.parameters) !== parent) {
error(node, ts.Diagnostics.A_rest_parameter_must_be_last_in_a_parameter_list);
}
return;
}
if (!ts.isJSDocTypeExpression(parent)) {
error(node, ts.Diagnostics.JSDoc_may_only_appear_in_the_last_parameter_of_a_signature);
}
var paramTag = node.parent.parent;
if (!ts.isJSDocParameterTag(paramTag)) {
error(node, ts.Diagnostics.JSDoc_may_only_appear_in_the_last_parameter_of_a_signature);
return;
}
var param = ts.getParameterSymbolFromJSDoc(paramTag);
if (!param) {
// We will error in `checkJSDocParameterTag`.
return;
}
var host = ts.getHostSignatureFromJSDoc(paramTag);
if (!host || ts.last(host.parameters).symbol !== param) {
error(node, ts.Diagnostics.A_rest_parameter_must_be_last_in_a_parameter_list);
}
}
function getTypeFromJSDocVariadicType(node) {
var type = getTypeFromTypeNode(node.type);
var parent = node.parent;
var paramTag = node.parent.parent;
if (ts.isJSDocTypeExpression(node.parent) && ts.isJSDocParameterTag(paramTag)) {
// Else we will add a diagnostic, see `checkJSDocVariadicType`.
var host_1 = ts.getHostSignatureFromJSDoc(paramTag);
var isCallbackTag = ts.isJSDocCallbackTag(paramTag.parent.parent);
if (host_1 || isCallbackTag) {
/*
Only return an array type if the corresponding parameter is marked as a rest parameter, or if there are no parameters.
So in the following situation we will not create an array type:
/** @param {...number} a * /
function f(a) {}
Because `a` will just be of type `number | undefined`. A synthetic `...args` will also be added, which *will* get an array type.
*/
var lastParamDeclaration = isCallbackTag
? ts.lastOrUndefined(paramTag.parent.parent.typeExpression.parameters)
: ts.lastOrUndefined(host_1.parameters);
var symbol = ts.getParameterSymbolFromJSDoc(paramTag);
if (!lastParamDeclaration ||
symbol && lastParamDeclaration.symbol === symbol && ts.isRestParameter(lastParamDeclaration)) {
return createArrayType(type);
}
}
}
if (ts.isParameter(parent) && ts.isJSDocFunctionType(parent.parent)) {
return createArrayType(type);
}
return addOptionality(type);
}
// Function and class expression bodies are checked after all statements in the enclosing body. This is
// to ensure constructs like the following are permitted:
// const foo = function () {
// const s = foo();
// return "hello";
// }
// Here, performing a full type check of the body of the function expression whilst in the process of
// determining the type of foo would cause foo to be given type any because of the recursive reference.
// Delaying the type check of the body ensures foo has been assigned a type.
function checkNodeDeferred(node) {
var enclosingFile = ts.getSourceFileOfNode(node);
var links = getNodeLinks(enclosingFile);
if (!(links.flags & 1 /* TypeChecked */)) {
links.deferredNodes = links.deferredNodes || new ts.Map();
var id = getNodeId(node);
links.deferredNodes.set(id, node);
}
}
function checkDeferredNodes(context) {
var links = getNodeLinks(context);
if (links.deferredNodes) {
links.deferredNodes.forEach(checkDeferredNode);
}
}
function checkDeferredNode(node) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("check" /* Check */, "checkDeferredNode", { kind: node.kind, pos: node.pos, end: node.end });
var saveCurrentNode = currentNode;
currentNode = node;
instantiationCount = 0;
switch (node.kind) {
case 206 /* CallExpression */:
case 207 /* NewExpression */:
case 208 /* TaggedTemplateExpression */:
case 163 /* Decorator */:
case 278 /* JsxOpeningElement */:
// These node kinds are deferred checked when overload resolution fails
// To save on work, we ensure the arguments are checked just once, in
// a deferred way
resolveUntypedCall(node);
break;
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
checkFunctionExpressionOrObjectLiteralMethodDeferred(node);
break;
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
checkAccessorDeclaration(node);
break;
case 224 /* ClassExpression */:
checkClassExpressionDeferred(node);
break;
case 277 /* JsxSelfClosingElement */:
checkJsxSelfClosingElementDeferred(node);
break;
case 276 /* JsxElement */:
checkJsxElementDeferred(node);
break;
}
currentNode = saveCurrentNode;
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
}
function checkSourceFile(node) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("check" /* Check */, "checkSourceFile", { path: node.path }, /*separateBeginAndEnd*/ true);
ts.performance.mark("beforeCheck");
checkSourceFileWorker(node);
ts.performance.mark("afterCheck");
ts.performance.measure("Check", "beforeCheck", "afterCheck");
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
}
function unusedIsError(kind, isAmbient) {
if (isAmbient) {
return false;
}
switch (kind) {
case 0 /* Local */:
return !!compilerOptions.noUnusedLocals;
case 1 /* Parameter */:
return !!compilerOptions.noUnusedParameters;
default:
return ts.Debug.assertNever(kind);
}
}
function getPotentiallyUnusedIdentifiers(sourceFile) {
return allPotentiallyUnusedIdentifiers.get(sourceFile.path) || ts.emptyArray;
}
// Fully type check a source file and collect the relevant diagnostics.
function checkSourceFileWorker(node) {
var links = getNodeLinks(node);
if (!(links.flags & 1 /* TypeChecked */)) {
if (ts.skipTypeChecking(node, compilerOptions, host)) {
return;
}
// Grammar checking
checkGrammarSourceFile(node);
ts.clear(potentialThisCollisions);
ts.clear(potentialNewTargetCollisions);
ts.clear(potentialWeakMapSetCollisions);
ts.clear(potentialReflectCollisions);
ts.forEach(node.statements, checkSourceElement);
checkSourceElement(node.endOfFileToken);
checkDeferredNodes(node);
if (ts.isExternalOrCommonJsModule(node)) {
registerForUnusedIdentifiersCheck(node);
}
if (!node.isDeclarationFile && (compilerOptions.noUnusedLocals || compilerOptions.noUnusedParameters)) {
checkUnusedIdentifiers(getPotentiallyUnusedIdentifiers(node), function (containingNode, kind, diag) {
if (!ts.containsParseError(containingNode) && unusedIsError(kind, !!(containingNode.flags & 8388608 /* Ambient */))) {
diagnostics.add(diag);
}
});
}
if (compilerOptions.importsNotUsedAsValues === 2 /* Error */ &&
!node.isDeclarationFile &&
ts.isExternalModule(node)) {
checkImportsForTypeOnlyConversion(node);
}
if (ts.isExternalOrCommonJsModule(node)) {
checkExternalModuleExports(node);
}
if (potentialThisCollisions.length) {
ts.forEach(potentialThisCollisions, checkIfThisIsCapturedInEnclosingScope);
ts.clear(potentialThisCollisions);
}
if (potentialNewTargetCollisions.length) {
ts.forEach(potentialNewTargetCollisions, checkIfNewTargetIsCapturedInEnclosingScope);
ts.clear(potentialNewTargetCollisions);
}
if (potentialWeakMapSetCollisions.length) {
ts.forEach(potentialWeakMapSetCollisions, checkWeakMapSetCollision);
ts.clear(potentialWeakMapSetCollisions);
}
if (potentialReflectCollisions.length) {
ts.forEach(potentialReflectCollisions, checkReflectCollision);
ts.clear(potentialReflectCollisions);
}
links.flags |= 1 /* TypeChecked */;
}
}
function getDiagnostics(sourceFile, ct) {
try {
// Record the cancellation token so it can be checked later on during checkSourceElement.
// Do this in a finally block so we can ensure that it gets reset back to nothing after
// this call is done.
cancellationToken = ct;
return getDiagnosticsWorker(sourceFile);
}
finally {
cancellationToken = undefined;
}
}
function getDiagnosticsWorker(sourceFile) {
throwIfNonDiagnosticsProducing();
if (sourceFile) {
// Some global diagnostics are deferred until they are needed and
// may not be reported in the first call to getGlobalDiagnostics.
// We should catch these changes and report them.
var previousGlobalDiagnostics = diagnostics.getGlobalDiagnostics();
var previousGlobalDiagnosticsSize = previousGlobalDiagnostics.length;
checkSourceFile(sourceFile);
var semanticDiagnostics = diagnostics.getDiagnostics(sourceFile.fileName);
var currentGlobalDiagnostics = diagnostics.getGlobalDiagnostics();
if (currentGlobalDiagnostics !== previousGlobalDiagnostics) {
// If the arrays are not the same reference, new diagnostics were added.
var deferredGlobalDiagnostics = ts.relativeComplement(previousGlobalDiagnostics, currentGlobalDiagnostics, ts.compareDiagnostics);
return ts.concatenate(deferredGlobalDiagnostics, semanticDiagnostics);
}
else if (previousGlobalDiagnosticsSize === 0 && currentGlobalDiagnostics.length > 0) {
// If the arrays are the same reference, but the length has changed, a single
// new diagnostic was added as DiagnosticCollection attempts to reuse the
// same array.
return ts.concatenate(currentGlobalDiagnostics, semanticDiagnostics);
}
return semanticDiagnostics;
}
// Global diagnostics are always added when a file is not provided to
// getDiagnostics
ts.forEach(host.getSourceFiles(), checkSourceFile);
return diagnostics.getDiagnostics();
}
function getGlobalDiagnostics() {
throwIfNonDiagnosticsProducing();
return diagnostics.getGlobalDiagnostics();
}
function throwIfNonDiagnosticsProducing() {
if (!produceDiagnostics) {
throw new Error("Trying to get diagnostics from a type checker that does not produce them.");
}
}
// Language service support
function getSymbolsInScope(location, meaning) {
if (location.flags & 16777216 /* InWithStatement */) {
// We cannot answer semantic questions within a with block, do not proceed any further
return [];
}
var symbols = ts.createSymbolTable();
var isStaticSymbol = false;
populateSymbols();
symbols.delete("this" /* This */); // Not a symbol, a keyword
return symbolsToArray(symbols);
function populateSymbols() {
while (location) {
if (location.locals && !isGlobalSourceFile(location)) {
copySymbols(location.locals, meaning);
}
switch (location.kind) {
case 300 /* SourceFile */:
if (!ts.isExternalModule(location))
break;
// falls through
case 259 /* ModuleDeclaration */:
copyLocallyVisibleExportSymbols(getSymbolOfNode(location).exports, meaning & 2623475 /* ModuleMember */);
break;
case 258 /* EnumDeclaration */:
copySymbols(getSymbolOfNode(location).exports, meaning & 8 /* EnumMember */);
break;
case 224 /* ClassExpression */:
var className = location.name;
if (className) {
copySymbol(location.symbol, meaning);
}
// this fall-through is necessary because we would like to handle
// type parameter inside class expression similar to how we handle it in classDeclaration and interface Declaration.
// falls through
case 255 /* ClassDeclaration */:
case 256 /* InterfaceDeclaration */:
// If we didn't come from static member of class or interface,
// add the type parameters into the symbol table
// (type parameters of classDeclaration/classExpression and interface are in member property of the symbol.
// Note: that the memberFlags come from previous iteration.
if (!isStaticSymbol) {
copySymbols(getMembersOfSymbol(getSymbolOfNode(location)), meaning & 788968 /* Type */);
}
break;
case 211 /* FunctionExpression */:
var funcName = location.name;
if (funcName) {
copySymbol(location.symbol, meaning);
}
break;
}
if (ts.introducesArgumentsExoticObject(location)) {
copySymbol(argumentsSymbol, meaning);
}
isStaticSymbol = ts.isStatic(location);
location = location.parent;
}
copySymbols(globals, meaning);
}
/**
* Copy the given symbol into symbol tables if the symbol has the given meaning
* and it doesn't already existed in the symbol table
* @param key a key for storing in symbol table; if undefined, use symbol.name
* @param symbol the symbol to be added into symbol table
* @param meaning meaning of symbol to filter by before adding to symbol table
*/
function copySymbol(symbol, meaning) {
if (ts.getCombinedLocalAndExportSymbolFlags(symbol) & meaning) {
var id = symbol.escapedName;
// We will copy all symbol regardless of its reserved name because
// symbolsToArray will check whether the key is a reserved name and
// it will not copy symbol with reserved name to the array
if (!symbols.has(id)) {
symbols.set(id, symbol);
}
}
}
function copySymbols(source, meaning) {
if (meaning) {
source.forEach(function (symbol) {
copySymbol(symbol, meaning);
});
}
}
function copyLocallyVisibleExportSymbols(source, meaning) {
if (meaning) {
source.forEach(function (symbol) {
// Similar condition as in `resolveNameHelper`
if (!ts.getDeclarationOfKind(symbol, 273 /* ExportSpecifier */) && !ts.getDeclarationOfKind(symbol, 272 /* NamespaceExport */)) {
copySymbol(symbol, meaning);
}
});
}
}
}
function isTypeDeclarationName(name) {
return name.kind === 79 /* Identifier */ &&
isTypeDeclaration(name.parent) &&
ts.getNameOfDeclaration(name.parent) === name;
}
function isTypeDeclaration(node) {
switch (node.kind) {
case 161 /* TypeParameter */:
case 255 /* ClassDeclaration */:
case 256 /* InterfaceDeclaration */:
case 257 /* TypeAliasDeclaration */:
case 258 /* EnumDeclaration */:
case 340 /* JSDocTypedefTag */:
case 333 /* JSDocCallbackTag */:
case 334 /* JSDocEnumTag */:
return true;
case 265 /* ImportClause */:
return node.isTypeOnly;
case 268 /* ImportSpecifier */:
case 273 /* ExportSpecifier */:
return node.parent.parent.isTypeOnly;
default:
return false;
}
}
// True if the given identifier is part of a type reference
function isTypeReferenceIdentifier(node) {
while (node.parent.kind === 159 /* QualifiedName */) {
node = node.parent;
}
return node.parent.kind === 176 /* TypeReference */;
}
function isHeritageClauseElementIdentifier(node) {
while (node.parent.kind === 204 /* PropertyAccessExpression */) {
node = node.parent;
}
return node.parent.kind === 226 /* ExpressionWithTypeArguments */;
}
function forEachEnclosingClass(node, callback) {
var result;
while (true) {
node = ts.getContainingClass(node);
if (!node)
break;
if (result = callback(node))
break;
}
return result;
}
function isNodeUsedDuringClassInitialization(node) {
return !!ts.findAncestor(node, function (element) {
if (ts.isConstructorDeclaration(element) && ts.nodeIsPresent(element.body) || ts.isPropertyDeclaration(element)) {
return true;
}
else if (ts.isClassLike(element) || ts.isFunctionLikeDeclaration(element)) {
return "quit";
}
return false;
});
}
function isNodeWithinClass(node, classDeclaration) {
return !!forEachEnclosingClass(node, function (n) { return n === classDeclaration; });
}
function getLeftSideOfImportEqualsOrExportAssignment(nodeOnRightSide) {
while (nodeOnRightSide.parent.kind === 159 /* QualifiedName */) {
nodeOnRightSide = nodeOnRightSide.parent;
}
if (nodeOnRightSide.parent.kind === 263 /* ImportEqualsDeclaration */) {
return nodeOnRightSide.parent.moduleReference === nodeOnRightSide ? nodeOnRightSide.parent : undefined;
}
if (nodeOnRightSide.parent.kind === 269 /* ExportAssignment */) {
return nodeOnRightSide.parent.expression === nodeOnRightSide ? nodeOnRightSide.parent : undefined;
}
return undefined;
}
function isInRightSideOfImportOrExportAssignment(node) {
return getLeftSideOfImportEqualsOrExportAssignment(node) !== undefined;
}
function getSpecialPropertyAssignmentSymbolFromEntityName(entityName) {
var specialPropertyAssignmentKind = ts.getAssignmentDeclarationKind(entityName.parent.parent);
switch (specialPropertyAssignmentKind) {
case 1 /* ExportsProperty */:
case 3 /* PrototypeProperty */:
return getSymbolOfNode(entityName.parent);
case 4 /* ThisProperty */:
case 2 /* ModuleExports */:
case 5 /* Property */:
return getSymbolOfNode(entityName.parent.parent);
}
}
function isImportTypeQualifierPart(node) {
var parent = node.parent;
while (ts.isQualifiedName(parent)) {
node = parent;
parent = parent.parent;
}
if (parent && parent.kind === 198 /* ImportType */ && parent.qualifier === node) {
return parent;
}
return undefined;
}
function getSymbolOfNameOrPropertyAccessExpression(name) {
if (ts.isDeclarationName(name)) {
return getSymbolOfNode(name.parent);
}
if (ts.isInJSFile(name) &&
name.parent.kind === 204 /* PropertyAccessExpression */ &&
name.parent === name.parent.parent.left) {
// Check if this is a special property assignment
if (!ts.isPrivateIdentifier(name) && !ts.isJSDocMemberName(name)) {
var specialPropertyAssignmentSymbol = getSpecialPropertyAssignmentSymbolFromEntityName(name);
if (specialPropertyAssignmentSymbol) {
return specialPropertyAssignmentSymbol;
}
}
}
if (name.parent.kind === 269 /* ExportAssignment */ && ts.isEntityNameExpression(name)) {
// Even an entity name expression that doesn't resolve as an entityname may still typecheck as a property access expression
var success = resolveEntityName(name,
/*all meanings*/ 111551 /* Value */ | 788968 /* Type */ | 1920 /* Namespace */ | 2097152 /* Alias */, /*ignoreErrors*/ true);
if (success && success !== unknownSymbol) {
return success;
}
}
else if (ts.isEntityName(name) && isInRightSideOfImportOrExportAssignment(name)) {
// Since we already checked for ExportAssignment, this really could only be an Import
var importEqualsDeclaration = ts.getAncestor(name, 263 /* ImportEqualsDeclaration */);
ts.Debug.assert(importEqualsDeclaration !== undefined);
return getSymbolOfPartOfRightHandSideOfImportEquals(name, /*dontResolveAlias*/ true);
}
if (ts.isEntityName(name)) {
var possibleImportNode = isImportTypeQualifierPart(name);
if (possibleImportNode) {
getTypeFromTypeNode(possibleImportNode);
var sym = getNodeLinks(name).resolvedSymbol;
return sym === unknownSymbol ? undefined : sym;
}
}
while (ts.isRightSideOfQualifiedNameOrPropertyAccessOrJSDocMemberName(name)) {
name = name.parent;
}
if (isHeritageClauseElementIdentifier(name)) {
var meaning = 0 /* None */;
// In an interface or class, we're definitely interested in a type.
if (name.parent.kind === 226 /* ExpressionWithTypeArguments */) {
meaning = 788968 /* Type */;
// In a class 'extends' clause we are also looking for a value.
if (ts.isExpressionWithTypeArgumentsInClassExtendsClause(name.parent)) {
meaning |= 111551 /* Value */;
}
}
else {
meaning = 1920 /* Namespace */;
}
meaning |= 2097152 /* Alias */;
var entityNameSymbol = ts.isEntityNameExpression(name) ? resolveEntityName(name, meaning) : undefined;
if (entityNameSymbol) {
return entityNameSymbol;
}
}
if (name.parent.kind === 335 /* JSDocParameterTag */) {
return ts.getParameterSymbolFromJSDoc(name.parent);
}
if (name.parent.kind === 161 /* TypeParameter */ && name.parent.parent.kind === 339 /* JSDocTemplateTag */) {
ts.Debug.assert(!ts.isInJSFile(name)); // Otherwise `isDeclarationName` would have been true.
var typeParameter = ts.getTypeParameterFromJsDoc(name.parent);
return typeParameter && typeParameter.symbol;
}
if (ts.isExpressionNode(name)) {
if (ts.nodeIsMissing(name)) {
// Missing entity name.
return undefined;
}
var isJSDoc_1 = ts.findAncestor(name, ts.or(ts.isJSDocLinkLike, ts.isJSDocNameReference, ts.isJSDocMemberName));
var meaning = isJSDoc_1 ? 788968 /* Type */ | 1920 /* Namespace */ | 111551 /* Value */ : 111551 /* Value */;
if (name.kind === 79 /* Identifier */) {
if (ts.isJSXTagName(name) && isJsxIntrinsicIdentifier(name)) {
var symbol = getIntrinsicTagSymbol(name.parent);
return symbol === unknownSymbol ? undefined : symbol;
}
var result = resolveEntityName(name, meaning, /*ignoreErrors*/ false, /*dontResolveAlias*/ !isJSDoc_1, ts.getHostSignatureFromJSDoc(name));
if (!result && isJSDoc_1) {
var container = ts.findAncestor(name, ts.or(ts.isClassLike, ts.isInterfaceDeclaration));
if (container) {
return resolveJSDocMemberName(name, getSymbolOfNode(container));
}
}
return result;
}
else if (name.kind === 204 /* PropertyAccessExpression */ || name.kind === 159 /* QualifiedName */) {
var links = getNodeLinks(name);
if (links.resolvedSymbol) {
return links.resolvedSymbol;
}
if (name.kind === 204 /* PropertyAccessExpression */) {
checkPropertyAccessExpression(name, 0 /* Normal */);
}
else {
checkQualifiedName(name, 0 /* Normal */);
}
if (!links.resolvedSymbol && isJSDoc_1 && ts.isQualifiedName(name)) {
return resolveJSDocMemberName(name);
}
return links.resolvedSymbol;
}
else if (ts.isJSDocMemberName(name)) {
return resolveJSDocMemberName(name);
}
}
else if (isTypeReferenceIdentifier(name)) {
var meaning = name.parent.kind === 176 /* TypeReference */ ? 788968 /* Type */ : 1920 /* Namespace */;
return resolveEntityName(name, meaning, /*ignoreErrors*/ false, /*dontResolveAlias*/ true);
}
if (name.parent.kind === 175 /* TypePredicate */) {
return resolveEntityName(name, /*meaning*/ 1 /* FunctionScopedVariable */);
}
return undefined;
}
/**
* Recursively resolve entity names and jsdoc instance references:
* 1. K#m as K.prototype.m for a class (or other value) K
* 2. K.m as K.prototype.m
* 3. I.m as I.m for a type I, or any other I.m that fails to resolve in (1) or (2)
*
* For unqualified names, a container K may be provided as a second argument.
*/
function resolveJSDocMemberName(name, container) {
if (ts.isEntityName(name)) {
// resolve static values first
var meaning = 788968 /* Type */ | 1920 /* Namespace */ | 111551 /* Value */;
var symbol = resolveEntityName(name, meaning, /*ignoreErrors*/ false, /*dontResolveAlias*/ true, ts.getHostSignatureFromJSDoc(name));
if (!symbol && ts.isIdentifier(name) && container) {
symbol = getMergedSymbol(getSymbol(getExportsOfSymbol(container), name.escapedText, meaning));
}
if (symbol) {
return symbol;
}
}
var left = ts.isIdentifier(name) ? container : resolveJSDocMemberName(name.left);
var right = ts.isIdentifier(name) ? name.escapedText : name.right.escapedText;
if (left) {
var proto = left.flags & 111551 /* Value */ && getPropertyOfType(getTypeOfSymbol(left), "prototype");
var t = proto ? getTypeOfSymbol(proto) : getDeclaredTypeOfSymbol(left);
return getPropertyOfType(t, right);
}
}
function getSymbolAtLocation(node, ignoreErrors) {
if (node.kind === 300 /* SourceFile */) {
return ts.isExternalModule(node) ? getMergedSymbol(node.symbol) : undefined;
}
var parent = node.parent;
var grandParent = parent.parent;
if (node.flags & 16777216 /* InWithStatement */) {
// We cannot answer semantic questions within a with block, do not proceed any further
return undefined;
}
if (isDeclarationNameOrImportPropertyName(node)) {
// This is a declaration, call getSymbolOfNode
var parentSymbol = getSymbolOfNode(parent);
return ts.isImportOrExportSpecifier(node.parent) && node.parent.propertyName === node
? getImmediateAliasedSymbol(parentSymbol)
: parentSymbol;
}
else if (ts.isLiteralComputedPropertyDeclarationName(node)) {
return getSymbolOfNode(parent.parent);
}
if (node.kind === 79 /* Identifier */) {
if (isInRightSideOfImportOrExportAssignment(node)) {
return getSymbolOfNameOrPropertyAccessExpression(node);
}
else if (parent.kind === 201 /* BindingElement */ &&
grandParent.kind === 199 /* ObjectBindingPattern */ &&
node === parent.propertyName) {
var typeOfPattern = getTypeOfNode(grandParent);
var propertyDeclaration = getPropertyOfType(typeOfPattern, node.escapedText);
if (propertyDeclaration) {
return propertyDeclaration;
}
}
else if (ts.isMetaProperty(parent)) {
var parentType = getTypeOfNode(parent);
var propertyDeclaration = getPropertyOfType(parentType, node.escapedText);
if (propertyDeclaration) {
return propertyDeclaration;
}
if (parent.keywordToken === 103 /* NewKeyword */) {
return checkNewTargetMetaProperty(parent).symbol;
}
}
}
switch (node.kind) {
case 79 /* Identifier */:
case 80 /* PrivateIdentifier */:
case 204 /* PropertyAccessExpression */:
case 159 /* QualifiedName */:
return getSymbolOfNameOrPropertyAccessExpression(node);
case 108 /* ThisKeyword */:
var container = ts.getThisContainer(node, /*includeArrowFunctions*/ false);
if (ts.isFunctionLike(container)) {
var sig = getSignatureFromDeclaration(container);
if (sig.thisParameter) {
return sig.thisParameter;
}
}
if (ts.isInExpressionContext(node)) {
return checkExpression(node).symbol;
}
// falls through
case 190 /* ThisType */:
return getTypeFromThisTypeNode(node).symbol;
case 106 /* SuperKeyword */:
return checkExpression(node).symbol;
case 133 /* ConstructorKeyword */:
// constructor keyword for an overload, should take us to the definition if it exist
var constructorDeclaration = node.parent;
if (constructorDeclaration && constructorDeclaration.kind === 169 /* Constructor */) {
return constructorDeclaration.parent.symbol;
}
return undefined;
case 10 /* StringLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
// 1). import x = require("./mo/*gotToDefinitionHere*/d")
// 2). External module name in an import declaration
// 3). Dynamic import call or require in javascript
// 4). type A = import("./f/*gotToDefinitionHere*/oo")
if ((ts.isExternalModuleImportEqualsDeclaration(node.parent.parent) && ts.getExternalModuleImportEqualsDeclarationExpression(node.parent.parent) === node) ||
((node.parent.kind === 264 /* ImportDeclaration */ || node.parent.kind === 270 /* ExportDeclaration */) && node.parent.moduleSpecifier === node) ||
((ts.isInJSFile(node) && ts.isRequireCall(node.parent, /*checkArgumentIsStringLiteralLike*/ false)) || ts.isImportCall(node.parent)) ||
(ts.isLiteralTypeNode(node.parent) && ts.isLiteralImportTypeNode(node.parent.parent) && node.parent.parent.argument === node.parent)) {
return resolveExternalModuleName(node, node, ignoreErrors);
}
if (ts.isCallExpression(parent) && ts.isBindableObjectDefinePropertyCall(parent) && parent.arguments[1] === node) {
return getSymbolOfNode(parent);
}
// falls through
case 8 /* NumericLiteral */:
// index access
var objectType = ts.isElementAccessExpression(parent)
? parent.argumentExpression === node ? getTypeOfExpression(parent.expression) : undefined
: ts.isLiteralTypeNode(parent) && ts.isIndexedAccessTypeNode(grandParent)
? getTypeFromTypeNode(grandParent.objectType)
: undefined;
return objectType && getPropertyOfType(objectType, ts.escapeLeadingUnderscores(node.text));
case 88 /* DefaultKeyword */:
case 98 /* FunctionKeyword */:
case 38 /* EqualsGreaterThanToken */:
case 84 /* ClassKeyword */:
return getSymbolOfNode(node.parent);
case 198 /* ImportType */:
return ts.isLiteralImportTypeNode(node) ? getSymbolAtLocation(node.argument.literal, ignoreErrors) : undefined;
case 93 /* ExportKeyword */:
return ts.isExportAssignment(node.parent) ? ts.Debug.checkDefined(node.parent.symbol) : undefined;
case 100 /* ImportKeyword */:
case 103 /* NewKeyword */:
return ts.isMetaProperty(node.parent) ? checkMetaPropertyKeyword(node.parent).symbol : undefined;
case 229 /* MetaProperty */:
return checkExpression(node).symbol;
default:
return undefined;
}
}
function getIndexInfosAtLocation(node) {
if (ts.isIdentifier(node) && ts.isPropertyAccessExpression(node.parent) && node.parent.name === node) {
var keyType_1 = getLiteralTypeFromPropertyName(node);
var objectType = getTypeOfExpression(node.parent.expression);
var objectTypes = objectType.flags & 1048576 /* Union */ ? objectType.types : [objectType];
return ts.flatMap(objectTypes, function (t) { return ts.filter(getIndexInfosOfType(t), function (info) { return isApplicableIndexType(keyType_1, info.keyType); }); });
}
return undefined;
}
function getShorthandAssignmentValueSymbol(location) {
if (location && location.kind === 292 /* ShorthandPropertyAssignment */) {
return resolveEntityName(location.name, 111551 /* Value */ | 2097152 /* Alias */);
}
return undefined;
}
/** Returns the target of an export specifier without following aliases */
function getExportSpecifierLocalTargetSymbol(node) {
if (ts.isExportSpecifier(node)) {
return node.parent.parent.moduleSpecifier ?
getExternalModuleMember(node.parent.parent, node) :
resolveEntityName(node.propertyName || node.name, 111551 /* Value */ | 788968 /* Type */ | 1920 /* Namespace */ | 2097152 /* Alias */);
}
else {
return resolveEntityName(node, 111551 /* Value */ | 788968 /* Type */ | 1920 /* Namespace */ | 2097152 /* Alias */);
}
}
function getTypeOfNode(node) {
if (ts.isSourceFile(node) && !ts.isExternalModule(node)) {
return errorType;
}
if (node.flags & 16777216 /* InWithStatement */) {
// We cannot answer semantic questions within a with block, do not proceed any further
return errorType;
}
var classDecl = ts.tryGetClassImplementingOrExtendingExpressionWithTypeArguments(node);
var classType = classDecl && getDeclaredTypeOfClassOrInterface(getSymbolOfNode(classDecl.class));
if (ts.isPartOfTypeNode(node)) {
var typeFromTypeNode = getTypeFromTypeNode(node);
return classType ? getTypeWithThisArgument(typeFromTypeNode, classType.thisType) : typeFromTypeNode;
}
if (ts.isExpressionNode(node)) {
return getRegularTypeOfExpression(node);
}
if (classType && !classDecl.isImplements) {
// A SyntaxKind.ExpressionWithTypeArguments is considered a type node, except when it occurs in the
// extends clause of a class. We handle that case here.
var baseType = ts.firstOrUndefined(getBaseTypes(classType));
return baseType ? getTypeWithThisArgument(baseType, classType.thisType) : errorType;
}
if (isTypeDeclaration(node)) {
// In this case, we call getSymbolOfNode instead of getSymbolAtLocation because it is a declaration
var symbol = getSymbolOfNode(node);
return getDeclaredTypeOfSymbol(symbol);
}
if (isTypeDeclarationName(node)) {
var symbol = getSymbolAtLocation(node);
return symbol ? getDeclaredTypeOfSymbol(symbol) : errorType;
}
if (ts.isDeclaration(node)) {
// In this case, we call getSymbolOfNode instead of getSymbolAtLocation because it is a declaration
var symbol = getSymbolOfNode(node);
return getTypeOfSymbol(symbol);
}
if (isDeclarationNameOrImportPropertyName(node)) {
var symbol = getSymbolAtLocation(node);
if (symbol) {
return getTypeOfSymbol(symbol);
}
return errorType;
}
if (ts.isBindingPattern(node)) {
return getTypeForVariableLikeDeclaration(node.parent, /*includeOptionality*/ true) || errorType;
}
if (isInRightSideOfImportOrExportAssignment(node)) {
var symbol = getSymbolAtLocation(node);
if (symbol) {
var declaredType = getDeclaredTypeOfSymbol(symbol);
return declaredType !== errorType ? declaredType : getTypeOfSymbol(symbol);
}
}
if (ts.isMetaProperty(node.parent) && node.parent.keywordToken === node.kind) {
return checkMetaPropertyKeyword(node.parent);
}
return errorType;
}
// Gets the type of object literal or array literal of destructuring assignment.
// { a } from
// for ( { a } of elems) {
// }
// [ a ] from
// [a] = [ some array ...]
function getTypeOfAssignmentPattern(expr) {
ts.Debug.assert(expr.kind === 203 /* ObjectLiteralExpression */ || expr.kind === 202 /* ArrayLiteralExpression */);
// If this is from "for of"
// for ( { a } of elems) {
// }
if (expr.parent.kind === 242 /* ForOfStatement */) {
var iteratedType = checkRightHandSideOfForOf(expr.parent);
return checkDestructuringAssignment(expr, iteratedType || errorType);
}
// If this is from "for" initializer
// for ({a } = elems[0];.....) { }
if (expr.parent.kind === 219 /* BinaryExpression */) {
var iteratedType = getTypeOfExpression(expr.parent.right);
return checkDestructuringAssignment(expr, iteratedType || errorType);
}
// If this is from nested object binding pattern
// for ({ skills: { primary, secondary } } = multiRobot, i = 0; i < 1; i++) {
if (expr.parent.kind === 291 /* PropertyAssignment */) {
var node_3 = ts.cast(expr.parent.parent, ts.isObjectLiteralExpression);
var typeOfParentObjectLiteral = getTypeOfAssignmentPattern(node_3) || errorType;
var propertyIndex = ts.indexOfNode(node_3.properties, expr.parent);
return checkObjectLiteralDestructuringPropertyAssignment(node_3, typeOfParentObjectLiteral, propertyIndex);
}
// Array literal assignment - array destructuring pattern
var node = ts.cast(expr.parent, ts.isArrayLiteralExpression);
// [{ property1: p1, property2 }] = elems;
var typeOfArrayLiteral = getTypeOfAssignmentPattern(node) || errorType;
var elementType = checkIteratedTypeOrElementType(65 /* Destructuring */, typeOfArrayLiteral, undefinedType, expr.parent) || errorType;
return checkArrayLiteralDestructuringElementAssignment(node, typeOfArrayLiteral, node.elements.indexOf(expr), elementType);
}
// Gets the property symbol corresponding to the property in destructuring assignment
// 'property1' from
// for ( { property1: a } of elems) {
// }
// 'property1' at location 'a' from:
// [a] = [ property1, property2 ]
function getPropertySymbolOfDestructuringAssignment(location) {
// Get the type of the object or array literal and then look for property of given name in the type
var typeOfObjectLiteral = getTypeOfAssignmentPattern(ts.cast(location.parent.parent, ts.isAssignmentPattern));
return typeOfObjectLiteral && getPropertyOfType(typeOfObjectLiteral, location.escapedText);
}
function getRegularTypeOfExpression(expr) {
if (ts.isRightSideOfQualifiedNameOrPropertyAccess(expr)) {
expr = expr.parent;
}
return getRegularTypeOfLiteralType(getTypeOfExpression(expr));
}
/**
* Gets either the static or instance type of a class element, based on
* whether the element is declared as "static".
*/
function getParentTypeOfClassElement(node) {
var classSymbol = getSymbolOfNode(node.parent);
return ts.isStatic(node)
? getTypeOfSymbol(classSymbol)
: getDeclaredTypeOfSymbol(classSymbol);
}
function getClassElementPropertyKeyType(element) {
var name = element.name;
switch (name.kind) {
case 79 /* Identifier */:
return getStringLiteralType(ts.idText(name));
case 8 /* NumericLiteral */:
case 10 /* StringLiteral */:
return getStringLiteralType(name.text);
case 160 /* ComputedPropertyName */:
var nameType = checkComputedPropertyName(name);
return isTypeAssignableToKind(nameType, 12288 /* ESSymbolLike */) ? nameType : stringType;
default:
return ts.Debug.fail("Unsupported property name.");
}
}
// Return the list of properties of the given type, augmented with properties from Function
// if the type has call or construct signatures
function getAugmentedPropertiesOfType(type) {
type = getApparentType(type);
var propsByName = ts.createSymbolTable(getPropertiesOfType(type));
var functionType = getSignaturesOfType(type, 0 /* Call */).length ? globalCallableFunctionType :
getSignaturesOfType(type, 1 /* Construct */).length ? globalNewableFunctionType :
undefined;
if (functionType) {
ts.forEach(getPropertiesOfType(functionType), function (p) {
if (!propsByName.has(p.escapedName)) {
propsByName.set(p.escapedName, p);
}
});
}
return getNamedMembers(propsByName);
}
function typeHasCallOrConstructSignatures(type) {
return ts.typeHasCallOrConstructSignatures(type, checker);
}
function getRootSymbols(symbol) {
var roots = getImmediateRootSymbols(symbol);
return roots ? ts.flatMap(roots, getRootSymbols) : [symbol];
}
function getImmediateRootSymbols(symbol) {
if (ts.getCheckFlags(symbol) & 6 /* Synthetic */) {
return ts.mapDefined(getSymbolLinks(symbol).containingType.types, function (type) { return getPropertyOfType(type, symbol.escapedName); });
}
else if (symbol.flags & 33554432 /* Transient */) {
var _a = symbol, leftSpread = _a.leftSpread, rightSpread = _a.rightSpread, syntheticOrigin = _a.syntheticOrigin;
return leftSpread ? [leftSpread, rightSpread]
: syntheticOrigin ? [syntheticOrigin]
: ts.singleElementArray(tryGetAliasTarget(symbol));
}
return undefined;
}
function tryGetAliasTarget(symbol) {
var target;
var next = symbol;
while (next = getSymbolLinks(next).target) {
target = next;
}
return target;
}
// Emitter support
function isArgumentsLocalBinding(nodeIn) {
// Note: does not handle isShorthandPropertyAssignment (and probably a few more)
if (ts.isGeneratedIdentifier(nodeIn))
return false;
var node = ts.getParseTreeNode(nodeIn, ts.isIdentifier);
if (!node)
return false;
var parent = node.parent;
if (!parent)
return false;
var isPropertyName = ((ts.isPropertyAccessExpression(parent)
|| ts.isPropertyAssignment(parent))
&& parent.name === node);
return !isPropertyName && getReferencedValueSymbol(node) === argumentsSymbol;
}
function moduleExportsSomeValue(moduleReferenceExpression) {
var moduleSymbol = resolveExternalModuleName(moduleReferenceExpression.parent, moduleReferenceExpression);
if (!moduleSymbol || ts.isShorthandAmbientModuleSymbol(moduleSymbol)) {
// If the module is not found or is shorthand, assume that it may export a value.
return true;
}
var hasExportAssignment = hasExportAssignmentSymbol(moduleSymbol);
// if module has export assignment then 'resolveExternalModuleSymbol' will return resolved symbol for export assignment
// otherwise it will return moduleSymbol itself
moduleSymbol = resolveExternalModuleSymbol(moduleSymbol);
var symbolLinks = getSymbolLinks(moduleSymbol);
if (symbolLinks.exportsSomeValue === undefined) {
// for export assignments - check if resolved symbol for RHS is itself a value
// otherwise - check if at least one export is value
symbolLinks.exportsSomeValue = hasExportAssignment
? !!(moduleSymbol.flags & 111551 /* Value */)
: ts.forEachEntry(getExportsOfModule(moduleSymbol), isValue);
}
return symbolLinks.exportsSomeValue;
function isValue(s) {
s = resolveSymbol(s);
return s && !!(s.flags & 111551 /* Value */);
}
}
function isNameOfModuleOrEnumDeclaration(node) {
return ts.isModuleOrEnumDeclaration(node.parent) && node === node.parent.name;
}
// When resolved as an expression identifier, if the given node references an exported entity, return the declaration
// node of the exported entity's container. Otherwise, return undefined.
function getReferencedExportContainer(nodeIn, prefixLocals) {
var _a;
var node = ts.getParseTreeNode(nodeIn, ts.isIdentifier);
if (node) {
// When resolving the export container for the name of a module or enum
// declaration, we need to start resolution at the declaration's container.
// Otherwise, we could incorrectly resolve the export container as the
// declaration if it contains an exported member with the same name.
var symbol = getReferencedValueSymbol(node, /*startInDeclarationContainer*/ isNameOfModuleOrEnumDeclaration(node));
if (symbol) {
if (symbol.flags & 1048576 /* ExportValue */) {
// If we reference an exported entity within the same module declaration, then whether
// we prefix depends on the kind of entity. SymbolFlags.ExportHasLocal encompasses all the
// kinds that we do NOT prefix.
var exportSymbol = getMergedSymbol(symbol.exportSymbol);
if (!prefixLocals && exportSymbol.flags & 944 /* ExportHasLocal */ && !(exportSymbol.flags & 3 /* Variable */)) {
return undefined;
}
symbol = exportSymbol;
}
var parentSymbol_1 = getParentOfSymbol(symbol);
if (parentSymbol_1) {
if (parentSymbol_1.flags & 512 /* ValueModule */ && ((_a = parentSymbol_1.valueDeclaration) === null || _a === void 0 ? void 0 : _a.kind) === 300 /* SourceFile */) {
var symbolFile = parentSymbol_1.valueDeclaration;
var referenceFile = ts.getSourceFileOfNode(node);
// If `node` accesses an export and that export isn't in the same file, then symbol is a namespace export, so return undefined.
var symbolIsUmdExport = symbolFile !== referenceFile;
return symbolIsUmdExport ? undefined : symbolFile;
}
return ts.findAncestor(node.parent, function (n) { return ts.isModuleOrEnumDeclaration(n) && getSymbolOfNode(n) === parentSymbol_1; });
}
}
}
}
// When resolved as an expression identifier, if the given node references an import, return the declaration of
// that import. Otherwise, return undefined.
function getReferencedImportDeclaration(nodeIn) {
if (nodeIn.generatedImportReference) {
return nodeIn.generatedImportReference;
}
var node = ts.getParseTreeNode(nodeIn, ts.isIdentifier);
if (node) {
var symbol = getReferencedValueSymbol(node);
// We should only get the declaration of an alias if there isn't a local value
// declaration for the symbol
if (isNonLocalAlias(symbol, /*excludes*/ 111551 /* Value */) && !getTypeOnlyAliasDeclaration(symbol)) {
return getDeclarationOfAliasSymbol(symbol);
}
}
return undefined;
}
function isSymbolOfDestructuredElementOfCatchBinding(symbol) {
return symbol.valueDeclaration
&& ts.isBindingElement(symbol.valueDeclaration)
&& ts.walkUpBindingElementsAndPatterns(symbol.valueDeclaration).parent.kind === 290 /* CatchClause */;
}
function isSymbolOfDeclarationWithCollidingName(symbol) {
if (symbol.flags & 418 /* BlockScoped */ && symbol.valueDeclaration && !ts.isSourceFile(symbol.valueDeclaration)) {
var links = getSymbolLinks(symbol);
if (links.isDeclarationWithCollidingName === undefined) {
var container = ts.getEnclosingBlockScopeContainer(symbol.valueDeclaration);
if (ts.isStatementWithLocals(container) || isSymbolOfDestructuredElementOfCatchBinding(symbol)) {
var nodeLinks_1 = getNodeLinks(symbol.valueDeclaration);
if (resolveName(container.parent, symbol.escapedName, 111551 /* Value */, /*nameNotFoundMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ false)) {
// redeclaration - always should be renamed
links.isDeclarationWithCollidingName = true;
}
else if (nodeLinks_1.flags & 262144 /* CapturedBlockScopedBinding */) {
// binding is captured in the function
// should be renamed if:
// - binding is not top level - top level bindings never collide with anything
// AND
// - binding is not declared in loop, should be renamed to avoid name reuse across siblings
// let a, b
// { let x = 1; a = () => x; }
// { let x = 100; b = () => x; }
// console.log(a()); // should print '1'
// console.log(b()); // should print '100'
// OR
// - binding is declared inside loop but not in inside initializer of iteration statement or directly inside loop body
// * variables from initializer are passed to rewritten loop body as parameters so they are not captured directly
// * variables that are declared immediately in loop body will become top level variable after loop is rewritten and thus
// they will not collide with anything
var isDeclaredInLoop = nodeLinks_1.flags & 524288 /* BlockScopedBindingInLoop */;
var inLoopInitializer = ts.isIterationStatement(container, /*lookInLabeledStatements*/ false);
var inLoopBodyBlock = container.kind === 233 /* Block */ && ts.isIterationStatement(container.parent, /*lookInLabeledStatements*/ false);
links.isDeclarationWithCollidingName = !ts.isBlockScopedContainerTopLevel(container) && (!isDeclaredInLoop || (!inLoopInitializer && !inLoopBodyBlock));
}
else {
links.isDeclarationWithCollidingName = false;
}
}
}
return links.isDeclarationWithCollidingName;
}
return false;
}
// When resolved as an expression identifier, if the given node references a nested block scoped entity with
// a name that either hides an existing name or might hide it when compiled downlevel,
// return the declaration of that entity. Otherwise, return undefined.
function getReferencedDeclarationWithCollidingName(nodeIn) {
if (!ts.isGeneratedIdentifier(nodeIn)) {
var node = ts.getParseTreeNode(nodeIn, ts.isIdentifier);
if (node) {
var symbol = getReferencedValueSymbol(node);
if (symbol && isSymbolOfDeclarationWithCollidingName(symbol)) {
return symbol.valueDeclaration;
}
}
}
return undefined;
}
// Return true if the given node is a declaration of a nested block scoped entity with a name that either hides an
// existing name or might hide a name when compiled downlevel
function isDeclarationWithCollidingName(nodeIn) {
var node = ts.getParseTreeNode(nodeIn, ts.isDeclaration);
if (node) {
var symbol = getSymbolOfNode(node);
if (symbol) {
return isSymbolOfDeclarationWithCollidingName(symbol);
}
}
return false;
}
function isValueAliasDeclaration(node) {
switch (node.kind) {
case 263 /* ImportEqualsDeclaration */:
return isAliasResolvedToValue(getSymbolOfNode(node) || unknownSymbol);
case 265 /* ImportClause */:
case 266 /* NamespaceImport */:
case 268 /* ImportSpecifier */:
case 273 /* ExportSpecifier */:
var symbol = getSymbolOfNode(node) || unknownSymbol;
return isAliasResolvedToValue(symbol) && !getTypeOnlyAliasDeclaration(symbol);
case 270 /* ExportDeclaration */:
var exportClause = node.exportClause;
return !!exportClause && (ts.isNamespaceExport(exportClause) ||
ts.some(exportClause.elements, isValueAliasDeclaration));
case 269 /* ExportAssignment */:
return node.expression && node.expression.kind === 79 /* Identifier */ ?
isAliasResolvedToValue(getSymbolOfNode(node) || unknownSymbol) :
true;
}
return false;
}
function isTopLevelValueImportEqualsWithEntityName(nodeIn) {
var node = ts.getParseTreeNode(nodeIn, ts.isImportEqualsDeclaration);
if (node === undefined || node.parent.kind !== 300 /* SourceFile */ || !ts.isInternalModuleImportEqualsDeclaration(node)) {
// parent is not source file or it is not reference to internal module
return false;
}
var isValue = isAliasResolvedToValue(getSymbolOfNode(node));
return isValue && node.moduleReference && !ts.nodeIsMissing(node.moduleReference);
}
function isAliasResolvedToValue(symbol) {
var target = resolveAlias(symbol);
if (target === unknownSymbol) {
return true;
}
// const enums and modules that contain only const enums are not considered values from the emit perspective
// unless 'preserveConstEnums' option is set to true
return !!(target.flags & 111551 /* Value */) &&
(ts.shouldPreserveConstEnums(compilerOptions) || !isConstEnumOrConstEnumOnlyModule(target));
}
function isConstEnumOrConstEnumOnlyModule(s) {
return isConstEnumSymbol(s) || !!s.constEnumOnlyModule;
}
function isReferencedAliasDeclaration(node, checkChildren) {
if (isAliasSymbolDeclaration(node)) {
var symbol = getSymbolOfNode(node);
var links = symbol && getSymbolLinks(symbol);
if (links === null || links === void 0 ? void 0 : links.referenced) {
return true;
}
var target = getSymbolLinks(symbol).target; // TODO: GH#18217
if (target && ts.getEffectiveModifierFlags(node) & 1 /* Export */ &&
target.flags & 111551 /* Value */ &&
(ts.shouldPreserveConstEnums(compilerOptions) || !isConstEnumOrConstEnumOnlyModule(target))) {
// An `export import ... =` of a value symbol is always considered referenced
return true;
}
}
if (checkChildren) {
return !!ts.forEachChild(node, function (node) { return isReferencedAliasDeclaration(node, checkChildren); });
}
return false;
}
function isImplementationOfOverload(node) {
if (ts.nodeIsPresent(node.body)) {
if (ts.isGetAccessor(node) || ts.isSetAccessor(node))
return false; // Get or set accessors can never be overload implementations, but can have up to 2 signatures
var symbol = getSymbolOfNode(node);
var signaturesOfSymbol = getSignaturesOfSymbol(symbol);
// If this function body corresponds to function with multiple signature, it is implementation of overload
// e.g.: function foo(a: string): string;
// function foo(a: number): number;
// function foo(a: any) { // This is implementation of the overloads
// return a;
// }
return signaturesOfSymbol.length > 1 ||
// If there is single signature for the symbol, it is overload if that signature isn't coming from the node
// e.g.: function foo(a: string): string;
// function foo(a: any) { // This is implementation of the overloads
// return a;
// }
(signaturesOfSymbol.length === 1 && signaturesOfSymbol[0].declaration !== node);
}
return false;
}
function isRequiredInitializedParameter(parameter) {
return !!strictNullChecks &&
!isOptionalParameter(parameter) &&
!ts.isJSDocParameterTag(parameter) &&
!!parameter.initializer &&
!ts.hasSyntacticModifier(parameter, 16476 /* ParameterPropertyModifier */);
}
function isOptionalUninitializedParameterProperty(parameter) {
return strictNullChecks &&
isOptionalParameter(parameter) &&
!parameter.initializer &&
ts.hasSyntacticModifier(parameter, 16476 /* ParameterPropertyModifier */);
}
function isOptionalUninitializedParameter(parameter) {
return !!strictNullChecks &&
isOptionalParameter(parameter) &&
!parameter.initializer;
}
function isExpandoFunctionDeclaration(node) {
var declaration = ts.getParseTreeNode(node, ts.isFunctionDeclaration);
if (!declaration) {
return false;
}
var symbol = getSymbolOfNode(declaration);
if (!symbol || !(symbol.flags & 16 /* Function */)) {
return false;
}
return !!ts.forEachEntry(getExportsOfSymbol(symbol), function (p) { return p.flags & 111551 /* Value */ && p.valueDeclaration && ts.isPropertyAccessExpression(p.valueDeclaration); });
}
function getPropertiesOfContainerFunction(node) {
var declaration = ts.getParseTreeNode(node, ts.isFunctionDeclaration);
if (!declaration) {
return ts.emptyArray;
}
var symbol = getSymbolOfNode(declaration);
return symbol && getPropertiesOfType(getTypeOfSymbol(symbol)) || ts.emptyArray;
}
function getNodeCheckFlags(node) {
var _a;
var nodeId = node.id || 0;
if (nodeId < 0 || nodeId >= nodeLinks.length)
return 0;
return ((_a = nodeLinks[nodeId]) === null || _a === void 0 ? void 0 : _a.flags) || 0;
}
function getEnumMemberValue(node) {
computeEnumMemberValues(node.parent);
return getNodeLinks(node).enumMemberValue;
}
function canHaveConstantValue(node) {
switch (node.kind) {
case 294 /* EnumMember */:
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
return true;
}
return false;
}
function getConstantValue(node) {
if (node.kind === 294 /* EnumMember */) {
return getEnumMemberValue(node);
}
var symbol = getNodeLinks(node).resolvedSymbol;
if (symbol && (symbol.flags & 8 /* EnumMember */)) {
// inline property\index accesses only for const enums
var member = symbol.valueDeclaration;
if (ts.isEnumConst(member.parent)) {
return getEnumMemberValue(member);
}
}
return undefined;
}
function isFunctionType(type) {
return !!(type.flags & 524288 /* Object */) && getSignaturesOfType(type, 0 /* Call */).length > 0;
}
function getTypeReferenceSerializationKind(typeNameIn, location) {
var _a, _b;
// ensure both `typeName` and `location` are parse tree nodes.
var typeName = ts.getParseTreeNode(typeNameIn, ts.isEntityName);
if (!typeName)
return ts.TypeReferenceSerializationKind.Unknown;
if (location) {
location = ts.getParseTreeNode(location);
if (!location)
return ts.TypeReferenceSerializationKind.Unknown;
}
// Resolve the symbol as a value to ensure the type can be reached at runtime during emit.
var isTypeOnly = false;
if (ts.isQualifiedName(typeName)) {
var rootValueSymbol = resolveEntityName(ts.getFirstIdentifier(typeName), 111551 /* Value */, /*ignoreErrors*/ true, /*dontResolveAlias*/ true, location);
isTypeOnly = !!((_a = rootValueSymbol === null || rootValueSymbol === void 0 ? void 0 : rootValueSymbol.declarations) === null || _a === void 0 ? void 0 : _a.every(ts.isTypeOnlyImportOrExportDeclaration));
}
var valueSymbol = resolveEntityName(typeName, 111551 /* Value */, /*ignoreErrors*/ true, /*dontResolveAlias*/ true, location);
var resolvedSymbol = valueSymbol && valueSymbol.flags & 2097152 /* Alias */ ? resolveAlias(valueSymbol) : valueSymbol;
isTypeOnly || (isTypeOnly = !!((_b = valueSymbol === null || valueSymbol === void 0 ? void 0 : valueSymbol.declarations) === null || _b === void 0 ? void 0 : _b.every(ts.isTypeOnlyImportOrExportDeclaration)));
// Resolve the symbol as a type so that we can provide a more useful hint for the type serializer.
var typeSymbol = resolveEntityName(typeName, 788968 /* Type */, /*ignoreErrors*/ true, /*dontResolveAlias*/ false, location);
if (resolvedSymbol && resolvedSymbol === typeSymbol) {
var globalPromiseSymbol = getGlobalPromiseConstructorSymbol(/*reportErrors*/ false);
if (globalPromiseSymbol && resolvedSymbol === globalPromiseSymbol) {
return ts.TypeReferenceSerializationKind.Promise;
}
var constructorType = getTypeOfSymbol(resolvedSymbol);
if (constructorType && isConstructorType(constructorType)) {
return isTypeOnly ? ts.TypeReferenceSerializationKind.TypeWithCallSignature : ts.TypeReferenceSerializationKind.TypeWithConstructSignatureAndValue;
}
}
// We might not be able to resolve type symbol so use unknown type in that case (eg error case)
if (!typeSymbol) {
return isTypeOnly ? ts.TypeReferenceSerializationKind.ObjectType : ts.TypeReferenceSerializationKind.Unknown;
}
var type = getDeclaredTypeOfSymbol(typeSymbol);
if (type === errorType) {
return isTypeOnly ? ts.TypeReferenceSerializationKind.ObjectType : ts.TypeReferenceSerializationKind.Unknown;
}
else if (type.flags & 3 /* AnyOrUnknown */) {
return ts.TypeReferenceSerializationKind.ObjectType;
}
else if (isTypeAssignableToKind(type, 16384 /* Void */ | 98304 /* Nullable */ | 131072 /* Never */)) {
return ts.TypeReferenceSerializationKind.VoidNullableOrNeverType;
}
else if (isTypeAssignableToKind(type, 528 /* BooleanLike */)) {
return ts.TypeReferenceSerializationKind.BooleanType;
}
else if (isTypeAssignableToKind(type, 296 /* NumberLike */)) {
return ts.TypeReferenceSerializationKind.NumberLikeType;
}
else if (isTypeAssignableToKind(type, 2112 /* BigIntLike */)) {
return ts.TypeReferenceSerializationKind.BigIntLikeType;
}
else if (isTypeAssignableToKind(type, 402653316 /* StringLike */)) {
return ts.TypeReferenceSerializationKind.StringLikeType;
}
else if (isTupleType(type)) {
return ts.TypeReferenceSerializationKind.ArrayLikeType;
}
else if (isTypeAssignableToKind(type, 12288 /* ESSymbolLike */)) {
return ts.TypeReferenceSerializationKind.ESSymbolType;
}
else if (isFunctionType(type)) {
return ts.TypeReferenceSerializationKind.TypeWithCallSignature;
}
else if (isArrayType(type)) {
return ts.TypeReferenceSerializationKind.ArrayLikeType;
}
else {
return ts.TypeReferenceSerializationKind.ObjectType;
}
}
function createTypeOfDeclaration(declarationIn, enclosingDeclaration, flags, tracker, addUndefined) {
var declaration = ts.getParseTreeNode(declarationIn, ts.isVariableLikeOrAccessor);
if (!declaration) {
return ts.factory.createToken(129 /* AnyKeyword */);
}
// Get type of the symbol if this is the valid symbol otherwise get type at location
var symbol = getSymbolOfNode(declaration);
var type = symbol && !(symbol.flags & (2048 /* TypeLiteral */ | 131072 /* Signature */))
? getWidenedLiteralType(getTypeOfSymbol(symbol))
: errorType;
if (type.flags & 8192 /* UniqueESSymbol */ &&
type.symbol === symbol) {
flags |= 1048576 /* AllowUniqueESSymbolType */;
}
if (addUndefined) {
type = getOptionalType(type);
}
return nodeBuilder.typeToTypeNode(type, enclosingDeclaration, flags | 1024 /* MultilineObjectLiterals */, tracker);
}
function createReturnTypeOfSignatureDeclaration(signatureDeclarationIn, enclosingDeclaration, flags, tracker) {
var signatureDeclaration = ts.getParseTreeNode(signatureDeclarationIn, ts.isFunctionLike);
if (!signatureDeclaration) {
return ts.factory.createToken(129 /* AnyKeyword */);
}
var signature = getSignatureFromDeclaration(signatureDeclaration);
return nodeBuilder.typeToTypeNode(getReturnTypeOfSignature(signature), enclosingDeclaration, flags | 1024 /* MultilineObjectLiterals */, tracker);
}
function createTypeOfExpression(exprIn, enclosingDeclaration, flags, tracker) {
var expr = ts.getParseTreeNode(exprIn, ts.isExpression);
if (!expr) {
return ts.factory.createToken(129 /* AnyKeyword */);
}
var type = getWidenedType(getRegularTypeOfExpression(expr));
return nodeBuilder.typeToTypeNode(type, enclosingDeclaration, flags | 1024 /* MultilineObjectLiterals */, tracker);
}
function hasGlobalName(name) {
return globals.has(ts.escapeLeadingUnderscores(name));
}
function getReferencedValueSymbol(reference, startInDeclarationContainer) {
var resolvedSymbol = getNodeLinks(reference).resolvedSymbol;
if (resolvedSymbol) {
return resolvedSymbol;
}
var location = reference;
if (startInDeclarationContainer) {
// When resolving the name of a declaration as a value, we need to start resolution
// at a point outside of the declaration.
var parent = reference.parent;
if (ts.isDeclaration(parent) && reference === parent.name) {
location = getDeclarationContainer(parent);
}
}
return resolveName(location, reference.escapedText, 111551 /* Value */ | 1048576 /* ExportValue */ | 2097152 /* Alias */, /*nodeNotFoundMessage*/ undefined, /*nameArg*/ undefined, /*isUse*/ true);
}
function getReferencedValueDeclaration(referenceIn) {
if (!ts.isGeneratedIdentifier(referenceIn)) {
var reference = ts.getParseTreeNode(referenceIn, ts.isIdentifier);
if (reference) {
var symbol = getReferencedValueSymbol(reference);
if (symbol) {
return getExportSymbolOfValueSymbolIfExported(symbol).valueDeclaration;
}
}
}
return undefined;
}
function isLiteralConstDeclaration(node) {
if (ts.isDeclarationReadonly(node) || ts.isVariableDeclaration(node) && ts.isVarConst(node)) {
return isFreshLiteralType(getTypeOfSymbol(getSymbolOfNode(node)));
}
return false;
}
function literalTypeToNode(type, enclosing, tracker) {
var enumResult = type.flags & 1024 /* EnumLiteral */ ? nodeBuilder.symbolToExpression(type.symbol, 111551 /* Value */, enclosing, /*flags*/ undefined, tracker)
: type === trueType ? ts.factory.createTrue() : type === falseType && ts.factory.createFalse();
if (enumResult)
return enumResult;
var literalValue = type.value;
return typeof literalValue === "object" ? ts.factory.createBigIntLiteral(literalValue) :
typeof literalValue === "number" ? ts.factory.createNumericLiteral(literalValue) :
ts.factory.createStringLiteral(literalValue);
}
function createLiteralConstValue(node, tracker) {
var type = getTypeOfSymbol(getSymbolOfNode(node));
return literalTypeToNode(type, node, tracker);
}
function getJsxFactoryEntity(location) {
return location ? (getJsxNamespace(location), (ts.getSourceFileOfNode(location).localJsxFactory || _jsxFactoryEntity)) : _jsxFactoryEntity;
}
function getJsxFragmentFactoryEntity(location) {
if (location) {
var file = ts.getSourceFileOfNode(location);
if (file) {
if (file.localJsxFragmentFactory) {
return file.localJsxFragmentFactory;
}
var jsxFragPragmas = file.pragmas.get("jsxfrag");
var jsxFragPragma = ts.isArray(jsxFragPragmas) ? jsxFragPragmas[0] : jsxFragPragmas;
if (jsxFragPragma) {
file.localJsxFragmentFactory = ts.parseIsolatedEntityName(jsxFragPragma.arguments.factory, languageVersion);
return file.localJsxFragmentFactory;
}
}
}
if (compilerOptions.jsxFragmentFactory) {
return ts.parseIsolatedEntityName(compilerOptions.jsxFragmentFactory, languageVersion);
}
}
function createResolver() {
// this variable and functions that use it are deliberately moved here from the outer scope
// to avoid scope pollution
var resolvedTypeReferenceDirectives = host.getResolvedTypeReferenceDirectives();
var fileToDirective;
if (resolvedTypeReferenceDirectives) {
// populate reverse mapping: file path -> type reference directive that was resolved to this file
fileToDirective = new ts.Map();
resolvedTypeReferenceDirectives.forEach(function (resolvedDirective, key) {
if (!resolvedDirective || !resolvedDirective.resolvedFileName) {
return;
}
var file = host.getSourceFile(resolvedDirective.resolvedFileName);
if (file) {
// Add the transitive closure of path references loaded by this file (as long as they are not)
// part of an existing type reference.
addReferencedFilesToTypeDirective(file, key);
}
});
}
return {
getReferencedExportContainer: getReferencedExportContainer,
getReferencedImportDeclaration: getReferencedImportDeclaration,
getReferencedDeclarationWithCollidingName: getReferencedDeclarationWithCollidingName,
isDeclarationWithCollidingName: isDeclarationWithCollidingName,
isValueAliasDeclaration: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn);
// Synthesized nodes are always treated like values.
return node ? isValueAliasDeclaration(node) : true;
},
hasGlobalName: hasGlobalName,
isReferencedAliasDeclaration: function (nodeIn, checkChildren) {
var node = ts.getParseTreeNode(nodeIn);
// Synthesized nodes are always treated as referenced.
return node ? isReferencedAliasDeclaration(node, checkChildren) : true;
},
getNodeCheckFlags: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn);
return node ? getNodeCheckFlags(node) : 0;
},
isTopLevelValueImportEqualsWithEntityName: isTopLevelValueImportEqualsWithEntityName,
isDeclarationVisible: isDeclarationVisible,
isImplementationOfOverload: isImplementationOfOverload,
isRequiredInitializedParameter: isRequiredInitializedParameter,
isOptionalUninitializedParameterProperty: isOptionalUninitializedParameterProperty,
isExpandoFunctionDeclaration: isExpandoFunctionDeclaration,
getPropertiesOfContainerFunction: getPropertiesOfContainerFunction,
createTypeOfDeclaration: createTypeOfDeclaration,
createReturnTypeOfSignatureDeclaration: createReturnTypeOfSignatureDeclaration,
createTypeOfExpression: createTypeOfExpression,
createLiteralConstValue: createLiteralConstValue,
isSymbolAccessible: isSymbolAccessible,
isEntityNameVisible: isEntityNameVisible,
getConstantValue: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn, canHaveConstantValue);
return node ? getConstantValue(node) : undefined;
},
collectLinkedAliases: collectLinkedAliases,
getReferencedValueDeclaration: getReferencedValueDeclaration,
getTypeReferenceSerializationKind: getTypeReferenceSerializationKind,
isOptionalParameter: isOptionalParameter,
moduleExportsSomeValue: moduleExportsSomeValue,
isArgumentsLocalBinding: isArgumentsLocalBinding,
getExternalModuleFileFromDeclaration: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn, ts.hasPossibleExternalModuleReference);
return node && getExternalModuleFileFromDeclaration(node);
},
getTypeReferenceDirectivesForEntityName: getTypeReferenceDirectivesForEntityName,
getTypeReferenceDirectivesForSymbol: getTypeReferenceDirectivesForSymbol,
isLiteralConstDeclaration: isLiteralConstDeclaration,
isLateBound: function (nodeIn) {
var node = ts.getParseTreeNode(nodeIn, ts.isDeclaration);
var symbol = node && getSymbolOfNode(node);
return !!(symbol && ts.getCheckFlags(symbol) & 4096 /* Late */);
},
getJsxFactoryEntity: getJsxFactoryEntity,
getJsxFragmentFactoryEntity: getJsxFragmentFactoryEntity,
getAllAccessorDeclarations: function (accessor) {
accessor = ts.getParseTreeNode(accessor, ts.isGetOrSetAccessorDeclaration); // TODO: GH#18217
var otherKind = accessor.kind === 171 /* SetAccessor */ ? 170 /* GetAccessor */ : 171 /* SetAccessor */;
var otherAccessor = ts.getDeclarationOfKind(getSymbolOfNode(accessor), otherKind);
var firstAccessor = otherAccessor && (otherAccessor.pos < accessor.pos) ? otherAccessor : accessor;
var secondAccessor = otherAccessor && (otherAccessor.pos < accessor.pos) ? accessor : otherAccessor;
var setAccessor = accessor.kind === 171 /* SetAccessor */ ? accessor : otherAccessor;
var getAccessor = accessor.kind === 170 /* GetAccessor */ ? accessor : otherAccessor;
return {
firstAccessor: firstAccessor,
secondAccessor: secondAccessor,
setAccessor: setAccessor,
getAccessor: getAccessor
};
},
getSymbolOfExternalModuleSpecifier: function (moduleName) { return resolveExternalModuleNameWorker(moduleName, moduleName, /*moduleNotFoundError*/ undefined); },
isBindingCapturedByNode: function (node, decl) {
var parseNode = ts.getParseTreeNode(node);
var parseDecl = ts.getParseTreeNode(decl);
return !!parseNode && !!parseDecl && (ts.isVariableDeclaration(parseDecl) || ts.isBindingElement(parseDecl)) && isBindingCapturedByNode(parseNode, parseDecl);
},
getDeclarationStatementsForSourceFile: function (node, flags, tracker, bundled) {
var n = ts.getParseTreeNode(node);
ts.Debug.assert(n && n.kind === 300 /* SourceFile */, "Non-sourcefile node passed into getDeclarationsForSourceFile");
var sym = getSymbolOfNode(node);
if (!sym) {
return !node.locals ? [] : nodeBuilder.symbolTableToDeclarationStatements(node.locals, node, flags, tracker, bundled);
}
return !sym.exports ? [] : nodeBuilder.symbolTableToDeclarationStatements(sym.exports, node, flags, tracker, bundled);
},
isImportRequiredByAugmentation: isImportRequiredByAugmentation,
};
function isImportRequiredByAugmentation(node) {
var file = ts.getSourceFileOfNode(node);
if (!file.symbol)
return false;
var importTarget = getExternalModuleFileFromDeclaration(node);
if (!importTarget)
return false;
if (importTarget === file)
return false;
var exports = getExportsOfModule(file.symbol);
for (var _i = 0, _a = ts.arrayFrom(exports.values()); _i < _a.length; _i++) {
var s = _a[_i];
if (s.mergeId) {
var merged = getMergedSymbol(s);
if (merged.declarations) {
for (var _b = 0, _c = merged.declarations; _b < _c.length; _b++) {
var d = _c[_b];
var declFile = ts.getSourceFileOfNode(d);
if (declFile === importTarget) {
return true;
}
}
}
}
}
return false;
}
function isInHeritageClause(node) {
return node.parent && node.parent.kind === 226 /* ExpressionWithTypeArguments */ && node.parent.parent && node.parent.parent.kind === 289 /* HeritageClause */;
}
// defined here to avoid outer scope pollution
function getTypeReferenceDirectivesForEntityName(node) {
// program does not have any files with type reference directives - bail out
if (!fileToDirective) {
return undefined;
}
// property access can only be used as values, or types when within an expression with type arguments inside a heritage clause
// qualified names can only be used as types\namespaces
// identifiers are treated as values only if they appear in type queries
var meaning = 788968 /* Type */ | 1920 /* Namespace */;
if ((node.kind === 79 /* Identifier */ && isInTypeQuery(node)) || (node.kind === 204 /* PropertyAccessExpression */ && !isInHeritageClause(node))) {
meaning = 111551 /* Value */ | 1048576 /* ExportValue */;
}
var symbol = resolveEntityName(node, meaning, /*ignoreErrors*/ true);
return symbol && symbol !== unknownSymbol ? getTypeReferenceDirectivesForSymbol(symbol, meaning) : undefined;
}
// defined here to avoid outer scope pollution
function getTypeReferenceDirectivesForSymbol(symbol, meaning) {
// program does not have any files with type reference directives - bail out
if (!fileToDirective || !isSymbolFromTypeDeclarationFile(symbol)) {
return undefined;
}
// check what declarations in the symbol can contribute to the target meaning
var typeReferenceDirectives;
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var decl = _a[_i];
// check meaning of the local symbol to see if declaration needs to be analyzed further
if (decl.symbol && decl.symbol.flags & meaning) {
var file = ts.getSourceFileOfNode(decl);
var typeReferenceDirective = fileToDirective.get(file.path);
if (typeReferenceDirective) {
(typeReferenceDirectives || (typeReferenceDirectives = [])).push(typeReferenceDirective);
}
else {
// found at least one entry that does not originate from type reference directive
return undefined;
}
}
}
return typeReferenceDirectives;
}
function isSymbolFromTypeDeclarationFile(symbol) {
// bail out if symbol does not have associated declarations (i.e. this is transient symbol created for property in binding pattern)
if (!symbol.declarations) {
return false;
}
// walk the parent chain for symbols to make sure that top level parent symbol is in the global scope
// external modules cannot define or contribute to type declaration files
var current = symbol;
while (true) {
var parent = getParentOfSymbol(current);
if (parent) {
current = parent;
}
else {
break;
}
}
if (current.valueDeclaration && current.valueDeclaration.kind === 300 /* SourceFile */ && current.flags & 512 /* ValueModule */) {
return false;
}
// check that at least one declaration of top level symbol originates from type declaration file
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var decl = _a[_i];
var file = ts.getSourceFileOfNode(decl);
if (fileToDirective.has(file.path)) {
return true;
}
}
return false;
}
function addReferencedFilesToTypeDirective(file, key) {
if (fileToDirective.has(file.path))
return;
fileToDirective.set(file.path, key);
for (var _i = 0, _a = file.referencedFiles; _i < _a.length; _i++) {
var fileName = _a[_i].fileName;
var resolvedFile = ts.resolveTripleslashReference(fileName, file.fileName);
var referencedFile = host.getSourceFile(resolvedFile);
if (referencedFile) {
addReferencedFilesToTypeDirective(referencedFile, key);
}
}
}
}
function getExternalModuleFileFromDeclaration(declaration) {
var specifier = declaration.kind === 259 /* ModuleDeclaration */ ? ts.tryCast(declaration.name, ts.isStringLiteral) : ts.getExternalModuleName(declaration);
var moduleSymbol = resolveExternalModuleNameWorker(specifier, specifier, /*moduleNotFoundError*/ undefined); // TODO: GH#18217
if (!moduleSymbol) {
return undefined;
}
return ts.getDeclarationOfKind(moduleSymbol, 300 /* SourceFile */);
}
function initializeTypeChecker() {
// Bind all source files and propagate errors
for (var _i = 0, _a = host.getSourceFiles(); _i < _a.length; _i++) {
var file = _a[_i];
ts.bindSourceFile(file, compilerOptions);
}
amalgamatedDuplicates = new ts.Map();
// Initialize global symbol table
var augmentations;
for (var _b = 0, _c = host.getSourceFiles(); _b < _c.length; _b++) {
var file = _c[_b];
if (file.redirectInfo) {
continue;
}
if (!ts.isExternalOrCommonJsModule(file)) {
// It is an error for a non-external-module (i.e. script) to declare its own `globalThis`.
// We can't use `builtinGlobals` for this due to synthetic expando-namespace generation in JS files.
var fileGlobalThisSymbol = file.locals.get("globalThis");
if (fileGlobalThisSymbol === null || fileGlobalThisSymbol === void 0 ? void 0 : fileGlobalThisSymbol.declarations) {
for (var _d = 0, _e = fileGlobalThisSymbol.declarations; _d < _e.length; _d++) {
var declaration = _e[_d];
diagnostics.add(ts.createDiagnosticForNode(declaration, ts.Diagnostics.Declaration_name_conflicts_with_built_in_global_identifier_0, "globalThis"));
}
}
mergeSymbolTable(globals, file.locals);
}
if (file.jsGlobalAugmentations) {
mergeSymbolTable(globals, file.jsGlobalAugmentations);
}
if (file.patternAmbientModules && file.patternAmbientModules.length) {
patternAmbientModules = ts.concatenate(patternAmbientModules, file.patternAmbientModules);
}
if (file.moduleAugmentations.length) {
(augmentations || (augmentations = [])).push(file.moduleAugmentations);
}
if (file.symbol && file.symbol.globalExports) {
// Merge in UMD exports with first-in-wins semantics (see #9771)
var source = file.symbol.globalExports;
source.forEach(function (sourceSymbol, id) {
if (!globals.has(id)) {
globals.set(id, sourceSymbol);
}
});
}
}
// We do global augmentations separately from module augmentations (and before creating global types) because they
// 1. Affect global types. We won't have the correct global types until global augmentations are merged. Also,
// 2. Module augmentation instantiation requires creating the type of a module, which, in turn, can require
// checking for an export or property on the module (if export=) which, in turn, can fall back to the
// apparent type of the module - either globalObjectType or globalFunctionType - which wouldn't exist if we
// did module augmentations prior to finalizing the global types.
if (augmentations) {
// merge _global_ module augmentations.
// this needs to be done after global symbol table is initialized to make sure that all ambient modules are indexed
for (var _f = 0, augmentations_1 = augmentations; _f < augmentations_1.length; _f++) {
var list = augmentations_1[_f];
for (var _g = 0, list_1 = list; _g < list_1.length; _g++) {
var augmentation = list_1[_g];
if (!ts.isGlobalScopeAugmentation(augmentation.parent))
continue;
mergeModuleAugmentation(augmentation);
}
}
}
// Setup global builtins
addToSymbolTable(globals, builtinGlobals, ts.Diagnostics.Declaration_name_conflicts_with_built_in_global_identifier_0);
getSymbolLinks(undefinedSymbol).type = undefinedWideningType;
getSymbolLinks(argumentsSymbol).type = getGlobalType("IArguments", /*arity*/ 0, /*reportErrors*/ true);
getSymbolLinks(unknownSymbol).type = errorType;
getSymbolLinks(globalThisSymbol).type = createObjectType(16 /* Anonymous */, globalThisSymbol);
// Initialize special types
globalArrayType = getGlobalType("Array", /*arity*/ 1, /*reportErrors*/ true);
globalObjectType = getGlobalType("Object", /*arity*/ 0, /*reportErrors*/ true);
globalFunctionType = getGlobalType("Function", /*arity*/ 0, /*reportErrors*/ true);
globalCallableFunctionType = strictBindCallApply && getGlobalType("CallableFunction", /*arity*/ 0, /*reportErrors*/ true) || globalFunctionType;
globalNewableFunctionType = strictBindCallApply && getGlobalType("NewableFunction", /*arity*/ 0, /*reportErrors*/ true) || globalFunctionType;
globalStringType = getGlobalType("String", /*arity*/ 0, /*reportErrors*/ true);
globalNumberType = getGlobalType("Number", /*arity*/ 0, /*reportErrors*/ true);
globalBooleanType = getGlobalType("Boolean", /*arity*/ 0, /*reportErrors*/ true);
globalRegExpType = getGlobalType("RegExp", /*arity*/ 0, /*reportErrors*/ true);
anyArrayType = createArrayType(anyType);
autoArrayType = createArrayType(autoType);
if (autoArrayType === emptyObjectType) {
// autoArrayType is used as a marker, so even if global Array type is not defined, it needs to be a unique type
autoArrayType = createAnonymousType(undefined, emptySymbols, ts.emptyArray, ts.emptyArray, ts.emptyArray);
}
globalReadonlyArrayType = getGlobalTypeOrUndefined("ReadonlyArray", /*arity*/ 1) || globalArrayType;
anyReadonlyArrayType = globalReadonlyArrayType ? createTypeFromGenericGlobalType(globalReadonlyArrayType, [anyType]) : anyArrayType;
globalThisType = getGlobalTypeOrUndefined("ThisType", /*arity*/ 1);
if (augmentations) {
// merge _nonglobal_ module augmentations.
// this needs to be done after global symbol table is initialized to make sure that all ambient modules are indexed
for (var _h = 0, augmentations_2 = augmentations; _h < augmentations_2.length; _h++) {
var list = augmentations_2[_h];
for (var _j = 0, list_2 = list; _j < list_2.length; _j++) {
var augmentation = list_2[_j];
if (ts.isGlobalScopeAugmentation(augmentation.parent))
continue;
mergeModuleAugmentation(augmentation);
}
}
}
amalgamatedDuplicates.forEach(function (_a) {
var firstFile = _a.firstFile, secondFile = _a.secondFile, conflictingSymbols = _a.conflictingSymbols;
// If not many things conflict, issue individual errors
if (conflictingSymbols.size < 8) {
conflictingSymbols.forEach(function (_a, symbolName) {
var isBlockScoped = _a.isBlockScoped, firstFileLocations = _a.firstFileLocations, secondFileLocations = _a.secondFileLocations;
var message = isBlockScoped ? ts.Diagnostics.Cannot_redeclare_block_scoped_variable_0 : ts.Diagnostics.Duplicate_identifier_0;
for (var _i = 0, firstFileLocations_1 = firstFileLocations; _i < firstFileLocations_1.length; _i++) {
var node = firstFileLocations_1[_i];
addDuplicateDeclarationError(node, message, symbolName, secondFileLocations);
}
for (var _b = 0, secondFileLocations_1 = secondFileLocations; _b < secondFileLocations_1.length; _b++) {
var node = secondFileLocations_1[_b];
addDuplicateDeclarationError(node, message, symbolName, firstFileLocations);
}
});
}
else {
// Otherwise issue top-level error since the files appear very identical in terms of what they contain
var list = ts.arrayFrom(conflictingSymbols.keys()).join(", ");
diagnostics.add(ts.addRelatedInfo(ts.createDiagnosticForNode(firstFile, ts.Diagnostics.Definitions_of_the_following_identifiers_conflict_with_those_in_another_file_Colon_0, list), ts.createDiagnosticForNode(secondFile, ts.Diagnostics.Conflicts_are_in_this_file)));
diagnostics.add(ts.addRelatedInfo(ts.createDiagnosticForNode(secondFile, ts.Diagnostics.Definitions_of_the_following_identifiers_conflict_with_those_in_another_file_Colon_0, list), ts.createDiagnosticForNode(firstFile, ts.Diagnostics.Conflicts_are_in_this_file)));
}
});
amalgamatedDuplicates = undefined;
}
function checkExternalEmitHelpers(location, helpers) {
if ((requestedExternalEmitHelpers & helpers) !== helpers && compilerOptions.importHelpers) {
var sourceFile = ts.getSourceFileOfNode(location);
if (ts.isEffectiveExternalModule(sourceFile, compilerOptions) && !(location.flags & 8388608 /* Ambient */)) {
var helpersModule = resolveHelpersModule(sourceFile, location);
if (helpersModule !== unknownSymbol) {
var uncheckedHelpers = helpers & ~requestedExternalEmitHelpers;
for (var helper = 1 /* FirstEmitHelper */; helper <= 2097152 /* LastEmitHelper */; helper <<= 1) {
if (uncheckedHelpers & helper) {
var name = getHelperName(helper);
var symbol = getSymbol(helpersModule.exports, ts.escapeLeadingUnderscores(name), 111551 /* Value */);
if (!symbol) {
error(location, ts.Diagnostics.This_syntax_requires_an_imported_helper_named_1_which_does_not_exist_in_0_Consider_upgrading_your_version_of_0, ts.externalHelpersModuleNameText, name);
}
else if (helper & 524288 /* ClassPrivateFieldGet */) {
if (!ts.some(getSignaturesOfSymbol(symbol), function (signature) { return getParameterCount(signature) > 3; })) {
error(location, ts.Diagnostics.This_syntax_requires_an_imported_helper_named_1_with_2_parameters_which_is_not_compatible_with_the_one_in_0_Consider_upgrading_your_version_of_0, ts.externalHelpersModuleNameText, name, 4);
}
}
else if (helper & 1048576 /* ClassPrivateFieldSet */) {
if (!ts.some(getSignaturesOfSymbol(symbol), function (signature) { return getParameterCount(signature) > 4; })) {
error(location, ts.Diagnostics.This_syntax_requires_an_imported_helper_named_1_with_2_parameters_which_is_not_compatible_with_the_one_in_0_Consider_upgrading_your_version_of_0, ts.externalHelpersModuleNameText, name, 5);
}
}
else if (helper & 1024 /* SpreadArray */) {
if (!ts.some(getSignaturesOfSymbol(symbol), function (signature) { return getParameterCount(signature) > 2; })) {
error(location, ts.Diagnostics.This_syntax_requires_an_imported_helper_named_1_with_2_parameters_which_is_not_compatible_with_the_one_in_0_Consider_upgrading_your_version_of_0, ts.externalHelpersModuleNameText, name, 3);
}
}
}
}
}
requestedExternalEmitHelpers |= helpers;
}
}
}
function getHelperName(helper) {
switch (helper) {
case 1 /* Extends */: return "__extends";
case 2 /* Assign */: return "__assign";
case 4 /* Rest */: return "__rest";
case 8 /* Decorate */: return "__decorate";
case 16 /* Metadata */: return "__metadata";
case 32 /* Param */: return "__param";
case 64 /* Awaiter */: return "__awaiter";
case 128 /* Generator */: return "__generator";
case 256 /* Values */: return "__values";
case 512 /* Read */: return "__read";
case 1024 /* SpreadArray */: return "__spreadArray";
case 2048 /* Await */: return "__await";
case 4096 /* AsyncGenerator */: return "__asyncGenerator";
case 8192 /* AsyncDelegator */: return "__asyncDelegator";
case 16384 /* AsyncValues */: return "__asyncValues";
case 32768 /* ExportStar */: return "__exportStar";
case 65536 /* ImportStar */: return "__importStar";
case 131072 /* ImportDefault */: return "__importDefault";
case 262144 /* MakeTemplateObject */: return "__makeTemplateObject";
case 524288 /* ClassPrivateFieldGet */: return "__classPrivateFieldGet";
case 1048576 /* ClassPrivateFieldSet */: return "__classPrivateFieldSet";
case 2097152 /* CreateBinding */: return "__createBinding";
default: return ts.Debug.fail("Unrecognized helper");
}
}
function resolveHelpersModule(node, errorNode) {
if (!externalHelpersModule) {
externalHelpersModule = resolveExternalModule(node, ts.externalHelpersModuleNameText, ts.Diagnostics.This_syntax_requires_an_imported_helper_but_module_0_cannot_be_found, errorNode) || unknownSymbol;
}
return externalHelpersModule;
}
// GRAMMAR CHECKING
function checkGrammarDecoratorsAndModifiers(node) {
return checkGrammarDecorators(node) || checkGrammarModifiers(node);
}
function checkGrammarDecorators(node) {
if (!node.decorators) {
return false;
}
if (!ts.nodeCanBeDecorated(node, node.parent, node.parent.parent)) {
if (node.kind === 167 /* MethodDeclaration */ && !ts.nodeIsPresent(node.body)) {
return grammarErrorOnFirstToken(node, ts.Diagnostics.A_decorator_can_only_decorate_a_method_implementation_not_an_overload);
}
else {
return grammarErrorOnFirstToken(node, ts.Diagnostics.Decorators_are_not_valid_here);
}
}
else if (node.kind === 170 /* GetAccessor */ || node.kind === 171 /* SetAccessor */) {
var accessors = ts.getAllAccessorDeclarations(node.parent.members, node);
if (accessors.firstAccessor.decorators && node === accessors.secondAccessor) {
return grammarErrorOnFirstToken(node, ts.Diagnostics.Decorators_cannot_be_applied_to_multiple_get_Slashset_accessors_of_the_same_name);
}
}
return false;
}
function checkGrammarModifiers(node) {
var quickResult = reportObviousModifierErrors(node);
if (quickResult !== undefined) {
return quickResult;
}
var lastStatic, lastDeclare, lastAsync, lastReadonly, lastOverride;
var flags = 0 /* None */;
for (var _i = 0, _a = node.modifiers; _i < _a.length; _i++) {
var modifier = _a[_i];
if (modifier.kind !== 143 /* ReadonlyKeyword */) {
if (node.kind === 164 /* PropertySignature */ || node.kind === 166 /* MethodSignature */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_type_member, ts.tokenToString(modifier.kind));
}
if (node.kind === 174 /* IndexSignature */ && (modifier.kind !== 124 /* StaticKeyword */ || !ts.isClassLike(node.parent))) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_an_index_signature, ts.tokenToString(modifier.kind));
}
}
switch (modifier.kind) {
case 85 /* ConstKeyword */:
if (node.kind !== 258 /* EnumDeclaration */) {
return grammarErrorOnNode(node, ts.Diagnostics.A_class_member_cannot_have_the_0_keyword, ts.tokenToString(85 /* ConstKeyword */));
}
break;
case 157 /* OverrideKeyword */:
// If node.kind === SyntaxKind.Parameter, checkParameter reports an error if it's not a parameter property.
if (flags & 16384 /* Override */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_already_seen, "override");
}
else if (flags & 2 /* Ambient */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_with_1_modifier, "override", "declare");
}
else if (flags & 64 /* Readonly */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, "override", "readonly");
}
else if (flags & 256 /* Async */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, "override", "async");
}
flags |= 16384 /* Override */;
lastOverride = modifier;
break;
case 123 /* PublicKeyword */:
case 122 /* ProtectedKeyword */:
case 121 /* PrivateKeyword */:
var text = visibilityToString(ts.modifierToFlag(modifier.kind));
if (flags & 28 /* AccessibilityModifier */) {
return grammarErrorOnNode(modifier, ts.Diagnostics.Accessibility_modifier_already_seen);
}
else if (flags & 16384 /* Override */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, text, "override");
}
else if (flags & 32 /* Static */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, text, "static");
}
else if (flags & 64 /* Readonly */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, text, "readonly");
}
else if (flags & 256 /* Async */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, text, "async");
}
else if (node.parent.kind === 260 /* ModuleBlock */ || node.parent.kind === 300 /* SourceFile */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_module_or_namespace_element, text);
}
else if (flags & 128 /* Abstract */) {
if (modifier.kind === 121 /* PrivateKeyword */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_with_1_modifier, text, "abstract");
}
else {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, text, "abstract");
}
}
else if (ts.isPrivateIdentifierClassElementDeclaration(node)) {
return grammarErrorOnNode(modifier, ts.Diagnostics.An_accessibility_modifier_cannot_be_used_with_a_private_identifier);
}
flags |= ts.modifierToFlag(modifier.kind);
break;
case 124 /* StaticKeyword */:
if (flags & 32 /* Static */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_already_seen, "static");
}
else if (flags & 64 /* Readonly */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, "static", "readonly");
}
else if (flags & 256 /* Async */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, "static", "async");
}
else if (node.parent.kind === 260 /* ModuleBlock */ || node.parent.kind === 300 /* SourceFile */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_module_or_namespace_element, "static");
}
else if (node.kind === 162 /* Parameter */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_parameter, "static");
}
else if (flags & 128 /* Abstract */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_with_1_modifier, "static", "abstract");
}
else if (flags & 16384 /* Override */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, "static", "override");
}
flags |= 32 /* Static */;
lastStatic = modifier;
break;
case 143 /* ReadonlyKeyword */:
if (flags & 64 /* Readonly */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_already_seen, "readonly");
}
else if (node.kind !== 165 /* PropertyDeclaration */ && node.kind !== 164 /* PropertySignature */ && node.kind !== 174 /* IndexSignature */ && node.kind !== 162 /* Parameter */) {
// If node.kind === SyntaxKind.Parameter, checkParameter reports an error if it's not a parameter property.
return grammarErrorOnNode(modifier, ts.Diagnostics.readonly_modifier_can_only_appear_on_a_property_declaration_or_index_signature);
}
flags |= 64 /* Readonly */;
lastReadonly = modifier;
break;
case 93 /* ExportKeyword */:
if (flags & 1 /* Export */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_already_seen, "export");
}
else if (flags & 2 /* Ambient */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, "export", "declare");
}
else if (flags & 128 /* Abstract */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, "export", "abstract");
}
else if (flags & 256 /* Async */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, "export", "async");
}
else if (ts.isClassLike(node.parent)) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_class_elements_of_this_kind, "export");
}
else if (node.kind === 162 /* Parameter */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_parameter, "export");
}
flags |= 1 /* Export */;
break;
case 88 /* DefaultKeyword */:
var container = node.parent.kind === 300 /* SourceFile */ ? node.parent : node.parent.parent;
if (container.kind === 259 /* ModuleDeclaration */ && !ts.isAmbientModule(container)) {
return grammarErrorOnNode(modifier, ts.Diagnostics.A_default_export_can_only_be_used_in_an_ECMAScript_style_module);
}
else if (!(flags & 1 /* Export */)) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, "export", "default");
}
flags |= 512 /* Default */;
break;
case 134 /* DeclareKeyword */:
if (flags & 2 /* Ambient */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_already_seen, "declare");
}
else if (flags & 256 /* Async */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_in_an_ambient_context, "async");
}
else if (flags & 16384 /* Override */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_in_an_ambient_context, "override");
}
else if (ts.isClassLike(node.parent) && !ts.isPropertyDeclaration(node)) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_class_elements_of_this_kind, "declare");
}
else if (node.kind === 162 /* Parameter */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_parameter, "declare");
}
else if ((node.parent.flags & 8388608 /* Ambient */) && node.parent.kind === 260 /* ModuleBlock */) {
return grammarErrorOnNode(modifier, ts.Diagnostics.A_declare_modifier_cannot_be_used_in_an_already_ambient_context);
}
else if (ts.isPrivateIdentifierClassElementDeclaration(node)) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_with_a_private_identifier, "declare");
}
flags |= 2 /* Ambient */;
lastDeclare = modifier;
break;
case 126 /* AbstractKeyword */:
if (flags & 128 /* Abstract */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_already_seen, "abstract");
}
if (node.kind !== 255 /* ClassDeclaration */ &&
node.kind !== 178 /* ConstructorType */) {
if (node.kind !== 167 /* MethodDeclaration */ &&
node.kind !== 165 /* PropertyDeclaration */ &&
node.kind !== 170 /* GetAccessor */ &&
node.kind !== 171 /* SetAccessor */) {
return grammarErrorOnNode(modifier, ts.Diagnostics.abstract_modifier_can_only_appear_on_a_class_method_or_property_declaration);
}
if (!(node.parent.kind === 255 /* ClassDeclaration */ && ts.hasSyntacticModifier(node.parent, 128 /* Abstract */))) {
return grammarErrorOnNode(modifier, ts.Diagnostics.Abstract_methods_can_only_appear_within_an_abstract_class);
}
if (flags & 32 /* Static */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_with_1_modifier, "static", "abstract");
}
if (flags & 8 /* Private */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_with_1_modifier, "private", "abstract");
}
if (flags & 256 /* Async */ && lastAsync) {
return grammarErrorOnNode(lastAsync, ts.Diagnostics._0_modifier_cannot_be_used_with_1_modifier, "async", "abstract");
}
if (flags & 16384 /* Override */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, "abstract", "override");
}
}
if (ts.isNamedDeclaration(node) && node.name.kind === 80 /* PrivateIdentifier */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_with_a_private_identifier, "abstract");
}
flags |= 128 /* Abstract */;
break;
case 130 /* AsyncKeyword */:
if (flags & 256 /* Async */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_already_seen, "async");
}
else if (flags & 2 /* Ambient */ || node.parent.flags & 8388608 /* Ambient */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_in_an_ambient_context, "async");
}
else if (node.kind === 162 /* Parameter */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_parameter, "async");
}
if (flags & 128 /* Abstract */) {
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_with_1_modifier, "async", "abstract");
}
flags |= 256 /* Async */;
lastAsync = modifier;
break;
}
}
if (node.kind === 169 /* Constructor */) {
if (flags & 32 /* Static */) {
return grammarErrorOnNode(lastStatic, ts.Diagnostics._0_modifier_cannot_appear_on_a_constructor_declaration, "static");
}
if (flags & 128 /* Abstract */) {
return grammarErrorOnNode(lastStatic, ts.Diagnostics._0_modifier_cannot_appear_on_a_constructor_declaration, "abstract"); // TODO: GH#18217
}
if (flags & 16384 /* Override */) {
return grammarErrorOnNode(lastOverride, ts.Diagnostics._0_modifier_cannot_appear_on_a_constructor_declaration, "override"); // TODO: GH#18217
}
else if (flags & 256 /* Async */) {
return grammarErrorOnNode(lastAsync, ts.Diagnostics._0_modifier_cannot_appear_on_a_constructor_declaration, "async");
}
else if (flags & 64 /* Readonly */) {
return grammarErrorOnNode(lastReadonly, ts.Diagnostics._0_modifier_cannot_appear_on_a_constructor_declaration, "readonly");
}
return false;
}
else if ((node.kind === 264 /* ImportDeclaration */ || node.kind === 263 /* ImportEqualsDeclaration */) && flags & 2 /* Ambient */) {
return grammarErrorOnNode(lastDeclare, ts.Diagnostics.A_0_modifier_cannot_be_used_with_an_import_declaration, "declare");
}
else if (node.kind === 162 /* Parameter */ && (flags & 16476 /* ParameterPropertyModifier */) && ts.isBindingPattern(node.name)) {
return grammarErrorOnNode(node, ts.Diagnostics.A_parameter_property_may_not_be_declared_using_a_binding_pattern);
}
else if (node.kind === 162 /* Parameter */ && (flags & 16476 /* ParameterPropertyModifier */) && node.dotDotDotToken) {
return grammarErrorOnNode(node, ts.Diagnostics.A_parameter_property_cannot_be_declared_using_a_rest_parameter);
}
if (flags & 256 /* Async */) {
return checkGrammarAsyncModifier(node, lastAsync);
}
return false;
}
/**
* true | false: Early return this value from checkGrammarModifiers.
* undefined: Need to do full checking on the modifiers.
*/
function reportObviousModifierErrors(node) {
return !node.modifiers
? false
: shouldReportBadModifier(node)
? grammarErrorOnFirstToken(node, ts.Diagnostics.Modifiers_cannot_appear_here)
: undefined;
}
function shouldReportBadModifier(node) {
switch (node.kind) {
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 169 /* Constructor */:
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
case 174 /* IndexSignature */:
case 259 /* ModuleDeclaration */:
case 264 /* ImportDeclaration */:
case 263 /* ImportEqualsDeclaration */:
case 270 /* ExportDeclaration */:
case 269 /* ExportAssignment */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
case 162 /* Parameter */:
return false;
default:
if (node.parent.kind === 260 /* ModuleBlock */ || node.parent.kind === 300 /* SourceFile */) {
return false;
}
switch (node.kind) {
case 254 /* FunctionDeclaration */:
return nodeHasAnyModifiersExcept(node, 130 /* AsyncKeyword */);
case 255 /* ClassDeclaration */:
case 178 /* ConstructorType */:
return nodeHasAnyModifiersExcept(node, 126 /* AbstractKeyword */);
case 256 /* InterfaceDeclaration */:
case 235 /* VariableStatement */:
case 257 /* TypeAliasDeclaration */:
case 168 /* ClassStaticBlockDeclaration */:
return true;
case 258 /* EnumDeclaration */:
return nodeHasAnyModifiersExcept(node, 85 /* ConstKeyword */);
default:
ts.Debug.fail();
}
}
}
function nodeHasAnyModifiersExcept(node, allowedModifier) {
return node.modifiers.length > 1 || node.modifiers[0].kind !== allowedModifier;
}
function checkGrammarAsyncModifier(node, asyncModifier) {
switch (node.kind) {
case 167 /* MethodDeclaration */:
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
case 212 /* ArrowFunction */:
return false;
}
return grammarErrorOnNode(asyncModifier, ts.Diagnostics._0_modifier_cannot_be_used_here, "async");
}
function checkGrammarForDisallowedTrailingComma(list, diag) {
if (diag === void 0) { diag = ts.Diagnostics.Trailing_comma_not_allowed; }
if (list && list.hasTrailingComma) {
return grammarErrorAtPos(list[0], list.end - ",".length, ",".length, diag);
}
return false;
}
function checkGrammarTypeParameterList(typeParameters, file) {
if (typeParameters && typeParameters.length === 0) {
var start = typeParameters.pos - "<".length;
var end = ts.skipTrivia(file.text, typeParameters.end) + ">".length;
return grammarErrorAtPos(file, start, end - start, ts.Diagnostics.Type_parameter_list_cannot_be_empty);
}
return false;
}
function checkGrammarParameterList(parameters) {
var seenOptionalParameter = false;
var parameterCount = parameters.length;
for (var i = 0; i < parameterCount; i++) {
var parameter = parameters[i];
if (parameter.dotDotDotToken) {
if (i !== (parameterCount - 1)) {
return grammarErrorOnNode(parameter.dotDotDotToken, ts.Diagnostics.A_rest_parameter_must_be_last_in_a_parameter_list);
}
if (!(parameter.flags & 8388608 /* Ambient */)) { // Allow `...foo,` in ambient declarations; see GH#23070
checkGrammarForDisallowedTrailingComma(parameters, ts.Diagnostics.A_rest_parameter_or_binding_pattern_may_not_have_a_trailing_comma);
}
if (parameter.questionToken) {
return grammarErrorOnNode(parameter.questionToken, ts.Diagnostics.A_rest_parameter_cannot_be_optional);
}
if (parameter.initializer) {
return grammarErrorOnNode(parameter.name, ts.Diagnostics.A_rest_parameter_cannot_have_an_initializer);
}
}
else if (isOptionalParameter(parameter)) {
seenOptionalParameter = true;
if (parameter.questionToken && parameter.initializer) {
return grammarErrorOnNode(parameter.name, ts.Diagnostics.Parameter_cannot_have_question_mark_and_initializer);
}
}
else if (seenOptionalParameter && !parameter.initializer) {
return grammarErrorOnNode(parameter.name, ts.Diagnostics.A_required_parameter_cannot_follow_an_optional_parameter);
}
}
}
function getNonSimpleParameters(parameters) {
return ts.filter(parameters, function (parameter) { return !!parameter.initializer || ts.isBindingPattern(parameter.name) || ts.isRestParameter(parameter); });
}
function checkGrammarForUseStrictSimpleParameterList(node) {
if (languageVersion >= 3 /* ES2016 */) {
var useStrictDirective_1 = node.body && ts.isBlock(node.body) && ts.findUseStrictPrologue(node.body.statements);
if (useStrictDirective_1) {
var nonSimpleParameters = getNonSimpleParameters(node.parameters);
if (ts.length(nonSimpleParameters)) {
ts.forEach(nonSimpleParameters, function (parameter) {
ts.addRelatedInfo(error(parameter, ts.Diagnostics.This_parameter_is_not_allowed_with_use_strict_directive), ts.createDiagnosticForNode(useStrictDirective_1, ts.Diagnostics.use_strict_directive_used_here));
});
var diagnostics_2 = nonSimpleParameters.map(function (parameter, index) { return (index === 0 ? ts.createDiagnosticForNode(parameter, ts.Diagnostics.Non_simple_parameter_declared_here) : ts.createDiagnosticForNode(parameter, ts.Diagnostics.and_here)); });
ts.addRelatedInfo.apply(void 0, __spreadArray([error(useStrictDirective_1, ts.Diagnostics.use_strict_directive_cannot_be_used_with_non_simple_parameter_list)], diagnostics_2, false));
return true;
}
}
}
return false;
}
function checkGrammarFunctionLikeDeclaration(node) {
// Prevent cascading error by short-circuit
var file = ts.getSourceFileOfNode(node);
return checkGrammarDecoratorsAndModifiers(node) ||
checkGrammarTypeParameterList(node.typeParameters, file) ||
checkGrammarParameterList(node.parameters) ||
checkGrammarArrowFunction(node, file) ||
(ts.isFunctionLikeDeclaration(node) && checkGrammarForUseStrictSimpleParameterList(node));
}
function checkGrammarClassLikeDeclaration(node) {
var file = ts.getSourceFileOfNode(node);
return checkGrammarClassDeclarationHeritageClauses(node) ||
checkGrammarTypeParameterList(node.typeParameters, file);
}
function checkGrammarArrowFunction(node, file) {
if (!ts.isArrowFunction(node)) {
return false;
}
var equalsGreaterThanToken = node.equalsGreaterThanToken;
var startLine = ts.getLineAndCharacterOfPosition(file, equalsGreaterThanToken.pos).line;
var endLine = ts.getLineAndCharacterOfPosition(file, equalsGreaterThanToken.end).line;
return startLine !== endLine && grammarErrorOnNode(equalsGreaterThanToken, ts.Diagnostics.Line_terminator_not_permitted_before_arrow);
}
function checkGrammarIndexSignatureParameters(node) {
var parameter = node.parameters[0];
if (node.parameters.length !== 1) {
if (parameter) {
return grammarErrorOnNode(parameter.name, ts.Diagnostics.An_index_signature_must_have_exactly_one_parameter);
}
else {
return grammarErrorOnNode(node, ts.Diagnostics.An_index_signature_must_have_exactly_one_parameter);
}
}
checkGrammarForDisallowedTrailingComma(node.parameters, ts.Diagnostics.An_index_signature_cannot_have_a_trailing_comma);
if (parameter.dotDotDotToken) {
return grammarErrorOnNode(parameter.dotDotDotToken, ts.Diagnostics.An_index_signature_cannot_have_a_rest_parameter);
}
if (ts.hasEffectiveModifiers(parameter)) {
return grammarErrorOnNode(parameter.name, ts.Diagnostics.An_index_signature_parameter_cannot_have_an_accessibility_modifier);
}
if (parameter.questionToken) {
return grammarErrorOnNode(parameter.questionToken, ts.Diagnostics.An_index_signature_parameter_cannot_have_a_question_mark);
}
if (parameter.initializer) {
return grammarErrorOnNode(parameter.name, ts.Diagnostics.An_index_signature_parameter_cannot_have_an_initializer);
}
if (!parameter.type) {
return grammarErrorOnNode(parameter.name, ts.Diagnostics.An_index_signature_parameter_must_have_a_type_annotation);
}
var type = getTypeFromTypeNode(parameter.type);
if (someType(type, function (t) { return !!(t.flags & 8576 /* StringOrNumberLiteralOrUnique */); }) || isGenericType(type)) {
return grammarErrorOnNode(parameter.name, ts.Diagnostics.An_index_signature_parameter_type_cannot_be_a_literal_type_or_generic_type_Consider_using_a_mapped_object_type_instead);
}
if (!everyType(type, isValidIndexKeyType)) {
return grammarErrorOnNode(parameter.name, ts.Diagnostics.An_index_signature_parameter_type_must_be_string_number_symbol_or_a_template_literal_type);
}
if (!node.type) {
return grammarErrorOnNode(node, ts.Diagnostics.An_index_signature_must_have_a_type_annotation);
}
return false;
}
function checkGrammarIndexSignature(node) {
// Prevent cascading error by short-circuit
return checkGrammarDecoratorsAndModifiers(node) || checkGrammarIndexSignatureParameters(node);
}
function checkGrammarForAtLeastOneTypeArgument(node, typeArguments) {
if (typeArguments && typeArguments.length === 0) {
var sourceFile = ts.getSourceFileOfNode(node);
var start = typeArguments.pos - "<".length;
var end = ts.skipTrivia(sourceFile.text, typeArguments.end) + ">".length;
return grammarErrorAtPos(sourceFile, start, end - start, ts.Diagnostics.Type_argument_list_cannot_be_empty);
}
return false;
}
function checkGrammarTypeArguments(node, typeArguments) {
return checkGrammarForDisallowedTrailingComma(typeArguments) ||
checkGrammarForAtLeastOneTypeArgument(node, typeArguments);
}
function checkGrammarTaggedTemplateChain(node) {
if (node.questionDotToken || node.flags & 32 /* OptionalChain */) {
return grammarErrorOnNode(node.template, ts.Diagnostics.Tagged_template_expressions_are_not_permitted_in_an_optional_chain);
}
return false;
}
function checkGrammarForOmittedArgument(args) {
if (args) {
for (var _i = 0, args_4 = args; _i < args_4.length; _i++) {
var arg = args_4[_i];
if (arg.kind === 225 /* OmittedExpression */) {
return grammarErrorAtPos(arg, arg.pos, 0, ts.Diagnostics.Argument_expression_expected);
}
}
}
return false;
}
function checkGrammarArguments(args) {
return checkGrammarForOmittedArgument(args);
}
function checkGrammarHeritageClause(node) {
var types = node.types;
if (checkGrammarForDisallowedTrailingComma(types)) {
return true;
}
if (types && types.length === 0) {
var listType = ts.tokenToString(node.token);
return grammarErrorAtPos(node, types.pos, 0, ts.Diagnostics._0_list_cannot_be_empty, listType);
}
return ts.some(types, checkGrammarExpressionWithTypeArguments);
}
function checkGrammarExpressionWithTypeArguments(node) {
return checkGrammarTypeArguments(node, node.typeArguments);
}
function checkGrammarClassDeclarationHeritageClauses(node) {
var seenExtendsClause = false;
var seenImplementsClause = false;
if (!checkGrammarDecoratorsAndModifiers(node) && node.heritageClauses) {
for (var _i = 0, _a = node.heritageClauses; _i < _a.length; _i++) {
var heritageClause = _a[_i];
if (heritageClause.token === 94 /* ExtendsKeyword */) {
if (seenExtendsClause) {
return grammarErrorOnFirstToken(heritageClause, ts.Diagnostics.extends_clause_already_seen);
}
if (seenImplementsClause) {
return grammarErrorOnFirstToken(heritageClause, ts.Diagnostics.extends_clause_must_precede_implements_clause);
}
if (heritageClause.types.length > 1) {
return grammarErrorOnFirstToken(heritageClause.types[1], ts.Diagnostics.Classes_can_only_extend_a_single_class);
}
seenExtendsClause = true;
}
else {
ts.Debug.assert(heritageClause.token === 117 /* ImplementsKeyword */);
if (seenImplementsClause) {
return grammarErrorOnFirstToken(heritageClause, ts.Diagnostics.implements_clause_already_seen);
}
seenImplementsClause = true;
}
// Grammar checking heritageClause inside class declaration
checkGrammarHeritageClause(heritageClause);
}
}
}
function checkGrammarInterfaceDeclaration(node) {
var seenExtendsClause = false;
if (node.heritageClauses) {
for (var _i = 0, _a = node.heritageClauses; _i < _a.length; _i++) {
var heritageClause = _a[_i];
if (heritageClause.token === 94 /* ExtendsKeyword */) {
if (seenExtendsClause) {
return grammarErrorOnFirstToken(heritageClause, ts.Diagnostics.extends_clause_already_seen);
}
seenExtendsClause = true;
}
else {
ts.Debug.assert(heritageClause.token === 117 /* ImplementsKeyword */);
return grammarErrorOnFirstToken(heritageClause, ts.Diagnostics.Interface_declaration_cannot_have_implements_clause);
}
// Grammar checking heritageClause inside class declaration
checkGrammarHeritageClause(heritageClause);
}
}
return false;
}
function checkGrammarComputedPropertyName(node) {
// If node is not a computedPropertyName, just skip the grammar checking
if (node.kind !== 160 /* ComputedPropertyName */) {
return false;
}
var computedPropertyName = node;
if (computedPropertyName.expression.kind === 219 /* BinaryExpression */ && computedPropertyName.expression.operatorToken.kind === 27 /* CommaToken */) {
return grammarErrorOnNode(computedPropertyName.expression, ts.Diagnostics.A_comma_expression_is_not_allowed_in_a_computed_property_name);
}
return false;
}
function checkGrammarForGenerator(node) {
if (node.asteriskToken) {
ts.Debug.assert(node.kind === 254 /* FunctionDeclaration */ ||
node.kind === 211 /* FunctionExpression */ ||
node.kind === 167 /* MethodDeclaration */);
if (node.flags & 8388608 /* Ambient */) {
return grammarErrorOnNode(node.asteriskToken, ts.Diagnostics.Generators_are_not_allowed_in_an_ambient_context);
}
if (!node.body) {
return grammarErrorOnNode(node.asteriskToken, ts.Diagnostics.An_overload_signature_cannot_be_declared_as_a_generator);
}
}
}
function checkGrammarForInvalidQuestionMark(questionToken, message) {
return !!questionToken && grammarErrorOnNode(questionToken, message);
}
function checkGrammarForInvalidExclamationToken(exclamationToken, message) {
return !!exclamationToken && grammarErrorOnNode(exclamationToken, message);
}
function checkGrammarObjectLiteralExpression(node, inDestructuring) {
var seen = new ts.Map();
for (var _i = 0, _a = node.properties; _i < _a.length; _i++) {
var prop = _a[_i];
if (prop.kind === 293 /* SpreadAssignment */) {
if (inDestructuring) {
// a rest property cannot be destructured any further
var expression = ts.skipParentheses(prop.expression);
if (ts.isArrayLiteralExpression(expression) || ts.isObjectLiteralExpression(expression)) {
return grammarErrorOnNode(prop.expression, ts.Diagnostics.A_rest_element_cannot_contain_a_binding_pattern);
}
}
continue;
}
var name = prop.name;
if (name.kind === 160 /* ComputedPropertyName */) {
// If the name is not a ComputedPropertyName, the grammar checking will skip it
checkGrammarComputedPropertyName(name);
}
if (prop.kind === 292 /* ShorthandPropertyAssignment */ && !inDestructuring && prop.objectAssignmentInitializer) {
// having objectAssignmentInitializer is only valid in ObjectAssignmentPattern
// outside of destructuring it is a syntax error
return grammarErrorOnNode(prop.equalsToken, ts.Diagnostics.Did_you_mean_to_use_a_Colon_An_can_only_follow_a_property_name_when_the_containing_object_literal_is_part_of_a_destructuring_pattern);
}
if (name.kind === 80 /* PrivateIdentifier */) {
grammarErrorOnNode(name, ts.Diagnostics.Private_identifiers_are_not_allowed_outside_class_bodies);
}
// Modifiers are never allowed on properties except for 'async' on a method declaration
if (prop.modifiers) {
// eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion
for (var _b = 0, _c = prop.modifiers; _b < _c.length; _b++) { // TODO: GH#19955
var mod = _c[_b];
if (mod.kind !== 130 /* AsyncKeyword */ || prop.kind !== 167 /* MethodDeclaration */) {
grammarErrorOnNode(mod, ts.Diagnostics._0_modifier_cannot_be_used_here, ts.getTextOfNode(mod));
}
}
}
// ECMA-262 11.1.5 Object Initializer
// If previous is not undefined then throw a SyntaxError exception if any of the following conditions are true
// a.This production is contained in strict code and IsDataDescriptor(previous) is true and
// IsDataDescriptor(propId.descriptor) is true.
// b.IsDataDescriptor(previous) is true and IsAccessorDescriptor(propId.descriptor) is true.
// c.IsAccessorDescriptor(previous) is true and IsDataDescriptor(propId.descriptor) is true.
// d.IsAccessorDescriptor(previous) is true and IsAccessorDescriptor(propId.descriptor) is true
// and either both previous and propId.descriptor have[[Get]] fields or both previous and propId.descriptor have[[Set]] fields
var currentKind = void 0;
switch (prop.kind) {
case 292 /* ShorthandPropertyAssignment */:
checkGrammarForInvalidExclamationToken(prop.exclamationToken, ts.Diagnostics.A_definite_assignment_assertion_is_not_permitted_in_this_context);
// falls through
case 291 /* PropertyAssignment */:
// Grammar checking for computedPropertyName and shorthandPropertyAssignment
checkGrammarForInvalidQuestionMark(prop.questionToken, ts.Diagnostics.An_object_member_cannot_be_declared_optional);
if (name.kind === 8 /* NumericLiteral */) {
checkGrammarNumericLiteral(name);
}
currentKind = 4 /* PropertyAssignment */;
break;
case 167 /* MethodDeclaration */:
currentKind = 8 /* Method */;
break;
case 170 /* GetAccessor */:
currentKind = 1 /* GetAccessor */;
break;
case 171 /* SetAccessor */:
currentKind = 2 /* SetAccessor */;
break;
default:
throw ts.Debug.assertNever(prop, "Unexpected syntax kind:" + prop.kind);
}
if (!inDestructuring) {
var effectiveName = ts.getPropertyNameForPropertyNameNode(name);
if (effectiveName === undefined) {
continue;
}
var existingKind = seen.get(effectiveName);
if (!existingKind) {
seen.set(effectiveName, currentKind);
}
else {
if ((currentKind & 12 /* PropertyAssignmentOrMethod */) && (existingKind & 12 /* PropertyAssignmentOrMethod */)) {
grammarErrorOnNode(name, ts.Diagnostics.Duplicate_identifier_0, ts.getTextOfNode(name));
}
else if ((currentKind & 3 /* GetOrSetAccessor */) && (existingKind & 3 /* GetOrSetAccessor */)) {
if (existingKind !== 3 /* GetOrSetAccessor */ && currentKind !== existingKind) {
seen.set(effectiveName, currentKind | existingKind);
}
else {
return grammarErrorOnNode(name, ts.Diagnostics.An_object_literal_cannot_have_multiple_get_Slashset_accessors_with_the_same_name);
}
}
else {
return grammarErrorOnNode(name, ts.Diagnostics.An_object_literal_cannot_have_property_and_accessor_with_the_same_name);
}
}
}
}
}
function checkGrammarJsxElement(node) {
checkGrammarJsxName(node.tagName);
checkGrammarTypeArguments(node, node.typeArguments);
var seen = new ts.Map();
for (var _i = 0, _a = node.attributes.properties; _i < _a.length; _i++) {
var attr = _a[_i];
if (attr.kind === 285 /* JsxSpreadAttribute */) {
continue;
}
var name = attr.name, initializer = attr.initializer;
if (!seen.get(name.escapedText)) {
seen.set(name.escapedText, true);
}
else {
return grammarErrorOnNode(name, ts.Diagnostics.JSX_elements_cannot_have_multiple_attributes_with_the_same_name);
}
if (initializer && initializer.kind === 286 /* JsxExpression */ && !initializer.expression) {
return grammarErrorOnNode(initializer, ts.Diagnostics.JSX_attributes_must_only_be_assigned_a_non_empty_expression);
}
}
}
function checkGrammarJsxName(node) {
if (ts.isPropertyAccessExpression(node)) {
var propName = node;
do {
var check_1 = checkGrammarJsxNestedIdentifier(propName.name);
if (check_1) {
return check_1;
}
propName = propName.expression;
} while (ts.isPropertyAccessExpression(propName));
var check = checkGrammarJsxNestedIdentifier(propName);
if (check) {
return check;
}
}
function checkGrammarJsxNestedIdentifier(name) {
if (ts.isIdentifier(name) && ts.idText(name).indexOf(":") !== -1) {
return grammarErrorOnNode(name, ts.Diagnostics.JSX_property_access_expressions_cannot_include_JSX_namespace_names);
}
}
}
function checkGrammarJsxExpression(node) {
if (node.expression && ts.isCommaSequence(node.expression)) {
return grammarErrorOnNode(node.expression, ts.Diagnostics.JSX_expressions_may_not_use_the_comma_operator_Did_you_mean_to_write_an_array);
}
}
function checkGrammarForInOrForOfStatement(forInOrOfStatement) {
if (checkGrammarStatementInAmbientContext(forInOrOfStatement)) {
return true;
}
if (forInOrOfStatement.kind === 242 /* ForOfStatement */ && forInOrOfStatement.awaitModifier) {
if (!(forInOrOfStatement.flags & 32768 /* AwaitContext */)) {
var sourceFile = ts.getSourceFileOfNode(forInOrOfStatement);
if (ts.isInTopLevelContext(forInOrOfStatement)) {
if (!hasParseDiagnostics(sourceFile)) {
if (!ts.isEffectiveExternalModule(sourceFile, compilerOptions)) {
diagnostics.add(ts.createDiagnosticForNode(forInOrOfStatement.awaitModifier, ts.Diagnostics.for_await_loops_are_only_allowed_at_the_top_level_of_a_file_when_that_file_is_a_module_but_this_file_has_no_imports_or_exports_Consider_adding_an_empty_export_to_make_this_file_a_module));
}
if ((moduleKind !== ts.ModuleKind.ESNext && moduleKind !== ts.ModuleKind.System) || languageVersion < 4 /* ES2017 */) {
diagnostics.add(ts.createDiagnosticForNode(forInOrOfStatement.awaitModifier, ts.Diagnostics.Top_level_for_await_loops_are_only_allowed_when_the_module_option_is_set_to_esnext_or_system_and_the_target_option_is_set_to_es2017_or_higher));
}
}
}
else {
// use of 'for-await-of' in non-async function
if (!hasParseDiagnostics(sourceFile)) {
var diagnostic = ts.createDiagnosticForNode(forInOrOfStatement.awaitModifier, ts.Diagnostics.for_await_loops_are_only_allowed_within_async_functions_and_at_the_top_levels_of_modules);
var func = ts.getContainingFunction(forInOrOfStatement);
if (func && func.kind !== 169 /* Constructor */) {
ts.Debug.assert((ts.getFunctionFlags(func) & 2 /* Async */) === 0, "Enclosing function should never be an async function.");
var relatedInfo = ts.createDiagnosticForNode(func, ts.Diagnostics.Did_you_mean_to_mark_this_function_as_async);
ts.addRelatedInfo(diagnostic, relatedInfo);
}
diagnostics.add(diagnostic);
return true;
}
}
return false;
}
}
if (ts.isForOfStatement(forInOrOfStatement) && !(forInOrOfStatement.flags & 32768 /* AwaitContext */) &&
ts.isIdentifier(forInOrOfStatement.initializer) && forInOrOfStatement.initializer.escapedText === "async") {
grammarErrorOnNode(forInOrOfStatement.initializer, ts.Diagnostics.The_left_hand_side_of_a_for_of_statement_may_not_be_async);
return false;
}
if (forInOrOfStatement.initializer.kind === 253 /* VariableDeclarationList */) {
var variableList = forInOrOfStatement.initializer;
if (!checkGrammarVariableDeclarationList(variableList)) {
var declarations = variableList.declarations;
// declarations.length can be zero if there is an error in variable declaration in for-of or for-in
// See http://www.ecma-international.org/ecma-262/6.0/#sec-for-in-and-for-of-statements for details
// For example:
// var let = 10;
// for (let of [1,2,3]) {} // this is invalid ES6 syntax
// for (let in [1,2,3]) {} // this is invalid ES6 syntax
// We will then want to skip on grammar checking on variableList declaration
if (!declarations.length) {
return false;
}
if (declarations.length > 1) {
var diagnostic = forInOrOfStatement.kind === 241 /* ForInStatement */
? ts.Diagnostics.Only_a_single_variable_declaration_is_allowed_in_a_for_in_statement
: ts.Diagnostics.Only_a_single_variable_declaration_is_allowed_in_a_for_of_statement;
return grammarErrorOnFirstToken(variableList.declarations[1], diagnostic);
}
var firstDeclaration = declarations[0];
if (firstDeclaration.initializer) {
var diagnostic = forInOrOfStatement.kind === 241 /* ForInStatement */
? ts.Diagnostics.The_variable_declaration_of_a_for_in_statement_cannot_have_an_initializer
: ts.Diagnostics.The_variable_declaration_of_a_for_of_statement_cannot_have_an_initializer;
return grammarErrorOnNode(firstDeclaration.name, diagnostic);
}
if (firstDeclaration.type) {
var diagnostic = forInOrOfStatement.kind === 241 /* ForInStatement */
? ts.Diagnostics.The_left_hand_side_of_a_for_in_statement_cannot_use_a_type_annotation
: ts.Diagnostics.The_left_hand_side_of_a_for_of_statement_cannot_use_a_type_annotation;
return grammarErrorOnNode(firstDeclaration, diagnostic);
}
}
}
return false;
}
function checkGrammarAccessor(accessor) {
if (!(accessor.flags & 8388608 /* Ambient */) && (accessor.parent.kind !== 180 /* TypeLiteral */) && (accessor.parent.kind !== 256 /* InterfaceDeclaration */)) {
if (languageVersion < 1 /* ES5 */) {
return grammarErrorOnNode(accessor.name, ts.Diagnostics.Accessors_are_only_available_when_targeting_ECMAScript_5_and_higher);
}
if (languageVersion < 2 /* ES2015 */ && ts.isPrivateIdentifier(accessor.name)) {
return grammarErrorOnNode(accessor.name, ts.Diagnostics.Private_identifiers_are_only_available_when_targeting_ECMAScript_2015_and_higher);
}
if (accessor.body === undefined && !ts.hasSyntacticModifier(accessor, 128 /* Abstract */)) {
return grammarErrorAtPos(accessor, accessor.end - 1, ";".length, ts.Diagnostics._0_expected, "{");
}
}
if (accessor.body) {
if (ts.hasSyntacticModifier(accessor, 128 /* Abstract */)) {
return grammarErrorOnNode(accessor, ts.Diagnostics.An_abstract_accessor_cannot_have_an_implementation);
}
if (accessor.parent.kind === 180 /* TypeLiteral */ || accessor.parent.kind === 256 /* InterfaceDeclaration */) {
return grammarErrorOnNode(accessor.body, ts.Diagnostics.An_implementation_cannot_be_declared_in_ambient_contexts);
}
}
if (accessor.typeParameters) {
return grammarErrorOnNode(accessor.name, ts.Diagnostics.An_accessor_cannot_have_type_parameters);
}
if (!doesAccessorHaveCorrectParameterCount(accessor)) {
return grammarErrorOnNode(accessor.name, accessor.kind === 170 /* GetAccessor */ ?
ts.Diagnostics.A_get_accessor_cannot_have_parameters :
ts.Diagnostics.A_set_accessor_must_have_exactly_one_parameter);
}
if (accessor.kind === 171 /* SetAccessor */) {
if (accessor.type) {
return grammarErrorOnNode(accessor.name, ts.Diagnostics.A_set_accessor_cannot_have_a_return_type_annotation);
}
var parameter = ts.Debug.checkDefined(ts.getSetAccessorValueParameter(accessor), "Return value does not match parameter count assertion.");
if (parameter.dotDotDotToken) {
return grammarErrorOnNode(parameter.dotDotDotToken, ts.Diagnostics.A_set_accessor_cannot_have_rest_parameter);
}
if (parameter.questionToken) {
return grammarErrorOnNode(parameter.questionToken, ts.Diagnostics.A_set_accessor_cannot_have_an_optional_parameter);
}
if (parameter.initializer) {
return grammarErrorOnNode(accessor.name, ts.Diagnostics.A_set_accessor_parameter_cannot_have_an_initializer);
}
}
return false;
}
/** Does the accessor have the right number of parameters?
* A get accessor has no parameters or a single `this` parameter.
* A set accessor has one parameter or a `this` parameter and one more parameter.
*/
function doesAccessorHaveCorrectParameterCount(accessor) {
return getAccessorThisParameter(accessor) || accessor.parameters.length === (accessor.kind === 170 /* GetAccessor */ ? 0 : 1);
}
function getAccessorThisParameter(accessor) {
if (accessor.parameters.length === (accessor.kind === 170 /* GetAccessor */ ? 1 : 2)) {
return ts.getThisParameter(accessor);
}
}
function checkGrammarTypeOperatorNode(node) {
if (node.operator === 152 /* UniqueKeyword */) {
if (node.type.kind !== 149 /* SymbolKeyword */) {
return grammarErrorOnNode(node.type, ts.Diagnostics._0_expected, ts.tokenToString(149 /* SymbolKeyword */));
}
var parent = ts.walkUpParenthesizedTypes(node.parent);
if (ts.isInJSFile(parent) && ts.isJSDocTypeExpression(parent)) {
parent = parent.parent;
if (ts.isJSDocTypeTag(parent)) {
// walk up past JSDoc comment node
parent = parent.parent.parent;
}
}
switch (parent.kind) {
case 252 /* VariableDeclaration */:
var decl = parent;
if (decl.name.kind !== 79 /* Identifier */) {
return grammarErrorOnNode(node, ts.Diagnostics.unique_symbol_types_may_not_be_used_on_a_variable_declaration_with_a_binding_name);
}
if (!ts.isVariableDeclarationInVariableStatement(decl)) {
return grammarErrorOnNode(node, ts.Diagnostics.unique_symbol_types_are_only_allowed_on_variables_in_a_variable_statement);
}
if (!(decl.parent.flags & 2 /* Const */)) {
return grammarErrorOnNode(parent.name, ts.Diagnostics.A_variable_whose_type_is_a_unique_symbol_type_must_be_const);
}
break;
case 165 /* PropertyDeclaration */:
if (!ts.isStatic(parent) ||
!ts.hasEffectiveReadonlyModifier(parent)) {
return grammarErrorOnNode(parent.name, ts.Diagnostics.A_property_of_a_class_whose_type_is_a_unique_symbol_type_must_be_both_static_and_readonly);
}
break;
case 164 /* PropertySignature */:
if (!ts.hasSyntacticModifier(parent, 64 /* Readonly */)) {
return grammarErrorOnNode(parent.name, ts.Diagnostics.A_property_of_an_interface_or_type_literal_whose_type_is_a_unique_symbol_type_must_be_readonly);
}
break;
default:
return grammarErrorOnNode(node, ts.Diagnostics.unique_symbol_types_are_not_allowed_here);
}
}
else if (node.operator === 143 /* ReadonlyKeyword */) {
if (node.type.kind !== 181 /* ArrayType */ && node.type.kind !== 182 /* TupleType */) {
return grammarErrorOnFirstToken(node, ts.Diagnostics.readonly_type_modifier_is_only_permitted_on_array_and_tuple_literal_types, ts.tokenToString(149 /* SymbolKeyword */));
}
}
}
function checkGrammarForInvalidDynamicName(node, message) {
if (isNonBindableDynamicName(node)) {
return grammarErrorOnNode(node, message);
}
}
function checkGrammarMethod(node) {
if (checkGrammarFunctionLikeDeclaration(node)) {
return true;
}
if (node.kind === 167 /* MethodDeclaration */) {
if (node.parent.kind === 203 /* ObjectLiteralExpression */) {
// We only disallow modifier on a method declaration if it is a property of object-literal-expression
if (node.modifiers && !(node.modifiers.length === 1 && ts.first(node.modifiers).kind === 130 /* AsyncKeyword */)) {
return grammarErrorOnFirstToken(node, ts.Diagnostics.Modifiers_cannot_appear_here);
}
else if (checkGrammarForInvalidQuestionMark(node.questionToken, ts.Diagnostics.An_object_member_cannot_be_declared_optional)) {
return true;
}
else if (checkGrammarForInvalidExclamationToken(node.exclamationToken, ts.Diagnostics.A_definite_assignment_assertion_is_not_permitted_in_this_context)) {
return true;
}
else if (node.body === undefined) {
return grammarErrorAtPos(node, node.end - 1, ";".length, ts.Diagnostics._0_expected, "{");
}
}
if (checkGrammarForGenerator(node)) {
return true;
}
}
if (ts.isClassLike(node.parent)) {
if (languageVersion < 2 /* ES2015 */ && ts.isPrivateIdentifier(node.name)) {
return grammarErrorOnNode(node.name, ts.Diagnostics.Private_identifiers_are_only_available_when_targeting_ECMAScript_2015_and_higher);
}
// Technically, computed properties in ambient contexts is disallowed
// for property declarations and accessors too, not just methods.
// However, property declarations disallow computed names in general,
// and accessors are not allowed in ambient contexts in general,
// so this error only really matters for methods.
if (node.flags & 8388608 /* Ambient */) {
return checkGrammarForInvalidDynamicName(node.name, ts.Diagnostics.A_computed_property_name_in_an_ambient_context_must_refer_to_an_expression_whose_type_is_a_literal_type_or_a_unique_symbol_type);
}
else if (node.kind === 167 /* MethodDeclaration */ && !node.body) {
return checkGrammarForInvalidDynamicName(node.name, ts.Diagnostics.A_computed_property_name_in_a_method_overload_must_refer_to_an_expression_whose_type_is_a_literal_type_or_a_unique_symbol_type);
}
}
else if (node.parent.kind === 256 /* InterfaceDeclaration */) {
return checkGrammarForInvalidDynamicName(node.name, ts.Diagnostics.A_computed_property_name_in_an_interface_must_refer_to_an_expression_whose_type_is_a_literal_type_or_a_unique_symbol_type);
}
else if (node.parent.kind === 180 /* TypeLiteral */) {
return checkGrammarForInvalidDynamicName(node.name, ts.Diagnostics.A_computed_property_name_in_a_type_literal_must_refer_to_an_expression_whose_type_is_a_literal_type_or_a_unique_symbol_type);
}
}
function checkGrammarBreakOrContinueStatement(node) {
var current = node;
while (current) {
if (ts.isFunctionLikeOrClassStaticBlockDeclaration(current)) {
return grammarErrorOnNode(node, ts.Diagnostics.Jump_target_cannot_cross_function_boundary);
}
switch (current.kind) {
case 248 /* LabeledStatement */:
if (node.label && current.label.escapedText === node.label.escapedText) {
// found matching label - verify that label usage is correct
// continue can only target labels that are on iteration statements
var isMisplacedContinueLabel = node.kind === 243 /* ContinueStatement */
&& !ts.isIterationStatement(current.statement, /*lookInLabeledStatement*/ true);
if (isMisplacedContinueLabel) {
return grammarErrorOnNode(node, ts.Diagnostics.A_continue_statement_can_only_jump_to_a_label_of_an_enclosing_iteration_statement);
}
return false;
}
break;
case 247 /* SwitchStatement */:
if (node.kind === 244 /* BreakStatement */ && !node.label) {
// unlabeled break within switch statement - ok
return false;
}
break;
default:
if (ts.isIterationStatement(current, /*lookInLabeledStatement*/ false) && !node.label) {
// unlabeled break or continue within iteration statement - ok
return false;
}
break;
}
current = current.parent;
}
if (node.label) {
var message = node.kind === 244 /* BreakStatement */
? ts.Diagnostics.A_break_statement_can_only_jump_to_a_label_of_an_enclosing_statement
: ts.Diagnostics.A_continue_statement_can_only_jump_to_a_label_of_an_enclosing_iteration_statement;
return grammarErrorOnNode(node, message);
}
else {
var message = node.kind === 244 /* BreakStatement */
? ts.Diagnostics.A_break_statement_can_only_be_used_within_an_enclosing_iteration_or_switch_statement
: ts.Diagnostics.A_continue_statement_can_only_be_used_within_an_enclosing_iteration_statement;
return grammarErrorOnNode(node, message);
}
}
function checkGrammarBindingElement(node) {
if (node.dotDotDotToken) {
var elements = node.parent.elements;
if (node !== ts.last(elements)) {
return grammarErrorOnNode(node, ts.Diagnostics.A_rest_element_must_be_last_in_a_destructuring_pattern);
}
checkGrammarForDisallowedTrailingComma(elements, ts.Diagnostics.A_rest_parameter_or_binding_pattern_may_not_have_a_trailing_comma);
if (node.propertyName) {
return grammarErrorOnNode(node.name, ts.Diagnostics.A_rest_element_cannot_have_a_property_name);
}
}
if (node.dotDotDotToken && node.initializer) {
// Error on equals token which immediately precedes the initializer
return grammarErrorAtPos(node, node.initializer.pos - 1, 1, ts.Diagnostics.A_rest_element_cannot_have_an_initializer);
}
}
function isStringOrNumberLiteralExpression(expr) {
return ts.isStringOrNumericLiteralLike(expr) ||
expr.kind === 217 /* PrefixUnaryExpression */ && expr.operator === 40 /* MinusToken */ &&
expr.operand.kind === 8 /* NumericLiteral */;
}
function isBigIntLiteralExpression(expr) {
return expr.kind === 9 /* BigIntLiteral */ ||
expr.kind === 217 /* PrefixUnaryExpression */ && expr.operator === 40 /* MinusToken */ &&
expr.operand.kind === 9 /* BigIntLiteral */;
}
function isSimpleLiteralEnumReference(expr) {
if ((ts.isPropertyAccessExpression(expr) || (ts.isElementAccessExpression(expr) && isStringOrNumberLiteralExpression(expr.argumentExpression))) &&
ts.isEntityNameExpression(expr.expression)) {
return !!(checkExpressionCached(expr).flags & 1024 /* EnumLiteral */);
}
}
function checkAmbientInitializer(node) {
var initializer = node.initializer;
if (initializer) {
var isInvalidInitializer = !(isStringOrNumberLiteralExpression(initializer) ||
isSimpleLiteralEnumReference(initializer) ||
initializer.kind === 110 /* TrueKeyword */ || initializer.kind === 95 /* FalseKeyword */ ||
isBigIntLiteralExpression(initializer));
var isConstOrReadonly = ts.isDeclarationReadonly(node) || ts.isVariableDeclaration(node) && ts.isVarConst(node);
if (isConstOrReadonly && !node.type) {
if (isInvalidInitializer) {
return grammarErrorOnNode(initializer, ts.Diagnostics.A_const_initializer_in_an_ambient_context_must_be_a_string_or_numeric_literal_or_literal_enum_reference);
}
}
else {
return grammarErrorOnNode(initializer, ts.Diagnostics.Initializers_are_not_allowed_in_ambient_contexts);
}
if (!isConstOrReadonly || isInvalidInitializer) {
return grammarErrorOnNode(initializer, ts.Diagnostics.Initializers_are_not_allowed_in_ambient_contexts);
}
}
}
function checkGrammarVariableDeclaration(node) {
if (node.parent.parent.kind !== 241 /* ForInStatement */ && node.parent.parent.kind !== 242 /* ForOfStatement */) {
if (node.flags & 8388608 /* Ambient */) {
checkAmbientInitializer(node);
}
else if (!node.initializer) {
if (ts.isBindingPattern(node.name) && !ts.isBindingPattern(node.parent)) {
return grammarErrorOnNode(node, ts.Diagnostics.A_destructuring_declaration_must_have_an_initializer);
}
if (ts.isVarConst(node)) {
return grammarErrorOnNode(node, ts.Diagnostics.const_declarations_must_be_initialized);
}
}
}
if (node.exclamationToken && (node.parent.parent.kind !== 235 /* VariableStatement */ || !node.type || node.initializer || node.flags & 8388608 /* Ambient */)) {
var message = node.initializer
? ts.Diagnostics.Declarations_with_initializers_cannot_also_have_definite_assignment_assertions
: !node.type
? ts.Diagnostics.Declarations_with_definite_assignment_assertions_must_also_have_type_annotations
: ts.Diagnostics.A_definite_assignment_assertion_is_not_permitted_in_this_context;
return grammarErrorOnNode(node.exclamationToken, message);
}
var moduleKind = ts.getEmitModuleKind(compilerOptions);
if (moduleKind < ts.ModuleKind.ES2015 && moduleKind !== ts.ModuleKind.System &&
!(node.parent.parent.flags & 8388608 /* Ambient */) && ts.hasSyntacticModifier(node.parent.parent, 1 /* Export */)) {
checkESModuleMarker(node.name);
}
var checkLetConstNames = (ts.isLet(node) || ts.isVarConst(node));
// 1. LexicalDeclaration : LetOrConst BindingList ;
// It is a Syntax Error if the BoundNames of BindingList contains "let".
// 2. ForDeclaration: ForDeclaration : LetOrConst ForBinding
// It is a Syntax Error if the BoundNames of ForDeclaration contains "let".
// It is a SyntaxError if a VariableDeclaration or VariableDeclarationNoIn occurs within strict code
// and its Identifier is eval or arguments
return checkLetConstNames && checkGrammarNameInLetOrConstDeclarations(node.name);
}
function checkESModuleMarker(name) {
if (name.kind === 79 /* Identifier */) {
if (ts.idText(name) === "__esModule") {
return grammarErrorOnNodeSkippedOn("noEmit", name, ts.Diagnostics.Identifier_expected_esModule_is_reserved_as_an_exported_marker_when_transforming_ECMAScript_modules);
}
}
else {
var elements = name.elements;
for (var _i = 0, elements_1 = elements; _i < elements_1.length; _i++) {
var element = elements_1[_i];
if (!ts.isOmittedExpression(element)) {
return checkESModuleMarker(element.name);
}
}
}
return false;
}
function checkGrammarNameInLetOrConstDeclarations(name) {
if (name.kind === 79 /* Identifier */) {
if (name.originalKeywordKind === 119 /* LetKeyword */) {
return grammarErrorOnNode(name, ts.Diagnostics.let_is_not_allowed_to_be_used_as_a_name_in_let_or_const_declarations);
}
}
else {
var elements = name.elements;
for (var _i = 0, elements_2 = elements; _i < elements_2.length; _i++) {
var element = elements_2[_i];
if (!ts.isOmittedExpression(element)) {
checkGrammarNameInLetOrConstDeclarations(element.name);
}
}
}
return false;
}
function checkGrammarVariableDeclarationList(declarationList) {
var declarations = declarationList.declarations;
if (checkGrammarForDisallowedTrailingComma(declarationList.declarations)) {
return true;
}
if (!declarationList.declarations.length) {
return grammarErrorAtPos(declarationList, declarations.pos, declarations.end - declarations.pos, ts.Diagnostics.Variable_declaration_list_cannot_be_empty);
}
return false;
}
function allowLetAndConstDeclarations(parent) {
switch (parent.kind) {
case 237 /* IfStatement */:
case 238 /* DoStatement */:
case 239 /* WhileStatement */:
case 246 /* WithStatement */:
case 240 /* ForStatement */:
case 241 /* ForInStatement */:
case 242 /* ForOfStatement */:
return false;
case 248 /* LabeledStatement */:
return allowLetAndConstDeclarations(parent.parent);
}
return true;
}
function checkGrammarForDisallowedLetOrConstStatement(node) {
if (!allowLetAndConstDeclarations(node.parent)) {
if (ts.isLet(node.declarationList)) {
return grammarErrorOnNode(node, ts.Diagnostics.let_declarations_can_only_be_declared_inside_a_block);
}
else if (ts.isVarConst(node.declarationList)) {
return grammarErrorOnNode(node, ts.Diagnostics.const_declarations_can_only_be_declared_inside_a_block);
}
}
}
function checkGrammarMetaProperty(node) {
var escapedText = node.name.escapedText;
switch (node.keywordToken) {
case 103 /* NewKeyword */:
if (escapedText !== "target") {
return grammarErrorOnNode(node.name, ts.Diagnostics._0_is_not_a_valid_meta_property_for_keyword_1_Did_you_mean_2, node.name.escapedText, ts.tokenToString(node.keywordToken), "target");
}
break;
case 100 /* ImportKeyword */:
if (escapedText !== "meta") {
return grammarErrorOnNode(node.name, ts.Diagnostics._0_is_not_a_valid_meta_property_for_keyword_1_Did_you_mean_2, node.name.escapedText, ts.tokenToString(node.keywordToken), "meta");
}
break;
}
}
function hasParseDiagnostics(sourceFile) {
return sourceFile.parseDiagnostics.length > 0;
}
function grammarErrorOnFirstToken(node, message, arg0, arg1, arg2) {
var sourceFile = ts.getSourceFileOfNode(node);
if (!hasParseDiagnostics(sourceFile)) {
var span = ts.getSpanOfTokenAtPosition(sourceFile, node.pos);
diagnostics.add(ts.createFileDiagnostic(sourceFile, span.start, span.length, message, arg0, arg1, arg2));
return true;
}
return false;
}
function grammarErrorAtPos(nodeForSourceFile, start, length, message, arg0, arg1, arg2) {
var sourceFile = ts.getSourceFileOfNode(nodeForSourceFile);
if (!hasParseDiagnostics(sourceFile)) {
diagnostics.add(ts.createFileDiagnostic(sourceFile, start, length, message, arg0, arg1, arg2));
return true;
}
return false;
}
function grammarErrorOnNodeSkippedOn(key, node, message, arg0, arg1, arg2) {
var sourceFile = ts.getSourceFileOfNode(node);
if (!hasParseDiagnostics(sourceFile)) {
errorSkippedOn(key, node, message, arg0, arg1, arg2);
return true;
}
return false;
}
function grammarErrorOnNode(node, message, arg0, arg1, arg2) {
var sourceFile = ts.getSourceFileOfNode(node);
if (!hasParseDiagnostics(sourceFile)) {
diagnostics.add(ts.createDiagnosticForNode(node, message, arg0, arg1, arg2));
return true;
}
return false;
}
function checkGrammarConstructorTypeParameters(node) {
var jsdocTypeParameters = ts.isInJSFile(node) ? ts.getJSDocTypeParameterDeclarations(node) : undefined;
var range = node.typeParameters || jsdocTypeParameters && ts.firstOrUndefined(jsdocTypeParameters);
if (range) {
var pos = range.pos === range.end ? range.pos : ts.skipTrivia(ts.getSourceFileOfNode(node).text, range.pos);
return grammarErrorAtPos(node, pos, range.end - pos, ts.Diagnostics.Type_parameters_cannot_appear_on_a_constructor_declaration);
}
}
function checkGrammarConstructorTypeAnnotation(node) {
var type = ts.getEffectiveReturnTypeNode(node);
if (type) {
return grammarErrorOnNode(type, ts.Diagnostics.Type_annotation_cannot_appear_on_a_constructor_declaration);
}
}
function checkGrammarProperty(node) {
if (ts.isClassLike(node.parent)) {
if (ts.isStringLiteral(node.name) && node.name.text === "constructor") {
return grammarErrorOnNode(node.name, ts.Diagnostics.Classes_may_not_have_a_field_named_constructor);
}
if (checkGrammarForInvalidDynamicName(node.name, ts.Diagnostics.A_computed_property_name_in_a_class_property_declaration_must_have_a_simple_literal_type_or_a_unique_symbol_type)) {
return true;
}
if (languageVersion < 2 /* ES2015 */ && ts.isPrivateIdentifier(node.name)) {
return grammarErrorOnNode(node.name, ts.Diagnostics.Private_identifiers_are_only_available_when_targeting_ECMAScript_2015_and_higher);
}
}
else if (node.parent.kind === 256 /* InterfaceDeclaration */) {
if (checkGrammarForInvalidDynamicName(node.name, ts.Diagnostics.A_computed_property_name_in_an_interface_must_refer_to_an_expression_whose_type_is_a_literal_type_or_a_unique_symbol_type)) {
return true;
}
if (node.initializer) {
return grammarErrorOnNode(node.initializer, ts.Diagnostics.An_interface_property_cannot_have_an_initializer);
}
}
else if (node.parent.kind === 180 /* TypeLiteral */) {
if (checkGrammarForInvalidDynamicName(node.name, ts.Diagnostics.A_computed_property_name_in_a_type_literal_must_refer_to_an_expression_whose_type_is_a_literal_type_or_a_unique_symbol_type)) {
return true;
}
if (node.initializer) {
return grammarErrorOnNode(node.initializer, ts.Diagnostics.A_type_literal_property_cannot_have_an_initializer);
}
}
if (node.flags & 8388608 /* Ambient */) {
checkAmbientInitializer(node);
}
if (ts.isPropertyDeclaration(node) && node.exclamationToken && (!ts.isClassLike(node.parent) || !node.type || node.initializer ||
node.flags & 8388608 /* Ambient */ || ts.isStatic(node) || ts.hasAbstractModifier(node))) {
var message = node.initializer
? ts.Diagnostics.Declarations_with_initializers_cannot_also_have_definite_assignment_assertions
: !node.type
? ts.Diagnostics.Declarations_with_definite_assignment_assertions_must_also_have_type_annotations
: ts.Diagnostics.A_definite_assignment_assertion_is_not_permitted_in_this_context;
return grammarErrorOnNode(node.exclamationToken, message);
}
}
function checkGrammarTopLevelElementForRequiredDeclareModifier(node) {
// A declare modifier is required for any top level .d.ts declaration except export=, export default, export as namespace
// interfaces and imports categories:
//
// DeclarationElement:
// ExportAssignment
// export_opt InterfaceDeclaration
// export_opt TypeAliasDeclaration
// export_opt ImportDeclaration
// export_opt ExternalImportDeclaration
// export_opt AmbientDeclaration
//
// TODO: The spec needs to be amended to reflect this grammar.
if (node.kind === 256 /* InterfaceDeclaration */ ||
node.kind === 257 /* TypeAliasDeclaration */ ||
node.kind === 264 /* ImportDeclaration */ ||
node.kind === 263 /* ImportEqualsDeclaration */ ||
node.kind === 270 /* ExportDeclaration */ ||
node.kind === 269 /* ExportAssignment */ ||
node.kind === 262 /* NamespaceExportDeclaration */ ||
ts.hasSyntacticModifier(node, 2 /* Ambient */ | 1 /* Export */ | 512 /* Default */)) {
return false;
}
return grammarErrorOnFirstToken(node, ts.Diagnostics.Top_level_declarations_in_d_ts_files_must_start_with_either_a_declare_or_export_modifier);
}
function checkGrammarTopLevelElementsForRequiredDeclareModifier(file) {
for (var _i = 0, _a = file.statements; _i < _a.length; _i++) {
var decl = _a[_i];
if (ts.isDeclaration(decl) || decl.kind === 235 /* VariableStatement */) {
if (checkGrammarTopLevelElementForRequiredDeclareModifier(decl)) {
return true;
}
}
}
return false;
}
function checkGrammarSourceFile(node) {
return !!(node.flags & 8388608 /* Ambient */) && checkGrammarTopLevelElementsForRequiredDeclareModifier(node);
}
function checkGrammarStatementInAmbientContext(node) {
if (node.flags & 8388608 /* Ambient */) {
// Find containing block which is either Block, ModuleBlock, SourceFile
var links = getNodeLinks(node);
if (!links.hasReportedStatementInAmbientContext && (ts.isFunctionLike(node.parent) || ts.isAccessor(node.parent))) {
return getNodeLinks(node).hasReportedStatementInAmbientContext = grammarErrorOnFirstToken(node, ts.Diagnostics.An_implementation_cannot_be_declared_in_ambient_contexts);
}
// We are either parented by another statement, or some sort of block.
// If we're in a block, we only want to really report an error once
// to prevent noisiness. So use a bit on the block to indicate if
// this has already been reported, and don't report if it has.
//
if (node.parent.kind === 233 /* Block */ || node.parent.kind === 260 /* ModuleBlock */ || node.parent.kind === 300 /* SourceFile */) {
var links_2 = getNodeLinks(node.parent);
// Check if the containing block ever report this error
if (!links_2.hasReportedStatementInAmbientContext) {
return links_2.hasReportedStatementInAmbientContext = grammarErrorOnFirstToken(node, ts.Diagnostics.Statements_are_not_allowed_in_ambient_contexts);
}
}
else {
// We must be parented by a statement. If so, there's no need
// to report the error as our parent will have already done it.
// Debug.assert(isStatement(node.parent));
}
}
return false;
}
function checkGrammarNumericLiteral(node) {
// Grammar checking
if (node.numericLiteralFlags & 32 /* Octal */) {
var diagnosticMessage = void 0;
if (languageVersion >= 1 /* ES5 */) {
diagnosticMessage = ts.Diagnostics.Octal_literals_are_not_available_when_targeting_ECMAScript_5_and_higher_Use_the_syntax_0;
}
else if (ts.isChildOfNodeWithKind(node, 194 /* LiteralType */)) {
diagnosticMessage = ts.Diagnostics.Octal_literal_types_must_use_ES2015_syntax_Use_the_syntax_0;
}
else if (ts.isChildOfNodeWithKind(node, 294 /* EnumMember */)) {
diagnosticMessage = ts.Diagnostics.Octal_literals_are_not_allowed_in_enums_members_initializer_Use_the_syntax_0;
}
if (diagnosticMessage) {
var withMinus = ts.isPrefixUnaryExpression(node.parent) && node.parent.operator === 40 /* MinusToken */;
var literal = (withMinus ? "-" : "") + "0o" + node.text;
return grammarErrorOnNode(withMinus ? node.parent : node, diagnosticMessage, literal);
}
}
// Realism (size) checking
checkNumericLiteralValueSize(node);
return false;
}
function checkNumericLiteralValueSize(node) {
// Scientific notation (e.g. 2e54 and 1e00000000010) can't be converted to bigint
// Literals with 15 or fewer characters aren't long enough to reach past 2^53 - 1
// Fractional numbers (e.g. 9000000000000000.001) are inherently imprecise anyway
if (node.numericLiteralFlags & 16 /* Scientific */ || node.text.length <= 15 || node.text.indexOf(".") !== -1) {
return;
}
// We can't rely on the runtime to accurately store and compare extremely large numeric values
// Even for internal use, we use getTextOfNode: https://github.com/microsoft/TypeScript/issues/33298
// Thus, if the runtime claims a too-large number is lower than Number.MAX_SAFE_INTEGER,
// it's likely addition operations on it will fail too
var apparentValue = +ts.getTextOfNode(node);
if (apparentValue <= Math.pow(2, 53) - 1 && apparentValue + 1 > apparentValue) {
return;
}
addErrorOrSuggestion(/*isError*/ false, ts.createDiagnosticForNode(node, ts.Diagnostics.Numeric_literals_with_absolute_values_equal_to_2_53_or_greater_are_too_large_to_be_represented_accurately_as_integers));
}
function checkGrammarBigIntLiteral(node) {
var literalType = ts.isLiteralTypeNode(node.parent) ||
ts.isPrefixUnaryExpression(node.parent) && ts.isLiteralTypeNode(node.parent.parent);
if (!literalType) {
if (languageVersion < 7 /* ES2020 */) {
if (grammarErrorOnNode(node, ts.Diagnostics.BigInt_literals_are_not_available_when_targeting_lower_than_ES2020)) {
return true;
}
}
}
return false;
}
function grammarErrorAfterFirstToken(node, message, arg0, arg1, arg2) {
var sourceFile = ts.getSourceFileOfNode(node);
if (!hasParseDiagnostics(sourceFile)) {
var span = ts.getSpanOfTokenAtPosition(sourceFile, node.pos);
diagnostics.add(ts.createFileDiagnostic(sourceFile, ts.textSpanEnd(span), /*length*/ 0, message, arg0, arg1, arg2));
return true;
}
return false;
}
function getAmbientModules() {
if (!ambientModulesCache) {
ambientModulesCache = [];
globals.forEach(function (global, sym) {
// No need to `unescapeLeadingUnderscores`, an escaped symbol is never an ambient module.
if (ambientModuleSymbolRegex.test(sym)) {
ambientModulesCache.push(global);
}
});
}
return ambientModulesCache;
}
function checkGrammarImportClause(node) {
if (node.isTypeOnly && node.name && node.namedBindings) {
return grammarErrorOnNode(node, ts.Diagnostics.A_type_only_import_can_specify_a_default_import_or_named_bindings_but_not_both);
}
return false;
}
function checkGrammarImportCallExpression(node) {
if (moduleKind === ts.ModuleKind.ES2015) {
return grammarErrorOnNode(node, ts.Diagnostics.Dynamic_imports_are_only_supported_when_the_module_flag_is_set_to_es2020_esnext_commonjs_amd_system_or_umd);
}
if (node.typeArguments) {
return grammarErrorOnNode(node, ts.Diagnostics.Dynamic_import_cannot_have_type_arguments);
}
var nodeArguments = node.arguments;
if (nodeArguments.length !== 1) {
return grammarErrorOnNode(node, ts.Diagnostics.Dynamic_import_must_have_one_specifier_as_an_argument);
}
checkGrammarForDisallowedTrailingComma(nodeArguments);
// see: parseArgumentOrArrayLiteralElement...we use this function which parse arguments of callExpression to parse specifier for dynamic import.
// parseArgumentOrArrayLiteralElement allows spread element to be in an argument list which is not allowed as specifier in dynamic import.
if (ts.isSpreadElement(nodeArguments[0])) {
return grammarErrorOnNode(nodeArguments[0], ts.Diagnostics.Specifier_of_dynamic_import_cannot_be_spread_element);
}
return false;
}
function findMatchingTypeReferenceOrTypeAliasReference(source, unionTarget) {
var sourceObjectFlags = ts.getObjectFlags(source);
if (sourceObjectFlags & (4 /* Reference */ | 16 /* Anonymous */) && unionTarget.flags & 1048576 /* Union */) {
return ts.find(unionTarget.types, function (target) {
if (target.flags & 524288 /* Object */) {
var overlapObjFlags = sourceObjectFlags & ts.getObjectFlags(target);
if (overlapObjFlags & 4 /* Reference */) {
return source.target === target.target;
}
if (overlapObjFlags & 16 /* Anonymous */) {
return !!source.aliasSymbol && source.aliasSymbol === target.aliasSymbol;
}
}
return false;
});
}
}
function findBestTypeForObjectLiteral(source, unionTarget) {
if (ts.getObjectFlags(source) & 128 /* ObjectLiteral */ && someType(unionTarget, isArrayLikeType)) {
return ts.find(unionTarget.types, function (t) { return !isArrayLikeType(t); });
}
}
function findBestTypeForInvokable(source, unionTarget) {
var signatureKind = 0 /* Call */;
var hasSignatures = getSignaturesOfType(source, signatureKind).length > 0 ||
(signatureKind = 1 /* Construct */, getSignaturesOfType(source, signatureKind).length > 0);
if (hasSignatures) {
return ts.find(unionTarget.types, function (t) { return getSignaturesOfType(t, signatureKind).length > 0; });
}
}
function findMostOverlappyType(source, unionTarget) {
var bestMatch;
var matchingCount = 0;
for (var _i = 0, _a = unionTarget.types; _i < _a.length; _i++) {
var target = _a[_i];
var overlap = getIntersectionType([getIndexType(source), getIndexType(target)]);
if (overlap.flags & 4194304 /* Index */) {
// perfect overlap of keys
bestMatch = target;
matchingCount = Infinity;
}
else if (overlap.flags & 1048576 /* Union */) {
// We only want to account for literal types otherwise.
// If we have a union of index types, it seems likely that we
// needed to elaborate between two generic mapped types anyway.
var len = ts.length(ts.filter(overlap.types, isUnitType));
if (len >= matchingCount) {
bestMatch = target;
matchingCount = len;
}
}
else if (isUnitType(overlap) && 1 >= matchingCount) {
bestMatch = target;
matchingCount = 1;
}
}
return bestMatch;
}
function filterPrimitivesIfContainsNonPrimitive(type) {
if (maybeTypeOfKind(type, 67108864 /* NonPrimitive */)) {
var result = filterType(type, function (t) { return !(t.flags & 131068 /* Primitive */); });
if (!(result.flags & 131072 /* Never */)) {
return result;
}
}
return type;
}
// Keep this up-to-date with the same logic within `getApparentTypeOfContextualType`, since they should behave similarly
function findMatchingDiscriminantType(source, target, isRelatedTo, skipPartial) {
if (target.flags & 1048576 /* Union */ && source.flags & (2097152 /* Intersection */ | 524288 /* Object */)) {
var match = getMatchingUnionConstituentForType(target, source);
if (match) {
return match;
}
var sourceProperties = getPropertiesOfType(source);
if (sourceProperties) {
var sourcePropertiesFiltered = findDiscriminantProperties(sourceProperties, target);
if (sourcePropertiesFiltered) {
return discriminateTypeByDiscriminableItems(target, ts.map(sourcePropertiesFiltered, function (p) { return [function () { return getTypeOfSymbol(p); }, p.escapedName]; }), isRelatedTo, /*defaultValue*/ undefined, skipPartial);
}
}
}
return undefined;
}
}
ts.createTypeChecker = createTypeChecker;
function isNotAccessor(declaration) {
// Accessors check for their own matching duplicates, and in contexts where they are valid, there are already duplicate identifier checks
return !ts.isAccessor(declaration);
}
function isNotOverload(declaration) {
return (declaration.kind !== 254 /* FunctionDeclaration */ && declaration.kind !== 167 /* MethodDeclaration */) ||
!!declaration.body;
}
/** Like 'isDeclarationName', but returns true for LHS of `import { x as y }` or `export { x as y }`. */
function isDeclarationNameOrImportPropertyName(name) {
switch (name.parent.kind) {
case 268 /* ImportSpecifier */:
case 273 /* ExportSpecifier */:
return ts.isIdentifier(name);
default:
return ts.isDeclarationName(name);
}
}
var JsxNames;
(function (JsxNames) {
JsxNames.JSX = "JSX";
JsxNames.IntrinsicElements = "IntrinsicElements";
JsxNames.ElementClass = "ElementClass";
JsxNames.ElementAttributesPropertyNameContainer = "ElementAttributesProperty"; // TODO: Deprecate and remove support
JsxNames.ElementChildrenAttributeNameContainer = "ElementChildrenAttribute";
JsxNames.Element = "Element";
JsxNames.IntrinsicAttributes = "IntrinsicAttributes";
JsxNames.IntrinsicClassAttributes = "IntrinsicClassAttributes";
JsxNames.LibraryManagedAttributes = "LibraryManagedAttributes";
})(JsxNames || (JsxNames = {}));
function getIterationTypesKeyFromIterationTypeKind(typeKind) {
switch (typeKind) {
case 0 /* Yield */: return "yieldType";
case 1 /* Return */: return "returnType";
case 2 /* Next */: return "nextType";
}
}
function signatureHasRestParameter(s) {
return !!(s.flags & 1 /* HasRestParameter */);
}
ts.signatureHasRestParameter = signatureHasRestParameter;
function signatureHasLiteralTypes(s) {
return !!(s.flags & 2 /* HasLiteralTypes */);
}
ts.signatureHasLiteralTypes = signatureHasLiteralTypes;
})(ts || (ts = {}));
var ts;
(function (ts) {
function visitNode(node, visitor, test, lift) {
if (node === undefined || visitor === undefined) {
return node;
}
var visited = visitor(node);
if (visited === node) {
return node;
}
var visitedNode;
if (visited === undefined) {
return undefined;
}
else if (ts.isArray(visited)) {
visitedNode = (lift || extractSingleNode)(visited);
}
else {
visitedNode = visited;
}
ts.Debug.assertNode(visitedNode, test);
return visitedNode;
}
ts.visitNode = visitNode;
/**
* Visits a NodeArray using the supplied visitor, possibly returning a new NodeArray in its place.
*
* @param nodes The NodeArray to visit.
* @param visitor The callback used to visit a Node.
* @param test A node test to execute for each node.
* @param start An optional value indicating the starting offset at which to start visiting.
* @param count An optional value indicating the maximum number of nodes to visit.
*/
function visitNodes(nodes, visitor, test, start, count) {
if (nodes === undefined || visitor === undefined) {
return nodes;
}
var updated;
// Ensure start and count have valid values
var length = nodes.length;
if (start === undefined || start < 0) {
start = 0;
}
if (count === undefined || count > length - start) {
count = length - start;
}
var hasTrailingComma;
var pos = -1;
var end = -1;
if (start > 0 || count < length) {
// If we are not visiting all of the original nodes, we must always create a new array.
// Since this is a fragment of a node array, we do not copy over the previous location
// and will only copy over `hasTrailingComma` if we are including the last element.
updated = [];
hasTrailingComma = nodes.hasTrailingComma && start + count === length;
}
// Visit each original node.
for (var i = 0; i < count; i++) {
var node = nodes[i + start];
var visited = node !== undefined ? visitor(node) : undefined;
if (updated !== undefined || visited === undefined || visited !== node) {
if (updated === undefined) {
// Ensure we have a copy of `nodes`, up to the current index.
updated = nodes.slice(0, i);
hasTrailingComma = nodes.hasTrailingComma;
pos = nodes.pos;
end = nodes.end;
}
if (visited) {
if (ts.isArray(visited)) {
for (var _i = 0, visited_1 = visited; _i < visited_1.length; _i++) {
var visitedNode = visited_1[_i];
void ts.Debug.assertNode(visitedNode, test);
updated.push(visitedNode);
}
}
else {
void ts.Debug.assertNode(visited, test);
updated.push(visited);
}
}
}
}
if (updated) {
// TODO(rbuckton): Remove dependency on `ts.factory` in favor of a provided factory.
var updatedArray = ts.factory.createNodeArray(updated, hasTrailingComma);
ts.setTextRangePosEnd(updatedArray, pos, end);
return updatedArray;
}
return nodes;
}
ts.visitNodes = visitNodes;
/**
* Starts a new lexical environment and visits a statement list, ending the lexical environment
* and merging hoisted declarations upon completion.
*/
function visitLexicalEnvironment(statements, visitor, context, start, ensureUseStrict, nodesVisitor) {
if (nodesVisitor === void 0) { nodesVisitor = visitNodes; }
context.startLexicalEnvironment();
statements = nodesVisitor(statements, visitor, ts.isStatement, start);
if (ensureUseStrict)
statements = context.factory.ensureUseStrict(statements);
return ts.factory.mergeLexicalEnvironment(statements, context.endLexicalEnvironment());
}
ts.visitLexicalEnvironment = visitLexicalEnvironment;
function visitParameterList(nodes, visitor, context, nodesVisitor) {
if (nodesVisitor === void 0) { nodesVisitor = visitNodes; }
var updated;
context.startLexicalEnvironment();
if (nodes) {
context.setLexicalEnvironmentFlags(1 /* InParameters */, true);
updated = nodesVisitor(nodes, visitor, ts.isParameterDeclaration);
// As of ES2015, any runtime execution of that occurs in for a parameter (such as evaluating an
// initializer or a binding pattern), occurs in its own lexical scope. As a result, any expression
// that we might transform that introduces a temporary variable would fail as the temporary variable
// exists in a different lexical scope. To address this, we move any binding patterns and initializers
// in a parameter list to the body if we detect a variable being hoisted while visiting a parameter list
// when the emit target is greater than ES2015.
if (context.getLexicalEnvironmentFlags() & 2 /* VariablesHoistedInParameters */ &&
ts.getEmitScriptTarget(context.getCompilerOptions()) >= 2 /* ES2015 */) {
updated = addDefaultValueAssignmentsIfNeeded(updated, context);
}
context.setLexicalEnvironmentFlags(1 /* InParameters */, false);
}
context.suspendLexicalEnvironment();
return updated;
}
ts.visitParameterList = visitParameterList;
function addDefaultValueAssignmentsIfNeeded(parameters, context) {
var result;
for (var i = 0; i < parameters.length; i++) {
var parameter = parameters[i];
var updated = addDefaultValueAssignmentIfNeeded(parameter, context);
if (result || updated !== parameter) {
if (!result)
result = parameters.slice(0, i);
result[i] = updated;
}
}
if (result) {
return ts.setTextRange(context.factory.createNodeArray(result, parameters.hasTrailingComma), parameters);
}
return parameters;
}
function addDefaultValueAssignmentIfNeeded(parameter, context) {
// A rest parameter cannot have a binding pattern or an initializer,
// so let's just ignore it.
return parameter.dotDotDotToken ? parameter :
ts.isBindingPattern(parameter.name) ? addDefaultValueAssignmentForBindingPattern(parameter, context) :
parameter.initializer ? addDefaultValueAssignmentForInitializer(parameter, parameter.name, parameter.initializer, context) :
parameter;
}
function addDefaultValueAssignmentForBindingPattern(parameter, context) {
var factory = context.factory;
context.addInitializationStatement(factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList([
factory.createVariableDeclaration(parameter.name,
/*exclamationToken*/ undefined, parameter.type, parameter.initializer ?
factory.createConditionalExpression(factory.createStrictEquality(factory.getGeneratedNameForNode(parameter), factory.createVoidZero()),
/*questionToken*/ undefined, parameter.initializer,
/*colonToken*/ undefined, factory.getGeneratedNameForNode(parameter)) :
factory.getGeneratedNameForNode(parameter)),
])));
return factory.updateParameterDeclaration(parameter, parameter.decorators, parameter.modifiers, parameter.dotDotDotToken, factory.getGeneratedNameForNode(parameter), parameter.questionToken, parameter.type,
/*initializer*/ undefined);
}
function addDefaultValueAssignmentForInitializer(parameter, name, initializer, context) {
var factory = context.factory;
context.addInitializationStatement(factory.createIfStatement(factory.createTypeCheck(factory.cloneNode(name), "undefined"), ts.setEmitFlags(ts.setTextRange(factory.createBlock([
factory.createExpressionStatement(ts.setEmitFlags(ts.setTextRange(factory.createAssignment(ts.setEmitFlags(factory.cloneNode(name), 48 /* NoSourceMap */), ts.setEmitFlags(initializer, 48 /* NoSourceMap */ | ts.getEmitFlags(initializer) | 1536 /* NoComments */)), parameter), 1536 /* NoComments */))
]), parameter), 1 /* SingleLine */ | 32 /* NoTrailingSourceMap */ | 384 /* NoTokenSourceMaps */ | 1536 /* NoComments */)));
return factory.updateParameterDeclaration(parameter, parameter.decorators, parameter.modifiers, parameter.dotDotDotToken, parameter.name, parameter.questionToken, parameter.type,
/*initializer*/ undefined);
}
function visitFunctionBody(node, visitor, context, nodeVisitor) {
if (nodeVisitor === void 0) { nodeVisitor = visitNode; }
context.resumeLexicalEnvironment();
var updated = nodeVisitor(node, visitor, ts.isConciseBody);
var declarations = context.endLexicalEnvironment();
if (ts.some(declarations)) {
if (!updated) {
return context.factory.createBlock(declarations);
}
var block = context.factory.converters.convertToFunctionBlock(updated);
var statements = ts.factory.mergeLexicalEnvironment(block.statements, declarations);
return context.factory.updateBlock(block, statements);
}
return updated;
}
ts.visitFunctionBody = visitFunctionBody;
/**
* Visits an iteration body, adding any block-scoped variables required by the transformation.
*/
function visitIterationBody(body, visitor, context) {
context.startBlockScope();
var updated = visitNode(body, visitor, ts.isStatement, context.factory.liftToBlock);
var declarations = context.endBlockScope();
if (ts.some(declarations)) {
if (ts.isBlock(updated)) {
declarations.push.apply(declarations, updated.statements);
return context.factory.updateBlock(updated, declarations);
}
declarations.push(updated);
return context.factory.createBlock(declarations);
}
return updated;
}
ts.visitIterationBody = visitIterationBody;
function visitEachChild(node, visitor, context, nodesVisitor, tokenVisitor, nodeVisitor) {
if (nodesVisitor === void 0) { nodesVisitor = visitNodes; }
if (nodeVisitor === void 0) { nodeVisitor = visitNode; }
if (node === undefined) {
return undefined;
}
var kind = node.kind;
// No need to visit nodes with no children.
if ((kind > 0 /* FirstToken */ && kind <= 158 /* LastToken */) || kind === 190 /* ThisType */) {
return node;
}
var factory = context.factory;
switch (kind) {
// Names
case 79 /* Identifier */:
ts.Debug.type(node);
return factory.updateIdentifier(node, nodesVisitor(node.typeArguments, visitor, ts.isTypeNodeOrTypeParameterDeclaration));
case 159 /* QualifiedName */:
ts.Debug.type(node);
return factory.updateQualifiedName(node, nodeVisitor(node.left, visitor, ts.isEntityName), nodeVisitor(node.right, visitor, ts.isIdentifier));
case 160 /* ComputedPropertyName */:
ts.Debug.type(node);
return factory.updateComputedPropertyName(node, nodeVisitor(node.expression, visitor, ts.isExpression));
// Signature elements
case 161 /* TypeParameter */:
ts.Debug.type(node);
return factory.updateTypeParameterDeclaration(node, nodeVisitor(node.name, visitor, ts.isIdentifier), nodeVisitor(node.constraint, visitor, ts.isTypeNode), nodeVisitor(node.default, visitor, ts.isTypeNode));
case 162 /* Parameter */:
ts.Debug.type(node);
return factory.updateParameterDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.dotDotDotToken, tokenVisitor, ts.isDotDotDotToken), nodeVisitor(node.name, visitor, ts.isBindingName), nodeVisitor(node.questionToken, tokenVisitor, ts.isQuestionToken), nodeVisitor(node.type, visitor, ts.isTypeNode), nodeVisitor(node.initializer, visitor, ts.isExpression));
case 163 /* Decorator */:
ts.Debug.type(node);
return factory.updateDecorator(node, nodeVisitor(node.expression, visitor, ts.isExpression));
// Type elements
case 164 /* PropertySignature */:
ts.Debug.type(node);
return factory.updatePropertySignature(node, nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.name, visitor, ts.isPropertyName), nodeVisitor(node.questionToken, tokenVisitor, ts.isToken), nodeVisitor(node.type, visitor, ts.isTypeNode));
case 165 /* PropertyDeclaration */:
ts.Debug.type(node);
return factory.updatePropertyDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.name, visitor, ts.isPropertyName),
// QuestionToken and ExclamationToken is uniqued in Property Declaration and the signature of 'updateProperty' is that too
nodeVisitor(node.questionToken || node.exclamationToken, tokenVisitor, ts.isQuestionOrExclamationToken), nodeVisitor(node.type, visitor, ts.isTypeNode), nodeVisitor(node.initializer, visitor, ts.isExpression));
case 166 /* MethodSignature */:
ts.Debug.type(node);
return factory.updateMethodSignature(node, nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.name, visitor, ts.isPropertyName), nodeVisitor(node.questionToken, tokenVisitor, ts.isQuestionToken), nodesVisitor(node.typeParameters, visitor, ts.isTypeParameterDeclaration), nodesVisitor(node.parameters, visitor, ts.isParameterDeclaration), nodeVisitor(node.type, visitor, ts.isTypeNode));
case 167 /* MethodDeclaration */:
ts.Debug.type(node);
return factory.updateMethodDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.asteriskToken, tokenVisitor, ts.isAsteriskToken), nodeVisitor(node.name, visitor, ts.isPropertyName), nodeVisitor(node.questionToken, tokenVisitor, ts.isQuestionToken), nodesVisitor(node.typeParameters, visitor, ts.isTypeParameterDeclaration), visitParameterList(node.parameters, visitor, context, nodesVisitor), nodeVisitor(node.type, visitor, ts.isTypeNode), visitFunctionBody(node.body, visitor, context, nodeVisitor));
case 169 /* Constructor */:
ts.Debug.type(node);
return factory.updateConstructorDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), visitParameterList(node.parameters, visitor, context, nodesVisitor), visitFunctionBody(node.body, visitor, context, nodeVisitor));
case 170 /* GetAccessor */:
ts.Debug.type(node);
return factory.updateGetAccessorDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.name, visitor, ts.isPropertyName), visitParameterList(node.parameters, visitor, context, nodesVisitor), nodeVisitor(node.type, visitor, ts.isTypeNode), visitFunctionBody(node.body, visitor, context, nodeVisitor));
case 171 /* SetAccessor */:
ts.Debug.type(node);
return factory.updateSetAccessorDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.name, visitor, ts.isPropertyName), visitParameterList(node.parameters, visitor, context, nodesVisitor), visitFunctionBody(node.body, visitor, context, nodeVisitor));
case 168 /* ClassStaticBlockDeclaration */:
ts.Debug.type(node);
context.startLexicalEnvironment();
context.suspendLexicalEnvironment();
return factory.updateClassStaticBlockDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), visitFunctionBody(node.body, visitor, context, nodeVisitor));
case 172 /* CallSignature */:
ts.Debug.type(node);
return factory.updateCallSignature(node, nodesVisitor(node.typeParameters, visitor, ts.isTypeParameterDeclaration), nodesVisitor(node.parameters, visitor, ts.isParameterDeclaration), nodeVisitor(node.type, visitor, ts.isTypeNode));
case 173 /* ConstructSignature */:
ts.Debug.type(node);
return factory.updateConstructSignature(node, nodesVisitor(node.typeParameters, visitor, ts.isTypeParameterDeclaration), nodesVisitor(node.parameters, visitor, ts.isParameterDeclaration), nodeVisitor(node.type, visitor, ts.isTypeNode));
case 174 /* IndexSignature */:
ts.Debug.type(node);
return factory.updateIndexSignature(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodesVisitor(node.parameters, visitor, ts.isParameterDeclaration), nodeVisitor(node.type, visitor, ts.isTypeNode));
// Types
case 175 /* TypePredicate */:
ts.Debug.type(node);
return factory.updateTypePredicateNode(node, nodeVisitor(node.assertsModifier, visitor, ts.isAssertsKeyword), nodeVisitor(node.parameterName, visitor, ts.isIdentifierOrThisTypeNode), nodeVisitor(node.type, visitor, ts.isTypeNode));
case 176 /* TypeReference */:
ts.Debug.type(node);
return factory.updateTypeReferenceNode(node, nodeVisitor(node.typeName, visitor, ts.isEntityName), nodesVisitor(node.typeArguments, visitor, ts.isTypeNode));
case 177 /* FunctionType */:
ts.Debug.type(node);
return factory.updateFunctionTypeNode(node, nodesVisitor(node.typeParameters, visitor, ts.isTypeParameterDeclaration), nodesVisitor(node.parameters, visitor, ts.isParameterDeclaration), nodeVisitor(node.type, visitor, ts.isTypeNode));
case 178 /* ConstructorType */:
ts.Debug.type(node);
return factory.updateConstructorTypeNode(node, nodesVisitor(node.modifiers, visitor, ts.isModifier), nodesVisitor(node.typeParameters, visitor, ts.isTypeParameterDeclaration), nodesVisitor(node.parameters, visitor, ts.isParameterDeclaration), nodeVisitor(node.type, visitor, ts.isTypeNode));
case 179 /* TypeQuery */:
ts.Debug.type(node);
return factory.updateTypeQueryNode(node, nodeVisitor(node.exprName, visitor, ts.isEntityName));
case 180 /* TypeLiteral */:
ts.Debug.type(node);
return factory.updateTypeLiteralNode(node, nodesVisitor(node.members, visitor, ts.isTypeElement));
case 181 /* ArrayType */:
ts.Debug.type(node);
return factory.updateArrayTypeNode(node, nodeVisitor(node.elementType, visitor, ts.isTypeNode));
case 182 /* TupleType */:
ts.Debug.type(node);
return factory.updateTupleTypeNode(node, nodesVisitor(node.elements, visitor, ts.isTypeNode));
case 183 /* OptionalType */:
ts.Debug.type(node);
return factory.updateOptionalTypeNode(node, nodeVisitor(node.type, visitor, ts.isTypeNode));
case 184 /* RestType */:
ts.Debug.type(node);
return factory.updateRestTypeNode(node, nodeVisitor(node.type, visitor, ts.isTypeNode));
case 185 /* UnionType */:
ts.Debug.type(node);
return factory.updateUnionTypeNode(node, nodesVisitor(node.types, visitor, ts.isTypeNode));
case 186 /* IntersectionType */:
ts.Debug.type(node);
return factory.updateIntersectionTypeNode(node, nodesVisitor(node.types, visitor, ts.isTypeNode));
case 187 /* ConditionalType */:
ts.Debug.type(node);
return factory.updateConditionalTypeNode(node, nodeVisitor(node.checkType, visitor, ts.isTypeNode), nodeVisitor(node.extendsType, visitor, ts.isTypeNode), nodeVisitor(node.trueType, visitor, ts.isTypeNode), nodeVisitor(node.falseType, visitor, ts.isTypeNode));
case 188 /* InferType */:
ts.Debug.type(node);
return factory.updateInferTypeNode(node, nodeVisitor(node.typeParameter, visitor, ts.isTypeParameterDeclaration));
case 198 /* ImportType */:
ts.Debug.type(node);
return factory.updateImportTypeNode(node, nodeVisitor(node.argument, visitor, ts.isTypeNode), nodeVisitor(node.qualifier, visitor, ts.isEntityName), visitNodes(node.typeArguments, visitor, ts.isTypeNode), node.isTypeOf);
case 195 /* NamedTupleMember */:
ts.Debug.type(node);
return factory.updateNamedTupleMember(node, visitNode(node.dotDotDotToken, visitor, ts.isDotDotDotToken), visitNode(node.name, visitor, ts.isIdentifier), visitNode(node.questionToken, visitor, ts.isQuestionToken), visitNode(node.type, visitor, ts.isTypeNode));
case 189 /* ParenthesizedType */:
ts.Debug.type(node);
return factory.updateParenthesizedType(node, nodeVisitor(node.type, visitor, ts.isTypeNode));
case 191 /* TypeOperator */:
ts.Debug.type(node);
return factory.updateTypeOperatorNode(node, nodeVisitor(node.type, visitor, ts.isTypeNode));
case 192 /* IndexedAccessType */:
ts.Debug.type(node);
return factory.updateIndexedAccessTypeNode(node, nodeVisitor(node.objectType, visitor, ts.isTypeNode), nodeVisitor(node.indexType, visitor, ts.isTypeNode));
case 193 /* MappedType */:
ts.Debug.type(node);
return factory.updateMappedTypeNode(node, nodeVisitor(node.readonlyToken, tokenVisitor, ts.isReadonlyKeywordOrPlusOrMinusToken), nodeVisitor(node.typeParameter, visitor, ts.isTypeParameterDeclaration), nodeVisitor(node.nameType, visitor, ts.isTypeNode), nodeVisitor(node.questionToken, tokenVisitor, ts.isQuestionOrPlusOrMinusToken), nodeVisitor(node.type, visitor, ts.isTypeNode));
case 194 /* LiteralType */:
ts.Debug.type(node);
return factory.updateLiteralTypeNode(node, nodeVisitor(node.literal, visitor, ts.isExpression));
case 196 /* TemplateLiteralType */:
ts.Debug.type(node);
return factory.updateTemplateLiteralType(node, nodeVisitor(node.head, visitor, ts.isTemplateHead), nodesVisitor(node.templateSpans, visitor, ts.isTemplateLiteralTypeSpan));
case 197 /* TemplateLiteralTypeSpan */:
ts.Debug.type(node);
return factory.updateTemplateLiteralTypeSpan(node, nodeVisitor(node.type, visitor, ts.isTypeNode), nodeVisitor(node.literal, visitor, ts.isTemplateMiddleOrTemplateTail));
// Binding patterns
case 199 /* ObjectBindingPattern */:
ts.Debug.type(node);
return factory.updateObjectBindingPattern(node, nodesVisitor(node.elements, visitor, ts.isBindingElement));
case 200 /* ArrayBindingPattern */:
ts.Debug.type(node);
return factory.updateArrayBindingPattern(node, nodesVisitor(node.elements, visitor, ts.isArrayBindingElement));
case 201 /* BindingElement */:
ts.Debug.type(node);
return factory.updateBindingElement(node, nodeVisitor(node.dotDotDotToken, tokenVisitor, ts.isDotDotDotToken), nodeVisitor(node.propertyName, visitor, ts.isPropertyName), nodeVisitor(node.name, visitor, ts.isBindingName), nodeVisitor(node.initializer, visitor, ts.isExpression));
// Expression
case 202 /* ArrayLiteralExpression */:
ts.Debug.type(node);
return factory.updateArrayLiteralExpression(node, nodesVisitor(node.elements, visitor, ts.isExpression));
case 203 /* ObjectLiteralExpression */:
ts.Debug.type(node);
return factory.updateObjectLiteralExpression(node, nodesVisitor(node.properties, visitor, ts.isObjectLiteralElementLike));
case 204 /* PropertyAccessExpression */:
if (node.flags & 32 /* OptionalChain */) {
ts.Debug.type(node);
return factory.updatePropertyAccessChain(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodeVisitor(node.questionDotToken, tokenVisitor, ts.isQuestionDotToken), nodeVisitor(node.name, visitor, ts.isMemberName));
}
ts.Debug.type(node);
return factory.updatePropertyAccessExpression(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodeVisitor(node.name, visitor, ts.isMemberName));
case 205 /* ElementAccessExpression */:
if (node.flags & 32 /* OptionalChain */) {
ts.Debug.type(node);
return factory.updateElementAccessChain(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodeVisitor(node.questionDotToken, tokenVisitor, ts.isQuestionDotToken), nodeVisitor(node.argumentExpression, visitor, ts.isExpression));
}
ts.Debug.type(node);
return factory.updateElementAccessExpression(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodeVisitor(node.argumentExpression, visitor, ts.isExpression));
case 206 /* CallExpression */:
if (node.flags & 32 /* OptionalChain */) {
ts.Debug.type(node);
return factory.updateCallChain(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodeVisitor(node.questionDotToken, tokenVisitor, ts.isQuestionDotToken), nodesVisitor(node.typeArguments, visitor, ts.isTypeNode), nodesVisitor(node.arguments, visitor, ts.isExpression));
}
ts.Debug.type(node);
return factory.updateCallExpression(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodesVisitor(node.typeArguments, visitor, ts.isTypeNode), nodesVisitor(node.arguments, visitor, ts.isExpression));
case 207 /* NewExpression */:
ts.Debug.type(node);
return factory.updateNewExpression(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodesVisitor(node.typeArguments, visitor, ts.isTypeNode), nodesVisitor(node.arguments, visitor, ts.isExpression));
case 208 /* TaggedTemplateExpression */:
ts.Debug.type(node);
return factory.updateTaggedTemplateExpression(node, nodeVisitor(node.tag, visitor, ts.isExpression), visitNodes(node.typeArguments, visitor, ts.isTypeNode), nodeVisitor(node.template, visitor, ts.isTemplateLiteral));
case 209 /* TypeAssertionExpression */:
ts.Debug.type(node);
return factory.updateTypeAssertion(node, nodeVisitor(node.type, visitor, ts.isTypeNode), nodeVisitor(node.expression, visitor, ts.isExpression));
case 210 /* ParenthesizedExpression */:
ts.Debug.type(node);
return factory.updateParenthesizedExpression(node, nodeVisitor(node.expression, visitor, ts.isExpression));
case 211 /* FunctionExpression */:
ts.Debug.type(node);
return factory.updateFunctionExpression(node, nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.asteriskToken, tokenVisitor, ts.isAsteriskToken), nodeVisitor(node.name, visitor, ts.isIdentifier), nodesVisitor(node.typeParameters, visitor, ts.isTypeParameterDeclaration), visitParameterList(node.parameters, visitor, context, nodesVisitor), nodeVisitor(node.type, visitor, ts.isTypeNode), visitFunctionBody(node.body, visitor, context, nodeVisitor));
case 212 /* ArrowFunction */:
ts.Debug.type(node);
return factory.updateArrowFunction(node, nodesVisitor(node.modifiers, visitor, ts.isModifier), nodesVisitor(node.typeParameters, visitor, ts.isTypeParameterDeclaration), visitParameterList(node.parameters, visitor, context, nodesVisitor), nodeVisitor(node.type, visitor, ts.isTypeNode), nodeVisitor(node.equalsGreaterThanToken, tokenVisitor, ts.isEqualsGreaterThanToken), visitFunctionBody(node.body, visitor, context, nodeVisitor));
case 213 /* DeleteExpression */:
ts.Debug.type(node);
return factory.updateDeleteExpression(node, nodeVisitor(node.expression, visitor, ts.isExpression));
case 214 /* TypeOfExpression */:
ts.Debug.type(node);
return factory.updateTypeOfExpression(node, nodeVisitor(node.expression, visitor, ts.isExpression));
case 215 /* VoidExpression */:
ts.Debug.type(node);
return factory.updateVoidExpression(node, nodeVisitor(node.expression, visitor, ts.isExpression));
case 216 /* AwaitExpression */:
ts.Debug.type(node);
return factory.updateAwaitExpression(node, nodeVisitor(node.expression, visitor, ts.isExpression));
case 217 /* PrefixUnaryExpression */:
ts.Debug.type(node);
return factory.updatePrefixUnaryExpression(node, nodeVisitor(node.operand, visitor, ts.isExpression));
case 218 /* PostfixUnaryExpression */:
ts.Debug.type(node);
return factory.updatePostfixUnaryExpression(node, nodeVisitor(node.operand, visitor, ts.isExpression));
case 219 /* BinaryExpression */:
ts.Debug.type(node);
return factory.updateBinaryExpression(node, nodeVisitor(node.left, visitor, ts.isExpression), nodeVisitor(node.operatorToken, tokenVisitor, ts.isBinaryOperatorToken), nodeVisitor(node.right, visitor, ts.isExpression));
case 220 /* ConditionalExpression */:
ts.Debug.type(node);
return factory.updateConditionalExpression(node, nodeVisitor(node.condition, visitor, ts.isExpression), nodeVisitor(node.questionToken, tokenVisitor, ts.isQuestionToken), nodeVisitor(node.whenTrue, visitor, ts.isExpression), nodeVisitor(node.colonToken, tokenVisitor, ts.isColonToken), nodeVisitor(node.whenFalse, visitor, ts.isExpression));
case 221 /* TemplateExpression */:
ts.Debug.type(node);
return factory.updateTemplateExpression(node, nodeVisitor(node.head, visitor, ts.isTemplateHead), nodesVisitor(node.templateSpans, visitor, ts.isTemplateSpan));
case 222 /* YieldExpression */:
ts.Debug.type(node);
return factory.updateYieldExpression(node, nodeVisitor(node.asteriskToken, tokenVisitor, ts.isAsteriskToken), nodeVisitor(node.expression, visitor, ts.isExpression));
case 223 /* SpreadElement */:
ts.Debug.type(node);
return factory.updateSpreadElement(node, nodeVisitor(node.expression, visitor, ts.isExpression));
case 224 /* ClassExpression */:
ts.Debug.type(node);
return factory.updateClassExpression(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.name, visitor, ts.isIdentifier), nodesVisitor(node.typeParameters, visitor, ts.isTypeParameterDeclaration), nodesVisitor(node.heritageClauses, visitor, ts.isHeritageClause), nodesVisitor(node.members, visitor, ts.isClassElement));
case 226 /* ExpressionWithTypeArguments */:
ts.Debug.type(node);
return factory.updateExpressionWithTypeArguments(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodesVisitor(node.typeArguments, visitor, ts.isTypeNode));
case 227 /* AsExpression */:
ts.Debug.type(node);
return factory.updateAsExpression(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodeVisitor(node.type, visitor, ts.isTypeNode));
case 228 /* NonNullExpression */:
if (node.flags & 32 /* OptionalChain */) {
ts.Debug.type(node);
return factory.updateNonNullChain(node, nodeVisitor(node.expression, visitor, ts.isExpression));
}
ts.Debug.type(node);
return factory.updateNonNullExpression(node, nodeVisitor(node.expression, visitor, ts.isExpression));
case 229 /* MetaProperty */:
ts.Debug.type(node);
return factory.updateMetaProperty(node, nodeVisitor(node.name, visitor, ts.isIdentifier));
// Misc
case 231 /* TemplateSpan */:
ts.Debug.type(node);
return factory.updateTemplateSpan(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodeVisitor(node.literal, visitor, ts.isTemplateMiddleOrTemplateTail));
// Element
case 233 /* Block */:
ts.Debug.type(node);
return factory.updateBlock(node, nodesVisitor(node.statements, visitor, ts.isStatement));
case 235 /* VariableStatement */:
ts.Debug.type(node);
return factory.updateVariableStatement(node, nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.declarationList, visitor, ts.isVariableDeclarationList));
case 236 /* ExpressionStatement */:
ts.Debug.type(node);
return factory.updateExpressionStatement(node, nodeVisitor(node.expression, visitor, ts.isExpression));
case 237 /* IfStatement */:
ts.Debug.type(node);
return factory.updateIfStatement(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodeVisitor(node.thenStatement, visitor, ts.isStatement, factory.liftToBlock), nodeVisitor(node.elseStatement, visitor, ts.isStatement, factory.liftToBlock));
case 238 /* DoStatement */:
ts.Debug.type(node);
return factory.updateDoStatement(node, visitIterationBody(node.statement, visitor, context), nodeVisitor(node.expression, visitor, ts.isExpression));
case 239 /* WhileStatement */:
ts.Debug.type(node);
return factory.updateWhileStatement(node, nodeVisitor(node.expression, visitor, ts.isExpression), visitIterationBody(node.statement, visitor, context));
case 240 /* ForStatement */:
ts.Debug.type(node);
return factory.updateForStatement(node, nodeVisitor(node.initializer, visitor, ts.isForInitializer), nodeVisitor(node.condition, visitor, ts.isExpression), nodeVisitor(node.incrementor, visitor, ts.isExpression), visitIterationBody(node.statement, visitor, context));
case 241 /* ForInStatement */:
ts.Debug.type(node);
return factory.updateForInStatement(node, nodeVisitor(node.initializer, visitor, ts.isForInitializer), nodeVisitor(node.expression, visitor, ts.isExpression), visitIterationBody(node.statement, visitor, context));
case 242 /* ForOfStatement */:
ts.Debug.type(node);
return factory.updateForOfStatement(node, nodeVisitor(node.awaitModifier, tokenVisitor, ts.isAwaitKeyword), nodeVisitor(node.initializer, visitor, ts.isForInitializer), nodeVisitor(node.expression, visitor, ts.isExpression), visitIterationBody(node.statement, visitor, context));
case 243 /* ContinueStatement */:
ts.Debug.type(node);
return factory.updateContinueStatement(node, nodeVisitor(node.label, visitor, ts.isIdentifier));
case 244 /* BreakStatement */:
ts.Debug.type(node);
return factory.updateBreakStatement(node, nodeVisitor(node.label, visitor, ts.isIdentifier));
case 245 /* ReturnStatement */:
ts.Debug.type(node);
return factory.updateReturnStatement(node, nodeVisitor(node.expression, visitor, ts.isExpression));
case 246 /* WithStatement */:
ts.Debug.type(node);
return factory.updateWithStatement(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodeVisitor(node.statement, visitor, ts.isStatement, factory.liftToBlock));
case 247 /* SwitchStatement */:
ts.Debug.type(node);
return factory.updateSwitchStatement(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodeVisitor(node.caseBlock, visitor, ts.isCaseBlock));
case 248 /* LabeledStatement */:
ts.Debug.type(node);
return factory.updateLabeledStatement(node, nodeVisitor(node.label, visitor, ts.isIdentifier), nodeVisitor(node.statement, visitor, ts.isStatement, factory.liftToBlock));
case 249 /* ThrowStatement */:
ts.Debug.type(node);
return factory.updateThrowStatement(node, nodeVisitor(node.expression, visitor, ts.isExpression));
case 250 /* TryStatement */:
ts.Debug.type(node);
return factory.updateTryStatement(node, nodeVisitor(node.tryBlock, visitor, ts.isBlock), nodeVisitor(node.catchClause, visitor, ts.isCatchClause), nodeVisitor(node.finallyBlock, visitor, ts.isBlock));
case 252 /* VariableDeclaration */:
ts.Debug.type(node);
return factory.updateVariableDeclaration(node, nodeVisitor(node.name, visitor, ts.isBindingName), nodeVisitor(node.exclamationToken, tokenVisitor, ts.isExclamationToken), nodeVisitor(node.type, visitor, ts.isTypeNode), nodeVisitor(node.initializer, visitor, ts.isExpression));
case 253 /* VariableDeclarationList */:
ts.Debug.type(node);
return factory.updateVariableDeclarationList(node, nodesVisitor(node.declarations, visitor, ts.isVariableDeclaration));
case 254 /* FunctionDeclaration */:
ts.Debug.type(node);
return factory.updateFunctionDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.asteriskToken, tokenVisitor, ts.isAsteriskToken), nodeVisitor(node.name, visitor, ts.isIdentifier), nodesVisitor(node.typeParameters, visitor, ts.isTypeParameterDeclaration), visitParameterList(node.parameters, visitor, context, nodesVisitor), nodeVisitor(node.type, visitor, ts.isTypeNode), visitFunctionBody(node.body, visitor, context, nodeVisitor));
case 255 /* ClassDeclaration */:
ts.Debug.type(node);
return factory.updateClassDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.name, visitor, ts.isIdentifier), nodesVisitor(node.typeParameters, visitor, ts.isTypeParameterDeclaration), nodesVisitor(node.heritageClauses, visitor, ts.isHeritageClause), nodesVisitor(node.members, visitor, ts.isClassElement));
case 256 /* InterfaceDeclaration */:
ts.Debug.type(node);
return factory.updateInterfaceDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.name, visitor, ts.isIdentifier), nodesVisitor(node.typeParameters, visitor, ts.isTypeParameterDeclaration), nodesVisitor(node.heritageClauses, visitor, ts.isHeritageClause), nodesVisitor(node.members, visitor, ts.isTypeElement));
case 257 /* TypeAliasDeclaration */:
ts.Debug.type(node);
return factory.updateTypeAliasDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.name, visitor, ts.isIdentifier), nodesVisitor(node.typeParameters, visitor, ts.isTypeParameterDeclaration), nodeVisitor(node.type, visitor, ts.isTypeNode));
case 258 /* EnumDeclaration */:
ts.Debug.type(node);
return factory.updateEnumDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.name, visitor, ts.isIdentifier), nodesVisitor(node.members, visitor, ts.isEnumMember));
case 259 /* ModuleDeclaration */:
ts.Debug.type(node);
return factory.updateModuleDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.name, visitor, ts.isModuleName), nodeVisitor(node.body, visitor, ts.isModuleBody));
case 260 /* ModuleBlock */:
ts.Debug.type(node);
return factory.updateModuleBlock(node, nodesVisitor(node.statements, visitor, ts.isStatement));
case 261 /* CaseBlock */:
ts.Debug.type(node);
return factory.updateCaseBlock(node, nodesVisitor(node.clauses, visitor, ts.isCaseOrDefaultClause));
case 262 /* NamespaceExportDeclaration */:
ts.Debug.type(node);
return factory.updateNamespaceExportDeclaration(node, nodeVisitor(node.name, visitor, ts.isIdentifier));
case 263 /* ImportEqualsDeclaration */:
ts.Debug.type(node);
return factory.updateImportEqualsDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), node.isTypeOnly, nodeVisitor(node.name, visitor, ts.isIdentifier), nodeVisitor(node.moduleReference, visitor, ts.isModuleReference));
case 264 /* ImportDeclaration */:
ts.Debug.type(node);
return factory.updateImportDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.importClause, visitor, ts.isImportClause), nodeVisitor(node.moduleSpecifier, visitor, ts.isExpression));
case 265 /* ImportClause */:
ts.Debug.type(node);
return factory.updateImportClause(node, node.isTypeOnly, nodeVisitor(node.name, visitor, ts.isIdentifier), nodeVisitor(node.namedBindings, visitor, ts.isNamedImportBindings));
case 266 /* NamespaceImport */:
ts.Debug.type(node);
return factory.updateNamespaceImport(node, nodeVisitor(node.name, visitor, ts.isIdentifier));
case 272 /* NamespaceExport */:
ts.Debug.type(node);
return factory.updateNamespaceExport(node, nodeVisitor(node.name, visitor, ts.isIdentifier));
case 267 /* NamedImports */:
ts.Debug.type(node);
return factory.updateNamedImports(node, nodesVisitor(node.elements, visitor, ts.isImportSpecifier));
case 268 /* ImportSpecifier */:
ts.Debug.type(node);
return factory.updateImportSpecifier(node, nodeVisitor(node.propertyName, visitor, ts.isIdentifier), nodeVisitor(node.name, visitor, ts.isIdentifier));
case 269 /* ExportAssignment */:
ts.Debug.type(node);
return factory.updateExportAssignment(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), nodeVisitor(node.expression, visitor, ts.isExpression));
case 270 /* ExportDeclaration */:
ts.Debug.type(node);
return factory.updateExportDeclaration(node, nodesVisitor(node.decorators, visitor, ts.isDecorator), nodesVisitor(node.modifiers, visitor, ts.isModifier), node.isTypeOnly, nodeVisitor(node.exportClause, visitor, ts.isNamedExportBindings), nodeVisitor(node.moduleSpecifier, visitor, ts.isExpression));
case 271 /* NamedExports */:
ts.Debug.type(node);
return factory.updateNamedExports(node, nodesVisitor(node.elements, visitor, ts.isExportSpecifier));
case 273 /* ExportSpecifier */:
ts.Debug.type(node);
return factory.updateExportSpecifier(node, nodeVisitor(node.propertyName, visitor, ts.isIdentifier), nodeVisitor(node.name, visitor, ts.isIdentifier));
// Module references
case 275 /* ExternalModuleReference */:
ts.Debug.type(node);
return factory.updateExternalModuleReference(node, nodeVisitor(node.expression, visitor, ts.isExpression));
// JSX
case 276 /* JsxElement */:
ts.Debug.type(node);
return factory.updateJsxElement(node, nodeVisitor(node.openingElement, visitor, ts.isJsxOpeningElement), nodesVisitor(node.children, visitor, ts.isJsxChild), nodeVisitor(node.closingElement, visitor, ts.isJsxClosingElement));
case 277 /* JsxSelfClosingElement */:
ts.Debug.type(node);
return factory.updateJsxSelfClosingElement(node, nodeVisitor(node.tagName, visitor, ts.isJsxTagNameExpression), nodesVisitor(node.typeArguments, visitor, ts.isTypeNode), nodeVisitor(node.attributes, visitor, ts.isJsxAttributes));
case 278 /* JsxOpeningElement */:
ts.Debug.type(node);
return factory.updateJsxOpeningElement(node, nodeVisitor(node.tagName, visitor, ts.isJsxTagNameExpression), nodesVisitor(node.typeArguments, visitor, ts.isTypeNode), nodeVisitor(node.attributes, visitor, ts.isJsxAttributes));
case 279 /* JsxClosingElement */:
ts.Debug.type(node);
return factory.updateJsxClosingElement(node, nodeVisitor(node.tagName, visitor, ts.isJsxTagNameExpression));
case 280 /* JsxFragment */:
ts.Debug.type(node);
return factory.updateJsxFragment(node, nodeVisitor(node.openingFragment, visitor, ts.isJsxOpeningFragment), nodesVisitor(node.children, visitor, ts.isJsxChild), nodeVisitor(node.closingFragment, visitor, ts.isJsxClosingFragment));
case 283 /* JsxAttribute */:
ts.Debug.type(node);
return factory.updateJsxAttribute(node, nodeVisitor(node.name, visitor, ts.isIdentifier), nodeVisitor(node.initializer, visitor, ts.isStringLiteralOrJsxExpression));
case 284 /* JsxAttributes */:
ts.Debug.type(node);
return factory.updateJsxAttributes(node, nodesVisitor(node.properties, visitor, ts.isJsxAttributeLike));
case 285 /* JsxSpreadAttribute */:
ts.Debug.type(node);
return factory.updateJsxSpreadAttribute(node, nodeVisitor(node.expression, visitor, ts.isExpression));
case 286 /* JsxExpression */:
ts.Debug.type(node);
return factory.updateJsxExpression(node, nodeVisitor(node.expression, visitor, ts.isExpression));
// Clauses
case 287 /* CaseClause */:
ts.Debug.type(node);
return factory.updateCaseClause(node, nodeVisitor(node.expression, visitor, ts.isExpression), nodesVisitor(node.statements, visitor, ts.isStatement));
case 288 /* DefaultClause */:
ts.Debug.type(node);
return factory.updateDefaultClause(node, nodesVisitor(node.statements, visitor, ts.isStatement));
case 289 /* HeritageClause */:
ts.Debug.type(node);
return factory.updateHeritageClause(node, nodesVisitor(node.types, visitor, ts.isExpressionWithTypeArguments));
case 290 /* CatchClause */:
ts.Debug.type(node);
return factory.updateCatchClause(node, nodeVisitor(node.variableDeclaration, visitor, ts.isVariableDeclaration), nodeVisitor(node.block, visitor, ts.isBlock));
// Property assignments
case 291 /* PropertyAssignment */:
ts.Debug.type(node);
return factory.updatePropertyAssignment(node, nodeVisitor(node.name, visitor, ts.isPropertyName), nodeVisitor(node.initializer, visitor, ts.isExpression));
case 292 /* ShorthandPropertyAssignment */:
ts.Debug.type(node);
return factory.updateShorthandPropertyAssignment(node, nodeVisitor(node.name, visitor, ts.isIdentifier), nodeVisitor(node.objectAssignmentInitializer, visitor, ts.isExpression));
case 293 /* SpreadAssignment */:
ts.Debug.type(node);
return factory.updateSpreadAssignment(node, nodeVisitor(node.expression, visitor, ts.isExpression));
// Enum
case 294 /* EnumMember */:
ts.Debug.type(node);
return factory.updateEnumMember(node, nodeVisitor(node.name, visitor, ts.isPropertyName), nodeVisitor(node.initializer, visitor, ts.isExpression));
// Top-level nodes
case 300 /* SourceFile */:
ts.Debug.type(node);
return factory.updateSourceFile(node, visitLexicalEnvironment(node.statements, visitor, context));
// Transformation nodes
case 345 /* PartiallyEmittedExpression */:
ts.Debug.type(node);
return factory.updatePartiallyEmittedExpression(node, nodeVisitor(node.expression, visitor, ts.isExpression));
case 346 /* CommaListExpression */:
ts.Debug.type(node);
return factory.updateCommaListExpression(node, nodesVisitor(node.elements, visitor, ts.isExpression));
default:
// No need to visit nodes with no children.
return node;
}
}
ts.visitEachChild = visitEachChild;
/**
* Extracts the single node from a NodeArray.
*
* @param nodes The NodeArray.
*/
function extractSingleNode(nodes) {
ts.Debug.assert(nodes.length <= 1, "Too many nodes written to output.");
return ts.singleOrUndefined(nodes);
}
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
function createSourceMapGenerator(host, file, sourceRoot, sourcesDirectoryPath, generatorOptions) {
var _a = generatorOptions.extendedDiagnostics
? ts.performance.createTimer("Source Map", "beforeSourcemap", "afterSourcemap")
: ts.performance.nullTimer, enter = _a.enter, exit = _a.exit;
// Current source map file and its index in the sources list
var rawSources = [];
var sources = [];
var sourceToSourceIndexMap = new ts.Map();
var sourcesContent;
var names = [];
var nameToNameIndexMap;
var mappingCharCodes = [];
var mappings = "";
// Last recorded and encoded mappings
var lastGeneratedLine = 0;
var lastGeneratedCharacter = 0;
var lastSourceIndex = 0;
var lastSourceLine = 0;
var lastSourceCharacter = 0;
var lastNameIndex = 0;
var hasLast = false;
var pendingGeneratedLine = 0;
var pendingGeneratedCharacter = 0;
var pendingSourceIndex = 0;
var pendingSourceLine = 0;
var pendingSourceCharacter = 0;
var pendingNameIndex = 0;
var hasPending = false;
var hasPendingSource = false;
var hasPendingName = false;
return {
getSources: function () { return rawSources; },
addSource: addSource,
setSourceContent: setSourceContent,
addName: addName,
addMapping: addMapping,
appendSourceMap: appendSourceMap,
toJSON: toJSON,
toString: function () { return JSON.stringify(toJSON()); }
};
function addSource(fileName) {
enter();
var source = ts.getRelativePathToDirectoryOrUrl(sourcesDirectoryPath, fileName, host.getCurrentDirectory(), host.getCanonicalFileName,
/*isAbsolutePathAnUrl*/ true);
var sourceIndex = sourceToSourceIndexMap.get(source);
if (sourceIndex === undefined) {
sourceIndex = sources.length;
sources.push(source);
rawSources.push(fileName);
sourceToSourceIndexMap.set(source, sourceIndex);
}
exit();
return sourceIndex;
}
/* eslint-disable boolean-trivia, no-null/no-null */
function setSourceContent(sourceIndex, content) {
enter();
if (content !== null) {
if (!sourcesContent)
sourcesContent = [];
while (sourcesContent.length < sourceIndex) {
sourcesContent.push(null);
}
sourcesContent[sourceIndex] = content;
}
exit();
}
/* eslint-enable boolean-trivia, no-null/no-null */
function addName(name) {
enter();
if (!nameToNameIndexMap)
nameToNameIndexMap = new ts.Map();
var nameIndex = nameToNameIndexMap.get(name);
if (nameIndex === undefined) {
nameIndex = names.length;
names.push(name);
nameToNameIndexMap.set(name, nameIndex);
}
exit();
return nameIndex;
}
function isNewGeneratedPosition(generatedLine, generatedCharacter) {
return !hasPending
|| pendingGeneratedLine !== generatedLine
|| pendingGeneratedCharacter !== generatedCharacter;
}
function isBacktrackingSourcePosition(sourceIndex, sourceLine, sourceCharacter) {
return sourceIndex !== undefined
&& sourceLine !== undefined
&& sourceCharacter !== undefined
&& pendingSourceIndex === sourceIndex
&& (pendingSourceLine > sourceLine
|| pendingSourceLine === sourceLine && pendingSourceCharacter > sourceCharacter);
}
function addMapping(generatedLine, generatedCharacter, sourceIndex, sourceLine, sourceCharacter, nameIndex) {
ts.Debug.assert(generatedLine >= pendingGeneratedLine, "generatedLine cannot backtrack");
ts.Debug.assert(generatedCharacter >= 0, "generatedCharacter cannot be negative");
ts.Debug.assert(sourceIndex === undefined || sourceIndex >= 0, "sourceIndex cannot be negative");
ts.Debug.assert(sourceLine === undefined || sourceLine >= 0, "sourceLine cannot be negative");
ts.Debug.assert(sourceCharacter === undefined || sourceCharacter >= 0, "sourceCharacter cannot be negative");
enter();
// If this location wasn't recorded or the location in source is going backwards, record the mapping
if (isNewGeneratedPosition(generatedLine, generatedCharacter) ||
isBacktrackingSourcePosition(sourceIndex, sourceLine, sourceCharacter)) {
commitPendingMapping();
pendingGeneratedLine = generatedLine;
pendingGeneratedCharacter = generatedCharacter;
hasPendingSource = false;
hasPendingName = false;
hasPending = true;
}
if (sourceIndex !== undefined && sourceLine !== undefined && sourceCharacter !== undefined) {
pendingSourceIndex = sourceIndex;
pendingSourceLine = sourceLine;
pendingSourceCharacter = sourceCharacter;
hasPendingSource = true;
if (nameIndex !== undefined) {
pendingNameIndex = nameIndex;
hasPendingName = true;
}
}
exit();
}
function appendSourceMap(generatedLine, generatedCharacter, map, sourceMapPath, start, end) {
ts.Debug.assert(generatedLine >= pendingGeneratedLine, "generatedLine cannot backtrack");
ts.Debug.assert(generatedCharacter >= 0, "generatedCharacter cannot be negative");
enter();
// First, decode the old component sourcemap
var sourceIndexToNewSourceIndexMap = [];
var nameIndexToNewNameIndexMap;
var mappingIterator = decodeMappings(map.mappings);
for (var iterResult = mappingIterator.next(); !iterResult.done; iterResult = mappingIterator.next()) {
var raw = iterResult.value;
if (end && (raw.generatedLine > end.line ||
(raw.generatedLine === end.line && raw.generatedCharacter > end.character))) {
break;
}
if (start && (raw.generatedLine < start.line ||
(start.line === raw.generatedLine && raw.generatedCharacter < start.character))) {
continue;
}
// Then reencode all the updated mappings into the overall map
var newSourceIndex = void 0;
var newSourceLine = void 0;
var newSourceCharacter = void 0;
var newNameIndex = void 0;
if (raw.sourceIndex !== undefined) {
newSourceIndex = sourceIndexToNewSourceIndexMap[raw.sourceIndex];
if (newSourceIndex === undefined) {
// Apply offsets to each position and fixup source entries
var rawPath = map.sources[raw.sourceIndex];
var relativePath = map.sourceRoot ? ts.combinePaths(map.sourceRoot, rawPath) : rawPath;
var combinedPath = ts.combinePaths(ts.getDirectoryPath(sourceMapPath), relativePath);
sourceIndexToNewSourceIndexMap[raw.sourceIndex] = newSourceIndex = addSource(combinedPath);
if (map.sourcesContent && typeof map.sourcesContent[raw.sourceIndex] === "string") {
setSourceContent(newSourceIndex, map.sourcesContent[raw.sourceIndex]);
}
}
newSourceLine = raw.sourceLine;
newSourceCharacter = raw.sourceCharacter;
if (map.names && raw.nameIndex !== undefined) {
if (!nameIndexToNewNameIndexMap)
nameIndexToNewNameIndexMap = [];
newNameIndex = nameIndexToNewNameIndexMap[raw.nameIndex];
if (newNameIndex === undefined) {
nameIndexToNewNameIndexMap[raw.nameIndex] = newNameIndex = addName(map.names[raw.nameIndex]);
}
}
}
var rawGeneratedLine = raw.generatedLine - (start ? start.line : 0);
var newGeneratedLine = rawGeneratedLine + generatedLine;
var rawGeneratedCharacter = start && start.line === raw.generatedLine ? raw.generatedCharacter - start.character : raw.generatedCharacter;
var newGeneratedCharacter = rawGeneratedLine === 0 ? rawGeneratedCharacter + generatedCharacter : rawGeneratedCharacter;
addMapping(newGeneratedLine, newGeneratedCharacter, newSourceIndex, newSourceLine, newSourceCharacter, newNameIndex);
}
exit();
}
function shouldCommitMapping() {
return !hasLast
|| lastGeneratedLine !== pendingGeneratedLine
|| lastGeneratedCharacter !== pendingGeneratedCharacter
|| lastSourceIndex !== pendingSourceIndex
|| lastSourceLine !== pendingSourceLine
|| lastSourceCharacter !== pendingSourceCharacter
|| lastNameIndex !== pendingNameIndex;
}
function appendMappingCharCode(charCode) {
mappingCharCodes.push(charCode);
// String.fromCharCode accepts its arguments on the stack, so we have to chunk the input,
// otherwise we can get stack overflows for large source maps
if (mappingCharCodes.length >= 1024) {
flushMappingBuffer();
}
}
function commitPendingMapping() {
if (!hasPending || !shouldCommitMapping()) {
return;
}
enter();
// Line/Comma delimiters
if (lastGeneratedLine < pendingGeneratedLine) {
// Emit line delimiters
do {
appendMappingCharCode(59 /* semicolon */);
lastGeneratedLine++;
} while (lastGeneratedLine < pendingGeneratedLine);
// Only need to set this once
lastGeneratedCharacter = 0;
}
else {
ts.Debug.assertEqual(lastGeneratedLine, pendingGeneratedLine, "generatedLine cannot backtrack");
// Emit comma to separate the entry
if (hasLast) {
appendMappingCharCode(44 /* comma */);
}
}
// 1. Relative generated character
appendBase64VLQ(pendingGeneratedCharacter - lastGeneratedCharacter);
lastGeneratedCharacter = pendingGeneratedCharacter;
if (hasPendingSource) {
// 2. Relative sourceIndex
appendBase64VLQ(pendingSourceIndex - lastSourceIndex);
lastSourceIndex = pendingSourceIndex;
// 3. Relative source line
appendBase64VLQ(pendingSourceLine - lastSourceLine);
lastSourceLine = pendingSourceLine;
// 4. Relative source character
appendBase64VLQ(pendingSourceCharacter - lastSourceCharacter);
lastSourceCharacter = pendingSourceCharacter;
if (hasPendingName) {
// 5. Relative nameIndex
appendBase64VLQ(pendingNameIndex - lastNameIndex);
lastNameIndex = pendingNameIndex;
}
}
hasLast = true;
exit();
}
function flushMappingBuffer() {
if (mappingCharCodes.length > 0) {
mappings += String.fromCharCode.apply(undefined, mappingCharCodes);
mappingCharCodes.length = 0;
}
}
function toJSON() {
commitPendingMapping();
flushMappingBuffer();
return {
version: 3,
file: file,
sourceRoot: sourceRoot,
sources: sources,
names: names,
mappings: mappings,
sourcesContent: sourcesContent,
};
}
function appendBase64VLQ(inValue) {
// Add a new least significant bit that has the sign of the value.
// if negative number the least significant bit that gets added to the number has value 1
// else least significant bit value that gets added is 0
// eg. -1 changes to binary : 01 [1] => 3
// +1 changes to binary : 01 [0] => 2
if (inValue < 0) {
inValue = ((-inValue) << 1) + 1;
}
else {
inValue = inValue << 1;
}
// Encode 5 bits at a time starting from least significant bits
do {
var currentDigit = inValue & 31; // 11111
inValue = inValue >> 5;
if (inValue > 0) {
// There are still more digits to decode, set the msb (6th bit)
currentDigit = currentDigit | 32;
}
appendMappingCharCode(base64FormatEncode(currentDigit));
} while (inValue > 0);
}
}
ts.createSourceMapGenerator = createSourceMapGenerator;
// Sometimes tools can see the following line as a source mapping url comment, so we mangle it a bit (the [M])
var sourceMapCommentRegExp = /^\/\/[@#] source[M]appingURL=(.+)$/;
var whitespaceOrMapCommentRegExp = /^\s*(\/\/[@#] .*)?$/;
function getLineInfo(text, lineStarts) {
return {
getLineCount: function () { return lineStarts.length; },
getLineText: function (line) { return text.substring(lineStarts[line], lineStarts[line + 1]); }
};
}
ts.getLineInfo = getLineInfo;
/**
* Tries to find the sourceMappingURL comment at the end of a file.
*/
function tryGetSourceMappingURL(lineInfo) {
for (var index = lineInfo.getLineCount() - 1; index >= 0; index--) {
var line = lineInfo.getLineText(index);
var comment = sourceMapCommentRegExp.exec(line);
if (comment) {
return ts.trimStringEnd(comment[1]);
}
// If we see a non-whitespace/map comment-like line, break, to avoid scanning up the entire file
else if (!line.match(whitespaceOrMapCommentRegExp)) {
break;
}
}
}
ts.tryGetSourceMappingURL = tryGetSourceMappingURL;
/* eslint-disable no-null/no-null */
function isStringOrNull(x) {
return typeof x === "string" || x === null;
}
function isRawSourceMap(x) {
return x !== null
&& typeof x === "object"
&& x.version === 3
&& typeof x.file === "string"
&& typeof x.mappings === "string"
&& ts.isArray(x.sources) && ts.every(x.sources, ts.isString)
&& (x.sourceRoot === undefined || x.sourceRoot === null || typeof x.sourceRoot === "string")
&& (x.sourcesContent === undefined || x.sourcesContent === null || ts.isArray(x.sourcesContent) && ts.every(x.sourcesContent, isStringOrNull))
&& (x.names === undefined || x.names === null || ts.isArray(x.names) && ts.every(x.names, ts.isString));
}
ts.isRawSourceMap = isRawSourceMap;
/* eslint-enable no-null/no-null */
function tryParseRawSourceMap(text) {
try {
var parsed = JSON.parse(text);
if (isRawSourceMap(parsed)) {
return parsed;
}
}
catch (_a) {
// empty
}
return undefined;
}
ts.tryParseRawSourceMap = tryParseRawSourceMap;
function decodeMappings(mappings) {
var done = false;
var pos = 0;
var generatedLine = 0;
var generatedCharacter = 0;
var sourceIndex = 0;
var sourceLine = 0;
var sourceCharacter = 0;
var nameIndex = 0;
var error;
return {
get pos() { return pos; },
get error() { return error; },
get state() { return captureMapping(/*hasSource*/ true, /*hasName*/ true); },
next: function () {
while (!done && pos < mappings.length) {
var ch = mappings.charCodeAt(pos);
if (ch === 59 /* semicolon */) {
// new line
generatedLine++;
generatedCharacter = 0;
pos++;
continue;
}
if (ch === 44 /* comma */) {
// Next entry is on same line - no action needed
pos++;
continue;
}
var hasSource = false;
var hasName = false;
generatedCharacter += base64VLQFormatDecode();
if (hasReportedError())
return stopIterating();
if (generatedCharacter < 0)
return setErrorAndStopIterating("Invalid generatedCharacter found");
if (!isSourceMappingSegmentEnd()) {
hasSource = true;
sourceIndex += base64VLQFormatDecode();
if (hasReportedError())
return stopIterating();
if (sourceIndex < 0)
return setErrorAndStopIterating("Invalid sourceIndex found");
if (isSourceMappingSegmentEnd())
return setErrorAndStopIterating("Unsupported Format: No entries after sourceIndex");
sourceLine += base64VLQFormatDecode();
if (hasReportedError())
return stopIterating();
if (sourceLine < 0)
return setErrorAndStopIterating("Invalid sourceLine found");
if (isSourceMappingSegmentEnd())
return setErrorAndStopIterating("Unsupported Format: No entries after sourceLine");
sourceCharacter += base64VLQFormatDecode();
if (hasReportedError())
return stopIterating();
if (sourceCharacter < 0)
return setErrorAndStopIterating("Invalid sourceCharacter found");
if (!isSourceMappingSegmentEnd()) {
hasName = true;
nameIndex += base64VLQFormatDecode();
if (hasReportedError())
return stopIterating();
if (nameIndex < 0)
return setErrorAndStopIterating("Invalid nameIndex found");
if (!isSourceMappingSegmentEnd())
return setErrorAndStopIterating("Unsupported Error Format: Entries after nameIndex");
}
}
return { value: captureMapping(hasSource, hasName), done: done };
}
return stopIterating();
}
};
function captureMapping(hasSource, hasName) {
return {
generatedLine: generatedLine,
generatedCharacter: generatedCharacter,
sourceIndex: hasSource ? sourceIndex : undefined,
sourceLine: hasSource ? sourceLine : undefined,
sourceCharacter: hasSource ? sourceCharacter : undefined,
nameIndex: hasName ? nameIndex : undefined
};
}
function stopIterating() {
done = true;
return { value: undefined, done: true };
}
function setError(message) {
if (error === undefined) {
error = message;
}
}
function setErrorAndStopIterating(message) {
setError(message);
return stopIterating();
}
function hasReportedError() {
return error !== undefined;
}
function isSourceMappingSegmentEnd() {
return (pos === mappings.length ||
mappings.charCodeAt(pos) === 44 /* comma */ ||
mappings.charCodeAt(pos) === 59 /* semicolon */);
}
function base64VLQFormatDecode() {
var moreDigits = true;
var shiftCount = 0;
var value = 0;
for (; moreDigits; pos++) {
if (pos >= mappings.length)
return setError("Error in decoding base64VLQFormatDecode, past the mapping string"), -1;
// 6 digit number
var currentByte = base64FormatDecode(mappings.charCodeAt(pos));
if (currentByte === -1)
return setError("Invalid character in VLQ"), -1;
// If msb is set, we still have more bits to continue
moreDigits = (currentByte & 32) !== 0;
// least significant 5 bits are the next msbs in the final value.
value = value | ((currentByte & 31) << shiftCount);
shiftCount += 5;
}
// Least significant bit if 1 represents negative and rest of the msb is actual absolute value
if ((value & 1) === 0) {
// + number
value = value >> 1;
}
else {
// - number
value = value >> 1;
value = -value;
}
return value;
}
}
ts.decodeMappings = decodeMappings;
function sameMapping(left, right) {
return left === right
|| left.generatedLine === right.generatedLine
&& left.generatedCharacter === right.generatedCharacter
&& left.sourceIndex === right.sourceIndex
&& left.sourceLine === right.sourceLine
&& left.sourceCharacter === right.sourceCharacter
&& left.nameIndex === right.nameIndex;
}
ts.sameMapping = sameMapping;
function isSourceMapping(mapping) {
return mapping.sourceIndex !== undefined
&& mapping.sourceLine !== undefined
&& mapping.sourceCharacter !== undefined;
}
ts.isSourceMapping = isSourceMapping;
function base64FormatEncode(value) {
return value >= 0 && value < 26 ? 65 /* A */ + value :
value >= 26 && value < 52 ? 97 /* a */ + value - 26 :
value >= 52 && value < 62 ? 48 /* _0 */ + value - 52 :
value === 62 ? 43 /* plus */ :
value === 63 ? 47 /* slash */ :
ts.Debug.fail(value + ": not a base64 value");
}
function base64FormatDecode(ch) {
return ch >= 65 /* A */ && ch <= 90 /* Z */ ? ch - 65 /* A */ :
ch >= 97 /* a */ && ch <= 122 /* z */ ? ch - 97 /* a */ + 26 :
ch >= 48 /* _0 */ && ch <= 57 /* _9 */ ? ch - 48 /* _0 */ + 52 :
ch === 43 /* plus */ ? 62 :
ch === 47 /* slash */ ? 63 :
-1;
}
function isSourceMappedPosition(value) {
return value.sourceIndex !== undefined
&& value.sourcePosition !== undefined;
}
function sameMappedPosition(left, right) {
return left.generatedPosition === right.generatedPosition
&& left.sourceIndex === right.sourceIndex
&& left.sourcePosition === right.sourcePosition;
}
function compareSourcePositions(left, right) {
// Compares sourcePosition without comparing sourceIndex
// since the mappings are grouped by sourceIndex
ts.Debug.assert(left.sourceIndex === right.sourceIndex);
return ts.compareValues(left.sourcePosition, right.sourcePosition);
}
function compareGeneratedPositions(left, right) {
return ts.compareValues(left.generatedPosition, right.generatedPosition);
}
function getSourcePositionOfMapping(value) {
return value.sourcePosition;
}
function getGeneratedPositionOfMapping(value) {
return value.generatedPosition;
}
function createDocumentPositionMapper(host, map, mapPath) {
var mapDirectory = ts.getDirectoryPath(mapPath);
var sourceRoot = map.sourceRoot ? ts.getNormalizedAbsolutePath(map.sourceRoot, mapDirectory) : mapDirectory;
var generatedAbsoluteFilePath = ts.getNormalizedAbsolutePath(map.file, mapDirectory);
var generatedFile = host.getSourceFileLike(generatedAbsoluteFilePath);
var sourceFileAbsolutePaths = map.sources.map(function (source) { return ts.getNormalizedAbsolutePath(source, sourceRoot); });
var sourceToSourceIndexMap = new ts.Map(sourceFileAbsolutePaths.map(function (source, i) { return [host.getCanonicalFileName(source), i]; }));
var decodedMappings;
var generatedMappings;
var sourceMappings;
return {
getSourcePosition: getSourcePosition,
getGeneratedPosition: getGeneratedPosition
};
function processMapping(mapping) {
var generatedPosition = generatedFile !== undefined
? ts.getPositionOfLineAndCharacter(generatedFile, mapping.generatedLine, mapping.generatedCharacter, /*allowEdits*/ true)
: -1;
var source;
var sourcePosition;
if (isSourceMapping(mapping)) {
var sourceFile = host.getSourceFileLike(sourceFileAbsolutePaths[mapping.sourceIndex]);
source = map.sources[mapping.sourceIndex];
sourcePosition = sourceFile !== undefined
? ts.getPositionOfLineAndCharacter(sourceFile, mapping.sourceLine, mapping.sourceCharacter, /*allowEdits*/ true)
: -1;
}
return {
generatedPosition: generatedPosition,
source: source,
sourceIndex: mapping.sourceIndex,
sourcePosition: sourcePosition,
nameIndex: mapping.nameIndex
};
}
function getDecodedMappings() {
if (decodedMappings === undefined) {
var decoder = decodeMappings(map.mappings);
var mappings = ts.arrayFrom(decoder, processMapping);
if (decoder.error !== undefined) {
if (host.log) {
host.log("Encountered error while decoding sourcemap: " + decoder.error);
}
decodedMappings = ts.emptyArray;
}
else {
decodedMappings = mappings;
}
}
return decodedMappings;
}
function getSourceMappings(sourceIndex) {
if (sourceMappings === undefined) {
var lists = [];
for (var _i = 0, _a = getDecodedMappings(); _i < _a.length; _i++) {
var mapping = _a[_i];
if (!isSourceMappedPosition(mapping))
continue;
var list = lists[mapping.sourceIndex];
if (!list)
lists[mapping.sourceIndex] = list = [];
list.push(mapping);
}
sourceMappings = lists.map(function (list) { return ts.sortAndDeduplicate(list, compareSourcePositions, sameMappedPosition); });
}
return sourceMappings[sourceIndex];
}
function getGeneratedMappings() {
if (generatedMappings === undefined) {
var list = [];
for (var _i = 0, _a = getDecodedMappings(); _i < _a.length; _i++) {
var mapping = _a[_i];
list.push(mapping);
}
generatedMappings = ts.sortAndDeduplicate(list, compareGeneratedPositions, sameMappedPosition);
}
return generatedMappings;
}
function getGeneratedPosition(loc) {
var sourceIndex = sourceToSourceIndexMap.get(host.getCanonicalFileName(loc.fileName));
if (sourceIndex === undefined)
return loc;
var sourceMappings = getSourceMappings(sourceIndex);
if (!ts.some(sourceMappings))
return loc;
var targetIndex = ts.binarySearchKey(sourceMappings, loc.pos, getSourcePositionOfMapping, ts.compareValues);
if (targetIndex < 0) {
// if no exact match, closest is 2's complement of result
targetIndex = ~targetIndex;
}
var mapping = sourceMappings[targetIndex];
if (mapping === undefined || mapping.sourceIndex !== sourceIndex) {
return loc;
}
return { fileName: generatedAbsoluteFilePath, pos: mapping.generatedPosition }; // Closest pos
}
function getSourcePosition(loc) {
var generatedMappings = getGeneratedMappings();
if (!ts.some(generatedMappings))
return loc;
var targetIndex = ts.binarySearchKey(generatedMappings, loc.pos, getGeneratedPositionOfMapping, ts.compareValues);
if (targetIndex < 0) {
// if no exact match, closest is 2's complement of result
targetIndex = ~targetIndex;
}
var mapping = generatedMappings[targetIndex];
if (mapping === undefined || !isSourceMappedPosition(mapping)) {
return loc;
}
return { fileName: sourceFileAbsolutePaths[mapping.sourceIndex], pos: mapping.sourcePosition }; // Closest pos
}
}
ts.createDocumentPositionMapper = createDocumentPositionMapper;
ts.identitySourceMapConsumer = {
getSourcePosition: ts.identity,
getGeneratedPosition: ts.identity
};
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
function getOriginalNodeId(node) {
node = ts.getOriginalNode(node);
return node ? ts.getNodeId(node) : 0;
}
ts.getOriginalNodeId = getOriginalNodeId;
function containsDefaultReference(node) {
if (!node)
return false;
if (!ts.isNamedImports(node))
return false;
return ts.some(node.elements, isNamedDefaultReference);
}
function isNamedDefaultReference(e) {
return e.propertyName !== undefined && e.propertyName.escapedText === "default" /* Default */;
}
function chainBundle(context, transformSourceFile) {
return transformSourceFileOrBundle;
function transformSourceFileOrBundle(node) {
return node.kind === 300 /* SourceFile */ ? transformSourceFile(node) : transformBundle(node);
}
function transformBundle(node) {
return context.factory.createBundle(ts.map(node.sourceFiles, transformSourceFile), node.prepends);
}
}
ts.chainBundle = chainBundle;
function getExportNeedsImportStarHelper(node) {
return !!ts.getNamespaceDeclarationNode(node);
}
ts.getExportNeedsImportStarHelper = getExportNeedsImportStarHelper;
function getImportNeedsImportStarHelper(node) {
if (!!ts.getNamespaceDeclarationNode(node)) {
return true;
}
var bindings = node.importClause && node.importClause.namedBindings;
if (!bindings) {
return false;
}
if (!ts.isNamedImports(bindings))
return false;
var defaultRefCount = 0;
for (var _i = 0, _a = bindings.elements; _i < _a.length; _i++) {
var binding = _a[_i];
if (isNamedDefaultReference(binding)) {
defaultRefCount++;
}
}
// Import star is required if there's default named refs mixed with non-default refs, or if theres non-default refs and it has a default import
return (defaultRefCount > 0 && defaultRefCount !== bindings.elements.length) || (!!(bindings.elements.length - defaultRefCount) && ts.isDefaultImport(node));
}
ts.getImportNeedsImportStarHelper = getImportNeedsImportStarHelper;
function getImportNeedsImportDefaultHelper(node) {
// Import default is needed if there's a default import or a default ref and no other refs (meaning an import star helper wasn't requested)
return !getImportNeedsImportStarHelper(node) && (ts.isDefaultImport(node) || (!!node.importClause && ts.isNamedImports(node.importClause.namedBindings) && containsDefaultReference(node.importClause.namedBindings))); // TODO: GH#18217
}
ts.getImportNeedsImportDefaultHelper = getImportNeedsImportDefaultHelper;
function collectExternalModuleInfo(context, sourceFile, resolver, compilerOptions) {
var externalImports = [];
var exportSpecifiers = ts.createMultiMap();
var exportedBindings = [];
var uniqueExports = new ts.Map();
var exportedNames;
var hasExportDefault = false;
var exportEquals;
var hasExportStarsToExportValues = false;
var hasImportStar = false;
var hasImportDefault = false;
for (var _i = 0, _a = sourceFile.statements; _i < _a.length; _i++) {
var node = _a[_i];
switch (node.kind) {
case 264 /* ImportDeclaration */:
// import "mod"
// import x from "mod"
// import * as x from "mod"
// import { x, y } from "mod"
externalImports.push(node);
if (!hasImportStar && getImportNeedsImportStarHelper(node)) {
hasImportStar = true;
}
if (!hasImportDefault && getImportNeedsImportDefaultHelper(node)) {
hasImportDefault = true;
}
break;
case 263 /* ImportEqualsDeclaration */:
if (node.moduleReference.kind === 275 /* ExternalModuleReference */) {
// import x = require("mod")
externalImports.push(node);
}
break;
case 270 /* ExportDeclaration */:
if (node.moduleSpecifier) {
if (!node.exportClause) {
// export * from "mod"
externalImports.push(node);
hasExportStarsToExportValues = true;
}
else {
// export * as ns from "mod"
// export { x, y } from "mod"
externalImports.push(node);
if (ts.isNamedExports(node.exportClause)) {
addExportedNamesForExportDeclaration(node);
}
else {
var name = node.exportClause.name;
if (!uniqueExports.get(ts.idText(name))) {
multiMapSparseArrayAdd(exportedBindings, getOriginalNodeId(node), name);
uniqueExports.set(ts.idText(name), true);
exportedNames = ts.append(exportedNames, name);
}
// we use the same helpers for `export * as ns` as we do for `import * as ns`
hasImportStar = true;
}
}
}
else {
// export { x, y }
addExportedNamesForExportDeclaration(node);
}
break;
case 269 /* ExportAssignment */:
if (node.isExportEquals && !exportEquals) {
// export = x
exportEquals = node;
}
break;
case 235 /* VariableStatement */:
if (ts.hasSyntacticModifier(node, 1 /* Export */)) {
for (var _b = 0, _c = node.declarationList.declarations; _b < _c.length; _b++) {
var decl = _c[_b];
exportedNames = collectExportedVariableInfo(decl, uniqueExports, exportedNames);
}
}
break;
case 254 /* FunctionDeclaration */:
if (ts.hasSyntacticModifier(node, 1 /* Export */)) {
if (ts.hasSyntacticModifier(node, 512 /* Default */)) {
// export default function() { }
if (!hasExportDefault) {
multiMapSparseArrayAdd(exportedBindings, getOriginalNodeId(node), context.factory.getDeclarationName(node));
hasExportDefault = true;
}
}
else {
// export function x() { }
var name = node.name;
if (!uniqueExports.get(ts.idText(name))) {
multiMapSparseArrayAdd(exportedBindings, getOriginalNodeId(node), name);
uniqueExports.set(ts.idText(name), true);
exportedNames = ts.append(exportedNames, name);
}
}
}
break;
case 255 /* ClassDeclaration */:
if (ts.hasSyntacticModifier(node, 1 /* Export */)) {
if (ts.hasSyntacticModifier(node, 512 /* Default */)) {
// export default class { }
if (!hasExportDefault) {
multiMapSparseArrayAdd(exportedBindings, getOriginalNodeId(node), context.factory.getDeclarationName(node));
hasExportDefault = true;
}
}
else {
// export class x { }
var name = node.name;
if (name && !uniqueExports.get(ts.idText(name))) {
multiMapSparseArrayAdd(exportedBindings, getOriginalNodeId(node), name);
uniqueExports.set(ts.idText(name), true);
exportedNames = ts.append(exportedNames, name);
}
}
}
break;
}
}
var externalHelpersImportDeclaration = ts.createExternalHelpersImportDeclarationIfNeeded(context.factory, context.getEmitHelperFactory(), sourceFile, compilerOptions, hasExportStarsToExportValues, hasImportStar, hasImportDefault);
if (externalHelpersImportDeclaration) {
externalImports.unshift(externalHelpersImportDeclaration);
}
return { externalImports: externalImports, exportSpecifiers: exportSpecifiers, exportEquals: exportEquals, hasExportStarsToExportValues: hasExportStarsToExportValues, exportedBindings: exportedBindings, exportedNames: exportedNames, externalHelpersImportDeclaration: externalHelpersImportDeclaration };
function addExportedNamesForExportDeclaration(node) {
for (var _i = 0, _a = ts.cast(node.exportClause, ts.isNamedExports).elements; _i < _a.length; _i++) {
var specifier = _a[_i];
if (!uniqueExports.get(ts.idText(specifier.name))) {
var name = specifier.propertyName || specifier.name;
if (!node.moduleSpecifier) {
exportSpecifiers.add(ts.idText(name), specifier);
}
var decl = resolver.getReferencedImportDeclaration(name)
|| resolver.getReferencedValueDeclaration(name);
if (decl) {
multiMapSparseArrayAdd(exportedBindings, getOriginalNodeId(decl), specifier.name);
}
uniqueExports.set(ts.idText(specifier.name), true);
exportedNames = ts.append(exportedNames, specifier.name);
}
}
}
}
ts.collectExternalModuleInfo = collectExternalModuleInfo;
function collectExportedVariableInfo(decl, uniqueExports, exportedNames) {
if (ts.isBindingPattern(decl.name)) {
for (var _i = 0, _a = decl.name.elements; _i < _a.length; _i++) {
var element = _a[_i];
if (!ts.isOmittedExpression(element)) {
exportedNames = collectExportedVariableInfo(element, uniqueExports, exportedNames);
}
}
}
else if (!ts.isGeneratedIdentifier(decl.name)) {
var text = ts.idText(decl.name);
if (!uniqueExports.get(text)) {
uniqueExports.set(text, true);
exportedNames = ts.append(exportedNames, decl.name);
}
}
return exportedNames;
}
/** Use a sparse array as a multi-map. */
function multiMapSparseArrayAdd(map, key, value) {
var values = map[key];
if (values) {
values.push(value);
}
else {
map[key] = values = [value];
}
return values;
}
/**
* Used in the module transformer to check if an expression is reasonably without sideeffect,
* and thus better to copy into multiple places rather than to cache in a temporary variable
* - this is mostly subjective beyond the requirement that the expression not be sideeffecting
*/
function isSimpleCopiableExpression(expression) {
return ts.isStringLiteralLike(expression) ||
expression.kind === 8 /* NumericLiteral */ ||
ts.isKeyword(expression.kind) ||
ts.isIdentifier(expression);
}
ts.isSimpleCopiableExpression = isSimpleCopiableExpression;
/**
* A simple inlinable expression is an expression which can be copied into multiple locations
* without risk of repeating any sideeffects and whose value could not possibly change between
* any such locations
*/
function isSimpleInlineableExpression(expression) {
return !ts.isIdentifier(expression) && isSimpleCopiableExpression(expression);
}
ts.isSimpleInlineableExpression = isSimpleInlineableExpression;
function isCompoundAssignment(kind) {
return kind >= 64 /* FirstCompoundAssignment */
&& kind <= 78 /* LastCompoundAssignment */;
}
ts.isCompoundAssignment = isCompoundAssignment;
function getNonAssignmentOperatorForCompoundAssignment(kind) {
switch (kind) {
case 64 /* PlusEqualsToken */: return 39 /* PlusToken */;
case 65 /* MinusEqualsToken */: return 40 /* MinusToken */;
case 66 /* AsteriskEqualsToken */: return 41 /* AsteriskToken */;
case 67 /* AsteriskAsteriskEqualsToken */: return 42 /* AsteriskAsteriskToken */;
case 68 /* SlashEqualsToken */: return 43 /* SlashToken */;
case 69 /* PercentEqualsToken */: return 44 /* PercentToken */;
case 70 /* LessThanLessThanEqualsToken */: return 47 /* LessThanLessThanToken */;
case 71 /* GreaterThanGreaterThanEqualsToken */: return 48 /* GreaterThanGreaterThanToken */;
case 72 /* GreaterThanGreaterThanGreaterThanEqualsToken */: return 49 /* GreaterThanGreaterThanGreaterThanToken */;
case 73 /* AmpersandEqualsToken */: return 50 /* AmpersandToken */;
case 74 /* BarEqualsToken */: return 51 /* BarToken */;
case 78 /* CaretEqualsToken */: return 52 /* CaretToken */;
case 75 /* BarBarEqualsToken */: return 56 /* BarBarToken */;
case 76 /* AmpersandAmpersandEqualsToken */: return 55 /* AmpersandAmpersandToken */;
case 77 /* QuestionQuestionEqualsToken */: return 60 /* QuestionQuestionToken */;
}
}
ts.getNonAssignmentOperatorForCompoundAssignment = getNonAssignmentOperatorForCompoundAssignment;
/**
* Adds super call and preceding prologue directives into the list of statements.
*
* @param ctor The constructor node.
* @param result The list of statements.
* @param visitor The visitor to apply to each node added to the result array.
* @returns index of the statement that follows super call
*/
function addPrologueDirectivesAndInitialSuperCall(factory, ctor, result, visitor) {
if (ctor.body) {
var statements = ctor.body.statements;
// add prologue directives to the list (if any)
var index = factory.copyPrologue(statements, result, /*ensureUseStrict*/ false, visitor);
if (index === statements.length) {
// list contains nothing but prologue directives (or empty) - exit
return index;
}
var superIndex = ts.findIndex(statements, function (s) { return ts.isExpressionStatement(s) && ts.isSuperCall(s.expression); }, index);
if (superIndex > -1) {
for (var i = index; i <= superIndex; i++) {
result.push(ts.visitNode(statements[i], visitor, ts.isStatement));
}
return superIndex + 1;
}
return index;
}
return 0;
}
ts.addPrologueDirectivesAndInitialSuperCall = addPrologueDirectivesAndInitialSuperCall;
function getProperties(node, requireInitializer, isStatic) {
return ts.filter(node.members, function (m) { return isInitializedOrStaticProperty(m, requireInitializer, isStatic); });
}
ts.getProperties = getProperties;
function isStaticPropertyDeclarationOrClassStaticBlockDeclaration(element) {
return isStaticPropertyDeclaration(element) || ts.isClassStaticBlockDeclaration(element);
}
function getStaticPropertiesAndClassStaticBlock(node) {
return ts.filter(node.members, isStaticPropertyDeclarationOrClassStaticBlockDeclaration);
}
ts.getStaticPropertiesAndClassStaticBlock = getStaticPropertiesAndClassStaticBlock;
/**
* Is a class element either a static or an instance property declaration with an initializer?
*
* @param member The class element node.
* @param isStatic A value indicating whether the member should be a static or instance member.
*/
function isInitializedOrStaticProperty(member, requireInitializer, isStatic) {
return ts.isPropertyDeclaration(member)
&& (!!member.initializer || !requireInitializer)
&& ts.hasStaticModifier(member) === isStatic;
}
function isStaticPropertyDeclaration(member) {
return ts.isPropertyDeclaration(member) && ts.hasStaticModifier(member);
}
/**
* Gets a value indicating whether a class element is either a static or an instance property declaration with an initializer.
*
* @param member The class element node.
* @param isStatic A value indicating whether the member should be a static or instance member.
*/
function isInitializedProperty(member) {
return member.kind === 165 /* PropertyDeclaration */
&& member.initializer !== undefined;
}
ts.isInitializedProperty = isInitializedProperty;
/**
* Gets a value indicating whether a class element is a private instance method or accessor.
*
* @param member The class element node.
*/
function isNonStaticMethodOrAccessorWithPrivateName(member) {
return !ts.isStatic(member) && ts.isMethodOrAccessor(member) && ts.isPrivateIdentifier(member.name);
}
ts.isNonStaticMethodOrAccessorWithPrivateName = isNonStaticMethodOrAccessorWithPrivateName;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
var FlattenLevel;
(function (FlattenLevel) {
FlattenLevel[FlattenLevel["All"] = 0] = "All";
FlattenLevel[FlattenLevel["ObjectRest"] = 1] = "ObjectRest";
})(FlattenLevel = ts.FlattenLevel || (ts.FlattenLevel = {}));
/**
* Flattens a DestructuringAssignment or a VariableDeclaration to an expression.
*
* @param node The node to flatten.
* @param visitor An optional visitor used to visit initializers.
* @param context The transformation context.
* @param level Indicates the extent to which flattening should occur.
* @param needsValue An optional value indicating whether the value from the right-hand-side of
* the destructuring assignment is needed as part of a larger expression.
* @param createAssignmentCallback An optional callback used to create the assignment expression.
*/
function flattenDestructuringAssignment(node, visitor, context, level, needsValue, createAssignmentCallback) {
var location = node;
var value;
if (ts.isDestructuringAssignment(node)) {
value = node.right;
while (ts.isEmptyArrayLiteral(node.left) || ts.isEmptyObjectLiteral(node.left)) {
if (ts.isDestructuringAssignment(value)) {
location = node = value;
value = node.right;
}
else {
return ts.visitNode(value, visitor, ts.isExpression);
}
}
}
var expressions;
var flattenContext = {
context: context,
level: level,
downlevelIteration: !!context.getCompilerOptions().downlevelIteration,
hoistTempVariables: true,
emitExpression: emitExpression,
emitBindingOrAssignment: emitBindingOrAssignment,
createArrayBindingOrAssignmentPattern: function (elements) { return makeArrayAssignmentPattern(context.factory, elements); },
createObjectBindingOrAssignmentPattern: function (elements) { return makeObjectAssignmentPattern(context.factory, elements); },
createArrayBindingOrAssignmentElement: makeAssignmentElement,
visitor: visitor
};
if (value) {
value = ts.visitNode(value, visitor, ts.isExpression);
if (ts.isIdentifier(value) && bindingOrAssignmentElementAssignsToName(node, value.escapedText) ||
bindingOrAssignmentElementContainsNonLiteralComputedName(node)) {
// If the right-hand value of the assignment is also an assignment target then
// we need to cache the right-hand value.
value = ensureIdentifier(flattenContext, value, /*reuseIdentifierExpressions*/ false, location);
}
else if (needsValue) {
// If the right-hand value of the destructuring assignment needs to be preserved (as
// is the case when the destructuring assignment is part of a larger expression),
// then we need to cache the right-hand value.
//
// The source map location for the assignment should point to the entire binary
// expression.
value = ensureIdentifier(flattenContext, value, /*reuseIdentifierExpressions*/ true, location);
}
else if (ts.nodeIsSynthesized(node)) {
// Generally, the source map location for a destructuring assignment is the root
// expression.
//
// However, if the root expression is synthesized (as in the case
// of the initializer when transforming a ForOfStatement), then the source map
// location should point to the right-hand value of the expression.
location = value;
}
}
flattenBindingOrAssignmentElement(flattenContext, node, value, location, /*skipInitializer*/ ts.isDestructuringAssignment(node));
if (value && needsValue) {
if (!ts.some(expressions)) {
return value;
}
expressions.push(value);
}
return context.factory.inlineExpressions(expressions) || context.factory.createOmittedExpression();
function emitExpression(expression) {
expressions = ts.append(expressions, expression);
}
function emitBindingOrAssignment(target, value, location, original) {
ts.Debug.assertNode(target, createAssignmentCallback ? ts.isIdentifier : ts.isExpression);
var expression = createAssignmentCallback
? createAssignmentCallback(target, value, location)
: ts.setTextRange(context.factory.createAssignment(ts.visitNode(target, visitor, ts.isExpression), value), location);
expression.original = original;
emitExpression(expression);
}
}
ts.flattenDestructuringAssignment = flattenDestructuringAssignment;
function bindingOrAssignmentElementAssignsToName(element, escapedName) {
var target = ts.getTargetOfBindingOrAssignmentElement(element); // TODO: GH#18217
if (ts.isBindingOrAssignmentPattern(target)) {
return bindingOrAssignmentPatternAssignsToName(target, escapedName);
}
else if (ts.isIdentifier(target)) {
return target.escapedText === escapedName;
}
return false;
}
function bindingOrAssignmentPatternAssignsToName(pattern, escapedName) {
var elements = ts.getElementsOfBindingOrAssignmentPattern(pattern);
for (var _i = 0, elements_3 = elements; _i < elements_3.length; _i++) {
var element = elements_3[_i];
if (bindingOrAssignmentElementAssignsToName(element, escapedName)) {
return true;
}
}
return false;
}
function bindingOrAssignmentElementContainsNonLiteralComputedName(element) {
var propertyName = ts.tryGetPropertyNameOfBindingOrAssignmentElement(element);
if (propertyName && ts.isComputedPropertyName(propertyName) && !ts.isLiteralExpression(propertyName.expression)) {
return true;
}
var target = ts.getTargetOfBindingOrAssignmentElement(element);
return !!target && ts.isBindingOrAssignmentPattern(target) && bindingOrAssignmentPatternContainsNonLiteralComputedName(target);
}
function bindingOrAssignmentPatternContainsNonLiteralComputedName(pattern) {
return !!ts.forEach(ts.getElementsOfBindingOrAssignmentPattern(pattern), bindingOrAssignmentElementContainsNonLiteralComputedName);
}
/**
* Flattens a VariableDeclaration or ParameterDeclaration to one or more variable declarations.
*
* @param node The node to flatten.
* @param visitor An optional visitor used to visit initializers.
* @param context The transformation context.
* @param boundValue The value bound to the declaration.
* @param skipInitializer A value indicating whether to ignore the initializer of `node`.
* @param hoistTempVariables Indicates whether temporary variables should not be recorded in-line.
* @param level Indicates the extent to which flattening should occur.
*/
function flattenDestructuringBinding(node, visitor, context, level, rval, hoistTempVariables, skipInitializer) {
if (hoistTempVariables === void 0) { hoistTempVariables = false; }
var pendingExpressions;
var pendingDeclarations = [];
var declarations = [];
var flattenContext = {
context: context,
level: level,
downlevelIteration: !!context.getCompilerOptions().downlevelIteration,
hoistTempVariables: hoistTempVariables,
emitExpression: emitExpression,
emitBindingOrAssignment: emitBindingOrAssignment,
createArrayBindingOrAssignmentPattern: function (elements) { return makeArrayBindingPattern(context.factory, elements); },
createObjectBindingOrAssignmentPattern: function (elements) { return makeObjectBindingPattern(context.factory, elements); },
createArrayBindingOrAssignmentElement: function (name) { return makeBindingElement(context.factory, name); },
visitor: visitor
};
if (ts.isVariableDeclaration(node)) {
var initializer = ts.getInitializerOfBindingOrAssignmentElement(node);
if (initializer && (ts.isIdentifier(initializer) && bindingOrAssignmentElementAssignsToName(node, initializer.escapedText) ||
bindingOrAssignmentElementContainsNonLiteralComputedName(node))) {
// If the right-hand value of the assignment is also an assignment target then
// we need to cache the right-hand value.
initializer = ensureIdentifier(flattenContext, ts.visitNode(initializer, flattenContext.visitor), /*reuseIdentifierExpressions*/ false, initializer);
node = context.factory.updateVariableDeclaration(node, node.name, /*exclamationToken*/ undefined, /*type*/ undefined, initializer);
}
}
flattenBindingOrAssignmentElement(flattenContext, node, rval, node, skipInitializer);
if (pendingExpressions) {
var temp = context.factory.createTempVariable(/*recordTempVariable*/ undefined);
if (hoistTempVariables) {
var value = context.factory.inlineExpressions(pendingExpressions);
pendingExpressions = undefined;
emitBindingOrAssignment(temp, value, /*location*/ undefined, /*original*/ undefined);
}
else {
context.hoistVariableDeclaration(temp);
var pendingDeclaration = ts.last(pendingDeclarations);
pendingDeclaration.pendingExpressions = ts.append(pendingDeclaration.pendingExpressions, context.factory.createAssignment(temp, pendingDeclaration.value));
ts.addRange(pendingDeclaration.pendingExpressions, pendingExpressions);
pendingDeclaration.value = temp;
}
}
for (var _i = 0, pendingDeclarations_1 = pendingDeclarations; _i < pendingDeclarations_1.length; _i++) {
var _a = pendingDeclarations_1[_i], pendingExpressions_1 = _a.pendingExpressions, name = _a.name, value = _a.value, location = _a.location, original = _a.original;
var variable = context.factory.createVariableDeclaration(name,
/*exclamationToken*/ undefined,
/*type*/ undefined, pendingExpressions_1 ? context.factory.inlineExpressions(ts.append(pendingExpressions_1, value)) : value);
variable.original = original;
ts.setTextRange(variable, location);
declarations.push(variable);
}
return declarations;
function emitExpression(value) {
pendingExpressions = ts.append(pendingExpressions, value);
}
function emitBindingOrAssignment(target, value, location, original) {
ts.Debug.assertNode(target, ts.isBindingName);
if (pendingExpressions) {
value = context.factory.inlineExpressions(ts.append(pendingExpressions, value));
pendingExpressions = undefined;
}
pendingDeclarations.push({ pendingExpressions: pendingExpressions, name: target, value: value, location: location, original: original });
}
}
ts.flattenDestructuringBinding = flattenDestructuringBinding;
/**
* Flattens a BindingOrAssignmentElement into zero or more bindings or assignments.
*
* @param flattenContext Options used to control flattening.
* @param element The element to flatten.
* @param value The current RHS value to assign to the element.
* @param location The location to use for source maps and comments.
* @param skipInitializer An optional value indicating whether to include the initializer
* for the element.
*/
function flattenBindingOrAssignmentElement(flattenContext, element, value, location, skipInitializer) {
var bindingTarget = ts.getTargetOfBindingOrAssignmentElement(element); // TODO: GH#18217
if (!skipInitializer) {
var initializer = ts.visitNode(ts.getInitializerOfBindingOrAssignmentElement(element), flattenContext.visitor, ts.isExpression);
if (initializer) {
// Combine value and initializer
if (value) {
value = createDefaultValueCheck(flattenContext, value, initializer, location);
// If 'value' is not a simple expression, it could contain side-effecting code that should evaluate before an object or array binding pattern.
if (!ts.isSimpleInlineableExpression(initializer) && ts.isBindingOrAssignmentPattern(bindingTarget)) {
value = ensureIdentifier(flattenContext, value, /*reuseIdentifierExpressions*/ true, location);
}
}
else {
value = initializer;
}
}
else if (!value) {
// Use 'void 0' in absence of value and initializer
value = flattenContext.context.factory.createVoidZero();
}
}
if (ts.isObjectBindingOrAssignmentPattern(bindingTarget)) {
flattenObjectBindingOrAssignmentPattern(flattenContext, element, bindingTarget, value, location);
}
else if (ts.isArrayBindingOrAssignmentPattern(bindingTarget)) {
flattenArrayBindingOrAssignmentPattern(flattenContext, element, bindingTarget, value, location);
}
else {
flattenContext.emitBindingOrAssignment(bindingTarget, value, location, /*original*/ element); // TODO: GH#18217
}
}
/**
* Flattens an ObjectBindingOrAssignmentPattern into zero or more bindings or assignments.
*
* @param flattenContext Options used to control flattening.
* @param parent The parent element of the pattern.
* @param pattern The ObjectBindingOrAssignmentPattern to flatten.
* @param value The current RHS value to assign to the element.
* @param location The location to use for source maps and comments.
*/
function flattenObjectBindingOrAssignmentPattern(flattenContext, parent, pattern, value, location) {
var elements = ts.getElementsOfBindingOrAssignmentPattern(pattern);
var numElements = elements.length;
if (numElements !== 1) {
// For anything other than a single-element destructuring we need to generate a temporary
// to ensure value is evaluated exactly once. Additionally, if we have zero elements
// we need to emit *something* to ensure that in case a 'var' keyword was already emitted,
// so in that case, we'll intentionally create that temporary.
var reuseIdentifierExpressions = !ts.isDeclarationBindingElement(parent) || numElements !== 0;
value = ensureIdentifier(flattenContext, value, reuseIdentifierExpressions, location);
}
var bindingElements;
var computedTempVariables;
for (var i = 0; i < numElements; i++) {
var element = elements[i];
if (!ts.getRestIndicatorOfBindingOrAssignmentElement(element)) {
var propertyName = ts.getPropertyNameOfBindingOrAssignmentElement(element);
if (flattenContext.level >= 1 /* ObjectRest */
&& !(element.transformFlags & (16384 /* ContainsRestOrSpread */ | 32768 /* ContainsObjectRestOrSpread */))
&& !(ts.getTargetOfBindingOrAssignmentElement(element).transformFlags & (16384 /* ContainsRestOrSpread */ | 32768 /* ContainsObjectRestOrSpread */))
&& !ts.isComputedPropertyName(propertyName)) {
bindingElements = ts.append(bindingElements, ts.visitNode(element, flattenContext.visitor));
}
else {
if (bindingElements) {
flattenContext.emitBindingOrAssignment(flattenContext.createObjectBindingOrAssignmentPattern(bindingElements), value, location, pattern);
bindingElements = undefined;
}
var rhsValue = createDestructuringPropertyAccess(flattenContext, value, propertyName);
if (ts.isComputedPropertyName(propertyName)) {
computedTempVariables = ts.append(computedTempVariables, rhsValue.argumentExpression);
}
flattenBindingOrAssignmentElement(flattenContext, element, rhsValue, /*location*/ element);
}
}
else if (i === numElements - 1) {
if (bindingElements) {
flattenContext.emitBindingOrAssignment(flattenContext.createObjectBindingOrAssignmentPattern(bindingElements), value, location, pattern);
bindingElements = undefined;
}
var rhsValue = flattenContext.context.getEmitHelperFactory().createRestHelper(value, elements, computedTempVariables, pattern);
flattenBindingOrAssignmentElement(flattenContext, element, rhsValue, element);
}
}
if (bindingElements) {
flattenContext.emitBindingOrAssignment(flattenContext.createObjectBindingOrAssignmentPattern(bindingElements), value, location, pattern);
}
}
/**
* Flattens an ArrayBindingOrAssignmentPattern into zero or more bindings or assignments.
*
* @param flattenContext Options used to control flattening.
* @param parent The parent element of the pattern.
* @param pattern The ArrayBindingOrAssignmentPattern to flatten.
* @param value The current RHS value to assign to the element.
* @param location The location to use for source maps and comments.
*/
function flattenArrayBindingOrAssignmentPattern(flattenContext, parent, pattern, value, location) {
var elements = ts.getElementsOfBindingOrAssignmentPattern(pattern);
var numElements = elements.length;
if (flattenContext.level < 1 /* ObjectRest */ && flattenContext.downlevelIteration) {
// Read the elements of the iterable into an array
value = ensureIdentifier(flattenContext, ts.setTextRange(flattenContext.context.getEmitHelperFactory().createReadHelper(value, numElements > 0 && ts.getRestIndicatorOfBindingOrAssignmentElement(elements[numElements - 1])
? undefined
: numElements), location),
/*reuseIdentifierExpressions*/ false, location);
}
else if (numElements !== 1 && (flattenContext.level < 1 /* ObjectRest */ || numElements === 0)
|| ts.every(elements, ts.isOmittedExpression)) {
// For anything other than a single-element destructuring we need to generate a temporary
// to ensure value is evaluated exactly once. Additionally, if we have zero elements
// we need to emit *something* to ensure that in case a 'var' keyword was already emitted,
// so in that case, we'll intentionally create that temporary.
// Or all the elements of the binding pattern are omitted expression such as "var [,] = [1,2]",
// then we will create temporary variable.
var reuseIdentifierExpressions = !ts.isDeclarationBindingElement(parent) || numElements !== 0;
value = ensureIdentifier(flattenContext, value, reuseIdentifierExpressions, location);
}
var bindingElements;
var restContainingElements;
for (var i = 0; i < numElements; i++) {
var element = elements[i];
if (flattenContext.level >= 1 /* ObjectRest */) {
// If an array pattern contains an ObjectRest, we must cache the result so that we
// can perform the ObjectRest destructuring in a different declaration
if (element.transformFlags & 32768 /* ContainsObjectRestOrSpread */ || flattenContext.hasTransformedPriorElement && !isSimpleBindingOrAssignmentElement(element)) {
flattenContext.hasTransformedPriorElement = true;
var temp = flattenContext.context.factory.createTempVariable(/*recordTempVariable*/ undefined);
if (flattenContext.hoistTempVariables) {
flattenContext.context.hoistVariableDeclaration(temp);
}
restContainingElements = ts.append(restContainingElements, [temp, element]);
bindingElements = ts.append(bindingElements, flattenContext.createArrayBindingOrAssignmentElement(temp));
}
else {
bindingElements = ts.append(bindingElements, element);
}
}
else if (ts.isOmittedExpression(element)) {
continue;
}
else if (!ts.getRestIndicatorOfBindingOrAssignmentElement(element)) {
var rhsValue = flattenContext.context.factory.createElementAccessExpression(value, i);
flattenBindingOrAssignmentElement(flattenContext, element, rhsValue, /*location*/ element);
}
else if (i === numElements - 1) {
var rhsValue = flattenContext.context.factory.createArraySliceCall(value, i);
flattenBindingOrAssignmentElement(flattenContext, element, rhsValue, /*location*/ element);
}
}
if (bindingElements) {
flattenContext.emitBindingOrAssignment(flattenContext.createArrayBindingOrAssignmentPattern(bindingElements), value, location, pattern);
}
if (restContainingElements) {
for (var _i = 0, restContainingElements_1 = restContainingElements; _i < restContainingElements_1.length; _i++) {
var _a = restContainingElements_1[_i], id = _a[0], element = _a[1];
flattenBindingOrAssignmentElement(flattenContext, element, id, element);
}
}
}
function isSimpleBindingOrAssignmentElement(element) {
var target = ts.getTargetOfBindingOrAssignmentElement(element);
if (!target || ts.isOmittedExpression(target))
return true;
var propertyName = ts.tryGetPropertyNameOfBindingOrAssignmentElement(element);
if (propertyName && !ts.isPropertyNameLiteral(propertyName))
return false;
var initializer = ts.getInitializerOfBindingOrAssignmentElement(element);
if (initializer && !ts.isSimpleInlineableExpression(initializer))
return false;
if (ts.isBindingOrAssignmentPattern(target))
return ts.every(ts.getElementsOfBindingOrAssignmentPattern(target), isSimpleBindingOrAssignmentElement);
return ts.isIdentifier(target);
}
/**
* Creates an expression used to provide a default value if a value is `undefined` at runtime.
*
* @param flattenContext Options used to control flattening.
* @param value The RHS value to test.
* @param defaultValue The default value to use if `value` is `undefined` at runtime.
* @param location The location to use for source maps and comments.
*/
function createDefaultValueCheck(flattenContext, value, defaultValue, location) {
value = ensureIdentifier(flattenContext, value, /*reuseIdentifierExpressions*/ true, location);
return flattenContext.context.factory.createConditionalExpression(flattenContext.context.factory.createTypeCheck(value, "undefined"), /*questionToken*/ undefined, defaultValue, /*colonToken*/ undefined, value);
}
/**
* Creates either a PropertyAccessExpression or an ElementAccessExpression for the
* right-hand side of a transformed destructuring assignment.
*
* @link https://tc39.github.io/ecma262/#sec-runtime-semantics-keyeddestructuringassignmentevaluation
*
* @param flattenContext Options used to control flattening.
* @param value The RHS value that is the source of the property.
* @param propertyName The destructuring property name.
*/
function createDestructuringPropertyAccess(flattenContext, value, propertyName) {
if (ts.isComputedPropertyName(propertyName)) {
var argumentExpression = ensureIdentifier(flattenContext, ts.visitNode(propertyName.expression, flattenContext.visitor), /*reuseIdentifierExpressions*/ false, /*location*/ propertyName);
return flattenContext.context.factory.createElementAccessExpression(value, argumentExpression);
}
else if (ts.isStringOrNumericLiteralLike(propertyName)) {
var argumentExpression = ts.factory.cloneNode(propertyName);
return flattenContext.context.factory.createElementAccessExpression(value, argumentExpression);
}
else {
var name = flattenContext.context.factory.createIdentifier(ts.idText(propertyName));
return flattenContext.context.factory.createPropertyAccessExpression(value, name);
}
}
/**
* Ensures that there exists a declared identifier whose value holds the given expression.
* This function is useful to ensure that the expression's value can be read from in subsequent expressions.
* Unless 'reuseIdentifierExpressions' is false, 'value' will be returned if it is just an identifier.
*
* @param flattenContext Options used to control flattening.
* @param value the expression whose value needs to be bound.
* @param reuseIdentifierExpressions true if identifier expressions can simply be returned;
* false if it is necessary to always emit an identifier.
* @param location The location to use for source maps and comments.
*/
function ensureIdentifier(flattenContext, value, reuseIdentifierExpressions, location) {
if (ts.isIdentifier(value) && reuseIdentifierExpressions) {
return value;
}
else {
var temp = flattenContext.context.factory.createTempVariable(/*recordTempVariable*/ undefined);
if (flattenContext.hoistTempVariables) {
flattenContext.context.hoistVariableDeclaration(temp);
flattenContext.emitExpression(ts.setTextRange(flattenContext.context.factory.createAssignment(temp, value), location));
}
else {
flattenContext.emitBindingOrAssignment(temp, value, location, /*original*/ undefined);
}
return temp;
}
}
function makeArrayBindingPattern(factory, elements) {
ts.Debug.assertEachNode(elements, ts.isArrayBindingElement);
return factory.createArrayBindingPattern(elements);
}
function makeArrayAssignmentPattern(factory, elements) {
return factory.createArrayLiteralExpression(ts.map(elements, factory.converters.convertToArrayAssignmentElement));
}
function makeObjectBindingPattern(factory, elements) {
ts.Debug.assertEachNode(elements, ts.isBindingElement);
return factory.createObjectBindingPattern(elements);
}
function makeObjectAssignmentPattern(factory, elements) {
return factory.createObjectLiteralExpression(ts.map(elements, factory.converters.convertToObjectAssignmentElement));
}
function makeBindingElement(factory, name) {
return factory.createBindingElement(/*dotDotDotToken*/ undefined, /*propertyName*/ undefined, name);
}
function makeAssignmentElement(name) {
return name;
}
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
var ProcessLevel;
(function (ProcessLevel) {
ProcessLevel[ProcessLevel["LiftRestriction"] = 0] = "LiftRestriction";
ProcessLevel[ProcessLevel["All"] = 1] = "All";
})(ProcessLevel = ts.ProcessLevel || (ts.ProcessLevel = {}));
function processTaggedTemplateExpression(context, node, visitor, currentSourceFile, recordTaggedTemplateString, level) {
// Visit the tag expression
var tag = ts.visitNode(node.tag, visitor, ts.isExpression);
// Build up the template arguments and the raw and cooked strings for the template.
// We start out with 'undefined' for the first argument and revisit later
// to avoid walking over the template string twice and shifting all our arguments over after the fact.
var templateArguments = [undefined];
var cookedStrings = [];
var rawStrings = [];
var template = node.template;
if (level === ProcessLevel.LiftRestriction && !ts.hasInvalidEscape(template)) {
return ts.visitEachChild(node, visitor, context);
}
if (ts.isNoSubstitutionTemplateLiteral(template)) {
cookedStrings.push(createTemplateCooked(template));
rawStrings.push(getRawLiteral(template, currentSourceFile));
}
else {
cookedStrings.push(createTemplateCooked(template.head));
rawStrings.push(getRawLiteral(template.head, currentSourceFile));
for (var _i = 0, _a = template.templateSpans; _i < _a.length; _i++) {
var templateSpan = _a[_i];
cookedStrings.push(createTemplateCooked(templateSpan.literal));
rawStrings.push(getRawLiteral(templateSpan.literal, currentSourceFile));
templateArguments.push(ts.visitNode(templateSpan.expression, visitor, ts.isExpression));
}
}
var helperCall = context.getEmitHelperFactory().createTemplateObjectHelper(ts.factory.createArrayLiteralExpression(cookedStrings), ts.factory.createArrayLiteralExpression(rawStrings));
// Create a variable to cache the template object if we're in a module.
// Do not do this in the global scope, as any variable we currently generate could conflict with
// variables from outside of the current compilation. In the future, we can revisit this behavior.
if (ts.isExternalModule(currentSourceFile)) {
var tempVar = ts.factory.createUniqueName("templateObject");
recordTaggedTemplateString(tempVar);
templateArguments[0] = ts.factory.createLogicalOr(tempVar, ts.factory.createAssignment(tempVar, helperCall));
}
else {
templateArguments[0] = helperCall;
}
return ts.factory.createCallExpression(tag, /*typeArguments*/ undefined, templateArguments);
}
ts.processTaggedTemplateExpression = processTaggedTemplateExpression;
function createTemplateCooked(template) {
return template.templateFlags ? ts.factory.createVoidZero() : ts.factory.createStringLiteral(template.text);
}
/**
* Creates an ES5 compatible literal from an ES6 template literal.
*
* @param node The ES6 template literal.
*/
function getRawLiteral(node, currentSourceFile) {
// Find original source text, since we need to emit the raw strings of the tagged template.
// The raw strings contain the (escaped) strings of what the user wrote.
// Examples: `\n` is converted to "\\n", a template string with a newline to "\n".
var text = node.rawText;
if (text === undefined) {
ts.Debug.assertIsDefined(currentSourceFile, "Template literal node is missing 'rawText' and does not have a source file. Possibly bad transform.");
text = ts.getSourceTextOfNodeFromSourceFile(currentSourceFile, node);
// text contains the original source, it will also contain quotes ("`"), dolar signs and braces ("${" and "}"),
// thus we need to remove those characters.
// First template piece starts with "`", others with "}"
// Last template piece ends with "`", others with "${"
var isLast = node.kind === 14 /* NoSubstitutionTemplateLiteral */ || node.kind === 17 /* TemplateTail */;
text = text.substring(1, text.length - (isLast ? 1 : 2));
}
// Newline normalization:
// ES6 Spec 11.8.6.1 - Static Semantics of TV's and TRV's
// <CR><LF> and <CR> LineTerminatorSequences are normalized to <LF> for both TV and TRV.
text = text.replace(/\r\n?/g, "\n");
return ts.setTextRange(ts.factory.createStringLiteral(text), node);
}
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
/**
* Indicates whether to emit type metadata in the new format.
*/
var USE_NEW_TYPE_METADATA_FORMAT = false;
var TypeScriptSubstitutionFlags;
(function (TypeScriptSubstitutionFlags) {
/** Enables substitutions for decorated classes. */
TypeScriptSubstitutionFlags[TypeScriptSubstitutionFlags["ClassAliases"] = 1] = "ClassAliases";
/** Enables substitutions for namespace exports. */
TypeScriptSubstitutionFlags[TypeScriptSubstitutionFlags["NamespaceExports"] = 2] = "NamespaceExports";
/* Enables substitutions for unqualified enum members */
TypeScriptSubstitutionFlags[TypeScriptSubstitutionFlags["NonQualifiedEnumMembers"] = 8] = "NonQualifiedEnumMembers";
})(TypeScriptSubstitutionFlags || (TypeScriptSubstitutionFlags = {}));
var ClassFacts;
(function (ClassFacts) {
ClassFacts[ClassFacts["None"] = 0] = "None";
ClassFacts[ClassFacts["HasStaticInitializedProperties"] = 1] = "HasStaticInitializedProperties";
ClassFacts[ClassFacts["HasConstructorDecorators"] = 2] = "HasConstructorDecorators";
ClassFacts[ClassFacts["HasMemberDecorators"] = 4] = "HasMemberDecorators";
ClassFacts[ClassFacts["IsExportOfNamespace"] = 8] = "IsExportOfNamespace";
ClassFacts[ClassFacts["IsNamedExternalExport"] = 16] = "IsNamedExternalExport";
ClassFacts[ClassFacts["IsDefaultExternalExport"] = 32] = "IsDefaultExternalExport";
ClassFacts[ClassFacts["IsDerivedClass"] = 64] = "IsDerivedClass";
ClassFacts[ClassFacts["UseImmediatelyInvokedFunctionExpression"] = 128] = "UseImmediatelyInvokedFunctionExpression";
ClassFacts[ClassFacts["HasAnyDecorators"] = 6] = "HasAnyDecorators";
ClassFacts[ClassFacts["NeedsName"] = 5] = "NeedsName";
ClassFacts[ClassFacts["MayNeedImmediatelyInvokedFunctionExpression"] = 7] = "MayNeedImmediatelyInvokedFunctionExpression";
ClassFacts[ClassFacts["IsExported"] = 56] = "IsExported";
})(ClassFacts || (ClassFacts = {}));
function transformTypeScript(context) {
var factory = context.factory, emitHelpers = context.getEmitHelperFactory, startLexicalEnvironment = context.startLexicalEnvironment, resumeLexicalEnvironment = context.resumeLexicalEnvironment, endLexicalEnvironment = context.endLexicalEnvironment, hoistVariableDeclaration = context.hoistVariableDeclaration;
var resolver = context.getEmitResolver();
var compilerOptions = context.getCompilerOptions();
var strictNullChecks = ts.getStrictOptionValue(compilerOptions, "strictNullChecks");
var languageVersion = ts.getEmitScriptTarget(compilerOptions);
var moduleKind = ts.getEmitModuleKind(compilerOptions);
// Save the previous transformation hooks.
var previousOnEmitNode = context.onEmitNode;
var previousOnSubstituteNode = context.onSubstituteNode;
// Set new transformation hooks.
context.onEmitNode = onEmitNode;
context.onSubstituteNode = onSubstituteNode;
// Enable substitution for property/element access to emit const enum values.
context.enableSubstitution(204 /* PropertyAccessExpression */);
context.enableSubstitution(205 /* ElementAccessExpression */);
// These variables contain state that changes as we descend into the tree.
var currentSourceFile;
var currentNamespace;
var currentNamespaceContainerName;
var currentLexicalScope;
var currentNameScope;
var currentScopeFirstDeclarationsOfName;
var currentClassHasParameterProperties;
/**
* Keeps track of whether expression substitution has been enabled for specific edge cases.
* They are persisted between each SourceFile transformation and should not be reset.
*/
var enabledSubstitutions;
/**
* A map that keeps track of aliases created for classes with decorators to avoid issues
* with the double-binding behavior of classes.
*/
var classAliases;
/**
* Keeps track of whether we are within any containing namespaces when performing
* just-in-time substitution while printing an expression identifier.
*/
var applicableSubstitutions;
return transformSourceFileOrBundle;
function transformSourceFileOrBundle(node) {
if (node.kind === 301 /* Bundle */) {
return transformBundle(node);
}
return transformSourceFile(node);
}
function transformBundle(node) {
return factory.createBundle(node.sourceFiles.map(transformSourceFile), ts.mapDefined(node.prepends, function (prepend) {
if (prepend.kind === 303 /* InputFiles */) {
return ts.createUnparsedSourceFile(prepend, "js");
}
return prepend;
}));
}
/**
* Transform TypeScript-specific syntax in a SourceFile.
*
* @param node A SourceFile node.
*/
function transformSourceFile(node) {
if (node.isDeclarationFile) {
return node;
}
currentSourceFile = node;
var visited = saveStateAndInvoke(node, visitSourceFile);
ts.addEmitHelpers(visited, context.readEmitHelpers());
currentSourceFile = undefined;
return visited;
}
/**
* Visits a node, saving and restoring state variables on the stack.
*
* @param node The node to visit.
*/
function saveStateAndInvoke(node, f) {
// Save state
var savedCurrentScope = currentLexicalScope;
var savedCurrentNameScope = currentNameScope;
var savedCurrentScopeFirstDeclarationsOfName = currentScopeFirstDeclarationsOfName;
var savedCurrentClassHasParameterProperties = currentClassHasParameterProperties;
// Handle state changes before visiting a node.
onBeforeVisitNode(node);
var visited = f(node);
// Restore state
if (currentLexicalScope !== savedCurrentScope) {
currentScopeFirstDeclarationsOfName = savedCurrentScopeFirstDeclarationsOfName;
}
currentLexicalScope = savedCurrentScope;
currentNameScope = savedCurrentNameScope;
currentClassHasParameterProperties = savedCurrentClassHasParameterProperties;
return visited;
}
/**
* Performs actions that should always occur immediately before visiting a node.
*
* @param node The node to visit.
*/
function onBeforeVisitNode(node) {
switch (node.kind) {
case 300 /* SourceFile */:
case 261 /* CaseBlock */:
case 260 /* ModuleBlock */:
case 233 /* Block */:
currentLexicalScope = node;
currentNameScope = undefined;
currentScopeFirstDeclarationsOfName = undefined;
break;
case 255 /* ClassDeclaration */:
case 254 /* FunctionDeclaration */:
if (ts.hasSyntacticModifier(node, 2 /* Ambient */)) {
break;
}
// Record these declarations provided that they have a name.
if (node.name) {
recordEmittedDeclarationInScope(node);
}
else {
// These nodes should always have names unless they are default-exports;
// however, class declaration parsing allows for undefined names, so syntactically invalid
// programs may also have an undefined name.
ts.Debug.assert(node.kind === 255 /* ClassDeclaration */ || ts.hasSyntacticModifier(node, 512 /* Default */));
}
if (ts.isClassDeclaration(node)) {
// XXX: should probably also cover interfaces and type aliases that can have type variables?
currentNameScope = node;
}
break;
}
}
/**
* General-purpose node visitor.
*
* @param node The node to visit.
*/
function visitor(node) {
return saveStateAndInvoke(node, visitorWorker);
}
/**
* Visits and possibly transforms any node.
*
* @param node The node to visit.
*/
function visitorWorker(node) {
if (node.transformFlags & 1 /* ContainsTypeScript */) {
return visitTypeScript(node);
}
return node;
}
/**
* Specialized visitor that visits the immediate children of a SourceFile.
*
* @param node The node to visit.
*/
function sourceElementVisitor(node) {
return saveStateAndInvoke(node, sourceElementVisitorWorker);
}
/**
* Specialized visitor that visits the immediate children of a SourceFile.
*
* @param node The node to visit.
*/
function sourceElementVisitorWorker(node) {
switch (node.kind) {
case 264 /* ImportDeclaration */:
case 263 /* ImportEqualsDeclaration */:
case 269 /* ExportAssignment */:
case 270 /* ExportDeclaration */:
return visitElidableStatement(node);
default:
return visitorWorker(node);
}
}
function visitElidableStatement(node) {
var parsed = ts.getParseTreeNode(node);
if (parsed !== node) {
// If the node has been transformed by a `before` transformer, perform no ellision on it
// As the type information we would attempt to lookup to perform ellision is potentially unavailable for the synthesized nodes
// We do not reuse `visitorWorker`, as the ellidable statement syntax kinds are technically unrecognized by the switch-case in `visitTypeScript`,
// and will trigger debug failures when debug verbosity is turned up
if (node.transformFlags & 1 /* ContainsTypeScript */) {
// This node contains TypeScript, so we should visit its children.
return ts.visitEachChild(node, visitor, context);
}
// Otherwise, we can just return the node
return node;
}
switch (node.kind) {
case 264 /* ImportDeclaration */:
return visitImportDeclaration(node);
case 263 /* ImportEqualsDeclaration */:
return visitImportEqualsDeclaration(node);
case 269 /* ExportAssignment */:
return visitExportAssignment(node);
case 270 /* ExportDeclaration */:
return visitExportDeclaration(node);
default:
ts.Debug.fail("Unhandled ellided statement");
}
}
/**
* Specialized visitor that visits the immediate children of a namespace.
*
* @param node The node to visit.
*/
function namespaceElementVisitor(node) {
return saveStateAndInvoke(node, namespaceElementVisitorWorker);
}
/**
* Specialized visitor that visits the immediate children of a namespace.
*
* @param node The node to visit.
*/
function namespaceElementVisitorWorker(node) {
if (node.kind === 270 /* ExportDeclaration */ ||
node.kind === 264 /* ImportDeclaration */ ||
node.kind === 265 /* ImportClause */ ||
(node.kind === 263 /* ImportEqualsDeclaration */ &&
node.moduleReference.kind === 275 /* ExternalModuleReference */)) {
// do not emit ES6 imports and exports since they are illegal inside a namespace
return undefined;
}
else if (node.transformFlags & 1 /* ContainsTypeScript */ || ts.hasSyntacticModifier(node, 1 /* Export */)) {
return visitTypeScript(node);
}
return node;
}
/**
* Specialized visitor that visits the immediate children of a class with TypeScript syntax.
*
* @param node The node to visit.
*/
function classElementVisitor(node) {
return saveStateAndInvoke(node, classElementVisitorWorker);
}
/**
* Specialized visitor that visits the immediate children of a class with TypeScript syntax.
*
* @param node The node to visit.
*/
function classElementVisitorWorker(node) {
switch (node.kind) {
case 169 /* Constructor */:
return visitConstructor(node);
case 165 /* PropertyDeclaration */:
// Property declarations are not TypeScript syntax, but they must be visited
// for the decorator transformation.
return visitPropertyDeclaration(node);
case 174 /* IndexSignature */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 167 /* MethodDeclaration */:
case 168 /* ClassStaticBlockDeclaration */:
// Fallback to the default visit behavior.
return visitorWorker(node);
case 232 /* SemicolonClassElement */:
return node;
default:
return ts.Debug.failBadSyntaxKind(node);
}
}
function modifierVisitor(node) {
if (ts.modifierToFlag(node.kind) & 18654 /* TypeScriptModifier */) {
return undefined;
}
else if (currentNamespace && node.kind === 93 /* ExportKeyword */) {
return undefined;
}
return node;
}
/**
* Branching visitor, visits a TypeScript syntax node.
*
* @param node The node to visit.
*/
function visitTypeScript(node) {
if (ts.isStatement(node) && ts.hasSyntacticModifier(node, 2 /* Ambient */)) {
// TypeScript ambient declarations are elided, but some comments may be preserved.
// See the implementation of `getLeadingComments` in comments.ts for more details.
return factory.createNotEmittedStatement(node);
}
switch (node.kind) {
case 93 /* ExportKeyword */:
case 88 /* DefaultKeyword */:
// ES6 export and default modifiers are elided when inside a namespace.
return currentNamespace ? undefined : node;
case 123 /* PublicKeyword */:
case 121 /* PrivateKeyword */:
case 122 /* ProtectedKeyword */:
case 126 /* AbstractKeyword */:
case 157 /* OverrideKeyword */:
case 85 /* ConstKeyword */:
case 134 /* DeclareKeyword */:
case 143 /* ReadonlyKeyword */:
// TypeScript accessibility and readonly modifiers are elided
// falls through
case 181 /* ArrayType */:
case 182 /* TupleType */:
case 183 /* OptionalType */:
case 184 /* RestType */:
case 180 /* TypeLiteral */:
case 175 /* TypePredicate */:
case 161 /* TypeParameter */:
case 129 /* AnyKeyword */:
case 153 /* UnknownKeyword */:
case 132 /* BooleanKeyword */:
case 148 /* StringKeyword */:
case 145 /* NumberKeyword */:
case 142 /* NeverKeyword */:
case 114 /* VoidKeyword */:
case 149 /* SymbolKeyword */:
case 178 /* ConstructorType */:
case 177 /* FunctionType */:
case 179 /* TypeQuery */:
case 176 /* TypeReference */:
case 185 /* UnionType */:
case 186 /* IntersectionType */:
case 187 /* ConditionalType */:
case 189 /* ParenthesizedType */:
case 190 /* ThisType */:
case 191 /* TypeOperator */:
case 192 /* IndexedAccessType */:
case 193 /* MappedType */:
case 194 /* LiteralType */:
// TypeScript type nodes are elided.
// falls through
case 174 /* IndexSignature */:
// TypeScript index signatures are elided.
// falls through
case 163 /* Decorator */:
// TypeScript decorators are elided. They will be emitted as part of visitClassDeclaration.
return undefined;
case 257 /* TypeAliasDeclaration */:
// TypeScript type-only declarations are elided.
return factory.createNotEmittedStatement(node);
case 165 /* PropertyDeclaration */:
// TypeScript property declarations are elided. However their names are still visited, and can potentially be retained if they could have sideeffects
return visitPropertyDeclaration(node);
case 262 /* NamespaceExportDeclaration */:
// TypeScript namespace export declarations are elided.
return undefined;
case 169 /* Constructor */:
return visitConstructor(node);
case 256 /* InterfaceDeclaration */:
// TypeScript interfaces are elided, but some comments may be preserved.
// See the implementation of `getLeadingComments` in comments.ts for more details.
return factory.createNotEmittedStatement(node);
case 255 /* ClassDeclaration */:
// This may be a class declaration with TypeScript syntax extensions.
//
// TypeScript class syntax extensions include:
// - decorators
// - optional `implements` heritage clause
// - parameter property assignments in the constructor
// - index signatures
// - method overload signatures
return visitClassDeclaration(node);
case 224 /* ClassExpression */:
// This may be a class expression with TypeScript syntax extensions.
//
// TypeScript class syntax extensions include:
// - decorators
// - optional `implements` heritage clause
// - parameter property assignments in the constructor
// - index signatures
// - method overload signatures
return visitClassExpression(node);
case 289 /* HeritageClause */:
// This may be a heritage clause with TypeScript syntax extensions.
//
// TypeScript heritage clause extensions include:
// - `implements` clause
return visitHeritageClause(node);
case 226 /* ExpressionWithTypeArguments */:
// TypeScript supports type arguments on an expression in an `extends` heritage clause.
return visitExpressionWithTypeArguments(node);
case 167 /* MethodDeclaration */:
// TypeScript method declarations may have decorators, modifiers
// or type annotations.
return visitMethodDeclaration(node);
case 170 /* GetAccessor */:
// Get Accessors can have TypeScript modifiers, decorators, and type annotations.
return visitGetAccessor(node);
case 171 /* SetAccessor */:
// Set Accessors can have TypeScript modifiers and type annotations.
return visitSetAccessor(node);
case 254 /* FunctionDeclaration */:
// Typescript function declarations can have modifiers, decorators, and type annotations.
return visitFunctionDeclaration(node);
case 211 /* FunctionExpression */:
// TypeScript function expressions can have modifiers and type annotations.
return visitFunctionExpression(node);
case 212 /* ArrowFunction */:
// TypeScript arrow functions can have modifiers and type annotations.
return visitArrowFunction(node);
case 162 /* Parameter */:
// This may be a parameter declaration with TypeScript syntax extensions.
//
// TypeScript parameter declaration syntax extensions include:
// - decorators
// - accessibility modifiers
// - the question mark (?) token for optional parameters
// - type annotations
// - this parameters
return visitParameter(node);
case 210 /* ParenthesizedExpression */:
// ParenthesizedExpressions are TypeScript if their expression is a
// TypeAssertion or AsExpression
return visitParenthesizedExpression(node);
case 209 /* TypeAssertionExpression */:
case 227 /* AsExpression */:
// TypeScript type assertions are removed, but their subtrees are preserved.
return visitAssertionExpression(node);
case 206 /* CallExpression */:
return visitCallExpression(node);
case 207 /* NewExpression */:
return visitNewExpression(node);
case 208 /* TaggedTemplateExpression */:
return visitTaggedTemplateExpression(node);
case 228 /* NonNullExpression */:
// TypeScript non-null expressions are removed, but their subtrees are preserved.
return visitNonNullExpression(node);
case 258 /* EnumDeclaration */:
// TypeScript enum declarations do not exist in ES6 and must be rewritten.
return visitEnumDeclaration(node);
case 235 /* VariableStatement */:
// TypeScript namespace exports for variable statements must be transformed.
return visitVariableStatement(node);
case 252 /* VariableDeclaration */:
return visitVariableDeclaration(node);
case 259 /* ModuleDeclaration */:
// TypeScript namespace declarations must be transformed.
return visitModuleDeclaration(node);
case 263 /* ImportEqualsDeclaration */:
// TypeScript namespace or external module import.
return visitImportEqualsDeclaration(node);
case 277 /* JsxSelfClosingElement */:
return visitJsxSelfClosingElement(node);
case 278 /* JsxOpeningElement */:
return visitJsxJsxOpeningElement(node);
default:
// node contains some other TypeScript syntax
return ts.visitEachChild(node, visitor, context);
}
}
function visitSourceFile(node) {
var alwaysStrict = ts.getStrictOptionValue(compilerOptions, "alwaysStrict") &&
!(ts.isExternalModule(node) && moduleKind >= ts.ModuleKind.ES2015) &&
!ts.isJsonSourceFile(node);
return factory.updateSourceFile(node, ts.visitLexicalEnvironment(node.statements, sourceElementVisitor, context, /*start*/ 0, alwaysStrict));
}
function getClassFacts(node, staticProperties) {
var facts = 0 /* None */;
if (ts.some(staticProperties))
facts |= 1 /* HasStaticInitializedProperties */;
var extendsClauseElement = ts.getEffectiveBaseTypeNode(node);
if (extendsClauseElement && ts.skipOuterExpressions(extendsClauseElement.expression).kind !== 104 /* NullKeyword */)
facts |= 64 /* IsDerivedClass */;
if (ts.classOrConstructorParameterIsDecorated(node))
facts |= 2 /* HasConstructorDecorators */;
if (ts.childIsDecorated(node))
facts |= 4 /* HasMemberDecorators */;
if (isExportOfNamespace(node))
facts |= 8 /* IsExportOfNamespace */;
else if (isDefaultExternalModuleExport(node))
facts |= 32 /* IsDefaultExternalExport */;
else if (isNamedExternalModuleExport(node))
facts |= 16 /* IsNamedExternalExport */;
if (languageVersion <= 1 /* ES5 */ && (facts & 7 /* MayNeedImmediatelyInvokedFunctionExpression */))
facts |= 128 /* UseImmediatelyInvokedFunctionExpression */;
return facts;
}
function hasTypeScriptClassSyntax(node) {
return !!(node.transformFlags & 4096 /* ContainsTypeScriptClassSyntax */);
}
function isClassLikeDeclarationWithTypeScriptSyntax(node) {
return ts.some(node.decorators)
|| ts.some(node.typeParameters)
|| ts.some(node.heritageClauses, hasTypeScriptClassSyntax)
|| ts.some(node.members, hasTypeScriptClassSyntax);
}
function visitClassDeclaration(node) {
if (!isClassLikeDeclarationWithTypeScriptSyntax(node) && !(currentNamespace && ts.hasSyntacticModifier(node, 1 /* Export */))) {
return ts.visitEachChild(node, visitor, context);
}
var staticProperties = ts.getProperties(node, /*requireInitializer*/ true, /*isStatic*/ true);
var facts = getClassFacts(node, staticProperties);
if (facts & 128 /* UseImmediatelyInvokedFunctionExpression */) {
context.startLexicalEnvironment();
}
var name = node.name || (facts & 5 /* NeedsName */ ? factory.getGeneratedNameForNode(node) : undefined);
var classStatement = facts & 2 /* HasConstructorDecorators */
? createClassDeclarationHeadWithDecorators(node, name)
: createClassDeclarationHeadWithoutDecorators(node, name, facts);
var statements = [classStatement];
// Write any decorators of the node.
addClassElementDecorationStatements(statements, node, /*isStatic*/ false);
addClassElementDecorationStatements(statements, node, /*isStatic*/ true);
addConstructorDecorationStatement(statements, node);
if (facts & 128 /* UseImmediatelyInvokedFunctionExpression */) {
// When we emit a TypeScript class down to ES5, we must wrap it in an IIFE so that the
// 'es2015' transformer can properly nest static initializers and decorators. The result
// looks something like:
//
// var C = function () {
// class C {
// }
// C.static_prop = 1;
// return C;
// }();
//
var closingBraceLocation = ts.createTokenRange(ts.skipTrivia(currentSourceFile.text, node.members.end), 19 /* CloseBraceToken */);
var localName = factory.getInternalName(node);
// The following partially-emitted expression exists purely to align our sourcemap
// emit with the original emitter.
var outer = factory.createPartiallyEmittedExpression(localName);
ts.setTextRangeEnd(outer, closingBraceLocation.end);
ts.setEmitFlags(outer, 1536 /* NoComments */);
var statement = factory.createReturnStatement(outer);
ts.setTextRangePos(statement, closingBraceLocation.pos);
ts.setEmitFlags(statement, 1536 /* NoComments */ | 384 /* NoTokenSourceMaps */);
statements.push(statement);
ts.insertStatementsAfterStandardPrologue(statements, context.endLexicalEnvironment());
var iife = factory.createImmediatelyInvokedArrowFunction(statements);
ts.setEmitFlags(iife, 33554432 /* TypeScriptClassWrapper */);
var varStatement = factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList([
factory.createVariableDeclaration(factory.getLocalName(node, /*allowComments*/ false, /*allowSourceMaps*/ false),
/*exclamationToken*/ undefined,
/*type*/ undefined, iife)
]));
ts.setOriginalNode(varStatement, node);
ts.setCommentRange(varStatement, node);
ts.setSourceMapRange(varStatement, ts.moveRangePastDecorators(node));
ts.startOnNewLine(varStatement);
statements = [varStatement];
}
// If the class is exported as part of a TypeScript namespace, emit the namespace export.
// Otherwise, if the class was exported at the top level and was decorated, emit an export
// declaration or export default for the class.
if (facts & 8 /* IsExportOfNamespace */) {
addExportMemberAssignment(statements, node);
}
else if (facts & 128 /* UseImmediatelyInvokedFunctionExpression */ || facts & 2 /* HasConstructorDecorators */) {
if (facts & 32 /* IsDefaultExternalExport */) {
statements.push(factory.createExportDefault(factory.getLocalName(node, /*allowComments*/ false, /*allowSourceMaps*/ true)));
}
else if (facts & 16 /* IsNamedExternalExport */) {
statements.push(factory.createExternalModuleExport(factory.getLocalName(node, /*allowComments*/ false, /*allowSourceMaps*/ true)));
}
}
if (statements.length > 1) {
// Add a DeclarationMarker as a marker for the end of the declaration
statements.push(factory.createEndOfDeclarationMarker(node));
ts.setEmitFlags(classStatement, ts.getEmitFlags(classStatement) | 4194304 /* HasEndOfDeclarationMarker */);
}
return ts.singleOrMany(statements);
}
/**
* Transforms a non-decorated class declaration and appends the resulting statements.
*
* @param node A ClassDeclaration node.
* @param name The name of the class.
* @param facts Precomputed facts about the class.
*/
function createClassDeclarationHeadWithoutDecorators(node, name, facts) {
// ${modifiers} class ${name} ${heritageClauses} {
// ${members}
// }
// we do not emit modifiers on the declaration if we are emitting an IIFE
var modifiers = !(facts & 128 /* UseImmediatelyInvokedFunctionExpression */)
? ts.visitNodes(node.modifiers, modifierVisitor, ts.isModifier)
: undefined;
var classDeclaration = factory.createClassDeclaration(
/*decorators*/ undefined, modifiers, name,
/*typeParameters*/ undefined, ts.visitNodes(node.heritageClauses, visitor, ts.isHeritageClause), transformClassMembers(node));
// To better align with the old emitter, we should not emit a trailing source map
// entry if the class has static properties.
var emitFlags = ts.getEmitFlags(node);
if (facts & 1 /* HasStaticInitializedProperties */) {
emitFlags |= 32 /* NoTrailingSourceMap */;
}
ts.setTextRange(classDeclaration, node);
ts.setOriginalNode(classDeclaration, node);
ts.setEmitFlags(classDeclaration, emitFlags);
return classDeclaration;
}
/**
* Transforms a decorated class declaration and appends the resulting statements. If
* the class requires an alias to avoid issues with double-binding, the alias is returned.
*/
function createClassDeclarationHeadWithDecorators(node, name) {
// When we emit an ES6 class that has a class decorator, we must tailor the
// emit to certain specific cases.
//
// In the simplest case, we emit the class declaration as a let declaration, and
// evaluate decorators after the close of the class body:
//
// [Example 1]
// ---------------------------------------------------------------------
// TypeScript | Javascript
// ---------------------------------------------------------------------
// @dec | let C = class C {
// class C { | }
// } | C = __decorate([dec], C);
// ---------------------------------------------------------------------
// @dec | let C = class C {
// export class C { | }
// } | C = __decorate([dec], C);
// | export { C };
// ---------------------------------------------------------------------
//
// If a class declaration contains a reference to itself *inside* of the class body,
// this introduces two bindings to the class: One outside of the class body, and one
// inside of the class body. If we apply decorators as in [Example 1] above, there
// is the possibility that the decorator `dec` will return a new value for the
// constructor, which would result in the binding inside of the class no longer
// pointing to the same reference as the binding outside of the class.
//
// As a result, we must instead rewrite all references to the class *inside* of the
// class body to instead point to a local temporary alias for the class:
//
// [Example 2]
// ---------------------------------------------------------------------
// TypeScript | Javascript
// ---------------------------------------------------------------------
// @dec | let C = C_1 = class C {
// class C { | static x() { return C_1.y; }
// static x() { return C.y; } | }
// static y = 1; | C.y = 1;
// } | C = C_1 = __decorate([dec], C);
// | var C_1;
// ---------------------------------------------------------------------
// @dec | let C = class C {
// export class C { | static x() { return C_1.y; }
// static x() { return C.y; } | }
// static y = 1; | C.y = 1;
// } | C = C_1 = __decorate([dec], C);
// | export { C };
// | var C_1;
// ---------------------------------------------------------------------
//
// If a class declaration is the default export of a module, we instead emit
// the export after the decorated declaration:
//
// [Example 3]
// ---------------------------------------------------------------------
// TypeScript | Javascript
// ---------------------------------------------------------------------
// @dec | let default_1 = class {
// export default class { | }
// } | default_1 = __decorate([dec], default_1);
// | export default default_1;
// ---------------------------------------------------------------------
// @dec | let C = class C {
// export default class C { | }
// } | C = __decorate([dec], C);
// | export default C;
// ---------------------------------------------------------------------
//
// If the class declaration is the default export and a reference to itself
// inside of the class body, we must emit both an alias for the class *and*
// move the export after the declaration:
//
// [Example 4]
// ---------------------------------------------------------------------
// TypeScript | Javascript
// ---------------------------------------------------------------------
// @dec | let C = class C {
// export default class C { | static x() { return C_1.y; }
// static x() { return C.y; } | }
// static y = 1; | C.y = 1;
// } | C = C_1 = __decorate([dec], C);
// | export default C;
// | var C_1;
// ---------------------------------------------------------------------
//
var location = ts.moveRangePastDecorators(node);
var classAlias = getClassAliasIfNeeded(node);
// When we transform to ES5/3 this will be moved inside an IIFE and should reference the name
// without any block-scoped variable collision handling
var declName = languageVersion <= 2 /* ES2015 */ ?
factory.getInternalName(node, /*allowComments*/ false, /*allowSourceMaps*/ true) :
factory.getLocalName(node, /*allowComments*/ false, /*allowSourceMaps*/ true);
// ... = class ${name} ${heritageClauses} {
// ${members}
// }
var heritageClauses = ts.visitNodes(node.heritageClauses, visitor, ts.isHeritageClause);
var members = transformClassMembers(node);
var classExpression = factory.createClassExpression(/*decorators*/ undefined, /*modifiers*/ undefined, name, /*typeParameters*/ undefined, heritageClauses, members);
ts.setOriginalNode(classExpression, node);
ts.setTextRange(classExpression, location);
// let ${name} = ${classExpression} where name is either declaredName if the class doesn't contain self-reference
// or decoratedClassAlias if the class contain self-reference.
var statement = factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList([
factory.createVariableDeclaration(declName,
/*exclamationToken*/ undefined,
/*type*/ undefined, classAlias ? factory.createAssignment(classAlias, classExpression) : classExpression)
], 1 /* Let */));
ts.setOriginalNode(statement, node);
ts.setTextRange(statement, location);
ts.setCommentRange(statement, node);
return statement;
}
function visitClassExpression(node) {
if (!isClassLikeDeclarationWithTypeScriptSyntax(node)) {
return ts.visitEachChild(node, visitor, context);
}
var classExpression = factory.createClassExpression(
/*decorators*/ undefined,
/*modifiers*/ undefined, node.name,
/*typeParameters*/ undefined, ts.visitNodes(node.heritageClauses, visitor, ts.isHeritageClause), transformClassMembers(node));
ts.setOriginalNode(classExpression, node);
ts.setTextRange(classExpression, node);
return classExpression;
}
/**
* Transforms the members of a class.
*
* @param node The current class.
*/
function transformClassMembers(node) {
var members = [];
var constructor = ts.getFirstConstructorWithBody(node);
var parametersWithPropertyAssignments = constructor &&
ts.filter(constructor.parameters, function (p) { return ts.isParameterPropertyDeclaration(p, constructor); });
if (parametersWithPropertyAssignments) {
for (var _i = 0, parametersWithPropertyAssignments_1 = parametersWithPropertyAssignments; _i < parametersWithPropertyAssignments_1.length; _i++) {
var parameter = parametersWithPropertyAssignments_1[_i];
if (ts.isIdentifier(parameter.name)) {
members.push(ts.setOriginalNode(factory.createPropertyDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, parameter.name,
/*questionOrExclamationToken*/ undefined,
/*type*/ undefined,
/*initializer*/ undefined), parameter));
}
}
}
ts.addRange(members, ts.visitNodes(node.members, classElementVisitor, ts.isClassElement));
return ts.setTextRange(factory.createNodeArray(members), /*location*/ node.members);
}
/**
* Gets either the static or instance members of a class that are decorated, or have
* parameters that are decorated.
*
* @param node The class containing the member.
* @param isStatic A value indicating whether to retrieve static or instance members of
* the class.
*/
function getDecoratedClassElements(node, isStatic) {
return ts.filter(node.members, isStatic ? function (m) { return isStaticDecoratedClassElement(m, node); } : function (m) { return isInstanceDecoratedClassElement(m, node); });
}
/**
* Determines whether a class member is a static member of a class that is decorated, or
* has parameters that are decorated.
*
* @param member The class member.
*/
function isStaticDecoratedClassElement(member, parent) {
return isDecoratedClassElement(member, /*isStaticElement*/ true, parent);
}
/**
* Determines whether a class member is an instance member of a class that is decorated,
* or has parameters that are decorated.
*
* @param member The class member.
*/
function isInstanceDecoratedClassElement(member, parent) {
return isDecoratedClassElement(member, /*isStaticElement*/ false, parent);
}
/**
* Determines whether a class member is either a static or an instance member of a class
* that is decorated, or has parameters that are decorated.
*
* @param member The class member.
*/
function isDecoratedClassElement(member, isStaticElement, parent) {
return ts.nodeOrChildIsDecorated(member, parent)
&& isStaticElement === ts.isStatic(member);
}
/**
* Gets an array of arrays of decorators for the parameters of a function-like node.
* The offset into the result array should correspond to the offset of the parameter.
*
* @param node The function-like node.
*/
function getDecoratorsOfParameters(node) {
var decorators;
if (node) {
var parameters = node.parameters;
var firstParameterIsThis = parameters.length > 0 && ts.parameterIsThisKeyword(parameters[0]);
var firstParameterOffset = firstParameterIsThis ? 1 : 0;
var numParameters = firstParameterIsThis ? parameters.length - 1 : parameters.length;
for (var i = 0; i < numParameters; i++) {
var parameter = parameters[i + firstParameterOffset];
if (decorators || parameter.decorators) {
if (!decorators) {
decorators = new Array(numParameters);
}
decorators[i] = parameter.decorators;
}
}
}
return decorators;
}
/**
* Gets an AllDecorators object containing the decorators for the class and the decorators for the
* parameters of the constructor of the class.
*
* @param node The class node.
*/
function getAllDecoratorsOfConstructor(node) {
var decorators = node.decorators;
var parameters = getDecoratorsOfParameters(ts.getFirstConstructorWithBody(node));
if (!decorators && !parameters) {
return undefined;
}
return {
decorators: decorators,
parameters: parameters
};
}
/**
* Gets an AllDecorators object containing the decorators for the member and its parameters.
*
* @param node The class node that contains the member.
* @param member The class member.
*/
function getAllDecoratorsOfClassElement(node, member) {
switch (member.kind) {
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return getAllDecoratorsOfAccessors(node, member);
case 167 /* MethodDeclaration */:
return getAllDecoratorsOfMethod(member);
case 165 /* PropertyDeclaration */:
return getAllDecoratorsOfProperty(member);
default:
return undefined;
}
}
/**
* Gets an AllDecorators object containing the decorators for the accessor and its parameters.
*
* @param node The class node that contains the accessor.
* @param accessor The class accessor member.
*/
function getAllDecoratorsOfAccessors(node, accessor) {
if (!accessor.body) {
return undefined;
}
var _a = ts.getAllAccessorDeclarations(node.members, accessor), firstAccessor = _a.firstAccessor, secondAccessor = _a.secondAccessor, setAccessor = _a.setAccessor;
var firstAccessorWithDecorators = firstAccessor.decorators ? firstAccessor : secondAccessor && secondAccessor.decorators ? secondAccessor : undefined;
if (!firstAccessorWithDecorators || accessor !== firstAccessorWithDecorators) {
return undefined;
}
var decorators = firstAccessorWithDecorators.decorators;
var parameters = getDecoratorsOfParameters(setAccessor);
if (!decorators && !parameters) {
return undefined;
}
return { decorators: decorators, parameters: parameters };
}
/**
* Gets an AllDecorators object containing the decorators for the method and its parameters.
*
* @param method The class method member.
*/
function getAllDecoratorsOfMethod(method) {
if (!method.body) {
return undefined;
}
var decorators = method.decorators;
var parameters = getDecoratorsOfParameters(method);
if (!decorators && !parameters) {
return undefined;
}
return { decorators: decorators, parameters: parameters };
}
/**
* Gets an AllDecorators object containing the decorators for the property.
*
* @param property The class property member.
*/
function getAllDecoratorsOfProperty(property) {
var decorators = property.decorators;
if (!decorators) {
return undefined;
}
return { decorators: decorators };
}
/**
* Transforms all of the decorators for a declaration into an array of expressions.
*
* @param node The declaration node.
* @param allDecorators An object containing all of the decorators for the declaration.
*/
function transformAllDecoratorsOfDeclaration(node, container, allDecorators) {
if (!allDecorators) {
return undefined;
}
var decoratorExpressions = [];
ts.addRange(decoratorExpressions, ts.map(allDecorators.decorators, transformDecorator));
ts.addRange(decoratorExpressions, ts.flatMap(allDecorators.parameters, transformDecoratorsOfParameter));
addTypeMetadata(node, container, decoratorExpressions);
return decoratorExpressions;
}
/**
* Generates statements used to apply decorators to either the static or instance members
* of a class.
*
* @param node The class node.
* @param isStatic A value indicating whether to generate statements for static or
* instance members.
*/
function addClassElementDecorationStatements(statements, node, isStatic) {
ts.addRange(statements, ts.map(generateClassElementDecorationExpressions(node, isStatic), expressionToStatement));
}
/**
* Generates expressions used to apply decorators to either the static or instance members
* of a class.
*
* @param node The class node.
* @param isStatic A value indicating whether to generate expressions for static or
* instance members.
*/
function generateClassElementDecorationExpressions(node, isStatic) {
var members = getDecoratedClassElements(node, isStatic);
var expressions;
for (var _i = 0, members_6 = members; _i < members_6.length; _i++) {
var member = members_6[_i];
var expression = generateClassElementDecorationExpression(node, member);
if (expression) {
if (!expressions) {
expressions = [expression];
}
else {
expressions.push(expression);
}
}
}
return expressions;
}
/**
* Generates an expression used to evaluate class element decorators at runtime.
*
* @param node The class node that contains the member.
* @param member The class member.
*/
function generateClassElementDecorationExpression(node, member) {
var allDecorators = getAllDecoratorsOfClassElement(node, member);
var decoratorExpressions = transformAllDecoratorsOfDeclaration(member, node, allDecorators);
if (!decoratorExpressions) {
return undefined;
}
// Emit the call to __decorate. Given the following:
//
// class C {
// @dec method(@dec2 x) {}
// @dec get accessor() {}
// @dec prop;
// }
//
// The emit for a method is:
//
// __decorate([
// dec,
// __param(0, dec2),
// __metadata("design:type", Function),
// __metadata("design:paramtypes", [Object]),
// __metadata("design:returntype", void 0)
// ], C.prototype, "method", null);
//
// The emit for an accessor is:
//
// __decorate([
// dec
// ], C.prototype, "accessor", null);
//
// The emit for a property is:
//
// __decorate([
// dec
// ], C.prototype, "prop");
//
var prefix = getClassMemberPrefix(node, member);
var memberName = getExpressionForPropertyName(member, /*generateNameForComputedPropertyName*/ true);
var descriptor = languageVersion > 0 /* ES3 */
? member.kind === 165 /* PropertyDeclaration */
// We emit `void 0` here to indicate to `__decorate` that it can invoke `Object.defineProperty` directly, but that it
// should not invoke `Object.getOwnPropertyDescriptor`.
? factory.createVoidZero()
// We emit `null` here to indicate to `__decorate` that it can invoke `Object.getOwnPropertyDescriptor` directly.
// We have this extra argument here so that we can inject an explicit property descriptor at a later date.
: factory.createNull()
: undefined;
var helper = emitHelpers().createDecorateHelper(decoratorExpressions, prefix, memberName, descriptor);
ts.setTextRange(helper, ts.moveRangePastDecorators(member));
ts.setEmitFlags(helper, 1536 /* NoComments */);
return helper;
}
/**
* Generates a __decorate helper call for a class constructor.
*
* @param node The class node.
*/
function addConstructorDecorationStatement(statements, node) {
var expression = generateConstructorDecorationExpression(node);
if (expression) {
statements.push(ts.setOriginalNode(factory.createExpressionStatement(expression), node));
}
}
/**
* Generates a __decorate helper call for a class constructor.
*
* @param node The class node.
*/
function generateConstructorDecorationExpression(node) {
var allDecorators = getAllDecoratorsOfConstructor(node);
var decoratorExpressions = transformAllDecoratorsOfDeclaration(node, node, allDecorators);
if (!decoratorExpressions) {
return undefined;
}
var classAlias = classAliases && classAliases[ts.getOriginalNodeId(node)];
// When we transform to ES5/3 this will be moved inside an IIFE and should reference the name
// without any block-scoped variable collision handling
var localName = languageVersion <= 2 /* ES2015 */ ?
factory.getInternalName(node, /*allowComments*/ false, /*allowSourceMaps*/ true) :
factory.getLocalName(node, /*allowComments*/ false, /*allowSourceMaps*/ true);
var decorate = emitHelpers().createDecorateHelper(decoratorExpressions, localName);
var expression = factory.createAssignment(localName, classAlias ? factory.createAssignment(classAlias, decorate) : decorate);
ts.setEmitFlags(expression, 1536 /* NoComments */);
ts.setSourceMapRange(expression, ts.moveRangePastDecorators(node));
return expression;
}
/**
* Transforms a decorator into an expression.
*
* @param decorator The decorator node.
*/
function transformDecorator(decorator) {
return ts.visitNode(decorator.expression, visitor, ts.isExpression);
}
/**
* Transforms the decorators of a parameter.
*
* @param decorators The decorators for the parameter at the provided offset.
* @param parameterOffset The offset of the parameter.
*/
function transformDecoratorsOfParameter(decorators, parameterOffset) {
var expressions;
if (decorators) {
expressions = [];
for (var _i = 0, decorators_1 = decorators; _i < decorators_1.length; _i++) {
var decorator = decorators_1[_i];
var helper = emitHelpers().createParamHelper(transformDecorator(decorator), parameterOffset);
ts.setTextRange(helper, decorator.expression);
ts.setEmitFlags(helper, 1536 /* NoComments */);
expressions.push(helper);
}
}
return expressions;
}
/**
* Adds optional type metadata for a declaration.
*
* @param node The declaration node.
* @param decoratorExpressions The destination array to which to add new decorator expressions.
*/
function addTypeMetadata(node, container, decoratorExpressions) {
if (USE_NEW_TYPE_METADATA_FORMAT) {
addNewTypeMetadata(node, container, decoratorExpressions);
}
else {
addOldTypeMetadata(node, container, decoratorExpressions);
}
}
function addOldTypeMetadata(node, container, decoratorExpressions) {
if (compilerOptions.emitDecoratorMetadata) {
if (shouldAddTypeMetadata(node)) {
decoratorExpressions.push(emitHelpers().createMetadataHelper("design:type", serializeTypeOfNode(node)));
}
if (shouldAddParamTypesMetadata(node)) {
decoratorExpressions.push(emitHelpers().createMetadataHelper("design:paramtypes", serializeParameterTypesOfNode(node, container)));
}
if (shouldAddReturnTypeMetadata(node)) {
decoratorExpressions.push(emitHelpers().createMetadataHelper("design:returntype", serializeReturnTypeOfNode(node)));
}
}
}
function addNewTypeMetadata(node, container, decoratorExpressions) {
if (compilerOptions.emitDecoratorMetadata) {
var properties = void 0;
if (shouldAddTypeMetadata(node)) {
(properties || (properties = [])).push(factory.createPropertyAssignment("type", factory.createArrowFunction(/*modifiers*/ undefined, /*typeParameters*/ undefined, [], /*type*/ undefined, factory.createToken(38 /* EqualsGreaterThanToken */), serializeTypeOfNode(node))));
}
if (shouldAddParamTypesMetadata(node)) {
(properties || (properties = [])).push(factory.createPropertyAssignment("paramTypes", factory.createArrowFunction(/*modifiers*/ undefined, /*typeParameters*/ undefined, [], /*type*/ undefined, factory.createToken(38 /* EqualsGreaterThanToken */), serializeParameterTypesOfNode(node, container))));
}
if (shouldAddReturnTypeMetadata(node)) {
(properties || (properties = [])).push(factory.createPropertyAssignment("returnType", factory.createArrowFunction(/*modifiers*/ undefined, /*typeParameters*/ undefined, [], /*type*/ undefined, factory.createToken(38 /* EqualsGreaterThanToken */), serializeReturnTypeOfNode(node))));
}
if (properties) {
decoratorExpressions.push(emitHelpers().createMetadataHelper("design:typeinfo", factory.createObjectLiteralExpression(properties, /*multiLine*/ true)));
}
}
}
/**
* Determines whether to emit the "design:type" metadata based on the node's kind.
* The caller should have already tested whether the node has decorators and whether the
* emitDecoratorMetadata compiler option is set.
*
* @param node The node to test.
*/
function shouldAddTypeMetadata(node) {
var kind = node.kind;
return kind === 167 /* MethodDeclaration */
|| kind === 170 /* GetAccessor */
|| kind === 171 /* SetAccessor */
|| kind === 165 /* PropertyDeclaration */;
}
/**
* Determines whether to emit the "design:returntype" metadata based on the node's kind.
* The caller should have already tested whether the node has decorators and whether the
* emitDecoratorMetadata compiler option is set.
*
* @param node The node to test.
*/
function shouldAddReturnTypeMetadata(node) {
return node.kind === 167 /* MethodDeclaration */;
}
/**
* Determines whether to emit the "design:paramtypes" metadata based on the node's kind.
* The caller should have already tested whether the node has decorators and whether the
* emitDecoratorMetadata compiler option is set.
*
* @param node The node to test.
*/
function shouldAddParamTypesMetadata(node) {
switch (node.kind) {
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
return ts.getFirstConstructorWithBody(node) !== undefined;
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return true;
}
return false;
}
function getAccessorTypeNode(node) {
var accessors = resolver.getAllAccessorDeclarations(node);
return accessors.setAccessor && ts.getSetAccessorTypeAnnotationNode(accessors.setAccessor)
|| accessors.getAccessor && ts.getEffectiveReturnTypeNode(accessors.getAccessor);
}
/**
* Serializes the type of a node for use with decorator type metadata.
*
* @param node The node that should have its type serialized.
*/
function serializeTypeOfNode(node) {
switch (node.kind) {
case 165 /* PropertyDeclaration */:
case 162 /* Parameter */:
return serializeTypeNode(node.type);
case 171 /* SetAccessor */:
case 170 /* GetAccessor */:
return serializeTypeNode(getAccessorTypeNode(node));
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
case 167 /* MethodDeclaration */:
return factory.createIdentifier("Function");
default:
return factory.createVoidZero();
}
}
/**
* Serializes the types of the parameters of a node for use with decorator type metadata.
*
* @param node The node that should have its parameter types serialized.
*/
function serializeParameterTypesOfNode(node, container) {
var valueDeclaration = ts.isClassLike(node)
? ts.getFirstConstructorWithBody(node)
: ts.isFunctionLike(node) && ts.nodeIsPresent(node.body)
? node
: undefined;
var expressions = [];
if (valueDeclaration) {
var parameters = getParametersOfDecoratedDeclaration(valueDeclaration, container);
var numParameters = parameters.length;
for (var i = 0; i < numParameters; i++) {
var parameter = parameters[i];
if (i === 0 && ts.isIdentifier(parameter.name) && parameter.name.escapedText === "this") {
continue;
}
if (parameter.dotDotDotToken) {
expressions.push(serializeTypeNode(ts.getRestParameterElementType(parameter.type)));
}
else {
expressions.push(serializeTypeOfNode(parameter));
}
}
}
return factory.createArrayLiteralExpression(expressions);
}
function getParametersOfDecoratedDeclaration(node, container) {
if (container && node.kind === 170 /* GetAccessor */) {
var setAccessor = ts.getAllAccessorDeclarations(container.members, node).setAccessor;
if (setAccessor) {
return setAccessor.parameters;
}
}
return node.parameters;
}
/**
* Serializes the return type of a node for use with decorator type metadata.
*
* @param node The node that should have its return type serialized.
*/
function serializeReturnTypeOfNode(node) {
if (ts.isFunctionLike(node) && node.type) {
return serializeTypeNode(node.type);
}
else if (ts.isAsyncFunction(node)) {
return factory.createIdentifier("Promise");
}
return factory.createVoidZero();
}
/**
* Serializes a type node for use with decorator type metadata.
*
* Types are serialized in the following fashion:
* - Void types point to "undefined" (e.g. "void 0")
* - Function and Constructor types point to the global "Function" constructor.
* - Interface types with a call or construct signature types point to the global
* "Function" constructor.
* - Array and Tuple types point to the global "Array" constructor.
* - Type predicates and booleans point to the global "Boolean" constructor.
* - String literal types and strings point to the global "String" constructor.
* - Enum and number types point to the global "Number" constructor.
* - Symbol types point to the global "Symbol" constructor.
* - Type references to classes (or class-like variables) point to the constructor for the class.
* - Anything else points to the global "Object" constructor.
*
* @param node The type node to serialize.
*/
function serializeTypeNode(node) {
if (node === undefined) {
return factory.createIdentifier("Object");
}
switch (node.kind) {
case 114 /* VoidKeyword */:
case 151 /* UndefinedKeyword */:
case 142 /* NeverKeyword */:
return factory.createVoidZero();
case 189 /* ParenthesizedType */:
return serializeTypeNode(node.type);
case 177 /* FunctionType */:
case 178 /* ConstructorType */:
return factory.createIdentifier("Function");
case 181 /* ArrayType */:
case 182 /* TupleType */:
return factory.createIdentifier("Array");
case 175 /* TypePredicate */:
case 132 /* BooleanKeyword */:
return factory.createIdentifier("Boolean");
case 148 /* StringKeyword */:
return factory.createIdentifier("String");
case 146 /* ObjectKeyword */:
return factory.createIdentifier("Object");
case 194 /* LiteralType */:
switch (node.literal.kind) {
case 10 /* StringLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
return factory.createIdentifier("String");
case 217 /* PrefixUnaryExpression */:
case 8 /* NumericLiteral */:
return factory.createIdentifier("Number");
case 9 /* BigIntLiteral */:
return getGlobalBigIntNameWithFallback();
case 110 /* TrueKeyword */:
case 95 /* FalseKeyword */:
return factory.createIdentifier("Boolean");
case 104 /* NullKeyword */:
return factory.createVoidZero();
default:
return ts.Debug.failBadSyntaxKind(node.literal);
}
case 145 /* NumberKeyword */:
return factory.createIdentifier("Number");
case 156 /* BigIntKeyword */:
return getGlobalBigIntNameWithFallback();
case 149 /* SymbolKeyword */:
return languageVersion < 2 /* ES2015 */
? getGlobalSymbolNameWithFallback()
: factory.createIdentifier("Symbol");
case 176 /* TypeReference */:
return serializeTypeReferenceNode(node);
case 186 /* IntersectionType */:
case 185 /* UnionType */:
return serializeTypeList(node.types);
case 187 /* ConditionalType */:
return serializeTypeList([node.trueType, node.falseType]);
case 191 /* TypeOperator */:
if (node.operator === 143 /* ReadonlyKeyword */) {
return serializeTypeNode(node.type);
}
break;
case 179 /* TypeQuery */:
case 192 /* IndexedAccessType */:
case 193 /* MappedType */:
case 180 /* TypeLiteral */:
case 129 /* AnyKeyword */:
case 153 /* UnknownKeyword */:
case 190 /* ThisType */:
case 198 /* ImportType */:
break;
// handle JSDoc types from an invalid parse
case 307 /* JSDocAllType */:
case 308 /* JSDocUnknownType */:
case 312 /* JSDocFunctionType */:
case 313 /* JSDocVariadicType */:
case 314 /* JSDocNamepathType */:
break;
case 309 /* JSDocNullableType */:
case 310 /* JSDocNonNullableType */:
case 311 /* JSDocOptionalType */:
return serializeTypeNode(node.type);
default:
return ts.Debug.failBadSyntaxKind(node);
}
return factory.createIdentifier("Object");
}
function serializeTypeList(types) {
// Note when updating logic here also update getEntityNameForDecoratorMetadata
// so that aliases can be marked as referenced
var serializedUnion;
for (var _i = 0, types_23 = types; _i < types_23.length; _i++) {
var typeNode = types_23[_i];
while (typeNode.kind === 189 /* ParenthesizedType */) {
typeNode = typeNode.type; // Skip parens if need be
}
if (typeNode.kind === 142 /* NeverKeyword */) {
continue; // Always elide `never` from the union/intersection if possible
}
if (!strictNullChecks && (typeNode.kind === 194 /* LiteralType */ && typeNode.literal.kind === 104 /* NullKeyword */ || typeNode.kind === 151 /* UndefinedKeyword */)) {
continue; // Elide null and undefined from unions for metadata, just like what we did prior to the implementation of strict null checks
}
var serializedIndividual = serializeTypeNode(typeNode);
if (ts.isIdentifier(serializedIndividual) && serializedIndividual.escapedText === "Object") {
// One of the individual is global object, return immediately
return serializedIndividual;
}
// If there exists union that is not void 0 expression, check if the the common type is identifier.
// anything more complex and we will just default to Object
else if (serializedUnion) {
// Different types
if (!ts.isIdentifier(serializedUnion) ||
!ts.isIdentifier(serializedIndividual) ||
serializedUnion.escapedText !== serializedIndividual.escapedText) {
return factory.createIdentifier("Object");
}
}
else {
// Initialize the union type
serializedUnion = serializedIndividual;
}
}
// If we were able to find common type, use it
return serializedUnion || factory.createVoidZero(); // Fallback is only hit if all union constituients are null/undefined/never
}
/**
* Serializes a TypeReferenceNode to an appropriate JS constructor value for use with
* decorator type metadata.
*
* @param node The type reference node.
*/
function serializeTypeReferenceNode(node) {
var kind = resolver.getTypeReferenceSerializationKind(node.typeName, currentNameScope || currentLexicalScope);
switch (kind) {
case ts.TypeReferenceSerializationKind.Unknown:
// From conditional type type reference that cannot be resolved is Similar to any or unknown
if (ts.findAncestor(node, function (n) { return n.parent && ts.isConditionalTypeNode(n.parent) && (n.parent.trueType === n || n.parent.falseType === n); })) {
return factory.createIdentifier("Object");
}
var serialized = serializeEntityNameAsExpressionFallback(node.typeName);
var temp = factory.createTempVariable(hoistVariableDeclaration);
return factory.createConditionalExpression(factory.createTypeCheck(factory.createAssignment(temp, serialized), "function"),
/*questionToken*/ undefined, temp,
/*colonToken*/ undefined, factory.createIdentifier("Object"));
case ts.TypeReferenceSerializationKind.TypeWithConstructSignatureAndValue:
return serializeEntityNameAsExpression(node.typeName);
case ts.TypeReferenceSerializationKind.VoidNullableOrNeverType:
return factory.createVoidZero();
case ts.TypeReferenceSerializationKind.BigIntLikeType:
return getGlobalBigIntNameWithFallback();
case ts.TypeReferenceSerializationKind.BooleanType:
return factory.createIdentifier("Boolean");
case ts.TypeReferenceSerializationKind.NumberLikeType:
return factory.createIdentifier("Number");
case ts.TypeReferenceSerializationKind.StringLikeType:
return factory.createIdentifier("String");
case ts.TypeReferenceSerializationKind.ArrayLikeType:
return factory.createIdentifier("Array");
case ts.TypeReferenceSerializationKind.ESSymbolType:
return languageVersion < 2 /* ES2015 */
? getGlobalSymbolNameWithFallback()
: factory.createIdentifier("Symbol");
case ts.TypeReferenceSerializationKind.TypeWithCallSignature:
return factory.createIdentifier("Function");
case ts.TypeReferenceSerializationKind.Promise:
return factory.createIdentifier("Promise");
case ts.TypeReferenceSerializationKind.ObjectType:
return factory.createIdentifier("Object");
default:
return ts.Debug.assertNever(kind);
}
}
function createCheckedValue(left, right) {
return factory.createLogicalAnd(factory.createStrictInequality(factory.createTypeOfExpression(left), factory.createStringLiteral("undefined")), right);
}
/**
* Serializes an entity name which may not exist at runtime, but whose access shouldn't throw
*
* @param node The entity name to serialize.
*/
function serializeEntityNameAsExpressionFallback(node) {
if (node.kind === 79 /* Identifier */) {
// A -> typeof A !== undefined && A
var copied = serializeEntityNameAsExpression(node);
return createCheckedValue(copied, copied);
}
if (node.left.kind === 79 /* Identifier */) {
// A.B -> typeof A !== undefined && A.B
return createCheckedValue(serializeEntityNameAsExpression(node.left), serializeEntityNameAsExpression(node));
}
// A.B.C -> typeof A !== undefined && (_a = A.B) !== void 0 && _a.C
var left = serializeEntityNameAsExpressionFallback(node.left);
var temp = factory.createTempVariable(hoistVariableDeclaration);
return factory.createLogicalAnd(factory.createLogicalAnd(left.left, factory.createStrictInequality(factory.createAssignment(temp, left.right), factory.createVoidZero())), factory.createPropertyAccessExpression(temp, node.right));
}
/**
* Serializes an entity name as an expression for decorator type metadata.
*
* @param node The entity name to serialize.
*/
function serializeEntityNameAsExpression(node) {
switch (node.kind) {
case 79 /* Identifier */:
// Create a clone of the name with a new parent, and treat it as if it were
// a source tree node for the purposes of the checker.
var name = ts.setParent(ts.setTextRange(ts.parseNodeFactory.cloneNode(node), node), node.parent);
name.original = undefined;
ts.setParent(name, ts.getParseTreeNode(currentLexicalScope)); // ensure the parent is set to a parse tree node.
return name;
case 159 /* QualifiedName */:
return serializeQualifiedNameAsExpression(node);
}
}
/**
* Serializes an qualified name as an expression for decorator type metadata.
*
* @param node The qualified name to serialize.
* @param useFallback A value indicating whether to use logical operators to test for the
* qualified name at runtime.
*/
function serializeQualifiedNameAsExpression(node) {
return factory.createPropertyAccessExpression(serializeEntityNameAsExpression(node.left), node.right);
}
/**
* Gets an expression that points to the global "Symbol" constructor at runtime if it is
* available.
*/
function getGlobalSymbolNameWithFallback() {
return factory.createConditionalExpression(factory.createTypeCheck(factory.createIdentifier("Symbol"), "function"),
/*questionToken*/ undefined, factory.createIdentifier("Symbol"),
/*colonToken*/ undefined, factory.createIdentifier("Object"));
}
/**
* Gets an expression that points to the global "BigInt" constructor at runtime if it is
* available.
*/
function getGlobalBigIntNameWithFallback() {
return languageVersion < 99 /* ESNext */
? factory.createConditionalExpression(factory.createTypeCheck(factory.createIdentifier("BigInt"), "function"),
/*questionToken*/ undefined, factory.createIdentifier("BigInt"),
/*colonToken*/ undefined, factory.createIdentifier("Object"))
: factory.createIdentifier("BigInt");
}
/**
* Gets an expression that represents a property name (for decorated properties or enums).
* For a computed property, a name is generated for the node.
*
* @param member The member whose name should be converted into an expression.
*/
function getExpressionForPropertyName(member, generateNameForComputedPropertyName) {
var name = member.name;
if (ts.isPrivateIdentifier(name)) {
return factory.createIdentifier("");
}
else if (ts.isComputedPropertyName(name)) {
return generateNameForComputedPropertyName && !ts.isSimpleInlineableExpression(name.expression)
? factory.getGeneratedNameForNode(name)
: name.expression;
}
else if (ts.isIdentifier(name)) {
return factory.createStringLiteral(ts.idText(name));
}
else {
return factory.cloneNode(name);
}
}
/**
* Visits the property name of a class element, for use when emitting property
* initializers. For a computed property on a node with decorators, a temporary
* value is stored for later use.
*
* @param member The member whose name should be visited.
*/
function visitPropertyNameOfClassElement(member) {
var name = member.name;
// Computed property names need to be transformed into a hoisted variable when they are used more than once.
// The names are used more than once when:
// - the property is non-static and its initializer is moved to the constructor (when there are parameter property assignments).
// - the property has a decorator.
if (ts.isComputedPropertyName(name) && ((!ts.hasStaticModifier(member) && currentClassHasParameterProperties) || ts.some(member.decorators))) {
var expression = ts.visitNode(name.expression, visitor, ts.isExpression);
var innerExpression = ts.skipPartiallyEmittedExpressions(expression);
if (!ts.isSimpleInlineableExpression(innerExpression)) {
var generatedName = factory.getGeneratedNameForNode(name);
hoistVariableDeclaration(generatedName);
return factory.updateComputedPropertyName(name, factory.createAssignment(generatedName, expression));
}
}
return ts.visitNode(name, visitor, ts.isPropertyName);
}
/**
* Transforms a HeritageClause with TypeScript syntax.
*
* This function will only be called when one of the following conditions are met:
* - The node is a non-`extends` heritage clause that should be elided.
* - The node is an `extends` heritage clause that should be visited, but only allow a single type.
*
* @param node The HeritageClause to transform.
*/
function visitHeritageClause(node) {
if (node.token === 117 /* ImplementsKeyword */) {
// implements clauses are elided
return undefined;
}
return ts.visitEachChild(node, visitor, context);
}
/**
* Transforms an ExpressionWithTypeArguments with TypeScript syntax.
*
* This function will only be called when one of the following conditions are met:
* - The node contains type arguments that should be elided.
*
* @param node The ExpressionWithTypeArguments to transform.
*/
function visitExpressionWithTypeArguments(node) {
return factory.updateExpressionWithTypeArguments(node, ts.visitNode(node.expression, visitor, ts.isLeftHandSideExpression),
/*typeArguments*/ undefined);
}
/**
* Determines whether to emit a function-like declaration. We should not emit the
* declaration if it does not have a body.
*
* @param node The declaration node.
*/
function shouldEmitFunctionLikeDeclaration(node) {
return !ts.nodeIsMissing(node.body);
}
function visitPropertyDeclaration(node) {
if (node.flags & 8388608 /* Ambient */ || ts.hasSyntacticModifier(node, 128 /* Abstract */)) {
return undefined;
}
var updated = factory.updatePropertyDeclaration(node,
/*decorators*/ undefined, ts.visitNodes(node.modifiers, visitor, ts.isModifier), visitPropertyNameOfClassElement(node),
/*questionOrExclamationToken*/ undefined,
/*type*/ undefined, ts.visitNode(node.initializer, visitor));
if (updated !== node) {
// While we emit the source map for the node after skipping decorators and modifiers,
// we need to emit the comments for the original range.
ts.setCommentRange(updated, node);
ts.setSourceMapRange(updated, ts.moveRangePastDecorators(node));
}
return updated;
}
function visitConstructor(node) {
if (!shouldEmitFunctionLikeDeclaration(node)) {
return undefined;
}
return factory.updateConstructorDeclaration(node,
/*decorators*/ undefined,
/*modifiers*/ undefined, ts.visitParameterList(node.parameters, visitor, context), transformConstructorBody(node.body, node));
}
function transformConstructorBody(body, constructor) {
var parametersWithPropertyAssignments = constructor &&
ts.filter(constructor.parameters, function (p) { return ts.isParameterPropertyDeclaration(p, constructor); });
if (!ts.some(parametersWithPropertyAssignments)) {
return ts.visitFunctionBody(body, visitor, context);
}
var statements = [];
var indexOfFirstStatement = 0;
resumeLexicalEnvironment();
indexOfFirstStatement = ts.addPrologueDirectivesAndInitialSuperCall(factory, constructor, statements, visitor);
// Add parameters with property assignments. Transforms this:
//
// constructor (public x, public y) {
// }
//
// Into this:
//
// constructor (x, y) {
// this.x = x;
// this.y = y;
// }
//
ts.addRange(statements, ts.map(parametersWithPropertyAssignments, transformParameterWithPropertyAssignment));
// Add the existing statements, skipping the initial super call.
ts.addRange(statements, ts.visitNodes(body.statements, visitor, ts.isStatement, indexOfFirstStatement));
// End the lexical environment.
statements = factory.mergeLexicalEnvironment(statements, endLexicalEnvironment());
var block = factory.createBlock(ts.setTextRange(factory.createNodeArray(statements), body.statements), /*multiLine*/ true);
ts.setTextRange(block, /*location*/ body);
ts.setOriginalNode(block, body);
return block;
}
/**
* Transforms a parameter into a property assignment statement.
*
* @param node The parameter declaration.
*/
function transformParameterWithPropertyAssignment(node) {
var name = node.name;
if (!ts.isIdentifier(name)) {
return undefined;
}
// TODO(rbuckton): Does this need to be parented?
var propertyName = ts.setParent(ts.setTextRange(factory.cloneNode(name), name), name.parent);
ts.setEmitFlags(propertyName, 1536 /* NoComments */ | 48 /* NoSourceMap */);
// TODO(rbuckton): Does this need to be parented?
var localName = ts.setParent(ts.setTextRange(factory.cloneNode(name), name), name.parent);
ts.setEmitFlags(localName, 1536 /* NoComments */);
return ts.startOnNewLine(ts.removeAllComments(ts.setTextRange(ts.setOriginalNode(factory.createExpressionStatement(factory.createAssignment(ts.setTextRange(factory.createPropertyAccessExpression(factory.createThis(), propertyName), node.name), localName)), node), ts.moveRangePos(node, -1))));
}
function visitMethodDeclaration(node) {
if (!shouldEmitFunctionLikeDeclaration(node)) {
return undefined;
}
var updated = factory.updateMethodDeclaration(node,
/*decorators*/ undefined, ts.visitNodes(node.modifiers, modifierVisitor, ts.isModifier), node.asteriskToken, visitPropertyNameOfClassElement(node),
/*questionToken*/ undefined,
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, ts.visitFunctionBody(node.body, visitor, context));
if (updated !== node) {
// While we emit the source map for the node after skipping decorators and modifiers,
// we need to emit the comments for the original range.
ts.setCommentRange(updated, node);
ts.setSourceMapRange(updated, ts.moveRangePastDecorators(node));
}
return updated;
}
/**
* Determines whether to emit an accessor declaration. We should not emit the
* declaration if it does not have a body and is abstract.
*
* @param node The declaration node.
*/
function shouldEmitAccessorDeclaration(node) {
return !(ts.nodeIsMissing(node.body) && ts.hasSyntacticModifier(node, 128 /* Abstract */));
}
function visitGetAccessor(node) {
if (!shouldEmitAccessorDeclaration(node)) {
return undefined;
}
var updated = factory.updateGetAccessorDeclaration(node,
/*decorators*/ undefined, ts.visitNodes(node.modifiers, modifierVisitor, ts.isModifier), visitPropertyNameOfClassElement(node), ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, ts.visitFunctionBody(node.body, visitor, context) || factory.createBlock([]));
if (updated !== node) {
// While we emit the source map for the node after skipping decorators and modifiers,
// we need to emit the comments for the original range.
ts.setCommentRange(updated, node);
ts.setSourceMapRange(updated, ts.moveRangePastDecorators(node));
}
return updated;
}
function visitSetAccessor(node) {
if (!shouldEmitAccessorDeclaration(node)) {
return undefined;
}
var updated = factory.updateSetAccessorDeclaration(node,
/*decorators*/ undefined, ts.visitNodes(node.modifiers, modifierVisitor, ts.isModifier), visitPropertyNameOfClassElement(node), ts.visitParameterList(node.parameters, visitor, context), ts.visitFunctionBody(node.body, visitor, context) || factory.createBlock([]));
if (updated !== node) {
// While we emit the source map for the node after skipping decorators and modifiers,
// we need to emit the comments for the original range.
ts.setCommentRange(updated, node);
ts.setSourceMapRange(updated, ts.moveRangePastDecorators(node));
}
return updated;
}
function visitFunctionDeclaration(node) {
if (!shouldEmitFunctionLikeDeclaration(node)) {
return factory.createNotEmittedStatement(node);
}
var updated = factory.updateFunctionDeclaration(node,
/*decorators*/ undefined, ts.visitNodes(node.modifiers, modifierVisitor, ts.isModifier), node.asteriskToken, node.name,
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, ts.visitFunctionBody(node.body, visitor, context) || factory.createBlock([]));
if (isExportOfNamespace(node)) {
var statements = [updated];
addExportMemberAssignment(statements, node);
return statements;
}
return updated;
}
function visitFunctionExpression(node) {
if (!shouldEmitFunctionLikeDeclaration(node)) {
return factory.createOmittedExpression();
}
var updated = factory.updateFunctionExpression(node, ts.visitNodes(node.modifiers, modifierVisitor, ts.isModifier), node.asteriskToken, node.name,
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, ts.visitFunctionBody(node.body, visitor, context) || factory.createBlock([]));
return updated;
}
function visitArrowFunction(node) {
var updated = factory.updateArrowFunction(node, ts.visitNodes(node.modifiers, modifierVisitor, ts.isModifier),
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, node.equalsGreaterThanToken, ts.visitFunctionBody(node.body, visitor, context));
return updated;
}
function visitParameter(node) {
if (ts.parameterIsThisKeyword(node)) {
return undefined;
}
var updated = factory.updateParameterDeclaration(node,
/*decorators*/ undefined,
/*modifiers*/ undefined, node.dotDotDotToken, ts.visitNode(node.name, visitor, ts.isBindingName),
/*questionToken*/ undefined,
/*type*/ undefined, ts.visitNode(node.initializer, visitor, ts.isExpression));
if (updated !== node) {
// While we emit the source map for the node after skipping decorators and modifiers,
// we need to emit the comments for the original range.
ts.setCommentRange(updated, node);
ts.setTextRange(updated, ts.moveRangePastModifiers(node));
ts.setSourceMapRange(updated, ts.moveRangePastModifiers(node));
ts.setEmitFlags(updated.name, 32 /* NoTrailingSourceMap */);
}
return updated;
}
function visitVariableStatement(node) {
if (isExportOfNamespace(node)) {
var variables = ts.getInitializedVariables(node.declarationList);
if (variables.length === 0) {
// elide statement if there are no initialized variables.
return undefined;
}
return ts.setTextRange(factory.createExpressionStatement(factory.inlineExpressions(ts.map(variables, transformInitializedVariable))), node);
}
else {
return ts.visitEachChild(node, visitor, context);
}
}
function transformInitializedVariable(node) {
var name = node.name;
if (ts.isBindingPattern(name)) {
return ts.flattenDestructuringAssignment(node, visitor, context, 0 /* All */,
/*needsValue*/ false, createNamespaceExportExpression);
}
else {
return ts.setTextRange(factory.createAssignment(getNamespaceMemberNameWithSourceMapsAndWithoutComments(name), ts.visitNode(node.initializer, visitor, ts.isExpression)),
/*location*/ node);
}
}
function visitVariableDeclaration(node) {
return factory.updateVariableDeclaration(node, ts.visitNode(node.name, visitor, ts.isBindingName),
/*exclamationToken*/ undefined,
/*type*/ undefined, ts.visitNode(node.initializer, visitor, ts.isExpression));
}
function visitParenthesizedExpression(node) {
var innerExpression = ts.skipOuterExpressions(node.expression, ~6 /* Assertions */);
if (ts.isAssertionExpression(innerExpression)) {
// Make sure we consider all nested cast expressions, e.g.:
// (<any><number><any>-A).x;
var expression = ts.visitNode(node.expression, visitor, ts.isExpression);
// We have an expression of the form: (<Type>SubExpr). Emitting this as (SubExpr)
// is really not desirable. We would like to emit the subexpression as-is. Omitting
// the parentheses, however, could cause change in the semantics of the generated
// code if the casted expression has a lower precedence than the rest of the
// expression.
//
// To preserve comments, we return a "PartiallyEmittedExpression" here which will
// preserve the position information of the original expression.
//
// Due to the auto-parenthesization rules used by the visitor and factory functions
// we can safely elide the parentheses here, as a new synthetic
// ParenthesizedExpression will be inserted if we remove parentheses too
// aggressively.
// HOWEVER - if there are leading comments on the expression itself, to handle ASI
// correctly for return and throw, we must keep the parenthesis
if (ts.length(ts.getLeadingCommentRangesOfNode(expression, currentSourceFile))) {
return factory.updateParenthesizedExpression(node, expression);
}
return factory.createPartiallyEmittedExpression(expression, node);
}
return ts.visitEachChild(node, visitor, context);
}
function visitAssertionExpression(node) {
var expression = ts.visitNode(node.expression, visitor, ts.isExpression);
return factory.createPartiallyEmittedExpression(expression, node);
}
function visitNonNullExpression(node) {
var expression = ts.visitNode(node.expression, visitor, ts.isLeftHandSideExpression);
return factory.createPartiallyEmittedExpression(expression, node);
}
function visitCallExpression(node) {
return factory.updateCallExpression(node, ts.visitNode(node.expression, visitor, ts.isExpression),
/*typeArguments*/ undefined, ts.visitNodes(node.arguments, visitor, ts.isExpression));
}
function visitNewExpression(node) {
return factory.updateNewExpression(node, ts.visitNode(node.expression, visitor, ts.isExpression),
/*typeArguments*/ undefined, ts.visitNodes(node.arguments, visitor, ts.isExpression));
}
function visitTaggedTemplateExpression(node) {
return factory.updateTaggedTemplateExpression(node, ts.visitNode(node.tag, visitor, ts.isExpression),
/*typeArguments*/ undefined, ts.visitNode(node.template, visitor, ts.isExpression));
}
function visitJsxSelfClosingElement(node) {
return factory.updateJsxSelfClosingElement(node, ts.visitNode(node.tagName, visitor, ts.isJsxTagNameExpression),
/*typeArguments*/ undefined, ts.visitNode(node.attributes, visitor, ts.isJsxAttributes));
}
function visitJsxJsxOpeningElement(node) {
return factory.updateJsxOpeningElement(node, ts.visitNode(node.tagName, visitor, ts.isJsxTagNameExpression),
/*typeArguments*/ undefined, ts.visitNode(node.attributes, visitor, ts.isJsxAttributes));
}
/**
* Determines whether to emit an enum declaration.
*
* @param node The enum declaration node.
*/
function shouldEmitEnumDeclaration(node) {
return !ts.isEnumConst(node)
|| ts.shouldPreserveConstEnums(compilerOptions);
}
/**
* Visits an enum declaration.
*
* This function will be called any time a TypeScript enum is encountered.
*
* @param node The enum declaration node.
*/
function visitEnumDeclaration(node) {
if (!shouldEmitEnumDeclaration(node)) {
return factory.createNotEmittedStatement(node);
}
var statements = [];
// We request to be advised when the printer is about to print this node. This allows
// us to set up the correct state for later substitutions.
var emitFlags = 2 /* AdviseOnEmitNode */;
// If needed, we should emit a variable declaration for the enum. If we emit
// a leading variable declaration, we should not emit leading comments for the
// enum body.
var varAdded = addVarForEnumOrModuleDeclaration(statements, node);
if (varAdded) {
// We should still emit the comments if we are emitting a system module.
if (moduleKind !== ts.ModuleKind.System || currentLexicalScope !== currentSourceFile) {
emitFlags |= 512 /* NoLeadingComments */;
}
}
// `parameterName` is the declaration name used inside of the enum.
var parameterName = getNamespaceParameterName(node);
// `containerName` is the expression used inside of the enum for assignments.
var containerName = getNamespaceContainerName(node);
// `exportName` is the expression used within this node's container for any exported references.
var exportName = ts.hasSyntacticModifier(node, 1 /* Export */)
? factory.getExternalModuleOrNamespaceExportName(currentNamespaceContainerName, node, /*allowComments*/ false, /*allowSourceMaps*/ true)
: factory.getLocalName(node, /*allowComments*/ false, /*allowSourceMaps*/ true);
// x || (x = {})
// exports.x || (exports.x = {})
var moduleArg = factory.createLogicalOr(exportName, factory.createAssignment(exportName, factory.createObjectLiteralExpression()));
if (hasNamespaceQualifiedExportName(node)) {
// `localName` is the expression used within this node's containing scope for any local references.
var localName = factory.getLocalName(node, /*allowComments*/ false, /*allowSourceMaps*/ true);
// x = (exports.x || (exports.x = {}))
moduleArg = factory.createAssignment(localName, moduleArg);
}
// (function (x) {
// x[x["y"] = 0] = "y";
// ...
// })(x || (x = {}));
var enumStatement = factory.createExpressionStatement(factory.createCallExpression(factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, [factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, parameterName)],
/*type*/ undefined, transformEnumBody(node, containerName)),
/*typeArguments*/ undefined, [moduleArg]));
ts.setOriginalNode(enumStatement, node);
if (varAdded) {
// If a variable was added, synthetic comments are emitted on it, not on the moduleStatement.
ts.setSyntheticLeadingComments(enumStatement, undefined);
ts.setSyntheticTrailingComments(enumStatement, undefined);
}
ts.setTextRange(enumStatement, node);
ts.addEmitFlags(enumStatement, emitFlags);
statements.push(enumStatement);
// Add a DeclarationMarker for the enum to preserve trailing comments and mark
// the end of the declaration.
statements.push(factory.createEndOfDeclarationMarker(node));
return statements;
}
/**
* Transforms the body of an enum declaration.
*
* @param node The enum declaration node.
*/
function transformEnumBody(node, localName) {
var savedCurrentNamespaceLocalName = currentNamespaceContainerName;
currentNamespaceContainerName = localName;
var statements = [];
startLexicalEnvironment();
var members = ts.map(node.members, transformEnumMember);
ts.insertStatementsAfterStandardPrologue(statements, endLexicalEnvironment());
ts.addRange(statements, members);
currentNamespaceContainerName = savedCurrentNamespaceLocalName;
return factory.createBlock(ts.setTextRange(factory.createNodeArray(statements), /*location*/ node.members),
/*multiLine*/ true);
}
/**
* Transforms an enum member into a statement.
*
* @param member The enum member node.
*/
function transformEnumMember(member) {
// enums don't support computed properties
// we pass false as 'generateNameForComputedPropertyName' for a backward compatibility purposes
// old emitter always generate 'expression' part of the name as-is.
var name = getExpressionForPropertyName(member, /*generateNameForComputedPropertyName*/ false);
var valueExpression = transformEnumMemberDeclarationValue(member);
var innerAssignment = factory.createAssignment(factory.createElementAccessExpression(currentNamespaceContainerName, name), valueExpression);
var outerAssignment = valueExpression.kind === 10 /* StringLiteral */ ?
innerAssignment :
factory.createAssignment(factory.createElementAccessExpression(currentNamespaceContainerName, innerAssignment), name);
return ts.setTextRange(factory.createExpressionStatement(ts.setTextRange(outerAssignment, member)), member);
}
/**
* Transforms the value of an enum member.
*
* @param member The enum member node.
*/
function transformEnumMemberDeclarationValue(member) {
var value = resolver.getConstantValue(member);
if (value !== undefined) {
return typeof value === "string" ? factory.createStringLiteral(value) : factory.createNumericLiteral(value);
}
else {
enableSubstitutionForNonQualifiedEnumMembers();
if (member.initializer) {
return ts.visitNode(member.initializer, visitor, ts.isExpression);
}
else {
return factory.createVoidZero();
}
}
}
/**
* Determines whether to elide a module declaration.
*
* @param node The module declaration node.
*/
function shouldEmitModuleDeclaration(nodeIn) {
var node = ts.getParseTreeNode(nodeIn, ts.isModuleDeclaration);
if (!node) {
// If we can't find a parse tree node, assume the node is instantiated.
return true;
}
return ts.isInstantiatedModule(node, ts.shouldPreserveConstEnums(compilerOptions));
}
/**
* Determines whether an exported declaration will have a qualified export name (e.g. `f.x`
* or `exports.x`).
*/
function hasNamespaceQualifiedExportName(node) {
return isExportOfNamespace(node)
|| (isExternalModuleExport(node)
&& moduleKind !== ts.ModuleKind.ES2015
&& moduleKind !== ts.ModuleKind.ES2020
&& moduleKind !== ts.ModuleKind.ESNext
&& moduleKind !== ts.ModuleKind.System);
}
/**
* Records that a declaration was emitted in the current scope, if it was the first
* declaration for the provided symbol.
*/
function recordEmittedDeclarationInScope(node) {
if (!currentScopeFirstDeclarationsOfName) {
currentScopeFirstDeclarationsOfName = new ts.Map();
}
var name = declaredNameInScope(node);
if (!currentScopeFirstDeclarationsOfName.has(name)) {
currentScopeFirstDeclarationsOfName.set(name, node);
}
}
/**
* Determines whether a declaration is the first declaration with
* the same name emitted in the current scope.
*/
function isFirstEmittedDeclarationInScope(node) {
if (currentScopeFirstDeclarationsOfName) {
var name = declaredNameInScope(node);
return currentScopeFirstDeclarationsOfName.get(name) === node;
}
return true;
}
function declaredNameInScope(node) {
ts.Debug.assertNode(node.name, ts.isIdentifier);
return node.name.escapedText;
}
/**
* Adds a leading VariableStatement for a enum or module declaration.
*/
function addVarForEnumOrModuleDeclaration(statements, node) {
// Emit a variable statement for the module. We emit top-level enums as a `var`
// declaration to avoid static errors in global scripts scripts due to redeclaration.
// enums in any other scope are emitted as a `let` declaration.
var statement = factory.createVariableStatement(ts.visitNodes(node.modifiers, modifierVisitor, ts.isModifier), factory.createVariableDeclarationList([
factory.createVariableDeclaration(factory.getLocalName(node, /*allowComments*/ false, /*allowSourceMaps*/ true))
], currentLexicalScope.kind === 300 /* SourceFile */ ? 0 /* None */ : 1 /* Let */));
ts.setOriginalNode(statement, node);
recordEmittedDeclarationInScope(node);
if (isFirstEmittedDeclarationInScope(node)) {
// Adjust the source map emit to match the old emitter.
if (node.kind === 258 /* EnumDeclaration */) {
ts.setSourceMapRange(statement.declarationList, node);
}
else {
ts.setSourceMapRange(statement, node);
}
// Trailing comments for module declaration should be emitted after the function closure
// instead of the variable statement:
//
// /** Module comment*/
// module m1 {
// function foo4Export() {
// }
// } // trailing comment module
//
// Should emit:
//
// /** Module comment*/
// var m1;
// (function (m1) {
// function foo4Export() {
// }
// })(m1 || (m1 = {})); // trailing comment module
//
ts.setCommentRange(statement, node);
ts.addEmitFlags(statement, 1024 /* NoTrailingComments */ | 4194304 /* HasEndOfDeclarationMarker */);
statements.push(statement);
return true;
}
else {
// For an EnumDeclaration or ModuleDeclaration that merges with a preceeding
// declaration we do not emit a leading variable declaration. To preserve the
// begin/end semantics of the declararation and to properly handle exports
// we wrap the leading variable declaration in a `MergeDeclarationMarker`.
var mergeMarker = factory.createMergeDeclarationMarker(statement);
ts.setEmitFlags(mergeMarker, 1536 /* NoComments */ | 4194304 /* HasEndOfDeclarationMarker */);
statements.push(mergeMarker);
return false;
}
}
/**
* Visits a module declaration node.
*
* This function will be called any time a TypeScript namespace (ModuleDeclaration) is encountered.
*
* @param node The module declaration node.
*/
function visitModuleDeclaration(node) {
if (!shouldEmitModuleDeclaration(node)) {
return factory.createNotEmittedStatement(node);
}
ts.Debug.assertNode(node.name, ts.isIdentifier, "A TypeScript namespace should have an Identifier name.");
enableSubstitutionForNamespaceExports();
var statements = [];
// We request to be advised when the printer is about to print this node. This allows
// us to set up the correct state for later substitutions.
var emitFlags = 2 /* AdviseOnEmitNode */;
// If needed, we should emit a variable declaration for the module. If we emit
// a leading variable declaration, we should not emit leading comments for the
// module body.
var varAdded = addVarForEnumOrModuleDeclaration(statements, node);
if (varAdded) {
// We should still emit the comments if we are emitting a system module.
if (moduleKind !== ts.ModuleKind.System || currentLexicalScope !== currentSourceFile) {
emitFlags |= 512 /* NoLeadingComments */;
}
}
// `parameterName` is the declaration name used inside of the namespace.
var parameterName = getNamespaceParameterName(node);
// `containerName` is the expression used inside of the namespace for exports.
var containerName = getNamespaceContainerName(node);
// `exportName` is the expression used within this node's container for any exported references.
var exportName = ts.hasSyntacticModifier(node, 1 /* Export */)
? factory.getExternalModuleOrNamespaceExportName(currentNamespaceContainerName, node, /*allowComments*/ false, /*allowSourceMaps*/ true)
: factory.getLocalName(node, /*allowComments*/ false, /*allowSourceMaps*/ true);
// x || (x = {})
// exports.x || (exports.x = {})
var moduleArg = factory.createLogicalOr(exportName, factory.createAssignment(exportName, factory.createObjectLiteralExpression()));
if (hasNamespaceQualifiedExportName(node)) {
// `localName` is the expression used within this node's containing scope for any local references.
var localName = factory.getLocalName(node, /*allowComments*/ false, /*allowSourceMaps*/ true);
// x = (exports.x || (exports.x = {}))
moduleArg = factory.createAssignment(localName, moduleArg);
}
// (function (x_1) {
// x_1.y = ...;
// })(x || (x = {}));
var moduleStatement = factory.createExpressionStatement(factory.createCallExpression(factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, [factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, parameterName)],
/*type*/ undefined, transformModuleBody(node, containerName)),
/*typeArguments*/ undefined, [moduleArg]));
ts.setOriginalNode(moduleStatement, node);
if (varAdded) {
// If a variable was added, synthetic comments are emitted on it, not on the moduleStatement.
ts.setSyntheticLeadingComments(moduleStatement, undefined);
ts.setSyntheticTrailingComments(moduleStatement, undefined);
}
ts.setTextRange(moduleStatement, node);
ts.addEmitFlags(moduleStatement, emitFlags);
statements.push(moduleStatement);
// Add a DeclarationMarker for the namespace to preserve trailing comments and mark
// the end of the declaration.
statements.push(factory.createEndOfDeclarationMarker(node));
return statements;
}
/**
* Transforms the body of a module declaration.
*
* @param node The module declaration node.
*/
function transformModuleBody(node, namespaceLocalName) {
var savedCurrentNamespaceContainerName = currentNamespaceContainerName;
var savedCurrentNamespace = currentNamespace;
var savedCurrentScopeFirstDeclarationsOfName = currentScopeFirstDeclarationsOfName;
currentNamespaceContainerName = namespaceLocalName;
currentNamespace = node;
currentScopeFirstDeclarationsOfName = undefined;
var statements = [];
startLexicalEnvironment();
var statementsLocation;
var blockLocation;
if (node.body) {
if (node.body.kind === 260 /* ModuleBlock */) {
saveStateAndInvoke(node.body, function (body) { return ts.addRange(statements, ts.visitNodes(body.statements, namespaceElementVisitor, ts.isStatement)); });
statementsLocation = node.body.statements;
blockLocation = node.body;
}
else {
var result = visitModuleDeclaration(node.body);
if (result) {
if (ts.isArray(result)) {
ts.addRange(statements, result);
}
else {
statements.push(result);
}
}
var moduleBlock = getInnerMostModuleDeclarationFromDottedModule(node).body;
statementsLocation = ts.moveRangePos(moduleBlock.statements, -1);
}
}
ts.insertStatementsAfterStandardPrologue(statements, endLexicalEnvironment());
currentNamespaceContainerName = savedCurrentNamespaceContainerName;
currentNamespace = savedCurrentNamespace;
currentScopeFirstDeclarationsOfName = savedCurrentScopeFirstDeclarationsOfName;
var block = factory.createBlock(ts.setTextRange(factory.createNodeArray(statements),
/*location*/ statementsLocation),
/*multiLine*/ true);
ts.setTextRange(block, blockLocation);
// namespace hello.hi.world {
// function foo() {}
//
// // TODO, blah
// }
//
// should be emitted as
//
// var hello;
// (function (hello) {
// var hi;
// (function (hi) {
// var world;
// (function (world) {
// function foo() { }
// // TODO, blah
// })(world = hi.world || (hi.world = {}));
// })(hi = hello.hi || (hello.hi = {}));
// })(hello || (hello = {}));
// We only want to emit comment on the namespace which contains block body itself, not the containing namespaces.
if (!node.body || node.body.kind !== 260 /* ModuleBlock */) {
ts.setEmitFlags(block, ts.getEmitFlags(block) | 1536 /* NoComments */);
}
return block;
}
function getInnerMostModuleDeclarationFromDottedModule(moduleDeclaration) {
if (moduleDeclaration.body.kind === 259 /* ModuleDeclaration */) {
var recursiveInnerModule = getInnerMostModuleDeclarationFromDottedModule(moduleDeclaration.body);
return recursiveInnerModule || moduleDeclaration.body;
}
}
/**
* Visits an import declaration, eliding it if it is not referenced and `importsNotUsedAsValues` is not 'preserve'.
*
* @param node The import declaration node.
*/
function visitImportDeclaration(node) {
if (!node.importClause) {
// Do not elide a side-effect only import declaration.
// import "foo";
return node;
}
if (node.importClause.isTypeOnly) {
// Always elide type-only imports
return undefined;
}
// Elide the declaration if the import clause was elided.
var importClause = ts.visitNode(node.importClause, visitImportClause, ts.isImportClause);
return importClause ||
compilerOptions.importsNotUsedAsValues === 1 /* Preserve */ ||
compilerOptions.importsNotUsedAsValues === 2 /* Error */
? factory.updateImportDeclaration(node,
/*decorators*/ undefined,
/*modifiers*/ undefined, importClause, node.moduleSpecifier)
: undefined;
}
/**
* Visits an import clause, eliding it if it is not referenced.
*
* @param node The import clause node.
*/
function visitImportClause(node) {
if (node.isTypeOnly) {
return undefined;
}
// Elide the import clause if we elide both its name and its named bindings.
var name = resolver.isReferencedAliasDeclaration(node) ? node.name : undefined;
var namedBindings = ts.visitNode(node.namedBindings, visitNamedImportBindings, ts.isNamedImportBindings);
return (name || namedBindings) ? factory.updateImportClause(node, /*isTypeOnly*/ false, name, namedBindings) : undefined;
}
/**
* Visits named import bindings, eliding it if it is not referenced.
*
* @param node The named import bindings node.
*/
function visitNamedImportBindings(node) {
if (node.kind === 266 /* NamespaceImport */) {
// Elide a namespace import if it is not referenced.
return resolver.isReferencedAliasDeclaration(node) ? node : undefined;
}
else {
// Elide named imports if all of its import specifiers are elided.
var elements = ts.visitNodes(node.elements, visitImportSpecifier, ts.isImportSpecifier);
return ts.some(elements) ? factory.updateNamedImports(node, elements) : undefined;
}
}
/**
* Visits an import specifier, eliding it if it is not referenced.
*
* @param node The import specifier node.
*/
function visitImportSpecifier(node) {
// Elide an import specifier if it is not referenced.
return resolver.isReferencedAliasDeclaration(node) ? node : undefined;
}
/**
* Visits an export assignment, eliding it if it does not contain a clause that resolves
* to a value.
*
* @param node The export assignment node.
*/
function visitExportAssignment(node) {
// Elide the export assignment if it does not reference a value.
return resolver.isValueAliasDeclaration(node)
? ts.visitEachChild(node, visitor, context)
: undefined;
}
/**
* Visits an export declaration, eliding it if it does not contain a clause that resolves
* to a value.
*
* @param node The export declaration node.
*/
function visitExportDeclaration(node) {
if (node.isTypeOnly) {
return undefined;
}
if (!node.exportClause || ts.isNamespaceExport(node.exportClause)) {
// never elide `export <whatever> from <whereever>` declarations -
// they should be kept for sideffects/untyped exports, even when the
// type checker doesn't know about any exports
return node;
}
if (!resolver.isValueAliasDeclaration(node)) {
// Elide the export declaration if it does not export a value.
return undefined;
}
// Elide the export declaration if all of its named exports are elided.
var exportClause = ts.visitNode(node.exportClause, visitNamedExportBindings, ts.isNamedExportBindings);
return exportClause
? factory.updateExportDeclaration(node,
/*decorators*/ undefined,
/*modifiers*/ undefined, node.isTypeOnly, exportClause, node.moduleSpecifier)
: undefined;
}
/**
* Visits named exports, eliding it if it does not contain an export specifier that
* resolves to a value.
*
* @param node The named exports node.
*/
function visitNamedExports(node) {
// Elide the named exports if all of its export specifiers were elided.
var elements = ts.visitNodes(node.elements, visitExportSpecifier, ts.isExportSpecifier);
return ts.some(elements) ? factory.updateNamedExports(node, elements) : undefined;
}
function visitNamespaceExports(node) {
return factory.updateNamespaceExport(node, ts.visitNode(node.name, visitor, ts.isIdentifier));
}
function visitNamedExportBindings(node) {
return ts.isNamespaceExport(node) ? visitNamespaceExports(node) : visitNamedExports(node);
}
/**
* Visits an export specifier, eliding it if it does not resolve to a value.
*
* @param node The export specifier node.
*/
function visitExportSpecifier(node) {
// Elide an export specifier if it does not reference a value.
return resolver.isValueAliasDeclaration(node) ? node : undefined;
}
/**
* Determines whether to emit an import equals declaration.
*
* @param node The import equals declaration node.
*/
function shouldEmitImportEqualsDeclaration(node) {
// preserve old compiler's behavior: emit 'var' for import declaration (even if we do not consider them referenced) when
// - current file is not external module
// - import declaration is top level and target is value imported by entity name
return resolver.isReferencedAliasDeclaration(node)
|| (!ts.isExternalModule(currentSourceFile)
&& resolver.isTopLevelValueImportEqualsWithEntityName(node));
}
/**
* Visits an import equals declaration.
*
* @param node The import equals declaration node.
*/
function visitImportEqualsDeclaration(node) {
// Always elide type-only imports
if (node.isTypeOnly) {
return undefined;
}
if (ts.isExternalModuleImportEqualsDeclaration(node)) {
var isReferenced = resolver.isReferencedAliasDeclaration(node);
// If the alias is unreferenced but we want to keep the import, replace with 'import "mod"'.
if (!isReferenced && compilerOptions.importsNotUsedAsValues === 1 /* Preserve */) {
return ts.setOriginalNode(ts.setTextRange(factory.createImportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*importClause*/ undefined, node.moduleReference.expression), node), node);
}
return isReferenced ? ts.visitEachChild(node, visitor, context) : undefined;
}
if (!shouldEmitImportEqualsDeclaration(node)) {
return undefined;
}
var moduleReference = ts.createExpressionFromEntityName(factory, node.moduleReference);
ts.setEmitFlags(moduleReference, 1536 /* NoComments */ | 2048 /* NoNestedComments */);
if (isNamedExternalModuleExport(node) || !isExportOfNamespace(node)) {
// export var ${name} = ${moduleReference};
// var ${name} = ${moduleReference};
return ts.setOriginalNode(ts.setTextRange(factory.createVariableStatement(ts.visitNodes(node.modifiers, modifierVisitor, ts.isModifier), factory.createVariableDeclarationList([
ts.setOriginalNode(factory.createVariableDeclaration(node.name,
/*exclamationToken*/ undefined,
/*type*/ undefined, moduleReference), node)
])), node), node);
}
else {
// exports.${name} = ${moduleReference};
return ts.setOriginalNode(createNamespaceExport(node.name, moduleReference, node), node);
}
}
/**
* Gets a value indicating whether the node is exported from a namespace.
*
* @param node The node to test.
*/
function isExportOfNamespace(node) {
return currentNamespace !== undefined && ts.hasSyntacticModifier(node, 1 /* Export */);
}
/**
* Gets a value indicating whether the node is exported from an external module.
*
* @param node The node to test.
*/
function isExternalModuleExport(node) {
return currentNamespace === undefined && ts.hasSyntacticModifier(node, 1 /* Export */);
}
/**
* Gets a value indicating whether the node is a named export from an external module.
*
* @param node The node to test.
*/
function isNamedExternalModuleExport(node) {
return isExternalModuleExport(node)
&& !ts.hasSyntacticModifier(node, 512 /* Default */);
}
/**
* Gets a value indicating whether the node is the default export of an external module.
*
* @param node The node to test.
*/
function isDefaultExternalModuleExport(node) {
return isExternalModuleExport(node)
&& ts.hasSyntacticModifier(node, 512 /* Default */);
}
/**
* Creates a statement for the provided expression. This is used in calls to `map`.
*/
function expressionToStatement(expression) {
return factory.createExpressionStatement(expression);
}
function addExportMemberAssignment(statements, node) {
var expression = factory.createAssignment(factory.getExternalModuleOrNamespaceExportName(currentNamespaceContainerName, node, /*allowComments*/ false, /*allowSourceMaps*/ true), factory.getLocalName(node));
ts.setSourceMapRange(expression, ts.createRange(node.name ? node.name.pos : node.pos, node.end));
var statement = factory.createExpressionStatement(expression);
ts.setSourceMapRange(statement, ts.createRange(-1, node.end));
statements.push(statement);
}
function createNamespaceExport(exportName, exportValue, location) {
return ts.setTextRange(factory.createExpressionStatement(factory.createAssignment(factory.getNamespaceMemberName(currentNamespaceContainerName, exportName, /*allowComments*/ false, /*allowSourceMaps*/ true), exportValue)), location);
}
function createNamespaceExportExpression(exportName, exportValue, location) {
return ts.setTextRange(factory.createAssignment(getNamespaceMemberNameWithSourceMapsAndWithoutComments(exportName), exportValue), location);
}
function getNamespaceMemberNameWithSourceMapsAndWithoutComments(name) {
return factory.getNamespaceMemberName(currentNamespaceContainerName, name, /*allowComments*/ false, /*allowSourceMaps*/ true);
}
/**
* Gets the declaration name used inside of a namespace or enum.
*/
function getNamespaceParameterName(node) {
var name = factory.getGeneratedNameForNode(node);
ts.setSourceMapRange(name, node.name);
return name;
}
/**
* Gets the expression used to refer to a namespace or enum within the body
* of its declaration.
*/
function getNamespaceContainerName(node) {
return factory.getGeneratedNameForNode(node);
}
/**
* Gets a local alias for a class declaration if it is a decorated class with an internal
* reference to the static side of the class. This is necessary to avoid issues with
* double-binding semantics for the class name.
*/
function getClassAliasIfNeeded(node) {
if (resolver.getNodeCheckFlags(node) & 16777216 /* ClassWithConstructorReference */) {
enableSubstitutionForClassAliases();
var classAlias = factory.createUniqueName(node.name && !ts.isGeneratedIdentifier(node.name) ? ts.idText(node.name) : "default");
classAliases[ts.getOriginalNodeId(node)] = classAlias;
hoistVariableDeclaration(classAlias);
return classAlias;
}
}
function getClassPrototype(node) {
return factory.createPropertyAccessExpression(factory.getDeclarationName(node), "prototype");
}
function getClassMemberPrefix(node, member) {
return ts.isStatic(member)
? factory.getDeclarationName(node)
: getClassPrototype(node);
}
function enableSubstitutionForNonQualifiedEnumMembers() {
if ((enabledSubstitutions & 8 /* NonQualifiedEnumMembers */) === 0) {
enabledSubstitutions |= 8 /* NonQualifiedEnumMembers */;
context.enableSubstitution(79 /* Identifier */);
}
}
function enableSubstitutionForClassAliases() {
if ((enabledSubstitutions & 1 /* ClassAliases */) === 0) {
enabledSubstitutions |= 1 /* ClassAliases */;
// We need to enable substitutions for identifiers. This allows us to
// substitute class names inside of a class declaration.
context.enableSubstitution(79 /* Identifier */);
// Keep track of class aliases.
classAliases = [];
}
}
function enableSubstitutionForNamespaceExports() {
if ((enabledSubstitutions & 2 /* NamespaceExports */) === 0) {
enabledSubstitutions |= 2 /* NamespaceExports */;
// We need to enable substitutions for identifiers and shorthand property assignments. This allows us to
// substitute the names of exported members of a namespace.
context.enableSubstitution(79 /* Identifier */);
context.enableSubstitution(292 /* ShorthandPropertyAssignment */);
// We need to be notified when entering and exiting namespaces.
context.enableEmitNotification(259 /* ModuleDeclaration */);
}
}
function isTransformedModuleDeclaration(node) {
return ts.getOriginalNode(node).kind === 259 /* ModuleDeclaration */;
}
function isTransformedEnumDeclaration(node) {
return ts.getOriginalNode(node).kind === 258 /* EnumDeclaration */;
}
/**
* Hook for node emit.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to emit.
* @param emit A callback used to emit the node in the printer.
*/
function onEmitNode(hint, node, emitCallback) {
var savedApplicableSubstitutions = applicableSubstitutions;
var savedCurrentSourceFile = currentSourceFile;
if (ts.isSourceFile(node)) {
currentSourceFile = node;
}
if (enabledSubstitutions & 2 /* NamespaceExports */ && isTransformedModuleDeclaration(node)) {
applicableSubstitutions |= 2 /* NamespaceExports */;
}
if (enabledSubstitutions & 8 /* NonQualifiedEnumMembers */ && isTransformedEnumDeclaration(node)) {
applicableSubstitutions |= 8 /* NonQualifiedEnumMembers */;
}
previousOnEmitNode(hint, node, emitCallback);
applicableSubstitutions = savedApplicableSubstitutions;
currentSourceFile = savedCurrentSourceFile;
}
/**
* Hooks node substitutions.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to substitute.
*/
function onSubstituteNode(hint, node) {
node = previousOnSubstituteNode(hint, node);
if (hint === 1 /* Expression */) {
return substituteExpression(node);
}
else if (ts.isShorthandPropertyAssignment(node)) {
return substituteShorthandPropertyAssignment(node);
}
return node;
}
function substituteShorthandPropertyAssignment(node) {
if (enabledSubstitutions & 2 /* NamespaceExports */) {
var name = node.name;
var exportedName = trySubstituteNamespaceExportedName(name);
if (exportedName) {
// A shorthand property with an assignment initializer is probably part of a
// destructuring assignment
if (node.objectAssignmentInitializer) {
var initializer = factory.createAssignment(exportedName, node.objectAssignmentInitializer);
return ts.setTextRange(factory.createPropertyAssignment(name, initializer), node);
}
return ts.setTextRange(factory.createPropertyAssignment(name, exportedName), node);
}
}
return node;
}
function substituteExpression(node) {
switch (node.kind) {
case 79 /* Identifier */:
return substituteExpressionIdentifier(node);
case 204 /* PropertyAccessExpression */:
return substitutePropertyAccessExpression(node);
case 205 /* ElementAccessExpression */:
return substituteElementAccessExpression(node);
}
return node;
}
function substituteExpressionIdentifier(node) {
return trySubstituteClassAlias(node)
|| trySubstituteNamespaceExportedName(node)
|| node;
}
function trySubstituteClassAlias(node) {
if (enabledSubstitutions & 1 /* ClassAliases */) {
if (resolver.getNodeCheckFlags(node) & 33554432 /* ConstructorReferenceInClass */) {
// Due to the emit for class decorators, any reference to the class from inside of the class body
// must instead be rewritten to point to a temporary variable to avoid issues with the double-bind
// behavior of class names in ES6.
// Also, when emitting statics for class expressions, we must substitute a class alias for
// constructor references in static property initializers.
var declaration = resolver.getReferencedValueDeclaration(node);
if (declaration) {
var classAlias = classAliases[declaration.id]; // TODO: GH#18217
if (classAlias) {
var clone_2 = factory.cloneNode(classAlias);
ts.setSourceMapRange(clone_2, node);
ts.setCommentRange(clone_2, node);
return clone_2;
}
}
}
}
return undefined;
}
function trySubstituteNamespaceExportedName(node) {
// If this is explicitly a local name, do not substitute.
if (enabledSubstitutions & applicableSubstitutions && !ts.isGeneratedIdentifier(node) && !ts.isLocalName(node)) {
// If we are nested within a namespace declaration, we may need to qualifiy
// an identifier that is exported from a merged namespace.
var container = resolver.getReferencedExportContainer(node, /*prefixLocals*/ false);
if (container && container.kind !== 300 /* SourceFile */) {
var substitute = (applicableSubstitutions & 2 /* NamespaceExports */ && container.kind === 259 /* ModuleDeclaration */) ||
(applicableSubstitutions & 8 /* NonQualifiedEnumMembers */ && container.kind === 258 /* EnumDeclaration */);
if (substitute) {
return ts.setTextRange(factory.createPropertyAccessExpression(factory.getGeneratedNameForNode(container), node),
/*location*/ node);
}
}
}
return undefined;
}
function substitutePropertyAccessExpression(node) {
return substituteConstantValue(node);
}
function substituteElementAccessExpression(node) {
return substituteConstantValue(node);
}
function substituteConstantValue(node) {
var constantValue = tryGetConstEnumValue(node);
if (constantValue !== undefined) {
// track the constant value on the node for the printer in needsDotDotForPropertyAccess
ts.setConstantValue(node, constantValue);
var substitute = typeof constantValue === "string" ? factory.createStringLiteral(constantValue) : factory.createNumericLiteral(constantValue);
if (!compilerOptions.removeComments) {
var originalNode = ts.getOriginalNode(node, ts.isAccessExpression);
var propertyName = ts.isPropertyAccessExpression(originalNode)
? ts.declarationNameToString(originalNode.name)
: ts.getTextOfNode(originalNode.argumentExpression);
ts.addSyntheticTrailingComment(substitute, 3 /* MultiLineCommentTrivia */, " " + propertyName + " ");
}
return substitute;
}
return node;
}
function tryGetConstEnumValue(node) {
if (compilerOptions.isolatedModules) {
return undefined;
}
return ts.isPropertyAccessExpression(node) || ts.isElementAccessExpression(node) ? resolver.getConstantValue(node) : undefined;
}
}
ts.transformTypeScript = transformTypeScript;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
var ClassPropertySubstitutionFlags;
(function (ClassPropertySubstitutionFlags) {
/**
* Enables substitutions for class expressions with static fields
* which have initializers that reference the class name.
*/
ClassPropertySubstitutionFlags[ClassPropertySubstitutionFlags["ClassAliases"] = 1] = "ClassAliases";
/**
* Enables substitutions for class expressions with static fields
* which have initializers that reference the 'this' or 'super'.
*/
ClassPropertySubstitutionFlags[ClassPropertySubstitutionFlags["ClassStaticThisOrSuperReference"] = 2] = "ClassStaticThisOrSuperReference";
})(ClassPropertySubstitutionFlags || (ClassPropertySubstitutionFlags = {}));
var PrivateIdentifierKind;
(function (PrivateIdentifierKind) {
PrivateIdentifierKind["Field"] = "f";
PrivateIdentifierKind["Method"] = "m";
PrivateIdentifierKind["Accessor"] = "a";
})(PrivateIdentifierKind = ts.PrivateIdentifierKind || (ts.PrivateIdentifierKind = {}));
var ClassFacts;
(function (ClassFacts) {
ClassFacts[ClassFacts["None"] = 0] = "None";
ClassFacts[ClassFacts["ClassWasDecorated"] = 1] = "ClassWasDecorated";
ClassFacts[ClassFacts["NeedsClassConstructorReference"] = 2] = "NeedsClassConstructorReference";
ClassFacts[ClassFacts["NeedsClassSuperReference"] = 4] = "NeedsClassSuperReference";
ClassFacts[ClassFacts["NeedsSubstitutionForThisInClassStaticField"] = 8] = "NeedsSubstitutionForThisInClassStaticField";
})(ClassFacts || (ClassFacts = {}));
/**
* Transforms ECMAScript Class Syntax.
* TypeScript parameter property syntax is transformed in the TypeScript transformer.
* For now, this transforms public field declarations using TypeScript class semantics,
* where declarations are elided and initializers are transformed as assignments in the constructor.
* When --useDefineForClassFields is on, this transforms to ECMAScript semantics, with Object.defineProperty.
*/
function transformClassFields(context) {
var factory = context.factory, hoistVariableDeclaration = context.hoistVariableDeclaration, endLexicalEnvironment = context.endLexicalEnvironment, startLexicalEnvironment = context.startLexicalEnvironment, resumeLexicalEnvironment = context.resumeLexicalEnvironment, addBlockScopedVariable = context.addBlockScopedVariable;
var resolver = context.getEmitResolver();
var compilerOptions = context.getCompilerOptions();
var languageVersion = ts.getEmitScriptTarget(compilerOptions);
var useDefineForClassFields = ts.getUseDefineForClassFields(compilerOptions);
var shouldTransformPrivateElementsOrClassStaticBlocks = languageVersion < 99 /* ESNext */;
// We don't need to transform `super` property access when targeting ES5, ES3 because
// the es2015 transformation handles those.
var shouldTransformSuperInStaticInitializers = (languageVersion <= 8 /* ES2021 */ || !useDefineForClassFields) && languageVersion >= 2 /* ES2015 */;
var shouldTransformThisInStaticInitializers = languageVersion <= 8 /* ES2021 */ || !useDefineForClassFields;
var previousOnSubstituteNode = context.onSubstituteNode;
context.onSubstituteNode = onSubstituteNode;
var previousOnEmitNode = context.onEmitNode;
context.onEmitNode = onEmitNode;
var enabledSubstitutions;
var classAliases;
/**
* Tracks what computed name expressions originating from elided names must be inlined
* at the next execution site, in document order
*/
var pendingExpressions;
/**
* Tracks what computed name expression statements and static property initializers must be
* emitted at the next execution site, in document order (for decorated classes).
*/
var pendingStatements;
var classLexicalEnvironmentStack = [];
var classLexicalEnvironmentMap = new ts.Map();
var currentClassLexicalEnvironment;
var currentComputedPropertyNameClassLexicalEnvironment;
var currentStaticPropertyDeclarationOrStaticBlock;
return ts.chainBundle(context, transformSourceFile);
function transformSourceFile(node) {
var options = context.getCompilerOptions();
if (node.isDeclarationFile
|| useDefineForClassFields && options.target === 99 /* ESNext */) {
return node;
}
var visited = ts.visitEachChild(node, visitor, context);
ts.addEmitHelpers(visited, context.readEmitHelpers());
return visited;
}
function visitorWorker(node, valueIsDiscarded) {
if (node.transformFlags & 8388608 /* ContainsClassFields */) {
switch (node.kind) {
case 224 /* ClassExpression */:
case 255 /* ClassDeclaration */:
return visitClassLike(node);
case 165 /* PropertyDeclaration */:
return visitPropertyDeclaration(node);
case 235 /* VariableStatement */:
return visitVariableStatement(node);
case 80 /* PrivateIdentifier */:
return visitPrivateIdentifier(node);
case 168 /* ClassStaticBlockDeclaration */:
return visitClassStaticBlockDeclaration(node);
}
}
if (node.transformFlags & 8388608 /* ContainsClassFields */ ||
node.transformFlags & 33554432 /* ContainsLexicalSuper */ &&
shouldTransformSuperInStaticInitializers &&
currentStaticPropertyDeclarationOrStaticBlock &&
currentClassLexicalEnvironment) {
switch (node.kind) {
case 217 /* PrefixUnaryExpression */:
case 218 /* PostfixUnaryExpression */:
return visitPreOrPostfixUnaryExpression(node, valueIsDiscarded);
case 219 /* BinaryExpression */:
return visitBinaryExpression(node, valueIsDiscarded);
case 206 /* CallExpression */:
return visitCallExpression(node);
case 208 /* TaggedTemplateExpression */:
return visitTaggedTemplateExpression(node);
case 204 /* PropertyAccessExpression */:
return visitPropertyAccessExpression(node);
case 205 /* ElementAccessExpression */:
return visitElementAccessExpression(node);
case 236 /* ExpressionStatement */:
return visitExpressionStatement(node);
case 240 /* ForStatement */:
return visitForStatement(node);
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
case 169 /* Constructor */:
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */: {
var savedCurrentStaticPropertyDeclarationOrStaticBlock = currentStaticPropertyDeclarationOrStaticBlock;
currentStaticPropertyDeclarationOrStaticBlock = undefined;
var result = ts.visitEachChild(node, visitor, context);
currentStaticPropertyDeclarationOrStaticBlock = savedCurrentStaticPropertyDeclarationOrStaticBlock;
return result;
}
}
}
return ts.visitEachChild(node, visitor, context);
}
function discardedValueVisitor(node) {
return visitorWorker(node, /*valueIsDiscarded*/ true);
}
function visitor(node) {
return visitorWorker(node, /*valueIsDiscarded*/ false);
}
function heritageClauseVisitor(node) {
switch (node.kind) {
case 289 /* HeritageClause */:
return ts.visitEachChild(node, heritageClauseVisitor, context);
case 226 /* ExpressionWithTypeArguments */:
return visitExpressionWithTypeArguments(node);
}
return visitor(node);
}
function visitorDestructuringTarget(node) {
switch (node.kind) {
case 203 /* ObjectLiteralExpression */:
case 202 /* ArrayLiteralExpression */:
return visitAssignmentPattern(node);
default:
return visitor(node);
}
}
/**
* If we visit a private name, this means it is an undeclared private name.
* Replace it with an empty identifier to indicate a problem with the code.
*/
function visitPrivateIdentifier(node) {
if (!shouldTransformPrivateElementsOrClassStaticBlocks) {
return node;
}
return ts.setOriginalNode(factory.createIdentifier(""), node);
}
/**
* Visits the members of a class that has fields.
*
* @param node The node to visit.
*/
function classElementVisitor(node) {
switch (node.kind) {
case 169 /* Constructor */:
// Constructors for classes using class fields are transformed in
// `visitClassDeclaration` or `visitClassExpression`.
return undefined;
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 167 /* MethodDeclaration */:
return visitMethodOrAccessorDeclaration(node);
case 165 /* PropertyDeclaration */:
return visitPropertyDeclaration(node);
case 160 /* ComputedPropertyName */:
return visitComputedPropertyName(node);
case 232 /* SemicolonClassElement */:
return node;
default:
return visitor(node);
}
}
function visitVariableStatement(node) {
var savedPendingStatements = pendingStatements;
pendingStatements = [];
var visitedNode = ts.visitEachChild(node, visitor, context);
var statement = ts.some(pendingStatements) ? __spreadArray([visitedNode], pendingStatements, true) :
visitedNode;
pendingStatements = savedPendingStatements;
return statement;
}
function visitComputedPropertyName(name) {
var node = ts.visitEachChild(name, visitor, context);
if (ts.some(pendingExpressions)) {
var expressions = pendingExpressions;
expressions.push(node.expression);
pendingExpressions = [];
node = factory.updateComputedPropertyName(node, factory.inlineExpressions(expressions));
}
return node;
}
function visitMethodOrAccessorDeclaration(node) {
ts.Debug.assert(!ts.some(node.decorators));
if (!shouldTransformPrivateElementsOrClassStaticBlocks || !ts.isPrivateIdentifier(node.name)) {
return ts.visitEachChild(node, classElementVisitor, context);
}
// leave invalid code untransformed
var info = accessPrivateIdentifier(node.name);
ts.Debug.assert(info, "Undeclared private name for property declaration.");
if (!info.isValid) {
return node;
}
var functionName = getHoistedFunctionName(node);
if (functionName) {
getPendingExpressions().push(factory.createAssignment(functionName, factory.createFunctionExpression(ts.filter(node.modifiers, function (m) { return !ts.isStaticModifier(m); }), node.asteriskToken, functionName,
/* typeParameters */ undefined, ts.visitParameterList(node.parameters, classElementVisitor, context),
/* type */ undefined, ts.visitFunctionBody(node.body, classElementVisitor, context))));
}
// remove method declaration from class
return undefined;
}
function getHoistedFunctionName(node) {
ts.Debug.assert(ts.isPrivateIdentifier(node.name));
var info = accessPrivateIdentifier(node.name);
ts.Debug.assert(info, "Undeclared private name for property declaration.");
if (info.kind === "m" /* Method */) {
return info.methodName;
}
if (info.kind === "a" /* Accessor */) {
if (ts.isGetAccessor(node)) {
return info.getterName;
}
if (ts.isSetAccessor(node)) {
return info.setterName;
}
}
}
function visitPropertyDeclaration(node) {
ts.Debug.assert(!ts.some(node.decorators));
if (ts.isPrivateIdentifier(node.name)) {
if (!shouldTransformPrivateElementsOrClassStaticBlocks) {
// Initializer is elided as the field is initialized in transformConstructor.
return factory.updatePropertyDeclaration(node,
/*decorators*/ undefined, ts.visitNodes(node.modifiers, visitor, ts.isModifier), node.name,
/*questionOrExclamationToken*/ undefined,
/*type*/ undefined,
/*initializer*/ undefined);
}
// leave invalid code untransformed
var info = accessPrivateIdentifier(node.name);
ts.Debug.assert(info, "Undeclared private name for property declaration.");
if (!info.isValid) {
return node;
}
}
// Create a temporary variable to store a computed property name (if necessary).
// If it's not inlineable, then we emit an expression after the class which assigns
// the property name to the temporary variable.
var expr = getPropertyNameExpressionIfNeeded(node.name, !!node.initializer || useDefineForClassFields);
if (expr && !ts.isSimpleInlineableExpression(expr)) {
getPendingExpressions().push(expr);
}
return undefined;
}
function createPrivateIdentifierAccess(info, receiver) {
return createPrivateIdentifierAccessHelper(info, ts.visitNode(receiver, visitor, ts.isExpression));
}
function createPrivateIdentifierAccessHelper(info, receiver) {
ts.setCommentRange(receiver, ts.moveRangePos(receiver, -1));
switch (info.kind) {
case "a" /* Accessor */:
return context.getEmitHelperFactory().createClassPrivateFieldGetHelper(receiver, info.brandCheckIdentifier, info.kind, info.getterName);
case "m" /* Method */:
return context.getEmitHelperFactory().createClassPrivateFieldGetHelper(receiver, info.brandCheckIdentifier, info.kind, info.methodName);
case "f" /* Field */:
return context.getEmitHelperFactory().createClassPrivateFieldGetHelper(receiver, info.brandCheckIdentifier, info.kind, info.variableName);
default:
ts.Debug.assertNever(info, "Unknown private element type");
}
}
function visitPropertyAccessExpression(node) {
if (shouldTransformPrivateElementsOrClassStaticBlocks && ts.isPrivateIdentifier(node.name)) {
var privateIdentifierInfo = accessPrivateIdentifier(node.name);
if (privateIdentifierInfo) {
return ts.setTextRange(ts.setOriginalNode(createPrivateIdentifierAccess(privateIdentifierInfo, node.expression), node), node);
}
}
if (shouldTransformSuperInStaticInitializers &&
ts.isSuperProperty(node) &&
ts.isIdentifier(node.name) &&
currentStaticPropertyDeclarationOrStaticBlock &&
currentClassLexicalEnvironment) {
var classConstructor = currentClassLexicalEnvironment.classConstructor, superClassReference = currentClassLexicalEnvironment.superClassReference, facts = currentClassLexicalEnvironment.facts;
if (facts & 1 /* ClassWasDecorated */) {
return visitInvalidSuperProperty(node);
}
if (classConstructor && superClassReference) {
// converts `super.x` into `Reflect.get(_baseTemp, "x", _classTemp)`
var superProperty = factory.createReflectGetCall(superClassReference, factory.createStringLiteralFromNode(node.name), classConstructor);
ts.setOriginalNode(superProperty, node.expression);
ts.setTextRange(superProperty, node.expression);
return superProperty;
}
}
return ts.visitEachChild(node, visitor, context);
}
function visitElementAccessExpression(node) {
if (shouldTransformSuperInStaticInitializers &&
ts.isSuperProperty(node) &&
currentStaticPropertyDeclarationOrStaticBlock &&
currentClassLexicalEnvironment) {
var classConstructor = currentClassLexicalEnvironment.classConstructor, superClassReference = currentClassLexicalEnvironment.superClassReference, facts = currentClassLexicalEnvironment.facts;
if (facts & 1 /* ClassWasDecorated */) {
return visitInvalidSuperProperty(node);
}
if (classConstructor && superClassReference) {
// converts `super[x]` into `Reflect.get(_baseTemp, x, _classTemp)`
var superProperty = factory.createReflectGetCall(superClassReference, ts.visitNode(node.argumentExpression, visitor, ts.isExpression), classConstructor);
ts.setOriginalNode(superProperty, node.expression);
ts.setTextRange(superProperty, node.expression);
return superProperty;
}
}
return ts.visitEachChild(node, visitor, context);
}
function visitPreOrPostfixUnaryExpression(node, valueIsDiscarded) {
if (node.operator === 45 /* PlusPlusToken */ || node.operator === 46 /* MinusMinusToken */) {
if (shouldTransformPrivateElementsOrClassStaticBlocks && ts.isPrivateIdentifierPropertyAccessExpression(node.operand)) {
var info = void 0;
if (info = accessPrivateIdentifier(node.operand.name)) {
var receiver = ts.visitNode(node.operand.expression, visitor, ts.isExpression);
var _a = createCopiableReceiverExpr(receiver), readExpression = _a.readExpression, initializeExpression = _a.initializeExpression;
var expression = createPrivateIdentifierAccess(info, readExpression);
var temp = ts.isPrefixUnaryExpression(node) || valueIsDiscarded ? undefined : factory.createTempVariable(hoistVariableDeclaration);
expression = ts.expandPreOrPostfixIncrementOrDecrementExpression(factory, node, expression, hoistVariableDeclaration, temp);
expression = createPrivateIdentifierAssignment(info, initializeExpression || readExpression, expression, 63 /* EqualsToken */);
ts.setOriginalNode(expression, node);
ts.setTextRange(expression, node);
if (temp) {
expression = factory.createComma(expression, temp);
ts.setTextRange(expression, node);
}
return expression;
}
}
else if (shouldTransformSuperInStaticInitializers &&
ts.isSuperProperty(node.operand) &&
currentStaticPropertyDeclarationOrStaticBlock &&
currentClassLexicalEnvironment) {
// converts `++super.a` into `(Reflect.set(_baseTemp, "a", (_a = Reflect.get(_baseTemp, "a", _classTemp), _b = ++_a), _classTemp), _b)`
// converts `++super[f()]` into `(Reflect.set(_baseTemp, _a = f(), (_b = Reflect.get(_baseTemp, _a, _classTemp), _c = ++_b), _classTemp), _c)`
// converts `--super.a` into `(Reflect.set(_baseTemp, "a", (_a = Reflect.get(_baseTemp, "a", _classTemp), _b = --_a), _classTemp), _b)`
// converts `--super[f()]` into `(Reflect.set(_baseTemp, _a = f(), (_b = Reflect.get(_baseTemp, _a, _classTemp), _c = --_b), _classTemp), _c)`
// converts `super.a++` into `(Reflect.set(_baseTemp, "a", (_a = Reflect.get(_baseTemp, "a", _classTemp), _b = _a++), _classTemp), _b)`
// converts `super[f()]++` into `(Reflect.set(_baseTemp, _a = f(), (_b = Reflect.get(_baseTemp, _a, _classTemp), _c = _b++), _classTemp), _c)`
// converts `super.a--` into `(Reflect.set(_baseTemp, "a", (_a = Reflect.get(_baseTemp, "a", _classTemp), _b = _a--), _classTemp), _b)`
// converts `super[f()]--` into `(Reflect.set(_baseTemp, _a = f(), (_b = Reflect.get(_baseTemp, _a, _classTemp), _c = _b--), _classTemp), _c)`
var classConstructor = currentClassLexicalEnvironment.classConstructor, superClassReference = currentClassLexicalEnvironment.superClassReference, facts = currentClassLexicalEnvironment.facts;
if (facts & 1 /* ClassWasDecorated */) {
var operand = visitInvalidSuperProperty(node.operand);
return ts.isPrefixUnaryExpression(node) ?
factory.updatePrefixUnaryExpression(node, operand) :
factory.updatePostfixUnaryExpression(node, operand);
}
if (classConstructor && superClassReference) {
var setterName = void 0;
var getterName = void 0;
if (ts.isPropertyAccessExpression(node.operand)) {
if (ts.isIdentifier(node.operand.name)) {
getterName = setterName = factory.createStringLiteralFromNode(node.operand.name);
}
}
else {
if (ts.isSimpleInlineableExpression(node.operand.argumentExpression)) {
getterName = setterName = node.operand.argumentExpression;
}
else {
getterName = factory.createTempVariable(hoistVariableDeclaration);
setterName = factory.createAssignment(getterName, ts.visitNode(node.operand.argumentExpression, visitor, ts.isExpression));
}
}
if (setterName && getterName) {
var expression = factory.createReflectGetCall(superClassReference, getterName, classConstructor);
ts.setTextRange(expression, node.operand);
var temp = valueIsDiscarded ? undefined : factory.createTempVariable(hoistVariableDeclaration);
expression = ts.expandPreOrPostfixIncrementOrDecrementExpression(factory, node, expression, hoistVariableDeclaration, temp);
expression = factory.createReflectSetCall(superClassReference, setterName, expression, classConstructor);
ts.setOriginalNode(expression, node);
ts.setTextRange(expression, node);
if (temp) {
expression = factory.createComma(expression, temp);
ts.setTextRange(expression, node);
}
return expression;
}
}
}
}
return ts.visitEachChild(node, visitor, context);
}
function visitForStatement(node) {
return factory.updateForStatement(node, ts.visitNode(node.initializer, discardedValueVisitor, ts.isForInitializer), ts.visitNode(node.condition, visitor, ts.isExpression), ts.visitNode(node.incrementor, discardedValueVisitor, ts.isExpression), ts.visitIterationBody(node.statement, visitor, context));
}
function visitExpressionStatement(node) {
return factory.updateExpressionStatement(node, ts.visitNode(node.expression, discardedValueVisitor, ts.isExpression));
}
function createCopiableReceiverExpr(receiver) {
var clone = ts.nodeIsSynthesized(receiver) ? receiver : factory.cloneNode(receiver);
if (ts.isSimpleInlineableExpression(receiver)) {
return { readExpression: clone, initializeExpression: undefined };
}
var readExpression = factory.createTempVariable(hoistVariableDeclaration);
var initializeExpression = factory.createAssignment(readExpression, clone);
return { readExpression: readExpression, initializeExpression: initializeExpression };
}
function visitCallExpression(node) {
if (shouldTransformPrivateElementsOrClassStaticBlocks && ts.isPrivateIdentifierPropertyAccessExpression(node.expression)) {
// Transform call expressions of private names to properly bind the `this` parameter.
var _a = factory.createCallBinding(node.expression, hoistVariableDeclaration, languageVersion), thisArg = _a.thisArg, target = _a.target;
if (ts.isCallChain(node)) {
return factory.updateCallChain(node, factory.createPropertyAccessChain(ts.visitNode(target, visitor), node.questionDotToken, "call"),
/*questionDotToken*/ undefined,
/*typeArguments*/ undefined, __spreadArray([ts.visitNode(thisArg, visitor, ts.isExpression)], ts.visitNodes(node.arguments, visitor, ts.isExpression), true));
}
return factory.updateCallExpression(node, factory.createPropertyAccessExpression(ts.visitNode(target, visitor), "call"),
/*typeArguments*/ undefined, __spreadArray([ts.visitNode(thisArg, visitor, ts.isExpression)], ts.visitNodes(node.arguments, visitor, ts.isExpression), true));
}
if (shouldTransformSuperInStaticInitializers &&
ts.isSuperProperty(node.expression) &&
currentStaticPropertyDeclarationOrStaticBlock &&
(currentClassLexicalEnvironment === null || currentClassLexicalEnvironment === void 0 ? void 0 : currentClassLexicalEnvironment.classConstructor)) {
// converts `super.f(...)` into `Reflect.get(_baseTemp, "f", _classTemp).call(_classTemp, ...)`
var invocation = factory.createFunctionCallCall(ts.visitNode(node.expression, visitor, ts.isExpression), currentClassLexicalEnvironment.classConstructor, ts.visitNodes(node.arguments, visitor, ts.isExpression));
ts.setOriginalNode(invocation, node);
ts.setTextRange(invocation, node);
return invocation;
}
return ts.visitEachChild(node, visitor, context);
}
function visitTaggedTemplateExpression(node) {
if (shouldTransformPrivateElementsOrClassStaticBlocks && ts.isPrivateIdentifierPropertyAccessExpression(node.tag)) {
// Bind the `this` correctly for tagged template literals when the tag is a private identifier property access.
var _a = factory.createCallBinding(node.tag, hoistVariableDeclaration, languageVersion), thisArg = _a.thisArg, target = _a.target;
return factory.updateTaggedTemplateExpression(node, factory.createCallExpression(factory.createPropertyAccessExpression(ts.visitNode(target, visitor), "bind"),
/*typeArguments*/ undefined, [ts.visitNode(thisArg, visitor, ts.isExpression)]),
/*typeArguments*/ undefined, ts.visitNode(node.template, visitor, ts.isTemplateLiteral));
}
if (shouldTransformSuperInStaticInitializers &&
ts.isSuperProperty(node.tag) &&
currentStaticPropertyDeclarationOrStaticBlock &&
(currentClassLexicalEnvironment === null || currentClassLexicalEnvironment === void 0 ? void 0 : currentClassLexicalEnvironment.classConstructor)) {
// converts `` super.f`x` `` into `` Reflect.get(_baseTemp, "f", _classTemp).bind(_classTemp)`x` ``
var invocation = factory.createFunctionBindCall(ts.visitNode(node.tag, visitor, ts.isExpression), currentClassLexicalEnvironment.classConstructor, []);
ts.setOriginalNode(invocation, node);
ts.setTextRange(invocation, node);
return factory.updateTaggedTemplateExpression(node, invocation,
/*typeArguments*/ undefined, ts.visitNode(node.template, visitor, ts.isTemplateLiteral));
}
return ts.visitEachChild(node, visitor, context);
}
function transformClassStaticBlockDeclaration(node) {
if (shouldTransformPrivateElementsOrClassStaticBlocks) {
if (currentClassLexicalEnvironment) {
classLexicalEnvironmentMap.set(ts.getOriginalNodeId(node), currentClassLexicalEnvironment);
}
startLexicalEnvironment();
var savedCurrentStaticPropertyDeclarationOrStaticBlock = currentStaticPropertyDeclarationOrStaticBlock;
currentStaticPropertyDeclarationOrStaticBlock = node;
var statements = ts.visitNodes(node.body.statements, visitor, ts.isStatement);
statements = factory.mergeLexicalEnvironment(statements, endLexicalEnvironment());
currentStaticPropertyDeclarationOrStaticBlock = savedCurrentStaticPropertyDeclarationOrStaticBlock;
var iife = factory.createImmediatelyInvokedArrowFunction(statements);
ts.setOriginalNode(iife, node);
ts.setTextRange(iife, node);
ts.addEmitFlags(iife, 2 /* AdviseOnEmitNode */);
return iife;
}
}
function visitBinaryExpression(node, valueIsDiscarded) {
if (ts.isDestructuringAssignment(node)) {
var savedPendingExpressions = pendingExpressions;
pendingExpressions = undefined;
node = factory.updateBinaryExpression(node, ts.visitNode(node.left, visitorDestructuringTarget), node.operatorToken, ts.visitNode(node.right, visitor));
var expr = ts.some(pendingExpressions) ?
factory.inlineExpressions(ts.compact(__spreadArray(__spreadArray([], pendingExpressions, true), [node], false))) :
node;
pendingExpressions = savedPendingExpressions;
return expr;
}
if (ts.isAssignmentExpression(node)) {
if (shouldTransformPrivateElementsOrClassStaticBlocks && ts.isPrivateIdentifierPropertyAccessExpression(node.left)) {
var info = accessPrivateIdentifier(node.left.name);
if (info) {
return ts.setTextRange(ts.setOriginalNode(createPrivateIdentifierAssignment(info, node.left.expression, node.right, node.operatorToken.kind), node), node);
}
}
else if (shouldTransformSuperInStaticInitializers &&
ts.isSuperProperty(node.left) &&
currentStaticPropertyDeclarationOrStaticBlock &&
currentClassLexicalEnvironment) {
var classConstructor = currentClassLexicalEnvironment.classConstructor, superClassReference = currentClassLexicalEnvironment.superClassReference, facts = currentClassLexicalEnvironment.facts;
if (facts & 1 /* ClassWasDecorated */) {
return factory.updateBinaryExpression(node, visitInvalidSuperProperty(node.left), node.operatorToken, ts.visitNode(node.right, visitor, ts.isExpression));
}
if (classConstructor && superClassReference) {
var setterName = ts.isElementAccessExpression(node.left) ? ts.visitNode(node.left.argumentExpression, visitor, ts.isExpression) :
ts.isIdentifier(node.left.name) ? factory.createStringLiteralFromNode(node.left.name) :
undefined;
if (setterName) {
// converts `super.x = 1` into `(Reflect.set(_baseTemp, "x", _a = 1, _classTemp), _a)`
// converts `super[f()] = 1` into `(Reflect.set(_baseTemp, f(), _a = 1, _classTemp), _a)`
// converts `super.x += 1` into `(Reflect.set(_baseTemp, "x", _a = Reflect.get(_baseTemp, "x", _classtemp) + 1, _classTemp), _a)`
// converts `super[f()] += 1` into `(Reflect.set(_baseTemp, _a = f(), _b = Reflect.get(_baseTemp, _a, _classtemp) + 1, _classTemp), _b)`
var expression = ts.visitNode(node.right, visitor, ts.isExpression);
if (ts.isCompoundAssignment(node.operatorToken.kind)) {
var getterName = setterName;
if (!ts.isSimpleInlineableExpression(setterName)) {
getterName = factory.createTempVariable(hoistVariableDeclaration);
setterName = factory.createAssignment(getterName, setterName);
}
var superPropertyGet = factory.createReflectGetCall(superClassReference, getterName, classConstructor);
ts.setOriginalNode(superPropertyGet, node.left);
ts.setTextRange(superPropertyGet, node.left);
expression = factory.createBinaryExpression(superPropertyGet, ts.getNonAssignmentOperatorForCompoundAssignment(node.operatorToken.kind), expression);
ts.setTextRange(expression, node);
}
var temp = valueIsDiscarded ? undefined : factory.createTempVariable(hoistVariableDeclaration);
if (temp) {
expression = factory.createAssignment(temp, expression);
ts.setTextRange(temp, node);
}
expression = factory.createReflectSetCall(superClassReference, setterName, expression, classConstructor);
ts.setOriginalNode(expression, node);
ts.setTextRange(expression, node);
if (temp) {
expression = factory.createComma(expression, temp);
ts.setTextRange(expression, node);
}
return expression;
}
}
}
}
return ts.visitEachChild(node, visitor, context);
}
function createPrivateIdentifierAssignment(info, receiver, right, operator) {
receiver = ts.visitNode(receiver, visitor, ts.isExpression);
right = ts.visitNode(right, visitor, ts.isExpression);
if (ts.isCompoundAssignment(operator)) {
var _a = createCopiableReceiverExpr(receiver), readExpression = _a.readExpression, initializeExpression = _a.initializeExpression;
receiver = initializeExpression || readExpression;
right = factory.createBinaryExpression(createPrivateIdentifierAccessHelper(info, readExpression), ts.getNonAssignmentOperatorForCompoundAssignment(operator), right);
}
ts.setCommentRange(receiver, ts.moveRangePos(receiver, -1));
switch (info.kind) {
case "a" /* Accessor */:
return context.getEmitHelperFactory().createClassPrivateFieldSetHelper(receiver, info.brandCheckIdentifier, right, info.kind, info.setterName);
case "m" /* Method */:
return context.getEmitHelperFactory().createClassPrivateFieldSetHelper(receiver, info.brandCheckIdentifier, right, info.kind,
/* f */ undefined);
case "f" /* Field */:
return context.getEmitHelperFactory().createClassPrivateFieldSetHelper(receiver, info.brandCheckIdentifier, right, info.kind, info.variableName);
default:
ts.Debug.assertNever(info, "Unknown private element type");
}
}
/**
* Set up the environment for a class.
*/
function visitClassLike(node) {
if (!ts.forEach(node.members, doesClassElementNeedTransform)) {
return ts.visitEachChild(node, visitor, context);
}
var savedPendingExpressions = pendingExpressions;
pendingExpressions = undefined;
startClassLexicalEnvironment();
if (shouldTransformPrivateElementsOrClassStaticBlocks) {
var name = ts.getNameOfDeclaration(node);
if (name && ts.isIdentifier(name)) {
getPrivateIdentifierEnvironment().className = ts.idText(name);
}
var privateInstanceMethodsAndAccessors = getPrivateInstanceMethodsAndAccessors(node);
if (ts.some(privateInstanceMethodsAndAccessors)) {
getPrivateIdentifierEnvironment().weakSetName = createHoistedVariableForClass("instances", privateInstanceMethodsAndAccessors[0].name);
}
}
var result = ts.isClassDeclaration(node) ?
visitClassDeclaration(node) :
visitClassExpression(node);
endClassLexicalEnvironment();
pendingExpressions = savedPendingExpressions;
return result;
}
function doesClassElementNeedTransform(node) {
return ts.isPropertyDeclaration(node) || ts.isClassStaticBlockDeclaration(node) || (shouldTransformPrivateElementsOrClassStaticBlocks && node.name && ts.isPrivateIdentifier(node.name));
}
function getPrivateInstanceMethodsAndAccessors(node) {
return ts.filter(node.members, ts.isNonStaticMethodOrAccessorWithPrivateName);
}
function getClassFacts(node) {
var facts = 0 /* None */;
var original = ts.getOriginalNode(node);
if (ts.isClassDeclaration(original) && ts.classOrConstructorParameterIsDecorated(original)) {
facts |= 1 /* ClassWasDecorated */;
}
for (var _i = 0, _a = node.members; _i < _a.length; _i++) {
var member = _a[_i];
if (!ts.isStatic(member))
continue;
if (member.name && ts.isPrivateIdentifier(member.name) && shouldTransformPrivateElementsOrClassStaticBlocks) {
facts |= 2 /* NeedsClassConstructorReference */;
}
if (ts.isPropertyDeclaration(member) || ts.isClassStaticBlockDeclaration(member)) {
if (shouldTransformThisInStaticInitializers && member.transformFlags & 8192 /* ContainsLexicalThis */) {
facts |= 8 /* NeedsSubstitutionForThisInClassStaticField */;
if (!(facts & 1 /* ClassWasDecorated */)) {
facts |= 2 /* NeedsClassConstructorReference */;
}
}
if (shouldTransformSuperInStaticInitializers && member.transformFlags & 33554432 /* ContainsLexicalSuper */) {
if (!(facts & 1 /* ClassWasDecorated */)) {
facts |= 2 /* NeedsClassConstructorReference */ | 4 /* NeedsClassSuperReference */;
}
}
}
}
return facts;
}
function visitExpressionWithTypeArguments(node) {
var facts = (currentClassLexicalEnvironment === null || currentClassLexicalEnvironment === void 0 ? void 0 : currentClassLexicalEnvironment.facts) || 0 /* None */;
if (facts & 4 /* NeedsClassSuperReference */) {
var temp = factory.createTempVariable(hoistVariableDeclaration, /*reserveInNestedScopes*/ true);
getClassLexicalEnvironment().superClassReference = temp;
return factory.updateExpressionWithTypeArguments(node, factory.createAssignment(temp, ts.visitNode(node.expression, visitor, ts.isExpression)),
/*typeArguments*/ undefined);
}
return ts.visitEachChild(node, visitor, context);
}
function visitClassDeclaration(node) {
var facts = getClassFacts(node);
if (facts) {
getClassLexicalEnvironment().facts = facts;
}
if (facts & 8 /* NeedsSubstitutionForThisInClassStaticField */) {
enableSubstitutionForClassStaticThisOrSuperReference();
}
var staticProperties = ts.getStaticPropertiesAndClassStaticBlock(node);
// If a class has private static fields, or a static field has a `this` or `super` reference,
// then we need to allocate a temp variable to hold on to that reference.
var pendingClassReferenceAssignment;
if (facts & 2 /* NeedsClassConstructorReference */) {
var temp = factory.createTempVariable(hoistVariableDeclaration, /*reservedInNestedScopes*/ true);
getClassLexicalEnvironment().classConstructor = factory.cloneNode(temp);
pendingClassReferenceAssignment = factory.createAssignment(temp, factory.getInternalName(node));
}
var extendsClauseElement = ts.getEffectiveBaseTypeNode(node);
var isDerivedClass = !!(extendsClauseElement && ts.skipOuterExpressions(extendsClauseElement.expression).kind !== 104 /* NullKeyword */);
var statements = [
factory.updateClassDeclaration(node,
/*decorators*/ undefined, node.modifiers, node.name,
/*typeParameters*/ undefined, ts.visitNodes(node.heritageClauses, heritageClauseVisitor, ts.isHeritageClause), transformClassMembers(node, isDerivedClass))
];
if (pendingClassReferenceAssignment) {
getPendingExpressions().unshift(pendingClassReferenceAssignment);
}
// Write any pending expressions from elided or moved computed property names
if (ts.some(pendingExpressions)) {
statements.push(factory.createExpressionStatement(factory.inlineExpressions(pendingExpressions)));
}
// Emit static property assignment. Because classDeclaration is lexically evaluated,
// it is safe to emit static property assignment after classDeclaration
// From ES6 specification:
// HasLexicalDeclaration (N) : Determines if the argument identifier has a binding in this environment record that was created using
// a lexical declaration such as a LexicalDeclaration or a ClassDeclaration.
if (ts.some(staticProperties)) {
addPropertyOrClassStaticBlockStatements(statements, staticProperties, factory.getInternalName(node));
}
return statements;
}
function visitClassExpression(node) {
var facts = getClassFacts(node);
if (facts) {
getClassLexicalEnvironment().facts = facts;
}
if (facts & 8 /* NeedsSubstitutionForThisInClassStaticField */) {
enableSubstitutionForClassStaticThisOrSuperReference();
}
// If this class expression is a transformation of a decorated class declaration,
// then we want to output the pendingExpressions as statements, not as inlined
// expressions with the class statement.
//
// In this case, we use pendingStatements to produce the same output as the
// class declaration transformation. The VariableStatement visitor will insert
// these statements after the class expression variable statement.
var isDecoratedClassDeclaration = !!(facts & 1 /* ClassWasDecorated */);
var staticPropertiesOrClassStaticBlocks = ts.getStaticPropertiesAndClassStaticBlock(node);
var extendsClauseElement = ts.getEffectiveBaseTypeNode(node);
var isDerivedClass = !!(extendsClauseElement && ts.skipOuterExpressions(extendsClauseElement.expression).kind !== 104 /* NullKeyword */);
var isClassWithConstructorReference = resolver.getNodeCheckFlags(node) & 16777216 /* ClassWithConstructorReference */;
var temp;
function createClassTempVar() {
var classCheckFlags = resolver.getNodeCheckFlags(node);
var isClassWithConstructorReference = classCheckFlags & 16777216 /* ClassWithConstructorReference */;
var requiresBlockScopedVar = classCheckFlags & 524288 /* BlockScopedBindingInLoop */;
return factory.createTempVariable(requiresBlockScopedVar ? addBlockScopedVariable : hoistVariableDeclaration, !!isClassWithConstructorReference);
}
if (facts & 2 /* NeedsClassConstructorReference */) {
temp = createClassTempVar();
getClassLexicalEnvironment().classConstructor = factory.cloneNode(temp);
}
var classExpression = factory.updateClassExpression(node, ts.visitNodes(node.decorators, visitor, ts.isDecorator), node.modifiers, node.name,
/*typeParameters*/ undefined, ts.visitNodes(node.heritageClauses, heritageClauseVisitor, ts.isHeritageClause), transformClassMembers(node, isDerivedClass));
var hasTransformableStatics = ts.some(staticPropertiesOrClassStaticBlocks, function (p) { return ts.isClassStaticBlockDeclaration(p) || !!p.initializer || (shouldTransformPrivateElementsOrClassStaticBlocks && ts.isPrivateIdentifier(p.name)); });
if (hasTransformableStatics || ts.some(pendingExpressions)) {
if (isDecoratedClassDeclaration) {
ts.Debug.assertIsDefined(pendingStatements, "Decorated classes transformed by TypeScript are expected to be within a variable declaration.");
// Write any pending expressions from elided or moved computed property names
if (pendingStatements && pendingExpressions && ts.some(pendingExpressions)) {
pendingStatements.push(factory.createExpressionStatement(factory.inlineExpressions(pendingExpressions)));
}
if (pendingStatements && ts.some(staticPropertiesOrClassStaticBlocks)) {
addPropertyOrClassStaticBlockStatements(pendingStatements, staticPropertiesOrClassStaticBlocks, factory.getInternalName(node));
}
if (temp) {
return factory.inlineExpressions([factory.createAssignment(temp, classExpression), temp]);
}
return classExpression;
}
else {
var expressions = [];
temp || (temp = createClassTempVar());
if (isClassWithConstructorReference) {
// record an alias as the class name is not in scope for statics.
enableSubstitutionForClassAliases();
var alias = factory.cloneNode(temp);
alias.autoGenerateFlags &= ~8 /* ReservedInNestedScopes */;
classAliases[ts.getOriginalNodeId(node)] = alias;
}
// To preserve the behavior of the old emitter, we explicitly indent
// the body of a class with static initializers.
ts.setEmitFlags(classExpression, 65536 /* Indented */ | ts.getEmitFlags(classExpression));
expressions.push(ts.startOnNewLine(factory.createAssignment(temp, classExpression)));
// Add any pending expressions leftover from elided or relocated computed property names
ts.addRange(expressions, ts.map(pendingExpressions, ts.startOnNewLine));
ts.addRange(expressions, generateInitializedPropertyExpressionsOrClassStaticBlock(staticPropertiesOrClassStaticBlocks, temp));
expressions.push(ts.startOnNewLine(temp));
return factory.inlineExpressions(expressions);
}
}
return classExpression;
}
function visitClassStaticBlockDeclaration(node) {
if (!shouldTransformPrivateElementsOrClassStaticBlocks) {
return ts.visitEachChild(node, classElementVisitor, context);
}
// ClassStaticBlockDeclaration for classes are transformed in `visitClassDeclaration` or `visitClassExpression`.
return undefined;
}
function transformClassMembers(node, isDerivedClass) {
if (shouldTransformPrivateElementsOrClassStaticBlocks) {
// Declare private names.
for (var _i = 0, _a = node.members; _i < _a.length; _i++) {
var member = _a[_i];
if (ts.isPrivateIdentifierClassElementDeclaration(member)) {
addPrivateIdentifierToEnvironment(member);
}
}
if (ts.some(getPrivateInstanceMethodsAndAccessors(node))) {
createBrandCheckWeakSetForPrivateMethods();
}
}
var members = [];
var constructor = transformConstructor(node, isDerivedClass);
if (constructor) {
members.push(constructor);
}
ts.addRange(members, ts.visitNodes(node.members, classElementVisitor, ts.isClassElement));
return ts.setTextRange(factory.createNodeArray(members), /*location*/ node.members);
}
function createBrandCheckWeakSetForPrivateMethods() {
var weakSetName = getPrivateIdentifierEnvironment().weakSetName;
ts.Debug.assert(weakSetName, "weakSetName should be set in private identifier environment");
getPendingExpressions().push(factory.createAssignment(weakSetName, factory.createNewExpression(factory.createIdentifier("WeakSet"),
/*typeArguments*/ undefined, [])));
}
function isClassElementThatRequiresConstructorStatement(member) {
if (ts.isStatic(member) || ts.hasSyntacticModifier(ts.getOriginalNode(member), 128 /* Abstract */)) {
return false;
}
if (useDefineForClassFields) {
// If we are using define semantics and targeting ESNext or higher,
// then we don't need to transform any class properties.
return languageVersion < 99 /* ESNext */;
}
return ts.isInitializedProperty(member) || shouldTransformPrivateElementsOrClassStaticBlocks && ts.isPrivateIdentifierClassElementDeclaration(member);
}
function transformConstructor(node, isDerivedClass) {
var constructor = ts.visitNode(ts.getFirstConstructorWithBody(node), visitor, ts.isConstructorDeclaration);
var elements = node.members.filter(isClassElementThatRequiresConstructorStatement);
if (!ts.some(elements)) {
return constructor;
}
var parameters = ts.visitParameterList(constructor ? constructor.parameters : undefined, visitor, context);
var body = transformConstructorBody(node, constructor, isDerivedClass);
if (!body) {
return undefined;
}
return ts.startOnNewLine(ts.setOriginalNode(ts.setTextRange(factory.createConstructorDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, parameters !== null && parameters !== void 0 ? parameters : [], body), constructor || node), constructor));
}
function transformConstructorBody(node, constructor, isDerivedClass) {
var properties = ts.getProperties(node, /*requireInitializer*/ false, /*isStatic*/ false);
if (!useDefineForClassFields) {
properties = ts.filter(properties, function (property) { return !!property.initializer || ts.isPrivateIdentifier(property.name); });
}
var privateMethodsAndAccessors = getPrivateInstanceMethodsAndAccessors(node);
var needsConstructorBody = ts.some(properties) || ts.some(privateMethodsAndAccessors);
// Only generate synthetic constructor when there are property initializers to move.
if (!constructor && !needsConstructorBody) {
return ts.visitFunctionBody(/*node*/ undefined, visitor, context);
}
resumeLexicalEnvironment();
var indexOfFirstStatement = 0;
var statements = [];
if (!constructor && isDerivedClass) {
// Add a synthetic `super` call:
//
// super(...arguments);
//
statements.push(factory.createExpressionStatement(factory.createCallExpression(factory.createSuper(),
/*typeArguments*/ undefined, [factory.createSpreadElement(factory.createIdentifier("arguments"))])));
}
if (constructor) {
indexOfFirstStatement = ts.addPrologueDirectivesAndInitialSuperCall(factory, constructor, statements, visitor);
}
// Add the property initializers. Transforms this:
//
// public x = 1;
//
// Into this:
//
// constructor() {
// this.x = 1;
// }
//
if (constructor === null || constructor === void 0 ? void 0 : constructor.body) {
var afterParameterProperties = ts.findIndex(constructor.body.statements, function (s) { return !ts.isParameterPropertyDeclaration(ts.getOriginalNode(s), constructor); }, indexOfFirstStatement);
if (afterParameterProperties === -1) {
afterParameterProperties = constructor.body.statements.length;
}
if (afterParameterProperties > indexOfFirstStatement) {
if (!useDefineForClassFields) {
ts.addRange(statements, ts.visitNodes(constructor.body.statements, visitor, ts.isStatement, indexOfFirstStatement, afterParameterProperties - indexOfFirstStatement));
}
indexOfFirstStatement = afterParameterProperties;
}
}
var receiver = factory.createThis();
// private methods can be called in property initializers, they should execute first.
addMethodStatements(statements, privateMethodsAndAccessors, receiver);
addPropertyOrClassStaticBlockStatements(statements, properties, receiver);
// Add existing statements, skipping the initial super call.
if (constructor) {
ts.addRange(statements, ts.visitNodes(constructor.body.statements, visitor, ts.isStatement, indexOfFirstStatement));
}
statements = factory.mergeLexicalEnvironment(statements, endLexicalEnvironment());
return ts.setTextRange(factory.createBlock(ts.setTextRange(factory.createNodeArray(statements),
/*location*/ constructor ? constructor.body.statements : node.members),
/*multiLine*/ true),
/*location*/ constructor ? constructor.body : undefined);
}
/**
* Generates assignment statements for property initializers.
*
* @param properties An array of property declarations to transform.
* @param receiver The receiver on which each property should be assigned.
*/
function addPropertyOrClassStaticBlockStatements(statements, properties, receiver) {
for (var _i = 0, properties_7 = properties; _i < properties_7.length; _i++) {
var property = properties_7[_i];
var expression = ts.isClassStaticBlockDeclaration(property) ?
transformClassStaticBlockDeclaration(property) :
transformProperty(property, receiver);
if (!expression) {
continue;
}
var statement = factory.createExpressionStatement(expression);
ts.setSourceMapRange(statement, ts.moveRangePastModifiers(property));
ts.setCommentRange(statement, property);
ts.setOriginalNode(statement, property);
statements.push(statement);
}
}
/**
* Generates assignment expressions for property initializers.
*
* @param propertiesOrClassStaticBlocks An array of property declarations to transform.
* @param receiver The receiver on which each property should be assigned.
*/
function generateInitializedPropertyExpressionsOrClassStaticBlock(propertiesOrClassStaticBlocks, receiver) {
var expressions = [];
for (var _i = 0, propertiesOrClassStaticBlocks_1 = propertiesOrClassStaticBlocks; _i < propertiesOrClassStaticBlocks_1.length; _i++) {
var property = propertiesOrClassStaticBlocks_1[_i];
var expression = ts.isClassStaticBlockDeclaration(property) ? transformClassStaticBlockDeclaration(property) : transformProperty(property, receiver);
if (!expression) {
continue;
}
ts.startOnNewLine(expression);
ts.setSourceMapRange(expression, ts.moveRangePastModifiers(property));
ts.setCommentRange(expression, property);
ts.setOriginalNode(expression, property);
expressions.push(expression);
}
return expressions;
}
/**
* Transforms a property initializer into an assignment statement.
*
* @param property The property declaration.
* @param receiver The object receiving the property assignment.
*/
function transformProperty(property, receiver) {
var savedCurrentStaticPropertyDeclarationOrStaticBlock = currentStaticPropertyDeclarationOrStaticBlock;
var transformed = transformPropertyWorker(property, receiver);
if (transformed && ts.hasStaticModifier(property) && (currentClassLexicalEnvironment === null || currentClassLexicalEnvironment === void 0 ? void 0 : currentClassLexicalEnvironment.facts)) {
// capture the lexical environment for the member
ts.setOriginalNode(transformed, property);
ts.addEmitFlags(transformed, 2 /* AdviseOnEmitNode */);
classLexicalEnvironmentMap.set(ts.getOriginalNodeId(transformed), currentClassLexicalEnvironment);
}
currentStaticPropertyDeclarationOrStaticBlock = savedCurrentStaticPropertyDeclarationOrStaticBlock;
return transformed;
}
function transformPropertyWorker(property, receiver) {
var _a;
// We generate a name here in order to reuse the value cached by the relocated computed name expression (which uses the same generated name)
var emitAssignment = !useDefineForClassFields;
var propertyName = ts.isComputedPropertyName(property.name) && !ts.isSimpleInlineableExpression(property.name.expression)
? factory.updateComputedPropertyName(property.name, factory.getGeneratedNameForNode(property.name))
: property.name;
if (ts.hasStaticModifier(property)) {
currentStaticPropertyDeclarationOrStaticBlock = property;
}
if (shouldTransformPrivateElementsOrClassStaticBlocks && ts.isPrivateIdentifier(propertyName)) {
var privateIdentifierInfo = accessPrivateIdentifier(propertyName);
if (privateIdentifierInfo) {
if (privateIdentifierInfo.kind === "f" /* Field */) {
if (!privateIdentifierInfo.isStatic) {
return createPrivateInstanceFieldInitializer(receiver, ts.visitNode(property.initializer, visitor, ts.isExpression), privateIdentifierInfo.brandCheckIdentifier);
}
else {
return createPrivateStaticFieldInitializer(privateIdentifierInfo.variableName, ts.visitNode(property.initializer, visitor, ts.isExpression));
}
}
else {
return undefined;
}
}
else {
ts.Debug.fail("Undeclared private name for property declaration.");
}
}
if ((ts.isPrivateIdentifier(propertyName) || ts.hasStaticModifier(property)) && !property.initializer) {
return undefined;
}
var propertyOriginalNode = ts.getOriginalNode(property);
if (ts.hasSyntacticModifier(propertyOriginalNode, 128 /* Abstract */)) {
return undefined;
}
var initializer = property.initializer || emitAssignment ? (_a = ts.visitNode(property.initializer, visitor, ts.isExpression)) !== null && _a !== void 0 ? _a : factory.createVoidZero()
: ts.isParameterPropertyDeclaration(propertyOriginalNode, propertyOriginalNode.parent) && ts.isIdentifier(propertyName) ? propertyName
: factory.createVoidZero();
if (emitAssignment || ts.isPrivateIdentifier(propertyName)) {
var memberAccess = ts.createMemberAccessForPropertyName(factory, receiver, propertyName, /*location*/ propertyName);
return factory.createAssignment(memberAccess, initializer);
}
else {
var name = ts.isComputedPropertyName(propertyName) ? propertyName.expression
: ts.isIdentifier(propertyName) ? factory.createStringLiteral(ts.unescapeLeadingUnderscores(propertyName.escapedText))
: propertyName;
var descriptor = factory.createPropertyDescriptor({ value: initializer, configurable: true, writable: true, enumerable: true });
return factory.createObjectDefinePropertyCall(receiver, name, descriptor);
}
}
function enableSubstitutionForClassAliases() {
if ((enabledSubstitutions & 1 /* ClassAliases */) === 0) {
enabledSubstitutions |= 1 /* ClassAliases */;
// We need to enable substitutions for identifiers. This allows us to
// substitute class names inside of a class declaration.
context.enableSubstitution(79 /* Identifier */);
// Keep track of class aliases.
classAliases = [];
}
}
function enableSubstitutionForClassStaticThisOrSuperReference() {
if ((enabledSubstitutions & 2 /* ClassStaticThisOrSuperReference */) === 0) {
enabledSubstitutions |= 2 /* ClassStaticThisOrSuperReference */;
// substitute `this` in a static field initializer
context.enableSubstitution(108 /* ThisKeyword */);
// these push a new lexical environment that is not the class lexical environment
context.enableEmitNotification(254 /* FunctionDeclaration */);
context.enableEmitNotification(211 /* FunctionExpression */);
context.enableEmitNotification(169 /* Constructor */);
// these push a new lexical environment that is not the class lexical environment, except
// when they have a computed property name
context.enableEmitNotification(170 /* GetAccessor */);
context.enableEmitNotification(171 /* SetAccessor */);
context.enableEmitNotification(167 /* MethodDeclaration */);
context.enableEmitNotification(165 /* PropertyDeclaration */);
// class lexical environments are restored when entering a computed property name
context.enableEmitNotification(160 /* ComputedPropertyName */);
}
}
/**
* Generates brand-check initializer for private methods.
*
* @param statements Statement list that should be used to append new statements.
* @param methods An array of method declarations.
* @param receiver The receiver on which each method should be assigned.
*/
function addMethodStatements(statements, methods, receiver) {
if (!shouldTransformPrivateElementsOrClassStaticBlocks || !ts.some(methods)) {
return;
}
var weakSetName = getPrivateIdentifierEnvironment().weakSetName;
ts.Debug.assert(weakSetName, "weakSetName should be set in private identifier environment");
statements.push(factory.createExpressionStatement(createPrivateInstanceMethodInitializer(receiver, weakSetName)));
}
function visitInvalidSuperProperty(node) {
return ts.isPropertyAccessExpression(node) ?
factory.updatePropertyAccessExpression(node, factory.createVoidZero(), node.name) :
factory.updateElementAccessExpression(node, factory.createVoidZero(), ts.visitNode(node.argumentExpression, visitor, ts.isExpression));
}
function onEmitNode(hint, node, emitCallback) {
var original = ts.getOriginalNode(node);
if (original.id) {
var classLexicalEnvironment = classLexicalEnvironmentMap.get(original.id);
if (classLexicalEnvironment) {
var savedClassLexicalEnvironment = currentClassLexicalEnvironment;
var savedCurrentComputedPropertyNameClassLexicalEnvironment = currentComputedPropertyNameClassLexicalEnvironment;
currentClassLexicalEnvironment = classLexicalEnvironment;
currentComputedPropertyNameClassLexicalEnvironment = classLexicalEnvironment;
previousOnEmitNode(hint, node, emitCallback);
currentClassLexicalEnvironment = savedClassLexicalEnvironment;
currentComputedPropertyNameClassLexicalEnvironment = savedCurrentComputedPropertyNameClassLexicalEnvironment;
return;
}
}
switch (node.kind) {
case 211 /* FunctionExpression */:
if (ts.isArrowFunction(original) || ts.getEmitFlags(node) & 262144 /* AsyncFunctionBody */) {
break;
}
// falls through
case 254 /* FunctionDeclaration */:
case 169 /* Constructor */: {
var savedClassLexicalEnvironment = currentClassLexicalEnvironment;
var savedCurrentComputedPropertyNameClassLexicalEnvironment = currentComputedPropertyNameClassLexicalEnvironment;
currentClassLexicalEnvironment = undefined;
currentComputedPropertyNameClassLexicalEnvironment = undefined;
previousOnEmitNode(hint, node, emitCallback);
currentClassLexicalEnvironment = savedClassLexicalEnvironment;
currentComputedPropertyNameClassLexicalEnvironment = savedCurrentComputedPropertyNameClassLexicalEnvironment;
return;
}
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 167 /* MethodDeclaration */:
case 165 /* PropertyDeclaration */: {
var savedClassLexicalEnvironment = currentClassLexicalEnvironment;
var savedCurrentComputedPropertyNameClassLexicalEnvironment = currentComputedPropertyNameClassLexicalEnvironment;
currentComputedPropertyNameClassLexicalEnvironment = currentClassLexicalEnvironment;
currentClassLexicalEnvironment = undefined;
previousOnEmitNode(hint, node, emitCallback);
currentClassLexicalEnvironment = savedClassLexicalEnvironment;
currentComputedPropertyNameClassLexicalEnvironment = savedCurrentComputedPropertyNameClassLexicalEnvironment;
return;
}
case 160 /* ComputedPropertyName */: {
var savedClassLexicalEnvironment = currentClassLexicalEnvironment;
var savedCurrentComputedPropertyNameClassLexicalEnvironment = currentComputedPropertyNameClassLexicalEnvironment;
currentClassLexicalEnvironment = currentComputedPropertyNameClassLexicalEnvironment;
currentComputedPropertyNameClassLexicalEnvironment = undefined;
previousOnEmitNode(hint, node, emitCallback);
currentClassLexicalEnvironment = savedClassLexicalEnvironment;
currentComputedPropertyNameClassLexicalEnvironment = savedCurrentComputedPropertyNameClassLexicalEnvironment;
return;
}
}
previousOnEmitNode(hint, node, emitCallback);
}
/**
* Hooks node substitutions.
*
* @param hint The context for the emitter.
* @param node The node to substitute.
*/
function onSubstituteNode(hint, node) {
node = previousOnSubstituteNode(hint, node);
if (hint === 1 /* Expression */) {
return substituteExpression(node);
}
return node;
}
function substituteExpression(node) {
switch (node.kind) {
case 79 /* Identifier */:
return substituteExpressionIdentifier(node);
case 108 /* ThisKeyword */:
return substituteThisExpression(node);
}
return node;
}
function substituteThisExpression(node) {
if (enabledSubstitutions & 2 /* ClassStaticThisOrSuperReference */ && currentClassLexicalEnvironment) {
var facts = currentClassLexicalEnvironment.facts, classConstructor = currentClassLexicalEnvironment.classConstructor;
if (facts & 1 /* ClassWasDecorated */) {
return factory.createParenthesizedExpression(factory.createVoidZero());
}
if (classConstructor) {
return ts.setTextRange(ts.setOriginalNode(factory.cloneNode(classConstructor), node), node);
}
}
return node;
}
function substituteExpressionIdentifier(node) {
return trySubstituteClassAlias(node) || node;
}
function trySubstituteClassAlias(node) {
if (enabledSubstitutions & 1 /* ClassAliases */) {
if (resolver.getNodeCheckFlags(node) & 33554432 /* ConstructorReferenceInClass */) {
// Due to the emit for class decorators, any reference to the class from inside of the class body
// must instead be rewritten to point to a temporary variable to avoid issues with the double-bind
// behavior of class names in ES6.
// Also, when emitting statics for class expressions, we must substitute a class alias for
// constructor references in static property initializers.
var declaration = resolver.getReferencedValueDeclaration(node);
if (declaration) {
var classAlias = classAliases[declaration.id]; // TODO: GH#18217
if (classAlias) {
var clone_3 = factory.cloneNode(classAlias);
ts.setSourceMapRange(clone_3, node);
ts.setCommentRange(clone_3, node);
return clone_3;
}
}
}
}
return undefined;
}
/**
* If the name is a computed property, this function transforms it, then either returns an expression which caches the
* value of the result or the expression itself if the value is either unused or safe to inline into multiple locations
* @param shouldHoist Does the expression need to be reused? (ie, for an initializer or a decorator)
*/
function getPropertyNameExpressionIfNeeded(name, shouldHoist) {
if (ts.isComputedPropertyName(name)) {
var expression = ts.visitNode(name.expression, visitor, ts.isExpression);
var innerExpression = ts.skipPartiallyEmittedExpressions(expression);
var inlinable = ts.isSimpleInlineableExpression(innerExpression);
var alreadyTransformed = ts.isAssignmentExpression(innerExpression) && ts.isGeneratedIdentifier(innerExpression.left);
if (!alreadyTransformed && !inlinable && shouldHoist) {
var generatedName = factory.getGeneratedNameForNode(name);
if (resolver.getNodeCheckFlags(name) & 524288 /* BlockScopedBindingInLoop */) {
addBlockScopedVariable(generatedName);
}
else {
hoistVariableDeclaration(generatedName);
}
return factory.createAssignment(generatedName, expression);
}
return (inlinable || ts.isIdentifier(innerExpression)) ? undefined : expression;
}
}
function startClassLexicalEnvironment() {
classLexicalEnvironmentStack.push(currentClassLexicalEnvironment);
currentClassLexicalEnvironment = undefined;
}
function endClassLexicalEnvironment() {
currentClassLexicalEnvironment = classLexicalEnvironmentStack.pop();
}
function getClassLexicalEnvironment() {
return currentClassLexicalEnvironment || (currentClassLexicalEnvironment = {
facts: 0 /* None */,
classConstructor: undefined,
superClassReference: undefined,
privateIdentifierEnvironment: undefined,
});
}
function getPrivateIdentifierEnvironment() {
var lex = getClassLexicalEnvironment();
lex.privateIdentifierEnvironment || (lex.privateIdentifierEnvironment = {
className: "",
identifiers: new ts.Map()
});
return lex.privateIdentifierEnvironment;
}
function getPendingExpressions() {
return pendingExpressions || (pendingExpressions = []);
}
function addPrivateIdentifierToEnvironment(node) {
var _a;
var text = ts.getTextOfPropertyName(node.name);
var lex = getClassLexicalEnvironment();
var classConstructor = lex.classConstructor;
var privateEnv = getPrivateIdentifierEnvironment();
var weakSetName = privateEnv.weakSetName;
var assignmentExpressions = [];
var privateName = node.name.escapedText;
var previousInfo = privateEnv.identifiers.get(privateName);
var isValid = !isReservedPrivateName(node.name) && previousInfo === undefined;
if (ts.hasStaticModifier(node)) {
ts.Debug.assert(classConstructor, "weakSetName should be set in private identifier environment");
if (ts.isPropertyDeclaration(node)) {
var variableName = createHoistedVariableForPrivateName(text, node);
privateEnv.identifiers.set(privateName, {
kind: "f" /* Field */,
variableName: variableName,
brandCheckIdentifier: classConstructor,
isStatic: true,
isValid: isValid,
});
}
else if (ts.isMethodDeclaration(node)) {
var functionName = createHoistedVariableForPrivateName(text, node);
privateEnv.identifiers.set(privateName, {
kind: "m" /* Method */,
methodName: functionName,
brandCheckIdentifier: classConstructor,
isStatic: true,
isValid: isValid,
});
}
else if (ts.isGetAccessorDeclaration(node)) {
var getterName = createHoistedVariableForPrivateName(text + "_get", node);
if ((previousInfo === null || previousInfo === void 0 ? void 0 : previousInfo.kind) === "a" /* Accessor */ && previousInfo.isStatic && !previousInfo.getterName) {
previousInfo.getterName = getterName;
}
else {
privateEnv.identifiers.set(privateName, {
kind: "a" /* Accessor */,
getterName: getterName,
setterName: undefined,
brandCheckIdentifier: classConstructor,
isStatic: true,
isValid: isValid,
});
}
}
else if (ts.isSetAccessorDeclaration(node)) {
var setterName = createHoistedVariableForPrivateName(text + "_set", node);
if ((previousInfo === null || previousInfo === void 0 ? void 0 : previousInfo.kind) === "a" /* Accessor */ && previousInfo.isStatic && !previousInfo.setterName) {
previousInfo.setterName = setterName;
}
else {
privateEnv.identifiers.set(privateName, {
kind: "a" /* Accessor */,
getterName: undefined,
setterName: setterName,
brandCheckIdentifier: classConstructor,
isStatic: true,
isValid: isValid,
});
}
}
else {
ts.Debug.assertNever(node, "Unknown class element type.");
}
}
else if (ts.isPropertyDeclaration(node)) {
var weakMapName = createHoistedVariableForPrivateName(text, node);
privateEnv.identifiers.set(privateName, {
kind: "f" /* Field */,
brandCheckIdentifier: weakMapName,
isStatic: false,
variableName: undefined,
isValid: isValid,
});
assignmentExpressions.push(factory.createAssignment(weakMapName, factory.createNewExpression(factory.createIdentifier("WeakMap"),
/*typeArguments*/ undefined, [])));
}
else if (ts.isMethodDeclaration(node)) {
ts.Debug.assert(weakSetName, "weakSetName should be set in private identifier environment");
privateEnv.identifiers.set(privateName, {
kind: "m" /* Method */,
methodName: createHoistedVariableForPrivateName(text, node),
brandCheckIdentifier: weakSetName,
isStatic: false,
isValid: isValid,
});
}
else if (ts.isAccessor(node)) {
ts.Debug.assert(weakSetName, "weakSetName should be set in private identifier environment");
if (ts.isGetAccessor(node)) {
var getterName = createHoistedVariableForPrivateName(text + "_get", node);
if ((previousInfo === null || previousInfo === void 0 ? void 0 : previousInfo.kind) === "a" /* Accessor */ && !previousInfo.isStatic && !previousInfo.getterName) {
previousInfo.getterName = getterName;
}
else {
privateEnv.identifiers.set(privateName, {
kind: "a" /* Accessor */,
getterName: getterName,
setterName: undefined,
brandCheckIdentifier: weakSetName,
isStatic: false,
isValid: isValid,
});
}
}
else {
var setterName = createHoistedVariableForPrivateName(text + "_set", node);
if ((previousInfo === null || previousInfo === void 0 ? void 0 : previousInfo.kind) === "a" /* Accessor */ && !previousInfo.isStatic && !previousInfo.setterName) {
previousInfo.setterName = setterName;
}
else {
privateEnv.identifiers.set(privateName, {
kind: "a" /* Accessor */,
getterName: undefined,
setterName: setterName,
brandCheckIdentifier: weakSetName,
isStatic: false,
isValid: isValid,
});
}
}
}
else {
ts.Debug.assertNever(node, "Unknown class element type.");
}
(_a = getPendingExpressions()).push.apply(_a, assignmentExpressions);
}
function createHoistedVariableForClass(name, node) {
var className = getPrivateIdentifierEnvironment().className;
var prefix = className ? "_" + className : "";
var identifier = factory.createUniqueName(prefix + "_" + name, 16 /* Optimistic */);
if (resolver.getNodeCheckFlags(node) & 524288 /* BlockScopedBindingInLoop */) {
addBlockScopedVariable(identifier);
}
else {
hoistVariableDeclaration(identifier);
}
return identifier;
}
function createHoistedVariableForPrivateName(privateName, node) {
return createHoistedVariableForClass(privateName.substring(1), node.name);
}
function accessPrivateIdentifier(name) {
var _a;
if (currentClassLexicalEnvironment === null || currentClassLexicalEnvironment === void 0 ? void 0 : currentClassLexicalEnvironment.privateIdentifierEnvironment) {
var info = currentClassLexicalEnvironment.privateIdentifierEnvironment.identifiers.get(name.escapedText);
if (info) {
return info;
}
}
for (var i = classLexicalEnvironmentStack.length - 1; i >= 0; --i) {
var env = classLexicalEnvironmentStack[i];
if (!env) {
continue;
}
var info = (_a = env.privateIdentifierEnvironment) === null || _a === void 0 ? void 0 : _a.identifiers.get(name.escapedText);
if (info) {
return info;
}
}
return undefined;
}
function wrapPrivateIdentifierForDestructuringTarget(node) {
var parameter = factory.getGeneratedNameForNode(node);
var info = accessPrivateIdentifier(node.name);
if (!info) {
return ts.visitEachChild(node, visitor, context);
}
var receiver = node.expression;
// We cannot copy `this` or `super` into the function because they will be bound
// differently inside the function.
if (ts.isThisProperty(node) || ts.isSuperProperty(node) || !ts.isSimpleCopiableExpression(node.expression)) {
receiver = factory.createTempVariable(hoistVariableDeclaration, /*reservedInNestedScopes*/ true);
getPendingExpressions().push(factory.createBinaryExpression(receiver, 63 /* EqualsToken */, ts.visitNode(node.expression, visitor, ts.isExpression)));
}
return factory.createAssignmentTargetWrapper(parameter, createPrivateIdentifierAssignment(info, receiver, parameter, 63 /* EqualsToken */));
}
function visitArrayAssignmentTarget(node) {
var target = ts.getTargetOfBindingOrAssignmentElement(node);
if (target) {
var wrapped = void 0;
if (ts.isPrivateIdentifierPropertyAccessExpression(target)) {
wrapped = wrapPrivateIdentifierForDestructuringTarget(target);
}
else if (shouldTransformSuperInStaticInitializers &&
ts.isSuperProperty(target) &&
currentStaticPropertyDeclarationOrStaticBlock &&
currentClassLexicalEnvironment) {
var classConstructor = currentClassLexicalEnvironment.classConstructor, superClassReference = currentClassLexicalEnvironment.superClassReference, facts = currentClassLexicalEnvironment.facts;
if (facts & 1 /* ClassWasDecorated */) {
wrapped = visitInvalidSuperProperty(target);
}
else if (classConstructor && superClassReference) {
var name = ts.isElementAccessExpression(target) ? ts.visitNode(target.argumentExpression, visitor, ts.isExpression) :
ts.isIdentifier(target.name) ? factory.createStringLiteralFromNode(target.name) :
undefined;
if (name) {
var temp = factory.createTempVariable(/*recordTempVariable*/ undefined);
wrapped = factory.createAssignmentTargetWrapper(temp, factory.createReflectSetCall(superClassReference, name, temp, classConstructor));
}
}
}
if (wrapped) {
if (ts.isAssignmentExpression(node)) {
return factory.updateBinaryExpression(node, wrapped, node.operatorToken, ts.visitNode(node.right, visitor, ts.isExpression));
}
else if (ts.isSpreadElement(node)) {
return factory.updateSpreadElement(node, wrapped);
}
else {
return wrapped;
}
}
}
return ts.visitNode(node, visitorDestructuringTarget);
}
function visitObjectAssignmentTarget(node) {
if (ts.isObjectBindingOrAssignmentElement(node) && !ts.isShorthandPropertyAssignment(node)) {
var target = ts.getTargetOfBindingOrAssignmentElement(node);
var wrapped = void 0;
if (target) {
if (ts.isPrivateIdentifierPropertyAccessExpression(target)) {
wrapped = wrapPrivateIdentifierForDestructuringTarget(target);
}
else if (shouldTransformSuperInStaticInitializers &&
ts.isSuperProperty(target) &&
currentStaticPropertyDeclarationOrStaticBlock &&
currentClassLexicalEnvironment) {
var classConstructor = currentClassLexicalEnvironment.classConstructor, superClassReference = currentClassLexicalEnvironment.superClassReference, facts = currentClassLexicalEnvironment.facts;
if (facts & 1 /* ClassWasDecorated */) {
wrapped = visitInvalidSuperProperty(target);
}
else if (classConstructor && superClassReference) {
var name = ts.isElementAccessExpression(target) ? ts.visitNode(target.argumentExpression, visitor, ts.isExpression) :
ts.isIdentifier(target.name) ? factory.createStringLiteralFromNode(target.name) :
undefined;
if (name) {
var temp = factory.createTempVariable(/*recordTempVariable*/ undefined);
wrapped = factory.createAssignmentTargetWrapper(temp, factory.createReflectSetCall(superClassReference, name, temp, classConstructor));
}
}
}
}
if (ts.isPropertyAssignment(node)) {
var initializer = ts.getInitializerOfBindingOrAssignmentElement(node);
return factory.updatePropertyAssignment(node, ts.visitNode(node.name, visitor, ts.isPropertyName), wrapped ?
initializer ? factory.createAssignment(wrapped, ts.visitNode(initializer, visitor)) : wrapped :
ts.visitNode(node.initializer, visitorDestructuringTarget, ts.isExpression));
}
if (ts.isSpreadAssignment(node)) {
return factory.updateSpreadAssignment(node, wrapped || ts.visitNode(node.expression, visitorDestructuringTarget, ts.isExpression));
}
ts.Debug.assert(wrapped === undefined, "Should not have generated a wrapped target");
}
return ts.visitNode(node, visitor);
}
function visitAssignmentPattern(node) {
if (ts.isArrayLiteralExpression(node)) {
// Transforms private names in destructuring assignment array bindings.
// Transforms SuperProperty assignments in destructuring assignment array bindings in static initializers.
//
// Source:
// ([ this.#myProp ] = [ "hello" ]);
//
// Transformation:
// [ { set value(x) { this.#myProp = x; } }.value ] = [ "hello" ];
return factory.updateArrayLiteralExpression(node, ts.visitNodes(node.elements, visitArrayAssignmentTarget, ts.isExpression));
}
else {
// Transforms private names in destructuring assignment object bindings.
// Transforms SuperProperty assignments in destructuring assignment object bindings in static initializers.
//
// Source:
// ({ stringProperty: this.#myProp } = { stringProperty: "hello" });
//
// Transformation:
// ({ stringProperty: { set value(x) { this.#myProp = x; } }.value }) = { stringProperty: "hello" };
return factory.updateObjectLiteralExpression(node, ts.visitNodes(node.properties, visitObjectAssignmentTarget, ts.isObjectLiteralElementLike));
}
}
}
ts.transformClassFields = transformClassFields;
function createPrivateStaticFieldInitializer(variableName, initializer) {
return ts.factory.createAssignment(variableName, ts.factory.createObjectLiteralExpression([
ts.factory.createPropertyAssignment("value", initializer || ts.factory.createVoidZero())
]));
}
function createPrivateInstanceFieldInitializer(receiver, initializer, weakMapName) {
return ts.factory.createCallExpression(ts.factory.createPropertyAccessExpression(weakMapName, "set"),
/*typeArguments*/ undefined, [receiver, initializer || ts.factory.createVoidZero()]);
}
function createPrivateInstanceMethodInitializer(receiver, weakSetName) {
return ts.factory.createCallExpression(ts.factory.createPropertyAccessExpression(weakSetName, "add"),
/*typeArguments*/ undefined, [receiver]);
}
function isReservedPrivateName(node) {
return node.escapedText === "#constructor";
}
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
var ES2017SubstitutionFlags;
(function (ES2017SubstitutionFlags) {
/** Enables substitutions for async methods with `super` calls. */
ES2017SubstitutionFlags[ES2017SubstitutionFlags["AsyncMethodsWithSuper"] = 1] = "AsyncMethodsWithSuper";
})(ES2017SubstitutionFlags || (ES2017SubstitutionFlags = {}));
var ContextFlags;
(function (ContextFlags) {
ContextFlags[ContextFlags["NonTopLevel"] = 1] = "NonTopLevel";
ContextFlags[ContextFlags["HasLexicalThis"] = 2] = "HasLexicalThis";
})(ContextFlags || (ContextFlags = {}));
function transformES2017(context) {
var factory = context.factory, emitHelpers = context.getEmitHelperFactory, resumeLexicalEnvironment = context.resumeLexicalEnvironment, endLexicalEnvironment = context.endLexicalEnvironment, hoistVariableDeclaration = context.hoistVariableDeclaration;
var resolver = context.getEmitResolver();
var compilerOptions = context.getCompilerOptions();
var languageVersion = ts.getEmitScriptTarget(compilerOptions);
/**
* Keeps track of whether expression substitution has been enabled for specific edge cases.
* They are persisted between each SourceFile transformation and should not be reset.
*/
var enabledSubstitutions;
/**
* This keeps track of containers where `super` is valid, for use with
* just-in-time substitution for `super` expressions inside of async methods.
*/
var enclosingSuperContainerFlags = 0;
var enclosingFunctionParameterNames;
/**
* Keeps track of property names accessed on super (`super.x`) within async functions.
*/
var capturedSuperProperties;
/** Whether the async function contains an element access on super (`super[x]`). */
var hasSuperElementAccess;
/** A set of node IDs for generated super accessors (variable statements). */
var substitutedSuperAccessors = [];
var contextFlags = 0;
// Save the previous transformation hooks.
var previousOnEmitNode = context.onEmitNode;
var previousOnSubstituteNode = context.onSubstituteNode;
// Set new transformation hooks.
context.onEmitNode = onEmitNode;
context.onSubstituteNode = onSubstituteNode;
return ts.chainBundle(context, transformSourceFile);
function transformSourceFile(node) {
if (node.isDeclarationFile) {
return node;
}
setContextFlag(1 /* NonTopLevel */, false);
setContextFlag(2 /* HasLexicalThis */, !ts.isEffectiveStrictModeSourceFile(node, compilerOptions));
var visited = ts.visitEachChild(node, visitor, context);
ts.addEmitHelpers(visited, context.readEmitHelpers());
return visited;
}
function setContextFlag(flag, val) {
contextFlags = val ? contextFlags | flag : contextFlags & ~flag;
}
function inContext(flags) {
return (contextFlags & flags) !== 0;
}
function inTopLevelContext() {
return !inContext(1 /* NonTopLevel */);
}
function inHasLexicalThisContext() {
return inContext(2 /* HasLexicalThis */);
}
function doWithContext(flags, cb, value) {
var contextFlagsToSet = flags & ~contextFlags;
if (contextFlagsToSet) {
setContextFlag(contextFlagsToSet, /*val*/ true);
var result = cb(value);
setContextFlag(contextFlagsToSet, /*val*/ false);
return result;
}
return cb(value);
}
function visitDefault(node) {
return ts.visitEachChild(node, visitor, context);
}
function visitor(node) {
if ((node.transformFlags & 128 /* ContainsES2017 */) === 0) {
return node;
}
switch (node.kind) {
case 130 /* AsyncKeyword */:
// ES2017 async modifier should be elided for targets < ES2017
return undefined;
case 216 /* AwaitExpression */:
return visitAwaitExpression(node);
case 167 /* MethodDeclaration */:
return doWithContext(1 /* NonTopLevel */ | 2 /* HasLexicalThis */, visitMethodDeclaration, node);
case 254 /* FunctionDeclaration */:
return doWithContext(1 /* NonTopLevel */ | 2 /* HasLexicalThis */, visitFunctionDeclaration, node);
case 211 /* FunctionExpression */:
return doWithContext(1 /* NonTopLevel */ | 2 /* HasLexicalThis */, visitFunctionExpression, node);
case 212 /* ArrowFunction */:
return doWithContext(1 /* NonTopLevel */, visitArrowFunction, node);
case 204 /* PropertyAccessExpression */:
if (capturedSuperProperties && ts.isPropertyAccessExpression(node) && node.expression.kind === 106 /* SuperKeyword */) {
capturedSuperProperties.add(node.name.escapedText);
}
return ts.visitEachChild(node, visitor, context);
case 205 /* ElementAccessExpression */:
if (capturedSuperProperties && node.expression.kind === 106 /* SuperKeyword */) {
hasSuperElementAccess = true;
}
return ts.visitEachChild(node, visitor, context);
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 169 /* Constructor */:
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
return doWithContext(1 /* NonTopLevel */ | 2 /* HasLexicalThis */, visitDefault, node);
default:
return ts.visitEachChild(node, visitor, context);
}
}
function asyncBodyVisitor(node) {
if (ts.isNodeWithPossibleHoistedDeclaration(node)) {
switch (node.kind) {
case 235 /* VariableStatement */:
return visitVariableStatementInAsyncBody(node);
case 240 /* ForStatement */:
return visitForStatementInAsyncBody(node);
case 241 /* ForInStatement */:
return visitForInStatementInAsyncBody(node);
case 242 /* ForOfStatement */:
return visitForOfStatementInAsyncBody(node);
case 290 /* CatchClause */:
return visitCatchClauseInAsyncBody(node);
case 233 /* Block */:
case 247 /* SwitchStatement */:
case 261 /* CaseBlock */:
case 287 /* CaseClause */:
case 288 /* DefaultClause */:
case 250 /* TryStatement */:
case 238 /* DoStatement */:
case 239 /* WhileStatement */:
case 237 /* IfStatement */:
case 246 /* WithStatement */:
case 248 /* LabeledStatement */:
return ts.visitEachChild(node, asyncBodyVisitor, context);
default:
return ts.Debug.assertNever(node, "Unhandled node.");
}
}
return visitor(node);
}
function visitCatchClauseInAsyncBody(node) {
var catchClauseNames = new ts.Set();
recordDeclarationName(node.variableDeclaration, catchClauseNames); // TODO: GH#18217
// names declared in a catch variable are block scoped
var catchClauseUnshadowedNames;
catchClauseNames.forEach(function (_, escapedName) {
if (enclosingFunctionParameterNames.has(escapedName)) {
if (!catchClauseUnshadowedNames) {
catchClauseUnshadowedNames = new ts.Set(enclosingFunctionParameterNames);
}
catchClauseUnshadowedNames.delete(escapedName);
}
});
if (catchClauseUnshadowedNames) {
var savedEnclosingFunctionParameterNames = enclosingFunctionParameterNames;
enclosingFunctionParameterNames = catchClauseUnshadowedNames;
var result = ts.visitEachChild(node, asyncBodyVisitor, context);
enclosingFunctionParameterNames = savedEnclosingFunctionParameterNames;
return result;
}
else {
return ts.visitEachChild(node, asyncBodyVisitor, context);
}
}
function visitVariableStatementInAsyncBody(node) {
if (isVariableDeclarationListWithCollidingName(node.declarationList)) {
var expression = visitVariableDeclarationListWithCollidingNames(node.declarationList, /*hasReceiver*/ false);
return expression ? factory.createExpressionStatement(expression) : undefined;
}
return ts.visitEachChild(node, visitor, context);
}
function visitForInStatementInAsyncBody(node) {
return factory.updateForInStatement(node, isVariableDeclarationListWithCollidingName(node.initializer)
? visitVariableDeclarationListWithCollidingNames(node.initializer, /*hasReceiver*/ true)
: ts.visitNode(node.initializer, visitor, ts.isForInitializer), ts.visitNode(node.expression, visitor, ts.isExpression), ts.visitIterationBody(node.statement, asyncBodyVisitor, context));
}
function visitForOfStatementInAsyncBody(node) {
return factory.updateForOfStatement(node, ts.visitNode(node.awaitModifier, visitor, ts.isToken), isVariableDeclarationListWithCollidingName(node.initializer)
? visitVariableDeclarationListWithCollidingNames(node.initializer, /*hasReceiver*/ true)
: ts.visitNode(node.initializer, visitor, ts.isForInitializer), ts.visitNode(node.expression, visitor, ts.isExpression), ts.visitIterationBody(node.statement, asyncBodyVisitor, context));
}
function visitForStatementInAsyncBody(node) {
var initializer = node.initializer; // TODO: GH#18217
return factory.updateForStatement(node, isVariableDeclarationListWithCollidingName(initializer)
? visitVariableDeclarationListWithCollidingNames(initializer, /*hasReceiver*/ false)
: ts.visitNode(node.initializer, visitor, ts.isForInitializer), ts.visitNode(node.condition, visitor, ts.isExpression), ts.visitNode(node.incrementor, visitor, ts.isExpression), ts.visitIterationBody(node.statement, asyncBodyVisitor, context));
}
/**
* Visits an AwaitExpression node.
*
* This function will be called any time a ES2017 await expression is encountered.
*
* @param node The node to visit.
*/
function visitAwaitExpression(node) {
// do not downlevel a top-level await as it is module syntax...
if (inTopLevelContext()) {
return ts.visitEachChild(node, visitor, context);
}
return ts.setOriginalNode(ts.setTextRange(factory.createYieldExpression(
/*asteriskToken*/ undefined, ts.visitNode(node.expression, visitor, ts.isExpression)), node), node);
}
/**
* Visits a MethodDeclaration node.
*
* This function will be called when one of the following conditions are met:
* - The node is marked as async
*
* @param node The node to visit.
*/
function visitMethodDeclaration(node) {
return factory.updateMethodDeclaration(node,
/*decorators*/ undefined, ts.visitNodes(node.modifiers, visitor, ts.isModifier), node.asteriskToken, node.name,
/*questionToken*/ undefined,
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, ts.getFunctionFlags(node) & 2 /* Async */
? transformAsyncFunctionBody(node)
: ts.visitFunctionBody(node.body, visitor, context));
}
/**
* Visits a FunctionDeclaration node.
*
* This function will be called when one of the following conditions are met:
* - The node is marked async
*
* @param node The node to visit.
*/
function visitFunctionDeclaration(node) {
return factory.updateFunctionDeclaration(node,
/*decorators*/ undefined, ts.visitNodes(node.modifiers, visitor, ts.isModifier), node.asteriskToken, node.name,
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, ts.getFunctionFlags(node) & 2 /* Async */
? transformAsyncFunctionBody(node)
: ts.visitFunctionBody(node.body, visitor, context));
}
/**
* Visits a FunctionExpression node.
*
* This function will be called when one of the following conditions are met:
* - The node is marked async
*
* @param node The node to visit.
*/
function visitFunctionExpression(node) {
return factory.updateFunctionExpression(node, ts.visitNodes(node.modifiers, visitor, ts.isModifier), node.asteriskToken, node.name,
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, ts.getFunctionFlags(node) & 2 /* Async */
? transformAsyncFunctionBody(node)
: ts.visitFunctionBody(node.body, visitor, context));
}
/**
* Visits an ArrowFunction.
*
* This function will be called when one of the following conditions are met:
* - The node is marked async
*
* @param node The node to visit.
*/
function visitArrowFunction(node) {
return factory.updateArrowFunction(node, ts.visitNodes(node.modifiers, visitor, ts.isModifier),
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, node.equalsGreaterThanToken, ts.getFunctionFlags(node) & 2 /* Async */
? transformAsyncFunctionBody(node)
: ts.visitFunctionBody(node.body, visitor, context));
}
function recordDeclarationName(_a, names) {
var name = _a.name;
if (ts.isIdentifier(name)) {
names.add(name.escapedText);
}
else {
for (var _i = 0, _b = name.elements; _i < _b.length; _i++) {
var element = _b[_i];
if (!ts.isOmittedExpression(element)) {
recordDeclarationName(element, names);
}
}
}
}
function isVariableDeclarationListWithCollidingName(node) {
return !!node
&& ts.isVariableDeclarationList(node)
&& !(node.flags & 3 /* BlockScoped */)
&& node.declarations.some(collidesWithParameterName);
}
function visitVariableDeclarationListWithCollidingNames(node, hasReceiver) {
hoistVariableDeclarationList(node);
var variables = ts.getInitializedVariables(node);
if (variables.length === 0) {
if (hasReceiver) {
return ts.visitNode(factory.converters.convertToAssignmentElementTarget(node.declarations[0].name), visitor, ts.isExpression);
}
return undefined;
}
return factory.inlineExpressions(ts.map(variables, transformInitializedVariable));
}
function hoistVariableDeclarationList(node) {
ts.forEach(node.declarations, hoistVariable);
}
function hoistVariable(_a) {
var name = _a.name;
if (ts.isIdentifier(name)) {
hoistVariableDeclaration(name);
}
else {
for (var _i = 0, _b = name.elements; _i < _b.length; _i++) {
var element = _b[_i];
if (!ts.isOmittedExpression(element)) {
hoistVariable(element);
}
}
}
}
function transformInitializedVariable(node) {
var converted = ts.setSourceMapRange(factory.createAssignment(factory.converters.convertToAssignmentElementTarget(node.name), node.initializer), node);
return ts.visitNode(converted, visitor, ts.isExpression);
}
function collidesWithParameterName(_a) {
var name = _a.name;
if (ts.isIdentifier(name)) {
return enclosingFunctionParameterNames.has(name.escapedText);
}
else {
for (var _i = 0, _b = name.elements; _i < _b.length; _i++) {
var element = _b[_i];
if (!ts.isOmittedExpression(element) && collidesWithParameterName(element)) {
return true;
}
}
}
return false;
}
function transformAsyncFunctionBody(node) {
resumeLexicalEnvironment();
var original = ts.getOriginalNode(node, ts.isFunctionLike);
var nodeType = original.type;
var promiseConstructor = languageVersion < 2 /* ES2015 */ ? getPromiseConstructor(nodeType) : undefined;
var isArrowFunction = node.kind === 212 /* ArrowFunction */;
var hasLexicalArguments = (resolver.getNodeCheckFlags(node) & 8192 /* CaptureArguments */) !== 0;
// An async function is emit as an outer function that calls an inner
// generator function. To preserve lexical bindings, we pass the current
// `this` and `arguments` objects to `__awaiter`. The generator function
// passed to `__awaiter` is executed inside of the callback to the
// promise constructor.
var savedEnclosingFunctionParameterNames = enclosingFunctionParameterNames;
enclosingFunctionParameterNames = new ts.Set();
for (var _i = 0, _a = node.parameters; _i < _a.length; _i++) {
var parameter = _a[_i];
recordDeclarationName(parameter, enclosingFunctionParameterNames);
}
var savedCapturedSuperProperties = capturedSuperProperties;
var savedHasSuperElementAccess = hasSuperElementAccess;
if (!isArrowFunction) {
capturedSuperProperties = new ts.Set();
hasSuperElementAccess = false;
}
var result;
if (!isArrowFunction) {
var statements = [];
var statementOffset = factory.copyPrologue(node.body.statements, statements, /*ensureUseStrict*/ false, visitor);
statements.push(factory.createReturnStatement(emitHelpers().createAwaiterHelper(inHasLexicalThisContext(), hasLexicalArguments, promiseConstructor, transformAsyncFunctionBodyWorker(node.body, statementOffset))));
ts.insertStatementsAfterStandardPrologue(statements, endLexicalEnvironment());
// Minor optimization, emit `_super` helper to capture `super` access in an arrow.
// This step isn't needed if we eventually transform this to ES5.
var emitSuperHelpers = languageVersion >= 2 /* ES2015 */ && resolver.getNodeCheckFlags(node) & (4096 /* AsyncMethodWithSuperBinding */ | 2048 /* AsyncMethodWithSuper */);
if (emitSuperHelpers) {
enableSubstitutionForAsyncMethodsWithSuper();
if (capturedSuperProperties.size) {
var variableStatement = createSuperAccessVariableStatement(factory, resolver, node, capturedSuperProperties);
substitutedSuperAccessors[ts.getNodeId(variableStatement)] = true;
ts.insertStatementsAfterStandardPrologue(statements, [variableStatement]);
}
}
var block = factory.createBlock(statements, /*multiLine*/ true);
ts.setTextRange(block, node.body);
if (emitSuperHelpers && hasSuperElementAccess) {
// Emit helpers for super element access expressions (`super[x]`).
if (resolver.getNodeCheckFlags(node) & 4096 /* AsyncMethodWithSuperBinding */) {
ts.addEmitHelper(block, ts.advancedAsyncSuperHelper);
}
else if (resolver.getNodeCheckFlags(node) & 2048 /* AsyncMethodWithSuper */) {
ts.addEmitHelper(block, ts.asyncSuperHelper);
}
}
result = block;
}
else {
var expression = emitHelpers().createAwaiterHelper(inHasLexicalThisContext(), hasLexicalArguments, promiseConstructor, transformAsyncFunctionBodyWorker(node.body));
var declarations = endLexicalEnvironment();
if (ts.some(declarations)) {
var block = factory.converters.convertToFunctionBlock(expression);
result = factory.updateBlock(block, ts.setTextRange(factory.createNodeArray(ts.concatenate(declarations, block.statements)), block.statements));
}
else {
result = expression;
}
}
enclosingFunctionParameterNames = savedEnclosingFunctionParameterNames;
if (!isArrowFunction) {
capturedSuperProperties = savedCapturedSuperProperties;
hasSuperElementAccess = savedHasSuperElementAccess;
}
return result;
}
function transformAsyncFunctionBodyWorker(body, start) {
if (ts.isBlock(body)) {
return factory.updateBlock(body, ts.visitNodes(body.statements, asyncBodyVisitor, ts.isStatement, start));
}
else {
return factory.converters.convertToFunctionBlock(ts.visitNode(body, asyncBodyVisitor, ts.isConciseBody));
}
}
function getPromiseConstructor(type) {
var typeName = type && ts.getEntityNameFromTypeNode(type);
if (typeName && ts.isEntityName(typeName)) {
var serializationKind = resolver.getTypeReferenceSerializationKind(typeName);
if (serializationKind === ts.TypeReferenceSerializationKind.TypeWithConstructSignatureAndValue
|| serializationKind === ts.TypeReferenceSerializationKind.Unknown) {
return typeName;
}
}
return undefined;
}
function enableSubstitutionForAsyncMethodsWithSuper() {
if ((enabledSubstitutions & 1 /* AsyncMethodsWithSuper */) === 0) {
enabledSubstitutions |= 1 /* AsyncMethodsWithSuper */;
// We need to enable substitutions for call, property access, and element access
// if we need to rewrite super calls.
context.enableSubstitution(206 /* CallExpression */);
context.enableSubstitution(204 /* PropertyAccessExpression */);
context.enableSubstitution(205 /* ElementAccessExpression */);
// We need to be notified when entering and exiting declarations that bind super.
context.enableEmitNotification(255 /* ClassDeclaration */);
context.enableEmitNotification(167 /* MethodDeclaration */);
context.enableEmitNotification(170 /* GetAccessor */);
context.enableEmitNotification(171 /* SetAccessor */);
context.enableEmitNotification(169 /* Constructor */);
// We need to be notified when entering the generated accessor arrow functions.
context.enableEmitNotification(235 /* VariableStatement */);
}
}
/**
* Hook for node emit.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to emit.
* @param emit A callback used to emit the node in the printer.
*/
function onEmitNode(hint, node, emitCallback) {
// If we need to support substitutions for `super` in an async method,
// we should track it here.
if (enabledSubstitutions & 1 /* AsyncMethodsWithSuper */ && isSuperContainer(node)) {
var superContainerFlags = resolver.getNodeCheckFlags(node) & (2048 /* AsyncMethodWithSuper */ | 4096 /* AsyncMethodWithSuperBinding */);
if (superContainerFlags !== enclosingSuperContainerFlags) {
var savedEnclosingSuperContainerFlags = enclosingSuperContainerFlags;
enclosingSuperContainerFlags = superContainerFlags;
previousOnEmitNode(hint, node, emitCallback);
enclosingSuperContainerFlags = savedEnclosingSuperContainerFlags;
return;
}
}
// Disable substitution in the generated super accessor itself.
else if (enabledSubstitutions && substitutedSuperAccessors[ts.getNodeId(node)]) {
var savedEnclosingSuperContainerFlags = enclosingSuperContainerFlags;
enclosingSuperContainerFlags = 0;
previousOnEmitNode(hint, node, emitCallback);
enclosingSuperContainerFlags = savedEnclosingSuperContainerFlags;
return;
}
previousOnEmitNode(hint, node, emitCallback);
}
/**
* Hooks node substitutions.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to substitute.
*/
function onSubstituteNode(hint, node) {
node = previousOnSubstituteNode(hint, node);
if (hint === 1 /* Expression */ && enclosingSuperContainerFlags) {
return substituteExpression(node);
}
return node;
}
function substituteExpression(node) {
switch (node.kind) {
case 204 /* PropertyAccessExpression */:
return substitutePropertyAccessExpression(node);
case 205 /* ElementAccessExpression */:
return substituteElementAccessExpression(node);
case 206 /* CallExpression */:
return substituteCallExpression(node);
}
return node;
}
function substitutePropertyAccessExpression(node) {
if (node.expression.kind === 106 /* SuperKeyword */) {
return ts.setTextRange(factory.createPropertyAccessExpression(factory.createUniqueName("_super", 16 /* Optimistic */ | 32 /* FileLevel */), node.name), node);
}
return node;
}
function substituteElementAccessExpression(node) {
if (node.expression.kind === 106 /* SuperKeyword */) {
return createSuperElementAccessInAsyncMethod(node.argumentExpression, node);
}
return node;
}
function substituteCallExpression(node) {
var expression = node.expression;
if (ts.isSuperProperty(expression)) {
var argumentExpression = ts.isPropertyAccessExpression(expression)
? substitutePropertyAccessExpression(expression)
: substituteElementAccessExpression(expression);
return factory.createCallExpression(factory.createPropertyAccessExpression(argumentExpression, "call"),
/*typeArguments*/ undefined, __spreadArray([
factory.createThis()
], node.arguments, true));
}
return node;
}
function isSuperContainer(node) {
var kind = node.kind;
return kind === 255 /* ClassDeclaration */
|| kind === 169 /* Constructor */
|| kind === 167 /* MethodDeclaration */
|| kind === 170 /* GetAccessor */
|| kind === 171 /* SetAccessor */;
}
function createSuperElementAccessInAsyncMethod(argumentExpression, location) {
if (enclosingSuperContainerFlags & 4096 /* AsyncMethodWithSuperBinding */) {
return ts.setTextRange(factory.createPropertyAccessExpression(factory.createCallExpression(factory.createUniqueName("_superIndex", 16 /* Optimistic */ | 32 /* FileLevel */),
/*typeArguments*/ undefined, [argumentExpression]), "value"), location);
}
else {
return ts.setTextRange(factory.createCallExpression(factory.createUniqueName("_superIndex", 16 /* Optimistic */ | 32 /* FileLevel */),
/*typeArguments*/ undefined, [argumentExpression]), location);
}
}
}
ts.transformES2017 = transformES2017;
/** Creates a variable named `_super` with accessor properties for the given property names. */
function createSuperAccessVariableStatement(factory, resolver, node, names) {
// Create a variable declaration with a getter/setter (if binding) definition for each name:
// const _super = Object.create(null, { x: { get: () => super.x, set: (v) => super.x = v }, ... });
var hasBinding = (resolver.getNodeCheckFlags(node) & 4096 /* AsyncMethodWithSuperBinding */) !== 0;
var accessors = [];
names.forEach(function (_, key) {
var name = ts.unescapeLeadingUnderscores(key);
var getterAndSetter = [];
getterAndSetter.push(factory.createPropertyAssignment("get", factory.createArrowFunction(
/* modifiers */ undefined,
/* typeParameters */ undefined,
/* parameters */ [],
/* type */ undefined,
/* equalsGreaterThanToken */ undefined, ts.setEmitFlags(factory.createPropertyAccessExpression(ts.setEmitFlags(factory.createSuper(), 4 /* NoSubstitution */), name), 4 /* NoSubstitution */))));
if (hasBinding) {
getterAndSetter.push(factory.createPropertyAssignment("set", factory.createArrowFunction(
/* modifiers */ undefined,
/* typeParameters */ undefined,
/* parameters */ [
factory.createParameterDeclaration(
/* decorators */ undefined,
/* modifiers */ undefined,
/* dotDotDotToken */ undefined, "v",
/* questionToken */ undefined,
/* type */ undefined,
/* initializer */ undefined)
],
/* type */ undefined,
/* equalsGreaterThanToken */ undefined, factory.createAssignment(ts.setEmitFlags(factory.createPropertyAccessExpression(ts.setEmitFlags(factory.createSuper(), 4 /* NoSubstitution */), name), 4 /* NoSubstitution */), factory.createIdentifier("v")))));
}
accessors.push(factory.createPropertyAssignment(name, factory.createObjectLiteralExpression(getterAndSetter)));
});
return factory.createVariableStatement(
/* modifiers */ undefined, factory.createVariableDeclarationList([
factory.createVariableDeclaration(factory.createUniqueName("_super", 16 /* Optimistic */ | 32 /* FileLevel */),
/*exclamationToken*/ undefined,
/* type */ undefined, factory.createCallExpression(factory.createPropertyAccessExpression(factory.createIdentifier("Object"), "create"),
/* typeArguments */ undefined, [
factory.createNull(),
factory.createObjectLiteralExpression(accessors, /* multiline */ true)
]))
], 2 /* Const */));
}
ts.createSuperAccessVariableStatement = createSuperAccessVariableStatement;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
var ESNextSubstitutionFlags;
(function (ESNextSubstitutionFlags) {
/** Enables substitutions for async methods with `super` calls. */
ESNextSubstitutionFlags[ESNextSubstitutionFlags["AsyncMethodsWithSuper"] = 1] = "AsyncMethodsWithSuper";
})(ESNextSubstitutionFlags || (ESNextSubstitutionFlags = {}));
// Facts we track as we traverse the tree
var HierarchyFacts;
(function (HierarchyFacts) {
HierarchyFacts[HierarchyFacts["None"] = 0] = "None";
//
// Ancestor facts
//
HierarchyFacts[HierarchyFacts["HasLexicalThis"] = 1] = "HasLexicalThis";
HierarchyFacts[HierarchyFacts["IterationContainer"] = 2] = "IterationContainer";
// NOTE: do not add more ancestor flags without also updating AncestorFactsMask below.
//
// Ancestor masks
//
HierarchyFacts[HierarchyFacts["AncestorFactsMask"] = 3] = "AncestorFactsMask";
HierarchyFacts[HierarchyFacts["SourceFileIncludes"] = 1] = "SourceFileIncludes";
HierarchyFacts[HierarchyFacts["SourceFileExcludes"] = 2] = "SourceFileExcludes";
HierarchyFacts[HierarchyFacts["StrictModeSourceFileIncludes"] = 0] = "StrictModeSourceFileIncludes";
HierarchyFacts[HierarchyFacts["ClassOrFunctionIncludes"] = 1] = "ClassOrFunctionIncludes";
HierarchyFacts[HierarchyFacts["ClassOrFunctionExcludes"] = 2] = "ClassOrFunctionExcludes";
HierarchyFacts[HierarchyFacts["ArrowFunctionIncludes"] = 0] = "ArrowFunctionIncludes";
HierarchyFacts[HierarchyFacts["ArrowFunctionExcludes"] = 2] = "ArrowFunctionExcludes";
HierarchyFacts[HierarchyFacts["IterationStatementIncludes"] = 2] = "IterationStatementIncludes";
HierarchyFacts[HierarchyFacts["IterationStatementExcludes"] = 0] = "IterationStatementExcludes";
})(HierarchyFacts || (HierarchyFacts = {}));
function transformES2018(context) {
var factory = context.factory, emitHelpers = context.getEmitHelperFactory, resumeLexicalEnvironment = context.resumeLexicalEnvironment, endLexicalEnvironment = context.endLexicalEnvironment, hoistVariableDeclaration = context.hoistVariableDeclaration;
var resolver = context.getEmitResolver();
var compilerOptions = context.getCompilerOptions();
var languageVersion = ts.getEmitScriptTarget(compilerOptions);
var previousOnEmitNode = context.onEmitNode;
context.onEmitNode = onEmitNode;
var previousOnSubstituteNode = context.onSubstituteNode;
context.onSubstituteNode = onSubstituteNode;
var exportedVariableStatement = false;
var enabledSubstitutions;
var enclosingFunctionFlags;
var enclosingSuperContainerFlags = 0;
var hierarchyFacts = 0;
var currentSourceFile;
var taggedTemplateStringDeclarations;
/** Keeps track of property names accessed on super (`super.x`) within async functions. */
var capturedSuperProperties;
/** Whether the async function contains an element access on super (`super[x]`). */
var hasSuperElementAccess;
/** A set of node IDs for generated super accessors. */
var substitutedSuperAccessors = [];
return ts.chainBundle(context, transformSourceFile);
function affectsSubtree(excludeFacts, includeFacts) {
return hierarchyFacts !== (hierarchyFacts & ~excludeFacts | includeFacts);
}
/**
* Sets the `HierarchyFacts` for this node prior to visiting this node's subtree, returning the facts set prior to modification.
* @param excludeFacts The existing `HierarchyFacts` to reset before visiting the subtree.
* @param includeFacts The new `HierarchyFacts` to set before visiting the subtree.
*/
function enterSubtree(excludeFacts, includeFacts) {
var ancestorFacts = hierarchyFacts;
hierarchyFacts = (hierarchyFacts & ~excludeFacts | includeFacts) & 3 /* AncestorFactsMask */;
return ancestorFacts;
}
/**
* Restores the `HierarchyFacts` for this node's ancestor after visiting this node's
* subtree.
* @param ancestorFacts The `HierarchyFacts` of the ancestor to restore after visiting the subtree.
*/
function exitSubtree(ancestorFacts) {
hierarchyFacts = ancestorFacts;
}
function recordTaggedTemplateString(temp) {
taggedTemplateStringDeclarations = ts.append(taggedTemplateStringDeclarations, factory.createVariableDeclaration(temp));
}
function transformSourceFile(node) {
if (node.isDeclarationFile) {
return node;
}
currentSourceFile = node;
var visited = visitSourceFile(node);
ts.addEmitHelpers(visited, context.readEmitHelpers());
currentSourceFile = undefined;
taggedTemplateStringDeclarations = undefined;
return visited;
}
function visitor(node) {
return visitorWorker(node, /*expressionResultIsUnused*/ false);
}
function visitorWithUnusedExpressionResult(node) {
return visitorWorker(node, /*expressionResultIsUnused*/ true);
}
function visitorNoAsyncModifier(node) {
if (node.kind === 130 /* AsyncKeyword */) {
return undefined;
}
return node;
}
function doWithHierarchyFacts(cb, value, excludeFacts, includeFacts) {
if (affectsSubtree(excludeFacts, includeFacts)) {
var ancestorFacts = enterSubtree(excludeFacts, includeFacts);
var result = cb(value);
exitSubtree(ancestorFacts);
return result;
}
return cb(value);
}
function visitDefault(node) {
return ts.visitEachChild(node, visitor, context);
}
/**
* @param expressionResultIsUnused Indicates the result of an expression is unused by the parent node (i.e., the left side of a comma or the
* expression of an `ExpressionStatement`).
*/
function visitorWorker(node, expressionResultIsUnused) {
if ((node.transformFlags & 64 /* ContainsES2018 */) === 0) {
return node;
}
switch (node.kind) {
case 216 /* AwaitExpression */:
return visitAwaitExpression(node);
case 222 /* YieldExpression */:
return visitYieldExpression(node);
case 245 /* ReturnStatement */:
return visitReturnStatement(node);
case 248 /* LabeledStatement */:
return visitLabeledStatement(node);
case 203 /* ObjectLiteralExpression */:
return visitObjectLiteralExpression(node);
case 219 /* BinaryExpression */:
return visitBinaryExpression(node, expressionResultIsUnused);
case 346 /* CommaListExpression */:
return visitCommaListExpression(node, expressionResultIsUnused);
case 290 /* CatchClause */:
return visitCatchClause(node);
case 235 /* VariableStatement */:
return visitVariableStatement(node);
case 252 /* VariableDeclaration */:
return visitVariableDeclaration(node);
case 238 /* DoStatement */:
case 239 /* WhileStatement */:
case 241 /* ForInStatement */:
return doWithHierarchyFacts(visitDefault, node, 0 /* IterationStatementExcludes */, 2 /* IterationStatementIncludes */);
case 242 /* ForOfStatement */:
return visitForOfStatement(node, /*outermostLabeledStatement*/ undefined);
case 240 /* ForStatement */:
return doWithHierarchyFacts(visitForStatement, node, 0 /* IterationStatementExcludes */, 2 /* IterationStatementIncludes */);
case 215 /* VoidExpression */:
return visitVoidExpression(node);
case 169 /* Constructor */:
return doWithHierarchyFacts(visitConstructorDeclaration, node, 2 /* ClassOrFunctionExcludes */, 1 /* ClassOrFunctionIncludes */);
case 167 /* MethodDeclaration */:
return doWithHierarchyFacts(visitMethodDeclaration, node, 2 /* ClassOrFunctionExcludes */, 1 /* ClassOrFunctionIncludes */);
case 170 /* GetAccessor */:
return doWithHierarchyFacts(visitGetAccessorDeclaration, node, 2 /* ClassOrFunctionExcludes */, 1 /* ClassOrFunctionIncludes */);
case 171 /* SetAccessor */:
return doWithHierarchyFacts(visitSetAccessorDeclaration, node, 2 /* ClassOrFunctionExcludes */, 1 /* ClassOrFunctionIncludes */);
case 254 /* FunctionDeclaration */:
return doWithHierarchyFacts(visitFunctionDeclaration, node, 2 /* ClassOrFunctionExcludes */, 1 /* ClassOrFunctionIncludes */);
case 211 /* FunctionExpression */:
return doWithHierarchyFacts(visitFunctionExpression, node, 2 /* ClassOrFunctionExcludes */, 1 /* ClassOrFunctionIncludes */);
case 212 /* ArrowFunction */:
return doWithHierarchyFacts(visitArrowFunction, node, 2 /* ArrowFunctionExcludes */, 0 /* ArrowFunctionIncludes */);
case 162 /* Parameter */:
return visitParameter(node);
case 236 /* ExpressionStatement */:
return visitExpressionStatement(node);
case 210 /* ParenthesizedExpression */:
return visitParenthesizedExpression(node, expressionResultIsUnused);
case 208 /* TaggedTemplateExpression */:
return visitTaggedTemplateExpression(node);
case 204 /* PropertyAccessExpression */:
if (capturedSuperProperties && ts.isPropertyAccessExpression(node) && node.expression.kind === 106 /* SuperKeyword */) {
capturedSuperProperties.add(node.name.escapedText);
}
return ts.visitEachChild(node, visitor, context);
case 205 /* ElementAccessExpression */:
if (capturedSuperProperties && node.expression.kind === 106 /* SuperKeyword */) {
hasSuperElementAccess = true;
}
return ts.visitEachChild(node, visitor, context);
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
return doWithHierarchyFacts(visitDefault, node, 2 /* ClassOrFunctionExcludes */, 1 /* ClassOrFunctionIncludes */);
default:
return ts.visitEachChild(node, visitor, context);
}
}
function visitAwaitExpression(node) {
if (enclosingFunctionFlags & 2 /* Async */ && enclosingFunctionFlags & 1 /* Generator */) {
return ts.setOriginalNode(ts.setTextRange(factory.createYieldExpression(/*asteriskToken*/ undefined, emitHelpers().createAwaitHelper(ts.visitNode(node.expression, visitor, ts.isExpression))),
/*location*/ node), node);
}
return ts.visitEachChild(node, visitor, context);
}
function visitYieldExpression(node) {
if (enclosingFunctionFlags & 2 /* Async */ && enclosingFunctionFlags & 1 /* Generator */) {
if (node.asteriskToken) {
var expression = ts.visitNode(ts.Debug.assertDefined(node.expression), visitor, ts.isExpression);
return ts.setOriginalNode(ts.setTextRange(factory.createYieldExpression(
/*asteriskToken*/ undefined, emitHelpers().createAwaitHelper(factory.updateYieldExpression(node, node.asteriskToken, ts.setTextRange(emitHelpers().createAsyncDelegatorHelper(ts.setTextRange(emitHelpers().createAsyncValuesHelper(expression), expression)), expression)))), node), node);
}
return ts.setOriginalNode(ts.setTextRange(factory.createYieldExpression(
/*asteriskToken*/ undefined, createDownlevelAwait(node.expression
? ts.visitNode(node.expression, visitor, ts.isExpression)
: factory.createVoidZero())), node), node);
}
return ts.visitEachChild(node, visitor, context);
}
function visitReturnStatement(node) {
if (enclosingFunctionFlags & 2 /* Async */ && enclosingFunctionFlags & 1 /* Generator */) {
return factory.updateReturnStatement(node, createDownlevelAwait(node.expression ? ts.visitNode(node.expression, visitor, ts.isExpression) : factory.createVoidZero()));
}
return ts.visitEachChild(node, visitor, context);
}
function visitLabeledStatement(node) {
if (enclosingFunctionFlags & 2 /* Async */) {
var statement = ts.unwrapInnermostStatementOfLabel(node);
if (statement.kind === 242 /* ForOfStatement */ && statement.awaitModifier) {
return visitForOfStatement(statement, node);
}
return factory.restoreEnclosingLabel(ts.visitNode(statement, visitor, ts.isStatement, factory.liftToBlock), node);
}
return ts.visitEachChild(node, visitor, context);
}
function chunkObjectLiteralElements(elements) {
var chunkObject;
var objects = [];
for (var _i = 0, elements_4 = elements; _i < elements_4.length; _i++) {
var e = elements_4[_i];
if (e.kind === 293 /* SpreadAssignment */) {
if (chunkObject) {
objects.push(factory.createObjectLiteralExpression(chunkObject));
chunkObject = undefined;
}
var target = e.expression;
objects.push(ts.visitNode(target, visitor, ts.isExpression));
}
else {
chunkObject = ts.append(chunkObject, e.kind === 291 /* PropertyAssignment */
? factory.createPropertyAssignment(e.name, ts.visitNode(e.initializer, visitor, ts.isExpression))
: ts.visitNode(e, visitor, ts.isObjectLiteralElementLike));
}
}
if (chunkObject) {
objects.push(factory.createObjectLiteralExpression(chunkObject));
}
return objects;
}
function visitObjectLiteralExpression(node) {
if (node.transformFlags & 32768 /* ContainsObjectRestOrSpread */) {
// spread elements emit like so:
// non-spread elements are chunked together into object literals, and then all are passed to __assign:
// { a, ...o, b } => __assign(__assign({a}, o), {b});
// If the first element is a spread element, then the first argument to __assign is {}:
// { ...o, a, b, ...o2 } => __assign(__assign(__assign({}, o), {a, b}), o2)
//
// We cannot call __assign with more than two elements, since any element could cause side effects. For
// example:
// var k = { a: 1, b: 2 };
// var o = { a: 3, ...k, b: k.a++ };
// // expected: { a: 1, b: 1 }
// If we translate the above to `__assign({ a: 3 }, k, { b: k.a++ })`, the `k.a++` will evaluate before
// `k` is spread and we end up with `{ a: 2, b: 1 }`.
//
// This also occurs for spread elements, not just property assignments:
// var k = { a: 1, get b() { l = { z: 9 }; return 2; } };
// var l = { c: 3 };
// var o = { ...k, ...l };
// // expected: { a: 1, b: 2, z: 9 }
// If we translate the above to `__assign({}, k, l)`, the `l` will evaluate before `k` is spread and we
// end up with `{ a: 1, b: 2, c: 3 }`
var objects = chunkObjectLiteralElements(node.properties);
if (objects.length && objects[0].kind !== 203 /* ObjectLiteralExpression */) {
objects.unshift(factory.createObjectLiteralExpression());
}
var expression = objects[0];
if (objects.length > 1) {
for (var i = 1; i < objects.length; i++) {
expression = emitHelpers().createAssignHelper([expression, objects[i]]);
}
return expression;
}
else {
return emitHelpers().createAssignHelper(objects);
}
}
return ts.visitEachChild(node, visitor, context);
}
function visitExpressionStatement(node) {
return ts.visitEachChild(node, visitorWithUnusedExpressionResult, context);
}
/**
* @param expressionResultIsUnused Indicates the result of an expression is unused by the parent node (i.e., the left side of a comma or the
* expression of an `ExpressionStatement`).
*/
function visitParenthesizedExpression(node, expressionResultIsUnused) {
return ts.visitEachChild(node, expressionResultIsUnused ? visitorWithUnusedExpressionResult : visitor, context);
}
function visitSourceFile(node) {
var ancestorFacts = enterSubtree(2 /* SourceFileExcludes */, ts.isEffectiveStrictModeSourceFile(node, compilerOptions) ?
0 /* StrictModeSourceFileIncludes */ :
1 /* SourceFileIncludes */);
exportedVariableStatement = false;
var visited = ts.visitEachChild(node, visitor, context);
var statement = ts.concatenate(visited.statements, taggedTemplateStringDeclarations && [
factory.createVariableStatement(/*modifiers*/ undefined, factory.createVariableDeclarationList(taggedTemplateStringDeclarations))
]);
var result = factory.updateSourceFile(visited, ts.setTextRange(factory.createNodeArray(statement), node.statements));
exitSubtree(ancestorFacts);
return result;
}
function visitTaggedTemplateExpression(node) {
return ts.processTaggedTemplateExpression(context, node, visitor, currentSourceFile, recordTaggedTemplateString, ts.ProcessLevel.LiftRestriction);
}
/**
* Visits a BinaryExpression that contains a destructuring assignment.
*
* @param node A BinaryExpression node.
* @param expressionResultIsUnused Indicates the result of an expression is unused by the parent node (i.e., the left side of a comma or the
* expression of an `ExpressionStatement`).
*/
function visitBinaryExpression(node, expressionResultIsUnused) {
if (ts.isDestructuringAssignment(node) && node.left.transformFlags & 32768 /* ContainsObjectRestOrSpread */) {
return ts.flattenDestructuringAssignment(node, visitor, context, 1 /* ObjectRest */, !expressionResultIsUnused);
}
if (node.operatorToken.kind === 27 /* CommaToken */) {
return factory.updateBinaryExpression(node, ts.visitNode(node.left, visitorWithUnusedExpressionResult, ts.isExpression), node.operatorToken, ts.visitNode(node.right, expressionResultIsUnused ? visitorWithUnusedExpressionResult : visitor, ts.isExpression));
}
return ts.visitEachChild(node, visitor, context);
}
/**
* @param expressionResultIsUnused Indicates the result of an expression is unused by the parent node (i.e., the left side of a comma or the
* expression of an `ExpressionStatement`).
*/
function visitCommaListExpression(node, expressionResultIsUnused) {
if (expressionResultIsUnused) {
return ts.visitEachChild(node, visitorWithUnusedExpressionResult, context);
}
var result;
for (var i = 0; i < node.elements.length; i++) {
var element = node.elements[i];
var visited = ts.visitNode(element, i < node.elements.length - 1 ? visitorWithUnusedExpressionResult : visitor, ts.isExpression);
if (result || visited !== element) {
result || (result = node.elements.slice(0, i));
result.push(visited);
}
}
var elements = result ? ts.setTextRange(factory.createNodeArray(result), node.elements) : node.elements;
return factory.updateCommaListExpression(node, elements);
}
function visitCatchClause(node) {
if (node.variableDeclaration &&
ts.isBindingPattern(node.variableDeclaration.name) &&
node.variableDeclaration.name.transformFlags & 32768 /* ContainsObjectRestOrSpread */) {
var name = factory.getGeneratedNameForNode(node.variableDeclaration.name);
var updatedDecl = factory.updateVariableDeclaration(node.variableDeclaration, node.variableDeclaration.name, /*exclamationToken*/ undefined, /*type*/ undefined, name);
var visitedBindings = ts.flattenDestructuringBinding(updatedDecl, visitor, context, 1 /* ObjectRest */);
var block = ts.visitNode(node.block, visitor, ts.isBlock);
if (ts.some(visitedBindings)) {
block = factory.updateBlock(block, __spreadArray([
factory.createVariableStatement(/*modifiers*/ undefined, visitedBindings)
], block.statements, true));
}
return factory.updateCatchClause(node, factory.updateVariableDeclaration(node.variableDeclaration, name, /*exclamationToken*/ undefined, /*type*/ undefined, /*initializer*/ undefined), block);
}
return ts.visitEachChild(node, visitor, context);
}
function visitVariableStatement(node) {
if (ts.hasSyntacticModifier(node, 1 /* Export */)) {
var savedExportedVariableStatement = exportedVariableStatement;
exportedVariableStatement = true;
var visited = ts.visitEachChild(node, visitor, context);
exportedVariableStatement = savedExportedVariableStatement;
return visited;
}
return ts.visitEachChild(node, visitor, context);
}
/**
* Visits a VariableDeclaration node with a binding pattern.
*
* @param node A VariableDeclaration node.
*/
function visitVariableDeclaration(node) {
if (exportedVariableStatement) {
var savedExportedVariableStatement = exportedVariableStatement;
exportedVariableStatement = false;
var visited = visitVariableDeclarationWorker(node, /*exportedVariableStatement*/ true);
exportedVariableStatement = savedExportedVariableStatement;
return visited;
}
return visitVariableDeclarationWorker(node, /*exportedVariableStatement*/ false);
}
function visitVariableDeclarationWorker(node, exportedVariableStatement) {
// If we are here it is because the name contains a binding pattern with a rest somewhere in it.
if (ts.isBindingPattern(node.name) && node.name.transformFlags & 32768 /* ContainsObjectRestOrSpread */) {
return ts.flattenDestructuringBinding(node, visitor, context, 1 /* ObjectRest */,
/*rval*/ undefined, exportedVariableStatement);
}
return ts.visitEachChild(node, visitor, context);
}
function visitForStatement(node) {
return factory.updateForStatement(node, ts.visitNode(node.initializer, visitorWithUnusedExpressionResult, ts.isForInitializer), ts.visitNode(node.condition, visitor, ts.isExpression), ts.visitNode(node.incrementor, visitorWithUnusedExpressionResult, ts.isExpression), ts.visitIterationBody(node.statement, visitor, context));
}
function visitVoidExpression(node) {
return ts.visitEachChild(node, visitorWithUnusedExpressionResult, context);
}
/**
* Visits a ForOfStatement and converts it into a ES2015-compatible ForOfStatement.
*
* @param node A ForOfStatement.
*/
function visitForOfStatement(node, outermostLabeledStatement) {
var ancestorFacts = enterSubtree(0 /* IterationStatementExcludes */, 2 /* IterationStatementIncludes */);
if (node.initializer.transformFlags & 32768 /* ContainsObjectRestOrSpread */) {
node = transformForOfStatementWithObjectRest(node);
}
var result = node.awaitModifier ?
transformForAwaitOfStatement(node, outermostLabeledStatement, ancestorFacts) :
factory.restoreEnclosingLabel(ts.visitEachChild(node, visitor, context), outermostLabeledStatement);
exitSubtree(ancestorFacts);
return result;
}
function transformForOfStatementWithObjectRest(node) {
var initializerWithoutParens = ts.skipParentheses(node.initializer);
if (ts.isVariableDeclarationList(initializerWithoutParens) || ts.isAssignmentPattern(initializerWithoutParens)) {
var bodyLocation = void 0;
var statementsLocation = void 0;
var temp = factory.createTempVariable(/*recordTempVariable*/ undefined);
var statements = [ts.createForOfBindingStatement(factory, initializerWithoutParens, temp)];
if (ts.isBlock(node.statement)) {
ts.addRange(statements, node.statement.statements);
bodyLocation = node.statement;
statementsLocation = node.statement.statements;
}
else if (node.statement) {
ts.append(statements, node.statement);
bodyLocation = node.statement;
statementsLocation = node.statement;
}
return factory.updateForOfStatement(node, node.awaitModifier, ts.setTextRange(factory.createVariableDeclarationList([
ts.setTextRange(factory.createVariableDeclaration(temp), node.initializer)
], 1 /* Let */), node.initializer), node.expression, ts.setTextRange(factory.createBlock(ts.setTextRange(factory.createNodeArray(statements), statementsLocation),
/*multiLine*/ true), bodyLocation));
}
return node;
}
function convertForOfStatementHead(node, boundValue) {
var binding = ts.createForOfBindingStatement(factory, node.initializer, boundValue);
var bodyLocation;
var statementsLocation;
var statements = [ts.visitNode(binding, visitor, ts.isStatement)];
var statement = ts.visitIterationBody(node.statement, visitor, context);
if (ts.isBlock(statement)) {
ts.addRange(statements, statement.statements);
bodyLocation = statement;
statementsLocation = statement.statements;
}
else {
statements.push(statement);
}
return ts.setEmitFlags(ts.setTextRange(factory.createBlock(ts.setTextRange(factory.createNodeArray(statements), statementsLocation),
/*multiLine*/ true), bodyLocation), 48 /* NoSourceMap */ | 384 /* NoTokenSourceMaps */);
}
function createDownlevelAwait(expression) {
return enclosingFunctionFlags & 1 /* Generator */
? factory.createYieldExpression(/*asteriskToken*/ undefined, emitHelpers().createAwaitHelper(expression))
: factory.createAwaitExpression(expression);
}
function transformForAwaitOfStatement(node, outermostLabeledStatement, ancestorFacts) {
var expression = ts.visitNode(node.expression, visitor, ts.isExpression);
var iterator = ts.isIdentifier(expression) ? factory.getGeneratedNameForNode(expression) : factory.createTempVariable(/*recordTempVariable*/ undefined);
var result = ts.isIdentifier(expression) ? factory.getGeneratedNameForNode(iterator) : factory.createTempVariable(/*recordTempVariable*/ undefined);
var errorRecord = factory.createUniqueName("e");
var catchVariable = factory.getGeneratedNameForNode(errorRecord);
var returnMethod = factory.createTempVariable(/*recordTempVariable*/ undefined);
var callValues = ts.setTextRange(emitHelpers().createAsyncValuesHelper(expression), node.expression);
var callNext = factory.createCallExpression(factory.createPropertyAccessExpression(iterator, "next"), /*typeArguments*/ undefined, []);
var getDone = factory.createPropertyAccessExpression(result, "done");
var getValue = factory.createPropertyAccessExpression(result, "value");
var callReturn = factory.createFunctionCallCall(returnMethod, iterator, []);
hoistVariableDeclaration(errorRecord);
hoistVariableDeclaration(returnMethod);
// if we are enclosed in an outer loop ensure we reset 'errorRecord' per each iteration
var initializer = ancestorFacts & 2 /* IterationContainer */ ?
factory.inlineExpressions([factory.createAssignment(errorRecord, factory.createVoidZero()), callValues]) :
callValues;
var forStatement = ts.setEmitFlags(ts.setTextRange(factory.createForStatement(
/*initializer*/ ts.setEmitFlags(ts.setTextRange(factory.createVariableDeclarationList([
ts.setTextRange(factory.createVariableDeclaration(iterator, /*exclamationToken*/ undefined, /*type*/ undefined, initializer), node.expression),
factory.createVariableDeclaration(result)
]), node.expression), 2097152 /* NoHoisting */),
/*condition*/ factory.createComma(factory.createAssignment(result, createDownlevelAwait(callNext)), factory.createLogicalNot(getDone)),
/*incrementor*/ undefined,
/*statement*/ convertForOfStatementHead(node, getValue)),
/*location*/ node), 256 /* NoTokenTrailingSourceMaps */);
return factory.createTryStatement(factory.createBlock([
factory.restoreEnclosingLabel(forStatement, outermostLabeledStatement)
]), factory.createCatchClause(factory.createVariableDeclaration(catchVariable), ts.setEmitFlags(factory.createBlock([
factory.createExpressionStatement(factory.createAssignment(errorRecord, factory.createObjectLiteralExpression([
factory.createPropertyAssignment("error", catchVariable)
])))
]), 1 /* SingleLine */)), factory.createBlock([
factory.createTryStatement(
/*tryBlock*/ factory.createBlock([
ts.setEmitFlags(factory.createIfStatement(factory.createLogicalAnd(factory.createLogicalAnd(result, factory.createLogicalNot(getDone)), factory.createAssignment(returnMethod, factory.createPropertyAccessExpression(iterator, "return"))), factory.createExpressionStatement(createDownlevelAwait(callReturn))), 1 /* SingleLine */)
]),
/*catchClause*/ undefined,
/*finallyBlock*/ ts.setEmitFlags(factory.createBlock([
ts.setEmitFlags(factory.createIfStatement(errorRecord, factory.createThrowStatement(factory.createPropertyAccessExpression(errorRecord, "error"))), 1 /* SingleLine */)
]), 1 /* SingleLine */))
]));
}
function visitParameter(node) {
if (node.transformFlags & 32768 /* ContainsObjectRestOrSpread */) {
// Binding patterns are converted into a generated name and are
// evaluated inside the function body.
return factory.updateParameterDeclaration(node,
/*decorators*/ undefined,
/*modifiers*/ undefined, node.dotDotDotToken, factory.getGeneratedNameForNode(node),
/*questionToken*/ undefined,
/*type*/ undefined, ts.visitNode(node.initializer, visitor, ts.isExpression));
}
return ts.visitEachChild(node, visitor, context);
}
function visitConstructorDeclaration(node) {
var savedEnclosingFunctionFlags = enclosingFunctionFlags;
enclosingFunctionFlags = 0 /* Normal */;
var updated = factory.updateConstructorDeclaration(node,
/*decorators*/ undefined, node.modifiers, ts.visitParameterList(node.parameters, visitor, context), transformFunctionBody(node));
enclosingFunctionFlags = savedEnclosingFunctionFlags;
return updated;
}
function visitGetAccessorDeclaration(node) {
var savedEnclosingFunctionFlags = enclosingFunctionFlags;
enclosingFunctionFlags = 0 /* Normal */;
var updated = factory.updateGetAccessorDeclaration(node,
/*decorators*/ undefined, node.modifiers, ts.visitNode(node.name, visitor, ts.isPropertyName), ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, transformFunctionBody(node));
enclosingFunctionFlags = savedEnclosingFunctionFlags;
return updated;
}
function visitSetAccessorDeclaration(node) {
var savedEnclosingFunctionFlags = enclosingFunctionFlags;
enclosingFunctionFlags = 0 /* Normal */;
var updated = factory.updateSetAccessorDeclaration(node,
/*decorators*/ undefined, node.modifiers, ts.visitNode(node.name, visitor, ts.isPropertyName), ts.visitParameterList(node.parameters, visitor, context), transformFunctionBody(node));
enclosingFunctionFlags = savedEnclosingFunctionFlags;
return updated;
}
function visitMethodDeclaration(node) {
var savedEnclosingFunctionFlags = enclosingFunctionFlags;
enclosingFunctionFlags = ts.getFunctionFlags(node);
var updated = factory.updateMethodDeclaration(node,
/*decorators*/ undefined, enclosingFunctionFlags & 1 /* Generator */
? ts.visitNodes(node.modifiers, visitorNoAsyncModifier, ts.isModifier)
: node.modifiers, enclosingFunctionFlags & 2 /* Async */
? undefined
: node.asteriskToken, ts.visitNode(node.name, visitor, ts.isPropertyName), ts.visitNode(/*questionToken*/ undefined, visitor, ts.isToken),
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, enclosingFunctionFlags & 2 /* Async */ && enclosingFunctionFlags & 1 /* Generator */
? transformAsyncGeneratorFunctionBody(node)
: transformFunctionBody(node));
enclosingFunctionFlags = savedEnclosingFunctionFlags;
return updated;
}
function visitFunctionDeclaration(node) {
var savedEnclosingFunctionFlags = enclosingFunctionFlags;
enclosingFunctionFlags = ts.getFunctionFlags(node);
var updated = factory.updateFunctionDeclaration(node,
/*decorators*/ undefined, enclosingFunctionFlags & 1 /* Generator */
? ts.visitNodes(node.modifiers, visitorNoAsyncModifier, ts.isModifier)
: node.modifiers, enclosingFunctionFlags & 2 /* Async */
? undefined
: node.asteriskToken, node.name,
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, enclosingFunctionFlags & 2 /* Async */ && enclosingFunctionFlags & 1 /* Generator */
? transformAsyncGeneratorFunctionBody(node)
: transformFunctionBody(node));
enclosingFunctionFlags = savedEnclosingFunctionFlags;
return updated;
}
function visitArrowFunction(node) {
var savedEnclosingFunctionFlags = enclosingFunctionFlags;
enclosingFunctionFlags = ts.getFunctionFlags(node);
var updated = factory.updateArrowFunction(node, node.modifiers,
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, node.equalsGreaterThanToken, transformFunctionBody(node));
enclosingFunctionFlags = savedEnclosingFunctionFlags;
return updated;
}
function visitFunctionExpression(node) {
var savedEnclosingFunctionFlags = enclosingFunctionFlags;
enclosingFunctionFlags = ts.getFunctionFlags(node);
var updated = factory.updateFunctionExpression(node, enclosingFunctionFlags & 1 /* Generator */
? ts.visitNodes(node.modifiers, visitorNoAsyncModifier, ts.isModifier)
: node.modifiers, enclosingFunctionFlags & 2 /* Async */
? undefined
: node.asteriskToken, node.name,
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, enclosingFunctionFlags & 2 /* Async */ && enclosingFunctionFlags & 1 /* Generator */
? transformAsyncGeneratorFunctionBody(node)
: transformFunctionBody(node));
enclosingFunctionFlags = savedEnclosingFunctionFlags;
return updated;
}
function transformAsyncGeneratorFunctionBody(node) {
resumeLexicalEnvironment();
var statements = [];
var statementOffset = factory.copyPrologue(node.body.statements, statements, /*ensureUseStrict*/ false, visitor);
appendObjectRestAssignmentsIfNeeded(statements, node);
var savedCapturedSuperProperties = capturedSuperProperties;
var savedHasSuperElementAccess = hasSuperElementAccess;
capturedSuperProperties = new ts.Set();
hasSuperElementAccess = false;
var returnStatement = factory.createReturnStatement(emitHelpers().createAsyncGeneratorHelper(factory.createFunctionExpression(
/*modifiers*/ undefined, factory.createToken(41 /* AsteriskToken */), node.name && factory.getGeneratedNameForNode(node.name),
/*typeParameters*/ undefined,
/*parameters*/ [],
/*type*/ undefined, factory.updateBlock(node.body, ts.visitLexicalEnvironment(node.body.statements, visitor, context, statementOffset))), !!(hierarchyFacts & 1 /* HasLexicalThis */)));
// Minor optimization, emit `_super` helper to capture `super` access in an arrow.
// This step isn't needed if we eventually transform this to ES5.
var emitSuperHelpers = languageVersion >= 2 /* ES2015 */ && resolver.getNodeCheckFlags(node) & (4096 /* AsyncMethodWithSuperBinding */ | 2048 /* AsyncMethodWithSuper */);
if (emitSuperHelpers) {
enableSubstitutionForAsyncMethodsWithSuper();
var variableStatement = ts.createSuperAccessVariableStatement(factory, resolver, node, capturedSuperProperties);
substitutedSuperAccessors[ts.getNodeId(variableStatement)] = true;
ts.insertStatementsAfterStandardPrologue(statements, [variableStatement]);
}
statements.push(returnStatement);
ts.insertStatementsAfterStandardPrologue(statements, endLexicalEnvironment());
var block = factory.updateBlock(node.body, statements);
if (emitSuperHelpers && hasSuperElementAccess) {
if (resolver.getNodeCheckFlags(node) & 4096 /* AsyncMethodWithSuperBinding */) {
ts.addEmitHelper(block, ts.advancedAsyncSuperHelper);
}
else if (resolver.getNodeCheckFlags(node) & 2048 /* AsyncMethodWithSuper */) {
ts.addEmitHelper(block, ts.asyncSuperHelper);
}
}
capturedSuperProperties = savedCapturedSuperProperties;
hasSuperElementAccess = savedHasSuperElementAccess;
return block;
}
function transformFunctionBody(node) {
var _a;
resumeLexicalEnvironment();
var statementOffset = 0;
var statements = [];
var body = (_a = ts.visitNode(node.body, visitor, ts.isConciseBody)) !== null && _a !== void 0 ? _a : factory.createBlock([]);
if (ts.isBlock(body)) {
statementOffset = factory.copyPrologue(body.statements, statements, /*ensureUseStrict*/ false, visitor);
}
ts.addRange(statements, appendObjectRestAssignmentsIfNeeded(/*statements*/ undefined, node));
var leadingStatements = endLexicalEnvironment();
if (statementOffset > 0 || ts.some(statements) || ts.some(leadingStatements)) {
var block = factory.converters.convertToFunctionBlock(body, /*multiLine*/ true);
ts.insertStatementsAfterStandardPrologue(statements, leadingStatements);
ts.addRange(statements, block.statements.slice(statementOffset));
return factory.updateBlock(block, ts.setTextRange(factory.createNodeArray(statements), block.statements));
}
return body;
}
function appendObjectRestAssignmentsIfNeeded(statements, node) {
for (var _i = 0, _a = node.parameters; _i < _a.length; _i++) {
var parameter = _a[_i];
if (parameter.transformFlags & 32768 /* ContainsObjectRestOrSpread */) {
var temp = factory.getGeneratedNameForNode(parameter);
var declarations = ts.flattenDestructuringBinding(parameter, visitor, context, 1 /* ObjectRest */, temp,
/*doNotRecordTempVariablesInLine*/ false,
/*skipInitializer*/ true);
if (ts.some(declarations)) {
var statement = factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList(declarations));
ts.setEmitFlags(statement, 1048576 /* CustomPrologue */);
statements = ts.append(statements, statement);
}
}
}
return statements;
}
function enableSubstitutionForAsyncMethodsWithSuper() {
if ((enabledSubstitutions & 1 /* AsyncMethodsWithSuper */) === 0) {
enabledSubstitutions |= 1 /* AsyncMethodsWithSuper */;
// We need to enable substitutions for call, property access, and element access
// if we need to rewrite super calls.
context.enableSubstitution(206 /* CallExpression */);
context.enableSubstitution(204 /* PropertyAccessExpression */);
context.enableSubstitution(205 /* ElementAccessExpression */);
// We need to be notified when entering and exiting declarations that bind super.
context.enableEmitNotification(255 /* ClassDeclaration */);
context.enableEmitNotification(167 /* MethodDeclaration */);
context.enableEmitNotification(170 /* GetAccessor */);
context.enableEmitNotification(171 /* SetAccessor */);
context.enableEmitNotification(169 /* Constructor */);
// We need to be notified when entering the generated accessor arrow functions.
context.enableEmitNotification(235 /* VariableStatement */);
}
}
/**
* Called by the printer just before a node is printed.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to be printed.
* @param emitCallback The callback used to emit the node.
*/
function onEmitNode(hint, node, emitCallback) {
// If we need to support substitutions for `super` in an async method,
// we should track it here.
if (enabledSubstitutions & 1 /* AsyncMethodsWithSuper */ && isSuperContainer(node)) {
var superContainerFlags = resolver.getNodeCheckFlags(node) & (2048 /* AsyncMethodWithSuper */ | 4096 /* AsyncMethodWithSuperBinding */);
if (superContainerFlags !== enclosingSuperContainerFlags) {
var savedEnclosingSuperContainerFlags = enclosingSuperContainerFlags;
enclosingSuperContainerFlags = superContainerFlags;
previousOnEmitNode(hint, node, emitCallback);
enclosingSuperContainerFlags = savedEnclosingSuperContainerFlags;
return;
}
}
// Disable substitution in the generated super accessor itself.
else if (enabledSubstitutions && substitutedSuperAccessors[ts.getNodeId(node)]) {
var savedEnclosingSuperContainerFlags = enclosingSuperContainerFlags;
enclosingSuperContainerFlags = 0;
previousOnEmitNode(hint, node, emitCallback);
enclosingSuperContainerFlags = savedEnclosingSuperContainerFlags;
return;
}
previousOnEmitNode(hint, node, emitCallback);
}
/**
* Hooks node substitutions.
*
* @param hint The context for the emitter.
* @param node The node to substitute.
*/
function onSubstituteNode(hint, node) {
node = previousOnSubstituteNode(hint, node);
if (hint === 1 /* Expression */ && enclosingSuperContainerFlags) {
return substituteExpression(node);
}
return node;
}
function substituteExpression(node) {
switch (node.kind) {
case 204 /* PropertyAccessExpression */:
return substitutePropertyAccessExpression(node);
case 205 /* ElementAccessExpression */:
return substituteElementAccessExpression(node);
case 206 /* CallExpression */:
return substituteCallExpression(node);
}
return node;
}
function substitutePropertyAccessExpression(node) {
if (node.expression.kind === 106 /* SuperKeyword */) {
return ts.setTextRange(factory.createPropertyAccessExpression(factory.createUniqueName("_super", 16 /* Optimistic */ | 32 /* FileLevel */), node.name), node);
}
return node;
}
function substituteElementAccessExpression(node) {
if (node.expression.kind === 106 /* SuperKeyword */) {
return createSuperElementAccessInAsyncMethod(node.argumentExpression, node);
}
return node;
}
function substituteCallExpression(node) {
var expression = node.expression;
if (ts.isSuperProperty(expression)) {
var argumentExpression = ts.isPropertyAccessExpression(expression)
? substitutePropertyAccessExpression(expression)
: substituteElementAccessExpression(expression);
return factory.createCallExpression(factory.createPropertyAccessExpression(argumentExpression, "call"),
/*typeArguments*/ undefined, __spreadArray([
factory.createThis()
], node.arguments, true));
}
return node;
}
function isSuperContainer(node) {
var kind = node.kind;
return kind === 255 /* ClassDeclaration */
|| kind === 169 /* Constructor */
|| kind === 167 /* MethodDeclaration */
|| kind === 170 /* GetAccessor */
|| kind === 171 /* SetAccessor */;
}
function createSuperElementAccessInAsyncMethod(argumentExpression, location) {
if (enclosingSuperContainerFlags & 4096 /* AsyncMethodWithSuperBinding */) {
return ts.setTextRange(factory.createPropertyAccessExpression(factory.createCallExpression(factory.createIdentifier("_superIndex"),
/*typeArguments*/ undefined, [argumentExpression]), "value"), location);
}
else {
return ts.setTextRange(factory.createCallExpression(factory.createIdentifier("_superIndex"),
/*typeArguments*/ undefined, [argumentExpression]), location);
}
}
}
ts.transformES2018 = transformES2018;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
function transformES2019(context) {
var factory = context.factory;
return ts.chainBundle(context, transformSourceFile);
function transformSourceFile(node) {
if (node.isDeclarationFile) {
return node;
}
return ts.visitEachChild(node, visitor, context);
}
function visitor(node) {
if ((node.transformFlags & 32 /* ContainsES2019 */) === 0) {
return node;
}
switch (node.kind) {
case 290 /* CatchClause */:
return visitCatchClause(node);
default:
return ts.visitEachChild(node, visitor, context);
}
}
function visitCatchClause(node) {
if (!node.variableDeclaration) {
return factory.updateCatchClause(node, factory.createVariableDeclaration(factory.createTempVariable(/*recordTempVariable*/ undefined)), ts.visitNode(node.block, visitor, ts.isBlock));
}
return ts.visitEachChild(node, visitor, context);
}
}
ts.transformES2019 = transformES2019;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
function transformES2020(context) {
var factory = context.factory, hoistVariableDeclaration = context.hoistVariableDeclaration;
return ts.chainBundle(context, transformSourceFile);
function transformSourceFile(node) {
if (node.isDeclarationFile) {
return node;
}
return ts.visitEachChild(node, visitor, context);
}
function visitor(node) {
if ((node.transformFlags & 16 /* ContainsES2020 */) === 0) {
return node;
}
switch (node.kind) {
case 206 /* CallExpression */: {
var updated = visitNonOptionalCallExpression(node, /*captureThisArg*/ false);
ts.Debug.assertNotNode(updated, ts.isSyntheticReference);
return updated;
}
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
if (ts.isOptionalChain(node)) {
var updated = visitOptionalExpression(node, /*captureThisArg*/ false, /*isDelete*/ false);
ts.Debug.assertNotNode(updated, ts.isSyntheticReference);
return updated;
}
return ts.visitEachChild(node, visitor, context);
case 219 /* BinaryExpression */:
if (node.operatorToken.kind === 60 /* QuestionQuestionToken */) {
return transformNullishCoalescingExpression(node);
}
return ts.visitEachChild(node, visitor, context);
case 213 /* DeleteExpression */:
return visitDeleteExpression(node);
default:
return ts.visitEachChild(node, visitor, context);
}
}
function flattenChain(chain) {
ts.Debug.assertNotNode(chain, ts.isNonNullChain);
var links = [chain];
while (!chain.questionDotToken && !ts.isTaggedTemplateExpression(chain)) {
chain = ts.cast(ts.skipPartiallyEmittedExpressions(chain.expression), ts.isOptionalChain);
ts.Debug.assertNotNode(chain, ts.isNonNullChain);
links.unshift(chain);
}
return { expression: chain.expression, chain: links };
}
function visitNonOptionalParenthesizedExpression(node, captureThisArg, isDelete) {
var expression = visitNonOptionalExpression(node.expression, captureThisArg, isDelete);
if (ts.isSyntheticReference(expression)) {
// `(a.b)` -> { expression `((_a = a).b)`, thisArg: `_a` }
// `(a[b])` -> { expression `((_a = a)[b])`, thisArg: `_a` }
return factory.createSyntheticReferenceExpression(factory.updateParenthesizedExpression(node, expression.expression), expression.thisArg);
}
return factory.updateParenthesizedExpression(node, expression);
}
function visitNonOptionalPropertyOrElementAccessExpression(node, captureThisArg, isDelete) {
if (ts.isOptionalChain(node)) {
// If `node` is an optional chain, then it is the outermost chain of an optional expression.
return visitOptionalExpression(node, captureThisArg, isDelete);
}
var expression = ts.visitNode(node.expression, visitor, ts.isExpression);
ts.Debug.assertNotNode(expression, ts.isSyntheticReference);
var thisArg;
if (captureThisArg) {
if (!ts.isSimpleCopiableExpression(expression)) {
thisArg = factory.createTempVariable(hoistVariableDeclaration);
expression = factory.createAssignment(thisArg, expression);
}
else {
thisArg = expression;
}
}
expression = node.kind === 204 /* PropertyAccessExpression */
? factory.updatePropertyAccessExpression(node, expression, ts.visitNode(node.name, visitor, ts.isIdentifier))
: factory.updateElementAccessExpression(node, expression, ts.visitNode(node.argumentExpression, visitor, ts.isExpression));
return thisArg ? factory.createSyntheticReferenceExpression(expression, thisArg) : expression;
}
function visitNonOptionalCallExpression(node, captureThisArg) {
if (ts.isOptionalChain(node)) {
// If `node` is an optional chain, then it is the outermost chain of an optional expression.
return visitOptionalExpression(node, captureThisArg, /*isDelete*/ false);
}
if (ts.isParenthesizedExpression(node.expression) && ts.isOptionalChain(ts.skipParentheses(node.expression))) {
// capture thisArg for calls of parenthesized optional chains like `(foo?.bar)()`
var expression = visitNonOptionalParenthesizedExpression(node.expression, /*captureThisArg*/ true, /*isDelete*/ false);
var args = ts.visitNodes(node.arguments, visitor, ts.isExpression);
if (ts.isSyntheticReference(expression)) {
return ts.setTextRange(factory.createFunctionCallCall(expression.expression, expression.thisArg, args), node);
}
return factory.updateCallExpression(node, expression, /*typeArguments*/ undefined, args);
}
return ts.visitEachChild(node, visitor, context);
}
function visitNonOptionalExpression(node, captureThisArg, isDelete) {
switch (node.kind) {
case 210 /* ParenthesizedExpression */: return visitNonOptionalParenthesizedExpression(node, captureThisArg, isDelete);
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */: return visitNonOptionalPropertyOrElementAccessExpression(node, captureThisArg, isDelete);
case 206 /* CallExpression */: return visitNonOptionalCallExpression(node, captureThisArg);
default: return ts.visitNode(node, visitor, ts.isExpression);
}
}
function visitOptionalExpression(node, captureThisArg, isDelete) {
var _a = flattenChain(node), expression = _a.expression, chain = _a.chain;
var left = visitNonOptionalExpression(expression, ts.isCallChain(chain[0]), /*isDelete*/ false);
var leftThisArg = ts.isSyntheticReference(left) ? left.thisArg : undefined;
var leftExpression = ts.isSyntheticReference(left) ? left.expression : left;
var capturedLeft = leftExpression;
if (!ts.isSimpleCopiableExpression(leftExpression)) {
capturedLeft = factory.createTempVariable(hoistVariableDeclaration);
leftExpression = factory.createAssignment(capturedLeft, leftExpression);
}
var rightExpression = capturedLeft;
var thisArg;
for (var i = 0; i < chain.length; i++) {
var segment = chain[i];
switch (segment.kind) {
case 204 /* PropertyAccessExpression */:
case 205 /* ElementAccessExpression */:
if (i === chain.length - 1 && captureThisArg) {
if (!ts.isSimpleCopiableExpression(rightExpression)) {
thisArg = factory.createTempVariable(hoistVariableDeclaration);
rightExpression = factory.createAssignment(thisArg, rightExpression);
}
else {
thisArg = rightExpression;
}
}
rightExpression = segment.kind === 204 /* PropertyAccessExpression */
? factory.createPropertyAccessExpression(rightExpression, ts.visitNode(segment.name, visitor, ts.isIdentifier))
: factory.createElementAccessExpression(rightExpression, ts.visitNode(segment.argumentExpression, visitor, ts.isExpression));
break;
case 206 /* CallExpression */:
if (i === 0 && leftThisArg) {
rightExpression = factory.createFunctionCallCall(rightExpression, leftThisArg.kind === 106 /* SuperKeyword */ ? factory.createThis() : leftThisArg, ts.visitNodes(segment.arguments, visitor, ts.isExpression));
}
else {
rightExpression = factory.createCallExpression(rightExpression,
/*typeArguments*/ undefined, ts.visitNodes(segment.arguments, visitor, ts.isExpression));
}
break;
}
ts.setOriginalNode(rightExpression, segment);
}
var target = isDelete
? factory.createConditionalExpression(createNotNullCondition(leftExpression, capturedLeft, /*invert*/ true), /*questionToken*/ undefined, factory.createTrue(), /*colonToken*/ undefined, factory.createDeleteExpression(rightExpression))
: factory.createConditionalExpression(createNotNullCondition(leftExpression, capturedLeft, /*invert*/ true), /*questionToken*/ undefined, factory.createVoidZero(), /*colonToken*/ undefined, rightExpression);
ts.setTextRange(target, node);
return thisArg ? factory.createSyntheticReferenceExpression(target, thisArg) : target;
}
function createNotNullCondition(left, right, invert) {
return factory.createBinaryExpression(factory.createBinaryExpression(left, factory.createToken(invert ? 36 /* EqualsEqualsEqualsToken */ : 37 /* ExclamationEqualsEqualsToken */), factory.createNull()), factory.createToken(invert ? 56 /* BarBarToken */ : 55 /* AmpersandAmpersandToken */), factory.createBinaryExpression(right, factory.createToken(invert ? 36 /* EqualsEqualsEqualsToken */ : 37 /* ExclamationEqualsEqualsToken */), factory.createVoidZero()));
}
function transformNullishCoalescingExpression(node) {
var left = ts.visitNode(node.left, visitor, ts.isExpression);
var right = left;
if (!ts.isSimpleCopiableExpression(left)) {
right = factory.createTempVariable(hoistVariableDeclaration);
left = factory.createAssignment(right, left);
}
return ts.setTextRange(factory.createConditionalExpression(createNotNullCondition(left, right),
/*questionToken*/ undefined, right,
/*colonToken*/ undefined, ts.visitNode(node.right, visitor, ts.isExpression)), node);
}
function visitDeleteExpression(node) {
return ts.isOptionalChain(ts.skipParentheses(node.expression))
? ts.setOriginalNode(visitNonOptionalExpression(node.expression, /*captureThisArg*/ false, /*isDelete*/ true), node)
: factory.updateDeleteExpression(node, ts.visitNode(node.expression, visitor, ts.isExpression));
}
}
ts.transformES2020 = transformES2020;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
function transformES2021(context) {
var hoistVariableDeclaration = context.hoistVariableDeclaration, factory = context.factory;
return ts.chainBundle(context, transformSourceFile);
function transformSourceFile(node) {
if (node.isDeclarationFile) {
return node;
}
return ts.visitEachChild(node, visitor, context);
}
function visitor(node) {
if ((node.transformFlags & 8 /* ContainsES2021 */) === 0) {
return node;
}
switch (node.kind) {
case 219 /* BinaryExpression */:
var binaryExpression = node;
if (ts.isLogicalOrCoalescingAssignmentExpression(binaryExpression)) {
return transformLogicalAssignment(binaryExpression);
}
// falls through
default:
return ts.visitEachChild(node, visitor, context);
}
}
function transformLogicalAssignment(binaryExpression) {
var operator = binaryExpression.operatorToken;
var nonAssignmentOperator = ts.getNonAssignmentOperatorForCompoundAssignment(operator.kind);
var left = ts.skipParentheses(ts.visitNode(binaryExpression.left, visitor, ts.isLeftHandSideExpression));
var assignmentTarget = left;
var right = ts.skipParentheses(ts.visitNode(binaryExpression.right, visitor, ts.isExpression));
if (ts.isAccessExpression(left)) {
var propertyAccessTargetSimpleCopiable = ts.isSimpleCopiableExpression(left.expression);
var propertyAccessTarget = propertyAccessTargetSimpleCopiable ? left.expression :
factory.createTempVariable(hoistVariableDeclaration);
var propertyAccessTargetAssignment = propertyAccessTargetSimpleCopiable ? left.expression : factory.createAssignment(propertyAccessTarget, left.expression);
if (ts.isPropertyAccessExpression(left)) {
assignmentTarget = factory.createPropertyAccessExpression(propertyAccessTarget, left.name);
left = factory.createPropertyAccessExpression(propertyAccessTargetAssignment, left.name);
}
else {
var elementAccessArgumentSimpleCopiable = ts.isSimpleCopiableExpression(left.argumentExpression);
var elementAccessArgument = elementAccessArgumentSimpleCopiable ? left.argumentExpression :
factory.createTempVariable(hoistVariableDeclaration);
assignmentTarget = factory.createElementAccessExpression(propertyAccessTarget, elementAccessArgument);
left = factory.createElementAccessExpression(propertyAccessTargetAssignment, elementAccessArgumentSimpleCopiable ? left.argumentExpression : factory.createAssignment(elementAccessArgument, left.argumentExpression));
}
}
return factory.createBinaryExpression(left, nonAssignmentOperator, factory.createParenthesizedExpression(factory.createAssignment(assignmentTarget, right)));
}
}
ts.transformES2021 = transformES2021;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
function transformESNext(context) {
return ts.chainBundle(context, transformSourceFile);
function transformSourceFile(node) {
if (node.isDeclarationFile) {
return node;
}
return ts.visitEachChild(node, visitor, context);
}
function visitor(node) {
if ((node.transformFlags & 4 /* ContainsESNext */) === 0) {
return node;
}
switch (node.kind) {
default:
return ts.visitEachChild(node, visitor, context);
}
}
}
ts.transformESNext = transformESNext;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
function transformJsx(context) {
var factory = context.factory, emitHelpers = context.getEmitHelperFactory;
var compilerOptions = context.getCompilerOptions();
var currentSourceFile;
var currentFileState;
return ts.chainBundle(context, transformSourceFile);
function getCurrentFileNameExpression() {
if (currentFileState.filenameDeclaration) {
return currentFileState.filenameDeclaration.name;
}
var declaration = factory.createVariableDeclaration(factory.createUniqueName("_jsxFileName", 16 /* Optimistic */ | 32 /* FileLevel */), /*exclaimationToken*/ undefined, /*type*/ undefined, factory.createStringLiteral(currentSourceFile.fileName));
currentFileState.filenameDeclaration = declaration;
return currentFileState.filenameDeclaration.name;
}
function getJsxFactoryCalleePrimitive(childrenLength) {
return compilerOptions.jsx === 5 /* ReactJSXDev */ ? "jsxDEV" : childrenLength > 1 ? "jsxs" : "jsx";
}
function getJsxFactoryCallee(childrenLength) {
var type = getJsxFactoryCalleePrimitive(childrenLength);
return getImplicitImportForName(type);
}
function getImplicitJsxFragmentReference() {
return getImplicitImportForName("Fragment");
}
function getImplicitImportForName(name) {
var _a, _b;
var importSource = name === "createElement"
? currentFileState.importSpecifier
: ts.getJSXRuntimeImport(currentFileState.importSpecifier, compilerOptions);
var existing = (_b = (_a = currentFileState.utilizedImplicitRuntimeImports) === null || _a === void 0 ? void 0 : _a.get(importSource)) === null || _b === void 0 ? void 0 : _b.get(name);
if (existing) {
return existing.name;
}
if (!currentFileState.utilizedImplicitRuntimeImports) {
currentFileState.utilizedImplicitRuntimeImports = ts.createMap();
}
var specifierSourceImports = currentFileState.utilizedImplicitRuntimeImports.get(importSource);
if (!specifierSourceImports) {
specifierSourceImports = ts.createMap();
currentFileState.utilizedImplicitRuntimeImports.set(importSource, specifierSourceImports);
}
var generatedName = factory.createUniqueName("_" + name, 16 /* Optimistic */ | 32 /* FileLevel */ | 64 /* AllowNameSubstitution */);
var specifier = factory.createImportSpecifier(factory.createIdentifier(name), generatedName);
generatedName.generatedImportReference = specifier;
specifierSourceImports.set(name, specifier);
return generatedName;
}
/**
* Transform JSX-specific syntax in a SourceFile.
*
* @param node A SourceFile node.
*/
function transformSourceFile(node) {
if (node.isDeclarationFile) {
return node;
}
currentSourceFile = node;
currentFileState = {};
currentFileState.importSpecifier = ts.getJSXImplicitImportBase(compilerOptions, node);
var visited = ts.visitEachChild(node, visitor, context);
ts.addEmitHelpers(visited, context.readEmitHelpers());
var statements = visited.statements;
if (currentFileState.filenameDeclaration) {
statements = ts.insertStatementAfterCustomPrologue(statements.slice(), factory.createVariableStatement(/*modifiers*/ undefined, factory.createVariableDeclarationList([currentFileState.filenameDeclaration], 2 /* Const */)));
}
if (currentFileState.utilizedImplicitRuntimeImports) {
for (var _i = 0, _a = ts.arrayFrom(currentFileState.utilizedImplicitRuntimeImports.entries()); _i < _a.length; _i++) {
var _b = _a[_i], importSource = _b[0], importSpecifiersMap = _b[1];
if (ts.isExternalModule(node)) {
// Add `import` statement
var importStatement = factory.createImportDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, factory.createImportClause(/*typeOnly*/ false, /*name*/ undefined, factory.createNamedImports(ts.arrayFrom(importSpecifiersMap.values()))), factory.createStringLiteral(importSource));
ts.setParentRecursive(importStatement, /*incremental*/ false);
statements = ts.insertStatementAfterCustomPrologue(statements.slice(), importStatement);
}
else if (ts.isExternalOrCommonJsModule(node)) {
// Add `require` statement
var requireStatement = factory.createVariableStatement(/*modifiers*/ undefined, factory.createVariableDeclarationList([
factory.createVariableDeclaration(factory.createObjectBindingPattern(ts.map(ts.arrayFrom(importSpecifiersMap.values()), function (s) { return factory.createBindingElement(/*dotdotdot*/ undefined, s.propertyName, s.name); })),
/*exclaimationToken*/ undefined,
/*type*/ undefined, factory.createCallExpression(factory.createIdentifier("require"), /*typeArguments*/ undefined, [factory.createStringLiteral(importSource)]))
], 2 /* Const */));
ts.setParentRecursive(requireStatement, /*incremental*/ false);
statements = ts.insertStatementAfterCustomPrologue(statements.slice(), requireStatement);
}
else {
// Do nothing (script file) - consider an error in the checker?
}
}
}
if (statements !== visited.statements) {
visited = factory.updateSourceFile(visited, statements);
}
currentFileState = undefined;
return visited;
}
function visitor(node) {
if (node.transformFlags & 2 /* ContainsJsx */) {
return visitorWorker(node);
}
else {
return node;
}
}
function visitorWorker(node) {
switch (node.kind) {
case 276 /* JsxElement */:
return visitJsxElement(node, /*isChild*/ false);
case 277 /* JsxSelfClosingElement */:
return visitJsxSelfClosingElement(node, /*isChild*/ false);
case 280 /* JsxFragment */:
return visitJsxFragment(node, /*isChild*/ false);
case 286 /* JsxExpression */:
return visitJsxExpression(node);
default:
return ts.visitEachChild(node, visitor, context);
}
}
function transformJsxChildToExpression(node) {
switch (node.kind) {
case 11 /* JsxText */:
return visitJsxText(node);
case 286 /* JsxExpression */:
return visitJsxExpression(node);
case 276 /* JsxElement */:
return visitJsxElement(node, /*isChild*/ true);
case 277 /* JsxSelfClosingElement */:
return visitJsxSelfClosingElement(node, /*isChild*/ true);
case 280 /* JsxFragment */:
return visitJsxFragment(node, /*isChild*/ true);
default:
return ts.Debug.failBadSyntaxKind(node);
}
}
/**
* The react jsx/jsxs transform falls back to `createElement` when an explicit `key` argument comes after a spread
*/
function hasKeyAfterPropsSpread(node) {
var spread = false;
for (var _i = 0, _a = node.attributes.properties; _i < _a.length; _i++) {
var elem = _a[_i];
if (ts.isJsxSpreadAttribute(elem)) {
spread = true;
}
else if (spread && ts.isJsxAttribute(elem) && elem.name.escapedText === "key") {
return true;
}
}
return false;
}
function shouldUseCreateElement(node) {
return currentFileState.importSpecifier === undefined || hasKeyAfterPropsSpread(node);
}
function visitJsxElement(node, isChild) {
var tagTransform = shouldUseCreateElement(node.openingElement) ? visitJsxOpeningLikeElementCreateElement : visitJsxOpeningLikeElementJSX;
return tagTransform(node.openingElement, node.children, isChild, /*location*/ node);
}
function visitJsxSelfClosingElement(node, isChild) {
var tagTransform = shouldUseCreateElement(node) ? visitJsxOpeningLikeElementCreateElement : visitJsxOpeningLikeElementJSX;
return tagTransform(node, /*children*/ undefined, isChild, /*location*/ node);
}
function visitJsxFragment(node, isChild) {
var tagTransform = currentFileState.importSpecifier === undefined ? visitJsxOpeningFragmentCreateElement : visitJsxOpeningFragmentJSX;
return tagTransform(node.openingFragment, node.children, isChild, /*location*/ node);
}
function convertJsxChildrenToChildrenPropObject(children) {
var nonWhitespaceChildren = ts.getSemanticJsxChildren(children);
if (ts.length(nonWhitespaceChildren) === 1) {
var result_13 = transformJsxChildToExpression(nonWhitespaceChildren[0]);
return result_13 && factory.createObjectLiteralExpression([
factory.createPropertyAssignment("children", result_13)
]);
}
var result = ts.mapDefined(children, transformJsxChildToExpression);
return !result.length ? undefined : factory.createObjectLiteralExpression([
factory.createPropertyAssignment("children", factory.createArrayLiteralExpression(result))
]);
}
function visitJsxOpeningLikeElementJSX(node, children, isChild, location) {
var tagName = getTagName(node);
var objectProperties;
var keyAttr = ts.find(node.attributes.properties, function (p) { return !!p.name && ts.isIdentifier(p.name) && p.name.escapedText === "key"; });
var attrs = keyAttr ? ts.filter(node.attributes.properties, function (p) { return p !== keyAttr; }) : node.attributes.properties;
var segments = [];
if (attrs.length) {
// Map spans of JsxAttribute nodes into object literals and spans
// of JsxSpreadAttribute nodes into expressions.
segments = ts.flatten(ts.spanMap(attrs, ts.isJsxSpreadAttribute, function (attrs, isSpread) { return isSpread
? ts.map(attrs, transformJsxSpreadAttributeToExpression)
: factory.createObjectLiteralExpression(ts.map(attrs, transformJsxAttributeToObjectLiteralElement)); }));
if (ts.isJsxSpreadAttribute(attrs[0])) {
// We must always emit at least one object literal before a spread
// argument.factory.createObjectLiteral
segments.unshift(factory.createObjectLiteralExpression());
}
}
if (children && children.length) {
var result = convertJsxChildrenToChildrenPropObject(children);
if (result) {
segments.push(result);
}
}
if (segments.length === 0) {
objectProperties = factory.createObjectLiteralExpression([]);
// When there are no attributes, React wants {}
}
else {
// Either emit one big object literal (no spread attribs), or
// a call to the __assign helper.
objectProperties = ts.singleOrUndefined(segments) || emitHelpers().createAssignHelper(segments);
}
return visitJsxOpeningLikeElementOrFragmentJSX(tagName, objectProperties, keyAttr, ts.length(ts.getSemanticJsxChildren(children || ts.emptyArray)), isChild, location);
}
function visitJsxOpeningLikeElementOrFragmentJSX(tagName, objectProperties, keyAttr, childrenLength, isChild, location) {
var args = [tagName, objectProperties, !keyAttr ? factory.createVoidZero() : transformJsxAttributeInitializer(keyAttr.initializer)];
if (compilerOptions.jsx === 5 /* ReactJSXDev */) {
var originalFile = ts.getOriginalNode(currentSourceFile);
if (originalFile && ts.isSourceFile(originalFile)) {
// isStaticChildren development flag
args.push(childrenLength > 1 ? factory.createTrue() : factory.createFalse());
// __source development flag
var lineCol = ts.getLineAndCharacterOfPosition(originalFile, location.pos);
args.push(factory.createObjectLiteralExpression([
factory.createPropertyAssignment("fileName", getCurrentFileNameExpression()),
factory.createPropertyAssignment("lineNumber", factory.createNumericLiteral(lineCol.line + 1)),
factory.createPropertyAssignment("columnNumber", factory.createNumericLiteral(lineCol.character + 1))
]));
// __self development flag
args.push(factory.createThis());
}
}
var element = ts.setTextRange(factory.createCallExpression(getJsxFactoryCallee(childrenLength), /*typeArguments*/ undefined, args), location);
if (isChild) {
ts.startOnNewLine(element);
}
return element;
}
function visitJsxOpeningLikeElementCreateElement(node, children, isChild, location) {
var tagName = getTagName(node);
var objectProperties;
var attrs = node.attributes.properties;
if (attrs.length === 0) {
objectProperties = factory.createNull();
// When there are no attributes, React wants "null"
}
else {
var target = compilerOptions.target;
if (target && target >= 5 /* ES2018 */) {
objectProperties = factory.createObjectLiteralExpression(ts.flatten(ts.spanMap(attrs, ts.isJsxSpreadAttribute, function (attrs, isSpread) {
return isSpread ? ts.map(attrs, transformJsxSpreadAttributeToSpreadAssignment) : ts.map(attrs, transformJsxAttributeToObjectLiteralElement);
})));
}
else {
// Map spans of JsxAttribute nodes into object literals and spans
// of JsxSpreadAttribute nodes into expressions.
var segments = ts.flatten(ts.spanMap(attrs, ts.isJsxSpreadAttribute, function (attrs, isSpread) { return isSpread
? ts.map(attrs, transformJsxSpreadAttributeToExpression)
: factory.createObjectLiteralExpression(ts.map(attrs, transformJsxAttributeToObjectLiteralElement)); }));
if (ts.isJsxSpreadAttribute(attrs[0])) {
// We must always emit at least one object literal before a spread
// argument.factory.createObjectLiteral
segments.unshift(factory.createObjectLiteralExpression());
}
// Either emit one big object literal (no spread attribs), or
// a call to the __assign helper.
objectProperties = ts.singleOrUndefined(segments);
if (!objectProperties) {
objectProperties = emitHelpers().createAssignHelper(segments);
}
}
}
var callee = currentFileState.importSpecifier === undefined
? ts.createJsxFactoryExpression(factory, context.getEmitResolver().getJsxFactoryEntity(currentSourceFile), compilerOptions.reactNamespace, // TODO: GH#18217
node)
: getImplicitImportForName("createElement");
var element = ts.createExpressionForJsxElement(factory, callee, tagName, objectProperties, ts.mapDefined(children, transformJsxChildToExpression), location);
if (isChild) {
ts.startOnNewLine(element);
}
return element;
}
function visitJsxOpeningFragmentJSX(_node, children, isChild, location) {
var childrenProps;
if (children && children.length) {
var result = convertJsxChildrenToChildrenPropObject(children);
if (result) {
childrenProps = result;
}
}
return visitJsxOpeningLikeElementOrFragmentJSX(getImplicitJsxFragmentReference(), childrenProps || factory.createObjectLiteralExpression([]),
/*keyAttr*/ undefined, ts.length(ts.getSemanticJsxChildren(children)), isChild, location);
}
function visitJsxOpeningFragmentCreateElement(node, children, isChild, location) {
var element = ts.createExpressionForJsxFragment(factory, context.getEmitResolver().getJsxFactoryEntity(currentSourceFile), context.getEmitResolver().getJsxFragmentFactoryEntity(currentSourceFile), compilerOptions.reactNamespace, // TODO: GH#18217
ts.mapDefined(children, transformJsxChildToExpression), node, location);
if (isChild) {
ts.startOnNewLine(element);
}
return element;
}
function transformJsxSpreadAttributeToSpreadAssignment(node) {
return factory.createSpreadAssignment(ts.visitNode(node.expression, visitor, ts.isExpression));
}
function transformJsxSpreadAttributeToExpression(node) {
return ts.visitNode(node.expression, visitor, ts.isExpression);
}
function transformJsxAttributeToObjectLiteralElement(node) {
var name = getAttributeName(node);
var expression = transformJsxAttributeInitializer(node.initializer);
return factory.createPropertyAssignment(name, expression);
}
function transformJsxAttributeInitializer(node) {
if (node === undefined) {
return factory.createTrue();
}
else if (node.kind === 10 /* StringLiteral */) {
// Always recreate the literal to escape any escape sequences or newlines which may be in the original jsx string and which
// Need to be escaped to be handled correctly in a normal string
var singleQuote = node.singleQuote !== undefined ? node.singleQuote : !ts.isStringDoubleQuoted(node, currentSourceFile);
var literal = factory.createStringLiteral(tryDecodeEntities(node.text) || node.text, singleQuote);
return ts.setTextRange(literal, node);
}
else if (node.kind === 286 /* JsxExpression */) {
if (node.expression === undefined) {
return factory.createTrue();
}
return ts.visitNode(node.expression, visitor, ts.isExpression);
}
else {
return ts.Debug.failBadSyntaxKind(node);
}
}
function visitJsxText(node) {
var fixed = fixupWhitespaceAndDecodeEntities(node.text);
return fixed === undefined ? undefined : factory.createStringLiteral(fixed);
}
/**
* JSX trims whitespace at the end and beginning of lines, except that the
* start/end of a tag is considered a start/end of a line only if that line is
* on the same line as the closing tag. See examples in
* tests/cases/conformance/jsx/tsxReactEmitWhitespace.tsx
* See also https://www.w3.org/TR/html4/struct/text.html#h-9.1 and https://www.w3.org/TR/CSS2/text.html#white-space-model
*
* An equivalent algorithm would be:
* - If there is only one line, return it.
* - If there is only whitespace (but multiple lines), return `undefined`.
* - Split the text into lines.
* - 'trimRight' the first line, 'trimLeft' the last line, 'trim' middle lines.
* - Decode entities on each line (individually).
* - Remove empty lines and join the rest with " ".
*/
function fixupWhitespaceAndDecodeEntities(text) {
var acc;
// First non-whitespace character on this line.
var firstNonWhitespace = 0;
// Last non-whitespace character on this line.
var lastNonWhitespace = -1;
// These initial values are special because the first line is:
// firstNonWhitespace = 0 to indicate that we want leading whitsepace,
// but lastNonWhitespace = -1 as a special flag to indicate that we *don't* include the line if it's all whitespace.
for (var i = 0; i < text.length; i++) {
var c = text.charCodeAt(i);
if (ts.isLineBreak(c)) {
// If we've seen any non-whitespace characters on this line, add the 'trim' of the line.
// (lastNonWhitespace === -1 is a special flag to detect whether the first line is all whitespace.)
if (firstNonWhitespace !== -1 && lastNonWhitespace !== -1) {
acc = addLineOfJsxText(acc, text.substr(firstNonWhitespace, lastNonWhitespace - firstNonWhitespace + 1));
}
// Reset firstNonWhitespace for the next line.
// Don't bother to reset lastNonWhitespace because we ignore it if firstNonWhitespace = -1.
firstNonWhitespace = -1;
}
else if (!ts.isWhiteSpaceSingleLine(c)) {
lastNonWhitespace = i;
if (firstNonWhitespace === -1) {
firstNonWhitespace = i;
}
}
}
return firstNonWhitespace !== -1
// Last line had a non-whitespace character. Emit the 'trimLeft', meaning keep trailing whitespace.
? addLineOfJsxText(acc, text.substr(firstNonWhitespace))
// Last line was all whitespace, so ignore it
: acc;
}
function addLineOfJsxText(acc, trimmedLine) {
// We do not escape the string here as that is handled by the printer
// when it emits the literal. We do, however, need to decode JSX entities.
var decoded = decodeEntities(trimmedLine);
return acc === undefined ? decoded : acc + " " + decoded;
}
/**
* Replace entities like "&nbsp;", "&#123;", and "&#xDEADBEEF;" with the characters they encode.
* See https://en.wikipedia.org/wiki/List_of_XML_and_HTML_character_entity_references
*/
function decodeEntities(text) {
return text.replace(/&((#((\d+)|x([\da-fA-F]+)))|(\w+));/g, function (match, _all, _number, _digits, decimal, hex, word) {
if (decimal) {
return ts.utf16EncodeAsString(parseInt(decimal, 10));
}
else if (hex) {
return ts.utf16EncodeAsString(parseInt(hex, 16));
}
else {
var ch = entities.get(word);
// If this is not a valid entity, then just use `match` (replace it with itself, i.e. don't replace)
return ch ? ts.utf16EncodeAsString(ch) : match;
}
});
}
/** Like `decodeEntities` but returns `undefined` if there were no entities to decode. */
function tryDecodeEntities(text) {
var decoded = decodeEntities(text);
return decoded === text ? undefined : decoded;
}
function getTagName(node) {
if (node.kind === 276 /* JsxElement */) {
return getTagName(node.openingElement);
}
else {
var name = node.tagName;
if (ts.isIdentifier(name) && ts.isIntrinsicJsxName(name.escapedText)) {
return factory.createStringLiteral(ts.idText(name));
}
else {
return ts.createExpressionFromEntityName(factory, name);
}
}
}
/**
* Emit an attribute name, which is quoted if it needs to be quoted. Because
* these emit into an object literal property name, we don't need to be worried
* about keywords, just non-identifier characters
*/
function getAttributeName(node) {
var name = node.name;
var text = ts.idText(name);
if (/^[A-Za-z_]\w*$/.test(text)) {
return name;
}
else {
return factory.createStringLiteral(text);
}
}
function visitJsxExpression(node) {
return ts.visitNode(node.expression, visitor, ts.isExpression);
}
}
ts.transformJsx = transformJsx;
var entities = new ts.Map(ts.getEntries({
quot: 0x0022,
amp: 0x0026,
apos: 0x0027,
lt: 0x003C,
gt: 0x003E,
nbsp: 0x00A0,
iexcl: 0x00A1,
cent: 0x00A2,
pound: 0x00A3,
curren: 0x00A4,
yen: 0x00A5,
brvbar: 0x00A6,
sect: 0x00A7,
uml: 0x00A8,
copy: 0x00A9,
ordf: 0x00AA,
laquo: 0x00AB,
not: 0x00AC,
shy: 0x00AD,
reg: 0x00AE,
macr: 0x00AF,
deg: 0x00B0,
plusmn: 0x00B1,
sup2: 0x00B2,
sup3: 0x00B3,
acute: 0x00B4,
micro: 0x00B5,
para: 0x00B6,
middot: 0x00B7,
cedil: 0x00B8,
sup1: 0x00B9,
ordm: 0x00BA,
raquo: 0x00BB,
frac14: 0x00BC,
frac12: 0x00BD,
frac34: 0x00BE,
iquest: 0x00BF,
Agrave: 0x00C0,
Aacute: 0x00C1,
Acirc: 0x00C2,
Atilde: 0x00C3,
Auml: 0x00C4,
Aring: 0x00C5,
AElig: 0x00C6,
Ccedil: 0x00C7,
Egrave: 0x00C8,
Eacute: 0x00C9,
Ecirc: 0x00CA,
Euml: 0x00CB,
Igrave: 0x00CC,
Iacute: 0x00CD,
Icirc: 0x00CE,
Iuml: 0x00CF,
ETH: 0x00D0,
Ntilde: 0x00D1,
Ograve: 0x00D2,
Oacute: 0x00D3,
Ocirc: 0x00D4,
Otilde: 0x00D5,
Ouml: 0x00D6,
times: 0x00D7,
Oslash: 0x00D8,
Ugrave: 0x00D9,
Uacute: 0x00DA,
Ucirc: 0x00DB,
Uuml: 0x00DC,
Yacute: 0x00DD,
THORN: 0x00DE,
szlig: 0x00DF,
agrave: 0x00E0,
aacute: 0x00E1,
acirc: 0x00E2,
atilde: 0x00E3,
auml: 0x00E4,
aring: 0x00E5,
aelig: 0x00E6,
ccedil: 0x00E7,
egrave: 0x00E8,
eacute: 0x00E9,
ecirc: 0x00EA,
euml: 0x00EB,
igrave: 0x00EC,
iacute: 0x00ED,
icirc: 0x00EE,
iuml: 0x00EF,
eth: 0x00F0,
ntilde: 0x00F1,
ograve: 0x00F2,
oacute: 0x00F3,
ocirc: 0x00F4,
otilde: 0x00F5,
ouml: 0x00F6,
divide: 0x00F7,
oslash: 0x00F8,
ugrave: 0x00F9,
uacute: 0x00FA,
ucirc: 0x00FB,
uuml: 0x00FC,
yacute: 0x00FD,
thorn: 0x00FE,
yuml: 0x00FF,
OElig: 0x0152,
oelig: 0x0153,
Scaron: 0x0160,
scaron: 0x0161,
Yuml: 0x0178,
fnof: 0x0192,
circ: 0x02C6,
tilde: 0x02DC,
Alpha: 0x0391,
Beta: 0x0392,
Gamma: 0x0393,
Delta: 0x0394,
Epsilon: 0x0395,
Zeta: 0x0396,
Eta: 0x0397,
Theta: 0x0398,
Iota: 0x0399,
Kappa: 0x039A,
Lambda: 0x039B,
Mu: 0x039C,
Nu: 0x039D,
Xi: 0x039E,
Omicron: 0x039F,
Pi: 0x03A0,
Rho: 0x03A1,
Sigma: 0x03A3,
Tau: 0x03A4,
Upsilon: 0x03A5,
Phi: 0x03A6,
Chi: 0x03A7,
Psi: 0x03A8,
Omega: 0x03A9,
alpha: 0x03B1,
beta: 0x03B2,
gamma: 0x03B3,
delta: 0x03B4,
epsilon: 0x03B5,
zeta: 0x03B6,
eta: 0x03B7,
theta: 0x03B8,
iota: 0x03B9,
kappa: 0x03BA,
lambda: 0x03BB,
mu: 0x03BC,
nu: 0x03BD,
xi: 0x03BE,
omicron: 0x03BF,
pi: 0x03C0,
rho: 0x03C1,
sigmaf: 0x03C2,
sigma: 0x03C3,
tau: 0x03C4,
upsilon: 0x03C5,
phi: 0x03C6,
chi: 0x03C7,
psi: 0x03C8,
omega: 0x03C9,
thetasym: 0x03D1,
upsih: 0x03D2,
piv: 0x03D6,
ensp: 0x2002,
emsp: 0x2003,
thinsp: 0x2009,
zwnj: 0x200C,
zwj: 0x200D,
lrm: 0x200E,
rlm: 0x200F,
ndash: 0x2013,
mdash: 0x2014,
lsquo: 0x2018,
rsquo: 0x2019,
sbquo: 0x201A,
ldquo: 0x201C,
rdquo: 0x201D,
bdquo: 0x201E,
dagger: 0x2020,
Dagger: 0x2021,
bull: 0x2022,
hellip: 0x2026,
permil: 0x2030,
prime: 0x2032,
Prime: 0x2033,
lsaquo: 0x2039,
rsaquo: 0x203A,
oline: 0x203E,
frasl: 0x2044,
euro: 0x20AC,
image: 0x2111,
weierp: 0x2118,
real: 0x211C,
trade: 0x2122,
alefsym: 0x2135,
larr: 0x2190,
uarr: 0x2191,
rarr: 0x2192,
darr: 0x2193,
harr: 0x2194,
crarr: 0x21B5,
lArr: 0x21D0,
uArr: 0x21D1,
rArr: 0x21D2,
dArr: 0x21D3,
hArr: 0x21D4,
forall: 0x2200,
part: 0x2202,
exist: 0x2203,
empty: 0x2205,
nabla: 0x2207,
isin: 0x2208,
notin: 0x2209,
ni: 0x220B,
prod: 0x220F,
sum: 0x2211,
minus: 0x2212,
lowast: 0x2217,
radic: 0x221A,
prop: 0x221D,
infin: 0x221E,
ang: 0x2220,
and: 0x2227,
or: 0x2228,
cap: 0x2229,
cup: 0x222A,
int: 0x222B,
there4: 0x2234,
sim: 0x223C,
cong: 0x2245,
asymp: 0x2248,
ne: 0x2260,
equiv: 0x2261,
le: 0x2264,
ge: 0x2265,
sub: 0x2282,
sup: 0x2283,
nsub: 0x2284,
sube: 0x2286,
supe: 0x2287,
oplus: 0x2295,
otimes: 0x2297,
perp: 0x22A5,
sdot: 0x22C5,
lceil: 0x2308,
rceil: 0x2309,
lfloor: 0x230A,
rfloor: 0x230B,
lang: 0x2329,
rang: 0x232A,
loz: 0x25CA,
spades: 0x2660,
clubs: 0x2663,
hearts: 0x2665,
diams: 0x2666
}));
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
function transformES2016(context) {
var factory = context.factory, hoistVariableDeclaration = context.hoistVariableDeclaration;
return ts.chainBundle(context, transformSourceFile);
function transformSourceFile(node) {
if (node.isDeclarationFile) {
return node;
}
return ts.visitEachChild(node, visitor, context);
}
function visitor(node) {
if ((node.transformFlags & 256 /* ContainsES2016 */) === 0) {
return node;
}
switch (node.kind) {
case 219 /* BinaryExpression */:
return visitBinaryExpression(node);
default:
return ts.visitEachChild(node, visitor, context);
}
}
function visitBinaryExpression(node) {
switch (node.operatorToken.kind) {
case 67 /* AsteriskAsteriskEqualsToken */:
return visitExponentiationAssignmentExpression(node);
case 42 /* AsteriskAsteriskToken */:
return visitExponentiationExpression(node);
default:
return ts.visitEachChild(node, visitor, context);
}
}
function visitExponentiationAssignmentExpression(node) {
var target;
var value;
var left = ts.visitNode(node.left, visitor, ts.isExpression);
var right = ts.visitNode(node.right, visitor, ts.isExpression);
if (ts.isElementAccessExpression(left)) {
// Transforms `a[x] **= b` into `(_a = a)[_x = x] = Math.pow(_a[_x], b)`
var expressionTemp = factory.createTempVariable(hoistVariableDeclaration);
var argumentExpressionTemp = factory.createTempVariable(hoistVariableDeclaration);
target = ts.setTextRange(factory.createElementAccessExpression(ts.setTextRange(factory.createAssignment(expressionTemp, left.expression), left.expression), ts.setTextRange(factory.createAssignment(argumentExpressionTemp, left.argumentExpression), left.argumentExpression)), left);
value = ts.setTextRange(factory.createElementAccessExpression(expressionTemp, argumentExpressionTemp), left);
}
else if (ts.isPropertyAccessExpression(left)) {
// Transforms `a.x **= b` into `(_a = a).x = Math.pow(_a.x, b)`
var expressionTemp = factory.createTempVariable(hoistVariableDeclaration);
target = ts.setTextRange(factory.createPropertyAccessExpression(ts.setTextRange(factory.createAssignment(expressionTemp, left.expression), left.expression), left.name), left);
value = ts.setTextRange(factory.createPropertyAccessExpression(expressionTemp, left.name), left);
}
else {
// Transforms `a **= b` into `a = Math.pow(a, b)`
target = left;
value = left;
}
return ts.setTextRange(factory.createAssignment(target, ts.setTextRange(factory.createGlobalMethodCall("Math", "pow", [value, right]), node)), node);
}
function visitExponentiationExpression(node) {
// Transforms `a ** b` into `Math.pow(a, b)`
var left = ts.visitNode(node.left, visitor, ts.isExpression);
var right = ts.visitNode(node.right, visitor, ts.isExpression);
return ts.setTextRange(factory.createGlobalMethodCall("Math", "pow", [left, right]), node);
}
}
ts.transformES2016 = transformES2016;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
var ES2015SubstitutionFlags;
(function (ES2015SubstitutionFlags) {
/** Enables substitutions for captured `this` */
ES2015SubstitutionFlags[ES2015SubstitutionFlags["CapturedThis"] = 1] = "CapturedThis";
/** Enables substitutions for block-scoped bindings. */
ES2015SubstitutionFlags[ES2015SubstitutionFlags["BlockScopedBindings"] = 2] = "BlockScopedBindings";
})(ES2015SubstitutionFlags || (ES2015SubstitutionFlags = {}));
var LoopOutParameterFlags;
(function (LoopOutParameterFlags) {
LoopOutParameterFlags[LoopOutParameterFlags["Body"] = 1] = "Body";
LoopOutParameterFlags[LoopOutParameterFlags["Initializer"] = 2] = "Initializer";
})(LoopOutParameterFlags || (LoopOutParameterFlags = {}));
var CopyDirection;
(function (CopyDirection) {
CopyDirection[CopyDirection["ToOriginal"] = 0] = "ToOriginal";
CopyDirection[CopyDirection["ToOutParameter"] = 1] = "ToOutParameter";
})(CopyDirection || (CopyDirection = {}));
var Jump;
(function (Jump) {
Jump[Jump["Break"] = 2] = "Break";
Jump[Jump["Continue"] = 4] = "Continue";
Jump[Jump["Return"] = 8] = "Return";
})(Jump || (Jump = {}));
// Facts we track as we traverse the tree
var HierarchyFacts;
(function (HierarchyFacts) {
HierarchyFacts[HierarchyFacts["None"] = 0] = "None";
//
// Ancestor facts
//
HierarchyFacts[HierarchyFacts["Function"] = 1] = "Function";
HierarchyFacts[HierarchyFacts["ArrowFunction"] = 2] = "ArrowFunction";
HierarchyFacts[HierarchyFacts["AsyncFunctionBody"] = 4] = "AsyncFunctionBody";
HierarchyFacts[HierarchyFacts["NonStaticClassElement"] = 8] = "NonStaticClassElement";
HierarchyFacts[HierarchyFacts["CapturesThis"] = 16] = "CapturesThis";
HierarchyFacts[HierarchyFacts["ExportedVariableStatement"] = 32] = "ExportedVariableStatement";
HierarchyFacts[HierarchyFacts["TopLevel"] = 64] = "TopLevel";
HierarchyFacts[HierarchyFacts["Block"] = 128] = "Block";
HierarchyFacts[HierarchyFacts["IterationStatement"] = 256] = "IterationStatement";
HierarchyFacts[HierarchyFacts["IterationStatementBlock"] = 512] = "IterationStatementBlock";
HierarchyFacts[HierarchyFacts["IterationContainer"] = 1024] = "IterationContainer";
HierarchyFacts[HierarchyFacts["ForStatement"] = 2048] = "ForStatement";
HierarchyFacts[HierarchyFacts["ForInOrForOfStatement"] = 4096] = "ForInOrForOfStatement";
HierarchyFacts[HierarchyFacts["ConstructorWithCapturedSuper"] = 8192] = "ConstructorWithCapturedSuper";
HierarchyFacts[HierarchyFacts["StaticInitializer"] = 16384] = "StaticInitializer";
// NOTE: do not add more ancestor flags without also updating AncestorFactsMask below.
// NOTE: when adding a new ancestor flag, be sure to update the subtree flags below.
//
// Ancestor masks
//
HierarchyFacts[HierarchyFacts["AncestorFactsMask"] = 32767] = "AncestorFactsMask";
// We are always in *some* kind of block scope, but only specific block-scope containers are
// top-level or Blocks.
HierarchyFacts[HierarchyFacts["BlockScopeIncludes"] = 0] = "BlockScopeIncludes";
HierarchyFacts[HierarchyFacts["BlockScopeExcludes"] = 7104] = "BlockScopeExcludes";
// A source file is a top-level block scope.
HierarchyFacts[HierarchyFacts["SourceFileIncludes"] = 64] = "SourceFileIncludes";
HierarchyFacts[HierarchyFacts["SourceFileExcludes"] = 8064] = "SourceFileExcludes";
// Functions, methods, and accessors are both new lexical scopes and new block scopes.
HierarchyFacts[HierarchyFacts["FunctionIncludes"] = 65] = "FunctionIncludes";
HierarchyFacts[HierarchyFacts["FunctionExcludes"] = 32670] = "FunctionExcludes";
HierarchyFacts[HierarchyFacts["AsyncFunctionBodyIncludes"] = 69] = "AsyncFunctionBodyIncludes";
HierarchyFacts[HierarchyFacts["AsyncFunctionBodyExcludes"] = 32662] = "AsyncFunctionBodyExcludes";
// Arrow functions are lexically scoped to their container, but are new block scopes.
HierarchyFacts[HierarchyFacts["ArrowFunctionIncludes"] = 66] = "ArrowFunctionIncludes";
HierarchyFacts[HierarchyFacts["ArrowFunctionExcludes"] = 15232] = "ArrowFunctionExcludes";
// Constructors are both new lexical scopes and new block scopes. Constructors are also
// always considered non-static members of a class.
HierarchyFacts[HierarchyFacts["ConstructorIncludes"] = 73] = "ConstructorIncludes";
HierarchyFacts[HierarchyFacts["ConstructorExcludes"] = 32662] = "ConstructorExcludes";
// 'do' and 'while' statements are not block scopes. We track that the subtree is contained
// within an IterationStatement to indicate whether the embedded statement is an
// IterationStatementBlock.
HierarchyFacts[HierarchyFacts["DoOrWhileStatementIncludes"] = 1280] = "DoOrWhileStatementIncludes";
HierarchyFacts[HierarchyFacts["DoOrWhileStatementExcludes"] = 0] = "DoOrWhileStatementExcludes";
// 'for' statements are new block scopes and have special handling for 'let' declarations.
HierarchyFacts[HierarchyFacts["ForStatementIncludes"] = 3328] = "ForStatementIncludes";
HierarchyFacts[HierarchyFacts["ForStatementExcludes"] = 5056] = "ForStatementExcludes";
// 'for-in' and 'for-of' statements are new block scopes and have special handling for
// 'let' declarations.
HierarchyFacts[HierarchyFacts["ForInOrForOfStatementIncludes"] = 5376] = "ForInOrForOfStatementIncludes";
HierarchyFacts[HierarchyFacts["ForInOrForOfStatementExcludes"] = 3008] = "ForInOrForOfStatementExcludes";
// Blocks (other than function bodies) are new block scopes.
HierarchyFacts[HierarchyFacts["BlockIncludes"] = 128] = "BlockIncludes";
HierarchyFacts[HierarchyFacts["BlockExcludes"] = 6976] = "BlockExcludes";
HierarchyFacts[HierarchyFacts["IterationStatementBlockIncludes"] = 512] = "IterationStatementBlockIncludes";
HierarchyFacts[HierarchyFacts["IterationStatementBlockExcludes"] = 7104] = "IterationStatementBlockExcludes";
HierarchyFacts[HierarchyFacts["StaticInitializerIncludes"] = 16449] = "StaticInitializerIncludes";
HierarchyFacts[HierarchyFacts["StaticInitializerExcludes"] = 32670] = "StaticInitializerExcludes";
//
// Subtree facts
//
HierarchyFacts[HierarchyFacts["NewTarget"] = 32768] = "NewTarget";
HierarchyFacts[HierarchyFacts["CapturedLexicalThis"] = 65536] = "CapturedLexicalThis";
//
// Subtree masks
//
HierarchyFacts[HierarchyFacts["SubtreeFactsMask"] = -32768] = "SubtreeFactsMask";
HierarchyFacts[HierarchyFacts["ArrowFunctionSubtreeExcludes"] = 0] = "ArrowFunctionSubtreeExcludes";
HierarchyFacts[HierarchyFacts["FunctionSubtreeExcludes"] = 98304] = "FunctionSubtreeExcludes";
})(HierarchyFacts || (HierarchyFacts = {}));
var SpreadSegmentKind;
(function (SpreadSegmentKind) {
SpreadSegmentKind[SpreadSegmentKind["None"] = 0] = "None";
SpreadSegmentKind[SpreadSegmentKind["UnpackedSpread"] = 1] = "UnpackedSpread";
SpreadSegmentKind[SpreadSegmentKind["PackedSpread"] = 2] = "PackedSpread";
})(SpreadSegmentKind || (SpreadSegmentKind = {}));
function createSpreadSegment(kind, expression) {
return { kind: kind, expression: expression };
}
function transformES2015(context) {
var factory = context.factory, emitHelpers = context.getEmitHelperFactory, startLexicalEnvironment = context.startLexicalEnvironment, resumeLexicalEnvironment = context.resumeLexicalEnvironment, endLexicalEnvironment = context.endLexicalEnvironment, hoistVariableDeclaration = context.hoistVariableDeclaration;
var compilerOptions = context.getCompilerOptions();
var resolver = context.getEmitResolver();
var previousOnSubstituteNode = context.onSubstituteNode;
var previousOnEmitNode = context.onEmitNode;
context.onEmitNode = onEmitNode;
context.onSubstituteNode = onSubstituteNode;
var currentSourceFile;
var currentText;
var hierarchyFacts;
var taggedTemplateStringDeclarations;
function recordTaggedTemplateString(temp) {
taggedTemplateStringDeclarations = ts.append(taggedTemplateStringDeclarations, factory.createVariableDeclaration(temp));
}
/**
* Used to track if we are emitting body of the converted loop
*/
var convertedLoopState;
/**
* Keeps track of whether substitutions have been enabled for specific cases.
* They are persisted between each SourceFile transformation and should not
* be reset.
*/
var enabledSubstitutions;
return ts.chainBundle(context, transformSourceFile);
function transformSourceFile(node) {
if (node.isDeclarationFile) {
return node;
}
currentSourceFile = node;
currentText = node.text;
var visited = visitSourceFile(node);
ts.addEmitHelpers(visited, context.readEmitHelpers());
currentSourceFile = undefined;
currentText = undefined;
taggedTemplateStringDeclarations = undefined;
hierarchyFacts = 0 /* None */;
return visited;
}
/**
* Sets the `HierarchyFacts` for this node prior to visiting this node's subtree, returning the facts set prior to modification.
* @param excludeFacts The existing `HierarchyFacts` to reset before visiting the subtree.
* @param includeFacts The new `HierarchyFacts` to set before visiting the subtree.
*/
function enterSubtree(excludeFacts, includeFacts) {
var ancestorFacts = hierarchyFacts;
hierarchyFacts = (hierarchyFacts & ~excludeFacts | includeFacts) & 32767 /* AncestorFactsMask */;
return ancestorFacts;
}
/**
* Restores the `HierarchyFacts` for this node's ancestor after visiting this node's
* subtree, propagating specific facts from the subtree.
* @param ancestorFacts The `HierarchyFacts` of the ancestor to restore after visiting the subtree.
* @param excludeFacts The existing `HierarchyFacts` of the subtree that should not be propagated.
* @param includeFacts The new `HierarchyFacts` of the subtree that should be propagated.
*/
function exitSubtree(ancestorFacts, excludeFacts, includeFacts) {
hierarchyFacts = (hierarchyFacts & ~excludeFacts | includeFacts) & -32768 /* SubtreeFactsMask */ | ancestorFacts;
}
function isReturnVoidStatementInConstructorWithCapturedSuper(node) {
return (hierarchyFacts & 8192 /* ConstructorWithCapturedSuper */) !== 0
&& node.kind === 245 /* ReturnStatement */
&& !node.expression;
}
function isOrMayContainReturnCompletion(node) {
return node.transformFlags & 2097152 /* ContainsHoistedDeclarationOrCompletion */
&& (ts.isReturnStatement(node)
|| ts.isIfStatement(node)
|| ts.isWithStatement(node)
|| ts.isSwitchStatement(node)
|| ts.isCaseBlock(node)
|| ts.isCaseClause(node)
|| ts.isDefaultClause(node)
|| ts.isTryStatement(node)
|| ts.isCatchClause(node)
|| ts.isLabeledStatement(node)
|| ts.isIterationStatement(node, /*lookInLabeledStatements*/ false)
|| ts.isBlock(node));
}
function shouldVisitNode(node) {
return (node.transformFlags & 512 /* ContainsES2015 */) !== 0
|| convertedLoopState !== undefined
|| (hierarchyFacts & 8192 /* ConstructorWithCapturedSuper */ && isOrMayContainReturnCompletion(node))
|| (ts.isIterationStatement(node, /*lookInLabeledStatements*/ false) && shouldConvertIterationStatement(node))
|| (ts.getEmitFlags(node) & 33554432 /* TypeScriptClassWrapper */) !== 0;
}
function visitor(node) {
return shouldVisitNode(node) ? visitorWorker(node, /*expressionResultIsUnused*/ false) : node;
}
function visitorWithUnusedExpressionResult(node) {
return shouldVisitNode(node) ? visitorWorker(node, /*expressionResultIsUnused*/ true) : node;
}
function classWrapperStatementVisitor(node) {
if (shouldVisitNode(node)) {
var original = ts.getOriginalNode(node);
if (ts.isPropertyDeclaration(original) && ts.hasStaticModifier(original)) {
var ancestorFacts = enterSubtree(32670 /* StaticInitializerExcludes */, 16449 /* StaticInitializerIncludes */);
var result = visitorWorker(node, /*expressionResultIsUnused*/ false);
exitSubtree(ancestorFacts, 98304 /* FunctionSubtreeExcludes */, 0 /* None */);
return result;
}
return visitorWorker(node, /*expressionResultIsUnused*/ false);
}
return node;
}
function callExpressionVisitor(node) {
if (node.kind === 106 /* SuperKeyword */) {
return visitSuperKeyword(/*isExpressionOfCall*/ true);
}
return visitor(node);
}
function visitorWorker(node, expressionResultIsUnused) {
switch (node.kind) {
case 124 /* StaticKeyword */:
return undefined; // elide static keyword
case 255 /* ClassDeclaration */:
return visitClassDeclaration(node);
case 224 /* ClassExpression */:
return visitClassExpression(node);
case 162 /* Parameter */:
return visitParameter(node);
case 254 /* FunctionDeclaration */:
return visitFunctionDeclaration(node);
case 212 /* ArrowFunction */:
return visitArrowFunction(node);
case 211 /* FunctionExpression */:
return visitFunctionExpression(node);
case 252 /* VariableDeclaration */:
return visitVariableDeclaration(node);
case 79 /* Identifier */:
return visitIdentifier(node);
case 253 /* VariableDeclarationList */:
return visitVariableDeclarationList(node);
case 247 /* SwitchStatement */:
return visitSwitchStatement(node);
case 261 /* CaseBlock */:
return visitCaseBlock(node);
case 233 /* Block */:
return visitBlock(node, /*isFunctionBody*/ false);
case 244 /* BreakStatement */:
case 243 /* ContinueStatement */:
return visitBreakOrContinueStatement(node);
case 248 /* LabeledStatement */:
return visitLabeledStatement(node);
case 238 /* DoStatement */:
case 239 /* WhileStatement */:
return visitDoOrWhileStatement(node, /*outermostLabeledStatement*/ undefined);
case 240 /* ForStatement */:
return visitForStatement(node, /*outermostLabeledStatement*/ undefined);
case 241 /* ForInStatement */:
return visitForInStatement(node, /*outermostLabeledStatement*/ undefined);
case 242 /* ForOfStatement */:
return visitForOfStatement(node, /*outermostLabeledStatement*/ undefined);
case 236 /* ExpressionStatement */:
return visitExpressionStatement(node);
case 203 /* ObjectLiteralExpression */:
return visitObjectLiteralExpression(node);
case 290 /* CatchClause */:
return visitCatchClause(node);
case 292 /* ShorthandPropertyAssignment */:
return visitShorthandPropertyAssignment(node);
case 160 /* ComputedPropertyName */:
return visitComputedPropertyName(node);
case 202 /* ArrayLiteralExpression */:
return visitArrayLiteralExpression(node);
case 206 /* CallExpression */:
return visitCallExpression(node);
case 207 /* NewExpression */:
return visitNewExpression(node);
case 210 /* ParenthesizedExpression */:
return visitParenthesizedExpression(node, expressionResultIsUnused);
case 219 /* BinaryExpression */:
return visitBinaryExpression(node, expressionResultIsUnused);
case 346 /* CommaListExpression */:
return visitCommaListExpression(node, expressionResultIsUnused);
case 14 /* NoSubstitutionTemplateLiteral */:
case 15 /* TemplateHead */:
case 16 /* TemplateMiddle */:
case 17 /* TemplateTail */:
return visitTemplateLiteral(node);
case 10 /* StringLiteral */:
return visitStringLiteral(node);
case 8 /* NumericLiteral */:
return visitNumericLiteral(node);
case 208 /* TaggedTemplateExpression */:
return visitTaggedTemplateExpression(node);
case 221 /* TemplateExpression */:
return visitTemplateExpression(node);
case 222 /* YieldExpression */:
return visitYieldExpression(node);
case 223 /* SpreadElement */:
return visitSpreadElement(node);
case 106 /* SuperKeyword */:
return visitSuperKeyword(/*isExpressionOfCall*/ false);
case 108 /* ThisKeyword */:
return visitThisKeyword(node);
case 229 /* MetaProperty */:
return visitMetaProperty(node);
case 167 /* MethodDeclaration */:
return visitMethodDeclaration(node);
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return visitAccessorDeclaration(node);
case 235 /* VariableStatement */:
return visitVariableStatement(node);
case 245 /* ReturnStatement */:
return visitReturnStatement(node);
case 215 /* VoidExpression */:
return visitVoidExpression(node);
default:
return ts.visitEachChild(node, visitor, context);
}
}
function visitSourceFile(node) {
var ancestorFacts = enterSubtree(8064 /* SourceFileExcludes */, 64 /* SourceFileIncludes */);
var prologue = [];
var statements = [];
startLexicalEnvironment();
var statementOffset = factory.copyPrologue(node.statements, prologue, /*ensureUseStrict*/ false, visitor);
ts.addRange(statements, ts.visitNodes(node.statements, visitor, ts.isStatement, statementOffset));
if (taggedTemplateStringDeclarations) {
statements.push(factory.createVariableStatement(/*modifiers*/ undefined, factory.createVariableDeclarationList(taggedTemplateStringDeclarations)));
}
factory.mergeLexicalEnvironment(prologue, endLexicalEnvironment());
insertCaptureThisForNodeIfNeeded(prologue, node);
exitSubtree(ancestorFacts, 0 /* None */, 0 /* None */);
return factory.updateSourceFile(node, ts.setTextRange(factory.createNodeArray(ts.concatenate(prologue, statements)), node.statements));
}
function visitSwitchStatement(node) {
if (convertedLoopState !== undefined) {
var savedAllowedNonLabeledJumps = convertedLoopState.allowedNonLabeledJumps;
// for switch statement allow only non-labeled break
convertedLoopState.allowedNonLabeledJumps |= 2 /* Break */;
var result = ts.visitEachChild(node, visitor, context);
convertedLoopState.allowedNonLabeledJumps = savedAllowedNonLabeledJumps;
return result;
}
return ts.visitEachChild(node, visitor, context);
}
function visitCaseBlock(node) {
var ancestorFacts = enterSubtree(7104 /* BlockScopeExcludes */, 0 /* BlockScopeIncludes */);
var updated = ts.visitEachChild(node, visitor, context);
exitSubtree(ancestorFacts, 0 /* None */, 0 /* None */);
return updated;
}
function returnCapturedThis(node) {
return ts.setOriginalNode(factory.createReturnStatement(factory.createUniqueName("_this", 16 /* Optimistic */ | 32 /* FileLevel */)), node);
}
function visitReturnStatement(node) {
if (convertedLoopState) {
convertedLoopState.nonLocalJumps |= 8 /* Return */;
if (isReturnVoidStatementInConstructorWithCapturedSuper(node)) {
node = returnCapturedThis(node);
}
return factory.createReturnStatement(factory.createObjectLiteralExpression([
factory.createPropertyAssignment(factory.createIdentifier("value"), node.expression
? ts.visitNode(node.expression, visitor, ts.isExpression)
: factory.createVoidZero())
]));
}
else if (isReturnVoidStatementInConstructorWithCapturedSuper(node)) {
return returnCapturedThis(node);
}
return ts.visitEachChild(node, visitor, context);
}
function visitThisKeyword(node) {
if (hierarchyFacts & 2 /* ArrowFunction */ && !(hierarchyFacts & 16384 /* StaticInitializer */)) {
hierarchyFacts |= 65536 /* CapturedLexicalThis */;
}
if (convertedLoopState) {
if (hierarchyFacts & 2 /* ArrowFunction */) {
// if the enclosing function is an ArrowFunction then we use the captured 'this' keyword.
convertedLoopState.containsLexicalThis = true;
return node;
}
return convertedLoopState.thisName || (convertedLoopState.thisName = factory.createUniqueName("this"));
}
return node;
}
function visitVoidExpression(node) {
return ts.visitEachChild(node, visitorWithUnusedExpressionResult, context);
}
function visitIdentifier(node) {
if (!convertedLoopState) {
return node;
}
if (resolver.isArgumentsLocalBinding(node)) {
return convertedLoopState.argumentsName || (convertedLoopState.argumentsName = factory.createUniqueName("arguments"));
}
return node;
}
function visitBreakOrContinueStatement(node) {
if (convertedLoopState) {
// check if we can emit break/continue as is
// it is possible if either
// - break/continue is labeled and label is located inside the converted loop
// - break/continue is non-labeled and located in non-converted loop/switch statement
var jump = node.kind === 244 /* BreakStatement */ ? 2 /* Break */ : 4 /* Continue */;
var canUseBreakOrContinue = (node.label && convertedLoopState.labels && convertedLoopState.labels.get(ts.idText(node.label))) ||
(!node.label && (convertedLoopState.allowedNonLabeledJumps & jump));
if (!canUseBreakOrContinue) {
var labelMarker = void 0;
var label = node.label;
if (!label) {
if (node.kind === 244 /* BreakStatement */) {
convertedLoopState.nonLocalJumps |= 2 /* Break */;
labelMarker = "break";
}
else {
convertedLoopState.nonLocalJumps |= 4 /* Continue */;
// note: return value is emitted only to simplify debugging, call to converted loop body does not do any dispatching on it.
labelMarker = "continue";
}
}
else {
if (node.kind === 244 /* BreakStatement */) {
labelMarker = "break-" + label.escapedText;
setLabeledJump(convertedLoopState, /*isBreak*/ true, ts.idText(label), labelMarker);
}
else {
labelMarker = "continue-" + label.escapedText;
setLabeledJump(convertedLoopState, /*isBreak*/ false, ts.idText(label), labelMarker);
}
}
var returnExpression = factory.createStringLiteral(labelMarker);
if (convertedLoopState.loopOutParameters.length) {
var outParams = convertedLoopState.loopOutParameters;
var expr = void 0;
for (var i = 0; i < outParams.length; i++) {
var copyExpr = copyOutParameter(outParams[i], 1 /* ToOutParameter */);
if (i === 0) {
expr = copyExpr;
}
else {
expr = factory.createBinaryExpression(expr, 27 /* CommaToken */, copyExpr);
}
}
returnExpression = factory.createBinaryExpression(expr, 27 /* CommaToken */, returnExpression);
}
return factory.createReturnStatement(returnExpression);
}
}
return ts.visitEachChild(node, visitor, context);
}
/**
* Visits a ClassDeclaration and transforms it into a variable statement.
*
* @param node A ClassDeclaration node.
*/
function visitClassDeclaration(node) {
// [source]
// class C { }
//
// [output]
// var C = (function () {
// function C() {
// }
// return C;
// }());
var variable = factory.createVariableDeclaration(factory.getLocalName(node, /*allowComments*/ true),
/*exclamationToken*/ undefined,
/*type*/ undefined, transformClassLikeDeclarationToExpression(node));
ts.setOriginalNode(variable, node);
var statements = [];
var statement = factory.createVariableStatement(/*modifiers*/ undefined, factory.createVariableDeclarationList([variable]));
ts.setOriginalNode(statement, node);
ts.setTextRange(statement, node);
ts.startOnNewLine(statement);
statements.push(statement);
// Add an `export default` statement for default exports (for `--target es5 --module es6`)
if (ts.hasSyntacticModifier(node, 1 /* Export */)) {
var exportStatement = ts.hasSyntacticModifier(node, 512 /* Default */)
? factory.createExportDefault(factory.getLocalName(node))
: factory.createExternalModuleExport(factory.getLocalName(node));
ts.setOriginalNode(exportStatement, statement);
statements.push(exportStatement);
}
var emitFlags = ts.getEmitFlags(node);
if ((emitFlags & 4194304 /* HasEndOfDeclarationMarker */) === 0) {
// Add a DeclarationMarker as a marker for the end of the declaration
statements.push(factory.createEndOfDeclarationMarker(node));
ts.setEmitFlags(statement, emitFlags | 4194304 /* HasEndOfDeclarationMarker */);
}
return ts.singleOrMany(statements);
}
/**
* Visits a ClassExpression and transforms it into an expression.
*
* @param node A ClassExpression node.
*/
function visitClassExpression(node) {
// [source]
// C = class { }
//
// [output]
// C = (function () {
// function class_1() {
// }
// return class_1;
// }())
return transformClassLikeDeclarationToExpression(node);
}
/**
* Transforms a ClassExpression or ClassDeclaration into an expression.
*
* @param node A ClassExpression or ClassDeclaration node.
*/
function transformClassLikeDeclarationToExpression(node) {
// [source]
// class C extends D {
// constructor() {}
// method() {}
// get prop() {}
// set prop(v) {}
// }
//
// [output]
// (function (_super) {
// __extends(C, _super);
// function C() {
// }
// C.prototype.method = function () {}
// Object.defineProperty(C.prototype, "prop", {
// get: function() {},
// set: function() {},
// enumerable: true,
// configurable: true
// });
// return C;
// }(D))
if (node.name) {
enableSubstitutionsForBlockScopedBindings();
}
var extendsClauseElement = ts.getClassExtendsHeritageElement(node);
var classFunction = factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, extendsClauseElement ? [factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, factory.createUniqueName("_super", 16 /* Optimistic */ | 32 /* FileLevel */))] : [],
/*type*/ undefined, transformClassBody(node, extendsClauseElement));
// To preserve the behavior of the old emitter, we explicitly indent
// the body of the function here if it was requested in an earlier
// transformation.
ts.setEmitFlags(classFunction, (ts.getEmitFlags(node) & 65536 /* Indented */) | 524288 /* ReuseTempVariableScope */);
// "inner" and "outer" below are added purely to preserve source map locations from
// the old emitter
var inner = factory.createPartiallyEmittedExpression(classFunction);
ts.setTextRangeEnd(inner, node.end);
ts.setEmitFlags(inner, 1536 /* NoComments */);
var outer = factory.createPartiallyEmittedExpression(inner);
ts.setTextRangeEnd(outer, ts.skipTrivia(currentText, node.pos));
ts.setEmitFlags(outer, 1536 /* NoComments */);
var result = factory.createParenthesizedExpression(factory.createCallExpression(outer,
/*typeArguments*/ undefined, extendsClauseElement
? [ts.visitNode(extendsClauseElement.expression, visitor, ts.isExpression)]
: []));
ts.addSyntheticLeadingComment(result, 3 /* MultiLineCommentTrivia */, "* @class ");
return result;
}
/**
* Transforms a ClassExpression or ClassDeclaration into a function body.
*
* @param node A ClassExpression or ClassDeclaration node.
* @param extendsClauseElement The expression for the class `extends` clause.
*/
function transformClassBody(node, extendsClauseElement) {
var statements = [];
var name = factory.getInternalName(node);
var constructorLikeName = ts.isIdentifierANonContextualKeyword(name) ? factory.getGeneratedNameForNode(name) : name;
startLexicalEnvironment();
addExtendsHelperIfNeeded(statements, node, extendsClauseElement);
addConstructor(statements, node, constructorLikeName, extendsClauseElement);
addClassMembers(statements, node);
// Create a synthetic text range for the return statement.
var closingBraceLocation = ts.createTokenRange(ts.skipTrivia(currentText, node.members.end), 19 /* CloseBraceToken */);
// The following partially-emitted expression exists purely to align our sourcemap
// emit with the original emitter.
var outer = factory.createPartiallyEmittedExpression(constructorLikeName);
ts.setTextRangeEnd(outer, closingBraceLocation.end);
ts.setEmitFlags(outer, 1536 /* NoComments */);
var statement = factory.createReturnStatement(outer);
ts.setTextRangePos(statement, closingBraceLocation.pos);
ts.setEmitFlags(statement, 1536 /* NoComments */ | 384 /* NoTokenSourceMaps */);
statements.push(statement);
ts.insertStatementsAfterStandardPrologue(statements, endLexicalEnvironment());
var block = factory.createBlock(ts.setTextRange(factory.createNodeArray(statements), /*location*/ node.members), /*multiLine*/ true);
ts.setEmitFlags(block, 1536 /* NoComments */);
return block;
}
/**
* Adds a call to the `__extends` helper if needed for a class.
*
* @param statements The statements of the class body function.
* @param node The ClassExpression or ClassDeclaration node.
* @param extendsClauseElement The expression for the class `extends` clause.
*/
function addExtendsHelperIfNeeded(statements, node, extendsClauseElement) {
if (extendsClauseElement) {
statements.push(ts.setTextRange(factory.createExpressionStatement(emitHelpers().createExtendsHelper(factory.getInternalName(node))),
/*location*/ extendsClauseElement));
}
}
/**
* Adds the constructor of the class to a class body function.
*
* @param statements The statements of the class body function.
* @param node The ClassExpression or ClassDeclaration node.
* @param extendsClauseElement The expression for the class `extends` clause.
*/
function addConstructor(statements, node, name, extendsClauseElement) {
var savedConvertedLoopState = convertedLoopState;
convertedLoopState = undefined;
var ancestorFacts = enterSubtree(32662 /* ConstructorExcludes */, 73 /* ConstructorIncludes */);
var constructor = ts.getFirstConstructorWithBody(node);
var hasSynthesizedSuper = hasSynthesizedDefaultSuperCall(constructor, extendsClauseElement !== undefined);
var constructorFunction = factory.createFunctionDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*asteriskToken*/ undefined, name,
/*typeParameters*/ undefined, transformConstructorParameters(constructor, hasSynthesizedSuper),
/*type*/ undefined, transformConstructorBody(constructor, node, extendsClauseElement, hasSynthesizedSuper));
ts.setTextRange(constructorFunction, constructor || node);
if (extendsClauseElement) {
ts.setEmitFlags(constructorFunction, 8 /* CapturesThis */);
}
statements.push(constructorFunction);
exitSubtree(ancestorFacts, 98304 /* FunctionSubtreeExcludes */, 0 /* None */);
convertedLoopState = savedConvertedLoopState;
}
/**
* Transforms the parameters of the constructor declaration of a class.
*
* @param constructor The constructor for the class.
* @param hasSynthesizedSuper A value indicating whether the constructor starts with a
* synthesized `super` call.
*/
function transformConstructorParameters(constructor, hasSynthesizedSuper) {
// If the TypeScript transformer needed to synthesize a constructor for property
// initializers, it would have also added a synthetic `...args` parameter and
// `super` call.
// If this is the case, we do not include the synthetic `...args` parameter and
// will instead use the `arguments` object in ES5/3.
return ts.visitParameterList(constructor && !hasSynthesizedSuper ? constructor.parameters : undefined, visitor, context)
|| [];
}
function createDefaultConstructorBody(node, isDerivedClass) {
// We must be here because the user didn't write a constructor
// but we needed to call 'super(...args)' anyway as per 14.5.14 of the ES2016 spec.
// If that's the case we can just immediately return the result of a 'super()' call.
var statements = [];
resumeLexicalEnvironment();
factory.mergeLexicalEnvironment(statements, endLexicalEnvironment());
if (isDerivedClass) {
// return _super !== null && _super.apply(this, arguments) || this;
statements.push(factory.createReturnStatement(createDefaultSuperCallOrThis()));
}
var statementsArray = factory.createNodeArray(statements);
ts.setTextRange(statementsArray, node.members);
var block = factory.createBlock(statementsArray, /*multiLine*/ true);
ts.setTextRange(block, node);
ts.setEmitFlags(block, 1536 /* NoComments */);
return block;
}
/**
* Transforms the body of a constructor declaration of a class.
*
* @param constructor The constructor for the class.
* @param node The node which contains the constructor.
* @param extendsClauseElement The expression for the class `extends` clause.
* @param hasSynthesizedSuper A value indicating whether the constructor starts with a
* synthesized `super` call.
*/
function transformConstructorBody(constructor, node, extendsClauseElement, hasSynthesizedSuper) {
// determine whether the class is known syntactically to be a derived class (e.g. a
// class that extends a value that is not syntactically known to be `null`).
var isDerivedClass = !!extendsClauseElement && ts.skipOuterExpressions(extendsClauseElement.expression).kind !== 104 /* NullKeyword */;
// When the subclass does not have a constructor, we synthesize a *default* constructor using the following
// representation:
//
// ```
// // es2015 (source)
// class C extends Base { }
//
// // es5 (transformed)
// var C = (function (_super) {
// function C() {
// return _super.apply(this, arguments) || this;
// }
// return C;
// })(Base);
// ```
if (!constructor)
return createDefaultConstructorBody(node, isDerivedClass);
// The prologue will contain all leading standard and custom prologue statements added by this transform
var prologue = [];
var statements = [];
resumeLexicalEnvironment();
// If a super call has already been synthesized,
// we're going to assume that we should just transform everything after that.
// The assumption is that no prior step in the pipeline has added any prologue directives.
var statementOffset = 0;
if (!hasSynthesizedSuper)
statementOffset = factory.copyStandardPrologue(constructor.body.statements, prologue, /*ensureUseStrict*/ false);
addDefaultValueAssignmentsIfNeeded(statements, constructor);
addRestParameterIfNeeded(statements, constructor, hasSynthesizedSuper);
if (!hasSynthesizedSuper)
statementOffset = factory.copyCustomPrologue(constructor.body.statements, statements, statementOffset, visitor);
// If the first statement is a call to `super()`, visit the statement directly
var superCallExpression;
if (hasSynthesizedSuper) {
superCallExpression = createDefaultSuperCallOrThis();
}
else if (isDerivedClass && statementOffset < constructor.body.statements.length) {
var firstStatement = constructor.body.statements[statementOffset];
if (ts.isExpressionStatement(firstStatement) && ts.isSuperCall(firstStatement.expression)) {
superCallExpression = visitImmediateSuperCallInBody(firstStatement.expression);
}
}
if (superCallExpression) {
hierarchyFacts |= 8192 /* ConstructorWithCapturedSuper */;
statementOffset++; // skip this statement, we will add it after visiting the rest of the body.
}
// visit the remaining statements
ts.addRange(statements, ts.visitNodes(constructor.body.statements, visitor, ts.isStatement, /*start*/ statementOffset));
factory.mergeLexicalEnvironment(prologue, endLexicalEnvironment());
insertCaptureNewTargetIfNeeded(prologue, constructor, /*copyOnWrite*/ false);
if (isDerivedClass) {
if (superCallExpression && statementOffset === constructor.body.statements.length && !(constructor.body.transformFlags & 8192 /* ContainsLexicalThis */)) {
// If the subclass constructor does *not* contain `this` and *ends* with a `super()` call, we will use the
// following representation:
//
// ```
// // es2015 (source)
// class C extends Base {
// constructor() {
// super("foo");
// }
// }
//
// // es5 (transformed)
// var C = (function (_super) {
// function C() {
// return _super.call(this, "foo") || this;
// }
// return C;
// })(Base);
// ```
var superCall = ts.cast(ts.cast(superCallExpression, ts.isBinaryExpression).left, ts.isCallExpression);
var returnStatement = factory.createReturnStatement(superCallExpression);
ts.setCommentRange(returnStatement, ts.getCommentRange(superCall));
ts.setEmitFlags(superCall, 1536 /* NoComments */);
statements.push(returnStatement);
}
else {
// Otherwise, we will use the following transformed representation for calls to `super()` in a constructor:
//
// ```
// // es2015 (source)
// class C extends Base {
// constructor() {
// super("foo");
// this.x = 1;
// }
// }
//
// // es5 (transformed)
// var C = (function (_super) {
// function C() {
// var _this = _super.call(this, "foo") || this;
// _this.x = 1;
// return _this;
// }
// return C;
// })(Base);
// ```
// Since the `super()` call was the first statement, we insert the `this` capturing call to
// `super()` at the top of the list of `statements` (after any pre-existing custom prologues).
insertCaptureThisForNode(statements, constructor, superCallExpression || createActualThis());
if (!isSufficientlyCoveredByReturnStatements(constructor.body)) {
statements.push(factory.createReturnStatement(factory.createUniqueName("_this", 16 /* Optimistic */ | 32 /* FileLevel */)));
}
}
}
else {
// If a class is not derived from a base class or does not have a call to `super()`, `this` is only
// captured when necessitated by an arrow function capturing the lexical `this`:
//
// ```
// // es2015
// class C {}
//
// // es5
// var C = (function () {
// function C() {
// }
// return C;
// })();
// ```
insertCaptureThisForNodeIfNeeded(prologue, constructor);
}
var block = factory.createBlock(ts.setTextRange(factory.createNodeArray(ts.concatenate(prologue, statements)),
/*location*/ constructor.body.statements),
/*multiLine*/ true);
ts.setTextRange(block, constructor.body);
return block;
}
/**
* We want to try to avoid emitting a return statement in certain cases if a user already returned something.
* It would generate obviously dead code, so we'll try to make things a little bit prettier
* by doing a minimal check on whether some common patterns always explicitly return.
*/
function isSufficientlyCoveredByReturnStatements(statement) {
// A return statement is considered covered.
if (statement.kind === 245 /* ReturnStatement */) {
return true;
}
// An if-statement with two covered branches is covered.
else if (statement.kind === 237 /* IfStatement */) {
var ifStatement = statement;
if (ifStatement.elseStatement) {
return isSufficientlyCoveredByReturnStatements(ifStatement.thenStatement) &&
isSufficientlyCoveredByReturnStatements(ifStatement.elseStatement);
}
}
// A block is covered if it has a last statement which is covered.
else if (statement.kind === 233 /* Block */) {
var lastStatement = ts.lastOrUndefined(statement.statements);
if (lastStatement && isSufficientlyCoveredByReturnStatements(lastStatement)) {
return true;
}
}
return false;
}
function createActualThis() {
return ts.setEmitFlags(factory.createThis(), 4 /* NoSubstitution */);
}
function createDefaultSuperCallOrThis() {
return factory.createLogicalOr(factory.createLogicalAnd(factory.createStrictInequality(factory.createUniqueName("_super", 16 /* Optimistic */ | 32 /* FileLevel */), factory.createNull()), factory.createFunctionApplyCall(factory.createUniqueName("_super", 16 /* Optimistic */ | 32 /* FileLevel */), createActualThis(), factory.createIdentifier("arguments"))), createActualThis());
}
/**
* Visits a parameter declaration.
*
* @param node A ParameterDeclaration node.
*/
function visitParameter(node) {
if (node.dotDotDotToken) {
// rest parameters are elided
return undefined;
}
else if (ts.isBindingPattern(node.name)) {
// Binding patterns are converted into a generated name and are
// evaluated inside the function body.
return ts.setOriginalNode(ts.setTextRange(factory.createParameterDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*dotDotDotToken*/ undefined, factory.getGeneratedNameForNode(node),
/*questionToken*/ undefined,
/*type*/ undefined,
/*initializer*/ undefined),
/*location*/ node),
/*original*/ node);
}
else if (node.initializer) {
// Initializers are elided
return ts.setOriginalNode(ts.setTextRange(factory.createParameterDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*dotDotDotToken*/ undefined, node.name,
/*questionToken*/ undefined,
/*type*/ undefined,
/*initializer*/ undefined),
/*location*/ node),
/*original*/ node);
}
else {
return node;
}
}
function hasDefaultValueOrBindingPattern(node) {
return node.initializer !== undefined
|| ts.isBindingPattern(node.name);
}
/**
* Adds statements to the body of a function-like node if it contains parameters with
* binding patterns or initializers.
*
* @param statements The statements for the new function body.
* @param node A function-like node.
*/
function addDefaultValueAssignmentsIfNeeded(statements, node) {
if (!ts.some(node.parameters, hasDefaultValueOrBindingPattern)) {
return false;
}
var added = false;
for (var _i = 0, _a = node.parameters; _i < _a.length; _i++) {
var parameter = _a[_i];
var name = parameter.name, initializer = parameter.initializer, dotDotDotToken = parameter.dotDotDotToken;
// A rest parameter cannot have a binding pattern or an initializer,
// so let's just ignore it.
if (dotDotDotToken) {
continue;
}
if (ts.isBindingPattern(name)) {
added = insertDefaultValueAssignmentForBindingPattern(statements, parameter, name, initializer) || added;
}
else if (initializer) {
insertDefaultValueAssignmentForInitializer(statements, parameter, name, initializer);
added = true;
}
}
return added;
}
/**
* Adds statements to the body of a function-like node for parameters with binding patterns
*
* @param statements The statements for the new function body.
* @param parameter The parameter for the function.
* @param name The name of the parameter.
* @param initializer The initializer for the parameter.
*/
function insertDefaultValueAssignmentForBindingPattern(statements, parameter, name, initializer) {
// In cases where a binding pattern is simply '[]' or '{}',
// we usually don't want to emit a var declaration; however, in the presence
// of an initializer, we must emit that expression to preserve side effects.
if (name.elements.length > 0) {
ts.insertStatementAfterCustomPrologue(statements, ts.setEmitFlags(factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList(ts.flattenDestructuringBinding(parameter, visitor, context, 0 /* All */, factory.getGeneratedNameForNode(parameter)))), 1048576 /* CustomPrologue */));
return true;
}
else if (initializer) {
ts.insertStatementAfterCustomPrologue(statements, ts.setEmitFlags(factory.createExpressionStatement(factory.createAssignment(factory.getGeneratedNameForNode(parameter), ts.visitNode(initializer, visitor, ts.isExpression))), 1048576 /* CustomPrologue */));
return true;
}
return false;
}
/**
* Adds statements to the body of a function-like node for parameters with initializers.
*
* @param statements The statements for the new function body.
* @param parameter The parameter for the function.
* @param name The name of the parameter.
* @param initializer The initializer for the parameter.
*/
function insertDefaultValueAssignmentForInitializer(statements, parameter, name, initializer) {
initializer = ts.visitNode(initializer, visitor, ts.isExpression);
var statement = factory.createIfStatement(factory.createTypeCheck(factory.cloneNode(name), "undefined"), ts.setEmitFlags(ts.setTextRange(factory.createBlock([
factory.createExpressionStatement(ts.setEmitFlags(ts.setTextRange(factory.createAssignment(
// TODO(rbuckton): Does this need to be parented?
ts.setEmitFlags(ts.setParent(ts.setTextRange(factory.cloneNode(name), name), name.parent), 48 /* NoSourceMap */), ts.setEmitFlags(initializer, 48 /* NoSourceMap */ | ts.getEmitFlags(initializer) | 1536 /* NoComments */)), parameter), 1536 /* NoComments */))
]), parameter), 1 /* SingleLine */ | 32 /* NoTrailingSourceMap */ | 384 /* NoTokenSourceMaps */ | 1536 /* NoComments */));
ts.startOnNewLine(statement);
ts.setTextRange(statement, parameter);
ts.setEmitFlags(statement, 384 /* NoTokenSourceMaps */ | 32 /* NoTrailingSourceMap */ | 1048576 /* CustomPrologue */ | 1536 /* NoComments */);
ts.insertStatementAfterCustomPrologue(statements, statement);
}
/**
* Gets a value indicating whether we need to add statements to handle a rest parameter.
*
* @param node A ParameterDeclaration node.
* @param inConstructorWithSynthesizedSuper A value indicating whether the parameter is
* part of a constructor declaration with a
* synthesized call to `super`
*/
function shouldAddRestParameter(node, inConstructorWithSynthesizedSuper) {
return !!(node && node.dotDotDotToken && !inConstructorWithSynthesizedSuper);
}
/**
* Adds statements to the body of a function-like node if it contains a rest parameter.
*
* @param statements The statements for the new function body.
* @param node A function-like node.
* @param inConstructorWithSynthesizedSuper A value indicating whether the parameter is
* part of a constructor declaration with a
* synthesized call to `super`
*/
function addRestParameterIfNeeded(statements, node, inConstructorWithSynthesizedSuper) {
var prologueStatements = [];
var parameter = ts.lastOrUndefined(node.parameters);
if (!shouldAddRestParameter(parameter, inConstructorWithSynthesizedSuper)) {
return false;
}
// `declarationName` is the name of the local declaration for the parameter.
// TODO(rbuckton): Does this need to be parented?
var declarationName = parameter.name.kind === 79 /* Identifier */ ? ts.setParent(ts.setTextRange(factory.cloneNode(parameter.name), parameter.name), parameter.name.parent) : factory.createTempVariable(/*recordTempVariable*/ undefined);
ts.setEmitFlags(declarationName, 48 /* NoSourceMap */);
// `expressionName` is the name of the parameter used in expressions.
var expressionName = parameter.name.kind === 79 /* Identifier */ ? factory.cloneNode(parameter.name) : declarationName;
var restIndex = node.parameters.length - 1;
var temp = factory.createLoopVariable();
// var param = [];
prologueStatements.push(ts.setEmitFlags(ts.setTextRange(factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList([
factory.createVariableDeclaration(declarationName,
/*exclamationToken*/ undefined,
/*type*/ undefined, factory.createArrayLiteralExpression([]))
])),
/*location*/ parameter), 1048576 /* CustomPrologue */));
// for (var _i = restIndex; _i < arguments.length; _i++) {
// param[_i - restIndex] = arguments[_i];
// }
var forStatement = factory.createForStatement(ts.setTextRange(factory.createVariableDeclarationList([
factory.createVariableDeclaration(temp, /*exclamationToken*/ undefined, /*type*/ undefined, factory.createNumericLiteral(restIndex))
]), parameter), ts.setTextRange(factory.createLessThan(temp, factory.createPropertyAccessExpression(factory.createIdentifier("arguments"), "length")), parameter), ts.setTextRange(factory.createPostfixIncrement(temp), parameter), factory.createBlock([
ts.startOnNewLine(ts.setTextRange(factory.createExpressionStatement(factory.createAssignment(factory.createElementAccessExpression(expressionName, restIndex === 0
? temp
: factory.createSubtract(temp, factory.createNumericLiteral(restIndex))), factory.createElementAccessExpression(factory.createIdentifier("arguments"), temp))),
/*location*/ parameter))
]));
ts.setEmitFlags(forStatement, 1048576 /* CustomPrologue */);
ts.startOnNewLine(forStatement);
prologueStatements.push(forStatement);
if (parameter.name.kind !== 79 /* Identifier */) {
// do the actual destructuring of the rest parameter if necessary
prologueStatements.push(ts.setEmitFlags(ts.setTextRange(factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList(ts.flattenDestructuringBinding(parameter, visitor, context, 0 /* All */, expressionName))), parameter), 1048576 /* CustomPrologue */));
}
ts.insertStatementsAfterCustomPrologue(statements, prologueStatements);
return true;
}
/**
* Adds a statement to capture the `this` of a function declaration if it is needed.
* NOTE: This must be executed *after* the subtree has been visited.
*
* @param statements The statements for the new function body.
* @param node A node.
*/
function insertCaptureThisForNodeIfNeeded(statements, node) {
if (hierarchyFacts & 65536 /* CapturedLexicalThis */ && node.kind !== 212 /* ArrowFunction */) {
insertCaptureThisForNode(statements, node, factory.createThis());
return true;
}
return false;
}
function insertCaptureThisForNode(statements, node, initializer) {
enableSubstitutionsForCapturedThis();
var captureThisStatement = factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList([
factory.createVariableDeclaration(factory.createUniqueName("_this", 16 /* Optimistic */ | 32 /* FileLevel */),
/*exclamationToken*/ undefined,
/*type*/ undefined, initializer)
]));
ts.setEmitFlags(captureThisStatement, 1536 /* NoComments */ | 1048576 /* CustomPrologue */);
ts.setSourceMapRange(captureThisStatement, node);
ts.insertStatementAfterCustomPrologue(statements, captureThisStatement);
}
function insertCaptureNewTargetIfNeeded(statements, node, copyOnWrite) {
if (hierarchyFacts & 32768 /* NewTarget */) {
var newTarget = void 0;
switch (node.kind) {
case 212 /* ArrowFunction */:
return statements;
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
// Methods and accessors cannot be constructors, so 'new.target' will
// always return 'undefined'.
newTarget = factory.createVoidZero();
break;
case 169 /* Constructor */:
// Class constructors can only be called with `new`, so `this.constructor`
// should be relatively safe to use.
newTarget = factory.createPropertyAccessExpression(ts.setEmitFlags(factory.createThis(), 4 /* NoSubstitution */), "constructor");
break;
case 254 /* FunctionDeclaration */:
case 211 /* FunctionExpression */:
// Functions can be called or constructed, and may have a `this` due to
// being a member or when calling an imported function via `other_1.f()`.
newTarget = factory.createConditionalExpression(factory.createLogicalAnd(ts.setEmitFlags(factory.createThis(), 4 /* NoSubstitution */), factory.createBinaryExpression(ts.setEmitFlags(factory.createThis(), 4 /* NoSubstitution */), 102 /* InstanceOfKeyword */, factory.getLocalName(node))),
/*questionToken*/ undefined, factory.createPropertyAccessExpression(ts.setEmitFlags(factory.createThis(), 4 /* NoSubstitution */), "constructor"),
/*colonToken*/ undefined, factory.createVoidZero());
break;
default:
return ts.Debug.failBadSyntaxKind(node);
}
var captureNewTargetStatement = factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList([
factory.createVariableDeclaration(factory.createUniqueName("_newTarget", 16 /* Optimistic */ | 32 /* FileLevel */),
/*exclamationToken*/ undefined,
/*type*/ undefined, newTarget)
]));
ts.setEmitFlags(captureNewTargetStatement, 1536 /* NoComments */ | 1048576 /* CustomPrologue */);
if (copyOnWrite) {
statements = statements.slice();
}
ts.insertStatementAfterCustomPrologue(statements, captureNewTargetStatement);
}
return statements;
}
/**
* Adds statements to the class body function for a class to define the members of the
* class.
*
* @param statements The statements for the class body function.
* @param node The ClassExpression or ClassDeclaration node.
*/
function addClassMembers(statements, node) {
for (var _i = 0, _a = node.members; _i < _a.length; _i++) {
var member = _a[_i];
switch (member.kind) {
case 232 /* SemicolonClassElement */:
statements.push(transformSemicolonClassElementToStatement(member));
break;
case 167 /* MethodDeclaration */:
statements.push(transformClassMethodDeclarationToStatement(getClassMemberPrefix(node, member), member, node));
break;
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
var accessors = ts.getAllAccessorDeclarations(node.members, member);
if (member === accessors.firstAccessor) {
statements.push(transformAccessorsToStatement(getClassMemberPrefix(node, member), accessors, node));
}
break;
case 169 /* Constructor */:
case 168 /* ClassStaticBlockDeclaration */:
// Constructors are handled in visitClassExpression/visitClassDeclaration
break;
default:
ts.Debug.failBadSyntaxKind(member, currentSourceFile && currentSourceFile.fileName);
break;
}
}
}
/**
* Transforms a SemicolonClassElement into a statement for a class body function.
*
* @param member The SemicolonClassElement node.
*/
function transformSemicolonClassElementToStatement(member) {
return ts.setTextRange(factory.createEmptyStatement(), member);
}
/**
* Transforms a MethodDeclaration into a statement for a class body function.
*
* @param receiver The receiver for the member.
* @param member The MethodDeclaration node.
*/
function transformClassMethodDeclarationToStatement(receiver, member, container) {
var commentRange = ts.getCommentRange(member);
var sourceMapRange = ts.getSourceMapRange(member);
var memberFunction = transformFunctionLikeToExpression(member, /*location*/ member, /*name*/ undefined, container);
var propertyName = ts.visitNode(member.name, visitor, ts.isPropertyName);
var e;
if (!ts.isPrivateIdentifier(propertyName) && ts.getUseDefineForClassFields(context.getCompilerOptions())) {
var name = ts.isComputedPropertyName(propertyName) ? propertyName.expression
: ts.isIdentifier(propertyName) ? factory.createStringLiteral(ts.unescapeLeadingUnderscores(propertyName.escapedText))
: propertyName;
e = factory.createObjectDefinePropertyCall(receiver, name, factory.createPropertyDescriptor({ value: memberFunction, enumerable: false, writable: true, configurable: true }));
}
else {
var memberName = ts.createMemberAccessForPropertyName(factory, receiver, propertyName, /*location*/ member.name);
e = factory.createAssignment(memberName, memberFunction);
}
ts.setEmitFlags(memberFunction, 1536 /* NoComments */);
ts.setSourceMapRange(memberFunction, sourceMapRange);
var statement = ts.setTextRange(factory.createExpressionStatement(e), /*location*/ member);
ts.setOriginalNode(statement, member);
ts.setCommentRange(statement, commentRange);
// The location for the statement is used to emit comments only.
// No source map should be emitted for this statement to align with the
// old emitter.
ts.setEmitFlags(statement, 48 /* NoSourceMap */);
return statement;
}
/**
* Transforms a set of related of get/set accessors into a statement for a class body function.
*
* @param receiver The receiver for the member.
* @param accessors The set of related get/set accessors.
*/
function transformAccessorsToStatement(receiver, accessors, container) {
var statement = factory.createExpressionStatement(transformAccessorsToExpression(receiver, accessors, container, /*startsOnNewLine*/ false));
// The location for the statement is used to emit source maps only.
// No comments should be emitted for this statement to align with the
// old emitter.
ts.setEmitFlags(statement, 1536 /* NoComments */);
ts.setSourceMapRange(statement, ts.getSourceMapRange(accessors.firstAccessor));
return statement;
}
/**
* Transforms a set of related get/set accessors into an expression for either a class
* body function or an ObjectLiteralExpression with computed properties.
*
* @param receiver The receiver for the member.
*/
function transformAccessorsToExpression(receiver, _a, container, startsOnNewLine) {
var firstAccessor = _a.firstAccessor, getAccessor = _a.getAccessor, setAccessor = _a.setAccessor;
// To align with source maps in the old emitter, the receiver and property name
// arguments are both mapped contiguously to the accessor name.
// TODO(rbuckton): Does this need to be parented?
var target = ts.setParent(ts.setTextRange(factory.cloneNode(receiver), receiver), receiver.parent);
ts.setEmitFlags(target, 1536 /* NoComments */ | 32 /* NoTrailingSourceMap */);
ts.setSourceMapRange(target, firstAccessor.name);
var visitedAccessorName = ts.visitNode(firstAccessor.name, visitor, ts.isPropertyName);
if (ts.isPrivateIdentifier(visitedAccessorName)) {
return ts.Debug.failBadSyntaxKind(visitedAccessorName, "Encountered unhandled private identifier while transforming ES2015.");
}
var propertyName = ts.createExpressionForPropertyName(factory, visitedAccessorName);
ts.setEmitFlags(propertyName, 1536 /* NoComments */ | 16 /* NoLeadingSourceMap */);
ts.setSourceMapRange(propertyName, firstAccessor.name);
var properties = [];
if (getAccessor) {
var getterFunction = transformFunctionLikeToExpression(getAccessor, /*location*/ undefined, /*name*/ undefined, container);
ts.setSourceMapRange(getterFunction, ts.getSourceMapRange(getAccessor));
ts.setEmitFlags(getterFunction, 512 /* NoLeadingComments */);
var getter = factory.createPropertyAssignment("get", getterFunction);
ts.setCommentRange(getter, ts.getCommentRange(getAccessor));
properties.push(getter);
}
if (setAccessor) {
var setterFunction = transformFunctionLikeToExpression(setAccessor, /*location*/ undefined, /*name*/ undefined, container);
ts.setSourceMapRange(setterFunction, ts.getSourceMapRange(setAccessor));
ts.setEmitFlags(setterFunction, 512 /* NoLeadingComments */);
var setter = factory.createPropertyAssignment("set", setterFunction);
ts.setCommentRange(setter, ts.getCommentRange(setAccessor));
properties.push(setter);
}
properties.push(factory.createPropertyAssignment("enumerable", getAccessor || setAccessor ? factory.createFalse() : factory.createTrue()), factory.createPropertyAssignment("configurable", factory.createTrue()));
var call = factory.createCallExpression(factory.createPropertyAccessExpression(factory.createIdentifier("Object"), "defineProperty"),
/*typeArguments*/ undefined, [
target,
propertyName,
factory.createObjectLiteralExpression(properties, /*multiLine*/ true)
]);
if (startsOnNewLine) {
ts.startOnNewLine(call);
}
return call;
}
/**
* Visits an ArrowFunction and transforms it into a FunctionExpression.
*
* @param node An ArrowFunction node.
*/
function visitArrowFunction(node) {
if (node.transformFlags & 8192 /* ContainsLexicalThis */ && !(hierarchyFacts & 16384 /* StaticInitializer */)) {
hierarchyFacts |= 65536 /* CapturedLexicalThis */;
}
var savedConvertedLoopState = convertedLoopState;
convertedLoopState = undefined;
var ancestorFacts = enterSubtree(15232 /* ArrowFunctionExcludes */, 66 /* ArrowFunctionIncludes */);
var func = factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, transformFunctionBody(node));
ts.setTextRange(func, node);
ts.setOriginalNode(func, node);
ts.setEmitFlags(func, 8 /* CapturesThis */);
// If an arrow function contains
exitSubtree(ancestorFacts, 0 /* ArrowFunctionSubtreeExcludes */, 0 /* None */);
convertedLoopState = savedConvertedLoopState;
return func;
}
/**
* Visits a FunctionExpression node.
*
* @param node a FunctionExpression node.
*/
function visitFunctionExpression(node) {
var ancestorFacts = ts.getEmitFlags(node) & 262144 /* AsyncFunctionBody */
? enterSubtree(32662 /* AsyncFunctionBodyExcludes */, 69 /* AsyncFunctionBodyIncludes */)
: enterSubtree(32670 /* FunctionExcludes */, 65 /* FunctionIncludes */);
var savedConvertedLoopState = convertedLoopState;
convertedLoopState = undefined;
var parameters = ts.visitParameterList(node.parameters, visitor, context);
var body = transformFunctionBody(node);
var name = hierarchyFacts & 32768 /* NewTarget */
? factory.getLocalName(node)
: node.name;
exitSubtree(ancestorFacts, 98304 /* FunctionSubtreeExcludes */, 0 /* None */);
convertedLoopState = savedConvertedLoopState;
return factory.updateFunctionExpression(node,
/*modifiers*/ undefined, node.asteriskToken, name,
/*typeParameters*/ undefined, parameters,
/*type*/ undefined, body);
}
/**
* Visits a FunctionDeclaration node.
*
* @param node a FunctionDeclaration node.
*/
function visitFunctionDeclaration(node) {
var savedConvertedLoopState = convertedLoopState;
convertedLoopState = undefined;
var ancestorFacts = enterSubtree(32670 /* FunctionExcludes */, 65 /* FunctionIncludes */);
var parameters = ts.visitParameterList(node.parameters, visitor, context);
var body = transformFunctionBody(node);
var name = hierarchyFacts & 32768 /* NewTarget */
? factory.getLocalName(node)
: node.name;
exitSubtree(ancestorFacts, 98304 /* FunctionSubtreeExcludes */, 0 /* None */);
convertedLoopState = savedConvertedLoopState;
return factory.updateFunctionDeclaration(node,
/*decorators*/ undefined, ts.visitNodes(node.modifiers, visitor, ts.isModifier), node.asteriskToken, name,
/*typeParameters*/ undefined, parameters,
/*type*/ undefined, body);
}
/**
* Transforms a function-like node into a FunctionExpression.
*
* @param node The function-like node to transform.
* @param location The source-map location for the new FunctionExpression.
* @param name The name of the new FunctionExpression.
*/
function transformFunctionLikeToExpression(node, location, name, container) {
var savedConvertedLoopState = convertedLoopState;
convertedLoopState = undefined;
var ancestorFacts = container && ts.isClassLike(container) && !ts.isStatic(node)
? enterSubtree(32670 /* FunctionExcludes */, 65 /* FunctionIncludes */ | 8 /* NonStaticClassElement */)
: enterSubtree(32670 /* FunctionExcludes */, 65 /* FunctionIncludes */);
var parameters = ts.visitParameterList(node.parameters, visitor, context);
var body = transformFunctionBody(node);
if (hierarchyFacts & 32768 /* NewTarget */ && !name && (node.kind === 254 /* FunctionDeclaration */ || node.kind === 211 /* FunctionExpression */)) {
name = factory.getGeneratedNameForNode(node);
}
exitSubtree(ancestorFacts, 98304 /* FunctionSubtreeExcludes */, 0 /* None */);
convertedLoopState = savedConvertedLoopState;
return ts.setOriginalNode(ts.setTextRange(factory.createFunctionExpression(
/*modifiers*/ undefined, node.asteriskToken, name,
/*typeParameters*/ undefined, parameters,
/*type*/ undefined, body), location),
/*original*/ node);
}
/**
* Transforms the body of a function-like node.
*
* @param node A function-like node.
*/
function transformFunctionBody(node) {
var multiLine = false; // indicates whether the block *must* be emitted as multiple lines
var singleLine = false; // indicates whether the block *may* be emitted as a single line
var statementsLocation;
var closeBraceLocation;
var prologue = [];
var statements = [];
var body = node.body;
var statementOffset;
resumeLexicalEnvironment();
if (ts.isBlock(body)) {
// ensureUseStrict is false because no new prologue-directive should be added.
// addStandardPrologue will put already-existing directives at the beginning of the target statement-array
statementOffset = factory.copyStandardPrologue(body.statements, prologue, /*ensureUseStrict*/ false);
statementOffset = factory.copyCustomPrologue(body.statements, statements, statementOffset, visitor, ts.isHoistedFunction);
statementOffset = factory.copyCustomPrologue(body.statements, statements, statementOffset, visitor, ts.isHoistedVariableStatement);
}
multiLine = addDefaultValueAssignmentsIfNeeded(statements, node) || multiLine;
multiLine = addRestParameterIfNeeded(statements, node, /*inConstructorWithSynthesizedSuper*/ false) || multiLine;
if (ts.isBlock(body)) {
// addCustomPrologue puts already-existing directives at the beginning of the target statement-array
statementOffset = factory.copyCustomPrologue(body.statements, statements, statementOffset, visitor);
statementsLocation = body.statements;
ts.addRange(statements, ts.visitNodes(body.statements, visitor, ts.isStatement, statementOffset));
// If the original body was a multi-line block, this must be a multi-line block.
if (!multiLine && body.multiLine) {
multiLine = true;
}
}
else {
ts.Debug.assert(node.kind === 212 /* ArrowFunction */);
// To align with the old emitter, we use a synthetic end position on the location
// for the statement list we synthesize when we down-level an arrow function with
// an expression function body. This prevents both comments and source maps from
// being emitted for the end position only.
statementsLocation = ts.moveRangeEnd(body, -1);
var equalsGreaterThanToken = node.equalsGreaterThanToken;
if (!ts.nodeIsSynthesized(equalsGreaterThanToken) && !ts.nodeIsSynthesized(body)) {
if (ts.rangeEndIsOnSameLineAsRangeStart(equalsGreaterThanToken, body, currentSourceFile)) {
singleLine = true;
}
else {
multiLine = true;
}
}
var expression = ts.visitNode(body, visitor, ts.isExpression);
var returnStatement = factory.createReturnStatement(expression);
ts.setTextRange(returnStatement, body);
ts.moveSyntheticComments(returnStatement, body);
ts.setEmitFlags(returnStatement, 384 /* NoTokenSourceMaps */ | 32 /* NoTrailingSourceMap */ | 1024 /* NoTrailingComments */);
statements.push(returnStatement);
// To align with the source map emit for the old emitter, we set a custom
// source map location for the close brace.
closeBraceLocation = body;
}
factory.mergeLexicalEnvironment(prologue, endLexicalEnvironment());
insertCaptureNewTargetIfNeeded(prologue, node, /*copyOnWrite*/ false);
insertCaptureThisForNodeIfNeeded(prologue, node);
// If we added any final generated statements, this must be a multi-line block
if (ts.some(prologue)) {
multiLine = true;
}
statements.unshift.apply(statements, prologue);
if (ts.isBlock(body) && ts.arrayIsEqualTo(statements, body.statements)) {
// no changes were made, preserve the tree
return body;
}
var block = factory.createBlock(ts.setTextRange(factory.createNodeArray(statements), statementsLocation), multiLine);
ts.setTextRange(block, node.body);
if (!multiLine && singleLine) {
ts.setEmitFlags(block, 1 /* SingleLine */);
}
if (closeBraceLocation) {
ts.setTokenSourceMapRange(block, 19 /* CloseBraceToken */, closeBraceLocation);
}
ts.setOriginalNode(block, node.body);
return block;
}
function visitBlock(node, isFunctionBody) {
if (isFunctionBody) {
// A function body is not a block scope.
return ts.visitEachChild(node, visitor, context);
}
var ancestorFacts = hierarchyFacts & 256 /* IterationStatement */
? enterSubtree(7104 /* IterationStatementBlockExcludes */, 512 /* IterationStatementBlockIncludes */)
: enterSubtree(6976 /* BlockExcludes */, 128 /* BlockIncludes */);
var updated = ts.visitEachChild(node, visitor, context);
exitSubtree(ancestorFacts, 0 /* None */, 0 /* None */);
return updated;
}
/**
* Visits an ExpressionStatement that contains a destructuring assignment.
*
* @param node An ExpressionStatement node.
*/
function visitExpressionStatement(node) {
return ts.visitEachChild(node, visitorWithUnusedExpressionResult, context);
}
/**
* Visits a ParenthesizedExpression that may contain a destructuring assignment.
*
* @param node A ParenthesizedExpression node.
* @param expressionResultIsUnused Indicates the result of an expression is unused by the parent node (i.e., the left side of a comma or the
* expression of an `ExpressionStatement`).
*/
function visitParenthesizedExpression(node, expressionResultIsUnused) {
return ts.visitEachChild(node, expressionResultIsUnused ? visitorWithUnusedExpressionResult : visitor, context);
}
/**
* Visits a BinaryExpression that contains a destructuring assignment.
*
* @param node A BinaryExpression node.
* @param expressionResultIsUnused Indicates the result of an expression is unused by the parent node (i.e., the left side of a comma or the
* expression of an `ExpressionStatement`).
*/
function visitBinaryExpression(node, expressionResultIsUnused) {
// If we are here it is because this is a destructuring assignment.
if (ts.isDestructuringAssignment(node)) {
return ts.flattenDestructuringAssignment(node, visitor, context, 0 /* All */, !expressionResultIsUnused);
}
if (node.operatorToken.kind === 27 /* CommaToken */) {
return factory.updateBinaryExpression(node, ts.visitNode(node.left, visitorWithUnusedExpressionResult, ts.isExpression), node.operatorToken, ts.visitNode(node.right, expressionResultIsUnused ? visitorWithUnusedExpressionResult : visitor, ts.isExpression));
}
return ts.visitEachChild(node, visitor, context);
}
/**
* @param expressionResultIsUnused Indicates the result of an expression is unused by the parent node (i.e., the left side of a comma or the
* expression of an `ExpressionStatement`).
*/
function visitCommaListExpression(node, expressionResultIsUnused) {
if (expressionResultIsUnused) {
return ts.visitEachChild(node, visitorWithUnusedExpressionResult, context);
}
var result;
for (var i = 0; i < node.elements.length; i++) {
var element = node.elements[i];
var visited = ts.visitNode(element, i < node.elements.length - 1 ? visitorWithUnusedExpressionResult : visitor, ts.isExpression);
if (result || visited !== element) {
result || (result = node.elements.slice(0, i));
result.push(visited);
}
}
var elements = result ? ts.setTextRange(factory.createNodeArray(result), node.elements) : node.elements;
return factory.updateCommaListExpression(node, elements);
}
function isVariableStatementOfTypeScriptClassWrapper(node) {
return node.declarationList.declarations.length === 1
&& !!node.declarationList.declarations[0].initializer
&& !!(ts.getEmitFlags(node.declarationList.declarations[0].initializer) & 33554432 /* TypeScriptClassWrapper */);
}
function visitVariableStatement(node) {
var ancestorFacts = enterSubtree(0 /* None */, ts.hasSyntacticModifier(node, 1 /* Export */) ? 32 /* ExportedVariableStatement */ : 0 /* None */);
var updated;
if (convertedLoopState && (node.declarationList.flags & 3 /* BlockScoped */) === 0 && !isVariableStatementOfTypeScriptClassWrapper(node)) {
// we are inside a converted loop - hoist variable declarations
var assignments = void 0;
for (var _i = 0, _a = node.declarationList.declarations; _i < _a.length; _i++) {
var decl = _a[_i];
hoistVariableDeclarationDeclaredInConvertedLoop(convertedLoopState, decl);
if (decl.initializer) {
var assignment = void 0;
if (ts.isBindingPattern(decl.name)) {
assignment = ts.flattenDestructuringAssignment(decl, visitor, context, 0 /* All */);
}
else {
assignment = factory.createBinaryExpression(decl.name, 63 /* EqualsToken */, ts.visitNode(decl.initializer, visitor, ts.isExpression));
ts.setTextRange(assignment, decl);
}
assignments = ts.append(assignments, assignment);
}
}
if (assignments) {
updated = ts.setTextRange(factory.createExpressionStatement(factory.inlineExpressions(assignments)), node);
}
else {
// none of declarations has initializer - the entire variable statement can be deleted
updated = undefined;
}
}
else {
updated = ts.visitEachChild(node, visitor, context);
}
exitSubtree(ancestorFacts, 0 /* None */, 0 /* None */);
return updated;
}
/**
* Visits a VariableDeclarationList that is block scoped (e.g. `let` or `const`).
*
* @param node A VariableDeclarationList node.
*/
function visitVariableDeclarationList(node) {
if (node.flags & 3 /* BlockScoped */ || node.transformFlags & 262144 /* ContainsBindingPattern */) {
if (node.flags & 3 /* BlockScoped */) {
enableSubstitutionsForBlockScopedBindings();
}
var declarations = ts.flatMap(node.declarations, node.flags & 1 /* Let */
? visitVariableDeclarationInLetDeclarationList
: visitVariableDeclaration);
var declarationList = factory.createVariableDeclarationList(declarations);
ts.setOriginalNode(declarationList, node);
ts.setTextRange(declarationList, node);
ts.setCommentRange(declarationList, node);
// If the first or last declaration is a binding pattern, we need to modify
// the source map range for the declaration list.
if (node.transformFlags & 262144 /* ContainsBindingPattern */
&& (ts.isBindingPattern(node.declarations[0].name) || ts.isBindingPattern(ts.last(node.declarations).name))) {
ts.setSourceMapRange(declarationList, getRangeUnion(declarations));
}
return declarationList;
}
return ts.visitEachChild(node, visitor, context);
}
function getRangeUnion(declarations) {
// declarations may not be sorted by position.
// pos should be the minimum* position over all nodes (that's not -1), end should be the maximum end over all nodes.
var pos = -1, end = -1;
for (var _i = 0, declarations_9 = declarations; _i < declarations_9.length; _i++) {
var node = declarations_9[_i];
pos = pos === -1 ? node.pos : node.pos === -1 ? pos : Math.min(pos, node.pos);
end = Math.max(end, node.end);
}
return ts.createRange(pos, end);
}
/**
* Gets a value indicating whether we should emit an explicit initializer for a variable
* declaration in a `let` declaration list.
*
* @param node A VariableDeclaration node.
*/
function shouldEmitExplicitInitializerForLetDeclaration(node) {
// Nested let bindings might need to be initialized explicitly to preserve
// ES6 semantic:
//
// { let x = 1; }
// { let x; } // x here should be undefined. not 1
//
// Top level bindings never collide with anything and thus don't require
// explicit initialization. As for nested let bindings there are two cases:
//
// - Nested let bindings that were not renamed definitely should be
// initialized explicitly:
//
// { let x = 1; }
// { let x; if (some-condition) { x = 1}; if (x) { /*1*/ } }
//
// Without explicit initialization code in /*1*/ can be executed even if
// some-condition is evaluated to false.
//
// - Renaming introduces fresh name that should not collide with any
// existing names, however renamed bindings sometimes also should be
// explicitly initialized. One particular case: non-captured binding
// declared inside loop body (but not in loop initializer):
//
// let x;
// for (;;) {
// let x;
// }
//
// In downlevel codegen inner 'x' will be renamed so it won't collide
// with outer 'x' however it will should be reset on every iteration as
// if it was declared anew.
//
// * Why non-captured binding?
// - Because if loop contains block scoped binding captured in some
// function then loop body will be rewritten to have a fresh scope
// on every iteration so everything will just work.
//
// * Why loop initializer is excluded?
// - Since we've introduced a fresh name it already will be undefined.
var flags = resolver.getNodeCheckFlags(node);
var isCapturedInFunction = flags & 262144 /* CapturedBlockScopedBinding */;
var isDeclaredInLoop = flags & 524288 /* BlockScopedBindingInLoop */;
var emittedAsTopLevel = (hierarchyFacts & 64 /* TopLevel */) !== 0
|| (isCapturedInFunction
&& isDeclaredInLoop
&& (hierarchyFacts & 512 /* IterationStatementBlock */) !== 0);
var emitExplicitInitializer = !emittedAsTopLevel
&& (hierarchyFacts & 4096 /* ForInOrForOfStatement */) === 0
&& (!resolver.isDeclarationWithCollidingName(node)
|| (isDeclaredInLoop
&& !isCapturedInFunction
&& (hierarchyFacts & (2048 /* ForStatement */ | 4096 /* ForInOrForOfStatement */)) === 0));
return emitExplicitInitializer;
}
/**
* Visits a VariableDeclaration in a `let` declaration list.
*
* @param node A VariableDeclaration node.
*/
function visitVariableDeclarationInLetDeclarationList(node) {
// For binding pattern names that lack initializers there is no point to emit
// explicit initializer since downlevel codegen for destructuring will fail
// in the absence of initializer so all binding elements will say uninitialized
var name = node.name;
if (ts.isBindingPattern(name)) {
return visitVariableDeclaration(node);
}
if (!node.initializer && shouldEmitExplicitInitializerForLetDeclaration(node)) {
return factory.updateVariableDeclaration(node, node.name, /*exclamationToken*/ undefined, /*type*/ undefined, factory.createVoidZero());
}
return ts.visitEachChild(node, visitor, context);
}
/**
* Visits a VariableDeclaration node with a binding pattern.
*
* @param node A VariableDeclaration node.
*/
function visitVariableDeclaration(node) {
var ancestorFacts = enterSubtree(32 /* ExportedVariableStatement */, 0 /* None */);
var updated;
if (ts.isBindingPattern(node.name)) {
updated = ts.flattenDestructuringBinding(node, visitor, context, 0 /* All */,
/*value*/ undefined, (ancestorFacts & 32 /* ExportedVariableStatement */) !== 0);
}
else {
updated = ts.visitEachChild(node, visitor, context);
}
exitSubtree(ancestorFacts, 0 /* None */, 0 /* None */);
return updated;
}
function recordLabel(node) {
convertedLoopState.labels.set(ts.idText(node.label), true);
}
function resetLabel(node) {
convertedLoopState.labels.set(ts.idText(node.label), false);
}
function visitLabeledStatement(node) {
if (convertedLoopState && !convertedLoopState.labels) {
convertedLoopState.labels = new ts.Map();
}
var statement = ts.unwrapInnermostStatementOfLabel(node, convertedLoopState && recordLabel);
return ts.isIterationStatement(statement, /*lookInLabeledStatements*/ false)
? visitIterationStatement(statement, /*outermostLabeledStatement*/ node)
: factory.restoreEnclosingLabel(ts.visitNode(statement, visitor, ts.isStatement, factory.liftToBlock), node, convertedLoopState && resetLabel);
}
function visitIterationStatement(node, outermostLabeledStatement) {
switch (node.kind) {
case 238 /* DoStatement */:
case 239 /* WhileStatement */:
return visitDoOrWhileStatement(node, outermostLabeledStatement);
case 240 /* ForStatement */:
return visitForStatement(node, outermostLabeledStatement);
case 241 /* ForInStatement */:
return visitForInStatement(node, outermostLabeledStatement);
case 242 /* ForOfStatement */:
return visitForOfStatement(node, outermostLabeledStatement);
}
}
function visitIterationStatementWithFacts(excludeFacts, includeFacts, node, outermostLabeledStatement, convert) {
var ancestorFacts = enterSubtree(excludeFacts, includeFacts);
var updated = convertIterationStatementBodyIfNecessary(node, outermostLabeledStatement, ancestorFacts, convert);
exitSubtree(ancestorFacts, 0 /* None */, 0 /* None */);
return updated;
}
function visitDoOrWhileStatement(node, outermostLabeledStatement) {
return visitIterationStatementWithFacts(0 /* DoOrWhileStatementExcludes */, 1280 /* DoOrWhileStatementIncludes */, node, outermostLabeledStatement);
}
function visitForStatement(node, outermostLabeledStatement) {
return visitIterationStatementWithFacts(5056 /* ForStatementExcludes */, 3328 /* ForStatementIncludes */, node, outermostLabeledStatement);
}
function visitEachChildOfForStatement(node) {
return factory.updateForStatement(node, ts.visitNode(node.initializer, visitorWithUnusedExpressionResult, ts.isForInitializer), ts.visitNode(node.condition, visitor, ts.isExpression), ts.visitNode(node.incrementor, visitorWithUnusedExpressionResult, ts.isExpression), ts.visitNode(node.statement, visitor, ts.isStatement, factory.liftToBlock));
}
function visitForInStatement(node, outermostLabeledStatement) {
return visitIterationStatementWithFacts(3008 /* ForInOrForOfStatementExcludes */, 5376 /* ForInOrForOfStatementIncludes */, node, outermostLabeledStatement);
}
function visitForOfStatement(node, outermostLabeledStatement) {
return visitIterationStatementWithFacts(3008 /* ForInOrForOfStatementExcludes */, 5376 /* ForInOrForOfStatementIncludes */, node, outermostLabeledStatement, compilerOptions.downlevelIteration ? convertForOfStatementForIterable : convertForOfStatementForArray);
}
function convertForOfStatementHead(node, boundValue, convertedLoopBodyStatements) {
var statements = [];
var initializer = node.initializer;
if (ts.isVariableDeclarationList(initializer)) {
if (node.initializer.flags & 3 /* BlockScoped */) {
enableSubstitutionsForBlockScopedBindings();
}
var firstOriginalDeclaration = ts.firstOrUndefined(initializer.declarations);
if (firstOriginalDeclaration && ts.isBindingPattern(firstOriginalDeclaration.name)) {
// This works whether the declaration is a var, let, or const.
// It will use rhsIterationValue _a[_i] as the initializer.
var declarations = ts.flattenDestructuringBinding(firstOriginalDeclaration, visitor, context, 0 /* All */, boundValue);
var declarationList = ts.setTextRange(factory.createVariableDeclarationList(declarations), node.initializer);
ts.setOriginalNode(declarationList, node.initializer);
// Adjust the source map range for the first declaration to align with the old
// emitter.
ts.setSourceMapRange(declarationList, ts.createRange(declarations[0].pos, ts.last(declarations).end));
statements.push(factory.createVariableStatement(
/*modifiers*/ undefined, declarationList));
}
else {
// The following call does not include the initializer, so we have
// to emit it separately.
statements.push(ts.setTextRange(factory.createVariableStatement(
/*modifiers*/ undefined, ts.setOriginalNode(ts.setTextRange(factory.createVariableDeclarationList([
factory.createVariableDeclaration(firstOriginalDeclaration ? firstOriginalDeclaration.name : factory.createTempVariable(/*recordTempVariable*/ undefined),
/*exclamationToken*/ undefined,
/*type*/ undefined, boundValue)
]), ts.moveRangePos(initializer, -1)), initializer)), ts.moveRangeEnd(initializer, -1)));
}
}
else {
// Initializer is an expression. Emit the expression in the body, so that it's
// evaluated on every iteration.
var assignment = factory.createAssignment(initializer, boundValue);
if (ts.isDestructuringAssignment(assignment)) {
statements.push(factory.createExpressionStatement(visitBinaryExpression(assignment, /*expressionResultIsUnused*/ true)));
}
else {
ts.setTextRangeEnd(assignment, initializer.end);
statements.push(ts.setTextRange(factory.createExpressionStatement(ts.visitNode(assignment, visitor, ts.isExpression)), ts.moveRangeEnd(initializer, -1)));
}
}
if (convertedLoopBodyStatements) {
return createSyntheticBlockForConvertedStatements(ts.addRange(statements, convertedLoopBodyStatements));
}
else {
var statement = ts.visitNode(node.statement, visitor, ts.isStatement, factory.liftToBlock);
if (ts.isBlock(statement)) {
return factory.updateBlock(statement, ts.setTextRange(factory.createNodeArray(ts.concatenate(statements, statement.statements)), statement.statements));
}
else {
statements.push(statement);
return createSyntheticBlockForConvertedStatements(statements);
}
}
}
function createSyntheticBlockForConvertedStatements(statements) {
return ts.setEmitFlags(factory.createBlock(factory.createNodeArray(statements),
/*multiLine*/ true), 48 /* NoSourceMap */ | 384 /* NoTokenSourceMaps */);
}
function convertForOfStatementForArray(node, outermostLabeledStatement, convertedLoopBodyStatements) {
// The following ES6 code:
//
// for (let v of expr) { }
//
// should be emitted as
//
// for (var _i = 0, _a = expr; _i < _a.length; _i++) {
// var v = _a[_i];
// }
//
// where _a and _i are temps emitted to capture the RHS and the counter,
// respectively.
// When the left hand side is an expression instead of a let declaration,
// the "let v" is not emitted.
// When the left hand side is a let/const, the v is renamed if there is
// another v in scope.
// Note that all assignments to the LHS are emitted in the body, including
// all destructuring.
// Note also that because an extra statement is needed to assign to the LHS,
// for-of bodies are always emitted as blocks.
var expression = ts.visitNode(node.expression, visitor, ts.isExpression);
// In the case where the user wrote an identifier as the RHS, like this:
//
// for (let v of arr) { }
//
// we don't want to emit a temporary variable for the RHS, just use it directly.
var counter = factory.createLoopVariable();
var rhsReference = ts.isIdentifier(expression) ? factory.getGeneratedNameForNode(expression) : factory.createTempVariable(/*recordTempVariable*/ undefined);
// The old emitter does not emit source maps for the expression
ts.setEmitFlags(expression, 48 /* NoSourceMap */ | ts.getEmitFlags(expression));
var forStatement = ts.setTextRange(factory.createForStatement(
/*initializer*/ ts.setEmitFlags(ts.setTextRange(factory.createVariableDeclarationList([
ts.setTextRange(factory.createVariableDeclaration(counter, /*exclamationToken*/ undefined, /*type*/ undefined, factory.createNumericLiteral(0)), ts.moveRangePos(node.expression, -1)),
ts.setTextRange(factory.createVariableDeclaration(rhsReference, /*exclamationToken*/ undefined, /*type*/ undefined, expression), node.expression)
]), node.expression), 2097152 /* NoHoisting */),
/*condition*/ ts.setTextRange(factory.createLessThan(counter, factory.createPropertyAccessExpression(rhsReference, "length")), node.expression),
/*incrementor*/ ts.setTextRange(factory.createPostfixIncrement(counter), node.expression),
/*statement*/ convertForOfStatementHead(node, factory.createElementAccessExpression(rhsReference, counter), convertedLoopBodyStatements)),
/*location*/ node);
// Disable trailing source maps for the OpenParenToken to align source map emit with the old emitter.
ts.setEmitFlags(forStatement, 256 /* NoTokenTrailingSourceMaps */);
ts.setTextRange(forStatement, node);
return factory.restoreEnclosingLabel(forStatement, outermostLabeledStatement, convertedLoopState && resetLabel);
}
function convertForOfStatementForIterable(node, outermostLabeledStatement, convertedLoopBodyStatements, ancestorFacts) {
var expression = ts.visitNode(node.expression, visitor, ts.isExpression);
var iterator = ts.isIdentifier(expression) ? factory.getGeneratedNameForNode(expression) : factory.createTempVariable(/*recordTempVariable*/ undefined);
var result = ts.isIdentifier(expression) ? factory.getGeneratedNameForNode(iterator) : factory.createTempVariable(/*recordTempVariable*/ undefined);
var errorRecord = factory.createUniqueName("e");
var catchVariable = factory.getGeneratedNameForNode(errorRecord);
var returnMethod = factory.createTempVariable(/*recordTempVariable*/ undefined);
var values = ts.setTextRange(emitHelpers().createValuesHelper(expression), node.expression);
var next = factory.createCallExpression(factory.createPropertyAccessExpression(iterator, "next"), /*typeArguments*/ undefined, []);
hoistVariableDeclaration(errorRecord);
hoistVariableDeclaration(returnMethod);
// if we are enclosed in an outer loop ensure we reset 'errorRecord' per each iteration
var initializer = ancestorFacts & 1024 /* IterationContainer */
? factory.inlineExpressions([factory.createAssignment(errorRecord, factory.createVoidZero()), values])
: values;
var forStatement = ts.setEmitFlags(ts.setTextRange(factory.createForStatement(
/*initializer*/ ts.setEmitFlags(ts.setTextRange(factory.createVariableDeclarationList([
ts.setTextRange(factory.createVariableDeclaration(iterator, /*exclamationToken*/ undefined, /*type*/ undefined, initializer), node.expression),
factory.createVariableDeclaration(result, /*exclamationToken*/ undefined, /*type*/ undefined, next)
]), node.expression), 2097152 /* NoHoisting */),
/*condition*/ factory.createLogicalNot(factory.createPropertyAccessExpression(result, "done")),
/*incrementor*/ factory.createAssignment(result, next),
/*statement*/ convertForOfStatementHead(node, factory.createPropertyAccessExpression(result, "value"), convertedLoopBodyStatements)),
/*location*/ node), 256 /* NoTokenTrailingSourceMaps */);
return factory.createTryStatement(factory.createBlock([
factory.restoreEnclosingLabel(forStatement, outermostLabeledStatement, convertedLoopState && resetLabel)
]), factory.createCatchClause(factory.createVariableDeclaration(catchVariable), ts.setEmitFlags(factory.createBlock([
factory.createExpressionStatement(factory.createAssignment(errorRecord, factory.createObjectLiteralExpression([
factory.createPropertyAssignment("error", catchVariable)
])))
]), 1 /* SingleLine */)), factory.createBlock([
factory.createTryStatement(
/*tryBlock*/ factory.createBlock([
ts.setEmitFlags(factory.createIfStatement(factory.createLogicalAnd(factory.createLogicalAnd(result, factory.createLogicalNot(factory.createPropertyAccessExpression(result, "done"))), factory.createAssignment(returnMethod, factory.createPropertyAccessExpression(iterator, "return"))), factory.createExpressionStatement(factory.createFunctionCallCall(returnMethod, iterator, []))), 1 /* SingleLine */),
]),
/*catchClause*/ undefined,
/*finallyBlock*/ ts.setEmitFlags(factory.createBlock([
ts.setEmitFlags(factory.createIfStatement(errorRecord, factory.createThrowStatement(factory.createPropertyAccessExpression(errorRecord, "error"))), 1 /* SingleLine */)
]), 1 /* SingleLine */))
]));
}
/**
* Visits an ObjectLiteralExpression with computed property names.
*
* @param node An ObjectLiteralExpression node.
*/
function visitObjectLiteralExpression(node) {
var properties = node.properties;
// Find the first computed property.
// Everything until that point can be emitted as part of the initial object literal.
var numInitialProperties = -1, hasComputed = false;
for (var i = 0; i < properties.length; i++) {
var property = properties[i];
if ((property.transformFlags & 524288 /* ContainsYield */ &&
hierarchyFacts & 4 /* AsyncFunctionBody */)
|| (hasComputed = ts.Debug.checkDefined(property.name).kind === 160 /* ComputedPropertyName */)) {
numInitialProperties = i;
break;
}
}
if (numInitialProperties < 0) {
return ts.visitEachChild(node, visitor, context);
}
// For computed properties, we need to create a unique handle to the object
// literal so we can modify it without risking internal assignments tainting the object.
var temp = factory.createTempVariable(hoistVariableDeclaration);
// Write out the first non-computed properties, then emit the rest through indexing on the temp variable.
var expressions = [];
var assignment = factory.createAssignment(temp, ts.setEmitFlags(factory.createObjectLiteralExpression(ts.visitNodes(properties, visitor, ts.isObjectLiteralElementLike, 0, numInitialProperties), node.multiLine), hasComputed ? 65536 /* Indented */ : 0));
if (node.multiLine) {
ts.startOnNewLine(assignment);
}
expressions.push(assignment);
addObjectLiteralMembers(expressions, node, temp, numInitialProperties);
// We need to clone the temporary identifier so that we can write it on a
// new line
expressions.push(node.multiLine ? ts.startOnNewLine(ts.setParent(ts.setTextRange(factory.cloneNode(temp), temp), temp.parent)) : temp);
return factory.inlineExpressions(expressions);
}
function shouldConvertPartOfIterationStatement(node) {
return (resolver.getNodeCheckFlags(node) & 131072 /* ContainsCapturedBlockScopeBinding */) !== 0;
}
function shouldConvertInitializerOfForStatement(node) {
return ts.isForStatement(node) && !!node.initializer && shouldConvertPartOfIterationStatement(node.initializer);
}
function shouldConvertConditionOfForStatement(node) {
return ts.isForStatement(node) && !!node.condition && shouldConvertPartOfIterationStatement(node.condition);
}
function shouldConvertIncrementorOfForStatement(node) {
return ts.isForStatement(node) && !!node.incrementor && shouldConvertPartOfIterationStatement(node.incrementor);
}
function shouldConvertIterationStatement(node) {
return shouldConvertBodyOfIterationStatement(node)
|| shouldConvertInitializerOfForStatement(node);
}
function shouldConvertBodyOfIterationStatement(node) {
return (resolver.getNodeCheckFlags(node) & 65536 /* LoopWithCapturedBlockScopedBinding */) !== 0;
}
/**
* Records constituents of name for the given variable to be hoisted in the outer scope.
*/
function hoistVariableDeclarationDeclaredInConvertedLoop(state, node) {
if (!state.hoistedLocalVariables) {
state.hoistedLocalVariables = [];
}
visit(node.name);
function visit(node) {
if (node.kind === 79 /* Identifier */) {
state.hoistedLocalVariables.push(node);
}
else {
for (var _i = 0, _a = node.elements; _i < _a.length; _i++) {
var element = _a[_i];
if (!ts.isOmittedExpression(element)) {
visit(element.name);
}
}
}
}
}
function convertIterationStatementBodyIfNecessary(node, outermostLabeledStatement, ancestorFacts, convert) {
if (!shouldConvertIterationStatement(node)) {
var saveAllowedNonLabeledJumps = void 0;
if (convertedLoopState) {
// we get here if we are trying to emit normal loop loop inside converted loop
// set allowedNonLabeledJumps to Break | Continue to mark that break\continue inside the loop should be emitted as is
saveAllowedNonLabeledJumps = convertedLoopState.allowedNonLabeledJumps;
convertedLoopState.allowedNonLabeledJumps = 2 /* Break */ | 4 /* Continue */;
}
var result = convert
? convert(node, outermostLabeledStatement, /*convertedLoopBodyStatements*/ undefined, ancestorFacts)
: factory.restoreEnclosingLabel(ts.isForStatement(node) ? visitEachChildOfForStatement(node) : ts.visitEachChild(node, visitor, context), outermostLabeledStatement, convertedLoopState && resetLabel);
if (convertedLoopState) {
convertedLoopState.allowedNonLabeledJumps = saveAllowedNonLabeledJumps;
}
return result;
}
var currentState = createConvertedLoopState(node);
var statements = [];
var outerConvertedLoopState = convertedLoopState;
convertedLoopState = currentState;
var initializerFunction = shouldConvertInitializerOfForStatement(node) ? createFunctionForInitializerOfForStatement(node, currentState) : undefined;
var bodyFunction = shouldConvertBodyOfIterationStatement(node) ? createFunctionForBodyOfIterationStatement(node, currentState, outerConvertedLoopState) : undefined;
convertedLoopState = outerConvertedLoopState;
if (initializerFunction)
statements.push(initializerFunction.functionDeclaration);
if (bodyFunction)
statements.push(bodyFunction.functionDeclaration);
addExtraDeclarationsForConvertedLoop(statements, currentState, outerConvertedLoopState);
if (initializerFunction) {
statements.push(generateCallToConvertedLoopInitializer(initializerFunction.functionName, initializerFunction.containsYield));
}
var loop;
if (bodyFunction) {
if (convert) {
loop = convert(node, outermostLabeledStatement, bodyFunction.part, ancestorFacts);
}
else {
var clone_4 = convertIterationStatementCore(node, initializerFunction, factory.createBlock(bodyFunction.part, /*multiLine*/ true));
loop = factory.restoreEnclosingLabel(clone_4, outermostLabeledStatement, convertedLoopState && resetLabel);
}
}
else {
var clone_5 = convertIterationStatementCore(node, initializerFunction, ts.visitNode(node.statement, visitor, ts.isStatement, factory.liftToBlock));
loop = factory.restoreEnclosingLabel(clone_5, outermostLabeledStatement, convertedLoopState && resetLabel);
}
statements.push(loop);
return statements;
}
function convertIterationStatementCore(node, initializerFunction, convertedLoopBody) {
switch (node.kind) {
case 240 /* ForStatement */: return convertForStatement(node, initializerFunction, convertedLoopBody);
case 241 /* ForInStatement */: return convertForInStatement(node, convertedLoopBody);
case 242 /* ForOfStatement */: return convertForOfStatement(node, convertedLoopBody);
case 238 /* DoStatement */: return convertDoStatement(node, convertedLoopBody);
case 239 /* WhileStatement */: return convertWhileStatement(node, convertedLoopBody);
default: return ts.Debug.failBadSyntaxKind(node, "IterationStatement expected");
}
}
function convertForStatement(node, initializerFunction, convertedLoopBody) {
var shouldConvertCondition = node.condition && shouldConvertPartOfIterationStatement(node.condition);
var shouldConvertIncrementor = shouldConvertCondition || node.incrementor && shouldConvertPartOfIterationStatement(node.incrementor);
return factory.updateForStatement(node, ts.visitNode(initializerFunction ? initializerFunction.part : node.initializer, visitorWithUnusedExpressionResult, ts.isForInitializer), ts.visitNode(shouldConvertCondition ? undefined : node.condition, visitor, ts.isExpression), ts.visitNode(shouldConvertIncrementor ? undefined : node.incrementor, visitorWithUnusedExpressionResult, ts.isExpression), convertedLoopBody);
}
function convertForOfStatement(node, convertedLoopBody) {
return factory.updateForOfStatement(node,
/*awaitModifier*/ undefined, ts.visitNode(node.initializer, visitor, ts.isForInitializer), ts.visitNode(node.expression, visitor, ts.isExpression), convertedLoopBody);
}
function convertForInStatement(node, convertedLoopBody) {
return factory.updateForInStatement(node, ts.visitNode(node.initializer, visitor, ts.isForInitializer), ts.visitNode(node.expression, visitor, ts.isExpression), convertedLoopBody);
}
function convertDoStatement(node, convertedLoopBody) {
return factory.updateDoStatement(node, convertedLoopBody, ts.visitNode(node.expression, visitor, ts.isExpression));
}
function convertWhileStatement(node, convertedLoopBody) {
return factory.updateWhileStatement(node, ts.visitNode(node.expression, visitor, ts.isExpression), convertedLoopBody);
}
function createConvertedLoopState(node) {
var loopInitializer;
switch (node.kind) {
case 240 /* ForStatement */:
case 241 /* ForInStatement */:
case 242 /* ForOfStatement */:
var initializer = node.initializer;
if (initializer && initializer.kind === 253 /* VariableDeclarationList */) {
loopInitializer = initializer;
}
break;
}
// variables that will be passed to the loop as parameters
var loopParameters = [];
// variables declared in the loop initializer that will be changed inside the loop
var loopOutParameters = [];
if (loopInitializer && (ts.getCombinedNodeFlags(loopInitializer) & 3 /* BlockScoped */)) {
var hasCapturedBindingsInForInitializer = shouldConvertInitializerOfForStatement(node);
for (var _i = 0, _a = loopInitializer.declarations; _i < _a.length; _i++) {
var decl = _a[_i];
processLoopVariableDeclaration(node, decl, loopParameters, loopOutParameters, hasCapturedBindingsInForInitializer);
}
}
var currentState = { loopParameters: loopParameters, loopOutParameters: loopOutParameters };
if (convertedLoopState) {
// convertedOuterLoopState !== undefined means that this converted loop is nested in another converted loop.
// if outer converted loop has already accumulated some state - pass it through
if (convertedLoopState.argumentsName) {
// outer loop has already used 'arguments' so we've already have some name to alias it
// use the same name in all nested loops
currentState.argumentsName = convertedLoopState.argumentsName;
}
if (convertedLoopState.thisName) {
// outer loop has already used 'this' so we've already have some name to alias it
// use the same name in all nested loops
currentState.thisName = convertedLoopState.thisName;
}
if (convertedLoopState.hoistedLocalVariables) {
// we've already collected some non-block scoped variable declarations in enclosing loop
// use the same storage in nested loop
currentState.hoistedLocalVariables = convertedLoopState.hoistedLocalVariables;
}
}
return currentState;
}
function addExtraDeclarationsForConvertedLoop(statements, state, outerState) {
var extraVariableDeclarations;
// propagate state from the inner loop to the outer loop if necessary
if (state.argumentsName) {
// if alias for arguments is set
if (outerState) {
// pass it to outer converted loop
outerState.argumentsName = state.argumentsName;
}
else {
// this is top level converted loop and we need to create an alias for 'arguments' object
(extraVariableDeclarations || (extraVariableDeclarations = [])).push(factory.createVariableDeclaration(state.argumentsName,
/*exclamationToken*/ undefined,
/*type*/ undefined, factory.createIdentifier("arguments")));
}
}
if (state.thisName) {
// if alias for this is set
if (outerState) {
// pass it to outer converted loop
outerState.thisName = state.thisName;
}
else {
// this is top level converted loop so we need to create an alias for 'this' here
// NOTE:
// if converted loops were all nested in arrow function then we'll always emit '_this' so convertedLoopState.thisName will not be set.
// If it is set this means that all nested loops are not nested in arrow function and it is safe to capture 'this'.
(extraVariableDeclarations || (extraVariableDeclarations = [])).push(factory.createVariableDeclaration(state.thisName,
/*exclamationToken*/ undefined,
/*type*/ undefined, factory.createIdentifier("this")));
}
}
if (state.hoistedLocalVariables) {
// if hoistedLocalVariables !== undefined this means that we've possibly collected some variable declarations to be hoisted later
if (outerState) {
// pass them to outer converted loop
outerState.hoistedLocalVariables = state.hoistedLocalVariables;
}
else {
if (!extraVariableDeclarations) {
extraVariableDeclarations = [];
}
// hoist collected variable declarations
for (var _i = 0, _a = state.hoistedLocalVariables; _i < _a.length; _i++) {
var identifier = _a[_i];
extraVariableDeclarations.push(factory.createVariableDeclaration(identifier));
}
}
}
// add extra variables to hold out parameters if necessary
if (state.loopOutParameters.length) {
if (!extraVariableDeclarations) {
extraVariableDeclarations = [];
}
for (var _b = 0, _c = state.loopOutParameters; _b < _c.length; _b++) {
var outParam = _c[_b];
extraVariableDeclarations.push(factory.createVariableDeclaration(outParam.outParamName));
}
}
if (state.conditionVariable) {
if (!extraVariableDeclarations) {
extraVariableDeclarations = [];
}
extraVariableDeclarations.push(factory.createVariableDeclaration(state.conditionVariable, /*exclamationToken*/ undefined, /*type*/ undefined, factory.createFalse()));
}
// create variable statement to hold all introduced variable declarations
if (extraVariableDeclarations) {
statements.push(factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList(extraVariableDeclarations)));
}
}
function createOutVariable(p) {
return factory.createVariableDeclaration(p.originalName, /*exclamationToken*/ undefined, /*type*/ undefined, p.outParamName);
}
/**
* Creates a `_loop_init` function for a `ForStatement` with a block-scoped initializer
* that is captured in a closure inside of the initializer. The `_loop_init` function is
* used to preserve the per-iteration environment semantics of
* [13.7.4.8 RS: ForBodyEvaluation](https://tc39.github.io/ecma262/#sec-forbodyevaluation).
*/
function createFunctionForInitializerOfForStatement(node, currentState) {
var functionName = factory.createUniqueName("_loop_init");
var containsYield = (node.initializer.transformFlags & 524288 /* ContainsYield */) !== 0;
var emitFlags = 0 /* None */;
if (currentState.containsLexicalThis)
emitFlags |= 8 /* CapturesThis */;
if (containsYield && hierarchyFacts & 4 /* AsyncFunctionBody */)
emitFlags |= 262144 /* AsyncFunctionBody */;
var statements = [];
statements.push(factory.createVariableStatement(/*modifiers*/ undefined, node.initializer));
copyOutParameters(currentState.loopOutParameters, 2 /* Initializer */, 1 /* ToOutParameter */, statements);
// This transforms the following ES2015 syntax:
//
// for (let i = (setImmediate(() => console.log(i)), 0); i < 2; i++) {
// // loop body
// }
//
// Into the following ES5 syntax:
//
// var _loop_init_1 = function () {
// var i = (setImmediate(() => console.log(i)), 0);
// out_i_1 = i;
// };
// var out_i_1;
// _loop_init_1();
// for (var i = out_i_1; i < 2; i++) {
// // loop body
// }
//
// Which prevents mutations to `i` in the per-iteration environment of the body
// from affecting the initial value for `i` outside of the per-iteration environment.
var functionDeclaration = factory.createVariableStatement(
/*modifiers*/ undefined, ts.setEmitFlags(factory.createVariableDeclarationList([
factory.createVariableDeclaration(functionName,
/*exclamationToken*/ undefined,
/*type*/ undefined, ts.setEmitFlags(factory.createFunctionExpression(
/*modifiers*/ undefined, containsYield ? factory.createToken(41 /* AsteriskToken */) : undefined,
/*name*/ undefined,
/*typeParameters*/ undefined,
/*parameters*/ undefined,
/*type*/ undefined, ts.visitNode(factory.createBlock(statements, /*multiLine*/ true), visitor, ts.isBlock)), emitFlags))
]), 2097152 /* NoHoisting */));
var part = factory.createVariableDeclarationList(ts.map(currentState.loopOutParameters, createOutVariable));
return { functionName: functionName, containsYield: containsYield, functionDeclaration: functionDeclaration, part: part };
}
/**
* Creates a `_loop` function for an `IterationStatement` with a block-scoped initializer
* that is captured in a closure inside of the loop body. The `_loop` function is used to
* preserve the per-iteration environment semantics of
* [13.7.4.8 RS: ForBodyEvaluation](https://tc39.github.io/ecma262/#sec-forbodyevaluation).
*/
function createFunctionForBodyOfIterationStatement(node, currentState, outerState) {
var functionName = factory.createUniqueName("_loop");
startLexicalEnvironment();
var statement = ts.visitNode(node.statement, visitor, ts.isStatement, factory.liftToBlock);
var lexicalEnvironment = endLexicalEnvironment();
var statements = [];
if (shouldConvertConditionOfForStatement(node) || shouldConvertIncrementorOfForStatement(node)) {
// If a block-scoped variable declared in the initializer of `node` is captured in
// the condition or incrementor, we must move the condition and incrementor into
// the body of the for loop.
//
// This transforms the following ES2015 syntax:
//
// for (let i = 0; setImmediate(() => console.log(i)), i < 2; setImmediate(() => console.log(i)), i++) {
// // loop body
// }
//
// Into the following ES5 syntax:
//
// var _loop_1 = function (i) {
// if (inc_1)
// setImmediate(() => console.log(i)), i++;
// else
// inc_1 = true;
// if (!(setImmediate(() => console.log(i)), i < 2))
// return out_i_1 = i, "break";
// // loop body
// out_i_1 = i;
// }
// var out_i_1, inc_1 = false;
// for (var i = 0;;) {
// var state_1 = _loop_1(i);
// i = out_i_1;
// if (state_1 === "break")
// break;
// }
//
// Which prevents mutations to `i` in the per-iteration environment of the body
// from affecting the value of `i` in the previous per-iteration environment.
//
// Note that the incrementor of a `for` loop is evaluated in a *new* per-iteration
// environment that is carried over to the next iteration of the loop. As a result,
// we must indicate whether this is the first evaluation of the loop body so that
// we only evaluate the incrementor on subsequent evaluations.
currentState.conditionVariable = factory.createUniqueName("inc");
if (node.incrementor) {
statements.push(factory.createIfStatement(currentState.conditionVariable, factory.createExpressionStatement(ts.visitNode(node.incrementor, visitor, ts.isExpression)), factory.createExpressionStatement(factory.createAssignment(currentState.conditionVariable, factory.createTrue()))));
}
else {
statements.push(factory.createIfStatement(factory.createLogicalNot(currentState.conditionVariable), factory.createExpressionStatement(factory.createAssignment(currentState.conditionVariable, factory.createTrue()))));
}
if (shouldConvertConditionOfForStatement(node)) {
statements.push(factory.createIfStatement(factory.createPrefixUnaryExpression(53 /* ExclamationToken */, ts.visitNode(node.condition, visitor, ts.isExpression)), ts.visitNode(factory.createBreakStatement(), visitor, ts.isStatement)));
}
}
if (ts.isBlock(statement)) {
ts.addRange(statements, statement.statements);
}
else {
statements.push(statement);
}
copyOutParameters(currentState.loopOutParameters, 1 /* Body */, 1 /* ToOutParameter */, statements);
ts.insertStatementsAfterStandardPrologue(statements, lexicalEnvironment);
var loopBody = factory.createBlock(statements, /*multiLine*/ true);
if (ts.isBlock(statement))
ts.setOriginalNode(loopBody, statement);
var containsYield = (node.statement.transformFlags & 524288 /* ContainsYield */) !== 0;
var emitFlags = 524288 /* ReuseTempVariableScope */;
if (currentState.containsLexicalThis)
emitFlags |= 8 /* CapturesThis */;
if (containsYield && (hierarchyFacts & 4 /* AsyncFunctionBody */) !== 0)
emitFlags |= 262144 /* AsyncFunctionBody */;
// This transforms the following ES2015 syntax (in addition to other variations):
//
// for (let i = 0; i < 2; i++) {
// setImmediate(() => console.log(i));
// }
//
// Into the following ES5 syntax:
//
// var _loop_1 = function (i) {
// setImmediate(() => console.log(i));
// };
// for (var i = 0; i < 2; i++) {
// _loop_1(i);
// }
var functionDeclaration = factory.createVariableStatement(
/*modifiers*/ undefined, ts.setEmitFlags(factory.createVariableDeclarationList([
factory.createVariableDeclaration(functionName,
/*exclamationToken*/ undefined,
/*type*/ undefined, ts.setEmitFlags(factory.createFunctionExpression(
/*modifiers*/ undefined, containsYield ? factory.createToken(41 /* AsteriskToken */) : undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, currentState.loopParameters,
/*type*/ undefined, loopBody), emitFlags))
]), 2097152 /* NoHoisting */));
var part = generateCallToConvertedLoop(functionName, currentState, outerState, containsYield);
return { functionName: functionName, containsYield: containsYield, functionDeclaration: functionDeclaration, part: part };
}
function copyOutParameter(outParam, copyDirection) {
var source = copyDirection === 0 /* ToOriginal */ ? outParam.outParamName : outParam.originalName;
var target = copyDirection === 0 /* ToOriginal */ ? outParam.originalName : outParam.outParamName;
return factory.createBinaryExpression(target, 63 /* EqualsToken */, source);
}
function copyOutParameters(outParams, partFlags, copyDirection, statements) {
for (var _i = 0, outParams_1 = outParams; _i < outParams_1.length; _i++) {
var outParam = outParams_1[_i];
if (outParam.flags & partFlags) {
statements.push(factory.createExpressionStatement(copyOutParameter(outParam, copyDirection)));
}
}
}
function generateCallToConvertedLoopInitializer(initFunctionExpressionName, containsYield) {
var call = factory.createCallExpression(initFunctionExpressionName, /*typeArguments*/ undefined, []);
var callResult = containsYield
? factory.createYieldExpression(factory.createToken(41 /* AsteriskToken */), ts.setEmitFlags(call, 8388608 /* Iterator */))
: call;
return factory.createExpressionStatement(callResult);
}
function generateCallToConvertedLoop(loopFunctionExpressionName, state, outerState, containsYield) {
var statements = [];
// loop is considered simple if it does not have any return statements or break\continue that transfer control outside of the loop
// simple loops are emitted as just 'loop()';
// NOTE: if loop uses only 'continue' it still will be emitted as simple loop
var isSimpleLoop = !(state.nonLocalJumps & ~4 /* Continue */) &&
!state.labeledNonLocalBreaks &&
!state.labeledNonLocalContinues;
var call = factory.createCallExpression(loopFunctionExpressionName, /*typeArguments*/ undefined, ts.map(state.loopParameters, function (p) { return p.name; }));
var callResult = containsYield
? factory.createYieldExpression(factory.createToken(41 /* AsteriskToken */), ts.setEmitFlags(call, 8388608 /* Iterator */))
: call;
if (isSimpleLoop) {
statements.push(factory.createExpressionStatement(callResult));
copyOutParameters(state.loopOutParameters, 1 /* Body */, 0 /* ToOriginal */, statements);
}
else {
var loopResultName = factory.createUniqueName("state");
var stateVariable = factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList([factory.createVariableDeclaration(loopResultName, /*exclamationToken*/ undefined, /*type*/ undefined, callResult)]));
statements.push(stateVariable);
copyOutParameters(state.loopOutParameters, 1 /* Body */, 0 /* ToOriginal */, statements);
if (state.nonLocalJumps & 8 /* Return */) {
var returnStatement = void 0;
if (outerState) {
outerState.nonLocalJumps |= 8 /* Return */;
returnStatement = factory.createReturnStatement(loopResultName);
}
else {
returnStatement = factory.createReturnStatement(factory.createPropertyAccessExpression(loopResultName, "value"));
}
statements.push(factory.createIfStatement(factory.createTypeCheck(loopResultName, "object"), returnStatement));
}
if (state.nonLocalJumps & 2 /* Break */) {
statements.push(factory.createIfStatement(factory.createStrictEquality(loopResultName, factory.createStringLiteral("break")), factory.createBreakStatement()));
}
if (state.labeledNonLocalBreaks || state.labeledNonLocalContinues) {
var caseClauses = [];
processLabeledJumps(state.labeledNonLocalBreaks, /*isBreak*/ true, loopResultName, outerState, caseClauses);
processLabeledJumps(state.labeledNonLocalContinues, /*isBreak*/ false, loopResultName, outerState, caseClauses);
statements.push(factory.createSwitchStatement(loopResultName, factory.createCaseBlock(caseClauses)));
}
}
return statements;
}
function setLabeledJump(state, isBreak, labelText, labelMarker) {
if (isBreak) {
if (!state.labeledNonLocalBreaks) {
state.labeledNonLocalBreaks = new ts.Map();
}
state.labeledNonLocalBreaks.set(labelText, labelMarker);
}
else {
if (!state.labeledNonLocalContinues) {
state.labeledNonLocalContinues = new ts.Map();
}
state.labeledNonLocalContinues.set(labelText, labelMarker);
}
}
function processLabeledJumps(table, isBreak, loopResultName, outerLoop, caseClauses) {
if (!table) {
return;
}
table.forEach(function (labelMarker, labelText) {
var statements = [];
// if there are no outer converted loop or outer label in question is located inside outer converted loop
// then emit labeled break\continue
// otherwise propagate pair 'label -> marker' to outer converted loop and emit 'return labelMarker' so outer loop can later decide what to do
if (!outerLoop || (outerLoop.labels && outerLoop.labels.get(labelText))) {
var label = factory.createIdentifier(labelText);
statements.push(isBreak ? factory.createBreakStatement(label) : factory.createContinueStatement(label));
}
else {
setLabeledJump(outerLoop, isBreak, labelText, labelMarker);
statements.push(factory.createReturnStatement(loopResultName));
}
caseClauses.push(factory.createCaseClause(factory.createStringLiteral(labelMarker), statements));
});
}
function processLoopVariableDeclaration(container, decl, loopParameters, loopOutParameters, hasCapturedBindingsInForInitializer) {
var name = decl.name;
if (ts.isBindingPattern(name)) {
for (var _i = 0, _a = name.elements; _i < _a.length; _i++) {
var element = _a[_i];
if (!ts.isOmittedExpression(element)) {
processLoopVariableDeclaration(container, element, loopParameters, loopOutParameters, hasCapturedBindingsInForInitializer);
}
}
}
else {
loopParameters.push(factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, name));
var checkFlags = resolver.getNodeCheckFlags(decl);
if (checkFlags & 4194304 /* NeedsLoopOutParameter */ || hasCapturedBindingsInForInitializer) {
var outParamName = factory.createUniqueName("out_" + ts.idText(name));
var flags = 0;
if (checkFlags & 4194304 /* NeedsLoopOutParameter */) {
flags |= 1 /* Body */;
}
if (ts.isForStatement(container) && container.initializer && resolver.isBindingCapturedByNode(container.initializer, decl)) {
flags |= 2 /* Initializer */;
}
loopOutParameters.push({ flags: flags, originalName: name, outParamName: outParamName });
}
}
}
/**
* Adds the members of an object literal to an array of expressions.
*
* @param expressions An array of expressions.
* @param node An ObjectLiteralExpression node.
* @param receiver The receiver for members of the ObjectLiteralExpression.
* @param numInitialNonComputedProperties The number of initial properties without
* computed property names.
*/
function addObjectLiteralMembers(expressions, node, receiver, start) {
var properties = node.properties;
var numProperties = properties.length;
for (var i = start; i < numProperties; i++) {
var property = properties[i];
switch (property.kind) {
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
var accessors = ts.getAllAccessorDeclarations(node.properties, property);
if (property === accessors.firstAccessor) {
expressions.push(transformAccessorsToExpression(receiver, accessors, node, !!node.multiLine));
}
break;
case 167 /* MethodDeclaration */:
expressions.push(transformObjectLiteralMethodDeclarationToExpression(property, receiver, node, node.multiLine));
break;
case 291 /* PropertyAssignment */:
expressions.push(transformPropertyAssignmentToExpression(property, receiver, node.multiLine));
break;
case 292 /* ShorthandPropertyAssignment */:
expressions.push(transformShorthandPropertyAssignmentToExpression(property, receiver, node.multiLine));
break;
default:
ts.Debug.failBadSyntaxKind(node);
break;
}
}
}
/**
* Transforms a PropertyAssignment node into an expression.
*
* @param node The ObjectLiteralExpression that contains the PropertyAssignment.
* @param property The PropertyAssignment node.
* @param receiver The receiver for the assignment.
*/
function transformPropertyAssignmentToExpression(property, receiver, startsOnNewLine) {
var expression = factory.createAssignment(ts.createMemberAccessForPropertyName(factory, receiver, ts.visitNode(property.name, visitor, ts.isPropertyName)), ts.visitNode(property.initializer, visitor, ts.isExpression));
ts.setTextRange(expression, property);
if (startsOnNewLine) {
ts.startOnNewLine(expression);
}
return expression;
}
/**
* Transforms a ShorthandPropertyAssignment node into an expression.
*
* @param node The ObjectLiteralExpression that contains the ShorthandPropertyAssignment.
* @param property The ShorthandPropertyAssignment node.
* @param receiver The receiver for the assignment.
*/
function transformShorthandPropertyAssignmentToExpression(property, receiver, startsOnNewLine) {
var expression = factory.createAssignment(ts.createMemberAccessForPropertyName(factory, receiver, ts.visitNode(property.name, visitor, ts.isPropertyName)), factory.cloneNode(property.name));
ts.setTextRange(expression, property);
if (startsOnNewLine) {
ts.startOnNewLine(expression);
}
return expression;
}
/**
* Transforms a MethodDeclaration of an ObjectLiteralExpression into an expression.
*
* @param node The ObjectLiteralExpression that contains the MethodDeclaration.
* @param method The MethodDeclaration node.
* @param receiver The receiver for the assignment.
*/
function transformObjectLiteralMethodDeclarationToExpression(method, receiver, container, startsOnNewLine) {
var expression = factory.createAssignment(ts.createMemberAccessForPropertyName(factory, receiver, ts.visitNode(method.name, visitor, ts.isPropertyName)), transformFunctionLikeToExpression(method, /*location*/ method, /*name*/ undefined, container));
ts.setTextRange(expression, method);
if (startsOnNewLine) {
ts.startOnNewLine(expression);
}
return expression;
}
function visitCatchClause(node) {
var ancestorFacts = enterSubtree(7104 /* BlockScopeExcludes */, 0 /* BlockScopeIncludes */);
var updated;
ts.Debug.assert(!!node.variableDeclaration, "Catch clause variable should always be present when downleveling ES2015.");
if (ts.isBindingPattern(node.variableDeclaration.name)) {
var temp = factory.createTempVariable(/*recordTempVariable*/ undefined);
var newVariableDeclaration = factory.createVariableDeclaration(temp);
ts.setTextRange(newVariableDeclaration, node.variableDeclaration);
var vars = ts.flattenDestructuringBinding(node.variableDeclaration, visitor, context, 0 /* All */, temp);
var list = factory.createVariableDeclarationList(vars);
ts.setTextRange(list, node.variableDeclaration);
var destructure = factory.createVariableStatement(/*modifiers*/ undefined, list);
updated = factory.updateCatchClause(node, newVariableDeclaration, addStatementToStartOfBlock(node.block, destructure));
}
else {
updated = ts.visitEachChild(node, visitor, context);
}
exitSubtree(ancestorFacts, 0 /* None */, 0 /* None */);
return updated;
}
function addStatementToStartOfBlock(block, statement) {
var transformedStatements = ts.visitNodes(block.statements, visitor, ts.isStatement);
return factory.updateBlock(block, __spreadArray([statement], transformedStatements, true));
}
/**
* Visits a MethodDeclaration of an ObjectLiteralExpression and transforms it into a
* PropertyAssignment.
*
* @param node A MethodDeclaration node.
*/
function visitMethodDeclaration(node) {
// We should only get here for methods on an object literal with regular identifier names.
// Methods on classes are handled in visitClassDeclaration/visitClassExpression.
// Methods with computed property names are handled in visitObjectLiteralExpression.
ts.Debug.assert(!ts.isComputedPropertyName(node.name));
var functionExpression = transformFunctionLikeToExpression(node, /*location*/ ts.moveRangePos(node, -1), /*name*/ undefined, /*container*/ undefined);
ts.setEmitFlags(functionExpression, 512 /* NoLeadingComments */ | ts.getEmitFlags(functionExpression));
return ts.setTextRange(factory.createPropertyAssignment(node.name, functionExpression),
/*location*/ node);
}
/**
* Visits an AccessorDeclaration of an ObjectLiteralExpression.
*
* @param node An AccessorDeclaration node.
*/
function visitAccessorDeclaration(node) {
ts.Debug.assert(!ts.isComputedPropertyName(node.name));
var savedConvertedLoopState = convertedLoopState;
convertedLoopState = undefined;
var ancestorFacts = enterSubtree(32670 /* FunctionExcludes */, 65 /* FunctionIncludes */);
var updated;
var parameters = ts.visitParameterList(node.parameters, visitor, context);
var body = transformFunctionBody(node);
if (node.kind === 170 /* GetAccessor */) {
updated = factory.updateGetAccessorDeclaration(node, node.decorators, node.modifiers, node.name, parameters, node.type, body);
}
else {
updated = factory.updateSetAccessorDeclaration(node, node.decorators, node.modifiers, node.name, parameters, body);
}
exitSubtree(ancestorFacts, 98304 /* FunctionSubtreeExcludes */, 0 /* None */);
convertedLoopState = savedConvertedLoopState;
return updated;
}
/**
* Visits a ShorthandPropertyAssignment and transforms it into a PropertyAssignment.
*
* @param node A ShorthandPropertyAssignment node.
*/
function visitShorthandPropertyAssignment(node) {
return ts.setTextRange(factory.createPropertyAssignment(node.name, visitIdentifier(factory.cloneNode(node.name))),
/*location*/ node);
}
function visitComputedPropertyName(node) {
return ts.visitEachChild(node, visitor, context);
}
/**
* Visits a YieldExpression node.
*
* @param node A YieldExpression node.
*/
function visitYieldExpression(node) {
// `yield` expressions are transformed using the generators transformer.
return ts.visitEachChild(node, visitor, context);
}
/**
* Visits an ArrayLiteralExpression that contains a spread element.
*
* @param node An ArrayLiteralExpression node.
*/
function visitArrayLiteralExpression(node) {
if (ts.some(node.elements, ts.isSpreadElement)) {
// We are here because we contain a SpreadElementExpression.
return transformAndSpreadElements(node.elements, /*isArgumentList*/ false, !!node.multiLine, /*hasTrailingComma*/ !!node.elements.hasTrailingComma);
}
return ts.visitEachChild(node, visitor, context);
}
/**
* Visits a CallExpression that contains either a spread element or `super`.
*
* @param node a CallExpression.
*/
function visitCallExpression(node) {
if (ts.getEmitFlags(node) & 33554432 /* TypeScriptClassWrapper */) {
return visitTypeScriptClassWrapper(node);
}
var expression = ts.skipOuterExpressions(node.expression);
if (expression.kind === 106 /* SuperKeyword */ ||
ts.isSuperProperty(expression) ||
ts.some(node.arguments, ts.isSpreadElement)) {
return visitCallExpressionWithPotentialCapturedThisAssignment(node, /*assignToCapturedThis*/ true);
}
return factory.updateCallExpression(node, ts.visitNode(node.expression, callExpressionVisitor, ts.isExpression),
/*typeArguments*/ undefined, ts.visitNodes(node.arguments, visitor, ts.isExpression));
}
function visitTypeScriptClassWrapper(node) {
// This is a call to a class wrapper function (an IIFE) created by the 'ts' transformer.
// The wrapper has a form similar to:
//
// (function() {
// class C { // 1
// }
// C.x = 1; // 2
// return C;
// }())
//
// When we transform the class, we end up with something like this:
//
// (function () {
// var C = (function () { // 3
// function C() {
// }
// return C; // 4
// }());
// C.x = 1;
// return C;
// }())
//
// We want to simplify the two nested IIFEs to end up with something like this:
//
// (function () {
// function C() {
// }
// C.x = 1;
// return C;
// }())
// We skip any outer expressions in a number of places to get to the innermost
// expression, but we will restore them later to preserve comments and source maps.
var body = ts.cast(ts.cast(ts.skipOuterExpressions(node.expression), ts.isArrowFunction).body, ts.isBlock);
// The class statements are the statements generated by visiting the first statement with initializer of the
// body (1), while all other statements are added to remainingStatements (2)
var isVariableStatementWithInitializer = function (stmt) { return ts.isVariableStatement(stmt) && !!ts.first(stmt.declarationList.declarations).initializer; };
// visit the class body statements outside of any converted loop body.
var savedConvertedLoopState = convertedLoopState;
convertedLoopState = undefined;
var bodyStatements = ts.visitNodes(body.statements, classWrapperStatementVisitor, ts.isStatement);
convertedLoopState = savedConvertedLoopState;
var classStatements = ts.filter(bodyStatements, isVariableStatementWithInitializer);
var remainingStatements = ts.filter(bodyStatements, function (stmt) { return !isVariableStatementWithInitializer(stmt); });
var varStatement = ts.cast(ts.first(classStatements), ts.isVariableStatement);
// We know there is only one variable declaration here as we verified this in an
// earlier call to isTypeScriptClassWrapper
var variable = varStatement.declarationList.declarations[0];
var initializer = ts.skipOuterExpressions(variable.initializer);
// Under certain conditions, the 'ts' transformer may introduce a class alias, which
// we see as an assignment, for example:
//
// (function () {
// var C_1;
// var C = C_1 = (function () {
// function C() {
// }
// C.x = function () { return C_1; }
// return C;
// }());
// C = C_1 = __decorate([dec], C);
// return C;
// }())
//
var aliasAssignment = ts.tryCast(initializer, ts.isAssignmentExpression);
if (!aliasAssignment && ts.isBinaryExpression(initializer) && initializer.operatorToken.kind === 27 /* CommaToken */) {
aliasAssignment = ts.tryCast(initializer.left, ts.isAssignmentExpression);
}
// The underlying call (3) is another IIFE that may contain a '_super' argument.
var call = ts.cast(aliasAssignment ? ts.skipOuterExpressions(aliasAssignment.right) : initializer, ts.isCallExpression);
var func = ts.cast(ts.skipOuterExpressions(call.expression), ts.isFunctionExpression);
var funcStatements = func.body.statements;
var classBodyStart = 0;
var classBodyEnd = -1;
var statements = [];
if (aliasAssignment) {
// If we have a class alias assignment, we need to move it to the down-level constructor
// function we generated for the class.
var extendsCall = ts.tryCast(funcStatements[classBodyStart], ts.isExpressionStatement);
if (extendsCall) {
statements.push(extendsCall);
classBodyStart++;
}
// The next statement is the function declaration.
statements.push(funcStatements[classBodyStart]);
classBodyStart++;
// Add the class alias following the declaration.
statements.push(factory.createExpressionStatement(factory.createAssignment(aliasAssignment.left, ts.cast(variable.name, ts.isIdentifier))));
}
// Find the trailing 'return' statement (4)
while (!ts.isReturnStatement(ts.elementAt(funcStatements, classBodyEnd))) {
classBodyEnd--;
}
// When we extract the statements of the inner IIFE, we exclude the 'return' statement (4)
// as we already have one that has been introduced by the 'ts' transformer.
ts.addRange(statements, funcStatements, classBodyStart, classBodyEnd);
if (classBodyEnd < -1) {
// If there were any hoisted declarations following the return statement, we should
// append them.
ts.addRange(statements, funcStatements, classBodyEnd + 1);
}
// Add the remaining statements of the outer wrapper.
ts.addRange(statements, remainingStatements);
// The 'es2015' class transform may add an end-of-declaration marker. If so we will add it
// after the remaining statements from the 'ts' transformer.
ts.addRange(statements, classStatements, /*start*/ 1);
// Recreate any outer parentheses or partially-emitted expressions to preserve source map
// and comment locations.
return factory.restoreOuterExpressions(node.expression, factory.restoreOuterExpressions(variable.initializer, factory.restoreOuterExpressions(aliasAssignment && aliasAssignment.right, factory.updateCallExpression(call, factory.restoreOuterExpressions(call.expression, factory.updateFunctionExpression(func,
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, func.parameters,
/*type*/ undefined, factory.updateBlock(func.body, statements))),
/*typeArguments*/ undefined, call.arguments))));
}
function visitImmediateSuperCallInBody(node) {
return visitCallExpressionWithPotentialCapturedThisAssignment(node, /*assignToCapturedThis*/ false);
}
function visitCallExpressionWithPotentialCapturedThisAssignment(node, assignToCapturedThis) {
// We are here either because SuperKeyword was used somewhere in the expression, or
// because we contain a SpreadElementExpression.
if (node.transformFlags & 16384 /* ContainsRestOrSpread */ ||
node.expression.kind === 106 /* SuperKeyword */ ||
ts.isSuperProperty(ts.skipOuterExpressions(node.expression))) {
var _a = factory.createCallBinding(node.expression, hoistVariableDeclaration), target = _a.target, thisArg = _a.thisArg;
if (node.expression.kind === 106 /* SuperKeyword */) {
ts.setEmitFlags(thisArg, 4 /* NoSubstitution */);
}
var resultingCall = void 0;
if (node.transformFlags & 16384 /* ContainsRestOrSpread */) {
// [source]
// f(...a, b)
// x.m(...a, b)
// super(...a, b)
// super.m(...a, b) // in static
// super.m(...a, b) // in instance
//
// [output]
// f.apply(void 0, a.concat([b]))
// (_a = x).m.apply(_a, a.concat([b]))
// _super.apply(this, a.concat([b]))
// _super.m.apply(this, a.concat([b]))
// _super.prototype.m.apply(this, a.concat([b]))
resultingCall = factory.createFunctionApplyCall(ts.visitNode(target, callExpressionVisitor, ts.isExpression), node.expression.kind === 106 /* SuperKeyword */ ? thisArg : ts.visitNode(thisArg, visitor, ts.isExpression), transformAndSpreadElements(node.arguments, /*isArgumentList*/ true, /*multiLine*/ false, /*hasTrailingComma*/ false));
}
else {
// [source]
// super(a)
// super.m(a) // in static
// super.m(a) // in instance
//
// [output]
// _super.call(this, a)
// _super.m.call(this, a)
// _super.prototype.m.call(this, a)
resultingCall = ts.setTextRange(factory.createFunctionCallCall(ts.visitNode(target, callExpressionVisitor, ts.isExpression), node.expression.kind === 106 /* SuperKeyword */ ? thisArg : ts.visitNode(thisArg, visitor, ts.isExpression), ts.visitNodes(node.arguments, visitor, ts.isExpression)), node);
}
if (node.expression.kind === 106 /* SuperKeyword */) {
var initializer = factory.createLogicalOr(resultingCall, createActualThis());
resultingCall = assignToCapturedThis
? factory.createAssignment(factory.createUniqueName("_this", 16 /* Optimistic */ | 32 /* FileLevel */), initializer)
: initializer;
}
return ts.setOriginalNode(resultingCall, node);
}
return ts.visitEachChild(node, visitor, context);
}
/**
* Visits a NewExpression that contains a spread element.
*
* @param node A NewExpression node.
*/
function visitNewExpression(node) {
if (ts.some(node.arguments, ts.isSpreadElement)) {
// We are here because we contain a SpreadElementExpression.
// [source]
// new C(...a)
//
// [output]
// new ((_a = C).bind.apply(_a, [void 0].concat(a)))()
var _a = factory.createCallBinding(factory.createPropertyAccessExpression(node.expression, "bind"), hoistVariableDeclaration), target = _a.target, thisArg = _a.thisArg;
return factory.createNewExpression(factory.createFunctionApplyCall(ts.visitNode(target, visitor, ts.isExpression), thisArg, transformAndSpreadElements(factory.createNodeArray(__spreadArray([factory.createVoidZero()], node.arguments, true)), /*isArgumentList*/ true, /*multiLine*/ false, /*hasTrailingComma*/ false)),
/*typeArguments*/ undefined, []);
}
return ts.visitEachChild(node, visitor, context);
}
/**
* Transforms an array of Expression nodes that contains a SpreadExpression.
*
* @param elements The array of Expression nodes.
* @param isArgumentList A value indicating whether to ensure that the result is a fresh array.
* This should be `false` when spreading into an `ArrayLiteral`, and `true` when spreading into an
* argument list.
* @param multiLine A value indicating whether the result should be emitted on multiple lines.
*/
function transformAndSpreadElements(elements, isArgumentList, multiLine, hasTrailingComma) {
// When there is no leading SpreadElement:
//
// [source]
// [a, ...b, c]
//
// [output (downlevelIteration)]
// __spreadArray(__spreadArray([a], __read(b)), [c])
//
// [output]
// __spreadArray(__spreadArray([a], b), [c])
//
// When there *is* a leading SpreadElement:
//
// [source]
// [...a, b]
//
// [output (downlevelIteration)]
// __spreadArray(__spreadArray([], __read(a)), [b])
//
// [output]
// __spreadArray(__spreadArray([], a), [b])
//
// NOTE: We use `isPackedArrayLiteral` below rather than just `isArrayLiteral`
// because ES2015 spread will replace _missing_ array elements with `undefined`,
// so we cannot just use an array as is. For example:
//
// `[1, ...[2, , 3]]` becomes `[1, 2, undefined, 3]`
//
// However, for packed array literals (i.e., an array literal with no OmittedExpression
// elements), we can use the array as-is.
// Map spans of spread expressions into their expressions and spans of other
// expressions into an array literal.
var numElements = elements.length;
var segments = ts.flatten(
// As we visit each element, we return one of two functions to use as the "key":
// - `visitSpanOfSpreads` for one or more contiguous `...` spread expressions, i.e. `...a, ...b` in `[1, 2, ...a, ...b]`
// - `visitSpanOfNonSpreads` for one or more contiguous non-spread elements, i.e. `1, 2`, in `[1, 2, ...a, ...b]`
ts.spanMap(elements, partitionSpread, function (partition, visitPartition, _start, end) {
return visitPartition(partition, multiLine, hasTrailingComma && end === numElements);
}));
if (segments.length === 1) {
var firstSegment = segments[0];
// If we don't need a unique copy, then we are spreading into an argument list for
// a CallExpression or NewExpression. When using `--downlevelIteration`, we need
// to coerce this into an array for use with `apply`, so we will use the code path
// that follows instead.
if (isArgumentList && !compilerOptions.downlevelIteration
|| ts.isPackedArrayLiteral(firstSegment.expression) // see NOTE (above)
|| ts.isCallToHelper(firstSegment.expression, "___spreadArray")) {
return firstSegment.expression;
}
}
var helpers = emitHelpers();
var startsWithSpread = segments[0].kind !== 0 /* None */;
var expression = startsWithSpread ? factory.createArrayLiteralExpression() :
segments[0].expression;
for (var i = startsWithSpread ? 0 : 1; i < segments.length; i++) {
var segment = segments[i];
// If this is for an argument list, it doesn't matter if the array is packed or sparse
expression = helpers.createSpreadArrayHelper(expression, segment.expression, segment.kind === 1 /* UnpackedSpread */ && !isArgumentList);
}
return expression;
}
function partitionSpread(node) {
return ts.isSpreadElement(node)
? visitSpanOfSpreads
: visitSpanOfNonSpreads;
}
function visitSpanOfSpreads(chunk) {
return ts.map(chunk, visitExpressionOfSpread);
}
function visitExpressionOfSpread(node) {
var expression = ts.visitNode(node.expression, visitor, ts.isExpression);
// We don't need to pack already packed array literals, or existing calls to the `__read` helper.
var isCallToReadHelper = ts.isCallToHelper(expression, "___read");
var kind = isCallToReadHelper || ts.isPackedArrayLiteral(expression) ? 2 /* PackedSpread */ : 1 /* UnpackedSpread */;
// We don't need the `__read` helper for array literals. Array packing will be performed by `__spreadArray`.
if (compilerOptions.downlevelIteration && kind === 1 /* UnpackedSpread */ && !ts.isArrayLiteralExpression(expression) && !isCallToReadHelper) {
expression = emitHelpers().createReadHelper(expression, /*count*/ undefined);
// the `__read` helper returns a packed array, so we don't need to ensure a packed array
kind = 2 /* PackedSpread */;
}
return createSpreadSegment(kind, expression);
}
function visitSpanOfNonSpreads(chunk, multiLine, hasTrailingComma) {
var expression = factory.createArrayLiteralExpression(ts.visitNodes(factory.createNodeArray(chunk, hasTrailingComma), visitor, ts.isExpression), multiLine);
// We do not pack non-spread segments, this is so that `[1, , ...[2, , 3], , 4]` is properly downleveled to
// `[1, , 2, undefined, 3, , 4]`. See the NOTE in `transformAndSpreadElements`
return createSpreadSegment(0 /* None */, expression);
}
function visitSpreadElement(node) {
return ts.visitNode(node.expression, visitor, ts.isExpression);
}
/**
* Visits a template literal.
*
* @param node A template literal.
*/
function visitTemplateLiteral(node) {
return ts.setTextRange(factory.createStringLiteral(node.text), node);
}
/**
* Visits a string literal with an extended unicode escape.
*
* @param node A string literal.
*/
function visitStringLiteral(node) {
if (node.hasExtendedUnicodeEscape) {
return ts.setTextRange(factory.createStringLiteral(node.text), node);
}
return node;
}
/**
* Visits a binary or octal (ES6) numeric literal.
*
* @param node A string literal.
*/
function visitNumericLiteral(node) {
if (node.numericLiteralFlags & 384 /* BinaryOrOctalSpecifier */) {
return ts.setTextRange(factory.createNumericLiteral(node.text), node);
}
return node;
}
/**
* Visits a TaggedTemplateExpression node.
*
* @param node A TaggedTemplateExpression node.
*/
function visitTaggedTemplateExpression(node) {
return ts.processTaggedTemplateExpression(context, node, visitor, currentSourceFile, recordTaggedTemplateString, ts.ProcessLevel.All);
}
/**
* Visits a TemplateExpression node.
*
* @param node A TemplateExpression node.
*/
function visitTemplateExpression(node) {
var expressions = [];
addTemplateHead(expressions, node);
addTemplateSpans(expressions, node);
// createAdd will check if each expression binds less closely than binary '+'.
// If it does, it wraps the expression in parentheses. Otherwise, something like
// `abc${ 1 << 2 }`
// becomes
// "abc" + 1 << 2 + ""
// which is really
// ("abc" + 1) << (2 + "")
// rather than
// "abc" + (1 << 2) + ""
var expression = ts.reduceLeft(expressions, factory.createAdd);
if (ts.nodeIsSynthesized(expression)) {
ts.setTextRange(expression, node);
}
return expression;
}
/**
* Gets a value indicating whether we need to include the head of a TemplateExpression.
*
* @param node A TemplateExpression node.
*/
function shouldAddTemplateHead(node) {
// If this expression has an empty head literal and the first template span has a non-empty
// literal, then emitting the empty head literal is not necessary.
// `${ foo } and ${ bar }`
// can be emitted as
// foo + " and " + bar
// This is because it is only required that one of the first two operands in the emit
// output must be a string literal, so that the other operand and all following operands
// are forced into strings.
//
// If the first template span has an empty literal, then the head must still be emitted.
// `${ foo }${ bar }`
// must still be emitted as
// "" + foo + bar
// There is always atleast one templateSpan in this code path, since
// NoSubstitutionTemplateLiterals are directly emitted via emitLiteral()
ts.Debug.assert(node.templateSpans.length !== 0);
return node.head.text.length !== 0 || node.templateSpans[0].literal.text.length === 0;
}
/**
* Adds the head of a TemplateExpression to an array of expressions.
*
* @param expressions An array of expressions.
* @param node A TemplateExpression node.
*/
function addTemplateHead(expressions, node) {
if (!shouldAddTemplateHead(node)) {
return;
}
expressions.push(factory.createStringLiteral(node.head.text));
}
/**
* Visits and adds the template spans of a TemplateExpression to an array of expressions.
*
* @param expressions An array of expressions.
* @param node A TemplateExpression node.
*/
function addTemplateSpans(expressions, node) {
for (var _i = 0, _a = node.templateSpans; _i < _a.length; _i++) {
var span = _a[_i];
expressions.push(ts.visitNode(span.expression, visitor, ts.isExpression));
// Only emit if the literal is non-empty.
// The binary '+' operator is left-associative, so the first string concatenation
// with the head will force the result up to this point to be a string.
// Emitting a '+ ""' has no semantic effect for middles and tails.
if (span.literal.text.length !== 0) {
expressions.push(factory.createStringLiteral(span.literal.text));
}
}
}
/**
* Visits the `super` keyword
*/
function visitSuperKeyword(isExpressionOfCall) {
return hierarchyFacts & 8 /* NonStaticClassElement */
&& !isExpressionOfCall
? factory.createPropertyAccessExpression(factory.createUniqueName("_super", 16 /* Optimistic */ | 32 /* FileLevel */), "prototype")
: factory.createUniqueName("_super", 16 /* Optimistic */ | 32 /* FileLevel */);
}
function visitMetaProperty(node) {
if (node.keywordToken === 103 /* NewKeyword */ && node.name.escapedText === "target") {
hierarchyFacts |= 32768 /* NewTarget */;
return factory.createUniqueName("_newTarget", 16 /* Optimistic */ | 32 /* FileLevel */);
}
return node;
}
/**
* Called by the printer just before a node is printed.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to be printed.
* @param emitCallback The callback used to emit the node.
*/
function onEmitNode(hint, node, emitCallback) {
if (enabledSubstitutions & 1 /* CapturedThis */ && ts.isFunctionLike(node)) {
// If we are tracking a captured `this`, keep track of the enclosing function.
var ancestorFacts = enterSubtree(32670 /* FunctionExcludes */, ts.getEmitFlags(node) & 8 /* CapturesThis */
? 65 /* FunctionIncludes */ | 16 /* CapturesThis */
: 65 /* FunctionIncludes */);
previousOnEmitNode(hint, node, emitCallback);
exitSubtree(ancestorFacts, 0 /* None */, 0 /* None */);
return;
}
previousOnEmitNode(hint, node, emitCallback);
}
/**
* Enables a more costly code path for substitutions when we determine a source file
* contains block-scoped bindings (e.g. `let` or `const`).
*/
function enableSubstitutionsForBlockScopedBindings() {
if ((enabledSubstitutions & 2 /* BlockScopedBindings */) === 0) {
enabledSubstitutions |= 2 /* BlockScopedBindings */;
context.enableSubstitution(79 /* Identifier */);
}
}
/**
* Enables a more costly code path for substitutions when we determine a source file
* contains a captured `this`.
*/
function enableSubstitutionsForCapturedThis() {
if ((enabledSubstitutions & 1 /* CapturedThis */) === 0) {
enabledSubstitutions |= 1 /* CapturedThis */;
context.enableSubstitution(108 /* ThisKeyword */);
context.enableEmitNotification(169 /* Constructor */);
context.enableEmitNotification(167 /* MethodDeclaration */);
context.enableEmitNotification(170 /* GetAccessor */);
context.enableEmitNotification(171 /* SetAccessor */);
context.enableEmitNotification(212 /* ArrowFunction */);
context.enableEmitNotification(211 /* FunctionExpression */);
context.enableEmitNotification(254 /* FunctionDeclaration */);
}
}
/**
* Hooks node substitutions.
*
* @param hint The context for the emitter.
* @param node The node to substitute.
*/
function onSubstituteNode(hint, node) {
node = previousOnSubstituteNode(hint, node);
if (hint === 1 /* Expression */) {
return substituteExpression(node);
}
if (ts.isIdentifier(node)) {
return substituteIdentifier(node);
}
return node;
}
/**
* Hooks substitutions for non-expression identifiers.
*/
function substituteIdentifier(node) {
// Only substitute the identifier if we have enabled substitutions for block-scoped
// bindings.
if (enabledSubstitutions & 2 /* BlockScopedBindings */ && !ts.isInternalName(node)) {
var original = ts.getParseTreeNode(node, ts.isIdentifier);
if (original && isNameOfDeclarationWithCollidingName(original)) {
return ts.setTextRange(factory.getGeneratedNameForNode(original), node);
}
}
return node;
}
/**
* Determines whether a name is the name of a declaration with a colliding name.
* NOTE: This function expects to be called with an original source tree node.
*
* @param node An original source tree node.
*/
function isNameOfDeclarationWithCollidingName(node) {
switch (node.parent.kind) {
case 201 /* BindingElement */:
case 255 /* ClassDeclaration */:
case 258 /* EnumDeclaration */:
case 252 /* VariableDeclaration */:
return node.parent.name === node
&& resolver.isDeclarationWithCollidingName(node.parent);
}
return false;
}
/**
* Substitutes an expression.
*
* @param node An Expression node.
*/
function substituteExpression(node) {
switch (node.kind) {
case 79 /* Identifier */:
return substituteExpressionIdentifier(node);
case 108 /* ThisKeyword */:
return substituteThisKeyword(node);
}
return node;
}
/**
* Substitutes an expression identifier.
*
* @param node An Identifier node.
*/
function substituteExpressionIdentifier(node) {
if (enabledSubstitutions & 2 /* BlockScopedBindings */ && !ts.isInternalName(node)) {
var declaration = resolver.getReferencedDeclarationWithCollidingName(node);
if (declaration && !(ts.isClassLike(declaration) && isPartOfClassBody(declaration, node))) {
return ts.setTextRange(factory.getGeneratedNameForNode(ts.getNameOfDeclaration(declaration)), node);
}
}
return node;
}
function isPartOfClassBody(declaration, node) {
var currentNode = ts.getParseTreeNode(node);
if (!currentNode || currentNode === declaration || currentNode.end <= declaration.pos || currentNode.pos >= declaration.end) {
// if the node has no correlation to a parse tree node, its definitely not
// part of the body.
// if the node is outside of the document range of the declaration, its
// definitely not part of the body.
return false;
}
var blockScope = ts.getEnclosingBlockScopeContainer(declaration);
while (currentNode) {
if (currentNode === blockScope || currentNode === declaration) {
// if we are in the enclosing block scope of the declaration, we are definitely
// not inside the class body.
return false;
}
if (ts.isClassElement(currentNode) && currentNode.parent === declaration) {
return true;
}
currentNode = currentNode.parent;
}
return false;
}
/**
* Substitutes `this` when contained within an arrow function.
*
* @param node The ThisKeyword node.
*/
function substituteThisKeyword(node) {
if (enabledSubstitutions & 1 /* CapturedThis */
&& hierarchyFacts & 16 /* CapturesThis */) {
return ts.setTextRange(factory.createUniqueName("_this", 16 /* Optimistic */ | 32 /* FileLevel */), node);
}
return node;
}
function getClassMemberPrefix(node, member) {
return ts.isStatic(member)
? factory.getInternalName(node)
: factory.createPropertyAccessExpression(factory.getInternalName(node), "prototype");
}
function hasSynthesizedDefaultSuperCall(constructor, hasExtendsClause) {
if (!constructor || !hasExtendsClause) {
return false;
}
if (ts.some(constructor.parameters)) {
return false;
}
var statement = ts.firstOrUndefined(constructor.body.statements);
if (!statement || !ts.nodeIsSynthesized(statement) || statement.kind !== 236 /* ExpressionStatement */) {
return false;
}
var statementExpression = statement.expression;
if (!ts.nodeIsSynthesized(statementExpression) || statementExpression.kind !== 206 /* CallExpression */) {
return false;
}
var callTarget = statementExpression.expression;
if (!ts.nodeIsSynthesized(callTarget) || callTarget.kind !== 106 /* SuperKeyword */) {
return false;
}
var callArgument = ts.singleOrUndefined(statementExpression.arguments);
if (!callArgument || !ts.nodeIsSynthesized(callArgument) || callArgument.kind !== 223 /* SpreadElement */) {
return false;
}
var expression = callArgument.expression;
return ts.isIdentifier(expression) && expression.escapedText === "arguments";
}
}
ts.transformES2015 = transformES2015;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
/**
* Transforms ES5 syntax into ES3 syntax.
*
* @param context Context and state information for the transformation.
*/
function transformES5(context) {
var factory = context.factory;
var compilerOptions = context.getCompilerOptions();
// enable emit notification only if using --jsx preserve or react-native
var previousOnEmitNode;
var noSubstitution;
if (compilerOptions.jsx === 1 /* Preserve */ || compilerOptions.jsx === 3 /* ReactNative */) {
previousOnEmitNode = context.onEmitNode;
context.onEmitNode = onEmitNode;
context.enableEmitNotification(278 /* JsxOpeningElement */);
context.enableEmitNotification(279 /* JsxClosingElement */);
context.enableEmitNotification(277 /* JsxSelfClosingElement */);
noSubstitution = [];
}
var previousOnSubstituteNode = context.onSubstituteNode;
context.onSubstituteNode = onSubstituteNode;
context.enableSubstitution(204 /* PropertyAccessExpression */);
context.enableSubstitution(291 /* PropertyAssignment */);
return ts.chainBundle(context, transformSourceFile);
/**
* Transforms an ES5 source file to ES3.
*
* @param node A SourceFile
*/
function transformSourceFile(node) {
return node;
}
/**
* Called by the printer just before a node is printed.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to emit.
* @param emitCallback A callback used to emit the node.
*/
function onEmitNode(hint, node, emitCallback) {
switch (node.kind) {
case 278 /* JsxOpeningElement */:
case 279 /* JsxClosingElement */:
case 277 /* JsxSelfClosingElement */:
var tagName = node.tagName;
noSubstitution[ts.getOriginalNodeId(tagName)] = true;
break;
}
previousOnEmitNode(hint, node, emitCallback);
}
/**
* Hooks node substitutions.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to substitute.
*/
function onSubstituteNode(hint, node) {
if (node.id && noSubstitution && noSubstitution[node.id]) {
return previousOnSubstituteNode(hint, node);
}
node = previousOnSubstituteNode(hint, node);
if (ts.isPropertyAccessExpression(node)) {
return substitutePropertyAccessExpression(node);
}
else if (ts.isPropertyAssignment(node)) {
return substitutePropertyAssignment(node);
}
return node;
}
/**
* Substitutes a PropertyAccessExpression whose name is a reserved word.
*
* @param node A PropertyAccessExpression
*/
function substitutePropertyAccessExpression(node) {
if (ts.isPrivateIdentifier(node.name)) {
return node;
}
var literalName = trySubstituteReservedName(node.name);
if (literalName) {
return ts.setTextRange(factory.createElementAccessExpression(node.expression, literalName), node);
}
return node;
}
/**
* Substitutes a PropertyAssignment whose name is a reserved word.
*
* @param node A PropertyAssignment
*/
function substitutePropertyAssignment(node) {
var literalName = ts.isIdentifier(node.name) && trySubstituteReservedName(node.name);
if (literalName) {
return factory.updatePropertyAssignment(node, literalName, node.initializer);
}
return node;
}
/**
* If an identifier name is a reserved word, returns a string literal for the name.
*
* @param name An Identifier
*/
function trySubstituteReservedName(name) {
var token = name.originalKeywordKind || (ts.nodeIsSynthesized(name) ? ts.stringToToken(ts.idText(name)) : undefined);
if (token !== undefined && token >= 81 /* FirstReservedWord */ && token <= 116 /* LastReservedWord */) {
return ts.setTextRange(factory.createStringLiteralFromNode(name), name);
}
return undefined;
}
}
ts.transformES5 = transformES5;
})(ts || (ts = {}));
// Transforms generator functions into a compatible ES5 representation with similar runtime
// semantics. This is accomplished by first transforming the body of each generator
// function into an intermediate representation that is the compiled into a JavaScript
// switch statement.
//
// Many functions in this transformer will contain comments indicating the expected
// intermediate representation. For illustrative purposes, the following intermediate
// language is used to define this intermediate representation:
//
// .nop - Performs no operation.
// .local NAME, ... - Define local variable declarations.
// .mark LABEL - Mark the location of a label.
// .br LABEL - Jump to a label. If jumping out of a protected
// region, all .finally blocks are executed.
// .brtrue LABEL, (x) - Jump to a label IIF the expression `x` is truthy.
// If jumping out of a protected region, all .finally
// blocks are executed.
// .brfalse LABEL, (x) - Jump to a label IIF the expression `x` is falsey.
// If jumping out of a protected region, all .finally
// blocks are executed.
// .yield (x) - Yield the value of the optional expression `x`.
// Resume at the next label.
// .yieldstar (x) - Delegate yield to the value of the optional
// expression `x`. Resume at the next label.
// NOTE: `x` must be an Iterator, not an Iterable.
// .loop CONTINUE, BREAK - Marks the beginning of a loop. Any "continue" or
// "break" abrupt completions jump to the CONTINUE or
// BREAK labels, respectively.
// .endloop - Marks the end of a loop.
// .with (x) - Marks the beginning of a WithStatement block, using
// the supplied expression.
// .endwith - Marks the end of a WithStatement.
// .switch - Marks the beginning of a SwitchStatement.
// .endswitch - Marks the end of a SwitchStatement.
// .labeled NAME - Marks the beginning of a LabeledStatement with the
// supplied name.
// .endlabeled - Marks the end of a LabeledStatement.
// .try TRY, CATCH, FINALLY, END - Marks the beginning of a protected region, and the
// labels for each block.
// .catch (x) - Marks the beginning of a catch block.
// .finally - Marks the beginning of a finally block.
// .endfinally - Marks the end of a finally block.
// .endtry - Marks the end of a protected region.
// .throw (x) - Throws the value of the expression `x`.
// .return (x) - Returns the value of the expression `x`.
//
// In addition, the illustrative intermediate representation introduces some special
// variables:
//
// %sent% - Either returns the next value sent to the generator,
// returns the result of a delegated yield, or throws
// the exception sent to the generator.
// %error% - Returns the value of the current exception in a
// catch block.
//
// This intermediate representation is then compiled into JavaScript syntax. The resulting
// compilation output looks something like the following:
//
// function f() {
// var /*locals*/;
// /*functions*/
// return __generator(function (state) {
// switch (state.label) {
// /*cases per label*/
// }
// });
// }
//
// Each of the above instructions corresponds to JavaScript emit similar to the following:
//
// .local NAME | var NAME;
// -------------------------------|----------------------------------------------
// .mark LABEL | case LABEL:
// -------------------------------|----------------------------------------------
// .br LABEL | return [3 /*break*/, LABEL];
// -------------------------------|----------------------------------------------
// .brtrue LABEL, (x) | if (x) return [3 /*break*/, LABEL];
// -------------------------------|----------------------------------------------
// .brfalse LABEL, (x) | if (!(x)) return [3, /*break*/, LABEL];
// -------------------------------|----------------------------------------------
// .yield (x) | return [4 /*yield*/, x];
// .mark RESUME | case RESUME:
// a = %sent%; | a = state.sent();
// -------------------------------|----------------------------------------------
// .yieldstar (x) | return [5 /*yield**/, x];
// .mark RESUME | case RESUME:
// a = %sent%; | a = state.sent();
// -------------------------------|----------------------------------------------
// .with (_a) | with (_a) {
// a(); | a();
// | }
// | state.label = LABEL;
// .mark LABEL | case LABEL:
// | with (_a) {
// b(); | b();
// | }
// .endwith |
// -------------------------------|----------------------------------------------
// | case 0:
// | state.trys = [];
// | ...
// .try TRY, CATCH, FINALLY, END |
// .mark TRY | case TRY:
// | state.trys.push([TRY, CATCH, FINALLY, END]);
// .nop |
// a(); | a();
// .br END | return [3 /*break*/, END];
// .catch (e) |
// .mark CATCH | case CATCH:
// | e = state.sent();
// b(); | b();
// .br END | return [3 /*break*/, END];
// .finally |
// .mark FINALLY | case FINALLY:
// c(); | c();
// .endfinally | return [7 /*endfinally*/];
// .endtry |
// .mark END | case END:
/*@internal*/
var ts;
(function (ts) {
var OpCode;
(function (OpCode) {
OpCode[OpCode["Nop"] = 0] = "Nop";
OpCode[OpCode["Statement"] = 1] = "Statement";
OpCode[OpCode["Assign"] = 2] = "Assign";
OpCode[OpCode["Break"] = 3] = "Break";
OpCode[OpCode["BreakWhenTrue"] = 4] = "BreakWhenTrue";
OpCode[OpCode["BreakWhenFalse"] = 5] = "BreakWhenFalse";
OpCode[OpCode["Yield"] = 6] = "Yield";
OpCode[OpCode["YieldStar"] = 7] = "YieldStar";
OpCode[OpCode["Return"] = 8] = "Return";
OpCode[OpCode["Throw"] = 9] = "Throw";
OpCode[OpCode["Endfinally"] = 10] = "Endfinally"; // Marks the end of a `finally` block
})(OpCode || (OpCode = {}));
// whether a generated code block is opening or closing at the current operation for a FunctionBuilder
var BlockAction;
(function (BlockAction) {
BlockAction[BlockAction["Open"] = 0] = "Open";
BlockAction[BlockAction["Close"] = 1] = "Close";
})(BlockAction || (BlockAction = {}));
// the kind for a generated code block in a FunctionBuilder
var CodeBlockKind;
(function (CodeBlockKind) {
CodeBlockKind[CodeBlockKind["Exception"] = 0] = "Exception";
CodeBlockKind[CodeBlockKind["With"] = 1] = "With";
CodeBlockKind[CodeBlockKind["Switch"] = 2] = "Switch";
CodeBlockKind[CodeBlockKind["Loop"] = 3] = "Loop";
CodeBlockKind[CodeBlockKind["Labeled"] = 4] = "Labeled";
})(CodeBlockKind || (CodeBlockKind = {}));
// the state for a generated code exception block
var ExceptionBlockState;
(function (ExceptionBlockState) {
ExceptionBlockState[ExceptionBlockState["Try"] = 0] = "Try";
ExceptionBlockState[ExceptionBlockState["Catch"] = 1] = "Catch";
ExceptionBlockState[ExceptionBlockState["Finally"] = 2] = "Finally";
ExceptionBlockState[ExceptionBlockState["Done"] = 3] = "Done";
})(ExceptionBlockState || (ExceptionBlockState = {}));
// NOTE: changes to this enum should be reflected in the __generator helper.
var Instruction;
(function (Instruction) {
Instruction[Instruction["Next"] = 0] = "Next";
Instruction[Instruction["Throw"] = 1] = "Throw";
Instruction[Instruction["Return"] = 2] = "Return";
Instruction[Instruction["Break"] = 3] = "Break";
Instruction[Instruction["Yield"] = 4] = "Yield";
Instruction[Instruction["YieldStar"] = 5] = "YieldStar";
Instruction[Instruction["Catch"] = 6] = "Catch";
Instruction[Instruction["Endfinally"] = 7] = "Endfinally";
})(Instruction || (Instruction = {}));
function getInstructionName(instruction) {
switch (instruction) {
case 2 /* Return */: return "return";
case 3 /* Break */: return "break";
case 4 /* Yield */: return "yield";
case 5 /* YieldStar */: return "yield*";
case 7 /* Endfinally */: return "endfinally";
default: return undefined; // TODO: GH#18217
}
}
function transformGenerators(context) {
var factory = context.factory, emitHelpers = context.getEmitHelperFactory, resumeLexicalEnvironment = context.resumeLexicalEnvironment, endLexicalEnvironment = context.endLexicalEnvironment, hoistFunctionDeclaration = context.hoistFunctionDeclaration, hoistVariableDeclaration = context.hoistVariableDeclaration;
var compilerOptions = context.getCompilerOptions();
var languageVersion = ts.getEmitScriptTarget(compilerOptions);
var resolver = context.getEmitResolver();
var previousOnSubstituteNode = context.onSubstituteNode;
context.onSubstituteNode = onSubstituteNode;
var renamedCatchVariables;
var renamedCatchVariableDeclarations;
var inGeneratorFunctionBody;
var inStatementContainingYield;
// The following three arrays store information about generated code blocks.
// All three arrays are correlated by their index. This approach is used over allocating
// objects to store the same information to avoid GC overhead.
//
var blocks; // Information about the code block
var blockOffsets; // The operation offset at which a code block begins or ends
var blockActions; // Whether the code block is opened or closed
var blockStack; // A stack of currently open code blocks
// Labels are used to mark locations in the code that can be the target of a Break (jump)
// operation. These are translated into case clauses in a switch statement.
// The following two arrays are correlated by their index. This approach is used over
// allocating objects to store the same information to avoid GC overhead.
//
var labelOffsets; // The operation offset at which the label is defined.
var labelExpressions; // The NumericLiteral nodes bound to each label.
var nextLabelId = 1; // The next label id to use.
// Operations store information about generated code for the function body. This
// Includes things like statements, assignments, breaks (jumps), and yields.
// The following three arrays are correlated by their index. This approach is used over
// allocating objects to store the same information to avoid GC overhead.
//
var operations; // The operation to perform.
var operationArguments; // The arguments to the operation.
var operationLocations; // The source map location for the operation.
var state; // The name of the state object used by the generator at runtime.
// The following variables store information used by the `build` function:
//
var blockIndex = 0; // The index of the current block.
var labelNumber = 0; // The current label number.
var labelNumbers;
var lastOperationWasAbrupt; // Indicates whether the last operation was abrupt (break/continue).
var lastOperationWasCompletion; // Indicates whether the last operation was a completion (return/throw).
var clauses; // The case clauses generated for labels.
var statements; // The statements for the current label.
var exceptionBlockStack; // A stack of containing exception blocks.
var currentExceptionBlock; // The current exception block.
var withBlockStack; // A stack containing `with` blocks.
return ts.chainBundle(context, transformSourceFile);
function transformSourceFile(node) {
if (node.isDeclarationFile || (node.transformFlags & 1024 /* ContainsGenerator */) === 0) {
return node;
}
var visited = ts.visitEachChild(node, visitor, context);
ts.addEmitHelpers(visited, context.readEmitHelpers());
return visited;
}
/**
* Visits a node.
*
* @param node The node to visit.
*/
function visitor(node) {
var transformFlags = node.transformFlags;
if (inStatementContainingYield) {
return visitJavaScriptInStatementContainingYield(node);
}
else if (inGeneratorFunctionBody) {
return visitJavaScriptInGeneratorFunctionBody(node);
}
else if (ts.isFunctionLikeDeclaration(node) && node.asteriskToken) {
return visitGenerator(node);
}
else if (transformFlags & 1024 /* ContainsGenerator */) {
return ts.visitEachChild(node, visitor, context);
}
else {
return node;
}
}
/**
* Visits a node that is contained within a statement that contains yield.
*
* @param node The node to visit.
*/
function visitJavaScriptInStatementContainingYield(node) {
switch (node.kind) {
case 238 /* DoStatement */:
return visitDoStatement(node);
case 239 /* WhileStatement */:
return visitWhileStatement(node);
case 247 /* SwitchStatement */:
return visitSwitchStatement(node);
case 248 /* LabeledStatement */:
return visitLabeledStatement(node);
default:
return visitJavaScriptInGeneratorFunctionBody(node);
}
}
/**
* Visits a node that is contained within a generator function.
*
* @param node The node to visit.
*/
function visitJavaScriptInGeneratorFunctionBody(node) {
switch (node.kind) {
case 254 /* FunctionDeclaration */:
return visitFunctionDeclaration(node);
case 211 /* FunctionExpression */:
return visitFunctionExpression(node);
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return visitAccessorDeclaration(node);
case 235 /* VariableStatement */:
return visitVariableStatement(node);
case 240 /* ForStatement */:
return visitForStatement(node);
case 241 /* ForInStatement */:
return visitForInStatement(node);
case 244 /* BreakStatement */:
return visitBreakStatement(node);
case 243 /* ContinueStatement */:
return visitContinueStatement(node);
case 245 /* ReturnStatement */:
return visitReturnStatement(node);
default:
if (node.transformFlags & 524288 /* ContainsYield */) {
return visitJavaScriptContainingYield(node);
}
else if (node.transformFlags & (1024 /* ContainsGenerator */ | 2097152 /* ContainsHoistedDeclarationOrCompletion */)) {
return ts.visitEachChild(node, visitor, context);
}
else {
return node;
}
}
}
/**
* Visits a node that contains a YieldExpression.
*
* @param node The node to visit.
*/
function visitJavaScriptContainingYield(node) {
switch (node.kind) {
case 219 /* BinaryExpression */:
return visitBinaryExpression(node);
case 346 /* CommaListExpression */:
return visitCommaListExpression(node);
case 220 /* ConditionalExpression */:
return visitConditionalExpression(node);
case 222 /* YieldExpression */:
return visitYieldExpression(node);
case 202 /* ArrayLiteralExpression */:
return visitArrayLiteralExpression(node);
case 203 /* ObjectLiteralExpression */:
return visitObjectLiteralExpression(node);
case 205 /* ElementAccessExpression */:
return visitElementAccessExpression(node);
case 206 /* CallExpression */:
return visitCallExpression(node);
case 207 /* NewExpression */:
return visitNewExpression(node);
default:
return ts.visitEachChild(node, visitor, context);
}
}
/**
* Visits a generator function.
*
* @param node The node to visit.
*/
function visitGenerator(node) {
switch (node.kind) {
case 254 /* FunctionDeclaration */:
return visitFunctionDeclaration(node);
case 211 /* FunctionExpression */:
return visitFunctionExpression(node);
default:
return ts.Debug.failBadSyntaxKind(node);
}
}
/**
* Visits a function declaration.
*
* This will be called when one of the following conditions are met:
* - The function declaration is a generator function.
* - The function declaration is contained within the body of a generator function.
*
* @param node The node to visit.
*/
function visitFunctionDeclaration(node) {
// Currently, we only support generators that were originally async functions.
if (node.asteriskToken) {
node = ts.setOriginalNode(ts.setTextRange(factory.createFunctionDeclaration(
/*decorators*/ undefined, node.modifiers,
/*asteriskToken*/ undefined, node.name,
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, transformGeneratorFunctionBody(node.body)),
/*location*/ node), node);
}
else {
var savedInGeneratorFunctionBody = inGeneratorFunctionBody;
var savedInStatementContainingYield = inStatementContainingYield;
inGeneratorFunctionBody = false;
inStatementContainingYield = false;
node = ts.visitEachChild(node, visitor, context);
inGeneratorFunctionBody = savedInGeneratorFunctionBody;
inStatementContainingYield = savedInStatementContainingYield;
}
if (inGeneratorFunctionBody) {
// Function declarations in a generator function body are hoisted
// to the top of the lexical scope and elided from the current statement.
hoistFunctionDeclaration(node);
return undefined;
}
else {
return node;
}
}
/**
* Visits a function expression.
*
* This will be called when one of the following conditions are met:
* - The function expression is a generator function.
* - The function expression is contained within the body of a generator function.
*
* @param node The node to visit.
*/
function visitFunctionExpression(node) {
// Currently, we only support generators that were originally async functions.
if (node.asteriskToken) {
node = ts.setOriginalNode(ts.setTextRange(factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined, node.name,
/*typeParameters*/ undefined, ts.visitParameterList(node.parameters, visitor, context),
/*type*/ undefined, transformGeneratorFunctionBody(node.body)),
/*location*/ node), node);
}
else {
var savedInGeneratorFunctionBody = inGeneratorFunctionBody;
var savedInStatementContainingYield = inStatementContainingYield;
inGeneratorFunctionBody = false;
inStatementContainingYield = false;
node = ts.visitEachChild(node, visitor, context);
inGeneratorFunctionBody = savedInGeneratorFunctionBody;
inStatementContainingYield = savedInStatementContainingYield;
}
return node;
}
/**
* Visits a get or set accessor declaration.
*
* This will be called when one of the following conditions are met:
* - The accessor is contained within the body of a generator function.
*
* @param node The node to visit.
*/
function visitAccessorDeclaration(node) {
var savedInGeneratorFunctionBody = inGeneratorFunctionBody;
var savedInStatementContainingYield = inStatementContainingYield;
inGeneratorFunctionBody = false;
inStatementContainingYield = false;
node = ts.visitEachChild(node, visitor, context);
inGeneratorFunctionBody = savedInGeneratorFunctionBody;
inStatementContainingYield = savedInStatementContainingYield;
return node;
}
/**
* Transforms the body of a generator function declaration.
*
* @param node The function body to transform.
*/
function transformGeneratorFunctionBody(body) {
// Save existing generator state
var statements = [];
var savedInGeneratorFunctionBody = inGeneratorFunctionBody;
var savedInStatementContainingYield = inStatementContainingYield;
var savedBlocks = blocks;
var savedBlockOffsets = blockOffsets;
var savedBlockActions = blockActions;
var savedBlockStack = blockStack;
var savedLabelOffsets = labelOffsets;
var savedLabelExpressions = labelExpressions;
var savedNextLabelId = nextLabelId;
var savedOperations = operations;
var savedOperationArguments = operationArguments;
var savedOperationLocations = operationLocations;
var savedState = state;
// Initialize generator state
inGeneratorFunctionBody = true;
inStatementContainingYield = false;
blocks = undefined;
blockOffsets = undefined;
blockActions = undefined;
blockStack = undefined;
labelOffsets = undefined;
labelExpressions = undefined;
nextLabelId = 1;
operations = undefined;
operationArguments = undefined;
operationLocations = undefined;
state = factory.createTempVariable(/*recordTempVariable*/ undefined);
// Build the generator
resumeLexicalEnvironment();
var statementOffset = factory.copyPrologue(body.statements, statements, /*ensureUseStrict*/ false, visitor);
transformAndEmitStatements(body.statements, statementOffset);
var buildResult = build();
ts.insertStatementsAfterStandardPrologue(statements, endLexicalEnvironment());
statements.push(factory.createReturnStatement(buildResult));
// Restore previous generator state
inGeneratorFunctionBody = savedInGeneratorFunctionBody;
inStatementContainingYield = savedInStatementContainingYield;
blocks = savedBlocks;
blockOffsets = savedBlockOffsets;
blockActions = savedBlockActions;
blockStack = savedBlockStack;
labelOffsets = savedLabelOffsets;
labelExpressions = savedLabelExpressions;
nextLabelId = savedNextLabelId;
operations = savedOperations;
operationArguments = savedOperationArguments;
operationLocations = savedOperationLocations;
state = savedState;
return ts.setTextRange(factory.createBlock(statements, body.multiLine), body);
}
/**
* Visits a variable statement.
*
* This will be called when one of the following conditions are met:
* - The variable statement is contained within the body of a generator function.
*
* @param node The node to visit.
*/
function visitVariableStatement(node) {
if (node.transformFlags & 524288 /* ContainsYield */) {
transformAndEmitVariableDeclarationList(node.declarationList);
return undefined;
}
else {
// Do not hoist custom prologues.
if (ts.getEmitFlags(node) & 1048576 /* CustomPrologue */) {
return node;
}
for (var _i = 0, _a = node.declarationList.declarations; _i < _a.length; _i++) {
var variable = _a[_i];
hoistVariableDeclaration(variable.name);
}
var variables = ts.getInitializedVariables(node.declarationList);
if (variables.length === 0) {
return undefined;
}
return ts.setSourceMapRange(factory.createExpressionStatement(factory.inlineExpressions(ts.map(variables, transformInitializedVariable))), node);
}
}
/**
* Visits a binary expression.
*
* This will be called when one of the following conditions are met:
* - The node contains a YieldExpression.
*
* @param node The node to visit.
*/
function visitBinaryExpression(node) {
var assoc = ts.getExpressionAssociativity(node);
switch (assoc) {
case 0 /* Left */:
return visitLeftAssociativeBinaryExpression(node);
case 1 /* Right */:
return visitRightAssociativeBinaryExpression(node);
default:
return ts.Debug.assertNever(assoc);
}
}
/**
* Visits a right-associative binary expression containing `yield`.
*
* @param node The node to visit.
*/
function visitRightAssociativeBinaryExpression(node) {
var left = node.left, right = node.right;
if (containsYield(right)) {
var target = void 0;
switch (left.kind) {
case 204 /* PropertyAccessExpression */:
// [source]
// a.b = yield;
//
// [intermediate]
// .local _a
// _a = a;
// .yield resumeLabel
// .mark resumeLabel
// _a.b = %sent%;
target = factory.updatePropertyAccessExpression(left, cacheExpression(ts.visitNode(left.expression, visitor, ts.isLeftHandSideExpression)), left.name);
break;
case 205 /* ElementAccessExpression */:
// [source]
// a[b] = yield;
//
// [intermediate]
// .local _a, _b
// _a = a;
// _b = b;
// .yield resumeLabel
// .mark resumeLabel
// _a[_b] = %sent%;
target = factory.updateElementAccessExpression(left, cacheExpression(ts.visitNode(left.expression, visitor, ts.isLeftHandSideExpression)), cacheExpression(ts.visitNode(left.argumentExpression, visitor, ts.isExpression)));
break;
default:
target = ts.visitNode(left, visitor, ts.isExpression);
break;
}
var operator = node.operatorToken.kind;
if (ts.isCompoundAssignment(operator)) {
return ts.setTextRange(factory.createAssignment(target, ts.setTextRange(factory.createBinaryExpression(cacheExpression(target), ts.getNonAssignmentOperatorForCompoundAssignment(operator), ts.visitNode(right, visitor, ts.isExpression)), node)), node);
}
else {
return factory.updateBinaryExpression(node, target, node.operatorToken, ts.visitNode(right, visitor, ts.isExpression));
}
}
return ts.visitEachChild(node, visitor, context);
}
function visitLeftAssociativeBinaryExpression(node) {
if (containsYield(node.right)) {
if (ts.isLogicalOperator(node.operatorToken.kind)) {
return visitLogicalBinaryExpression(node);
}
else if (node.operatorToken.kind === 27 /* CommaToken */) {
return visitCommaExpression(node);
}
// [source]
// a() + (yield) + c()
//
// [intermediate]
// .local _a
// _a = a();
// .yield resumeLabel
// _a + %sent% + c()
return factory.updateBinaryExpression(node, cacheExpression(ts.visitNode(node.left, visitor, ts.isExpression)), node.operatorToken, ts.visitNode(node.right, visitor, ts.isExpression));
}
return ts.visitEachChild(node, visitor, context);
}
/**
* Visits a comma expression containing `yield`.
*
* @param node The node to visit.
*/
function visitCommaExpression(node) {
// [source]
// x = a(), yield, b();
//
// [intermediate]
// a();
// .yield resumeLabel
// .mark resumeLabel
// x = %sent%, b();
var pendingExpressions = [];
visit(node.left);
visit(node.right);
return factory.inlineExpressions(pendingExpressions);
function visit(node) {
if (ts.isBinaryExpression(node) && node.operatorToken.kind === 27 /* CommaToken */) {
visit(node.left);
visit(node.right);
}
else {
if (containsYield(node) && pendingExpressions.length > 0) {
emitWorker(1 /* Statement */, [factory.createExpressionStatement(factory.inlineExpressions(pendingExpressions))]);
pendingExpressions = [];
}
pendingExpressions.push(ts.visitNode(node, visitor, ts.isExpression));
}
}
}
/**
* Visits a comma-list expression.
*
* @param node The node to visit.
*/
function visitCommaListExpression(node) {
// flattened version of `visitCommaExpression`
var pendingExpressions = [];
for (var _i = 0, _a = node.elements; _i < _a.length; _i++) {
var elem = _a[_i];
if (ts.isBinaryExpression(elem) && elem.operatorToken.kind === 27 /* CommaToken */) {
pendingExpressions.push(visitCommaExpression(elem));
}
else {
if (containsYield(elem) && pendingExpressions.length > 0) {
emitWorker(1 /* Statement */, [factory.createExpressionStatement(factory.inlineExpressions(pendingExpressions))]);
pendingExpressions = [];
}
pendingExpressions.push(ts.visitNode(elem, visitor, ts.isExpression));
}
}
return factory.inlineExpressions(pendingExpressions);
}
/**
* Visits a logical binary expression containing `yield`.
*
* @param node A node to visit.
*/
function visitLogicalBinaryExpression(node) {
// Logical binary expressions (`&&` and `||`) are shortcutting expressions and need
// to be transformed as such:
//
// [source]
// x = a() && yield;
//
// [intermediate]
// .local _a
// _a = a();
// .brfalse resultLabel, (_a)
// .yield resumeLabel
// .mark resumeLabel
// _a = %sent%;
// .mark resultLabel
// x = _a;
//
// [source]
// x = a() || yield;
//
// [intermediate]
// .local _a
// _a = a();
// .brtrue resultLabel, (_a)
// .yield resumeLabel
// .mark resumeLabel
// _a = %sent%;
// .mark resultLabel
// x = _a;
var resultLabel = defineLabel();
var resultLocal = declareLocal();
emitAssignment(resultLocal, ts.visitNode(node.left, visitor, ts.isExpression), /*location*/ node.left);
if (node.operatorToken.kind === 55 /* AmpersandAmpersandToken */) {
// Logical `&&` shortcuts when the left-hand operand is falsey.
emitBreakWhenFalse(resultLabel, resultLocal, /*location*/ node.left);
}
else {
// Logical `||` shortcuts when the left-hand operand is truthy.
emitBreakWhenTrue(resultLabel, resultLocal, /*location*/ node.left);
}
emitAssignment(resultLocal, ts.visitNode(node.right, visitor, ts.isExpression), /*location*/ node.right);
markLabel(resultLabel);
return resultLocal;
}
/**
* Visits a conditional expression containing `yield`.
*
* @param node The node to visit.
*/
function visitConditionalExpression(node) {
// [source]
// x = a() ? yield : b();
//
// [intermediate]
// .local _a
// .brfalse whenFalseLabel, (a())
// .yield resumeLabel
// .mark resumeLabel
// _a = %sent%;
// .br resultLabel
// .mark whenFalseLabel
// _a = b();
// .mark resultLabel
// x = _a;
// We only need to perform a specific transformation if a `yield` expression exists
// in either the `whenTrue` or `whenFalse` branches.
// A `yield` in the condition will be handled by the normal visitor.
if (containsYield(node.whenTrue) || containsYield(node.whenFalse)) {
var whenFalseLabel = defineLabel();
var resultLabel = defineLabel();
var resultLocal = declareLocal();
emitBreakWhenFalse(whenFalseLabel, ts.visitNode(node.condition, visitor, ts.isExpression), /*location*/ node.condition);
emitAssignment(resultLocal, ts.visitNode(node.whenTrue, visitor, ts.isExpression), /*location*/ node.whenTrue);
emitBreak(resultLabel);
markLabel(whenFalseLabel);
emitAssignment(resultLocal, ts.visitNode(node.whenFalse, visitor, ts.isExpression), /*location*/ node.whenFalse);
markLabel(resultLabel);
return resultLocal;
}
return ts.visitEachChild(node, visitor, context);
}
/**
* Visits a `yield` expression.
*
* @param node The node to visit.
*/
function visitYieldExpression(node) {
// [source]
// x = yield a();
//
// [intermediate]
// .yield resumeLabel, (a())
// .mark resumeLabel
// x = %sent%;
var resumeLabel = defineLabel();
var expression = ts.visitNode(node.expression, visitor, ts.isExpression);
if (node.asteriskToken) {
// NOTE: `expression` must be defined for `yield*`.
var iterator = (ts.getEmitFlags(node.expression) & 8388608 /* Iterator */) === 0
? ts.setTextRange(emitHelpers().createValuesHelper(expression), node)
: expression;
emitYieldStar(iterator, /*location*/ node);
}
else {
emitYield(expression, /*location*/ node);
}
markLabel(resumeLabel);
return createGeneratorResume(/*location*/ node);
}
/**
* Visits an ArrayLiteralExpression that contains a YieldExpression.
*
* @param node The node to visit.
*/
function visitArrayLiteralExpression(node) {
return visitElements(node.elements, /*leadingElement*/ undefined, /*location*/ undefined, node.multiLine);
}
/**
* Visits an array of expressions containing one or more YieldExpression nodes
* and returns an expression for the resulting value.
*
* @param elements The elements to visit.
* @param multiLine Whether array literals created should be emitted on multiple lines.
*/
function visitElements(elements, leadingElement, location, multiLine) {
// [source]
// ar = [1, yield, 2];
//
// [intermediate]
// .local _a
// _a = [1];
// .yield resumeLabel
// .mark resumeLabel
// ar = _a.concat([%sent%, 2]);
var numInitialElements = countInitialNodesWithoutYield(elements);
var temp;
if (numInitialElements > 0) {
temp = declareLocal();
var initialElements = ts.visitNodes(elements, visitor, ts.isExpression, 0, numInitialElements);
emitAssignment(temp, factory.createArrayLiteralExpression(leadingElement
? __spreadArray([leadingElement], initialElements, true) : initialElements));
leadingElement = undefined;
}
var expressions = ts.reduceLeft(elements, reduceElement, [], numInitialElements);
return temp
? factory.createArrayConcatCall(temp, [factory.createArrayLiteralExpression(expressions, multiLine)])
: ts.setTextRange(factory.createArrayLiteralExpression(leadingElement ? __spreadArray([leadingElement], expressions, true) : expressions, multiLine), location);
function reduceElement(expressions, element) {
if (containsYield(element) && expressions.length > 0) {
var hasAssignedTemp = temp !== undefined;
if (!temp) {
temp = declareLocal();
}
emitAssignment(temp, hasAssignedTemp
? factory.createArrayConcatCall(temp, [factory.createArrayLiteralExpression(expressions, multiLine)])
: factory.createArrayLiteralExpression(leadingElement ? __spreadArray([leadingElement], expressions, true) : expressions, multiLine));
leadingElement = undefined;
expressions = [];
}
expressions.push(ts.visitNode(element, visitor, ts.isExpression));
return expressions;
}
}
function visitObjectLiteralExpression(node) {
// [source]
// o = {
// a: 1,
// b: yield,
// c: 2
// };
//
// [intermediate]
// .local _a
// _a = {
// a: 1
// };
// .yield resumeLabel
// .mark resumeLabel
// o = (_a.b = %sent%,
// _a.c = 2,
// _a);
var properties = node.properties;
var multiLine = node.multiLine;
var numInitialProperties = countInitialNodesWithoutYield(properties);
var temp = declareLocal();
emitAssignment(temp, factory.createObjectLiteralExpression(ts.visitNodes(properties, visitor, ts.isObjectLiteralElementLike, 0, numInitialProperties), multiLine));
var expressions = ts.reduceLeft(properties, reduceProperty, [], numInitialProperties);
// TODO(rbuckton): Does this need to be parented?
expressions.push(multiLine ? ts.startOnNewLine(ts.setParent(ts.setTextRange(factory.cloneNode(temp), temp), temp.parent)) : temp);
return factory.inlineExpressions(expressions);
function reduceProperty(expressions, property) {
if (containsYield(property) && expressions.length > 0) {
emitStatement(factory.createExpressionStatement(factory.inlineExpressions(expressions)));
expressions = [];
}
var expression = ts.createExpressionForObjectLiteralElementLike(factory, node, property, temp);
var visited = ts.visitNode(expression, visitor, ts.isExpression);
if (visited) {
if (multiLine) {
ts.startOnNewLine(visited);
}
expressions.push(visited);
}
return expressions;
}
}
/**
* Visits an ElementAccessExpression that contains a YieldExpression.
*
* @param node The node to visit.
*/
function visitElementAccessExpression(node) {
if (containsYield(node.argumentExpression)) {
// [source]
// a = x[yield];
//
// [intermediate]
// .local _a
// _a = x;
// .yield resumeLabel
// .mark resumeLabel
// a = _a[%sent%]
return factory.updateElementAccessExpression(node, cacheExpression(ts.visitNode(node.expression, visitor, ts.isLeftHandSideExpression)), ts.visitNode(node.argumentExpression, visitor, ts.isExpression));
}
return ts.visitEachChild(node, visitor, context);
}
function visitCallExpression(node) {
if (!ts.isImportCall(node) && ts.forEach(node.arguments, containsYield)) {
// [source]
// a.b(1, yield, 2);
//
// [intermediate]
// .local _a, _b, _c
// _b = (_a = a).b;
// _c = [1];
// .yield resumeLabel
// .mark resumeLabel
// _b.apply(_a, _c.concat([%sent%, 2]));
var _a = factory.createCallBinding(node.expression, hoistVariableDeclaration, languageVersion, /*cacheIdentifiers*/ true), target = _a.target, thisArg = _a.thisArg;
return ts.setOriginalNode(ts.setTextRange(factory.createFunctionApplyCall(cacheExpression(ts.visitNode(target, visitor, ts.isLeftHandSideExpression)), thisArg, visitElements(node.arguments)), node), node);
}
return ts.visitEachChild(node, visitor, context);
}
function visitNewExpression(node) {
if (ts.forEach(node.arguments, containsYield)) {
// [source]
// new a.b(1, yield, 2);
//
// [intermediate]
// .local _a, _b, _c
// _b = (_a = a.b).bind;
// _c = [1];
// .yield resumeLabel
// .mark resumeLabel
// new (_b.apply(_a, _c.concat([%sent%, 2])));
var _a = factory.createCallBinding(factory.createPropertyAccessExpression(node.expression, "bind"), hoistVariableDeclaration), target = _a.target, thisArg = _a.thisArg;
return ts.setOriginalNode(ts.setTextRange(factory.createNewExpression(factory.createFunctionApplyCall(cacheExpression(ts.visitNode(target, visitor, ts.isExpression)), thisArg, visitElements(node.arguments,
/*leadingElement*/ factory.createVoidZero())),
/*typeArguments*/ undefined, []), node), node);
}
return ts.visitEachChild(node, visitor, context);
}
function transformAndEmitStatements(statements, start) {
if (start === void 0) { start = 0; }
var numStatements = statements.length;
for (var i = start; i < numStatements; i++) {
transformAndEmitStatement(statements[i]);
}
}
function transformAndEmitEmbeddedStatement(node) {
if (ts.isBlock(node)) {
transformAndEmitStatements(node.statements);
}
else {
transformAndEmitStatement(node);
}
}
function transformAndEmitStatement(node) {
var savedInStatementContainingYield = inStatementContainingYield;
if (!inStatementContainingYield) {
inStatementContainingYield = containsYield(node);
}
transformAndEmitStatementWorker(node);
inStatementContainingYield = savedInStatementContainingYield;
}
function transformAndEmitStatementWorker(node) {
switch (node.kind) {
case 233 /* Block */:
return transformAndEmitBlock(node);
case 236 /* ExpressionStatement */:
return transformAndEmitExpressionStatement(node);
case 237 /* IfStatement */:
return transformAndEmitIfStatement(node);
case 238 /* DoStatement */:
return transformAndEmitDoStatement(node);
case 239 /* WhileStatement */:
return transformAndEmitWhileStatement(node);
case 240 /* ForStatement */:
return transformAndEmitForStatement(node);
case 241 /* ForInStatement */:
return transformAndEmitForInStatement(node);
case 243 /* ContinueStatement */:
return transformAndEmitContinueStatement(node);
case 244 /* BreakStatement */:
return transformAndEmitBreakStatement(node);
case 245 /* ReturnStatement */:
return transformAndEmitReturnStatement(node);
case 246 /* WithStatement */:
return transformAndEmitWithStatement(node);
case 247 /* SwitchStatement */:
return transformAndEmitSwitchStatement(node);
case 248 /* LabeledStatement */:
return transformAndEmitLabeledStatement(node);
case 249 /* ThrowStatement */:
return transformAndEmitThrowStatement(node);
case 250 /* TryStatement */:
return transformAndEmitTryStatement(node);
default:
return emitStatement(ts.visitNode(node, visitor, ts.isStatement));
}
}
function transformAndEmitBlock(node) {
if (containsYield(node)) {
transformAndEmitStatements(node.statements);
}
else {
emitStatement(ts.visitNode(node, visitor, ts.isStatement));
}
}
function transformAndEmitExpressionStatement(node) {
emitStatement(ts.visitNode(node, visitor, ts.isStatement));
}
function transformAndEmitVariableDeclarationList(node) {
for (var _i = 0, _a = node.declarations; _i < _a.length; _i++) {
var variable = _a[_i];
var name = factory.cloneNode(variable.name);
ts.setCommentRange(name, variable.name);
hoistVariableDeclaration(name);
}
var variables = ts.getInitializedVariables(node);
var numVariables = variables.length;
var variablesWritten = 0;
var pendingExpressions = [];
while (variablesWritten < numVariables) {
for (var i = variablesWritten; i < numVariables; i++) {
var variable = variables[i];
if (containsYield(variable.initializer) && pendingExpressions.length > 0) {
break;
}
pendingExpressions.push(transformInitializedVariable(variable));
}
if (pendingExpressions.length) {
emitStatement(factory.createExpressionStatement(factory.inlineExpressions(pendingExpressions)));
variablesWritten += pendingExpressions.length;
pendingExpressions = [];
}
}
return undefined;
}
function transformInitializedVariable(node) {
return ts.setSourceMapRange(factory.createAssignment(ts.setSourceMapRange(factory.cloneNode(node.name), node.name), ts.visitNode(node.initializer, visitor, ts.isExpression)), node);
}
function transformAndEmitIfStatement(node) {
if (containsYield(node)) {
// [source]
// if (x)
// /*thenStatement*/
// else
// /*elseStatement*/
//
// [intermediate]
// .brfalse elseLabel, (x)
// /*thenStatement*/
// .br endLabel
// .mark elseLabel
// /*elseStatement*/
// .mark endLabel
if (containsYield(node.thenStatement) || containsYield(node.elseStatement)) {
var endLabel = defineLabel();
var elseLabel = node.elseStatement ? defineLabel() : undefined;
emitBreakWhenFalse(node.elseStatement ? elseLabel : endLabel, ts.visitNode(node.expression, visitor, ts.isExpression), /*location*/ node.expression);
transformAndEmitEmbeddedStatement(node.thenStatement);
if (node.elseStatement) {
emitBreak(endLabel);
markLabel(elseLabel);
transformAndEmitEmbeddedStatement(node.elseStatement);
}
markLabel(endLabel);
}
else {
emitStatement(ts.visitNode(node, visitor, ts.isStatement));
}
}
else {
emitStatement(ts.visitNode(node, visitor, ts.isStatement));
}
}
function transformAndEmitDoStatement(node) {
if (containsYield(node)) {
// [source]
// do {
// /*body*/
// }
// while (i < 10);
//
// [intermediate]
// .loop conditionLabel, endLabel
// .mark loopLabel
// /*body*/
// .mark conditionLabel
// .brtrue loopLabel, (i < 10)
// .endloop
// .mark endLabel
var conditionLabel = defineLabel();
var loopLabel = defineLabel();
beginLoopBlock(/*continueLabel*/ conditionLabel);
markLabel(loopLabel);
transformAndEmitEmbeddedStatement(node.statement);
markLabel(conditionLabel);
emitBreakWhenTrue(loopLabel, ts.visitNode(node.expression, visitor, ts.isExpression));
endLoopBlock();
}
else {
emitStatement(ts.visitNode(node, visitor, ts.isStatement));
}
}
function visitDoStatement(node) {
if (inStatementContainingYield) {
beginScriptLoopBlock();
node = ts.visitEachChild(node, visitor, context);
endLoopBlock();
return node;
}
else {
return ts.visitEachChild(node, visitor, context);
}
}
function transformAndEmitWhileStatement(node) {
if (containsYield(node)) {
// [source]
// while (i < 10) {
// /*body*/
// }
//
// [intermediate]
// .loop loopLabel, endLabel
// .mark loopLabel
// .brfalse endLabel, (i < 10)
// /*body*/
// .br loopLabel
// .endloop
// .mark endLabel
var loopLabel = defineLabel();
var endLabel = beginLoopBlock(loopLabel);
markLabel(loopLabel);
emitBreakWhenFalse(endLabel, ts.visitNode(node.expression, visitor, ts.isExpression));
transformAndEmitEmbeddedStatement(node.statement);
emitBreak(loopLabel);
endLoopBlock();
}
else {
emitStatement(ts.visitNode(node, visitor, ts.isStatement));
}
}
function visitWhileStatement(node) {
if (inStatementContainingYield) {
beginScriptLoopBlock();
node = ts.visitEachChild(node, visitor, context);
endLoopBlock();
return node;
}
else {
return ts.visitEachChild(node, visitor, context);
}
}
function transformAndEmitForStatement(node) {
if (containsYield(node)) {
// [source]
// for (var i = 0; i < 10; i++) {
// /*body*/
// }
//
// [intermediate]
// .local i
// i = 0;
// .loop incrementLabel, endLoopLabel
// .mark conditionLabel
// .brfalse endLoopLabel, (i < 10)
// /*body*/
// .mark incrementLabel
// i++;
// .br conditionLabel
// .endloop
// .mark endLoopLabel
var conditionLabel = defineLabel();
var incrementLabel = defineLabel();
var endLabel = beginLoopBlock(incrementLabel);
if (node.initializer) {
var initializer = node.initializer;
if (ts.isVariableDeclarationList(initializer)) {
transformAndEmitVariableDeclarationList(initializer);
}
else {
emitStatement(ts.setTextRange(factory.createExpressionStatement(ts.visitNode(initializer, visitor, ts.isExpression)), initializer));
}
}
markLabel(conditionLabel);
if (node.condition) {
emitBreakWhenFalse(endLabel, ts.visitNode(node.condition, visitor, ts.isExpression));
}
transformAndEmitEmbeddedStatement(node.statement);
markLabel(incrementLabel);
if (node.incrementor) {
emitStatement(ts.setTextRange(factory.createExpressionStatement(ts.visitNode(node.incrementor, visitor, ts.isExpression)), node.incrementor));
}
emitBreak(conditionLabel);
endLoopBlock();
}
else {
emitStatement(ts.visitNode(node, visitor, ts.isStatement));
}
}
function visitForStatement(node) {
if (inStatementContainingYield) {
beginScriptLoopBlock();
}
var initializer = node.initializer;
if (initializer && ts.isVariableDeclarationList(initializer)) {
for (var _i = 0, _a = initializer.declarations; _i < _a.length; _i++) {
var variable = _a[_i];
hoistVariableDeclaration(variable.name);
}
var variables = ts.getInitializedVariables(initializer);
node = factory.updateForStatement(node, variables.length > 0
? factory.inlineExpressions(ts.map(variables, transformInitializedVariable))
: undefined, ts.visitNode(node.condition, visitor, ts.isExpression), ts.visitNode(node.incrementor, visitor, ts.isExpression), ts.visitIterationBody(node.statement, visitor, context));
}
else {
node = ts.visitEachChild(node, visitor, context);
}
if (inStatementContainingYield) {
endLoopBlock();
}
return node;
}
function transformAndEmitForInStatement(node) {
// TODO(rbuckton): Source map locations
if (containsYield(node)) {
// [source]
// for (var p in o) {
// /*body*/
// }
//
// [intermediate]
// .local _a, _b, _i
// _a = [];
// for (_b in o) _a.push(_b);
// _i = 0;
// .loop incrementLabel, endLoopLabel
// .mark conditionLabel
// .brfalse endLoopLabel, (_i < _a.length)
// p = _a[_i];
// /*body*/
// .mark incrementLabel
// _b++;
// .br conditionLabel
// .endloop
// .mark endLoopLabel
var keysArray = declareLocal(); // _a
var key = declareLocal(); // _b
var keysIndex = factory.createLoopVariable(); // _i
var initializer = node.initializer;
hoistVariableDeclaration(keysIndex);
emitAssignment(keysArray, factory.createArrayLiteralExpression());
emitStatement(factory.createForInStatement(key, ts.visitNode(node.expression, visitor, ts.isExpression), factory.createExpressionStatement(factory.createCallExpression(factory.createPropertyAccessExpression(keysArray, "push"),
/*typeArguments*/ undefined, [key]))));
emitAssignment(keysIndex, factory.createNumericLiteral(0));
var conditionLabel = defineLabel();
var incrementLabel = defineLabel();
var endLabel = beginLoopBlock(incrementLabel);
markLabel(conditionLabel);
emitBreakWhenFalse(endLabel, factory.createLessThan(keysIndex, factory.createPropertyAccessExpression(keysArray, "length")));
var variable = void 0;
if (ts.isVariableDeclarationList(initializer)) {
for (var _i = 0, _a = initializer.declarations; _i < _a.length; _i++) {
var variable_1 = _a[_i];
hoistVariableDeclaration(variable_1.name);
}
variable = factory.cloneNode(initializer.declarations[0].name);
}
else {
variable = ts.visitNode(initializer, visitor, ts.isExpression);
ts.Debug.assert(ts.isLeftHandSideExpression(variable));
}
emitAssignment(variable, factory.createElementAccessExpression(keysArray, keysIndex));
transformAndEmitEmbeddedStatement(node.statement);
markLabel(incrementLabel);
emitStatement(factory.createExpressionStatement(factory.createPostfixIncrement(keysIndex)));
emitBreak(conditionLabel);
endLoopBlock();
}
else {
emitStatement(ts.visitNode(node, visitor, ts.isStatement));
}
}
function visitForInStatement(node) {
// [source]
// for (var x in a) {
// /*body*/
// }
//
// [intermediate]
// .local x
// .loop
// for (x in a) {
// /*body*/
// }
// .endloop
if (inStatementContainingYield) {
beginScriptLoopBlock();
}
var initializer = node.initializer;
if (ts.isVariableDeclarationList(initializer)) {
for (var _i = 0, _a = initializer.declarations; _i < _a.length; _i++) {
var variable = _a[_i];
hoistVariableDeclaration(variable.name);
}
node = factory.updateForInStatement(node, initializer.declarations[0].name, ts.visitNode(node.expression, visitor, ts.isExpression), ts.visitNode(node.statement, visitor, ts.isStatement, factory.liftToBlock));
}
else {
node = ts.visitEachChild(node, visitor, context);
}
if (inStatementContainingYield) {
endLoopBlock();
}
return node;
}
function transformAndEmitContinueStatement(node) {
var label = findContinueTarget(node.label ? ts.idText(node.label) : undefined);
if (label > 0) {
emitBreak(label, /*location*/ node);
}
else {
// invalid continue without a containing loop. Leave the node as is, per #17875.
emitStatement(node);
}
}
function visitContinueStatement(node) {
if (inStatementContainingYield) {
var label = findContinueTarget(node.label && ts.idText(node.label));
if (label > 0) {
return createInlineBreak(label, /*location*/ node);
}
}
return ts.visitEachChild(node, visitor, context);
}
function transformAndEmitBreakStatement(node) {
var label = findBreakTarget(node.label ? ts.idText(node.label) : undefined);
if (label > 0) {
emitBreak(label, /*location*/ node);
}
else {
// invalid break without a containing loop, switch, or labeled statement. Leave the node as is, per #17875.
emitStatement(node);
}
}
function visitBreakStatement(node) {
if (inStatementContainingYield) {
var label = findBreakTarget(node.label && ts.idText(node.label));
if (label > 0) {
return createInlineBreak(label, /*location*/ node);
}
}
return ts.visitEachChild(node, visitor, context);
}
function transformAndEmitReturnStatement(node) {
emitReturn(ts.visitNode(node.expression, visitor, ts.isExpression),
/*location*/ node);
}
function visitReturnStatement(node) {
return createInlineReturn(ts.visitNode(node.expression, visitor, ts.isExpression),
/*location*/ node);
}
function transformAndEmitWithStatement(node) {
if (containsYield(node)) {
// [source]
// with (x) {
// /*body*/
// }
//
// [intermediate]
// .with (x)
// /*body*/
// .endwith
beginWithBlock(cacheExpression(ts.visitNode(node.expression, visitor, ts.isExpression)));
transformAndEmitEmbeddedStatement(node.statement);
endWithBlock();
}
else {
emitStatement(ts.visitNode(node, visitor, ts.isStatement));
}
}
function transformAndEmitSwitchStatement(node) {
if (containsYield(node.caseBlock)) {
// [source]
// switch (x) {
// case a:
// /*caseStatements*/
// case b:
// /*caseStatements*/
// default:
// /*defaultStatements*/
// }
//
// [intermediate]
// .local _a
// .switch endLabel
// _a = x;
// switch (_a) {
// case a:
// .br clauseLabels[0]
// }
// switch (_a) {
// case b:
// .br clauseLabels[1]
// }
// .br clauseLabels[2]
// .mark clauseLabels[0]
// /*caseStatements*/
// .mark clauseLabels[1]
// /*caseStatements*/
// .mark clauseLabels[2]
// /*caseStatements*/
// .endswitch
// .mark endLabel
var caseBlock = node.caseBlock;
var numClauses = caseBlock.clauses.length;
var endLabel = beginSwitchBlock();
var expression = cacheExpression(ts.visitNode(node.expression, visitor, ts.isExpression));
// Create labels for each clause and find the index of the first default clause.
var clauseLabels = [];
var defaultClauseIndex = -1;
for (var i = 0; i < numClauses; i++) {
var clause = caseBlock.clauses[i];
clauseLabels.push(defineLabel());
if (clause.kind === 288 /* DefaultClause */ && defaultClauseIndex === -1) {
defaultClauseIndex = i;
}
}
// Emit switch statements for each run of case clauses either from the first case
// clause or the next case clause with a `yield` in its expression, up to the next
// case clause with a `yield` in its expression.
var clausesWritten = 0;
var pendingClauses = [];
while (clausesWritten < numClauses) {
var defaultClausesSkipped = 0;
for (var i = clausesWritten; i < numClauses; i++) {
var clause = caseBlock.clauses[i];
if (clause.kind === 287 /* CaseClause */) {
if (containsYield(clause.expression) && pendingClauses.length > 0) {
break;
}
pendingClauses.push(factory.createCaseClause(ts.visitNode(clause.expression, visitor, ts.isExpression), [
createInlineBreak(clauseLabels[i], /*location*/ clause.expression)
]));
}
else {
defaultClausesSkipped++;
}
}
if (pendingClauses.length) {
emitStatement(factory.createSwitchStatement(expression, factory.createCaseBlock(pendingClauses)));
clausesWritten += pendingClauses.length;
pendingClauses = [];
}
if (defaultClausesSkipped > 0) {
clausesWritten += defaultClausesSkipped;
defaultClausesSkipped = 0;
}
}
if (defaultClauseIndex >= 0) {
emitBreak(clauseLabels[defaultClauseIndex]);
}
else {
emitBreak(endLabel);
}
for (var i = 0; i < numClauses; i++) {
markLabel(clauseLabels[i]);
transformAndEmitStatements(caseBlock.clauses[i].statements);
}
endSwitchBlock();
}
else {
emitStatement(ts.visitNode(node, visitor, ts.isStatement));
}
}
function visitSwitchStatement(node) {
if (inStatementContainingYield) {
beginScriptSwitchBlock();
}
node = ts.visitEachChild(node, visitor, context);
if (inStatementContainingYield) {
endSwitchBlock();
}
return node;
}
function transformAndEmitLabeledStatement(node) {
if (containsYield(node)) {
// [source]
// x: {
// /*body*/
// }
//
// [intermediate]
// .labeled "x", endLabel
// /*body*/
// .endlabeled
// .mark endLabel
beginLabeledBlock(ts.idText(node.label));
transformAndEmitEmbeddedStatement(node.statement);
endLabeledBlock();
}
else {
emitStatement(ts.visitNode(node, visitor, ts.isStatement));
}
}
function visitLabeledStatement(node) {
if (inStatementContainingYield) {
beginScriptLabeledBlock(ts.idText(node.label));
}
node = ts.visitEachChild(node, visitor, context);
if (inStatementContainingYield) {
endLabeledBlock();
}
return node;
}
function transformAndEmitThrowStatement(node) {
var _a;
// TODO(rbuckton): `expression` should be required on `throw`.
emitThrow(ts.visitNode((_a = node.expression) !== null && _a !== void 0 ? _a : factory.createVoidZero(), visitor, ts.isExpression),
/*location*/ node);
}
function transformAndEmitTryStatement(node) {
if (containsYield(node)) {
// [source]
// try {
// /*tryBlock*/
// }
// catch (e) {
// /*catchBlock*/
// }
// finally {
// /*finallyBlock*/
// }
//
// [intermediate]
// .local _a
// .try tryLabel, catchLabel, finallyLabel, endLabel
// .mark tryLabel
// .nop
// /*tryBlock*/
// .br endLabel
// .catch
// .mark catchLabel
// _a = %error%;
// /*catchBlock*/
// .br endLabel
// .finally
// .mark finallyLabel
// /*finallyBlock*/
// .endfinally
// .endtry
// .mark endLabel
beginExceptionBlock();
transformAndEmitEmbeddedStatement(node.tryBlock);
if (node.catchClause) {
beginCatchBlock(node.catchClause.variableDeclaration); // TODO: GH#18217
transformAndEmitEmbeddedStatement(node.catchClause.block);
}
if (node.finallyBlock) {
beginFinallyBlock();
transformAndEmitEmbeddedStatement(node.finallyBlock);
}
endExceptionBlock();
}
else {
emitStatement(ts.visitEachChild(node, visitor, context));
}
}
function containsYield(node) {
return !!node && (node.transformFlags & 524288 /* ContainsYield */) !== 0;
}
function countInitialNodesWithoutYield(nodes) {
var numNodes = nodes.length;
for (var i = 0; i < numNodes; i++) {
if (containsYield(nodes[i])) {
return i;
}
}
return -1;
}
function onSubstituteNode(hint, node) {
node = previousOnSubstituteNode(hint, node);
if (hint === 1 /* Expression */) {
return substituteExpression(node);
}
return node;
}
function substituteExpression(node) {
if (ts.isIdentifier(node)) {
return substituteExpressionIdentifier(node);
}
return node;
}
function substituteExpressionIdentifier(node) {
if (!ts.isGeneratedIdentifier(node) && renamedCatchVariables && renamedCatchVariables.has(ts.idText(node))) {
var original = ts.getOriginalNode(node);
if (ts.isIdentifier(original) && original.parent) {
var declaration = resolver.getReferencedValueDeclaration(original);
if (declaration) {
var name = renamedCatchVariableDeclarations[ts.getOriginalNodeId(declaration)];
if (name) {
// TODO(rbuckton): Does this need to be parented?
var clone_6 = ts.setParent(ts.setTextRange(factory.cloneNode(name), name), name.parent);
ts.setSourceMapRange(clone_6, node);
ts.setCommentRange(clone_6, node);
return clone_6;
}
}
}
}
return node;
}
function cacheExpression(node) {
if (ts.isGeneratedIdentifier(node) || ts.getEmitFlags(node) & 4096 /* HelperName */) {
return node;
}
var temp = factory.createTempVariable(hoistVariableDeclaration);
emitAssignment(temp, node, /*location*/ node);
return temp;
}
function declareLocal(name) {
var temp = name
? factory.createUniqueName(name)
: factory.createTempVariable(/*recordTempVariable*/ undefined);
hoistVariableDeclaration(temp);
return temp;
}
/**
* Defines a label, uses as the target of a Break operation.
*/
function defineLabel() {
if (!labelOffsets) {
labelOffsets = [];
}
var label = nextLabelId;
nextLabelId++;
labelOffsets[label] = -1;
return label;
}
/**
* Marks the current operation with the specified label.
*/
function markLabel(label) {
ts.Debug.assert(labelOffsets !== undefined, "No labels were defined.");
labelOffsets[label] = operations ? operations.length : 0;
}
/**
* Begins a block operation (With, Break/Continue, Try/Catch/Finally)
*
* @param block Information about the block.
*/
function beginBlock(block) {
if (!blocks) {
blocks = [];
blockActions = [];
blockOffsets = [];
blockStack = [];
}
var index = blockActions.length;
blockActions[index] = 0 /* Open */;
blockOffsets[index] = operations ? operations.length : 0;
blocks[index] = block;
blockStack.push(block);
return index;
}
/**
* Ends the current block operation.
*/
function endBlock() {
var block = peekBlock();
if (block === undefined)
return ts.Debug.fail("beginBlock was never called.");
var index = blockActions.length;
blockActions[index] = 1 /* Close */;
blockOffsets[index] = operations ? operations.length : 0;
blocks[index] = block;
blockStack.pop();
return block;
}
/**
* Gets the current open block.
*/
function peekBlock() {
return ts.lastOrUndefined(blockStack);
}
/**
* Gets the kind of the current open block.
*/
function peekBlockKind() {
var block = peekBlock();
return block && block.kind;
}
/**
* Begins a code block for a generated `with` statement.
*
* @param expression An identifier representing expression for the `with` block.
*/
function beginWithBlock(expression) {
var startLabel = defineLabel();
var endLabel = defineLabel();
markLabel(startLabel);
beginBlock({
kind: 1 /* With */,
expression: expression,
startLabel: startLabel,
endLabel: endLabel
});
}
/**
* Ends a code block for a generated `with` statement.
*/
function endWithBlock() {
ts.Debug.assert(peekBlockKind() === 1 /* With */);
var block = endBlock();
markLabel(block.endLabel);
}
/**
* Begins a code block for a generated `try` statement.
*/
function beginExceptionBlock() {
var startLabel = defineLabel();
var endLabel = defineLabel();
markLabel(startLabel);
beginBlock({
kind: 0 /* Exception */,
state: 0 /* Try */,
startLabel: startLabel,
endLabel: endLabel
});
emitNop();
return endLabel;
}
/**
* Enters the `catch` clause of a generated `try` statement.
*
* @param variable The catch variable.
*/
function beginCatchBlock(variable) {
ts.Debug.assert(peekBlockKind() === 0 /* Exception */);
// generated identifiers should already be unique within a file
var name;
if (ts.isGeneratedIdentifier(variable.name)) {
name = variable.name;
hoistVariableDeclaration(variable.name);
}
else {
var text = ts.idText(variable.name);
name = declareLocal(text);
if (!renamedCatchVariables) {
renamedCatchVariables = new ts.Map();
renamedCatchVariableDeclarations = [];
context.enableSubstitution(79 /* Identifier */);
}
renamedCatchVariables.set(text, true);
renamedCatchVariableDeclarations[ts.getOriginalNodeId(variable)] = name;
}
var exception = peekBlock();
ts.Debug.assert(exception.state < 1 /* Catch */);
var endLabel = exception.endLabel;
emitBreak(endLabel);
var catchLabel = defineLabel();
markLabel(catchLabel);
exception.state = 1 /* Catch */;
exception.catchVariable = name;
exception.catchLabel = catchLabel;
emitAssignment(name, factory.createCallExpression(factory.createPropertyAccessExpression(state, "sent"), /*typeArguments*/ undefined, []));
emitNop();
}
/**
* Enters the `finally` block of a generated `try` statement.
*/
function beginFinallyBlock() {
ts.Debug.assert(peekBlockKind() === 0 /* Exception */);
var exception = peekBlock();
ts.Debug.assert(exception.state < 2 /* Finally */);
var endLabel = exception.endLabel;
emitBreak(endLabel);
var finallyLabel = defineLabel();
markLabel(finallyLabel);
exception.state = 2 /* Finally */;
exception.finallyLabel = finallyLabel;
}
/**
* Ends the code block for a generated `try` statement.
*/
function endExceptionBlock() {
ts.Debug.assert(peekBlockKind() === 0 /* Exception */);
var exception = endBlock();
var state = exception.state;
if (state < 2 /* Finally */) {
emitBreak(exception.endLabel);
}
else {
emitEndfinally();
}
markLabel(exception.endLabel);
emitNop();
exception.state = 3 /* Done */;
}
/**
* Begins a code block that supports `break` or `continue` statements that are defined in
* the source tree and not from generated code.
*
* @param labelText Names from containing labeled statements.
*/
function beginScriptLoopBlock() {
beginBlock({
kind: 3 /* Loop */,
isScript: true,
breakLabel: -1,
continueLabel: -1
});
}
/**
* Begins a code block that supports `break` or `continue` statements that are defined in
* generated code. Returns a label used to mark the operation to which to jump when a
* `break` statement targets this block.
*
* @param continueLabel A Label used to mark the operation to which to jump when a
* `continue` statement targets this block.
*/
function beginLoopBlock(continueLabel) {
var breakLabel = defineLabel();
beginBlock({
kind: 3 /* Loop */,
isScript: false,
breakLabel: breakLabel,
continueLabel: continueLabel,
});
return breakLabel;
}
/**
* Ends a code block that supports `break` or `continue` statements that are defined in
* generated code or in the source tree.
*/
function endLoopBlock() {
ts.Debug.assert(peekBlockKind() === 3 /* Loop */);
var block = endBlock();
var breakLabel = block.breakLabel;
if (!block.isScript) {
markLabel(breakLabel);
}
}
/**
* Begins a code block that supports `break` statements that are defined in the source
* tree and not from generated code.
*
*/
function beginScriptSwitchBlock() {
beginBlock({
kind: 2 /* Switch */,
isScript: true,
breakLabel: -1
});
}
/**
* Begins a code block that supports `break` statements that are defined in generated code.
* Returns a label used to mark the operation to which to jump when a `break` statement
* targets this block.
*/
function beginSwitchBlock() {
var breakLabel = defineLabel();
beginBlock({
kind: 2 /* Switch */,
isScript: false,
breakLabel: breakLabel,
});
return breakLabel;
}
/**
* Ends a code block that supports `break` statements that are defined in generated code.
*/
function endSwitchBlock() {
ts.Debug.assert(peekBlockKind() === 2 /* Switch */);
var block = endBlock();
var breakLabel = block.breakLabel;
if (!block.isScript) {
markLabel(breakLabel);
}
}
function beginScriptLabeledBlock(labelText) {
beginBlock({
kind: 4 /* Labeled */,
isScript: true,
labelText: labelText,
breakLabel: -1
});
}
function beginLabeledBlock(labelText) {
var breakLabel = defineLabel();
beginBlock({
kind: 4 /* Labeled */,
isScript: false,
labelText: labelText,
breakLabel: breakLabel
});
}
function endLabeledBlock() {
ts.Debug.assert(peekBlockKind() === 4 /* Labeled */);
var block = endBlock();
if (!block.isScript) {
markLabel(block.breakLabel);
}
}
/**
* Indicates whether the provided block supports `break` statements.
*
* @param block A code block.
*/
function supportsUnlabeledBreak(block) {
return block.kind === 2 /* Switch */
|| block.kind === 3 /* Loop */;
}
/**
* Indicates whether the provided block supports `break` statements with labels.
*
* @param block A code block.
*/
function supportsLabeledBreakOrContinue(block) {
return block.kind === 4 /* Labeled */;
}
/**
* Indicates whether the provided block supports `continue` statements.
*
* @param block A code block.
*/
function supportsUnlabeledContinue(block) {
return block.kind === 3 /* Loop */;
}
function hasImmediateContainingLabeledBlock(labelText, start) {
for (var j = start; j >= 0; j--) {
var containingBlock = blockStack[j];
if (supportsLabeledBreakOrContinue(containingBlock)) {
if (containingBlock.labelText === labelText) {
return true;
}
}
else {
break;
}
}
return false;
}
/**
* Finds the label that is the target for a `break` statement.
*
* @param labelText An optional name of a containing labeled statement.
*/
function findBreakTarget(labelText) {
if (blockStack) {
if (labelText) {
for (var i = blockStack.length - 1; i >= 0; i--) {
var block = blockStack[i];
if (supportsLabeledBreakOrContinue(block) && block.labelText === labelText) {
return block.breakLabel;
}
else if (supportsUnlabeledBreak(block) && hasImmediateContainingLabeledBlock(labelText, i - 1)) {
return block.breakLabel;
}
}
}
else {
for (var i = blockStack.length - 1; i >= 0; i--) {
var block = blockStack[i];
if (supportsUnlabeledBreak(block)) {
return block.breakLabel;
}
}
}
}
return 0;
}
/**
* Finds the label that is the target for a `continue` statement.
*
* @param labelText An optional name of a containing labeled statement.
*/
function findContinueTarget(labelText) {
if (blockStack) {
if (labelText) {
for (var i = blockStack.length - 1; i >= 0; i--) {
var block = blockStack[i];
if (supportsUnlabeledContinue(block) && hasImmediateContainingLabeledBlock(labelText, i - 1)) {
return block.continueLabel;
}
}
}
else {
for (var i = blockStack.length - 1; i >= 0; i--) {
var block = blockStack[i];
if (supportsUnlabeledContinue(block)) {
return block.continueLabel;
}
}
}
}
return 0;
}
/**
* Creates an expression that can be used to indicate the value for a label.
*
* @param label A label.
*/
function createLabel(label) {
if (label !== undefined && label > 0) {
if (labelExpressions === undefined) {
labelExpressions = [];
}
var expression = factory.createNumericLiteral(-1);
if (labelExpressions[label] === undefined) {
labelExpressions[label] = [expression];
}
else {
labelExpressions[label].push(expression);
}
return expression;
}
return factory.createOmittedExpression();
}
/**
* Creates a numeric literal for the provided instruction.
*/
function createInstruction(instruction) {
var literal = factory.createNumericLiteral(instruction);
ts.addSyntheticTrailingComment(literal, 3 /* MultiLineCommentTrivia */, getInstructionName(instruction));
return literal;
}
/**
* Creates a statement that can be used indicate a Break operation to the provided label.
*
* @param label A label.
* @param location An optional source map location for the statement.
*/
function createInlineBreak(label, location) {
ts.Debug.assertLessThan(0, label, "Invalid label");
return ts.setTextRange(factory.createReturnStatement(factory.createArrayLiteralExpression([
createInstruction(3 /* Break */),
createLabel(label)
])), location);
}
/**
* Creates a statement that can be used indicate a Return operation.
*
* @param expression The expression for the return statement.
* @param location An optional source map location for the statement.
*/
function createInlineReturn(expression, location) {
return ts.setTextRange(factory.createReturnStatement(factory.createArrayLiteralExpression(expression
? [createInstruction(2 /* Return */), expression]
: [createInstruction(2 /* Return */)])), location);
}
/**
* Creates an expression that can be used to resume from a Yield operation.
*/
function createGeneratorResume(location) {
return ts.setTextRange(factory.createCallExpression(factory.createPropertyAccessExpression(state, "sent"),
/*typeArguments*/ undefined, []), location);
}
/**
* Emits an empty instruction.
*/
function emitNop() {
emitWorker(0 /* Nop */);
}
/**
* Emits a Statement.
*
* @param node A statement.
*/
function emitStatement(node) {
if (node) {
emitWorker(1 /* Statement */, [node]);
}
else {
emitNop();
}
}
/**
* Emits an Assignment operation.
*
* @param left The left-hand side of the assignment.
* @param right The right-hand side of the assignment.
* @param location An optional source map location for the assignment.
*/
function emitAssignment(left, right, location) {
emitWorker(2 /* Assign */, [left, right], location);
}
/**
* Emits a Break operation to the specified label.
*
* @param label A label.
* @param location An optional source map location for the assignment.
*/
function emitBreak(label, location) {
emitWorker(3 /* Break */, [label], location);
}
/**
* Emits a Break operation to the specified label when a condition evaluates to a truthy
* value at runtime.
*
* @param label A label.
* @param condition The condition.
* @param location An optional source map location for the assignment.
*/
function emitBreakWhenTrue(label, condition, location) {
emitWorker(4 /* BreakWhenTrue */, [label, condition], location);
}
/**
* Emits a Break to the specified label when a condition evaluates to a falsey value at
* runtime.
*
* @param label A label.
* @param condition The condition.
* @param location An optional source map location for the assignment.
*/
function emitBreakWhenFalse(label, condition, location) {
emitWorker(5 /* BreakWhenFalse */, [label, condition], location);
}
/**
* Emits a YieldStar operation for the provided expression.
*
* @param expression An optional value for the yield operation.
* @param location An optional source map location for the assignment.
*/
function emitYieldStar(expression, location) {
emitWorker(7 /* YieldStar */, [expression], location);
}
/**
* Emits a Yield operation for the provided expression.
*
* @param expression An optional value for the yield operation.
* @param location An optional source map location for the assignment.
*/
function emitYield(expression, location) {
emitWorker(6 /* Yield */, [expression], location);
}
/**
* Emits a Return operation for the provided expression.
*
* @param expression An optional value for the operation.
* @param location An optional source map location for the assignment.
*/
function emitReturn(expression, location) {
emitWorker(8 /* Return */, [expression], location);
}
/**
* Emits a Throw operation for the provided expression.
*
* @param expression A value for the operation.
* @param location An optional source map location for the assignment.
*/
function emitThrow(expression, location) {
emitWorker(9 /* Throw */, [expression], location);
}
/**
* Emits an Endfinally operation. This is used to handle `finally` block semantics.
*/
function emitEndfinally() {
emitWorker(10 /* Endfinally */);
}
/**
* Emits an operation.
*
* @param code The OpCode for the operation.
* @param args The optional arguments for the operation.
*/
function emitWorker(code, args, location) {
if (operations === undefined) {
operations = [];
operationArguments = [];
operationLocations = [];
}
if (labelOffsets === undefined) {
// mark entry point
markLabel(defineLabel());
}
var operationIndex = operations.length;
operations[operationIndex] = code;
operationArguments[operationIndex] = args;
operationLocations[operationIndex] = location;
}
/**
* Builds the generator function body.
*/
function build() {
blockIndex = 0;
labelNumber = 0;
labelNumbers = undefined;
lastOperationWasAbrupt = false;
lastOperationWasCompletion = false;
clauses = undefined;
statements = undefined;
exceptionBlockStack = undefined;
currentExceptionBlock = undefined;
withBlockStack = undefined;
var buildResult = buildStatements();
return emitHelpers().createGeneratorHelper(ts.setEmitFlags(factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, [factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, state)],
/*type*/ undefined, factory.createBlock(buildResult,
/*multiLine*/ buildResult.length > 0)), 524288 /* ReuseTempVariableScope */));
}
/**
* Builds the statements for the generator function body.
*/
function buildStatements() {
if (operations) {
for (var operationIndex = 0; operationIndex < operations.length; operationIndex++) {
writeOperation(operationIndex);
}
flushFinalLabel(operations.length);
}
else {
flushFinalLabel(0);
}
if (clauses) {
var labelExpression = factory.createPropertyAccessExpression(state, "label");
var switchStatement = factory.createSwitchStatement(labelExpression, factory.createCaseBlock(clauses));
return [ts.startOnNewLine(switchStatement)];
}
if (statements) {
return statements;
}
return [];
}
/**
* Flush the current label and advance to a new label.
*/
function flushLabel() {
if (!statements) {
return;
}
appendLabel(/*markLabelEnd*/ !lastOperationWasAbrupt);
lastOperationWasAbrupt = false;
lastOperationWasCompletion = false;
labelNumber++;
}
/**
* Flush the final label of the generator function body.
*/
function flushFinalLabel(operationIndex) {
if (isFinalLabelReachable(operationIndex)) {
tryEnterLabel(operationIndex);
withBlockStack = undefined;
writeReturn(/*expression*/ undefined, /*operationLocation*/ undefined);
}
if (statements && clauses) {
appendLabel(/*markLabelEnd*/ false);
}
updateLabelExpressions();
}
/**
* Tests whether the final label of the generator function body
* is reachable by user code.
*/
function isFinalLabelReachable(operationIndex) {
// if the last operation was *not* a completion (return/throw) then
// the final label is reachable.
if (!lastOperationWasCompletion) {
return true;
}
// if there are no labels defined or referenced, then the final label is
// not reachable.
if (!labelOffsets || !labelExpressions) {
return false;
}
// if the label for this offset is referenced, then the final label
// is reachable.
for (var label = 0; label < labelOffsets.length; label++) {
if (labelOffsets[label] === operationIndex && labelExpressions[label]) {
return true;
}
}
return false;
}
/**
* Appends a case clause for the last label and sets the new label.
*
* @param markLabelEnd Indicates that the transition between labels was a fall-through
* from a previous case clause and the change in labels should be
* reflected on the `state` object.
*/
function appendLabel(markLabelEnd) {
if (!clauses) {
clauses = [];
}
if (statements) {
if (withBlockStack) {
// The previous label was nested inside one or more `with` blocks, so we
// surround the statements in generated `with` blocks to create the same environment.
for (var i = withBlockStack.length - 1; i >= 0; i--) {
var withBlock = withBlockStack[i];
statements = [factory.createWithStatement(withBlock.expression, factory.createBlock(statements))];
}
}
if (currentExceptionBlock) {
// The previous label was nested inside of an exception block, so we must
// indicate entry into a protected region by pushing the label numbers
// for each block in the protected region.
var startLabel = currentExceptionBlock.startLabel, catchLabel = currentExceptionBlock.catchLabel, finallyLabel = currentExceptionBlock.finallyLabel, endLabel = currentExceptionBlock.endLabel;
statements.unshift(factory.createExpressionStatement(factory.createCallExpression(factory.createPropertyAccessExpression(factory.createPropertyAccessExpression(state, "trys"), "push"),
/*typeArguments*/ undefined, [
factory.createArrayLiteralExpression([
createLabel(startLabel),
createLabel(catchLabel),
createLabel(finallyLabel),
createLabel(endLabel)
])
])));
currentExceptionBlock = undefined;
}
if (markLabelEnd) {
// The case clause for the last label falls through to this label, so we
// add an assignment statement to reflect the change in labels.
statements.push(factory.createExpressionStatement(factory.createAssignment(factory.createPropertyAccessExpression(state, "label"), factory.createNumericLiteral(labelNumber + 1))));
}
}
clauses.push(factory.createCaseClause(factory.createNumericLiteral(labelNumber), statements || []));
statements = undefined;
}
/**
* Tries to enter into a new label at the current operation index.
*/
function tryEnterLabel(operationIndex) {
if (!labelOffsets) {
return;
}
for (var label = 0; label < labelOffsets.length; label++) {
if (labelOffsets[label] === operationIndex) {
flushLabel();
if (labelNumbers === undefined) {
labelNumbers = [];
}
if (labelNumbers[labelNumber] === undefined) {
labelNumbers[labelNumber] = [label];
}
else {
labelNumbers[labelNumber].push(label);
}
}
}
}
/**
* Updates literal expressions for labels with actual label numbers.
*/
function updateLabelExpressions() {
if (labelExpressions !== undefined && labelNumbers !== undefined) {
for (var labelNumber_1 = 0; labelNumber_1 < labelNumbers.length; labelNumber_1++) {
var labels = labelNumbers[labelNumber_1];
if (labels !== undefined) {
for (var _i = 0, labels_1 = labels; _i < labels_1.length; _i++) {
var label = labels_1[_i];
var expressions = labelExpressions[label];
if (expressions !== undefined) {
for (var _a = 0, expressions_1 = expressions; _a < expressions_1.length; _a++) {
var expression = expressions_1[_a];
expression.text = String(labelNumber_1);
}
}
}
}
}
}
}
/**
* Tries to enter or leave a code block.
*/
function tryEnterOrLeaveBlock(operationIndex) {
if (blocks) {
for (; blockIndex < blockActions.length && blockOffsets[blockIndex] <= operationIndex; blockIndex++) {
var block = blocks[blockIndex];
var blockAction = blockActions[blockIndex];
switch (block.kind) {
case 0 /* Exception */:
if (blockAction === 0 /* Open */) {
if (!exceptionBlockStack) {
exceptionBlockStack = [];
}
if (!statements) {
statements = [];
}
exceptionBlockStack.push(currentExceptionBlock);
currentExceptionBlock = block;
}
else if (blockAction === 1 /* Close */) {
currentExceptionBlock = exceptionBlockStack.pop();
}
break;
case 1 /* With */:
if (blockAction === 0 /* Open */) {
if (!withBlockStack) {
withBlockStack = [];
}
withBlockStack.push(block);
}
else if (blockAction === 1 /* Close */) {
withBlockStack.pop();
}
break;
// default: do nothing
}
}
}
}
/**
* Writes an operation as a statement to the current label's statement list.
*
* @param operation The OpCode of the operation
*/
function writeOperation(operationIndex) {
tryEnterLabel(operationIndex);
tryEnterOrLeaveBlock(operationIndex);
// early termination, nothing else to process in this label
if (lastOperationWasAbrupt) {
return;
}
lastOperationWasAbrupt = false;
lastOperationWasCompletion = false;
var opcode = operations[operationIndex];
if (opcode === 0 /* Nop */) {
return;
}
else if (opcode === 10 /* Endfinally */) {
return writeEndfinally();
}
var args = operationArguments[operationIndex];
if (opcode === 1 /* Statement */) {
return writeStatement(args[0]);
}
var location = operationLocations[operationIndex];
switch (opcode) {
case 2 /* Assign */:
return writeAssign(args[0], args[1], location);
case 3 /* Break */:
return writeBreak(args[0], location);
case 4 /* BreakWhenTrue */:
return writeBreakWhenTrue(args[0], args[1], location);
case 5 /* BreakWhenFalse */:
return writeBreakWhenFalse(args[0], args[1], location);
case 6 /* Yield */:
return writeYield(args[0], location);
case 7 /* YieldStar */:
return writeYieldStar(args[0], location);
case 8 /* Return */:
return writeReturn(args[0], location);
case 9 /* Throw */:
return writeThrow(args[0], location);
}
}
/**
* Writes a statement to the current label's statement list.
*
* @param statement A statement to write.
*/
function writeStatement(statement) {
if (statement) {
if (!statements) {
statements = [statement];
}
else {
statements.push(statement);
}
}
}
/**
* Writes an Assign operation to the current label's statement list.
*
* @param left The left-hand side of the assignment.
* @param right The right-hand side of the assignment.
* @param operationLocation The source map location for the operation.
*/
function writeAssign(left, right, operationLocation) {
writeStatement(ts.setTextRange(factory.createExpressionStatement(factory.createAssignment(left, right)), operationLocation));
}
/**
* Writes a Throw operation to the current label's statement list.
*
* @param expression The value to throw.
* @param operationLocation The source map location for the operation.
*/
function writeThrow(expression, operationLocation) {
lastOperationWasAbrupt = true;
lastOperationWasCompletion = true;
writeStatement(ts.setTextRange(factory.createThrowStatement(expression), operationLocation));
}
/**
* Writes a Return operation to the current label's statement list.
*
* @param expression The value to return.
* @param operationLocation The source map location for the operation.
*/
function writeReturn(expression, operationLocation) {
lastOperationWasAbrupt = true;
lastOperationWasCompletion = true;
writeStatement(ts.setEmitFlags(ts.setTextRange(factory.createReturnStatement(factory.createArrayLiteralExpression(expression
? [createInstruction(2 /* Return */), expression]
: [createInstruction(2 /* Return */)])), operationLocation), 384 /* NoTokenSourceMaps */));
}
/**
* Writes a Break operation to the current label's statement list.
*
* @param label The label for the Break.
* @param operationLocation The source map location for the operation.
*/
function writeBreak(label, operationLocation) {
lastOperationWasAbrupt = true;
writeStatement(ts.setEmitFlags(ts.setTextRange(factory.createReturnStatement(factory.createArrayLiteralExpression([
createInstruction(3 /* Break */),
createLabel(label)
])), operationLocation), 384 /* NoTokenSourceMaps */));
}
/**
* Writes a BreakWhenTrue operation to the current label's statement list.
*
* @param label The label for the Break.
* @param condition The condition for the Break.
* @param operationLocation The source map location for the operation.
*/
function writeBreakWhenTrue(label, condition, operationLocation) {
writeStatement(ts.setEmitFlags(factory.createIfStatement(condition, ts.setEmitFlags(ts.setTextRange(factory.createReturnStatement(factory.createArrayLiteralExpression([
createInstruction(3 /* Break */),
createLabel(label)
])), operationLocation), 384 /* NoTokenSourceMaps */)), 1 /* SingleLine */));
}
/**
* Writes a BreakWhenFalse operation to the current label's statement list.
*
* @param label The label for the Break.
* @param condition The condition for the Break.
* @param operationLocation The source map location for the operation.
*/
function writeBreakWhenFalse(label, condition, operationLocation) {
writeStatement(ts.setEmitFlags(factory.createIfStatement(factory.createLogicalNot(condition), ts.setEmitFlags(ts.setTextRange(factory.createReturnStatement(factory.createArrayLiteralExpression([
createInstruction(3 /* Break */),
createLabel(label)
])), operationLocation), 384 /* NoTokenSourceMaps */)), 1 /* SingleLine */));
}
/**
* Writes a Yield operation to the current label's statement list.
*
* @param expression The expression to yield.
* @param operationLocation The source map location for the operation.
*/
function writeYield(expression, operationLocation) {
lastOperationWasAbrupt = true;
writeStatement(ts.setEmitFlags(ts.setTextRange(factory.createReturnStatement(factory.createArrayLiteralExpression(expression
? [createInstruction(4 /* Yield */), expression]
: [createInstruction(4 /* Yield */)])), operationLocation), 384 /* NoTokenSourceMaps */));
}
/**
* Writes a YieldStar instruction to the current label's statement list.
*
* @param expression The expression to yield.
* @param operationLocation The source map location for the operation.
*/
function writeYieldStar(expression, operationLocation) {
lastOperationWasAbrupt = true;
writeStatement(ts.setEmitFlags(ts.setTextRange(factory.createReturnStatement(factory.createArrayLiteralExpression([
createInstruction(5 /* YieldStar */),
expression
])), operationLocation), 384 /* NoTokenSourceMaps */));
}
/**
* Writes an Endfinally instruction to the current label's statement list.
*/
function writeEndfinally() {
lastOperationWasAbrupt = true;
writeStatement(factory.createReturnStatement(factory.createArrayLiteralExpression([
createInstruction(7 /* Endfinally */)
])));
}
}
ts.transformGenerators = transformGenerators;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
function transformModule(context) {
function getTransformModuleDelegate(moduleKind) {
switch (moduleKind) {
case ts.ModuleKind.AMD: return transformAMDModule;
case ts.ModuleKind.UMD: return transformUMDModule;
default: return transformCommonJSModule;
}
}
var factory = context.factory, emitHelpers = context.getEmitHelperFactory, startLexicalEnvironment = context.startLexicalEnvironment, endLexicalEnvironment = context.endLexicalEnvironment, hoistVariableDeclaration = context.hoistVariableDeclaration;
var compilerOptions = context.getCompilerOptions();
var resolver = context.getEmitResolver();
var host = context.getEmitHost();
var languageVersion = ts.getEmitScriptTarget(compilerOptions);
var moduleKind = ts.getEmitModuleKind(compilerOptions);
var previousOnSubstituteNode = context.onSubstituteNode;
var previousOnEmitNode = context.onEmitNode;
context.onSubstituteNode = onSubstituteNode;
context.onEmitNode = onEmitNode;
context.enableSubstitution(206 /* CallExpression */); // Substitute calls to imported/exported symbols to avoid incorrect `this`.
context.enableSubstitution(208 /* TaggedTemplateExpression */); // Substitute calls to imported/exported symbols to avoid incorrect `this`.
context.enableSubstitution(79 /* Identifier */); // Substitutes expression identifiers with imported/exported symbols.
context.enableSubstitution(219 /* BinaryExpression */); // Substitutes assignments to exported symbols.
context.enableSubstitution(292 /* ShorthandPropertyAssignment */); // Substitutes shorthand property assignments for imported/exported symbols.
context.enableEmitNotification(300 /* SourceFile */); // Restore state when substituting nodes in a file.
var moduleInfoMap = []; // The ExternalModuleInfo for each file.
var deferredExports = []; // Exports to defer until an EndOfDeclarationMarker is found.
var currentSourceFile; // The current file.
var currentModuleInfo; // The ExternalModuleInfo for the current file.
var noSubstitution = []; // Set of nodes for which substitution rules should be ignored.
var needUMDDynamicImportHelper;
return ts.chainBundle(context, transformSourceFile);
/**
* Transforms the module aspects of a SourceFile.
*
* @param node The SourceFile node.
*/
function transformSourceFile(node) {
if (node.isDeclarationFile ||
!(ts.isEffectiveExternalModule(node, compilerOptions) ||
node.transformFlags & 4194304 /* ContainsDynamicImport */ ||
(ts.isJsonSourceFile(node) && ts.hasJsonModuleEmitEnabled(compilerOptions) && ts.outFile(compilerOptions)))) {
return node;
}
currentSourceFile = node;
currentModuleInfo = ts.collectExternalModuleInfo(context, node, resolver, compilerOptions);
moduleInfoMap[ts.getOriginalNodeId(node)] = currentModuleInfo;
// Perform the transformation.
var transformModule = getTransformModuleDelegate(moduleKind);
var updated = transformModule(node);
currentSourceFile = undefined;
currentModuleInfo = undefined;
needUMDDynamicImportHelper = false;
return updated;
}
function shouldEmitUnderscoreUnderscoreESModule() {
if (!currentModuleInfo.exportEquals && ts.isExternalModule(currentSourceFile)) {
return true;
}
return false;
}
/**
* Transforms a SourceFile into a CommonJS module.
*
* @param node The SourceFile node.
*/
function transformCommonJSModule(node) {
startLexicalEnvironment();
var statements = [];
var ensureUseStrict = ts.getStrictOptionValue(compilerOptions, "alwaysStrict") || (!compilerOptions.noImplicitUseStrict && ts.isExternalModule(currentSourceFile));
var statementOffset = factory.copyPrologue(node.statements, statements, ensureUseStrict && !ts.isJsonSourceFile(node), topLevelVisitor);
if (shouldEmitUnderscoreUnderscoreESModule()) {
ts.append(statements, createUnderscoreUnderscoreESModule());
}
if (ts.length(currentModuleInfo.exportedNames)) {
var chunkSize = 50;
for (var i = 0; i < currentModuleInfo.exportedNames.length; i += chunkSize) {
ts.append(statements, factory.createExpressionStatement(ts.reduceLeft(currentModuleInfo.exportedNames.slice(i, i + chunkSize), function (prev, nextId) { return factory.createAssignment(factory.createPropertyAccessExpression(factory.createIdentifier("exports"), factory.createIdentifier(ts.idText(nextId))), prev); }, factory.createVoidZero())));
}
}
ts.append(statements, ts.visitNode(currentModuleInfo.externalHelpersImportDeclaration, topLevelVisitor, ts.isStatement));
ts.addRange(statements, ts.visitNodes(node.statements, topLevelVisitor, ts.isStatement, statementOffset));
addExportEqualsIfNeeded(statements, /*emitAsReturn*/ false);
ts.insertStatementsAfterStandardPrologue(statements, endLexicalEnvironment());
var updated = factory.updateSourceFile(node, ts.setTextRange(factory.createNodeArray(statements), node.statements));
ts.addEmitHelpers(updated, context.readEmitHelpers());
return updated;
}
/**
* Transforms a SourceFile into an AMD module.
*
* @param node The SourceFile node.
*/
function transformAMDModule(node) {
var define = factory.createIdentifier("define");
var moduleName = ts.tryGetModuleNameFromFile(factory, node, host, compilerOptions);
var jsonSourceFile = ts.isJsonSourceFile(node) && node;
// An AMD define function has the following shape:
//
// define(id?, dependencies?, factory);
//
// This has the shape of the following:
//
// define(name, ["module1", "module2"], function (module1Alias) { ... }
//
// The location of the alias in the parameter list in the factory function needs to
// match the position of the module name in the dependency list.
//
// To ensure this is true in cases of modules with no aliases, e.g.:
//
// import "module"
//
// or
//
// /// <amd-dependency path= "a.css" />
//
// we need to add modules without alias names to the end of the dependencies list
var _a = collectAsynchronousDependencies(node, /*includeNonAmdDependencies*/ true), aliasedModuleNames = _a.aliasedModuleNames, unaliasedModuleNames = _a.unaliasedModuleNames, importAliasNames = _a.importAliasNames;
// Create an updated SourceFile:
//
// define(mofactory.updateSourceFile", "module2"], function ...
var updated = factory.updateSourceFile(node, ts.setTextRange(factory.createNodeArray([
factory.createExpressionStatement(factory.createCallExpression(define,
/*typeArguments*/ undefined, __spreadArray(__spreadArray([], (moduleName ? [moduleName] : []), true), [
// Add the dependency array argument:
//
// ["require", "exports", module1", "module2", ...]
factory.createArrayLiteralExpression(jsonSourceFile ? ts.emptyArray : __spreadArray(__spreadArray([
factory.createStringLiteral("require"),
factory.createStringLiteral("exports")
], aliasedModuleNames, true), unaliasedModuleNames, true)),
// Add the module body function argument:
//
// function (require, exports, module1, module2) ...
jsonSourceFile ?
jsonSourceFile.statements.length ? jsonSourceFile.statements[0].expression : factory.createObjectLiteralExpression() :
factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, __spreadArray([
factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, "require"),
factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, "exports")
], importAliasNames, true),
/*type*/ undefined, transformAsynchronousModuleBody(node))
], false)))
]),
/*location*/ node.statements));
ts.addEmitHelpers(updated, context.readEmitHelpers());
return updated;
}
/**
* Transforms a SourceFile into a UMD module.
*
* @param node The SourceFile node.
*/
function transformUMDModule(node) {
var _a = collectAsynchronousDependencies(node, /*includeNonAmdDependencies*/ false), aliasedModuleNames = _a.aliasedModuleNames, unaliasedModuleNames = _a.unaliasedModuleNames, importAliasNames = _a.importAliasNames;
var moduleName = ts.tryGetModuleNameFromFile(factory, node, host, compilerOptions);
var umdHeader = factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, [factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, "factory")],
/*type*/ undefined, ts.setTextRange(factory.createBlock([
factory.createIfStatement(factory.createLogicalAnd(factory.createTypeCheck(factory.createIdentifier("module"), "object"), factory.createTypeCheck(factory.createPropertyAccessExpression(factory.createIdentifier("module"), "exports"), "object")), factory.createBlock([
factory.createVariableStatement(
/*modifiers*/ undefined, [
factory.createVariableDeclaration("v",
/*exclamationToken*/ undefined,
/*type*/ undefined, factory.createCallExpression(factory.createIdentifier("factory"),
/*typeArguments*/ undefined, [
factory.createIdentifier("require"),
factory.createIdentifier("exports")
]))
]),
ts.setEmitFlags(factory.createIfStatement(factory.createStrictInequality(factory.createIdentifier("v"), factory.createIdentifier("undefined")), factory.createExpressionStatement(factory.createAssignment(factory.createPropertyAccessExpression(factory.createIdentifier("module"), "exports"), factory.createIdentifier("v")))), 1 /* SingleLine */)
]), factory.createIfStatement(factory.createLogicalAnd(factory.createTypeCheck(factory.createIdentifier("define"), "function"), factory.createPropertyAccessExpression(factory.createIdentifier("define"), "amd")), factory.createBlock([
factory.createExpressionStatement(factory.createCallExpression(factory.createIdentifier("define"),
/*typeArguments*/ undefined, __spreadArray(__spreadArray([], (moduleName ? [moduleName] : []), true), [
factory.createArrayLiteralExpression(__spreadArray(__spreadArray([
factory.createStringLiteral("require"),
factory.createStringLiteral("exports")
], aliasedModuleNames, true), unaliasedModuleNames, true)),
factory.createIdentifier("factory")
], false)))
])))
],
/*multiLine*/ true),
/*location*/ undefined));
// Create an updated SourceFile:
//
// (function (factory) {
// if (typeof module === "object" && typeof module.exports === "object") {
// var v = factory(require, exports);
// if (v !== undefined) module.exports = v;
// }
// else if (typeof define === 'function' && define.amd) {
// define(["require", "exports"], factory);
// }
// })(function ...)
var updated = factory.updateSourceFile(node, ts.setTextRange(factory.createNodeArray([
factory.createExpressionStatement(factory.createCallExpression(umdHeader,
/*typeArguments*/ undefined, [
// Add the module body function argument:
//
// function (require, exports) ...
factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, __spreadArray([
factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, "require"),
factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, "exports")
], importAliasNames, true),
/*type*/ undefined, transformAsynchronousModuleBody(node))
]))
]),
/*location*/ node.statements));
ts.addEmitHelpers(updated, context.readEmitHelpers());
return updated;
}
/**
* Collect the additional asynchronous dependencies for the module.
*
* @param node The source file.
* @param includeNonAmdDependencies A value indicating whether to include non-AMD dependencies.
*/
function collectAsynchronousDependencies(node, includeNonAmdDependencies) {
// names of modules with corresponding parameter in the factory function
var aliasedModuleNames = [];
// names of modules with no corresponding parameters in factory function
var unaliasedModuleNames = [];
// names of the parameters in the factory function; these
// parameters need to match the indexes of the corresponding
// module names in aliasedModuleNames.
var importAliasNames = [];
// Fill in amd-dependency tags
for (var _i = 0, _a = node.amdDependencies; _i < _a.length; _i++) {
var amdDependency = _a[_i];
if (amdDependency.name) {
aliasedModuleNames.push(factory.createStringLiteral(amdDependency.path));
importAliasNames.push(factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, amdDependency.name));
}
else {
unaliasedModuleNames.push(factory.createStringLiteral(amdDependency.path));
}
}
for (var _b = 0, _c = currentModuleInfo.externalImports; _b < _c.length; _b++) {
var importNode = _c[_b];
// Find the name of the external module
var externalModuleName = ts.getExternalModuleNameLiteral(factory, importNode, currentSourceFile, host, resolver, compilerOptions);
// Find the name of the module alias, if there is one
var importAliasName = ts.getLocalNameForExternalImport(factory, importNode, currentSourceFile);
// It is possible that externalModuleName is undefined if it is not string literal.
// This can happen in the invalid import syntax.
// E.g : "import * from alias from 'someLib';"
if (externalModuleName) {
if (includeNonAmdDependencies && importAliasName) {
// Set emitFlags on the name of the classDeclaration
// This is so that when printer will not substitute the identifier
ts.setEmitFlags(importAliasName, 4 /* NoSubstitution */);
aliasedModuleNames.push(externalModuleName);
importAliasNames.push(factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, importAliasName));
}
else {
unaliasedModuleNames.push(externalModuleName);
}
}
}
return { aliasedModuleNames: aliasedModuleNames, unaliasedModuleNames: unaliasedModuleNames, importAliasNames: importAliasNames };
}
function getAMDImportExpressionForImport(node) {
if (ts.isImportEqualsDeclaration(node) || ts.isExportDeclaration(node) || !ts.getExternalModuleNameLiteral(factory, node, currentSourceFile, host, resolver, compilerOptions)) {
return undefined;
}
var name = ts.getLocalNameForExternalImport(factory, node, currentSourceFile); // TODO: GH#18217
var expr = getHelperExpressionForImport(node, name);
if (expr === name) {
return undefined;
}
return factory.createExpressionStatement(factory.createAssignment(name, expr));
}
/**
* Transforms a SourceFile into an AMD or UMD module body.
*
* @param node The SourceFile node.
*/
function transformAsynchronousModuleBody(node) {
startLexicalEnvironment();
var statements = [];
var statementOffset = factory.copyPrologue(node.statements, statements, /*ensureUseStrict*/ !compilerOptions.noImplicitUseStrict, topLevelVisitor);
if (shouldEmitUnderscoreUnderscoreESModule()) {
ts.append(statements, createUnderscoreUnderscoreESModule());
}
if (ts.length(currentModuleInfo.exportedNames)) {
ts.append(statements, factory.createExpressionStatement(ts.reduceLeft(currentModuleInfo.exportedNames, function (prev, nextId) { return factory.createAssignment(factory.createPropertyAccessExpression(factory.createIdentifier("exports"), factory.createIdentifier(ts.idText(nextId))), prev); }, factory.createVoidZero())));
}
// Visit each statement of the module body.
ts.append(statements, ts.visitNode(currentModuleInfo.externalHelpersImportDeclaration, topLevelVisitor, ts.isStatement));
if (moduleKind === ts.ModuleKind.AMD) {
ts.addRange(statements, ts.mapDefined(currentModuleInfo.externalImports, getAMDImportExpressionForImport));
}
ts.addRange(statements, ts.visitNodes(node.statements, topLevelVisitor, ts.isStatement, statementOffset));
// Append the 'export =' statement if provided.
addExportEqualsIfNeeded(statements, /*emitAsReturn*/ true);
// End the lexical environment for the module body
// and merge any new lexical declarations.
ts.insertStatementsAfterStandardPrologue(statements, endLexicalEnvironment());
var body = factory.createBlock(statements, /*multiLine*/ true);
if (needUMDDynamicImportHelper) {
ts.addEmitHelper(body, dynamicImportUMDHelper);
}
return body;
}
/**
* Adds the down-level representation of `export=` to the statement list if one exists
* in the source file.
*
* @param statements The Statement list to modify.
* @param emitAsReturn A value indicating whether to emit the `export=` statement as a
* return statement.
*/
function addExportEqualsIfNeeded(statements, emitAsReturn) {
if (currentModuleInfo.exportEquals) {
var expressionResult = ts.visitNode(currentModuleInfo.exportEquals.expression, visitor);
if (expressionResult) {
if (emitAsReturn) {
var statement = factory.createReturnStatement(expressionResult);
ts.setTextRange(statement, currentModuleInfo.exportEquals);
ts.setEmitFlags(statement, 384 /* NoTokenSourceMaps */ | 1536 /* NoComments */);
statements.push(statement);
}
else {
var statement = factory.createExpressionStatement(factory.createAssignment(factory.createPropertyAccessExpression(factory.createIdentifier("module"), "exports"), expressionResult));
ts.setTextRange(statement, currentModuleInfo.exportEquals);
ts.setEmitFlags(statement, 1536 /* NoComments */);
statements.push(statement);
}
}
}
}
//
// Top-Level Source Element Visitors
//
/**
* Visits a node at the top level of the source file.
*
* @param node The node to visit.
*/
function topLevelVisitor(node) {
switch (node.kind) {
case 264 /* ImportDeclaration */:
return visitImportDeclaration(node);
case 263 /* ImportEqualsDeclaration */:
return visitImportEqualsDeclaration(node);
case 270 /* ExportDeclaration */:
return visitExportDeclaration(node);
case 269 /* ExportAssignment */:
return visitExportAssignment(node);
case 235 /* VariableStatement */:
return visitVariableStatement(node);
case 254 /* FunctionDeclaration */:
return visitFunctionDeclaration(node);
case 255 /* ClassDeclaration */:
return visitClassDeclaration(node);
case 347 /* MergeDeclarationMarker */:
return visitMergeDeclarationMarker(node);
case 348 /* EndOfDeclarationMarker */:
return visitEndOfDeclarationMarker(node);
default:
return visitor(node);
}
}
function visitorWorker(node, valueIsDiscarded) {
// This visitor does not need to descend into the tree if there is no dynamic import, destructuring assignment, or update expression
// as export/import statements are only transformed at the top level of a file.
if (!(node.transformFlags & (4194304 /* ContainsDynamicImport */ | 2048 /* ContainsDestructuringAssignment */ | 67108864 /* ContainsUpdateExpressionForIdentifier */))) {
return node;
}
switch (node.kind) {
case 240 /* ForStatement */:
return visitForStatement(node);
case 236 /* ExpressionStatement */:
return visitExpressionStatement(node);
case 210 /* ParenthesizedExpression */:
return visitParenthesizedExpression(node, valueIsDiscarded);
case 345 /* PartiallyEmittedExpression */:
return visitPartiallyEmittedExpression(node, valueIsDiscarded);
case 206 /* CallExpression */:
if (ts.isImportCall(node)) {
return visitImportCallExpression(node);
}
break;
case 219 /* BinaryExpression */:
if (ts.isDestructuringAssignment(node)) {
return visitDestructuringAssignment(node, valueIsDiscarded);
}
break;
case 217 /* PrefixUnaryExpression */:
case 218 /* PostfixUnaryExpression */:
return visitPreOrPostfixUnaryExpression(node, valueIsDiscarded);
}
return ts.visitEachChild(node, visitor, context);
}
function visitor(node) {
return visitorWorker(node, /*valueIsDiscarded*/ false);
}
function discardedValueVisitor(node) {
return visitorWorker(node, /*valueIsDiscarded*/ true);
}
function destructuringNeedsFlattening(node) {
if (ts.isObjectLiteralExpression(node)) {
for (var _i = 0, _a = node.properties; _i < _a.length; _i++) {
var elem = _a[_i];
switch (elem.kind) {
case 291 /* PropertyAssignment */:
if (destructuringNeedsFlattening(elem.initializer)) {
return true;
}
break;
case 292 /* ShorthandPropertyAssignment */:
if (destructuringNeedsFlattening(elem.name)) {
return true;
}
break;
case 293 /* SpreadAssignment */:
if (destructuringNeedsFlattening(elem.expression)) {
return true;
}
break;
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return false;
default: ts.Debug.assertNever(elem, "Unhandled object member kind");
}
}
}
else if (ts.isArrayLiteralExpression(node)) {
for (var _b = 0, _c = node.elements; _b < _c.length; _b++) {
var elem = _c[_b];
if (ts.isSpreadElement(elem)) {
if (destructuringNeedsFlattening(elem.expression)) {
return true;
}
}
else if (destructuringNeedsFlattening(elem)) {
return true;
}
}
}
else if (ts.isIdentifier(node)) {
return ts.length(getExports(node)) > (ts.isExportName(node) ? 1 : 0);
}
return false;
}
function visitDestructuringAssignment(node, valueIsDiscarded) {
if (destructuringNeedsFlattening(node.left)) {
return ts.flattenDestructuringAssignment(node, visitor, context, 0 /* All */, !valueIsDiscarded, createAllExportExpressions);
}
return ts.visitEachChild(node, visitor, context);
}
function visitForStatement(node) {
return factory.updateForStatement(node, ts.visitNode(node.initializer, discardedValueVisitor, ts.isForInitializer), ts.visitNode(node.condition, visitor, ts.isExpression), ts.visitNode(node.incrementor, discardedValueVisitor, ts.isExpression), ts.visitIterationBody(node.statement, visitor, context));
}
function visitExpressionStatement(node) {
return factory.updateExpressionStatement(node, ts.visitNode(node.expression, discardedValueVisitor, ts.isExpression));
}
function visitParenthesizedExpression(node, valueIsDiscarded) {
return factory.updateParenthesizedExpression(node, ts.visitNode(node.expression, valueIsDiscarded ? discardedValueVisitor : visitor, ts.isExpression));
}
function visitPartiallyEmittedExpression(node, valueIsDiscarded) {
return factory.updatePartiallyEmittedExpression(node, ts.visitNode(node.expression, valueIsDiscarded ? discardedValueVisitor : visitor, ts.isExpression));
}
function visitPreOrPostfixUnaryExpression(node, valueIsDiscarded) {
// When we see a prefix or postfix increment expression whose operand is an exported
// symbol, we should ensure all exports of that symbol are updated with the correct
// value.
//
// - We do not transform generated identifiers for any reason.
// - We do not transform identifiers tagged with the LocalName flag.
// - We do not transform identifiers that were originally the name of an enum or
// namespace due to how they are transformed in TypeScript.
// - We only transform identifiers that are exported at the top level.
if ((node.operator === 45 /* PlusPlusToken */ || node.operator === 46 /* MinusMinusToken */)
&& ts.isIdentifier(node.operand)
&& !ts.isGeneratedIdentifier(node.operand)
&& !ts.isLocalName(node.operand)
&& !ts.isDeclarationNameOfEnumOrNamespace(node.operand)) {
var exportedNames = getExports(node.operand);
if (exportedNames) {
var temp = void 0;
var expression = ts.visitNode(node.operand, visitor, ts.isExpression);
if (ts.isPrefixUnaryExpression(node)) {
expression = factory.updatePrefixUnaryExpression(node, expression);
}
else {
expression = factory.updatePostfixUnaryExpression(node, expression);
if (!valueIsDiscarded) {
temp = factory.createTempVariable(hoistVariableDeclaration);
expression = factory.createAssignment(temp, expression);
ts.setTextRange(expression, node);
}
expression = factory.createComma(expression, factory.cloneNode(node.operand));
ts.setTextRange(expression, node);
}
for (var _i = 0, exportedNames_1 = exportedNames; _i < exportedNames_1.length; _i++) {
var exportName = exportedNames_1[_i];
noSubstitution[ts.getNodeId(expression)] = true;
expression = createExportExpression(exportName, expression);
ts.setTextRange(expression, node);
}
if (temp) {
noSubstitution[ts.getNodeId(expression)] = true;
expression = factory.createComma(expression, temp);
ts.setTextRange(expression, node);
}
return expression;
}
}
return ts.visitEachChild(node, visitor, context);
}
function visitImportCallExpression(node) {
var externalModuleName = ts.getExternalModuleNameLiteral(factory, node, currentSourceFile, host, resolver, compilerOptions);
var firstArgument = ts.visitNode(ts.firstOrUndefined(node.arguments), visitor);
// Only use the external module name if it differs from the first argument. This allows us to preserve the quote style of the argument on output.
var argument = externalModuleName && (!firstArgument || !ts.isStringLiteral(firstArgument) || firstArgument.text !== externalModuleName.text) ? externalModuleName : firstArgument;
var containsLexicalThis = !!(node.transformFlags & 8192 /* ContainsLexicalThis */);
switch (compilerOptions.module) {
case ts.ModuleKind.AMD:
return createImportCallExpressionAMD(argument, containsLexicalThis);
case ts.ModuleKind.UMD:
return createImportCallExpressionUMD(argument !== null && argument !== void 0 ? argument : factory.createVoidZero(), containsLexicalThis);
case ts.ModuleKind.CommonJS:
default:
return createImportCallExpressionCommonJS(argument, containsLexicalThis);
}
}
function createImportCallExpressionUMD(arg, containsLexicalThis) {
// (function (factory) {
// ... (regular UMD)
// }
// })(function (require, exports, useSyncRequire) {
// "use strict";
// Object.defineProperty(exports, "__esModule", { value: true });
// var __syncRequire = typeof module === "object" && typeof module.exports === "object";
// var __resolved = new Promise(function (resolve) { resolve(); });
// .....
// __syncRequire
// ? __resolved.then(function () { return require(x); }) /*CommonJs Require*/
// : new Promise(function (_a, _b) { require([x], _a, _b); }); /*Amd Require*/
// });
needUMDDynamicImportHelper = true;
if (ts.isSimpleCopiableExpression(arg)) {
var argClone = ts.isGeneratedIdentifier(arg) ? arg : ts.isStringLiteral(arg) ? factory.createStringLiteralFromNode(arg) : ts.setEmitFlags(ts.setTextRange(factory.cloneNode(arg), arg), 1536 /* NoComments */);
return factory.createConditionalExpression(
/*condition*/ factory.createIdentifier("__syncRequire"),
/*questionToken*/ undefined,
/*whenTrue*/ createImportCallExpressionCommonJS(arg, containsLexicalThis),
/*colonToken*/ undefined,
/*whenFalse*/ createImportCallExpressionAMD(argClone, containsLexicalThis));
}
else {
var temp = factory.createTempVariable(hoistVariableDeclaration);
return factory.createComma(factory.createAssignment(temp, arg), factory.createConditionalExpression(
/*condition*/ factory.createIdentifier("__syncRequire"),
/*questionToken*/ undefined,
/*whenTrue*/ createImportCallExpressionCommonJS(temp, containsLexicalThis),
/*colonToken*/ undefined,
/*whenFalse*/ createImportCallExpressionAMD(temp, containsLexicalThis)));
}
}
function createImportCallExpressionAMD(arg, containsLexicalThis) {
// improt("./blah")
// emit as
// define(["require", "exports", "blah"], function (require, exports) {
// ...
// new Promise(function (_a, _b) { require([x], _a, _b); }); /*Amd Require*/
// });
var resolve = factory.createUniqueName("resolve");
var reject = factory.createUniqueName("reject");
var parameters = [
factory.createParameterDeclaration(/*decorator*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, /*name*/ resolve),
factory.createParameterDeclaration(/*decorator*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, /*name*/ reject)
];
var body = factory.createBlock([
factory.createExpressionStatement(factory.createCallExpression(factory.createIdentifier("require"),
/*typeArguments*/ undefined, [factory.createArrayLiteralExpression([arg || factory.createOmittedExpression()]), resolve, reject]))
]);
var func;
if (languageVersion >= 2 /* ES2015 */) {
func = factory.createArrowFunction(
/*modifiers*/ undefined,
/*typeParameters*/ undefined, parameters,
/*type*/ undefined,
/*equalsGreaterThanToken*/ undefined, body);
}
else {
func = factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, parameters,
/*type*/ undefined, body);
// if there is a lexical 'this' in the import call arguments, ensure we indicate
// that this new function expression indicates it captures 'this' so that the
// es2015 transformer will properly substitute 'this' with '_this'.
if (containsLexicalThis) {
ts.setEmitFlags(func, 8 /* CapturesThis */);
}
}
var promise = factory.createNewExpression(factory.createIdentifier("Promise"), /*typeArguments*/ undefined, [func]);
if (compilerOptions.esModuleInterop) {
return factory.createCallExpression(factory.createPropertyAccessExpression(promise, factory.createIdentifier("then")), /*typeArguments*/ undefined, [emitHelpers().createImportStarCallbackHelper()]);
}
return promise;
}
function createImportCallExpressionCommonJS(arg, containsLexicalThis) {
// import("./blah")
// emit as
// Promise.resolve().then(function () { return require(x); }) /*CommonJs Require*/
// We have to wrap require in then callback so that require is done in asynchronously
// if we simply do require in resolve callback in Promise constructor. We will execute the loading immediately
var promiseResolveCall = factory.createCallExpression(factory.createPropertyAccessExpression(factory.createIdentifier("Promise"), "resolve"), /*typeArguments*/ undefined, /*argumentsArray*/ []);
var requireCall = factory.createCallExpression(factory.createIdentifier("require"), /*typeArguments*/ undefined, arg ? [arg] : []);
if (compilerOptions.esModuleInterop) {
requireCall = emitHelpers().createImportStarHelper(requireCall);
}
var func;
if (languageVersion >= 2 /* ES2015 */) {
func = factory.createArrowFunction(
/*modifiers*/ undefined,
/*typeParameters*/ undefined,
/*parameters*/ [],
/*type*/ undefined,
/*equalsGreaterThanToken*/ undefined, requireCall);
}
else {
func = factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined,
/*parameters*/ [],
/*type*/ undefined, factory.createBlock([factory.createReturnStatement(requireCall)]));
// if there is a lexical 'this' in the import call arguments, ensure we indicate
// that this new function expression indicates it captures 'this' so that the
// es2015 transformer will properly substitute 'this' with '_this'.
if (containsLexicalThis) {
ts.setEmitFlags(func, 8 /* CapturesThis */);
}
}
return factory.createCallExpression(factory.createPropertyAccessExpression(promiseResolveCall, "then"), /*typeArguments*/ undefined, [func]);
}
function getHelperExpressionForExport(node, innerExpr) {
if (!compilerOptions.esModuleInterop || ts.getEmitFlags(node) & 67108864 /* NeverApplyImportHelper */) {
return innerExpr;
}
if (ts.getExportNeedsImportStarHelper(node)) {
return emitHelpers().createImportStarHelper(innerExpr);
}
return innerExpr;
}
function getHelperExpressionForImport(node, innerExpr) {
if (!compilerOptions.esModuleInterop || ts.getEmitFlags(node) & 67108864 /* NeverApplyImportHelper */) {
return innerExpr;
}
if (ts.getImportNeedsImportStarHelper(node)) {
return emitHelpers().createImportStarHelper(innerExpr);
}
if (ts.getImportNeedsImportDefaultHelper(node)) {
return emitHelpers().createImportDefaultHelper(innerExpr);
}
return innerExpr;
}
/**
* Visits an ImportDeclaration node.
*
* @param node The node to visit.
*/
function visitImportDeclaration(node) {
var statements;
var namespaceDeclaration = ts.getNamespaceDeclarationNode(node);
if (moduleKind !== ts.ModuleKind.AMD) {
if (!node.importClause) {
// import "mod";
return ts.setOriginalNode(ts.setTextRange(factory.createExpressionStatement(createRequireCall(node)), node), node);
}
else {
var variables = [];
if (namespaceDeclaration && !ts.isDefaultImport(node)) {
// import * as n from "mod";
variables.push(factory.createVariableDeclaration(factory.cloneNode(namespaceDeclaration.name),
/*exclamationToken*/ undefined,
/*type*/ undefined, getHelperExpressionForImport(node, createRequireCall(node))));
}
else {
// import d from "mod";
// import { x, y } from "mod";
// import d, { x, y } from "mod";
// import d, * as n from "mod";
variables.push(factory.createVariableDeclaration(factory.getGeneratedNameForNode(node),
/*exclamationToken*/ undefined,
/*type*/ undefined, getHelperExpressionForImport(node, createRequireCall(node))));
if (namespaceDeclaration && ts.isDefaultImport(node)) {
variables.push(factory.createVariableDeclaration(factory.cloneNode(namespaceDeclaration.name),
/*exclamationToken*/ undefined,
/*type*/ undefined, factory.getGeneratedNameForNode(node)));
}
}
statements = ts.append(statements, ts.setOriginalNode(ts.setTextRange(factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList(variables, languageVersion >= 2 /* ES2015 */ ? 2 /* Const */ : 0 /* None */)),
/*location*/ node),
/*original*/ node));
}
}
else if (namespaceDeclaration && ts.isDefaultImport(node)) {
// import d, * as n from "mod";
statements = ts.append(statements, factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList([
ts.setOriginalNode(ts.setTextRange(factory.createVariableDeclaration(factory.cloneNode(namespaceDeclaration.name),
/*exclamationToken*/ undefined,
/*type*/ undefined, factory.getGeneratedNameForNode(node)),
/*location*/ node),
/*original*/ node)
], languageVersion >= 2 /* ES2015 */ ? 2 /* Const */ : 0 /* None */)));
}
if (hasAssociatedEndOfDeclarationMarker(node)) {
// Defer exports until we encounter an EndOfDeclarationMarker node
var id = ts.getOriginalNodeId(node);
deferredExports[id] = appendExportsOfImportDeclaration(deferredExports[id], node);
}
else {
statements = appendExportsOfImportDeclaration(statements, node);
}
return ts.singleOrMany(statements);
}
/**
* Creates a `require()` call to import an external module.
*
* @param importNode The declararation to import.
*/
function createRequireCall(importNode) {
var moduleName = ts.getExternalModuleNameLiteral(factory, importNode, currentSourceFile, host, resolver, compilerOptions);
var args = [];
if (moduleName) {
args.push(moduleName);
}
return factory.createCallExpression(factory.createIdentifier("require"), /*typeArguments*/ undefined, args);
}
/**
* Visits an ImportEqualsDeclaration node.
*
* @param node The node to visit.
*/
function visitImportEqualsDeclaration(node) {
ts.Debug.assert(ts.isExternalModuleImportEqualsDeclaration(node), "import= for internal module references should be handled in an earlier transformer.");
var statements;
if (moduleKind !== ts.ModuleKind.AMD) {
if (ts.hasSyntacticModifier(node, 1 /* Export */)) {
statements = ts.append(statements, ts.setOriginalNode(ts.setTextRange(factory.createExpressionStatement(createExportExpression(node.name, createRequireCall(node))), node), node));
}
else {
statements = ts.append(statements, ts.setOriginalNode(ts.setTextRange(factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList([
factory.createVariableDeclaration(factory.cloneNode(node.name),
/*exclamationToken*/ undefined,
/*type*/ undefined, createRequireCall(node))
],
/*flags*/ languageVersion >= 2 /* ES2015 */ ? 2 /* Const */ : 0 /* None */)), node), node));
}
}
else {
if (ts.hasSyntacticModifier(node, 1 /* Export */)) {
statements = ts.append(statements, ts.setOriginalNode(ts.setTextRange(factory.createExpressionStatement(createExportExpression(factory.getExportName(node), factory.getLocalName(node))), node), node));
}
}
if (hasAssociatedEndOfDeclarationMarker(node)) {
// Defer exports until we encounter an EndOfDeclarationMarker node
var id = ts.getOriginalNodeId(node);
deferredExports[id] = appendExportsOfImportEqualsDeclaration(deferredExports[id], node);
}
else {
statements = appendExportsOfImportEqualsDeclaration(statements, node);
}
return ts.singleOrMany(statements);
}
/**
* Visits an ExportDeclaration node.
*
* @param The node to visit.
*/
function visitExportDeclaration(node) {
if (!node.moduleSpecifier) {
// Elide export declarations with no module specifier as they are handled
// elsewhere.
return undefined;
}
var generatedName = factory.getGeneratedNameForNode(node);
if (node.exportClause && ts.isNamedExports(node.exportClause)) {
var statements = [];
// export { x, y } from "mod";
if (moduleKind !== ts.ModuleKind.AMD) {
statements.push(ts.setOriginalNode(ts.setTextRange(factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList([
factory.createVariableDeclaration(generatedName,
/*exclamationToken*/ undefined,
/*type*/ undefined, createRequireCall(node))
])),
/*location*/ node),
/* original */ node));
}
for (var _i = 0, _a = node.exportClause.elements; _i < _a.length; _i++) {
var specifier = _a[_i];
if (languageVersion === 0 /* ES3 */) {
statements.push(ts.setOriginalNode(ts.setTextRange(factory.createExpressionStatement(emitHelpers().createCreateBindingHelper(generatedName, factory.createStringLiteralFromNode(specifier.propertyName || specifier.name), specifier.propertyName ? factory.createStringLiteralFromNode(specifier.name) : undefined)), specifier), specifier));
}
else {
var exportNeedsImportDefault = !!compilerOptions.esModuleInterop &&
!(ts.getEmitFlags(node) & 67108864 /* NeverApplyImportHelper */) &&
ts.idText(specifier.propertyName || specifier.name) === "default";
var exportedValue = factory.createPropertyAccessExpression(exportNeedsImportDefault ? emitHelpers().createImportDefaultHelper(generatedName) : generatedName, specifier.propertyName || specifier.name);
statements.push(ts.setOriginalNode(ts.setTextRange(factory.createExpressionStatement(createExportExpression(factory.getExportName(specifier), exportedValue, /* location */ undefined, /* liveBinding */ true)), specifier), specifier));
}
}
return ts.singleOrMany(statements);
}
else if (node.exportClause) {
var statements = [];
// export * as ns from "mod";
// export * as default from "mod";
statements.push(ts.setOriginalNode(ts.setTextRange(factory.createExpressionStatement(createExportExpression(factory.cloneNode(node.exportClause.name), getHelperExpressionForExport(node, moduleKind !== ts.ModuleKind.AMD ?
createRequireCall(node) :
ts.isExportNamespaceAsDefaultDeclaration(node) ? generatedName :
factory.createIdentifier(ts.idText(node.exportClause.name))))), node), node));
return ts.singleOrMany(statements);
}
else {
// export * from "mod";
return ts.setOriginalNode(ts.setTextRange(factory.createExpressionStatement(emitHelpers().createExportStarHelper(moduleKind !== ts.ModuleKind.AMD ? createRequireCall(node) : generatedName)), node), node);
}
}
/**
* Visits an ExportAssignment node.
*
* @param node The node to visit.
*/
function visitExportAssignment(node) {
if (node.isExportEquals) {
return undefined;
}
var statements;
var original = node.original;
if (original && hasAssociatedEndOfDeclarationMarker(original)) {
// Defer exports until we encounter an EndOfDeclarationMarker node
var id = ts.getOriginalNodeId(node);
deferredExports[id] = appendExportStatement(deferredExports[id], factory.createIdentifier("default"), ts.visitNode(node.expression, visitor), /*location*/ node, /*allowComments*/ true);
}
else {
statements = appendExportStatement(statements, factory.createIdentifier("default"), ts.visitNode(node.expression, visitor), /*location*/ node, /*allowComments*/ true);
}
return ts.singleOrMany(statements);
}
/**
* Visits a FunctionDeclaration node.
*
* @param node The node to visit.
*/
function visitFunctionDeclaration(node) {
var statements;
if (ts.hasSyntacticModifier(node, 1 /* Export */)) {
statements = ts.append(statements, ts.setOriginalNode(ts.setTextRange(factory.createFunctionDeclaration(
/*decorators*/ undefined, ts.visitNodes(node.modifiers, modifierVisitor, ts.isModifier), node.asteriskToken, factory.getDeclarationName(node, /*allowComments*/ true, /*allowSourceMaps*/ true),
/*typeParameters*/ undefined, ts.visitNodes(node.parameters, visitor),
/*type*/ undefined, ts.visitEachChild(node.body, visitor, context)),
/*location*/ node),
/*original*/ node));
}
else {
statements = ts.append(statements, ts.visitEachChild(node, visitor, context));
}
if (hasAssociatedEndOfDeclarationMarker(node)) {
// Defer exports until we encounter an EndOfDeclarationMarker node
var id = ts.getOriginalNodeId(node);
deferredExports[id] = appendExportsOfHoistedDeclaration(deferredExports[id], node);
}
else {
statements = appendExportsOfHoistedDeclaration(statements, node);
}
return ts.singleOrMany(statements);
}
/**
* Visits a ClassDeclaration node.
*
* @param node The node to visit.
*/
function visitClassDeclaration(node) {
var statements;
if (ts.hasSyntacticModifier(node, 1 /* Export */)) {
statements = ts.append(statements, ts.setOriginalNode(ts.setTextRange(factory.createClassDeclaration(
/*decorators*/ undefined, ts.visitNodes(node.modifiers, modifierVisitor, ts.isModifier), factory.getDeclarationName(node, /*allowComments*/ true, /*allowSourceMaps*/ true),
/*typeParameters*/ undefined, ts.visitNodes(node.heritageClauses, visitor), ts.visitNodes(node.members, visitor)), node), node));
}
else {
statements = ts.append(statements, ts.visitEachChild(node, visitor, context));
}
if (hasAssociatedEndOfDeclarationMarker(node)) {
// Defer exports until we encounter an EndOfDeclarationMarker node
var id = ts.getOriginalNodeId(node);
deferredExports[id] = appendExportsOfHoistedDeclaration(deferredExports[id], node);
}
else {
statements = appendExportsOfHoistedDeclaration(statements, node);
}
return ts.singleOrMany(statements);
}
/**
* Visits a VariableStatement node.
*
* @param node The node to visit.
*/
function visitVariableStatement(node) {
var statements;
var variables;
var expressions;
if (ts.hasSyntacticModifier(node, 1 /* Export */)) {
var modifiers = void 0;
var removeCommentsOnExpressions = false;
// If we're exporting these variables, then these just become assignments to 'exports.x'.
for (var _i = 0, _a = node.declarationList.declarations; _i < _a.length; _i++) {
var variable = _a[_i];
if (ts.isIdentifier(variable.name) && ts.isLocalName(variable.name)) {
if (!modifiers) {
modifiers = ts.visitNodes(node.modifiers, modifierVisitor, ts.isModifier);
}
variables = ts.append(variables, variable);
}
else if (variable.initializer) {
if (!ts.isBindingPattern(variable.name) && (ts.isArrowFunction(variable.initializer) || ts.isFunctionExpression(variable.initializer) || ts.isClassExpression(variable.initializer))) {
var expression = factory.createAssignment(ts.setTextRange(factory.createPropertyAccessExpression(factory.createIdentifier("exports"), variable.name),
/*location*/ variable.name), factory.createIdentifier(ts.getTextOfIdentifierOrLiteral(variable.name)));
var updatedVariable = factory.createVariableDeclaration(variable.name, variable.exclamationToken, variable.type, ts.visitNode(variable.initializer, visitor));
variables = ts.append(variables, updatedVariable);
expressions = ts.append(expressions, expression);
removeCommentsOnExpressions = true;
}
else {
expressions = ts.append(expressions, transformInitializedVariable(variable));
}
}
}
if (variables) {
statements = ts.append(statements, factory.updateVariableStatement(node, modifiers, factory.updateVariableDeclarationList(node.declarationList, variables)));
}
if (expressions) {
var statement = ts.setOriginalNode(ts.setTextRange(factory.createExpressionStatement(factory.inlineExpressions(expressions)), node), node);
if (removeCommentsOnExpressions) {
ts.removeAllComments(statement);
}
statements = ts.append(statements, statement);
}
}
else {
statements = ts.append(statements, ts.visitEachChild(node, visitor, context));
}
if (hasAssociatedEndOfDeclarationMarker(node)) {
// Defer exports until we encounter an EndOfDeclarationMarker node
var id = ts.getOriginalNodeId(node);
deferredExports[id] = appendExportsOfVariableStatement(deferredExports[id], node);
}
else {
statements = appendExportsOfVariableStatement(statements, node);
}
return ts.singleOrMany(statements);
}
function createAllExportExpressions(name, value, location) {
var exportedNames = getExports(name);
if (exportedNames) {
// For each additional export of the declaration, apply an export assignment.
var expression = ts.isExportName(name) ? value : factory.createAssignment(name, value);
for (var _i = 0, exportedNames_2 = exportedNames; _i < exportedNames_2.length; _i++) {
var exportName = exportedNames_2[_i];
// Mark the node to prevent triggering substitution.
ts.setEmitFlags(expression, 4 /* NoSubstitution */);
expression = createExportExpression(exportName, expression, /*location*/ location);
}
return expression;
}
return factory.createAssignment(name, value);
}
/**
* Transforms an exported variable with an initializer into an expression.
*
* @param node The node to transform.
*/
function transformInitializedVariable(node) {
if (ts.isBindingPattern(node.name)) {
return ts.flattenDestructuringAssignment(ts.visitNode(node, visitor),
/*visitor*/ undefined, context, 0 /* All */,
/*needsValue*/ false, createAllExportExpressions);
}
else {
return factory.createAssignment(ts.setTextRange(factory.createPropertyAccessExpression(factory.createIdentifier("exports"), node.name),
/*location*/ node.name), node.initializer ? ts.visitNode(node.initializer, visitor) : factory.createVoidZero());
}
}
/**
* Visits a MergeDeclarationMarker used as a placeholder for the beginning of a merged
* and transformed declaration.
*
* @param node The node to visit.
*/
function visitMergeDeclarationMarker(node) {
// For an EnumDeclaration or ModuleDeclaration that merges with a preceeding
// declaration we do not emit a leading variable declaration. To preserve the
// begin/end semantics of the declararation and to properly handle exports
// we wrapped the leading variable declaration in a `MergeDeclarationMarker`.
//
// To balance the declaration, add the exports of the elided variable
// statement.
if (hasAssociatedEndOfDeclarationMarker(node) && node.original.kind === 235 /* VariableStatement */) {
var id = ts.getOriginalNodeId(node);
deferredExports[id] = appendExportsOfVariableStatement(deferredExports[id], node.original);
}
return node;
}
/**
* Determines whether a node has an associated EndOfDeclarationMarker.
*
* @param node The node to test.
*/
function hasAssociatedEndOfDeclarationMarker(node) {
return (ts.getEmitFlags(node) & 4194304 /* HasEndOfDeclarationMarker */) !== 0;
}
/**
* Visits a DeclarationMarker used as a placeholder for the end of a transformed
* declaration.
*
* @param node The node to visit.
*/
function visitEndOfDeclarationMarker(node) {
// For some transformations we emit an `EndOfDeclarationMarker` to mark the actual
// end of the transformed declaration. We use this marker to emit any deferred exports
// of the declaration.
var id = ts.getOriginalNodeId(node);
var statements = deferredExports[id];
if (statements) {
delete deferredExports[id];
return ts.append(statements, node);
}
return node;
}
/**
* Appends the exports of an ImportDeclaration to a statement list, returning the
* statement list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param decl The declaration whose exports are to be recorded.
*/
function appendExportsOfImportDeclaration(statements, decl) {
if (currentModuleInfo.exportEquals) {
return statements;
}
var importClause = decl.importClause;
if (!importClause) {
return statements;
}
if (importClause.name) {
statements = appendExportsOfDeclaration(statements, importClause);
}
var namedBindings = importClause.namedBindings;
if (namedBindings) {
switch (namedBindings.kind) {
case 266 /* NamespaceImport */:
statements = appendExportsOfDeclaration(statements, namedBindings);
break;
case 267 /* NamedImports */:
for (var _i = 0, _a = namedBindings.elements; _i < _a.length; _i++) {
var importBinding = _a[_i];
statements = appendExportsOfDeclaration(statements, importBinding, /* liveBinding */ true);
}
break;
}
}
return statements;
}
/**
* Appends the exports of an ImportEqualsDeclaration to a statement list, returning the
* statement list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param decl The declaration whose exports are to be recorded.
*/
function appendExportsOfImportEqualsDeclaration(statements, decl) {
if (currentModuleInfo.exportEquals) {
return statements;
}
return appendExportsOfDeclaration(statements, decl);
}
/**
* Appends the exports of a VariableStatement to a statement list, returning the statement
* list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param node The VariableStatement whose exports are to be recorded.
*/
function appendExportsOfVariableStatement(statements, node) {
if (currentModuleInfo.exportEquals) {
return statements;
}
for (var _i = 0, _a = node.declarationList.declarations; _i < _a.length; _i++) {
var decl = _a[_i];
statements = appendExportsOfBindingElement(statements, decl);
}
return statements;
}
/**
* Appends the exports of a VariableDeclaration or BindingElement to a statement list,
* returning the statement list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param decl The declaration whose exports are to be recorded.
*/
function appendExportsOfBindingElement(statements, decl) {
if (currentModuleInfo.exportEquals) {
return statements;
}
if (ts.isBindingPattern(decl.name)) {
for (var _i = 0, _a = decl.name.elements; _i < _a.length; _i++) {
var element = _a[_i];
if (!ts.isOmittedExpression(element)) {
statements = appendExportsOfBindingElement(statements, element);
}
}
}
else if (!ts.isGeneratedIdentifier(decl.name)) {
statements = appendExportsOfDeclaration(statements, decl);
}
return statements;
}
/**
* Appends the exports of a ClassDeclaration or FunctionDeclaration to a statement list,
* returning the statement list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param decl The declaration whose exports are to be recorded.
*/
function appendExportsOfHoistedDeclaration(statements, decl) {
if (currentModuleInfo.exportEquals) {
return statements;
}
if (ts.hasSyntacticModifier(decl, 1 /* Export */)) {
var exportName = ts.hasSyntacticModifier(decl, 512 /* Default */) ? factory.createIdentifier("default") : factory.getDeclarationName(decl);
statements = appendExportStatement(statements, exportName, factory.getLocalName(decl), /*location*/ decl);
}
if (decl.name) {
statements = appendExportsOfDeclaration(statements, decl);
}
return statements;
}
/**
* Appends the exports of a declaration to a statement list, returning the statement list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param decl The declaration to export.
*/
function appendExportsOfDeclaration(statements, decl, liveBinding) {
var name = factory.getDeclarationName(decl);
var exportSpecifiers = currentModuleInfo.exportSpecifiers.get(ts.idText(name));
if (exportSpecifiers) {
for (var _i = 0, exportSpecifiers_1 = exportSpecifiers; _i < exportSpecifiers_1.length; _i++) {
var exportSpecifier = exportSpecifiers_1[_i];
statements = appendExportStatement(statements, exportSpecifier.name, name, /*location*/ exportSpecifier.name, /* allowComments */ undefined, liveBinding);
}
}
return statements;
}
/**
* Appends the down-level representation of an export to a statement list, returning the
* statement list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param exportName The name of the export.
* @param expression The expression to export.
* @param location The location to use for source maps and comments for the export.
* @param allowComments Whether to allow comments on the export.
*/
function appendExportStatement(statements, exportName, expression, location, allowComments, liveBinding) {
statements = ts.append(statements, createExportStatement(exportName, expression, location, allowComments, liveBinding));
return statements;
}
function createUnderscoreUnderscoreESModule() {
var statement;
if (languageVersion === 0 /* ES3 */) {
statement = factory.createExpressionStatement(createExportExpression(factory.createIdentifier("__esModule"), factory.createTrue()));
}
else {
statement = factory.createExpressionStatement(factory.createCallExpression(factory.createPropertyAccessExpression(factory.createIdentifier("Object"), "defineProperty"),
/*typeArguments*/ undefined, [
factory.createIdentifier("exports"),
factory.createStringLiteral("__esModule"),
factory.createObjectLiteralExpression([
factory.createPropertyAssignment("value", factory.createTrue())
])
]));
}
ts.setEmitFlags(statement, 1048576 /* CustomPrologue */);
return statement;
}
/**
* Creates a call to the current file's export function to export a value.
*
* @param name The bound name of the export.
* @param value The exported value.
* @param location The location to use for source maps and comments for the export.
* @param allowComments An optional value indicating whether to emit comments for the statement.
*/
function createExportStatement(name, value, location, allowComments, liveBinding) {
var statement = ts.setTextRange(factory.createExpressionStatement(createExportExpression(name, value, /* location */ undefined, liveBinding)), location);
ts.startOnNewLine(statement);
if (!allowComments) {
ts.setEmitFlags(statement, 1536 /* NoComments */);
}
return statement;
}
/**
* Creates a call to the current file's export function to export a value.
*
* @param name The bound name of the export.
* @param value The exported value.
* @param location The location to use for source maps and comments for the export.
*/
function createExportExpression(name, value, location, liveBinding) {
return ts.setTextRange(liveBinding && languageVersion !== 0 /* ES3 */ ? factory.createCallExpression(factory.createPropertyAccessExpression(factory.createIdentifier("Object"), "defineProperty"),
/*typeArguments*/ undefined, [
factory.createIdentifier("exports"),
factory.createStringLiteralFromNode(name),
factory.createObjectLiteralExpression([
factory.createPropertyAssignment("enumerable", factory.createTrue()),
factory.createPropertyAssignment("get", factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined,
/*parameters*/ [],
/*type*/ undefined, factory.createBlock([factory.createReturnStatement(value)])))
])
]) : factory.createAssignment(factory.createPropertyAccessExpression(factory.createIdentifier("exports"), factory.cloneNode(name)), value), location);
}
//
// Modifier Visitors
//
/**
* Visit nodes to elide module-specific modifiers.
*
* @param node The node to visit.
*/
function modifierVisitor(node) {
// Elide module-specific modifiers.
switch (node.kind) {
case 93 /* ExportKeyword */:
case 88 /* DefaultKeyword */:
return undefined;
}
return node;
}
//
// Emit Notification
//
/**
* Hook for node emit notifications.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to emit.
* @param emit A callback used to emit the node in the printer.
*/
function onEmitNode(hint, node, emitCallback) {
if (node.kind === 300 /* SourceFile */) {
currentSourceFile = node;
currentModuleInfo = moduleInfoMap[ts.getOriginalNodeId(currentSourceFile)];
previousOnEmitNode(hint, node, emitCallback);
currentSourceFile = undefined;
currentModuleInfo = undefined;
}
else {
previousOnEmitNode(hint, node, emitCallback);
}
}
//
// Substitutions
//
/**
* Hooks node substitutions.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to substitute.
*/
function onSubstituteNode(hint, node) {
node = previousOnSubstituteNode(hint, node);
if (node.id && noSubstitution[node.id]) {
return node;
}
if (hint === 1 /* Expression */) {
return substituteExpression(node);
}
else if (ts.isShorthandPropertyAssignment(node)) {
return substituteShorthandPropertyAssignment(node);
}
return node;
}
/**
* Substitution for a ShorthandPropertyAssignment whose declaration name is an imported
* or exported symbol.
*
* @param node The node to substitute.
*/
function substituteShorthandPropertyAssignment(node) {
var name = node.name;
var exportedOrImportedName = substituteExpressionIdentifier(name);
if (exportedOrImportedName !== name) {
// A shorthand property with an assignment initializer is probably part of a
// destructuring assignment
if (node.objectAssignmentInitializer) {
var initializer = factory.createAssignment(exportedOrImportedName, node.objectAssignmentInitializer);
return ts.setTextRange(factory.createPropertyAssignment(name, initializer), node);
}
return ts.setTextRange(factory.createPropertyAssignment(name, exportedOrImportedName), node);
}
return node;
}
/**
* Substitution for an Expression that may contain an imported or exported symbol.
*
* @param node The node to substitute.
*/
function substituteExpression(node) {
switch (node.kind) {
case 79 /* Identifier */:
return substituteExpressionIdentifier(node);
case 206 /* CallExpression */:
return substituteCallExpression(node);
case 208 /* TaggedTemplateExpression */:
return substituteTaggedTemplateExpression(node);
case 219 /* BinaryExpression */:
return substituteBinaryExpression(node);
}
return node;
}
function substituteCallExpression(node) {
if (ts.isIdentifier(node.expression)) {
var expression = substituteExpressionIdentifier(node.expression);
noSubstitution[ts.getNodeId(expression)] = true;
if (!ts.isIdentifier(expression)) {
return ts.addEmitFlags(factory.updateCallExpression(node, expression,
/*typeArguments*/ undefined, node.arguments), 536870912 /* IndirectCall */);
}
}
return node;
}
function substituteTaggedTemplateExpression(node) {
if (ts.isIdentifier(node.tag)) {
var tag = substituteExpressionIdentifier(node.tag);
noSubstitution[ts.getNodeId(tag)] = true;
if (!ts.isIdentifier(tag)) {
return ts.addEmitFlags(factory.updateTaggedTemplateExpression(node, tag,
/*typeArguments*/ undefined, node.template), 536870912 /* IndirectCall */);
}
}
return node;
}
/**
* Substitution for an Identifier expression that may contain an imported or exported
* symbol.
*
* @param node The node to substitute.
*/
function substituteExpressionIdentifier(node) {
var _a, _b;
if (ts.getEmitFlags(node) & 4096 /* HelperName */) {
var externalHelpersModuleName = ts.getExternalHelpersModuleName(currentSourceFile);
if (externalHelpersModuleName) {
return factory.createPropertyAccessExpression(externalHelpersModuleName, node);
}
return node;
}
else if (!(ts.isGeneratedIdentifier(node) && !(node.autoGenerateFlags & 64 /* AllowNameSubstitution */)) && !ts.isLocalName(node)) {
var exportContainer = resolver.getReferencedExportContainer(node, ts.isExportName(node));
if (exportContainer && exportContainer.kind === 300 /* SourceFile */) {
return ts.setTextRange(factory.createPropertyAccessExpression(factory.createIdentifier("exports"), factory.cloneNode(node)),
/*location*/ node);
}
var importDeclaration = resolver.getReferencedImportDeclaration(node);
if (importDeclaration) {
if (ts.isImportClause(importDeclaration)) {
return ts.setTextRange(factory.createPropertyAccessExpression(factory.getGeneratedNameForNode(importDeclaration.parent), factory.createIdentifier("default")),
/*location*/ node);
}
else if (ts.isImportSpecifier(importDeclaration)) {
var name = importDeclaration.propertyName || importDeclaration.name;
return ts.setTextRange(factory.createPropertyAccessExpression(factory.getGeneratedNameForNode(((_b = (_a = importDeclaration.parent) === null || _a === void 0 ? void 0 : _a.parent) === null || _b === void 0 ? void 0 : _b.parent) || importDeclaration), factory.cloneNode(name)),
/*location*/ node);
}
}
}
return node;
}
/**
* Substitution for a BinaryExpression that may contain an imported or exported symbol.
*
* @param node The node to substitute.
*/
function substituteBinaryExpression(node) {
// When we see an assignment expression whose left-hand side is an exported symbol,
// we should ensure all exports of that symbol are updated with the correct value.
//
// - We do not substitute generated identifiers for any reason.
// - We do not substitute identifiers tagged with the LocalName flag.
// - We do not substitute identifiers that were originally the name of an enum or
// namespace due to how they are transformed in TypeScript.
// - We only substitute identifiers that are exported at the top level.
if (ts.isAssignmentOperator(node.operatorToken.kind)
&& ts.isIdentifier(node.left)
&& !ts.isGeneratedIdentifier(node.left)
&& !ts.isLocalName(node.left)
&& !ts.isDeclarationNameOfEnumOrNamespace(node.left)) {
var exportedNames = getExports(node.left);
if (exportedNames) {
// For each additional export of the declaration, apply an export assignment.
var expression = node;
for (var _i = 0, exportedNames_3 = exportedNames; _i < exportedNames_3.length; _i++) {
var exportName = exportedNames_3[_i];
// Mark the node to prevent triggering this rule again.
noSubstitution[ts.getNodeId(expression)] = true;
expression = createExportExpression(exportName, expression, /*location*/ node);
}
return expression;
}
}
return node;
}
/**
* Gets the additional exports of a name.
*
* @param name The name.
*/
function getExports(name) {
if (!ts.isGeneratedIdentifier(name)) {
var valueDeclaration = resolver.getReferencedImportDeclaration(name)
|| resolver.getReferencedValueDeclaration(name);
if (valueDeclaration) {
return currentModuleInfo
&& currentModuleInfo.exportedBindings[ts.getOriginalNodeId(valueDeclaration)];
}
}
}
}
ts.transformModule = transformModule;
// emit helper for dynamic import
var dynamicImportUMDHelper = {
name: "typescript:dynamicimport-sync-require",
scoped: true,
text: "\n var __syncRequire = typeof module === \"object\" && typeof module.exports === \"object\";"
};
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
function transformSystemModule(context) {
var factory = context.factory, startLexicalEnvironment = context.startLexicalEnvironment, endLexicalEnvironment = context.endLexicalEnvironment, hoistVariableDeclaration = context.hoistVariableDeclaration;
var compilerOptions = context.getCompilerOptions();
var resolver = context.getEmitResolver();
var host = context.getEmitHost();
var previousOnSubstituteNode = context.onSubstituteNode;
var previousOnEmitNode = context.onEmitNode;
context.onSubstituteNode = onSubstituteNode;
context.onEmitNode = onEmitNode;
context.enableSubstitution(79 /* Identifier */); // Substitutes expression identifiers for imported symbols.
context.enableSubstitution(292 /* ShorthandPropertyAssignment */); // Substitutes expression identifiers for imported symbols
context.enableSubstitution(219 /* BinaryExpression */); // Substitutes assignments to exported symbols.
context.enableSubstitution(229 /* MetaProperty */); // Substitutes 'import.meta'
context.enableEmitNotification(300 /* SourceFile */); // Restore state when substituting nodes in a file.
var moduleInfoMap = []; // The ExternalModuleInfo for each file.
var deferredExports = []; // Exports to defer until an EndOfDeclarationMarker is found.
var exportFunctionsMap = []; // The export function associated with a source file.
var noSubstitutionMap = []; // Set of nodes for which substitution rules should be ignored for each file.
var contextObjectMap = []; // The context object associated with a source file.
var currentSourceFile; // The current file.
var moduleInfo; // ExternalModuleInfo for the current file.
var exportFunction; // The export function for the current file.
var contextObject; // The context object for the current file.
var hoistedStatements;
var enclosingBlockScopedContainer;
var noSubstitution; // Set of nodes for which substitution rules should be ignored.
return ts.chainBundle(context, transformSourceFile);
/**
* Transforms the module aspects of a SourceFile.
*
* @param node The SourceFile node.
*/
function transformSourceFile(node) {
if (node.isDeclarationFile || !(ts.isEffectiveExternalModule(node, compilerOptions) || node.transformFlags & 4194304 /* ContainsDynamicImport */)) {
return node;
}
var id = ts.getOriginalNodeId(node);
currentSourceFile = node;
enclosingBlockScopedContainer = node;
// System modules have the following shape:
//
// System.register(['dep-1', ... 'dep-n'], function(exports) {/* module body function */})
//
// The parameter 'exports' here is a callback '<T>(name: string, value: T) => T' that
// is used to publish exported values. 'exports' returns its 'value' argument so in
// most cases expressions that mutate exported values can be rewritten as:
//
// expr -> exports('name', expr)
//
// The only exception in this rule is postfix unary operators,
// see comment to 'substitutePostfixUnaryExpression' for more details
// Collect information about the external module and dependency groups.
moduleInfo = moduleInfoMap[id] = ts.collectExternalModuleInfo(context, node, resolver, compilerOptions);
// Make sure that the name of the 'exports' function does not conflict with
// existing identifiers.
exportFunction = factory.createUniqueName("exports");
exportFunctionsMap[id] = exportFunction;
contextObject = contextObjectMap[id] = factory.createUniqueName("context");
// Add the body of the module.
var dependencyGroups = collectDependencyGroups(moduleInfo.externalImports);
var moduleBodyBlock = createSystemModuleBody(node, dependencyGroups);
var moduleBodyFunction = factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, [
factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, exportFunction),
factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, contextObject)
],
/*type*/ undefined, moduleBodyBlock);
// Write the call to `System.register`
// Clear the emit-helpers flag for later passes since we'll have already used it in the module body
// So the helper will be emit at the correct position instead of at the top of the source-file
var moduleName = ts.tryGetModuleNameFromFile(factory, node, host, compilerOptions);
var dependencies = factory.createArrayLiteralExpression(ts.map(dependencyGroups, function (dependencyGroup) { return dependencyGroup.name; }));
var updated = ts.setEmitFlags(factory.updateSourceFile(node, ts.setTextRange(factory.createNodeArray([
factory.createExpressionStatement(factory.createCallExpression(factory.createPropertyAccessExpression(factory.createIdentifier("System"), "register"),
/*typeArguments*/ undefined, moduleName
? [moduleName, dependencies, moduleBodyFunction]
: [dependencies, moduleBodyFunction]))
]), node.statements)), 1024 /* NoTrailingComments */);
if (!ts.outFile(compilerOptions)) {
ts.moveEmitHelpers(updated, moduleBodyBlock, function (helper) { return !helper.scoped; });
}
if (noSubstitution) {
noSubstitutionMap[id] = noSubstitution;
noSubstitution = undefined;
}
currentSourceFile = undefined;
moduleInfo = undefined;
exportFunction = undefined;
contextObject = undefined;
hoistedStatements = undefined;
enclosingBlockScopedContainer = undefined;
return updated;
}
/**
* Collects the dependency groups for this files imports.
*
* @param externalImports The imports for the file.
*/
function collectDependencyGroups(externalImports) {
var groupIndices = new ts.Map();
var dependencyGroups = [];
for (var _i = 0, externalImports_1 = externalImports; _i < externalImports_1.length; _i++) {
var externalImport = externalImports_1[_i];
var externalModuleName = ts.getExternalModuleNameLiteral(factory, externalImport, currentSourceFile, host, resolver, compilerOptions);
if (externalModuleName) {
var text = externalModuleName.text;
var groupIndex = groupIndices.get(text);
if (groupIndex !== undefined) {
// deduplicate/group entries in dependency list by the dependency name
dependencyGroups[groupIndex].externalImports.push(externalImport);
}
else {
groupIndices.set(text, dependencyGroups.length);
dependencyGroups.push({
name: externalModuleName,
externalImports: [externalImport]
});
}
}
}
return dependencyGroups;
}
/**
* Adds the statements for the module body function for the source file.
*
* @param node The source file for the module.
* @param dependencyGroups The grouped dependencies of the module.
*/
function createSystemModuleBody(node, dependencyGroups) {
// Shape of the body in system modules:
//
// function (exports) {
// <list of local aliases for imports>
// <hoisted variable declarations>
// <hoisted function declarations>
// return {
// setters: [
// <list of setter function for imports>
// ],
// execute: function() {
// <module statements>
// }
// }
// <temp declarations>
// }
//
// i.e:
//
// import {x} from 'file1'
// var y = 1;
// export function foo() { return y + x(); }
// console.log(y);
//
// Will be transformed to:
//
// function(exports) {
// function foo() { return y + file_1.x(); }
// exports("foo", foo);
// var file_1, y;
// return {
// setters: [
// function(v) { file_1 = v }
// ],
// execute(): function() {
// y = 1;
// console.log(y);
// }
// };
// }
var statements = [];
// We start a new lexical environment in this function body, but *not* in the
// body of the execute function. This allows us to emit temporary declarations
// only in the outer module body and not in the inner one.
startLexicalEnvironment();
// Add any prologue directives.
var ensureUseStrict = ts.getStrictOptionValue(compilerOptions, "alwaysStrict") || (!compilerOptions.noImplicitUseStrict && ts.isExternalModule(currentSourceFile));
var statementOffset = factory.copyPrologue(node.statements, statements, ensureUseStrict, topLevelVisitor);
// var __moduleName = context_1 && context_1.id;
statements.push(factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList([
factory.createVariableDeclaration("__moduleName",
/*exclamationToken*/ undefined,
/*type*/ undefined, factory.createLogicalAnd(contextObject, factory.createPropertyAccessExpression(contextObject, "id")))
])));
// Visit the synthetic external helpers import declaration if present
ts.visitNode(moduleInfo.externalHelpersImportDeclaration, topLevelVisitor, ts.isStatement);
// Visit the statements of the source file, emitting any transformations into
// the `executeStatements` array. We do this *before* we fill the `setters` array
// as we both emit transformations as well as aggregate some data used when creating
// setters. This allows us to reduce the number of times we need to loop through the
// statements of the source file.
var executeStatements = ts.visitNodes(node.statements, topLevelVisitor, ts.isStatement, statementOffset);
// Emit early exports for function declarations.
ts.addRange(statements, hoistedStatements);
// We emit hoisted variables early to align roughly with our previous emit output.
// Two key differences in this approach are:
// - Temporary variables will appear at the top rather than at the bottom of the file
ts.insertStatementsAfterStandardPrologue(statements, endLexicalEnvironment());
var exportStarFunction = addExportStarIfNeeded(statements); // TODO: GH#18217
var modifiers = node.transformFlags & 1048576 /* ContainsAwait */ ?
factory.createModifiersFromModifierFlags(256 /* Async */) :
undefined;
var moduleObject = factory.createObjectLiteralExpression([
factory.createPropertyAssignment("setters", createSettersArray(exportStarFunction, dependencyGroups)),
factory.createPropertyAssignment("execute", factory.createFunctionExpression(modifiers,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined,
/*parameters*/ [],
/*type*/ undefined, factory.createBlock(executeStatements, /*multiLine*/ true)))
], /*multiLine*/ true);
statements.push(factory.createReturnStatement(moduleObject));
return factory.createBlock(statements, /*multiLine*/ true);
}
/**
* Adds an exportStar function to a statement list if it is needed for the file.
*
* @param statements A statement list.
*/
function addExportStarIfNeeded(statements) {
if (!moduleInfo.hasExportStarsToExportValues) {
return;
}
// when resolving exports local exported entries/indirect exported entries in the module
// should always win over entries with similar names that were added via star exports
// to support this we store names of local/indirect exported entries in a set.
// this set is used to filter names brought by star expors.
// local names set should only be added if we have anything exported
if (!moduleInfo.exportedNames && moduleInfo.exportSpecifiers.size === 0) {
// no exported declarations (export var ...) or export specifiers (export {x})
// check if we have any non star export declarations.
var hasExportDeclarationWithExportClause = false;
for (var _i = 0, _a = moduleInfo.externalImports; _i < _a.length; _i++) {
var externalImport = _a[_i];
if (externalImport.kind === 270 /* ExportDeclaration */ && externalImport.exportClause) {
hasExportDeclarationWithExportClause = true;
break;
}
}
if (!hasExportDeclarationWithExportClause) {
// we still need to emit exportStar helper
var exportStarFunction_1 = createExportStarFunction(/*localNames*/ undefined);
statements.push(exportStarFunction_1);
return exportStarFunction_1.name;
}
}
var exportedNames = [];
if (moduleInfo.exportedNames) {
for (var _b = 0, _c = moduleInfo.exportedNames; _b < _c.length; _b++) {
var exportedLocalName = _c[_b];
if (exportedLocalName.escapedText === "default") {
continue;
}
// write name of exported declaration, i.e 'export var x...'
exportedNames.push(factory.createPropertyAssignment(factory.createStringLiteralFromNode(exportedLocalName), factory.createTrue()));
}
}
var exportedNamesStorageRef = factory.createUniqueName("exportedNames");
statements.push(factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList([
factory.createVariableDeclaration(exportedNamesStorageRef,
/*exclamationToken*/ undefined,
/*type*/ undefined, factory.createObjectLiteralExpression(exportedNames, /*multiline*/ true))
])));
var exportStarFunction = createExportStarFunction(exportedNamesStorageRef);
statements.push(exportStarFunction);
return exportStarFunction.name;
}
/**
* Creates an exportStar function for the file, with an optional set of excluded local
* names.
*
* @param localNames An optional reference to an object containing a set of excluded local
* names.
*/
function createExportStarFunction(localNames) {
var exportStarFunction = factory.createUniqueName("exportStar");
var m = factory.createIdentifier("m");
var n = factory.createIdentifier("n");
var exports = factory.createIdentifier("exports");
var condition = factory.createStrictInequality(n, factory.createStringLiteral("default"));
if (localNames) {
condition = factory.createLogicalAnd(condition, factory.createLogicalNot(factory.createCallExpression(factory.createPropertyAccessExpression(localNames, "hasOwnProperty"),
/*typeArguments*/ undefined, [n])));
}
return factory.createFunctionDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*asteriskToken*/ undefined, exportStarFunction,
/*typeParameters*/ undefined, [factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, m)],
/*type*/ undefined, factory.createBlock([
factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList([
factory.createVariableDeclaration(exports,
/*exclamationToken*/ undefined,
/*type*/ undefined, factory.createObjectLiteralExpression([]))
])),
factory.createForInStatement(factory.createVariableDeclarationList([
factory.createVariableDeclaration(n)
]), m, factory.createBlock([
ts.setEmitFlags(factory.createIfStatement(condition, factory.createExpressionStatement(factory.createAssignment(factory.createElementAccessExpression(exports, n), factory.createElementAccessExpression(m, n)))), 1 /* SingleLine */)
])),
factory.createExpressionStatement(factory.createCallExpression(exportFunction,
/*typeArguments*/ undefined, [exports]))
], /*multiline*/ true));
}
/**
* Creates an array setter callbacks for each dependency group.
*
* @param exportStarFunction A reference to an exportStarFunction for the file.
* @param dependencyGroups An array of grouped dependencies.
*/
function createSettersArray(exportStarFunction, dependencyGroups) {
var setters = [];
for (var _i = 0, dependencyGroups_1 = dependencyGroups; _i < dependencyGroups_1.length; _i++) {
var group_2 = dependencyGroups_1[_i];
// derive a unique name for parameter from the first named entry in the group
var localName = ts.forEach(group_2.externalImports, function (i) { return ts.getLocalNameForExternalImport(factory, i, currentSourceFile); });
var parameterName = localName ? factory.getGeneratedNameForNode(localName) : factory.createUniqueName("");
var statements = [];
for (var _a = 0, _b = group_2.externalImports; _a < _b.length; _a++) {
var entry = _b[_a];
var importVariableName = ts.getLocalNameForExternalImport(factory, entry, currentSourceFile); // TODO: GH#18217
switch (entry.kind) {
case 264 /* ImportDeclaration */:
if (!entry.importClause) {
// 'import "..."' case
// module is imported only for side-effects, no emit required
break;
}
// falls through
case 263 /* ImportEqualsDeclaration */:
ts.Debug.assert(importVariableName !== undefined);
// save import into the local
statements.push(factory.createExpressionStatement(factory.createAssignment(importVariableName, parameterName)));
break;
case 270 /* ExportDeclaration */:
ts.Debug.assert(importVariableName !== undefined);
if (entry.exportClause) {
if (ts.isNamedExports(entry.exportClause)) {
// export {a, b as c} from 'foo'
//
// emit as:
//
// exports_({
// "a": _["a"],
// "c": _["b"]
// });
var properties = [];
for (var _c = 0, _d = entry.exportClause.elements; _c < _d.length; _c++) {
var e = _d[_c];
properties.push(factory.createPropertyAssignment(factory.createStringLiteral(ts.idText(e.name)), factory.createElementAccessExpression(parameterName, factory.createStringLiteral(ts.idText(e.propertyName || e.name)))));
}
statements.push(factory.createExpressionStatement(factory.createCallExpression(exportFunction,
/*typeArguments*/ undefined, [factory.createObjectLiteralExpression(properties, /*multiline*/ true)])));
}
else {
statements.push(factory.createExpressionStatement(factory.createCallExpression(exportFunction,
/*typeArguments*/ undefined, [
factory.createStringLiteral(ts.idText(entry.exportClause.name)),
parameterName
])));
}
}
else {
// export * from 'foo'
//
// emit as:
//
// exportStar(foo_1_1);
statements.push(factory.createExpressionStatement(factory.createCallExpression(exportStarFunction,
/*typeArguments*/ undefined, [parameterName])));
}
break;
}
}
setters.push(factory.createFunctionExpression(
/*modifiers*/ undefined,
/*asteriskToken*/ undefined,
/*name*/ undefined,
/*typeParameters*/ undefined, [factory.createParameterDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*dotDotDotToken*/ undefined, parameterName)],
/*type*/ undefined, factory.createBlock(statements, /*multiLine*/ true)));
}
return factory.createArrayLiteralExpression(setters, /*multiLine*/ true);
}
//
// Top-level Source Element Visitors
//
/**
* Visit source elements at the top-level of a module.
*
* @param node The node to visit.
*/
function topLevelVisitor(node) {
switch (node.kind) {
case 264 /* ImportDeclaration */:
return visitImportDeclaration(node);
case 263 /* ImportEqualsDeclaration */:
return visitImportEqualsDeclaration(node);
case 270 /* ExportDeclaration */:
return visitExportDeclaration(node);
case 269 /* ExportAssignment */:
return visitExportAssignment(node);
default:
return topLevelNestedVisitor(node);
}
}
/**
* Visits an ImportDeclaration node.
*
* @param node The node to visit.
*/
function visitImportDeclaration(node) {
var statements;
if (node.importClause) {
hoistVariableDeclaration(ts.getLocalNameForExternalImport(factory, node, currentSourceFile)); // TODO: GH#18217
}
if (hasAssociatedEndOfDeclarationMarker(node)) {
// Defer exports until we encounter an EndOfDeclarationMarker node
var id = ts.getOriginalNodeId(node);
deferredExports[id] = appendExportsOfImportDeclaration(deferredExports[id], node);
}
else {
statements = appendExportsOfImportDeclaration(statements, node);
}
return ts.singleOrMany(statements);
}
function visitExportDeclaration(node) {
ts.Debug.assertIsDefined(node);
return undefined;
}
/**
* Visits an ImportEqualsDeclaration node.
*
* @param node The node to visit.
*/
function visitImportEqualsDeclaration(node) {
ts.Debug.assert(ts.isExternalModuleImportEqualsDeclaration(node), "import= for internal module references should be handled in an earlier transformer.");
var statements;
hoistVariableDeclaration(ts.getLocalNameForExternalImport(factory, node, currentSourceFile)); // TODO: GH#18217
if (hasAssociatedEndOfDeclarationMarker(node)) {
// Defer exports until we encounter an EndOfDeclarationMarker node
var id = ts.getOriginalNodeId(node);
deferredExports[id] = appendExportsOfImportEqualsDeclaration(deferredExports[id], node);
}
else {
statements = appendExportsOfImportEqualsDeclaration(statements, node);
}
return ts.singleOrMany(statements);
}
/**
* Visits an ExportAssignment node.
*
* @param node The node to visit.
*/
function visitExportAssignment(node) {
if (node.isExportEquals) {
// Elide `export=` as it is illegal in a SystemJS module.
return undefined;
}
var expression = ts.visitNode(node.expression, visitor, ts.isExpression);
var original = node.original;
if (original && hasAssociatedEndOfDeclarationMarker(original)) {
// Defer exports until we encounter an EndOfDeclarationMarker node
var id = ts.getOriginalNodeId(node);
deferredExports[id] = appendExportStatement(deferredExports[id], factory.createIdentifier("default"), expression, /*allowComments*/ true);
}
else {
return createExportStatement(factory.createIdentifier("default"), expression, /*allowComments*/ true);
}
}
/**
* Visits a FunctionDeclaration, hoisting it to the outer module body function.
*
* @param node The node to visit.
*/
function visitFunctionDeclaration(node) {
if (ts.hasSyntacticModifier(node, 1 /* Export */)) {
hoistedStatements = ts.append(hoistedStatements, factory.updateFunctionDeclaration(node, node.decorators, ts.visitNodes(node.modifiers, modifierVisitor, ts.isModifier), node.asteriskToken, factory.getDeclarationName(node, /*allowComments*/ true, /*allowSourceMaps*/ true),
/*typeParameters*/ undefined, ts.visitNodes(node.parameters, visitor, ts.isParameterDeclaration),
/*type*/ undefined, ts.visitNode(node.body, visitor, ts.isBlock)));
}
else {
hoistedStatements = ts.append(hoistedStatements, ts.visitEachChild(node, visitor, context));
}
if (hasAssociatedEndOfDeclarationMarker(node)) {
// Defer exports until we encounter an EndOfDeclarationMarker node
var id = ts.getOriginalNodeId(node);
deferredExports[id] = appendExportsOfHoistedDeclaration(deferredExports[id], node);
}
else {
hoistedStatements = appendExportsOfHoistedDeclaration(hoistedStatements, node);
}
return undefined;
}
/**
* Visits a ClassDeclaration, hoisting its name to the outer module body function.
*
* @param node The node to visit.
*/
function visitClassDeclaration(node) {
var statements;
// Hoist the name of the class declaration to the outer module body function.
var name = factory.getLocalName(node);
hoistVariableDeclaration(name);
// Rewrite the class declaration into an assignment of a class expression.
statements = ts.append(statements, ts.setTextRange(factory.createExpressionStatement(factory.createAssignment(name, ts.setTextRange(factory.createClassExpression(ts.visitNodes(node.decorators, visitor, ts.isDecorator),
/*modifiers*/ undefined, node.name,
/*typeParameters*/ undefined, ts.visitNodes(node.heritageClauses, visitor, ts.isHeritageClause), ts.visitNodes(node.members, visitor, ts.isClassElement)), node))), node));
if (hasAssociatedEndOfDeclarationMarker(node)) {
// Defer exports until we encounter an EndOfDeclarationMarker node
var id = ts.getOriginalNodeId(node);
deferredExports[id] = appendExportsOfHoistedDeclaration(deferredExports[id], node);
}
else {
statements = appendExportsOfHoistedDeclaration(statements, node);
}
return ts.singleOrMany(statements);
}
/**
* Visits a variable statement, hoisting declared names to the top-level module body.
* Each declaration is rewritten into an assignment expression.
*
* @param node The node to visit.
*/
function visitVariableStatement(node) {
if (!shouldHoistVariableDeclarationList(node.declarationList)) {
return ts.visitNode(node, visitor, ts.isStatement);
}
var expressions;
var isExportedDeclaration = ts.hasSyntacticModifier(node, 1 /* Export */);
var isMarkedDeclaration = hasAssociatedEndOfDeclarationMarker(node);
for (var _i = 0, _a = node.declarationList.declarations; _i < _a.length; _i++) {
var variable = _a[_i];
if (variable.initializer) {
expressions = ts.append(expressions, transformInitializedVariable(variable, isExportedDeclaration && !isMarkedDeclaration));
}
else {
hoistBindingElement(variable);
}
}
var statements;
if (expressions) {
statements = ts.append(statements, ts.setTextRange(factory.createExpressionStatement(factory.inlineExpressions(expressions)), node));
}
if (isMarkedDeclaration) {
// Defer exports until we encounter an EndOfDeclarationMarker node
var id = ts.getOriginalNodeId(node);
deferredExports[id] = appendExportsOfVariableStatement(deferredExports[id], node, isExportedDeclaration);
}
else {
statements = appendExportsOfVariableStatement(statements, node, /*exportSelf*/ false);
}
return ts.singleOrMany(statements);
}
/**
* Hoists the declared names of a VariableDeclaration or BindingElement.
*
* @param node The declaration to hoist.
*/
function hoistBindingElement(node) {
if (ts.isBindingPattern(node.name)) {
for (var _i = 0, _a = node.name.elements; _i < _a.length; _i++) {
var element = _a[_i];
if (!ts.isOmittedExpression(element)) {
hoistBindingElement(element);
}
}
}
else {
hoistVariableDeclaration(factory.cloneNode(node.name));
}
}
/**
* Determines whether a VariableDeclarationList should be hoisted.
*
* @param node The node to test.
*/
function shouldHoistVariableDeclarationList(node) {
// hoist only non-block scoped declarations or block scoped declarations parented by source file
return (ts.getEmitFlags(node) & 2097152 /* NoHoisting */) === 0
&& (enclosingBlockScopedContainer.kind === 300 /* SourceFile */
|| (ts.getOriginalNode(node).flags & 3 /* BlockScoped */) === 0);
}
/**
* Transform an initialized variable declaration into an expression.
*
* @param node The node to transform.
* @param isExportedDeclaration A value indicating whether the variable is exported.
*/
function transformInitializedVariable(node, isExportedDeclaration) {
var createAssignment = isExportedDeclaration ? createExportedVariableAssignment : createNonExportedVariableAssignment;
return ts.isBindingPattern(node.name)
? ts.flattenDestructuringAssignment(node, visitor, context, 0 /* All */,
/*needsValue*/ false, createAssignment)
: node.initializer ? createAssignment(node.name, ts.visitNode(node.initializer, visitor, ts.isExpression)) : node.name;
}
/**
* Creates an assignment expression for an exported variable declaration.
*
* @param name The name of the variable.
* @param value The value of the variable's initializer.
* @param location The source map location for the assignment.
*/
function createExportedVariableAssignment(name, value, location) {
return createVariableAssignment(name, value, location, /*isExportedDeclaration*/ true);
}
/**
* Creates an assignment expression for a non-exported variable declaration.
*
* @param name The name of the variable.
* @param value The value of the variable's initializer.
* @param location The source map location for the assignment.
*/
function createNonExportedVariableAssignment(name, value, location) {
return createVariableAssignment(name, value, location, /*isExportedDeclaration*/ false);
}
/**
* Creates an assignment expression for a variable declaration.
*
* @param name The name of the variable.
* @param value The value of the variable's initializer.
* @param location The source map location for the assignment.
* @param isExportedDeclaration A value indicating whether the variable is exported.
*/
function createVariableAssignment(name, value, location, isExportedDeclaration) {
hoistVariableDeclaration(factory.cloneNode(name));
return isExportedDeclaration
? createExportExpression(name, preventSubstitution(ts.setTextRange(factory.createAssignment(name, value), location)))
: preventSubstitution(ts.setTextRange(factory.createAssignment(name, value), location));
}
/**
* Visits a MergeDeclarationMarker used as a placeholder for the beginning of a merged
* and transformed declaration.
*
* @param node The node to visit.
*/
function visitMergeDeclarationMarker(node) {
// For an EnumDeclaration or ModuleDeclaration that merges with a preceeding
// declaration we do not emit a leading variable declaration. To preserve the
// begin/end semantics of the declararation and to properly handle exports
// we wrapped the leading variable declaration in a `MergeDeclarationMarker`.
//
// To balance the declaration, we defer the exports of the elided variable
// statement until we visit this declaration's `EndOfDeclarationMarker`.
if (hasAssociatedEndOfDeclarationMarker(node) && node.original.kind === 235 /* VariableStatement */) {
var id = ts.getOriginalNodeId(node);
var isExportedDeclaration = ts.hasSyntacticModifier(node.original, 1 /* Export */);
deferredExports[id] = appendExportsOfVariableStatement(deferredExports[id], node.original, isExportedDeclaration);
}
return node;
}
/**
* Determines whether a node has an associated EndOfDeclarationMarker.
*
* @param node The node to test.
*/
function hasAssociatedEndOfDeclarationMarker(node) {
return (ts.getEmitFlags(node) & 4194304 /* HasEndOfDeclarationMarker */) !== 0;
}
/**
* Visits a DeclarationMarker used as a placeholder for the end of a transformed
* declaration.
*
* @param node The node to visit.
*/
function visitEndOfDeclarationMarker(node) {
// For some transformations we emit an `EndOfDeclarationMarker` to mark the actual
// end of the transformed declaration. We use this marker to emit any deferred exports
// of the declaration.
var id = ts.getOriginalNodeId(node);
var statements = deferredExports[id];
if (statements) {
delete deferredExports[id];
return ts.append(statements, node);
}
else {
var original = ts.getOriginalNode(node);
if (ts.isModuleOrEnumDeclaration(original)) {
return ts.append(appendExportsOfDeclaration(statements, original), node);
}
}
return node;
}
/**
* Appends the exports of an ImportDeclaration to a statement list, returning the
* statement list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param decl The declaration whose exports are to be recorded.
*/
function appendExportsOfImportDeclaration(statements, decl) {
if (moduleInfo.exportEquals) {
return statements;
}
var importClause = decl.importClause;
if (!importClause) {
return statements;
}
if (importClause.name) {
statements = appendExportsOfDeclaration(statements, importClause);
}
var namedBindings = importClause.namedBindings;
if (namedBindings) {
switch (namedBindings.kind) {
case 266 /* NamespaceImport */:
statements = appendExportsOfDeclaration(statements, namedBindings);
break;
case 267 /* NamedImports */:
for (var _i = 0, _a = namedBindings.elements; _i < _a.length; _i++) {
var importBinding = _a[_i];
statements = appendExportsOfDeclaration(statements, importBinding);
}
break;
}
}
return statements;
}
/**
* Appends the export of an ImportEqualsDeclaration to a statement list, returning the
* statement list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param decl The declaration whose exports are to be recorded.
*/
function appendExportsOfImportEqualsDeclaration(statements, decl) {
if (moduleInfo.exportEquals) {
return statements;
}
return appendExportsOfDeclaration(statements, decl);
}
/**
* Appends the exports of a VariableStatement to a statement list, returning the statement
* list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param node The VariableStatement whose exports are to be recorded.
* @param exportSelf A value indicating whether to also export each VariableDeclaration of
* `nodes` declaration list.
*/
function appendExportsOfVariableStatement(statements, node, exportSelf) {
if (moduleInfo.exportEquals) {
return statements;
}
for (var _i = 0, _a = node.declarationList.declarations; _i < _a.length; _i++) {
var decl = _a[_i];
if (decl.initializer || exportSelf) {
statements = appendExportsOfBindingElement(statements, decl, exportSelf);
}
}
return statements;
}
/**
* Appends the exports of a VariableDeclaration or BindingElement to a statement list,
* returning the statement list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param decl The declaration whose exports are to be recorded.
* @param exportSelf A value indicating whether to also export the declaration itself.
*/
function appendExportsOfBindingElement(statements, decl, exportSelf) {
if (moduleInfo.exportEquals) {
return statements;
}
if (ts.isBindingPattern(decl.name)) {
for (var _i = 0, _a = decl.name.elements; _i < _a.length; _i++) {
var element = _a[_i];
if (!ts.isOmittedExpression(element)) {
statements = appendExportsOfBindingElement(statements, element, exportSelf);
}
}
}
else if (!ts.isGeneratedIdentifier(decl.name)) {
var excludeName = void 0;
if (exportSelf) {
statements = appendExportStatement(statements, decl.name, factory.getLocalName(decl));
excludeName = ts.idText(decl.name);
}
statements = appendExportsOfDeclaration(statements, decl, excludeName);
}
return statements;
}
/**
* Appends the exports of a ClassDeclaration or FunctionDeclaration to a statement list,
* returning the statement list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param decl The declaration whose exports are to be recorded.
*/
function appendExportsOfHoistedDeclaration(statements, decl) {
if (moduleInfo.exportEquals) {
return statements;
}
var excludeName;
if (ts.hasSyntacticModifier(decl, 1 /* Export */)) {
var exportName = ts.hasSyntacticModifier(decl, 512 /* Default */) ? factory.createStringLiteral("default") : decl.name;
statements = appendExportStatement(statements, exportName, factory.getLocalName(decl));
excludeName = ts.getTextOfIdentifierOrLiteral(exportName);
}
if (decl.name) {
statements = appendExportsOfDeclaration(statements, decl, excludeName);
}
return statements;
}
/**
* Appends the exports of a declaration to a statement list, returning the statement list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param decl The declaration to export.
* @param excludeName An optional name to exclude from exports.
*/
function appendExportsOfDeclaration(statements, decl, excludeName) {
if (moduleInfo.exportEquals) {
return statements;
}
var name = factory.getDeclarationName(decl);
var exportSpecifiers = moduleInfo.exportSpecifiers.get(ts.idText(name));
if (exportSpecifiers) {
for (var _i = 0, exportSpecifiers_2 = exportSpecifiers; _i < exportSpecifiers_2.length; _i++) {
var exportSpecifier = exportSpecifiers_2[_i];
if (exportSpecifier.name.escapedText !== excludeName) {
statements = appendExportStatement(statements, exportSpecifier.name, name);
}
}
}
return statements;
}
/**
* Appends the down-level representation of an export to a statement list, returning the
* statement list.
*
* @param statements A statement list to which the down-level export statements are to be
* appended. If `statements` is `undefined`, a new array is allocated if statements are
* appended.
* @param exportName The name of the export.
* @param expression The expression to export.
* @param allowComments Whether to allow comments on the export.
*/
function appendExportStatement(statements, exportName, expression, allowComments) {
statements = ts.append(statements, createExportStatement(exportName, expression, allowComments));
return statements;
}
/**
* Creates a call to the current file's export function to export a value.
*
* @param name The bound name of the export.
* @param value The exported value.
* @param allowComments An optional value indicating whether to emit comments for the statement.
*/
function createExportStatement(name, value, allowComments) {
var statement = factory.createExpressionStatement(createExportExpression(name, value));
ts.startOnNewLine(statement);
if (!allowComments) {
ts.setEmitFlags(statement, 1536 /* NoComments */);
}
return statement;
}
/**
* Creates a call to the current file's export function to export a value.
*
* @param name The bound name of the export.
* @param value The exported value.
*/
function createExportExpression(name, value) {
var exportName = ts.isIdentifier(name) ? factory.createStringLiteralFromNode(name) : name;
ts.setEmitFlags(value, ts.getEmitFlags(value) | 1536 /* NoComments */);
return ts.setCommentRange(factory.createCallExpression(exportFunction, /*typeArguments*/ undefined, [exportName, value]), value);
}
//
// Top-Level or Nested Source Element Visitors
//
/**
* Visit nested elements at the top-level of a module.
*
* @param node The node to visit.
*/
function topLevelNestedVisitor(node) {
switch (node.kind) {
case 235 /* VariableStatement */:
return visitVariableStatement(node);
case 254 /* FunctionDeclaration */:
return visitFunctionDeclaration(node);
case 255 /* ClassDeclaration */:
return visitClassDeclaration(node);
case 240 /* ForStatement */:
return visitForStatement(node, /*isTopLevel*/ true);
case 241 /* ForInStatement */:
return visitForInStatement(node);
case 242 /* ForOfStatement */:
return visitForOfStatement(node);
case 238 /* DoStatement */:
return visitDoStatement(node);
case 239 /* WhileStatement */:
return visitWhileStatement(node);
case 248 /* LabeledStatement */:
return visitLabeledStatement(node);
case 246 /* WithStatement */:
return visitWithStatement(node);
case 247 /* SwitchStatement */:
return visitSwitchStatement(node);
case 261 /* CaseBlock */:
return visitCaseBlock(node);
case 287 /* CaseClause */:
return visitCaseClause(node);
case 288 /* DefaultClause */:
return visitDefaultClause(node);
case 250 /* TryStatement */:
return visitTryStatement(node);
case 290 /* CatchClause */:
return visitCatchClause(node);
case 233 /* Block */:
return visitBlock(node);
case 347 /* MergeDeclarationMarker */:
return visitMergeDeclarationMarker(node);
case 348 /* EndOfDeclarationMarker */:
return visitEndOfDeclarationMarker(node);
default:
return visitor(node);
}
}
/**
* Visits the body of a ForStatement to hoist declarations.
*
* @param node The node to visit.
*/
function visitForStatement(node, isTopLevel) {
var savedEnclosingBlockScopedContainer = enclosingBlockScopedContainer;
enclosingBlockScopedContainer = node;
node = factory.updateForStatement(node, ts.visitNode(node.initializer, isTopLevel ? visitForInitializer : discardedValueVisitor, ts.isForInitializer), ts.visitNode(node.condition, visitor, ts.isExpression), ts.visitNode(node.incrementor, discardedValueVisitor, ts.isExpression), ts.visitIterationBody(node.statement, isTopLevel ? topLevelNestedVisitor : visitor, context));
enclosingBlockScopedContainer = savedEnclosingBlockScopedContainer;
return node;
}
/**
* Visits the body of a ForInStatement to hoist declarations.
*
* @param node The node to visit.
*/
function visitForInStatement(node) {
var savedEnclosingBlockScopedContainer = enclosingBlockScopedContainer;
enclosingBlockScopedContainer = node;
node = factory.updateForInStatement(node, visitForInitializer(node.initializer), ts.visitNode(node.expression, visitor, ts.isExpression), ts.visitIterationBody(node.statement, topLevelNestedVisitor, context));
enclosingBlockScopedContainer = savedEnclosingBlockScopedContainer;
return node;
}
/**
* Visits the body of a ForOfStatement to hoist declarations.
*
* @param node The node to visit.
*/
function visitForOfStatement(node) {
var savedEnclosingBlockScopedContainer = enclosingBlockScopedContainer;
enclosingBlockScopedContainer = node;
node = factory.updateForOfStatement(node, node.awaitModifier, visitForInitializer(node.initializer), ts.visitNode(node.expression, visitor, ts.isExpression), ts.visitIterationBody(node.statement, topLevelNestedVisitor, context));
enclosingBlockScopedContainer = savedEnclosingBlockScopedContainer;
return node;
}
/**
* Determines whether to hoist the initializer of a ForStatement, ForInStatement, or
* ForOfStatement.
*
* @param node The node to test.
*/
function shouldHoistForInitializer(node) {
return ts.isVariableDeclarationList(node)
&& shouldHoistVariableDeclarationList(node);
}
/**
* Visits the initializer of a ForStatement, ForInStatement, or ForOfStatement
*
* @param node The node to visit.
*/
function visitForInitializer(node) {
if (shouldHoistForInitializer(node)) {
var expressions = void 0;
for (var _i = 0, _a = node.declarations; _i < _a.length; _i++) {
var variable = _a[_i];
expressions = ts.append(expressions, transformInitializedVariable(variable, /*isExportedDeclaration*/ false));
if (!variable.initializer) {
hoistBindingElement(variable);
}
}
return expressions ? factory.inlineExpressions(expressions) : factory.createOmittedExpression();
}
else {
return ts.visitNode(node, discardedValueVisitor, ts.isExpression);
}
}
/**
* Visits the body of a DoStatement to hoist declarations.
*
* @param node The node to visit.
*/
function visitDoStatement(node) {
return factory.updateDoStatement(node, ts.visitIterationBody(node.statement, topLevelNestedVisitor, context), ts.visitNode(node.expression, visitor, ts.isExpression));
}
/**
* Visits the body of a WhileStatement to hoist declarations.
*
* @param node The node to visit.
*/
function visitWhileStatement(node) {
return factory.updateWhileStatement(node, ts.visitNode(node.expression, visitor, ts.isExpression), ts.visitIterationBody(node.statement, topLevelNestedVisitor, context));
}
/**
* Visits the body of a LabeledStatement to hoist declarations.
*
* @param node The node to visit.
*/
function visitLabeledStatement(node) {
return factory.updateLabeledStatement(node, node.label, ts.visitNode(node.statement, topLevelNestedVisitor, ts.isStatement, factory.liftToBlock));
}
/**
* Visits the body of a WithStatement to hoist declarations.
*
* @param node The node to visit.
*/
function visitWithStatement(node) {
return factory.updateWithStatement(node, ts.visitNode(node.expression, visitor, ts.isExpression), ts.visitNode(node.statement, topLevelNestedVisitor, ts.isStatement, factory.liftToBlock));
}
/**
* Visits the body of a SwitchStatement to hoist declarations.
*
* @param node The node to visit.
*/
function visitSwitchStatement(node) {
return factory.updateSwitchStatement(node, ts.visitNode(node.expression, visitor, ts.isExpression), ts.visitNode(node.caseBlock, topLevelNestedVisitor, ts.isCaseBlock));
}
/**
* Visits the body of a CaseBlock to hoist declarations.
*
* @param node The node to visit.
*/
function visitCaseBlock(node) {
var savedEnclosingBlockScopedContainer = enclosingBlockScopedContainer;
enclosingBlockScopedContainer = node;
node = factory.updateCaseBlock(node, ts.visitNodes(node.clauses, topLevelNestedVisitor, ts.isCaseOrDefaultClause));
enclosingBlockScopedContainer = savedEnclosingBlockScopedContainer;
return node;
}
/**
* Visits the body of a CaseClause to hoist declarations.
*
* @param node The node to visit.
*/
function visitCaseClause(node) {
return factory.updateCaseClause(node, ts.visitNode(node.expression, visitor, ts.isExpression), ts.visitNodes(node.statements, topLevelNestedVisitor, ts.isStatement));
}
/**
* Visits the body of a DefaultClause to hoist declarations.
*
* @param node The node to visit.
*/
function visitDefaultClause(node) {
return ts.visitEachChild(node, topLevelNestedVisitor, context);
}
/**
* Visits the body of a TryStatement to hoist declarations.
*
* @param node The node to visit.
*/
function visitTryStatement(node) {
return ts.visitEachChild(node, topLevelNestedVisitor, context);
}
/**
* Visits the body of a CatchClause to hoist declarations.
*
* @param node The node to visit.
*/
function visitCatchClause(node) {
var savedEnclosingBlockScopedContainer = enclosingBlockScopedContainer;
enclosingBlockScopedContainer = node;
node = factory.updateCatchClause(node, node.variableDeclaration, ts.visitNode(node.block, topLevelNestedVisitor, ts.isBlock));
enclosingBlockScopedContainer = savedEnclosingBlockScopedContainer;
return node;
}
/**
* Visits the body of a Block to hoist declarations.
*
* @param node The node to visit.
*/
function visitBlock(node) {
var savedEnclosingBlockScopedContainer = enclosingBlockScopedContainer;
enclosingBlockScopedContainer = node;
node = ts.visitEachChild(node, topLevelNestedVisitor, context);
enclosingBlockScopedContainer = savedEnclosingBlockScopedContainer;
return node;
}
//
// Destructuring Assignment Visitors
//
/**
* Visit nodes to flatten destructuring assignments to exported symbols.
*
* @param node The node to visit.
*/
function visitorWorker(node, valueIsDiscarded) {
if (!(node.transformFlags & (2048 /* ContainsDestructuringAssignment */ | 4194304 /* ContainsDynamicImport */ | 67108864 /* ContainsUpdateExpressionForIdentifier */))) {
return node;
}
switch (node.kind) {
case 240 /* ForStatement */:
return visitForStatement(node, /*isTopLevel*/ false);
case 236 /* ExpressionStatement */:
return visitExpressionStatement(node);
case 210 /* ParenthesizedExpression */:
return visitParenthesizedExpression(node, valueIsDiscarded);
case 345 /* PartiallyEmittedExpression */:
return visitPartiallyEmittedExpression(node, valueIsDiscarded);
case 219 /* BinaryExpression */:
if (ts.isDestructuringAssignment(node)) {
return visitDestructuringAssignment(node, valueIsDiscarded);
}
break;
case 206 /* CallExpression */:
if (ts.isImportCall(node)) {
return visitImportCallExpression(node);
}
break;
case 217 /* PrefixUnaryExpression */:
case 218 /* PostfixUnaryExpression */:
return visitPrefixOrPostfixUnaryExpression(node, valueIsDiscarded);
}
return ts.visitEachChild(node, visitor, context);
}
/**
* Visit nodes to flatten destructuring assignments to exported symbols.
*
* @param node The node to visit.
*/
function visitor(node) {
return visitorWorker(node, /*valueIsDiscarded*/ false);
}
function discardedValueVisitor(node) {
return visitorWorker(node, /*valueIsDiscarded*/ true);
}
function visitExpressionStatement(node) {
return factory.updateExpressionStatement(node, ts.visitNode(node.expression, discardedValueVisitor, ts.isExpression));
}
function visitParenthesizedExpression(node, valueIsDiscarded) {
return factory.updateParenthesizedExpression(node, ts.visitNode(node.expression, valueIsDiscarded ? discardedValueVisitor : visitor, ts.isExpression));
}
function visitPartiallyEmittedExpression(node, valueIsDiscarded) {
return factory.updatePartiallyEmittedExpression(node, ts.visitNode(node.expression, valueIsDiscarded ? discardedValueVisitor : visitor, ts.isExpression));
}
function visitImportCallExpression(node) {
// import("./blah")
// emit as
// System.register([], function (_export, _context) {
// return {
// setters: [],
// execute: () => {
// _context.import('./blah');
// }
// };
// });
var externalModuleName = ts.getExternalModuleNameLiteral(factory, node, currentSourceFile, host, resolver, compilerOptions);
var firstArgument = ts.visitNode(ts.firstOrUndefined(node.arguments), visitor);
// Only use the external module name if it differs from the first argument. This allows us to preserve the quote style of the argument on output.
var argument = externalModuleName && (!firstArgument || !ts.isStringLiteral(firstArgument) || firstArgument.text !== externalModuleName.text) ? externalModuleName : firstArgument;
return factory.createCallExpression(factory.createPropertyAccessExpression(contextObject, factory.createIdentifier("import")),
/*typeArguments*/ undefined, argument ? [argument] : []);
}
/**
* Visits a DestructuringAssignment to flatten destructuring to exported symbols.
*
* @param node The node to visit.
*/
function visitDestructuringAssignment(node, valueIsDiscarded) {
if (hasExportedReferenceInDestructuringTarget(node.left)) {
return ts.flattenDestructuringAssignment(node, visitor, context, 0 /* All */, !valueIsDiscarded);
}
return ts.visitEachChild(node, visitor, context);
}
/**
* Determines whether the target of a destructuring assignment refers to an exported symbol.
*
* @param node The destructuring target.
*/
function hasExportedReferenceInDestructuringTarget(node) {
if (ts.isAssignmentExpression(node, /*excludeCompoundAssignment*/ true)) {
return hasExportedReferenceInDestructuringTarget(node.left);
}
else if (ts.isSpreadElement(node)) {
return hasExportedReferenceInDestructuringTarget(node.expression);
}
else if (ts.isObjectLiteralExpression(node)) {
return ts.some(node.properties, hasExportedReferenceInDestructuringTarget);
}
else if (ts.isArrayLiteralExpression(node)) {
return ts.some(node.elements, hasExportedReferenceInDestructuringTarget);
}
else if (ts.isShorthandPropertyAssignment(node)) {
return hasExportedReferenceInDestructuringTarget(node.name);
}
else if (ts.isPropertyAssignment(node)) {
return hasExportedReferenceInDestructuringTarget(node.initializer);
}
else if (ts.isIdentifier(node)) {
var container = resolver.getReferencedExportContainer(node);
return container !== undefined && container.kind === 300 /* SourceFile */;
}
else {
return false;
}
}
function visitPrefixOrPostfixUnaryExpression(node, valueIsDiscarded) {
// When we see a prefix or postfix increment expression whose operand is an exported
// symbol, we should ensure all exports of that symbol are updated with the correct
// value.
//
// - We do not transform generated identifiers for any reason.
// - We do not transform identifiers tagged with the LocalName flag.
// - We do not transform identifiers that were originally the name of an enum or
// namespace due to how they are transformed in TypeScript.
// - We only transform identifiers that are exported at the top level.
if ((node.operator === 45 /* PlusPlusToken */ || node.operator === 46 /* MinusMinusToken */)
&& ts.isIdentifier(node.operand)
&& !ts.isGeneratedIdentifier(node.operand)
&& !ts.isLocalName(node.operand)
&& !ts.isDeclarationNameOfEnumOrNamespace(node.operand)) {
var exportedNames = getExports(node.operand);
if (exportedNames) {
var temp = void 0;
var expression = ts.visitNode(node.operand, visitor, ts.isExpression);
if (ts.isPrefixUnaryExpression(node)) {
expression = factory.updatePrefixUnaryExpression(node, expression);
}
else {
expression = factory.updatePostfixUnaryExpression(node, expression);
if (!valueIsDiscarded) {
temp = factory.createTempVariable(hoistVariableDeclaration);
expression = factory.createAssignment(temp, expression);
ts.setTextRange(expression, node);
}
expression = factory.createComma(expression, factory.cloneNode(node.operand));
ts.setTextRange(expression, node);
}
for (var _i = 0, exportedNames_4 = exportedNames; _i < exportedNames_4.length; _i++) {
var exportName = exportedNames_4[_i];
expression = createExportExpression(exportName, preventSubstitution(expression));
}
if (temp) {
expression = factory.createComma(expression, temp);
ts.setTextRange(expression, node);
}
return expression;
}
}
return ts.visitEachChild(node, visitor, context);
}
//
// Modifier Visitors
//
/**
* Visit nodes to elide module-specific modifiers.
*
* @param node The node to visit.
*/
function modifierVisitor(node) {
switch (node.kind) {
case 93 /* ExportKeyword */:
case 88 /* DefaultKeyword */:
return undefined;
}
return node;
}
//
// Emit Notification
//
/**
* Hook for node emit notifications.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to emit.
* @param emitCallback A callback used to emit the node in the printer.
*/
function onEmitNode(hint, node, emitCallback) {
if (node.kind === 300 /* SourceFile */) {
var id = ts.getOriginalNodeId(node);
currentSourceFile = node;
moduleInfo = moduleInfoMap[id];
exportFunction = exportFunctionsMap[id];
noSubstitution = noSubstitutionMap[id];
contextObject = contextObjectMap[id];
if (noSubstitution) {
delete noSubstitutionMap[id];
}
previousOnEmitNode(hint, node, emitCallback);
currentSourceFile = undefined;
moduleInfo = undefined;
exportFunction = undefined;
contextObject = undefined;
noSubstitution = undefined;
}
else {
previousOnEmitNode(hint, node, emitCallback);
}
}
//
// Substitutions
//
/**
* Hooks node substitutions.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to substitute.
*/
function onSubstituteNode(hint, node) {
node = previousOnSubstituteNode(hint, node);
if (isSubstitutionPrevented(node)) {
return node;
}
if (hint === 1 /* Expression */) {
return substituteExpression(node);
}
else if (hint === 4 /* Unspecified */) {
return substituteUnspecified(node);
}
return node;
}
/**
* Substitute the node, if necessary.
*
* @param node The node to substitute.
*/
function substituteUnspecified(node) {
switch (node.kind) {
case 292 /* ShorthandPropertyAssignment */:
return substituteShorthandPropertyAssignment(node);
}
return node;
}
/**
* Substitution for a ShorthandPropertyAssignment whose name that may contain an imported or exported symbol.
*
* @param node The node to substitute.
*/
function substituteShorthandPropertyAssignment(node) {
var _a, _b;
var name = node.name;
if (!ts.isGeneratedIdentifier(name) && !ts.isLocalName(name)) {
var importDeclaration = resolver.getReferencedImportDeclaration(name);
if (importDeclaration) {
if (ts.isImportClause(importDeclaration)) {
return ts.setTextRange(factory.createPropertyAssignment(factory.cloneNode(name), factory.createPropertyAccessExpression(factory.getGeneratedNameForNode(importDeclaration.parent), factory.createIdentifier("default"))),
/*location*/ node);
}
else if (ts.isImportSpecifier(importDeclaration)) {
return ts.setTextRange(factory.createPropertyAssignment(factory.cloneNode(name), factory.createPropertyAccessExpression(factory.getGeneratedNameForNode(((_b = (_a = importDeclaration.parent) === null || _a === void 0 ? void 0 : _a.parent) === null || _b === void 0 ? void 0 : _b.parent) || importDeclaration), factory.cloneNode(importDeclaration.propertyName || importDeclaration.name))),
/*location*/ node);
}
}
}
return node;
}
/**
* Substitute the expression, if necessary.
*
* @param node The node to substitute.
*/
function substituteExpression(node) {
switch (node.kind) {
case 79 /* Identifier */:
return substituteExpressionIdentifier(node);
case 219 /* BinaryExpression */:
return substituteBinaryExpression(node);
case 229 /* MetaProperty */:
return substituteMetaProperty(node);
}
return node;
}
/**
* Substitution for an Identifier expression that may contain an imported or exported symbol.
*
* @param node The node to substitute.
*/
function substituteExpressionIdentifier(node) {
var _a, _b;
if (ts.getEmitFlags(node) & 4096 /* HelperName */) {
var externalHelpersModuleName = ts.getExternalHelpersModuleName(currentSourceFile);
if (externalHelpersModuleName) {
return factory.createPropertyAccessExpression(externalHelpersModuleName, node);
}
return node;
}
// When we see an identifier in an expression position that
// points to an imported symbol, we should substitute a qualified
// reference to the imported symbol if one is needed.
//
// - We do not substitute generated identifiers for any reason.
// - We do not substitute identifiers tagged with the LocalName flag.
if (!ts.isGeneratedIdentifier(node) && !ts.isLocalName(node)) {
var importDeclaration = resolver.getReferencedImportDeclaration(node);
if (importDeclaration) {
if (ts.isImportClause(importDeclaration)) {
return ts.setTextRange(factory.createPropertyAccessExpression(factory.getGeneratedNameForNode(importDeclaration.parent), factory.createIdentifier("default")),
/*location*/ node);
}
else if (ts.isImportSpecifier(importDeclaration)) {
return ts.setTextRange(factory.createPropertyAccessExpression(factory.getGeneratedNameForNode(((_b = (_a = importDeclaration.parent) === null || _a === void 0 ? void 0 : _a.parent) === null || _b === void 0 ? void 0 : _b.parent) || importDeclaration), factory.cloneNode(importDeclaration.propertyName || importDeclaration.name)),
/*location*/ node);
}
}
}
return node;
}
/**
* Substitution for a BinaryExpression that may contain an imported or exported symbol.
*
* @param node The node to substitute.
*/
function substituteBinaryExpression(node) {
// When we see an assignment expression whose left-hand side is an exported symbol,
// we should ensure all exports of that symbol are updated with the correct value.
//
// - We do not substitute generated identifiers for any reason.
// - We do not substitute identifiers tagged with the LocalName flag.
// - We do not substitute identifiers that were originally the name of an enum or
// namespace due to how they are transformed in TypeScript.
// - We only substitute identifiers that are exported at the top level.
if (ts.isAssignmentOperator(node.operatorToken.kind)
&& ts.isIdentifier(node.left)
&& !ts.isGeneratedIdentifier(node.left)
&& !ts.isLocalName(node.left)
&& !ts.isDeclarationNameOfEnumOrNamespace(node.left)) {
var exportedNames = getExports(node.left);
if (exportedNames) {
// For each additional export of the declaration, apply an export assignment.
var expression = node;
for (var _i = 0, exportedNames_5 = exportedNames; _i < exportedNames_5.length; _i++) {
var exportName = exportedNames_5[_i];
expression = createExportExpression(exportName, preventSubstitution(expression));
}
return expression;
}
}
return node;
}
function substituteMetaProperty(node) {
if (ts.isImportMeta(node)) {
return factory.createPropertyAccessExpression(contextObject, factory.createIdentifier("meta"));
}
return node;
}
/**
* Gets the exports of a name.
*
* @param name The name.
*/
function getExports(name) {
var exportedNames;
if (!ts.isGeneratedIdentifier(name)) {
var valueDeclaration = resolver.getReferencedImportDeclaration(name)
|| resolver.getReferencedValueDeclaration(name);
if (valueDeclaration) {
var exportContainer = resolver.getReferencedExportContainer(name, /*prefixLocals*/ false);
if (exportContainer && exportContainer.kind === 300 /* SourceFile */) {
exportedNames = ts.append(exportedNames, factory.getDeclarationName(valueDeclaration));
}
exportedNames = ts.addRange(exportedNames, moduleInfo && moduleInfo.exportedBindings[ts.getOriginalNodeId(valueDeclaration)]);
}
}
return exportedNames;
}
/**
* Prevent substitution of a node for this transformer.
*
* @param node The node which should not be substituted.
*/
function preventSubstitution(node) {
if (noSubstitution === undefined)
noSubstitution = [];
noSubstitution[ts.getNodeId(node)] = true;
return node;
}
/**
* Determines whether a node should not be substituted.
*
* @param node The node to test.
*/
function isSubstitutionPrevented(node) {
return noSubstitution && node.id && noSubstitution[node.id];
}
}
ts.transformSystemModule = transformSystemModule;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
function transformECMAScriptModule(context) {
var factory = context.factory, emitHelpers = context.getEmitHelperFactory;
var compilerOptions = context.getCompilerOptions();
var previousOnEmitNode = context.onEmitNode;
var previousOnSubstituteNode = context.onSubstituteNode;
context.onEmitNode = onEmitNode;
context.onSubstituteNode = onSubstituteNode;
context.enableEmitNotification(300 /* SourceFile */);
context.enableSubstitution(79 /* Identifier */);
var helperNameSubstitutions;
return ts.chainBundle(context, transformSourceFile);
function transformSourceFile(node) {
if (node.isDeclarationFile) {
return node;
}
if (ts.isExternalModule(node) || compilerOptions.isolatedModules) {
var result = updateExternalModule(node);
if (!ts.isExternalModule(node) || ts.some(result.statements, ts.isExternalModuleIndicator)) {
return result;
}
return factory.updateSourceFile(result, ts.setTextRange(factory.createNodeArray(__spreadArray(__spreadArray([], result.statements, true), [ts.createEmptyExports(factory)], false)), result.statements));
}
return node;
}
function updateExternalModule(node) {
var externalHelpersImportDeclaration = ts.createExternalHelpersImportDeclarationIfNeeded(factory, emitHelpers(), node, compilerOptions);
if (externalHelpersImportDeclaration) {
var statements = [];
var statementOffset = factory.copyPrologue(node.statements, statements);
ts.append(statements, externalHelpersImportDeclaration);
ts.addRange(statements, ts.visitNodes(node.statements, visitor, ts.isStatement, statementOffset));
return factory.updateSourceFile(node, ts.setTextRange(factory.createNodeArray(statements), node.statements));
}
else {
return ts.visitEachChild(node, visitor, context);
}
}
function visitor(node) {
switch (node.kind) {
case 263 /* ImportEqualsDeclaration */:
// Elide `import=` as it is not legal with --module ES6
return undefined;
case 269 /* ExportAssignment */:
return visitExportAssignment(node);
case 270 /* ExportDeclaration */:
var exportDecl = node;
return visitExportDeclaration(exportDecl);
}
return node;
}
function visitExportAssignment(node) {
// Elide `export=` as it is not legal with --module ES6
return node.isExportEquals ? undefined : node;
}
function visitExportDeclaration(node) {
// `export * as ns` only needs to be transformed in ES2015
if (compilerOptions.module !== undefined && compilerOptions.module > ts.ModuleKind.ES2015) {
return node;
}
// Either ill-formed or don't need to be tranformed.
if (!node.exportClause || !ts.isNamespaceExport(node.exportClause) || !node.moduleSpecifier) {
return node;
}
var oldIdentifier = node.exportClause.name;
var synthName = factory.getGeneratedNameForNode(oldIdentifier);
var importDecl = factory.createImportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, factory.createImportClause(
/*isTypeOnly*/ false,
/*name*/ undefined, factory.createNamespaceImport(synthName)), node.moduleSpecifier);
ts.setOriginalNode(importDecl, node.exportClause);
var exportDecl = ts.isExportNamespaceAsDefaultDeclaration(node) ? factory.createExportDefault(synthName) : factory.createExportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, factory.createNamedExports([factory.createExportSpecifier(synthName, oldIdentifier)]));
ts.setOriginalNode(exportDecl, node);
return [importDecl, exportDecl];
}
//
// Emit Notification
//
/**
* Hook for node emit.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to emit.
* @param emit A callback used to emit the node in the printer.
*/
function onEmitNode(hint, node, emitCallback) {
if (ts.isSourceFile(node)) {
if ((ts.isExternalModule(node) || compilerOptions.isolatedModules) && compilerOptions.importHelpers) {
helperNameSubstitutions = new ts.Map();
}
previousOnEmitNode(hint, node, emitCallback);
helperNameSubstitutions = undefined;
}
else {
previousOnEmitNode(hint, node, emitCallback);
}
}
//
// Substitutions
//
/**
* Hooks node substitutions.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to substitute.
*/
function onSubstituteNode(hint, node) {
node = previousOnSubstituteNode(hint, node);
if (helperNameSubstitutions && ts.isIdentifier(node) && ts.getEmitFlags(node) & 4096 /* HelperName */) {
return substituteHelperName(node);
}
return node;
}
function substituteHelperName(node) {
var name = ts.idText(node);
var substitution = helperNameSubstitutions.get(name);
if (!substitution) {
helperNameSubstitutions.set(name, substitution = factory.createUniqueName(name, 16 /* Optimistic */ | 32 /* FileLevel */));
}
return substitution;
}
}
ts.transformECMAScriptModule = transformECMAScriptModule;
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
function canProduceDiagnostics(node) {
return ts.isVariableDeclaration(node) ||
ts.isPropertyDeclaration(node) ||
ts.isPropertySignature(node) ||
ts.isBindingElement(node) ||
ts.isSetAccessor(node) ||
ts.isGetAccessor(node) ||
ts.isConstructSignatureDeclaration(node) ||
ts.isCallSignatureDeclaration(node) ||
ts.isMethodDeclaration(node) ||
ts.isMethodSignature(node) ||
ts.isFunctionDeclaration(node) ||
ts.isParameter(node) ||
ts.isTypeParameterDeclaration(node) ||
ts.isExpressionWithTypeArguments(node) ||
ts.isImportEqualsDeclaration(node) ||
ts.isTypeAliasDeclaration(node) ||
ts.isConstructorDeclaration(node) ||
ts.isIndexSignatureDeclaration(node) ||
ts.isPropertyAccessExpression(node) ||
ts.isJSDocTypeAlias(node);
}
ts.canProduceDiagnostics = canProduceDiagnostics;
function createGetSymbolAccessibilityDiagnosticForNodeName(node) {
if (ts.isSetAccessor(node) || ts.isGetAccessor(node)) {
return getAccessorNameVisibilityError;
}
else if (ts.isMethodSignature(node) || ts.isMethodDeclaration(node)) {
return getMethodNameVisibilityError;
}
else {
return createGetSymbolAccessibilityDiagnosticForNode(node);
}
function getAccessorNameVisibilityError(symbolAccessibilityResult) {
var diagnosticMessage = getAccessorNameVisibilityDiagnosticMessage(symbolAccessibilityResult);
return diagnosticMessage !== undefined ? {
diagnosticMessage: diagnosticMessage,
errorNode: node,
typeName: node.name
} : undefined;
}
function getAccessorNameVisibilityDiagnosticMessage(symbolAccessibilityResult) {
if (ts.isStatic(node)) {
return symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Public_static_property_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Public_static_property_0_of_exported_class_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Public_static_property_0_of_exported_class_has_or_is_using_private_name_1;
}
else if (node.parent.kind === 255 /* ClassDeclaration */) {
return symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Public_property_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Public_property_0_of_exported_class_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Public_property_0_of_exported_class_has_or_is_using_private_name_1;
}
else {
return symbolAccessibilityResult.errorModuleName ?
ts.Diagnostics.Property_0_of_exported_interface_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Property_0_of_exported_interface_has_or_is_using_private_name_1;
}
}
function getMethodNameVisibilityError(symbolAccessibilityResult) {
var diagnosticMessage = getMethodNameVisibilityDiagnosticMessage(symbolAccessibilityResult);
return diagnosticMessage !== undefined ? {
diagnosticMessage: diagnosticMessage,
errorNode: node,
typeName: node.name
} : undefined;
}
function getMethodNameVisibilityDiagnosticMessage(symbolAccessibilityResult) {
if (ts.isStatic(node)) {
return symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Public_static_method_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Public_static_method_0_of_exported_class_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Public_static_method_0_of_exported_class_has_or_is_using_private_name_1;
}
else if (node.parent.kind === 255 /* ClassDeclaration */) {
return symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Public_method_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Public_method_0_of_exported_class_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Public_method_0_of_exported_class_has_or_is_using_private_name_1;
}
else {
return symbolAccessibilityResult.errorModuleName ?
ts.Diagnostics.Method_0_of_exported_interface_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Method_0_of_exported_interface_has_or_is_using_private_name_1;
}
}
}
ts.createGetSymbolAccessibilityDiagnosticForNodeName = createGetSymbolAccessibilityDiagnosticForNodeName;
function createGetSymbolAccessibilityDiagnosticForNode(node) {
if (ts.isVariableDeclaration(node) || ts.isPropertyDeclaration(node) || ts.isPropertySignature(node) || ts.isPropertyAccessExpression(node) || ts.isBindingElement(node) || ts.isConstructorDeclaration(node)) {
return getVariableDeclarationTypeVisibilityError;
}
else if (ts.isSetAccessor(node) || ts.isGetAccessor(node)) {
return getAccessorDeclarationTypeVisibilityError;
}
else if (ts.isConstructSignatureDeclaration(node) || ts.isCallSignatureDeclaration(node) || ts.isMethodDeclaration(node) || ts.isMethodSignature(node) || ts.isFunctionDeclaration(node) || ts.isIndexSignatureDeclaration(node)) {
return getReturnTypeVisibilityError;
}
else if (ts.isParameter(node)) {
if (ts.isParameterPropertyDeclaration(node, node.parent) && ts.hasSyntacticModifier(node.parent, 8 /* Private */)) {
return getVariableDeclarationTypeVisibilityError;
}
return getParameterDeclarationTypeVisibilityError;
}
else if (ts.isTypeParameterDeclaration(node)) {
return getTypeParameterConstraintVisibilityError;
}
else if (ts.isExpressionWithTypeArguments(node)) {
return getHeritageClauseVisibilityError;
}
else if (ts.isImportEqualsDeclaration(node)) {
return getImportEntityNameVisibilityError;
}
else if (ts.isTypeAliasDeclaration(node) || ts.isJSDocTypeAlias(node)) {
return getTypeAliasDeclarationVisibilityError;
}
else {
return ts.Debug.assertNever(node, "Attempted to set a declaration diagnostic context for unhandled node kind: " + ts.SyntaxKind[node.kind]);
}
function getVariableDeclarationTypeVisibilityDiagnosticMessage(symbolAccessibilityResult) {
if (node.kind === 252 /* VariableDeclaration */ || node.kind === 201 /* BindingElement */) {
return symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Exported_variable_0_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Exported_variable_0_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Exported_variable_0_has_or_is_using_private_name_1;
}
// This check is to ensure we don't report error on constructor parameter property as that error would be reported during parameter emit
// The only exception here is if the constructor was marked as private. we are not emitting the constructor parameters at all.
else if (node.kind === 165 /* PropertyDeclaration */ || node.kind === 204 /* PropertyAccessExpression */ || node.kind === 164 /* PropertySignature */ ||
(node.kind === 162 /* Parameter */ && ts.hasSyntacticModifier(node.parent, 8 /* Private */))) {
// TODO(jfreeman): Deal with computed properties in error reporting.
if (ts.isStatic(node)) {
return symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Public_static_property_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Public_static_property_0_of_exported_class_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Public_static_property_0_of_exported_class_has_or_is_using_private_name_1;
}
else if (node.parent.kind === 255 /* ClassDeclaration */ || node.kind === 162 /* Parameter */) {
return symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Public_property_0_of_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Public_property_0_of_exported_class_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Public_property_0_of_exported_class_has_or_is_using_private_name_1;
}
else {
// Interfaces cannot have types that cannot be named
return symbolAccessibilityResult.errorModuleName ?
ts.Diagnostics.Property_0_of_exported_interface_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Property_0_of_exported_interface_has_or_is_using_private_name_1;
}
}
}
function getVariableDeclarationTypeVisibilityError(symbolAccessibilityResult) {
var diagnosticMessage = getVariableDeclarationTypeVisibilityDiagnosticMessage(symbolAccessibilityResult);
return diagnosticMessage !== undefined ? {
diagnosticMessage: diagnosticMessage,
errorNode: node,
typeName: node.name
} : undefined;
}
function getAccessorDeclarationTypeVisibilityError(symbolAccessibilityResult) {
var diagnosticMessage;
if (node.kind === 171 /* SetAccessor */) {
// Getters can infer the return type from the returned expression, but setters cannot, so the
// "_from_external_module_1_but_cannot_be_named" case cannot occur.
if (ts.isStatic(node)) {
diagnosticMessage = symbolAccessibilityResult.errorModuleName ?
ts.Diagnostics.Parameter_type_of_public_static_setter_0_from_exported_class_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Parameter_type_of_public_static_setter_0_from_exported_class_has_or_is_using_private_name_1;
}
else {
diagnosticMessage = symbolAccessibilityResult.errorModuleName ?
ts.Diagnostics.Parameter_type_of_public_setter_0_from_exported_class_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Parameter_type_of_public_setter_0_from_exported_class_has_or_is_using_private_name_1;
}
}
else {
if (ts.isStatic(node)) {
diagnosticMessage = symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Return_type_of_public_static_getter_0_from_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Return_type_of_public_static_getter_0_from_exported_class_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Return_type_of_public_static_getter_0_from_exported_class_has_or_is_using_private_name_1;
}
else {
diagnosticMessage = symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Return_type_of_public_getter_0_from_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Return_type_of_public_getter_0_from_exported_class_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Return_type_of_public_getter_0_from_exported_class_has_or_is_using_private_name_1;
}
}
return {
diagnosticMessage: diagnosticMessage,
errorNode: node.name,
typeName: node.name
};
}
function getReturnTypeVisibilityError(symbolAccessibilityResult) {
var diagnosticMessage;
switch (node.kind) {
case 173 /* ConstructSignature */:
// Interfaces cannot have return types that cannot be named
diagnosticMessage = symbolAccessibilityResult.errorModuleName ?
ts.Diagnostics.Return_type_of_constructor_signature_from_exported_interface_has_or_is_using_name_0_from_private_module_1 :
ts.Diagnostics.Return_type_of_constructor_signature_from_exported_interface_has_or_is_using_private_name_0;
break;
case 172 /* CallSignature */:
// Interfaces cannot have return types that cannot be named
diagnosticMessage = symbolAccessibilityResult.errorModuleName ?
ts.Diagnostics.Return_type_of_call_signature_from_exported_interface_has_or_is_using_name_0_from_private_module_1 :
ts.Diagnostics.Return_type_of_call_signature_from_exported_interface_has_or_is_using_private_name_0;
break;
case 174 /* IndexSignature */:
// Interfaces cannot have return types that cannot be named
diagnosticMessage = symbolAccessibilityResult.errorModuleName ?
ts.Diagnostics.Return_type_of_index_signature_from_exported_interface_has_or_is_using_name_0_from_private_module_1 :
ts.Diagnostics.Return_type_of_index_signature_from_exported_interface_has_or_is_using_private_name_0;
break;
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
if (ts.isStatic(node)) {
diagnosticMessage = symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Return_type_of_public_static_method_from_exported_class_has_or_is_using_name_0_from_external_module_1_but_cannot_be_named :
ts.Diagnostics.Return_type_of_public_static_method_from_exported_class_has_or_is_using_name_0_from_private_module_1 :
ts.Diagnostics.Return_type_of_public_static_method_from_exported_class_has_or_is_using_private_name_0;
}
else if (node.parent.kind === 255 /* ClassDeclaration */) {
diagnosticMessage = symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Return_type_of_public_method_from_exported_class_has_or_is_using_name_0_from_external_module_1_but_cannot_be_named :
ts.Diagnostics.Return_type_of_public_method_from_exported_class_has_or_is_using_name_0_from_private_module_1 :
ts.Diagnostics.Return_type_of_public_method_from_exported_class_has_or_is_using_private_name_0;
}
else {
// Interfaces cannot have return types that cannot be named
diagnosticMessage = symbolAccessibilityResult.errorModuleName ?
ts.Diagnostics.Return_type_of_method_from_exported_interface_has_or_is_using_name_0_from_private_module_1 :
ts.Diagnostics.Return_type_of_method_from_exported_interface_has_or_is_using_private_name_0;
}
break;
case 254 /* FunctionDeclaration */:
diagnosticMessage = symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Return_type_of_exported_function_has_or_is_using_name_0_from_external_module_1_but_cannot_be_named :
ts.Diagnostics.Return_type_of_exported_function_has_or_is_using_name_0_from_private_module_1 :
ts.Diagnostics.Return_type_of_exported_function_has_or_is_using_private_name_0;
break;
default:
return ts.Debug.fail("This is unknown kind for signature: " + node.kind);
}
return {
diagnosticMessage: diagnosticMessage,
errorNode: node.name || node
};
}
function getParameterDeclarationTypeVisibilityError(symbolAccessibilityResult) {
var diagnosticMessage = getParameterDeclarationTypeVisibilityDiagnosticMessage(symbolAccessibilityResult);
return diagnosticMessage !== undefined ? {
diagnosticMessage: diagnosticMessage,
errorNode: node,
typeName: node.name
} : undefined;
}
function getParameterDeclarationTypeVisibilityDiagnosticMessage(symbolAccessibilityResult) {
switch (node.parent.kind) {
case 169 /* Constructor */:
return symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Parameter_0_of_constructor_from_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Parameter_0_of_constructor_from_exported_class_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Parameter_0_of_constructor_from_exported_class_has_or_is_using_private_name_1;
case 173 /* ConstructSignature */:
case 178 /* ConstructorType */:
// Interfaces cannot have parameter types that cannot be named
return symbolAccessibilityResult.errorModuleName ?
ts.Diagnostics.Parameter_0_of_constructor_signature_from_exported_interface_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Parameter_0_of_constructor_signature_from_exported_interface_has_or_is_using_private_name_1;
case 172 /* CallSignature */:
// Interfaces cannot have parameter types that cannot be named
return symbolAccessibilityResult.errorModuleName ?
ts.Diagnostics.Parameter_0_of_call_signature_from_exported_interface_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Parameter_0_of_call_signature_from_exported_interface_has_or_is_using_private_name_1;
case 174 /* IndexSignature */:
// Interfaces cannot have parameter types that cannot be named
return symbolAccessibilityResult.errorModuleName ?
ts.Diagnostics.Parameter_0_of_index_signature_from_exported_interface_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Parameter_0_of_index_signature_from_exported_interface_has_or_is_using_private_name_1;
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
if (ts.isStatic(node.parent)) {
return symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Parameter_0_of_public_static_method_from_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Parameter_0_of_public_static_method_from_exported_class_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Parameter_0_of_public_static_method_from_exported_class_has_or_is_using_private_name_1;
}
else if (node.parent.parent.kind === 255 /* ClassDeclaration */) {
return symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Parameter_0_of_public_method_from_exported_class_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Parameter_0_of_public_method_from_exported_class_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Parameter_0_of_public_method_from_exported_class_has_or_is_using_private_name_1;
}
else {
// Interfaces cannot have parameter types that cannot be named
return symbolAccessibilityResult.errorModuleName ?
ts.Diagnostics.Parameter_0_of_method_from_exported_interface_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Parameter_0_of_method_from_exported_interface_has_or_is_using_private_name_1;
}
case 254 /* FunctionDeclaration */:
case 177 /* FunctionType */:
return symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Parameter_0_of_exported_function_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Parameter_0_of_exported_function_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Parameter_0_of_exported_function_has_or_is_using_private_name_1;
case 171 /* SetAccessor */:
case 170 /* GetAccessor */:
return symbolAccessibilityResult.errorModuleName ?
symbolAccessibilityResult.accessibility === 2 /* CannotBeNamed */ ?
ts.Diagnostics.Parameter_0_of_accessor_has_or_is_using_name_1_from_external_module_2_but_cannot_be_named :
ts.Diagnostics.Parameter_0_of_accessor_has_or_is_using_name_1_from_private_module_2 :
ts.Diagnostics.Parameter_0_of_accessor_has_or_is_using_private_name_1;
default:
return ts.Debug.fail("Unknown parent for parameter: " + ts.SyntaxKind[node.parent.kind]);
}
}
function getTypeParameterConstraintVisibilityError() {
// Type parameter constraints are named by user so we should always be able to name it
var diagnosticMessage;
switch (node.parent.kind) {
case 255 /* ClassDeclaration */:
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_exported_class_has_or_is_using_private_name_1;
break;
case 256 /* InterfaceDeclaration */:
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_exported_interface_has_or_is_using_private_name_1;
break;
case 193 /* MappedType */:
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_exported_mapped_object_type_is_using_private_name_1;
break;
case 178 /* ConstructorType */:
case 173 /* ConstructSignature */:
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_constructor_signature_from_exported_interface_has_or_is_using_private_name_1;
break;
case 172 /* CallSignature */:
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_call_signature_from_exported_interface_has_or_is_using_private_name_1;
break;
case 167 /* MethodDeclaration */:
case 166 /* MethodSignature */:
if (ts.isStatic(node.parent)) {
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_public_static_method_from_exported_class_has_or_is_using_private_name_1;
}
else if (node.parent.parent.kind === 255 /* ClassDeclaration */) {
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_public_method_from_exported_class_has_or_is_using_private_name_1;
}
else {
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_method_from_exported_interface_has_or_is_using_private_name_1;
}
break;
case 177 /* FunctionType */:
case 254 /* FunctionDeclaration */:
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_exported_function_has_or_is_using_private_name_1;
break;
case 257 /* TypeAliasDeclaration */:
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_exported_type_alias_has_or_is_using_private_name_1;
break;
default:
return ts.Debug.fail("This is unknown parent for type parameter: " + node.parent.kind);
}
return {
diagnosticMessage: diagnosticMessage,
errorNode: node,
typeName: node.name
};
}
function getHeritageClauseVisibilityError() {
var diagnosticMessage;
// Heritage clause is written by user so it can always be named
if (ts.isClassDeclaration(node.parent.parent)) {
// Class or Interface implemented/extended is inaccessible
diagnosticMessage = ts.isHeritageClause(node.parent) && node.parent.token === 117 /* ImplementsKeyword */ ?
ts.Diagnostics.Implements_clause_of_exported_class_0_has_or_is_using_private_name_1 :
node.parent.parent.name ? ts.Diagnostics.extends_clause_of_exported_class_0_has_or_is_using_private_name_1 :
ts.Diagnostics.extends_clause_of_exported_class_has_or_is_using_private_name_0;
}
else {
// interface is inaccessible
diagnosticMessage = ts.Diagnostics.extends_clause_of_exported_interface_0_has_or_is_using_private_name_1;
}
return {
diagnosticMessage: diagnosticMessage,
errorNode: node,
typeName: ts.getNameOfDeclaration(node.parent.parent)
};
}
function getImportEntityNameVisibilityError() {
return {
diagnosticMessage: ts.Diagnostics.Import_declaration_0_is_using_private_name_1,
errorNode: node,
typeName: node.name
};
}
function getTypeAliasDeclarationVisibilityError(symbolAccessibilityResult) {
return {
diagnosticMessage: symbolAccessibilityResult.errorModuleName
? ts.Diagnostics.Exported_type_alias_0_has_or_is_using_private_name_1_from_module_2
: ts.Diagnostics.Exported_type_alias_0_has_or_is_using_private_name_1,
errorNode: ts.isJSDocTypeAlias(node) ? ts.Debug.checkDefined(node.typeExpression) : node.type,
typeName: ts.isJSDocTypeAlias(node) ? ts.getNameOfDeclaration(node) : node.name,
};
}
}
ts.createGetSymbolAccessibilityDiagnosticForNode = createGetSymbolAccessibilityDiagnosticForNode;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
function getDeclarationDiagnostics(host, resolver, file) {
var compilerOptions = host.getCompilerOptions();
var result = ts.transformNodes(resolver, host, ts.factory, compilerOptions, file ? [file] : ts.filter(host.getSourceFiles(), ts.isSourceFileNotJson), [transformDeclarations], /*allowDtsFiles*/ false);
return result.diagnostics;
}
ts.getDeclarationDiagnostics = getDeclarationDiagnostics;
function hasInternalAnnotation(range, currentSourceFile) {
var comment = currentSourceFile.text.substring(range.pos, range.end);
return ts.stringContains(comment, "@internal");
}
function isInternalDeclaration(node, currentSourceFile) {
var parseTreeNode = ts.getParseTreeNode(node);
if (parseTreeNode && parseTreeNode.kind === 162 /* Parameter */) {
var paramIdx = parseTreeNode.parent.parameters.indexOf(parseTreeNode);
var previousSibling = paramIdx > 0 ? parseTreeNode.parent.parameters[paramIdx - 1] : undefined;
var text = currentSourceFile.text;
var commentRanges = previousSibling
? ts.concatenate(
// to handle
// ... parameters, /* @internal */
// public param: string
ts.getTrailingCommentRanges(text, ts.skipTrivia(text, previousSibling.end + 1, /* stopAfterLineBreak */ false, /* stopAtComments */ true)), ts.getLeadingCommentRanges(text, node.pos))
: ts.getTrailingCommentRanges(text, ts.skipTrivia(text, node.pos, /* stopAfterLineBreak */ false, /* stopAtComments */ true));
return commentRanges && commentRanges.length && hasInternalAnnotation(ts.last(commentRanges), currentSourceFile);
}
var leadingCommentRanges = parseTreeNode && ts.getLeadingCommentRangesOfNode(parseTreeNode, currentSourceFile);
return !!ts.forEach(leadingCommentRanges, function (range) {
return hasInternalAnnotation(range, currentSourceFile);
});
}
ts.isInternalDeclaration = isInternalDeclaration;
var declarationEmitNodeBuilderFlags = 1024 /* MultilineObjectLiterals */ |
2048 /* WriteClassExpressionAsTypeLiteral */ |
4096 /* UseTypeOfFunction */ |
8 /* UseStructuralFallback */ |
524288 /* AllowEmptyTuple */ |
4 /* GenerateNamesForShadowedTypeParams */ |
1 /* NoTruncation */;
/**
* Transforms a ts file into a .d.ts file
* This process requires type information, which is retrieved through the emit resolver. Because of this,
* in many places this transformer assumes it will be operating on parse tree nodes directly.
* This means that _no transforms should be allowed to occur before this one_.
*/
function transformDeclarations(context) {
var throwDiagnostic = function () { return ts.Debug.fail("Diagnostic emitted without context"); };
var getSymbolAccessibilityDiagnostic = throwDiagnostic;
var needsDeclare = true;
var isBundledEmit = false;
var resultHasExternalModuleIndicator = false;
var needsScopeFixMarker = false;
var resultHasScopeMarker = false;
var enclosingDeclaration;
var necessaryTypeReferences;
var lateMarkedStatements;
var lateStatementReplacementMap;
var suppressNewDiagnosticContexts;
var exportedModulesFromDeclarationEmit;
var factory = context.factory;
var host = context.getEmitHost();
var symbolTracker = {
trackSymbol: trackSymbol,
reportInaccessibleThisError: reportInaccessibleThisError,
reportInaccessibleUniqueSymbolError: reportInaccessibleUniqueSymbolError,
reportCyclicStructureError: reportCyclicStructureError,
reportPrivateInBaseOfClassExpression: reportPrivateInBaseOfClassExpression,
reportLikelyUnsafeImportRequiredError: reportLikelyUnsafeImportRequiredError,
reportTruncationError: reportTruncationError,
moduleResolverHost: host,
trackReferencedAmbientModule: trackReferencedAmbientModule,
trackExternalModuleSymbolOfImportTypeNode: trackExternalModuleSymbolOfImportTypeNode,
reportNonlocalAugmentation: reportNonlocalAugmentation,
reportNonSerializableProperty: reportNonSerializableProperty
};
var errorNameNode;
var errorFallbackNode;
var currentSourceFile;
var refs;
var libs;
var emittedImports; // must be declared in container so it can be `undefined` while transformer's first pass
var resolver = context.getEmitResolver();
var options = context.getCompilerOptions();
var noResolve = options.noResolve, stripInternal = options.stripInternal;
return transformRoot;
function recordTypeReferenceDirectivesIfNecessary(typeReferenceDirectives) {
if (!typeReferenceDirectives) {
return;
}
necessaryTypeReferences = necessaryTypeReferences || new ts.Set();
for (var _i = 0, typeReferenceDirectives_2 = typeReferenceDirectives; _i < typeReferenceDirectives_2.length; _i++) {
var ref = typeReferenceDirectives_2[_i];
necessaryTypeReferences.add(ref);
}
}
function trackReferencedAmbientModule(node, symbol) {
// If it is visible via `// <reference types="..."/>`, then we should just use that
var directives = resolver.getTypeReferenceDirectivesForSymbol(symbol, 67108863 /* All */);
if (ts.length(directives)) {
return recordTypeReferenceDirectivesIfNecessary(directives);
}
// Otherwise we should emit a path-based reference
var container = ts.getSourceFileOfNode(node);
refs.set(ts.getOriginalNodeId(container), container);
}
function handleSymbolAccessibilityError(symbolAccessibilityResult) {
if (symbolAccessibilityResult.accessibility === 0 /* Accessible */) {
// Add aliases back onto the possible imports list if they're not there so we can try them again with updated visibility info
if (symbolAccessibilityResult && symbolAccessibilityResult.aliasesToMakeVisible) {
if (!lateMarkedStatements) {
lateMarkedStatements = symbolAccessibilityResult.aliasesToMakeVisible;
}
else {
for (var _i = 0, _a = symbolAccessibilityResult.aliasesToMakeVisible; _i < _a.length; _i++) {
var ref = _a[_i];
ts.pushIfUnique(lateMarkedStatements, ref);
}
}
}
// TODO: Do all these accessibility checks inside/after the first pass in the checker when declarations are enabled, if possible
}
else {
// Report error
var errorInfo = getSymbolAccessibilityDiagnostic(symbolAccessibilityResult);
if (errorInfo) {
if (errorInfo.typeName) {
context.addDiagnostic(ts.createDiagnosticForNode(symbolAccessibilityResult.errorNode || errorInfo.errorNode, errorInfo.diagnosticMessage, ts.getTextOfNode(errorInfo.typeName), symbolAccessibilityResult.errorSymbolName, symbolAccessibilityResult.errorModuleName));
}
else {
context.addDiagnostic(ts.createDiagnosticForNode(symbolAccessibilityResult.errorNode || errorInfo.errorNode, errorInfo.diagnosticMessage, symbolAccessibilityResult.errorSymbolName, symbolAccessibilityResult.errorModuleName));
}
return true;
}
}
return false;
}
function trackExternalModuleSymbolOfImportTypeNode(symbol) {
if (!isBundledEmit) {
(exportedModulesFromDeclarationEmit || (exportedModulesFromDeclarationEmit = [])).push(symbol);
}
}
function trackSymbol(symbol, enclosingDeclaration, meaning) {
if (symbol.flags & 262144 /* TypeParameter */)
return false;
var issuedDiagnostic = handleSymbolAccessibilityError(resolver.isSymbolAccessible(symbol, enclosingDeclaration, meaning, /*shouldComputeAliasesToMakeVisible*/ true));
recordTypeReferenceDirectivesIfNecessary(resolver.getTypeReferenceDirectivesForSymbol(symbol, meaning));
return issuedDiagnostic;
}
function reportPrivateInBaseOfClassExpression(propertyName) {
if (errorNameNode || errorFallbackNode) {
context.addDiagnostic(ts.createDiagnosticForNode((errorNameNode || errorFallbackNode), ts.Diagnostics.Property_0_of_exported_class_expression_may_not_be_private_or_protected, propertyName));
}
}
function errorDeclarationNameWithFallback() {
return errorNameNode ? ts.declarationNameToString(errorNameNode) :
errorFallbackNode && ts.getNameOfDeclaration(errorFallbackNode) ? ts.declarationNameToString(ts.getNameOfDeclaration(errorFallbackNode)) :
errorFallbackNode && ts.isExportAssignment(errorFallbackNode) ? errorFallbackNode.isExportEquals ? "export=" : "default" :
"(Missing)"; // same fallback declarationNameToString uses when node is zero-width (ie, nameless)
}
function reportInaccessibleUniqueSymbolError() {
if (errorNameNode || errorFallbackNode) {
context.addDiagnostic(ts.createDiagnosticForNode((errorNameNode || errorFallbackNode), ts.Diagnostics.The_inferred_type_of_0_references_an_inaccessible_1_type_A_type_annotation_is_necessary, errorDeclarationNameWithFallback(), "unique symbol"));
}
}
function reportCyclicStructureError() {
if (errorNameNode || errorFallbackNode) {
context.addDiagnostic(ts.createDiagnosticForNode((errorNameNode || errorFallbackNode), ts.Diagnostics.The_inferred_type_of_0_references_a_type_with_a_cyclic_structure_which_cannot_be_trivially_serialized_A_type_annotation_is_necessary, errorDeclarationNameWithFallback()));
}
}
function reportInaccessibleThisError() {
if (errorNameNode || errorFallbackNode) {
context.addDiagnostic(ts.createDiagnosticForNode((errorNameNode || errorFallbackNode), ts.Diagnostics.The_inferred_type_of_0_references_an_inaccessible_1_type_A_type_annotation_is_necessary, errorDeclarationNameWithFallback(), "this"));
}
}
function reportLikelyUnsafeImportRequiredError(specifier) {
if (errorNameNode || errorFallbackNode) {
context.addDiagnostic(ts.createDiagnosticForNode((errorNameNode || errorFallbackNode), ts.Diagnostics.The_inferred_type_of_0_cannot_be_named_without_a_reference_to_1_This_is_likely_not_portable_A_type_annotation_is_necessary, errorDeclarationNameWithFallback(), specifier));
}
}
function reportTruncationError() {
if (errorNameNode || errorFallbackNode) {
context.addDiagnostic(ts.createDiagnosticForNode((errorNameNode || errorFallbackNode), ts.Diagnostics.The_inferred_type_of_this_node_exceeds_the_maximum_length_the_compiler_will_serialize_An_explicit_type_annotation_is_needed));
}
}
function reportNonlocalAugmentation(containingFile, parentSymbol, symbol) {
var _a;
var primaryDeclaration = (_a = parentSymbol.declarations) === null || _a === void 0 ? void 0 : _a.find(function (d) { return ts.getSourceFileOfNode(d) === containingFile; });
var augmentingDeclarations = ts.filter(symbol.declarations, function (d) { return ts.getSourceFileOfNode(d) !== containingFile; });
if (augmentingDeclarations) {
for (var _i = 0, augmentingDeclarations_1 = augmentingDeclarations; _i < augmentingDeclarations_1.length; _i++) {
var augmentations = augmentingDeclarations_1[_i];
context.addDiagnostic(ts.addRelatedInfo(ts.createDiagnosticForNode(augmentations, ts.Diagnostics.Declaration_augments_declaration_in_another_file_This_cannot_be_serialized), ts.createDiagnosticForNode(primaryDeclaration, ts.Diagnostics.This_is_the_declaration_being_augmented_Consider_moving_the_augmenting_declaration_into_the_same_file)));
}
}
}
function reportNonSerializableProperty(propertyName) {
if (errorNameNode || errorFallbackNode) {
context.addDiagnostic(ts.createDiagnosticForNode((errorNameNode || errorFallbackNode), ts.Diagnostics.The_type_of_this_node_cannot_be_serialized_because_its_property_0_cannot_be_serialized, propertyName));
}
}
function transformDeclarationsForJS(sourceFile, bundled) {
var oldDiag = getSymbolAccessibilityDiagnostic;
getSymbolAccessibilityDiagnostic = function (s) { return (s.errorNode && ts.canProduceDiagnostics(s.errorNode) ? ts.createGetSymbolAccessibilityDiagnosticForNode(s.errorNode)(s) : ({
diagnosticMessage: s.errorModuleName
? ts.Diagnostics.Declaration_emit_for_this_file_requires_using_private_name_0_from_module_1_An_explicit_type_annotation_may_unblock_declaration_emit
: ts.Diagnostics.Declaration_emit_for_this_file_requires_using_private_name_0_An_explicit_type_annotation_may_unblock_declaration_emit,
errorNode: s.errorNode || sourceFile
})); };
var result = resolver.getDeclarationStatementsForSourceFile(sourceFile, declarationEmitNodeBuilderFlags, symbolTracker, bundled);
getSymbolAccessibilityDiagnostic = oldDiag;
return result;
}
function transformRoot(node) {
if (node.kind === 300 /* SourceFile */ && node.isDeclarationFile) {
return node;
}
if (node.kind === 301 /* Bundle */) {
isBundledEmit = true;
refs = new ts.Map();
libs = new ts.Map();
var hasNoDefaultLib_1 = false;
var bundle = factory.createBundle(ts.map(node.sourceFiles, function (sourceFile) {
if (sourceFile.isDeclarationFile)
return undefined; // Omit declaration files from bundle results, too // TODO: GH#18217
hasNoDefaultLib_1 = hasNoDefaultLib_1 || sourceFile.hasNoDefaultLib;
currentSourceFile = sourceFile;
enclosingDeclaration = sourceFile;
lateMarkedStatements = undefined;
suppressNewDiagnosticContexts = false;
lateStatementReplacementMap = new ts.Map();
getSymbolAccessibilityDiagnostic = throwDiagnostic;
needsScopeFixMarker = false;
resultHasScopeMarker = false;
collectReferences(sourceFile, refs);
collectLibs(sourceFile, libs);
if (ts.isExternalOrCommonJsModule(sourceFile) || ts.isJsonSourceFile(sourceFile)) {
resultHasExternalModuleIndicator = false; // unused in external module bundle emit (all external modules are within module blocks, therefore are known to be modules)
needsDeclare = false;
var statements = ts.isSourceFileJS(sourceFile) ? factory.createNodeArray(transformDeclarationsForJS(sourceFile, /*bundled*/ true)) : ts.visitNodes(sourceFile.statements, visitDeclarationStatements);
var newFile = factory.updateSourceFile(sourceFile, [factory.createModuleDeclaration([], [factory.createModifier(134 /* DeclareKeyword */)], factory.createStringLiteral(ts.getResolvedExternalModuleName(context.getEmitHost(), sourceFile)), factory.createModuleBlock(ts.setTextRange(factory.createNodeArray(transformAndReplaceLatePaintedStatements(statements)), sourceFile.statements)))], /*isDeclarationFile*/ true, /*referencedFiles*/ [], /*typeReferences*/ [], /*hasNoDefaultLib*/ false, /*libReferences*/ []);
return newFile;
}
needsDeclare = true;
var updated = ts.isSourceFileJS(sourceFile) ? factory.createNodeArray(transformDeclarationsForJS(sourceFile)) : ts.visitNodes(sourceFile.statements, visitDeclarationStatements);
return factory.updateSourceFile(sourceFile, transformAndReplaceLatePaintedStatements(updated), /*isDeclarationFile*/ true, /*referencedFiles*/ [], /*typeReferences*/ [], /*hasNoDefaultLib*/ false, /*libReferences*/ []);
}), ts.mapDefined(node.prepends, function (prepend) {
if (prepend.kind === 303 /* InputFiles */) {
var sourceFile = ts.createUnparsedSourceFile(prepend, "dts", stripInternal);
hasNoDefaultLib_1 = hasNoDefaultLib_1 || !!sourceFile.hasNoDefaultLib;
collectReferences(sourceFile, refs);
recordTypeReferenceDirectivesIfNecessary(sourceFile.typeReferenceDirectives);
collectLibs(sourceFile, libs);
return sourceFile;
}
return prepend;
}));
bundle.syntheticFileReferences = [];
bundle.syntheticTypeReferences = getFileReferencesForUsedTypeReferences();
bundle.syntheticLibReferences = getLibReferences();
bundle.hasNoDefaultLib = hasNoDefaultLib_1;
var outputFilePath_1 = ts.getDirectoryPath(ts.normalizeSlashes(ts.getOutputPathsFor(node, host, /*forceDtsPaths*/ true).declarationFilePath));
var referenceVisitor_1 = mapReferencesIntoArray(bundle.syntheticFileReferences, outputFilePath_1);
refs.forEach(referenceVisitor_1);
return bundle;
}
// Single source file
needsDeclare = true;
needsScopeFixMarker = false;
resultHasScopeMarker = false;
enclosingDeclaration = node;
currentSourceFile = node;
getSymbolAccessibilityDiagnostic = throwDiagnostic;
isBundledEmit = false;
resultHasExternalModuleIndicator = false;
suppressNewDiagnosticContexts = false;
lateMarkedStatements = undefined;
lateStatementReplacementMap = new ts.Map();
necessaryTypeReferences = undefined;
refs = collectReferences(currentSourceFile, new ts.Map());
libs = collectLibs(currentSourceFile, new ts.Map());
var references = [];
var outputFilePath = ts.getDirectoryPath(ts.normalizeSlashes(ts.getOutputPathsFor(node, host, /*forceDtsPaths*/ true).declarationFilePath));
var referenceVisitor = mapReferencesIntoArray(references, outputFilePath);
var combinedStatements;
if (ts.isSourceFileJS(currentSourceFile)) {
combinedStatements = factory.createNodeArray(transformDeclarationsForJS(node));
refs.forEach(referenceVisitor);
emittedImports = ts.filter(combinedStatements, ts.isAnyImportSyntax);
}
else {
var statements = ts.visitNodes(node.statements, visitDeclarationStatements);
combinedStatements = ts.setTextRange(factory.createNodeArray(transformAndReplaceLatePaintedStatements(statements)), node.statements);
refs.forEach(referenceVisitor);
emittedImports = ts.filter(combinedStatements, ts.isAnyImportSyntax);
if (ts.isExternalModule(node) && (!resultHasExternalModuleIndicator || (needsScopeFixMarker && !resultHasScopeMarker))) {
combinedStatements = ts.setTextRange(factory.createNodeArray(__spreadArray(__spreadArray([], combinedStatements, true), [ts.createEmptyExports(factory)], false)), combinedStatements);
}
}
var updated = factory.updateSourceFile(node, combinedStatements, /*isDeclarationFile*/ true, references, getFileReferencesForUsedTypeReferences(), node.hasNoDefaultLib, getLibReferences());
updated.exportedModulesFromDeclarationEmit = exportedModulesFromDeclarationEmit;
return updated;
function getLibReferences() {
return ts.map(ts.arrayFrom(libs.keys()), function (lib) { return ({ fileName: lib, pos: -1, end: -1 }); });
}
function getFileReferencesForUsedTypeReferences() {
return necessaryTypeReferences ? ts.mapDefined(ts.arrayFrom(necessaryTypeReferences.keys()), getFileReferenceForTypeName) : [];
}
function getFileReferenceForTypeName(typeName) {
// Elide type references for which we have imports
if (emittedImports) {
for (var _i = 0, emittedImports_1 = emittedImports; _i < emittedImports_1.length; _i++) {
var importStatement = emittedImports_1[_i];
if (ts.isImportEqualsDeclaration(importStatement) && ts.isExternalModuleReference(importStatement.moduleReference)) {
var expr = importStatement.moduleReference.expression;
if (ts.isStringLiteralLike(expr) && expr.text === typeName) {
return undefined;
}
}
else if (ts.isImportDeclaration(importStatement) && ts.isStringLiteral(importStatement.moduleSpecifier) && importStatement.moduleSpecifier.text === typeName) {
return undefined;
}
}
}
return { fileName: typeName, pos: -1, end: -1 };
}
function mapReferencesIntoArray(references, outputFilePath) {
return function (file) {
var declFileName;
if (file.isDeclarationFile) { // Neither decl files or js should have their refs changed
declFileName = file.fileName;
}
else {
if (isBundledEmit && ts.contains(node.sourceFiles, file))
return; // Omit references to files which are being merged
var paths = ts.getOutputPathsFor(file, host, /*forceDtsPaths*/ true);
declFileName = paths.declarationFilePath || paths.jsFilePath || file.fileName;
}
if (declFileName) {
var specifier = ts.moduleSpecifiers.getModuleSpecifier(options, currentSourceFile, ts.toPath(outputFilePath, host.getCurrentDirectory(), host.getCanonicalFileName), ts.toPath(declFileName, host.getCurrentDirectory(), host.getCanonicalFileName), host);
if (!ts.pathIsRelative(specifier)) {
// If some compiler option/symlink/whatever allows access to the file containing the ambient module declaration
// via a non-relative name, emit a type reference directive to that non-relative name, rather than
// a relative path to the declaration file
recordTypeReferenceDirectivesIfNecessary([specifier]);
return;
}
var fileName = ts.getRelativePathToDirectoryOrUrl(outputFilePath, declFileName, host.getCurrentDirectory(), host.getCanonicalFileName,
/*isAbsolutePathAnUrl*/ false);
if (ts.startsWith(fileName, "./") && ts.hasExtension(fileName)) {
fileName = fileName.substring(2);
}
// omit references to files from node_modules (npm may disambiguate module
// references when installing this package, making the path is unreliable).
if (ts.startsWith(fileName, "node_modules/") || ts.pathContainsNodeModules(fileName)) {
return;
}
references.push({ pos: -1, end: -1, fileName: fileName });
}
};
}
}
function collectReferences(sourceFile, ret) {
if (noResolve || (!ts.isUnparsedSource(sourceFile) && ts.isSourceFileJS(sourceFile)))
return ret;
ts.forEach(sourceFile.referencedFiles, function (f) {
var elem = host.getSourceFileFromReference(sourceFile, f);
if (elem) {
ret.set(ts.getOriginalNodeId(elem), elem);
}
});
return ret;
}
function collectLibs(sourceFile, ret) {
ts.forEach(sourceFile.libReferenceDirectives, function (ref) {
var lib = host.getLibFileFromReference(ref);
if (lib) {
ret.set(ts.toFileNameLowerCase(ref.fileName), true);
}
});
return ret;
}
function filterBindingPatternInitializers(name) {
if (name.kind === 79 /* Identifier */) {
return name;
}
else {
if (name.kind === 200 /* ArrayBindingPattern */) {
return factory.updateArrayBindingPattern(name, ts.visitNodes(name.elements, visitBindingElement));
}
else {
return factory.updateObjectBindingPattern(name, ts.visitNodes(name.elements, visitBindingElement));
}
}
function visitBindingElement(elem) {
if (elem.kind === 225 /* OmittedExpression */) {
return elem;
}
return factory.updateBindingElement(elem, elem.dotDotDotToken, elem.propertyName, filterBindingPatternInitializers(elem.name), shouldPrintWithInitializer(elem) ? elem.initializer : undefined);
}
}
function ensureParameter(p, modifierMask, type) {
var oldDiag;
if (!suppressNewDiagnosticContexts) {
oldDiag = getSymbolAccessibilityDiagnostic;
getSymbolAccessibilityDiagnostic = ts.createGetSymbolAccessibilityDiagnosticForNode(p);
}
var newParam = factory.updateParameterDeclaration(p,
/*decorators*/ undefined, maskModifiers(p, modifierMask), p.dotDotDotToken, filterBindingPatternInitializers(p.name), resolver.isOptionalParameter(p) ? (p.questionToken || factory.createToken(57 /* QuestionToken */)) : undefined, ensureType(p, type || p.type, /*ignorePrivate*/ true), // Ignore private param props, since this type is going straight back into a param
ensureNoInitializer(p));
if (!suppressNewDiagnosticContexts) {
getSymbolAccessibilityDiagnostic = oldDiag;
}
return newParam;
}
function shouldPrintWithInitializer(node) {
return canHaveLiteralInitializer(node) && resolver.isLiteralConstDeclaration(ts.getParseTreeNode(node)); // TODO: Make safe
}
function ensureNoInitializer(node) {
if (shouldPrintWithInitializer(node)) {
return resolver.createLiteralConstValue(ts.getParseTreeNode(node), symbolTracker); // TODO: Make safe
}
return undefined;
}
function ensureType(node, type, ignorePrivate) {
if (!ignorePrivate && ts.hasEffectiveModifier(node, 8 /* Private */)) {
// Private nodes emit no types (except private parameter properties, whose parameter types are actually visible)
return;
}
if (shouldPrintWithInitializer(node)) {
// Literal const declarations will have an initializer ensured rather than a type
return;
}
var shouldUseResolverType = node.kind === 162 /* Parameter */ &&
(resolver.isRequiredInitializedParameter(node) ||
resolver.isOptionalUninitializedParameterProperty(node));
if (type && !shouldUseResolverType) {
return ts.visitNode(type, visitDeclarationSubtree);
}
if (!ts.getParseTreeNode(node)) {
return type ? ts.visitNode(type, visitDeclarationSubtree) : factory.createKeywordTypeNode(129 /* AnyKeyword */);
}
if (node.kind === 171 /* SetAccessor */) {
// Set accessors with no associated type node (from it's param or get accessor return) are `any` since they are never contextually typed right now
// (The inferred type here will be void, but the old declaration emitter printed `any`, so this replicates that)
return factory.createKeywordTypeNode(129 /* AnyKeyword */);
}
errorNameNode = node.name;
var oldDiag;
if (!suppressNewDiagnosticContexts) {
oldDiag = getSymbolAccessibilityDiagnostic;
getSymbolAccessibilityDiagnostic = ts.createGetSymbolAccessibilityDiagnosticForNode(node);
}
if (node.kind === 252 /* VariableDeclaration */ || node.kind === 201 /* BindingElement */) {
return cleanup(resolver.createTypeOfDeclaration(node, enclosingDeclaration, declarationEmitNodeBuilderFlags, symbolTracker));
}
if (node.kind === 162 /* Parameter */
|| node.kind === 165 /* PropertyDeclaration */
|| node.kind === 164 /* PropertySignature */) {
if (!node.initializer)
return cleanup(resolver.createTypeOfDeclaration(node, enclosingDeclaration, declarationEmitNodeBuilderFlags, symbolTracker, shouldUseResolverType));
return cleanup(resolver.createTypeOfDeclaration(node, enclosingDeclaration, declarationEmitNodeBuilderFlags, symbolTracker, shouldUseResolverType) || resolver.createTypeOfExpression(node.initializer, enclosingDeclaration, declarationEmitNodeBuilderFlags, symbolTracker));
}
return cleanup(resolver.createReturnTypeOfSignatureDeclaration(node, enclosingDeclaration, declarationEmitNodeBuilderFlags, symbolTracker));
function cleanup(returnValue) {
errorNameNode = undefined;
if (!suppressNewDiagnosticContexts) {
getSymbolAccessibilityDiagnostic = oldDiag;
}
return returnValue || factory.createKeywordTypeNode(129 /* AnyKeyword */);
}
}
function isDeclarationAndNotVisible(node) {
node = ts.getParseTreeNode(node);
switch (node.kind) {
case 254 /* FunctionDeclaration */:
case 259 /* ModuleDeclaration */:
case 256 /* InterfaceDeclaration */:
case 255 /* ClassDeclaration */:
case 257 /* TypeAliasDeclaration */:
case 258 /* EnumDeclaration */:
return !resolver.isDeclarationVisible(node);
// The following should be doing their own visibility checks based on filtering their members
case 252 /* VariableDeclaration */:
return !getBindingNameVisible(node);
case 263 /* ImportEqualsDeclaration */:
case 264 /* ImportDeclaration */:
case 270 /* ExportDeclaration */:
case 269 /* ExportAssignment */:
return false;
case 168 /* ClassStaticBlockDeclaration */:
return true;
}
return false;
}
// If the ExpandoFunctionDeclaration have multiple overloads, then we only need to emit properties for the last one.
function shouldEmitFunctionProperties(input) {
var _a;
if (input.body) {
return true;
}
var overloadSignatures = (_a = input.symbol.declarations) === null || _a === void 0 ? void 0 : _a.filter(function (decl) { return ts.isFunctionDeclaration(decl) && !decl.body; });
return !overloadSignatures || overloadSignatures.indexOf(input) === overloadSignatures.length - 1;
}
function getBindingNameVisible(elem) {
if (ts.isOmittedExpression(elem)) {
return false;
}
if (ts.isBindingPattern(elem.name)) {
// If any child binding pattern element has been marked visible (usually by collect linked aliases), then this is visible
return ts.some(elem.name.elements, getBindingNameVisible);
}
else {
return resolver.isDeclarationVisible(elem);
}
}
function updateParamsList(node, params, modifierMask) {
if (ts.hasEffectiveModifier(node, 8 /* Private */)) {
return undefined; // TODO: GH#18217
}
var newParams = ts.map(params, function (p) { return ensureParameter(p, modifierMask); });
if (!newParams) {
return undefined; // TODO: GH#18217
}
return factory.createNodeArray(newParams, params.hasTrailingComma);
}
function updateAccessorParamsList(input, isPrivate) {
var newParams;
if (!isPrivate) {
var thisParameter = ts.getThisParameter(input);
if (thisParameter) {
newParams = [ensureParameter(thisParameter)];
}
}
if (ts.isSetAccessorDeclaration(input)) {
var newValueParameter = void 0;
if (!isPrivate) {
var valueParameter = ts.getSetAccessorValueParameter(input);
if (valueParameter) {
var accessorType = getTypeAnnotationFromAllAccessorDeclarations(input, resolver.getAllAccessorDeclarations(input));
newValueParameter = ensureParameter(valueParameter, /*modifierMask*/ undefined, accessorType);
}
}
if (!newValueParameter) {
newValueParameter = factory.createParameterDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*dotDotDotToken*/ undefined, "value");
}
newParams = ts.append(newParams, newValueParameter);
}
return factory.createNodeArray(newParams || ts.emptyArray);
}
function ensureTypeParams(node, params) {
return ts.hasEffectiveModifier(node, 8 /* Private */) ? undefined : ts.visitNodes(params, visitDeclarationSubtree);
}
function isEnclosingDeclaration(node) {
return ts.isSourceFile(node)
|| ts.isTypeAliasDeclaration(node)
|| ts.isModuleDeclaration(node)
|| ts.isClassDeclaration(node)
|| ts.isInterfaceDeclaration(node)
|| ts.isFunctionLike(node)
|| ts.isIndexSignatureDeclaration(node)
|| ts.isMappedTypeNode(node);
}
function checkEntityNameVisibility(entityName, enclosingDeclaration) {
var visibilityResult = resolver.isEntityNameVisible(entityName, enclosingDeclaration);
handleSymbolAccessibilityError(visibilityResult);
recordTypeReferenceDirectivesIfNecessary(resolver.getTypeReferenceDirectivesForEntityName(entityName));
}
function preserveJsDoc(updated, original) {
if (ts.hasJSDocNodes(updated) && ts.hasJSDocNodes(original)) {
updated.jsDoc = original.jsDoc;
}
return ts.setCommentRange(updated, ts.getCommentRange(original));
}
function rewriteModuleSpecifier(parent, input) {
if (!input)
return undefined; // TODO: GH#18217
resultHasExternalModuleIndicator = resultHasExternalModuleIndicator || (parent.kind !== 259 /* ModuleDeclaration */ && parent.kind !== 198 /* ImportType */);
if (ts.isStringLiteralLike(input)) {
if (isBundledEmit) {
var newName = ts.getExternalModuleNameFromDeclaration(context.getEmitHost(), resolver, parent);
if (newName) {
return factory.createStringLiteral(newName);
}
}
else {
var symbol = resolver.getSymbolOfExternalModuleSpecifier(input);
if (symbol) {
(exportedModulesFromDeclarationEmit || (exportedModulesFromDeclarationEmit = [])).push(symbol);
}
}
}
return input;
}
function transformImportEqualsDeclaration(decl) {
if (!resolver.isDeclarationVisible(decl))
return;
if (decl.moduleReference.kind === 275 /* ExternalModuleReference */) {
// Rewrite external module names if necessary
var specifier = ts.getExternalModuleImportEqualsDeclarationExpression(decl);
return factory.updateImportEqualsDeclaration(decl,
/*decorators*/ undefined, decl.modifiers, decl.isTypeOnly, decl.name, factory.updateExternalModuleReference(decl.moduleReference, rewriteModuleSpecifier(decl, specifier)));
}
else {
var oldDiag = getSymbolAccessibilityDiagnostic;
getSymbolAccessibilityDiagnostic = ts.createGetSymbolAccessibilityDiagnosticForNode(decl);
checkEntityNameVisibility(decl.moduleReference, enclosingDeclaration);
getSymbolAccessibilityDiagnostic = oldDiag;
return decl;
}
}
function transformImportDeclaration(decl) {
if (!decl.importClause) {
// import "mod" - possibly needed for side effects? (global interface patches, module augmentations, etc)
return factory.updateImportDeclaration(decl,
/*decorators*/ undefined, decl.modifiers, decl.importClause, rewriteModuleSpecifier(decl, decl.moduleSpecifier));
}
// The `importClause` visibility corresponds to the default's visibility.
var visibleDefaultBinding = decl.importClause && decl.importClause.name && resolver.isDeclarationVisible(decl.importClause) ? decl.importClause.name : undefined;
if (!decl.importClause.namedBindings) {
// No named bindings (either namespace or list), meaning the import is just default or should be elided
return visibleDefaultBinding && factory.updateImportDeclaration(decl, /*decorators*/ undefined, decl.modifiers, factory.updateImportClause(decl.importClause, decl.importClause.isTypeOnly, visibleDefaultBinding,
/*namedBindings*/ undefined), rewriteModuleSpecifier(decl, decl.moduleSpecifier));
}
if (decl.importClause.namedBindings.kind === 266 /* NamespaceImport */) {
// Namespace import (optionally with visible default)
var namedBindings = resolver.isDeclarationVisible(decl.importClause.namedBindings) ? decl.importClause.namedBindings : /*namedBindings*/ undefined;
return visibleDefaultBinding || namedBindings ? factory.updateImportDeclaration(decl, /*decorators*/ undefined, decl.modifiers, factory.updateImportClause(decl.importClause, decl.importClause.isTypeOnly, visibleDefaultBinding, namedBindings), rewriteModuleSpecifier(decl, decl.moduleSpecifier)) : undefined;
}
// Named imports (optionally with visible default)
var bindingList = ts.mapDefined(decl.importClause.namedBindings.elements, function (b) { return resolver.isDeclarationVisible(b) ? b : undefined; });
if ((bindingList && bindingList.length) || visibleDefaultBinding) {
return factory.updateImportDeclaration(decl,
/*decorators*/ undefined, decl.modifiers, factory.updateImportClause(decl.importClause, decl.importClause.isTypeOnly, visibleDefaultBinding, bindingList && bindingList.length ? factory.updateNamedImports(decl.importClause.namedBindings, bindingList) : undefined), rewriteModuleSpecifier(decl, decl.moduleSpecifier));
}
// Augmentation of export depends on import
if (resolver.isImportRequiredByAugmentation(decl)) {
return factory.updateImportDeclaration(decl,
/*decorators*/ undefined, decl.modifiers,
/*importClause*/ undefined, rewriteModuleSpecifier(decl, decl.moduleSpecifier));
}
// Nothing visible
}
function transformAndReplaceLatePaintedStatements(statements) {
// This is a `while` loop because `handleSymbolAccessibilityError` can see additional import aliases marked as visible during
// error handling which must now be included in the output and themselves checked for errors.
// For example:
// ```
// module A {
// export module Q {}
// import B = Q;
// import C = B;
// export import D = C;
// }
// ```
// In such a scenario, only Q and D are initially visible, but we don't consider imports as private names - instead we say they if they are referenced they must
// be recorded. So while checking D's visibility we mark C as visible, then we must check C which in turn marks B, completing the chain of
// dependent imports and allowing a valid declaration file output. Today, this dependent alias marking only happens for internal import aliases.
while (ts.length(lateMarkedStatements)) {
var i = lateMarkedStatements.shift();
if (!ts.isLateVisibilityPaintedStatement(i)) {
return ts.Debug.fail("Late replaced statement was found which is not handled by the declaration transformer!: " + (ts.SyntaxKind ? ts.SyntaxKind[i.kind] : i.kind));
}
var priorNeedsDeclare = needsDeclare;
needsDeclare = i.parent && ts.isSourceFile(i.parent) && !(ts.isExternalModule(i.parent) && isBundledEmit);
var result = transformTopLevelDeclaration(i);
needsDeclare = priorNeedsDeclare;
lateStatementReplacementMap.set(ts.getOriginalNodeId(i), result);
}
// And lastly, we need to get the final form of all those indetermine import declarations from before and add them to the output list
// (and remove them from the set to examine for outter declarations)
return ts.visitNodes(statements, visitLateVisibilityMarkedStatements);
function visitLateVisibilityMarkedStatements(statement) {
if (ts.isLateVisibilityPaintedStatement(statement)) {
var key = ts.getOriginalNodeId(statement);
if (lateStatementReplacementMap.has(key)) {
var result = lateStatementReplacementMap.get(key);
lateStatementReplacementMap.delete(key);
if (result) {
if (ts.isArray(result) ? ts.some(result, ts.needsScopeMarker) : ts.needsScopeMarker(result)) {
// Top-level declarations in .d.ts files are always considered exported even without a modifier unless there's an export assignment or specifier
needsScopeFixMarker = true;
}
if (ts.isSourceFile(statement.parent) && (ts.isArray(result) ? ts.some(result, ts.isExternalModuleIndicator) : ts.isExternalModuleIndicator(result))) {
resultHasExternalModuleIndicator = true;
}
}
return result;
}
}
return statement;
}
}
function visitDeclarationSubtree(input) {
if (shouldStripInternal(input))
return;
if (ts.isDeclaration(input)) {
if (isDeclarationAndNotVisible(input))
return;
if (ts.hasDynamicName(input) && !resolver.isLateBound(ts.getParseTreeNode(input))) {
return;
}
}
// Elide implementation signatures from overload sets
if (ts.isFunctionLike(input) && resolver.isImplementationOfOverload(input))
return;
// Elide semicolon class statements
if (ts.isSemicolonClassElement(input))
return;
var previousEnclosingDeclaration;
if (isEnclosingDeclaration(input)) {
previousEnclosingDeclaration = enclosingDeclaration;
enclosingDeclaration = input;
}
var oldDiag = getSymbolAccessibilityDiagnostic;
// Setup diagnostic-related flags before first potential `cleanup` call, otherwise
// We'd see a TDZ violation at runtime
var canProduceDiagnostic = ts.canProduceDiagnostics(input);
var oldWithinObjectLiteralType = suppressNewDiagnosticContexts;
var shouldEnterSuppressNewDiagnosticsContextContext = ((input.kind === 180 /* TypeLiteral */ || input.kind === 193 /* MappedType */) && input.parent.kind !== 257 /* TypeAliasDeclaration */);
// Emit methods which are private as properties with no type information
if (ts.isMethodDeclaration(input) || ts.isMethodSignature(input)) {
if (ts.hasEffectiveModifier(input, 8 /* Private */)) {
if (input.symbol && input.symbol.declarations && input.symbol.declarations[0] !== input)
return; // Elide all but the first overload
return cleanup(factory.createPropertyDeclaration(/*decorators*/ undefined, ensureModifiers(input), input.name, /*questionToken*/ undefined, /*type*/ undefined, /*initializer*/ undefined));
}
}
if (canProduceDiagnostic && !suppressNewDiagnosticContexts) {
getSymbolAccessibilityDiagnostic = ts.createGetSymbolAccessibilityDiagnosticForNode(input);
}
if (ts.isTypeQueryNode(input)) {
checkEntityNameVisibility(input.exprName, enclosingDeclaration);
}
if (shouldEnterSuppressNewDiagnosticsContextContext) {
// We stop making new diagnostic contexts within object literal types. Unless it's an object type on the RHS of a type alias declaration. Then we do.
suppressNewDiagnosticContexts = true;
}
if (isProcessedComponent(input)) {
switch (input.kind) {
case 226 /* ExpressionWithTypeArguments */: {
if ((ts.isEntityName(input.expression) || ts.isEntityNameExpression(input.expression))) {
checkEntityNameVisibility(input.expression, enclosingDeclaration);
}
var node = ts.visitEachChild(input, visitDeclarationSubtree, context);
return cleanup(factory.updateExpressionWithTypeArguments(node, node.expression, node.typeArguments));
}
case 176 /* TypeReference */: {
checkEntityNameVisibility(input.typeName, enclosingDeclaration);
var node = ts.visitEachChild(input, visitDeclarationSubtree, context);
return cleanup(factory.updateTypeReferenceNode(node, node.typeName, node.typeArguments));
}
case 173 /* ConstructSignature */:
return cleanup(factory.updateConstructSignature(input, ensureTypeParams(input, input.typeParameters), updateParamsList(input, input.parameters), ensureType(input, input.type)));
case 169 /* Constructor */: {
// A constructor declaration may not have a type annotation
var ctor = factory.createConstructorDeclaration(
/*decorators*/ undefined,
/*modifiers*/ ensureModifiers(input), updateParamsList(input, input.parameters, 0 /* None */),
/*body*/ undefined);
return cleanup(ctor);
}
case 167 /* MethodDeclaration */: {
if (ts.isPrivateIdentifier(input.name)) {
return cleanup(/*returnValue*/ undefined);
}
var sig = factory.createMethodDeclaration(
/*decorators*/ undefined, ensureModifiers(input),
/*asteriskToken*/ undefined, input.name, input.questionToken, ensureTypeParams(input, input.typeParameters), updateParamsList(input, input.parameters), ensureType(input, input.type),
/*body*/ undefined);
return cleanup(sig);
}
case 170 /* GetAccessor */: {
if (ts.isPrivateIdentifier(input.name)) {
return cleanup(/*returnValue*/ undefined);
}
var accessorType = getTypeAnnotationFromAllAccessorDeclarations(input, resolver.getAllAccessorDeclarations(input));
return cleanup(factory.updateGetAccessorDeclaration(input,
/*decorators*/ undefined, ensureModifiers(input), input.name, updateAccessorParamsList(input, ts.hasEffectiveModifier(input, 8 /* Private */)), ensureType(input, accessorType),
/*body*/ undefined));
}
case 171 /* SetAccessor */: {
if (ts.isPrivateIdentifier(input.name)) {
return cleanup(/*returnValue*/ undefined);
}
return cleanup(factory.updateSetAccessorDeclaration(input,
/*decorators*/ undefined, ensureModifiers(input), input.name, updateAccessorParamsList(input, ts.hasEffectiveModifier(input, 8 /* Private */)),
/*body*/ undefined));
}
case 165 /* PropertyDeclaration */:
if (ts.isPrivateIdentifier(input.name)) {
return cleanup(/*returnValue*/ undefined);
}
return cleanup(factory.updatePropertyDeclaration(input,
/*decorators*/ undefined, ensureModifiers(input), input.name, input.questionToken, ensureType(input, input.type), ensureNoInitializer(input)));
case 164 /* PropertySignature */:
if (ts.isPrivateIdentifier(input.name)) {
return cleanup(/*returnValue*/ undefined);
}
return cleanup(factory.updatePropertySignature(input, ensureModifiers(input), input.name, input.questionToken, ensureType(input, input.type)));
case 166 /* MethodSignature */: {
if (ts.isPrivateIdentifier(input.name)) {
return cleanup(/*returnValue*/ undefined);
}
return cleanup(factory.updateMethodSignature(input, ensureModifiers(input), input.name, input.questionToken, ensureTypeParams(input, input.typeParameters), updateParamsList(input, input.parameters), ensureType(input, input.type)));
}
case 172 /* CallSignature */: {
return cleanup(factory.updateCallSignature(input, ensureTypeParams(input, input.typeParameters), updateParamsList(input, input.parameters), ensureType(input, input.type)));
}
case 174 /* IndexSignature */: {
return cleanup(factory.updateIndexSignature(input,
/*decorators*/ undefined, ensureModifiers(input), updateParamsList(input, input.parameters), ts.visitNode(input.type, visitDeclarationSubtree) || factory.createKeywordTypeNode(129 /* AnyKeyword */)));
}
case 252 /* VariableDeclaration */: {
if (ts.isBindingPattern(input.name)) {
return recreateBindingPattern(input.name);
}
shouldEnterSuppressNewDiagnosticsContextContext = true;
suppressNewDiagnosticContexts = true; // Variable declaration types also suppress new diagnostic contexts, provided the contexts wouldn't be made for binding pattern types
return cleanup(factory.updateVariableDeclaration(input, input.name, /*exclamationToken*/ undefined, ensureType(input, input.type), ensureNoInitializer(input)));
}
case 161 /* TypeParameter */: {
if (isPrivateMethodTypeParameter(input) && (input.default || input.constraint)) {
return cleanup(factory.updateTypeParameterDeclaration(input, input.name, /*constraint*/ undefined, /*defaultType*/ undefined));
}
return cleanup(ts.visitEachChild(input, visitDeclarationSubtree, context));
}
case 187 /* ConditionalType */: {
// We have to process conditional types in a special way because for visibility purposes we need to push a new enclosingDeclaration
// just for the `infer` types in the true branch. It's an implicit declaration scope that only applies to _part_ of the type.
var checkType = ts.visitNode(input.checkType, visitDeclarationSubtree);
var extendsType = ts.visitNode(input.extendsType, visitDeclarationSubtree);
var oldEnclosingDecl = enclosingDeclaration;
enclosingDeclaration = input.trueType;
var trueType = ts.visitNode(input.trueType, visitDeclarationSubtree);
enclosingDeclaration = oldEnclosingDecl;
var falseType = ts.visitNode(input.falseType, visitDeclarationSubtree);
return cleanup(factory.updateConditionalTypeNode(input, checkType, extendsType, trueType, falseType));
}
case 177 /* FunctionType */: {
return cleanup(factory.updateFunctionTypeNode(input, ts.visitNodes(input.typeParameters, visitDeclarationSubtree), updateParamsList(input, input.parameters), ts.visitNode(input.type, visitDeclarationSubtree)));
}
case 178 /* ConstructorType */: {
return cleanup(factory.updateConstructorTypeNode(input, ensureModifiers(input), ts.visitNodes(input.typeParameters, visitDeclarationSubtree), updateParamsList(input, input.parameters), ts.visitNode(input.type, visitDeclarationSubtree)));
}
case 198 /* ImportType */: {
if (!ts.isLiteralImportTypeNode(input))
return cleanup(input);
return cleanup(factory.updateImportTypeNode(input, factory.updateLiteralTypeNode(input.argument, rewriteModuleSpecifier(input, input.argument.literal)), input.qualifier, ts.visitNodes(input.typeArguments, visitDeclarationSubtree, ts.isTypeNode), input.isTypeOf));
}
default: ts.Debug.assertNever(input, "Attempted to process unhandled node kind: " + ts.SyntaxKind[input.kind]);
}
}
if (ts.isTupleTypeNode(input) && (ts.getLineAndCharacterOfPosition(currentSourceFile, input.pos).line === ts.getLineAndCharacterOfPosition(currentSourceFile, input.end).line)) {
ts.setEmitFlags(input, 1 /* SingleLine */);
}
return cleanup(ts.visitEachChild(input, visitDeclarationSubtree, context));
function cleanup(returnValue) {
if (returnValue && canProduceDiagnostic && ts.hasDynamicName(input)) {
checkName(input);
}
if (isEnclosingDeclaration(input)) {
enclosingDeclaration = previousEnclosingDeclaration;
}
if (canProduceDiagnostic && !suppressNewDiagnosticContexts) {
getSymbolAccessibilityDiagnostic = oldDiag;
}
if (shouldEnterSuppressNewDiagnosticsContextContext) {
suppressNewDiagnosticContexts = oldWithinObjectLiteralType;
}
if (returnValue === input) {
return returnValue;
}
return returnValue && ts.setOriginalNode(preserveJsDoc(returnValue, input), input);
}
}
function isPrivateMethodTypeParameter(node) {
return node.parent.kind === 167 /* MethodDeclaration */ && ts.hasEffectiveModifier(node.parent, 8 /* Private */);
}
function visitDeclarationStatements(input) {
if (!isPreservedDeclarationStatement(input)) {
// return undefined for unmatched kinds to omit them from the tree
return;
}
if (shouldStripInternal(input))
return;
switch (input.kind) {
case 270 /* ExportDeclaration */: {
if (ts.isSourceFile(input.parent)) {
resultHasExternalModuleIndicator = true;
}
resultHasScopeMarker = true;
// Always visible if the parent node isn't dropped for being not visible
// Rewrite external module names if necessary
return factory.updateExportDeclaration(input,
/*decorators*/ undefined, input.modifiers, input.isTypeOnly, input.exportClause, rewriteModuleSpecifier(input, input.moduleSpecifier));
}
case 269 /* ExportAssignment */: {
// Always visible if the parent node isn't dropped for being not visible
if (ts.isSourceFile(input.parent)) {
resultHasExternalModuleIndicator = true;
}
resultHasScopeMarker = true;
if (input.expression.kind === 79 /* Identifier */) {
return input;
}
else {
var newId = factory.createUniqueName("_default", 16 /* Optimistic */);
getSymbolAccessibilityDiagnostic = function () { return ({
diagnosticMessage: ts.Diagnostics.Default_export_of_the_module_has_or_is_using_private_name_0,
errorNode: input
}); };
errorFallbackNode = input;
var varDecl = factory.createVariableDeclaration(newId, /*exclamationToken*/ undefined, resolver.createTypeOfExpression(input.expression, input, declarationEmitNodeBuilderFlags, symbolTracker), /*initializer*/ undefined);
errorFallbackNode = undefined;
var statement = factory.createVariableStatement(needsDeclare ? [factory.createModifier(134 /* DeclareKeyword */)] : [], factory.createVariableDeclarationList([varDecl], 2 /* Const */));
return [statement, factory.updateExportAssignment(input, input.decorators, input.modifiers, newId)];
}
}
}
var result = transformTopLevelDeclaration(input);
// Don't actually transform yet; just leave as original node - will be elided/swapped by late pass
lateStatementReplacementMap.set(ts.getOriginalNodeId(input), result);
return input;
}
function stripExportModifiers(statement) {
if (ts.isImportEqualsDeclaration(statement) || ts.hasEffectiveModifier(statement, 512 /* Default */) || !ts.canHaveModifiers(statement)) {
// `export import` statements should remain as-is, as imports are _not_ implicitly exported in an ambient namespace
// Likewise, `export default` classes and the like and just be `default`, so we preserve their `export` modifiers, too
return statement;
}
var modifiers = factory.createModifiersFromModifierFlags(ts.getEffectiveModifierFlags(statement) & (27647 /* All */ ^ 1 /* Export */));
return factory.updateModifiers(statement, modifiers);
}
function transformTopLevelDeclaration(input) {
if (shouldStripInternal(input))
return;
switch (input.kind) {
case 263 /* ImportEqualsDeclaration */: {
return transformImportEqualsDeclaration(input);
}
case 264 /* ImportDeclaration */: {
return transformImportDeclaration(input);
}
}
if (ts.isDeclaration(input) && isDeclarationAndNotVisible(input))
return;
// Elide implementation signatures from overload sets
if (ts.isFunctionLike(input) && resolver.isImplementationOfOverload(input))
return;
var previousEnclosingDeclaration;
if (isEnclosingDeclaration(input)) {
previousEnclosingDeclaration = enclosingDeclaration;
enclosingDeclaration = input;
}
var canProdiceDiagnostic = ts.canProduceDiagnostics(input);
var oldDiag = getSymbolAccessibilityDiagnostic;
if (canProdiceDiagnostic) {
getSymbolAccessibilityDiagnostic = ts.createGetSymbolAccessibilityDiagnosticForNode(input);
}
var previousNeedsDeclare = needsDeclare;
switch (input.kind) {
case 257 /* TypeAliasDeclaration */: // Type aliases get `declare`d if need be (for legacy support), but that's all
return cleanup(factory.updateTypeAliasDeclaration(input,
/*decorators*/ undefined, ensureModifiers(input), input.name, ts.visitNodes(input.typeParameters, visitDeclarationSubtree, ts.isTypeParameterDeclaration), ts.visitNode(input.type, visitDeclarationSubtree, ts.isTypeNode)));
case 256 /* InterfaceDeclaration */: {
return cleanup(factory.updateInterfaceDeclaration(input,
/*decorators*/ undefined, ensureModifiers(input), input.name, ensureTypeParams(input, input.typeParameters), transformHeritageClauses(input.heritageClauses), ts.visitNodes(input.members, visitDeclarationSubtree)));
}
case 254 /* FunctionDeclaration */: {
// Generators lose their generator-ness, excepting their return type
var clean = cleanup(factory.updateFunctionDeclaration(input,
/*decorators*/ undefined, ensureModifiers(input),
/*asteriskToken*/ undefined, input.name, ensureTypeParams(input, input.typeParameters), updateParamsList(input, input.parameters), ensureType(input, input.type),
/*body*/ undefined));
if (clean && resolver.isExpandoFunctionDeclaration(input) && shouldEmitFunctionProperties(input)) {
var props = resolver.getPropertiesOfContainerFunction(input);
// Use parseNodeFactory so it is usable as an enclosing declaration
var fakespace_1 = ts.parseNodeFactory.createModuleDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, clean.name || factory.createIdentifier("_default"), factory.createModuleBlock([]), 16 /* Namespace */);
ts.setParent(fakespace_1, enclosingDeclaration);
fakespace_1.locals = ts.createSymbolTable(props);
fakespace_1.symbol = props[0].parent;
var exportMappings_1 = [];
var declarations = ts.mapDefined(props, function (p) {
if (!p.valueDeclaration || !ts.isPropertyAccessExpression(p.valueDeclaration)) {
return undefined; // TODO GH#33569: Handle element access expressions that created late bound names (rather than silently omitting them)
}
getSymbolAccessibilityDiagnostic = ts.createGetSymbolAccessibilityDiagnosticForNode(p.valueDeclaration);
var type = resolver.createTypeOfDeclaration(p.valueDeclaration, fakespace_1, declarationEmitNodeBuilderFlags, symbolTracker);
getSymbolAccessibilityDiagnostic = oldDiag;
var nameStr = ts.unescapeLeadingUnderscores(p.escapedName);
var isNonContextualKeywordName = ts.isStringANonContextualKeyword(nameStr);
var name = isNonContextualKeywordName ? factory.getGeneratedNameForNode(p.valueDeclaration) : factory.createIdentifier(nameStr);
if (isNonContextualKeywordName) {
exportMappings_1.push([name, nameStr]);
}
var varDecl = factory.createVariableDeclaration(name, /*exclamationToken*/ undefined, type, /*initializer*/ undefined);
return factory.createVariableStatement(isNonContextualKeywordName ? undefined : [factory.createToken(93 /* ExportKeyword */)], factory.createVariableDeclarationList([varDecl]));
});
if (!exportMappings_1.length) {
declarations = ts.mapDefined(declarations, function (declaration) { return factory.updateModifiers(declaration, 0 /* None */); });
}
else {
declarations.push(factory.createExportDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isTypeOnly*/ false, factory.createNamedExports(ts.map(exportMappings_1, function (_a) {
var gen = _a[0], exp = _a[1];
return factory.createExportSpecifier(gen, exp);
}))));
}
var namespaceDecl = factory.createModuleDeclaration(/*decorators*/ undefined, ensureModifiers(input), input.name, factory.createModuleBlock(declarations), 16 /* Namespace */);
if (!ts.hasEffectiveModifier(clean, 512 /* Default */)) {
return [clean, namespaceDecl];
}
var modifiers = factory.createModifiersFromModifierFlags((ts.getEffectiveModifierFlags(clean) & ~513 /* ExportDefault */) | 2 /* Ambient */);
var cleanDeclaration = factory.updateFunctionDeclaration(clean,
/*decorators*/ undefined, modifiers,
/*asteriskToken*/ undefined, clean.name, clean.typeParameters, clean.parameters, clean.type,
/*body*/ undefined);
var namespaceDeclaration = factory.updateModuleDeclaration(namespaceDecl,
/*decorators*/ undefined, modifiers, namespaceDecl.name, namespaceDecl.body);
var exportDefaultDeclaration = factory.createExportAssignment(
/*decorators*/ undefined,
/*modifiers*/ undefined,
/*isExportEquals*/ false, namespaceDecl.name);
if (ts.isSourceFile(input.parent)) {
resultHasExternalModuleIndicator = true;
}
resultHasScopeMarker = true;
return [cleanDeclaration, namespaceDeclaration, exportDefaultDeclaration];
}
else {
return clean;
}
}
case 259 /* ModuleDeclaration */: {
needsDeclare = false;
var inner = input.body;
if (inner && inner.kind === 260 /* ModuleBlock */) {
var oldNeedsScopeFix = needsScopeFixMarker;
var oldHasScopeFix = resultHasScopeMarker;
resultHasScopeMarker = false;
needsScopeFixMarker = false;
var statements = ts.visitNodes(inner.statements, visitDeclarationStatements);
var lateStatements = transformAndReplaceLatePaintedStatements(statements);
if (input.flags & 8388608 /* Ambient */) {
needsScopeFixMarker = false; // If it was `declare`'d everything is implicitly exported already, ignore late printed "privates"
}
// With the final list of statements, there are 3 possibilities:
// 1. There's an export assignment or export declaration in the namespace - do nothing
// 2. Everything is exported and there are no export assignments or export declarations - strip all export modifiers
// 3. Some things are exported, some are not, and there's no marker - add an empty marker
if (!ts.isGlobalScopeAugmentation(input) && !hasScopeMarker(lateStatements) && !resultHasScopeMarker) {
if (needsScopeFixMarker) {
lateStatements = factory.createNodeArray(__spreadArray(__spreadArray([], lateStatements, true), [ts.createEmptyExports(factory)], false));
}
else {
lateStatements = ts.visitNodes(lateStatements, stripExportModifiers);
}
}
var body = factory.updateModuleBlock(inner, lateStatements);
needsDeclare = previousNeedsDeclare;
needsScopeFixMarker = oldNeedsScopeFix;
resultHasScopeMarker = oldHasScopeFix;
var mods = ensureModifiers(input);
return cleanup(factory.updateModuleDeclaration(input,
/*decorators*/ undefined, mods, ts.isExternalModuleAugmentation(input) ? rewriteModuleSpecifier(input, input.name) : input.name, body));
}
else {
needsDeclare = previousNeedsDeclare;
var mods = ensureModifiers(input);
needsDeclare = false;
ts.visitNode(inner, visitDeclarationStatements);
// eagerly transform nested namespaces (the nesting doesn't need any elision or painting done)
var id = ts.getOriginalNodeId(inner); // TODO: GH#18217
var body = lateStatementReplacementMap.get(id);
lateStatementReplacementMap.delete(id);
return cleanup(factory.updateModuleDeclaration(input,
/*decorators*/ undefined, mods, input.name, body));
}
}
case 255 /* ClassDeclaration */: {
errorNameNode = input.name;
errorFallbackNode = input;
var modifiers = factory.createNodeArray(ensureModifiers(input));
var typeParameters = ensureTypeParams(input, input.typeParameters);
var ctor = ts.getFirstConstructorWithBody(input);
var parameterProperties = void 0;
if (ctor) {
var oldDiag_1 = getSymbolAccessibilityDiagnostic;
parameterProperties = ts.compact(ts.flatMap(ctor.parameters, function (param) {
if (!ts.hasSyntacticModifier(param, 16476 /* ParameterPropertyModifier */) || shouldStripInternal(param))
return;
getSymbolAccessibilityDiagnostic = ts.createGetSymbolAccessibilityDiagnosticForNode(param);
if (param.name.kind === 79 /* Identifier */) {
return preserveJsDoc(factory.createPropertyDeclaration(
/*decorators*/ undefined, ensureModifiers(param), param.name, param.questionToken, ensureType(param, param.type), ensureNoInitializer(param)), param);
}
else {
// Pattern - this is currently an error, but we emit declarations for it somewhat correctly
return walkBindingPattern(param.name);
}
function walkBindingPattern(pattern) {
var elems;
for (var _i = 0, _a = pattern.elements; _i < _a.length; _i++) {
var elem = _a[_i];
if (ts.isOmittedExpression(elem))
continue;
if (ts.isBindingPattern(elem.name)) {
elems = ts.concatenate(elems, walkBindingPattern(elem.name));
}
elems = elems || [];
elems.push(factory.createPropertyDeclaration(
/*decorators*/ undefined, ensureModifiers(param), elem.name,
/*questionToken*/ undefined, ensureType(elem, /*type*/ undefined),
/*initializer*/ undefined));
}
return elems;
}
}));
getSymbolAccessibilityDiagnostic = oldDiag_1;
}
var hasPrivateIdentifier = ts.some(input.members, function (member) { return !!member.name && ts.isPrivateIdentifier(member.name); });
// When the class has at least one private identifier, create a unique constant identifier to retain the nominal typing behavior
// Prevents other classes with the same public members from being used in place of the current class
var privateIdentifier = hasPrivateIdentifier ? [
factory.createPropertyDeclaration(
/*decorators*/ undefined,
/*modifiers*/ undefined, factory.createPrivateIdentifier("#private"),
/*questionToken*/ undefined,
/*type*/ undefined,
/*initializer*/ undefined)
] : undefined;
var memberNodes = ts.concatenate(ts.concatenate(privateIdentifier, parameterProperties), ts.visitNodes(input.members, visitDeclarationSubtree));
var members = factory.createNodeArray(memberNodes);
var extendsClause_1 = ts.getEffectiveBaseTypeNode(input);
if (extendsClause_1 && !ts.isEntityNameExpression(extendsClause_1.expression) && extendsClause_1.expression.kind !== 104 /* NullKeyword */) {
// We must add a temporary declaration for the extends clause expression
var oldId = input.name ? ts.unescapeLeadingUnderscores(input.name.escapedText) : "default";
var newId_1 = factory.createUniqueName(oldId + "_base", 16 /* Optimistic */);
getSymbolAccessibilityDiagnostic = function () { return ({
diagnosticMessage: ts.Diagnostics.extends_clause_of_exported_class_0_has_or_is_using_private_name_1,
errorNode: extendsClause_1,
typeName: input.name
}); };
var varDecl = factory.createVariableDeclaration(newId_1, /*exclamationToken*/ undefined, resolver.createTypeOfExpression(extendsClause_1.expression, input, declarationEmitNodeBuilderFlags, symbolTracker), /*initializer*/ undefined);
var statement = factory.createVariableStatement(needsDeclare ? [factory.createModifier(134 /* DeclareKeyword */)] : [], factory.createVariableDeclarationList([varDecl], 2 /* Const */));
var heritageClauses = factory.createNodeArray(ts.map(input.heritageClauses, function (clause) {
if (clause.token === 94 /* ExtendsKeyword */) {
var oldDiag_2 = getSymbolAccessibilityDiagnostic;
getSymbolAccessibilityDiagnostic = ts.createGetSymbolAccessibilityDiagnosticForNode(clause.types[0]);
var newClause = factory.updateHeritageClause(clause, ts.map(clause.types, function (t) { return factory.updateExpressionWithTypeArguments(t, newId_1, ts.visitNodes(t.typeArguments, visitDeclarationSubtree)); }));
getSymbolAccessibilityDiagnostic = oldDiag_2;
return newClause;
}
return factory.updateHeritageClause(clause, ts.visitNodes(factory.createNodeArray(ts.filter(clause.types, function (t) { return ts.isEntityNameExpression(t.expression) || t.expression.kind === 104 /* NullKeyword */; })), visitDeclarationSubtree));
}));
return [statement, cleanup(factory.updateClassDeclaration(input,
/*decorators*/ undefined, modifiers, input.name, typeParameters, heritageClauses, members))]; // TODO: GH#18217
}
else {
var heritageClauses = transformHeritageClauses(input.heritageClauses);
return cleanup(factory.updateClassDeclaration(input,
/*decorators*/ undefined, modifiers, input.name, typeParameters, heritageClauses, members));
}
}
case 235 /* VariableStatement */: {
return cleanup(transformVariableStatement(input));
}
case 258 /* EnumDeclaration */: {
return cleanup(factory.updateEnumDeclaration(input, /*decorators*/ undefined, factory.createNodeArray(ensureModifiers(input)), input.name, factory.createNodeArray(ts.mapDefined(input.members, function (m) {
if (shouldStripInternal(m))
return;
// Rewrite enum values to their constants, if available
var constValue = resolver.getConstantValue(m);
return preserveJsDoc(factory.updateEnumMember(m, m.name, constValue !== undefined ? typeof constValue === "string" ? factory.createStringLiteral(constValue) : factory.createNumericLiteral(constValue) : undefined), m);
}))));
}
}
// Anything left unhandled is an error, so this should be unreachable
return ts.Debug.assertNever(input, "Unhandled top-level node in declaration emit: " + ts.SyntaxKind[input.kind]);
function cleanup(node) {
if (isEnclosingDeclaration(input)) {
enclosingDeclaration = previousEnclosingDeclaration;
}
if (canProdiceDiagnostic) {
getSymbolAccessibilityDiagnostic = oldDiag;
}
if (input.kind === 259 /* ModuleDeclaration */) {
needsDeclare = previousNeedsDeclare;
}
if (node === input) {
return node;
}
errorFallbackNode = undefined;
errorNameNode = undefined;
return node && ts.setOriginalNode(preserveJsDoc(node, input), input);
}
}
function transformVariableStatement(input) {
if (!ts.forEach(input.declarationList.declarations, getBindingNameVisible))
return;
var nodes = ts.visitNodes(input.declarationList.declarations, visitDeclarationSubtree);
if (!ts.length(nodes))
return;
return factory.updateVariableStatement(input, factory.createNodeArray(ensureModifiers(input)), factory.updateVariableDeclarationList(input.declarationList, nodes));
}
function recreateBindingPattern(d) {
return ts.flatten(ts.mapDefined(d.elements, function (e) { return recreateBindingElement(e); }));
}
function recreateBindingElement(e) {
if (e.kind === 225 /* OmittedExpression */) {
return;
}
if (e.name) {
if (!getBindingNameVisible(e))
return;
if (ts.isBindingPattern(e.name)) {
return recreateBindingPattern(e.name);
}
else {
return factory.createVariableDeclaration(e.name, /*exclamationToken*/ undefined, ensureType(e, /*type*/ undefined), /*initializer*/ undefined);
}
}
}
function checkName(node) {
var oldDiag;
if (!suppressNewDiagnosticContexts) {
oldDiag = getSymbolAccessibilityDiagnostic;
getSymbolAccessibilityDiagnostic = ts.createGetSymbolAccessibilityDiagnosticForNodeName(node);
}
errorNameNode = node.name;
ts.Debug.assert(resolver.isLateBound(ts.getParseTreeNode(node))); // Should only be called with dynamic names
var decl = node;
var entityName = decl.name.expression;
checkEntityNameVisibility(entityName, enclosingDeclaration);
if (!suppressNewDiagnosticContexts) {
getSymbolAccessibilityDiagnostic = oldDiag;
}
errorNameNode = undefined;
}
function shouldStripInternal(node) {
return !!stripInternal && !!node && isInternalDeclaration(node, currentSourceFile);
}
function isScopeMarker(node) {
return ts.isExportAssignment(node) || ts.isExportDeclaration(node);
}
function hasScopeMarker(statements) {
return ts.some(statements, isScopeMarker);
}
function ensureModifiers(node) {
var currentFlags = ts.getEffectiveModifierFlags(node);
var newFlags = ensureModifierFlags(node);
if (currentFlags === newFlags) {
return node.modifiers;
}
return factory.createModifiersFromModifierFlags(newFlags);
}
function ensureModifierFlags(node) {
var mask = 27647 /* All */ ^ (4 /* Public */ | 256 /* Async */ | 16384 /* Override */); // No async and override modifiers in declaration files
var additions = (needsDeclare && !isAlwaysType(node)) ? 2 /* Ambient */ : 0 /* None */;
var parentIsFile = node.parent.kind === 300 /* SourceFile */;
if (!parentIsFile || (isBundledEmit && parentIsFile && ts.isExternalModule(node.parent))) {
mask ^= 2 /* Ambient */;
additions = 0 /* None */;
}
return maskModifierFlags(node, mask, additions);
}
function getTypeAnnotationFromAllAccessorDeclarations(node, accessors) {
var accessorType = getTypeAnnotationFromAccessor(node);
if (!accessorType && node !== accessors.firstAccessor) {
accessorType = getTypeAnnotationFromAccessor(accessors.firstAccessor);
// If we end up pulling the type from the second accessor, we also need to change the diagnostic context to get the expected error message
getSymbolAccessibilityDiagnostic = ts.createGetSymbolAccessibilityDiagnosticForNode(accessors.firstAccessor);
}
if (!accessorType && accessors.secondAccessor && node !== accessors.secondAccessor) {
accessorType = getTypeAnnotationFromAccessor(accessors.secondAccessor);
// If we end up pulling the type from the second accessor, we also need to change the diagnostic context to get the expected error message
getSymbolAccessibilityDiagnostic = ts.createGetSymbolAccessibilityDiagnosticForNode(accessors.secondAccessor);
}
return accessorType;
}
function transformHeritageClauses(nodes) {
return factory.createNodeArray(ts.filter(ts.map(nodes, function (clause) { return factory.updateHeritageClause(clause, ts.visitNodes(factory.createNodeArray(ts.filter(clause.types, function (t) {
return ts.isEntityNameExpression(t.expression) || (clause.token === 94 /* ExtendsKeyword */ && t.expression.kind === 104 /* NullKeyword */);
})), visitDeclarationSubtree)); }), function (clause) { return clause.types && !!clause.types.length; }));
}
}
ts.transformDeclarations = transformDeclarations;
function isAlwaysType(node) {
if (node.kind === 256 /* InterfaceDeclaration */) {
return true;
}
return false;
}
// Elide "public" modifier, as it is the default
function maskModifiers(node, modifierMask, modifierAdditions) {
return ts.factory.createModifiersFromModifierFlags(maskModifierFlags(node, modifierMask, modifierAdditions));
}
function maskModifierFlags(node, modifierMask, modifierAdditions) {
if (modifierMask === void 0) { modifierMask = 27647 /* All */ ^ 4 /* Public */; }
if (modifierAdditions === void 0) { modifierAdditions = 0 /* None */; }
var flags = (ts.getEffectiveModifierFlags(node) & modifierMask) | modifierAdditions;
if (flags & 512 /* Default */ && !(flags & 1 /* Export */)) {
// A non-exported default is a nonsequitor - we usually try to remove all export modifiers
// from statements in ambient declarations; but a default export must retain its export modifier to be syntactically valid
flags ^= 1 /* Export */;
}
if (flags & 512 /* Default */ && flags & 2 /* Ambient */) {
flags ^= 2 /* Ambient */; // `declare` is never required alongside `default` (and would be an error if printed)
}
return flags;
}
function getTypeAnnotationFromAccessor(accessor) {
if (accessor) {
return accessor.kind === 170 /* GetAccessor */
? accessor.type // Getter - return type
: accessor.parameters.length > 0
? accessor.parameters[0].type // Setter parameter type
: undefined;
}
}
function canHaveLiteralInitializer(node) {
switch (node.kind) {
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
return !ts.hasEffectiveModifier(node, 8 /* Private */);
case 162 /* Parameter */:
case 252 /* VariableDeclaration */:
return true;
}
return false;
}
function isPreservedDeclarationStatement(node) {
switch (node.kind) {
case 254 /* FunctionDeclaration */:
case 259 /* ModuleDeclaration */:
case 263 /* ImportEqualsDeclaration */:
case 256 /* InterfaceDeclaration */:
case 255 /* ClassDeclaration */:
case 257 /* TypeAliasDeclaration */:
case 258 /* EnumDeclaration */:
case 235 /* VariableStatement */:
case 264 /* ImportDeclaration */:
case 270 /* ExportDeclaration */:
case 269 /* ExportAssignment */:
return true;
}
return false;
}
function isProcessedComponent(node) {
switch (node.kind) {
case 173 /* ConstructSignature */:
case 169 /* Constructor */:
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 165 /* PropertyDeclaration */:
case 164 /* PropertySignature */:
case 166 /* MethodSignature */:
case 172 /* CallSignature */:
case 174 /* IndexSignature */:
case 252 /* VariableDeclaration */:
case 161 /* TypeParameter */:
case 226 /* ExpressionWithTypeArguments */:
case 176 /* TypeReference */:
case 187 /* ConditionalType */:
case 177 /* FunctionType */:
case 178 /* ConstructorType */:
case 198 /* ImportType */:
return true;
}
return false;
}
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
function getModuleTransformer(moduleKind) {
switch (moduleKind) {
case ts.ModuleKind.ESNext:
case ts.ModuleKind.ES2020:
case ts.ModuleKind.ES2015:
return ts.transformECMAScriptModule;
case ts.ModuleKind.System:
return ts.transformSystemModule;
default:
return ts.transformModule;
}
}
var TransformationState;
(function (TransformationState) {
TransformationState[TransformationState["Uninitialized"] = 0] = "Uninitialized";
TransformationState[TransformationState["Initialized"] = 1] = "Initialized";
TransformationState[TransformationState["Completed"] = 2] = "Completed";
TransformationState[TransformationState["Disposed"] = 3] = "Disposed";
})(TransformationState || (TransformationState = {}));
var SyntaxKindFeatureFlags;
(function (SyntaxKindFeatureFlags) {
SyntaxKindFeatureFlags[SyntaxKindFeatureFlags["Substitution"] = 1] = "Substitution";
SyntaxKindFeatureFlags[SyntaxKindFeatureFlags["EmitNotifications"] = 2] = "EmitNotifications";
})(SyntaxKindFeatureFlags || (SyntaxKindFeatureFlags = {}));
ts.noTransformers = { scriptTransformers: ts.emptyArray, declarationTransformers: ts.emptyArray };
function getTransformers(compilerOptions, customTransformers, emitOnlyDtsFiles) {
return {
scriptTransformers: getScriptTransformers(compilerOptions, customTransformers, emitOnlyDtsFiles),
declarationTransformers: getDeclarationTransformers(customTransformers),
};
}
ts.getTransformers = getTransformers;
function getScriptTransformers(compilerOptions, customTransformers, emitOnlyDtsFiles) {
if (emitOnlyDtsFiles)
return ts.emptyArray;
var languageVersion = ts.getEmitScriptTarget(compilerOptions);
var moduleKind = ts.getEmitModuleKind(compilerOptions);
var transformers = [];
ts.addRange(transformers, customTransformers && ts.map(customTransformers.before, wrapScriptTransformerFactory));
transformers.push(ts.transformTypeScript);
transformers.push(ts.transformClassFields);
if (ts.getJSXTransformEnabled(compilerOptions)) {
transformers.push(ts.transformJsx);
}
if (languageVersion < 99 /* ESNext */) {
transformers.push(ts.transformESNext);
}
if (languageVersion < 8 /* ES2021 */) {
transformers.push(ts.transformES2021);
}
if (languageVersion < 7 /* ES2020 */) {
transformers.push(ts.transformES2020);
}
if (languageVersion < 6 /* ES2019 */) {
transformers.push(ts.transformES2019);
}
if (languageVersion < 5 /* ES2018 */) {
transformers.push(ts.transformES2018);
}
if (languageVersion < 4 /* ES2017 */) {
transformers.push(ts.transformES2017);
}
if (languageVersion < 3 /* ES2016 */) {
transformers.push(ts.transformES2016);
}
if (languageVersion < 2 /* ES2015 */) {
transformers.push(ts.transformES2015);
transformers.push(ts.transformGenerators);
}
transformers.push(getModuleTransformer(moduleKind));
// The ES5 transformer is last so that it can substitute expressions like `exports.default`
// for ES3.
if (languageVersion < 1 /* ES5 */) {
transformers.push(ts.transformES5);
}
ts.addRange(transformers, customTransformers && ts.map(customTransformers.after, wrapScriptTransformerFactory));
return transformers;
}
function getDeclarationTransformers(customTransformers) {
var transformers = [];
transformers.push(ts.transformDeclarations);
ts.addRange(transformers, customTransformers && ts.map(customTransformers.afterDeclarations, wrapDeclarationTransformerFactory));
return transformers;
}
/**
* Wrap a custom script or declaration transformer object in a `Transformer` callback with fallback support for transforming bundles.
*/
function wrapCustomTransformer(transformer) {
return function (node) { return ts.isBundle(node) ? transformer.transformBundle(node) : transformer.transformSourceFile(node); };
}
/**
* Wrap a transformer factory that may return a custom script or declaration transformer object.
*/
function wrapCustomTransformerFactory(transformer, handleDefault) {
return function (context) {
var customTransformer = transformer(context);
return typeof customTransformer === "function"
? handleDefault(context, customTransformer)
: wrapCustomTransformer(customTransformer);
};
}
function wrapScriptTransformerFactory(transformer) {
return wrapCustomTransformerFactory(transformer, ts.chainBundle);
}
function wrapDeclarationTransformerFactory(transformer) {
return wrapCustomTransformerFactory(transformer, function (_, node) { return node; });
}
function noEmitSubstitution(_hint, node) {
return node;
}
ts.noEmitSubstitution = noEmitSubstitution;
function noEmitNotification(hint, node, callback) {
callback(hint, node);
}
ts.noEmitNotification = noEmitNotification;
/**
* Transforms an array of SourceFiles by passing them through each transformer.
*
* @param resolver The emit resolver provided by the checker.
* @param host The emit host object used to interact with the file system.
* @param options Compiler options to surface in the `TransformationContext`.
* @param nodes An array of nodes to transform.
* @param transforms An array of `TransformerFactory` callbacks.
* @param allowDtsFiles A value indicating whether to allow the transformation of .d.ts files.
*/
function transformNodes(resolver, host, factory, options, nodes, transformers, allowDtsFiles) {
var enabledSyntaxKindFeatures = new Array(350 /* Count */);
var lexicalEnvironmentVariableDeclarations;
var lexicalEnvironmentFunctionDeclarations;
var lexicalEnvironmentStatements;
var lexicalEnvironmentFlags = 0 /* None */;
var lexicalEnvironmentVariableDeclarationsStack = [];
var lexicalEnvironmentFunctionDeclarationsStack = [];
var lexicalEnvironmentStatementsStack = [];
var lexicalEnvironmentFlagsStack = [];
var lexicalEnvironmentStackOffset = 0;
var lexicalEnvironmentSuspended = false;
var blockScopedVariableDeclarationsStack = [];
var blockScopeStackOffset = 0;
var blockScopedVariableDeclarations;
var emitHelpers;
var onSubstituteNode = noEmitSubstitution;
var onEmitNode = noEmitNotification;
var state = 0 /* Uninitialized */;
var diagnostics = [];
// The transformation context is provided to each transformer as part of transformer
// initialization.
var context = {
factory: factory,
getCompilerOptions: function () { return options; },
getEmitResolver: function () { return resolver; },
getEmitHost: function () { return host; },
getEmitHelperFactory: ts.memoize(function () { return ts.createEmitHelperFactory(context); }),
startLexicalEnvironment: startLexicalEnvironment,
suspendLexicalEnvironment: suspendLexicalEnvironment,
resumeLexicalEnvironment: resumeLexicalEnvironment,
endLexicalEnvironment: endLexicalEnvironment,
setLexicalEnvironmentFlags: setLexicalEnvironmentFlags,
getLexicalEnvironmentFlags: getLexicalEnvironmentFlags,
hoistVariableDeclaration: hoistVariableDeclaration,
hoistFunctionDeclaration: hoistFunctionDeclaration,
addInitializationStatement: addInitializationStatement,
startBlockScope: startBlockScope,
endBlockScope: endBlockScope,
addBlockScopedVariable: addBlockScopedVariable,
requestEmitHelper: requestEmitHelper,
readEmitHelpers: readEmitHelpers,
enableSubstitution: enableSubstitution,
enableEmitNotification: enableEmitNotification,
isSubstitutionEnabled: isSubstitutionEnabled,
isEmitNotificationEnabled: isEmitNotificationEnabled,
get onSubstituteNode() { return onSubstituteNode; },
set onSubstituteNode(value) {
ts.Debug.assert(state < 1 /* Initialized */, "Cannot modify transformation hooks after initialization has completed.");
ts.Debug.assert(value !== undefined, "Value must not be 'undefined'");
onSubstituteNode = value;
},
get onEmitNode() { return onEmitNode; },
set onEmitNode(value) {
ts.Debug.assert(state < 1 /* Initialized */, "Cannot modify transformation hooks after initialization has completed.");
ts.Debug.assert(value !== undefined, "Value must not be 'undefined'");
onEmitNode = value;
},
addDiagnostic: function (diag) {
diagnostics.push(diag);
}
};
// Ensure the parse tree is clean before applying transformations
for (var _i = 0, nodes_2 = nodes; _i < nodes_2.length; _i++) {
var node = nodes_2[_i];
ts.disposeEmitNodes(ts.getSourceFileOfNode(ts.getParseTreeNode(node)));
}
ts.performance.mark("beforeTransform");
// Chain together and initialize each transformer.
var transformersWithContext = transformers.map(function (t) { return t(context); });
var transformation = function (node) {
for (var _i = 0, transformersWithContext_1 = transformersWithContext; _i < transformersWithContext_1.length; _i++) {
var transform = transformersWithContext_1[_i];
node = transform(node);
}
return node;
};
// prevent modification of transformation hooks.
state = 1 /* Initialized */;
// Transform each node.
var transformed = [];
for (var _a = 0, nodes_3 = nodes; _a < nodes_3.length; _a++) {
var node = nodes_3[_a];
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("emit" /* Emit */, "transformNodes", node.kind === 300 /* SourceFile */ ? { path: node.path } : { kind: node.kind, pos: node.pos, end: node.end });
transformed.push((allowDtsFiles ? transformation : transformRoot)(node));
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
}
// prevent modification of the lexical environment.
state = 2 /* Completed */;
ts.performance.mark("afterTransform");
ts.performance.measure("transformTime", "beforeTransform", "afterTransform");
return {
transformed: transformed,
substituteNode: substituteNode,
emitNodeWithNotification: emitNodeWithNotification,
isEmitNotificationEnabled: isEmitNotificationEnabled,
dispose: dispose,
diagnostics: diagnostics
};
function transformRoot(node) {
return node && (!ts.isSourceFile(node) || !node.isDeclarationFile) ? transformation(node) : node;
}
/**
* Enables expression substitutions in the pretty printer for the provided SyntaxKind.
*/
function enableSubstitution(kind) {
ts.Debug.assert(state < 2 /* Completed */, "Cannot modify the transformation context after transformation has completed.");
enabledSyntaxKindFeatures[kind] |= 1 /* Substitution */;
}
/**
* Determines whether expression substitutions are enabled for the provided node.
*/
function isSubstitutionEnabled(node) {
return (enabledSyntaxKindFeatures[node.kind] & 1 /* Substitution */) !== 0
&& (ts.getEmitFlags(node) & 4 /* NoSubstitution */) === 0;
}
/**
* Emits a node with possible substitution.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to emit.
* @param emitCallback The callback used to emit the node or its substitute.
*/
function substituteNode(hint, node) {
ts.Debug.assert(state < 3 /* Disposed */, "Cannot substitute a node after the result is disposed.");
return node && isSubstitutionEnabled(node) && onSubstituteNode(hint, node) || node;
}
/**
* Enables before/after emit notifications in the pretty printer for the provided SyntaxKind.
*/
function enableEmitNotification(kind) {
ts.Debug.assert(state < 2 /* Completed */, "Cannot modify the transformation context after transformation has completed.");
enabledSyntaxKindFeatures[kind] |= 2 /* EmitNotifications */;
}
/**
* Determines whether before/after emit notifications should be raised in the pretty
* printer when it emits a node.
*/
function isEmitNotificationEnabled(node) {
return (enabledSyntaxKindFeatures[node.kind] & 2 /* EmitNotifications */) !== 0
|| (ts.getEmitFlags(node) & 2 /* AdviseOnEmitNode */) !== 0;
}
/**
* Emits a node with possible emit notification.
*
* @param hint A hint as to the intended usage of the node.
* @param node The node to emit.
* @param emitCallback The callback used to emit the node.
*/
function emitNodeWithNotification(hint, node, emitCallback) {
ts.Debug.assert(state < 3 /* Disposed */, "Cannot invoke TransformationResult callbacks after the result is disposed.");
if (node) {
// TODO: Remove check and unconditionally use onEmitNode when API is breakingly changed
// (see https://github.com/microsoft/TypeScript/pull/36248/files/5062623f39120171b98870c71344b3242eb03d23#r369766739)
if (isEmitNotificationEnabled(node)) {
onEmitNode(hint, node, emitCallback);
}
else {
emitCallback(hint, node);
}
}
}
/**
* Records a hoisted variable declaration for the provided name within a lexical environment.
*/
function hoistVariableDeclaration(name) {
ts.Debug.assert(state > 0 /* Uninitialized */, "Cannot modify the lexical environment during initialization.");
ts.Debug.assert(state < 2 /* Completed */, "Cannot modify the lexical environment after transformation has completed.");
var decl = ts.setEmitFlags(factory.createVariableDeclaration(name), 64 /* NoNestedSourceMaps */);
if (!lexicalEnvironmentVariableDeclarations) {
lexicalEnvironmentVariableDeclarations = [decl];
}
else {
lexicalEnvironmentVariableDeclarations.push(decl);
}
if (lexicalEnvironmentFlags & 1 /* InParameters */) {
lexicalEnvironmentFlags |= 2 /* VariablesHoistedInParameters */;
}
}
/**
* Records a hoisted function declaration within a lexical environment.
*/
function hoistFunctionDeclaration(func) {
ts.Debug.assert(state > 0 /* Uninitialized */, "Cannot modify the lexical environment during initialization.");
ts.Debug.assert(state < 2 /* Completed */, "Cannot modify the lexical environment after transformation has completed.");
ts.setEmitFlags(func, 1048576 /* CustomPrologue */);
if (!lexicalEnvironmentFunctionDeclarations) {
lexicalEnvironmentFunctionDeclarations = [func];
}
else {
lexicalEnvironmentFunctionDeclarations.push(func);
}
}
/**
* Adds an initialization statement to the top of the lexical environment.
*/
function addInitializationStatement(node) {
ts.Debug.assert(state > 0 /* Uninitialized */, "Cannot modify the lexical environment during initialization.");
ts.Debug.assert(state < 2 /* Completed */, "Cannot modify the lexical environment after transformation has completed.");
ts.setEmitFlags(node, 1048576 /* CustomPrologue */);
if (!lexicalEnvironmentStatements) {
lexicalEnvironmentStatements = [node];
}
else {
lexicalEnvironmentStatements.push(node);
}
}
/**
* Starts a new lexical environment. Any existing hoisted variable or function declarations
* are pushed onto a stack, and the related storage variables are reset.
*/
function startLexicalEnvironment() {
ts.Debug.assert(state > 0 /* Uninitialized */, "Cannot modify the lexical environment during initialization.");
ts.Debug.assert(state < 2 /* Completed */, "Cannot modify the lexical environment after transformation has completed.");
ts.Debug.assert(!lexicalEnvironmentSuspended, "Lexical environment is suspended.");
// Save the current lexical environment. Rather than resizing the array we adjust the
// stack size variable. This allows us to reuse existing array slots we've
// already allocated between transformations to avoid allocation and GC overhead during
// transformation.
lexicalEnvironmentVariableDeclarationsStack[lexicalEnvironmentStackOffset] = lexicalEnvironmentVariableDeclarations;
lexicalEnvironmentFunctionDeclarationsStack[lexicalEnvironmentStackOffset] = lexicalEnvironmentFunctionDeclarations;
lexicalEnvironmentStatementsStack[lexicalEnvironmentStackOffset] = lexicalEnvironmentStatements;
lexicalEnvironmentFlagsStack[lexicalEnvironmentStackOffset] = lexicalEnvironmentFlags;
lexicalEnvironmentStackOffset++;
lexicalEnvironmentVariableDeclarations = undefined;
lexicalEnvironmentFunctionDeclarations = undefined;
lexicalEnvironmentStatements = undefined;
lexicalEnvironmentFlags = 0 /* None */;
}
/** Suspends the current lexical environment, usually after visiting a parameter list. */
function suspendLexicalEnvironment() {
ts.Debug.assert(state > 0 /* Uninitialized */, "Cannot modify the lexical environment during initialization.");
ts.Debug.assert(state < 2 /* Completed */, "Cannot modify the lexical environment after transformation has completed.");
ts.Debug.assert(!lexicalEnvironmentSuspended, "Lexical environment is already suspended.");
lexicalEnvironmentSuspended = true;
}
/** Resumes a suspended lexical environment, usually before visiting a function body. */
function resumeLexicalEnvironment() {
ts.Debug.assert(state > 0 /* Uninitialized */, "Cannot modify the lexical environment during initialization.");
ts.Debug.assert(state < 2 /* Completed */, "Cannot modify the lexical environment after transformation has completed.");
ts.Debug.assert(lexicalEnvironmentSuspended, "Lexical environment is not suspended.");
lexicalEnvironmentSuspended = false;
}
/**
* Ends a lexical environment. The previous set of hoisted declarations are restored and
* any hoisted declarations added in this environment are returned.
*/
function endLexicalEnvironment() {
ts.Debug.assert(state > 0 /* Uninitialized */, "Cannot modify the lexical environment during initialization.");
ts.Debug.assert(state < 2 /* Completed */, "Cannot modify the lexical environment after transformation has completed.");
ts.Debug.assert(!lexicalEnvironmentSuspended, "Lexical environment is suspended.");
var statements;
if (lexicalEnvironmentVariableDeclarations ||
lexicalEnvironmentFunctionDeclarations ||
lexicalEnvironmentStatements) {
if (lexicalEnvironmentFunctionDeclarations) {
statements = __spreadArray([], lexicalEnvironmentFunctionDeclarations, true);
}
if (lexicalEnvironmentVariableDeclarations) {
var statement = factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList(lexicalEnvironmentVariableDeclarations));
ts.setEmitFlags(statement, 1048576 /* CustomPrologue */);
if (!statements) {
statements = [statement];
}
else {
statements.push(statement);
}
}
if (lexicalEnvironmentStatements) {
if (!statements) {
statements = __spreadArray([], lexicalEnvironmentStatements, true);
}
else {
statements = __spreadArray(__spreadArray([], statements, true), lexicalEnvironmentStatements, true);
}
}
}
// Restore the previous lexical environment.
lexicalEnvironmentStackOffset--;
lexicalEnvironmentVariableDeclarations = lexicalEnvironmentVariableDeclarationsStack[lexicalEnvironmentStackOffset];
lexicalEnvironmentFunctionDeclarations = lexicalEnvironmentFunctionDeclarationsStack[lexicalEnvironmentStackOffset];
lexicalEnvironmentStatements = lexicalEnvironmentStatementsStack[lexicalEnvironmentStackOffset];
lexicalEnvironmentFlags = lexicalEnvironmentFlagsStack[lexicalEnvironmentStackOffset];
if (lexicalEnvironmentStackOffset === 0) {
lexicalEnvironmentVariableDeclarationsStack = [];
lexicalEnvironmentFunctionDeclarationsStack = [];
lexicalEnvironmentStatementsStack = [];
lexicalEnvironmentFlagsStack = [];
}
return statements;
}
function setLexicalEnvironmentFlags(flags, value) {
lexicalEnvironmentFlags = value ?
lexicalEnvironmentFlags | flags :
lexicalEnvironmentFlags & ~flags;
}
function getLexicalEnvironmentFlags() {
return lexicalEnvironmentFlags;
}
/**
* Starts a block scope. Any existing block hoisted variables are pushed onto the stack and the related storage variables are reset.
*/
function startBlockScope() {
ts.Debug.assert(state > 0 /* Uninitialized */, "Cannot start a block scope during initialization.");
ts.Debug.assert(state < 2 /* Completed */, "Cannot start a block scope after transformation has completed.");
blockScopedVariableDeclarationsStack[blockScopeStackOffset] = blockScopedVariableDeclarations;
blockScopeStackOffset++;
blockScopedVariableDeclarations = undefined;
}
/**
* Ends a block scope. The previous set of block hoisted variables are restored. Any hoisted declarations are returned.
*/
function endBlockScope() {
ts.Debug.assert(state > 0 /* Uninitialized */, "Cannot end a block scope during initialization.");
ts.Debug.assert(state < 2 /* Completed */, "Cannot end a block scope after transformation has completed.");
var statements = ts.some(blockScopedVariableDeclarations) ?
[
factory.createVariableStatement(
/*modifiers*/ undefined, factory.createVariableDeclarationList(blockScopedVariableDeclarations.map(function (identifier) { return factory.createVariableDeclaration(identifier); }), 1 /* Let */))
] : undefined;
blockScopeStackOffset--;
blockScopedVariableDeclarations = blockScopedVariableDeclarationsStack[blockScopeStackOffset];
if (blockScopeStackOffset === 0) {
blockScopedVariableDeclarationsStack = [];
}
return statements;
}
function addBlockScopedVariable(name) {
ts.Debug.assert(blockScopeStackOffset > 0, "Cannot add a block scoped variable outside of an iteration body.");
(blockScopedVariableDeclarations || (blockScopedVariableDeclarations = [])).push(name);
}
function requestEmitHelper(helper) {
ts.Debug.assert(state > 0 /* Uninitialized */, "Cannot modify the transformation context during initialization.");
ts.Debug.assert(state < 2 /* Completed */, "Cannot modify the transformation context after transformation has completed.");
ts.Debug.assert(!helper.scoped, "Cannot request a scoped emit helper.");
if (helper.dependencies) {
for (var _i = 0, _a = helper.dependencies; _i < _a.length; _i++) {
var h = _a[_i];
requestEmitHelper(h);
}
}
emitHelpers = ts.append(emitHelpers, helper);
}
function readEmitHelpers() {
ts.Debug.assert(state > 0 /* Uninitialized */, "Cannot modify the transformation context during initialization.");
ts.Debug.assert(state < 2 /* Completed */, "Cannot modify the transformation context after transformation has completed.");
var helpers = emitHelpers;
emitHelpers = undefined;
return helpers;
}
function dispose() {
if (state < 3 /* Disposed */) {
// Clean up emit nodes on parse tree
for (var _i = 0, nodes_4 = nodes; _i < nodes_4.length; _i++) {
var node = nodes_4[_i];
ts.disposeEmitNodes(ts.getSourceFileOfNode(ts.getParseTreeNode(node)));
}
// Release references to external entries for GC purposes.
lexicalEnvironmentVariableDeclarations = undefined;
lexicalEnvironmentVariableDeclarationsStack = undefined;
lexicalEnvironmentFunctionDeclarations = undefined;
lexicalEnvironmentFunctionDeclarationsStack = undefined;
onSubstituteNode = undefined;
onEmitNode = undefined;
emitHelpers = undefined;
// Prevent further use of the transformation result.
state = 3 /* Disposed */;
}
}
}
ts.transformNodes = transformNodes;
ts.nullTransformationContext = {
factory: ts.factory,
getCompilerOptions: function () { return ({}); },
getEmitResolver: ts.notImplemented,
getEmitHost: ts.notImplemented,
getEmitHelperFactory: ts.notImplemented,
startLexicalEnvironment: ts.noop,
resumeLexicalEnvironment: ts.noop,
suspendLexicalEnvironment: ts.noop,
endLexicalEnvironment: ts.returnUndefined,
setLexicalEnvironmentFlags: ts.noop,
getLexicalEnvironmentFlags: function () { return 0; },
hoistVariableDeclaration: ts.noop,
hoistFunctionDeclaration: ts.noop,
addInitializationStatement: ts.noop,
startBlockScope: ts.noop,
endBlockScope: ts.returnUndefined,
addBlockScopedVariable: ts.noop,
requestEmitHelper: ts.noop,
readEmitHelpers: ts.notImplemented,
enableSubstitution: ts.noop,
enableEmitNotification: ts.noop,
isSubstitutionEnabled: ts.notImplemented,
isEmitNotificationEnabled: ts.notImplemented,
onSubstituteNode: noEmitSubstitution,
onEmitNode: noEmitNotification,
addDiagnostic: ts.noop,
};
})(ts || (ts = {}));
var ts;
(function (ts) {
var brackets = createBracketsMap();
/*@internal*/
function isBuildInfoFile(file) {
return ts.fileExtensionIs(file, ".tsbuildinfo" /* TsBuildInfo */);
}
ts.isBuildInfoFile = isBuildInfoFile;
/*@internal*/
/**
* Iterates over the source files that are expected to have an emit output.
*
* @param host An EmitHost.
* @param action The action to execute.
* @param sourceFilesOrTargetSourceFile
* If an array, the full list of source files to emit.
* Else, calls `getSourceFilesToEmit` with the (optional) target source file to determine the list of source files to emit.
*/
function forEachEmittedFile(host, action, sourceFilesOrTargetSourceFile, forceDtsEmit, onlyBuildInfo, includeBuildInfo) {
if (forceDtsEmit === void 0) { forceDtsEmit = false; }
var sourceFiles = ts.isArray(sourceFilesOrTargetSourceFile) ? sourceFilesOrTargetSourceFile : ts.getSourceFilesToEmit(host, sourceFilesOrTargetSourceFile, forceDtsEmit);
var options = host.getCompilerOptions();
if (ts.outFile(options)) {
var prepends = host.getPrependNodes();
if (sourceFiles.length || prepends.length) {
var bundle = ts.factory.createBundle(sourceFiles, prepends);
var result = action(getOutputPathsFor(bundle, host, forceDtsEmit), bundle);
if (result) {
return result;
}
}
}
else {
if (!onlyBuildInfo) {
for (var _a = 0, sourceFiles_1 = sourceFiles; _a < sourceFiles_1.length; _a++) {
var sourceFile = sourceFiles_1[_a];
var result = action(getOutputPathsFor(sourceFile, host, forceDtsEmit), sourceFile);
if (result) {
return result;
}
}
}
if (includeBuildInfo) {
var buildInfoPath = getTsBuildInfoEmitOutputFilePath(options);
if (buildInfoPath)
return action({ buildInfoPath: buildInfoPath }, /*sourceFileOrBundle*/ undefined);
}
}
}
ts.forEachEmittedFile = forEachEmittedFile;
function getTsBuildInfoEmitOutputFilePath(options) {
var configFile = options.configFilePath;
if (!ts.isIncrementalCompilation(options))
return undefined;
if (options.tsBuildInfoFile)
return options.tsBuildInfoFile;
var outPath = ts.outFile(options);
var buildInfoExtensionLess;
if (outPath) {
buildInfoExtensionLess = ts.removeFileExtension(outPath);
}
else {
if (!configFile)
return undefined;
var configFileExtensionLess = ts.removeFileExtension(configFile);
buildInfoExtensionLess = options.outDir ?
options.rootDir ?
ts.resolvePath(options.outDir, ts.getRelativePathFromDirectory(options.rootDir, configFileExtensionLess, /*ignoreCase*/ true)) :
ts.combinePaths(options.outDir, ts.getBaseFileName(configFileExtensionLess)) :
configFileExtensionLess;
}
return buildInfoExtensionLess + ".tsbuildinfo" /* TsBuildInfo */;
}
ts.getTsBuildInfoEmitOutputFilePath = getTsBuildInfoEmitOutputFilePath;
/*@internal*/
function getOutputPathsForBundle(options, forceDtsPaths) {
var outPath = ts.outFile(options);
var jsFilePath = options.emitDeclarationOnly ? undefined : outPath;
var sourceMapFilePath = jsFilePath && getSourceMapFilePath(jsFilePath, options);
var declarationFilePath = (forceDtsPaths || ts.getEmitDeclarations(options)) ? ts.removeFileExtension(outPath) + ".d.ts" /* Dts */ : undefined;
var declarationMapPath = declarationFilePath && ts.getAreDeclarationMapsEnabled(options) ? declarationFilePath + ".map" : undefined;
var buildInfoPath = getTsBuildInfoEmitOutputFilePath(options);
return { jsFilePath: jsFilePath, sourceMapFilePath: sourceMapFilePath, declarationFilePath: declarationFilePath, declarationMapPath: declarationMapPath, buildInfoPath: buildInfoPath };
}
ts.getOutputPathsForBundle = getOutputPathsForBundle;
/*@internal*/
function getOutputPathsFor(sourceFile, host, forceDtsPaths) {
var options = host.getCompilerOptions();
if (sourceFile.kind === 301 /* Bundle */) {
return getOutputPathsForBundle(options, forceDtsPaths);
}
else {
var ownOutputFilePath = ts.getOwnEmitOutputFilePath(sourceFile.fileName, host, getOutputExtension(sourceFile, options));
var isJsonFile = ts.isJsonSourceFile(sourceFile);
// If json file emits to the same location skip writing it, if emitDeclarationOnly skip writing it
var isJsonEmittedToSameLocation = isJsonFile &&
ts.comparePaths(sourceFile.fileName, ownOutputFilePath, host.getCurrentDirectory(), !host.useCaseSensitiveFileNames()) === 0 /* EqualTo */;
var jsFilePath = options.emitDeclarationOnly || isJsonEmittedToSameLocation ? undefined : ownOutputFilePath;
var sourceMapFilePath = !jsFilePath || ts.isJsonSourceFile(sourceFile) ? undefined : getSourceMapFilePath(jsFilePath, options);
var declarationFilePath = (forceDtsPaths || (ts.getEmitDeclarations(options) && !isJsonFile)) ? ts.getDeclarationEmitOutputFilePath(sourceFile.fileName, host) : undefined;
var declarationMapPath = declarationFilePath && ts.getAreDeclarationMapsEnabled(options) ? declarationFilePath + ".map" : undefined;
return { jsFilePath: jsFilePath, sourceMapFilePath: sourceMapFilePath, declarationFilePath: declarationFilePath, declarationMapPath: declarationMapPath, buildInfoPath: undefined };
}
}
ts.getOutputPathsFor = getOutputPathsFor;
function getSourceMapFilePath(jsFilePath, options) {
return (options.sourceMap && !options.inlineSourceMap) ? jsFilePath + ".map" : undefined;
}
// JavaScript files are always LanguageVariant.JSX, as JSX syntax is allowed in .js files also.
// So for JavaScript files, '.jsx' is only emitted if the input was '.jsx', and JsxEmit.Preserve.
// For TypeScript, the only time to emit with a '.jsx' extension, is on JSX input, and JsxEmit.Preserve
/* @internal */
function getOutputExtension(sourceFile, options) {
if (ts.isJsonSourceFile(sourceFile)) {
return ".json" /* Json */;
}
if (options.jsx === 1 /* Preserve */) {
if (ts.isSourceFileJS(sourceFile)) {
if (ts.fileExtensionIs(sourceFile.fileName, ".jsx" /* Jsx */)) {
return ".jsx" /* Jsx */;
}
}
else if (sourceFile.languageVariant === 1 /* JSX */) {
// TypeScript source file preserving JSX syntax
return ".jsx" /* Jsx */;
}
}
return ".js" /* Js */;
}
ts.getOutputExtension = getOutputExtension;
function getOutputPathWithoutChangingExt(inputFileName, configFile, ignoreCase, outputDir, getCommonSourceDirectory) {
return outputDir ?
ts.resolvePath(outputDir, ts.getRelativePathFromDirectory(getCommonSourceDirectory ? getCommonSourceDirectory() : getCommonSourceDirectoryOfConfig(configFile, ignoreCase), inputFileName, ignoreCase)) :
inputFileName;
}
/* @internal */
function getOutputDeclarationFileName(inputFileName, configFile, ignoreCase, getCommonSourceDirectory) {
ts.Debug.assert(!ts.fileExtensionIs(inputFileName, ".d.ts" /* Dts */) && !ts.fileExtensionIs(inputFileName, ".json" /* Json */));
return ts.changeExtension(getOutputPathWithoutChangingExt(inputFileName, configFile, ignoreCase, configFile.options.declarationDir || configFile.options.outDir, getCommonSourceDirectory), ".d.ts" /* Dts */);
}
ts.getOutputDeclarationFileName = getOutputDeclarationFileName;
function getOutputJSFileName(inputFileName, configFile, ignoreCase, getCommonSourceDirectory) {
if (configFile.options.emitDeclarationOnly)
return undefined;
var isJsonFile = ts.fileExtensionIs(inputFileName, ".json" /* Json */);
var outputFileName = ts.changeExtension(getOutputPathWithoutChangingExt(inputFileName, configFile, ignoreCase, configFile.options.outDir, getCommonSourceDirectory), isJsonFile ?
".json" /* Json */ :
configFile.options.jsx === 1 /* Preserve */ && (ts.fileExtensionIs(inputFileName, ".tsx" /* Tsx */) || ts.fileExtensionIs(inputFileName, ".jsx" /* Jsx */)) ?
".jsx" /* Jsx */ :
".js" /* Js */);
return !isJsonFile || ts.comparePaths(inputFileName, outputFileName, ts.Debug.checkDefined(configFile.options.configFilePath), ignoreCase) !== 0 /* EqualTo */ ?
outputFileName :
undefined;
}
function createAddOutput() {
var outputs;
return { addOutput: addOutput, getOutputs: getOutputs };
function addOutput(path) {
if (path) {
(outputs || (outputs = [])).push(path);
}
}
function getOutputs() {
return outputs || ts.emptyArray;
}
}
function getSingleOutputFileNames(configFile, addOutput) {
var _a = getOutputPathsForBundle(configFile.options, /*forceDtsPaths*/ false), jsFilePath = _a.jsFilePath, sourceMapFilePath = _a.sourceMapFilePath, declarationFilePath = _a.declarationFilePath, declarationMapPath = _a.declarationMapPath, buildInfoPath = _a.buildInfoPath;
addOutput(jsFilePath);
addOutput(sourceMapFilePath);
addOutput(declarationFilePath);
addOutput(declarationMapPath);
addOutput(buildInfoPath);
}
function getOwnOutputFileNames(configFile, inputFileName, ignoreCase, addOutput, getCommonSourceDirectory) {
if (ts.fileExtensionIs(inputFileName, ".d.ts" /* Dts */))
return;
var js = getOutputJSFileName(inputFileName, configFile, ignoreCase, getCommonSourceDirectory);
addOutput(js);
if (ts.fileExtensionIs(inputFileName, ".json" /* Json */))
return;
if (js && configFile.options.sourceMap) {
addOutput(js + ".map");
}
if (ts.getEmitDeclarations(configFile.options)) {
var dts = getOutputDeclarationFileName(inputFileName, configFile, ignoreCase, getCommonSourceDirectory);
addOutput(dts);
if (configFile.options.declarationMap) {
addOutput(dts + ".map");
}
}
}
/*@internal*/
function getCommonSourceDirectory(options, emittedFiles, currentDirectory, getCanonicalFileName, checkSourceFilesBelongToPath) {
var commonSourceDirectory;
if (options.rootDir) {
// If a rootDir is specified use it as the commonSourceDirectory
commonSourceDirectory = ts.getNormalizedAbsolutePath(options.rootDir, currentDirectory);
checkSourceFilesBelongToPath === null || checkSourceFilesBelongToPath === void 0 ? void 0 : checkSourceFilesBelongToPath(options.rootDir);
}
else if (options.composite && options.configFilePath) {
// Project compilations never infer their root from the input source paths
commonSourceDirectory = ts.getDirectoryPath(ts.normalizeSlashes(options.configFilePath));
checkSourceFilesBelongToPath === null || checkSourceFilesBelongToPath === void 0 ? void 0 : checkSourceFilesBelongToPath(commonSourceDirectory);
}
else {
commonSourceDirectory = ts.computeCommonSourceDirectoryOfFilenames(emittedFiles(), currentDirectory, getCanonicalFileName);
}
if (commonSourceDirectory && commonSourceDirectory[commonSourceDirectory.length - 1] !== ts.directorySeparator) {
// Make sure directory path ends with directory separator so this string can directly
// used to replace with "" to get the relative path of the source file and the relative path doesn't
// start with / making it rooted path
commonSourceDirectory += ts.directorySeparator;
}
return commonSourceDirectory;
}
ts.getCommonSourceDirectory = getCommonSourceDirectory;
/*@internal*/
function getCommonSourceDirectoryOfConfig(_a, ignoreCase) {
var options = _a.options, fileNames = _a.fileNames;
return getCommonSourceDirectory(options, function () { return ts.filter(fileNames, function (file) { return !(options.noEmitForJsFiles && ts.fileExtensionIsOneOf(file, ts.supportedJSExtensions)) && !ts.fileExtensionIs(file, ".d.ts" /* Dts */); }); }, ts.getDirectoryPath(ts.normalizeSlashes(ts.Debug.checkDefined(options.configFilePath))), ts.createGetCanonicalFileName(!ignoreCase));
}
ts.getCommonSourceDirectoryOfConfig = getCommonSourceDirectoryOfConfig;
/*@internal*/
function getAllProjectOutputs(configFile, ignoreCase) {
var _a = createAddOutput(), addOutput = _a.addOutput, getOutputs = _a.getOutputs;
if (ts.outFile(configFile.options)) {
getSingleOutputFileNames(configFile, addOutput);
}
else {
var getCommonSourceDirectory_1 = ts.memoize(function () { return getCommonSourceDirectoryOfConfig(configFile, ignoreCase); });
for (var _b = 0, _c = configFile.fileNames; _b < _c.length; _b++) {
var inputFileName = _c[_b];
getOwnOutputFileNames(configFile, inputFileName, ignoreCase, addOutput, getCommonSourceDirectory_1);
}
addOutput(getTsBuildInfoEmitOutputFilePath(configFile.options));
}
return getOutputs();
}
ts.getAllProjectOutputs = getAllProjectOutputs;
function getOutputFileNames(commandLine, inputFileName, ignoreCase) {
inputFileName = ts.normalizePath(inputFileName);
ts.Debug.assert(ts.contains(commandLine.fileNames, inputFileName), "Expected fileName to be present in command line");
var _a = createAddOutput(), addOutput = _a.addOutput, getOutputs = _a.getOutputs;
if (ts.outFile(commandLine.options)) {
getSingleOutputFileNames(commandLine, addOutput);
}
else {
getOwnOutputFileNames(commandLine, inputFileName, ignoreCase, addOutput);
}
return getOutputs();
}
ts.getOutputFileNames = getOutputFileNames;
/*@internal*/
function getFirstProjectOutput(configFile, ignoreCase) {
if (ts.outFile(configFile.options)) {
var jsFilePath = getOutputPathsForBundle(configFile.options, /*forceDtsPaths*/ false).jsFilePath;
return ts.Debug.checkDefined(jsFilePath, "project " + configFile.options.configFilePath + " expected to have at least one output");
}
var getCommonSourceDirectory = ts.memoize(function () { return getCommonSourceDirectoryOfConfig(configFile, ignoreCase); });
for (var _a = 0, _b = configFile.fileNames; _a < _b.length; _a++) {
var inputFileName = _b[_a];
if (ts.fileExtensionIs(inputFileName, ".d.ts" /* Dts */))
continue;
var jsFilePath = getOutputJSFileName(inputFileName, configFile, ignoreCase, getCommonSourceDirectory);
if (jsFilePath)
return jsFilePath;
if (ts.fileExtensionIs(inputFileName, ".json" /* Json */))
continue;
if (ts.getEmitDeclarations(configFile.options)) {
return getOutputDeclarationFileName(inputFileName, configFile, ignoreCase, getCommonSourceDirectory);
}
}
var buildInfoPath = getTsBuildInfoEmitOutputFilePath(configFile.options);
if (buildInfoPath)
return buildInfoPath;
return ts.Debug.fail("project " + configFile.options.configFilePath + " expected to have at least one output");
}
ts.getFirstProjectOutput = getFirstProjectOutput;
/*@internal*/
// targetSourceFile is when users only want one file in entire project to be emitted. This is used in compileOnSave feature
function emitFiles(resolver, host, targetSourceFile, _a, emitOnlyDtsFiles, onlyBuildInfo, forceDtsEmit) {
var scriptTransformers = _a.scriptTransformers, declarationTransformers = _a.declarationTransformers;
var compilerOptions = host.getCompilerOptions();
var sourceMapDataList = (compilerOptions.sourceMap || compilerOptions.inlineSourceMap || ts.getAreDeclarationMapsEnabled(compilerOptions)) ? [] : undefined;
var emittedFilesList = compilerOptions.listEmittedFiles ? [] : undefined;
var emitterDiagnostics = ts.createDiagnosticCollection();
var newLine = ts.getNewLineCharacter(compilerOptions, function () { return host.getNewLine(); });
var writer = ts.createTextWriter(newLine);
var _b = ts.performance.createTimer("printTime", "beforePrint", "afterPrint"), enter = _b.enter, exit = _b.exit;
var bundleBuildInfo;
var emitSkipped = false;
var exportedModulesFromDeclarationEmit;
// Emit each output file
enter();
forEachEmittedFile(host, emitSourceFileOrBundle, ts.getSourceFilesToEmit(host, targetSourceFile, forceDtsEmit), forceDtsEmit, onlyBuildInfo, !targetSourceFile);
exit();
return {
emitSkipped: emitSkipped,
diagnostics: emitterDiagnostics.getDiagnostics(),
emittedFiles: emittedFilesList,
sourceMaps: sourceMapDataList,
exportedModulesFromDeclarationEmit: exportedModulesFromDeclarationEmit
};
function emitSourceFileOrBundle(_a, sourceFileOrBundle) {
var jsFilePath = _a.jsFilePath, sourceMapFilePath = _a.sourceMapFilePath, declarationFilePath = _a.declarationFilePath, declarationMapPath = _a.declarationMapPath, buildInfoPath = _a.buildInfoPath;
var buildInfoDirectory;
if (buildInfoPath && sourceFileOrBundle && ts.isBundle(sourceFileOrBundle)) {
buildInfoDirectory = ts.getDirectoryPath(ts.getNormalizedAbsolutePath(buildInfoPath, host.getCurrentDirectory()));
bundleBuildInfo = {
commonSourceDirectory: relativeToBuildInfo(host.getCommonSourceDirectory()),
sourceFiles: sourceFileOrBundle.sourceFiles.map(function (file) { return relativeToBuildInfo(ts.getNormalizedAbsolutePath(file.fileName, host.getCurrentDirectory())); })
};
}
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("emit" /* Emit */, "emitJsFileOrBundle", { jsFilePath: jsFilePath });
emitJsFileOrBundle(sourceFileOrBundle, jsFilePath, sourceMapFilePath, relativeToBuildInfo);
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("emit" /* Emit */, "emitDeclarationFileOrBundle", { declarationFilePath: declarationFilePath });
emitDeclarationFileOrBundle(sourceFileOrBundle, declarationFilePath, declarationMapPath, relativeToBuildInfo);
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("emit" /* Emit */, "emitBuildInfo", { buildInfoPath: buildInfoPath });
emitBuildInfo(bundleBuildInfo, buildInfoPath);
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
if (!emitSkipped && emittedFilesList) {
if (!emitOnlyDtsFiles) {
if (jsFilePath) {
emittedFilesList.push(jsFilePath);
}
if (sourceMapFilePath) {
emittedFilesList.push(sourceMapFilePath);
}
if (buildInfoPath) {
emittedFilesList.push(buildInfoPath);
}
}
if (declarationFilePath) {
emittedFilesList.push(declarationFilePath);
}
if (declarationMapPath) {
emittedFilesList.push(declarationMapPath);
}
}
function relativeToBuildInfo(path) {
return ts.ensurePathIsNonModuleName(ts.getRelativePathFromDirectory(buildInfoDirectory, path, host.getCanonicalFileName));
}
}
function emitBuildInfo(bundle, buildInfoPath) {
// Write build information if applicable
if (!buildInfoPath || targetSourceFile || emitSkipped)
return;
var program = host.getProgramBuildInfo();
if (host.isEmitBlocked(buildInfoPath)) {
emitSkipped = true;
return;
}
var version = ts.version; // Extracted into a const so the form is stable between namespace and module
ts.writeFile(host, emitterDiagnostics, buildInfoPath, getBuildInfoText({ bundle: bundle, program: program, version: version }), /*writeByteOrderMark*/ false);
}
function emitJsFileOrBundle(sourceFileOrBundle, jsFilePath, sourceMapFilePath, relativeToBuildInfo) {
if (!sourceFileOrBundle || emitOnlyDtsFiles || !jsFilePath) {
return;
}
// Make sure not to write js file and source map file if any of them cannot be written
if ((jsFilePath && host.isEmitBlocked(jsFilePath)) || compilerOptions.noEmit) {
emitSkipped = true;
return;
}
// Transform the source files
var transform = ts.transformNodes(resolver, host, ts.factory, compilerOptions, [sourceFileOrBundle], scriptTransformers, /*allowDtsFiles*/ false);
var printerOptions = {
removeComments: compilerOptions.removeComments,
newLine: compilerOptions.newLine,
noEmitHelpers: compilerOptions.noEmitHelpers,
module: compilerOptions.module,
target: compilerOptions.target,
sourceMap: compilerOptions.sourceMap,
inlineSourceMap: compilerOptions.inlineSourceMap,
inlineSources: compilerOptions.inlineSources,
extendedDiagnostics: compilerOptions.extendedDiagnostics,
writeBundleFileInfo: !!bundleBuildInfo,
relativeToBuildInfo: relativeToBuildInfo
};
// Create a printer to print the nodes
var printer = createPrinter(printerOptions, {
// resolver hooks
hasGlobalName: resolver.hasGlobalName,
// transform hooks
onEmitNode: transform.emitNodeWithNotification,
isEmitNotificationEnabled: transform.isEmitNotificationEnabled,
substituteNode: transform.substituteNode,
});
ts.Debug.assert(transform.transformed.length === 1, "Should only see one output from the transform");
printSourceFileOrBundle(jsFilePath, sourceMapFilePath, transform.transformed[0], printer, compilerOptions);
// Clean up emit nodes on parse tree
transform.dispose();
if (bundleBuildInfo)
bundleBuildInfo.js = printer.bundleFileInfo;
}
function emitDeclarationFileOrBundle(sourceFileOrBundle, declarationFilePath, declarationMapPath, relativeToBuildInfo) {
if (!sourceFileOrBundle)
return;
if (!declarationFilePath) {
if (emitOnlyDtsFiles || compilerOptions.emitDeclarationOnly)
emitSkipped = true;
return;
}
var sourceFiles = ts.isSourceFile(sourceFileOrBundle) ? [sourceFileOrBundle] : sourceFileOrBundle.sourceFiles;
var filesForEmit = forceDtsEmit ? sourceFiles : ts.filter(sourceFiles, ts.isSourceFileNotJson);
// Setup and perform the transformation to retrieve declarations from the input files
var inputListOrBundle = ts.outFile(compilerOptions) ? [ts.factory.createBundle(filesForEmit, !ts.isSourceFile(sourceFileOrBundle) ? sourceFileOrBundle.prepends : undefined)] : filesForEmit;
if (emitOnlyDtsFiles && !ts.getEmitDeclarations(compilerOptions)) {
// Checker wont collect the linked aliases since thats only done when declaration is enabled.
// Do that here when emitting only dts files
filesForEmit.forEach(collectLinkedAliases);
}
var declarationTransform = ts.transformNodes(resolver, host, ts.factory, compilerOptions, inputListOrBundle, declarationTransformers, /*allowDtsFiles*/ false);
if (ts.length(declarationTransform.diagnostics)) {
for (var _a = 0, _b = declarationTransform.diagnostics; _a < _b.length; _a++) {
var diagnostic = _b[_a];
emitterDiagnostics.add(diagnostic);
}
}
var printerOptions = {
removeComments: compilerOptions.removeComments,
newLine: compilerOptions.newLine,
noEmitHelpers: true,
module: compilerOptions.module,
target: compilerOptions.target,
sourceMap: compilerOptions.sourceMap,
inlineSourceMap: compilerOptions.inlineSourceMap,
extendedDiagnostics: compilerOptions.extendedDiagnostics,
onlyPrintJsDocStyle: true,
writeBundleFileInfo: !!bundleBuildInfo,
recordInternalSection: !!bundleBuildInfo,
relativeToBuildInfo: relativeToBuildInfo
};
var declarationPrinter = createPrinter(printerOptions, {
// resolver hooks
hasGlobalName: resolver.hasGlobalName,
// transform hooks
onEmitNode: declarationTransform.emitNodeWithNotification,
isEmitNotificationEnabled: declarationTransform.isEmitNotificationEnabled,
substituteNode: declarationTransform.substituteNode,
});
var declBlocked = (!!declarationTransform.diagnostics && !!declarationTransform.diagnostics.length) || !!host.isEmitBlocked(declarationFilePath) || !!compilerOptions.noEmit;
emitSkipped = emitSkipped || declBlocked;
if (!declBlocked || forceDtsEmit) {
ts.Debug.assert(declarationTransform.transformed.length === 1, "Should only see one output from the decl transform");
printSourceFileOrBundle(declarationFilePath, declarationMapPath, declarationTransform.transformed[0], declarationPrinter, {
sourceMap: !forceDtsEmit && compilerOptions.declarationMap,
sourceRoot: compilerOptions.sourceRoot,
mapRoot: compilerOptions.mapRoot,
extendedDiagnostics: compilerOptions.extendedDiagnostics,
// Explicitly do not passthru either `inline` option
});
if (forceDtsEmit && declarationTransform.transformed[0].kind === 300 /* SourceFile */) {
var sourceFile = declarationTransform.transformed[0];
exportedModulesFromDeclarationEmit = sourceFile.exportedModulesFromDeclarationEmit;
}
}
declarationTransform.dispose();
if (bundleBuildInfo)
bundleBuildInfo.dts = declarationPrinter.bundleFileInfo;
}
function collectLinkedAliases(node) {
if (ts.isExportAssignment(node)) {
if (node.expression.kind === 79 /* Identifier */) {
resolver.collectLinkedAliases(node.expression, /*setVisibility*/ true);
}
return;
}
else if (ts.isExportSpecifier(node)) {
resolver.collectLinkedAliases(node.propertyName || node.name, /*setVisibility*/ true);
return;
}
ts.forEachChild(node, collectLinkedAliases);
}
function printSourceFileOrBundle(jsFilePath, sourceMapFilePath, sourceFileOrBundle, printer, mapOptions) {
var bundle = sourceFileOrBundle.kind === 301 /* Bundle */ ? sourceFileOrBundle : undefined;
var sourceFile = sourceFileOrBundle.kind === 300 /* SourceFile */ ? sourceFileOrBundle : undefined;
var sourceFiles = bundle ? bundle.sourceFiles : [sourceFile];
var sourceMapGenerator;
if (shouldEmitSourceMaps(mapOptions, sourceFileOrBundle)) {
sourceMapGenerator = ts.createSourceMapGenerator(host, ts.getBaseFileName(ts.normalizeSlashes(jsFilePath)), getSourceRoot(mapOptions), getSourceMapDirectory(mapOptions, jsFilePath, sourceFile), mapOptions);
}
if (bundle) {
printer.writeBundle(bundle, writer, sourceMapGenerator);
}
else {
printer.writeFile(sourceFile, writer, sourceMapGenerator);
}
if (sourceMapGenerator) {
if (sourceMapDataList) {
sourceMapDataList.push({
inputSourceFileNames: sourceMapGenerator.getSources(),
sourceMap: sourceMapGenerator.toJSON()
});
}
var sourceMappingURL = getSourceMappingURL(mapOptions, sourceMapGenerator, jsFilePath, sourceMapFilePath, sourceFile);
if (sourceMappingURL) {
if (!writer.isAtStartOfLine())
writer.rawWrite(newLine);
writer.writeComment("//# " + "sourceMappingURL" + "=" + sourceMappingURL); // Tools can sometimes see this line as a source mapping url comment
}
// Write the source map
if (sourceMapFilePath) {
var sourceMap = sourceMapGenerator.toString();
ts.writeFile(host, emitterDiagnostics, sourceMapFilePath, sourceMap, /*writeByteOrderMark*/ false, sourceFiles);
}
}
else {
writer.writeLine();
}
// Write the output file
ts.writeFile(host, emitterDiagnostics, jsFilePath, writer.getText(), !!compilerOptions.emitBOM, sourceFiles);
// Reset state
writer.clear();
}
function shouldEmitSourceMaps(mapOptions, sourceFileOrBundle) {
return (mapOptions.sourceMap || mapOptions.inlineSourceMap)
&& (sourceFileOrBundle.kind !== 300 /* SourceFile */ || !ts.fileExtensionIs(sourceFileOrBundle.fileName, ".json" /* Json */));
}
function getSourceRoot(mapOptions) {
// Normalize source root and make sure it has trailing "/" so that it can be used to combine paths with the
// relative paths of the sources list in the sourcemap
var sourceRoot = ts.normalizeSlashes(mapOptions.sourceRoot || "");
return sourceRoot ? ts.ensureTrailingDirectorySeparator(sourceRoot) : sourceRoot;
}
function getSourceMapDirectory(mapOptions, filePath, sourceFile) {
if (mapOptions.sourceRoot)
return host.getCommonSourceDirectory();
if (mapOptions.mapRoot) {
var sourceMapDir = ts.normalizeSlashes(mapOptions.mapRoot);
if (sourceFile) {
// For modules or multiple emit files the mapRoot will have directory structure like the sources
// So if src\a.ts and src\lib\b.ts are compiled together user would be moving the maps into mapRoot\a.js.map and mapRoot\lib\b.js.map
sourceMapDir = ts.getDirectoryPath(ts.getSourceFilePathInNewDir(sourceFile.fileName, host, sourceMapDir));
}
if (ts.getRootLength(sourceMapDir) === 0) {
// The relative paths are relative to the common directory
sourceMapDir = ts.combinePaths(host.getCommonSourceDirectory(), sourceMapDir);
}
return sourceMapDir;
}
return ts.getDirectoryPath(ts.normalizePath(filePath));
}
function getSourceMappingURL(mapOptions, sourceMapGenerator, filePath, sourceMapFilePath, sourceFile) {
if (mapOptions.inlineSourceMap) {
// Encode the sourceMap into the sourceMap url
var sourceMapText = sourceMapGenerator.toString();
var base64SourceMapText = ts.base64encode(ts.sys, sourceMapText);
return "data:application/json;base64," + base64SourceMapText;
}
var sourceMapFile = ts.getBaseFileName(ts.normalizeSlashes(ts.Debug.checkDefined(sourceMapFilePath)));
if (mapOptions.mapRoot) {
var sourceMapDir = ts.normalizeSlashes(mapOptions.mapRoot);
if (sourceFile) {
// For modules or multiple emit files the mapRoot will have directory structure like the sources
// So if src\a.ts and src\lib\b.ts are compiled together user would be moving the maps into mapRoot\a.js.map and mapRoot\lib\b.js.map
sourceMapDir = ts.getDirectoryPath(ts.getSourceFilePathInNewDir(sourceFile.fileName, host, sourceMapDir));
}
if (ts.getRootLength(sourceMapDir) === 0) {
// The relative paths are relative to the common directory
sourceMapDir = ts.combinePaths(host.getCommonSourceDirectory(), sourceMapDir);
return encodeURI(ts.getRelativePathToDirectoryOrUrl(ts.getDirectoryPath(ts.normalizePath(filePath)), // get the relative sourceMapDir path based on jsFilePath
ts.combinePaths(sourceMapDir, sourceMapFile), // this is where user expects to see sourceMap
host.getCurrentDirectory(), host.getCanonicalFileName,
/*isAbsolutePathAnUrl*/ true));
}
else {
return encodeURI(ts.combinePaths(sourceMapDir, sourceMapFile));
}
}
return encodeURI(sourceMapFile);
}
}
ts.emitFiles = emitFiles;
/*@internal*/
function getBuildInfoText(buildInfo) {
return JSON.stringify(buildInfo);
}
ts.getBuildInfoText = getBuildInfoText;
/*@internal*/
function getBuildInfo(buildInfoText) {
return JSON.parse(buildInfoText);
}
ts.getBuildInfo = getBuildInfo;
/*@internal*/
ts.notImplementedResolver = {
hasGlobalName: ts.notImplemented,
getReferencedExportContainer: ts.notImplemented,
getReferencedImportDeclaration: ts.notImplemented,
getReferencedDeclarationWithCollidingName: ts.notImplemented,
isDeclarationWithCollidingName: ts.notImplemented,
isValueAliasDeclaration: ts.notImplemented,
isReferencedAliasDeclaration: ts.notImplemented,
isTopLevelValueImportEqualsWithEntityName: ts.notImplemented,
getNodeCheckFlags: ts.notImplemented,
isDeclarationVisible: ts.notImplemented,
isLateBound: function (_node) { return false; },
collectLinkedAliases: ts.notImplemented,
isImplementationOfOverload: ts.notImplemented,
isRequiredInitializedParameter: ts.notImplemented,
isOptionalUninitializedParameterProperty: ts.notImplemented,
isExpandoFunctionDeclaration: ts.notImplemented,
getPropertiesOfContainerFunction: ts.notImplemented,
createTypeOfDeclaration: ts.notImplemented,
createReturnTypeOfSignatureDeclaration: ts.notImplemented,
createTypeOfExpression: ts.notImplemented,
createLiteralConstValue: ts.notImplemented,
isSymbolAccessible: ts.notImplemented,
isEntityNameVisible: ts.notImplemented,
// Returns the constant value this property access resolves to: notImplemented, or 'undefined' for a non-constant
getConstantValue: ts.notImplemented,
getReferencedValueDeclaration: ts.notImplemented,
getTypeReferenceSerializationKind: ts.notImplemented,
isOptionalParameter: ts.notImplemented,
moduleExportsSomeValue: ts.notImplemented,
isArgumentsLocalBinding: ts.notImplemented,
getExternalModuleFileFromDeclaration: ts.notImplemented,
getTypeReferenceDirectivesForEntityName: ts.notImplemented,
getTypeReferenceDirectivesForSymbol: ts.notImplemented,
isLiteralConstDeclaration: ts.notImplemented,
getJsxFactoryEntity: ts.notImplemented,
getJsxFragmentFactoryEntity: ts.notImplemented,
getAllAccessorDeclarations: ts.notImplemented,
getSymbolOfExternalModuleSpecifier: ts.notImplemented,
isBindingCapturedByNode: ts.notImplemented,
getDeclarationStatementsForSourceFile: ts.notImplemented,
isImportRequiredByAugmentation: ts.notImplemented,
};
function createSourceFilesFromBundleBuildInfo(bundle, buildInfoDirectory, host) {
var _a;
var jsBundle = ts.Debug.checkDefined(bundle.js);
var prologueMap = ((_a = jsBundle.sources) === null || _a === void 0 ? void 0 : _a.prologues) && ts.arrayToMap(jsBundle.sources.prologues, function (prologueInfo) { return prologueInfo.file; });
return bundle.sourceFiles.map(function (fileName, index) {
var _a, _b;
var prologueInfo = prologueMap === null || prologueMap === void 0 ? void 0 : prologueMap.get(index);
var statements = prologueInfo === null || prologueInfo === void 0 ? void 0 : prologueInfo.directives.map(function (directive) {
var literal = ts.setTextRange(ts.factory.createStringLiteral(directive.expression.text), directive.expression);
var statement = ts.setTextRange(ts.factory.createExpressionStatement(literal), directive);
ts.setParent(literal, statement);
return statement;
});
var eofToken = ts.factory.createToken(1 /* EndOfFileToken */);
var sourceFile = ts.factory.createSourceFile(statements !== null && statements !== void 0 ? statements : [], eofToken, 0 /* None */);
sourceFile.fileName = ts.getRelativePathFromDirectory(host.getCurrentDirectory(), ts.getNormalizedAbsolutePath(fileName, buildInfoDirectory), !host.useCaseSensitiveFileNames());
sourceFile.text = (_a = prologueInfo === null || prologueInfo === void 0 ? void 0 : prologueInfo.text) !== null && _a !== void 0 ? _a : "";
ts.setTextRangePosWidth(sourceFile, 0, (_b = prologueInfo === null || prologueInfo === void 0 ? void 0 : prologueInfo.text.length) !== null && _b !== void 0 ? _b : 0);
ts.setEachParent(sourceFile.statements, sourceFile);
ts.setTextRangePosWidth(eofToken, sourceFile.end, 0);
ts.setParent(eofToken, sourceFile);
return sourceFile;
});
}
/*@internal*/
function emitUsingBuildInfo(config, host, getCommandLine, customTransformers) {
var _a = getOutputPathsForBundle(config.options, /*forceDtsPaths*/ false), buildInfoPath = _a.buildInfoPath, jsFilePath = _a.jsFilePath, sourceMapFilePath = _a.sourceMapFilePath, declarationFilePath = _a.declarationFilePath, declarationMapPath = _a.declarationMapPath;
var buildInfoText = host.readFile(ts.Debug.checkDefined(buildInfoPath));
if (!buildInfoText)
return buildInfoPath;
var jsFileText = host.readFile(ts.Debug.checkDefined(jsFilePath));
if (!jsFileText)
return jsFilePath;
var sourceMapText = sourceMapFilePath && host.readFile(sourceMapFilePath);
// error if no source map or for now if inline sourcemap
if ((sourceMapFilePath && !sourceMapText) || config.options.inlineSourceMap)
return sourceMapFilePath || "inline sourcemap decoding";
// read declaration text
var declarationText = declarationFilePath && host.readFile(declarationFilePath);
if (declarationFilePath && !declarationText)
return declarationFilePath;
var declarationMapText = declarationMapPath && host.readFile(declarationMapPath);
// error if no source map or for now if inline sourcemap
if ((declarationMapPath && !declarationMapText) || config.options.inlineSourceMap)
return declarationMapPath || "inline sourcemap decoding";
var buildInfo = getBuildInfo(buildInfoText);
if (!buildInfo.bundle || !buildInfo.bundle.js || (declarationText && !buildInfo.bundle.dts))
return buildInfoPath;
var buildInfoDirectory = ts.getDirectoryPath(ts.getNormalizedAbsolutePath(buildInfoPath, host.getCurrentDirectory()));
var ownPrependInput = ts.createInputFiles(jsFileText, declarationText, sourceMapFilePath, sourceMapText, declarationMapPath, declarationMapText, jsFilePath, declarationFilePath, buildInfoPath, buildInfo,
/*onlyOwnText*/ true);
var outputFiles = [];
var prependNodes = ts.createPrependNodes(config.projectReferences, getCommandLine, function (f) { return host.readFile(f); });
var sourceFilesForJsEmit = createSourceFilesFromBundleBuildInfo(buildInfo.bundle, buildInfoDirectory, host);
var emitHost = {
getPrependNodes: ts.memoize(function () { return __spreadArray(__spreadArray([], prependNodes, true), [ownPrependInput], false); }),
getCanonicalFileName: host.getCanonicalFileName,
getCommonSourceDirectory: function () { return ts.getNormalizedAbsolutePath(buildInfo.bundle.commonSourceDirectory, buildInfoDirectory); },
getCompilerOptions: function () { return config.options; },
getCurrentDirectory: function () { return host.getCurrentDirectory(); },
getNewLine: function () { return host.getNewLine(); },
getSourceFile: ts.returnUndefined,
getSourceFileByPath: ts.returnUndefined,
getSourceFiles: function () { return sourceFilesForJsEmit; },
getLibFileFromReference: ts.notImplemented,
isSourceFileFromExternalLibrary: ts.returnFalse,
getResolvedProjectReferenceToRedirect: ts.returnUndefined,
getProjectReferenceRedirect: ts.returnUndefined,
isSourceOfProjectReferenceRedirect: ts.returnFalse,
writeFile: function (name, text, writeByteOrderMark) {
switch (name) {
case jsFilePath:
if (jsFileText === text)
return;
break;
case sourceMapFilePath:
if (sourceMapText === text)
return;
break;
case buildInfoPath:
var newBuildInfo = getBuildInfo(text);
newBuildInfo.program = buildInfo.program;
// Update sourceFileInfo
var _a = buildInfo.bundle, js = _a.js, dts = _a.dts, sourceFiles = _a.sourceFiles;
newBuildInfo.bundle.js.sources = js.sources;
if (dts) {
newBuildInfo.bundle.dts.sources = dts.sources;
}
newBuildInfo.bundle.sourceFiles = sourceFiles;
outputFiles.push({ name: name, text: getBuildInfoText(newBuildInfo), writeByteOrderMark: writeByteOrderMark });
return;
case declarationFilePath:
if (declarationText === text)
return;
break;
case declarationMapPath:
if (declarationMapText === text)
return;
break;
default:
ts.Debug.fail("Unexpected path: " + name);
}
outputFiles.push({ name: name, text: text, writeByteOrderMark: writeByteOrderMark });
},
isEmitBlocked: ts.returnFalse,
readFile: function (f) { return host.readFile(f); },
fileExists: function (f) { return host.fileExists(f); },
useCaseSensitiveFileNames: function () { return host.useCaseSensitiveFileNames(); },
getProgramBuildInfo: ts.returnUndefined,
getSourceFileFromReference: ts.returnUndefined,
redirectTargetsMap: ts.createMultiMap(),
getFileIncludeReasons: ts.notImplemented,
};
emitFiles(ts.notImplementedResolver, emitHost,
/*targetSourceFile*/ undefined, ts.getTransformers(config.options, customTransformers));
return outputFiles;
}
ts.emitUsingBuildInfo = emitUsingBuildInfo;
var PipelinePhase;
(function (PipelinePhase) {
PipelinePhase[PipelinePhase["Notification"] = 0] = "Notification";
PipelinePhase[PipelinePhase["Substitution"] = 1] = "Substitution";
PipelinePhase[PipelinePhase["Comments"] = 2] = "Comments";
PipelinePhase[PipelinePhase["SourceMaps"] = 3] = "SourceMaps";
PipelinePhase[PipelinePhase["Emit"] = 4] = "Emit";
})(PipelinePhase || (PipelinePhase = {}));
function createPrinter(printerOptions, handlers) {
if (printerOptions === void 0) { printerOptions = {}; }
if (handlers === void 0) { handlers = {}; }
var hasGlobalName = handlers.hasGlobalName, _a = handlers.onEmitNode, onEmitNode = _a === void 0 ? ts.noEmitNotification : _a, isEmitNotificationEnabled = handlers.isEmitNotificationEnabled, _b = handlers.substituteNode, substituteNode = _b === void 0 ? ts.noEmitSubstitution : _b, onBeforeEmitNode = handlers.onBeforeEmitNode, onAfterEmitNode = handlers.onAfterEmitNode, onBeforeEmitNodeArray = handlers.onBeforeEmitNodeArray, onAfterEmitNodeArray = handlers.onAfterEmitNodeArray, onBeforeEmitToken = handlers.onBeforeEmitToken, onAfterEmitToken = handlers.onAfterEmitToken;
var extendedDiagnostics = !!printerOptions.extendedDiagnostics;
var newLine = ts.getNewLineCharacter(printerOptions);
var moduleKind = ts.getEmitModuleKind(printerOptions);
var bundledHelpers = new ts.Map();
var currentSourceFile;
var nodeIdToGeneratedName; // Map of generated names for specific nodes.
var autoGeneratedIdToGeneratedName; // Map of generated names for temp and loop variables.
var generatedNames; // Set of names generated by the NameGenerator.
var tempFlagsStack; // Stack of enclosing name generation scopes.
var tempFlags; // TempFlags for the current name generation scope.
var reservedNamesStack; // Stack of TempFlags reserved in enclosing name generation scopes.
var reservedNames; // TempFlags to reserve in nested name generation scopes.
var preserveSourceNewlines = printerOptions.preserveSourceNewlines; // Can be overridden inside nodes with the `IgnoreSourceNewlines` emit flag.
var nextListElementPos; // See comment in `getLeadingLineTerminatorCount`.
var writer;
var ownWriter; // Reusable `EmitTextWriter` for basic printing.
var write = writeBase;
var isOwnFileEmit;
var bundleFileInfo = printerOptions.writeBundleFileInfo ? { sections: [] } : undefined;
var relativeToBuildInfo = bundleFileInfo ? ts.Debug.checkDefined(printerOptions.relativeToBuildInfo) : undefined;
var recordInternalSection = printerOptions.recordInternalSection;
var sourceFileTextPos = 0;
var sourceFileTextKind = "text" /* Text */;
// Source Maps
var sourceMapsDisabled = true;
var sourceMapGenerator;
var sourceMapSource;
var sourceMapSourceIndex = -1;
var mostRecentlyAddedSourceMapSource;
var mostRecentlyAddedSourceMapSourceIndex = -1;
// Comments
var containerPos = -1;
var containerEnd = -1;
var declarationListContainerEnd = -1;
var currentLineMap;
var detachedCommentsInfo;
var hasWrittenComment = false;
var commentsDisabled = !!printerOptions.removeComments;
var lastSubstitution;
var currentParenthesizerRule;
var _c = ts.performance.createTimerIf(extendedDiagnostics, "commentTime", "beforeComment", "afterComment"), enterComment = _c.enter, exitComment = _c.exit;
var parenthesizer = ts.factory.parenthesizer;
var emitBinaryExpression = createEmitBinaryExpression();
reset();
return {
// public API
printNode: printNode,
printList: printList,
printFile: printFile,
printBundle: printBundle,
// internal API
writeNode: writeNode,
writeList: writeList,
writeFile: writeFile,
writeBundle: writeBundle,
bundleFileInfo: bundleFileInfo
};
function printNode(hint, node, sourceFile) {
switch (hint) {
case 0 /* SourceFile */:
ts.Debug.assert(ts.isSourceFile(node), "Expected a SourceFile node.");
break;
case 2 /* IdentifierName */:
ts.Debug.assert(ts.isIdentifier(node), "Expected an Identifier node.");
break;
case 1 /* Expression */:
ts.Debug.assert(ts.isExpression(node), "Expected an Expression node.");
break;
}
switch (node.kind) {
case 300 /* SourceFile */: return printFile(node);
case 301 /* Bundle */: return printBundle(node);
case 302 /* UnparsedSource */: return printUnparsedSource(node);
}
writeNode(hint, node, sourceFile, beginPrint());
return endPrint();
}
function printList(format, nodes, sourceFile) {
writeList(format, nodes, sourceFile, beginPrint());
return endPrint();
}
function printBundle(bundle) {
writeBundle(bundle, beginPrint(), /*sourceMapEmitter*/ undefined);
return endPrint();
}
function printFile(sourceFile) {
writeFile(sourceFile, beginPrint(), /*sourceMapEmitter*/ undefined);
return endPrint();
}
function printUnparsedSource(unparsed) {
writeUnparsedSource(unparsed, beginPrint());
return endPrint();
}
function writeNode(hint, node, sourceFile, output) {
var previousWriter = writer;
setWriter(output, /*_sourceMapGenerator*/ undefined);
print(hint, node, sourceFile);
reset();
writer = previousWriter;
}
function writeList(format, nodes, sourceFile, output) {
var previousWriter = writer;
setWriter(output, /*_sourceMapGenerator*/ undefined);
if (sourceFile) {
setSourceFile(sourceFile);
}
emitList(/*parentNode*/ undefined, nodes, format);
reset();
writer = previousWriter;
}
function getTextPosWithWriteLine() {
return writer.getTextPosWithWriteLine ? writer.getTextPosWithWriteLine() : writer.getTextPos();
}
function updateOrPushBundleFileTextLike(pos, end, kind) {
var last = ts.lastOrUndefined(bundleFileInfo.sections);
if (last && last.kind === kind) {
last.end = end;
}
else {
bundleFileInfo.sections.push({ pos: pos, end: end, kind: kind });
}
}
function recordBundleFileInternalSectionStart(node) {
if (recordInternalSection &&
bundleFileInfo &&
currentSourceFile &&
(ts.isDeclaration(node) || ts.isVariableStatement(node)) &&
ts.isInternalDeclaration(node, currentSourceFile) &&
sourceFileTextKind !== "internal" /* Internal */) {
var prevSourceFileTextKind = sourceFileTextKind;
recordBundleFileTextLikeSection(writer.getTextPos());
sourceFileTextPos = getTextPosWithWriteLine();
sourceFileTextKind = "internal" /* Internal */;
return prevSourceFileTextKind;
}
return undefined;
}
function recordBundleFileInternalSectionEnd(prevSourceFileTextKind) {
if (prevSourceFileTextKind) {
recordBundleFileTextLikeSection(writer.getTextPos());
sourceFileTextPos = getTextPosWithWriteLine();
sourceFileTextKind = prevSourceFileTextKind;
}
}
function recordBundleFileTextLikeSection(end) {
if (sourceFileTextPos < end) {
updateOrPushBundleFileTextLike(sourceFileTextPos, end, sourceFileTextKind);
return true;
}
return false;
}
function writeBundle(bundle, output, sourceMapGenerator) {
var _a;
isOwnFileEmit = false;
var previousWriter = writer;
setWriter(output, sourceMapGenerator);
emitShebangIfNeeded(bundle);
emitPrologueDirectivesIfNeeded(bundle);
emitHelpers(bundle);
emitSyntheticTripleSlashReferencesIfNeeded(bundle);
for (var _b = 0, _c = bundle.prepends; _b < _c.length; _b++) {
var prepend = _c[_b];
writeLine();
var pos = writer.getTextPos();
var savedSections = bundleFileInfo && bundleFileInfo.sections;
if (savedSections)
bundleFileInfo.sections = [];
print(4 /* Unspecified */, prepend, /*sourceFile*/ undefined);
if (bundleFileInfo) {
var newSections = bundleFileInfo.sections;
bundleFileInfo.sections = savedSections;
if (prepend.oldFileOfCurrentEmit)
(_a = bundleFileInfo.sections).push.apply(_a, newSections);
else {
newSections.forEach(function (section) { return ts.Debug.assert(ts.isBundleFileTextLike(section)); });
bundleFileInfo.sections.push({
pos: pos,
end: writer.getTextPos(),
kind: "prepend" /* Prepend */,
data: relativeToBuildInfo(prepend.fileName),
texts: newSections
});
}
}
}
sourceFileTextPos = getTextPosWithWriteLine();
for (var _d = 0, _e = bundle.sourceFiles; _d < _e.length; _d++) {
var sourceFile = _e[_d];
print(0 /* SourceFile */, sourceFile, sourceFile);
}
if (bundleFileInfo && bundle.sourceFiles.length) {
var end = writer.getTextPos();
if (recordBundleFileTextLikeSection(end)) {
// Store prologues
var prologues = getPrologueDirectivesFromBundledSourceFiles(bundle);
if (prologues) {
if (!bundleFileInfo.sources)
bundleFileInfo.sources = {};
bundleFileInfo.sources.prologues = prologues;
}
// Store helpes
var helpers = getHelpersFromBundledSourceFiles(bundle);
if (helpers) {
if (!bundleFileInfo.sources)
bundleFileInfo.sources = {};
bundleFileInfo.sources.helpers = helpers;
}
}
}
reset();
writer = previousWriter;
}
function writeUnparsedSource(unparsed, output) {
var previousWriter = writer;
setWriter(output, /*_sourceMapGenerator*/ undefined);
print(4 /* Unspecified */, unparsed, /*sourceFile*/ undefined);
reset();
writer = previousWriter;
}
function writeFile(sourceFile, output, sourceMapGenerator) {
isOwnFileEmit = true;
var previousWriter = writer;
setWriter(output, sourceMapGenerator);
emitShebangIfNeeded(sourceFile);
emitPrologueDirectivesIfNeeded(sourceFile);
print(0 /* SourceFile */, sourceFile, sourceFile);
reset();
writer = previousWriter;
}
function beginPrint() {
return ownWriter || (ownWriter = ts.createTextWriter(newLine));
}
function endPrint() {
var text = ownWriter.getText();
ownWriter.clear();
return text;
}
function print(hint, node, sourceFile) {
if (sourceFile) {
setSourceFile(sourceFile);
}
pipelineEmit(hint, node, /*parenthesizerRule*/ undefined);
}
function setSourceFile(sourceFile) {
currentSourceFile = sourceFile;
currentLineMap = undefined;
detachedCommentsInfo = undefined;
if (sourceFile) {
setSourceMapSource(sourceFile);
}
}
function setWriter(_writer, _sourceMapGenerator) {
if (_writer && printerOptions.omitTrailingSemicolon) {
_writer = ts.getTrailingSemicolonDeferringWriter(_writer);
}
writer = _writer; // TODO: GH#18217
sourceMapGenerator = _sourceMapGenerator;
sourceMapsDisabled = !writer || !sourceMapGenerator;
}
function reset() {
nodeIdToGeneratedName = [];
autoGeneratedIdToGeneratedName = [];
generatedNames = new ts.Set();
tempFlagsStack = [];
tempFlags = 0 /* Auto */;
reservedNamesStack = [];
currentSourceFile = undefined;
currentLineMap = undefined;
detachedCommentsInfo = undefined;
setWriter(/*output*/ undefined, /*_sourceMapGenerator*/ undefined);
}
function getCurrentLineMap() {
return currentLineMap || (currentLineMap = ts.getLineStarts(currentSourceFile));
}
function emit(node, parenthesizerRule) {
if (node === undefined)
return;
var prevSourceFileTextKind = recordBundleFileInternalSectionStart(node);
pipelineEmit(4 /* Unspecified */, node, parenthesizerRule);
recordBundleFileInternalSectionEnd(prevSourceFileTextKind);
}
function emitIdentifierName(node) {
if (node === undefined)
return;
pipelineEmit(2 /* IdentifierName */, node, /*parenthesizerRule*/ undefined);
}
function emitExpression(node, parenthesizerRule) {
if (node === undefined)
return;
pipelineEmit(1 /* Expression */, node, parenthesizerRule);
}
function emitJsxAttributeValue(node) {
pipelineEmit(ts.isStringLiteral(node) ? 6 /* JsxAttributeValue */ : 4 /* Unspecified */, node);
}
function beforeEmitNode(node) {
if (preserveSourceNewlines && (ts.getEmitFlags(node) & 134217728 /* IgnoreSourceNewlines */)) {
preserveSourceNewlines = false;
}
}
function afterEmitNode(savedPreserveSourceNewlines) {
preserveSourceNewlines = savedPreserveSourceNewlines;
}
function pipelineEmit(emitHint, node, parenthesizerRule) {
currentParenthesizerRule = parenthesizerRule;
var pipelinePhase = getPipelinePhase(0 /* Notification */, emitHint, node);
pipelinePhase(emitHint, node);
currentParenthesizerRule = undefined;
}
function shouldEmitComments(node) {
return !commentsDisabled && !ts.isSourceFile(node);
}
function shouldEmitSourceMaps(node) {
return !sourceMapsDisabled &&
!ts.isSourceFile(node) &&
!ts.isInJsonFile(node) &&
!ts.isUnparsedSource(node) &&
!ts.isUnparsedPrepend(node);
}
function getPipelinePhase(phase, emitHint, node) {
switch (phase) {
case 0 /* Notification */:
if (onEmitNode !== ts.noEmitNotification && (!isEmitNotificationEnabled || isEmitNotificationEnabled(node))) {
return pipelineEmitWithNotification;
}
// falls through
case 1 /* Substitution */:
if (substituteNode !== ts.noEmitSubstitution && (lastSubstitution = substituteNode(emitHint, node) || node) !== node) {
if (currentParenthesizerRule) {
lastSubstitution = currentParenthesizerRule(lastSubstitution);
}
return pipelineEmitWithSubstitution;
}
// falls through
case 2 /* Comments */:
if (shouldEmitComments(node)) {
return pipelineEmitWithComments;
}
// falls through
case 3 /* SourceMaps */:
if (shouldEmitSourceMaps(node)) {
return pipelineEmitWithSourceMaps;
}
// falls through
case 4 /* Emit */:
return pipelineEmitWithHint;
default:
return ts.Debug.assertNever(phase);
}
}
function getNextPipelinePhase(currentPhase, emitHint, node) {
return getPipelinePhase(currentPhase + 1, emitHint, node);
}
function pipelineEmitWithNotification(hint, node) {
var pipelinePhase = getNextPipelinePhase(0 /* Notification */, hint, node);
onEmitNode(hint, node, pipelinePhase);
}
function pipelineEmitWithHint(hint, node) {
onBeforeEmitNode === null || onBeforeEmitNode === void 0 ? void 0 : onBeforeEmitNode(node);
if (preserveSourceNewlines) {
var savedPreserveSourceNewlines = preserveSourceNewlines;
beforeEmitNode(node);
pipelineEmitWithHintWorker(hint, node);
afterEmitNode(savedPreserveSourceNewlines);
}
else {
pipelineEmitWithHintWorker(hint, node);
}
onAfterEmitNode === null || onAfterEmitNode === void 0 ? void 0 : onAfterEmitNode(node);
// clear the parenthesizer rule as we ascend
currentParenthesizerRule = undefined;
}
function pipelineEmitWithHintWorker(hint, node) {
if (hint === 0 /* SourceFile */)
return emitSourceFile(ts.cast(node, ts.isSourceFile));
if (hint === 2 /* IdentifierName */)
return emitIdentifier(ts.cast(node, ts.isIdentifier));
if (hint === 6 /* JsxAttributeValue */)
return emitLiteral(ts.cast(node, ts.isStringLiteral), /*jsxAttributeEscape*/ true);
if (hint === 3 /* MappedTypeParameter */)
return emitMappedTypeParameter(ts.cast(node, ts.isTypeParameterDeclaration));
if (hint === 5 /* EmbeddedStatement */) {
ts.Debug.assertNode(node, ts.isEmptyStatement);
return emitEmptyStatement(/*isEmbeddedStatement*/ true);
}
if (hint === 4 /* Unspecified */) {
switch (node.kind) {
// Pseudo-literals
case 15 /* TemplateHead */:
case 16 /* TemplateMiddle */:
case 17 /* TemplateTail */:
return emitLiteral(node, /*jsxAttributeEscape*/ false);
// Identifiers
case 79 /* Identifier */:
return emitIdentifier(node);
// PrivateIdentifiers
case 80 /* PrivateIdentifier */:
return emitPrivateIdentifier(node);
// Parse tree nodes
// Names
case 159 /* QualifiedName */:
return emitQualifiedName(node);
case 160 /* ComputedPropertyName */:
return emitComputedPropertyName(node);
// Signature elements
case 161 /* TypeParameter */:
return emitTypeParameter(node);
case 162 /* Parameter */:
return emitParameter(node);
case 163 /* Decorator */:
return emitDecorator(node);
// Type members
case 164 /* PropertySignature */:
return emitPropertySignature(node);
case 165 /* PropertyDeclaration */:
return emitPropertyDeclaration(node);
case 166 /* MethodSignature */:
return emitMethodSignature(node);
case 167 /* MethodDeclaration */:
return emitMethodDeclaration(node);
case 168 /* ClassStaticBlockDeclaration */:
return emitClassStaticBlockDeclaration(node);
case 169 /* Constructor */:
return emitConstructor(node);
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return emitAccessorDeclaration(node);
case 172 /* CallSignature */:
return emitCallSignature(node);
case 173 /* ConstructSignature */:
return emitConstructSignature(node);
case 174 /* IndexSignature */:
return emitIndexSignature(node);
// Types
case 175 /* TypePredicate */:
return emitTypePredicate(node);
case 176 /* TypeReference */:
return emitTypeReference(node);
case 177 /* FunctionType */:
return emitFunctionType(node);
case 178 /* ConstructorType */:
return emitConstructorType(node);
case 179 /* TypeQuery */:
return emitTypeQuery(node);
case 180 /* TypeLiteral */:
return emitTypeLiteral(node);
case 181 /* ArrayType */:
return emitArrayType(node);
case 182 /* TupleType */:
return emitTupleType(node);
case 183 /* OptionalType */:
return emitOptionalType(node);
// SyntaxKind.RestType is handled below
case 185 /* UnionType */:
return emitUnionType(node);
case 186 /* IntersectionType */:
return emitIntersectionType(node);
case 187 /* ConditionalType */:
return emitConditionalType(node);
case 188 /* InferType */:
return emitInferType(node);
case 189 /* ParenthesizedType */:
return emitParenthesizedType(node);
case 226 /* ExpressionWithTypeArguments */:
return emitExpressionWithTypeArguments(node);
case 190 /* ThisType */:
return emitThisType();
case 191 /* TypeOperator */:
return emitTypeOperator(node);
case 192 /* IndexedAccessType */:
return emitIndexedAccessType(node);
case 193 /* MappedType */:
return emitMappedType(node);
case 194 /* LiteralType */:
return emitLiteralType(node);
case 195 /* NamedTupleMember */:
return emitNamedTupleMember(node);
case 196 /* TemplateLiteralType */:
return emitTemplateType(node);
case 197 /* TemplateLiteralTypeSpan */:
return emitTemplateTypeSpan(node);
case 198 /* ImportType */:
return emitImportTypeNode(node);
// Binding patterns
case 199 /* ObjectBindingPattern */:
return emitObjectBindingPattern(node);
case 200 /* ArrayBindingPattern */:
return emitArrayBindingPattern(node);
case 201 /* BindingElement */:
return emitBindingElement(node);
// Misc
case 231 /* TemplateSpan */:
return emitTemplateSpan(node);
case 232 /* SemicolonClassElement */:
return emitSemicolonClassElement();
// Statements
case 233 /* Block */:
return emitBlock(node);
case 235 /* VariableStatement */:
return emitVariableStatement(node);
case 234 /* EmptyStatement */:
return emitEmptyStatement(/*isEmbeddedStatement*/ false);
case 236 /* ExpressionStatement */:
return emitExpressionStatement(node);
case 237 /* IfStatement */:
return emitIfStatement(node);
case 238 /* DoStatement */:
return emitDoStatement(node);
case 239 /* WhileStatement */:
return emitWhileStatement(node);
case 240 /* ForStatement */:
return emitForStatement(node);
case 241 /* ForInStatement */:
return emitForInStatement(node);
case 242 /* ForOfStatement */:
return emitForOfStatement(node);
case 243 /* ContinueStatement */:
return emitContinueStatement(node);
case 244 /* BreakStatement */:
return emitBreakStatement(node);
case 245 /* ReturnStatement */:
return emitReturnStatement(node);
case 246 /* WithStatement */:
return emitWithStatement(node);
case 247 /* SwitchStatement */:
return emitSwitchStatement(node);
case 248 /* LabeledStatement */:
return emitLabeledStatement(node);
case 249 /* ThrowStatement */:
return emitThrowStatement(node);
case 250 /* TryStatement */:
return emitTryStatement(node);
case 251 /* DebuggerStatement */:
return emitDebuggerStatement(node);
// Declarations
case 252 /* VariableDeclaration */:
return emitVariableDeclaration(node);
case 253 /* VariableDeclarationList */:
return emitVariableDeclarationList(node);
case 254 /* FunctionDeclaration */:
return emitFunctionDeclaration(node);
case 255 /* ClassDeclaration */:
return emitClassDeclaration(node);
case 256 /* InterfaceDeclaration */:
return emitInterfaceDeclaration(node);
case 257 /* TypeAliasDeclaration */:
return emitTypeAliasDeclaration(node);
case 258 /* EnumDeclaration */:
return emitEnumDeclaration(node);
case 259 /* ModuleDeclaration */:
return emitModuleDeclaration(node);
case 260 /* ModuleBlock */:
return emitModuleBlock(node);
case 261 /* CaseBlock */:
return emitCaseBlock(node);
case 262 /* NamespaceExportDeclaration */:
return emitNamespaceExportDeclaration(node);
case 263 /* ImportEqualsDeclaration */:
return emitImportEqualsDeclaration(node);
case 264 /* ImportDeclaration */:
return emitImportDeclaration(node);
case 265 /* ImportClause */:
return emitImportClause(node);
case 266 /* NamespaceImport */:
return emitNamespaceImport(node);
case 272 /* NamespaceExport */:
return emitNamespaceExport(node);
case 267 /* NamedImports */:
return emitNamedImports(node);
case 268 /* ImportSpecifier */:
return emitImportSpecifier(node);
case 269 /* ExportAssignment */:
return emitExportAssignment(node);
case 270 /* ExportDeclaration */:
return emitExportDeclaration(node);
case 271 /* NamedExports */:
return emitNamedExports(node);
case 273 /* ExportSpecifier */:
return emitExportSpecifier(node);
case 274 /* MissingDeclaration */:
return;
// Module references
case 275 /* ExternalModuleReference */:
return emitExternalModuleReference(node);
// JSX (non-expression)
case 11 /* JsxText */:
return emitJsxText(node);
case 278 /* JsxOpeningElement */:
case 281 /* JsxOpeningFragment */:
return emitJsxOpeningElementOrFragment(node);
case 279 /* JsxClosingElement */:
case 282 /* JsxClosingFragment */:
return emitJsxClosingElementOrFragment(node);
case 283 /* JsxAttribute */:
return emitJsxAttribute(node);
case 284 /* JsxAttributes */:
return emitJsxAttributes(node);
case 285 /* JsxSpreadAttribute */:
return emitJsxSpreadAttribute(node);
case 286 /* JsxExpression */:
return emitJsxExpression(node);
// Clauses
case 287 /* CaseClause */:
return emitCaseClause(node);
case 288 /* DefaultClause */:
return emitDefaultClause(node);
case 289 /* HeritageClause */:
return emitHeritageClause(node);
case 290 /* CatchClause */:
return emitCatchClause(node);
// Property assignments
case 291 /* PropertyAssignment */:
return emitPropertyAssignment(node);
case 292 /* ShorthandPropertyAssignment */:
return emitShorthandPropertyAssignment(node);
case 293 /* SpreadAssignment */:
return emitSpreadAssignment(node);
// Enum
case 294 /* EnumMember */:
return emitEnumMember(node);
// Unparsed
case 295 /* UnparsedPrologue */:
return writeUnparsedNode(node);
case 302 /* UnparsedSource */:
case 296 /* UnparsedPrepend */:
return emitUnparsedSourceOrPrepend(node);
case 297 /* UnparsedText */:
case 298 /* UnparsedInternalText */:
return emitUnparsedTextLike(node);
case 299 /* UnparsedSyntheticReference */:
return emitUnparsedSyntheticReference(node);
// Top-level nodes
case 300 /* SourceFile */:
return emitSourceFile(node);
case 301 /* Bundle */:
return ts.Debug.fail("Bundles should be printed using printBundle");
// SyntaxKind.UnparsedSource (handled above)
case 303 /* InputFiles */:
return ts.Debug.fail("InputFiles should not be printed");
// JSDoc nodes (only used in codefixes currently)
case 304 /* JSDocTypeExpression */:
return emitJSDocTypeExpression(node);
case 305 /* JSDocNameReference */:
return emitJSDocNameReference(node);
case 307 /* JSDocAllType */:
return writePunctuation("*");
case 308 /* JSDocUnknownType */:
return writePunctuation("?");
case 309 /* JSDocNullableType */:
return emitJSDocNullableType(node);
case 310 /* JSDocNonNullableType */:
return emitJSDocNonNullableType(node);
case 311 /* JSDocOptionalType */:
return emitJSDocOptionalType(node);
case 312 /* JSDocFunctionType */:
return emitJSDocFunctionType(node);
case 184 /* RestType */:
case 313 /* JSDocVariadicType */:
return emitRestOrJSDocVariadicType(node);
case 314 /* JSDocNamepathType */:
return;
case 315 /* JSDocComment */:
return emitJSDoc(node);
case 317 /* JSDocTypeLiteral */:
return emitJSDocTypeLiteral(node);
case 318 /* JSDocSignature */:
return emitJSDocSignature(node);
case 322 /* JSDocTag */:
case 327 /* JSDocClassTag */:
return emitJSDocSimpleTag(node);
case 323 /* JSDocAugmentsTag */:
case 324 /* JSDocImplementsTag */:
return emitJSDocHeritageTag(node);
case 325 /* JSDocAuthorTag */:
case 326 /* JSDocDeprecatedTag */:
return;
// SyntaxKind.JSDocClassTag (see JSDocTag, above)
case 328 /* JSDocPublicTag */:
case 329 /* JSDocPrivateTag */:
case 330 /* JSDocProtectedTag */:
case 331 /* JSDocReadonlyTag */:
case 332 /* JSDocOverrideTag */:
return;
case 333 /* JSDocCallbackTag */:
return emitJSDocCallbackTag(node);
// SyntaxKind.JSDocEnumTag (see below)
case 335 /* JSDocParameterTag */:
case 342 /* JSDocPropertyTag */:
return emitJSDocPropertyLikeTag(node);
case 334 /* JSDocEnumTag */:
case 336 /* JSDocReturnTag */:
case 337 /* JSDocThisTag */:
case 338 /* JSDocTypeTag */:
return emitJSDocSimpleTypedTag(node);
case 339 /* JSDocTemplateTag */:
return emitJSDocTemplateTag(node);
case 340 /* JSDocTypedefTag */:
return emitJSDocTypedefTag(node);
case 341 /* JSDocSeeTag */:
return emitJSDocSeeTag(node);
// SyntaxKind.JSDocPropertyTag (see JSDocParameterTag, above)
// Transformation nodes
case 344 /* NotEmittedStatement */:
case 348 /* EndOfDeclarationMarker */:
case 347 /* MergeDeclarationMarker */:
return;
}
if (ts.isExpression(node)) {
hint = 1 /* Expression */;
if (substituteNode !== ts.noEmitSubstitution) {
var substitute = substituteNode(hint, node) || node;
if (substitute !== node) {
node = substitute;
if (currentParenthesizerRule) {
node = currentParenthesizerRule(node);
}
}
}
}
}
if (hint === 1 /* Expression */) {
switch (node.kind) {
// Literals
case 8 /* NumericLiteral */:
case 9 /* BigIntLiteral */:
return emitNumericOrBigIntLiteral(node);
case 10 /* StringLiteral */:
case 13 /* RegularExpressionLiteral */:
case 14 /* NoSubstitutionTemplateLiteral */:
return emitLiteral(node, /*jsxAttributeEscape*/ false);
// Identifiers
case 79 /* Identifier */:
return emitIdentifier(node);
// Expressions
case 202 /* ArrayLiteralExpression */:
return emitArrayLiteralExpression(node);
case 203 /* ObjectLiteralExpression */:
return emitObjectLiteralExpression(node);
case 204 /* PropertyAccessExpression */:
return emitPropertyAccessExpression(node);
case 205 /* ElementAccessExpression */:
return emitElementAccessExpression(node);
case 206 /* CallExpression */:
return emitCallExpression(node);
case 207 /* NewExpression */:
return emitNewExpression(node);
case 208 /* TaggedTemplateExpression */:
return emitTaggedTemplateExpression(node);
case 209 /* TypeAssertionExpression */:
return emitTypeAssertionExpression(node);
case 210 /* ParenthesizedExpression */:
return emitParenthesizedExpression(node);
case 211 /* FunctionExpression */:
return emitFunctionExpression(node);
case 212 /* ArrowFunction */:
return emitArrowFunction(node);
case 213 /* DeleteExpression */:
return emitDeleteExpression(node);
case 214 /* TypeOfExpression */:
return emitTypeOfExpression(node);
case 215 /* VoidExpression */:
return emitVoidExpression(node);
case 216 /* AwaitExpression */:
return emitAwaitExpression(node);
case 217 /* PrefixUnaryExpression */:
return emitPrefixUnaryExpression(node);
case 218 /* PostfixUnaryExpression */:
return emitPostfixUnaryExpression(node);
case 219 /* BinaryExpression */:
return emitBinaryExpression(node);
case 220 /* ConditionalExpression */:
return emitConditionalExpression(node);
case 221 /* TemplateExpression */:
return emitTemplateExpression(node);
case 222 /* YieldExpression */:
return emitYieldExpression(node);
case 223 /* SpreadElement */:
return emitSpreadElement(node);
case 224 /* ClassExpression */:
return emitClassExpression(node);
case 225 /* OmittedExpression */:
return;
case 227 /* AsExpression */:
return emitAsExpression(node);
case 228 /* NonNullExpression */:
return emitNonNullExpression(node);
case 229 /* MetaProperty */:
return emitMetaProperty(node);
case 230 /* SyntheticExpression */:
return ts.Debug.fail("SyntheticExpression should never be printed.");
// JSX
case 276 /* JsxElement */:
return emitJsxElement(node);
case 277 /* JsxSelfClosingElement */:
return emitJsxSelfClosingElement(node);
case 280 /* JsxFragment */:
return emitJsxFragment(node);
// Synthesized list
case 343 /* SyntaxList */:
return ts.Debug.fail("SyntaxList should not be printed");
// Transformation nodes
case 344 /* NotEmittedStatement */:
return;
case 345 /* PartiallyEmittedExpression */:
return emitPartiallyEmittedExpression(node);
case 346 /* CommaListExpression */:
return emitCommaList(node);
case 347 /* MergeDeclarationMarker */:
case 348 /* EndOfDeclarationMarker */:
return;
case 349 /* SyntheticReferenceExpression */:
return ts.Debug.fail("SyntheticReferenceExpression should not be printed");
}
}
if (ts.isKeyword(node.kind))
return writeTokenNode(node, writeKeyword);
if (ts.isTokenKind(node.kind))
return writeTokenNode(node, writePunctuation);
ts.Debug.fail("Unhandled SyntaxKind: " + ts.Debug.formatSyntaxKind(node.kind) + ".");
}
function emitMappedTypeParameter(node) {
emit(node.name);
writeSpace();
writeKeyword("in");
writeSpace();
emit(node.constraint);
}
function pipelineEmitWithSubstitution(hint, node) {
var pipelinePhase = getNextPipelinePhase(1 /* Substitution */, hint, node);
ts.Debug.assertIsDefined(lastSubstitution);
node = lastSubstitution;
lastSubstitution = undefined;
pipelinePhase(hint, node);
}
function getHelpersFromBundledSourceFiles(bundle) {
var result;
if (moduleKind === ts.ModuleKind.None || printerOptions.noEmitHelpers) {
return undefined;
}
var bundledHelpers = new ts.Map();
for (var _a = 0, _b = bundle.sourceFiles; _a < _b.length; _a++) {
var sourceFile = _b[_a];
var shouldSkip = ts.getExternalHelpersModuleName(sourceFile) !== undefined;
var helpers = getSortedEmitHelpers(sourceFile);
if (!helpers)
continue;
for (var _c = 0, helpers_5 = helpers; _c < helpers_5.length; _c++) {
var helper = helpers_5[_c];
if (!helper.scoped && !shouldSkip && !bundledHelpers.get(helper.name)) {
bundledHelpers.set(helper.name, true);
(result || (result = [])).push(helper.name);
}
}
}
return result;
}
function emitHelpers(node) {
var helpersEmitted = false;
var bundle = node.kind === 301 /* Bundle */ ? node : undefined;
if (bundle && moduleKind === ts.ModuleKind.None) {
return;
}
var numPrepends = bundle ? bundle.prepends.length : 0;
var numNodes = bundle ? bundle.sourceFiles.length + numPrepends : 1;
for (var i = 0; i < numNodes; i++) {
var currentNode = bundle ? i < numPrepends ? bundle.prepends[i] : bundle.sourceFiles[i - numPrepends] : node;
var sourceFile = ts.isSourceFile(currentNode) ? currentNode : ts.isUnparsedSource(currentNode) ? undefined : currentSourceFile;
var shouldSkip = printerOptions.noEmitHelpers || (!!sourceFile && ts.hasRecordedExternalHelpers(sourceFile));
var shouldBundle = (ts.isSourceFile(currentNode) || ts.isUnparsedSource(currentNode)) && !isOwnFileEmit;
var helpers = ts.isUnparsedSource(currentNode) ? currentNode.helpers : getSortedEmitHelpers(currentNode);
if (helpers) {
for (var _a = 0, helpers_6 = helpers; _a < helpers_6.length; _a++) {
var helper = helpers_6[_a];
if (!helper.scoped) {
// Skip the helper if it can be skipped and the noEmitHelpers compiler
// option is set, or if it can be imported and the importHelpers compiler
// option is set.
if (shouldSkip)
continue;
// Skip the helper if it can be bundled but hasn't already been emitted and we
// are emitting a bundled module.
if (shouldBundle) {
if (bundledHelpers.get(helper.name)) {
continue;
}
bundledHelpers.set(helper.name, true);
}
}
else if (bundle) {
// Skip the helper if it is scoped and we are emitting bundled helpers
continue;
}
var pos = getTextPosWithWriteLine();
if (typeof helper.text === "string") {
writeLines(helper.text);
}
else {
writeLines(helper.text(makeFileLevelOptimisticUniqueName));
}
if (bundleFileInfo)
bundleFileInfo.sections.push({ pos: pos, end: writer.getTextPos(), kind: "emitHelpers" /* EmitHelpers */, data: helper.name });
helpersEmitted = true;
}
}
}
return helpersEmitted;
}
function getSortedEmitHelpers(node) {
var helpers = ts.getEmitHelpers(node);
return helpers && ts.stableSort(helpers, ts.compareEmitHelpers);
}
//
// Literals/Pseudo-literals
//
// SyntaxKind.NumericLiteral
// SyntaxKind.BigIntLiteral
function emitNumericOrBigIntLiteral(node) {
emitLiteral(node, /*jsxAttributeEscape*/ false);
}
// SyntaxKind.StringLiteral
// SyntaxKind.RegularExpressionLiteral
// SyntaxKind.NoSubstitutionTemplateLiteral
// SyntaxKind.TemplateHead
// SyntaxKind.TemplateMiddle
// SyntaxKind.TemplateTail
function emitLiteral(node, jsxAttributeEscape) {
var text = getLiteralTextOfNode(node, printerOptions.neverAsciiEscape, jsxAttributeEscape);
if ((printerOptions.sourceMap || printerOptions.inlineSourceMap)
&& (node.kind === 10 /* StringLiteral */ || ts.isTemplateLiteralKind(node.kind))) {
writeLiteral(text);
}
else {
// Quick info expects all literals to be called with writeStringLiteral, as there's no specific type for numberLiterals
writeStringLiteral(text);
}
}
// SyntaxKind.UnparsedSource
// SyntaxKind.UnparsedPrepend
function emitUnparsedSourceOrPrepend(unparsed) {
for (var _a = 0, _b = unparsed.texts; _a < _b.length; _a++) {
var text = _b[_a];
writeLine();
emit(text);
}
}
// SyntaxKind.UnparsedPrologue
// SyntaxKind.UnparsedText
// SyntaxKind.UnparsedInternal
// SyntaxKind.UnparsedSyntheticReference
function writeUnparsedNode(unparsed) {
writer.rawWrite(unparsed.parent.text.substring(unparsed.pos, unparsed.end));
}
// SyntaxKind.UnparsedText
// SyntaxKind.UnparsedInternal
function emitUnparsedTextLike(unparsed) {
var pos = getTextPosWithWriteLine();
writeUnparsedNode(unparsed);
if (bundleFileInfo) {
updateOrPushBundleFileTextLike(pos, writer.getTextPos(), unparsed.kind === 297 /* UnparsedText */ ?
"text" /* Text */ :
"internal" /* Internal */);
}
}
// SyntaxKind.UnparsedSyntheticReference
function emitUnparsedSyntheticReference(unparsed) {
var pos = getTextPosWithWriteLine();
writeUnparsedNode(unparsed);
if (bundleFileInfo) {
var section = ts.clone(unparsed.section);
section.pos = pos;
section.end = writer.getTextPos();
bundleFileInfo.sections.push(section);
}
}
//
// Identifiers
//
function emitIdentifier(node) {
var writeText = node.symbol ? writeSymbol : write;
writeText(getTextOfNode(node, /*includeTrivia*/ false), node.symbol);
emitList(node, node.typeArguments, 53776 /* TypeParameters */); // Call emitList directly since it could be an array of TypeParameterDeclarations _or_ type arguments
}
//
// Names
//
function emitPrivateIdentifier(node) {
var writeText = node.symbol ? writeSymbol : write;
writeText(getTextOfNode(node, /*includeTrivia*/ false), node.symbol);
}
function emitQualifiedName(node) {
emitEntityName(node.left);
writePunctuation(".");
emit(node.right);
}
function emitEntityName(node) {
if (node.kind === 79 /* Identifier */) {
emitExpression(node);
}
else {
emit(node);
}
}
function emitComputedPropertyName(node) {
writePunctuation("[");
emitExpression(node.expression, parenthesizer.parenthesizeExpressionOfComputedPropertyName);
writePunctuation("]");
}
//
// Signature elements
//
function emitTypeParameter(node) {
emit(node.name);
if (node.constraint) {
writeSpace();
writeKeyword("extends");
writeSpace();
emit(node.constraint);
}
if (node.default) {
writeSpace();
writeOperator("=");
writeSpace();
emit(node.default);
}
}
function emitParameter(node) {
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
emit(node.dotDotDotToken);
emitNodeWithWriter(node.name, writeParameter);
emit(node.questionToken);
if (node.parent && node.parent.kind === 312 /* JSDocFunctionType */ && !node.name) {
emit(node.type);
}
else {
emitTypeAnnotation(node.type);
}
// The comment position has to fallback to any present node within the parameterdeclaration because as it turns out, the parser can make parameter declarations with _just_ an initializer.
emitInitializer(node.initializer, node.type ? node.type.end : node.questionToken ? node.questionToken.end : node.name ? node.name.end : node.modifiers ? node.modifiers.end : node.decorators ? node.decorators.end : node.pos, node, parenthesizer.parenthesizeExpressionForDisallowedComma);
}
function emitDecorator(decorator) {
writePunctuation("@");
emitExpression(decorator.expression, parenthesizer.parenthesizeLeftSideOfAccess);
}
//
// Type members
//
function emitPropertySignature(node) {
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
emitNodeWithWriter(node.name, writeProperty);
emit(node.questionToken);
emitTypeAnnotation(node.type);
writeTrailingSemicolon();
}
function emitPropertyDeclaration(node) {
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
emit(node.name);
emit(node.questionToken);
emit(node.exclamationToken);
emitTypeAnnotation(node.type);
emitInitializer(node.initializer, node.type ? node.type.end : node.questionToken ? node.questionToken.end : node.name.end, node);
writeTrailingSemicolon();
}
function emitMethodSignature(node) {
pushNameGenerationScope(node);
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
emit(node.name);
emit(node.questionToken);
emitTypeParameters(node, node.typeParameters);
emitParameters(node, node.parameters);
emitTypeAnnotation(node.type);
writeTrailingSemicolon();
popNameGenerationScope(node);
}
function emitMethodDeclaration(node) {
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
emit(node.asteriskToken);
emit(node.name);
emit(node.questionToken);
emitSignatureAndBody(node, emitSignatureHead);
}
function emitClassStaticBlockDeclaration(node) {
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
writeKeyword("static");
emitBlockFunctionBody(node.body);
}
function emitConstructor(node) {
emitModifiers(node, node.modifiers);
writeKeyword("constructor");
emitSignatureAndBody(node, emitSignatureHead);
}
function emitAccessorDeclaration(node) {
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
writeKeyword(node.kind === 170 /* GetAccessor */ ? "get" : "set");
writeSpace();
emit(node.name);
emitSignatureAndBody(node, emitSignatureHead);
}
function emitCallSignature(node) {
pushNameGenerationScope(node);
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
emitTypeParameters(node, node.typeParameters);
emitParameters(node, node.parameters);
emitTypeAnnotation(node.type);
writeTrailingSemicolon();
popNameGenerationScope(node);
}
function emitConstructSignature(node) {
pushNameGenerationScope(node);
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
writeKeyword("new");
writeSpace();
emitTypeParameters(node, node.typeParameters);
emitParameters(node, node.parameters);
emitTypeAnnotation(node.type);
writeTrailingSemicolon();
popNameGenerationScope(node);
}
function emitIndexSignature(node) {
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
emitParametersForIndexSignature(node, node.parameters);
emitTypeAnnotation(node.type);
writeTrailingSemicolon();
}
function emitTemplateTypeSpan(node) {
emit(node.type);
emit(node.literal);
}
function emitSemicolonClassElement() {
writeTrailingSemicolon();
}
//
// Types
//
function emitTypePredicate(node) {
if (node.assertsModifier) {
emit(node.assertsModifier);
writeSpace();
}
emit(node.parameterName);
if (node.type) {
writeSpace();
writeKeyword("is");
writeSpace();
emit(node.type);
}
}
function emitTypeReference(node) {
emit(node.typeName);
emitTypeArguments(node, node.typeArguments);
}
function emitFunctionType(node) {
pushNameGenerationScope(node);
emitTypeParameters(node, node.typeParameters);
emitParametersForArrow(node, node.parameters);
writeSpace();
writePunctuation("=>");
writeSpace();
emit(node.type);
popNameGenerationScope(node);
}
function emitJSDocFunctionType(node) {
writeKeyword("function");
emitParameters(node, node.parameters);
writePunctuation(":");
emit(node.type);
}
function emitJSDocNullableType(node) {
writePunctuation("?");
emit(node.type);
}
function emitJSDocNonNullableType(node) {
writePunctuation("!");
emit(node.type);
}
function emitJSDocOptionalType(node) {
emit(node.type);
writePunctuation("=");
}
function emitConstructorType(node) {
pushNameGenerationScope(node);
emitModifiers(node, node.modifiers);
writeKeyword("new");
writeSpace();
emitTypeParameters(node, node.typeParameters);
emitParameters(node, node.parameters);
writeSpace();
writePunctuation("=>");
writeSpace();
emit(node.type);
popNameGenerationScope(node);
}
function emitTypeQuery(node) {
writeKeyword("typeof");
writeSpace();
emit(node.exprName);
}
function emitTypeLiteral(node) {
writePunctuation("{");
var flags = ts.getEmitFlags(node) & 1 /* SingleLine */ ? 768 /* SingleLineTypeLiteralMembers */ : 32897 /* MultiLineTypeLiteralMembers */;
emitList(node, node.members, flags | 524288 /* NoSpaceIfEmpty */);
writePunctuation("}");
}
function emitArrayType(node) {
emit(node.elementType, parenthesizer.parenthesizeElementTypeOfArrayType);
writePunctuation("[");
writePunctuation("]");
}
function emitRestOrJSDocVariadicType(node) {
writePunctuation("...");
emit(node.type);
}
function emitTupleType(node) {
emitTokenWithComment(22 /* OpenBracketToken */, node.pos, writePunctuation, node);
var flags = ts.getEmitFlags(node) & 1 /* SingleLine */ ? 528 /* SingleLineTupleTypeElements */ : 657 /* MultiLineTupleTypeElements */;
emitList(node, node.elements, flags | 524288 /* NoSpaceIfEmpty */);
emitTokenWithComment(23 /* CloseBracketToken */, node.elements.end, writePunctuation, node);
}
function emitNamedTupleMember(node) {
emit(node.dotDotDotToken);
emit(node.name);
emit(node.questionToken);
emitTokenWithComment(58 /* ColonToken */, node.name.end, writePunctuation, node);
writeSpace();
emit(node.type);
}
function emitOptionalType(node) {
emit(node.type, parenthesizer.parenthesizeElementTypeOfArrayType);
writePunctuation("?");
}
function emitUnionType(node) {
emitList(node, node.types, 516 /* UnionTypeConstituents */, parenthesizer.parenthesizeMemberOfElementType);
}
function emitIntersectionType(node) {
emitList(node, node.types, 520 /* IntersectionTypeConstituents */, parenthesizer.parenthesizeMemberOfElementType);
}
function emitConditionalType(node) {
emit(node.checkType, parenthesizer.parenthesizeMemberOfConditionalType);
writeSpace();
writeKeyword("extends");
writeSpace();
emit(node.extendsType, parenthesizer.parenthesizeMemberOfConditionalType);
writeSpace();
writePunctuation("?");
writeSpace();
emit(node.trueType);
writeSpace();
writePunctuation(":");
writeSpace();
emit(node.falseType);
}
function emitInferType(node) {
writeKeyword("infer");
writeSpace();
emit(node.typeParameter);
}
function emitParenthesizedType(node) {
writePunctuation("(");
emit(node.type);
writePunctuation(")");
}
function emitThisType() {
writeKeyword("this");
}
function emitTypeOperator(node) {
writeTokenText(node.operator, writeKeyword);
writeSpace();
emit(node.type, parenthesizer.parenthesizeMemberOfElementType);
}
function emitIndexedAccessType(node) {
emit(node.objectType, parenthesizer.parenthesizeMemberOfElementType);
writePunctuation("[");
emit(node.indexType);
writePunctuation("]");
}
function emitMappedType(node) {
var emitFlags = ts.getEmitFlags(node);
writePunctuation("{");
if (emitFlags & 1 /* SingleLine */) {
writeSpace();
}
else {
writeLine();
increaseIndent();
}
if (node.readonlyToken) {
emit(node.readonlyToken);
if (node.readonlyToken.kind !== 143 /* ReadonlyKeyword */) {
writeKeyword("readonly");
}
writeSpace();
}
writePunctuation("[");
pipelineEmit(3 /* MappedTypeParameter */, node.typeParameter);
if (node.nameType) {
writeSpace();
writeKeyword("as");
writeSpace();
emit(node.nameType);
}
writePunctuation("]");
if (node.questionToken) {
emit(node.questionToken);
if (node.questionToken.kind !== 57 /* QuestionToken */) {
writePunctuation("?");
}
}
writePunctuation(":");
writeSpace();
emit(node.type);
writeTrailingSemicolon();
if (emitFlags & 1 /* SingleLine */) {
writeSpace();
}
else {
writeLine();
decreaseIndent();
}
writePunctuation("}");
}
function emitLiteralType(node) {
emitExpression(node.literal);
}
function emitTemplateType(node) {
emit(node.head);
emitList(node, node.templateSpans, 262144 /* TemplateExpressionSpans */);
}
function emitImportTypeNode(node) {
if (node.isTypeOf) {
writeKeyword("typeof");
writeSpace();
}
writeKeyword("import");
writePunctuation("(");
emit(node.argument);
writePunctuation(")");
if (node.qualifier) {
writePunctuation(".");
emit(node.qualifier);
}
emitTypeArguments(node, node.typeArguments);
}
//
// Binding patterns
//
function emitObjectBindingPattern(node) {
writePunctuation("{");
emitList(node, node.elements, 525136 /* ObjectBindingPatternElements */);
writePunctuation("}");
}
function emitArrayBindingPattern(node) {
writePunctuation("[");
emitList(node, node.elements, 524880 /* ArrayBindingPatternElements */);
writePunctuation("]");
}
function emitBindingElement(node) {
emit(node.dotDotDotToken);
if (node.propertyName) {
emit(node.propertyName);
writePunctuation(":");
writeSpace();
}
emit(node.name);
emitInitializer(node.initializer, node.name.end, node, parenthesizer.parenthesizeExpressionForDisallowedComma);
}
//
// Expressions
//
function emitArrayLiteralExpression(node) {
var elements = node.elements;
var preferNewLine = node.multiLine ? 65536 /* PreferNewLine */ : 0 /* None */;
emitExpressionList(node, elements, 8914 /* ArrayLiteralExpressionElements */ | preferNewLine, parenthesizer.parenthesizeExpressionForDisallowedComma);
}
function emitObjectLiteralExpression(node) {
ts.forEach(node.properties, generateMemberNames);
var indentedFlag = ts.getEmitFlags(node) & 65536 /* Indented */;
if (indentedFlag) {
increaseIndent();
}
var preferNewLine = node.multiLine ? 65536 /* PreferNewLine */ : 0 /* None */;
var allowTrailingComma = currentSourceFile.languageVersion >= 1 /* ES5 */ && !ts.isJsonSourceFile(currentSourceFile) ? 64 /* AllowTrailingComma */ : 0 /* None */;
emitList(node, node.properties, 526226 /* ObjectLiteralExpressionProperties */ | allowTrailingComma | preferNewLine);
if (indentedFlag) {
decreaseIndent();
}
}
function emitPropertyAccessExpression(node) {
emitExpression(node.expression, parenthesizer.parenthesizeLeftSideOfAccess);
var token = node.questionDotToken || ts.setTextRangePosEnd(ts.factory.createToken(24 /* DotToken */), node.expression.end, node.name.pos);
var linesBeforeDot = getLinesBetweenNodes(node, node.expression, token);
var linesAfterDot = getLinesBetweenNodes(node, token, node.name);
writeLinesAndIndent(linesBeforeDot, /*writeSpaceIfNotIndenting*/ false);
var shouldEmitDotDot = token.kind !== 28 /* QuestionDotToken */ &&
mayNeedDotDotForPropertyAccess(node.expression) &&
!writer.hasTrailingComment() &&
!writer.hasTrailingWhitespace();
if (shouldEmitDotDot) {
writePunctuation(".");
}
if (node.questionDotToken) {
emit(token);
}
else {
emitTokenWithComment(token.kind, node.expression.end, writePunctuation, node);
}
writeLinesAndIndent(linesAfterDot, /*writeSpaceIfNotIndenting*/ false);
emit(node.name);
decreaseIndentIf(linesBeforeDot, linesAfterDot);
}
// 1..toString is a valid property access, emit a dot after the literal
// Also emit a dot if expression is a integer const enum value - it will appear in generated code as numeric literal
function mayNeedDotDotForPropertyAccess(expression) {
expression = ts.skipPartiallyEmittedExpressions(expression);
if (ts.isNumericLiteral(expression)) {
// check if numeric literal is a decimal literal that was originally written with a dot
var text = getLiteralTextOfNode(expression, /*neverAsciiEscape*/ true, /*jsxAttributeEscape*/ false);
// If he number will be printed verbatim and it doesn't already contain a dot, add one
// if the expression doesn't have any comments that will be emitted.
return !expression.numericLiteralFlags && !ts.stringContains(text, ts.tokenToString(24 /* DotToken */));
}
else if (ts.isAccessExpression(expression)) {
// check if constant enum value is integer
var constantValue = ts.getConstantValue(expression);
// isFinite handles cases when constantValue is undefined
return typeof constantValue === "number" && isFinite(constantValue)
&& Math.floor(constantValue) === constantValue;
}
}
function emitElementAccessExpression(node) {
emitExpression(node.expression, parenthesizer.parenthesizeLeftSideOfAccess);
emit(node.questionDotToken);
emitTokenWithComment(22 /* OpenBracketToken */, node.expression.end, writePunctuation, node);
emitExpression(node.argumentExpression);
emitTokenWithComment(23 /* CloseBracketToken */, node.argumentExpression.end, writePunctuation, node);
}
function emitCallExpression(node) {
var indirectCall = ts.getEmitFlags(node) & 536870912 /* IndirectCall */;
if (indirectCall) {
writePunctuation("(");
writeLiteral("0");
writePunctuation(",");
writeSpace();
}
emitExpression(node.expression, parenthesizer.parenthesizeLeftSideOfAccess);
if (indirectCall) {
writePunctuation(")");
}
emit(node.questionDotToken);
emitTypeArguments(node, node.typeArguments);
emitExpressionList(node, node.arguments, 2576 /* CallExpressionArguments */, parenthesizer.parenthesizeExpressionForDisallowedComma);
}
function emitNewExpression(node) {
emitTokenWithComment(103 /* NewKeyword */, node.pos, writeKeyword, node);
writeSpace();
emitExpression(node.expression, parenthesizer.parenthesizeExpressionOfNew);
emitTypeArguments(node, node.typeArguments);
emitExpressionList(node, node.arguments, 18960 /* NewExpressionArguments */, parenthesizer.parenthesizeExpressionForDisallowedComma);
}
function emitTaggedTemplateExpression(node) {
var indirectCall = ts.getEmitFlags(node) & 536870912 /* IndirectCall */;
if (indirectCall) {
writePunctuation("(");
writeLiteral("0");
writePunctuation(",");
writeSpace();
}
emitExpression(node.tag, parenthesizer.parenthesizeLeftSideOfAccess);
if (indirectCall) {
writePunctuation(")");
}
emitTypeArguments(node, node.typeArguments);
writeSpace();
emitExpression(node.template);
}
function emitTypeAssertionExpression(node) {
writePunctuation("<");
emit(node.type);
writePunctuation(">");
emitExpression(node.expression, parenthesizer.parenthesizeOperandOfPrefixUnary);
}
function emitParenthesizedExpression(node) {
var openParenPos = emitTokenWithComment(20 /* OpenParenToken */, node.pos, writePunctuation, node);
var indented = writeLineSeparatorsAndIndentBefore(node.expression, node);
emitExpression(node.expression, /*parenthesizerRules*/ undefined);
writeLineSeparatorsAfter(node.expression, node);
decreaseIndentIf(indented);
emitTokenWithComment(21 /* CloseParenToken */, node.expression ? node.expression.end : openParenPos, writePunctuation, node);
}
function emitFunctionExpression(node) {
generateNameIfNeeded(node.name);
emitFunctionDeclarationOrExpression(node);
}
function emitArrowFunction(node) {
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
emitSignatureAndBody(node, emitArrowFunctionHead);
}
function emitArrowFunctionHead(node) {
emitTypeParameters(node, node.typeParameters);
emitParametersForArrow(node, node.parameters);
emitTypeAnnotation(node.type);
writeSpace();
emit(node.equalsGreaterThanToken);
}
function emitDeleteExpression(node) {
emitTokenWithComment(89 /* DeleteKeyword */, node.pos, writeKeyword, node);
writeSpace();
emitExpression(node.expression, parenthesizer.parenthesizeOperandOfPrefixUnary);
}
function emitTypeOfExpression(node) {
emitTokenWithComment(112 /* TypeOfKeyword */, node.pos, writeKeyword, node);
writeSpace();
emitExpression(node.expression, parenthesizer.parenthesizeOperandOfPrefixUnary);
}
function emitVoidExpression(node) {
emitTokenWithComment(114 /* VoidKeyword */, node.pos, writeKeyword, node);
writeSpace();
emitExpression(node.expression, parenthesizer.parenthesizeOperandOfPrefixUnary);
}
function emitAwaitExpression(node) {
emitTokenWithComment(131 /* AwaitKeyword */, node.pos, writeKeyword, node);
writeSpace();
emitExpression(node.expression, parenthesizer.parenthesizeOperandOfPrefixUnary);
}
function emitPrefixUnaryExpression(node) {
writeTokenText(node.operator, writeOperator);
if (shouldEmitWhitespaceBeforeOperand(node)) {
writeSpace();
}
emitExpression(node.operand, parenthesizer.parenthesizeOperandOfPrefixUnary);
}
function shouldEmitWhitespaceBeforeOperand(node) {
// In some cases, we need to emit a space between the operator and the operand. One obvious case
// is when the operator is an identifier, like delete or typeof. We also need to do this for plus
// and minus expressions in certain cases. Specifically, consider the following two cases (parens
// are just for clarity of exposition, and not part of the source code):
//
// (+(+1))
// (+(++1))
//
// We need to emit a space in both cases. In the first case, the absence of a space will make
// the resulting expression a prefix increment operation. And in the second, it will make the resulting
// expression a prefix increment whose operand is a plus expression - (++(+x))
// The same is true of minus of course.
var operand = node.operand;
return operand.kind === 217 /* PrefixUnaryExpression */
&& ((node.operator === 39 /* PlusToken */ && (operand.operator === 39 /* PlusToken */ || operand.operator === 45 /* PlusPlusToken */))
|| (node.operator === 40 /* MinusToken */ && (operand.operator === 40 /* MinusToken */ || operand.operator === 46 /* MinusMinusToken */)));
}
function emitPostfixUnaryExpression(node) {
emitExpression(node.operand, parenthesizer.parenthesizeOperandOfPostfixUnary);
writeTokenText(node.operator, writeOperator);
}
function createEmitBinaryExpression() {
return ts.createBinaryExpressionTrampoline(onEnter, onLeft, onOperator, onRight, onExit, /*foldState*/ undefined);
function onEnter(node, state) {
if (state) {
state.stackIndex++;
state.preserveSourceNewlinesStack[state.stackIndex] = preserveSourceNewlines;
state.containerPosStack[state.stackIndex] = containerPos;
state.containerEndStack[state.stackIndex] = containerEnd;
state.declarationListContainerEndStack[state.stackIndex] = declarationListContainerEnd;
var emitComments_1 = state.shouldEmitCommentsStack[state.stackIndex] = shouldEmitComments(node);
var emitSourceMaps = state.shouldEmitSourceMapsStack[state.stackIndex] = shouldEmitSourceMaps(node);
onBeforeEmitNode === null || onBeforeEmitNode === void 0 ? void 0 : onBeforeEmitNode(node);
if (emitComments_1)
emitCommentsBeforeNode(node);
if (emitSourceMaps)
emitSourceMapsBeforeNode(node);
beforeEmitNode(node);
}
else {
state = {
stackIndex: 0,
preserveSourceNewlinesStack: [undefined],
containerPosStack: [-1],
containerEndStack: [-1],
declarationListContainerEndStack: [-1],
shouldEmitCommentsStack: [false],
shouldEmitSourceMapsStack: [false],
};
}
return state;
}
function onLeft(next, _workArea, parent) {
return maybeEmitExpression(next, parent, "left");
}
function onOperator(operatorToken, _state, node) {
var isCommaOperator = operatorToken.kind !== 27 /* CommaToken */;
var linesBeforeOperator = getLinesBetweenNodes(node, node.left, operatorToken);
var linesAfterOperator = getLinesBetweenNodes(node, operatorToken, node.right);
writeLinesAndIndent(linesBeforeOperator, isCommaOperator);
emitLeadingCommentsOfPosition(operatorToken.pos);
writeTokenNode(operatorToken, operatorToken.kind === 101 /* InKeyword */ ? writeKeyword : writeOperator);
emitTrailingCommentsOfPosition(operatorToken.end, /*prefixSpace*/ true); // Binary operators should have a space before the comment starts
writeLinesAndIndent(linesAfterOperator, /*writeSpaceIfNotIndenting*/ true);
}
function onRight(next, _workArea, parent) {
return maybeEmitExpression(next, parent, "right");
}
function onExit(node, state) {
var linesBeforeOperator = getLinesBetweenNodes(node, node.left, node.operatorToken);
var linesAfterOperator = getLinesBetweenNodes(node, node.operatorToken, node.right);
decreaseIndentIf(linesBeforeOperator, linesAfterOperator);
if (state.stackIndex > 0) {
var savedPreserveSourceNewlines = state.preserveSourceNewlinesStack[state.stackIndex];
var savedContainerPos = state.containerPosStack[state.stackIndex];
var savedContainerEnd = state.containerEndStack[state.stackIndex];
var savedDeclarationListContainerEnd = state.declarationListContainerEndStack[state.stackIndex];
var shouldEmitComments_1 = state.shouldEmitCommentsStack[state.stackIndex];
var shouldEmitSourceMaps_1 = state.shouldEmitSourceMapsStack[state.stackIndex];
afterEmitNode(savedPreserveSourceNewlines);
if (shouldEmitSourceMaps_1)
emitSourceMapsAfterNode(node);
if (shouldEmitComments_1)
emitCommentsAfterNode(node, savedContainerPos, savedContainerEnd, savedDeclarationListContainerEnd);
onAfterEmitNode === null || onAfterEmitNode === void 0 ? void 0 : onAfterEmitNode(node);
state.stackIndex--;
}
}
function maybeEmitExpression(next, parent, side) {
var parenthesizerRule = side === "left" ?
parenthesizer.getParenthesizeLeftSideOfBinaryForOperator(parent.operatorToken.kind) :
parenthesizer.getParenthesizeRightSideOfBinaryForOperator(parent.operatorToken.kind);
var pipelinePhase = getPipelinePhase(0 /* Notification */, 1 /* Expression */, next);
if (pipelinePhase === pipelineEmitWithSubstitution) {
ts.Debug.assertIsDefined(lastSubstitution);
next = parenthesizerRule(ts.cast(lastSubstitution, ts.isExpression));
pipelinePhase = getNextPipelinePhase(1 /* Substitution */, 1 /* Expression */, next);
lastSubstitution = undefined;
}
if (pipelinePhase === pipelineEmitWithComments ||
pipelinePhase === pipelineEmitWithSourceMaps ||
pipelinePhase === pipelineEmitWithHint) {
if (ts.isBinaryExpression(next)) {
return next;
}
}
currentParenthesizerRule = parenthesizerRule;
pipelinePhase(1 /* Expression */, next);
}
}
function emitConditionalExpression(node) {
var linesBeforeQuestion = getLinesBetweenNodes(node, node.condition, node.questionToken);
var linesAfterQuestion = getLinesBetweenNodes(node, node.questionToken, node.whenTrue);
var linesBeforeColon = getLinesBetweenNodes(node, node.whenTrue, node.colonToken);
var linesAfterColon = getLinesBetweenNodes(node, node.colonToken, node.whenFalse);
emitExpression(node.condition, parenthesizer.parenthesizeConditionOfConditionalExpression);
writeLinesAndIndent(linesBeforeQuestion, /*writeSpaceIfNotIndenting*/ true);
emit(node.questionToken);
writeLinesAndIndent(linesAfterQuestion, /*writeSpaceIfNotIndenting*/ true);
emitExpression(node.whenTrue, parenthesizer.parenthesizeBranchOfConditionalExpression);
decreaseIndentIf(linesBeforeQuestion, linesAfterQuestion);
writeLinesAndIndent(linesBeforeColon, /*writeSpaceIfNotIndenting*/ true);
emit(node.colonToken);
writeLinesAndIndent(linesAfterColon, /*writeSpaceIfNotIndenting*/ true);
emitExpression(node.whenFalse, parenthesizer.parenthesizeBranchOfConditionalExpression);
decreaseIndentIf(linesBeforeColon, linesAfterColon);
}
function emitTemplateExpression(node) {
emit(node.head);
emitList(node, node.templateSpans, 262144 /* TemplateExpressionSpans */);
}
function emitYieldExpression(node) {
emitTokenWithComment(125 /* YieldKeyword */, node.pos, writeKeyword, node);
emit(node.asteriskToken);
emitExpressionWithLeadingSpace(node.expression, parenthesizer.parenthesizeExpressionForDisallowedComma);
}
function emitSpreadElement(node) {
emitTokenWithComment(25 /* DotDotDotToken */, node.pos, writePunctuation, node);
emitExpression(node.expression, parenthesizer.parenthesizeExpressionForDisallowedComma);
}
function emitClassExpression(node) {
generateNameIfNeeded(node.name);
emitClassDeclarationOrExpression(node);
}
function emitExpressionWithTypeArguments(node) {
emitExpression(node.expression, parenthesizer.parenthesizeLeftSideOfAccess);
emitTypeArguments(node, node.typeArguments);
}
function emitAsExpression(node) {
emitExpression(node.expression, /*parenthesizerRules*/ undefined);
if (node.type) {
writeSpace();
writeKeyword("as");
writeSpace();
emit(node.type);
}
}
function emitNonNullExpression(node) {
emitExpression(node.expression, parenthesizer.parenthesizeLeftSideOfAccess);
writeOperator("!");
}
function emitMetaProperty(node) {
writeToken(node.keywordToken, node.pos, writePunctuation);
writePunctuation(".");
emit(node.name);
}
//
// Misc
//
function emitTemplateSpan(node) {
emitExpression(node.expression);
emit(node.literal);
}
//
// Statements
//
function emitBlock(node) {
emitBlockStatements(node, /*forceSingleLine*/ !node.multiLine && isEmptyBlock(node));
}
function emitBlockStatements(node, forceSingleLine) {
emitTokenWithComment(18 /* OpenBraceToken */, node.pos, writePunctuation, /*contextNode*/ node);
var format = forceSingleLine || ts.getEmitFlags(node) & 1 /* SingleLine */ ? 768 /* SingleLineBlockStatements */ : 129 /* MultiLineBlockStatements */;
emitList(node, node.statements, format);
emitTokenWithComment(19 /* CloseBraceToken */, node.statements.end, writePunctuation, /*contextNode*/ node, /*indentLeading*/ !!(format & 1 /* MultiLine */));
}
function emitVariableStatement(node) {
emitModifiers(node, node.modifiers);
emit(node.declarationList);
writeTrailingSemicolon();
}
function emitEmptyStatement(isEmbeddedStatement) {
// While most trailing semicolons are possibly insignificant, an embedded "empty"
// statement is significant and cannot be elided by a trailing-semicolon-omitting writer.
if (isEmbeddedStatement) {
writePunctuation(";");
}
else {
writeTrailingSemicolon();
}
}
function emitExpressionStatement(node) {
emitExpression(node.expression, parenthesizer.parenthesizeExpressionOfExpressionStatement);
// Emit semicolon in non json files
// or if json file that created synthesized expression(eg.define expression statement when --out and amd code generation)
if (!ts.isJsonSourceFile(currentSourceFile) || ts.nodeIsSynthesized(node.expression)) {
writeTrailingSemicolon();
}
}
function emitIfStatement(node) {
var openParenPos = emitTokenWithComment(99 /* IfKeyword */, node.pos, writeKeyword, node);
writeSpace();
emitTokenWithComment(20 /* OpenParenToken */, openParenPos, writePunctuation, node);
emitExpression(node.expression);
emitTokenWithComment(21 /* CloseParenToken */, node.expression.end, writePunctuation, node);
emitEmbeddedStatement(node, node.thenStatement);
if (node.elseStatement) {
writeLineOrSpace(node, node.thenStatement, node.elseStatement);
emitTokenWithComment(91 /* ElseKeyword */, node.thenStatement.end, writeKeyword, node);
if (node.elseStatement.kind === 237 /* IfStatement */) {
writeSpace();
emit(node.elseStatement);
}
else {
emitEmbeddedStatement(node, node.elseStatement);
}
}
}
function emitWhileClause(node, startPos) {
var openParenPos = emitTokenWithComment(115 /* WhileKeyword */, startPos, writeKeyword, node);
writeSpace();
emitTokenWithComment(20 /* OpenParenToken */, openParenPos, writePunctuation, node);
emitExpression(node.expression);
emitTokenWithComment(21 /* CloseParenToken */, node.expression.end, writePunctuation, node);
}
function emitDoStatement(node) {
emitTokenWithComment(90 /* DoKeyword */, node.pos, writeKeyword, node);
emitEmbeddedStatement(node, node.statement);
if (ts.isBlock(node.statement) && !preserveSourceNewlines) {
writeSpace();
}
else {
writeLineOrSpace(node, node.statement, node.expression);
}
emitWhileClause(node, node.statement.end);
writeTrailingSemicolon();
}
function emitWhileStatement(node) {
emitWhileClause(node, node.pos);
emitEmbeddedStatement(node, node.statement);
}
function emitForStatement(node) {
var openParenPos = emitTokenWithComment(97 /* ForKeyword */, node.pos, writeKeyword, node);
writeSpace();
var pos = emitTokenWithComment(20 /* OpenParenToken */, openParenPos, writePunctuation, /*contextNode*/ node);
emitForBinding(node.initializer);
pos = emitTokenWithComment(26 /* SemicolonToken */, node.initializer ? node.initializer.end : pos, writePunctuation, node);
emitExpressionWithLeadingSpace(node.condition);
pos = emitTokenWithComment(26 /* SemicolonToken */, node.condition ? node.condition.end : pos, writePunctuation, node);
emitExpressionWithLeadingSpace(node.incrementor);
emitTokenWithComment(21 /* CloseParenToken */, node.incrementor ? node.incrementor.end : pos, writePunctuation, node);
emitEmbeddedStatement(node, node.statement);
}
function emitForInStatement(node) {
var openParenPos = emitTokenWithComment(97 /* ForKeyword */, node.pos, writeKeyword, node);
writeSpace();
emitTokenWithComment(20 /* OpenParenToken */, openParenPos, writePunctuation, node);
emitForBinding(node.initializer);
writeSpace();
emitTokenWithComment(101 /* InKeyword */, node.initializer.end, writeKeyword, node);
writeSpace();
emitExpression(node.expression);
emitTokenWithComment(21 /* CloseParenToken */, node.expression.end, writePunctuation, node);
emitEmbeddedStatement(node, node.statement);
}
function emitForOfStatement(node) {
var openParenPos = emitTokenWithComment(97 /* ForKeyword */, node.pos, writeKeyword, node);
writeSpace();
emitWithTrailingSpace(node.awaitModifier);
emitTokenWithComment(20 /* OpenParenToken */, openParenPos, writePunctuation, node);
emitForBinding(node.initializer);
writeSpace();
emitTokenWithComment(158 /* OfKeyword */, node.initializer.end, writeKeyword, node);
writeSpace();
emitExpression(node.expression);
emitTokenWithComment(21 /* CloseParenToken */, node.expression.end, writePunctuation, node);
emitEmbeddedStatement(node, node.statement);
}
function emitForBinding(node) {
if (node !== undefined) {
if (node.kind === 253 /* VariableDeclarationList */) {
emit(node);
}
else {
emitExpression(node);
}
}
}
function emitContinueStatement(node) {
emitTokenWithComment(86 /* ContinueKeyword */, node.pos, writeKeyword, node);
emitWithLeadingSpace(node.label);
writeTrailingSemicolon();
}
function emitBreakStatement(node) {
emitTokenWithComment(81 /* BreakKeyword */, node.pos, writeKeyword, node);
emitWithLeadingSpace(node.label);
writeTrailingSemicolon();
}
function emitTokenWithComment(token, pos, writer, contextNode, indentLeading) {
var node = ts.getParseTreeNode(contextNode);
var isSimilarNode = node && node.kind === contextNode.kind;
var startPos = pos;
if (isSimilarNode && currentSourceFile) {
pos = ts.skipTrivia(currentSourceFile.text, pos);
}
if (isSimilarNode && contextNode.pos !== startPos) {
var needsIndent = indentLeading && currentSourceFile && !ts.positionsAreOnSameLine(startPos, pos, currentSourceFile);
if (needsIndent) {
increaseIndent();
}
emitLeadingCommentsOfPosition(startPos);
if (needsIndent) {
decreaseIndent();
}
}
pos = writeTokenText(token, writer, pos);
if (isSimilarNode && contextNode.end !== pos) {
var isJsxExprContext = contextNode.kind === 286 /* JsxExpression */;
emitTrailingCommentsOfPosition(pos, /*prefixSpace*/ !isJsxExprContext, /*forceNoNewline*/ isJsxExprContext);
}
return pos;
}
function emitReturnStatement(node) {
emitTokenWithComment(105 /* ReturnKeyword */, node.pos, writeKeyword, /*contextNode*/ node);
emitExpressionWithLeadingSpace(node.expression);
writeTrailingSemicolon();
}
function emitWithStatement(node) {
var openParenPos = emitTokenWithComment(116 /* WithKeyword */, node.pos, writeKeyword, node);
writeSpace();
emitTokenWithComment(20 /* OpenParenToken */, openParenPos, writePunctuation, node);
emitExpression(node.expression);
emitTokenWithComment(21 /* CloseParenToken */, node.expression.end, writePunctuation, node);
emitEmbeddedStatement(node, node.statement);
}
function emitSwitchStatement(node) {
var openParenPos = emitTokenWithComment(107 /* SwitchKeyword */, node.pos, writeKeyword, node);
writeSpace();
emitTokenWithComment(20 /* OpenParenToken */, openParenPos, writePunctuation, node);
emitExpression(node.expression);
emitTokenWithComment(21 /* CloseParenToken */, node.expression.end, writePunctuation, node);
writeSpace();
emit(node.caseBlock);
}
function emitLabeledStatement(node) {
emit(node.label);
emitTokenWithComment(58 /* ColonToken */, node.label.end, writePunctuation, node);
writeSpace();
emit(node.statement);
}
function emitThrowStatement(node) {
emitTokenWithComment(109 /* ThrowKeyword */, node.pos, writeKeyword, node);
emitExpressionWithLeadingSpace(node.expression);
writeTrailingSemicolon();
}
function emitTryStatement(node) {
emitTokenWithComment(111 /* TryKeyword */, node.pos, writeKeyword, node);
writeSpace();
emit(node.tryBlock);
if (node.catchClause) {
writeLineOrSpace(node, node.tryBlock, node.catchClause);
emit(node.catchClause);
}
if (node.finallyBlock) {
writeLineOrSpace(node, node.catchClause || node.tryBlock, node.finallyBlock);
emitTokenWithComment(96 /* FinallyKeyword */, (node.catchClause || node.tryBlock).end, writeKeyword, node);
writeSpace();
emit(node.finallyBlock);
}
}
function emitDebuggerStatement(node) {
writeToken(87 /* DebuggerKeyword */, node.pos, writeKeyword);
writeTrailingSemicolon();
}
//
// Declarations
//
function emitVariableDeclaration(node) {
emit(node.name);
emit(node.exclamationToken);
emitTypeAnnotation(node.type);
emitInitializer(node.initializer, node.type ? node.type.end : node.name.end, node, parenthesizer.parenthesizeExpressionForDisallowedComma);
}
function emitVariableDeclarationList(node) {
writeKeyword(ts.isLet(node) ? "let" : ts.isVarConst(node) ? "const" : "var");
writeSpace();
emitList(node, node.declarations, 528 /* VariableDeclarationList */);
}
function emitFunctionDeclaration(node) {
emitFunctionDeclarationOrExpression(node);
}
function emitFunctionDeclarationOrExpression(node) {
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
writeKeyword("function");
emit(node.asteriskToken);
writeSpace();
emitIdentifierName(node.name);
emitSignatureAndBody(node, emitSignatureHead);
}
function emitSignatureAndBody(node, emitSignatureHead) {
var body = node.body;
if (body) {
if (ts.isBlock(body)) {
var indentedFlag = ts.getEmitFlags(node) & 65536 /* Indented */;
if (indentedFlag) {
increaseIndent();
}
pushNameGenerationScope(node);
ts.forEach(node.parameters, generateNames);
generateNames(node.body);
emitSignatureHead(node);
emitBlockFunctionBody(body);
popNameGenerationScope(node);
if (indentedFlag) {
decreaseIndent();
}
}
else {
emitSignatureHead(node);
writeSpace();
emitExpression(body, parenthesizer.parenthesizeConciseBodyOfArrowFunction);
}
}
else {
emitSignatureHead(node);
writeTrailingSemicolon();
}
}
function emitSignatureHead(node) {
emitTypeParameters(node, node.typeParameters);
emitParameters(node, node.parameters);
emitTypeAnnotation(node.type);
}
function shouldEmitBlockFunctionBodyOnSingleLine(body) {
// We must emit a function body as a single-line body in the following case:
// * The body has NodeEmitFlags.SingleLine specified.
// We must emit a function body as a multi-line body in the following cases:
// * The body is explicitly marked as multi-line.
// * A non-synthesized body's start and end position are on different lines.
// * Any statement in the body starts on a new line.
if (ts.getEmitFlags(body) & 1 /* SingleLine */) {
return true;
}
if (body.multiLine) {
return false;
}
if (!ts.nodeIsSynthesized(body) && !ts.rangeIsOnSingleLine(body, currentSourceFile)) {
return false;
}
if (getLeadingLineTerminatorCount(body, body.statements, 2 /* PreserveLines */)
|| getClosingLineTerminatorCount(body, body.statements, 2 /* PreserveLines */)) {
return false;
}
var previousStatement;
for (var _a = 0, _b = body.statements; _a < _b.length; _a++) {
var statement = _b[_a];
if (getSeparatingLineTerminatorCount(previousStatement, statement, 2 /* PreserveLines */) > 0) {
return false;
}
previousStatement = statement;
}
return true;
}
function emitBlockFunctionBody(body) {
onBeforeEmitNode === null || onBeforeEmitNode === void 0 ? void 0 : onBeforeEmitNode(body);
writeSpace();
writePunctuation("{");
increaseIndent();
var emitBlockFunctionBody = shouldEmitBlockFunctionBodyOnSingleLine(body)
? emitBlockFunctionBodyOnSingleLine
: emitBlockFunctionBodyWorker;
if (emitBodyWithDetachedComments) {
emitBodyWithDetachedComments(body, body.statements, emitBlockFunctionBody);
}
else {
emitBlockFunctionBody(body);
}
decreaseIndent();
writeToken(19 /* CloseBraceToken */, body.statements.end, writePunctuation, body);
onAfterEmitNode === null || onAfterEmitNode === void 0 ? void 0 : onAfterEmitNode(body);
}
function emitBlockFunctionBodyOnSingleLine(body) {
emitBlockFunctionBodyWorker(body, /*emitBlockFunctionBodyOnSingleLine*/ true);
}
function emitBlockFunctionBodyWorker(body, emitBlockFunctionBodyOnSingleLine) {
// Emit all the prologue directives (like "use strict").
var statementOffset = emitPrologueDirectives(body.statements);
var pos = writer.getTextPos();
emitHelpers(body);
if (statementOffset === 0 && pos === writer.getTextPos() && emitBlockFunctionBodyOnSingleLine) {
decreaseIndent();
emitList(body, body.statements, 768 /* SingleLineFunctionBodyStatements */);
increaseIndent();
}
else {
emitList(body, body.statements, 1 /* MultiLineFunctionBodyStatements */, /*parenthesizerRule*/ undefined, statementOffset);
}
}
function emitClassDeclaration(node) {
emitClassDeclarationOrExpression(node);
}
function emitClassDeclarationOrExpression(node) {
ts.forEach(node.members, generateMemberNames);
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
writeKeyword("class");
if (node.name) {
writeSpace();
emitIdentifierName(node.name);
}
var indentedFlag = ts.getEmitFlags(node) & 65536 /* Indented */;
if (indentedFlag) {
increaseIndent();
}
emitTypeParameters(node, node.typeParameters);
emitList(node, node.heritageClauses, 0 /* ClassHeritageClauses */);
writeSpace();
writePunctuation("{");
emitList(node, node.members, 129 /* ClassMembers */);
writePunctuation("}");
if (indentedFlag) {
decreaseIndent();
}
}
function emitInterfaceDeclaration(node) {
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
writeKeyword("interface");
writeSpace();
emit(node.name);
emitTypeParameters(node, node.typeParameters);
emitList(node, node.heritageClauses, 512 /* HeritageClauses */);
writeSpace();
writePunctuation("{");
emitList(node, node.members, 129 /* InterfaceMembers */);
writePunctuation("}");
}
function emitTypeAliasDeclaration(node) {
emitDecorators(node, node.decorators);
emitModifiers(node, node.modifiers);
writeKeyword("type");
writeSpace();
emit(node.name);
emitTypeParameters(node, node.typeParameters);
writeSpace();
writePunctuation("=");
writeSpace();
emit(node.type);
writeTrailingSemicolon();
}
function emitEnumDeclaration(node) {
emitModifiers(node, node.modifiers);
writeKeyword("enum");
writeSpace();
emit(node.name);
writeSpace();
writePunctuation("{");
emitList(node, node.members, 145 /* EnumMembers */);
writePunctuation("}");
}
function emitModuleDeclaration(node) {
emitModifiers(node, node.modifiers);
if (~node.flags & 1024 /* GlobalAugmentation */) {
writeKeyword(node.flags & 16 /* Namespace */ ? "namespace" : "module");
writeSpace();
}
emit(node.name);
var body = node.body;
if (!body)
return writeTrailingSemicolon();
while (body && ts.isModuleDeclaration(body)) {
writePunctuation(".");
emit(body.name);
body = body.body;
}
writeSpace();
emit(body);
}
function emitModuleBlock(node) {
pushNameGenerationScope(node);
ts.forEach(node.statements, generateNames);
emitBlockStatements(node, /*forceSingleLine*/ isEmptyBlock(node));
popNameGenerationScope(node);
}
function emitCaseBlock(node) {
emitTokenWithComment(18 /* OpenBraceToken */, node.pos, writePunctuation, node);
emitList(node, node.clauses, 129 /* CaseBlockClauses */);
emitTokenWithComment(19 /* CloseBraceToken */, node.clauses.end, writePunctuation, node, /*indentLeading*/ true);
}
function emitImportEqualsDeclaration(node) {
emitModifiers(node, node.modifiers);
emitTokenWithComment(100 /* ImportKeyword */, node.modifiers ? node.modifiers.end : node.pos, writeKeyword, node);
writeSpace();
if (node.isTypeOnly) {
emitTokenWithComment(150 /* TypeKeyword */, node.pos, writeKeyword, node);
writeSpace();
}
emit(node.name);
writeSpace();
emitTokenWithComment(63 /* EqualsToken */, node.name.end, writePunctuation, node);
writeSpace();
emitModuleReference(node.moduleReference);
writeTrailingSemicolon();
}
function emitModuleReference(node) {
if (node.kind === 79 /* Identifier */) {
emitExpression(node);
}
else {
emit(node);
}
}
function emitImportDeclaration(node) {
emitModifiers(node, node.modifiers);
emitTokenWithComment(100 /* ImportKeyword */, node.modifiers ? node.modifiers.end : node.pos, writeKeyword, node);
writeSpace();
if (node.importClause) {
emit(node.importClause);
writeSpace();
emitTokenWithComment(154 /* FromKeyword */, node.importClause.end, writeKeyword, node);
writeSpace();
}
emitExpression(node.moduleSpecifier);
writeTrailingSemicolon();
}
function emitImportClause(node) {
if (node.isTypeOnly) {
emitTokenWithComment(150 /* TypeKeyword */, node.pos, writeKeyword, node);
writeSpace();
}
emit(node.name);
if (node.name && node.namedBindings) {
emitTokenWithComment(27 /* CommaToken */, node.name.end, writePunctuation, node);
writeSpace();
}
emit(node.namedBindings);
}
function emitNamespaceImport(node) {
var asPos = emitTokenWithComment(41 /* AsteriskToken */, node.pos, writePunctuation, node);
writeSpace();
emitTokenWithComment(127 /* AsKeyword */, asPos, writeKeyword, node);
writeSpace();
emit(node.name);
}
function emitNamedImports(node) {
emitNamedImportsOrExports(node);
}
function emitImportSpecifier(node) {
emitImportOrExportSpecifier(node);
}
function emitExportAssignment(node) {
var nextPos = emitTokenWithComment(93 /* ExportKeyword */, node.pos, writeKeyword, node);
writeSpace();
if (node.isExportEquals) {
emitTokenWithComment(63 /* EqualsToken */, nextPos, writeOperator, node);
}
else {
emitTokenWithComment(88 /* DefaultKeyword */, nextPos, writeKeyword, node);
}
writeSpace();
emitExpression(node.expression, node.isExportEquals ?
parenthesizer.getParenthesizeRightSideOfBinaryForOperator(63 /* EqualsToken */) :
parenthesizer.parenthesizeExpressionOfExportDefault);
writeTrailingSemicolon();
}
function emitExportDeclaration(node) {
var nextPos = emitTokenWithComment(93 /* ExportKeyword */, node.pos, writeKeyword, node);
writeSpace();
if (node.isTypeOnly) {
nextPos = emitTokenWithComment(150 /* TypeKeyword */, nextPos, writeKeyword, node);
writeSpace();
}
if (node.exportClause) {
emit(node.exportClause);
}
else {
nextPos = emitTokenWithComment(41 /* AsteriskToken */, nextPos, writePunctuation, node);
}
if (node.moduleSpecifier) {
writeSpace();
var fromPos = node.exportClause ? node.exportClause.end : nextPos;
emitTokenWithComment(154 /* FromKeyword */, fromPos, writeKeyword, node);
writeSpace();
emitExpression(node.moduleSpecifier);
}
writeTrailingSemicolon();
}
function emitNamespaceExportDeclaration(node) {
var nextPos = emitTokenWithComment(93 /* ExportKeyword */, node.pos, writeKeyword, node);
writeSpace();
nextPos = emitTokenWithComment(127 /* AsKeyword */, nextPos, writeKeyword, node);
writeSpace();
nextPos = emitTokenWithComment(141 /* NamespaceKeyword */, nextPos, writeKeyword, node);
writeSpace();
emit(node.name);
writeTrailingSemicolon();
}
function emitNamespaceExport(node) {
var asPos = emitTokenWithComment(41 /* AsteriskToken */, node.pos, writePunctuation, node);
writeSpace();
emitTokenWithComment(127 /* AsKeyword */, asPos, writeKeyword, node);
writeSpace();
emit(node.name);
}
function emitNamedExports(node) {
emitNamedImportsOrExports(node);
}
function emitExportSpecifier(node) {
emitImportOrExportSpecifier(node);
}
function emitNamedImportsOrExports(node) {
writePunctuation("{");
emitList(node, node.elements, 525136 /* NamedImportsOrExportsElements */);
writePunctuation("}");
}
function emitImportOrExportSpecifier(node) {
if (node.propertyName) {
emit(node.propertyName);
writeSpace();
emitTokenWithComment(127 /* AsKeyword */, node.propertyName.end, writeKeyword, node);
writeSpace();
}
emit(node.name);
}
//
// Module references
//
function emitExternalModuleReference(node) {
writeKeyword("require");
writePunctuation("(");
emitExpression(node.expression);
writePunctuation(")");
}
//
// JSX
//
function emitJsxElement(node) {
emit(node.openingElement);
emitList(node, node.children, 262144 /* JsxElementOrFragmentChildren */);
emit(node.closingElement);
}
function emitJsxSelfClosingElement(node) {
writePunctuation("<");
emitJsxTagName(node.tagName);
emitTypeArguments(node, node.typeArguments);
writeSpace();
emit(node.attributes);
writePunctuation("/>");
}
function emitJsxFragment(node) {
emit(node.openingFragment);
emitList(node, node.children, 262144 /* JsxElementOrFragmentChildren */);
emit(node.closingFragment);
}
function emitJsxOpeningElementOrFragment(node) {
writePunctuation("<");
if (ts.isJsxOpeningElement(node)) {
var indented = writeLineSeparatorsAndIndentBefore(node.tagName, node);
emitJsxTagName(node.tagName);
emitTypeArguments(node, node.typeArguments);
if (node.attributes.properties && node.attributes.properties.length > 0) {
writeSpace();
}
emit(node.attributes);
writeLineSeparatorsAfter(node.attributes, node);
decreaseIndentIf(indented);
}
writePunctuation(">");
}
function emitJsxText(node) {
writer.writeLiteral(node.text);
}
function emitJsxClosingElementOrFragment(node) {
writePunctuation("</");
if (ts.isJsxClosingElement(node)) {
emitJsxTagName(node.tagName);
}
writePunctuation(">");
}
function emitJsxAttributes(node) {
emitList(node, node.properties, 262656 /* JsxElementAttributes */);
}
function emitJsxAttribute(node) {
emit(node.name);
emitNodeWithPrefix("=", writePunctuation, node.initializer, emitJsxAttributeValue);
}
function emitJsxSpreadAttribute(node) {
writePunctuation("{...");
emitExpression(node.expression);
writePunctuation("}");
}
function hasTrailingCommentsAtPosition(pos) {
var result = false;
ts.forEachTrailingCommentRange((currentSourceFile === null || currentSourceFile === void 0 ? void 0 : currentSourceFile.text) || "", pos + 1, function () { return result = true; });
return result;
}
function hasLeadingCommentsAtPosition(pos) {
var result = false;
ts.forEachLeadingCommentRange((currentSourceFile === null || currentSourceFile === void 0 ? void 0 : currentSourceFile.text) || "", pos + 1, function () { return result = true; });
return result;
}
function hasCommentsAtPosition(pos) {
return hasTrailingCommentsAtPosition(pos) || hasLeadingCommentsAtPosition(pos);
}
function emitJsxExpression(node) {
var _a;
if (node.expression || (!commentsDisabled && !ts.nodeIsSynthesized(node) && hasCommentsAtPosition(node.pos))) { // preserve empty expressions if they contain comments!
var isMultiline = currentSourceFile && !ts.nodeIsSynthesized(node) && ts.getLineAndCharacterOfPosition(currentSourceFile, node.pos).line !== ts.getLineAndCharacterOfPosition(currentSourceFile, node.end).line;
if (isMultiline) {
writer.increaseIndent();
}
var end = emitTokenWithComment(18 /* OpenBraceToken */, node.pos, writePunctuation, node);
emit(node.dotDotDotToken);
emitExpression(node.expression);
emitTokenWithComment(19 /* CloseBraceToken */, ((_a = node.expression) === null || _a === void 0 ? void 0 : _a.end) || end, writePunctuation, node);
if (isMultiline) {
writer.decreaseIndent();
}
}
}
function emitJsxTagName(node) {
if (node.kind === 79 /* Identifier */) {
emitExpression(node);
}
else {
emit(node);
}
}
//
// Clauses
//
function emitCaseClause(node) {
emitTokenWithComment(82 /* CaseKeyword */, node.pos, writeKeyword, node);
writeSpace();
emitExpression(node.expression, parenthesizer.parenthesizeExpressionForDisallowedComma);
emitCaseOrDefaultClauseRest(node, node.statements, node.expression.end);
}
function emitDefaultClause(node) {
var pos = emitTokenWithComment(88 /* DefaultKeyword */, node.pos, writeKeyword, node);
emitCaseOrDefaultClauseRest(node, node.statements, pos);
}
function emitCaseOrDefaultClauseRest(parentNode, statements, colonPos) {
var emitAsSingleStatement = statements.length === 1 &&
(
// treat synthesized nodes as located on the same line for emit purposes
ts.nodeIsSynthesized(parentNode) ||
ts.nodeIsSynthesized(statements[0]) ||
ts.rangeStartPositionsAreOnSameLine(parentNode, statements[0], currentSourceFile));
var format = 163969 /* CaseOrDefaultClauseStatements */;
if (emitAsSingleStatement) {
writeToken(58 /* ColonToken */, colonPos, writePunctuation, parentNode);
writeSpace();
format &= ~(1 /* MultiLine */ | 128 /* Indented */);
}
else {
emitTokenWithComment(58 /* ColonToken */, colonPos, writePunctuation, parentNode);
}
emitList(parentNode, statements, format);
}
function emitHeritageClause(node) {
writeSpace();
writeTokenText(node.token, writeKeyword);
writeSpace();
emitList(node, node.types, 528 /* HeritageClauseTypes */);
}
function emitCatchClause(node) {
var openParenPos = emitTokenWithComment(83 /* CatchKeyword */, node.pos, writeKeyword, node);
writeSpace();
if (node.variableDeclaration) {
emitTokenWithComment(20 /* OpenParenToken */, openParenPos, writePunctuation, node);
emit(node.variableDeclaration);
emitTokenWithComment(21 /* CloseParenToken */, node.variableDeclaration.end, writePunctuation, node);
writeSpace();
}
emit(node.block);
}
//
// Property assignments
//
function emitPropertyAssignment(node) {
emit(node.name);
writePunctuation(":");
writeSpace();
// This is to ensure that we emit comment in the following case:
// For example:
// obj = {
// id: /*comment1*/ ()=>void
// }
// "comment1" is not considered to be leading comment for node.initializer
// but rather a trailing comment on the previous node.
var initializer = node.initializer;
if ((ts.getEmitFlags(initializer) & 512 /* NoLeadingComments */) === 0) {
var commentRange = ts.getCommentRange(initializer);
emitTrailingCommentsOfPosition(commentRange.pos);
}
emitExpression(initializer, parenthesizer.parenthesizeExpressionForDisallowedComma);
}
function emitShorthandPropertyAssignment(node) {
emit(node.name);
if (node.objectAssignmentInitializer) {
writeSpace();
writePunctuation("=");
writeSpace();
emitExpression(node.objectAssignmentInitializer, parenthesizer.parenthesizeExpressionForDisallowedComma);
}
}
function emitSpreadAssignment(node) {
if (node.expression) {
emitTokenWithComment(25 /* DotDotDotToken */, node.pos, writePunctuation, node);
emitExpression(node.expression, parenthesizer.parenthesizeExpressionForDisallowedComma);
}
}
//
// Enum
//
function emitEnumMember(node) {
emit(node.name);
emitInitializer(node.initializer, node.name.end, node, parenthesizer.parenthesizeExpressionForDisallowedComma);
}
//
// JSDoc
//
function emitJSDoc(node) {
write("/**");
if (node.comment) {
var text = ts.getTextOfJSDocComment(node.comment);
if (text) {
var lines = text.split(/\r\n?|\n/g);
for (var _a = 0, lines_2 = lines; _a < lines_2.length; _a++) {
var line = lines_2[_a];
writeLine();
writeSpace();
writePunctuation("*");
writeSpace();
write(line);
}
}
}
if (node.tags) {
if (node.tags.length === 1 && node.tags[0].kind === 338 /* JSDocTypeTag */ && !node.comment) {
writeSpace();
emit(node.tags[0]);
}
else {
emitList(node, node.tags, 33 /* JSDocComment */);
}
}
writeSpace();
write("*/");
}
function emitJSDocSimpleTypedTag(tag) {
emitJSDocTagName(tag.tagName);
emitJSDocTypeExpression(tag.typeExpression);
emitJSDocComment(tag.comment);
}
function emitJSDocSeeTag(tag) {
emitJSDocTagName(tag.tagName);
emit(tag.name);
emitJSDocComment(tag.comment);
}
function emitJSDocNameReference(node) {
writeSpace();
writePunctuation("{");
emit(node.name);
writePunctuation("}");
}
function emitJSDocHeritageTag(tag) {
emitJSDocTagName(tag.tagName);
writeSpace();
writePunctuation("{");
emit(tag.class);
writePunctuation("}");
emitJSDocComment(tag.comment);
}
function emitJSDocTemplateTag(tag) {
emitJSDocTagName(tag.tagName);
emitJSDocTypeExpression(tag.constraint);
writeSpace();
emitList(tag, tag.typeParameters, 528 /* CommaListElements */);
emitJSDocComment(tag.comment);
}
function emitJSDocTypedefTag(tag) {
emitJSDocTagName(tag.tagName);
if (tag.typeExpression) {
if (tag.typeExpression.kind === 304 /* JSDocTypeExpression */) {
emitJSDocTypeExpression(tag.typeExpression);
}
else {
writeSpace();
writePunctuation("{");
write("Object");
if (tag.typeExpression.isArrayType) {
writePunctuation("[");
writePunctuation("]");
}
writePunctuation("}");
}
}
if (tag.fullName) {
writeSpace();
emit(tag.fullName);
}
emitJSDocComment(tag.comment);
if (tag.typeExpression && tag.typeExpression.kind === 317 /* JSDocTypeLiteral */) {
emitJSDocTypeLiteral(tag.typeExpression);
}
}
function emitJSDocCallbackTag(tag) {
emitJSDocTagName(tag.tagName);
if (tag.name) {
writeSpace();
emit(tag.name);
}
emitJSDocComment(tag.comment);
emitJSDocSignature(tag.typeExpression);
}
function emitJSDocSimpleTag(tag) {
emitJSDocTagName(tag.tagName);
emitJSDocComment(tag.comment);
}
function emitJSDocTypeLiteral(lit) {
emitList(lit, ts.factory.createNodeArray(lit.jsDocPropertyTags), 33 /* JSDocComment */);
}
function emitJSDocSignature(sig) {
if (sig.typeParameters) {
emitList(sig, ts.factory.createNodeArray(sig.typeParameters), 33 /* JSDocComment */);
}
if (sig.parameters) {
emitList(sig, ts.factory.createNodeArray(sig.parameters), 33 /* JSDocComment */);
}
if (sig.type) {
writeLine();
writeSpace();
writePunctuation("*");
writeSpace();
emit(sig.type);
}
}
function emitJSDocPropertyLikeTag(param) {
emitJSDocTagName(param.tagName);
emitJSDocTypeExpression(param.typeExpression);
writeSpace();
if (param.isBracketed) {
writePunctuation("[");
}
emit(param.name);
if (param.isBracketed) {
writePunctuation("]");
}
emitJSDocComment(param.comment);
}
function emitJSDocTagName(tagName) {
writePunctuation("@");
emit(tagName);
}
function emitJSDocComment(comment) {
var text = ts.getTextOfJSDocComment(comment);
if (text) {
writeSpace();
write(text);
}
}
function emitJSDocTypeExpression(typeExpression) {
if (typeExpression) {
writeSpace();
writePunctuation("{");
emit(typeExpression.type);
writePunctuation("}");
}
}
//
// Top-level nodes
//
function emitSourceFile(node) {
writeLine();
var statements = node.statements;
if (emitBodyWithDetachedComments) {
// Emit detached comment if there are no prologue directives or if the first node is synthesized.
// The synthesized node will have no leading comment so some comments may be missed.
var shouldEmitDetachedComment = statements.length === 0 ||
!ts.isPrologueDirective(statements[0]) ||
ts.nodeIsSynthesized(statements[0]);
if (shouldEmitDetachedComment) {
emitBodyWithDetachedComments(node, statements, emitSourceFileWorker);
return;
}
}
emitSourceFileWorker(node);
}
function emitSyntheticTripleSlashReferencesIfNeeded(node) {
emitTripleSlashDirectives(!!node.hasNoDefaultLib, node.syntheticFileReferences || [], node.syntheticTypeReferences || [], node.syntheticLibReferences || []);
for (var _a = 0, _b = node.prepends; _a < _b.length; _a++) {
var prepend = _b[_a];
if (ts.isUnparsedSource(prepend) && prepend.syntheticReferences) {
for (var _c = 0, _d = prepend.syntheticReferences; _c < _d.length; _c++) {
var ref = _d[_c];
emit(ref);
writeLine();
}
}
}
}
function emitTripleSlashDirectivesIfNeeded(node) {
if (node.isDeclarationFile)
emitTripleSlashDirectives(node.hasNoDefaultLib, node.referencedFiles, node.typeReferenceDirectives, node.libReferenceDirectives);
}
function emitTripleSlashDirectives(hasNoDefaultLib, files, types, libs) {
if (hasNoDefaultLib) {
var pos = writer.getTextPos();
writeComment("/// <reference no-default-lib=\"true\"/>");
if (bundleFileInfo)
bundleFileInfo.sections.push({ pos: pos, end: writer.getTextPos(), kind: "no-default-lib" /* NoDefaultLib */ });
writeLine();
}
if (currentSourceFile && currentSourceFile.moduleName) {
writeComment("/// <amd-module name=\"" + currentSourceFile.moduleName + "\" />");
writeLine();
}
if (currentSourceFile && currentSourceFile.amdDependencies) {
for (var _a = 0, _b = currentSourceFile.amdDependencies; _a < _b.length; _a++) {
var dep = _b[_a];
if (dep.name) {
writeComment("/// <amd-dependency name=\"" + dep.name + "\" path=\"" + dep.path + "\" />");
}
else {
writeComment("/// <amd-dependency path=\"" + dep.path + "\" />");
}
writeLine();
}
}
for (var _c = 0, files_2 = files; _c < files_2.length; _c++) {
var directive = files_2[_c];
var pos = writer.getTextPos();
writeComment("/// <reference path=\"" + directive.fileName + "\" />");
if (bundleFileInfo)
bundleFileInfo.sections.push({ pos: pos, end: writer.getTextPos(), kind: "reference" /* Reference */, data: directive.fileName });
writeLine();
}
for (var _d = 0, types_24 = types; _d < types_24.length; _d++) {
var directive = types_24[_d];
var pos = writer.getTextPos();
writeComment("/// <reference types=\"" + directive.fileName + "\" />");
if (bundleFileInfo)
bundleFileInfo.sections.push({ pos: pos, end: writer.getTextPos(), kind: "type" /* Type */, data: directive.fileName });
writeLine();
}
for (var _e = 0, libs_1 = libs; _e < libs_1.length; _e++) {
var directive = libs_1[_e];
var pos = writer.getTextPos();
writeComment("/// <reference lib=\"" + directive.fileName + "\" />");
if (bundleFileInfo)
bundleFileInfo.sections.push({ pos: pos, end: writer.getTextPos(), kind: "lib" /* Lib */, data: directive.fileName });
writeLine();
}
}
function emitSourceFileWorker(node) {
var statements = node.statements;
pushNameGenerationScope(node);
ts.forEach(node.statements, generateNames);
emitHelpers(node);
var index = ts.findIndex(statements, function (statement) { return !ts.isPrologueDirective(statement); });
emitTripleSlashDirectivesIfNeeded(node);
emitList(node, statements, 1 /* MultiLine */, /*parenthesizerRule*/ undefined, index === -1 ? statements.length : index);
popNameGenerationScope(node);
}
// Transformation nodes
function emitPartiallyEmittedExpression(node) {
emitExpression(node.expression);
}
function emitCommaList(node) {
emitExpressionList(node, node.elements, 528 /* CommaListElements */, /*parenthesizerRule*/ undefined);
}
/**
* Emits any prologue directives at the start of a Statement list, returning the
* number of prologue directives written to the output.
*/
function emitPrologueDirectives(statements, sourceFile, seenPrologueDirectives, recordBundleFileSection) {
var needsToSetSourceFile = !!sourceFile;
for (var i = 0; i < statements.length; i++) {
var statement = statements[i];
if (ts.isPrologueDirective(statement)) {
var shouldEmitPrologueDirective = seenPrologueDirectives ? !seenPrologueDirectives.has(statement.expression.text) : true;
if (shouldEmitPrologueDirective) {
if (needsToSetSourceFile) {
needsToSetSourceFile = false;
setSourceFile(sourceFile);
}
writeLine();
var pos = writer.getTextPos();
emit(statement);
if (recordBundleFileSection && bundleFileInfo)
bundleFileInfo.sections.push({ pos: pos, end: writer.getTextPos(), kind: "prologue" /* Prologue */, data: statement.expression.text });
if (seenPrologueDirectives) {
seenPrologueDirectives.add(statement.expression.text);
}
}
}
else {
// return index of the first non prologue directive
return i;
}
}
return statements.length;
}
function emitUnparsedPrologues(prologues, seenPrologueDirectives) {
for (var _a = 0, prologues_1 = prologues; _a < prologues_1.length; _a++) {
var prologue = prologues_1[_a];
if (!seenPrologueDirectives.has(prologue.data)) {
writeLine();
var pos = writer.getTextPos();
emit(prologue);
if (bundleFileInfo)
bundleFileInfo.sections.push({ pos: pos, end: writer.getTextPos(), kind: "prologue" /* Prologue */, data: prologue.data });
if (seenPrologueDirectives) {
seenPrologueDirectives.add(prologue.data);
}
}
}
}
function emitPrologueDirectivesIfNeeded(sourceFileOrBundle) {
if (ts.isSourceFile(sourceFileOrBundle)) {
emitPrologueDirectives(sourceFileOrBundle.statements, sourceFileOrBundle);
}
else {
var seenPrologueDirectives = new ts.Set();
for (var _a = 0, _b = sourceFileOrBundle.prepends; _a < _b.length; _a++) {
var prepend = _b[_a];
emitUnparsedPrologues(prepend.prologues, seenPrologueDirectives);
}
for (var _c = 0, _d = sourceFileOrBundle.sourceFiles; _c < _d.length; _c++) {
var sourceFile = _d[_c];
emitPrologueDirectives(sourceFile.statements, sourceFile, seenPrologueDirectives, /*recordBundleFileSection*/ true);
}
setSourceFile(undefined);
}
}
function getPrologueDirectivesFromBundledSourceFiles(bundle) {
var seenPrologueDirectives = new ts.Set();
var prologues;
for (var index = 0; index < bundle.sourceFiles.length; index++) {
var sourceFile = bundle.sourceFiles[index];
var directives = void 0;
var end = 0;
for (var _a = 0, _b = sourceFile.statements; _a < _b.length; _a++) {
var statement = _b[_a];
if (!ts.isPrologueDirective(statement))
break;
if (seenPrologueDirectives.has(statement.expression.text))
continue;
seenPrologueDirectives.add(statement.expression.text);
(directives || (directives = [])).push({
pos: statement.pos,
end: statement.end,
expression: {
pos: statement.expression.pos,
end: statement.expression.end,
text: statement.expression.text
}
});
end = end < statement.end ? statement.end : end;
}
if (directives)
(prologues || (prologues = [])).push({ file: index, text: sourceFile.text.substring(0, end), directives: directives });
}
return prologues;
}
function emitShebangIfNeeded(sourceFileOrBundle) {
if (ts.isSourceFile(sourceFileOrBundle) || ts.isUnparsedSource(sourceFileOrBundle)) {
var shebang = ts.getShebang(sourceFileOrBundle.text);
if (shebang) {
writeComment(shebang);
writeLine();
return true;
}
}
else {
for (var _a = 0, _b = sourceFileOrBundle.prepends; _a < _b.length; _a++) {
var prepend = _b[_a];
ts.Debug.assertNode(prepend, ts.isUnparsedSource);
if (emitShebangIfNeeded(prepend)) {
return true;
}
}
for (var _c = 0, _d = sourceFileOrBundle.sourceFiles; _c < _d.length; _c++) {
var sourceFile = _d[_c];
// Emit only the first encountered shebang
if (emitShebangIfNeeded(sourceFile)) {
return true;
}
}
}
}
//
// Helpers
//
function emitNodeWithWriter(node, writer) {
if (!node)
return;
var savedWrite = write;
write = writer;
emit(node);
write = savedWrite;
}
function emitModifiers(node, modifiers) {
if (modifiers && modifiers.length) {
emitList(node, modifiers, 262656 /* Modifiers */);
writeSpace();
}
}
function emitTypeAnnotation(node) {
if (node) {
writePunctuation(":");
writeSpace();
emit(node);
}
}
function emitInitializer(node, equalCommentStartPos, container, parenthesizerRule) {
if (node) {
writeSpace();
emitTokenWithComment(63 /* EqualsToken */, equalCommentStartPos, writeOperator, container);
writeSpace();
emitExpression(node, parenthesizerRule);
}
}
function emitNodeWithPrefix(prefix, prefixWriter, node, emit) {
if (node) {
prefixWriter(prefix);
emit(node);
}
}
function emitWithLeadingSpace(node) {
if (node) {
writeSpace();
emit(node);
}
}
function emitExpressionWithLeadingSpace(node, parenthesizerRule) {
if (node) {
writeSpace();
emitExpression(node, parenthesizerRule);
}
}
function emitWithTrailingSpace(node) {
if (node) {
emit(node);
writeSpace();
}
}
function emitEmbeddedStatement(parent, node) {
if (ts.isBlock(node) || ts.getEmitFlags(parent) & 1 /* SingleLine */) {
writeSpace();
emit(node);
}
else {
writeLine();
increaseIndent();
if (ts.isEmptyStatement(node)) {
pipelineEmit(5 /* EmbeddedStatement */, node);
}
else {
emit(node);
}
decreaseIndent();
}
}
function emitDecorators(parentNode, decorators) {
emitList(parentNode, decorators, 2146305 /* Decorators */);
}
function emitTypeArguments(parentNode, typeArguments) {
emitList(parentNode, typeArguments, 53776 /* TypeArguments */, parenthesizer.parenthesizeMemberOfElementType);
}
function emitTypeParameters(parentNode, typeParameters) {
if (ts.isFunctionLike(parentNode) && parentNode.typeArguments) { // Quick info uses type arguments in place of type parameters on instantiated signatures
return emitTypeArguments(parentNode, parentNode.typeArguments);
}
emitList(parentNode, typeParameters, 53776 /* TypeParameters */);
}
function emitParameters(parentNode, parameters) {
emitList(parentNode, parameters, 2576 /* Parameters */);
}
function canEmitSimpleArrowHead(parentNode, parameters) {
var parameter = ts.singleOrUndefined(parameters);
return parameter
&& parameter.pos === parentNode.pos // may not have parsed tokens between parent and parameter
&& ts.isArrowFunction(parentNode) // only arrow functions may have simple arrow head
&& !parentNode.type // arrow function may not have return type annotation
&& !ts.some(parentNode.decorators) // parent may not have decorators
&& !ts.some(parentNode.modifiers) // parent may not have modifiers
&& !ts.some(parentNode.typeParameters) // parent may not have type parameters
&& !ts.some(parameter.decorators) // parameter may not have decorators
&& !ts.some(parameter.modifiers) // parameter may not have modifiers
&& !parameter.dotDotDotToken // parameter may not be rest
&& !parameter.questionToken // parameter may not be optional
&& !parameter.type // parameter may not have a type annotation
&& !parameter.initializer // parameter may not have an initializer
&& ts.isIdentifier(parameter.name); // parameter name must be identifier
}
function emitParametersForArrow(parentNode, parameters) {
if (canEmitSimpleArrowHead(parentNode, parameters)) {
emitList(parentNode, parameters, 2576 /* Parameters */ & ~2048 /* Parenthesis */);
}
else {
emitParameters(parentNode, parameters);
}
}
function emitParametersForIndexSignature(parentNode, parameters) {
emitList(parentNode, parameters, 8848 /* IndexSignatureParameters */);
}
function writeDelimiter(format) {
switch (format & 60 /* DelimitersMask */) {
case 0 /* None */:
break;
case 16 /* CommaDelimited */:
writePunctuation(",");
break;
case 4 /* BarDelimited */:
writeSpace();
writePunctuation("|");
break;
case 32 /* AsteriskDelimited */:
writeSpace();
writePunctuation("*");
writeSpace();
break;
case 8 /* AmpersandDelimited */:
writeSpace();
writePunctuation("&");
break;
}
}
function emitList(parentNode, children, format, parenthesizerRule, start, count) {
emitNodeList(emit, parentNode, children, format, parenthesizerRule, start, count);
}
function emitExpressionList(parentNode, children, format, parenthesizerRule, start, count) {
emitNodeList(emitExpression, parentNode, children, format, parenthesizerRule, start, count);
}
function emitNodeList(emit, parentNode, children, format, parenthesizerRule, start, count) {
if (start === void 0) { start = 0; }
if (count === void 0) { count = children ? children.length - start : 0; }
var isUndefined = children === undefined;
if (isUndefined && format & 16384 /* OptionalIfUndefined */) {
return;
}
var isEmpty = children === undefined || start >= children.length || count === 0;
if (isEmpty && format & 32768 /* OptionalIfEmpty */) {
if (onBeforeEmitNodeArray) {
onBeforeEmitNodeArray(children);
}
if (onAfterEmitNodeArray) {
onAfterEmitNodeArray(children);
}
return;
}
if (format & 15360 /* BracketsMask */) {
writePunctuation(getOpeningBracket(format));
if (isEmpty && children) {
emitTrailingCommentsOfPosition(children.pos, /*prefixSpace*/ true); // Emit comments within empty bracketed lists
}
}
if (onBeforeEmitNodeArray) {
onBeforeEmitNodeArray(children);
}
if (isEmpty) {
// Write a line terminator if the parent node was multi-line
if (format & 1 /* MultiLine */ && !(preserveSourceNewlines && (!parentNode || ts.rangeIsOnSingleLine(parentNode, currentSourceFile)))) {
writeLine();
}
else if (format & 256 /* SpaceBetweenBraces */ && !(format & 524288 /* NoSpaceIfEmpty */)) {
writeSpace();
}
}
else {
ts.Debug.type(children);
// Write the opening line terminator or leading whitespace.
var mayEmitInterveningComments = (format & 262144 /* NoInterveningComments */) === 0;
var shouldEmitInterveningComments = mayEmitInterveningComments;
var leadingLineTerminatorCount = getLeadingLineTerminatorCount(parentNode, children, format); // TODO: GH#18217
if (leadingLineTerminatorCount) {
writeLine(leadingLineTerminatorCount);
shouldEmitInterveningComments = false;
}
else if (format & 256 /* SpaceBetweenBraces */) {
writeSpace();
}
// Increase the indent, if requested.
if (format & 128 /* Indented */) {
increaseIndent();
}
// Emit each child.
var previousSibling = void 0;
var previousSourceFileTextKind = void 0;
var shouldDecreaseIndentAfterEmit = false;
for (var i = 0; i < count; i++) {
var child = children[start + i];
// Write the delimiter if this is not the first node.
if (format & 32 /* AsteriskDelimited */) {
// always write JSDoc in the format "\n *"
writeLine();
writeDelimiter(format);
}
else if (previousSibling) {
// i.e
// function commentedParameters(
// /* Parameter a */
// a
// /* End of parameter a */ -> this comment isn't considered to be trailing comment of parameter "a" due to newline
// ,
if (format & 60 /* DelimitersMask */ && previousSibling.end !== (parentNode ? parentNode.end : -1)) {
emitLeadingCommentsOfPosition(previousSibling.end);
}
writeDelimiter(format);
recordBundleFileInternalSectionEnd(previousSourceFileTextKind);
// Write either a line terminator or whitespace to separate the elements.
var separatingLineTerminatorCount = getSeparatingLineTerminatorCount(previousSibling, child, format);
if (separatingLineTerminatorCount > 0) {
// If a synthesized node in a single-line list starts on a new
// line, we should increase the indent.
if ((format & (3 /* LinesMask */ | 128 /* Indented */)) === 0 /* SingleLine */) {
increaseIndent();
shouldDecreaseIndentAfterEmit = true;
}
writeLine(separatingLineTerminatorCount);
shouldEmitInterveningComments = false;
}
else if (previousSibling && format & 512 /* SpaceBetweenSiblings */) {
writeSpace();
}
}
// Emit this child.
previousSourceFileTextKind = recordBundleFileInternalSectionStart(child);
if (shouldEmitInterveningComments) {
if (emitTrailingCommentsOfPosition) {
var commentRange = ts.getCommentRange(child);
emitTrailingCommentsOfPosition(commentRange.pos);
}
}
else {
shouldEmitInterveningComments = mayEmitInterveningComments;
}
nextListElementPos = child.pos;
if (emit.length === 1) {
emit(child);
}
else {
emit(child, parenthesizerRule);
}
if (shouldDecreaseIndentAfterEmit) {
decreaseIndent();
shouldDecreaseIndentAfterEmit = false;
}
previousSibling = child;
}
// Write a trailing comma, if requested.
var emitFlags = previousSibling ? ts.getEmitFlags(previousSibling) : 0;
var skipTrailingComments = commentsDisabled || !!(emitFlags & 1024 /* NoTrailingComments */);
var hasTrailingComma = (children === null || children === void 0 ? void 0 : children.hasTrailingComma) && (format & 64 /* AllowTrailingComma */) && (format & 16 /* CommaDelimited */);
if (hasTrailingComma) {
if (previousSibling && !skipTrailingComments) {
emitTokenWithComment(27 /* CommaToken */, previousSibling.end, writePunctuation, previousSibling);
}
else {
writePunctuation(",");
}
}
// Emit any trailing comment of the last element in the list
// i.e
// var array = [...
// 2
// /* end of element 2 */
// ];
if (previousSibling && (parentNode ? parentNode.end : -1) !== previousSibling.end && (format & 60 /* DelimitersMask */) && !skipTrailingComments) {
emitLeadingCommentsOfPosition(hasTrailingComma && (children === null || children === void 0 ? void 0 : children.end) ? children.end : previousSibling.end);
}
// Decrease the indent, if requested.
if (format & 128 /* Indented */) {
decreaseIndent();
}
recordBundleFileInternalSectionEnd(previousSourceFileTextKind);
// Write the closing line terminator or closing whitespace.
var closingLineTerminatorCount = getClosingLineTerminatorCount(parentNode, children, format);
if (closingLineTerminatorCount) {
writeLine(closingLineTerminatorCount);
}
else if (format & (2097152 /* SpaceAfterList */ | 256 /* SpaceBetweenBraces */)) {
writeSpace();
}
}
if (onAfterEmitNodeArray) {
onAfterEmitNodeArray(children);
}
if (format & 15360 /* BracketsMask */) {
if (isEmpty && children) {
emitLeadingCommentsOfPosition(children.end); // Emit leading comments within empty lists
}
writePunctuation(getClosingBracket(format));
}
}
// Writers
function writeLiteral(s) {
writer.writeLiteral(s);
}
function writeStringLiteral(s) {
writer.writeStringLiteral(s);
}
function writeBase(s) {
writer.write(s);
}
function writeSymbol(s, sym) {
writer.writeSymbol(s, sym);
}
function writePunctuation(s) {
writer.writePunctuation(s);
}
function writeTrailingSemicolon() {
writer.writeTrailingSemicolon(";");
}
function writeKeyword(s) {
writer.writeKeyword(s);
}
function writeOperator(s) {
writer.writeOperator(s);
}
function writeParameter(s) {
writer.writeParameter(s);
}
function writeComment(s) {
writer.writeComment(s);
}
function writeSpace() {
writer.writeSpace(" ");
}
function writeProperty(s) {
writer.writeProperty(s);
}
function writeLine(count) {
if (count === void 0) { count = 1; }
for (var i = 0; i < count; i++) {
writer.writeLine(i > 0);
}
}
function increaseIndent() {
writer.increaseIndent();
}
function decreaseIndent() {
writer.decreaseIndent();
}
function writeToken(token, pos, writer, contextNode) {
return !sourceMapsDisabled
? emitTokenWithSourceMap(contextNode, token, writer, pos, writeTokenText)
: writeTokenText(token, writer, pos);
}
function writeTokenNode(node, writer) {
if (onBeforeEmitToken) {
onBeforeEmitToken(node);
}
writer(ts.tokenToString(node.kind));
if (onAfterEmitToken) {
onAfterEmitToken(node);
}
}
function writeTokenText(token, writer, pos) {
var tokenString = ts.tokenToString(token);
writer(tokenString);
return pos < 0 ? pos : pos + tokenString.length;
}
function writeLineOrSpace(parentNode, prevChildNode, nextChildNode) {
if (ts.getEmitFlags(parentNode) & 1 /* SingleLine */) {
writeSpace();
}
else if (preserveSourceNewlines) {
var lines = getLinesBetweenNodes(parentNode, prevChildNode, nextChildNode);
if (lines) {
writeLine(lines);
}
else {
writeSpace();
}
}
else {
writeLine();
}
}
function writeLines(text) {
var lines = text.split(/\r\n?|\n/g);
var indentation = ts.guessIndentation(lines);
for (var _a = 0, lines_3 = lines; _a < lines_3.length; _a++) {
var lineText = lines_3[_a];
var line = indentation ? lineText.slice(indentation) : lineText;
if (line.length) {
writeLine();
write(line);
}
}
}
function writeLinesAndIndent(lineCount, writeSpaceIfNotIndenting) {
if (lineCount) {
increaseIndent();
writeLine(lineCount);
}
else if (writeSpaceIfNotIndenting) {
writeSpace();
}
}
// Helper function to decrease the indent if we previously indented. Allows multiple
// previous indent values to be considered at a time. This also allows caller to just
// call this once, passing in all their appropriate indent values, instead of needing
// to call this helper function multiple times.
function decreaseIndentIf(value1, value2) {
if (value1) {
decreaseIndent();
}
if (value2) {
decreaseIndent();
}
}
function getLeadingLineTerminatorCount(parentNode, children, format) {
if (format & 2 /* PreserveLines */ || preserveSourceNewlines) {
if (format & 65536 /* PreferNewLine */) {
return 1;
}
var firstChild_1 = children[0];
if (firstChild_1 === undefined) {
return !parentNode || ts.rangeIsOnSingleLine(parentNode, currentSourceFile) ? 0 : 1;
}
if (firstChild_1.pos === nextListElementPos) {
// If this child starts at the beginning of a list item in a parent list, its leading
// line terminators have already been written as the separating line terminators of the
// parent list. Example:
//
// class Foo {
// constructor() {}
// public foo() {}
// }
//
// The outer list is the list of class members, with one line terminator between the
// constructor and the method. The constructor is written, the separating line terminator
// is written, and then we start emitting the method. Its modifiers ([public]) constitute an inner
// list, so we look for its leading line terminators. If we didn't know that we had already
// written a newline as part of the parent list, it would appear that we need to write a
// leading newline to start the modifiers.
return 0;
}
if (firstChild_1.kind === 11 /* JsxText */) {
// JsxText will be written with its leading whitespace, so don't add more manually.
return 0;
}
if (parentNode &&
!ts.positionIsSynthesized(parentNode.pos) &&
!ts.nodeIsSynthesized(firstChild_1) &&
(!firstChild_1.parent || ts.getOriginalNode(firstChild_1.parent) === ts.getOriginalNode(parentNode))) {
if (preserveSourceNewlines) {
return getEffectiveLines(function (includeComments) { return ts.getLinesBetweenPositionAndPrecedingNonWhitespaceCharacter(firstChild_1.pos, parentNode.pos, currentSourceFile, includeComments); });
}
return ts.rangeStartPositionsAreOnSameLine(parentNode, firstChild_1, currentSourceFile) ? 0 : 1;
}
if (synthesizedNodeStartsOnNewLine(firstChild_1, format)) {
return 1;
}
}
return format & 1 /* MultiLine */ ? 1 : 0;
}
function getSeparatingLineTerminatorCount(previousNode, nextNode, format) {
if (format & 2 /* PreserveLines */ || preserveSourceNewlines) {
if (previousNode === undefined || nextNode === undefined) {
return 0;
}
if (nextNode.kind === 11 /* JsxText */) {
// JsxText will be written with its leading whitespace, so don't add more manually.
return 0;
}
else if (!ts.nodeIsSynthesized(previousNode) && !ts.nodeIsSynthesized(nextNode)) {
if (preserveSourceNewlines && siblingNodePositionsAreComparable(previousNode, nextNode)) {
return getEffectiveLines(function (includeComments) { return ts.getLinesBetweenRangeEndAndRangeStart(previousNode, nextNode, currentSourceFile, includeComments); });
}
// If `preserveSourceNewlines` is `false` we do not intend to preserve the effective lines between the
// previous and next node. Instead we naively check whether nodes are on separate lines within the
// same node parent. If so, we intend to preserve a single line terminator. This is less precise and
// expensive than checking with `preserveSourceNewlines` as above, but the goal is not to preserve the
// effective source lines between two sibling nodes.
else if (!preserveSourceNewlines && originalNodesHaveSameParent(previousNode, nextNode)) {
return ts.rangeEndIsOnSameLineAsRangeStart(previousNode, nextNode, currentSourceFile) ? 0 : 1;
}
// If the two nodes are not comparable, add a line terminator based on the format that can indicate
// whether new lines are preferred or not.
return format & 65536 /* PreferNewLine */ ? 1 : 0;
}
else if (synthesizedNodeStartsOnNewLine(previousNode, format) || synthesizedNodeStartsOnNewLine(nextNode, format)) {
return 1;
}
}
else if (ts.getStartsOnNewLine(nextNode)) {
return 1;
}
return format & 1 /* MultiLine */ ? 1 : 0;
}
function getClosingLineTerminatorCount(parentNode, children, format) {
if (format & 2 /* PreserveLines */ || preserveSourceNewlines) {
if (format & 65536 /* PreferNewLine */) {
return 1;
}
var lastChild = ts.lastOrUndefined(children);
if (lastChild === undefined) {
return !parentNode || ts.rangeIsOnSingleLine(parentNode, currentSourceFile) ? 0 : 1;
}
if (parentNode && !ts.positionIsSynthesized(parentNode.pos) && !ts.nodeIsSynthesized(lastChild) && (!lastChild.parent || lastChild.parent === parentNode)) {
if (preserveSourceNewlines) {
var end_1 = ts.isNodeArray(children) && !ts.positionIsSynthesized(children.end) ? children.end : lastChild.end;
return getEffectiveLines(function (includeComments) { return ts.getLinesBetweenPositionAndNextNonWhitespaceCharacter(end_1, parentNode.end, currentSourceFile, includeComments); });
}
return ts.rangeEndPositionsAreOnSameLine(parentNode, lastChild, currentSourceFile) ? 0 : 1;
}
if (synthesizedNodeStartsOnNewLine(lastChild, format)) {
return 1;
}
}
if (format & 1 /* MultiLine */ && !(format & 131072 /* NoTrailingNewLine */)) {
return 1;
}
return 0;
}
function getEffectiveLines(getLineDifference) {
// If 'preserveSourceNewlines' is disabled, we should never call this function
// because it could be more expensive than alternative approximations.
ts.Debug.assert(!!preserveSourceNewlines);
// We start by measuring the line difference from a position to its adjacent comments,
// so that this is counted as a one-line difference, not two:
//
// node1;
// // NODE2 COMMENT
// node2;
var lines = getLineDifference(/*includeComments*/ true);
if (lines === 0) {
// However, if the line difference considering comments was 0, we might have this:
//
// node1; // NODE2 COMMENT
// node2;
//
// in which case we should be ignoring node2's comment, so this too is counted as
// a one-line difference, not zero.
return getLineDifference(/*includeComments*/ false);
}
return lines;
}
function writeLineSeparatorsAndIndentBefore(node, parent) {
var leadingNewlines = preserveSourceNewlines && getLeadingLineTerminatorCount(parent, [node], 0 /* None */);
if (leadingNewlines) {
writeLinesAndIndent(leadingNewlines, /*writeLinesIfNotIndenting*/ false);
}
return !!leadingNewlines;
}
function writeLineSeparatorsAfter(node, parent) {
var trailingNewlines = preserveSourceNewlines && getClosingLineTerminatorCount(parent, [node], 0 /* None */);
if (trailingNewlines) {
writeLine(trailingNewlines);
}
}
function synthesizedNodeStartsOnNewLine(node, format) {
if (ts.nodeIsSynthesized(node)) {
var startsOnNewLine = ts.getStartsOnNewLine(node);
if (startsOnNewLine === undefined) {
return (format & 65536 /* PreferNewLine */) !== 0;
}
return startsOnNewLine;
}
return (format & 65536 /* PreferNewLine */) !== 0;
}
function getLinesBetweenNodes(parent, node1, node2) {
if (ts.getEmitFlags(parent) & 131072 /* NoIndentation */) {
return 0;
}
parent = skipSynthesizedParentheses(parent);
node1 = skipSynthesizedParentheses(node1);
node2 = skipSynthesizedParentheses(node2);
// Always use a newline for synthesized code if the synthesizer desires it.
if (ts.getStartsOnNewLine(node2)) {
return 1;
}
if (!ts.nodeIsSynthesized(parent) && !ts.nodeIsSynthesized(node1) && !ts.nodeIsSynthesized(node2)) {
if (preserveSourceNewlines) {
return getEffectiveLines(function (includeComments) { return ts.getLinesBetweenRangeEndAndRangeStart(node1, node2, currentSourceFile, includeComments); });
}
return ts.rangeEndIsOnSameLineAsRangeStart(node1, node2, currentSourceFile) ? 0 : 1;
}
return 0;
}
function isEmptyBlock(block) {
return block.statements.length === 0
&& ts.rangeEndIsOnSameLineAsRangeStart(block, block, currentSourceFile);
}
function skipSynthesizedParentheses(node) {
while (node.kind === 210 /* ParenthesizedExpression */ && ts.nodeIsSynthesized(node)) {
node = node.expression;
}
return node;
}
function getTextOfNode(node, includeTrivia) {
if (ts.isGeneratedIdentifier(node)) {
return generateName(node);
}
else if ((ts.isIdentifier(node) || ts.isPrivateIdentifier(node)) && (ts.nodeIsSynthesized(node) || !node.parent || !currentSourceFile || (node.parent && currentSourceFile && ts.getSourceFileOfNode(node) !== ts.getOriginalNode(currentSourceFile)))) {
return ts.idText(node);
}
else if (node.kind === 10 /* StringLiteral */ && node.textSourceNode) {
return getTextOfNode(node.textSourceNode, includeTrivia);
}
else if (ts.isLiteralExpression(node) && (ts.nodeIsSynthesized(node) || !node.parent)) {
return node.text;
}
return ts.getSourceTextOfNodeFromSourceFile(currentSourceFile, node, includeTrivia);
}
function getLiteralTextOfNode(node, neverAsciiEscape, jsxAttributeEscape) {
if (node.kind === 10 /* StringLiteral */ && node.textSourceNode) {
var textSourceNode = node.textSourceNode;
if (ts.isIdentifier(textSourceNode) || ts.isNumericLiteral(textSourceNode)) {
var text = ts.isNumericLiteral(textSourceNode) ? textSourceNode.text : getTextOfNode(textSourceNode);
return jsxAttributeEscape ? "\"" + ts.escapeJsxAttributeString(text) + "\"" :
neverAsciiEscape || (ts.getEmitFlags(node) & 16777216 /* NoAsciiEscaping */) ? "\"" + ts.escapeString(text) + "\"" :
"\"" + ts.escapeNonAsciiString(text) + "\"";
}
else {
return getLiteralTextOfNode(textSourceNode, neverAsciiEscape, jsxAttributeEscape);
}
}
var flags = (neverAsciiEscape ? 1 /* NeverAsciiEscape */ : 0)
| (jsxAttributeEscape ? 2 /* JsxAttributeEscape */ : 0)
| (printerOptions.terminateUnterminatedLiterals ? 4 /* TerminateUnterminatedLiterals */ : 0)
| (printerOptions.target && printerOptions.target === 99 /* ESNext */ ? 8 /* AllowNumericSeparator */ : 0);
return ts.getLiteralText(node, currentSourceFile, flags);
}
/**
* Push a new name generation scope.
*/
function pushNameGenerationScope(node) {
if (node && ts.getEmitFlags(node) & 524288 /* ReuseTempVariableScope */) {
return;
}
tempFlagsStack.push(tempFlags);
tempFlags = 0;
reservedNamesStack.push(reservedNames);
}
/**
* Pop the current name generation scope.
*/
function popNameGenerationScope(node) {
if (node && ts.getEmitFlags(node) & 524288 /* ReuseTempVariableScope */) {
return;
}
tempFlags = tempFlagsStack.pop();
reservedNames = reservedNamesStack.pop();
}
function reserveNameInNestedScopes(name) {
if (!reservedNames || reservedNames === ts.lastOrUndefined(reservedNamesStack)) {
reservedNames = new ts.Set();
}
reservedNames.add(name);
}
function generateNames(node) {
if (!node)
return;
switch (node.kind) {
case 233 /* Block */:
ts.forEach(node.statements, generateNames);
break;
case 248 /* LabeledStatement */:
case 246 /* WithStatement */:
case 238 /* DoStatement */:
case 239 /* WhileStatement */:
generateNames(node.statement);
break;
case 237 /* IfStatement */:
generateNames(node.thenStatement);
generateNames(node.elseStatement);
break;
case 240 /* ForStatement */:
case 242 /* ForOfStatement */:
case 241 /* ForInStatement */:
generateNames(node.initializer);
generateNames(node.statement);
break;
case 247 /* SwitchStatement */:
generateNames(node.caseBlock);
break;
case 261 /* CaseBlock */:
ts.forEach(node.clauses, generateNames);
break;
case 287 /* CaseClause */:
case 288 /* DefaultClause */:
ts.forEach(node.statements, generateNames);
break;
case 250 /* TryStatement */:
generateNames(node.tryBlock);
generateNames(node.catchClause);
generateNames(node.finallyBlock);
break;
case 290 /* CatchClause */:
generateNames(node.variableDeclaration);
generateNames(node.block);
break;
case 235 /* VariableStatement */:
generateNames(node.declarationList);
break;
case 253 /* VariableDeclarationList */:
ts.forEach(node.declarations, generateNames);
break;
case 252 /* VariableDeclaration */:
case 162 /* Parameter */:
case 201 /* BindingElement */:
case 255 /* ClassDeclaration */:
generateNameIfNeeded(node.name);
break;
case 254 /* FunctionDeclaration */:
generateNameIfNeeded(node.name);
if (ts.getEmitFlags(node) & 524288 /* ReuseTempVariableScope */) {
ts.forEach(node.parameters, generateNames);
generateNames(node.body);
}
break;
case 199 /* ObjectBindingPattern */:
case 200 /* ArrayBindingPattern */:
ts.forEach(node.elements, generateNames);
break;
case 264 /* ImportDeclaration */:
generateNames(node.importClause);
break;
case 265 /* ImportClause */:
generateNameIfNeeded(node.name);
generateNames(node.namedBindings);
break;
case 266 /* NamespaceImport */:
generateNameIfNeeded(node.name);
break;
case 272 /* NamespaceExport */:
generateNameIfNeeded(node.name);
break;
case 267 /* NamedImports */:
ts.forEach(node.elements, generateNames);
break;
case 268 /* ImportSpecifier */:
generateNameIfNeeded(node.propertyName || node.name);
break;
}
}
function generateMemberNames(node) {
if (!node)
return;
switch (node.kind) {
case 291 /* PropertyAssignment */:
case 292 /* ShorthandPropertyAssignment */:
case 165 /* PropertyDeclaration */:
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
generateNameIfNeeded(node.name);
break;
}
}
function generateNameIfNeeded(name) {
if (name) {
if (ts.isGeneratedIdentifier(name)) {
generateName(name);
}
else if (ts.isBindingPattern(name)) {
generateNames(name);
}
}
}
/**
* Generate the text for a generated identifier.
*/
function generateName(name) {
if ((name.autoGenerateFlags & 7 /* KindMask */) === 4 /* Node */) {
// Node names generate unique names based on their original node
// and are cached based on that node's id.
return generateNameCached(getNodeForGeneratedName(name), name.autoGenerateFlags);
}
else {
// Auto, Loop, and Unique names are cached based on their unique
// autoGenerateId.
var autoGenerateId = name.autoGenerateId;
return autoGeneratedIdToGeneratedName[autoGenerateId] || (autoGeneratedIdToGeneratedName[autoGenerateId] = makeName(name));
}
}
function generateNameCached(node, flags) {
var nodeId = ts.getNodeId(node);
return nodeIdToGeneratedName[nodeId] || (nodeIdToGeneratedName[nodeId] = generateNameForNode(node, flags));
}
/**
* Returns a value indicating whether a name is unique globally, within the current file,
* or within the NameGenerator.
*/
function isUniqueName(name) {
return isFileLevelUniqueName(name)
&& !generatedNames.has(name)
&& !(reservedNames && reservedNames.has(name));
}
/**
* Returns a value indicating whether a name is unique globally or within the current file.
*/
function isFileLevelUniqueName(name) {
return currentSourceFile ? ts.isFileLevelUniqueName(currentSourceFile, name, hasGlobalName) : true;
}
/**
* Returns a value indicating whether a name is unique within a container.
*/
function isUniqueLocalName(name, container) {
for (var node = container; ts.isNodeDescendantOf(node, container); node = node.nextContainer) {
if (node.locals) {
var local = node.locals.get(ts.escapeLeadingUnderscores(name));
// We conservatively include alias symbols to cover cases where they're emitted as locals
if (local && local.flags & (111551 /* Value */ | 1048576 /* ExportValue */ | 2097152 /* Alias */)) {
return false;
}
}
}
return true;
}
/**
* Return the next available name in the pattern _a ... _z, _0, _1, ...
* TempFlags._i or TempFlags._n may be used to express a preference for that dedicated name.
* Note that names generated by makeTempVariableName and makeUniqueName will never conflict.
*/
function makeTempVariableName(flags, reservedInNestedScopes) {
if (flags && !(tempFlags & flags)) {
var name = flags === 268435456 /* _i */ ? "_i" : "_n";
if (isUniqueName(name)) {
tempFlags |= flags;
if (reservedInNestedScopes) {
reserveNameInNestedScopes(name);
}
return name;
}
}
while (true) {
var count = tempFlags & 268435455 /* CountMask */;
tempFlags++;
// Skip over 'i' and 'n'
if (count !== 8 && count !== 13) {
var name = count < 26
? "_" + String.fromCharCode(97 /* a */ + count)
: "_" + (count - 26);
if (isUniqueName(name)) {
if (reservedInNestedScopes) {
reserveNameInNestedScopes(name);
}
return name;
}
}
}
}
/**
* Generate a name that is unique within the current file and doesn't conflict with any names
* in global scope. The name is formed by adding an '_n' suffix to the specified base name,
* where n is a positive integer. Note that names generated by makeTempVariableName and
* makeUniqueName are guaranteed to never conflict.
* If `optimistic` is set, the first instance will use 'baseName' verbatim instead of 'baseName_1'
*/
function makeUniqueName(baseName, checkFn, optimistic, scoped) {
if (checkFn === void 0) { checkFn = isUniqueName; }
if (optimistic) {
if (checkFn(baseName)) {
if (scoped) {
reserveNameInNestedScopes(baseName);
}
else {
generatedNames.add(baseName);
}
return baseName;
}
}
// Find the first unique 'name_n', where n is a positive number
if (baseName.charCodeAt(baseName.length - 1) !== 95 /* _ */) {
baseName += "_";
}
var i = 1;
while (true) {
var generatedName = baseName + i;
if (checkFn(generatedName)) {
if (scoped) {
reserveNameInNestedScopes(generatedName);
}
else {
generatedNames.add(generatedName);
}
return generatedName;
}
i++;
}
}
function makeFileLevelOptimisticUniqueName(name) {
return makeUniqueName(name, isFileLevelUniqueName, /*optimistic*/ true);
}
/**
* Generates a unique name for a ModuleDeclaration or EnumDeclaration.
*/
function generateNameForModuleOrEnum(node) {
var name = getTextOfNode(node.name);
// Use module/enum name itself if it is unique, otherwise make a unique variation
return isUniqueLocalName(name, node) ? name : makeUniqueName(name);
}
/**
* Generates a unique name for an ImportDeclaration or ExportDeclaration.
*/
function generateNameForImportOrExportDeclaration(node) {
var expr = ts.getExternalModuleName(node); // TODO: GH#18217
var baseName = ts.isStringLiteral(expr) ?
ts.makeIdentifierFromModuleName(expr.text) : "module";
return makeUniqueName(baseName);
}
/**
* Generates a unique name for a default export.
*/
function generateNameForExportDefault() {
return makeUniqueName("default");
}
/**
* Generates a unique name for a class expression.
*/
function generateNameForClassExpression() {
return makeUniqueName("class");
}
function generateNameForMethodOrAccessor(node) {
if (ts.isIdentifier(node.name)) {
return generateNameCached(node.name);
}
return makeTempVariableName(0 /* Auto */);
}
/**
* Generates a unique name from a node.
*/
function generateNameForNode(node, flags) {
switch (node.kind) {
case 79 /* Identifier */:
return makeUniqueName(getTextOfNode(node), isUniqueName, !!(flags & 16 /* Optimistic */), !!(flags & 8 /* ReservedInNestedScopes */));
case 259 /* ModuleDeclaration */:
case 258 /* EnumDeclaration */:
return generateNameForModuleOrEnum(node);
case 264 /* ImportDeclaration */:
case 270 /* ExportDeclaration */:
return generateNameForImportOrExportDeclaration(node);
case 254 /* FunctionDeclaration */:
case 255 /* ClassDeclaration */:
case 269 /* ExportAssignment */:
return generateNameForExportDefault();
case 224 /* ClassExpression */:
return generateNameForClassExpression();
case 167 /* MethodDeclaration */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
return generateNameForMethodOrAccessor(node);
case 160 /* ComputedPropertyName */:
return makeTempVariableName(0 /* Auto */, /*reserveInNestedScopes*/ true);
default:
return makeTempVariableName(0 /* Auto */);
}
}
/**
* Generates a unique identifier for a node.
*/
function makeName(name) {
switch (name.autoGenerateFlags & 7 /* KindMask */) {
case 1 /* Auto */:
return makeTempVariableName(0 /* Auto */, !!(name.autoGenerateFlags & 8 /* ReservedInNestedScopes */));
case 2 /* Loop */:
return makeTempVariableName(268435456 /* _i */, !!(name.autoGenerateFlags & 8 /* ReservedInNestedScopes */));
case 3 /* Unique */:
return makeUniqueName(ts.idText(name), (name.autoGenerateFlags & 32 /* FileLevel */) ? isFileLevelUniqueName : isUniqueName, !!(name.autoGenerateFlags & 16 /* Optimistic */), !!(name.autoGenerateFlags & 8 /* ReservedInNestedScopes */));
}
return ts.Debug.fail("Unsupported GeneratedIdentifierKind.");
}
/**
* Gets the node from which a name should be generated.
*/
function getNodeForGeneratedName(name) {
var autoGenerateId = name.autoGenerateId;
var node = name;
var original = node.original;
while (original) {
node = original;
// if "node" is a different generated name (having a different
// "autoGenerateId"), use it and stop traversing.
if (ts.isIdentifier(node)
&& !!(node.autoGenerateFlags & 4 /* Node */)
&& node.autoGenerateId !== autoGenerateId) {
break;
}
original = node.original;
}
// otherwise, return the original node for the source;
return node;
}
// Comments
function pipelineEmitWithComments(hint, node) {
var pipelinePhase = getNextPipelinePhase(2 /* Comments */, hint, node);
var savedContainerPos = containerPos;
var savedContainerEnd = containerEnd;
var savedDeclarationListContainerEnd = declarationListContainerEnd;
emitCommentsBeforeNode(node);
pipelinePhase(hint, node);
emitCommentsAfterNode(node, savedContainerPos, savedContainerEnd, savedDeclarationListContainerEnd);
}
function emitCommentsBeforeNode(node) {
var emitFlags = ts.getEmitFlags(node);
var commentRange = ts.getCommentRange(node);
// Emit leading comments
emitLeadingCommentsOfNode(node, emitFlags, commentRange.pos, commentRange.end);
if (emitFlags & 2048 /* NoNestedComments */) {
commentsDisabled = true;
}
}
function emitCommentsAfterNode(node, savedContainerPos, savedContainerEnd, savedDeclarationListContainerEnd) {
var emitFlags = ts.getEmitFlags(node);
var commentRange = ts.getCommentRange(node);
// Emit trailing comments
if (emitFlags & 2048 /* NoNestedComments */) {
commentsDisabled = false;
}
emitTrailingCommentsOfNode(node, emitFlags, commentRange.pos, commentRange.end, savedContainerPos, savedContainerEnd, savedDeclarationListContainerEnd);
}
function emitLeadingCommentsOfNode(node, emitFlags, pos, end) {
enterComment();
hasWrittenComment = false;
// We have to explicitly check that the node is JsxText because if the compilerOptions.jsx is "preserve" we will not do any transformation.
// It is expensive to walk entire tree just to set one kind of node to have no comments.
var skipLeadingComments = pos < 0 || (emitFlags & 512 /* NoLeadingComments */) !== 0 || node.kind === 11 /* JsxText */;
var skipTrailingComments = end < 0 || (emitFlags & 1024 /* NoTrailingComments */) !== 0 || node.kind === 11 /* JsxText */;
// Save current container state on the stack.
if ((pos > 0 || end > 0) && pos !== end) {
// Emit leading comments if the position is not synthesized and the node
// has not opted out from emitting leading comments.
if (!skipLeadingComments) {
emitLeadingComments(pos, /*isEmittedNode*/ node.kind !== 344 /* NotEmittedStatement */);
}
if (!skipLeadingComments || (pos >= 0 && (emitFlags & 512 /* NoLeadingComments */) !== 0)) {
// Advance the container position if comments get emitted or if they've been disabled explicitly using NoLeadingComments.
containerPos = pos;
}
if (!skipTrailingComments || (end >= 0 && (emitFlags & 1024 /* NoTrailingComments */) !== 0)) {
// As above.
containerEnd = end;
// To avoid invalid comment emit in a down-level binding pattern, we
// keep track of the last declaration list container's end
if (node.kind === 253 /* VariableDeclarationList */) {
declarationListContainerEnd = end;
}
}
}
ts.forEach(ts.getSyntheticLeadingComments(node), emitLeadingSynthesizedComment);
exitComment();
}
function emitTrailingCommentsOfNode(node, emitFlags, pos, end, savedContainerPos, savedContainerEnd, savedDeclarationListContainerEnd) {
enterComment();
var skipTrailingComments = end < 0 || (emitFlags & 1024 /* NoTrailingComments */) !== 0 || node.kind === 11 /* JsxText */;
ts.forEach(ts.getSyntheticTrailingComments(node), emitTrailingSynthesizedComment);
if ((pos > 0 || end > 0) && pos !== end) {
// Restore previous container state.
containerPos = savedContainerPos;
containerEnd = savedContainerEnd;
declarationListContainerEnd = savedDeclarationListContainerEnd;
// Emit trailing comments if the position is not synthesized and the node
// has not opted out from emitting leading comments and is an emitted node.
if (!skipTrailingComments && node.kind !== 344 /* NotEmittedStatement */) {
emitTrailingComments(end);
}
}
exitComment();
}
function emitLeadingSynthesizedComment(comment) {
if (comment.hasLeadingNewline || comment.kind === 2 /* SingleLineCommentTrivia */) {
writer.writeLine();
}
writeSynthesizedComment(comment);
if (comment.hasTrailingNewLine || comment.kind === 2 /* SingleLineCommentTrivia */) {
writer.writeLine();
}
else {
writer.writeSpace(" ");
}
}
function emitTrailingSynthesizedComment(comment) {
if (!writer.isAtStartOfLine()) {
writer.writeSpace(" ");
}
writeSynthesizedComment(comment);
if (comment.hasTrailingNewLine) {
writer.writeLine();
}
}
function writeSynthesizedComment(comment) {
var text = formatSynthesizedComment(comment);
var lineMap = comment.kind === 3 /* MultiLineCommentTrivia */ ? ts.computeLineStarts(text) : undefined;
ts.writeCommentRange(text, lineMap, writer, 0, text.length, newLine);
}
function formatSynthesizedComment(comment) {
return comment.kind === 3 /* MultiLineCommentTrivia */
? "/*" + comment.text + "*/"
: "//" + comment.text;
}
function emitBodyWithDetachedComments(node, detachedRange, emitCallback) {
enterComment();
var pos = detachedRange.pos, end = detachedRange.end;
var emitFlags = ts.getEmitFlags(node);
var skipLeadingComments = pos < 0 || (emitFlags & 512 /* NoLeadingComments */) !== 0;
var skipTrailingComments = commentsDisabled || end < 0 || (emitFlags & 1024 /* NoTrailingComments */) !== 0;
if (!skipLeadingComments) {
emitDetachedCommentsAndUpdateCommentsInfo(detachedRange);
}
exitComment();
if (emitFlags & 2048 /* NoNestedComments */ && !commentsDisabled) {
commentsDisabled = true;
emitCallback(node);
commentsDisabled = false;
}
else {
emitCallback(node);
}
enterComment();
if (!skipTrailingComments) {
emitLeadingComments(detachedRange.end, /*isEmittedNode*/ true);
if (hasWrittenComment && !writer.isAtStartOfLine()) {
writer.writeLine();
}
}
exitComment();
}
function originalNodesHaveSameParent(nodeA, nodeB) {
nodeA = ts.getOriginalNode(nodeA);
// For performance, do not call `getOriginalNode` for `nodeB` if `nodeA` doesn't even
// have a parent node.
return nodeA.parent && nodeA.parent === ts.getOriginalNode(nodeB).parent;
}
function siblingNodePositionsAreComparable(previousNode, nextNode) {
if (nextNode.pos < previousNode.end) {
return false;
}
previousNode = ts.getOriginalNode(previousNode);
nextNode = ts.getOriginalNode(nextNode);
var parent = previousNode.parent;
if (!parent || parent !== nextNode.parent) {
return false;
}
var parentNodeArray = ts.getContainingNodeArray(previousNode);
var prevNodeIndex = parentNodeArray === null || parentNodeArray === void 0 ? void 0 : parentNodeArray.indexOf(previousNode);
return prevNodeIndex !== undefined && prevNodeIndex > -1 && parentNodeArray.indexOf(nextNode) === prevNodeIndex + 1;
}
function emitLeadingComments(pos, isEmittedNode) {
hasWrittenComment = false;
if (isEmittedNode) {
if (pos === 0 && (currentSourceFile === null || currentSourceFile === void 0 ? void 0 : currentSourceFile.isDeclarationFile)) {
forEachLeadingCommentToEmit(pos, emitNonTripleSlashLeadingComment);
}
else {
forEachLeadingCommentToEmit(pos, emitLeadingComment);
}
}
else if (pos === 0) {
// If the node will not be emitted in JS, remove all the comments(normal, pinned and ///) associated with the node,
// unless it is a triple slash comment at the top of the file.
// For Example:
// /// <reference-path ...>
// declare var x;
// /// <reference-path ...>
// interface F {}
// The first /// will NOT be removed while the second one will be removed even though both node will not be emitted
forEachLeadingCommentToEmit(pos, emitTripleSlashLeadingComment);
}
}
function emitTripleSlashLeadingComment(commentPos, commentEnd, kind, hasTrailingNewLine, rangePos) {
if (isTripleSlashComment(commentPos, commentEnd)) {
emitLeadingComment(commentPos, commentEnd, kind, hasTrailingNewLine, rangePos);
}
}
function emitNonTripleSlashLeadingComment(commentPos, commentEnd, kind, hasTrailingNewLine, rangePos) {
if (!isTripleSlashComment(commentPos, commentEnd)) {
emitLeadingComment(commentPos, commentEnd, kind, hasTrailingNewLine, rangePos);
}
}
function shouldWriteComment(text, pos) {
if (printerOptions.onlyPrintJsDocStyle) {
return (ts.isJSDocLikeText(text, pos) || ts.isPinnedComment(text, pos));
}
return true;
}
function emitLeadingComment(commentPos, commentEnd, kind, hasTrailingNewLine, rangePos) {
if (!shouldWriteComment(currentSourceFile.text, commentPos))
return;
if (!hasWrittenComment) {
ts.emitNewLineBeforeLeadingCommentOfPosition(getCurrentLineMap(), writer, rangePos, commentPos);
hasWrittenComment = true;
}
// Leading comments are emitted at /*leading comment1 */space/*leading comment*/space
emitPos(commentPos);
ts.writeCommentRange(currentSourceFile.text, getCurrentLineMap(), writer, commentPos, commentEnd, newLine);
emitPos(commentEnd);
if (hasTrailingNewLine) {
writer.writeLine();
}
else if (kind === 3 /* MultiLineCommentTrivia */) {
writer.writeSpace(" ");
}
}
function emitLeadingCommentsOfPosition(pos) {
if (commentsDisabled || pos === -1) {
return;
}
emitLeadingComments(pos, /*isEmittedNode*/ true);
}
function emitTrailingComments(pos) {
forEachTrailingCommentToEmit(pos, emitTrailingComment);
}
function emitTrailingComment(commentPos, commentEnd, _kind, hasTrailingNewLine) {
if (!shouldWriteComment(currentSourceFile.text, commentPos))
return;
// trailing comments are emitted at space/*trailing comment1 */space/*trailing comment2*/
if (!writer.isAtStartOfLine()) {
writer.writeSpace(" ");
}
emitPos(commentPos);
ts.writeCommentRange(currentSourceFile.text, getCurrentLineMap(), writer, commentPos, commentEnd, newLine);
emitPos(commentEnd);
if (hasTrailingNewLine) {
writer.writeLine();
}
}
function emitTrailingCommentsOfPosition(pos, prefixSpace, forceNoNewline) {
if (commentsDisabled) {
return;
}
enterComment();
forEachTrailingCommentToEmit(pos, prefixSpace ? emitTrailingComment : forceNoNewline ? emitTrailingCommentOfPositionNoNewline : emitTrailingCommentOfPosition);
exitComment();
}
function emitTrailingCommentOfPositionNoNewline(commentPos, commentEnd, kind) {
// trailing comments of a position are emitted at /*trailing comment1 */space/*trailing comment*/space
emitPos(commentPos);
ts.writeCommentRange(currentSourceFile.text, getCurrentLineMap(), writer, commentPos, commentEnd, newLine);
emitPos(commentEnd);
if (kind === 2 /* SingleLineCommentTrivia */) {
writer.writeLine(); // still write a newline for single-line comments, so closing tokens aren't written on the same line
}
}
function emitTrailingCommentOfPosition(commentPos, commentEnd, _kind, hasTrailingNewLine) {
// trailing comments of a position are emitted at /*trailing comment1 */space/*trailing comment*/space
emitPos(commentPos);
ts.writeCommentRange(currentSourceFile.text, getCurrentLineMap(), writer, commentPos, commentEnd, newLine);
emitPos(commentEnd);
if (hasTrailingNewLine) {
writer.writeLine();
}
else {
writer.writeSpace(" ");
}
}
function forEachLeadingCommentToEmit(pos, cb) {
// Emit the leading comments only if the container's pos doesn't match because the container should take care of emitting these comments
if (currentSourceFile && (containerPos === -1 || pos !== containerPos)) {
if (hasDetachedComments(pos)) {
forEachLeadingCommentWithoutDetachedComments(cb);
}
else {
ts.forEachLeadingCommentRange(currentSourceFile.text, pos, cb, /*state*/ pos);
}
}
}
function forEachTrailingCommentToEmit(end, cb) {
// Emit the trailing comments only if the container's end doesn't match because the container should take care of emitting these comments
if (currentSourceFile && (containerEnd === -1 || (end !== containerEnd && end !== declarationListContainerEnd))) {
ts.forEachTrailingCommentRange(currentSourceFile.text, end, cb);
}
}
function hasDetachedComments(pos) {
return detachedCommentsInfo !== undefined && ts.last(detachedCommentsInfo).nodePos === pos;
}
function forEachLeadingCommentWithoutDetachedComments(cb) {
// get the leading comments from detachedPos
var pos = ts.last(detachedCommentsInfo).detachedCommentEndPos;
if (detachedCommentsInfo.length - 1) {
detachedCommentsInfo.pop();
}
else {
detachedCommentsInfo = undefined;
}
ts.forEachLeadingCommentRange(currentSourceFile.text, pos, cb, /*state*/ pos);
}
function emitDetachedCommentsAndUpdateCommentsInfo(range) {
var currentDetachedCommentInfo = ts.emitDetachedComments(currentSourceFile.text, getCurrentLineMap(), writer, emitComment, range, newLine, commentsDisabled);
if (currentDetachedCommentInfo) {
if (detachedCommentsInfo) {
detachedCommentsInfo.push(currentDetachedCommentInfo);
}
else {
detachedCommentsInfo = [currentDetachedCommentInfo];
}
}
}
function emitComment(text, lineMap, writer, commentPos, commentEnd, newLine) {
if (!shouldWriteComment(currentSourceFile.text, commentPos))
return;
emitPos(commentPos);
ts.writeCommentRange(text, lineMap, writer, commentPos, commentEnd, newLine);
emitPos(commentEnd);
}
/**
* Determine if the given comment is a triple-slash
*
* @return true if the comment is a triple-slash comment else false
*/
function isTripleSlashComment(commentPos, commentEnd) {
return ts.isRecognizedTripleSlashComment(currentSourceFile.text, commentPos, commentEnd);
}
// Source Maps
function getParsedSourceMap(node) {
if (node.parsedSourceMap === undefined && node.sourceMapText !== undefined) {
node.parsedSourceMap = ts.tryParseRawSourceMap(node.sourceMapText) || false;
}
return node.parsedSourceMap || undefined;
}
function pipelineEmitWithSourceMaps(hint, node) {
var pipelinePhase = getNextPipelinePhase(3 /* SourceMaps */, hint, node);
emitSourceMapsBeforeNode(node);
pipelinePhase(hint, node);
emitSourceMapsAfterNode(node);
}
function emitSourceMapsBeforeNode(node) {
var emitFlags = ts.getEmitFlags(node);
var sourceMapRange = ts.getSourceMapRange(node);
// Emit leading sourcemap
if (ts.isUnparsedNode(node)) {
ts.Debug.assertIsDefined(node.parent, "UnparsedNodes must have parent pointers");
var parsed = getParsedSourceMap(node.parent);
if (parsed && sourceMapGenerator) {
sourceMapGenerator.appendSourceMap(writer.getLine(), writer.getColumn(), parsed, node.parent.sourceMapPath, node.parent.getLineAndCharacterOfPosition(node.pos), node.parent.getLineAndCharacterOfPosition(node.end));
}
}
else {
var source = sourceMapRange.source || sourceMapSource;
if (node.kind !== 344 /* NotEmittedStatement */
&& (emitFlags & 16 /* NoLeadingSourceMap */) === 0
&& sourceMapRange.pos >= 0) {
emitSourcePos(sourceMapRange.source || sourceMapSource, skipSourceTrivia(source, sourceMapRange.pos));
}
if (emitFlags & 64 /* NoNestedSourceMaps */) {
sourceMapsDisabled = true;
}
}
}
function emitSourceMapsAfterNode(node) {
var emitFlags = ts.getEmitFlags(node);
var sourceMapRange = ts.getSourceMapRange(node);
// Emit trailing sourcemap
if (!ts.isUnparsedNode(node)) {
if (emitFlags & 64 /* NoNestedSourceMaps */) {
sourceMapsDisabled = false;
}
if (node.kind !== 344 /* NotEmittedStatement */
&& (emitFlags & 32 /* NoTrailingSourceMap */) === 0
&& sourceMapRange.end >= 0) {
emitSourcePos(sourceMapRange.source || sourceMapSource, sourceMapRange.end);
}
}
}
/**
* Skips trivia such as comments and white-space that can be optionally overridden by the source-map source
*/
function skipSourceTrivia(source, pos) {
return source.skipTrivia ? source.skipTrivia(pos) : ts.skipTrivia(source.text, pos);
}
/**
* Emits a mapping.
*
* If the position is synthetic (undefined or a negative value), no mapping will be
* created.
*
* @param pos The position.
*/
function emitPos(pos) {
if (sourceMapsDisabled || ts.positionIsSynthesized(pos) || isJsonSourceMapSource(sourceMapSource)) {
return;
}
var _a = ts.getLineAndCharacterOfPosition(sourceMapSource, pos), sourceLine = _a.line, sourceCharacter = _a.character;
sourceMapGenerator.addMapping(writer.getLine(), writer.getColumn(), sourceMapSourceIndex, sourceLine, sourceCharacter,
/*nameIndex*/ undefined);
}
function emitSourcePos(source, pos) {
if (source !== sourceMapSource) {
var savedSourceMapSource = sourceMapSource;
var savedSourceMapSourceIndex = sourceMapSourceIndex;
setSourceMapSource(source);
emitPos(pos);
resetSourceMapSource(savedSourceMapSource, savedSourceMapSourceIndex);
}
else {
emitPos(pos);
}
}
/**
* Emits a token of a node with possible leading and trailing source maps.
*
* @param node The node containing the token.
* @param token The token to emit.
* @param tokenStartPos The start pos of the token.
* @param emitCallback The callback used to emit the token.
*/
function emitTokenWithSourceMap(node, token, writer, tokenPos, emitCallback) {
if (sourceMapsDisabled || node && ts.isInJsonFile(node)) {
return emitCallback(token, writer, tokenPos);
}
var emitNode = node && node.emitNode;
var emitFlags = emitNode && emitNode.flags || 0 /* None */;
var range = emitNode && emitNode.tokenSourceMapRanges && emitNode.tokenSourceMapRanges[token];
var source = range && range.source || sourceMapSource;
tokenPos = skipSourceTrivia(source, range ? range.pos : tokenPos);
if ((emitFlags & 128 /* NoTokenLeadingSourceMaps */) === 0 && tokenPos >= 0) {
emitSourcePos(source, tokenPos);
}
tokenPos = emitCallback(token, writer, tokenPos);
if (range)
tokenPos = range.end;
if ((emitFlags & 256 /* NoTokenTrailingSourceMaps */) === 0 && tokenPos >= 0) {
emitSourcePos(source, tokenPos);
}
return tokenPos;
}
function setSourceMapSource(source) {
if (sourceMapsDisabled) {
return;
}
sourceMapSource = source;
if (source === mostRecentlyAddedSourceMapSource) {
// Fast path for when the new source map is the most recently added, in which case
// we use its captured index without going through the source map generator.
sourceMapSourceIndex = mostRecentlyAddedSourceMapSourceIndex;
return;
}
if (isJsonSourceMapSource(source)) {
return;
}
sourceMapSourceIndex = sourceMapGenerator.addSource(source.fileName);
if (printerOptions.inlineSources) {
sourceMapGenerator.setSourceContent(sourceMapSourceIndex, source.text);
}
mostRecentlyAddedSourceMapSource = source;
mostRecentlyAddedSourceMapSourceIndex = sourceMapSourceIndex;
}
function resetSourceMapSource(source, sourceIndex) {
sourceMapSource = source;
sourceMapSourceIndex = sourceIndex;
}
function isJsonSourceMapSource(sourceFile) {
return ts.fileExtensionIs(sourceFile.fileName, ".json" /* Json */);
}
}
ts.createPrinter = createPrinter;
function createBracketsMap() {
var brackets = [];
brackets[1024 /* Braces */] = ["{", "}"];
brackets[2048 /* Parenthesis */] = ["(", ")"];
brackets[4096 /* AngleBrackets */] = ["<", ">"];
brackets[8192 /* SquareBrackets */] = ["[", "]"];
return brackets;
}
function getOpeningBracket(format) {
return brackets[format & 15360 /* BracketsMask */][0];
}
function getClosingBracket(format) {
return brackets[format & 15360 /* BracketsMask */][1];
}
// Flags enum to track count of temp variables and a few dedicated names
var TempFlags;
(function (TempFlags) {
TempFlags[TempFlags["Auto"] = 0] = "Auto";
TempFlags[TempFlags["CountMask"] = 268435455] = "CountMask";
TempFlags[TempFlags["_i"] = 268435456] = "_i";
})(TempFlags || (TempFlags = {}));
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
function createCachedDirectoryStructureHost(host, currentDirectory, useCaseSensitiveFileNames) {
if (!host.getDirectories || !host.readDirectory) {
return undefined;
}
var cachedReadDirectoryResult = new ts.Map();
var getCanonicalFileName = ts.createGetCanonicalFileName(useCaseSensitiveFileNames);
return {
useCaseSensitiveFileNames: useCaseSensitiveFileNames,
fileExists: fileExists,
readFile: function (path, encoding) { return host.readFile(path, encoding); },
directoryExists: host.directoryExists && directoryExists,
getDirectories: getDirectories,
readDirectory: readDirectory,
createDirectory: host.createDirectory && createDirectory,
writeFile: host.writeFile && writeFile,
addOrDeleteFileOrDirectory: addOrDeleteFileOrDirectory,
addOrDeleteFile: addOrDeleteFile,
clearCache: clearCache,
realpath: host.realpath && realpath
};
function toPath(fileName) {
return ts.toPath(fileName, currentDirectory, getCanonicalFileName);
}
function getCachedFileSystemEntries(rootDirPath) {
return cachedReadDirectoryResult.get(ts.ensureTrailingDirectorySeparator(rootDirPath));
}
function getCachedFileSystemEntriesForBaseDir(path) {
return getCachedFileSystemEntries(ts.getDirectoryPath(path));
}
function getBaseNameOfFileName(fileName) {
return ts.getBaseFileName(ts.normalizePath(fileName));
}
function createCachedFileSystemEntries(rootDir, rootDirPath) {
var _a;
if (!host.realpath || ts.ensureTrailingDirectorySeparator(toPath(host.realpath(rootDir))) === rootDirPath) {
var resultFromHost = {
files: ts.map(host.readDirectory(rootDir, /*extensions*/ undefined, /*exclude*/ undefined, /*include*/ ["*.*"]), getBaseNameOfFileName) || [],
directories: host.getDirectories(rootDir) || []
};
cachedReadDirectoryResult.set(ts.ensureTrailingDirectorySeparator(rootDirPath), resultFromHost);
return resultFromHost;
}
// If the directory is symlink do not cache the result
if ((_a = host.directoryExists) === null || _a === void 0 ? void 0 : _a.call(host, rootDir)) {
cachedReadDirectoryResult.set(rootDirPath, false);
return false;
}
// Non existing directory
return undefined;
}
/**
* If the readDirectory result was already cached, it returns that
* Otherwise gets result from host and caches it.
* The host request is done under try catch block to avoid caching incorrect result
*/
function tryReadDirectory(rootDir, rootDirPath) {
rootDirPath = ts.ensureTrailingDirectorySeparator(rootDirPath);
var cachedResult = getCachedFileSystemEntries(rootDirPath);
if (cachedResult) {
return cachedResult;
}
try {
return createCachedFileSystemEntries(rootDir, rootDirPath);
}
catch (_e) {
// If there is exception to read directories, dont cache the result and direct the calls to host
ts.Debug.assert(!cachedReadDirectoryResult.has(ts.ensureTrailingDirectorySeparator(rootDirPath)));
return undefined;
}
}
function fileNameEqual(name1, name2) {
return getCanonicalFileName(name1) === getCanonicalFileName(name2);
}
function hasEntry(entries, name) {
return ts.some(entries, function (file) { return fileNameEqual(file, name); });
}
function updateFileSystemEntry(entries, baseName, isValid) {
if (hasEntry(entries, baseName)) {
if (!isValid) {
return ts.filterMutate(entries, function (entry) { return !fileNameEqual(entry, baseName); });
}
}
else if (isValid) {
return entries.push(baseName);
}
}
function writeFile(fileName, data, writeByteOrderMark) {
var path = toPath(fileName);
var result = getCachedFileSystemEntriesForBaseDir(path);
if (result) {
updateFilesOfFileSystemEntry(result, getBaseNameOfFileName(fileName), /*fileExists*/ true);
}
return host.writeFile(fileName, data, writeByteOrderMark);
}
function fileExists(fileName) {
var path = toPath(fileName);
var result = getCachedFileSystemEntriesForBaseDir(path);
return result && hasEntry(result.files, getBaseNameOfFileName(fileName)) ||
host.fileExists(fileName);
}
function directoryExists(dirPath) {
var path = toPath(dirPath);
return cachedReadDirectoryResult.has(ts.ensureTrailingDirectorySeparator(path)) || host.directoryExists(dirPath);
}
function createDirectory(dirPath) {
var path = toPath(dirPath);
var result = getCachedFileSystemEntriesForBaseDir(path);
var baseFileName = getBaseNameOfFileName(dirPath);
if (result) {
updateFileSystemEntry(result.directories, baseFileName, /*isValid*/ true);
}
host.createDirectory(dirPath);
}
function getDirectories(rootDir) {
var rootDirPath = toPath(rootDir);
var result = tryReadDirectory(rootDir, rootDirPath);
if (result) {
return result.directories.slice();
}
return host.getDirectories(rootDir);
}
function readDirectory(rootDir, extensions, excludes, includes, depth) {
var rootDirPath = toPath(rootDir);
var rootResult = tryReadDirectory(rootDir, rootDirPath);
var rootSymLinkResult;
if (rootResult !== undefined) {
return ts.matchFiles(rootDir, extensions, excludes, includes, useCaseSensitiveFileNames, currentDirectory, depth, getFileSystemEntries, realpath, directoryExists);
}
return host.readDirectory(rootDir, extensions, excludes, includes, depth);
function getFileSystemEntries(dir) {
var path = toPath(dir);
if (path === rootDirPath) {
return rootResult || getFileSystemEntriesFromHost(dir, path);
}
var result = tryReadDirectory(dir, path);
return result !== undefined ?
result || getFileSystemEntriesFromHost(dir, path) :
ts.emptyFileSystemEntries;
}
function getFileSystemEntriesFromHost(dir, path) {
if (rootSymLinkResult && path === rootDirPath)
return rootSymLinkResult;
var result = {
files: ts.map(host.readDirectory(dir, /*extensions*/ undefined, /*exclude*/ undefined, /*include*/ ["*.*"]), getBaseNameOfFileName) || ts.emptyArray,
directories: host.getDirectories(dir) || ts.emptyArray
};
if (path === rootDirPath)
rootSymLinkResult = result;
return result;
}
}
function realpath(s) {
return host.realpath ? host.realpath(s) : s;
}
function addOrDeleteFileOrDirectory(fileOrDirectory, fileOrDirectoryPath) {
var existingResult = getCachedFileSystemEntries(fileOrDirectoryPath);
if (existingResult !== undefined) {
// Just clear the cache for now
// For now just clear the cache, since this could mean that multiple level entries might need to be re-evaluated
clearCache();
return undefined;
}
var parentResult = getCachedFileSystemEntriesForBaseDir(fileOrDirectoryPath);
if (!parentResult) {
return undefined;
}
// This was earlier a file (hence not in cached directory contents)
// or we never cached the directory containing it
if (!host.directoryExists) {
// Since host doesnt support directory exists, clear the cache as otherwise it might not be same
clearCache();
return undefined;
}
var baseName = getBaseNameOfFileName(fileOrDirectory);
var fsQueryResult = {
fileExists: host.fileExists(fileOrDirectoryPath),
directoryExists: host.directoryExists(fileOrDirectoryPath)
};
if (fsQueryResult.directoryExists || hasEntry(parentResult.directories, baseName)) {
// Folder added or removed, clear the cache instead of updating the folder and its structure
clearCache();
}
else {
// No need to update the directory structure, just files
updateFilesOfFileSystemEntry(parentResult, baseName, fsQueryResult.fileExists);
}
return fsQueryResult;
}
function addOrDeleteFile(fileName, filePath, eventKind) {
if (eventKind === ts.FileWatcherEventKind.Changed) {
return;
}
var parentResult = getCachedFileSystemEntriesForBaseDir(filePath);
if (parentResult) {
updateFilesOfFileSystemEntry(parentResult, getBaseNameOfFileName(fileName), eventKind === ts.FileWatcherEventKind.Created);
}
}
function updateFilesOfFileSystemEntry(parentResult, baseName, fileExists) {
updateFileSystemEntry(parentResult.files, baseName, fileExists);
}
function clearCache() {
cachedReadDirectoryResult.clear();
}
}
ts.createCachedDirectoryStructureHost = createCachedDirectoryStructureHost;
var ConfigFileProgramReloadLevel;
(function (ConfigFileProgramReloadLevel) {
ConfigFileProgramReloadLevel[ConfigFileProgramReloadLevel["None"] = 0] = "None";
/** Update the file name list from the disk */
ConfigFileProgramReloadLevel[ConfigFileProgramReloadLevel["Partial"] = 1] = "Partial";
/** Reload completely by re-reading contents of config file from disk and updating program */
ConfigFileProgramReloadLevel[ConfigFileProgramReloadLevel["Full"] = 2] = "Full";
})(ConfigFileProgramReloadLevel = ts.ConfigFileProgramReloadLevel || (ts.ConfigFileProgramReloadLevel = {}));
/**
* Updates the map of shared extended config file watches with a new set of extended config files from a base config file of the project
*/
function updateSharedExtendedConfigFileWatcher(projectPath, options, extendedConfigFilesMap, createExtendedConfigFileWatch, toPath) {
var _a;
var extendedConfigs = ts.arrayToMap(((_a = options === null || options === void 0 ? void 0 : options.configFile) === null || _a === void 0 ? void 0 : _a.extendedSourceFiles) || ts.emptyArray, toPath);
// remove project from all unrelated watchers
extendedConfigFilesMap.forEach(function (watcher, extendedConfigFilePath) {
if (!extendedConfigs.has(extendedConfigFilePath)) {
watcher.projects.delete(projectPath);
watcher.close();
}
});
// Update the extended config files watcher
extendedConfigs.forEach(function (extendedConfigFileName, extendedConfigFilePath) {
var existing = extendedConfigFilesMap.get(extendedConfigFilePath);
if (existing) {
existing.projects.add(projectPath);
}
else {
// start watching previously unseen extended config
extendedConfigFilesMap.set(extendedConfigFilePath, {
projects: new ts.Set([projectPath]),
watcher: createExtendedConfigFileWatch(extendedConfigFileName, extendedConfigFilePath),
close: function () {
var existing = extendedConfigFilesMap.get(extendedConfigFilePath);
if (!existing || existing.projects.size !== 0)
return;
existing.watcher.close();
extendedConfigFilesMap.delete(extendedConfigFilePath);
},
});
}
});
}
ts.updateSharedExtendedConfigFileWatcher = updateSharedExtendedConfigFileWatcher;
/**
* Remove the project from the extended config file watchers and close not needed watches
*/
function clearSharedExtendedConfigFileWatcher(projectPath, extendedConfigFilesMap) {
extendedConfigFilesMap.forEach(function (watcher) {
if (watcher.projects.delete(projectPath))
watcher.close();
});
}
ts.clearSharedExtendedConfigFileWatcher = clearSharedExtendedConfigFileWatcher;
/**
* Clean the extendsConfigCache when extended config file has changed
*/
function cleanExtendedConfigCache(extendedConfigCache, extendedConfigFilePath, toPath) {
if (!extendedConfigCache.delete(extendedConfigFilePath))
return;
extendedConfigCache.forEach(function (_a, key) {
var _b;
var extendedResult = _a.extendedResult;
if ((_b = extendedResult.extendedSourceFiles) === null || _b === void 0 ? void 0 : _b.some(function (extendedFile) { return toPath(extendedFile) === extendedConfigFilePath; })) {
cleanExtendedConfigCache(extendedConfigCache, key, toPath);
}
});
}
ts.cleanExtendedConfigCache = cleanExtendedConfigCache;
/**
* Updates watchers based on the package json files used in module resolution
*/
function updatePackageJsonWatch(lookups, packageJsonWatches, createPackageJsonWatch) {
var newMap = new ts.Map(lookups);
ts.mutateMap(packageJsonWatches, newMap, {
createNewValue: createPackageJsonWatch,
onDeleteValue: ts.closeFileWatcher
});
}
ts.updatePackageJsonWatch = updatePackageJsonWatch;
/**
* Updates the existing missing file watches with the new set of missing files after new program is created
*/
function updateMissingFilePathsWatch(program, missingFileWatches, createMissingFileWatch) {
var missingFilePaths = program.getMissingFilePaths();
// TODO(rbuckton): Should be a `Set` but that requires changing the below code that uses `mutateMap`
var newMissingFilePathMap = ts.arrayToMap(missingFilePaths, ts.identity, ts.returnTrue);
// Update the missing file paths watcher
ts.mutateMap(missingFileWatches, newMissingFilePathMap, {
// Watch the missing files
createNewValue: createMissingFileWatch,
// Files that are no longer missing (e.g. because they are no longer required)
// should no longer be watched.
onDeleteValue: ts.closeFileWatcher
});
}
ts.updateMissingFilePathsWatch = updateMissingFilePathsWatch;
/**
* Updates the existing wild card directory watches with the new set of wild card directories from the config file
* after new program is created because the config file was reloaded or program was created first time from the config file
* Note that there is no need to call this function when the program is updated with additional files without reloading config files,
* as wildcard directories wont change unless reloading config file
*/
function updateWatchingWildcardDirectories(existingWatchedForWildcards, wildcardDirectories, watchDirectory) {
ts.mutateMap(existingWatchedForWildcards, wildcardDirectories, {
// Create new watch and recursive info
createNewValue: createWildcardDirectoryWatcher,
// Close existing watch thats not needed any more
onDeleteValue: closeFileWatcherOf,
// Close existing watch that doesnt match in the flags
onExistingValue: updateWildcardDirectoryWatcher
});
function createWildcardDirectoryWatcher(directory, flags) {
// Create new watch and recursive info
return {
watcher: watchDirectory(directory, flags),
flags: flags
};
}
function updateWildcardDirectoryWatcher(existingWatcher, flags, directory) {
// Watcher needs to be updated if the recursive flags dont match
if (existingWatcher.flags === flags) {
return;
}
existingWatcher.watcher.close();
existingWatchedForWildcards.set(directory, createWildcardDirectoryWatcher(directory, flags));
}
}
ts.updateWatchingWildcardDirectories = updateWatchingWildcardDirectories;
/* @internal */
function isIgnoredFileFromWildCardWatching(_a) {
var watchedDirPath = _a.watchedDirPath, fileOrDirectory = _a.fileOrDirectory, fileOrDirectoryPath = _a.fileOrDirectoryPath, configFileName = _a.configFileName, options = _a.options, program = _a.program, extraFileExtensions = _a.extraFileExtensions, currentDirectory = _a.currentDirectory, useCaseSensitiveFileNames = _a.useCaseSensitiveFileNames, writeLog = _a.writeLog, toPath = _a.toPath;
var newPath = ts.removeIgnoredPath(fileOrDirectoryPath);
if (!newPath) {
writeLog("Project: " + configFileName + " Detected ignored path: " + fileOrDirectory);
return true;
}
fileOrDirectoryPath = newPath;
if (fileOrDirectoryPath === watchedDirPath)
return false;
// If the the added or created file or directory is not supported file name, ignore the file
// But when watched directory is added/removed, we need to reload the file list
if (ts.hasExtension(fileOrDirectoryPath) && !ts.isSupportedSourceFileName(fileOrDirectory, options, extraFileExtensions)) {
writeLog("Project: " + configFileName + " Detected file add/remove of non supported extension: " + fileOrDirectory);
return true;
}
if (ts.isExcludedFile(fileOrDirectory, options.configFile.configFileSpecs, ts.getNormalizedAbsolutePath(ts.getDirectoryPath(configFileName), currentDirectory), useCaseSensitiveFileNames, currentDirectory)) {
writeLog("Project: " + configFileName + " Detected excluded file: " + fileOrDirectory);
return true;
}
if (!program)
return false;
// We want to ignore emit file check if file is not going to be emitted next to source file
// In that case we follow config file inclusion rules
if (ts.outFile(options) || options.outDir)
return false;
// File if emitted next to input needs to be ignored
if (ts.fileExtensionIs(fileOrDirectoryPath, ".d.ts" /* Dts */)) {
// If its declaration directory: its not ignored if not excluded by config
if (options.declarationDir)
return false;
}
else if (!ts.fileExtensionIsOneOf(fileOrDirectoryPath, ts.supportedJSExtensions)) {
return false;
}
// just check if sourceFile with the name exists
var filePathWithoutExtension = ts.removeFileExtension(fileOrDirectoryPath);
var realProgram = ts.isArray(program) ? undefined : isBuilderProgram(program) ? program.getProgramOrUndefined() : program;
var builderProgram = !realProgram && !ts.isArray(program) ? program : undefined;
if (hasSourceFile((filePathWithoutExtension + ".ts" /* Ts */)) ||
hasSourceFile((filePathWithoutExtension + ".tsx" /* Tsx */))) {
writeLog("Project: " + configFileName + " Detected output file: " + fileOrDirectory);
return true;
}
return false;
function hasSourceFile(file) {
return realProgram ?
!!realProgram.getSourceFileByPath(file) :
builderProgram ?
builderProgram.getState().fileInfos.has(file) :
!!ts.find(program, function (rootFile) { return toPath(rootFile) === file; });
}
}
ts.isIgnoredFileFromWildCardWatching = isIgnoredFileFromWildCardWatching;
function isBuilderProgram(program) {
return !!program.getState;
}
function isEmittedFileOfProgram(program, file) {
if (!program) {
return false;
}
return program.isEmittedFile(file);
}
ts.isEmittedFileOfProgram = isEmittedFileOfProgram;
var WatchLogLevel;
(function (WatchLogLevel) {
WatchLogLevel[WatchLogLevel["None"] = 0] = "None";
WatchLogLevel[WatchLogLevel["TriggerOnly"] = 1] = "TriggerOnly";
WatchLogLevel[WatchLogLevel["Verbose"] = 2] = "Verbose";
})(WatchLogLevel = ts.WatchLogLevel || (ts.WatchLogLevel = {}));
function getWatchFactory(host, watchLogLevel, log, getDetailWatchInfo) {
ts.setSysLog(watchLogLevel === WatchLogLevel.Verbose ? log : ts.noop);
var plainInvokeFactory = {
watchFile: function (file, callback, pollingInterval, options) { return host.watchFile(file, callback, pollingInterval, options); },
watchDirectory: function (directory, callback, flags, options) { return host.watchDirectory(directory, callback, (flags & 1 /* Recursive */) !== 0, options); },
};
var triggerInvokingFactory = watchLogLevel !== WatchLogLevel.None ?
{
watchFile: createTriggerLoggingAddWatch("watchFile"),
watchDirectory: createTriggerLoggingAddWatch("watchDirectory")
} :
undefined;
var factory = watchLogLevel === WatchLogLevel.Verbose ?
{
watchFile: createFileWatcherWithLogging,
watchDirectory: createDirectoryWatcherWithLogging
} :
triggerInvokingFactory || plainInvokeFactory;
var excludeWatcherFactory = watchLogLevel === WatchLogLevel.Verbose ?
createExcludeWatcherWithLogging :
ts.returnNoopFileWatcher;
return {
watchFile: createExcludeHandlingAddWatch("watchFile"),
watchDirectory: createExcludeHandlingAddWatch("watchDirectory")
};
function createExcludeHandlingAddWatch(key) {
return function (file, cb, flags, options, detailInfo1, detailInfo2) {
var _a;
return !ts.matchesExclude(file, key === "watchFile" ? options === null || options === void 0 ? void 0 : options.excludeFiles : options === null || options === void 0 ? void 0 : options.excludeDirectories, useCaseSensitiveFileNames(), ((_a = host.getCurrentDirectory) === null || _a === void 0 ? void 0 : _a.call(host)) || "") ?
factory[key].call(/*thisArgs*/ undefined, file, cb, flags, options, detailInfo1, detailInfo2) :
excludeWatcherFactory(file, flags, options, detailInfo1, detailInfo2);
};
}
function useCaseSensitiveFileNames() {
return typeof host.useCaseSensitiveFileNames === "boolean" ?
host.useCaseSensitiveFileNames :
host.useCaseSensitiveFileNames();
}
function createExcludeWatcherWithLogging(file, flags, options, detailInfo1, detailInfo2) {
log("ExcludeWatcher:: Added:: " + getWatchInfo(file, flags, options, detailInfo1, detailInfo2, getDetailWatchInfo));
return {
close: function () { return log("ExcludeWatcher:: Close:: " + getWatchInfo(file, flags, options, detailInfo1, detailInfo2, getDetailWatchInfo)); }
};
}
function createFileWatcherWithLogging(file, cb, flags, options, detailInfo1, detailInfo2) {
log("FileWatcher:: Added:: " + getWatchInfo(file, flags, options, detailInfo1, detailInfo2, getDetailWatchInfo));
var watcher = triggerInvokingFactory.watchFile(file, cb, flags, options, detailInfo1, detailInfo2);
return {
close: function () {
log("FileWatcher:: Close:: " + getWatchInfo(file, flags, options, detailInfo1, detailInfo2, getDetailWatchInfo));
watcher.close();
}
};
}
function createDirectoryWatcherWithLogging(file, cb, flags, options, detailInfo1, detailInfo2) {
var watchInfo = "DirectoryWatcher:: Added:: " + getWatchInfo(file, flags, options, detailInfo1, detailInfo2, getDetailWatchInfo);
log(watchInfo);
var start = ts.timestamp();
var watcher = triggerInvokingFactory.watchDirectory(file, cb, flags, options, detailInfo1, detailInfo2);
var elapsed = ts.timestamp() - start;
log("Elapsed:: " + elapsed + "ms " + watchInfo);
return {
close: function () {
var watchInfo = "DirectoryWatcher:: Close:: " + getWatchInfo(file, flags, options, detailInfo1, detailInfo2, getDetailWatchInfo);
log(watchInfo);
var start = ts.timestamp();
watcher.close();
var elapsed = ts.timestamp() - start;
log("Elapsed:: " + elapsed + "ms " + watchInfo);
}
};
}
function createTriggerLoggingAddWatch(key) {
return function (file, cb, flags, options, detailInfo1, detailInfo2) { return plainInvokeFactory[key].call(/*thisArgs*/ undefined, file, function () {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
var triggerredInfo = (key === "watchFile" ? "FileWatcher" : "DirectoryWatcher") + ":: Triggered with " + args[0] + " " + (args[1] !== undefined ? args[1] : "") + ":: " + getWatchInfo(file, flags, options, detailInfo1, detailInfo2, getDetailWatchInfo);
log(triggerredInfo);
var start = ts.timestamp();
cb.call.apply(cb, __spreadArray([/*thisArg*/ undefined], args, false));
var elapsed = ts.timestamp() - start;
log("Elapsed:: " + elapsed + "ms " + triggerredInfo);
}, flags, options, detailInfo1, detailInfo2); };
}
function getWatchInfo(file, flags, options, detailInfo1, detailInfo2, getDetailWatchInfo) {
return "WatchInfo: " + file + " " + flags + " " + JSON.stringify(options) + " " + (getDetailWatchInfo ? getDetailWatchInfo(detailInfo1, detailInfo2) : detailInfo2 === undefined ? detailInfo1 : detailInfo1 + " " + detailInfo2);
}
}
ts.getWatchFactory = getWatchFactory;
function getFallbackOptions(options) {
var fallbackPolling = options === null || options === void 0 ? void 0 : options.fallbackPolling;
return {
watchFile: fallbackPolling !== undefined ?
fallbackPolling :
ts.WatchFileKind.PriorityPollingInterval
};
}
ts.getFallbackOptions = getFallbackOptions;
function closeFileWatcherOf(objWithWatcher) {
objWithWatcher.watcher.close();
}
ts.closeFileWatcherOf = closeFileWatcherOf;
})(ts || (ts = {}));
var ts;
(function (ts) {
function findConfigFile(searchPath, fileExists, configName) {
if (configName === void 0) { configName = "tsconfig.json"; }
return ts.forEachAncestorDirectory(searchPath, function (ancestor) {
var fileName = ts.combinePaths(ancestor, configName);
return fileExists(fileName) ? fileName : undefined;
});
}
ts.findConfigFile = findConfigFile;
function resolveTripleslashReference(moduleName, containingFile) {
var basePath = ts.getDirectoryPath(containingFile);
var referencedFileName = ts.isRootedDiskPath(moduleName) ? moduleName : ts.combinePaths(basePath, moduleName);
return ts.normalizePath(referencedFileName);
}
ts.resolveTripleslashReference = resolveTripleslashReference;
/* @internal */
function computeCommonSourceDirectoryOfFilenames(fileNames, currentDirectory, getCanonicalFileName) {
var commonPathComponents;
var failed = ts.forEach(fileNames, function (sourceFile) {
// Each file contributes into common source file path
var sourcePathComponents = ts.getNormalizedPathComponents(sourceFile, currentDirectory);
sourcePathComponents.pop(); // The base file name is not part of the common directory path
if (!commonPathComponents) {
// first file
commonPathComponents = sourcePathComponents;
return;
}
var n = Math.min(commonPathComponents.length, sourcePathComponents.length);
for (var i = 0; i < n; i++) {
if (getCanonicalFileName(commonPathComponents[i]) !== getCanonicalFileName(sourcePathComponents[i])) {
if (i === 0) {
// Failed to find any common path component
return true;
}
// New common path found that is 0 -> i-1
commonPathComponents.length = i;
break;
}
}
// If the sourcePathComponents was shorter than the commonPathComponents, truncate to the sourcePathComponents
if (sourcePathComponents.length < commonPathComponents.length) {
commonPathComponents.length = sourcePathComponents.length;
}
});
// A common path can not be found when paths span multiple drives on windows, for example
if (failed) {
return "";
}
if (!commonPathComponents) { // Can happen when all input files are .d.ts files
return currentDirectory;
}
return ts.getPathFromPathComponents(commonPathComponents);
}
ts.computeCommonSourceDirectoryOfFilenames = computeCommonSourceDirectoryOfFilenames;
function createCompilerHost(options, setParentNodes) {
return createCompilerHostWorker(options, setParentNodes);
}
ts.createCompilerHost = createCompilerHost;
/*@internal*/
// TODO(shkamat): update this after reworking ts build API
function createCompilerHostWorker(options, setParentNodes, system) {
if (system === void 0) { system = ts.sys; }
var existingDirectories = new ts.Map();
var getCanonicalFileName = ts.createGetCanonicalFileName(system.useCaseSensitiveFileNames);
var computeHash = ts.maybeBind(system, system.createHash) || ts.generateDjb2Hash;
function getSourceFile(fileName, languageVersion, onError) {
var text;
try {
ts.performance.mark("beforeIORead");
text = compilerHost.readFile(fileName);
ts.performance.mark("afterIORead");
ts.performance.measure("I/O Read", "beforeIORead", "afterIORead");
}
catch (e) {
if (onError) {
onError(e.message);
}
text = "";
}
return text !== undefined ? ts.createSourceFile(fileName, text, languageVersion, setParentNodes) : undefined;
}
function directoryExists(directoryPath) {
if (existingDirectories.has(directoryPath)) {
return true;
}
if ((compilerHost.directoryExists || system.directoryExists)(directoryPath)) {
existingDirectories.set(directoryPath, true);
return true;
}
return false;
}
function writeFile(fileName, data, writeByteOrderMark, onError) {
try {
ts.performance.mark("beforeIOWrite");
// NOTE: If patchWriteFileEnsuringDirectory has been called,
// the system.writeFile will do its own directory creation and
// the ensureDirectoriesExist call will always be redundant.
ts.writeFileEnsuringDirectories(fileName, data, writeByteOrderMark, function (path, data, writeByteOrderMark) { return writeFileWorker(path, data, writeByteOrderMark); }, function (path) { return (compilerHost.createDirectory || system.createDirectory)(path); }, function (path) { return directoryExists(path); });
ts.performance.mark("afterIOWrite");
ts.performance.measure("I/O Write", "beforeIOWrite", "afterIOWrite");
}
catch (e) {
if (onError) {
onError(e.message);
}
}
}
var outputFingerprints;
function writeFileWorker(fileName, data, writeByteOrderMark) {
if (!ts.isWatchSet(options) || !system.getModifiedTime) {
system.writeFile(fileName, data, writeByteOrderMark);
return;
}
if (!outputFingerprints) {
outputFingerprints = new ts.Map();
}
var hash = computeHash(data);
var mtimeBefore = system.getModifiedTime(fileName);
if (mtimeBefore) {
var fingerprint = outputFingerprints.get(fileName);
// If output has not been changed, and the file has no external modification
if (fingerprint &&
fingerprint.byteOrderMark === writeByteOrderMark &&
fingerprint.hash === hash &&
fingerprint.mtime.getTime() === mtimeBefore.getTime()) {
return;
}
}
system.writeFile(fileName, data, writeByteOrderMark);
var mtimeAfter = system.getModifiedTime(fileName) || ts.missingFileModifiedTime;
outputFingerprints.set(fileName, {
hash: hash,
byteOrderMark: writeByteOrderMark,
mtime: mtimeAfter
});
}
function getDefaultLibLocation() {
return ts.getDirectoryPath(ts.normalizePath(system.getExecutingFilePath()));
}
var newLine = ts.getNewLineCharacter(options, function () { return system.newLine; });
var realpath = system.realpath && (function (path) { return system.realpath(path); });
var compilerHost = {
getSourceFile: getSourceFile,
getDefaultLibLocation: getDefaultLibLocation,
getDefaultLibFileName: function (options) { return ts.combinePaths(getDefaultLibLocation(), ts.getDefaultLibFileName(options)); },
writeFile: writeFile,
getCurrentDirectory: ts.memoize(function () { return system.getCurrentDirectory(); }),
useCaseSensitiveFileNames: function () { return system.useCaseSensitiveFileNames; },
getCanonicalFileName: getCanonicalFileName,
getNewLine: function () { return newLine; },
fileExists: function (fileName) { return system.fileExists(fileName); },
readFile: function (fileName) { return system.readFile(fileName); },
trace: function (s) { return system.write(s + newLine); },
directoryExists: function (directoryName) { return system.directoryExists(directoryName); },
getEnvironmentVariable: function (name) { return system.getEnvironmentVariable ? system.getEnvironmentVariable(name) : ""; },
getDirectories: function (path) { return system.getDirectories(path); },
realpath: realpath,
readDirectory: function (path, extensions, include, exclude, depth) { return system.readDirectory(path, extensions, include, exclude, depth); },
createDirectory: function (d) { return system.createDirectory(d); },
createHash: ts.maybeBind(system, system.createHash)
};
return compilerHost;
}
ts.createCompilerHostWorker = createCompilerHostWorker;
/*@internal*/
function changeCompilerHostLikeToUseCache(host, toPath, getSourceFile) {
var originalReadFile = host.readFile;
var originalFileExists = host.fileExists;
var originalDirectoryExists = host.directoryExists;
var originalCreateDirectory = host.createDirectory;
var originalWriteFile = host.writeFile;
var readFileCache = new ts.Map();
var fileExistsCache = new ts.Map();
var directoryExistsCache = new ts.Map();
var sourceFileCache = new ts.Map();
var readFileWithCache = function (fileName) {
var key = toPath(fileName);
var value = readFileCache.get(key);
if (value !== undefined)
return value !== false ? value : undefined;
return setReadFileCache(key, fileName);
};
var setReadFileCache = function (key, fileName) {
var newValue = originalReadFile.call(host, fileName);
readFileCache.set(key, newValue !== undefined ? newValue : false);
return newValue;
};
host.readFile = function (fileName) {
var key = toPath(fileName);
var value = readFileCache.get(key);
if (value !== undefined)
return value !== false ? value : undefined; // could be .d.ts from output
// Cache json or buildInfo
if (!ts.fileExtensionIs(fileName, ".json" /* Json */) && !ts.isBuildInfoFile(fileName)) {
return originalReadFile.call(host, fileName);
}
return setReadFileCache(key, fileName);
};
var getSourceFileWithCache = getSourceFile ? function (fileName, languageVersion, onError, shouldCreateNewSourceFile) {
var key = toPath(fileName);
var value = sourceFileCache.get(key);
if (value)
return value;
var sourceFile = getSourceFile(fileName, languageVersion, onError, shouldCreateNewSourceFile);
if (sourceFile && (ts.isDeclarationFileName(fileName) || ts.fileExtensionIs(fileName, ".json" /* Json */))) {
sourceFileCache.set(key, sourceFile);
}
return sourceFile;
} : undefined;
// fileExists for any kind of extension
host.fileExists = function (fileName) {
var key = toPath(fileName);
var value = fileExistsCache.get(key);
if (value !== undefined)
return value;
var newValue = originalFileExists.call(host, fileName);
fileExistsCache.set(key, !!newValue);
return newValue;
};
if (originalWriteFile) {
host.writeFile = function (fileName, data, writeByteOrderMark, onError, sourceFiles) {
var key = toPath(fileName);
fileExistsCache.delete(key);
var value = readFileCache.get(key);
if (value !== undefined && value !== data) {
readFileCache.delete(key);
sourceFileCache.delete(key);
}
else if (getSourceFileWithCache) {
var sourceFile = sourceFileCache.get(key);
if (sourceFile && sourceFile.text !== data) {
sourceFileCache.delete(key);
}
}
originalWriteFile.call(host, fileName, data, writeByteOrderMark, onError, sourceFiles);
};
}
// directoryExists
if (originalDirectoryExists && originalCreateDirectory) {
host.directoryExists = function (directory) {
var key = toPath(directory);
var value = directoryExistsCache.get(key);
if (value !== undefined)
return value;
var newValue = originalDirectoryExists.call(host, directory);
directoryExistsCache.set(key, !!newValue);
return newValue;
};
host.createDirectory = function (directory) {
var key = toPath(directory);
directoryExistsCache.delete(key);
originalCreateDirectory.call(host, directory);
};
}
return {
originalReadFile: originalReadFile,
originalFileExists: originalFileExists,
originalDirectoryExists: originalDirectoryExists,
originalCreateDirectory: originalCreateDirectory,
originalWriteFile: originalWriteFile,
getSourceFileWithCache: getSourceFileWithCache,
readFileWithCache: readFileWithCache
};
}
ts.changeCompilerHostLikeToUseCache = changeCompilerHostLikeToUseCache;
function getPreEmitDiagnostics(program, sourceFile, cancellationToken) {
var diagnostics;
diagnostics = ts.addRange(diagnostics, program.getConfigFileParsingDiagnostics());
diagnostics = ts.addRange(diagnostics, program.getOptionsDiagnostics(cancellationToken));
diagnostics = ts.addRange(diagnostics, program.getSyntacticDiagnostics(sourceFile, cancellationToken));
diagnostics = ts.addRange(diagnostics, program.getGlobalDiagnostics(cancellationToken));
diagnostics = ts.addRange(diagnostics, program.getSemanticDiagnostics(sourceFile, cancellationToken));
if (ts.getEmitDeclarations(program.getCompilerOptions())) {
diagnostics = ts.addRange(diagnostics, program.getDeclarationDiagnostics(sourceFile, cancellationToken));
}
return ts.sortAndDeduplicateDiagnostics(diagnostics || ts.emptyArray);
}
ts.getPreEmitDiagnostics = getPreEmitDiagnostics;
function formatDiagnostics(diagnostics, host) {
var output = "";
for (var _i = 0, diagnostics_3 = diagnostics; _i < diagnostics_3.length; _i++) {
var diagnostic = diagnostics_3[_i];
output += formatDiagnostic(diagnostic, host);
}
return output;
}
ts.formatDiagnostics = formatDiagnostics;
function formatDiagnostic(diagnostic, host) {
var errorMessage = ts.diagnosticCategoryName(diagnostic) + " TS" + diagnostic.code + ": " + flattenDiagnosticMessageText(diagnostic.messageText, host.getNewLine()) + host.getNewLine();
if (diagnostic.file) {
var _a = ts.getLineAndCharacterOfPosition(diagnostic.file, diagnostic.start), line = _a.line, character = _a.character; // TODO: GH#18217
var fileName = diagnostic.file.fileName;
var relativeFileName = ts.convertToRelativePath(fileName, host.getCurrentDirectory(), function (fileName) { return host.getCanonicalFileName(fileName); });
return relativeFileName + "(" + (line + 1) + "," + (character + 1) + "): " + errorMessage;
}
return errorMessage;
}
ts.formatDiagnostic = formatDiagnostic;
/** @internal */
var ForegroundColorEscapeSequences;
(function (ForegroundColorEscapeSequences) {
ForegroundColorEscapeSequences["Grey"] = "\u001B[90m";
ForegroundColorEscapeSequences["Red"] = "\u001B[91m";
ForegroundColorEscapeSequences["Yellow"] = "\u001B[93m";
ForegroundColorEscapeSequences["Blue"] = "\u001B[94m";
ForegroundColorEscapeSequences["Cyan"] = "\u001B[96m";
})(ForegroundColorEscapeSequences = ts.ForegroundColorEscapeSequences || (ts.ForegroundColorEscapeSequences = {}));
var gutterStyleSequence = "\u001b[7m";
var gutterSeparator = " ";
var resetEscapeSequence = "\u001b[0m";
var ellipsis = "...";
var halfIndent = " ";
var indent = " ";
function getCategoryFormat(category) {
switch (category) {
case ts.DiagnosticCategory.Error: return ForegroundColorEscapeSequences.Red;
case ts.DiagnosticCategory.Warning: return ForegroundColorEscapeSequences.Yellow;
case ts.DiagnosticCategory.Suggestion: return ts.Debug.fail("Should never get an Info diagnostic on the command line.");
case ts.DiagnosticCategory.Message: return ForegroundColorEscapeSequences.Blue;
}
}
/** @internal */
function formatColorAndReset(text, formatStyle) {
return formatStyle + text + resetEscapeSequence;
}
ts.formatColorAndReset = formatColorAndReset;
function formatCodeSpan(file, start, length, indent, squiggleColor, host) {
var _a = ts.getLineAndCharacterOfPosition(file, start), firstLine = _a.line, firstLineChar = _a.character;
var _b = ts.getLineAndCharacterOfPosition(file, start + length), lastLine = _b.line, lastLineChar = _b.character;
var lastLineInFile = ts.getLineAndCharacterOfPosition(file, file.text.length).line;
var hasMoreThanFiveLines = (lastLine - firstLine) >= 4;
var gutterWidth = (lastLine + 1 + "").length;
if (hasMoreThanFiveLines) {
gutterWidth = Math.max(ellipsis.length, gutterWidth);
}
var context = "";
for (var i = firstLine; i <= lastLine; i++) {
context += host.getNewLine();
// If the error spans over 5 lines, we'll only show the first 2 and last 2 lines,
// so we'll skip ahead to the second-to-last line.
if (hasMoreThanFiveLines && firstLine + 1 < i && i < lastLine - 1) {
context += indent + formatColorAndReset(ts.padLeft(ellipsis, gutterWidth), gutterStyleSequence) + gutterSeparator + host.getNewLine();
i = lastLine - 1;
}
var lineStart = ts.getPositionOfLineAndCharacter(file, i, 0);
var lineEnd = i < lastLineInFile ? ts.getPositionOfLineAndCharacter(file, i + 1, 0) : file.text.length;
var lineContent = file.text.slice(lineStart, lineEnd);
lineContent = ts.trimStringEnd(lineContent); // trim from end
lineContent = lineContent.replace(/\t/g, " "); // convert tabs to single spaces
// Output the gutter and the actual contents of the line.
context += indent + formatColorAndReset(ts.padLeft(i + 1 + "", gutterWidth), gutterStyleSequence) + gutterSeparator;
context += lineContent + host.getNewLine();
// Output the gutter and the error span for the line using tildes.
context += indent + formatColorAndReset(ts.padLeft("", gutterWidth), gutterStyleSequence) + gutterSeparator;
context += squiggleColor;
if (i === firstLine) {
// If we're on the last line, then limit it to the last character of the last line.
// Otherwise, we'll just squiggle the rest of the line, giving 'slice' no end position.
var lastCharForLine = i === lastLine ? lastLineChar : undefined;
context += lineContent.slice(0, firstLineChar).replace(/\S/g, " ");
context += lineContent.slice(firstLineChar, lastCharForLine).replace(/./g, "~");
}
else if (i === lastLine) {
context += lineContent.slice(0, lastLineChar).replace(/./g, "~");
}
else {
// Squiggle the entire line.
context += lineContent.replace(/./g, "~");
}
context += resetEscapeSequence;
}
return context;
}
/* @internal */
function formatLocation(file, start, host, color) {
if (color === void 0) { color = formatColorAndReset; }
var _a = ts.getLineAndCharacterOfPosition(file, start), firstLine = _a.line, firstLineChar = _a.character; // TODO: GH#18217
var relativeFileName = host ? ts.convertToRelativePath(file.fileName, host.getCurrentDirectory(), function (fileName) { return host.getCanonicalFileName(fileName); }) : file.fileName;
var output = "";
output += color(relativeFileName, ForegroundColorEscapeSequences.Cyan);
output += ":";
output += color("" + (firstLine + 1), ForegroundColorEscapeSequences.Yellow);
output += ":";
output += color("" + (firstLineChar + 1), ForegroundColorEscapeSequences.Yellow);
return output;
}
ts.formatLocation = formatLocation;
function formatDiagnosticsWithColorAndContext(diagnostics, host) {
var output = "";
for (var _i = 0, diagnostics_4 = diagnostics; _i < diagnostics_4.length; _i++) {
var diagnostic = diagnostics_4[_i];
if (diagnostic.file) {
var file = diagnostic.file, start = diagnostic.start;
output += formatLocation(file, start, host); // TODO: GH#18217
output += " - ";
}
output += formatColorAndReset(ts.diagnosticCategoryName(diagnostic), getCategoryFormat(diagnostic.category));
output += formatColorAndReset(" TS" + diagnostic.code + ": ", ForegroundColorEscapeSequences.Grey);
output += flattenDiagnosticMessageText(diagnostic.messageText, host.getNewLine());
if (diagnostic.file) {
output += host.getNewLine();
output += formatCodeSpan(diagnostic.file, diagnostic.start, diagnostic.length, "", getCategoryFormat(diagnostic.category), host); // TODO: GH#18217
}
if (diagnostic.relatedInformation) {
output += host.getNewLine();
for (var _a = 0, _b = diagnostic.relatedInformation; _a < _b.length; _a++) {
var _c = _b[_a], file = _c.file, start = _c.start, length_9 = _c.length, messageText = _c.messageText;
if (file) {
output += host.getNewLine();
output += halfIndent + formatLocation(file, start, host); // TODO: GH#18217
output += formatCodeSpan(file, start, length_9, indent, ForegroundColorEscapeSequences.Cyan, host); // TODO: GH#18217
}
output += host.getNewLine();
output += indent + flattenDiagnosticMessageText(messageText, host.getNewLine());
}
}
output += host.getNewLine();
}
return output;
}
ts.formatDiagnosticsWithColorAndContext = formatDiagnosticsWithColorAndContext;
function flattenDiagnosticMessageText(diag, newLine, indent) {
if (indent === void 0) { indent = 0; }
if (ts.isString(diag)) {
return diag;
}
else if (diag === undefined) {
return "";
}
var result = "";
if (indent) {
result += newLine;
for (var i = 0; i < indent; i++) {
result += " ";
}
}
result += diag.messageText;
indent++;
if (diag.next) {
for (var _i = 0, _a = diag.next; _i < _a.length; _i++) {
var kid = _a[_i];
result += flattenDiagnosticMessageText(kid, newLine, indent);
}
}
return result;
}
ts.flattenDiagnosticMessageText = flattenDiagnosticMessageText;
/* @internal */
function loadWithLocalCache(names, containingFile, redirectedReference, loader) {
if (names.length === 0) {
return [];
}
var resolutions = [];
var cache = new ts.Map();
for (var _i = 0, names_2 = names; _i < names_2.length; _i++) {
var name = names_2[_i];
var result = void 0;
if (cache.has(name)) {
result = cache.get(name);
}
else {
cache.set(name, result = loader(name, containingFile, redirectedReference));
}
resolutions.push(result);
}
return resolutions;
}
ts.loadWithLocalCache = loadWithLocalCache;
/* @internal */
function forEachResolvedProjectReference(resolvedProjectReferences, cb) {
return forEachProjectReference(/*projectReferences*/ undefined, resolvedProjectReferences, function (resolvedRef, parent) { return resolvedRef && cb(resolvedRef, parent); });
}
ts.forEachResolvedProjectReference = forEachResolvedProjectReference;
function forEachProjectReference(projectReferences, resolvedProjectReferences, cbResolvedRef, cbRef) {
var seenResolvedRefs;
return worker(projectReferences, resolvedProjectReferences, /*parent*/ undefined);
function worker(projectReferences, resolvedProjectReferences, parent) {
// Visit project references first
if (cbRef) {
var result = cbRef(projectReferences, parent);
if (result) {
return result;
}
}
return ts.forEach(resolvedProjectReferences, function (resolvedRef, index) {
if (resolvedRef && (seenResolvedRefs === null || seenResolvedRefs === void 0 ? void 0 : seenResolvedRefs.has(resolvedRef.sourceFile.path))) {
// ignore recursives
return undefined;
}
var result = cbResolvedRef(resolvedRef, parent, index);
if (result || !resolvedRef)
return result;
(seenResolvedRefs || (seenResolvedRefs = new ts.Set())).add(resolvedRef.sourceFile.path);
return worker(resolvedRef.commandLine.projectReferences, resolvedRef.references, resolvedRef);
});
}
}
/* @internal */
ts.inferredTypesContainingFile = "__inferred type names__.ts";
/*@internal*/
function isReferencedFile(reason) {
switch (reason === null || reason === void 0 ? void 0 : reason.kind) {
case ts.FileIncludeKind.Import:
case ts.FileIncludeKind.ReferenceFile:
case ts.FileIncludeKind.TypeReferenceDirective:
case ts.FileIncludeKind.LibReferenceDirective:
return true;
default:
return false;
}
}
ts.isReferencedFile = isReferencedFile;
/*@internal*/
function isReferenceFileLocation(location) {
return location.pos !== undefined;
}
ts.isReferenceFileLocation = isReferenceFileLocation;
/*@internal*/
function getReferencedFileLocation(getSourceFileByPath, ref) {
var _a, _b, _c;
var _d, _e, _f, _g;
var file = ts.Debug.checkDefined(getSourceFileByPath(ref.file));
var kind = ref.kind, index = ref.index;
var pos, end, packageId;
switch (kind) {
case ts.FileIncludeKind.Import:
var importLiteral = getModuleNameStringLiteralAt(file, index);
packageId = (_e = (_d = file.resolvedModules) === null || _d === void 0 ? void 0 : _d.get(importLiteral.text)) === null || _e === void 0 ? void 0 : _e.packageId;
if (importLiteral.pos === -1)
return { file: file, packageId: packageId, text: importLiteral.text };
pos = ts.skipTrivia(file.text, importLiteral.pos);
end = importLiteral.end;
break;
case ts.FileIncludeKind.ReferenceFile:
(_a = file.referencedFiles[index], pos = _a.pos, end = _a.end);
break;
case ts.FileIncludeKind.TypeReferenceDirective:
(_b = file.typeReferenceDirectives[index], pos = _b.pos, end = _b.end);
packageId = (_g = (_f = file.resolvedTypeReferenceDirectiveNames) === null || _f === void 0 ? void 0 : _f.get(ts.toFileNameLowerCase(file.typeReferenceDirectives[index].fileName))) === null || _g === void 0 ? void 0 : _g.packageId;
break;
case ts.FileIncludeKind.LibReferenceDirective:
(_c = file.libReferenceDirectives[index], pos = _c.pos, end = _c.end);
break;
default:
return ts.Debug.assertNever(kind);
}
return { file: file, pos: pos, end: end, packageId: packageId };
}
ts.getReferencedFileLocation = getReferencedFileLocation;
/**
* Determines if program structure is upto date or needs to be recreated
*/
/* @internal */
function isProgramUptoDate(program, rootFileNames, newOptions, getSourceVersion, fileExists, hasInvalidatedResolution, hasChangedAutomaticTypeDirectiveNames, getParsedCommandLine, projectReferences) {
// If we haven't created a program yet or have changed automatic type directives, then it is not up-to-date
if (!program || (hasChangedAutomaticTypeDirectiveNames === null || hasChangedAutomaticTypeDirectiveNames === void 0 ? void 0 : hasChangedAutomaticTypeDirectiveNames()))
return false;
// If root file names don't match
if (!ts.arrayIsEqualTo(program.getRootFileNames(), rootFileNames))
return false;
var seenResolvedRefs;
// If project references don't match
if (!ts.arrayIsEqualTo(program.getProjectReferences(), projectReferences, projectReferenceUptoDate))
return false;
// If any file is not up-to-date, then the whole program is not up-to-date
if (program.getSourceFiles().some(sourceFileNotUptoDate))
return false;
// If any of the missing file paths are now created
if (program.getMissingFilePaths().some(fileExists))
return false;
var currentOptions = program.getCompilerOptions();
// If the compilation settings do no match, then the program is not up-to-date
if (!ts.compareDataObjects(currentOptions, newOptions))
return false;
// If everything matches but the text of config file is changed,
// error locations can change for program options, so update the program
if (currentOptions.configFile && newOptions.configFile)
return currentOptions.configFile.text === newOptions.configFile.text;
return true;
function sourceFileNotUptoDate(sourceFile) {
return !sourceFileVersionUptoDate(sourceFile) ||
hasInvalidatedResolution(sourceFile.path);
}
function sourceFileVersionUptoDate(sourceFile) {
return sourceFile.version === getSourceVersion(sourceFile.resolvedPath, sourceFile.fileName);
}
function projectReferenceUptoDate(oldRef, newRef, index) {
return ts.projectReferenceIsEqualTo(oldRef, newRef) &&
resolvedProjectReferenceUptoDate(program.getResolvedProjectReferences()[index], oldRef);
}
function resolvedProjectReferenceUptoDate(oldResolvedRef, oldRef) {
if (oldResolvedRef) {
// Assume true
if (ts.contains(seenResolvedRefs, oldResolvedRef))
return true;
var refPath_1 = resolveProjectReferencePath(oldRef);
var newParsedCommandLine = getParsedCommandLine(refPath_1);
// Check if config file exists
if (!newParsedCommandLine)
return false;
// If change in source file
if (oldResolvedRef.commandLine.options.configFile !== newParsedCommandLine.options.configFile)
return false;
// check file names
if (!ts.arrayIsEqualTo(oldResolvedRef.commandLine.fileNames, newParsedCommandLine.fileNames))
return false;
// Add to seen before checking the referenced paths of this config file
(seenResolvedRefs || (seenResolvedRefs = [])).push(oldResolvedRef);
// If child project references are upto date, this project reference is uptodate
return !ts.forEach(oldResolvedRef.references, function (childResolvedRef, index) {
return !resolvedProjectReferenceUptoDate(childResolvedRef, oldResolvedRef.commandLine.projectReferences[index]);
});
}
// In old program, not able to resolve project reference path,
// so if config file doesnt exist, it is uptodate.
var refPath = resolveProjectReferencePath(oldRef);
return !getParsedCommandLine(refPath);
}
}
ts.isProgramUptoDate = isProgramUptoDate;
function getConfigFileParsingDiagnostics(configFileParseResult) {
return configFileParseResult.options.configFile ? __spreadArray(__spreadArray([], configFileParseResult.options.configFile.parseDiagnostics, true), configFileParseResult.errors, true) :
configFileParseResult.errors;
}
ts.getConfigFileParsingDiagnostics = getConfigFileParsingDiagnostics;
/**
* Determine if source file needs to be re-created even if its text hasn't changed
*/
function shouldProgramCreateNewSourceFiles(program, newOptions) {
if (!program)
return false;
// If any compiler options change, we can't reuse old source file even if version match
// The change in options like these could result in change in syntax tree or `sourceFile.bindDiagnostics`.
return ts.optionsHaveChanges(program.getCompilerOptions(), newOptions, ts.sourceFileAffectingCompilerOptions);
}
function createCreateProgramOptions(rootNames, options, host, oldProgram, configFileParsingDiagnostics) {
return {
rootNames: rootNames,
options: options,
host: host,
oldProgram: oldProgram,
configFileParsingDiagnostics: configFileParsingDiagnostics
};
}
function createProgram(rootNamesOrOptions, _options, _host, _oldProgram, _configFileParsingDiagnostics) {
var _a, _b, _c;
var createProgramOptions = ts.isArray(rootNamesOrOptions) ? createCreateProgramOptions(rootNamesOrOptions, _options, _host, _oldProgram, _configFileParsingDiagnostics) : rootNamesOrOptions; // TODO: GH#18217
var rootNames = createProgramOptions.rootNames, options = createProgramOptions.options, configFileParsingDiagnostics = createProgramOptions.configFileParsingDiagnostics, projectReferences = createProgramOptions.projectReferences;
var oldProgram = createProgramOptions.oldProgram;
var processingDefaultLibFiles;
var processingOtherFiles;
var files;
var symlinks;
var commonSourceDirectory;
var diagnosticsProducingTypeChecker;
var noDiagnosticsTypeChecker;
var classifiableNames;
var ambientModuleNameToUnmodifiedFileName = new ts.Map();
var fileReasons = ts.createMultiMap();
var cachedBindAndCheckDiagnosticsForFile = {};
var cachedDeclarationDiagnosticsForFile = {};
var resolvedTypeReferenceDirectives = new ts.Map();
var fileProcessingDiagnostics;
// The below settings are to track if a .js file should be add to the program if loaded via searching under node_modules.
// This works as imported modules are discovered recursively in a depth first manner, specifically:
// - For each root file, findSourceFile is called.
// - This calls processImportedModules for each module imported in the source file.
// - This calls resolveModuleNames, and then calls findSourceFile for each resolved module.
// As all these operations happen - and are nested - within the createProgram call, they close over the below variables.
// The current resolution depth is tracked by incrementing/decrementing as the depth first search progresses.
var maxNodeModuleJsDepth = typeof options.maxNodeModuleJsDepth === "number" ? options.maxNodeModuleJsDepth : 0;
var currentNodeModulesDepth = 0;
// If a module has some of its imports skipped due to being at the depth limit under node_modules, then track
// this, as it may be imported at a shallower depth later, and then it will need its skipped imports processed.
var modulesWithElidedImports = new ts.Map();
// Track source files that are source files found by searching under node_modules, as these shouldn't be compiled.
var sourceFilesFoundSearchingNodeModules = new ts.Map();
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("program" /* Program */, "createProgram", { configFilePath: options.configFilePath, rootDir: options.rootDir }, /*separateBeginAndEnd*/ true);
ts.performance.mark("beforeProgram");
var host = createProgramOptions.host || createCompilerHost(options);
var configParsingHost = parseConfigHostFromCompilerHostLike(host);
var skipDefaultLib = options.noLib;
var getDefaultLibraryFileName = ts.memoize(function () { return host.getDefaultLibFileName(options); });
var defaultLibraryPath = host.getDefaultLibLocation ? host.getDefaultLibLocation() : ts.getDirectoryPath(getDefaultLibraryFileName());
var programDiagnostics = ts.createDiagnosticCollection();
var currentDirectory = host.getCurrentDirectory();
var supportedExtensions = ts.getSupportedExtensions(options);
var supportedExtensionsWithJsonIfResolveJsonModule = ts.getSuppoertedExtensionsWithJsonIfResolveJsonModule(options, supportedExtensions);
// Map storing if there is emit blocking diagnostics for given input
var hasEmitBlockingDiagnostics = new ts.Map();
var _compilerOptionsObjectLiteralSyntax;
var moduleResolutionCache;
var typeReferenceDirectiveResolutionCache;
var actualResolveModuleNamesWorker;
var hasInvalidatedResolution = host.hasInvalidatedResolution || ts.returnFalse;
if (host.resolveModuleNames) {
actualResolveModuleNamesWorker = function (moduleNames, containingFile, reusedNames, redirectedReference) { return host.resolveModuleNames(ts.Debug.checkEachDefined(moduleNames), containingFile, reusedNames, redirectedReference, options).map(function (resolved) {
// An older host may have omitted extension, in which case we should infer it from the file extension of resolvedFileName.
if (!resolved || resolved.extension !== undefined) {
return resolved;
}
var withExtension = ts.clone(resolved);
withExtension.extension = ts.extensionFromPath(resolved.resolvedFileName);
return withExtension;
}); };
}
else {
moduleResolutionCache = ts.createModuleResolutionCache(currentDirectory, getCanonicalFileName, options);
var loader_1 = function (moduleName, containingFile, redirectedReference) { return ts.resolveModuleName(moduleName, containingFile, options, host, moduleResolutionCache, redirectedReference).resolvedModule; }; // TODO: GH#18217
actualResolveModuleNamesWorker = function (moduleNames, containingFile, _reusedNames, redirectedReference) { return loadWithLocalCache(ts.Debug.checkEachDefined(moduleNames), containingFile, redirectedReference, loader_1); };
}
var actualResolveTypeReferenceDirectiveNamesWorker;
if (host.resolveTypeReferenceDirectives) {
actualResolveTypeReferenceDirectiveNamesWorker = function (typeDirectiveNames, containingFile, redirectedReference) { return host.resolveTypeReferenceDirectives(ts.Debug.checkEachDefined(typeDirectiveNames), containingFile, redirectedReference, options); };
}
else {
typeReferenceDirectiveResolutionCache = ts.createTypeReferenceDirectiveResolutionCache(currentDirectory, getCanonicalFileName, /*options*/ undefined, moduleResolutionCache === null || moduleResolutionCache === void 0 ? void 0 : moduleResolutionCache.getPackageJsonInfoCache());
var loader_2 = function (typesRef, containingFile, redirectedReference) { return ts.resolveTypeReferenceDirective(typesRef, containingFile, options, host, redirectedReference, typeReferenceDirectiveResolutionCache).resolvedTypeReferenceDirective; }; // TODO: GH#18217
actualResolveTypeReferenceDirectiveNamesWorker = function (typeReferenceDirectiveNames, containingFile, redirectedReference) { return loadWithLocalCache(ts.Debug.checkEachDefined(typeReferenceDirectiveNames), containingFile, redirectedReference, loader_2); };
}
// Map from a stringified PackageId to the source file with that id.
// Only one source file may have a given packageId. Others become redirects (see createRedirectSourceFile).
// `packageIdToSourceFile` is only used while building the program, while `sourceFileToPackageName` and `isSourceFileTargetOfRedirect` are kept around.
var packageIdToSourceFile = new ts.Map();
// Maps from a SourceFile's `.path` to the name of the package it was imported with.
var sourceFileToPackageName = new ts.Map();
// Key is a file name. Value is the (non-empty, or undefined) list of files that redirect to it.
var redirectTargetsMap = ts.createMultiMap();
var usesUriStyleNodeCoreModules = false;
/**
* map with
* - SourceFile if present
* - false if sourceFile missing for source of project reference redirect
* - undefined otherwise
*/
var filesByName = new ts.Map();
var missingFilePaths;
// stores 'filename -> file association' ignoring case
// used to track cases when two file names differ only in casing
var filesByNameIgnoreCase = host.useCaseSensitiveFileNames() ? new ts.Map() : undefined;
// A parallel array to projectReferences storing the results of reading in the referenced tsconfig files
var resolvedProjectReferences;
var projectReferenceRedirects;
var mapFromFileToProjectReferenceRedirects;
var mapFromToProjectReferenceRedirectSource;
var useSourceOfProjectReferenceRedirect = !!((_a = host.useSourceOfProjectReferenceRedirect) === null || _a === void 0 ? void 0 : _a.call(host)) &&
!options.disableSourceOfProjectReferenceRedirect;
var _d = updateHostForUseSourceOfProjectReferenceRedirect({
compilerHost: host,
getSymlinkCache: getSymlinkCache,
useSourceOfProjectReferenceRedirect: useSourceOfProjectReferenceRedirect,
toPath: toPath,
getResolvedProjectReferences: getResolvedProjectReferences,
getSourceOfProjectReferenceRedirect: getSourceOfProjectReferenceRedirect,
forEachResolvedProjectReference: forEachResolvedProjectReference
}), onProgramCreateComplete = _d.onProgramCreateComplete, fileExists = _d.fileExists, directoryExists = _d.directoryExists;
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("program" /* Program */, "shouldProgramCreateNewSourceFiles", { hasOldProgram: !!oldProgram });
var shouldCreateNewSourceFile = shouldProgramCreateNewSourceFiles(oldProgram, options);
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
// We set `structuralIsReused` to `undefined` because `tryReuseStructureFromOldProgram` calls `tryReuseStructureFromOldProgram` which checks
// `structuralIsReused`, which would be a TDZ violation if it was not set in advance to `undefined`.
var structureIsReused;
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("program" /* Program */, "tryReuseStructureFromOldProgram", {});
structureIsReused = tryReuseStructureFromOldProgram(); // eslint-disable-line prefer-const
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
if (structureIsReused !== 2 /* Completely */) {
processingDefaultLibFiles = [];
processingOtherFiles = [];
if (projectReferences) {
if (!resolvedProjectReferences) {
resolvedProjectReferences = projectReferences.map(parseProjectReferenceConfigFile);
}
if (rootNames.length) {
resolvedProjectReferences === null || resolvedProjectReferences === void 0 ? void 0 : resolvedProjectReferences.forEach(function (parsedRef, index) {
if (!parsedRef)
return;
var out = ts.outFile(parsedRef.commandLine.options);
if (useSourceOfProjectReferenceRedirect) {
if (out || ts.getEmitModuleKind(parsedRef.commandLine.options) === ts.ModuleKind.None) {
for (var _i = 0, _a = parsedRef.commandLine.fileNames; _i < _a.length; _i++) {
var fileName = _a[_i];
processProjectReferenceFile(fileName, { kind: ts.FileIncludeKind.SourceFromProjectReference, index: index });
}
}
}
else {
if (out) {
processProjectReferenceFile(ts.changeExtension(out, ".d.ts"), { kind: ts.FileIncludeKind.OutputFromProjectReference, index: index });
}
else if (ts.getEmitModuleKind(parsedRef.commandLine.options) === ts.ModuleKind.None) {
var getCommonSourceDirectory_2 = ts.memoize(function () { return ts.getCommonSourceDirectoryOfConfig(parsedRef.commandLine, !host.useCaseSensitiveFileNames()); });
for (var _b = 0, _c = parsedRef.commandLine.fileNames; _b < _c.length; _b++) {
var fileName = _c[_b];
if (!ts.fileExtensionIs(fileName, ".d.ts" /* Dts */) && !ts.fileExtensionIs(fileName, ".json" /* Json */)) {
processProjectReferenceFile(ts.getOutputDeclarationFileName(fileName, parsedRef.commandLine, !host.useCaseSensitiveFileNames(), getCommonSourceDirectory_2), { kind: ts.FileIncludeKind.OutputFromProjectReference, index: index });
}
}
}
}
});
}
}
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("program" /* Program */, "processRootFiles", { count: rootNames.length });
ts.forEach(rootNames, function (name, index) { return processRootFile(name, /*isDefaultLib*/ false, /*ignoreNoDefaultLib*/ false, { kind: ts.FileIncludeKind.RootFile, index: index }); });
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
// load type declarations specified via 'types' argument or implicitly from types/ and node_modules/@types folders
var typeReferences = rootNames.length ? ts.getAutomaticTypeDirectiveNames(options, host) : ts.emptyArray;
if (typeReferences.length) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("program" /* Program */, "processTypeReferences", { count: typeReferences.length });
// This containingFilename needs to match with the one used in managed-side
var containingDirectory = options.configFilePath ? ts.getDirectoryPath(options.configFilePath) : host.getCurrentDirectory();
var containingFilename = ts.combinePaths(containingDirectory, ts.inferredTypesContainingFile);
var resolutions = resolveTypeReferenceDirectiveNamesWorker(typeReferences, containingFilename);
for (var i = 0; i < typeReferences.length; i++) {
processTypeReferenceDirective(typeReferences[i], resolutions[i], { kind: ts.FileIncludeKind.AutomaticTypeDirectiveFile, typeReference: typeReferences[i], packageId: (_b = resolutions[i]) === null || _b === void 0 ? void 0 : _b.packageId });
}
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
}
// Do not process the default library if:
// - The '--noLib' flag is used.
// - A 'no-default-lib' reference comment is encountered in
// processing the root files.
if (rootNames.length && !skipDefaultLib) {
// If '--lib' is not specified, include default library file according to '--target'
// otherwise, using options specified in '--lib' instead of '--target' default library file
var defaultLibraryFileName = getDefaultLibraryFileName();
if (!options.lib && defaultLibraryFileName) {
processRootFile(defaultLibraryFileName, /*isDefaultLib*/ true, /*ignoreNoDefaultLib*/ false, { kind: ts.FileIncludeKind.LibFile });
}
else {
ts.forEach(options.lib, function (libFileName, index) {
processRootFile(ts.combinePaths(defaultLibraryPath, libFileName), /*isDefaultLib*/ true, /*ignoreNoDefaultLib*/ false, { kind: ts.FileIncludeKind.LibFile, index: index });
});
}
}
missingFilePaths = ts.arrayFrom(ts.mapDefinedIterator(filesByName.entries(), function (_a) {
var path = _a[0], file = _a[1];
return file === undefined ? path : undefined;
}));
files = ts.stableSort(processingDefaultLibFiles, compareDefaultLibFiles).concat(processingOtherFiles);
processingDefaultLibFiles = undefined;
processingOtherFiles = undefined;
}
ts.Debug.assert(!!missingFilePaths);
// Release any files we have acquired in the old program but are
// not part of the new program.
if (oldProgram && host.onReleaseOldSourceFile) {
var oldSourceFiles = oldProgram.getSourceFiles();
for (var _i = 0, oldSourceFiles_1 = oldSourceFiles; _i < oldSourceFiles_1.length; _i++) {
var oldSourceFile = oldSourceFiles_1[_i];
var newFile = getSourceFileByPath(oldSourceFile.resolvedPath);
if (shouldCreateNewSourceFile || !newFile ||
// old file wasn't redirect but new file is
(oldSourceFile.resolvedPath === oldSourceFile.path && newFile.resolvedPath !== oldSourceFile.path)) {
host.onReleaseOldSourceFile(oldSourceFile, oldProgram.getCompilerOptions(), !!getSourceFileByPath(oldSourceFile.path));
}
}
if (!host.getParsedCommandLine) {
oldProgram.forEachResolvedProjectReference(function (resolvedProjectReference) {
if (!getResolvedProjectReferenceByPath(resolvedProjectReference.sourceFile.path)) {
host.onReleaseOldSourceFile(resolvedProjectReference.sourceFile, oldProgram.getCompilerOptions(), /*hasSourceFileByPath*/ false);
}
});
}
}
// Release commandlines that new program does not use
if (oldProgram && host.onReleaseParsedCommandLine) {
forEachProjectReference(oldProgram.getProjectReferences(), oldProgram.getResolvedProjectReferences(), function (oldResolvedRef, parent, index) {
var oldReference = (parent === null || parent === void 0 ? void 0 : parent.commandLine.projectReferences[index]) || oldProgram.getProjectReferences()[index];
var oldRefPath = resolveProjectReferencePath(oldReference);
if (!(projectReferenceRedirects === null || projectReferenceRedirects === void 0 ? void 0 : projectReferenceRedirects.has(toPath(oldRefPath)))) {
host.onReleaseParsedCommandLine(oldRefPath, oldResolvedRef, oldProgram.getCompilerOptions());
}
});
}
typeReferenceDirectiveResolutionCache = undefined;
// unconditionally set oldProgram to undefined to prevent it from being captured in closure
oldProgram = undefined;
var program = {
getRootFileNames: function () { return rootNames; },
getSourceFile: getSourceFile,
getSourceFileByPath: getSourceFileByPath,
getSourceFiles: function () { return files; },
getMissingFilePaths: function () { return missingFilePaths; },
getModuleResolutionCache: function () { return moduleResolutionCache; },
getFilesByNameMap: function () { return filesByName; },
getCompilerOptions: function () { return options; },
getSyntacticDiagnostics: getSyntacticDiagnostics,
getOptionsDiagnostics: getOptionsDiagnostics,
getGlobalDiagnostics: getGlobalDiagnostics,
getSemanticDiagnostics: getSemanticDiagnostics,
getCachedSemanticDiagnostics: getCachedSemanticDiagnostics,
getSuggestionDiagnostics: getSuggestionDiagnostics,
getDeclarationDiagnostics: getDeclarationDiagnostics,
getBindAndCheckDiagnostics: getBindAndCheckDiagnostics,
getProgramDiagnostics: getProgramDiagnostics,
getTypeChecker: getTypeChecker,
getClassifiableNames: getClassifiableNames,
getDiagnosticsProducingTypeChecker: getDiagnosticsProducingTypeChecker,
getCommonSourceDirectory: getCommonSourceDirectory,
emit: emit,
getCurrentDirectory: function () { return currentDirectory; },
getNodeCount: function () { return getDiagnosticsProducingTypeChecker().getNodeCount(); },
getIdentifierCount: function () { return getDiagnosticsProducingTypeChecker().getIdentifierCount(); },
getSymbolCount: function () { return getDiagnosticsProducingTypeChecker().getSymbolCount(); },
getTypeCount: function () { return getDiagnosticsProducingTypeChecker().getTypeCount(); },
getInstantiationCount: function () { return getDiagnosticsProducingTypeChecker().getInstantiationCount(); },
getRelationCacheSizes: function () { return getDiagnosticsProducingTypeChecker().getRelationCacheSizes(); },
getFileProcessingDiagnostics: function () { return fileProcessingDiagnostics; },
getResolvedTypeReferenceDirectives: function () { return resolvedTypeReferenceDirectives; },
isSourceFileFromExternalLibrary: isSourceFileFromExternalLibrary,
isSourceFileDefaultLibrary: isSourceFileDefaultLibrary,
dropDiagnosticsProducingTypeChecker: dropDiagnosticsProducingTypeChecker,
getSourceFileFromReference: getSourceFileFromReference,
getLibFileFromReference: getLibFileFromReference,
sourceFileToPackageName: sourceFileToPackageName,
redirectTargetsMap: redirectTargetsMap,
usesUriStyleNodeCoreModules: usesUriStyleNodeCoreModules,
isEmittedFile: isEmittedFile,
getConfigFileParsingDiagnostics: getConfigFileParsingDiagnostics,
getResolvedModuleWithFailedLookupLocationsFromCache: getResolvedModuleWithFailedLookupLocationsFromCache,
getProjectReferences: getProjectReferences,
getResolvedProjectReferences: getResolvedProjectReferences,
getProjectReferenceRedirect: getProjectReferenceRedirect,
getResolvedProjectReferenceToRedirect: getResolvedProjectReferenceToRedirect,
getResolvedProjectReferenceByPath: getResolvedProjectReferenceByPath,
forEachResolvedProjectReference: forEachResolvedProjectReference,
isSourceOfProjectReferenceRedirect: isSourceOfProjectReferenceRedirect,
emitBuildInfo: emitBuildInfo,
fileExists: fileExists,
directoryExists: directoryExists,
getSymlinkCache: getSymlinkCache,
realpath: (_c = host.realpath) === null || _c === void 0 ? void 0 : _c.bind(host),
useCaseSensitiveFileNames: function () { return host.useCaseSensitiveFileNames(); },
getFileIncludeReasons: function () { return fileReasons; },
structureIsReused: structureIsReused,
};
onProgramCreateComplete();
// Add file processingDiagnostics
fileProcessingDiagnostics === null || fileProcessingDiagnostics === void 0 ? void 0 : fileProcessingDiagnostics.forEach(function (diagnostic) {
switch (diagnostic.kind) {
case 1 /* FilePreprocessingFileExplainingDiagnostic */:
return programDiagnostics.add(createDiagnosticExplainingFile(diagnostic.file && getSourceFileByPath(diagnostic.file), diagnostic.fileProcessingReason, diagnostic.diagnostic, diagnostic.args || ts.emptyArray));
case 0 /* FilePreprocessingReferencedDiagnostic */:
var _a = getReferencedFileLocation(getSourceFileByPath, diagnostic.reason), file = _a.file, pos = _a.pos, end = _a.end;
return programDiagnostics.add(ts.createFileDiagnostic.apply(void 0, __spreadArray([file, ts.Debug.checkDefined(pos), ts.Debug.checkDefined(end) - pos, diagnostic.diagnostic], diagnostic.args || ts.emptyArray, false)));
default:
ts.Debug.assertNever(diagnostic);
}
});
verifyCompilerOptions();
ts.performance.mark("afterProgram");
ts.performance.measure("Program", "beforeProgram", "afterProgram");
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
return program;
function resolveModuleNamesWorker(moduleNames, containingFile, reusedNames) {
if (!moduleNames.length)
return ts.emptyArray;
var containingFileName = ts.getNormalizedAbsolutePath(containingFile.originalFileName, currentDirectory);
var redirectedReference = getRedirectReferenceForResolution(containingFile);
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("program" /* Program */, "resolveModuleNamesWorker", { containingFileName: containingFileName });
ts.performance.mark("beforeResolveModule");
var result = actualResolveModuleNamesWorker(moduleNames, containingFileName, reusedNames, redirectedReference);
ts.performance.mark("afterResolveModule");
ts.performance.measure("ResolveModule", "beforeResolveModule", "afterResolveModule");
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
return result;
}
function resolveTypeReferenceDirectiveNamesWorker(typeDirectiveNames, containingFile) {
if (!typeDirectiveNames.length)
return [];
var containingFileName = !ts.isString(containingFile) ? ts.getNormalizedAbsolutePath(containingFile.originalFileName, currentDirectory) : containingFile;
var redirectedReference = !ts.isString(containingFile) ? getRedirectReferenceForResolution(containingFile) : undefined;
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("program" /* Program */, "resolveTypeReferenceDirectiveNamesWorker", { containingFileName: containingFileName });
ts.performance.mark("beforeResolveTypeReference");
var result = actualResolveTypeReferenceDirectiveNamesWorker(typeDirectiveNames, containingFileName, redirectedReference);
ts.performance.mark("afterResolveTypeReference");
ts.performance.measure("ResolveTypeReference", "beforeResolveTypeReference", "afterResolveTypeReference");
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
return result;
}
function getRedirectReferenceForResolution(file) {
var redirect = getResolvedProjectReferenceToRedirect(file.originalFileName);
if (redirect || !ts.fileExtensionIs(file.originalFileName, ".d.ts" /* Dts */))
return redirect;
// The originalFileName could not be actual source file name if file found was d.ts from referecned project
// So in this case try to look up if this is output from referenced project, if it is use the redirected project in that case
var resultFromDts = getRedirectReferenceForResolutionFromSourceOfProject(file.originalFileName, file.path);
if (resultFromDts)
return resultFromDts;
// If preserveSymlinks is true, module resolution wont jump the symlink
// but the resolved real path may be the .d.ts from project reference
// Note:: Currently we try the real path only if the
// file is from node_modules to avoid having to run real path on all file paths
if (!host.realpath || !options.preserveSymlinks || !ts.stringContains(file.originalFileName, ts.nodeModulesPathPart))
return undefined;
var realDeclarationFileName = host.realpath(file.originalFileName);
var realDeclarationPath = toPath(realDeclarationFileName);
return realDeclarationPath === file.path ? undefined : getRedirectReferenceForResolutionFromSourceOfProject(realDeclarationFileName, realDeclarationPath);
}
function getRedirectReferenceForResolutionFromSourceOfProject(fileName, filePath) {
var source = getSourceOfProjectReferenceRedirect(fileName);
if (ts.isString(source))
return getResolvedProjectReferenceToRedirect(source);
if (!source)
return undefined;
// Output of .d.ts file so return resolved ref that matches the out file name
return forEachResolvedProjectReference(function (resolvedRef) {
var out = ts.outFile(resolvedRef.commandLine.options);
if (!out)
return undefined;
return toPath(out) === filePath ? resolvedRef : undefined;
});
}
function compareDefaultLibFiles(a, b) {
return ts.compareValues(getDefaultLibFilePriority(a), getDefaultLibFilePriority(b));
}
function getDefaultLibFilePriority(a) {
if (ts.containsPath(defaultLibraryPath, a.fileName, /*ignoreCase*/ false)) {
var basename = ts.getBaseFileName(a.fileName);
if (basename === "lib.d.ts" || basename === "lib.es6.d.ts")
return 0;
var name = ts.removeSuffix(ts.removePrefix(basename, "lib."), ".d.ts");
var index = ts.libs.indexOf(name);
if (index !== -1)
return index + 1;
}
return ts.libs.length + 2;
}
function getResolvedModuleWithFailedLookupLocationsFromCache(moduleName, containingFile) {
return moduleResolutionCache && ts.resolveModuleNameFromCache(moduleName, containingFile, moduleResolutionCache);
}
function toPath(fileName) {
return ts.toPath(fileName, currentDirectory, getCanonicalFileName);
}
function getCommonSourceDirectory() {
if (commonSourceDirectory === undefined) {
var emittedFiles_1 = ts.filter(files, function (file) { return ts.sourceFileMayBeEmitted(file, program); });
commonSourceDirectory = ts.getCommonSourceDirectory(options, function () { return ts.mapDefined(emittedFiles_1, function (file) { return file.isDeclarationFile ? undefined : file.fileName; }); }, currentDirectory, getCanonicalFileName, function (commonSourceDirectory) { return checkSourceFilesBelongToPath(emittedFiles_1, commonSourceDirectory); });
}
return commonSourceDirectory;
}
function getClassifiableNames() {
var _a;
if (!classifiableNames) {
// Initialize a checker so that all our files are bound.
getTypeChecker();
classifiableNames = new ts.Set();
for (var _i = 0, files_3 = files; _i < files_3.length; _i++) {
var sourceFile = files_3[_i];
(_a = sourceFile.classifiableNames) === null || _a === void 0 ? void 0 : _a.forEach(function (value) { return classifiableNames.add(value); });
}
}
return classifiableNames;
}
function resolveModuleNamesReusingOldState(moduleNames, file) {
if (structureIsReused === 0 /* Not */ && !file.ambientModuleNames.length) {
// If the old program state does not permit reusing resolutions and `file` does not contain locally defined ambient modules,
// the best we can do is fallback to the default logic.
return resolveModuleNamesWorker(moduleNames, file, /*reusedNames*/ undefined);
}
var oldSourceFile = oldProgram && oldProgram.getSourceFile(file.fileName);
if (oldSourceFile !== file && file.resolvedModules) {
// `file` was created for the new program.
//
// We only set `file.resolvedModules` via work from the current function,
// so it is defined iff we already called the current function on `file`.
// That call happened no later than the creation of the `file` object,
// which per above occurred during the current program creation.
// Since we assume the filesystem does not change during program creation,
// it is safe to reuse resolutions from the earlier call.
var result_14 = [];
for (var _i = 0, moduleNames_1 = moduleNames; _i < moduleNames_1.length; _i++) {
var moduleName = moduleNames_1[_i];
var resolvedModule = file.resolvedModules.get(moduleName);
result_14.push(resolvedModule);
}
return result_14;
}
// At this point, we know at least one of the following hold:
// - file has local declarations for ambient modules
// - old program state is available
// With this information, we can infer some module resolutions without performing resolution.
/** An ordered list of module names for which we cannot recover the resolution. */
var unknownModuleNames;
/**
* The indexing of elements in this list matches that of `moduleNames`.
*
* Before combining results, result[i] is in one of the following states:
* * undefined: needs to be recomputed,
* * predictedToResolveToAmbientModuleMarker: known to be an ambient module.
* Needs to be reset to undefined before returning,
* * ResolvedModuleFull instance: can be reused.
*/
var result;
var reusedNames;
/** A transient placeholder used to mark predicted resolution in the result list. */
var predictedToResolveToAmbientModuleMarker = {};
for (var i = 0; i < moduleNames.length; i++) {
var moduleName = moduleNames[i];
// If the source file is unchanged and doesnt have invalidated resolution, reuse the module resolutions
if (file === oldSourceFile && !hasInvalidatedResolution(oldSourceFile.path)) {
var oldResolvedModule = ts.getResolvedModule(oldSourceFile, moduleName);
if (oldResolvedModule) {
if (ts.isTraceEnabled(options, host)) {
ts.trace(host, oldResolvedModule.packageId ?
ts.Diagnostics.Reusing_resolution_of_module_0_from_1_of_old_program_it_was_successfully_resolved_to_2_with_Package_ID_3 :
ts.Diagnostics.Reusing_resolution_of_module_0_from_1_of_old_program_it_was_successfully_resolved_to_2, moduleName, ts.getNormalizedAbsolutePath(file.originalFileName, currentDirectory), oldResolvedModule.resolvedFileName, oldResolvedModule.packageId && ts.packageIdToString(oldResolvedModule.packageId));
}
(result || (result = new Array(moduleNames.length)))[i] = oldResolvedModule;
(reusedNames || (reusedNames = [])).push(moduleName);
continue;
}
}
// We know moduleName resolves to an ambient module provided that moduleName:
// - is in the list of ambient modules locally declared in the current source file.
// - resolved to an ambient module in the old program whose declaration is in an unmodified file
// (so the same module declaration will land in the new program)
var resolvesToAmbientModuleInNonModifiedFile = false;
if (ts.contains(file.ambientModuleNames, moduleName)) {
resolvesToAmbientModuleInNonModifiedFile = true;
if (ts.isTraceEnabled(options, host)) {
ts.trace(host, ts.Diagnostics.Module_0_was_resolved_as_locally_declared_ambient_module_in_file_1, moduleName, ts.getNormalizedAbsolutePath(file.originalFileName, currentDirectory));
}
}
else {
resolvesToAmbientModuleInNonModifiedFile = moduleNameResolvesToAmbientModuleInNonModifiedFile(moduleName);
}
if (resolvesToAmbientModuleInNonModifiedFile) {
(result || (result = new Array(moduleNames.length)))[i] = predictedToResolveToAmbientModuleMarker;
}
else {
// Resolution failed in the old program, or resolved to an ambient module for which we can't reuse the result.
(unknownModuleNames || (unknownModuleNames = [])).push(moduleName);
}
}
var resolutions = unknownModuleNames && unknownModuleNames.length
? resolveModuleNamesWorker(unknownModuleNames, file, reusedNames)
: ts.emptyArray;
// Combine results of resolutions and predicted results
if (!result) {
// There were no unresolved/ambient resolutions.
ts.Debug.assert(resolutions.length === moduleNames.length);
return resolutions;
}
var j = 0;
for (var i = 0; i < result.length; i++) {
if (result[i]) {
// `result[i]` is either a `ResolvedModuleFull` or a marker.
// If it is the former, we can leave it as is.
if (result[i] === predictedToResolveToAmbientModuleMarker) {
result[i] = undefined; // TODO: GH#18217
}
}
else {
result[i] = resolutions[j];
j++;
}
}
ts.Debug.assert(j === resolutions.length);
return result;
// If we change our policy of rechecking failed lookups on each program create,
// we should adjust the value returned here.
function moduleNameResolvesToAmbientModuleInNonModifiedFile(moduleName) {
var resolutionToFile = ts.getResolvedModule(oldSourceFile, moduleName);
var resolvedFile = resolutionToFile && oldProgram.getSourceFile(resolutionToFile.resolvedFileName);
if (resolutionToFile && resolvedFile) {
// In the old program, we resolved to an ambient module that was in the same
// place as we expected to find an actual module file.
// We actually need to return 'false' here even though this seems like a 'true' case
// because the normal module resolution algorithm will find this anyway.
return false;
}
// at least one of declarations should come from non-modified source file
var unmodifiedFile = ambientModuleNameToUnmodifiedFileName.get(moduleName);
if (!unmodifiedFile) {
return false;
}
if (ts.isTraceEnabled(options, host)) {
ts.trace(host, ts.Diagnostics.Module_0_was_resolved_as_ambient_module_declared_in_1_since_this_file_was_not_modified, moduleName, unmodifiedFile);
}
return true;
}
}
function canReuseProjectReferences() {
return !forEachProjectReference(oldProgram.getProjectReferences(), oldProgram.getResolvedProjectReferences(), function (oldResolvedRef, parent, index) {
var newRef = (parent ? parent.commandLine.projectReferences : projectReferences)[index];
var newResolvedRef = parseProjectReferenceConfigFile(newRef);
if (oldResolvedRef) {
// Resolved project reference has gone missing or changed
return !newResolvedRef ||
newResolvedRef.sourceFile !== oldResolvedRef.sourceFile ||
!ts.arrayIsEqualTo(oldResolvedRef.commandLine.fileNames, newResolvedRef.commandLine.fileNames);
}
else {
// A previously-unresolved reference may be resolved now
return newResolvedRef !== undefined;
}
}, function (oldProjectReferences, parent) {
// If array of references is changed, we cant resue old program
var newReferences = parent ? getResolvedProjectReferenceByPath(parent.sourceFile.path).commandLine.projectReferences : projectReferences;
return !ts.arrayIsEqualTo(oldProjectReferences, newReferences, ts.projectReferenceIsEqualTo);
});
}
function tryReuseStructureFromOldProgram() {
var _a;
if (!oldProgram) {
return 0 /* Not */;
}
// check properties that can affect structure of the program or module resolution strategy
// if any of these properties has changed - structure cannot be reused
var oldOptions = oldProgram.getCompilerOptions();
if (ts.changesAffectModuleResolution(oldOptions, options)) {
return 0 /* Not */;
}
// there is an old program, check if we can reuse its structure
var oldRootNames = oldProgram.getRootFileNames();
if (!ts.arrayIsEqualTo(oldRootNames, rootNames)) {
return 0 /* Not */;
}
// Check if any referenced project tsconfig files are different
if (!canReuseProjectReferences()) {
return 0 /* Not */;
}
if (projectReferences) {
resolvedProjectReferences = projectReferences.map(parseProjectReferenceConfigFile);
}
// check if program source files has changed in the way that can affect structure of the program
var newSourceFiles = [];
var modifiedSourceFiles = [];
structureIsReused = 2 /* Completely */;
// If the missing file paths are now present, it can change the progam structure,
// and hence cant reuse the structure.
// This is same as how we dont reuse the structure if one of the file from old program is now missing
if (oldProgram.getMissingFilePaths().some(function (missingFilePath) { return host.fileExists(missingFilePath); })) {
return 0 /* Not */;
}
var oldSourceFiles = oldProgram.getSourceFiles();
var SeenPackageName;
(function (SeenPackageName) {
SeenPackageName[SeenPackageName["Exists"] = 0] = "Exists";
SeenPackageName[SeenPackageName["Modified"] = 1] = "Modified";
})(SeenPackageName || (SeenPackageName = {}));
var seenPackageNames = new ts.Map();
for (var _i = 0, oldSourceFiles_2 = oldSourceFiles; _i < oldSourceFiles_2.length; _i++) {
var oldSourceFile = oldSourceFiles_2[_i];
var newSourceFile = host.getSourceFileByPath
? host.getSourceFileByPath(oldSourceFile.fileName, oldSourceFile.resolvedPath, options.target, /*onError*/ undefined, shouldCreateNewSourceFile)
: host.getSourceFile(oldSourceFile.fileName, options.target, /*onError*/ undefined, shouldCreateNewSourceFile); // TODO: GH#18217
if (!newSourceFile) {
return 0 /* Not */;
}
ts.Debug.assert(!newSourceFile.redirectInfo, "Host should not return a redirect source file from `getSourceFile`");
var fileChanged = void 0;
if (oldSourceFile.redirectInfo) {
// We got `newSourceFile` by path, so it is actually for the unredirected file.
// This lets us know if the unredirected file has changed. If it has we should break the redirect.
if (newSourceFile !== oldSourceFile.redirectInfo.unredirected) {
// Underlying file has changed. Might not redirect anymore. Must rebuild program.
return 0 /* Not */;
}
fileChanged = false;
newSourceFile = oldSourceFile; // Use the redirect.
}
else if (oldProgram.redirectTargetsMap.has(oldSourceFile.path)) {
// If a redirected-to source file changes, the redirect may be broken.
if (newSourceFile !== oldSourceFile) {
return 0 /* Not */;
}
fileChanged = false;
}
else {
fileChanged = newSourceFile !== oldSourceFile;
}
// Since the project references havent changed, its right to set originalFileName and resolvedPath here
newSourceFile.path = oldSourceFile.path;
newSourceFile.originalFileName = oldSourceFile.originalFileName;
newSourceFile.resolvedPath = oldSourceFile.resolvedPath;
newSourceFile.fileName = oldSourceFile.fileName;
var packageName = oldProgram.sourceFileToPackageName.get(oldSourceFile.path);
if (packageName !== undefined) {
// If there are 2 different source files for the same package name and at least one of them changes,
// they might become redirects. So we must rebuild the program.
var prevKind = seenPackageNames.get(packageName);
var newKind = fileChanged ? 1 /* Modified */ : 0 /* Exists */;
if ((prevKind !== undefined && newKind === 1 /* Modified */) || prevKind === 1 /* Modified */) {
return 0 /* Not */;
}
seenPackageNames.set(packageName, newKind);
}
if (fileChanged) {
// The `newSourceFile` object was created for the new program.
if (!ts.arrayIsEqualTo(oldSourceFile.libReferenceDirectives, newSourceFile.libReferenceDirectives, fileReferenceIsEqualTo)) {
// 'lib' references has changed. Matches behavior in changesAffectModuleResolution
structureIsReused = 1 /* SafeModules */;
}
if (oldSourceFile.hasNoDefaultLib !== newSourceFile.hasNoDefaultLib) {
// value of no-default-lib has changed
// this will affect if default library is injected into the list of files
structureIsReused = 1 /* SafeModules */;
}
// check tripleslash references
if (!ts.arrayIsEqualTo(oldSourceFile.referencedFiles, newSourceFile.referencedFiles, fileReferenceIsEqualTo)) {
// tripleslash references has changed
structureIsReused = 1 /* SafeModules */;
}
// check imports and module augmentations
collectExternalModuleReferences(newSourceFile);
if (!ts.arrayIsEqualTo(oldSourceFile.imports, newSourceFile.imports, moduleNameIsEqualTo)) {
// imports has changed
structureIsReused = 1 /* SafeModules */;
}
if (!ts.arrayIsEqualTo(oldSourceFile.moduleAugmentations, newSourceFile.moduleAugmentations, moduleNameIsEqualTo)) {
// moduleAugmentations has changed
structureIsReused = 1 /* SafeModules */;
}
if ((oldSourceFile.flags & 3145728 /* PermanentlySetIncrementalFlags */) !== (newSourceFile.flags & 3145728 /* PermanentlySetIncrementalFlags */)) {
// dynamicImport has changed
structureIsReused = 1 /* SafeModules */;
}
if (!ts.arrayIsEqualTo(oldSourceFile.typeReferenceDirectives, newSourceFile.typeReferenceDirectives, fileReferenceIsEqualTo)) {
// 'types' references has changed
structureIsReused = 1 /* SafeModules */;
}
// tentatively approve the file
modifiedSourceFiles.push({ oldFile: oldSourceFile, newFile: newSourceFile });
}
else if (hasInvalidatedResolution(oldSourceFile.path)) {
// 'module/types' references could have changed
structureIsReused = 1 /* SafeModules */;
// add file to the modified list so that we will resolve it later
modifiedSourceFiles.push({ oldFile: oldSourceFile, newFile: newSourceFile });
}
// if file has passed all checks it should be safe to reuse it
newSourceFiles.push(newSourceFile);
}
if (structureIsReused !== 2 /* Completely */) {
return structureIsReused;
}
var modifiedFiles = modifiedSourceFiles.map(function (f) { return f.oldFile; });
for (var _b = 0, oldSourceFiles_3 = oldSourceFiles; _b < oldSourceFiles_3.length; _b++) {
var oldFile = oldSourceFiles_3[_b];
if (!ts.contains(modifiedFiles, oldFile)) {
for (var _c = 0, _d = oldFile.ambientModuleNames; _c < _d.length; _c++) {
var moduleName = _d[_c];
ambientModuleNameToUnmodifiedFileName.set(moduleName, oldFile.fileName);
}
}
}
// try to verify results of module resolution
for (var _e = 0, modifiedSourceFiles_1 = modifiedSourceFiles; _e < modifiedSourceFiles_1.length; _e++) {
var _f = modifiedSourceFiles_1[_e], oldSourceFile = _f.oldFile, newSourceFile = _f.newFile;
var moduleNames = getModuleNames(newSourceFile);
var resolutions = resolveModuleNamesReusingOldState(moduleNames, newSourceFile);
// ensure that module resolution results are still correct
var resolutionsChanged = ts.hasChangesInResolutions(moduleNames, resolutions, oldSourceFile.resolvedModules, ts.moduleResolutionIsEqualTo);
if (resolutionsChanged) {
structureIsReused = 1 /* SafeModules */;
newSourceFile.resolvedModules = ts.zipToMap(moduleNames, resolutions);
}
else {
newSourceFile.resolvedModules = oldSourceFile.resolvedModules;
}
// We lower-case all type references because npm automatically lowercases all packages. See GH#9824.
var typesReferenceDirectives = ts.map(newSourceFile.typeReferenceDirectives, function (ref) { return ts.toFileNameLowerCase(ref.fileName); });
var typeReferenceResolutions = resolveTypeReferenceDirectiveNamesWorker(typesReferenceDirectives, newSourceFile);
// ensure that types resolutions are still correct
var typeReferenceEesolutionsChanged = ts.hasChangesInResolutions(typesReferenceDirectives, typeReferenceResolutions, oldSourceFile.resolvedTypeReferenceDirectiveNames, ts.typeDirectiveIsEqualTo);
if (typeReferenceEesolutionsChanged) {
structureIsReused = 1 /* SafeModules */;
newSourceFile.resolvedTypeReferenceDirectiveNames = ts.zipToMap(typesReferenceDirectives, typeReferenceResolutions);
}
else {
newSourceFile.resolvedTypeReferenceDirectiveNames = oldSourceFile.resolvedTypeReferenceDirectiveNames;
}
}
if (structureIsReused !== 2 /* Completely */) {
return structureIsReused;
}
if (ts.changesAffectingProgramStructure(oldOptions, options) || ((_a = host.hasChangedAutomaticTypeDirectiveNames) === null || _a === void 0 ? void 0 : _a.call(host))) {
return 1 /* SafeModules */;
}
missingFilePaths = oldProgram.getMissingFilePaths();
// update fileName -> file mapping
ts.Debug.assert(newSourceFiles.length === oldProgram.getSourceFiles().length);
for (var _g = 0, newSourceFiles_1 = newSourceFiles; _g < newSourceFiles_1.length; _g++) {
var newSourceFile = newSourceFiles_1[_g];
filesByName.set(newSourceFile.path, newSourceFile);
}
var oldFilesByNameMap = oldProgram.getFilesByNameMap();
oldFilesByNameMap.forEach(function (oldFile, path) {
if (!oldFile) {
filesByName.set(path, oldFile);
return;
}
if (oldFile.path === path) {
// Set the file as found during node modules search if it was found that way in old progra,
if (oldProgram.isSourceFileFromExternalLibrary(oldFile)) {
sourceFilesFoundSearchingNodeModules.set(oldFile.path, true);
}
return;
}
filesByName.set(path, filesByName.get(oldFile.path));
});
files = newSourceFiles;
fileReasons = oldProgram.getFileIncludeReasons();
fileProcessingDiagnostics = oldProgram.getFileProcessingDiagnostics();
resolvedTypeReferenceDirectives = oldProgram.getResolvedTypeReferenceDirectives();
sourceFileToPackageName = oldProgram.sourceFileToPackageName;
redirectTargetsMap = oldProgram.redirectTargetsMap;
usesUriStyleNodeCoreModules = oldProgram.usesUriStyleNodeCoreModules;
return 2 /* Completely */;
}
function getEmitHost(writeFileCallback) {
return {
getPrependNodes: getPrependNodes,
getCanonicalFileName: getCanonicalFileName,
getCommonSourceDirectory: program.getCommonSourceDirectory,
getCompilerOptions: program.getCompilerOptions,
getCurrentDirectory: function () { return currentDirectory; },
getNewLine: function () { return host.getNewLine(); },
getSourceFile: program.getSourceFile,
getSourceFileByPath: program.getSourceFileByPath,
getSourceFiles: program.getSourceFiles,
getLibFileFromReference: program.getLibFileFromReference,
isSourceFileFromExternalLibrary: isSourceFileFromExternalLibrary,
getResolvedProjectReferenceToRedirect: getResolvedProjectReferenceToRedirect,
getProjectReferenceRedirect: getProjectReferenceRedirect,
isSourceOfProjectReferenceRedirect: isSourceOfProjectReferenceRedirect,
getSymlinkCache: getSymlinkCache,
writeFile: writeFileCallback || (function (fileName, data, writeByteOrderMark, onError, sourceFiles) { return host.writeFile(fileName, data, writeByteOrderMark, onError, sourceFiles); }),
isEmitBlocked: isEmitBlocked,
readFile: function (f) { return host.readFile(f); },
fileExists: function (f) {
// Use local caches
var path = toPath(f);
if (getSourceFileByPath(path))
return true;
if (ts.contains(missingFilePaths, path))
return false;
// Before falling back to the host
return host.fileExists(f);
},
useCaseSensitiveFileNames: function () { return host.useCaseSensitiveFileNames(); },
getProgramBuildInfo: function () { return program.getProgramBuildInfo && program.getProgramBuildInfo(); },
getSourceFileFromReference: function (file, ref) { return program.getSourceFileFromReference(file, ref); },
redirectTargetsMap: redirectTargetsMap,
getFileIncludeReasons: program.getFileIncludeReasons,
};
}
function emitBuildInfo(writeFileCallback) {
ts.Debug.assert(!ts.outFile(options));
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("emit" /* Emit */, "emitBuildInfo", {}, /*separateBeginAndEnd*/ true);
ts.performance.mark("beforeEmit");
var emitResult = ts.emitFiles(ts.notImplementedResolver, getEmitHost(writeFileCallback),
/*targetSourceFile*/ undefined,
/*transformers*/ ts.noTransformers,
/*emitOnlyDtsFiles*/ false,
/*onlyBuildInfo*/ true);
ts.performance.mark("afterEmit");
ts.performance.measure("Emit", "beforeEmit", "afterEmit");
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
return emitResult;
}
function getResolvedProjectReferences() {
return resolvedProjectReferences;
}
function getProjectReferences() {
return projectReferences;
}
function getPrependNodes() {
return createPrependNodes(projectReferences, function (_ref, index) { var _a; return (_a = resolvedProjectReferences[index]) === null || _a === void 0 ? void 0 : _a.commandLine; }, function (fileName) {
var path = toPath(fileName);
var sourceFile = getSourceFileByPath(path);
return sourceFile ? sourceFile.text : filesByName.has(path) ? undefined : host.readFile(path);
});
}
function isSourceFileFromExternalLibrary(file) {
return !!sourceFilesFoundSearchingNodeModules.get(file.path);
}
function isSourceFileDefaultLibrary(file) {
if (file.hasNoDefaultLib) {
return true;
}
if (!options.noLib) {
return false;
}
// If '--lib' is not specified, include default library file according to '--target'
// otherwise, using options specified in '--lib' instead of '--target' default library file
var equalityComparer = host.useCaseSensitiveFileNames() ? ts.equateStringsCaseSensitive : ts.equateStringsCaseInsensitive;
if (!options.lib) {
return equalityComparer(file.fileName, getDefaultLibraryFileName());
}
else {
return ts.some(options.lib, function (libFileName) { return equalityComparer(file.fileName, ts.combinePaths(defaultLibraryPath, libFileName)); });
}
}
function getDiagnosticsProducingTypeChecker() {
return diagnosticsProducingTypeChecker || (diagnosticsProducingTypeChecker = ts.createTypeChecker(program, /*produceDiagnostics:*/ true));
}
function dropDiagnosticsProducingTypeChecker() {
diagnosticsProducingTypeChecker = undefined;
}
function getTypeChecker() {
return noDiagnosticsTypeChecker || (noDiagnosticsTypeChecker = ts.createTypeChecker(program, /*produceDiagnostics:*/ false));
}
function emit(sourceFile, writeFileCallback, cancellationToken, emitOnlyDtsFiles, transformers, forceDtsEmit) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("emit" /* Emit */, "emit", { path: sourceFile === null || sourceFile === void 0 ? void 0 : sourceFile.path }, /*separateBeginAndEnd*/ true);
var result = runWithCancellationToken(function () { return emitWorker(program, sourceFile, writeFileCallback, cancellationToken, emitOnlyDtsFiles, transformers, forceDtsEmit); });
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
return result;
}
function isEmitBlocked(emitFileName) {
return hasEmitBlockingDiagnostics.has(toPath(emitFileName));
}
function emitWorker(program, sourceFile, writeFileCallback, cancellationToken, emitOnlyDtsFiles, customTransformers, forceDtsEmit) {
if (!forceDtsEmit) {
var result = handleNoEmitOptions(program, sourceFile, writeFileCallback, cancellationToken);
if (result)
return result;
}
// Create the emit resolver outside of the "emitTime" tracking code below. That way
// any cost associated with it (like type checking) are appropriate associated with
// the type-checking counter.
//
// If the -out option is specified, we should not pass the source file to getEmitResolver.
// This is because in the -out scenario all files need to be emitted, and therefore all
// files need to be type checked. And the way to specify that all files need to be type
// checked is to not pass the file to getEmitResolver.
var emitResolver = getDiagnosticsProducingTypeChecker().getEmitResolver(ts.outFile(options) ? undefined : sourceFile, cancellationToken);
ts.performance.mark("beforeEmit");
var emitResult = ts.emitFiles(emitResolver, getEmitHost(writeFileCallback), sourceFile, ts.getTransformers(options, customTransformers, emitOnlyDtsFiles), emitOnlyDtsFiles,
/*onlyBuildInfo*/ false, forceDtsEmit);
ts.performance.mark("afterEmit");
ts.performance.measure("Emit", "beforeEmit", "afterEmit");
return emitResult;
}
function getSourceFile(fileName) {
return getSourceFileByPath(toPath(fileName));
}
function getSourceFileByPath(path) {
return filesByName.get(path) || undefined;
}
function getDiagnosticsHelper(sourceFile, getDiagnostics, cancellationToken) {
if (sourceFile) {
return getDiagnostics(sourceFile, cancellationToken);
}
return ts.sortAndDeduplicateDiagnostics(ts.flatMap(program.getSourceFiles(), function (sourceFile) {
if (cancellationToken) {
cancellationToken.throwIfCancellationRequested();
}
return getDiagnostics(sourceFile, cancellationToken);
}));
}
function getSyntacticDiagnostics(sourceFile, cancellationToken) {
return getDiagnosticsHelper(sourceFile, getSyntacticDiagnosticsForFile, cancellationToken);
}
function getSemanticDiagnostics(sourceFile, cancellationToken) {
return getDiagnosticsHelper(sourceFile, getSemanticDiagnosticsForFile, cancellationToken);
}
function getCachedSemanticDiagnostics(sourceFile) {
var _a;
return sourceFile
? (_a = cachedBindAndCheckDiagnosticsForFile.perFile) === null || _a === void 0 ? void 0 : _a.get(sourceFile.path)
: cachedBindAndCheckDiagnosticsForFile.allDiagnostics;
}
function getBindAndCheckDiagnostics(sourceFile, cancellationToken) {
return getBindAndCheckDiagnosticsForFile(sourceFile, cancellationToken);
}
function getProgramDiagnostics(sourceFile) {
var _a;
if (ts.skipTypeChecking(sourceFile, options, program)) {
return ts.emptyArray;
}
var programDiagnosticsInFile = programDiagnostics.getDiagnostics(sourceFile.fileName);
if (!((_a = sourceFile.commentDirectives) === null || _a === void 0 ? void 0 : _a.length)) {
return programDiagnosticsInFile;
}
return getDiagnosticsWithPrecedingDirectives(sourceFile, sourceFile.commentDirectives, programDiagnosticsInFile).diagnostics;
}
function getDeclarationDiagnostics(sourceFile, cancellationToken) {
var options = program.getCompilerOptions();
// collect diagnostics from the program only once if either no source file was specified or out/outFile is set (bundled emit)
if (!sourceFile || ts.outFile(options)) {
return getDeclarationDiagnosticsWorker(sourceFile, cancellationToken);
}
else {
return getDiagnosticsHelper(sourceFile, getDeclarationDiagnosticsForFile, cancellationToken);
}
}
function getSyntacticDiagnosticsForFile(sourceFile) {
// For JavaScript files, we report semantic errors for using TypeScript-only
// constructs from within a JavaScript file as syntactic errors.
if (ts.isSourceFileJS(sourceFile)) {
if (!sourceFile.additionalSyntacticDiagnostics) {
sourceFile.additionalSyntacticDiagnostics = getJSSyntacticDiagnosticsForFile(sourceFile);
}
return ts.concatenate(sourceFile.additionalSyntacticDiagnostics, sourceFile.parseDiagnostics);
}
return sourceFile.parseDiagnostics;
}
function runWithCancellationToken(func) {
try {
return func();
}
catch (e) {
if (e instanceof ts.OperationCanceledException) {
// We were canceled while performing the operation. Because our type checker
// might be a bad state, we need to throw it away.
//
// Note: we are overly aggressive here. We do not actually *have* to throw away
// the "noDiagnosticsTypeChecker". However, for simplicity, i'd like to keep
// the lifetimes of these two TypeCheckers the same. Also, we generally only
// cancel when the user has made a change anyways. And, in that case, we (the
// program instance) will get thrown away anyways. So trying to keep one of
// these type checkers alive doesn't serve much purpose.
noDiagnosticsTypeChecker = undefined;
diagnosticsProducingTypeChecker = undefined;
}
throw e;
}
}
function getSemanticDiagnosticsForFile(sourceFile, cancellationToken) {
return ts.concatenate(filterSemanticDiagnostics(getBindAndCheckDiagnosticsForFile(sourceFile, cancellationToken), options), getProgramDiagnostics(sourceFile));
}
function getBindAndCheckDiagnosticsForFile(sourceFile, cancellationToken) {
return getAndCacheDiagnostics(sourceFile, cancellationToken, cachedBindAndCheckDiagnosticsForFile, getBindAndCheckDiagnosticsForFileNoCache);
}
function getBindAndCheckDiagnosticsForFileNoCache(sourceFile, cancellationToken) {
return runWithCancellationToken(function () {
if (ts.skipTypeChecking(sourceFile, options, program)) {
return ts.emptyArray;
}
var typeChecker = getDiagnosticsProducingTypeChecker();
ts.Debug.assert(!!sourceFile.bindDiagnostics);
var isCheckJs = ts.isCheckJsEnabledForFile(sourceFile, options);
var isTsNoCheck = !!sourceFile.checkJsDirective && sourceFile.checkJsDirective.enabled === false;
// By default, only type-check .ts, .tsx, 'Deferred' and 'External' files (external files are added by plugins)
var includeBindAndCheckDiagnostics = !isTsNoCheck && (sourceFile.scriptKind === 3 /* TS */ || sourceFile.scriptKind === 4 /* TSX */
|| sourceFile.scriptKind === 5 /* External */ || isCheckJs || sourceFile.scriptKind === 7 /* Deferred */);
var bindDiagnostics = includeBindAndCheckDiagnostics ? sourceFile.bindDiagnostics : ts.emptyArray;
var checkDiagnostics = includeBindAndCheckDiagnostics ? typeChecker.getDiagnostics(sourceFile, cancellationToken) : ts.emptyArray;
return getMergedBindAndCheckDiagnostics(sourceFile, includeBindAndCheckDiagnostics, bindDiagnostics, checkDiagnostics, isCheckJs ? sourceFile.jsDocDiagnostics : undefined);
});
}
function getMergedBindAndCheckDiagnostics(sourceFile, includeBindAndCheckDiagnostics) {
var _a;
var allDiagnostics = [];
for (var _i = 2; _i < arguments.length; _i++) {
allDiagnostics[_i - 2] = arguments[_i];
}
var flatDiagnostics = ts.flatten(allDiagnostics);
if (!includeBindAndCheckDiagnostics || !((_a = sourceFile.commentDirectives) === null || _a === void 0 ? void 0 : _a.length)) {
return flatDiagnostics;
}
var _b = getDiagnosticsWithPrecedingDirectives(sourceFile, sourceFile.commentDirectives, flatDiagnostics), diagnostics = _b.diagnostics, directives = _b.directives;
for (var _c = 0, _d = directives.getUnusedExpectations(); _c < _d.length; _c++) {
var errorExpectation = _d[_c];
diagnostics.push(ts.createDiagnosticForRange(sourceFile, errorExpectation.range, ts.Diagnostics.Unused_ts_expect_error_directive));
}
return diagnostics;
}
/**
* Creates a map of comment directives along with the diagnostics immediately preceded by one of them.
* Comments that match to any of those diagnostics are marked as used.
*/
function getDiagnosticsWithPrecedingDirectives(sourceFile, commentDirectives, flatDiagnostics) {
// Diagnostics are only reported if there is no comment directive preceding them
// This will modify the directives map by marking "used" ones with a corresponding diagnostic
var directives = ts.createCommentDirectivesMap(sourceFile, commentDirectives);
var diagnostics = flatDiagnostics.filter(function (diagnostic) { return markPrecedingCommentDirectiveLine(diagnostic, directives) === -1; });
return { diagnostics: diagnostics, directives: directives };
}
function getSuggestionDiagnostics(sourceFile, cancellationToken) {
return runWithCancellationToken(function () {
return getDiagnosticsProducingTypeChecker().getSuggestionDiagnostics(sourceFile, cancellationToken);
});
}
/**
* @returns The line index marked as preceding the diagnostic, or -1 if none was.
*/
function markPrecedingCommentDirectiveLine(diagnostic, directives) {
var file = diagnostic.file, start = diagnostic.start;
if (!file) {
return -1;
}
// Start out with the line just before the text
var lineStarts = ts.getLineStarts(file);
var line = ts.computeLineAndCharacterOfPosition(lineStarts, start).line - 1; // TODO: GH#18217
while (line >= 0) {
// As soon as that line is known to have a comment directive, use that
if (directives.markUsed(line)) {
return line;
}
// Stop searching if the line is not empty and not a comment
var lineText = file.text.slice(lineStarts[line], lineStarts[line + 1]).trim();
if (lineText !== "" && !/^(\s*)\/\/(.*)$/.test(lineText)) {
return -1;
}
line--;
}
return -1;
}
function getJSSyntacticDiagnosticsForFile(sourceFile) {
return runWithCancellationToken(function () {
var diagnostics = [];
walk(sourceFile, sourceFile);
ts.forEachChildRecursively(sourceFile, walk, walkArray);
return diagnostics;
function walk(node, parent) {
// Return directly from the case if the given node doesnt want to visit each child
// Otherwise break to visit each child
switch (parent.kind) {
case 162 /* Parameter */:
case 165 /* PropertyDeclaration */:
case 167 /* MethodDeclaration */:
if (parent.questionToken === node) {
diagnostics.push(createDiagnosticForNode(node, ts.Diagnostics.The_0_modifier_can_only_be_used_in_TypeScript_files, "?"));
return "skip";
}
// falls through
case 166 /* MethodSignature */:
case 169 /* Constructor */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 211 /* FunctionExpression */:
case 254 /* FunctionDeclaration */:
case 212 /* ArrowFunction */:
case 252 /* VariableDeclaration */:
// type annotation
if (parent.type === node) {
diagnostics.push(createDiagnosticForNode(node, ts.Diagnostics.Type_annotations_can_only_be_used_in_TypeScript_files));
return "skip";
}
}
switch (node.kind) {
case 265 /* ImportClause */:
if (node.isTypeOnly) {
diagnostics.push(createDiagnosticForNode(parent, ts.Diagnostics._0_declarations_can_only_be_used_in_TypeScript_files, "import type"));
return "skip";
}
break;
case 270 /* ExportDeclaration */:
if (node.isTypeOnly) {
diagnostics.push(createDiagnosticForNode(node, ts.Diagnostics._0_declarations_can_only_be_used_in_TypeScript_files, "export type"));
return "skip";
}
break;
case 263 /* ImportEqualsDeclaration */:
diagnostics.push(createDiagnosticForNode(node, ts.Diagnostics.import_can_only_be_used_in_TypeScript_files));
return "skip";
case 269 /* ExportAssignment */:
if (node.isExportEquals) {
diagnostics.push(createDiagnosticForNode(node, ts.Diagnostics.export_can_only_be_used_in_TypeScript_files));
return "skip";
}
break;
case 289 /* HeritageClause */:
var heritageClause = node;
if (heritageClause.token === 117 /* ImplementsKeyword */) {
diagnostics.push(createDiagnosticForNode(node, ts.Diagnostics.implements_clauses_can_only_be_used_in_TypeScript_files));
return "skip";
}
break;
case 256 /* InterfaceDeclaration */:
var interfaceKeyword = ts.tokenToString(118 /* InterfaceKeyword */);
ts.Debug.assertIsDefined(interfaceKeyword);
diagnostics.push(createDiagnosticForNode(node, ts.Diagnostics._0_declarations_can_only_be_used_in_TypeScript_files, interfaceKeyword));
return "skip";
case 259 /* ModuleDeclaration */:
var moduleKeyword = node.flags & 16 /* Namespace */ ? ts.tokenToString(141 /* NamespaceKeyword */) : ts.tokenToString(140 /* ModuleKeyword */);
ts.Debug.assertIsDefined(moduleKeyword);
diagnostics.push(createDiagnosticForNode(node, ts.Diagnostics._0_declarations_can_only_be_used_in_TypeScript_files, moduleKeyword));
return "skip";
case 257 /* TypeAliasDeclaration */:
diagnostics.push(createDiagnosticForNode(node, ts.Diagnostics.Type_aliases_can_only_be_used_in_TypeScript_files));
return "skip";
case 258 /* EnumDeclaration */:
var enumKeyword = ts.Debug.checkDefined(ts.tokenToString(92 /* EnumKeyword */));
diagnostics.push(createDiagnosticForNode(node, ts.Diagnostics._0_declarations_can_only_be_used_in_TypeScript_files, enumKeyword));
return "skip";
case 228 /* NonNullExpression */:
diagnostics.push(createDiagnosticForNode(node, ts.Diagnostics.Non_null_assertions_can_only_be_used_in_TypeScript_files));
return "skip";
case 227 /* AsExpression */:
diagnostics.push(createDiagnosticForNode(node.type, ts.Diagnostics.Type_assertion_expressions_can_only_be_used_in_TypeScript_files));
return "skip";
case 209 /* TypeAssertionExpression */:
ts.Debug.fail(); // Won't parse these in a JS file anyway, as they are interpreted as JSX.
}
}
function walkArray(nodes, parent) {
if (parent.decorators === nodes && !options.experimentalDecorators) {
diagnostics.push(createDiagnosticForNode(parent, ts.Diagnostics.Experimental_support_for_decorators_is_a_feature_that_is_subject_to_change_in_a_future_release_Set_the_experimentalDecorators_option_in_your_tsconfig_or_jsconfig_to_remove_this_warning));
}
switch (parent.kind) {
case 255 /* ClassDeclaration */:
case 224 /* ClassExpression */:
case 167 /* MethodDeclaration */:
case 169 /* Constructor */:
case 170 /* GetAccessor */:
case 171 /* SetAccessor */:
case 211 /* FunctionExpression */:
case 254 /* FunctionDeclaration */:
case 212 /* ArrowFunction */:
// Check type parameters
if (nodes === parent.typeParameters) {
diagnostics.push(createDiagnosticForNodeArray(nodes, ts.Diagnostics.Type_parameter_declarations_can_only_be_used_in_TypeScript_files));
return "skip";
}
// falls through
case 235 /* VariableStatement */:
// Check modifiers
if (nodes === parent.modifiers) {
checkModifiers(parent.modifiers, parent.kind === 235 /* VariableStatement */);
return "skip";
}
break;
case 165 /* PropertyDeclaration */:
// Check modifiers of property declaration
if (nodes === parent.modifiers) {
for (var _i = 0, _a = nodes; _i < _a.length; _i++) {
var modifier = _a[_i];
if (modifier.kind !== 124 /* StaticKeyword */) {
diagnostics.push(createDiagnosticForNode(modifier, ts.Diagnostics.The_0_modifier_can_only_be_used_in_TypeScript_files, ts.tokenToString(modifier.kind)));
}
}
return "skip";
}
break;
case 162 /* Parameter */:
// Check modifiers of parameter declaration
if (nodes === parent.modifiers) {
diagnostics.push(createDiagnosticForNodeArray(nodes, ts.Diagnostics.Parameter_modifiers_can_only_be_used_in_TypeScript_files));
return "skip";
}
break;
case 206 /* CallExpression */:
case 207 /* NewExpression */:
case 226 /* ExpressionWithTypeArguments */:
case 277 /* JsxSelfClosingElement */:
case 278 /* JsxOpeningElement */:
case 208 /* TaggedTemplateExpression */:
// Check type arguments
if (nodes === parent.typeArguments) {
diagnostics.push(createDiagnosticForNodeArray(nodes, ts.Diagnostics.Type_arguments_can_only_be_used_in_TypeScript_files));
return "skip";
}
break;
}
}
function checkModifiers(modifiers, isConstValid) {
for (var _i = 0, modifiers_2 = modifiers; _i < modifiers_2.length; _i++) {
var modifier = modifiers_2[_i];
switch (modifier.kind) {
case 85 /* ConstKeyword */:
if (isConstValid) {
continue;
}
// to report error,
// falls through
case 123 /* PublicKeyword */:
case 121 /* PrivateKeyword */:
case 122 /* ProtectedKeyword */:
case 143 /* ReadonlyKeyword */:
case 134 /* DeclareKeyword */:
case 126 /* AbstractKeyword */:
case 157 /* OverrideKeyword */:
diagnostics.push(createDiagnosticForNode(modifier, ts.Diagnostics.The_0_modifier_can_only_be_used_in_TypeScript_files, ts.tokenToString(modifier.kind)));
break;
// These are all legal modifiers.
case 124 /* StaticKeyword */:
case 93 /* ExportKeyword */:
case 88 /* DefaultKeyword */:
}
}
}
function createDiagnosticForNodeArray(nodes, message, arg0, arg1, arg2) {
var start = nodes.pos;
return ts.createFileDiagnostic(sourceFile, start, nodes.end - start, message, arg0, arg1, arg2);
}
// Since these are syntactic diagnostics, parent might not have been set
// this means the sourceFile cannot be infered from the node
function createDiagnosticForNode(node, message, arg0, arg1, arg2) {
return ts.createDiagnosticForNodeInSourceFile(sourceFile, node, message, arg0, arg1, arg2);
}
});
}
function getDeclarationDiagnosticsWorker(sourceFile, cancellationToken) {
return getAndCacheDiagnostics(sourceFile, cancellationToken, cachedDeclarationDiagnosticsForFile, getDeclarationDiagnosticsForFileNoCache);
}
function getDeclarationDiagnosticsForFileNoCache(sourceFile, cancellationToken) {
return runWithCancellationToken(function () {
var resolver = getDiagnosticsProducingTypeChecker().getEmitResolver(sourceFile, cancellationToken);
// Don't actually write any files since we're just getting diagnostics.
return ts.getDeclarationDiagnostics(getEmitHost(ts.noop), resolver, sourceFile) || ts.emptyArray;
});
}
function getAndCacheDiagnostics(sourceFile, cancellationToken, cache, getDiagnostics) {
var _a;
var cachedResult = sourceFile
? (_a = cache.perFile) === null || _a === void 0 ? void 0 : _a.get(sourceFile.path)
: cache.allDiagnostics;
if (cachedResult) {
return cachedResult;
}
var result = getDiagnostics(sourceFile, cancellationToken);
if (sourceFile) {
(cache.perFile || (cache.perFile = new ts.Map())).set(sourceFile.path, result);
}
else {
cache.allDiagnostics = result;
}
return result;
}
function getDeclarationDiagnosticsForFile(sourceFile, cancellationToken) {
return sourceFile.isDeclarationFile ? [] : getDeclarationDiagnosticsWorker(sourceFile, cancellationToken);
}
function getOptionsDiagnostics() {
return ts.sortAndDeduplicateDiagnostics(ts.concatenate(programDiagnostics.getGlobalDiagnostics(), getOptionsDiagnosticsOfConfigFile()));
}
function getOptionsDiagnosticsOfConfigFile() {
if (!options.configFile) {
return ts.emptyArray;
}
var diagnostics = programDiagnostics.getDiagnostics(options.configFile.fileName);
forEachResolvedProjectReference(function (resolvedRef) {
diagnostics = ts.concatenate(diagnostics, programDiagnostics.getDiagnostics(resolvedRef.sourceFile.fileName));
});
return diagnostics;
}
function getGlobalDiagnostics() {
return rootNames.length ? ts.sortAndDeduplicateDiagnostics(getDiagnosticsProducingTypeChecker().getGlobalDiagnostics().slice()) : ts.emptyArray;
}
function getConfigFileParsingDiagnostics() {
return configFileParsingDiagnostics || ts.emptyArray;
}
function processRootFile(fileName, isDefaultLib, ignoreNoDefaultLib, reason) {
processSourceFile(ts.normalizePath(fileName), isDefaultLib, ignoreNoDefaultLib, /*packageId*/ undefined, reason);
}
function fileReferenceIsEqualTo(a, b) {
return a.fileName === b.fileName;
}
function moduleNameIsEqualTo(a, b) {
return a.kind === 79 /* Identifier */
? b.kind === 79 /* Identifier */ && a.escapedText === b.escapedText
: b.kind === 10 /* StringLiteral */ && a.text === b.text;
}
function createSyntheticImport(text, file) {
var externalHelpersModuleReference = ts.factory.createStringLiteral(text);
var importDecl = ts.factory.createImportDeclaration(/*decorators*/ undefined, /*modifiers*/ undefined, /*importClause*/ undefined, externalHelpersModuleReference);
ts.addEmitFlags(importDecl, 67108864 /* NeverApplyImportHelper */);
ts.setParent(externalHelpersModuleReference, importDecl);
ts.setParent(importDecl, file);
// explicitly unset the synthesized flag on these declarations so the checker API will answer questions about them
// (which is required to build the dependency graph for incremental emit)
externalHelpersModuleReference.flags &= ~8 /* Synthesized */;
importDecl.flags &= ~8 /* Synthesized */;
return externalHelpersModuleReference;
}
function collectExternalModuleReferences(file) {
if (file.imports) {
return;
}
var isJavaScriptFile = ts.isSourceFileJS(file);
var isExternalModuleFile = ts.isExternalModule(file);
// file.imports may not be undefined if there exists dynamic import
var imports;
var moduleAugmentations;
var ambientModules;
// If we are importing helpers, we need to add a synthetic reference to resolve the
// helpers library.
if ((options.isolatedModules || isExternalModuleFile)
&& !file.isDeclarationFile) {
if (options.importHelpers) {
// synthesize 'import "tslib"' declaration
imports = [createSyntheticImport(ts.externalHelpersModuleNameText, file)];
}
var jsxImport = ts.getJSXRuntimeImport(ts.getJSXImplicitImportBase(options, file), options);
if (jsxImport) {
// synthesize `import "base/jsx-runtime"` declaration
(imports || (imports = [])).push(createSyntheticImport(jsxImport, file));
}
}
for (var _i = 0, _a = file.statements; _i < _a.length; _i++) {
var node = _a[_i];
collectModuleReferences(node, /*inAmbientModule*/ false);
}
if ((file.flags & 1048576 /* PossiblyContainsDynamicImport */) || isJavaScriptFile) {
collectDynamicImportOrRequireCalls(file);
}
file.imports = imports || ts.emptyArray;
file.moduleAugmentations = moduleAugmentations || ts.emptyArray;
file.ambientModuleNames = ambientModules || ts.emptyArray;
return;
function collectModuleReferences(node, inAmbientModule) {
if (ts.isAnyImportOrReExport(node)) {
var moduleNameExpr = ts.getExternalModuleName(node);
// TypeScript 1.0 spec (April 2014): 12.1.6
// An ExternalImportDeclaration in an AmbientExternalModuleDeclaration may reference other external modules
// only through top - level external module names. Relative external module names are not permitted.
if (moduleNameExpr && ts.isStringLiteral(moduleNameExpr) && moduleNameExpr.text && (!inAmbientModule || !ts.isExternalModuleNameRelative(moduleNameExpr.text))) {
imports = ts.append(imports, moduleNameExpr);
if (!usesUriStyleNodeCoreModules && currentNodeModulesDepth === 0 && !file.isDeclarationFile) {
usesUriStyleNodeCoreModules = ts.startsWith(moduleNameExpr.text, "node:");
}
}
}
else if (ts.isModuleDeclaration(node)) {
if (ts.isAmbientModule(node) && (inAmbientModule || ts.hasSyntacticModifier(node, 2 /* Ambient */) || file.isDeclarationFile)) {
var nameText = ts.getTextOfIdentifierOrLiteral(node.name);
// Ambient module declarations can be interpreted as augmentations for some existing external modules.
// This will happen in two cases:
// - if current file is external module then module augmentation is a ambient module declaration defined in the top level scope
// - if current file is not external module then module augmentation is an ambient module declaration with non-relative module name
// immediately nested in top level ambient module declaration .
if (isExternalModuleFile || (inAmbientModule && !ts.isExternalModuleNameRelative(nameText))) {
(moduleAugmentations || (moduleAugmentations = [])).push(node.name);
}
else if (!inAmbientModule) {
if (file.isDeclarationFile) {
// for global .d.ts files record name of ambient module
(ambientModules || (ambientModules = [])).push(nameText);
}
// An AmbientExternalModuleDeclaration declares an external module.
// This type of declaration is permitted only in the global module.
// The StringLiteral must specify a top - level external module name.
// Relative external module names are not permitted
// NOTE: body of ambient module is always a module block, if it exists
var body = node.body;
if (body) {
for (var _i = 0, _a = body.statements; _i < _a.length; _i++) {
var statement = _a[_i];
collectModuleReferences(statement, /*inAmbientModule*/ true);
}
}
}
}
}
}
function collectDynamicImportOrRequireCalls(file) {
var r = /import|require/g;
while (r.exec(file.text) !== null) { // eslint-disable-line no-null/no-null
var node = getNodeAtPosition(file, r.lastIndex);
if (isJavaScriptFile && ts.isRequireCall(node, /*checkArgumentIsStringLiteralLike*/ true)) {
imports = ts.append(imports, node.arguments[0]);
}
// we have to check the argument list has length of 1. We will still have to process these even though we have parsing error.
else if (ts.isImportCall(node) && node.arguments.length === 1 && ts.isStringLiteralLike(node.arguments[0])) {
imports = ts.append(imports, node.arguments[0]);
}
else if (ts.isLiteralImportTypeNode(node)) {
imports = ts.append(imports, node.argument.literal);
}
}
}
/** Returns a token if position is in [start-of-leading-trivia, end), includes JSDoc only in JS files */
function getNodeAtPosition(sourceFile, position) {
var current = sourceFile;
var getContainingChild = function (child) {
if (child.pos <= position && (position < child.end || (position === child.end && (child.kind === 1 /* EndOfFileToken */)))) {
return child;
}
};
while (true) {
var child = isJavaScriptFile && ts.hasJSDocNodes(current) && ts.forEach(current.jsDoc, getContainingChild) || ts.forEachChild(current, getContainingChild);
if (!child) {
return current;
}
current = child;
}
}
}
function getLibFileFromReference(ref) {
var libName = ts.toFileNameLowerCase(ref.fileName);
var libFileName = ts.libMap.get(libName);
if (libFileName) {
return getSourceFile(ts.combinePaths(defaultLibraryPath, libFileName));
}
}
/** This should have similar behavior to 'processSourceFile' without diagnostics or mutation. */
function getSourceFileFromReference(referencingFile, ref) {
return getSourceFileFromReferenceWorker(resolveTripleslashReference(ref.fileName, referencingFile.fileName), getSourceFile);
}
function getSourceFileFromReferenceWorker(fileName, getSourceFile, fail, reason) {
if (ts.hasExtension(fileName)) {
var canonicalFileName_1 = host.getCanonicalFileName(fileName);
if (!options.allowNonTsExtensions && !ts.forEach(supportedExtensionsWithJsonIfResolveJsonModule, function (extension) { return ts.fileExtensionIs(canonicalFileName_1, extension); })) {
if (fail) {
if (ts.hasJSFileExtension(canonicalFileName_1)) {
fail(ts.Diagnostics.File_0_is_a_JavaScript_file_Did_you_mean_to_enable_the_allowJs_option, fileName);
}
else {
fail(ts.Diagnostics.File_0_has_an_unsupported_extension_The_only_supported_extensions_are_1, fileName, "'" + supportedExtensions.join("', '") + "'");
}
}
return undefined;
}
var sourceFile = getSourceFile(fileName);
if (fail) {
if (!sourceFile) {
var redirect = getProjectReferenceRedirect(fileName);
if (redirect) {
fail(ts.Diagnostics.Output_file_0_has_not_been_built_from_source_file_1, redirect, fileName);
}
else {
fail(ts.Diagnostics.File_0_not_found, fileName);
}
}
else if (isReferencedFile(reason) && canonicalFileName_1 === host.getCanonicalFileName(getSourceFileByPath(reason.file).fileName)) {
fail(ts.Diagnostics.A_file_cannot_have_a_reference_to_itself);
}
}
return sourceFile;
}
else {
var sourceFileNoExtension = options.allowNonTsExtensions && getSourceFile(fileName);
if (sourceFileNoExtension)
return sourceFileNoExtension;
if (fail && options.allowNonTsExtensions) {
fail(ts.Diagnostics.File_0_not_found, fileName);
return undefined;
}
var sourceFileWithAddedExtension = ts.forEach(supportedExtensions, function (extension) { return getSourceFile(fileName + extension); });
if (fail && !sourceFileWithAddedExtension)
fail(ts.Diagnostics.Could_not_resolve_the_path_0_with_the_extensions_Colon_1, fileName, "'" + supportedExtensions.join("', '") + "'");
return sourceFileWithAddedExtension;
}
}
/** This has side effects through `findSourceFile`. */
function processSourceFile(fileName, isDefaultLib, ignoreNoDefaultLib, packageId, reason) {
getSourceFileFromReferenceWorker(fileName, function (fileName) { return findSourceFile(fileName, toPath(fileName), isDefaultLib, ignoreNoDefaultLib, reason, packageId); }, // TODO: GH#18217
function (diagnostic) {
var args = [];
for (var _i = 1; _i < arguments.length; _i++) {
args[_i - 1] = arguments[_i];
}
return addFilePreprocessingFileExplainingDiagnostic(/*file*/ undefined, reason, diagnostic, args);
}, reason);
}
function processProjectReferenceFile(fileName, reason) {
return processSourceFile(fileName, /*isDefaultLib*/ false, /*ignoreNoDefaultLib*/ false, /*packageId*/ undefined, reason);
}
function reportFileNamesDifferOnlyInCasingError(fileName, existingFile, reason) {
var hasExistingReasonToReportErrorOn = !isReferencedFile(reason) && ts.some(fileReasons.get(existingFile.path), isReferencedFile);
if (hasExistingReasonToReportErrorOn) {
addFilePreprocessingFileExplainingDiagnostic(existingFile, reason, ts.Diagnostics.Already_included_file_name_0_differs_from_file_name_1_only_in_casing, [existingFile.fileName, fileName]);
}
else {
addFilePreprocessingFileExplainingDiagnostic(existingFile, reason, ts.Diagnostics.File_name_0_differs_from_already_included_file_name_1_only_in_casing, [fileName, existingFile.fileName]);
}
}
function createRedirectSourceFile(redirectTarget, unredirected, fileName, path, resolvedPath, originalFileName) {
var redirect = Object.create(redirectTarget);
redirect.fileName = fileName;
redirect.path = path;
redirect.resolvedPath = resolvedPath;
redirect.originalFileName = originalFileName;
redirect.redirectInfo = { redirectTarget: redirectTarget, unredirected: unredirected };
sourceFilesFoundSearchingNodeModules.set(path, currentNodeModulesDepth > 0);
Object.defineProperties(redirect, {
id: {
get: function () { return this.redirectInfo.redirectTarget.id; },
set: function (value) { this.redirectInfo.redirectTarget.id = value; },
},
symbol: {
get: function () { return this.redirectInfo.redirectTarget.symbol; },
set: function (value) { this.redirectInfo.redirectTarget.symbol = value; },
},
});
return redirect;
}
// Get source file from normalized fileName
function findSourceFile(fileName, path, isDefaultLib, ignoreNoDefaultLib, reason, packageId) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("program" /* Program */, "findSourceFile", {
fileName: fileName,
isDefaultLib: isDefaultLib || undefined,
fileIncludeKind: ts.FileIncludeKind[reason.kind],
});
var result = findSourceFileWorker(fileName, path, isDefaultLib, ignoreNoDefaultLib, reason, packageId);
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
return result;
}
function findSourceFileWorker(fileName, path, isDefaultLib, ignoreNoDefaultLib, reason, packageId) {
if (useSourceOfProjectReferenceRedirect) {
var source = getSourceOfProjectReferenceRedirect(fileName);
// If preserveSymlinks is true, module resolution wont jump the symlink
// but the resolved real path may be the .d.ts from project reference
// Note:: Currently we try the real path only if the
// file is from node_modules to avoid having to run real path on all file paths
if (!source &&
host.realpath &&
options.preserveSymlinks &&
ts.isDeclarationFileName(fileName) &&
ts.stringContains(fileName, ts.nodeModulesPathPart)) {
var realPath = host.realpath(fileName);
if (realPath !== fileName)
source = getSourceOfProjectReferenceRedirect(realPath);
}
if (source) {
var file_1 = ts.isString(source) ?
findSourceFile(source, toPath(source), isDefaultLib, ignoreNoDefaultLib, reason, packageId) :
undefined;
if (file_1)
addFileToFilesByName(file_1, path, /*redirectedPath*/ undefined);
return file_1;
}
}
var originalFileName = fileName;
if (filesByName.has(path)) {
var file_2 = filesByName.get(path);
addFileIncludeReason(file_2 || undefined, reason);
// try to check if we've already seen this file but with a different casing in path
// NOTE: this only makes sense for case-insensitive file systems, and only on files which are not redirected
if (file_2 && options.forceConsistentCasingInFileNames) {
var checkedName = file_2.fileName;
var isRedirect = toPath(checkedName) !== toPath(fileName);
if (isRedirect) {
fileName = getProjectReferenceRedirect(fileName) || fileName;
}
// Check if it differs only in drive letters its ok to ignore that error:
var checkedAbsolutePath = ts.getNormalizedAbsolutePathWithoutRoot(checkedName, currentDirectory);
var inputAbsolutePath = ts.getNormalizedAbsolutePathWithoutRoot(fileName, currentDirectory);
if (checkedAbsolutePath !== inputAbsolutePath) {
reportFileNamesDifferOnlyInCasingError(fileName, file_2, reason);
}
}
// If the file was previously found via a node_modules search, but is now being processed as a root file,
// then everything it sucks in may also be marked incorrectly, and needs to be checked again.
if (file_2 && sourceFilesFoundSearchingNodeModules.get(file_2.path) && currentNodeModulesDepth === 0) {
sourceFilesFoundSearchingNodeModules.set(file_2.path, false);
if (!options.noResolve) {
processReferencedFiles(file_2, isDefaultLib);
processTypeReferenceDirectives(file_2);
}
if (!options.noLib) {
processLibReferenceDirectives(file_2);
}
modulesWithElidedImports.set(file_2.path, false);
processImportedModules(file_2);
}
// See if we need to reprocess the imports due to prior skipped imports
else if (file_2 && modulesWithElidedImports.get(file_2.path)) {
if (currentNodeModulesDepth < maxNodeModuleJsDepth) {
modulesWithElidedImports.set(file_2.path, false);
processImportedModules(file_2);
}
}
return file_2 || undefined;
}
var redirectedPath;
if (isReferencedFile(reason) && !useSourceOfProjectReferenceRedirect) {
var redirectProject = getProjectReferenceRedirectProject(fileName);
if (redirectProject) {
if (ts.outFile(redirectProject.commandLine.options)) {
// Shouldnt create many to 1 mapping file in --out scenario
return undefined;
}
var redirect = getProjectReferenceOutputName(redirectProject, fileName);
fileName = redirect;
// Once we start redirecting to a file, we can potentially come back to it
// via a back-reference from another file in the .d.ts folder. If that happens we'll
// end up trying to add it to the program *again* because we were tracking it via its
// original (un-redirected) name. So we have to map both the original path and the redirected path
// to the source file we're about to find/create
redirectedPath = toPath(redirect);
}
}
// We haven't looked for this file, do so now and cache result
var file = host.getSourceFile(fileName, options.target, function (hostErrorMessage) { return addFilePreprocessingFileExplainingDiagnostic(/*file*/ undefined, reason, ts.Diagnostics.Cannot_read_file_0_Colon_1, [fileName, hostErrorMessage]); }, shouldCreateNewSourceFile);
if (packageId) {
var packageIdKey = ts.packageIdToString(packageId);
var fileFromPackageId = packageIdToSourceFile.get(packageIdKey);
if (fileFromPackageId) {
// Some other SourceFile already exists with this package name and version.
// Instead of creating a duplicate, just redirect to the existing one.
var dupFile = createRedirectSourceFile(fileFromPackageId, file, fileName, path, toPath(fileName), originalFileName); // TODO: GH#18217
redirectTargetsMap.add(fileFromPackageId.path, fileName);
addFileToFilesByName(dupFile, path, redirectedPath);
addFileIncludeReason(dupFile, reason);
sourceFileToPackageName.set(path, packageId.name);
processingOtherFiles.push(dupFile);
return dupFile;
}
else if (file) {
// This is the first source file to have this packageId.
packageIdToSourceFile.set(packageIdKey, file);
sourceFileToPackageName.set(path, packageId.name);
}
}
addFileToFilesByName(file, path, redirectedPath);
if (file) {
sourceFilesFoundSearchingNodeModules.set(path, currentNodeModulesDepth > 0);
file.fileName = fileName; // Ensure that source file has same name as what we were looking for
file.path = path;
file.resolvedPath = toPath(fileName);
file.originalFileName = originalFileName;
addFileIncludeReason(file, reason);
if (host.useCaseSensitiveFileNames()) {
var pathLowerCase = ts.toFileNameLowerCase(path);
// for case-sensitive file systems check if we've already seen some file with similar filename ignoring case
var existingFile = filesByNameIgnoreCase.get(pathLowerCase);
if (existingFile) {
reportFileNamesDifferOnlyInCasingError(fileName, existingFile, reason);
}
else {
filesByNameIgnoreCase.set(pathLowerCase, file);
}
}
skipDefaultLib = skipDefaultLib || (file.hasNoDefaultLib && !ignoreNoDefaultLib);
if (!options.noResolve) {
processReferencedFiles(file, isDefaultLib);
processTypeReferenceDirectives(file);
}
if (!options.noLib) {
processLibReferenceDirectives(file);
}
// always process imported modules to record module name resolutions
processImportedModules(file);
if (isDefaultLib) {
processingDefaultLibFiles.push(file);
}
else {
processingOtherFiles.push(file);
}
}
return file;
}
function addFileIncludeReason(file, reason) {
if (file)
fileReasons.add(file.path, reason);
}
function addFileToFilesByName(file, path, redirectedPath) {
if (redirectedPath) {
filesByName.set(redirectedPath, file);
filesByName.set(path, file || false);
}
else {
filesByName.set(path, file);
}
}
function getProjectReferenceRedirect(fileName) {
var referencedProject = getProjectReferenceRedirectProject(fileName);
return referencedProject && getProjectReferenceOutputName(referencedProject, fileName);
}
function getProjectReferenceRedirectProject(fileName) {
// Ignore dts or any json files
if (!resolvedProjectReferences || !resolvedProjectReferences.length || ts.fileExtensionIs(fileName, ".d.ts" /* Dts */) || ts.fileExtensionIs(fileName, ".json" /* Json */)) {
return undefined;
}
// If this file is produced by a referenced project, we need to rewrite it to
// look in the output folder of the referenced project rather than the input
return getResolvedProjectReferenceToRedirect(fileName);
}
function getProjectReferenceOutputName(referencedProject, fileName) {
var out = ts.outFile(referencedProject.commandLine.options);
return out ?
ts.changeExtension(out, ".d.ts" /* Dts */) :
ts.getOutputDeclarationFileName(fileName, referencedProject.commandLine, !host.useCaseSensitiveFileNames());
}
/**
* Get the referenced project if the file is input file from that reference project
*/
function getResolvedProjectReferenceToRedirect(fileName) {
if (mapFromFileToProjectReferenceRedirects === undefined) {
mapFromFileToProjectReferenceRedirects = new ts.Map();
forEachResolvedProjectReference(function (referencedProject) {
// not input file from the referenced project, ignore
if (toPath(options.configFilePath) !== referencedProject.sourceFile.path) {
referencedProject.commandLine.fileNames.forEach(function (f) {
return mapFromFileToProjectReferenceRedirects.set(toPath(f), referencedProject.sourceFile.path);
});
}
});
}
var referencedProjectPath = mapFromFileToProjectReferenceRedirects.get(toPath(fileName));
return referencedProjectPath && getResolvedProjectReferenceByPath(referencedProjectPath);
}
function forEachResolvedProjectReference(cb) {
return ts.forEachResolvedProjectReference(resolvedProjectReferences, cb);
}
function getSourceOfProjectReferenceRedirect(file) {
if (!ts.isDeclarationFileName(file))
return undefined;
if (mapFromToProjectReferenceRedirectSource === undefined) {
mapFromToProjectReferenceRedirectSource = new ts.Map();
forEachResolvedProjectReference(function (resolvedRef) {
var out = ts.outFile(resolvedRef.commandLine.options);
if (out) {
// Dont know which source file it means so return true?
var outputDts = ts.changeExtension(out, ".d.ts" /* Dts */);
mapFromToProjectReferenceRedirectSource.set(toPath(outputDts), true);
}
else {
var getCommonSourceDirectory_3 = ts.memoize(function () { return ts.getCommonSourceDirectoryOfConfig(resolvedRef.commandLine, !host.useCaseSensitiveFileNames()); });
ts.forEach(resolvedRef.commandLine.fileNames, function (fileName) {
if (!ts.fileExtensionIs(fileName, ".d.ts" /* Dts */) && !ts.fileExtensionIs(fileName, ".json" /* Json */)) {
var outputDts = ts.getOutputDeclarationFileName(fileName, resolvedRef.commandLine, !host.useCaseSensitiveFileNames(), getCommonSourceDirectory_3);
mapFromToProjectReferenceRedirectSource.set(toPath(outputDts), fileName);
}
});
}
});
}
return mapFromToProjectReferenceRedirectSource.get(toPath(file));
}
function isSourceOfProjectReferenceRedirect(fileName) {
return useSourceOfProjectReferenceRedirect && !!getResolvedProjectReferenceToRedirect(fileName);
}
function getResolvedProjectReferenceByPath(projectReferencePath) {
if (!projectReferenceRedirects) {
return undefined;
}
return projectReferenceRedirects.get(projectReferencePath) || undefined;
}
function processReferencedFiles(file, isDefaultLib) {
ts.forEach(file.referencedFiles, function (ref, index) {
processSourceFile(resolveTripleslashReference(ref.fileName, file.fileName), isDefaultLib,
/*ignoreNoDefaultLib*/ false,
/*packageId*/ undefined, { kind: ts.FileIncludeKind.ReferenceFile, file: file.path, index: index, });
});
}
function processTypeReferenceDirectives(file) {
// We lower-case all type references because npm automatically lowercases all packages. See GH#9824.
var typeDirectives = ts.map(file.typeReferenceDirectives, function (ref) { return ts.toFileNameLowerCase(ref.fileName); });
if (!typeDirectives) {
return;
}
var resolutions = resolveTypeReferenceDirectiveNamesWorker(typeDirectives, file);
for (var index = 0; index < typeDirectives.length; index++) {
var ref = file.typeReferenceDirectives[index];
var resolvedTypeReferenceDirective = resolutions[index];
// store resolved type directive on the file
var fileName = ts.toFileNameLowerCase(ref.fileName);
ts.setResolvedTypeReferenceDirective(file, fileName, resolvedTypeReferenceDirective);
processTypeReferenceDirective(fileName, resolvedTypeReferenceDirective, { kind: ts.FileIncludeKind.TypeReferenceDirective, file: file.path, index: index, });
}
}
function processTypeReferenceDirective(typeReferenceDirective, resolvedTypeReferenceDirective, reason) {
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.push("program" /* Program */, "processTypeReferenceDirective", { directive: typeReferenceDirective, hasResolved: !!resolveModuleNamesReusingOldState, refKind: reason.kind, refPath: isReferencedFile(reason) ? reason.file : undefined });
processTypeReferenceDirectiveWorker(typeReferenceDirective, resolvedTypeReferenceDirective, reason);
ts.tracing === null || ts.tracing === void 0 ? void 0 : ts.tracing.pop();
}
function processTypeReferenceDirectiveWorker(typeReferenceDirective, resolvedTypeReferenceDirective, reason) {
// If we already found this library as a primary reference - nothing to do
var previousResolution = resolvedTypeReferenceDirectives.get(typeReferenceDirective);
if (previousResolution && previousResolution.primary) {
return;
}
var saveResolution = true;
if (resolvedTypeReferenceDirective) {
if (resolvedTypeReferenceDirective.isExternalLibraryImport)
currentNodeModulesDepth++;
if (resolvedTypeReferenceDirective.primary) {
// resolved from the primary path
processSourceFile(resolvedTypeReferenceDirective.resolvedFileName, /*isDefaultLib*/ false, /*ignoreNoDefaultLib*/ false, resolvedTypeReferenceDirective.packageId, reason); // TODO: GH#18217
}
else {
// If we already resolved to this file, it must have been a secondary reference. Check file contents
// for sameness and possibly issue an error
if (previousResolution) {
// Don't bother reading the file again if it's the same file.
if (resolvedTypeReferenceDirective.resolvedFileName !== previousResolution.resolvedFileName) {
var otherFileText = host.readFile(resolvedTypeReferenceDirective.resolvedFileName);
var existingFile = getSourceFile(previousResolution.resolvedFileName);
if (otherFileText !== existingFile.text) {
addFilePreprocessingFileExplainingDiagnostic(existingFile, reason, ts.Diagnostics.Conflicting_definitions_for_0_found_at_1_and_2_Consider_installing_a_specific_version_of_this_library_to_resolve_the_conflict, [typeReferenceDirective, resolvedTypeReferenceDirective.resolvedFileName, previousResolution.resolvedFileName]);
}
}
// don't overwrite previous resolution result
saveResolution = false;
}
else {
// First resolution of this library
processSourceFile(resolvedTypeReferenceDirective.resolvedFileName, /*isDefaultLib*/ false, /*ignoreNoDefaultLib*/ false, resolvedTypeReferenceDirective.packageId, reason);
}
}
if (resolvedTypeReferenceDirective.isExternalLibraryImport)
currentNodeModulesDepth--;
}
else {
addFilePreprocessingFileExplainingDiagnostic(/*file*/ undefined, reason, ts.Diagnostics.Cannot_find_type_definition_file_for_0, [typeReferenceDirective]);
}
if (saveResolution) {
resolvedTypeReferenceDirectives.set(typeReferenceDirective, resolvedTypeReferenceDirective);
}
}
function processLibReferenceDirectives(file) {
ts.forEach(file.libReferenceDirectives, function (libReference, index) {
var libName = ts.toFileNameLowerCase(libReference.fileName);
var libFileName = ts.libMap.get(libName);
if (libFileName) {
// we ignore any 'no-default-lib' reference set on this file.
processRootFile(ts.combinePaths(defaultLibraryPath, libFileName), /*isDefaultLib*/ true, /*ignoreNoDefaultLib*/ true, { kind: ts.FileIncludeKind.LibReferenceDirective, file: file.path, index: index, });
}
else {
var unqualifiedLibName = ts.removeSuffix(ts.removePrefix(libName, "lib."), ".d.ts");
var suggestion = ts.getSpellingSuggestion(unqualifiedLibName, ts.libs, ts.identity);
var diagnostic = suggestion ? ts.Diagnostics.Cannot_find_lib_definition_for_0_Did_you_mean_1 : ts.Diagnostics.Cannot_find_lib_definition_for_0;
(fileProcessingDiagnostics || (fileProcessingDiagnostics = [])).push({
kind: 0 /* FilePreprocessingReferencedDiagnostic */,
reason: { kind: ts.FileIncludeKind.LibReferenceDirective, file: file.path, index: index, },
diagnostic: diagnostic,
args: [libName, suggestion]
});
}
});
}
function getCanonicalFileName(fileName) {
return host.getCanonicalFileName(fileName);
}
function processImportedModules(file) {
var _a;
collectExternalModuleReferences(file);
if (file.imports.length || file.moduleAugmentations.length) {
// Because global augmentation doesn't have string literal name, we can check for global augmentation as such.
var moduleNames = getModuleNames(file);
var resolutions = resolveModuleNamesReusingOldState(moduleNames, file);
ts.Debug.assert(resolutions.length === moduleNames.length);
var optionsForFile = (useSourceOfProjectReferenceRedirect ? (_a = getRedirectReferenceForResolution(file)) === null || _a === void 0 ? void 0 : _a.commandLine.options : undefined) || options;
for (var index = 0; index < moduleNames.length; index++) {
var resolution = resolutions[index];
ts.setResolvedModule(file, moduleNames[index], resolution);
if (!resolution) {
continue;
}
var isFromNodeModulesSearch = resolution.isExternalLibraryImport;
var isJsFile = !ts.resolutionExtensionIsTSOrJson(resolution.extension);
var isJsFileFromNodeModules = isFromNodeModulesSearch && isJsFile;
var resolvedFileName = resolution.resolvedFileName;
if (isFromNodeModulesSearch) {
currentNodeModulesDepth++;
}
// add file to program only if:
// - resolution was successful
// - noResolve is falsy
// - module name comes from the list of imports
// - it's not a top level JavaScript module that exceeded the search max
var elideImport = isJsFileFromNodeModules && currentNodeModulesDepth > maxNodeModuleJsDepth;
// Don't add the file if it has a bad extension (e.g. 'tsx' if we don't have '--allowJs')
// This may still end up being an untyped module -- the file won't be included but imports will be allowed.
var shouldAddFile = resolvedFileName
&& !getResolutionDiagnostic(optionsForFile, resolution)
&& !optionsForFile.noResolve
&& index < file.imports.length
&& !elideImport
&& !(isJsFile && !ts.getAllowJSCompilerOption(optionsForFile))
&& (ts.isInJSFile(file.imports[index]) || !(file.imports[index].flags & 4194304 /* JSDoc */));
if (elideImport) {
modulesWithElidedImports.set(file.path, true);
}
else if (shouldAddFile) {
var path = toPath(resolvedFileName);
findSourceFile(resolvedFileName, path,
/*isDefaultLib*/ false,
/*ignoreNoDefaultLib*/ false, { kind: ts.FileIncludeKind.Import, file: file.path, index: index, }, resolution.packageId);
}
if (isFromNodeModulesSearch) {
currentNodeModulesDepth--;
}
}
}
else {
// no imports - drop cached module resolutions
file.resolvedModules = undefined;
}
}
function checkSourceFilesBelongToPath(sourceFiles, rootDirectory) {
var allFilesBelongToPath = true;
var absoluteRootDirectoryPath = host.getCanonicalFileName(ts.getNormalizedAbsolutePath(rootDirectory, currentDirectory));
for (var _i = 0, sourceFiles_2 = sourceFiles; _i < sourceFiles_2.length; _i++) {
var sourceFile = sourceFiles_2[_i];
if (!sourceFile.isDeclarationFile) {
var absoluteSourceFilePath = host.getCanonicalFileName(ts.getNormalizedAbsolutePath(sourceFile.fileName, currentDirectory));
if (absoluteSourceFilePath.indexOf(absoluteRootDirectoryPath) !== 0) {
addProgramDiagnosticExplainingFile(sourceFile, ts.Diagnostics.File_0_is_not_under_rootDir_1_rootDir_is_expected_to_contain_all_source_files, [sourceFile.fileName, rootDirectory]);
allFilesBelongToPath = false;
}
}
}
return allFilesBelongToPath;
}
function parseProjectReferenceConfigFile(ref) {
if (!projectReferenceRedirects) {
projectReferenceRedirects = new ts.Map();
}
// The actual filename (i.e. add "/tsconfig.json" if necessary)
var refPath = resolveProjectReferencePath(ref);
var sourceFilePath = toPath(refPath);
var fromCache = projectReferenceRedirects.get(sourceFilePath);
if (fromCache !== undefined) {
return fromCache || undefined;
}
var commandLine;
var sourceFile;
if (host.getParsedCommandLine) {
commandLine = host.getParsedCommandLine(refPath);
if (!commandLine) {
addFileToFilesByName(/*sourceFile*/ undefined, sourceFilePath, /*redirectedPath*/ undefined);
projectReferenceRedirects.set(sourceFilePath, false);
return undefined;
}
sourceFile = ts.Debug.checkDefined(commandLine.options.configFile);
ts.Debug.assert(!sourceFile.path || sourceFile.path === sourceFilePath);
addFileToFilesByName(sourceFile, sourceFilePath, /*redirectedPath*/ undefined);
}
else {
// An absolute path pointing to the containing directory of the config file
var basePath = ts.getNormalizedAbsolutePath(ts.getDirectoryPath(refPath), host.getCurrentDirectory());
sourceFile = host.getSourceFile(refPath, 100 /* JSON */);
addFileToFilesByName(sourceFile, sourceFilePath, /*redirectedPath*/ undefined);
if (sourceFile === undefined) {
projectReferenceRedirects.set(sourceFilePath, false);
return undefined;
}
commandLine = ts.parseJsonSourceFileConfigFileContent(sourceFile, configParsingHost, basePath, /*existingOptions*/ undefined, refPath);
}
sourceFile.fileName = refPath;
sourceFile.path = sourceFilePath;
sourceFile.resolvedPath = sourceFilePath;
sourceFile.originalFileName = refPath;
var resolvedRef = { commandLine: commandLine, sourceFile: sourceFile };
projectReferenceRedirects.set(sourceFilePath, resolvedRef);
if (commandLine.projectReferences) {
resolvedRef.references = commandLine.projectReferences.map(parseProjectReferenceConfigFile);
}
return resolvedRef;
}
function verifyCompilerOptions() {
if (options.strictPropertyInitialization && !ts.getStrictOptionValue(options, "strictNullChecks")) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_without_specifying_option_1, "strictPropertyInitialization", "strictNullChecks");
}
if (options.exactOptionalPropertyTypes && !ts.getStrictOptionValue(options, "strictNullChecks")) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_without_specifying_option_1, "exactOptionalPropertyTypes", "strictNullChecks");
}
if (options.isolatedModules) {
if (options.out) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_with_option_1, "out", "isolatedModules");
}
if (options.outFile) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_with_option_1, "outFile", "isolatedModules");
}
}
if (options.inlineSourceMap) {
if (options.sourceMap) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_with_option_1, "sourceMap", "inlineSourceMap");
}
if (options.mapRoot) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_with_option_1, "mapRoot", "inlineSourceMap");
}
}
if (options.composite) {
if (options.declaration === false) {
createDiagnosticForOptionName(ts.Diagnostics.Composite_projects_may_not_disable_declaration_emit, "declaration");
}
if (options.incremental === false) {
createDiagnosticForOptionName(ts.Diagnostics.Composite_projects_may_not_disable_incremental_compilation, "declaration");
}
}
var outputFile = ts.outFile(options);
if (options.tsBuildInfoFile) {
if (!ts.isIncrementalCompilation(options)) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_without_specifying_option_1_or_option_2, "tsBuildInfoFile", "incremental", "composite");
}
}
else if (options.incremental && !outputFile && !options.configFilePath) {
programDiagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_incremental_can_only_be_specified_using_tsconfig_emitting_to_single_file_or_when_option_tsBuildInfoFile_is_specified));
}
verifyProjectReferences();
// List of collected files is complete; validate exhautiveness if this is a project with a file list
if (options.composite) {
var rootPaths = new ts.Set(rootNames.map(toPath));
for (var _i = 0, files_4 = files; _i < files_4.length; _i++) {
var file = files_4[_i];
// Ignore file that is not emitted
if (ts.sourceFileMayBeEmitted(file, program) && !rootPaths.has(file.path)) {
addProgramDiagnosticExplainingFile(file, ts.Diagnostics.File_0_is_not_listed_within_the_file_list_of_project_1_Projects_must_list_all_files_or_use_an_include_pattern, [file.fileName, options.configFilePath || ""]);
}
}
}
if (options.paths) {
for (var key in options.paths) {
if (!ts.hasProperty(options.paths, key)) {
continue;
}
if (!ts.hasZeroOrOneAsteriskCharacter(key)) {
createDiagnosticForOptionPaths(/*onKey*/ true, key, ts.Diagnostics.Pattern_0_can_have_at_most_one_Asterisk_character, key);
}
if (ts.isArray(options.paths[key])) {
var len = options.paths[key].length;
if (len === 0) {
createDiagnosticForOptionPaths(/*onKey*/ false, key, ts.Diagnostics.Substitutions_for_pattern_0_shouldn_t_be_an_empty_array, key);
}
for (var i = 0; i < len; i++) {
var subst = options.paths[key][i];
var typeOfSubst = typeof subst;
if (typeOfSubst === "string") {
if (!ts.hasZeroOrOneAsteriskCharacter(subst)) {
createDiagnosticForOptionPathKeyValue(key, i, ts.Diagnostics.Substitution_0_in_pattern_1_can_have_at_most_one_Asterisk_character, subst, key);
}
if (!options.baseUrl && !ts.pathIsRelative(subst) && !ts.pathIsAbsolute(subst)) {
createDiagnosticForOptionPathKeyValue(key, i, ts.Diagnostics.Non_relative_paths_are_not_allowed_when_baseUrl_is_not_set_Did_you_forget_a_leading_Slash);
}
}
else {
createDiagnosticForOptionPathKeyValue(key, i, ts.Diagnostics.Substitution_0_for_pattern_1_has_incorrect_type_expected_string_got_2, subst, key, typeOfSubst);
}
}
}
else {
createDiagnosticForOptionPaths(/*onKey*/ false, key, ts.Diagnostics.Substitutions_for_pattern_0_should_be_an_array, key);
}
}
}
if (!options.sourceMap && !options.inlineSourceMap) {
if (options.inlineSources) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_can_only_be_used_when_either_option_inlineSourceMap_or_option_sourceMap_is_provided, "inlineSources");
}
if (options.sourceRoot) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_can_only_be_used_when_either_option_inlineSourceMap_or_option_sourceMap_is_provided, "sourceRoot");
}
}
if (options.out && options.outFile) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_with_option_1, "out", "outFile");
}
if (options.mapRoot && !(options.sourceMap || options.declarationMap)) {
// Error to specify --mapRoot without --sourcemap
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_without_specifying_option_1_or_option_2, "mapRoot", "sourceMap", "declarationMap");
}
if (options.declarationDir) {
if (!ts.getEmitDeclarations(options)) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_without_specifying_option_1_or_option_2, "declarationDir", "declaration", "composite");
}
if (outputFile) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_with_option_1, "declarationDir", options.out ? "out" : "outFile");
}
}
if (options.declarationMap && !ts.getEmitDeclarations(options)) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_without_specifying_option_1_or_option_2, "declarationMap", "declaration", "composite");
}
if (options.lib && options.noLib) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_with_option_1, "lib", "noLib");
}
if (options.noImplicitUseStrict && ts.getStrictOptionValue(options, "alwaysStrict")) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_with_option_1, "noImplicitUseStrict", "alwaysStrict");
}
var languageVersion = options.target || 0 /* ES3 */;
var firstNonAmbientExternalModuleSourceFile = ts.find(files, function (f) { return ts.isExternalModule(f) && !f.isDeclarationFile; });
if (options.isolatedModules) {
if (options.module === ts.ModuleKind.None && languageVersion < 2 /* ES2015 */) {
createDiagnosticForOptionName(ts.Diagnostics.Option_isolatedModules_can_only_be_used_when_either_option_module_is_provided_or_option_target_is_ES2015_or_higher, "isolatedModules", "target");
}
if (options.preserveConstEnums === false) {
createDiagnosticForOptionName(ts.Diagnostics.Option_preserveConstEnums_cannot_be_disabled_when_isolatedModules_is_enabled, "preserveConstEnums", "isolatedModules");
}
var firstNonExternalModuleSourceFile = ts.find(files, function (f) { return !ts.isExternalModule(f) && !ts.isSourceFileJS(f) && !f.isDeclarationFile && f.scriptKind !== 6 /* JSON */; });
if (firstNonExternalModuleSourceFile) {
var span = ts.getErrorSpanForNode(firstNonExternalModuleSourceFile, firstNonExternalModuleSourceFile);
programDiagnostics.add(ts.createFileDiagnostic(firstNonExternalModuleSourceFile, span.start, span.length, ts.Diagnostics._0_cannot_be_compiled_under_isolatedModules_because_it_is_considered_a_global_script_file_Add_an_import_export_or_an_empty_export_statement_to_make_it_a_module, ts.getBaseFileName(firstNonExternalModuleSourceFile.fileName)));
}
}
else if (firstNonAmbientExternalModuleSourceFile && languageVersion < 2 /* ES2015 */ && options.module === ts.ModuleKind.None) {
// We cannot use createDiagnosticFromNode because nodes do not have parents yet
var span = ts.getErrorSpanForNode(firstNonAmbientExternalModuleSourceFile, firstNonAmbientExternalModuleSourceFile.externalModuleIndicator);
programDiagnostics.add(ts.createFileDiagnostic(firstNonAmbientExternalModuleSourceFile, span.start, span.length, ts.Diagnostics.Cannot_use_imports_exports_or_module_augmentations_when_module_is_none));
}
// Cannot specify module gen that isn't amd or system with --out
if (outputFile && !options.emitDeclarationOnly) {
if (options.module && !(options.module === ts.ModuleKind.AMD || options.module === ts.ModuleKind.System)) {
createDiagnosticForOptionName(ts.Diagnostics.Only_amd_and_system_modules_are_supported_alongside_0, options.out ? "out" : "outFile", "module");
}
else if (options.module === undefined && firstNonAmbientExternalModuleSourceFile) {
var span = ts.getErrorSpanForNode(firstNonAmbientExternalModuleSourceFile, firstNonAmbientExternalModuleSourceFile.externalModuleIndicator);
programDiagnostics.add(ts.createFileDiagnostic(firstNonAmbientExternalModuleSourceFile, span.start, span.length, ts.Diagnostics.Cannot_compile_modules_using_option_0_unless_the_module_flag_is_amd_or_system, options.out ? "out" : "outFile"));
}
}
if (options.resolveJsonModule) {
if (ts.getEmitModuleResolutionKind(options) !== ts.ModuleResolutionKind.NodeJs) {
createDiagnosticForOptionName(ts.Diagnostics.Option_resolveJsonModule_cannot_be_specified_without_node_module_resolution_strategy, "resolveJsonModule");
}
// Any emit other than common js, amd, es2015 or esnext is error
else if (!ts.hasJsonModuleEmitEnabled(options)) {
createDiagnosticForOptionName(ts.Diagnostics.Option_resolveJsonModule_can_only_be_specified_when_module_code_generation_is_commonjs_amd_es2015_or_esNext, "resolveJsonModule", "module");
}
}
// there has to be common source directory if user specified --outdir || --rootDir || --sourceRoot
// if user specified --mapRoot, there needs to be common source directory if there would be multiple files being emitted
if (options.outDir || // there is --outDir specified
options.rootDir || // there is --rootDir specified
options.sourceRoot || // there is --sourceRoot specified
options.mapRoot) { // there is --mapRoot specified
// Precalculate and cache the common source directory
var dir = getCommonSourceDirectory();
// If we failed to find a good common directory, but outDir is specified and at least one of our files is on a windows drive/URL/other resource, add a failure
if (options.outDir && dir === "" && files.some(function (file) { return ts.getRootLength(file.fileName) > 1; })) {
createDiagnosticForOptionName(ts.Diagnostics.Cannot_find_the_common_subdirectory_path_for_the_input_files, "outDir");
}
}
if (options.useDefineForClassFields && languageVersion === 0 /* ES3 */) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_when_option_target_is_ES3, "useDefineForClassFields");
}
if (options.checkJs && !ts.getAllowJSCompilerOption(options)) {
programDiagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_0_cannot_be_specified_without_specifying_option_1, "checkJs", "allowJs"));
}
if (options.emitDeclarationOnly) {
if (!ts.getEmitDeclarations(options)) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_without_specifying_option_1_or_option_2, "emitDeclarationOnly", "declaration", "composite");
}
if (options.noEmit) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_with_option_1, "emitDeclarationOnly", "noEmit");
}
}
if (options.emitDecoratorMetadata &&
!options.experimentalDecorators) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_without_specifying_option_1, "emitDecoratorMetadata", "experimentalDecorators");
}
if (options.jsxFactory) {
if (options.reactNamespace) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_with_option_1, "reactNamespace", "jsxFactory");
}
if (options.jsx === 4 /* ReactJSX */ || options.jsx === 5 /* ReactJSXDev */) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_when_option_jsx_is_1, "jsxFactory", ts.inverseJsxOptionMap.get("" + options.jsx));
}
if (!ts.parseIsolatedEntityName(options.jsxFactory, languageVersion)) {
createOptionValueDiagnostic("jsxFactory", ts.Diagnostics.Invalid_value_for_jsxFactory_0_is_not_a_valid_identifier_or_qualified_name, options.jsxFactory);
}
}
else if (options.reactNamespace && !ts.isIdentifierText(options.reactNamespace, languageVersion)) {
createOptionValueDiagnostic("reactNamespace", ts.Diagnostics.Invalid_value_for_reactNamespace_0_is_not_a_valid_identifier, options.reactNamespace);
}
if (options.jsxFragmentFactory) {
if (!options.jsxFactory) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_without_specifying_option_1, "jsxFragmentFactory", "jsxFactory");
}
if (options.jsx === 4 /* ReactJSX */ || options.jsx === 5 /* ReactJSXDev */) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_when_option_jsx_is_1, "jsxFragmentFactory", ts.inverseJsxOptionMap.get("" + options.jsx));
}
if (!ts.parseIsolatedEntityName(options.jsxFragmentFactory, languageVersion)) {
createOptionValueDiagnostic("jsxFragmentFactory", ts.Diagnostics.Invalid_value_for_jsxFragmentFactory_0_is_not_a_valid_identifier_or_qualified_name, options.jsxFragmentFactory);
}
}
if (options.reactNamespace) {
if (options.jsx === 4 /* ReactJSX */ || options.jsx === 5 /* ReactJSXDev */) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_when_option_jsx_is_1, "reactNamespace", ts.inverseJsxOptionMap.get("" + options.jsx));
}
}
if (options.jsxImportSource) {
if (options.jsx === 2 /* React */) {
createDiagnosticForOptionName(ts.Diagnostics.Option_0_cannot_be_specified_when_option_jsx_is_1, "jsxImportSource", ts.inverseJsxOptionMap.get("" + options.jsx));
}
}
// If the emit is enabled make sure that every output file is unique and not overwriting any of the input files
if (!options.noEmit && !options.suppressOutputPathCheck) {
var emitHost = getEmitHost();
var emitFilesSeen_1 = new ts.Set();
ts.forEachEmittedFile(emitHost, function (emitFileNames) {
if (!options.emitDeclarationOnly) {
verifyEmitFilePath(emitFileNames.jsFilePath, emitFilesSeen_1);
}
verifyEmitFilePath(emitFileNames.declarationFilePath, emitFilesSeen_1);
});
}
// Verify that all the emit files are unique and don't overwrite input files
function verifyEmitFilePath(emitFileName, emitFilesSeen) {
if (emitFileName) {
var emitFilePath = toPath(emitFileName);
// Report error if the output overwrites input file
if (filesByName.has(emitFilePath)) {
var chain = void 0;
if (!options.configFilePath) {
// The program is from either an inferred project or an external project
chain = ts.chainDiagnosticMessages(/*details*/ undefined, ts.Diagnostics.Adding_a_tsconfig_json_file_will_help_organize_projects_that_contain_both_TypeScript_and_JavaScript_files_Learn_more_at_https_Colon_Slash_Slashaka_ms_Slashtsconfig);
}
chain = ts.chainDiagnosticMessages(chain, ts.Diagnostics.Cannot_write_file_0_because_it_would_overwrite_input_file, emitFileName);
blockEmittingOfFile(emitFileName, ts.createCompilerDiagnosticFromMessageChain(chain));
}
var emitFileKey = !host.useCaseSensitiveFileNames() ? ts.toFileNameLowerCase(emitFilePath) : emitFilePath;
// Report error if multiple files write into same file
if (emitFilesSeen.has(emitFileKey)) {
// Already seen the same emit file - report error
blockEmittingOfFile(emitFileName, ts.createCompilerDiagnostic(ts.Diagnostics.Cannot_write_file_0_because_it_would_be_overwritten_by_multiple_input_files, emitFileName));
}
else {
emitFilesSeen.add(emitFileKey);
}
}
}
}
function createDiagnosticExplainingFile(file, fileProcessingReason, diagnostic, args) {
var _a;
var fileIncludeReasons;
var relatedInfo;
var locationReason = isReferencedFile(fileProcessingReason) ? fileProcessingReason : undefined;
if (file)
(_a = fileReasons.get(file.path)) === null || _a === void 0 ? void 0 : _a.forEach(processReason);
if (fileProcessingReason)
processReason(fileProcessingReason);
// If we have location and there is only one reason file is in which is the location, dont add details for file include
if (locationReason && (fileIncludeReasons === null || fileIncludeReasons === void 0 ? void 0 : fileIncludeReasons.length) === 1)
fileIncludeReasons = undefined;
var location = locationReason && getReferencedFileLocation(getSourceFileByPath, locationReason);
var fileIncludeReasonDetails = fileIncludeReasons && ts.chainDiagnosticMessages(fileIncludeReasons, ts.Diagnostics.The_file_is_in_the_program_because_Colon);
var redirectInfo = file && ts.explainIfFileIsRedirect(file);
var chain = ts.chainDiagnosticMessages.apply(void 0, __spreadArray([redirectInfo ? fileIncludeReasonDetails ? __spreadArray([fileIncludeReasonDetails], redirectInfo, true) : redirectInfo : fileIncludeReasonDetails, diagnostic], args || ts.emptyArray, false));
return location && isReferenceFileLocation(location) ?
ts.createFileDiagnosticFromMessageChain(location.file, location.pos, location.end - location.pos, chain, relatedInfo) :
ts.createCompilerDiagnosticFromMessageChain(chain, relatedInfo);
function processReason(reason) {
(fileIncludeReasons || (fileIncludeReasons = [])).push(ts.fileIncludeReasonToDiagnostics(program, reason));
if (!locationReason && isReferencedFile(reason)) {
// Report error at first reference file or file currently in processing and dont report in related information
locationReason = reason;
}
else if (locationReason !== reason) {
relatedInfo = ts.append(relatedInfo, fileIncludeReasonToRelatedInformation(reason));
}
// Remove fileProcessingReason if its already included in fileReasons of the program
if (reason === fileProcessingReason)
fileProcessingReason = undefined;
}
}
function addFilePreprocessingFileExplainingDiagnostic(file, fileProcessingReason, diagnostic, args) {
(fileProcessingDiagnostics || (fileProcessingDiagnostics = [])).push({
kind: 1 /* FilePreprocessingFileExplainingDiagnostic */,
file: file && file.path,
fileProcessingReason: fileProcessingReason,
diagnostic: diagnostic,
args: args
});
}
function addProgramDiagnosticExplainingFile(file, diagnostic, args) {
programDiagnostics.add(createDiagnosticExplainingFile(file, /*fileProcessingReason*/ undefined, diagnostic, args));
}
function fileIncludeReasonToRelatedInformation(reason) {
if (isReferencedFile(reason)) {
var referenceLocation = getReferencedFileLocation(getSourceFileByPath, reason);
var message_2;
switch (reason.kind) {
case ts.FileIncludeKind.Import:
message_2 = ts.Diagnostics.File_is_included_via_import_here;
break;
case ts.FileIncludeKind.ReferenceFile:
message_2 = ts.Diagnostics.File_is_included_via_reference_here;
break;
case ts.FileIncludeKind.TypeReferenceDirective:
message_2 = ts.Diagnostics.File_is_included_via_type_library_reference_here;
break;
case ts.FileIncludeKind.LibReferenceDirective:
message_2 = ts.Diagnostics.File_is_included_via_library_reference_here;
break;
default:
ts.Debug.assertNever(reason);
}
return isReferenceFileLocation(referenceLocation) ? ts.createFileDiagnostic(referenceLocation.file, referenceLocation.pos, referenceLocation.end - referenceLocation.pos, message_2) : undefined;
}
if (!options.configFile)
return undefined;
var configFileNode;
var message;
switch (reason.kind) {
case ts.FileIncludeKind.RootFile:
if (!options.configFile.configFileSpecs)
return undefined;
var fileName = ts.getNormalizedAbsolutePath(rootNames[reason.index], currentDirectory);
var matchedByFiles = ts.getMatchedFileSpec(program, fileName);
if (matchedByFiles) {
configFileNode = ts.getTsConfigPropArrayElementValue(options.configFile, "files", matchedByFiles);
message = ts.Diagnostics.File_is_matched_by_files_list_specified_here;
break;
}
var matchedByInclude = ts.getMatchedIncludeSpec(program, fileName);
// Could be additional files specified as roots
if (!matchedByInclude)
return undefined;
configFileNode = ts.getTsConfigPropArrayElementValue(options.configFile, "include", matchedByInclude);
message = ts.Diagnostics.File_is_matched_by_include_pattern_specified_here;
break;
case ts.FileIncludeKind.SourceFromProjectReference:
case ts.FileIncludeKind.OutputFromProjectReference:
var referencedResolvedRef_1 = ts.Debug.checkDefined(resolvedProjectReferences === null || resolvedProjectReferences === void 0 ? void 0 : resolvedProjectReferences[reason.index]);
var referenceInfo = forEachProjectReference(projectReferences, resolvedProjectReferences, function (resolvedRef, parent, index) {
return resolvedRef === referencedResolvedRef_1 ? { sourceFile: (parent === null || parent === void 0 ? void 0 : parent.sourceFile) || options.configFile, index: index } : undefined;
});
if (!referenceInfo)
return undefined;
var sourceFile = referenceInfo.sourceFile, index = referenceInfo.index;
var referencesSyntax = ts.firstDefined(ts.getTsConfigPropArray(sourceFile, "references"), function (property) { return ts.isArrayLiteralExpression(property.initializer) ? property.initializer : undefined; });
return referencesSyntax && referencesSyntax.elements.length > index ?
ts.createDiagnosticForNodeInSourceFile(sourceFile, referencesSyntax.elements[index], reason.kind === ts.FileIncludeKind.OutputFromProjectReference ?
ts.Diagnostics.File_is_output_from_referenced_project_specified_here :
ts.Diagnostics.File_is_source_from_referenced_project_specified_here) :
undefined;
case ts.FileIncludeKind.AutomaticTypeDirectiveFile:
if (!options.types)
return undefined;
configFileNode = getOptionsSyntaxByArrayElementValue("types", reason.typeReference);
message = ts.Diagnostics.File_is_entry_point_of_type_library_specified_here;
break;
case ts.FileIncludeKind.LibFile:
if (reason.index !== undefined) {
configFileNode = getOptionsSyntaxByArrayElementValue("lib", options.lib[reason.index]);
message = ts.Diagnostics.File_is_library_specified_here;
break;
}
var target = ts.forEachEntry(ts.targetOptionDeclaration.type, function (value, key) { return value === options.target ? key : undefined; });
configFileNode = target ? getOptionsSyntaxByValue("target", target) : undefined;
message = ts.Diagnostics.File_is_default_library_for_target_specified_here;
break;
default:
ts.Debug.assertNever(reason);
}
return configFileNode && ts.createDiagnosticForNodeInSourceFile(options.configFile, configFileNode, message);
}
function verifyProjectReferences() {
var buildInfoPath = !options.suppressOutputPathCheck ? ts.getTsBuildInfoEmitOutputFilePath(options) : undefined;
forEachProjectReference(projectReferences, resolvedProjectReferences, function (resolvedRef, parent, index) {
var ref = (parent ? parent.commandLine.projectReferences : projectReferences)[index];
var parentFile = parent && parent.sourceFile;
if (!resolvedRef) {
createDiagnosticForReference(parentFile, index, ts.Diagnostics.File_0_not_found, ref.path);
return;
}
var options = resolvedRef.commandLine.options;
if (!options.composite || options.noEmit) {
// ok to not have composite if the current program is container only
var inputs = parent ? parent.commandLine.fileNames : rootNames;
if (inputs.length) {
if (!options.composite)
createDiagnosticForReference(parentFile, index, ts.Diagnostics.Referenced_project_0_must_have_setting_composite_Colon_true, ref.path);
if (options.noEmit)
createDiagnosticForReference(parentFile, index, ts.Diagnostics.Referenced_project_0_may_not_disable_emit, ref.path);
}
}
if (ref.prepend) {
var out = ts.outFile(options);
if (out) {
if (!host.fileExists(out)) {
createDiagnosticForReference(parentFile, index, ts.Diagnostics.Output_file_0_from_project_1_does_not_exist, out, ref.path);
}
}
else {
createDiagnosticForReference(parentFile, index, ts.Diagnostics.Cannot_prepend_project_0_because_it_does_not_have_outFile_set, ref.path);
}
}
if (!parent && buildInfoPath && buildInfoPath === ts.getTsBuildInfoEmitOutputFilePath(options)) {
createDiagnosticForReference(parentFile, index, ts.Diagnostics.Cannot_write_file_0_because_it_will_overwrite_tsbuildinfo_file_generated_by_referenced_project_1, buildInfoPath, ref.path);
hasEmitBlockingDiagnostics.set(toPath(buildInfoPath), true);
}
});
}
function createDiagnosticForOptionPathKeyValue(key, valueIndex, message, arg0, arg1, arg2) {
var needCompilerDiagnostic = true;
var pathsSyntax = getOptionPathsSyntax();
for (var _i = 0, pathsSyntax_1 = pathsSyntax; _i < pathsSyntax_1.length; _i++) {
var pathProp = pathsSyntax_1[_i];
if (ts.isObjectLiteralExpression(pathProp.initializer)) {
for (var _a = 0, _b = ts.getPropertyAssignment(pathProp.initializer, key); _a < _b.length; _a++) {
var keyProps = _b[_a];
var initializer = keyProps.initializer;
if (ts.isArrayLiteralExpression(initializer) && initializer.elements.length > valueIndex) {
programDiagnostics.add(ts.createDiagnosticForNodeInSourceFile(options.configFile, initializer.elements[valueIndex], message, arg0, arg1, arg2));
needCompilerDiagnostic = false;
}
}
}
}
if (needCompilerDiagnostic) {
programDiagnostics.add(ts.createCompilerDiagnostic(message, arg0, arg1, arg2));
}
}
function createDiagnosticForOptionPaths(onKey, key, message, arg0) {
var needCompilerDiagnostic = true;
var pathsSyntax = getOptionPathsSyntax();
for (var _i = 0, pathsSyntax_2 = pathsSyntax; _i < pathsSyntax_2.length; _i++) {
var pathProp = pathsSyntax_2[_i];
if (ts.isObjectLiteralExpression(pathProp.initializer) &&
createOptionDiagnosticInObjectLiteralSyntax(pathProp.initializer, onKey, key, /*key2*/ undefined, message, arg0)) {
needCompilerDiagnostic = false;
}
}
if (needCompilerDiagnostic) {
programDiagnostics.add(ts.createCompilerDiagnostic(message, arg0));
}
}
function getOptionsSyntaxByName(name) {
var compilerOptionsObjectLiteralSyntax = getCompilerOptionsObjectLiteralSyntax();
return compilerOptionsObjectLiteralSyntax && ts.getPropertyAssignment(compilerOptionsObjectLiteralSyntax, name);
}
function getOptionPathsSyntax() {
return getOptionsSyntaxByName("paths") || ts.emptyArray;
}
function getOptionsSyntaxByValue(name, value) {
var syntaxByName = getOptionsSyntaxByName(name);
return syntaxByName && ts.firstDefined(syntaxByName, function (property) { return ts.isStringLiteral(property.initializer) && property.initializer.text === value ? property.initializer : undefined; });
}
function getOptionsSyntaxByArrayElementValue(name, value) {
var compilerOptionsObjectLiteralSyntax = getCompilerOptionsObjectLiteralSyntax();
return compilerOptionsObjectLiteralSyntax && ts.getPropertyArrayElementValue(compilerOptionsObjectLiteralSyntax, name, value);
}
function createDiagnosticForOptionName(message, option1, option2, option3) {
createDiagnosticForOption(/*onKey*/ true, option1, option2, message, option1, option2, option3);
}
function createOptionValueDiagnostic(option1, message, arg0) {
createDiagnosticForOption(/*onKey*/ false, option1, /*option2*/ undefined, message, arg0);
}
function createDiagnosticForReference(sourceFile, index, message, arg0, arg1) {
var referencesSyntax = ts.firstDefined(ts.getTsConfigPropArray(sourceFile || options.configFile, "references"), function (property) { return ts.isArrayLiteralExpression(property.initializer) ? property.initializer : undefined; });
if (referencesSyntax && referencesSyntax.elements.length > index) {
programDiagnostics.add(ts.createDiagnosticForNodeInSourceFile(sourceFile || options.configFile, referencesSyntax.elements[index], message, arg0, arg1));
}
else {
programDiagnostics.add(ts.createCompilerDiagnostic(message, arg0, arg1));
}
}
function createDiagnosticForOption(onKey, option1, option2, message, arg0, arg1, arg2) {
var compilerOptionsObjectLiteralSyntax = getCompilerOptionsObjectLiteralSyntax();
var needCompilerDiagnostic = !compilerOptionsObjectLiteralSyntax ||
!createOptionDiagnosticInObjectLiteralSyntax(compilerOptionsObjectLiteralSyntax, onKey, option1, option2, message, arg0, arg1, arg2);
if (needCompilerDiagnostic) {
programDiagnostics.add(ts.createCompilerDiagnostic(message, arg0, arg1, arg2));
}
}
function getCompilerOptionsObjectLiteralSyntax() {
if (_compilerOptionsObjectLiteralSyntax === undefined) {
_compilerOptionsObjectLiteralSyntax = false;
var jsonObjectLiteral = ts.getTsConfigObjectLiteralExpression(options.configFile);
if (jsonObjectLiteral) {
for (var _i = 0, _a = ts.getPropertyAssignment(jsonObjectLiteral, "compilerOptions"); _i < _a.length; _i++) {
var prop = _a[_i];
if (ts.isObjectLiteralExpression(prop.initializer)) {
_compilerOptionsObjectLiteralSyntax = prop.initializer;
break;
}
}
}
}
return _compilerOptionsObjectLiteralSyntax || undefined;
}
function createOptionDiagnosticInObjectLiteralSyntax(objectLiteral, onKey, key1, key2, message, arg0, arg1, arg2) {
var props = ts.getPropertyAssignment(objectLiteral, key1, key2);
for (var _i = 0, props_3 = props; _i < props_3.length; _i++) {
var prop = props_3[_i];
programDiagnostics.add(ts.createDiagnosticForNodeInSourceFile(options.configFile, onKey ? prop.name : prop.initializer, message, arg0, arg1, arg2));
}
return !!props.length;
}
function blockEmittingOfFile(emitFileName, diag) {
hasEmitBlockingDiagnostics.set(toPath(emitFileName), true);
programDiagnostics.add(diag);
}
function isEmittedFile(file) {
if (options.noEmit) {
return false;
}
// If this is source file, its not emitted file
var filePath = toPath(file);
if (getSourceFileByPath(filePath)) {
return false;
}
// If options have --outFile or --out just check that
var out = ts.outFile(options);
if (out) {
return isSameFile(filePath, out) || isSameFile(filePath, ts.removeFileExtension(out) + ".d.ts" /* Dts */);
}
// If declarationDir is specified, return if its a file in that directory
if (options.declarationDir && ts.containsPath(options.declarationDir, filePath, currentDirectory, !host.useCaseSensitiveFileNames())) {
return true;
}
// If --outDir, check if file is in that directory
if (options.outDir) {
return ts.containsPath(options.outDir, filePath, currentDirectory, !host.useCaseSensitiveFileNames());
}
if (ts.fileExtensionIsOneOf(filePath, ts.supportedJSExtensions) || ts.fileExtensionIs(filePath, ".d.ts" /* Dts */)) {
// Otherwise just check if sourceFile with the name exists
var filePathWithoutExtension = ts.removeFileExtension(filePath);
return !!getSourceFileByPath((filePathWithoutExtension + ".ts" /* Ts */)) ||
!!getSourceFileByPath((filePathWithoutExtension + ".tsx" /* Tsx */));
}
return false;
}
function isSameFile(file1, file2) {
return ts.comparePaths(file1, file2, currentDirectory, !host.useCaseSensitiveFileNames()) === 0 /* EqualTo */;
}
function getSymlinkCache() {
if (host.getSymlinkCache) {
return host.getSymlinkCache();
}
if (!symlinks) {
symlinks = ts.createSymlinkCache(currentDirectory, getCanonicalFileName);
}
if (files && resolvedTypeReferenceDirectives && !symlinks.hasProcessedResolutions()) {
symlinks.setSymlinksFromResolutions(files, resolvedTypeReferenceDirectives);
}
return symlinks;
}
}
ts.createProgram = createProgram;
function updateHostForUseSourceOfProjectReferenceRedirect(host) {
var setOfDeclarationDirectories;
var originalFileExists = host.compilerHost.fileExists;
var originalDirectoryExists = host.compilerHost.directoryExists;
var originalGetDirectories = host.compilerHost.getDirectories;
var originalRealpath = host.compilerHost.realpath;
if (!host.useSourceOfProjectReferenceRedirect)
return { onProgramCreateComplete: ts.noop, fileExists: fileExists };
host.compilerHost.fileExists = fileExists;
var directoryExists;
if (originalDirectoryExists) {
// This implementation of directoryExists checks if the directory being requested is
// directory of .d.ts file for the referenced Project.
// If it is it returns true irrespective of whether that directory exists on host
directoryExists = host.compilerHost.directoryExists = function (path) {
if (originalDirectoryExists.call(host.compilerHost, path)) {
handleDirectoryCouldBeSymlink(path);
return true;
}
if (!host.getResolvedProjectReferences())
return false;
if (!setOfDeclarationDirectories) {
setOfDeclarationDirectories = new ts.Set();
host.forEachResolvedProjectReference(function (ref) {
var out = ts.outFile(ref.commandLine.options);
if (out) {
setOfDeclarationDirectories.add(ts.getDirectoryPath(host.toPath(out)));
}
else {
// Set declaration's in different locations only, if they are next to source the directory present doesnt change
var declarationDir = ref.commandLine.options.declarationDir || ref.commandLine.options.outDir;
if (declarationDir) {
setOfDeclarationDirectories.add(host.toPath(declarationDir));
}
}
});
}
return fileOrDirectoryExistsUsingSource(path, /*isFile*/ false);
};
}
if (originalGetDirectories) {
// Call getDirectories only if directory actually present on the host
// This is needed to ensure that we arent getting directories that we fake about presence for
host.compilerHost.getDirectories = function (path) {
return !host.getResolvedProjectReferences() || (originalDirectoryExists && originalDirectoryExists.call(host.compilerHost, path)) ?
originalGetDirectories.call(host.compilerHost, path) :
[];
};
}
// This is something we keep for life time of the host
if (originalRealpath) {
host.compilerHost.realpath = function (s) {
var _a;
return ((_a = host.getSymlinkCache().getSymlinkedFiles()) === null || _a === void 0 ? void 0 : _a.get(host.toPath(s))) ||
originalRealpath.call(host.compilerHost, s);
};
}
return { onProgramCreateComplete: onProgramCreateComplete, fileExists: fileExists, directoryExists: directoryExists };
function onProgramCreateComplete() {
host.compilerHost.fileExists = originalFileExists;
host.compilerHost.directoryExists = originalDirectoryExists;
host.compilerHost.getDirectories = originalGetDirectories;
// DO not revert realpath as it could be used later
}
// This implementation of fileExists checks if the file being requested is
// .d.ts file for the referenced Project.
// If it is it returns true irrespective of whether that file exists on host
function fileExists(file) {
if (originalFileExists.call(host.compilerHost, file))
return true;
if (!host.getResolvedProjectReferences())
return false;
if (!ts.isDeclarationFileName(file))
return false;
// Project references go to source file instead of .d.ts file
return fileOrDirectoryExistsUsingSource(file, /*isFile*/ true);
}
function fileExistsIfProjectReferenceDts(file) {
var source = host.getSourceOfProjectReferenceRedirect(file);
return source !== undefined ?
ts.isString(source) ? originalFileExists.call(host.compilerHost, source) : true :
undefined;
}
function directoryExistsIfProjectReferenceDeclDir(dir) {
var dirPath = host.toPath(dir);
var dirPathWithTrailingDirectorySeparator = "" + dirPath + ts.directorySeparator;
return ts.forEachKey(setOfDeclarationDirectories, function (declDirPath) { return dirPath === declDirPath ||
// Any parent directory of declaration dir
ts.startsWith(declDirPath, dirPathWithTrailingDirectorySeparator) ||
// Any directory inside declaration dir
ts.startsWith(dirPath, declDirPath + "/"); });
}
function handleDirectoryCouldBeSymlink(directory) {
var _a;
if (!host.getResolvedProjectReferences() || ts.containsIgnoredPath(directory))
return;
// Because we already watch node_modules, handle symlinks in there
if (!originalRealpath || !ts.stringContains(directory, ts.nodeModulesPathPart))
return;
var symlinkCache = host.getSymlinkCache();
var directoryPath = ts.ensureTrailingDirectorySeparator(host.toPath(directory));
if ((_a = symlinkCache.getSymlinkedDirectories()) === null || _a === void 0 ? void 0 : _a.has(directoryPath))
return;
var real = ts.normalizePath(originalRealpath.call(host.compilerHost, directory));
var realPath;
if (real === directory ||
(realPath = ts.ensureTrailingDirectorySeparator(host.toPath(real))) === directoryPath) {
// not symlinked
symlinkCache.setSymlinkedDirectory(directoryPath, false);
return;
}
symlinkCache.setSymlinkedDirectory(directory, {
real: ts.ensureTrailingDirectorySeparator(real),
realPath: realPath
});
}
function fileOrDirectoryExistsUsingSource(fileOrDirectory, isFile) {
var _a;
var fileOrDirectoryExistsUsingSource = isFile ?
function (file) { return fileExistsIfProjectReferenceDts(file); } :
function (dir) { return directoryExistsIfProjectReferenceDeclDir(dir); };
// Check current directory or file
var result = fileOrDirectoryExistsUsingSource(fileOrDirectory);
if (result !== undefined)
return result;
var symlinkCache = host.getSymlinkCache();
var symlinkedDirectories = symlinkCache.getSymlinkedDirectories();
if (!symlinkedDirectories)
return false;
var fileOrDirectoryPath = host.toPath(fileOrDirectory);
if (!ts.stringContains(fileOrDirectoryPath, ts.nodeModulesPathPart))
return false;
if (isFile && ((_a = symlinkCache.getSymlinkedFiles()) === null || _a === void 0 ? void 0 : _a.has(fileOrDirectoryPath)))
return true;
// If it contains node_modules check if its one of the symlinked path we know of
return ts.firstDefinedIterator(symlinkedDirectories.entries(), function (_a) {
var directoryPath = _a[0], symlinkedDirectory = _a[1];
if (!symlinkedDirectory || !ts.startsWith(fileOrDirectoryPath, directoryPath))
return undefined;
var result = fileOrDirectoryExistsUsingSource(fileOrDirectoryPath.replace(directoryPath, symlinkedDirectory.realPath));
if (isFile && result) {
// Store the real path for the file'
var absolutePath = ts.getNormalizedAbsolutePath(fileOrDirectory, host.compilerHost.getCurrentDirectory());
symlinkCache.setSymlinkedFile(fileOrDirectoryPath, "" + symlinkedDirectory.real + absolutePath.replace(new RegExp(directoryPath, "i"), ""));
}
return result;
}) || false;
}
}
/*@internal*/
ts.emitSkippedWithNoDiagnostics = { diagnostics: ts.emptyArray, sourceMaps: undefined, emittedFiles: undefined, emitSkipped: true };
/*@internal*/
function handleNoEmitOptions(program, sourceFile, writeFile, cancellationToken) {
var options = program.getCompilerOptions();
if (options.noEmit) {
// Cache the semantic diagnostics
program.getSemanticDiagnostics(sourceFile, cancellationToken);
return sourceFile || ts.outFile(options) ?
ts.emitSkippedWithNoDiagnostics :
program.emitBuildInfo(writeFile, cancellationToken);
}
// If the noEmitOnError flag is set, then check if we have any errors so far. If so,
// immediately bail out. Note that we pass 'undefined' for 'sourceFile' so that we
// get any preEmit diagnostics, not just the ones
if (!options.noEmitOnError)
return undefined;
var diagnostics = __spreadArray(__spreadArray(__spreadArray(__spreadArray([], program.getOptionsDiagnostics(cancellationToken), true), program.getSyntacticDiagnostics(sourceFile, cancellationToken), true), program.getGlobalDiagnostics(cancellationToken), true), program.getSemanticDiagnostics(sourceFile, cancellationToken), true);
if (diagnostics.length === 0 && ts.getEmitDeclarations(program.getCompilerOptions())) {
diagnostics = program.getDeclarationDiagnostics(/*sourceFile*/ undefined, cancellationToken);
}
if (!diagnostics.length)
return undefined;
var emittedFiles;
if (!sourceFile && !ts.outFile(options)) {
var emitResult = program.emitBuildInfo(writeFile, cancellationToken);
if (emitResult.diagnostics)
diagnostics = __spreadArray(__spreadArray([], diagnostics, true), emitResult.diagnostics, true);
emittedFiles = emitResult.emittedFiles;
}
return { diagnostics: diagnostics, sourceMaps: undefined, emittedFiles: emittedFiles, emitSkipped: true };
}
ts.handleNoEmitOptions = handleNoEmitOptions;
/*@internal*/
function filterSemanticDiagnostics(diagnostic, option) {
return ts.filter(diagnostic, function (d) { return !d.skippedOn || !option[d.skippedOn]; });
}
ts.filterSemanticDiagnostics = filterSemanticDiagnostics;
/* @internal */
function parseConfigHostFromCompilerHostLike(host, directoryStructureHost) {
if (directoryStructureHost === void 0) { directoryStructureHost = host; }
return {
fileExists: function (f) { return directoryStructureHost.fileExists(f); },
readDirectory: function (root, extensions, excludes, includes, depth) {
ts.Debug.assertIsDefined(directoryStructureHost.readDirectory, "'CompilerHost.readDirectory' must be implemented to correctly process 'projectReferences'");
return directoryStructureHost.readDirectory(root, extensions, excludes, includes, depth);
},
readFile: function (f) { return directoryStructureHost.readFile(f); },
useCaseSensitiveFileNames: host.useCaseSensitiveFileNames(),
getCurrentDirectory: function () { return host.getCurrentDirectory(); },
onUnRecoverableConfigFileDiagnostic: host.onUnRecoverableConfigFileDiagnostic || ts.returnUndefined,
trace: host.trace ? function (s) { return host.trace(s); } : undefined
};
}
ts.parseConfigHostFromCompilerHostLike = parseConfigHostFromCompilerHostLike;
/* @internal */
function createPrependNodes(projectReferences, getCommandLine, readFile) {
if (!projectReferences)
return ts.emptyArray;
var nodes;
for (var i = 0; i < projectReferences.length; i++) {
var ref = projectReferences[i];
var resolvedRefOpts = getCommandLine(ref, i);
if (ref.prepend && resolvedRefOpts && resolvedRefOpts.options) {
var out = ts.outFile(resolvedRefOpts.options);
// Upstream project didn't have outFile set -- skip (error will have been issued earlier)
if (!out)
continue;
var _a = ts.getOutputPathsForBundle(resolvedRefOpts.options, /*forceDtsPaths*/ true), jsFilePath = _a.jsFilePath, sourceMapFilePath = _a.sourceMapFilePath, declarationFilePath = _a.declarationFilePath, declarationMapPath = _a.declarationMapPath, buildInfoPath = _a.buildInfoPath;
var node = ts.createInputFiles(readFile, jsFilePath, sourceMapFilePath, declarationFilePath, declarationMapPath, buildInfoPath);
(nodes || (nodes = [])).push(node);
}
}
return nodes || ts.emptyArray;
}
ts.createPrependNodes = createPrependNodes;
function resolveProjectReferencePath(hostOrRef, ref) {
var passedInRef = ref ? ref : hostOrRef;
return ts.resolveConfigFileProjectName(passedInRef.path);
}
ts.resolveProjectReferencePath = resolveProjectReferencePath;
/* @internal */
/**
* Returns a DiagnosticMessage if we won't include a resolved module due to its extension.
* The DiagnosticMessage's parameters are the imported module name, and the filename it resolved to.
* This returns a diagnostic even if the module will be an untyped module.
*/
function getResolutionDiagnostic(options, _a) {
var extension = _a.extension;
switch (extension) {
case ".ts" /* Ts */:
case ".d.ts" /* Dts */:
// These are always allowed.
return undefined;
case ".tsx" /* Tsx */:
return needJsx();
case ".jsx" /* Jsx */:
return needJsx() || needAllowJs();
case ".js" /* Js */:
return needAllowJs();
case ".json" /* Json */:
return needResolveJsonModule();
}
function needJsx() {
return options.jsx ? undefined : ts.Diagnostics.Module_0_was_resolved_to_1_but_jsx_is_not_set;
}
function needAllowJs() {
return ts.getAllowJSCompilerOption(options) || !ts.getStrictOptionValue(options, "noImplicitAny") ? undefined : ts.Diagnostics.Could_not_find_a_declaration_file_for_module_0_1_implicitly_has_an_any_type;
}
function needResolveJsonModule() {
return options.resolveJsonModule ? undefined : ts.Diagnostics.Module_0_was_resolved_to_1_but_resolveJsonModule_is_not_used;
}
}
ts.getResolutionDiagnostic = getResolutionDiagnostic;
function getModuleNames(_a) {
var imports = _a.imports, moduleAugmentations = _a.moduleAugmentations;
var res = imports.map(function (i) { return i.text; });
for (var _i = 0, moduleAugmentations_1 = moduleAugmentations; _i < moduleAugmentations_1.length; _i++) {
var aug = moduleAugmentations_1[_i];
if (aug.kind === 10 /* StringLiteral */) {
res.push(aug.text);
}
// Do nothing if it's an Identifier; we don't need to do module resolution for `declare global`.
}
return res;
}
/* @internal */
function getModuleNameStringLiteralAt(_a, index) {
var imports = _a.imports, moduleAugmentations = _a.moduleAugmentations;
if (index < imports.length)
return imports[index];
var augIndex = imports.length;
for (var _i = 0, moduleAugmentations_2 = moduleAugmentations; _i < moduleAugmentations_2.length; _i++) {
var aug = moduleAugmentations_2[_i];
if (aug.kind === 10 /* StringLiteral */) {
if (index === augIndex)
return aug;
augIndex++;
}
// Do nothing if it's an Identifier; we don't need to do module resolution for `declare global`.
}
ts.Debug.fail("should never ask for module name at index higher than possible module name");
}
ts.getModuleNameStringLiteralAt = getModuleNameStringLiteralAt;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
function getFileEmitOutput(program, sourceFile, emitOnlyDtsFiles, cancellationToken, customTransformers, forceDtsEmit) {
var outputFiles = [];
var _a = program.emit(sourceFile, writeFile, cancellationToken, emitOnlyDtsFiles, customTransformers, forceDtsEmit), emitSkipped = _a.emitSkipped, diagnostics = _a.diagnostics, exportedModulesFromDeclarationEmit = _a.exportedModulesFromDeclarationEmit;
return { outputFiles: outputFiles, emitSkipped: emitSkipped, diagnostics: diagnostics, exportedModulesFromDeclarationEmit: exportedModulesFromDeclarationEmit };
function writeFile(fileName, text, writeByteOrderMark) {
outputFiles.push({ name: fileName, writeByteOrderMark: writeByteOrderMark, text: text });
}
}
ts.getFileEmitOutput = getFileEmitOutput;
var BuilderState;
(function (BuilderState) {
var manyToManyPathMapCount = 0;
function createManyToManyPathMap() {
function create(forward, reverse, deleted) {
var version = 0;
var map = {
id: manyToManyPathMapCount++,
version: function () { return version; },
clone: function () { return create(new ts.Map(forward), new ts.Map(reverse), deleted && new ts.Set(deleted)); },
forEach: function (fn) { return forward.forEach(fn); },
getKeys: function (v) { return reverse.get(v); },
getValues: function (k) { return forward.get(k); },
hasKey: function (k) { return forward.has(k); },
keys: function () { return forward.keys(); },
deletedKeys: function () { return deleted; },
deleteKey: function (k) {
(deleted || (deleted = new ts.Set())).add(k);
var set = forward.get(k);
if (!set) {
return false;
}
set.forEach(function (v) { return deleteFromMultimap(reverse, v, k); });
forward.delete(k);
version++;
return true;
},
set: function (k, vSet) {
var changed = !!(deleted === null || deleted === void 0 ? void 0 : deleted.delete(k));
var existingVSet = forward.get(k);
forward.set(k, vSet);
existingVSet === null || existingVSet === void 0 ? void 0 : existingVSet.forEach(function (v) {
if (!vSet.has(v)) {
changed = true;
deleteFromMultimap(reverse, v, k);
}
});
vSet.forEach(function (v) {
if (!(existingVSet === null || existingVSet === void 0 ? void 0 : existingVSet.has(v))) {
changed = true;
addToMultimap(reverse, v, k);
}
});
if (changed) {
version++;
}
return map;
},
};
return map;
}
return create(new ts.Map(), new ts.Map(), /*deleted*/ undefined);
}
BuilderState.createManyToManyPathMap = createManyToManyPathMap;
function addToMultimap(map, k, v) {
var set = map.get(k);
if (!set) {
set = new ts.Set();
map.set(k, set);
}
set.add(v);
}
function deleteFromMultimap(map, k, v, removeEmpty) {
if (removeEmpty === void 0) { removeEmpty = true; }
var set = map.get(k);
if (set === null || set === void 0 ? void 0 : set.delete(v)) {
if (removeEmpty && !set.size) {
map.delete(k);
}
return true;
}
return false;
}
function getReferencedFilesFromImportedModuleSymbol(symbol) {
return ts.mapDefined(symbol.declarations, function (declaration) { var _a; return (_a = ts.getSourceFileOfNode(declaration)) === null || _a === void 0 ? void 0 : _a.resolvedPath; });
}
/**
* Get the module source file and all augmenting files from the import name node from file
*/
function getReferencedFilesFromImportLiteral(checker, importName) {
var symbol = checker.getSymbolAtLocation(importName);
return symbol && getReferencedFilesFromImportedModuleSymbol(symbol);
}
/**
* Gets the path to reference file from file name, it could be resolvedPath if present otherwise path
*/
function getReferencedFileFromFileName(program, fileName, sourceFileDirectory, getCanonicalFileName) {
return ts.toPath(program.getProjectReferenceRedirect(fileName) || fileName, sourceFileDirectory, getCanonicalFileName);
}
/**
* Gets the referenced files for a file from the program with values for the keys as referenced file's path to be true
*/
function getReferencedFiles(program, sourceFile, getCanonicalFileName) {
var referencedFiles;
// We need to use a set here since the code can contain the same import twice,
// but that will only be one dependency.
// To avoid invernal conversion, the key of the referencedFiles map must be of type Path
if (sourceFile.imports && sourceFile.imports.length > 0) {
var checker = program.getTypeChecker();
for (var _i = 0, _a = sourceFile.imports; _i < _a.length; _i++) {
var importName = _a[_i];
var declarationSourceFilePaths = getReferencedFilesFromImportLiteral(checker, importName);
declarationSourceFilePaths === null || declarationSourceFilePaths === void 0 ? void 0 : declarationSourceFilePaths.forEach(addReferencedFile);
}
}
var sourceFileDirectory = ts.getDirectoryPath(sourceFile.resolvedPath);
// Handle triple slash references
if (sourceFile.referencedFiles && sourceFile.referencedFiles.length > 0) {
for (var _b = 0, _c = sourceFile.referencedFiles; _b < _c.length; _b++) {
var referencedFile = _c[_b];
var referencedPath = getReferencedFileFromFileName(program, referencedFile.fileName, sourceFileDirectory, getCanonicalFileName);
addReferencedFile(referencedPath);
}
}
// Handle type reference directives
if (sourceFile.resolvedTypeReferenceDirectiveNames) {
sourceFile.resolvedTypeReferenceDirectiveNames.forEach(function (resolvedTypeReferenceDirective) {
if (!resolvedTypeReferenceDirective) {
return;
}
var fileName = resolvedTypeReferenceDirective.resolvedFileName; // TODO: GH#18217
var typeFilePath = getReferencedFileFromFileName(program, fileName, sourceFileDirectory, getCanonicalFileName);
addReferencedFile(typeFilePath);
});
}
// Add module augmentation as references
if (sourceFile.moduleAugmentations.length) {
var checker = program.getTypeChecker();
for (var _d = 0, _e = sourceFile.moduleAugmentations; _d < _e.length; _d++) {
var moduleName = _e[_d];
if (!ts.isStringLiteral(moduleName)) {
continue;
}
var symbol = checker.getSymbolAtLocation(moduleName);
if (!symbol) {
continue;
}
// Add any file other than our own as reference
addReferenceFromAmbientModule(symbol);
}
}
// From ambient modules
for (var _f = 0, _g = program.getTypeChecker().getAmbientModules(); _f < _g.length; _f++) {
var ambientModule = _g[_f];
if (ambientModule.declarations && ambientModule.declarations.length > 1) {
addReferenceFromAmbientModule(ambientModule);
}
}
return referencedFiles;
function addReferenceFromAmbientModule(symbol) {
if (!symbol.declarations) {
return;
}
// Add any file other than our own as reference
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
var declaration = _a[_i];
var declarationSourceFile = ts.getSourceFileOfNode(declaration);
if (declarationSourceFile &&
declarationSourceFile !== sourceFile) {
addReferencedFile(declarationSourceFile.resolvedPath);
}
}
}
function addReferencedFile(referencedPath) {
(referencedFiles || (referencedFiles = new ts.Set())).add(referencedPath);
}
}
/**
* Returns true if oldState is reusable, that is the emitKind = module/non module has not changed
*/
function canReuseOldState(newReferencedMap, oldState) {
return oldState && !oldState.referencedMap === !newReferencedMap;
}
BuilderState.canReuseOldState = canReuseOldState;
/**
* Creates the state of file references and signature for the new program from oldState if it is safe
*/
function create(newProgram, getCanonicalFileName, oldState, disableUseFileVersionAsSignature) {
var fileInfos = new ts.Map();
var referencedMap = newProgram.getCompilerOptions().module !== ts.ModuleKind.None ? createManyToManyPathMap() : undefined;
var exportedModulesMap = referencedMap ? createManyToManyPathMap() : undefined;
var hasCalledUpdateShapeSignature = new ts.Set();
var useOldState = canReuseOldState(referencedMap, oldState);
// Ensure source files have parent pointers set
newProgram.getTypeChecker();
// Create the reference map, and set the file infos
for (var _i = 0, _a = newProgram.getSourceFiles(); _i < _a.length; _i++) {
var sourceFile = _a[_i];
var version_2 = ts.Debug.checkDefined(sourceFile.version, "Program intended to be used with Builder should have source files with versions set");
var oldInfo = useOldState ? oldState.fileInfos.get(sourceFile.resolvedPath) : undefined;
if (referencedMap) {
var newReferences = getReferencedFiles(newProgram, sourceFile, getCanonicalFileName);
if (newReferences) {
referencedMap.set(sourceFile.resolvedPath, newReferences);
}
// Copy old visible to outside files map
if (useOldState) {
var exportedModules = oldState.exportedModulesMap.getValues(sourceFile.resolvedPath);
if (exportedModules) {
exportedModulesMap.set(sourceFile.resolvedPath, exportedModules);
}
}
}
fileInfos.set(sourceFile.resolvedPath, { version: version_2, signature: oldInfo && oldInfo.signature, affectsGlobalScope: isFileAffectingGlobalScope(sourceFile) || undefined });
}
return {
fileInfos: fileInfos,
referencedMap: referencedMap,
exportedModulesMap: exportedModulesMap,
hasCalledUpdateShapeSignature: hasCalledUpdateShapeSignature,
useFileVersionAsSignature: !disableUseFileVersionAsSignature && !useOldState
};
}
BuilderState.create = create;
/**
* Releases needed properties
*/
function releaseCache(state) {
state.allFilesExcludingDefaultLibraryFile = undefined;
state.allFileNames = undefined;
}
BuilderState.releaseCache = releaseCache;
/**
* Creates a clone of the state
*/
function clone(state) {
var _a, _b;
// Dont need to backup allFiles info since its cache anyway
return {
fileInfos: new ts.Map(state.fileInfos),
referencedMap: (_a = state.referencedMap) === null || _a === void 0 ? void 0 : _a.clone(),
exportedModulesMap: (_b = state.exportedModulesMap) === null || _b === void 0 ? void 0 : _b.clone(),
hasCalledUpdateShapeSignature: new ts.Set(state.hasCalledUpdateShapeSignature),
useFileVersionAsSignature: state.useFileVersionAsSignature,
};
}
BuilderState.clone = clone;
/**
* Gets the files affected by the path from the program
*/
function getFilesAffectedBy(state, programOfThisState, path, cancellationToken, computeHash, cacheToUpdateSignature, exportedModulesMapCache) {
// Since the operation could be cancelled, the signatures are always stored in the cache
// They will be committed once it is safe to use them
// eg when calling this api from tsserver, if there is no cancellation of the operation
// In the other cases the affected files signatures are committed only after the iteration through the result is complete
var signatureCache = cacheToUpdateSignature || new ts.Map();
var sourceFile = programOfThisState.getSourceFileByPath(path);
if (!sourceFile) {
return ts.emptyArray;
}
if (!updateShapeSignature(state, programOfThisState, sourceFile, signatureCache, cancellationToken, computeHash, exportedModulesMapCache)) {
return [sourceFile];
}
var result = (state.referencedMap ? getFilesAffectedByUpdatedShapeWhenModuleEmit : getFilesAffectedByUpdatedShapeWhenNonModuleEmit)(state, programOfThisState, sourceFile, signatureCache, cancellationToken, computeHash, exportedModulesMapCache);
if (!cacheToUpdateSignature) {
// Commit all the signatures in the signature cache
updateSignaturesFromCache(state, signatureCache);
}
return result;
}
BuilderState.getFilesAffectedBy = getFilesAffectedBy;
/**
* Updates the signatures from the cache into state's fileinfo signatures
* This should be called whenever it is safe to commit the state of the builder
*/
function updateSignaturesFromCache(state, signatureCache) {
signatureCache.forEach(function (signature, path) { return updateSignatureOfFile(state, signature, path); });
}
BuilderState.updateSignaturesFromCache = updateSignaturesFromCache;
function updateSignatureOfFile(state, signature, path) {
state.fileInfos.get(path).signature = signature;
state.hasCalledUpdateShapeSignature.add(path);
}
BuilderState.updateSignatureOfFile = updateSignatureOfFile;
/**
* Returns if the shape of the signature has changed since last emit
*/
function updateShapeSignature(state, programOfThisState, sourceFile, cacheToUpdateSignature, cancellationToken, computeHash, exportedModulesMapCache, useFileVersionAsSignature) {
if (useFileVersionAsSignature === void 0) { useFileVersionAsSignature = state.useFileVersionAsSignature; }
ts.Debug.assert(!!sourceFile);
ts.Debug.assert(!exportedModulesMapCache || !!state.exportedModulesMap, "Compute visible to outside map only if visibleToOutsideReferencedMap present in the state");
// If we have cached the result for this file, that means hence forth we should assume file shape is uptodate
if (state.hasCalledUpdateShapeSignature.has(sourceFile.resolvedPath) || cacheToUpdateSignature.has(sourceFile.resolvedPath)) {
return false;
}
var info = state.fileInfos.get(sourceFile.resolvedPath);
if (!info)
return ts.Debug.fail();
var prevSignature = info.signature;
var latestSignature;
if (!sourceFile.isDeclarationFile && !useFileVersionAsSignature) {
var emitOutput_1 = getFileEmitOutput(programOfThisState, sourceFile,
/*emitOnlyDtsFiles*/ true, cancellationToken,
/*customTransformers*/ undefined,
/*forceDtsEmit*/ true);
var firstDts_1 = ts.firstOrUndefined(emitOutput_1.outputFiles);
if (firstDts_1) {
ts.Debug.assert(ts.fileExtensionIs(firstDts_1.name, ".d.ts" /* Dts */), "File extension for signature expected to be dts", function () { return "Found: " + ts.getAnyExtensionFromPath(firstDts_1.name) + " for " + firstDts_1.name + ":: All output files: " + JSON.stringify(emitOutput_1.outputFiles.map(function (f) { return f.name; })); });
latestSignature = (computeHash || ts.generateDjb2Hash)(firstDts_1.text);
if (exportedModulesMapCache && latestSignature !== prevSignature) {
updateExportedModules(sourceFile, emitOutput_1.exportedModulesFromDeclarationEmit, exportedModulesMapCache);
}
}
}
// Default is to use file version as signature
if (latestSignature === undefined) {
latestSignature = sourceFile.version;
if (exportedModulesMapCache && latestSignature !== prevSignature) {
// All the references in this file are exported
var references = state.referencedMap ? state.referencedMap.getValues(sourceFile.resolvedPath) : undefined;
if (references) {
exportedModulesMapCache.set(sourceFile.resolvedPath, references);
}
else {
exportedModulesMapCache.deleteKey(sourceFile.resolvedPath);
}
}
}
cacheToUpdateSignature.set(sourceFile.resolvedPath, latestSignature);
return latestSignature !== prevSignature;
}
BuilderState.updateShapeSignature = updateShapeSignature;
/**
* Coverts the declaration emit result into exported modules map
*/
function updateExportedModules(sourceFile, exportedModulesFromDeclarationEmit, exportedModulesMapCache) {
if (!exportedModulesFromDeclarationEmit) {
exportedModulesMapCache.deleteKey(sourceFile.resolvedPath);
return;
}
var exportedModules;
exportedModulesFromDeclarationEmit.forEach(function (symbol) { return addExportedModule(getReferencedFilesFromImportedModuleSymbol(symbol)); });
if (exportedModules) {
exportedModulesMapCache.set(sourceFile.resolvedPath, exportedModules);
}
else {
exportedModulesMapCache.deleteKey(sourceFile.resolvedPath);
}
function addExportedModule(exportedModulePaths) {
if (exportedModulePaths === null || exportedModulePaths === void 0 ? void 0 : exportedModulePaths.length) {
if (!exportedModules) {
exportedModules = new ts.Set();
}
exportedModulePaths.forEach(function (path) { return exportedModules.add(path); });
}
}
}
/**
* Updates the exported modules from cache into state's exported modules map
* This should be called whenever it is safe to commit the state of the builder
*/
function updateExportedFilesMapFromCache(state, exportedModulesMapCache) {
var _a;
if (exportedModulesMapCache) {
ts.Debug.assert(!!state.exportedModulesMap);
var cacheId = exportedModulesMapCache.id;
var cacheVersion = exportedModulesMapCache.version();
if (state.previousCache) {
if (state.previousCache.id === cacheId && state.previousCache.version === cacheVersion) {
// If this is the same cache at the same version as last time this BuilderState
// was updated, there's no need to update again
return;
}
state.previousCache.id = cacheId;
state.previousCache.version = cacheVersion;
}
else {
state.previousCache = { id: cacheId, version: cacheVersion };
}
(_a = exportedModulesMapCache.deletedKeys()) === null || _a === void 0 ? void 0 : _a.forEach(function (path) { return state.exportedModulesMap.deleteKey(path); });
exportedModulesMapCache.forEach(function (exportedModules, path) { return state.exportedModulesMap.set(path, exportedModules); });
}
}
BuilderState.updateExportedFilesMapFromCache = updateExportedFilesMapFromCache;
/**
* Get all the dependencies of the sourceFile
*/
function getAllDependencies(state, programOfThisState, sourceFile) {
var compilerOptions = programOfThisState.getCompilerOptions();
// With --out or --outFile all outputs go into single file, all files depend on each other
if (ts.outFile(compilerOptions)) {
return getAllFileNames(state, programOfThisState);
}
// If this is non module emit, or its a global file, it depends on all the source files
if (!state.referencedMap || isFileAffectingGlobalScope(sourceFile)) {
return getAllFileNames(state, programOfThisState);
}
// Get the references, traversing deep from the referenceMap
var seenMap = new ts.Set();
var queue = [sourceFile.resolvedPath];
while (queue.length) {
var path = queue.pop();
if (!seenMap.has(path)) {
seenMap.add(path);
var references = state.referencedMap.getValues(path);
if (references) {
var iterator = references.keys();
for (var iterResult = iterator.next(); !iterResult.done; iterResult = iterator.next()) {
queue.push(iterResult.value);
}
}
}
}
return ts.arrayFrom(ts.mapDefinedIterator(seenMap.keys(), function (path) { var _a, _b; return (_b = (_a = programOfThisState.getSourceFileByPath(path)) === null || _a === void 0 ? void 0 : _a.fileName) !== null && _b !== void 0 ? _b : path; }));
}
BuilderState.getAllDependencies = getAllDependencies;
/**
* Gets the names of all files from the program
*/
function getAllFileNames(state, programOfThisState) {
if (!state.allFileNames) {
var sourceFiles = programOfThisState.getSourceFiles();
state.allFileNames = sourceFiles === ts.emptyArray ? ts.emptyArray : sourceFiles.map(function (file) { return file.fileName; });
}
return state.allFileNames;
}
/**
* Gets the files referenced by the the file path
*/
function getReferencedByPaths(state, referencedFilePath) {
var keys = state.referencedMap.getKeys(referencedFilePath);
return keys ? ts.arrayFrom(keys.keys()) : [];
}
BuilderState.getReferencedByPaths = getReferencedByPaths;
/**
* For script files that contains only ambient external modules, although they are not actually external module files,
* they can only be consumed via importing elements from them. Regular script files cannot consume them. Therefore,
* there are no point to rebuild all script files if these special files have changed. However, if any statement
* in the file is not ambient external module, we treat it as a regular script file.
*/
function containsOnlyAmbientModules(sourceFile) {
for (var _i = 0, _a = sourceFile.statements; _i < _a.length; _i++) {
var statement = _a[_i];
if (!ts.isModuleWithStringLiteralName(statement)) {
return false;
}
}
return true;
}
/**
* Return true if file contains anything that augments to global scope we need to build them as if
* they are global files as well as module
*/
function containsGlobalScopeAugmentation(sourceFile) {
return ts.some(sourceFile.moduleAugmentations, function (augmentation) { return ts.isGlobalScopeAugmentation(augmentation.parent); });
}
/**
* Return true if the file will invalidate all files because it affectes global scope
*/
function isFileAffectingGlobalScope(sourceFile) {
return containsGlobalScopeAugmentation(sourceFile) ||
!ts.isExternalOrCommonJsModule(sourceFile) && !ts.isJsonSourceFile(sourceFile) && !containsOnlyAmbientModules(sourceFile);
}
/**
* Gets all files of the program excluding the default library file
*/
function getAllFilesExcludingDefaultLibraryFile(state, programOfThisState, firstSourceFile) {
// Use cached result
if (state.allFilesExcludingDefaultLibraryFile) {
return state.allFilesExcludingDefaultLibraryFile;
}
var result;
if (firstSourceFile)
addSourceFile(firstSourceFile);
for (var _i = 0, _a = programOfThisState.getSourceFiles(); _i < _a.length; _i++) {
var sourceFile = _a[_i];
if (sourceFile !== firstSourceFile) {
addSourceFile(sourceFile);
}
}
state.allFilesExcludingDefaultLibraryFile = result || ts.emptyArray;
return state.allFilesExcludingDefaultLibraryFile;
function addSourceFile(sourceFile) {
if (!programOfThisState.isSourceFileDefaultLibrary(sourceFile)) {
(result || (result = [])).push(sourceFile);
}
}
}
BuilderState.getAllFilesExcludingDefaultLibraryFile = getAllFilesExcludingDefaultLibraryFile;
/**
* When program emits non modular code, gets the files affected by the sourceFile whose shape has changed
*/
function getFilesAffectedByUpdatedShapeWhenNonModuleEmit(state, programOfThisState, sourceFileWithUpdatedShape) {
var compilerOptions = programOfThisState.getCompilerOptions();
// If `--out` or `--outFile` is specified, any new emit will result in re-emitting the entire project,
// so returning the file itself is good enough.
if (compilerOptions && ts.outFile(compilerOptions)) {
return [sourceFileWithUpdatedShape];
}
return getAllFilesExcludingDefaultLibraryFile(state, programOfThisState, sourceFileWithUpdatedShape);
}
/**
* When program emits modular code, gets the files affected by the sourceFile whose shape has changed
*/
function getFilesAffectedByUpdatedShapeWhenModuleEmit(state, programOfThisState, sourceFileWithUpdatedShape, cacheToUpdateSignature, cancellationToken, computeHash, exportedModulesMapCache) {
if (isFileAffectingGlobalScope(sourceFileWithUpdatedShape)) {
return getAllFilesExcludingDefaultLibraryFile(state, programOfThisState, sourceFileWithUpdatedShape);
}
var compilerOptions = programOfThisState.getCompilerOptions();
if (compilerOptions && (compilerOptions.isolatedModules || ts.outFile(compilerOptions))) {
return [sourceFileWithUpdatedShape];
}
// Now we need to if each file in the referencedBy list has a shape change as well.
// Because if so, its own referencedBy files need to be saved as well to make the
// emitting result consistent with files on disk.
var seenFileNamesMap = new ts.Map();
// Start with the paths this file was referenced by
seenFileNamesMap.set(sourceFileWithUpdatedShape.resolvedPath, sourceFileWithUpdatedShape);
var queue = getReferencedByPaths(state, sourceFileWithUpdatedShape.resolvedPath);
while (queue.length > 0) {
var currentPath = queue.pop();
if (!seenFileNamesMap.has(currentPath)) {
var currentSourceFile = programOfThisState.getSourceFileByPath(currentPath);
seenFileNamesMap.set(currentPath, currentSourceFile);
if (currentSourceFile && updateShapeSignature(state, programOfThisState, currentSourceFile, cacheToUpdateSignature, cancellationToken, computeHash, exportedModulesMapCache)) {
queue.push.apply(queue, getReferencedByPaths(state, currentSourceFile.resolvedPath));
}
}
}
// Return array of values that needs emit
return ts.arrayFrom(ts.mapDefinedIterator(seenFileNamesMap.values(), function (value) { return value; }));
}
})(BuilderState = ts.BuilderState || (ts.BuilderState = {}));
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
var BuilderFileEmit;
(function (BuilderFileEmit) {
BuilderFileEmit[BuilderFileEmit["DtsOnly"] = 0] = "DtsOnly";
BuilderFileEmit[BuilderFileEmit["Full"] = 1] = "Full";
})(BuilderFileEmit = ts.BuilderFileEmit || (ts.BuilderFileEmit = {}));
function hasSameKeys(map1, map2) {
// Has same size and every key is present in both maps
return map1 === map2 || map1 !== undefined && map2 !== undefined && map1.size === map2.size && !ts.forEachKey(map1, function (key) { return !map2.has(key); });
}
/**
* Create the state so that we can iterate on changedFiles/affected files
*/
function createBuilderProgramState(newProgram, getCanonicalFileName, oldState, disableUseFileVersionAsSignature) {
var state = ts.BuilderState.create(newProgram, getCanonicalFileName, oldState, disableUseFileVersionAsSignature);
state.program = newProgram;
var compilerOptions = newProgram.getCompilerOptions();
state.compilerOptions = compilerOptions;
// With --out or --outFile, any change affects all semantic diagnostics so no need to cache them
if (!ts.outFile(compilerOptions)) {
state.semanticDiagnosticsPerFile = new ts.Map();
}
state.changedFilesSet = new ts.Set();
var useOldState = ts.BuilderState.canReuseOldState(state.referencedMap, oldState);
var oldCompilerOptions = useOldState ? oldState.compilerOptions : undefined;
var canCopySemanticDiagnostics = useOldState && oldState.semanticDiagnosticsPerFile && !!state.semanticDiagnosticsPerFile &&
!ts.compilerOptionsAffectSemanticDiagnostics(compilerOptions, oldCompilerOptions);
if (useOldState) {
// Verify the sanity of old state
if (!oldState.currentChangedFilePath) {
var affectedSignatures = oldState.currentAffectedFilesSignatures;
ts.Debug.assert(!oldState.affectedFiles && (!affectedSignatures || !affectedSignatures.size), "Cannot reuse if only few affected files of currentChangedFile were iterated");
}
var changedFilesSet = oldState.changedFilesSet;
if (canCopySemanticDiagnostics) {
ts.Debug.assert(!changedFilesSet || !ts.forEachKey(changedFilesSet, function (path) { return oldState.semanticDiagnosticsPerFile.has(path); }), "Semantic diagnostics shouldnt be available for changed files");
}
// Copy old state's changed files set
changedFilesSet === null || changedFilesSet === void 0 ? void 0 : changedFilesSet.forEach(function (value) { return state.changedFilesSet.add(value); });
if (!ts.outFile(compilerOptions) && oldState.affectedFilesPendingEmit) {
state.affectedFilesPendingEmit = oldState.affectedFilesPendingEmit.slice();
state.affectedFilesPendingEmitKind = oldState.affectedFilesPendingEmitKind && new ts.Map(oldState.affectedFilesPendingEmitKind);
state.affectedFilesPendingEmitIndex = oldState.affectedFilesPendingEmitIndex;
state.seenAffectedFiles = new ts.Set();
}
}
// Update changed files and copy semantic diagnostics if we can
var referencedMap = state.referencedMap;
var oldReferencedMap = useOldState ? oldState.referencedMap : undefined;
var copyDeclarationFileDiagnostics = canCopySemanticDiagnostics && !compilerOptions.skipLibCheck === !oldCompilerOptions.skipLibCheck;
var copyLibFileDiagnostics = copyDeclarationFileDiagnostics && !compilerOptions.skipDefaultLibCheck === !oldCompilerOptions.skipDefaultLibCheck;
state.fileInfos.forEach(function (info, sourceFilePath) {
var oldInfo;
var newReferences;
// if not using old state, every file is changed
if (!useOldState ||
// File wasn't present in old state
!(oldInfo = oldState.fileInfos.get(sourceFilePath)) ||
// versions dont match
oldInfo.version !== info.version ||
// Referenced files changed
!hasSameKeys(newReferences = referencedMap && referencedMap.getValues(sourceFilePath), oldReferencedMap && oldReferencedMap.getValues(sourceFilePath)) ||
// Referenced file was deleted in the new program
newReferences && ts.forEachKey(newReferences, function (path) { return !state.fileInfos.has(path) && oldState.fileInfos.has(path); })) {
// Register file as changed file and do not copy semantic diagnostics, since all changed files need to be re-evaluated
state.changedFilesSet.add(sourceFilePath);
}
else if (canCopySemanticDiagnostics) {
var sourceFile = newProgram.getSourceFileByPath(sourceFilePath);
if (sourceFile.isDeclarationFile && !copyDeclarationFileDiagnostics) {
return;
}
if (sourceFile.hasNoDefaultLib && !copyLibFileDiagnostics) {
return;
}
// Unchanged file copy diagnostics
var diagnostics = oldState.semanticDiagnosticsPerFile.get(sourceFilePath);
if (diagnostics) {
state.semanticDiagnosticsPerFile.set(sourceFilePath, oldState.hasReusableDiagnostic ? convertToDiagnostics(diagnostics, newProgram, getCanonicalFileName) : diagnostics);
if (!state.semanticDiagnosticsFromOldState) {
state.semanticDiagnosticsFromOldState = new ts.Set();
}
state.semanticDiagnosticsFromOldState.add(sourceFilePath);
}
}
});
// If the global file is removed, add all files as changed
if (useOldState && ts.forEachEntry(oldState.fileInfos, function (info, sourceFilePath) { return info.affectsGlobalScope && !state.fileInfos.has(sourceFilePath); })) {
ts.BuilderState.getAllFilesExcludingDefaultLibraryFile(state, newProgram, /*firstSourceFile*/ undefined)
.forEach(function (file) { return state.changedFilesSet.add(file.resolvedPath); });
}
else if (oldCompilerOptions && !ts.outFile(compilerOptions) && ts.compilerOptionsAffectEmit(compilerOptions, oldCompilerOptions)) {
// Add all files to affectedFilesPendingEmit since emit changed
newProgram.getSourceFiles().forEach(function (f) { return addToAffectedFilesPendingEmit(state, f.resolvedPath, 1 /* Full */); });
ts.Debug.assert(!state.seenAffectedFiles || !state.seenAffectedFiles.size);
state.seenAffectedFiles = state.seenAffectedFiles || new ts.Set();
}
state.buildInfoEmitPending = !!state.changedFilesSet.size;
return state;
}
function convertToDiagnostics(diagnostics, newProgram, getCanonicalFileName) {
if (!diagnostics.length)
return ts.emptyArray;
var buildInfoDirectory = ts.getDirectoryPath(ts.getNormalizedAbsolutePath(ts.getTsBuildInfoEmitOutputFilePath(newProgram.getCompilerOptions()), newProgram.getCurrentDirectory()));
return diagnostics.map(function (diagnostic) {
var result = convertToDiagnosticRelatedInformation(diagnostic, newProgram, toPath);
result.reportsUnnecessary = diagnostic.reportsUnnecessary;
result.reportsDeprecated = diagnostic.reportDeprecated;
result.source = diagnostic.source;
result.skippedOn = diagnostic.skippedOn;
var relatedInformation = diagnostic.relatedInformation;
result.relatedInformation = relatedInformation ?
relatedInformation.length ?
relatedInformation.map(function (r) { return convertToDiagnosticRelatedInformation(r, newProgram, toPath); }) :
[] :
undefined;
return result;
});
function toPath(path) {
return ts.toPath(path, buildInfoDirectory, getCanonicalFileName);
}
}
function convertToDiagnosticRelatedInformation(diagnostic, newProgram, toPath) {
var file = diagnostic.file;
return __assign(__assign({}, diagnostic), { file: file ? newProgram.getSourceFileByPath(toPath(file)) : undefined });
}
/**
* Releases program and other related not needed properties
*/
function releaseCache(state) {
ts.BuilderState.releaseCache(state);
state.program = undefined;
}
/**
* Creates a clone of the state
*/
function cloneBuilderProgramState(state) {
var _a;
var newState = ts.BuilderState.clone(state);
newState.semanticDiagnosticsPerFile = state.semanticDiagnosticsPerFile && new ts.Map(state.semanticDiagnosticsPerFile);
newState.changedFilesSet = new ts.Set(state.changedFilesSet);
newState.affectedFiles = state.affectedFiles;
newState.affectedFilesIndex = state.affectedFilesIndex;
newState.currentChangedFilePath = state.currentChangedFilePath;
newState.currentAffectedFilesSignatures = state.currentAffectedFilesSignatures && new ts.Map(state.currentAffectedFilesSignatures);
newState.currentAffectedFilesExportedModulesMap = (_a = state.currentAffectedFilesExportedModulesMap) === null || _a === void 0 ? void 0 : _a.clone();
newState.seenAffectedFiles = state.seenAffectedFiles && new ts.Set(state.seenAffectedFiles);
newState.cleanedDiagnosticsOfLibFiles = state.cleanedDiagnosticsOfLibFiles;
newState.semanticDiagnosticsFromOldState = state.semanticDiagnosticsFromOldState && new ts.Set(state.semanticDiagnosticsFromOldState);
newState.program = state.program;
newState.compilerOptions = state.compilerOptions;
newState.affectedFilesPendingEmit = state.affectedFilesPendingEmit && state.affectedFilesPendingEmit.slice();
newState.affectedFilesPendingEmitKind = state.affectedFilesPendingEmitKind && new ts.Map(state.affectedFilesPendingEmitKind);
newState.affectedFilesPendingEmitIndex = state.affectedFilesPendingEmitIndex;
newState.seenEmittedFiles = state.seenEmittedFiles && new ts.Map(state.seenEmittedFiles);
newState.programEmitComplete = state.programEmitComplete;
return newState;
}
/**
* Verifies that source file is ok to be used in calls that arent handled by next
*/
function assertSourceFileOkWithoutNextAffectedCall(state, sourceFile) {
ts.Debug.assert(!sourceFile || !state.affectedFiles || state.affectedFiles[state.affectedFilesIndex - 1] !== sourceFile || !state.semanticDiagnosticsPerFile.has(sourceFile.resolvedPath));
}
/**
* This function returns the next affected file to be processed.
* Note that until doneAffected is called it would keep reporting same result
* This is to allow the callers to be able to actually remove affected file only when the operation is complete
* eg. if during diagnostics check cancellation token ends up cancelling the request, the affected file should be retained
*/
function getNextAffectedFile(state, cancellationToken, computeHash) {
while (true) {
var affectedFiles = state.affectedFiles;
if (affectedFiles) {
var seenAffectedFiles = state.seenAffectedFiles;
var affectedFilesIndex = state.affectedFilesIndex; // TODO: GH#18217
while (affectedFilesIndex < affectedFiles.length) {
var affectedFile = affectedFiles[affectedFilesIndex];
if (!seenAffectedFiles.has(affectedFile.resolvedPath)) {
// Set the next affected file as seen and remove the cached semantic diagnostics
state.affectedFilesIndex = affectedFilesIndex;
handleDtsMayChangeOfAffectedFile(state, affectedFile, cancellationToken, computeHash);
return affectedFile;
}
affectedFilesIndex++;
}
// Remove the changed file from the change set
state.changedFilesSet.delete(state.currentChangedFilePath);
state.currentChangedFilePath = undefined;
// Commit the changes in file signature
ts.BuilderState.updateSignaturesFromCache(state, state.currentAffectedFilesSignatures);
state.currentAffectedFilesSignatures.clear();
ts.BuilderState.updateExportedFilesMapFromCache(state, state.currentAffectedFilesExportedModulesMap);
state.affectedFiles = undefined;
}
// Get next changed file
var nextKey = state.changedFilesSet.keys().next();
if (nextKey.done) {
// Done
return undefined;
}
// With --out or --outFile all outputs go into single file
// so operations are performed directly on program, return program
var program = ts.Debug.checkDefined(state.program);
var compilerOptions = program.getCompilerOptions();
if (ts.outFile(compilerOptions)) {
ts.Debug.assert(!state.semanticDiagnosticsPerFile);
return program;
}
// Get next batch of affected files
if (!state.currentAffectedFilesSignatures)
state.currentAffectedFilesSignatures = new ts.Map();
if (state.exportedModulesMap) {
state.currentAffectedFilesExportedModulesMap || (state.currentAffectedFilesExportedModulesMap = ts.BuilderState.createManyToManyPathMap());
}
state.affectedFiles = ts.BuilderState.getFilesAffectedBy(state, program, nextKey.value, cancellationToken, computeHash, state.currentAffectedFilesSignatures, state.currentAffectedFilesExportedModulesMap);
state.currentChangedFilePath = nextKey.value;
state.affectedFilesIndex = 0;
if (!state.seenAffectedFiles)
state.seenAffectedFiles = new ts.Set();
}
}
/**
* Returns next file to be emitted from files that retrieved semantic diagnostics but did not emit yet
*/
function getNextAffectedFilePendingEmit(state) {
var affectedFilesPendingEmit = state.affectedFilesPendingEmit;
if (affectedFilesPendingEmit) {
var seenEmittedFiles = (state.seenEmittedFiles || (state.seenEmittedFiles = new ts.Map()));
for (var i = state.affectedFilesPendingEmitIndex; i < affectedFilesPendingEmit.length; i++) {
var affectedFile = ts.Debug.checkDefined(state.program).getSourceFileByPath(affectedFilesPendingEmit[i]);
if (affectedFile) {
var seenKind = seenEmittedFiles.get(affectedFile.resolvedPath);
var emitKind = ts.Debug.checkDefined(ts.Debug.checkDefined(state.affectedFilesPendingEmitKind).get(affectedFile.resolvedPath));
if (seenKind === undefined || seenKind < emitKind) {
// emit this file
state.affectedFilesPendingEmitIndex = i;
return { affectedFile: affectedFile, emitKind: emitKind };
}
}
}
state.affectedFilesPendingEmit = undefined;
state.affectedFilesPendingEmitKind = undefined;
state.affectedFilesPendingEmitIndex = undefined;
}
return undefined;
}
/**
* Handles semantic diagnostics and dts emit for affectedFile and files, that are referencing modules that export entities from affected file
* This is because even though js emit doesnt change, dts emit / type used can change resulting in need for dts emit and js change
*/
function handleDtsMayChangeOfAffectedFile(state, affectedFile, cancellationToken, computeHash) {
var _a;
removeSemanticDiagnosticsOf(state, affectedFile.resolvedPath);
// If affected files is everything except default library, then nothing more to do
if (state.allFilesExcludingDefaultLibraryFile === state.affectedFiles) {
if (!state.cleanedDiagnosticsOfLibFiles) {
state.cleanedDiagnosticsOfLibFiles = true;
var program_1 = ts.Debug.checkDefined(state.program);
var options_2 = program_1.getCompilerOptions();
ts.forEach(program_1.getSourceFiles(), function (f) {
return program_1.isSourceFileDefaultLibrary(f) &&
!ts.skipTypeChecking(f, options_2, program_1) &&
removeSemanticDiagnosticsOf(state, f.resolvedPath);
});
}
// When a change affects the global scope, all files are considered to be affected without updating their signature
// That means when affected file is handled, its signature can be out of date
// To avoid this, ensure that we update the signature for any affected file in this scenario.
ts.BuilderState.updateShapeSignature(state, ts.Debug.checkDefined(state.program), affectedFile, ts.Debug.checkDefined(state.currentAffectedFilesSignatures), cancellationToken, computeHash, state.currentAffectedFilesExportedModulesMap);
return;
}
else {
ts.Debug.assert(state.hasCalledUpdateShapeSignature.has(affectedFile.resolvedPath) || ((_a = state.currentAffectedFilesSignatures) === null || _a === void 0 ? void 0 : _a.has(affectedFile.resolvedPath)), "Signature not updated for affected file: " + affectedFile.fileName);
}
if (!state.compilerOptions.assumeChangesOnlyAffectDirectDependencies) {
forEachReferencingModulesOfExportOfAffectedFile(state, affectedFile, function (state, path) { return handleDtsMayChangeOf(state, path, cancellationToken, computeHash); });
}
}
/**
* Handle the dts may change, so they need to be added to pending emit if dts emit is enabled,
* Also we need to make sure signature is updated for these files
*/
function handleDtsMayChangeOf(state, path, cancellationToken, computeHash) {
removeSemanticDiagnosticsOf(state, path);
if (!state.changedFilesSet.has(path)) {
var program = ts.Debug.checkDefined(state.program);
var sourceFile = program.getSourceFileByPath(path);
if (sourceFile) {
// Even though the js emit doesnt change and we are already handling dts emit and semantic diagnostics
// we need to update the signature to reflect correctness of the signature(which is output d.ts emit) of this file
// This ensures that we dont later during incremental builds considering wrong signature.
// Eg where this also is needed to ensure that .tsbuildinfo generated by incremental build should be same as if it was first fresh build
// But we avoid expensive full shape computation, as using file version as shape is enough for correctness.
ts.BuilderState.updateShapeSignature(state, program, sourceFile, ts.Debug.checkDefined(state.currentAffectedFilesSignatures), cancellationToken, computeHash, state.currentAffectedFilesExportedModulesMap,
/* useFileVersionAsSignature */ true);
// If not dts emit, nothing more to do
if (ts.getEmitDeclarations(state.compilerOptions)) {
addToAffectedFilesPendingEmit(state, path, 0 /* DtsOnly */);
}
}
}
}
/**
* Removes semantic diagnostics for path and
* returns true if there are no more semantic diagnostics from the old state
*/
function removeSemanticDiagnosticsOf(state, path) {
if (!state.semanticDiagnosticsFromOldState) {
return true;
}
state.semanticDiagnosticsFromOldState.delete(path);
state.semanticDiagnosticsPerFile.delete(path);
return !state.semanticDiagnosticsFromOldState.size;
}
function isChangedSignature(state, path) {
var newSignature = ts.Debug.checkDefined(state.currentAffectedFilesSignatures).get(path);
var oldSignature = ts.Debug.checkDefined(state.fileInfos.get(path)).signature;
return newSignature !== oldSignature;
}
/**
* Iterate on referencing modules that export entities from affected file
*/
function forEachReferencingModulesOfExportOfAffectedFile(state, affectedFile, fn) {
var _a, _b;
// If there was change in signature (dts output) for the changed file,
// then only we need to handle pending file emit
if (!state.exportedModulesMap || !state.changedFilesSet.has(affectedFile.resolvedPath)) {
return;
}
if (!isChangedSignature(state, affectedFile.resolvedPath))
return;
// Since isolated modules dont change js files, files affected by change in signature is itself
// But we need to cleanup semantic diagnostics and queue dts emit for affected files
if (state.compilerOptions.isolatedModules) {
var seenFileNamesMap = new ts.Map();
seenFileNamesMap.set(affectedFile.resolvedPath, true);
var queue = ts.BuilderState.getReferencedByPaths(state, affectedFile.resolvedPath);
while (queue.length > 0) {
var currentPath = queue.pop();
if (!seenFileNamesMap.has(currentPath)) {
seenFileNamesMap.set(currentPath, true);
fn(state, currentPath);
if (isChangedSignature(state, currentPath)) {
var currentSourceFile = ts.Debug.checkDefined(state.program).getSourceFileByPath(currentPath);
queue.push.apply(queue, ts.BuilderState.getReferencedByPaths(state, currentSourceFile.resolvedPath));
}
}
}
}
ts.Debug.assert(!!state.currentAffectedFilesExportedModulesMap);
var seenFileAndExportsOfFile = new ts.Set();
// Go through exported modules from cache first
// If exported modules has path, all files referencing file exported from are affected
(_a = state.currentAffectedFilesExportedModulesMap.getKeys(affectedFile.resolvedPath)) === null || _a === void 0 ? void 0 : _a.forEach(function (exportedFromPath) {
return forEachFilesReferencingPath(state, exportedFromPath, seenFileAndExportsOfFile, fn);
});
// If exported from path is not from cache and exported modules has path, all files referencing file exported from are affected
(_b = state.exportedModulesMap.getKeys(affectedFile.resolvedPath)) === null || _b === void 0 ? void 0 : _b.forEach(function (exportedFromPath) {
var _a;
// If the cache had an updated value, skip
return !state.currentAffectedFilesExportedModulesMap.hasKey(exportedFromPath) &&
!((_a = state.currentAffectedFilesExportedModulesMap.deletedKeys()) === null || _a === void 0 ? void 0 : _a.has(exportedFromPath)) &&
forEachFilesReferencingPath(state, exportedFromPath, seenFileAndExportsOfFile, fn);
});
}
/**
* Iterate on files referencing referencedPath
*/
function forEachFilesReferencingPath(state, referencedPath, seenFileAndExportsOfFile, fn) {
var _a;
(_a = state.referencedMap.getKeys(referencedPath)) === null || _a === void 0 ? void 0 : _a.forEach(function (filePath) {
return forEachFileAndExportsOfFile(state, filePath, seenFileAndExportsOfFile, fn);
});
}
/**
* fn on file and iterate on anything that exports this file
*/
function forEachFileAndExportsOfFile(state, filePath, seenFileAndExportsOfFile, fn) {
var _a, _b, _c;
if (!ts.tryAddToSet(seenFileAndExportsOfFile, filePath)) {
return;
}
fn(state, filePath);
ts.Debug.assert(!!state.currentAffectedFilesExportedModulesMap);
// Go through exported modules from cache first
// If exported modules has path, all files referencing file exported from are affected
(_a = state.currentAffectedFilesExportedModulesMap.getKeys(filePath)) === null || _a === void 0 ? void 0 : _a.forEach(function (exportedFromPath) {
return forEachFileAndExportsOfFile(state, exportedFromPath, seenFileAndExportsOfFile, fn);
});
// If exported from path is not from cache and exported modules has path, all files referencing file exported from are affected
(_b = state.exportedModulesMap.getKeys(filePath)) === null || _b === void 0 ? void 0 : _b.forEach(function (exportedFromPath) {
var _a;
// If the cache had an updated value, skip
return !state.currentAffectedFilesExportedModulesMap.hasKey(exportedFromPath) &&
!((_a = state.currentAffectedFilesExportedModulesMap.deletedKeys()) === null || _a === void 0 ? void 0 : _a.has(exportedFromPath)) &&
forEachFileAndExportsOfFile(state, exportedFromPath, seenFileAndExportsOfFile, fn);
});
// Remove diagnostics of files that import this file (without going to exports of referencing files)
(_c = state.referencedMap.getKeys(filePath)) === null || _c === void 0 ? void 0 : _c.forEach(function (referencingFilePath) {
return !seenFileAndExportsOfFile.has(referencingFilePath) && // Not already removed diagnostic file
fn(state, referencingFilePath);
} // Dont add to seen since this is not yet done with the export removal
);
}
/**
* This is called after completing operation on the next affected file.
* The operations here are postponed to ensure that cancellation during the iteration is handled correctly
*/
function doneWithAffectedFile(state, affected, emitKind, isPendingEmit, isBuildInfoEmit) {
if (isBuildInfoEmit) {
state.buildInfoEmitPending = false;
}
else if (affected === state.program) {
state.changedFilesSet.clear();
state.programEmitComplete = true;
}
else {
state.seenAffectedFiles.add(affected.resolvedPath);
if (emitKind !== undefined) {
(state.seenEmittedFiles || (state.seenEmittedFiles = new ts.Map())).set(affected.resolvedPath, emitKind);
}
if (isPendingEmit) {
state.affectedFilesPendingEmitIndex++;
state.buildInfoEmitPending = true;
}
else {
state.affectedFilesIndex++;
}
}
}
/**
* Returns the result with affected file
*/
function toAffectedFileResult(state, result, affected) {
doneWithAffectedFile(state, affected);
return { result: result, affected: affected };
}
/**
* Returns the result with affected file
*/
function toAffectedFileEmitResult(state, result, affected, emitKind, isPendingEmit, isBuildInfoEmit) {
doneWithAffectedFile(state, affected, emitKind, isPendingEmit, isBuildInfoEmit);
return { result: result, affected: affected };
}
/**
* Gets semantic diagnostics for the file which are
* bindAndCheckDiagnostics (from cache) and program diagnostics
*/
function getSemanticDiagnosticsOfFile(state, sourceFile, cancellationToken) {
return ts.concatenate(getBinderAndCheckerDiagnosticsOfFile(state, sourceFile, cancellationToken), ts.Debug.checkDefined(state.program).getProgramDiagnostics(sourceFile));
}
/**
* Gets the binder and checker diagnostics either from cache if present, or otherwise from program and caches it
* Note that it is assumed that when asked about binder and checker diagnostics, the file has been taken out of affected files/changed file set
*/
function getBinderAndCheckerDiagnosticsOfFile(state, sourceFile, cancellationToken) {
var path = sourceFile.resolvedPath;
if (state.semanticDiagnosticsPerFile) {
var cachedDiagnostics = state.semanticDiagnosticsPerFile.get(path);
// Report the bind and check diagnostics from the cache if we already have those diagnostics present
if (cachedDiagnostics) {
return ts.filterSemanticDiagnostics(cachedDiagnostics, state.compilerOptions);
}
}
// Diagnostics werent cached, get them from program, and cache the result
var diagnostics = ts.Debug.checkDefined(state.program).getBindAndCheckDiagnostics(sourceFile, cancellationToken);
if (state.semanticDiagnosticsPerFile) {
state.semanticDiagnosticsPerFile.set(path, diagnostics);
}
return ts.filterSemanticDiagnostics(diagnostics, state.compilerOptions);
}
/**
* Gets the program information to be emitted in buildInfo so that we can use it to create new program
*/
function getProgramBuildInfo(state, getCanonicalFileName) {
if (ts.outFile(state.compilerOptions))
return undefined;
var currentDirectory = ts.Debug.checkDefined(state.program).getCurrentDirectory();
var buildInfoDirectory = ts.getDirectoryPath(ts.getNormalizedAbsolutePath(ts.getTsBuildInfoEmitOutputFilePath(state.compilerOptions), currentDirectory));
var fileNames = [];
var fileNameToFileId = new ts.Map();
var fileIdsList;
var fileNamesToFileIdListId;
var fileInfos = ts.arrayFrom(state.fileInfos.entries(), function (_a) {
var key = _a[0], value = _a[1];
// Ensure fileId
var fileId = toFileId(key);
ts.Debug.assert(fileNames[fileId - 1] === relativeToBuildInfo(key));
var signature = state.currentAffectedFilesSignatures && state.currentAffectedFilesSignatures.get(key);
var actualSignature = signature !== null && signature !== void 0 ? signature : value.signature;
return value.version === actualSignature ?
value.affectsGlobalScope ?
{ version: value.version, signature: undefined, affectsGlobalScope: true } :
value.version :
actualSignature !== undefined ?
signature === undefined ?
value :
{ version: value.version, signature: signature, affectsGlobalScope: value.affectsGlobalScope } :
{ version: value.version, signature: false, affectsGlobalScope: value.affectsGlobalScope };
});
var referencedMap;
if (state.referencedMap) {
referencedMap = ts.arrayFrom(state.referencedMap.keys()).sort(ts.compareStringsCaseSensitive).map(function (key) { return [
toFileId(key),
toFileIdListId(state.referencedMap.getValues(key))
]; });
}
var exportedModulesMap;
if (state.exportedModulesMap) {
exportedModulesMap = ts.mapDefined(ts.arrayFrom(state.exportedModulesMap.keys()).sort(ts.compareStringsCaseSensitive), function (key) {
var _a;
if (state.currentAffectedFilesExportedModulesMap) {
if ((_a = state.currentAffectedFilesExportedModulesMap.deletedKeys()) === null || _a === void 0 ? void 0 : _a.has(key)) {
return undefined;
}
var newValue = state.currentAffectedFilesExportedModulesMap.getValues(key);
if (newValue) {
return [toFileId(key), toFileIdListId(newValue)];
}
}
// Not in temporary cache, use existing value
return [toFileId(key), toFileIdListId(state.exportedModulesMap.getValues(key))];
});
}
var semanticDiagnosticsPerFile;
if (state.semanticDiagnosticsPerFile) {
for (var _i = 0, _a = ts.arrayFrom(state.semanticDiagnosticsPerFile.keys()).sort(ts.compareStringsCaseSensitive); _i < _a.length; _i++) {
var key = _a[_i];
var value = state.semanticDiagnosticsPerFile.get(key);
(semanticDiagnosticsPerFile || (semanticDiagnosticsPerFile = [])).push(value.length ?
[
toFileId(key),
state.hasReusableDiagnostic ?
value :
convertToReusableDiagnostics(value, relativeToBuildInfo)
] :
toFileId(key));
}
}
var affectedFilesPendingEmit;
if (state.affectedFilesPendingEmit) {
var seenFiles = new ts.Set();
for (var _b = 0, _c = state.affectedFilesPendingEmit.slice(state.affectedFilesPendingEmitIndex).sort(ts.compareStringsCaseSensitive); _b < _c.length; _b++) {
var path = _c[_b];
if (ts.tryAddToSet(seenFiles, path)) {
(affectedFilesPendingEmit || (affectedFilesPendingEmit = [])).push([toFileId(path), state.affectedFilesPendingEmitKind.get(path)]);
}
}
}
return {
fileNames: fileNames,
fileInfos: fileInfos,
options: convertToProgramBuildInfoCompilerOptions(state.compilerOptions, relativeToBuildInfoEnsuringAbsolutePath),
fileIdsList: fileIdsList,
referencedMap: referencedMap,
exportedModulesMap: exportedModulesMap,
semanticDiagnosticsPerFile: semanticDiagnosticsPerFile,
affectedFilesPendingEmit: affectedFilesPendingEmit,
};
function relativeToBuildInfoEnsuringAbsolutePath(path) {
return relativeToBuildInfo(ts.getNormalizedAbsolutePath(path, currentDirectory));
}
function relativeToBuildInfo(path) {
return ts.ensurePathIsNonModuleName(ts.getRelativePathFromDirectory(buildInfoDirectory, path, getCanonicalFileName));
}
function toFileId(path) {
var fileId = fileNameToFileId.get(path);
if (fileId === undefined) {
fileNames.push(relativeToBuildInfo(path));
fileNameToFileId.set(path, fileId = fileNames.length);
}
return fileId;
}
function toFileIdListId(set) {
var fileIds = ts.arrayFrom(set.keys(), toFileId).sort(ts.compareValues);
var key = fileIds.join();
var fileIdListId = fileNamesToFileIdListId === null || fileNamesToFileIdListId === void 0 ? void 0 : fileNamesToFileIdListId.get(key);
if (fileIdListId === undefined) {
(fileIdsList || (fileIdsList = [])).push(fileIds);
(fileNamesToFileIdListId || (fileNamesToFileIdListId = new ts.Map())).set(key, fileIdListId = fileIdsList.length);
}
return fileIdListId;
}
}
function convertToProgramBuildInfoCompilerOptions(options, relativeToBuildInfo) {
var result;
var optionsNameMap = ts.getOptionsNameMap().optionsNameMap;
for (var _i = 0, _a = ts.getOwnKeys(options).sort(ts.compareStringsCaseSensitive); _i < _a.length; _i++) {
var name = _a[_i];
var optionKey = name.toLowerCase();
var optionInfo = optionsNameMap.get(optionKey);
if ((optionInfo === null || optionInfo === void 0 ? void 0 : optionInfo.affectsEmit) || (optionInfo === null || optionInfo === void 0 ? void 0 : optionInfo.affectsSemanticDiagnostics) ||
// We need to store `strict`, even though it won't be examined directly, so that the
// flags it controls (e.g. `strictNullChecks`) will be retrieved correctly from the buildinfo
optionKey === "strict" ||
// We need to store these to determine whether `lib` files need to be rechecked.
optionKey === "skiplibcheck" || optionKey === "skipdefaultlibcheck") {
(result || (result = {}))[name] = convertToReusableCompilerOptionValue(optionInfo, options[name], relativeToBuildInfo);
}
}
return result;
}
function convertToReusableCompilerOptionValue(option, value, relativeToBuildInfo) {
if (option) {
if (option.type === "list") {
var values = value;
if (option.element.isFilePath && values.length) {
return values.map(relativeToBuildInfo);
}
}
else if (option.isFilePath) {
return relativeToBuildInfo(value);
}
}
return value;
}
function convertToReusableDiagnostics(diagnostics, relativeToBuildInfo) {
ts.Debug.assert(!!diagnostics.length);
return diagnostics.map(function (diagnostic) {
var result = convertToReusableDiagnosticRelatedInformation(diagnostic, relativeToBuildInfo);
result.reportsUnnecessary = diagnostic.reportsUnnecessary;
result.reportDeprecated = diagnostic.reportsDeprecated;
result.source = diagnostic.source;
result.skippedOn = diagnostic.skippedOn;
var relatedInformation = diagnostic.relatedInformation;
result.relatedInformation = relatedInformation ?
relatedInformation.length ?
relatedInformation.map(function (r) { return convertToReusableDiagnosticRelatedInformation(r, relativeToBuildInfo); }) :
[] :
undefined;
return result;
});
}
function convertToReusableDiagnosticRelatedInformation(diagnostic, relativeToBuildInfo) {
var file = diagnostic.file;
return __assign(__assign({}, diagnostic), { file: file ? relativeToBuildInfo(file.resolvedPath) : undefined });
}
var BuilderProgramKind;
(function (BuilderProgramKind) {
BuilderProgramKind[BuilderProgramKind["SemanticDiagnosticsBuilderProgram"] = 0] = "SemanticDiagnosticsBuilderProgram";
BuilderProgramKind[BuilderProgramKind["EmitAndSemanticDiagnosticsBuilderProgram"] = 1] = "EmitAndSemanticDiagnosticsBuilderProgram";
})(BuilderProgramKind = ts.BuilderProgramKind || (ts.BuilderProgramKind = {}));
function getBuilderCreationParameters(newProgramOrRootNames, hostOrOptions, oldProgramOrHost, configFileParsingDiagnosticsOrOldProgram, configFileParsingDiagnostics, projectReferences) {
var host;
var newProgram;
var oldProgram;
if (newProgramOrRootNames === undefined) {
ts.Debug.assert(hostOrOptions === undefined);
host = oldProgramOrHost;
oldProgram = configFileParsingDiagnosticsOrOldProgram;
ts.Debug.assert(!!oldProgram);
newProgram = oldProgram.getProgram();
}
else if (ts.isArray(newProgramOrRootNames)) {
oldProgram = configFileParsingDiagnosticsOrOldProgram;
newProgram = ts.createProgram({
rootNames: newProgramOrRootNames,
options: hostOrOptions,
host: oldProgramOrHost,
oldProgram: oldProgram && oldProgram.getProgramOrUndefined(),
configFileParsingDiagnostics: configFileParsingDiagnostics,
projectReferences: projectReferences
});
host = oldProgramOrHost;
}
else {
newProgram = newProgramOrRootNames;
host = hostOrOptions;
oldProgram = oldProgramOrHost;
configFileParsingDiagnostics = configFileParsingDiagnosticsOrOldProgram;
}
return { host: host, newProgram: newProgram, oldProgram: oldProgram, configFileParsingDiagnostics: configFileParsingDiagnostics || ts.emptyArray };
}
ts.getBuilderCreationParameters = getBuilderCreationParameters;
function createBuilderProgram(kind, _a) {
var newProgram = _a.newProgram, host = _a.host, oldProgram = _a.oldProgram, configFileParsingDiagnostics = _a.configFileParsingDiagnostics;
// Return same program if underlying program doesnt change
var oldState = oldProgram && oldProgram.getState();
if (oldState && newProgram === oldState.program && configFileParsingDiagnostics === newProgram.getConfigFileParsingDiagnostics()) {
newProgram = undefined; // TODO: GH#18217
oldState = undefined;
return oldProgram;
}
/**
* Create the canonical file name for identity
*/
var getCanonicalFileName = ts.createGetCanonicalFileName(host.useCaseSensitiveFileNames());
/**
* Computing hash to for signature verification
*/
var computeHash = ts.maybeBind(host, host.createHash);
var state = createBuilderProgramState(newProgram, getCanonicalFileName, oldState, host.disableUseFileVersionAsSignature);
var backupState;
newProgram.getProgramBuildInfo = function () { return getProgramBuildInfo(state, getCanonicalFileName); };
// To ensure that we arent storing any references to old program or new program without state
newProgram = undefined; // TODO: GH#18217
oldProgram = undefined;
oldState = undefined;
var getState = function () { return state; };
var builderProgram = createRedirectedBuilderProgram(getState, configFileParsingDiagnostics);
builderProgram.getState = getState;
builderProgram.backupState = function () {
ts.Debug.assert(backupState === undefined);
backupState = cloneBuilderProgramState(state);
};
builderProgram.restoreState = function () {
state = ts.Debug.checkDefined(backupState);
backupState = undefined;
};
builderProgram.getAllDependencies = function (sourceFile) { return ts.BuilderState.getAllDependencies(state, ts.Debug.checkDefined(state.program), sourceFile); };
builderProgram.getSemanticDiagnostics = getSemanticDiagnostics;
builderProgram.emit = emit;
builderProgram.releaseProgram = function () {
releaseCache(state);
backupState = undefined;
};
if (kind === BuilderProgramKind.SemanticDiagnosticsBuilderProgram) {
builderProgram.getSemanticDiagnosticsOfNextAffectedFile = getSemanticDiagnosticsOfNextAffectedFile;
}
else if (kind === BuilderProgramKind.EmitAndSemanticDiagnosticsBuilderProgram) {
builderProgram.getSemanticDiagnosticsOfNextAffectedFile = getSemanticDiagnosticsOfNextAffectedFile;
builderProgram.emitNextAffectedFile = emitNextAffectedFile;
builderProgram.emitBuildInfo = emitBuildInfo;
}
else {
ts.notImplemented();
}
return builderProgram;
function emitBuildInfo(writeFile, cancellationToken) {
if (state.buildInfoEmitPending) {
var result = ts.Debug.checkDefined(state.program).emitBuildInfo(writeFile || ts.maybeBind(host, host.writeFile), cancellationToken);
state.buildInfoEmitPending = false;
return result;
}
return ts.emitSkippedWithNoDiagnostics;
}
/**
* Emits the next affected file's emit result (EmitResult and sourceFiles emitted) or returns undefined if iteration is complete
* The first of writeFile if provided, writeFile of BuilderProgramHost if provided, writeFile of compiler host
* in that order would be used to write the files
*/
function emitNextAffectedFile(writeFile, cancellationToken, emitOnlyDtsFiles, customTransformers) {
var affected = getNextAffectedFile(state, cancellationToken, computeHash);
var emitKind = 1 /* Full */;
var isPendingEmitFile = false;
if (!affected) {
if (!ts.outFile(state.compilerOptions)) {
var pendingAffectedFile = getNextAffectedFilePendingEmit(state);
if (!pendingAffectedFile) {
if (!state.buildInfoEmitPending) {
return undefined;
}
var affected_1 = ts.Debug.checkDefined(state.program);
return toAffectedFileEmitResult(state,
// When whole program is affected, do emit only once (eg when --out or --outFile is specified)
// Otherwise just affected file
affected_1.emitBuildInfo(writeFile || ts.maybeBind(host, host.writeFile), cancellationToken), affected_1, 1 /* Full */,
/*isPendingEmitFile*/ false,
/*isBuildInfoEmit*/ true);
}
(affected = pendingAffectedFile.affectedFile, emitKind = pendingAffectedFile.emitKind);
isPendingEmitFile = true;
}
else {
var program = ts.Debug.checkDefined(state.program);
if (state.programEmitComplete)
return undefined;
affected = program;
}
}
return toAffectedFileEmitResult(state,
// When whole program is affected, do emit only once (eg when --out or --outFile is specified)
// Otherwise just affected file
ts.Debug.checkDefined(state.program).emit(affected === state.program ? undefined : affected, writeFile || ts.maybeBind(host, host.writeFile), cancellationToken, emitOnlyDtsFiles || emitKind === 0 /* DtsOnly */, customTransformers), affected, emitKind, isPendingEmitFile);
}
/**
* Emits the JavaScript and declaration files.
* When targetSource file is specified, emits the files corresponding to that source file,
* otherwise for the whole program.
* In case of EmitAndSemanticDiagnosticsBuilderProgram, when targetSourceFile is specified,
* it is assumed that that file is handled from affected file list. If targetSourceFile is not specified,
* it will only emit all the affected files instead of whole program
*
* The first of writeFile if provided, writeFile of BuilderProgramHost if provided, writeFile of compiler host
* in that order would be used to write the files
*/
function emit(targetSourceFile, writeFile, cancellationToken, emitOnlyDtsFiles, customTransformers) {
var restorePendingEmitOnHandlingNoEmitSuccess = false;
var savedAffectedFilesPendingEmit;
var savedAffectedFilesPendingEmitKind;
var savedAffectedFilesPendingEmitIndex;
// Backup and restore affected pendings emit state for non emit Builder if noEmitOnError is enabled and emitBuildInfo could be written in case there are errors
// This ensures pending files to emit is updated in tsbuildinfo
// Note that when there are no errors, emit proceeds as if everything is emitted as it is callers reponsibility to write the files to disk if at all (because its builder that doesnt track files to emit)
if (kind !== BuilderProgramKind.EmitAndSemanticDiagnosticsBuilderProgram &&
!targetSourceFile &&
!ts.outFile(state.compilerOptions) &&
!state.compilerOptions.noEmit &&
state.compilerOptions.noEmitOnError) {
restorePendingEmitOnHandlingNoEmitSuccess = true;
savedAffectedFilesPendingEmit = state.affectedFilesPendingEmit && state.affectedFilesPendingEmit.slice();
savedAffectedFilesPendingEmitKind = state.affectedFilesPendingEmitKind && new ts.Map(state.affectedFilesPendingEmitKind);
savedAffectedFilesPendingEmitIndex = state.affectedFilesPendingEmitIndex;
}
if (kind === BuilderProgramKind.EmitAndSemanticDiagnosticsBuilderProgram) {
assertSourceFileOkWithoutNextAffectedCall(state, targetSourceFile);
}
var result = ts.handleNoEmitOptions(builderProgram, targetSourceFile, writeFile, cancellationToken);
if (result)
return result;
if (restorePendingEmitOnHandlingNoEmitSuccess) {
state.affectedFilesPendingEmit = savedAffectedFilesPendingEmit;
state.affectedFilesPendingEmitKind = savedAffectedFilesPendingEmitKind;
state.affectedFilesPendingEmitIndex = savedAffectedFilesPendingEmitIndex;
}
// Emit only affected files if using builder for emit
if (!targetSourceFile && kind === BuilderProgramKind.EmitAndSemanticDiagnosticsBuilderProgram) {
// Emit and report any errors we ran into.
var sourceMaps = [];
var emitSkipped = false;
var diagnostics = void 0;
var emittedFiles = [];
var affectedEmitResult = void 0;
while (affectedEmitResult = emitNextAffectedFile(writeFile, cancellationToken, emitOnlyDtsFiles, customTransformers)) {
emitSkipped = emitSkipped || affectedEmitResult.result.emitSkipped;
diagnostics = ts.addRange(diagnostics, affectedEmitResult.result.diagnostics);
emittedFiles = ts.addRange(emittedFiles, affectedEmitResult.result.emittedFiles);
sourceMaps = ts.addRange(sourceMaps, affectedEmitResult.result.sourceMaps);
}
return {
emitSkipped: emitSkipped,
diagnostics: diagnostics || ts.emptyArray,
emittedFiles: emittedFiles,
sourceMaps: sourceMaps
};
}
return ts.Debug.checkDefined(state.program).emit(targetSourceFile, writeFile || ts.maybeBind(host, host.writeFile), cancellationToken, emitOnlyDtsFiles, customTransformers);
}
/**
* Return the semantic diagnostics for the next affected file or undefined if iteration is complete
* If provided ignoreSourceFile would be called before getting the diagnostics and would ignore the sourceFile if the returned value was true
*/
function getSemanticDiagnosticsOfNextAffectedFile(cancellationToken, ignoreSourceFile) {
while (true) {
var affected = getNextAffectedFile(state, cancellationToken, computeHash);
if (!affected) {
// Done
return undefined;
}
else if (affected === state.program) {
// When whole program is affected, get all semantic diagnostics (eg when --out or --outFile is specified)
return toAffectedFileResult(state, state.program.getSemanticDiagnostics(/*targetSourceFile*/ undefined, cancellationToken), affected);
}
// Add file to affected file pending emit to handle for later emit time
// Apart for emit builder do this for tsbuildinfo, do this for non emit builder when noEmit is set as tsbuildinfo is written and reused between emitters
if (kind === BuilderProgramKind.EmitAndSemanticDiagnosticsBuilderProgram || state.compilerOptions.noEmit || state.compilerOptions.noEmitOnError) {
addToAffectedFilesPendingEmit(state, affected.resolvedPath, 1 /* Full */);
}
// Get diagnostics for the affected file if its not ignored
if (ignoreSourceFile && ignoreSourceFile(affected)) {
// Get next affected file
doneWithAffectedFile(state, affected);
continue;
}
return toAffectedFileResult(state, getSemanticDiagnosticsOfFile(state, affected, cancellationToken), affected);
}
}
/**
* Gets the semantic diagnostics from the program corresponding to this state of file (if provided) or whole program
* The semantic diagnostics are cached and managed here
* Note that it is assumed that when asked about semantic diagnostics through this API,
* the file has been taken out of affected files so it is safe to use cache or get from program and cache the diagnostics
* In case of SemanticDiagnosticsBuilderProgram if the source file is not provided,
* it will iterate through all the affected files, to ensure that cache stays valid and yet provide a way to get all semantic diagnostics
*/
function getSemanticDiagnostics(sourceFile, cancellationToken) {
assertSourceFileOkWithoutNextAffectedCall(state, sourceFile);
var compilerOptions = ts.Debug.checkDefined(state.program).getCompilerOptions();
if (ts.outFile(compilerOptions)) {
ts.Debug.assert(!state.semanticDiagnosticsPerFile);
// We dont need to cache the diagnostics just return them from program
return ts.Debug.checkDefined(state.program).getSemanticDiagnostics(sourceFile, cancellationToken);
}
if (sourceFile) {
return getSemanticDiagnosticsOfFile(state, sourceFile, cancellationToken);
}
// When semantic builder asks for diagnostics of the whole program,
// ensure that all the affected files are handled
// eslint-disable-next-line no-empty
while (getSemanticDiagnosticsOfNextAffectedFile(cancellationToken)) {
}
var diagnostics;
for (var _i = 0, _a = ts.Debug.checkDefined(state.program).getSourceFiles(); _i < _a.length; _i++) {
var sourceFile_1 = _a[_i];
diagnostics = ts.addRange(diagnostics, getSemanticDiagnosticsOfFile(state, sourceFile_1, cancellationToken));
}
return diagnostics || ts.emptyArray;
}
}
ts.createBuilderProgram = createBuilderProgram;
function addToAffectedFilesPendingEmit(state, affectedFilePendingEmit, kind) {
if (!state.affectedFilesPendingEmit)
state.affectedFilesPendingEmit = [];
if (!state.affectedFilesPendingEmitKind)
state.affectedFilesPendingEmitKind = new ts.Map();
var existingKind = state.affectedFilesPendingEmitKind.get(affectedFilePendingEmit);
state.affectedFilesPendingEmit.push(affectedFilePendingEmit);
state.affectedFilesPendingEmitKind.set(affectedFilePendingEmit, existingKind || kind);
// affectedFilesPendingEmitIndex === undefined
// - means the emit state.affectedFilesPendingEmit was undefined before adding current affected files
// so start from 0 as array would be affectedFilesPendingEmit
// else, continue to iterate from existing index, the current set is appended to existing files
if (state.affectedFilesPendingEmitIndex === undefined) {
state.affectedFilesPendingEmitIndex = 0;
}
}
function toBuilderStateFileInfo(fileInfo) {
return ts.isString(fileInfo) ?
{ version: fileInfo, signature: fileInfo, affectsGlobalScope: undefined } :
ts.isString(fileInfo.signature) ?
fileInfo :
{ version: fileInfo.version, signature: fileInfo.signature === false ? undefined : fileInfo.version, affectsGlobalScope: fileInfo.affectsGlobalScope };
}
ts.toBuilderStateFileInfo = toBuilderStateFileInfo;
function createBuildProgramUsingProgramBuildInfo(program, buildInfoPath, host) {
var _a;
var buildInfoDirectory = ts.getDirectoryPath(ts.getNormalizedAbsolutePath(buildInfoPath, host.getCurrentDirectory()));
var getCanonicalFileName = ts.createGetCanonicalFileName(host.useCaseSensitiveFileNames());
var filePaths = program.fileNames.map(toPath);
var filePathsSetList = (_a = program.fileIdsList) === null || _a === void 0 ? void 0 : _a.map(function (fileIds) { return new ts.Set(fileIds.map(toFilePath)); });
var fileInfos = new ts.Map();
program.fileInfos.forEach(function (fileInfo, index) { return fileInfos.set(toFilePath(index + 1), toBuilderStateFileInfo(fileInfo)); });
var state = {
fileInfos: fileInfos,
compilerOptions: program.options ? ts.convertToOptionsWithAbsolutePaths(program.options, toAbsolutePath) : {},
referencedMap: toManyToManyPathMap(program.referencedMap),
exportedModulesMap: toManyToManyPathMap(program.exportedModulesMap),
semanticDiagnosticsPerFile: program.semanticDiagnosticsPerFile && ts.arrayToMap(program.semanticDiagnosticsPerFile, function (value) { return toFilePath(ts.isNumber(value) ? value : value[0]); }, function (value) { return ts.isNumber(value) ? ts.emptyArray : value[1]; }),
hasReusableDiagnostic: true,
affectedFilesPendingEmit: ts.map(program.affectedFilesPendingEmit, function (value) { return toFilePath(value[0]); }),
affectedFilesPendingEmitKind: program.affectedFilesPendingEmit && ts.arrayToMap(program.affectedFilesPendingEmit, function (value) { return toFilePath(value[0]); }, function (value) { return value[1]; }),
affectedFilesPendingEmitIndex: program.affectedFilesPendingEmit && 0,
};
return {
getState: function () { return state; },
backupState: ts.noop,
restoreState: ts.noop,
getProgram: ts.notImplemented,
getProgramOrUndefined: ts.returnUndefined,
releaseProgram: ts.noop,
getCompilerOptions: function () { return state.compilerOptions; },
getSourceFile: ts.notImplemented,
getSourceFiles: ts.notImplemented,
getOptionsDiagnostics: ts.notImplemented,
getGlobalDiagnostics: ts.notImplemented,
getConfigFileParsingDiagnostics: ts.notImplemented,
getSyntacticDiagnostics: ts.notImplemented,
getDeclarationDiagnostics: ts.notImplemented,
getSemanticDiagnostics: ts.notImplemented,
emit: ts.notImplemented,
getAllDependencies: ts.notImplemented,
getCurrentDirectory: ts.notImplemented,
emitNextAffectedFile: ts.notImplemented,
getSemanticDiagnosticsOfNextAffectedFile: ts.notImplemented,
emitBuildInfo: ts.notImplemented,
close: ts.noop,
};
function toPath(path) {
return ts.toPath(path, buildInfoDirectory, getCanonicalFileName);
}
function toAbsolutePath(path) {
return ts.getNormalizedAbsolutePath(path, buildInfoDirectory);
}
function toFilePath(fileId) {
return filePaths[fileId - 1];
}
function toFilePathsSet(fileIdsListId) {
return filePathsSetList[fileIdsListId - 1];
}
function toManyToManyPathMap(referenceMap) {
if (!referenceMap) {
return undefined;
}
var map = ts.BuilderState.createManyToManyPathMap();
referenceMap.forEach(function (_a) {
var fileId = _a[0], fileIdListId = _a[1];
return map.set(toFilePath(fileId), toFilePathsSet(fileIdListId));
});
return map;
}
}
ts.createBuildProgramUsingProgramBuildInfo = createBuildProgramUsingProgramBuildInfo;
function createRedirectedBuilderProgram(getState, configFileParsingDiagnostics) {
return {
getState: ts.notImplemented,
backupState: ts.noop,
restoreState: ts.noop,
getProgram: getProgram,
getProgramOrUndefined: function () { return getState().program; },
releaseProgram: function () { return getState().program = undefined; },
getCompilerOptions: function () { return getState().compilerOptions; },
getSourceFile: function (fileName) { return getProgram().getSourceFile(fileName); },
getSourceFiles: function () { return getProgram().getSourceFiles(); },
getOptionsDiagnostics: function (cancellationToken) { return getProgram().getOptionsDiagnostics(cancellationToken); },
getGlobalDiagnostics: function (cancellationToken) { return getProgram().getGlobalDiagnostics(cancellationToken); },
getConfigFileParsingDiagnostics: function () { return configFileParsingDiagnostics; },
getSyntacticDiagnostics: function (sourceFile, cancellationToken) { return getProgram().getSyntacticDiagnostics(sourceFile, cancellationToken); },
getDeclarationDiagnostics: function (sourceFile, cancellationToken) { return getProgram().getDeclarationDiagnostics(sourceFile, cancellationToken); },
getSemanticDiagnostics: function (sourceFile, cancellationToken) { return getProgram().getSemanticDiagnostics(sourceFile, cancellationToken); },
emit: function (sourceFile, writeFile, cancellationToken, emitOnlyDts, customTransformers) { return getProgram().emit(sourceFile, writeFile, cancellationToken, emitOnlyDts, customTransformers); },
emitBuildInfo: function (writeFile, cancellationToken) { return getProgram().emitBuildInfo(writeFile, cancellationToken); },
getAllDependencies: ts.notImplemented,
getCurrentDirectory: function () { return getProgram().getCurrentDirectory(); },
close: ts.noop,
};
function getProgram() {
return ts.Debug.checkDefined(getState().program);
}
}
ts.createRedirectedBuilderProgram = createRedirectedBuilderProgram;
})(ts || (ts = {}));
var ts;
(function (ts) {
function createSemanticDiagnosticsBuilderProgram(newProgramOrRootNames, hostOrOptions, oldProgramOrHost, configFileParsingDiagnosticsOrOldProgram, configFileParsingDiagnostics, projectReferences) {
return ts.createBuilderProgram(ts.BuilderProgramKind.SemanticDiagnosticsBuilderProgram, ts.getBuilderCreationParameters(newProgramOrRootNames, hostOrOptions, oldProgramOrHost, configFileParsingDiagnosticsOrOldProgram, configFileParsingDiagnostics, projectReferences));
}
ts.createSemanticDiagnosticsBuilderProgram = createSemanticDiagnosticsBuilderProgram;
function createEmitAndSemanticDiagnosticsBuilderProgram(newProgramOrRootNames, hostOrOptions, oldProgramOrHost, configFileParsingDiagnosticsOrOldProgram, configFileParsingDiagnostics, projectReferences) {
return ts.createBuilderProgram(ts.BuilderProgramKind.EmitAndSemanticDiagnosticsBuilderProgram, ts.getBuilderCreationParameters(newProgramOrRootNames, hostOrOptions, oldProgramOrHost, configFileParsingDiagnosticsOrOldProgram, configFileParsingDiagnostics, projectReferences));
}
ts.createEmitAndSemanticDiagnosticsBuilderProgram = createEmitAndSemanticDiagnosticsBuilderProgram;
function createAbstractBuilder(newProgramOrRootNames, hostOrOptions, oldProgramOrHost, configFileParsingDiagnosticsOrOldProgram, configFileParsingDiagnostics, projectReferences) {
var _a = ts.getBuilderCreationParameters(newProgramOrRootNames, hostOrOptions, oldProgramOrHost, configFileParsingDiagnosticsOrOldProgram, configFileParsingDiagnostics, projectReferences), newProgram = _a.newProgram, newConfigFileParsingDiagnostics = _a.configFileParsingDiagnostics;
return ts.createRedirectedBuilderProgram(function () { return ({ program: newProgram, compilerOptions: newProgram.getCompilerOptions() }); }, newConfigFileParsingDiagnostics);
}
ts.createAbstractBuilder = createAbstractBuilder;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
function removeIgnoredPath(path) {
// Consider whole staging folder as if node_modules changed.
if (ts.endsWith(path, "/node_modules/.staging")) {
return ts.removeSuffix(path, "/.staging");
}
return ts.some(ts.ignoredPaths, function (searchPath) { return ts.stringContains(path, searchPath); }) ?
undefined :
path;
}
ts.removeIgnoredPath = removeIgnoredPath;
/**
* Filter out paths like
* "/", "/user", "/user/username", "/user/username/folderAtRoot",
* "c:/", "c:/users", "c:/users/username", "c:/users/username/folderAtRoot", "c:/folderAtRoot"
* @param dirPath
*/
function canWatchDirectory(dirPath) {
var rootLength = ts.getRootLength(dirPath);
if (dirPath.length === rootLength) {
// Ignore "/", "c:/"
return false;
}
var nextDirectorySeparator = dirPath.indexOf(ts.directorySeparator, rootLength);
if (nextDirectorySeparator === -1) {
// ignore "/user", "c:/users" or "c:/folderAtRoot"
return false;
}
var pathPartForUserCheck = dirPath.substring(rootLength, nextDirectorySeparator + 1);
var isNonDirectorySeparatorRoot = rootLength > 1 || dirPath.charCodeAt(0) !== 47 /* slash */;
if (isNonDirectorySeparatorRoot &&
dirPath.search(/[a-zA-Z]:/) !== 0 && // Non dos style paths
pathPartForUserCheck.search(/[a-zA-z]\$\//) === 0) { // Dos style nextPart
nextDirectorySeparator = dirPath.indexOf(ts.directorySeparator, nextDirectorySeparator + 1);
if (nextDirectorySeparator === -1) {
// ignore "//vda1cs4850/c$/folderAtRoot"
return false;
}
pathPartForUserCheck = dirPath.substring(rootLength + pathPartForUserCheck.length, nextDirectorySeparator + 1);
}
if (isNonDirectorySeparatorRoot &&
pathPartForUserCheck.search(/users\//i) !== 0) {
// Paths like c:/folderAtRoot/subFolder are allowed
return true;
}
for (var searchIndex = nextDirectorySeparator + 1, searchLevels = 2; searchLevels > 0; searchLevels--) {
searchIndex = dirPath.indexOf(ts.directorySeparator, searchIndex) + 1;
if (searchIndex === 0) {
// Folder isnt at expected minimum levels
return false;
}
}
return true;
}
ts.canWatchDirectory = canWatchDirectory;
function createResolutionCache(resolutionHost, rootDirForResolution, logChangesWhenResolvingModule) {
var filesWithChangedSetOfUnresolvedImports;
var filesWithInvalidatedResolutions;
var filesWithInvalidatedNonRelativeUnresolvedImports;
var nonRelativeExternalModuleResolutions = ts.createMultiMap();
var resolutionsWithFailedLookups = [];
var resolvedFileToResolution = ts.createMultiMap();
var hasChangedAutomaticTypeDirectiveNames = false;
var failedLookupChecks;
var startsWithPathChecks;
var isInDirectoryChecks;
var getCurrentDirectory = ts.memoize(function () { return resolutionHost.getCurrentDirectory(); }); // TODO: GH#18217
var cachedDirectoryStructureHost = resolutionHost.getCachedDirectoryStructureHost();
// The resolvedModuleNames and resolvedTypeReferenceDirectives are the cache of resolutions per file.
// The key in the map is source file's path.
// The values are Map of resolutions with key being name lookedup.
var resolvedModuleNames = new ts.Map();
var perDirectoryResolvedModuleNames = ts.createCacheWithRedirects();
var nonRelativeModuleNameCache = ts.createCacheWithRedirects();
var moduleResolutionCache = ts.createModuleResolutionCache(getCurrentDirectory(), resolutionHost.getCanonicalFileName,
/*options*/ undefined, perDirectoryResolvedModuleNames, nonRelativeModuleNameCache);
var resolvedTypeReferenceDirectives = new ts.Map();
var perDirectoryResolvedTypeReferenceDirectives = ts.createCacheWithRedirects();
var typeReferenceDirectiveResolutionCache = ts.createTypeReferenceDirectiveResolutionCache(getCurrentDirectory(), resolutionHost.getCanonicalFileName,
/*options*/ undefined, moduleResolutionCache.getPackageJsonInfoCache(), perDirectoryResolvedTypeReferenceDirectives);
/**
* These are the extensions that failed lookup files will have by default,
* any other extension of failed lookup will be store that path in custom failed lookup path
* This helps in not having to comb through all resolutions when files are added/removed
* Note that .d.ts file also has .d.ts extension hence will be part of default extensions
*/
var failedLookupDefaultExtensions = [".ts" /* Ts */, ".tsx" /* Tsx */, ".js" /* Js */, ".jsx" /* Jsx */, ".json" /* Json */];
var customFailedLookupPaths = new ts.Map();
var directoryWatchesOfFailedLookups = new ts.Map();
var rootDir = rootDirForResolution && ts.removeTrailingDirectorySeparator(ts.getNormalizedAbsolutePath(rootDirForResolution, getCurrentDirectory()));
var rootPath = (rootDir && resolutionHost.toPath(rootDir)); // TODO: GH#18217
var rootSplitLength = rootPath !== undefined ? rootPath.split(ts.directorySeparator).length : 0;
// TypeRoot watches for the types that get added as part of getAutomaticTypeDirectiveNames
var typeRootsWatches = new ts.Map();
return {
getModuleResolutionCache: function () { return moduleResolutionCache; },
startRecordingFilesWithChangedResolutions: startRecordingFilesWithChangedResolutions,
finishRecordingFilesWithChangedResolutions: finishRecordingFilesWithChangedResolutions,
// perDirectoryResolvedModuleNames and perDirectoryResolvedTypeReferenceDirectives could be non empty if there was exception during program update
// (between startCachingPerDirectoryResolution and finishCachingPerDirectoryResolution)
startCachingPerDirectoryResolution: clearPerDirectoryResolutions,
finishCachingPerDirectoryResolution: finishCachingPerDirectoryResolution,
resolveModuleNames: resolveModuleNames,
getResolvedModuleWithFailedLookupLocationsFromCache: getResolvedModuleWithFailedLookupLocationsFromCache,
resolveTypeReferenceDirectives: resolveTypeReferenceDirectives,
removeResolutionsFromProjectReferenceRedirects: removeResolutionsFromProjectReferenceRedirects,
removeResolutionsOfFile: removeResolutionsOfFile,
hasChangedAutomaticTypeDirectiveNames: function () { return hasChangedAutomaticTypeDirectiveNames; },
invalidateResolutionOfFile: invalidateResolutionOfFile,
invalidateResolutionsOfFailedLookupLocations: invalidateResolutionsOfFailedLookupLocations,
setFilesWithInvalidatedNonRelativeUnresolvedImports: setFilesWithInvalidatedNonRelativeUnresolvedImports,
createHasInvalidatedResolution: createHasInvalidatedResolution,
isFileWithInvalidatedNonRelativeUnresolvedImports: isFileWithInvalidatedNonRelativeUnresolvedImports,
updateTypeRootsWatch: updateTypeRootsWatch,
closeTypeRootsWatch: closeTypeRootsWatch,
clear: clear
};
function getResolvedModule(resolution) {
return resolution.resolvedModule;
}
function getResolvedTypeReferenceDirective(resolution) {
return resolution.resolvedTypeReferenceDirective;
}
function isInDirectoryPath(dir, file) {
if (dir === undefined || file.length <= dir.length) {
return false;
}
return ts.startsWith(file, dir) && file[dir.length] === ts.directorySeparator;
}
function clear() {
ts.clearMap(directoryWatchesOfFailedLookups, ts.closeFileWatcherOf);
customFailedLookupPaths.clear();
nonRelativeExternalModuleResolutions.clear();
closeTypeRootsWatch();
resolvedModuleNames.clear();
resolvedTypeReferenceDirectives.clear();
resolvedFileToResolution.clear();
resolutionsWithFailedLookups.length = 0;
failedLookupChecks = undefined;
startsWithPathChecks = undefined;
isInDirectoryChecks = undefined;
// perDirectoryResolvedModuleNames and perDirectoryResolvedTypeReferenceDirectives could be non empty if there was exception during program update
// (between startCachingPerDirectoryResolution and finishCachingPerDirectoryResolution)
clearPerDirectoryResolutions();
hasChangedAutomaticTypeDirectiveNames = false;
}
function startRecordingFilesWithChangedResolutions() {
filesWithChangedSetOfUnresolvedImports = [];
}
function finishRecordingFilesWithChangedResolutions() {
var collected = filesWithChangedSetOfUnresolvedImports;
filesWithChangedSetOfUnresolvedImports = undefined;
return collected;
}
function isFileWithInvalidatedNonRelativeUnresolvedImports(path) {
if (!filesWithInvalidatedNonRelativeUnresolvedImports) {
return false;
}
// Invalidated if file has unresolved imports
var value = filesWithInvalidatedNonRelativeUnresolvedImports.get(path);
return !!value && !!value.length;
}
function createHasInvalidatedResolution(forceAllFilesAsInvalidated) {
// Ensure pending resolutions are applied
invalidateResolutionsOfFailedLookupLocations();
if (forceAllFilesAsInvalidated) {
// Any file asked would have invalidated resolution
filesWithInvalidatedResolutions = undefined;
return ts.returnTrue;
}
var collected = filesWithInvalidatedResolutions;
filesWithInvalidatedResolutions = undefined;
return function (path) { return (!!collected && collected.has(path)) ||
isFileWithInvalidatedNonRelativeUnresolvedImports(path); };
}
function clearPerDirectoryResolutions() {
moduleResolutionCache.clear();
typeReferenceDirectiveResolutionCache.clear();
nonRelativeExternalModuleResolutions.forEach(watchFailedLookupLocationOfNonRelativeModuleResolutions);
nonRelativeExternalModuleResolutions.clear();
}
function finishCachingPerDirectoryResolution() {
filesWithInvalidatedNonRelativeUnresolvedImports = undefined;
clearPerDirectoryResolutions();
directoryWatchesOfFailedLookups.forEach(function (watcher, path) {
if (watcher.refCount === 0) {
directoryWatchesOfFailedLookups.delete(path);
watcher.watcher.close();
}
});
hasChangedAutomaticTypeDirectiveNames = false;
}
function resolveModuleName(moduleName, containingFile, compilerOptions, host, redirectedReference) {
var _a;
var primaryResult = ts.resolveModuleName(moduleName, containingFile, compilerOptions, host, moduleResolutionCache, redirectedReference);
// return result immediately only if global cache support is not enabled or if it is .ts, .tsx or .d.ts
if (!resolutionHost.getGlobalCache) {
return primaryResult;
}
// otherwise try to load typings from @types
var globalCache = resolutionHost.getGlobalCache();
if (globalCache !== undefined && !ts.isExternalModuleNameRelative(moduleName) && !(primaryResult.resolvedModule && ts.extensionIsTS(primaryResult.resolvedModule.extension))) {
// create different collection of failed lookup locations for second pass
// if it will fail and we've already found something during the first pass - we don't want to pollute its results
var _b = ts.loadModuleFromGlobalCache(ts.Debug.checkDefined(resolutionHost.globalCacheResolutionModuleName)(moduleName), resolutionHost.projectName, compilerOptions, host, globalCache, moduleResolutionCache), resolvedModule = _b.resolvedModule, failedLookupLocations = _b.failedLookupLocations;
if (resolvedModule) {
// Modify existing resolution so its saved in the directory cache as well
primaryResult.resolvedModule = resolvedModule;
(_a = primaryResult.failedLookupLocations).push.apply(_a, failedLookupLocations);
return primaryResult;
}
}
// Default return the result from the first pass
return primaryResult;
}
function resolveTypeReferenceDirective(typeReferenceDirectiveName, containingFile, options, host, redirectedReference) {
return ts.resolveTypeReferenceDirective(typeReferenceDirectiveName, containingFile, options, host, redirectedReference, typeReferenceDirectiveResolutionCache);
}
function resolveNamesWithLocalCache(_a) {
var _b, _c, _d;
var names = _a.names, containingFile = _a.containingFile, redirectedReference = _a.redirectedReference, cache = _a.cache, perDirectoryCacheWithRedirects = _a.perDirectoryCacheWithRedirects, loader = _a.loader, getResolutionWithResolvedFileName = _a.getResolutionWithResolvedFileName, shouldRetryResolution = _a.shouldRetryResolution, reusedNames = _a.reusedNames, logChanges = _a.logChanges;
var path = resolutionHost.toPath(containingFile);
var resolutionsInFile = cache.get(path) || cache.set(path, new ts.Map()).get(path);
var dirPath = ts.getDirectoryPath(path);
var perDirectoryCache = perDirectoryCacheWithRedirects.getOrCreateMapOfCacheRedirects(redirectedReference);
var perDirectoryResolution = perDirectoryCache.get(dirPath);
if (!perDirectoryResolution) {
perDirectoryResolution = new ts.Map();
perDirectoryCache.set(dirPath, perDirectoryResolution);
}
var resolvedModules = [];
var compilerOptions = resolutionHost.getCompilationSettings();
var hasInvalidatedNonRelativeUnresolvedImport = logChanges && isFileWithInvalidatedNonRelativeUnresolvedImports(path);
// All the resolutions in this file are invalidated if this file wasn't resolved using same redirect
var program = resolutionHost.getCurrentProgram();
var oldRedirect = program && program.getResolvedProjectReferenceToRedirect(containingFile);
var unmatchedRedirects = oldRedirect ?
!redirectedReference || redirectedReference.sourceFile.path !== oldRedirect.sourceFile.path :
!!redirectedReference;
var seenNamesInFile = new ts.Map();
for (var _i = 0, names_3 = names; _i < names_3.length; _i++) {
var name = names_3[_i];
var resolution = resolutionsInFile.get(name);
// Resolution is valid if it is present and not invalidated
if (!seenNamesInFile.has(name) &&
unmatchedRedirects || !resolution || resolution.isInvalidated ||
// If the name is unresolved import that was invalidated, recalculate
(hasInvalidatedNonRelativeUnresolvedImport && !ts.isExternalModuleNameRelative(name) && shouldRetryResolution(resolution))) {
var existingResolution = resolution;
var resolutionInDirectory = perDirectoryResolution.get(name);
if (resolutionInDirectory) {
resolution = resolutionInDirectory;
var host = ((_b = resolutionHost.getCompilerHost) === null || _b === void 0 ? void 0 : _b.call(resolutionHost)) || resolutionHost;
if (ts.isTraceEnabled(compilerOptions, host)) {
var resolved = getResolutionWithResolvedFileName(resolution);
ts.trace(host, loader === resolveModuleName ?
(resolved === null || resolved === void 0 ? void 0 : resolved.resolvedFileName) ?
resolved.packagetId ?
ts.Diagnostics.Reusing_resolution_of_module_0_from_1_found_in_cache_from_location_2_it_was_successfully_resolved_to_3_with_Package_ID_4 :
ts.Diagnostics.Reusing_resolution_of_module_0_from_1_found_in_cache_from_location_2_it_was_successfully_resolved_to_3 :
ts.Diagnostics.Reusing_resolution_of_module_0_from_1_found_in_cache_from_location_2_it_was_not_resolved :
(resolved === null || resolved === void 0 ? void 0 : resolved.resolvedFileName) ?
resolved.packagetId ?
ts.Diagnostics.Reusing_resolution_of_type_reference_directive_0_from_1_found_in_cache_from_location_2_it_was_successfully_resolved_to_3_with_Package_ID_4 :
ts.Diagnostics.Reusing_resolution_of_type_reference_directive_0_from_1_found_in_cache_from_location_2_it_was_successfully_resolved_to_3 :
ts.Diagnostics.Reusing_resolution_of_type_reference_directive_0_from_1_found_in_cache_from_location_2_it_was_not_resolved, name, containingFile, ts.getDirectoryPath(containingFile), resolved === null || resolved === void 0 ? void 0 : resolved.resolvedFileName, (resolved === null || resolved === void 0 ? void 0 : resolved.packagetId) && ts.packageIdToString(resolved.packagetId));
}
}
else {
resolution = loader(name, containingFile, compilerOptions, ((_c = resolutionHost.getCompilerHost) === null || _c === void 0 ? void 0 : _c.call(resolutionHost)) || resolutionHost, redirectedReference);
perDirectoryResolution.set(name, resolution);
}
resolutionsInFile.set(name, resolution);
watchFailedLookupLocationsOfExternalModuleResolutions(name, resolution, path, getResolutionWithResolvedFileName);
if (existingResolution) {
stopWatchFailedLookupLocationOfResolution(existingResolution, path, getResolutionWithResolvedFileName);
}
if (logChanges && filesWithChangedSetOfUnresolvedImports && !resolutionIsEqualTo(existingResolution, resolution)) {
filesWithChangedSetOfUnresolvedImports.push(path);
// reset log changes to avoid recording the same file multiple times
logChanges = false;
}
}
else {
var host = ((_d = resolutionHost.getCompilerHost) === null || _d === void 0 ? void 0 : _d.call(resolutionHost)) || resolutionHost;
if (ts.isTraceEnabled(compilerOptions, host) && !seenNamesInFile.has(name)) {
var resolved = getResolutionWithResolvedFileName(resolution);
ts.trace(host, loader === resolveModuleName ?
(resolved === null || resolved === void 0 ? void 0 : resolved.resolvedFileName) ?
resolved.packagetId ?
ts.Diagnostics.Reusing_resolution_of_module_0_from_1_of_old_program_it_was_successfully_resolved_to_2_with_Package_ID_3 :
ts.Diagnostics.Reusing_resolution_of_module_0_from_1_of_old_program_it_was_successfully_resolved_to_2 :
ts.Diagnostics.Reusing_resolution_of_module_0_from_1_of_old_program_it_was_not_resolved :
(resolved === null || resolved === void 0 ? void 0 : resolved.resolvedFileName) ?
resolved.packagetId ?
ts.Diagnostics.Reusing_resolution_of_type_reference_directive_0_from_1_of_old_program_it_was_successfully_resolved_to_2_with_Package_ID_3 :
ts.Diagnostics.Reusing_resolution_of_type_reference_directive_0_from_1_of_old_program_it_was_successfully_resolved_to_2 :
ts.Diagnostics.Reusing_resolution_of_type_reference_directive_0_from_1_of_old_program_it_was_not_resolved, name, containingFile, resolved === null || resolved === void 0 ? void 0 : resolved.resolvedFileName, (resolved === null || resolved === void 0 ? void 0 : resolved.packagetId) && ts.packageIdToString(resolved.packagetId));
}
}
ts.Debug.assert(resolution !== undefined && !resolution.isInvalidated);
seenNamesInFile.set(name, true);
resolvedModules.push(getResolutionWithResolvedFileName(resolution));
}
// Stop watching and remove the unused name
resolutionsInFile.forEach(function (resolution, name) {
if (!seenNamesInFile.has(name) && !ts.contains(reusedNames, name)) {
stopWatchFailedLookupLocationOfResolution(resolution, path, getResolutionWithResolvedFileName);
resolutionsInFile.delete(name);
}
});
return resolvedModules;
function resolutionIsEqualTo(oldResolution, newResolution) {
if (oldResolution === newResolution) {
return true;
}
if (!oldResolution || !newResolution) {
return false;
}
var oldResult = getResolutionWithResolvedFileName(oldResolution);
var newResult = getResolutionWithResolvedFileName(newResolution);
if (oldResult === newResult) {
return true;
}
if (!oldResult || !newResult) {
return false;
}
return oldResult.resolvedFileName === newResult.resolvedFileName;
}
}
function resolveTypeReferenceDirectives(typeDirectiveNames, containingFile, redirectedReference) {
return resolveNamesWithLocalCache({
names: typeDirectiveNames,
containingFile: containingFile,
redirectedReference: redirectedReference,
cache: resolvedTypeReferenceDirectives,
perDirectoryCacheWithRedirects: perDirectoryResolvedTypeReferenceDirectives,
loader: resolveTypeReferenceDirective,
getResolutionWithResolvedFileName: getResolvedTypeReferenceDirective,
shouldRetryResolution: function (resolution) { return resolution.resolvedTypeReferenceDirective === undefined; },
});
}
function resolveModuleNames(moduleNames, containingFile, reusedNames, redirectedReference) {
return resolveNamesWithLocalCache({
names: moduleNames,
containingFile: containingFile,
redirectedReference: redirectedReference,
cache: resolvedModuleNames,
perDirectoryCacheWithRedirects: perDirectoryResolvedModuleNames,
loader: resolveModuleName,
getResolutionWithResolvedFileName: getResolvedModule,
shouldRetryResolution: function (resolution) { return !resolution.resolvedModule || !ts.resolutionExtensionIsTSOrJson(resolution.resolvedModule.extension); },
reusedNames: reusedNames,
logChanges: logChangesWhenResolvingModule,
});
}
function getResolvedModuleWithFailedLookupLocationsFromCache(moduleName, containingFile) {
var cache = resolvedModuleNames.get(resolutionHost.toPath(containingFile));
return cache && cache.get(moduleName);
}
function isNodeModulesAtTypesDirectory(dirPath) {
return ts.endsWith(dirPath, "/node_modules/@types");
}
function getDirectoryToWatchFailedLookupLocation(failedLookupLocation, failedLookupLocationPath) {
if (isInDirectoryPath(rootPath, failedLookupLocationPath)) {
// Ensure failed look up is normalized path
failedLookupLocation = ts.isRootedDiskPath(failedLookupLocation) ? ts.normalizePath(failedLookupLocation) : ts.getNormalizedAbsolutePath(failedLookupLocation, getCurrentDirectory());
var failedLookupPathSplit = failedLookupLocationPath.split(ts.directorySeparator);
var failedLookupSplit = failedLookupLocation.split(ts.directorySeparator);
ts.Debug.assert(failedLookupSplit.length === failedLookupPathSplit.length, "FailedLookup: " + failedLookupLocation + " failedLookupLocationPath: " + failedLookupLocationPath);
if (failedLookupPathSplit.length > rootSplitLength + 1) {
// Instead of watching root, watch directory in root to avoid watching excluded directories not needed for module resolution
return {
dir: failedLookupSplit.slice(0, rootSplitLength + 1).join(ts.directorySeparator),
dirPath: failedLookupPathSplit.slice(0, rootSplitLength + 1).join(ts.directorySeparator)
};
}
else {
// Always watch root directory non recursively
return {
dir: rootDir,
dirPath: rootPath,
nonRecursive: false
};
}
}
return getDirectoryToWatchFromFailedLookupLocationDirectory(ts.getDirectoryPath(ts.getNormalizedAbsolutePath(failedLookupLocation, getCurrentDirectory())), ts.getDirectoryPath(failedLookupLocationPath));
}
function getDirectoryToWatchFromFailedLookupLocationDirectory(dir, dirPath) {
// If directory path contains node module, get the most parent node_modules directory for watching
while (ts.pathContainsNodeModules(dirPath)) {
dir = ts.getDirectoryPath(dir);
dirPath = ts.getDirectoryPath(dirPath);
}
// If the directory is node_modules use it to watch, always watch it recursively
if (ts.isNodeModulesDirectory(dirPath)) {
return canWatchDirectory(ts.getDirectoryPath(dirPath)) ? { dir: dir, dirPath: dirPath } : undefined;
}
var nonRecursive = true;
// Use some ancestor of the root directory
var subDirectoryPath, subDirectory;
if (rootPath !== undefined) {
while (!isInDirectoryPath(dirPath, rootPath)) {
var parentPath = ts.getDirectoryPath(dirPath);
if (parentPath === dirPath) {
break;
}
nonRecursive = false;
subDirectoryPath = dirPath;
subDirectory = dir;
dirPath = parentPath;
dir = ts.getDirectoryPath(dir);
}
}
return canWatchDirectory(dirPath) ? { dir: subDirectory || dir, dirPath: subDirectoryPath || dirPath, nonRecursive: nonRecursive } : undefined;
}
function isPathWithDefaultFailedLookupExtension(path) {
return ts.fileExtensionIsOneOf(path, failedLookupDefaultExtensions);
}
function watchFailedLookupLocationsOfExternalModuleResolutions(name, resolution, filePath, getResolutionWithResolvedFileName) {
if (resolution.refCount) {
resolution.refCount++;
ts.Debug.assertDefined(resolution.files);
}
else {
resolution.refCount = 1;
ts.Debug.assert(ts.length(resolution.files) === 0); // This resolution shouldnt be referenced by any file yet
if (ts.isExternalModuleNameRelative(name)) {
watchFailedLookupLocationOfResolution(resolution);
}
else {
nonRelativeExternalModuleResolutions.add(name, resolution);
}
var resolved = getResolutionWithResolvedFileName(resolution);
if (resolved && resolved.resolvedFileName) {
resolvedFileToResolution.add(resolutionHost.toPath(resolved.resolvedFileName), resolution);
}
}
(resolution.files || (resolution.files = [])).push(filePath);
}
function watchFailedLookupLocationOfResolution(resolution) {
ts.Debug.assert(!!resolution.refCount);
var failedLookupLocations = resolution.failedLookupLocations;
if (!failedLookupLocations.length)
return;
resolutionsWithFailedLookups.push(resolution);
var setAtRoot = false;
for (var _i = 0, failedLookupLocations_1 = failedLookupLocations; _i < failedLookupLocations_1.length; _i++) {
var failedLookupLocation = failedLookupLocations_1[_i];
var failedLookupLocationPath = resolutionHost.toPath(failedLookupLocation);
var toWatch = getDirectoryToWatchFailedLookupLocation(failedLookupLocation, failedLookupLocationPath);
if (toWatch) {
var dir = toWatch.dir, dirPath = toWatch.dirPath, nonRecursive = toWatch.nonRecursive;
// If the failed lookup location path is not one of the supported extensions,
// store it in the custom path
if (!isPathWithDefaultFailedLookupExtension(failedLookupLocationPath)) {
var refCount = customFailedLookupPaths.get(failedLookupLocationPath) || 0;
customFailedLookupPaths.set(failedLookupLocationPath, refCount + 1);
}
if (dirPath === rootPath) {
ts.Debug.assert(!nonRecursive);
setAtRoot = true;
}
else {
setDirectoryWatcher(dir, dirPath, nonRecursive);
}
}
}
if (setAtRoot) {
// This is always non recursive
setDirectoryWatcher(rootDir, rootPath, /*nonRecursive*/ true); // TODO: GH#18217
}
}
function watchFailedLookupLocationOfNonRelativeModuleResolutions(resolutions, name) {
var program = resolutionHost.getCurrentProgram();
if (!program || !program.getTypeChecker().tryFindAmbientModuleWithoutAugmentations(name)) {
resolutions.forEach(watchFailedLookupLocationOfResolution);
}
}
function setDirectoryWatcher(dir, dirPath, nonRecursive) {
var dirWatcher = directoryWatchesOfFailedLookups.get(dirPath);
if (dirWatcher) {
ts.Debug.assert(!!nonRecursive === !!dirWatcher.nonRecursive);
dirWatcher.refCount++;
}
else {
directoryWatchesOfFailedLookups.set(dirPath, { watcher: createDirectoryWatcher(dir, dirPath, nonRecursive), refCount: 1, nonRecursive: nonRecursive });
}
}
function stopWatchFailedLookupLocationOfResolution(resolution, filePath, getResolutionWithResolvedFileName) {
ts.unorderedRemoveItem(ts.Debug.assertDefined(resolution.files), filePath);
resolution.refCount--;
if (resolution.refCount) {
return;
}
var resolved = getResolutionWithResolvedFileName(resolution);
if (resolved && resolved.resolvedFileName) {
resolvedFileToResolution.remove(resolutionHost.toPath(resolved.resolvedFileName), resolution);
}
if (!ts.unorderedRemoveItem(resolutionsWithFailedLookups, resolution)) {
// If not watching failed lookups, it wont be there in resolutionsWithFailedLookups
return;
}
var failedLookupLocations = resolution.failedLookupLocations;
var removeAtRoot = false;
for (var _i = 0, failedLookupLocations_2 = failedLookupLocations; _i < failedLookupLocations_2.length; _i++) {
var failedLookupLocation = failedLookupLocations_2[_i];
var failedLookupLocationPath = resolutionHost.toPath(failedLookupLocation);
var toWatch = getDirectoryToWatchFailedLookupLocation(failedLookupLocation, failedLookupLocationPath);
if (toWatch) {
var dirPath = toWatch.dirPath;
var refCount = customFailedLookupPaths.get(failedLookupLocationPath);
if (refCount) {
if (refCount === 1) {
customFailedLookupPaths.delete(failedLookupLocationPath);
}
else {
ts.Debug.assert(refCount > 1);
customFailedLookupPaths.set(failedLookupLocationPath, refCount - 1);
}
}
if (dirPath === rootPath) {
removeAtRoot = true;
}
else {
removeDirectoryWatcher(dirPath);
}
}
}
if (removeAtRoot) {
removeDirectoryWatcher(rootPath);
}
}
function removeDirectoryWatcher(dirPath) {
var dirWatcher = directoryWatchesOfFailedLookups.get(dirPath);
// Do not close the watcher yet since it might be needed by other failed lookup locations.
dirWatcher.refCount--;
}
function createDirectoryWatcher(directory, dirPath, nonRecursive) {
return resolutionHost.watchDirectoryOfFailedLookupLocation(directory, function (fileOrDirectory) {
var fileOrDirectoryPath = resolutionHost.toPath(fileOrDirectory);
if (cachedDirectoryStructureHost) {
// Since the file existence changed, update the sourceFiles cache
cachedDirectoryStructureHost.addOrDeleteFileOrDirectory(fileOrDirectory, fileOrDirectoryPath);
}
scheduleInvalidateResolutionOfFailedLookupLocation(fileOrDirectoryPath, dirPath === fileOrDirectoryPath);
}, nonRecursive ? 0 /* None */ : 1 /* Recursive */);
}
function removeResolutionsOfFileFromCache(cache, filePath, getResolutionWithResolvedFileName) {
// Deleted file, stop watching failed lookups for all the resolutions in the file
var resolutions = cache.get(filePath);
if (resolutions) {
resolutions.forEach(function (resolution) { return stopWatchFailedLookupLocationOfResolution(resolution, filePath, getResolutionWithResolvedFileName); });
cache.delete(filePath);
}
}
function removeResolutionsFromProjectReferenceRedirects(filePath) {
if (!ts.fileExtensionIs(filePath, ".json" /* Json */)) {
return;
}
var program = resolutionHost.getCurrentProgram();
if (!program) {
return;
}
// If this file is input file for the referenced project, get it
var resolvedProjectReference = program.getResolvedProjectReferenceByPath(filePath);
if (!resolvedProjectReference) {
return;
}
// filePath is for the projectReference and the containing file is from this project reference, invalidate the resolution
resolvedProjectReference.commandLine.fileNames.forEach(function (f) { return removeResolutionsOfFile(resolutionHost.toPath(f)); });
}
function removeResolutionsOfFile(filePath) {
removeResolutionsOfFileFromCache(resolvedModuleNames, filePath, getResolvedModule);
removeResolutionsOfFileFromCache(resolvedTypeReferenceDirectives, filePath, getResolvedTypeReferenceDirective);
}
function invalidateResolutions(resolutions, canInvalidate) {
if (!resolutions)
return false;
var invalidated = false;
for (var _i = 0, resolutions_1 = resolutions; _i < resolutions_1.length; _i++) {
var resolution = resolutions_1[_i];
if (resolution.isInvalidated || !canInvalidate(resolution))
continue;
resolution.isInvalidated = invalidated = true;
for (var _a = 0, _b = ts.Debug.assertDefined(resolution.files); _a < _b.length; _a++) {
var containingFilePath = _b[_a];
(filesWithInvalidatedResolutions || (filesWithInvalidatedResolutions = new ts.Set())).add(containingFilePath);
// When its a file with inferred types resolution, invalidate type reference directive resolution
hasChangedAutomaticTypeDirectiveNames = hasChangedAutomaticTypeDirectiveNames || ts.endsWith(containingFilePath, ts.inferredTypesContainingFile);
}
}
return invalidated;
}
function invalidateResolutionOfFile(filePath) {
removeResolutionsOfFile(filePath);
// Resolution is invalidated if the resulting file name is same as the deleted file path
var prevHasChangedAutomaticTypeDirectiveNames = hasChangedAutomaticTypeDirectiveNames;
if (invalidateResolutions(resolvedFileToResolution.get(filePath), ts.returnTrue) &&
hasChangedAutomaticTypeDirectiveNames &&
!prevHasChangedAutomaticTypeDirectiveNames) {
resolutionHost.onChangedAutomaticTypeDirectiveNames();
}
}
function setFilesWithInvalidatedNonRelativeUnresolvedImports(filesMap) {
ts.Debug.assert(filesWithInvalidatedNonRelativeUnresolvedImports === filesMap || filesWithInvalidatedNonRelativeUnresolvedImports === undefined);
filesWithInvalidatedNonRelativeUnresolvedImports = filesMap;
}
function scheduleInvalidateResolutionOfFailedLookupLocation(fileOrDirectoryPath, isCreatingWatchedDirectory) {
if (isCreatingWatchedDirectory) {
// Watching directory is created
// Invalidate any resolution has failed lookup in this directory
(isInDirectoryChecks || (isInDirectoryChecks = [])).push(fileOrDirectoryPath);
}
else {
// If something to do with folder/file starting with "." in node_modules folder, skip it
var updatedPath = removeIgnoredPath(fileOrDirectoryPath);
if (!updatedPath)
return false;
fileOrDirectoryPath = updatedPath;
// prevent saving an open file from over-eagerly triggering invalidation
if (resolutionHost.fileIsOpen(fileOrDirectoryPath)) {
return false;
}
// Some file or directory in the watching directory is created
// Return early if it does not have any of the watching extension or not the custom failed lookup path
var dirOfFileOrDirectory = ts.getDirectoryPath(fileOrDirectoryPath);
if (isNodeModulesAtTypesDirectory(fileOrDirectoryPath) || ts.isNodeModulesDirectory(fileOrDirectoryPath) ||
isNodeModulesAtTypesDirectory(dirOfFileOrDirectory) || ts.isNodeModulesDirectory(dirOfFileOrDirectory)) {
// Invalidate any resolution from this directory
(failedLookupChecks || (failedLookupChecks = [])).push(fileOrDirectoryPath);
(startsWithPathChecks || (startsWithPathChecks = new ts.Set())).add(fileOrDirectoryPath);
}
else {
if (!isPathWithDefaultFailedLookupExtension(fileOrDirectoryPath) && !customFailedLookupPaths.has(fileOrDirectoryPath)) {
return false;
}
// Ignore emits from the program
if (ts.isEmittedFileOfProgram(resolutionHost.getCurrentProgram(), fileOrDirectoryPath)) {
return false;
}
// Resolution need to be invalidated if failed lookup location is same as the file or directory getting created
(failedLookupChecks || (failedLookupChecks = [])).push(fileOrDirectoryPath);
// If the invalidated file is from a node_modules package, invalidate everything else
// in the package since we might not get notifications for other files in the package.
// This hardens our logic against unreliable file watchers.
var packagePath = ts.parseNodeModuleFromPath(fileOrDirectoryPath);
if (packagePath)
(startsWithPathChecks || (startsWithPathChecks = new ts.Set())).add(packagePath);
}
}
resolutionHost.scheduleInvalidateResolutionsOfFailedLookupLocations();
}
function invalidateResolutionsOfFailedLookupLocations() {
if (!failedLookupChecks && !startsWithPathChecks && !isInDirectoryChecks) {
return false;
}
var invalidated = invalidateResolutions(resolutionsWithFailedLookups, canInvalidateFailedLookupResolution);
failedLookupChecks = undefined;
startsWithPathChecks = undefined;
isInDirectoryChecks = undefined;
return invalidated;
}
function canInvalidateFailedLookupResolution(resolution) {
return resolution.failedLookupLocations.some(function (location) {
var locationPath = resolutionHost.toPath(location);
return ts.contains(failedLookupChecks, locationPath) ||
ts.firstDefinedIterator((startsWithPathChecks === null || startsWithPathChecks === void 0 ? void 0 : startsWithPathChecks.keys()) || ts.emptyIterator, function (fileOrDirectoryPath) { return ts.startsWith(locationPath, fileOrDirectoryPath) ? true : undefined; }) ||
(isInDirectoryChecks === null || isInDirectoryChecks === void 0 ? void 0 : isInDirectoryChecks.some(function (fileOrDirectoryPath) { return isInDirectoryPath(fileOrDirectoryPath, locationPath); }));
});
}
function closeTypeRootsWatch() {
ts.clearMap(typeRootsWatches, ts.closeFileWatcher);
}
function getDirectoryToWatchFailedLookupLocationFromTypeRoot(typeRoot, typeRootPath) {
if (isInDirectoryPath(rootPath, typeRootPath)) {
return rootPath;
}
var toWatch = getDirectoryToWatchFromFailedLookupLocationDirectory(typeRoot, typeRootPath);
return toWatch && directoryWatchesOfFailedLookups.has(toWatch.dirPath) ? toWatch.dirPath : undefined;
}
function createTypeRootsWatch(typeRootPath, typeRoot) {
// Create new watch and recursive info
return resolutionHost.watchTypeRootsDirectory(typeRoot, function (fileOrDirectory) {
var fileOrDirectoryPath = resolutionHost.toPath(fileOrDirectory);
if (cachedDirectoryStructureHost) {
// Since the file existence changed, update the sourceFiles cache
cachedDirectoryStructureHost.addOrDeleteFileOrDirectory(fileOrDirectory, fileOrDirectoryPath);
}
// For now just recompile
// We could potentially store more data here about whether it was/would be really be used or not
// and with that determine to trigger compilation but for now this is enough
hasChangedAutomaticTypeDirectiveNames = true;
resolutionHost.onChangedAutomaticTypeDirectiveNames();
// Since directory watchers invoked are flaky, the failed lookup location events might not be triggered
// So handle to failed lookup locations here as well to ensure we are invalidating resolutions
var dirPath = getDirectoryToWatchFailedLookupLocationFromTypeRoot(typeRoot, typeRootPath);
if (dirPath) {
scheduleInvalidateResolutionOfFailedLookupLocation(fileOrDirectoryPath, dirPath === fileOrDirectoryPath);
}
}, 1 /* Recursive */);
}
/**
* Watches the types that would get added as part of getAutomaticTypeDirectiveNames
* To be called when compiler options change
*/
function updateTypeRootsWatch() {
var options = resolutionHost.getCompilationSettings();
if (options.types) {
// No need to do any watch since resolution cache is going to handle the failed lookups
// for the types added by this
closeTypeRootsWatch();
return;
}
// we need to assume the directories exist to ensure that we can get all the type root directories that get included
// But filter directories that are at root level to say directory doesnt exist, so that we arent watching them
var typeRoots = ts.getEffectiveTypeRoots(options, { directoryExists: directoryExistsForTypeRootWatch, getCurrentDirectory: getCurrentDirectory });
if (typeRoots) {
ts.mutateMap(typeRootsWatches, ts.arrayToMap(typeRoots, function (tr) { return resolutionHost.toPath(tr); }), {
createNewValue: createTypeRootsWatch,
onDeleteValue: ts.closeFileWatcher
});
}
else {
closeTypeRootsWatch();
}
}
/**
* Use this function to return if directory exists to get type roots to watch
* If we return directory exists then only the paths will be added to type roots
* Hence return true for all directories except root directories which are filtered from watching
*/
function directoryExistsForTypeRootWatch(nodeTypesDirectory) {
var dir = ts.getDirectoryPath(ts.getDirectoryPath(nodeTypesDirectory));
var dirPath = resolutionHost.toPath(dir);
return dirPath === rootPath || canWatchDirectory(dirPath);
}
}
ts.createResolutionCache = createResolutionCache;
})(ts || (ts = {}));
// Used by importFixes, getEditsForFileRename, and declaration emit to synthesize import module specifiers.
/* @internal */
var ts;
(function (ts) {
var moduleSpecifiers;
(function (moduleSpecifiers_1) {
var RelativePreference;
(function (RelativePreference) {
RelativePreference[RelativePreference["Relative"] = 0] = "Relative";
RelativePreference[RelativePreference["NonRelative"] = 1] = "NonRelative";
RelativePreference[RelativePreference["Shortest"] = 2] = "Shortest";
RelativePreference[RelativePreference["ExternalNonRelative"] = 3] = "ExternalNonRelative";
})(RelativePreference || (RelativePreference = {}));
// See UserPreferences#importPathEnding
var Ending;
(function (Ending) {
Ending[Ending["Minimal"] = 0] = "Minimal";
Ending[Ending["Index"] = 1] = "Index";
Ending[Ending["JsExtension"] = 2] = "JsExtension";
})(Ending || (Ending = {}));
function getPreferences(_a, compilerOptions, importingSourceFile) {
var importModuleSpecifierPreference = _a.importModuleSpecifierPreference, importModuleSpecifierEnding = _a.importModuleSpecifierEnding;
return {
relativePreference: importModuleSpecifierPreference === "relative" ? 0 /* Relative */ :
importModuleSpecifierPreference === "non-relative" ? 1 /* NonRelative */ :
importModuleSpecifierPreference === "project-relative" ? 3 /* ExternalNonRelative */ :
2 /* Shortest */,
ending: getEnding(),
};
function getEnding() {
switch (importModuleSpecifierEnding) {
case "minimal": return 0 /* Minimal */;
case "index": return 1 /* Index */;
case "js": return 2 /* JsExtension */;
default: return usesJsExtensionOnImports(importingSourceFile) ? 2 /* JsExtension */
: ts.getEmitModuleResolutionKind(compilerOptions) !== ts.ModuleResolutionKind.NodeJs ? 1 /* Index */ : 0 /* Minimal */;
}
}
}
function getPreferencesForUpdate(compilerOptions, oldImportSpecifier) {
return {
relativePreference: ts.isExternalModuleNameRelative(oldImportSpecifier) ? 0 /* Relative */ : 1 /* NonRelative */,
ending: ts.hasJSFileExtension(oldImportSpecifier) ?
2 /* JsExtension */ :
ts.getEmitModuleResolutionKind(compilerOptions) !== ts.ModuleResolutionKind.NodeJs || ts.endsWith(oldImportSpecifier, "index") ? 1 /* Index */ : 0 /* Minimal */,
};
}
function updateModuleSpecifier(compilerOptions, importingSourceFileName, toFileName, host, oldImportSpecifier) {
var res = getModuleSpecifierWorker(compilerOptions, importingSourceFileName, toFileName, host, getPreferencesForUpdate(compilerOptions, oldImportSpecifier), {});
if (res === oldImportSpecifier)
return undefined;
return res;
}
moduleSpecifiers_1.updateModuleSpecifier = updateModuleSpecifier;
// Note: importingSourceFile is just for usesJsExtensionOnImports
function getModuleSpecifier(compilerOptions, importingSourceFile, importingSourceFileName, toFileName, host) {
return getModuleSpecifierWorker(compilerOptions, importingSourceFileName, toFileName, host, getPreferences({}, compilerOptions, importingSourceFile), {});
}
moduleSpecifiers_1.getModuleSpecifier = getModuleSpecifier;
function getNodeModulesPackageName(compilerOptions, importingSourceFileName, nodeModulesFileName, host, preferences) {
var info = getInfo(importingSourceFileName, host);
var modulePaths = getAllModulePaths(importingSourceFileName, nodeModulesFileName, host, preferences);
return ts.firstDefined(modulePaths, function (modulePath) { return tryGetModuleNameAsNodeModule(modulePath, info, host, compilerOptions, /*packageNameOnly*/ true); });
}
moduleSpecifiers_1.getNodeModulesPackageName = getNodeModulesPackageName;
function getModuleSpecifierWorker(compilerOptions, importingSourceFileName, toFileName, host, preferences, userPreferences) {
var info = getInfo(importingSourceFileName, host);
var modulePaths = getAllModulePaths(importingSourceFileName, toFileName, host, userPreferences);
return ts.firstDefined(modulePaths, function (modulePath) { return tryGetModuleNameAsNodeModule(modulePath, info, host, compilerOptions); }) ||
getLocalModuleSpecifier(toFileName, info, compilerOptions, host, preferences);
}
function tryGetModuleSpecifiersFromCache(moduleSymbol, importingSourceFile, host, userPreferences) {
return tryGetModuleSpecifiersFromCacheWorker(moduleSymbol, importingSourceFile, host, userPreferences)[0];
}
moduleSpecifiers_1.tryGetModuleSpecifiersFromCache = tryGetModuleSpecifiersFromCache;
function tryGetModuleSpecifiersFromCacheWorker(moduleSymbol, importingSourceFile, host, userPreferences) {
var _a;
var moduleSourceFile = ts.getSourceFileOfModule(moduleSymbol);
if (!moduleSourceFile) {
return ts.emptyArray;
}
var cache = (_a = host.getModuleSpecifierCache) === null || _a === void 0 ? void 0 : _a.call(host);
var cached = cache === null || cache === void 0 ? void 0 : cache.get(importingSourceFile.path, moduleSourceFile.path, userPreferences);
return [cached === null || cached === void 0 ? void 0 : cached.moduleSpecifiers, moduleSourceFile, cached === null || cached === void 0 ? void 0 : cached.modulePaths, cache];
}
/** Returns an import for each symlink and for the realpath. */
function getModuleSpecifiers(moduleSymbol, checker, compilerOptions, importingSourceFile, host, userPreferences) {
return getModuleSpecifiersWithCacheInfo(moduleSymbol, checker, compilerOptions, importingSourceFile, host, userPreferences).moduleSpecifiers;
}
moduleSpecifiers_1.getModuleSpecifiers = getModuleSpecifiers;
function getModuleSpecifiersWithCacheInfo(moduleSymbol, checker, compilerOptions, importingSourceFile, host, userPreferences) {
var computedWithoutCache = false;
var ambient = tryGetModuleNameFromAmbientModule(moduleSymbol, checker);
if (ambient)
return { moduleSpecifiers: [ambient], computedWithoutCache: computedWithoutCache };
// eslint-disable-next-line prefer-const
var _a = tryGetModuleSpecifiersFromCacheWorker(moduleSymbol, importingSourceFile, host, userPreferences), specifiers = _a[0], moduleSourceFile = _a[1], modulePaths = _a[2], cache = _a[3];
if (specifiers)
return { moduleSpecifiers: specifiers, computedWithoutCache: computedWithoutCache };
if (!moduleSourceFile)
return { moduleSpecifiers: ts.emptyArray, computedWithoutCache: computedWithoutCache };
computedWithoutCache = true;
modulePaths || (modulePaths = getAllModulePathsWorker(importingSourceFile.path, moduleSourceFile.originalFileName, host));
var result = computeModuleSpecifiers(modulePaths, compilerOptions, importingSourceFile, host, userPreferences);
cache === null || cache === void 0 ? void 0 : cache.set(importingSourceFile.path, moduleSourceFile.path, userPreferences, modulePaths, result);
return { moduleSpecifiers: result, computedWithoutCache: computedWithoutCache };
}
moduleSpecifiers_1.getModuleSpecifiersWithCacheInfo = getModuleSpecifiersWithCacheInfo;
function computeModuleSpecifiers(modulePaths, compilerOptions, importingSourceFile, host, userPreferences) {
var info = getInfo(importingSourceFile.path, host);
var preferences = getPreferences(userPreferences, compilerOptions, importingSourceFile);
var existingSpecifier = ts.forEach(modulePaths, function (modulePath) { return ts.forEach(host.getFileIncludeReasons().get(ts.toPath(modulePath.path, host.getCurrentDirectory(), info.getCanonicalFileName)), function (reason) {
if (reason.kind !== ts.FileIncludeKind.Import || reason.file !== importingSourceFile.path)
return undefined;
var specifier = ts.getModuleNameStringLiteralAt(importingSourceFile, reason.index).text;
// If the preference is for non relative and the module specifier is relative, ignore it
return preferences.relativePreference !== 1 /* NonRelative */ || !ts.pathIsRelative(specifier) ?
specifier :
undefined;
}); });
if (existingSpecifier) {
var moduleSpecifiers_2 = [existingSpecifier];
return moduleSpecifiers_2;
}
var importedFileIsInNodeModules = ts.some(modulePaths, function (p) { return p.isInNodeModules; });
// Module specifier priority:
// 1. "Bare package specifiers" (e.g. "@foo/bar") resulting from a path through node_modules to a package.json's "types" entry
// 2. Specifiers generated using "paths" from tsconfig
// 3. Non-relative specfiers resulting from a path through node_modules (e.g. "@foo/bar/path/to/file")
// 4. Relative paths
var nodeModulesSpecifiers;
var pathsSpecifiers;
var relativeSpecifiers;
for (var _i = 0, modulePaths_1 = modulePaths; _i < modulePaths_1.length; _i++) {
var modulePath = modulePaths_1[_i];
var specifier = tryGetModuleNameAsNodeModule(modulePath, info, host, compilerOptions);
nodeModulesSpecifiers = ts.append(nodeModulesSpecifiers, specifier);
if (specifier && modulePath.isRedirect) {
// If we got a specifier for a redirect, it was a bare package specifier (e.g. "@foo/bar",
// not "@foo/bar/path/to/file"). No other specifier will be this good, so stop looking.
return nodeModulesSpecifiers;
}
if (!specifier && !modulePath.isRedirect) {
var local = getLocalModuleSpecifier(modulePath.path, info, compilerOptions, host, preferences);
if (ts.pathIsBareSpecifier(local)) {
pathsSpecifiers = ts.append(pathsSpecifiers, local);
}
else if (!importedFileIsInNodeModules || modulePath.isInNodeModules) {
// Why this extra conditional, not just an `else`? If some path to the file contained
// 'node_modules', but we can't create a non-relative specifier (e.g. "@foo/bar/path/to/file"),
// that means we had to go through a *sibling's* node_modules, not one we can access directly.
// If some path to the file was in node_modules but another was not, this likely indicates that
// we have a monorepo structure with symlinks. In this case, the non-node_modules path is
// probably the realpath, e.g. "../bar/path/to/file", but a relative path to another package
// in a monorepo is probably not portable. So, the module specifier we actually go with will be
// the relative path through node_modules, so that the declaration emitter can produce a
// portability error. (See declarationEmitReexportedSymlinkReference3)
relativeSpecifiers = ts.append(relativeSpecifiers, local);
}
}
}
return (pathsSpecifiers === null || pathsSpecifiers === void 0 ? void 0 : pathsSpecifiers.length) ? pathsSpecifiers :
(nodeModulesSpecifiers === null || nodeModulesSpecifiers === void 0 ? void 0 : nodeModulesSpecifiers.length) ? nodeModulesSpecifiers :
ts.Debug.checkDefined(relativeSpecifiers);
}
// importingSourceFileName is separate because getEditsForFileRename may need to specify an updated path
function getInfo(importingSourceFileName, host) {
var getCanonicalFileName = ts.createGetCanonicalFileName(host.useCaseSensitiveFileNames ? host.useCaseSensitiveFileNames() : true);
var sourceDirectory = ts.getDirectoryPath(importingSourceFileName);
return { getCanonicalFileName: getCanonicalFileName, importingSourceFileName: importingSourceFileName, sourceDirectory: sourceDirectory };
}
function getLocalModuleSpecifier(moduleFileName, info, compilerOptions, host, _a) {
var ending = _a.ending, relativePreference = _a.relativePreference;
var baseUrl = compilerOptions.baseUrl, paths = compilerOptions.paths, rootDirs = compilerOptions.rootDirs;
var sourceDirectory = info.sourceDirectory, getCanonicalFileName = info.getCanonicalFileName;
var relativePath = rootDirs && tryGetModuleNameFromRootDirs(rootDirs, moduleFileName, sourceDirectory, getCanonicalFileName, ending, compilerOptions) ||
removeExtensionAndIndexPostFix(ts.ensurePathIsNonModuleName(ts.getRelativePathFromDirectory(sourceDirectory, moduleFileName, getCanonicalFileName)), ending, compilerOptions);
if (!baseUrl && !paths || relativePreference === 0 /* Relative */) {
return relativePath;
}
var baseDirectory = ts.getNormalizedAbsolutePath(ts.getPathsBasePath(compilerOptions, host) || baseUrl, host.getCurrentDirectory());
var relativeToBaseUrl = getRelativePathIfInDirectory(moduleFileName, baseDirectory, getCanonicalFileName);
if (!relativeToBaseUrl) {
return relativePath;
}
var importRelativeToBaseUrl = removeExtensionAndIndexPostFix(relativeToBaseUrl, ending, compilerOptions);
var fromPaths = paths && tryGetModuleNameFromPaths(ts.removeFileExtension(relativeToBaseUrl), importRelativeToBaseUrl, paths);
var nonRelative = fromPaths === undefined && baseUrl !== undefined ? importRelativeToBaseUrl : fromPaths;
if (!nonRelative) {
return relativePath;
}
if (relativePreference === 1 /* NonRelative */) {
return nonRelative;
}
if (relativePreference === 3 /* ExternalNonRelative */) {
var projectDirectory = compilerOptions.configFilePath ?
ts.toPath(ts.getDirectoryPath(compilerOptions.configFilePath), host.getCurrentDirectory(), info.getCanonicalFileName) :
info.getCanonicalFileName(host.getCurrentDirectory());
var modulePath = ts.toPath(moduleFileName, projectDirectory, getCanonicalFileName);
var sourceIsInternal = ts.startsWith(sourceDirectory, projectDirectory);
var targetIsInternal = ts.startsWith(modulePath, projectDirectory);
if (sourceIsInternal && !targetIsInternal || !sourceIsInternal && targetIsInternal) {
// 1. The import path crosses the boundary of the tsconfig.json-containing directory.
//
// src/
// tsconfig.json
// index.ts -------
// lib/ | (path crosses tsconfig.json)
// imported.ts <---
//
return nonRelative;
}
var nearestTargetPackageJson = getNearestAncestorDirectoryWithPackageJson(host, ts.getDirectoryPath(modulePath));
var nearestSourcePackageJson = getNearestAncestorDirectoryWithPackageJson(host, sourceDirectory);
if (nearestSourcePackageJson !== nearestTargetPackageJson) {
// 2. The importing and imported files are part of different packages.
//
// packages/a/
// package.json
// index.ts --------
// packages/b/ | (path crosses package.json)
// package.json |
// component.ts <---
//
return nonRelative;
}
return relativePath;
}
if (relativePreference !== 2 /* Shortest */)
ts.Debug.assertNever(relativePreference);
// Prefer a relative import over a baseUrl import if it has fewer components.
return isPathRelativeToParent(nonRelative) || countPathComponents(relativePath) < countPathComponents(nonRelative) ? relativePath : nonRelative;
}
function countPathComponents(path) {
var count = 0;
for (var i = ts.startsWith(path, "./") ? 2 : 0; i < path.length; i++) {
if (path.charCodeAt(i) === 47 /* slash */)
count++;
}
return count;
}
moduleSpecifiers_1.countPathComponents = countPathComponents;
function usesJsExtensionOnImports(_a) {
var imports = _a.imports;
return ts.firstDefined(imports, function (_a) {
var text = _a.text;
return ts.pathIsRelative(text) ? ts.hasJSFileExtension(text) : undefined;
}) || false;
}
function comparePathsByRedirectAndNumberOfDirectorySeparators(a, b) {
return ts.compareBooleans(b.isRedirect, a.isRedirect) || ts.compareNumberOfDirectorySeparators(a.path, b.path);
}
function getNearestAncestorDirectoryWithPackageJson(host, fileName) {
if (host.getNearestAncestorDirectoryWithPackageJson) {
return host.getNearestAncestorDirectoryWithPackageJson(fileName);
}
return !!ts.forEachAncestorDirectory(fileName, function (directory) {
return host.fileExists(ts.combinePaths(directory, "package.json")) ? true : undefined;
});
}
function forEachFileNameOfModule(importingFileName, importedFileName, host, preferSymlinks, cb) {
var _a;
var getCanonicalFileName = ts.hostGetCanonicalFileName(host);
var cwd = host.getCurrentDirectory();
var referenceRedirect = host.isSourceOfProjectReferenceRedirect(importedFileName) ? host.getProjectReferenceRedirect(importedFileName) : undefined;
var importedPath = ts.toPath(importedFileName, cwd, getCanonicalFileName);
var redirects = host.redirectTargetsMap.get(importedPath) || ts.emptyArray;
var importedFileNames = __spreadArray(__spreadArray(__spreadArray([], (referenceRedirect ? [referenceRedirect] : ts.emptyArray), true), [importedFileName], false), redirects, true);
var targets = importedFileNames.map(function (f) { return ts.getNormalizedAbsolutePath(f, cwd); });
var shouldFilterIgnoredPaths = !ts.every(targets, ts.containsIgnoredPath);
if (!preferSymlinks) {
// Symlinks inside ignored paths are already filtered out of the symlink cache,
// so we only need to remove them from the realpath filenames.
var result_15 = ts.forEach(targets, function (p) { return !(shouldFilterIgnoredPaths && ts.containsIgnoredPath(p)) && cb(p, referenceRedirect === p); });
if (result_15)
return result_15;
}
var symlinkedDirectories = (_a = host.getSymlinkCache) === null || _a === void 0 ? void 0 : _a.call(host).getSymlinkedDirectoriesByRealpath();
var fullImportedFileName = ts.getNormalizedAbsolutePath(importedFileName, cwd);
var result = symlinkedDirectories && ts.forEachAncestorDirectory(ts.getDirectoryPath(fullImportedFileName), function (realPathDirectory) {
var symlinkDirectories = symlinkedDirectories.get(ts.ensureTrailingDirectorySeparator(ts.toPath(realPathDirectory, cwd, getCanonicalFileName)));
if (!symlinkDirectories)
return undefined; // Continue to ancestor directory
// Don't want to a package to globally import from itself (importNameCodeFix_symlink_own_package.ts)
if (ts.startsWithDirectory(importingFileName, realPathDirectory, getCanonicalFileName)) {
return false; // Stop search, each ancestor directory will also hit this condition
}
return ts.forEach(targets, function (target) {
if (!ts.startsWithDirectory(target, realPathDirectory, getCanonicalFileName)) {
return;
}
var relative = ts.getRelativePathFromDirectory(realPathDirectory, target, getCanonicalFileName);
for (var _i = 0, symlinkDirectories_1 = symlinkDirectories; _i < symlinkDirectories_1.length; _i++) {
var symlinkDirectory = symlinkDirectories_1[_i];
var option = ts.resolvePath(symlinkDirectory, relative);
var result_16 = cb(option, target === referenceRedirect);
shouldFilterIgnoredPaths = true; // We found a non-ignored path in symlinks, so we can reject ignored-path realpaths
if (result_16)
return result_16;
}
});
});
return result || (preferSymlinks
? ts.forEach(targets, function (p) { return shouldFilterIgnoredPaths && ts.containsIgnoredPath(p) ? undefined : cb(p, p === referenceRedirect); })
: undefined);
}
moduleSpecifiers_1.forEachFileNameOfModule = forEachFileNameOfModule;
/**
* Looks for existing imports that use symlinks to this module.
* Symlinks will be returned first so they are preferred over the real path.
*/
function getAllModulePaths(importingFilePath, importedFileName, host, preferences, importedFilePath) {
var _a;
if (importedFilePath === void 0) { importedFilePath = ts.toPath(importedFileName, host.getCurrentDirectory(), ts.hostGetCanonicalFileName(host)); }
var cache = (_a = host.getModuleSpecifierCache) === null || _a === void 0 ? void 0 : _a.call(host);
if (cache) {
var cached = cache.get(importingFilePath, importedFilePath, preferences);
if (cached === null || cached === void 0 ? void 0 : cached.modulePaths)
return cached.modulePaths;
}
var modulePaths = getAllModulePathsWorker(importingFilePath, importedFileName, host);
if (cache) {
cache.setModulePaths(importingFilePath, importedFilePath, preferences, modulePaths);
}
return modulePaths;
}
function getAllModulePathsWorker(importingFileName, importedFileName, host) {
var getCanonicalFileName = ts.hostGetCanonicalFileName(host);
var allFileNames = new ts.Map();
var importedFileFromNodeModules = false;
forEachFileNameOfModule(importingFileName, importedFileName, host,
/*preferSymlinks*/ true, function (path, isRedirect) {
var isInNodeModules = ts.pathContainsNodeModules(path);
allFileNames.set(path, { path: getCanonicalFileName(path), isRedirect: isRedirect, isInNodeModules: isInNodeModules });
importedFileFromNodeModules = importedFileFromNodeModules || isInNodeModules;
// don't return value, so we collect everything
});
// Sort by paths closest to importing file Name directory
var sortedPaths = [];
var _loop_31 = function (directory) {
var directoryStart = ts.ensureTrailingDirectorySeparator(directory);
var pathsInDirectory;
allFileNames.forEach(function (_a, fileName) {
var path = _a.path, isRedirect = _a.isRedirect, isInNodeModules = _a.isInNodeModules;
if (ts.startsWith(path, directoryStart)) {
(pathsInDirectory || (pathsInDirectory = [])).push({ path: fileName, isRedirect: isRedirect, isInNodeModules: isInNodeModules });
allFileNames.delete(fileName);
}
});
if (pathsInDirectory) {
if (pathsInDirectory.length > 1) {
pathsInDirectory.sort(comparePathsByRedirectAndNumberOfDirectorySeparators);
}
sortedPaths.push.apply(sortedPaths, pathsInDirectory);
}
var newDirectory = ts.getDirectoryPath(directory);
if (newDirectory === directory)
return out_directory_1 = directory, "break";
directory = newDirectory;
out_directory_1 = directory;
};
var out_directory_1;
for (var directory = ts.getDirectoryPath(importingFileName); allFileNames.size !== 0;) {
var state_9 = _loop_31(directory);
directory = out_directory_1;
if (state_9 === "break")
break;
}
if (allFileNames.size) {
var remainingPaths = ts.arrayFrom(allFileNames.values());
if (remainingPaths.length > 1)
remainingPaths.sort(comparePathsByRedirectAndNumberOfDirectorySeparators);
sortedPaths.push.apply(sortedPaths, remainingPaths);
}
return sortedPaths;
}
function tryGetModuleNameFromAmbientModule(moduleSymbol, checker) {
var _a;
var decl = (_a = moduleSymbol.declarations) === null || _a === void 0 ? void 0 : _a.find(function (d) { return ts.isNonGlobalAmbientModule(d) && (!ts.isExternalModuleAugmentation(d) || !ts.isExternalModuleNameRelative(ts.getTextOfIdentifierOrLiteral(d.name))); });
if (decl) {
return decl.name.text;
}
// the module could be a namespace, which is export through "export=" from an ambient module.
/**
* declare module "m" {
* namespace ns {
* class c {}
* }
* export = ns;
* }
*/
// `import {c} from "m";` is valid, in which case, `moduleSymbol` is "ns", but the module name should be "m"
var ambientModuleDeclareCandidates = ts.mapDefined(moduleSymbol.declarations, function (d) {
var _a, _b, _c, _d;
if (!ts.isModuleDeclaration(d))
return;
var topNamespace = getTopNamespace(d);
if (!(((_a = topNamespace === null || topNamespace === void 0 ? void 0 : topNamespace.parent) === null || _a === void 0 ? void 0 : _a.parent)
&& ts.isModuleBlock(topNamespace.parent) && ts.isAmbientModule(topNamespace.parent.parent) && ts.isSourceFile(topNamespace.parent.parent.parent)))
return;
var exportAssignment = (_d = (_c = (_b = topNamespace.parent.parent.symbol.exports) === null || _b === void 0 ? void 0 : _b.get("export=")) === null || _c === void 0 ? void 0 : _c.valueDeclaration) === null || _d === void 0 ? void 0 : _d.expression;
if (!exportAssignment)
return;
var exportSymbol = checker.getSymbolAtLocation(exportAssignment);
if (!exportSymbol)
return;
var originalExportSymbol = (exportSymbol === null || exportSymbol === void 0 ? void 0 : exportSymbol.flags) & 2097152 /* Alias */ ? checker.getAliasedSymbol(exportSymbol) : exportSymbol;
if (originalExportSymbol === d.symbol)
return topNamespace.parent.parent;
function getTopNamespace(namespaceDeclaration) {
while (namespaceDeclaration.flags & 4 /* NestedNamespace */) {
namespaceDeclaration = namespaceDeclaration.parent;
}
return namespaceDeclaration;
}
});
var ambientModuleDeclare = ambientModuleDeclareCandidates[0];
if (ambientModuleDeclare) {
return ambientModuleDeclare.name.text;
}
}
function tryGetModuleNameFromPaths(relativeToBaseUrlWithIndex, relativeToBaseUrl, paths) {
for (var key in paths) {
for (var _i = 0, _a = paths[key]; _i < _a.length; _i++) {
var patternText_1 = _a[_i];
var pattern = ts.removeFileExtension(ts.normalizePath(patternText_1));
var indexOfStar = pattern.indexOf("*");
if (indexOfStar !== -1) {
var prefix = pattern.substr(0, indexOfStar);
var suffix = pattern.substr(indexOfStar + 1);
if (relativeToBaseUrl.length >= prefix.length + suffix.length &&
ts.startsWith(relativeToBaseUrl, prefix) &&
ts.endsWith(relativeToBaseUrl, suffix) ||
!suffix && relativeToBaseUrl === ts.removeTrailingDirectorySeparator(prefix)) {
var matchedStar = relativeToBaseUrl.substr(prefix.length, relativeToBaseUrl.length - suffix.length - prefix.length);
return key.replace("*", matchedStar);
}
}
else if (pattern === relativeToBaseUrl || pattern === relativeToBaseUrlWithIndex) {
return key;
}
}
}
}
function tryGetModuleNameFromRootDirs(rootDirs, moduleFileName, sourceDirectory, getCanonicalFileName, ending, compilerOptions) {
var normalizedTargetPath = getPathRelativeToRootDirs(moduleFileName, rootDirs, getCanonicalFileName);
if (normalizedTargetPath === undefined) {
return undefined;
}
var normalizedSourcePath = getPathRelativeToRootDirs(sourceDirectory, rootDirs, getCanonicalFileName);
var relativePath = normalizedSourcePath !== undefined ? ts.ensurePathIsNonModuleName(ts.getRelativePathFromDirectory(normalizedSourcePath, normalizedTargetPath, getCanonicalFileName)) : normalizedTargetPath;
return ts.getEmitModuleResolutionKind(compilerOptions) === ts.ModuleResolutionKind.NodeJs
? removeExtensionAndIndexPostFix(relativePath, ending, compilerOptions)
: ts.removeFileExtension(relativePath);
}
function tryGetModuleNameAsNodeModule(_a, _b, host, options, packageNameOnly) {
var path = _a.path, isRedirect = _a.isRedirect;
var getCanonicalFileName = _b.getCanonicalFileName, sourceDirectory = _b.sourceDirectory;
if (!host.fileExists || !host.readFile) {
return undefined;
}
var parts = getNodeModulePathParts(path);
if (!parts) {
return undefined;
}
// Simplify the full file path to something that can be resolved by Node.
var moduleSpecifier = path;
var isPackageRootPath = false;
if (!packageNameOnly) {
var packageRootIndex = parts.packageRootIndex;
var moduleFileNameForExtensionless = void 0;
while (true) {
// If the module could be imported by a directory name, use that directory's name
var _c = tryDirectoryWithPackageJson(packageRootIndex), moduleFileToTry = _c.moduleFileToTry, packageRootPath = _c.packageRootPath;
if (packageRootPath) {
moduleSpecifier = packageRootPath;
isPackageRootPath = true;
break;
}
if (!moduleFileNameForExtensionless)
moduleFileNameForExtensionless = moduleFileToTry;
// try with next level of directory
packageRootIndex = path.indexOf(ts.directorySeparator, packageRootIndex + 1);
if (packageRootIndex === -1) {
moduleSpecifier = getExtensionlessFileName(moduleFileNameForExtensionless);
break;
}
}
}
if (isRedirect && !isPackageRootPath) {
return undefined;
}
var globalTypingsCacheLocation = host.getGlobalTypingsCacheLocation && host.getGlobalTypingsCacheLocation();
// Get a path that's relative to node_modules or the importing file's path
// if node_modules folder is in this folder or any of its parent folders, no need to keep it.
var pathToTopLevelNodeModules = getCanonicalFileName(moduleSpecifier.substring(0, parts.topLevelNodeModulesIndex));
if (!(ts.startsWith(sourceDirectory, pathToTopLevelNodeModules) || globalTypingsCacheLocation && ts.startsWith(getCanonicalFileName(globalTypingsCacheLocation), pathToTopLevelNodeModules))) {
return undefined;
}
// If the module was found in @types, get the actual Node package name
var nodeModulesDirectoryName = moduleSpecifier.substring(parts.topLevelPackageNameIndex + 1);
var packageName = ts.getPackageNameFromTypesPackageName(nodeModulesDirectoryName);
// For classic resolution, only allow importing from node_modules/@types, not other node_modules
return ts.getEmitModuleResolutionKind(options) !== ts.ModuleResolutionKind.NodeJs && packageName === nodeModulesDirectoryName ? undefined : packageName;
function tryDirectoryWithPackageJson(packageRootIndex) {
var packageRootPath = path.substring(0, packageRootIndex);
var packageJsonPath = ts.combinePaths(packageRootPath, "package.json");
var moduleFileToTry = path;
if (host.fileExists(packageJsonPath)) {
var packageJsonContent = JSON.parse(host.readFile(packageJsonPath));
var versionPaths = packageJsonContent.typesVersions
? ts.getPackageJsonTypesVersionsPaths(packageJsonContent.typesVersions)
: undefined;
if (versionPaths) {
var subModuleName = path.slice(packageRootPath.length + 1);
var fromPaths = tryGetModuleNameFromPaths(ts.removeFileExtension(subModuleName), removeExtensionAndIndexPostFix(subModuleName, 0 /* Minimal */, options), versionPaths.paths);
if (fromPaths !== undefined) {
moduleFileToTry = ts.combinePaths(packageRootPath, fromPaths);
}
}
// If the file is the main module, it can be imported by the package name
var mainFileRelative = packageJsonContent.typings || packageJsonContent.types || packageJsonContent.main;
if (ts.isString(mainFileRelative)) {
var mainExportFile = ts.toPath(mainFileRelative, packageRootPath, getCanonicalFileName);
if (ts.removeFileExtension(mainExportFile) === ts.removeFileExtension(getCanonicalFileName(moduleFileToTry))) {
return { packageRootPath: packageRootPath, moduleFileToTry: moduleFileToTry };
}
}
}
return { moduleFileToTry: moduleFileToTry };
}
function getExtensionlessFileName(path) {
// We still have a file name - remove the extension
var fullModulePathWithoutExtension = ts.removeFileExtension(path);
// If the file is /index, it can be imported by its directory name
// IFF there is not _also_ a file by the same name
if (getCanonicalFileName(fullModulePathWithoutExtension.substring(parts.fileNameIndex)) === "/index" && !tryGetAnyFileFromPath(host, fullModulePathWithoutExtension.substring(0, parts.fileNameIndex))) {
return fullModulePathWithoutExtension.substring(0, parts.fileNameIndex);
}
return fullModulePathWithoutExtension;
}
}
function tryGetAnyFileFromPath(host, path) {
if (!host.fileExists)
return;
// We check all js, `node` and `json` extensions in addition to TS, since node module resolution would also choose those over the directory
var extensions = ts.getSupportedExtensions({ allowJs: true }, [{ extension: "node", isMixedContent: false }, { extension: "json", isMixedContent: false, scriptKind: 6 /* JSON */ }]);
for (var _i = 0, extensions_3 = extensions; _i < extensions_3.length; _i++) {
var e = extensions_3[_i];
var fullPath = path + e;
if (host.fileExists(fullPath)) {
return fullPath;
}
}
}
function getNodeModulePathParts(fullPath) {
// If fullPath can't be valid module file within node_modules, returns undefined.
// Example of expected pattern: /base/path/node_modules/[@scope/otherpackage/@otherscope/node_modules/]package/[subdirectory/]file.js
// Returns indices: ^ ^ ^ ^
var topLevelNodeModulesIndex = 0;
var topLevelPackageNameIndex = 0;
var packageRootIndex = 0;
var fileNameIndex = 0;
var States;
(function (States) {
States[States["BeforeNodeModules"] = 0] = "BeforeNodeModules";
States[States["NodeModules"] = 1] = "NodeModules";
States[States["Scope"] = 2] = "Scope";
States[States["PackageContent"] = 3] = "PackageContent";
})(States || (States = {}));
var partStart = 0;
var partEnd = 0;
var state = 0 /* BeforeNodeModules */;
while (partEnd >= 0) {
partStart = partEnd;
partEnd = fullPath.indexOf("/", partStart + 1);
switch (state) {
case 0 /* BeforeNodeModules */:
if (fullPath.indexOf(ts.nodeModulesPathPart, partStart) === partStart) {
topLevelNodeModulesIndex = partStart;
topLevelPackageNameIndex = partEnd;
state = 1 /* NodeModules */;
}
break;
case 1 /* NodeModules */:
case 2 /* Scope */:
if (state === 1 /* NodeModules */ && fullPath.charAt(partStart + 1) === "@") {
state = 2 /* Scope */;
}
else {
packageRootIndex = partEnd;
state = 3 /* PackageContent */;
}
break;
case 3 /* PackageContent */:
if (fullPath.indexOf(ts.nodeModulesPathPart, partStart) === partStart) {
state = 1 /* NodeModules */;
}
else {
state = 3 /* PackageContent */;
}
break;
}
}
fileNameIndex = partStart;
return state > 1 /* NodeModules */ ? { topLevelNodeModulesIndex: topLevelNodeModulesIndex, topLevelPackageNameIndex: topLevelPackageNameIndex, packageRootIndex: packageRootIndex, fileNameIndex: fileNameIndex } : undefined;
}
function getPathRelativeToRootDirs(path, rootDirs, getCanonicalFileName) {
return ts.firstDefined(rootDirs, function (rootDir) {
var relativePath = getRelativePathIfInDirectory(path, rootDir, getCanonicalFileName); // TODO: GH#18217
return isPathRelativeToParent(relativePath) ? undefined : relativePath;
});
}
function removeExtensionAndIndexPostFix(fileName, ending, options) {
if (ts.fileExtensionIs(fileName, ".json" /* Json */))
return fileName;
var noExtension = ts.removeFileExtension(fileName);
switch (ending) {
case 0 /* Minimal */:
return ts.removeSuffix(noExtension, "/index");
case 1 /* Index */:
return noExtension;
case 2 /* JsExtension */:
return noExtension + getJSExtensionForFile(fileName, options);
default:
return ts.Debug.assertNever(ending);
}
}
function getJSExtensionForFile(fileName, options) {
var _a;
return (_a = tryGetJSExtensionForFile(fileName, options)) !== null && _a !== void 0 ? _a : ts.Debug.fail("Extension " + ts.extensionFromPath(fileName) + " is unsupported:: FileName:: " + fileName);
}
function tryGetJSExtensionForFile(fileName, options) {
var ext = ts.tryGetExtensionFromPath(fileName);
switch (ext) {
case ".ts" /* Ts */:
case ".d.ts" /* Dts */:
return ".js" /* Js */;
case ".tsx" /* Tsx */:
return options.jsx === 1 /* Preserve */ ? ".jsx" /* Jsx */ : ".js" /* Js */;
case ".js" /* Js */:
case ".jsx" /* Jsx */:
case ".json" /* Json */:
return ext;
default:
return undefined;
}
}
moduleSpecifiers_1.tryGetJSExtensionForFile = tryGetJSExtensionForFile;
function getRelativePathIfInDirectory(path, directoryPath, getCanonicalFileName) {
var relativePath = ts.getRelativePathToDirectoryOrUrl(directoryPath, path, directoryPath, getCanonicalFileName, /*isAbsolutePathAnUrl*/ false);
return ts.isRootedDiskPath(relativePath) ? undefined : relativePath;
}
function isPathRelativeToParent(path) {
return ts.startsWith(path, "..");
}
})(moduleSpecifiers = ts.moduleSpecifiers || (ts.moduleSpecifiers = {}));
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
var sysFormatDiagnosticsHost = ts.sys ? {
getCurrentDirectory: function () { return ts.sys.getCurrentDirectory(); },
getNewLine: function () { return ts.sys.newLine; },
getCanonicalFileName: ts.createGetCanonicalFileName(ts.sys.useCaseSensitiveFileNames)
} : undefined;
/**
* Create a function that reports error by writing to the system and handles the formating of the diagnostic
*/
function createDiagnosticReporter(system, pretty) {
var host = system === ts.sys && sysFormatDiagnosticsHost ? sysFormatDiagnosticsHost : {
getCurrentDirectory: function () { return system.getCurrentDirectory(); },
getNewLine: function () { return system.newLine; },
getCanonicalFileName: ts.createGetCanonicalFileName(system.useCaseSensitiveFileNames),
};
if (!pretty) {
return function (diagnostic) { return system.write(ts.formatDiagnostic(diagnostic, host)); };
}
var diagnostics = new Array(1);
return function (diagnostic) {
diagnostics[0] = diagnostic;
system.write(ts.formatDiagnosticsWithColorAndContext(diagnostics, host) + host.getNewLine());
diagnostics[0] = undefined; // TODO: GH#18217
};
}
ts.createDiagnosticReporter = createDiagnosticReporter;
/**
* @returns Whether the screen was cleared.
*/
function clearScreenIfNotWatchingForFileChanges(system, diagnostic, options) {
if (system.clearScreen &&
!options.preserveWatchOutput &&
!options.extendedDiagnostics &&
!options.diagnostics &&
ts.contains(ts.screenStartingMessageCodes, diagnostic.code)) {
system.clearScreen();
return true;
}
return false;
}
ts.screenStartingMessageCodes = [
ts.Diagnostics.Starting_compilation_in_watch_mode.code,
ts.Diagnostics.File_change_detected_Starting_incremental_compilation.code,
];
function getPlainDiagnosticFollowingNewLines(diagnostic, newLine) {
return ts.contains(ts.screenStartingMessageCodes, diagnostic.code)
? newLine + newLine
: newLine;
}
/**
* Get locale specific time based on whether we are in test mode
*/
function getLocaleTimeString(system) {
return !system.now ?
new Date().toLocaleTimeString() :
system.now().toLocaleTimeString("en-US", { timeZone: "UTC" });
}
ts.getLocaleTimeString = getLocaleTimeString;
/**
* Create a function that reports watch status by writing to the system and handles the formating of the diagnostic
*/
function createWatchStatusReporter(system, pretty) {
return pretty ?
function (diagnostic, newLine, options) {
clearScreenIfNotWatchingForFileChanges(system, diagnostic, options);
var output = "[" + ts.formatColorAndReset(getLocaleTimeString(system), ts.ForegroundColorEscapeSequences.Grey) + "] ";
output += "" + ts.flattenDiagnosticMessageText(diagnostic.messageText, system.newLine) + (newLine + newLine);
system.write(output);
} :
function (diagnostic, newLine, options) {
var output = "";
if (!clearScreenIfNotWatchingForFileChanges(system, diagnostic, options)) {
output += newLine;
}
output += getLocaleTimeString(system) + " - ";
output += "" + ts.flattenDiagnosticMessageText(diagnostic.messageText, system.newLine) + getPlainDiagnosticFollowingNewLines(diagnostic, newLine);
system.write(output);
};
}
ts.createWatchStatusReporter = createWatchStatusReporter;
/** Parses config file using System interface */
function parseConfigFileWithSystem(configFileName, optionsToExtend, extendedConfigCache, watchOptionsToExtend, system, reportDiagnostic) {
var host = system;
host.onUnRecoverableConfigFileDiagnostic = function (diagnostic) { return reportUnrecoverableDiagnostic(system, reportDiagnostic, diagnostic); };
var result = ts.getParsedCommandLineOfConfigFile(configFileName, optionsToExtend, host, extendedConfigCache, watchOptionsToExtend);
host.onUnRecoverableConfigFileDiagnostic = undefined; // TODO: GH#18217
return result;
}
ts.parseConfigFileWithSystem = parseConfigFileWithSystem;
function getErrorCountForSummary(diagnostics) {
return ts.countWhere(diagnostics, function (diagnostic) { return diagnostic.category === ts.DiagnosticCategory.Error; });
}
ts.getErrorCountForSummary = getErrorCountForSummary;
function getWatchErrorSummaryDiagnosticMessage(errorCount) {
return errorCount === 1 ?
ts.Diagnostics.Found_1_error_Watching_for_file_changes :
ts.Diagnostics.Found_0_errors_Watching_for_file_changes;
}
ts.getWatchErrorSummaryDiagnosticMessage = getWatchErrorSummaryDiagnosticMessage;
function getErrorSummaryText(errorCount, newLine) {
if (errorCount === 0)
return "";
var d = ts.createCompilerDiagnostic(errorCount === 1 ? ts.Diagnostics.Found_1_error : ts.Diagnostics.Found_0_errors, errorCount);
return "" + newLine + ts.flattenDiagnosticMessageText(d.messageText, newLine) + newLine + newLine;
}
ts.getErrorSummaryText = getErrorSummaryText;
function isBuilderProgram(program) {
return !!program.getState;
}
ts.isBuilderProgram = isBuilderProgram;
function listFiles(program, write) {
var options = program.getCompilerOptions();
if (options.explainFiles) {
explainFiles(isBuilderProgram(program) ? program.getProgram() : program, write);
}
else if (options.listFiles || options.listFilesOnly) {
ts.forEach(program.getSourceFiles(), function (file) {
write(file.fileName);
});
}
}
ts.listFiles = listFiles;
function explainFiles(program, write) {
var _a, _b;
var reasons = program.getFileIncludeReasons();
var getCanonicalFileName = ts.createGetCanonicalFileName(program.useCaseSensitiveFileNames());
var relativeFileName = function (fileName) { return ts.convertToRelativePath(fileName, program.getCurrentDirectory(), getCanonicalFileName); };
for (var _i = 0, _c = program.getSourceFiles(); _i < _c.length; _i++) {
var file = _c[_i];
write("" + toFileName(file, relativeFileName));
(_a = reasons.get(file.path)) === null || _a === void 0 ? void 0 : _a.forEach(function (reason) { return write(" " + fileIncludeReasonToDiagnostics(program, reason, relativeFileName).messageText); });
(_b = explainIfFileIsRedirect(file, relativeFileName)) === null || _b === void 0 ? void 0 : _b.forEach(function (d) { return write(" " + d.messageText); });
}
}
ts.explainFiles = explainFiles;
function explainIfFileIsRedirect(file, fileNameConvertor) {
var result;
if (file.path !== file.resolvedPath) {
(result || (result = [])).push(ts.chainDiagnosticMessages(
/*details*/ undefined, ts.Diagnostics.File_is_output_of_project_reference_source_0, toFileName(file.originalFileName, fileNameConvertor)));
}
if (file.redirectInfo) {
(result || (result = [])).push(ts.chainDiagnosticMessages(
/*details*/ undefined, ts.Diagnostics.File_redirects_to_file_0, toFileName(file.redirectInfo.redirectTarget, fileNameConvertor)));
}
return result;
}
ts.explainIfFileIsRedirect = explainIfFileIsRedirect;
function getMatchedFileSpec(program, fileName) {
var _a;
var configFile = program.getCompilerOptions().configFile;
if (!((_a = configFile === null || configFile === void 0 ? void 0 : configFile.configFileSpecs) === null || _a === void 0 ? void 0 : _a.validatedFilesSpec))
return undefined;
var getCanonicalFileName = ts.createGetCanonicalFileName(program.useCaseSensitiveFileNames());
var filePath = getCanonicalFileName(fileName);
var basePath = ts.getDirectoryPath(ts.getNormalizedAbsolutePath(configFile.fileName, program.getCurrentDirectory()));
return ts.find(configFile.configFileSpecs.validatedFilesSpec, function (fileSpec) { return getCanonicalFileName(ts.getNormalizedAbsolutePath(fileSpec, basePath)) === filePath; });
}
ts.getMatchedFileSpec = getMatchedFileSpec;
function getMatchedIncludeSpec(program, fileName) {
var _a, _b;
var configFile = program.getCompilerOptions().configFile;
if (!((_a = configFile === null || configFile === void 0 ? void 0 : configFile.configFileSpecs) === null || _a === void 0 ? void 0 : _a.validatedIncludeSpecs))
return undefined;
var isJsonFile = ts.fileExtensionIs(fileName, ".json" /* Json */);
var basePath = ts.getDirectoryPath(ts.getNormalizedAbsolutePath(configFile.fileName, program.getCurrentDirectory()));
var useCaseSensitiveFileNames = program.useCaseSensitiveFileNames();
return ts.find((_b = configFile === null || configFile === void 0 ? void 0 : configFile.configFileSpecs) === null || _b === void 0 ? void 0 : _b.validatedIncludeSpecs, function (includeSpec) {
if (isJsonFile && !ts.endsWith(includeSpec, ".json" /* Json */))
return false;
var pattern = ts.getPatternFromSpec(includeSpec, basePath, "files");
return !!pattern && ts.getRegexFromPattern("(" + pattern + ")$", useCaseSensitiveFileNames).test(fileName);
});
}
ts.getMatchedIncludeSpec = getMatchedIncludeSpec;
function fileIncludeReasonToDiagnostics(program, reason, fileNameConvertor) {
var _a, _b;
var options = program.getCompilerOptions();
if (ts.isReferencedFile(reason)) {
var referenceLocation = ts.getReferencedFileLocation(function (path) { return program.getSourceFileByPath(path); }, reason);
var referenceText = ts.isReferenceFileLocation(referenceLocation) ? referenceLocation.file.text.substring(referenceLocation.pos, referenceLocation.end) : "\"" + referenceLocation.text + "\"";
var message = void 0;
ts.Debug.assert(ts.isReferenceFileLocation(referenceLocation) || reason.kind === ts.FileIncludeKind.Import, "Only synthetic references are imports");
switch (reason.kind) {
case ts.FileIncludeKind.Import:
if (ts.isReferenceFileLocation(referenceLocation)) {
message = referenceLocation.packageId ?
ts.Diagnostics.Imported_via_0_from_file_1_with_packageId_2 :
ts.Diagnostics.Imported_via_0_from_file_1;
}
else if (referenceLocation.text === ts.externalHelpersModuleNameText) {
message = referenceLocation.packageId ?
ts.Diagnostics.Imported_via_0_from_file_1_with_packageId_2_to_import_importHelpers_as_specified_in_compilerOptions :
ts.Diagnostics.Imported_via_0_from_file_1_to_import_importHelpers_as_specified_in_compilerOptions;
}
else {
message = referenceLocation.packageId ?
ts.Diagnostics.Imported_via_0_from_file_1_with_packageId_2_to_import_jsx_and_jsxs_factory_functions :
ts.Diagnostics.Imported_via_0_from_file_1_to_import_jsx_and_jsxs_factory_functions;
}
break;
case ts.FileIncludeKind.ReferenceFile:
ts.Debug.assert(!referenceLocation.packageId);
message = ts.Diagnostics.Referenced_via_0_from_file_1;
break;
case ts.FileIncludeKind.TypeReferenceDirective:
message = referenceLocation.packageId ?
ts.Diagnostics.Type_library_referenced_via_0_from_file_1_with_packageId_2 :
ts.Diagnostics.Type_library_referenced_via_0_from_file_1;
break;
case ts.FileIncludeKind.LibReferenceDirective:
ts.Debug.assert(!referenceLocation.packageId);
message = ts.Diagnostics.Library_referenced_via_0_from_file_1;
break;
default:
ts.Debug.assertNever(reason);
}
return ts.chainDiagnosticMessages(
/*details*/ undefined, message, referenceText, toFileName(referenceLocation.file, fileNameConvertor), referenceLocation.packageId && ts.packageIdToString(referenceLocation.packageId));
}
switch (reason.kind) {
case ts.FileIncludeKind.RootFile:
if (!((_a = options.configFile) === null || _a === void 0 ? void 0 : _a.configFileSpecs))
return ts.chainDiagnosticMessages(/*details*/ undefined, ts.Diagnostics.Root_file_specified_for_compilation);
var fileName = ts.getNormalizedAbsolutePath(program.getRootFileNames()[reason.index], program.getCurrentDirectory());
var matchedByFiles = getMatchedFileSpec(program, fileName);
if (matchedByFiles)
return ts.chainDiagnosticMessages(/*details*/ undefined, ts.Diagnostics.Part_of_files_list_in_tsconfig_json);
var matchedByInclude = getMatchedIncludeSpec(program, fileName);
return matchedByInclude ?
ts.chainDiagnosticMessages(
/*details*/ undefined, ts.Diagnostics.Matched_by_include_pattern_0_in_1, matchedByInclude, toFileName(options.configFile, fileNameConvertor)) :
// Could be additional files specified as roots
ts.chainDiagnosticMessages(/*details*/ undefined, ts.Diagnostics.Root_file_specified_for_compilation);
case ts.FileIncludeKind.SourceFromProjectReference:
case ts.FileIncludeKind.OutputFromProjectReference:
var isOutput = reason.kind === ts.FileIncludeKind.OutputFromProjectReference;
var referencedResolvedRef = ts.Debug.checkDefined((_b = program.getResolvedProjectReferences()) === null || _b === void 0 ? void 0 : _b[reason.index]);
return ts.chainDiagnosticMessages(
/*details*/ undefined, ts.outFile(options) ?
isOutput ?
ts.Diagnostics.Output_from_referenced_project_0_included_because_1_specified :
ts.Diagnostics.Source_from_referenced_project_0_included_because_1_specified :
isOutput ?
ts.Diagnostics.Output_from_referenced_project_0_included_because_module_is_specified_as_none :
ts.Diagnostics.Source_from_referenced_project_0_included_because_module_is_specified_as_none, toFileName(referencedResolvedRef.sourceFile.fileName, fileNameConvertor), options.outFile ? "--outFile" : "--out");
case ts.FileIncludeKind.AutomaticTypeDirectiveFile:
return ts.chainDiagnosticMessages(
/*details*/ undefined, options.types ?
reason.packageId ?
ts.Diagnostics.Entry_point_of_type_library_0_specified_in_compilerOptions_with_packageId_1 :
ts.Diagnostics.Entry_point_of_type_library_0_specified_in_compilerOptions :
reason.packageId ?
ts.Diagnostics.Entry_point_for_implicit_type_library_0_with_packageId_1 :
ts.Diagnostics.Entry_point_for_implicit_type_library_0, reason.typeReference, reason.packageId && ts.packageIdToString(reason.packageId));
case ts.FileIncludeKind.LibFile:
if (reason.index !== undefined)
return ts.chainDiagnosticMessages(/*details*/ undefined, ts.Diagnostics.Library_0_specified_in_compilerOptions, options.lib[reason.index]);
var target = ts.forEachEntry(ts.targetOptionDeclaration.type, function (value, key) { return value === options.target ? key : undefined; });
return ts.chainDiagnosticMessages(
/*details*/ undefined, target ?
ts.Diagnostics.Default_library_for_target_0 :
ts.Diagnostics.Default_library, target);
default:
ts.Debug.assertNever(reason);
}
}
ts.fileIncludeReasonToDiagnostics = fileIncludeReasonToDiagnostics;
function toFileName(file, fileNameConvertor) {
var fileName = ts.isString(file) ? file : file.fileName;
return fileNameConvertor ? fileNameConvertor(fileName) : fileName;
}
/**
* Helper that emit files, report diagnostics and lists emitted and/or source files depending on compiler options
*/
function emitFilesAndReportErrors(program, reportDiagnostic, write, reportSummary, writeFile, cancellationToken, emitOnlyDtsFiles, customTransformers) {
var isListFilesOnly = !!program.getCompilerOptions().listFilesOnly;
// First get and report any syntactic errors.
var allDiagnostics = program.getConfigFileParsingDiagnostics().slice();
var configFileParsingDiagnosticsLength = allDiagnostics.length;
ts.addRange(allDiagnostics, program.getSyntacticDiagnostics(/*sourceFile*/ undefined, cancellationToken));
// If we didn't have any syntactic errors, then also try getting the global and
// semantic errors.
if (allDiagnostics.length === configFileParsingDiagnosticsLength) {
ts.addRange(allDiagnostics, program.getOptionsDiagnostics(cancellationToken));
if (!isListFilesOnly) {
ts.addRange(allDiagnostics, program.getGlobalDiagnostics(cancellationToken));
if (allDiagnostics.length === configFileParsingDiagnosticsLength) {
ts.addRange(allDiagnostics, program.getSemanticDiagnostics(/*sourceFile*/ undefined, cancellationToken));
}
}
}
// Emit and report any errors we ran into.
var emitResult = isListFilesOnly
? { emitSkipped: true, diagnostics: ts.emptyArray }
: program.emit(/*targetSourceFile*/ undefined, writeFile, cancellationToken, emitOnlyDtsFiles, customTransformers);
var emittedFiles = emitResult.emittedFiles, emitDiagnostics = emitResult.diagnostics;
ts.addRange(allDiagnostics, emitDiagnostics);
var diagnostics = ts.sortAndDeduplicateDiagnostics(allDiagnostics);
diagnostics.forEach(reportDiagnostic);
if (write) {
var currentDir_1 = program.getCurrentDirectory();
ts.forEach(emittedFiles, function (file) {
var filepath = ts.getNormalizedAbsolutePath(file, currentDir_1);
write("TSFILE: " + filepath);
});
listFiles(program, write);
}
if (reportSummary) {
reportSummary(getErrorCountForSummary(diagnostics));
}
return {
emitResult: emitResult,
diagnostics: diagnostics,
};
}
ts.emitFilesAndReportErrors = emitFilesAndReportErrors;
function emitFilesAndReportErrorsAndGetExitStatus(program, reportDiagnostic, write, reportSummary, writeFile, cancellationToken, emitOnlyDtsFiles, customTransformers) {
var _a = emitFilesAndReportErrors(program, reportDiagnostic, write, reportSummary, writeFile, cancellationToken, emitOnlyDtsFiles, customTransformers), emitResult = _a.emitResult, diagnostics = _a.diagnostics;
if (emitResult.emitSkipped && diagnostics.length > 0) {
// If the emitter didn't emit anything, then pass that value along.
return ts.ExitStatus.DiagnosticsPresent_OutputsSkipped;
}
else if (diagnostics.length > 0) {
// The emitter emitted something, inform the caller if that happened in the presence
// of diagnostics or not.
return ts.ExitStatus.DiagnosticsPresent_OutputsGenerated;
}
return ts.ExitStatus.Success;
}
ts.emitFilesAndReportErrorsAndGetExitStatus = emitFilesAndReportErrorsAndGetExitStatus;
ts.noopFileWatcher = { close: ts.noop };
ts.returnNoopFileWatcher = function () { return ts.noopFileWatcher; };
function createWatchHost(system, reportWatchStatus) {
if (system === void 0) { system = ts.sys; }
var onWatchStatusChange = reportWatchStatus || createWatchStatusReporter(system);
return {
onWatchStatusChange: onWatchStatusChange,
watchFile: ts.maybeBind(system, system.watchFile) || ts.returnNoopFileWatcher,
watchDirectory: ts.maybeBind(system, system.watchDirectory) || ts.returnNoopFileWatcher,
setTimeout: ts.maybeBind(system, system.setTimeout) || ts.noop,
clearTimeout: ts.maybeBind(system, system.clearTimeout) || ts.noop
};
}
ts.createWatchHost = createWatchHost;
ts.WatchType = {
ConfigFile: "Config file",
ExtendedConfigFile: "Extended config file",
SourceFile: "Source file",
MissingFile: "Missing file",
WildcardDirectory: "Wild card directory",
FailedLookupLocations: "Failed Lookup Locations",
TypeRoots: "Type roots",
ConfigFileOfReferencedProject: "Config file of referened project",
ExtendedConfigOfReferencedProject: "Extended config file of referenced project",
WildcardDirectoryOfReferencedProject: "Wild card directory of referenced project",
PackageJson: "package.json file",
};
function createWatchFactory(host, options) {
var watchLogLevel = host.trace ? options.extendedDiagnostics ? ts.WatchLogLevel.Verbose : options.diagnostics ? ts.WatchLogLevel.TriggerOnly : ts.WatchLogLevel.None : ts.WatchLogLevel.None;
var writeLog = watchLogLevel !== ts.WatchLogLevel.None ? (function (s) { return host.trace(s); }) : ts.noop;
var result = ts.getWatchFactory(host, watchLogLevel, writeLog);
result.writeLog = writeLog;
return result;
}
ts.createWatchFactory = createWatchFactory;
function createCompilerHostFromProgramHost(host, getCompilerOptions, directoryStructureHost) {
if (directoryStructureHost === void 0) { directoryStructureHost = host; }
var useCaseSensitiveFileNames = host.useCaseSensitiveFileNames();
var hostGetNewLine = ts.memoize(function () { return host.getNewLine(); });
return {
getSourceFile: function (fileName, languageVersion, onError) {
var text;
try {
ts.performance.mark("beforeIORead");
text = host.readFile(fileName, getCompilerOptions().charset);
ts.performance.mark("afterIORead");
ts.performance.measure("I/O Read", "beforeIORead", "afterIORead");
}
catch (e) {
if (onError) {
onError(e.message);
}
text = "";
}
return text !== undefined ? ts.createSourceFile(fileName, text, languageVersion) : undefined;
},
getDefaultLibLocation: ts.maybeBind(host, host.getDefaultLibLocation),
getDefaultLibFileName: function (options) { return host.getDefaultLibFileName(options); },
writeFile: writeFile,
getCurrentDirectory: ts.memoize(function () { return host.getCurrentDirectory(); }),
useCaseSensitiveFileNames: function () { return useCaseSensitiveFileNames; },
getCanonicalFileName: ts.createGetCanonicalFileName(useCaseSensitiveFileNames),
getNewLine: function () { return ts.getNewLineCharacter(getCompilerOptions(), hostGetNewLine); },
fileExists: function (f) { return host.fileExists(f); },
readFile: function (f) { return host.readFile(f); },
trace: ts.maybeBind(host, host.trace),
directoryExists: ts.maybeBind(directoryStructureHost, directoryStructureHost.directoryExists),
getDirectories: ts.maybeBind(directoryStructureHost, directoryStructureHost.getDirectories),
realpath: ts.maybeBind(host, host.realpath),
getEnvironmentVariable: ts.maybeBind(host, host.getEnvironmentVariable) || (function () { return ""; }),
createHash: ts.maybeBind(host, host.createHash),
readDirectory: ts.maybeBind(host, host.readDirectory),
disableUseFileVersionAsSignature: host.disableUseFileVersionAsSignature,
};
function writeFile(fileName, text, writeByteOrderMark, onError) {
try {
ts.performance.mark("beforeIOWrite");
// NOTE: If patchWriteFileEnsuringDirectory has been called,
// the host.writeFile will do its own directory creation and
// the ensureDirectoriesExist call will always be redundant.
ts.writeFileEnsuringDirectories(fileName, text, writeByteOrderMark, function (path, data, writeByteOrderMark) { return host.writeFile(path, data, writeByteOrderMark); }, function (path) { return host.createDirectory(path); }, function (path) { return host.directoryExists(path); });
ts.performance.mark("afterIOWrite");
ts.performance.measure("I/O Write", "beforeIOWrite", "afterIOWrite");
}
catch (e) {
if (onError) {
onError(e.message);
}
}
}
}
ts.createCompilerHostFromProgramHost = createCompilerHostFromProgramHost;
function setGetSourceFileAsHashVersioned(compilerHost, host) {
var originalGetSourceFile = compilerHost.getSourceFile;
var computeHash = ts.maybeBind(host, host.createHash) || ts.generateDjb2Hash;
compilerHost.getSourceFile = function () {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
var result = originalGetSourceFile.call.apply(originalGetSourceFile, __spreadArray([compilerHost], args, false));
if (result) {
result.version = computeHash(result.text);
}
return result;
};
}
ts.setGetSourceFileAsHashVersioned = setGetSourceFileAsHashVersioned;
/**
* Creates the watch compiler host that can be extended with config file or root file names and options host
*/
function createProgramHost(system, createProgram) {
var getDefaultLibLocation = ts.memoize(function () { return ts.getDirectoryPath(ts.normalizePath(system.getExecutingFilePath())); });
return {
useCaseSensitiveFileNames: function () { return system.useCaseSensitiveFileNames; },
getNewLine: function () { return system.newLine; },
getCurrentDirectory: ts.memoize(function () { return system.getCurrentDirectory(); }),
getDefaultLibLocation: getDefaultLibLocation,
getDefaultLibFileName: function (options) { return ts.combinePaths(getDefaultLibLocation(), ts.getDefaultLibFileName(options)); },
fileExists: function (path) { return system.fileExists(path); },
readFile: function (path, encoding) { return system.readFile(path, encoding); },
directoryExists: function (path) { return system.directoryExists(path); },
getDirectories: function (path) { return system.getDirectories(path); },
readDirectory: function (path, extensions, exclude, include, depth) { return system.readDirectory(path, extensions, exclude, include, depth); },
realpath: ts.maybeBind(system, system.realpath),
getEnvironmentVariable: ts.maybeBind(system, system.getEnvironmentVariable),
trace: function (s) { return system.write(s + system.newLine); },
createDirectory: function (path) { return system.createDirectory(path); },
writeFile: function (path, data, writeByteOrderMark) { return system.writeFile(path, data, writeByteOrderMark); },
createHash: ts.maybeBind(system, system.createHash),
createProgram: createProgram || ts.createEmitAndSemanticDiagnosticsBuilderProgram,
disableUseFileVersionAsSignature: system.disableUseFileVersionAsSignature,
};
}
ts.createProgramHost = createProgramHost;
/**
* Creates the watch compiler host that can be extended with config file or root file names and options host
*/
function createWatchCompilerHost(system, createProgram, reportDiagnostic, reportWatchStatus) {
if (system === void 0) { system = ts.sys; }
var write = function (s) { return system.write(s + system.newLine); };
var result = createProgramHost(system, createProgram);
ts.copyProperties(result, createWatchHost(system, reportWatchStatus));
result.afterProgramCreate = function (builderProgram) {
var compilerOptions = builderProgram.getCompilerOptions();
var newLine = ts.getNewLineCharacter(compilerOptions, function () { return system.newLine; });
emitFilesAndReportErrors(builderProgram, reportDiagnostic, write, function (errorCount) { return result.onWatchStatusChange(ts.createCompilerDiagnostic(getWatchErrorSummaryDiagnosticMessage(errorCount), errorCount), newLine, compilerOptions, errorCount); });
};
return result;
}
/**
* Report error and exit
*/
function reportUnrecoverableDiagnostic(system, reportDiagnostic, diagnostic) {
reportDiagnostic(diagnostic);
system.exit(ts.ExitStatus.DiagnosticsPresent_OutputsSkipped);
}
/**
* Creates the watch compiler host from system for config file in watch mode
*/
function createWatchCompilerHostOfConfigFile(_a) {
var configFileName = _a.configFileName, optionsToExtend = _a.optionsToExtend, watchOptionsToExtend = _a.watchOptionsToExtend, extraFileExtensions = _a.extraFileExtensions, system = _a.system, createProgram = _a.createProgram, reportDiagnostic = _a.reportDiagnostic, reportWatchStatus = _a.reportWatchStatus;
var diagnosticReporter = reportDiagnostic || createDiagnosticReporter(system);
var host = createWatchCompilerHost(system, createProgram, diagnosticReporter, reportWatchStatus);
host.onUnRecoverableConfigFileDiagnostic = function (diagnostic) { return reportUnrecoverableDiagnostic(system, diagnosticReporter, diagnostic); };
host.configFileName = configFileName;
host.optionsToExtend = optionsToExtend;
host.watchOptionsToExtend = watchOptionsToExtend;
host.extraFileExtensions = extraFileExtensions;
return host;
}
ts.createWatchCompilerHostOfConfigFile = createWatchCompilerHostOfConfigFile;
/**
* Creates the watch compiler host from system for compiling root files and options in watch mode
*/
function createWatchCompilerHostOfFilesAndCompilerOptions(_a) {
var rootFiles = _a.rootFiles, options = _a.options, watchOptions = _a.watchOptions, projectReferences = _a.projectReferences, system = _a.system, createProgram = _a.createProgram, reportDiagnostic = _a.reportDiagnostic, reportWatchStatus = _a.reportWatchStatus;
var host = createWatchCompilerHost(system, createProgram, reportDiagnostic || createDiagnosticReporter(system), reportWatchStatus);
host.rootFiles = rootFiles;
host.options = options;
host.watchOptions = watchOptions;
host.projectReferences = projectReferences;
return host;
}
ts.createWatchCompilerHostOfFilesAndCompilerOptions = createWatchCompilerHostOfFilesAndCompilerOptions;
function performIncrementalCompilation(input) {
var system = input.system || ts.sys;
var host = input.host || (input.host = ts.createIncrementalCompilerHost(input.options, system));
var builderProgram = ts.createIncrementalProgram(input);
var exitStatus = emitFilesAndReportErrorsAndGetExitStatus(builderProgram, input.reportDiagnostic || createDiagnosticReporter(system), function (s) { return host.trace && host.trace(s); }, input.reportErrorSummary || input.options.pretty ? function (errorCount) { return system.write(getErrorSummaryText(errorCount, system.newLine)); } : undefined);
if (input.afterProgramEmitAndDiagnostics)
input.afterProgramEmitAndDiagnostics(builderProgram);
return exitStatus;
}
ts.performIncrementalCompilation = performIncrementalCompilation;
})(ts || (ts = {}));
var ts;
(function (ts) {
function readBuilderProgram(compilerOptions, host) {
if (ts.outFile(compilerOptions))
return undefined;
var buildInfoPath = ts.getTsBuildInfoEmitOutputFilePath(compilerOptions);
if (!buildInfoPath)
return undefined;
var content = host.readFile(buildInfoPath);
if (!content)
return undefined;
var buildInfo = ts.getBuildInfo(content);
if (buildInfo.version !== ts.version)
return undefined;
if (!buildInfo.program)
return undefined;
return ts.createBuildProgramUsingProgramBuildInfo(buildInfo.program, buildInfoPath, host);
}
ts.readBuilderProgram = readBuilderProgram;
function createIncrementalCompilerHost(options, system) {
if (system === void 0) { system = ts.sys; }
var host = ts.createCompilerHostWorker(options, /*setParentNodes*/ undefined, system);
host.createHash = ts.maybeBind(system, system.createHash);
host.disableUseFileVersionAsSignature = system.disableUseFileVersionAsSignature;
ts.setGetSourceFileAsHashVersioned(host, system);
ts.changeCompilerHostLikeToUseCache(host, function (fileName) { return ts.toPath(fileName, host.getCurrentDirectory(), host.getCanonicalFileName); });
return host;
}
ts.createIncrementalCompilerHost = createIncrementalCompilerHost;
function createIncrementalProgram(_a) {
var rootNames = _a.rootNames, options = _a.options, configFileParsingDiagnostics = _a.configFileParsingDiagnostics, projectReferences = _a.projectReferences, host = _a.host, createProgram = _a.createProgram;
host = host || createIncrementalCompilerHost(options);
createProgram = createProgram || ts.createEmitAndSemanticDiagnosticsBuilderProgram;
var oldProgram = readBuilderProgram(options, host);
return createProgram(rootNames, options, host, oldProgram, configFileParsingDiagnostics, projectReferences);
}
ts.createIncrementalProgram = createIncrementalProgram;
function createWatchCompilerHost(rootFilesOrConfigFileName, options, system, createProgram, reportDiagnostic, reportWatchStatus, projectReferencesOrWatchOptionsToExtend, watchOptionsOrExtraFileExtensions) {
if (ts.isArray(rootFilesOrConfigFileName)) {
return ts.createWatchCompilerHostOfFilesAndCompilerOptions({
rootFiles: rootFilesOrConfigFileName,
options: options,
watchOptions: watchOptionsOrExtraFileExtensions,
projectReferences: projectReferencesOrWatchOptionsToExtend,
system: system,
createProgram: createProgram,
reportDiagnostic: reportDiagnostic,
reportWatchStatus: reportWatchStatus,
});
}
else {
return ts.createWatchCompilerHostOfConfigFile({
configFileName: rootFilesOrConfigFileName,
optionsToExtend: options,
watchOptionsToExtend: projectReferencesOrWatchOptionsToExtend,
extraFileExtensions: watchOptionsOrExtraFileExtensions,
system: system,
createProgram: createProgram,
reportDiagnostic: reportDiagnostic,
reportWatchStatus: reportWatchStatus,
});
}
}
ts.createWatchCompilerHost = createWatchCompilerHost;
function createWatchProgram(host) {
var builderProgram;
var reloadLevel; // level to indicate if the program needs to be reloaded from config file/just filenames etc
var missingFilesMap; // Map of file watchers for the missing files
var packageJsonMap; // map of watchers for package json files used in module resolution
var watchedWildcardDirectories; // map of watchers for the wild card directories in the config file
var timerToUpdateProgram; // timer callback to recompile the program
var timerToInvalidateFailedLookupResolutions; // timer callback to invalidate resolutions for changes in failed lookup locations
var parsedConfigs; // Parsed commandline and watching cached for referenced projects
var sharedExtendedConfigFileWatchers; // Map of file watchers for extended files, shared between different referenced projects
var extendedConfigCache = host.extendedConfigCache; // Cache for extended config evaluation
var changesAffectResolution = false; // Flag for indicating non-config changes affect module resolution
var sourceFilesCache = new ts.Map(); // Cache that stores the source file and version info
var missingFilePathsRequestedForRelease; // These paths are held temporarily so that we can remove the entry from source file cache if the file is not tracked by missing files
var hasChangedCompilerOptions = false; // True if the compiler options have changed between compilations
var useCaseSensitiveFileNames = host.useCaseSensitiveFileNames();
var currentDirectory = host.getCurrentDirectory();
var configFileName = host.configFileName, _a = host.optionsToExtend, optionsToExtendForConfigFile = _a === void 0 ? {} : _a, watchOptionsToExtend = host.watchOptionsToExtend, extraFileExtensions = host.extraFileExtensions, createProgram = host.createProgram;
var rootFileNames = host.rootFiles, compilerOptions = host.options, watchOptions = host.watchOptions, projectReferences = host.projectReferences;
var wildcardDirectories;
var configFileParsingDiagnostics;
var canConfigFileJsonReportNoInputFiles = false;
var hasChangedConfigFileParsingErrors = false;
var cachedDirectoryStructureHost = configFileName === undefined ? undefined : ts.createCachedDirectoryStructureHost(host, currentDirectory, useCaseSensitiveFileNames);
var directoryStructureHost = cachedDirectoryStructureHost || host;
var parseConfigFileHost = ts.parseConfigHostFromCompilerHostLike(host, directoryStructureHost);
// From tsc we want to get already parsed result and hence check for rootFileNames
var newLine = updateNewLine();
if (configFileName && host.configFileParsingResult) {
setConfigFileParsingResult(host.configFileParsingResult);
newLine = updateNewLine();
}
reportWatchDiagnostic(ts.Diagnostics.Starting_compilation_in_watch_mode);
if (configFileName && !host.configFileParsingResult) {
newLine = ts.getNewLineCharacter(optionsToExtendForConfigFile, function () { return host.getNewLine(); });
ts.Debug.assert(!rootFileNames);
parseConfigFile();
newLine = updateNewLine();
}
var _b = ts.createWatchFactory(host, compilerOptions), watchFile = _b.watchFile, watchDirectory = _b.watchDirectory, writeLog = _b.writeLog;
var getCanonicalFileName = ts.createGetCanonicalFileName(useCaseSensitiveFileNames);
writeLog("Current directory: " + currentDirectory + " CaseSensitiveFileNames: " + useCaseSensitiveFileNames);
var configFileWatcher;
if (configFileName) {
configFileWatcher = watchFile(configFileName, scheduleProgramReload, ts.PollingInterval.High, watchOptions, ts.WatchType.ConfigFile);
}
var compilerHost = ts.createCompilerHostFromProgramHost(host, function () { return compilerOptions; }, directoryStructureHost);
ts.setGetSourceFileAsHashVersioned(compilerHost, host);
// Members for CompilerHost
var getNewSourceFile = compilerHost.getSourceFile;
compilerHost.getSourceFile = function (fileName) {
var args = [];
for (var _i = 1; _i < arguments.length; _i++) {
args[_i - 1] = arguments[_i];
}
return getVersionedSourceFileByPath.apply(void 0, __spreadArray([fileName, toPath(fileName)], args, false));
};
compilerHost.getSourceFileByPath = getVersionedSourceFileByPath;
compilerHost.getNewLine = function () { return newLine; };
compilerHost.fileExists = fileExists;
compilerHost.onReleaseOldSourceFile = onReleaseOldSourceFile;
compilerHost.onReleaseParsedCommandLine = onReleaseParsedCommandLine;
// Members for ResolutionCacheHost
compilerHost.toPath = toPath;
compilerHost.getCompilationSettings = function () { return compilerOptions; };
compilerHost.useSourceOfProjectReferenceRedirect = ts.maybeBind(host, host.useSourceOfProjectReferenceRedirect);
compilerHost.watchDirectoryOfFailedLookupLocation = function (dir, cb, flags) { return watchDirectory(dir, cb, flags, watchOptions, ts.WatchType.FailedLookupLocations); };
compilerHost.watchTypeRootsDirectory = function (dir, cb, flags) { return watchDirectory(dir, cb, flags, watchOptions, ts.WatchType.TypeRoots); };
compilerHost.getCachedDirectoryStructureHost = function () { return cachedDirectoryStructureHost; };
compilerHost.scheduleInvalidateResolutionsOfFailedLookupLocations = scheduleInvalidateResolutionsOfFailedLookupLocations;
compilerHost.onInvalidatedResolution = scheduleProgramUpdate;
compilerHost.onChangedAutomaticTypeDirectiveNames = scheduleProgramUpdate;
compilerHost.fileIsOpen = ts.returnFalse;
compilerHost.getCurrentProgram = getCurrentProgram;
compilerHost.writeLog = writeLog;
compilerHost.getParsedCommandLine = getParsedCommandLine;
// Cache for the module resolution
var resolutionCache = ts.createResolutionCache(compilerHost, configFileName ?
ts.getDirectoryPath(ts.getNormalizedAbsolutePath(configFileName, currentDirectory)) :
currentDirectory,
/*logChangesWhenResolvingModule*/ false);
// Resolve module using host module resolution strategy if provided otherwise use resolution cache to resolve module names
compilerHost.resolveModuleNames = host.resolveModuleNames ?
(function () {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
return host.resolveModuleNames.apply(host, args);
}) :
(function (moduleNames, containingFile, reusedNames, redirectedReference) { return resolutionCache.resolveModuleNames(moduleNames, containingFile, reusedNames, redirectedReference); });
compilerHost.resolveTypeReferenceDirectives = host.resolveTypeReferenceDirectives ?
(function () {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
return host.resolveTypeReferenceDirectives.apply(host, args);
}) :
(function (typeDirectiveNames, containingFile, redirectedReference) { return resolutionCache.resolveTypeReferenceDirectives(typeDirectiveNames, containingFile, redirectedReference); });
var userProvidedResolution = !!host.resolveModuleNames || !!host.resolveTypeReferenceDirectives;
builderProgram = readBuilderProgram(compilerOptions, compilerHost);
synchronizeProgram();
// Update the wild card directory watch
watchConfigFileWildCardDirectories();
// Update extended config file watch
if (configFileName)
updateExtendedConfigFilesWatches(toPath(configFileName), compilerOptions, watchOptions, ts.WatchType.ExtendedConfigFile);
return configFileName ?
{ getCurrentProgram: getCurrentBuilderProgram, getProgram: updateProgram, close: close } :
{ getCurrentProgram: getCurrentBuilderProgram, getProgram: updateProgram, updateRootFileNames: updateRootFileNames, close: close };
function close() {
clearInvalidateResolutionsOfFailedLookupLocations();
resolutionCache.clear();
ts.clearMap(sourceFilesCache, function (value) {
if (value && value.fileWatcher) {
value.fileWatcher.close();
value.fileWatcher = undefined;
}
});
if (configFileWatcher) {
configFileWatcher.close();
configFileWatcher = undefined;
}
extendedConfigCache === null || extendedConfigCache === void 0 ? void 0 : extendedConfigCache.clear();
extendedConfigCache = undefined;
if (sharedExtendedConfigFileWatchers) {
ts.clearMap(sharedExtendedConfigFileWatchers, ts.closeFileWatcherOf);
sharedExtendedConfigFileWatchers = undefined;
}
if (watchedWildcardDirectories) {
ts.clearMap(watchedWildcardDirectories, ts.closeFileWatcherOf);
watchedWildcardDirectories = undefined;
}
if (missingFilesMap) {
ts.clearMap(missingFilesMap, ts.closeFileWatcher);
missingFilesMap = undefined;
}
if (parsedConfigs) {
ts.clearMap(parsedConfigs, function (config) {
var _a;
(_a = config.watcher) === null || _a === void 0 ? void 0 : _a.close();
config.watcher = undefined;
if (config.watchedDirectories)
ts.clearMap(config.watchedDirectories, ts.closeFileWatcherOf);
config.watchedDirectories = undefined;
});
parsedConfigs = undefined;
}
if (packageJsonMap) {
ts.clearMap(packageJsonMap, ts.closeFileWatcher);
packageJsonMap = undefined;
}
}
function getCurrentBuilderProgram() {
return builderProgram;
}
function getCurrentProgram() {
return builderProgram && builderProgram.getProgramOrUndefined();
}
function synchronizeProgram() {
writeLog("Synchronizing program");
clearInvalidateResolutionsOfFailedLookupLocations();
var program = getCurrentBuilderProgram();
if (hasChangedCompilerOptions) {
newLine = updateNewLine();
if (program && (changesAffectResolution || ts.changesAffectModuleResolution(program.getCompilerOptions(), compilerOptions))) {
resolutionCache.clear();
}
}
// All resolutions are invalid if user provided resolutions
var hasInvalidatedResolution = resolutionCache.createHasInvalidatedResolution(userProvidedResolution || changesAffectResolution);
if (ts.isProgramUptoDate(getCurrentProgram(), rootFileNames, compilerOptions, getSourceVersion, fileExists, hasInvalidatedResolution, hasChangedAutomaticTypeDirectiveNames, getParsedCommandLine, projectReferences)) {
if (hasChangedConfigFileParsingErrors) {
builderProgram = createProgram(/*rootNames*/ undefined, /*options*/ undefined, compilerHost, builderProgram, configFileParsingDiagnostics, projectReferences);
hasChangedConfigFileParsingErrors = false;
}
}
else {
createNewProgram(hasInvalidatedResolution);
}
changesAffectResolution = false; // reset for next sync
if (host.afterProgramCreate && program !== builderProgram) {
host.afterProgramCreate(builderProgram);
}
return builderProgram;
}
function createNewProgram(hasInvalidatedResolution) {
// Compile the program
writeLog("CreatingProgramWith::");
writeLog(" roots: " + JSON.stringify(rootFileNames));
writeLog(" options: " + JSON.stringify(compilerOptions));
if (projectReferences)
writeLog(" projectReferences: " + JSON.stringify(projectReferences));
var needsUpdateInTypeRootWatch = hasChangedCompilerOptions || !getCurrentProgram();
hasChangedCompilerOptions = false;
hasChangedConfigFileParsingErrors = false;
resolutionCache.startCachingPerDirectoryResolution();
compilerHost.hasInvalidatedResolution = hasInvalidatedResolution;
compilerHost.hasChangedAutomaticTypeDirectiveNames = hasChangedAutomaticTypeDirectiveNames;
builderProgram = createProgram(rootFileNames, compilerOptions, compilerHost, builderProgram, configFileParsingDiagnostics, projectReferences);
// map package json cache entries to their realpaths so we don't try to watch across symlinks
var packageCacheEntries = ts.map(resolutionCache.getModuleResolutionCache().getPackageJsonInfoCache().entries(), function (_a) {
var path = _a[0], data = _a[1];
return [compilerHost.realpath ? toPath(compilerHost.realpath(path)) : path, data];
});
resolutionCache.finishCachingPerDirectoryResolution();
// Update watches
ts.updateMissingFilePathsWatch(builderProgram.getProgram(), missingFilesMap || (missingFilesMap = new ts.Map()), watchMissingFilePath);
ts.updatePackageJsonWatch(packageCacheEntries, packageJsonMap || (packageJsonMap = new ts.Map()), watchPackageJsonLookupPath);
if (needsUpdateInTypeRootWatch) {
resolutionCache.updateTypeRootsWatch();
}
if (missingFilePathsRequestedForRelease) {
// These are the paths that program creater told us as not in use any more but were missing on the disk.
// We didnt remove the entry for them from sourceFiles cache so that we dont have to do File IO,
// if there is already watcher for it (for missing files)
// At this point our watches were updated, hence now we know that these paths are not tracked and need to be removed
// so that at later time we have correct result of their presence
for (var _i = 0, missingFilePathsRequestedForRelease_1 = missingFilePathsRequestedForRelease; _i < missingFilePathsRequestedForRelease_1.length; _i++) {
var missingFilePath = missingFilePathsRequestedForRelease_1[_i];
if (!missingFilesMap.has(missingFilePath)) {
sourceFilesCache.delete(missingFilePath);
}
}
missingFilePathsRequestedForRelease = undefined;
}
}
function updateRootFileNames(files) {
ts.Debug.assert(!configFileName, "Cannot update root file names with config file watch mode");
rootFileNames = files;
scheduleProgramUpdate();
}
function updateNewLine() {
return ts.getNewLineCharacter(compilerOptions || optionsToExtendForConfigFile, function () { return host.getNewLine(); });
}
function toPath(fileName) {
return ts.toPath(fileName, currentDirectory, getCanonicalFileName);
}
function isFileMissingOnHost(hostSourceFile) {
return typeof hostSourceFile === "boolean";
}
function isFilePresenceUnknownOnHost(hostSourceFile) {
return typeof hostSourceFile.version === "boolean";
}
function fileExists(fileName) {
var path = toPath(fileName);
// If file is missing on host from cache, we can definitely say file doesnt exist
// otherwise we need to ensure from the disk
if (isFileMissingOnHost(sourceFilesCache.get(path))) {
return false;
}
return directoryStructureHost.fileExists(fileName);
}
function getVersionedSourceFileByPath(fileName, path, languageVersion, onError, shouldCreateNewSourceFile) {
var hostSourceFile = sourceFilesCache.get(path);
// No source file on the host
if (isFileMissingOnHost(hostSourceFile)) {
return undefined;
}
// Create new source file if requested or the versions dont match
if (hostSourceFile === undefined || shouldCreateNewSourceFile || isFilePresenceUnknownOnHost(hostSourceFile)) {
var sourceFile = getNewSourceFile(fileName, languageVersion, onError);
if (hostSourceFile) {
if (sourceFile) {
// Set the source file and create file watcher now that file was present on the disk
hostSourceFile.sourceFile = sourceFile;
hostSourceFile.version = sourceFile.version;
if (!hostSourceFile.fileWatcher) {
hostSourceFile.fileWatcher = watchFilePath(path, fileName, onSourceFileChange, ts.PollingInterval.Low, watchOptions, ts.WatchType.SourceFile);
}
}
else {
// There is no source file on host any more, close the watch, missing file paths will track it
if (hostSourceFile.fileWatcher) {
hostSourceFile.fileWatcher.close();
}
sourceFilesCache.set(path, false);
}
}
else {
if (sourceFile) {
var fileWatcher = watchFilePath(path, fileName, onSourceFileChange, ts.PollingInterval.Low, watchOptions, ts.WatchType.SourceFile);
sourceFilesCache.set(path, { sourceFile: sourceFile, version: sourceFile.version, fileWatcher: fileWatcher });
}
else {
sourceFilesCache.set(path, false);
}
}
return sourceFile;
}
return hostSourceFile.sourceFile;
}
function nextSourceFileVersion(path) {
var hostSourceFile = sourceFilesCache.get(path);
if (hostSourceFile !== undefined) {
if (isFileMissingOnHost(hostSourceFile)) {
// The next version, lets set it as presence unknown file
sourceFilesCache.set(path, { version: false });
}
else {
hostSourceFile.version = false;
}
}
}
function getSourceVersion(path) {
var hostSourceFile = sourceFilesCache.get(path);
return !hostSourceFile || !hostSourceFile.version ? undefined : hostSourceFile.version;
}
function onReleaseOldSourceFile(oldSourceFile, _oldOptions, hasSourceFileByPath) {
var hostSourceFileInfo = sourceFilesCache.get(oldSourceFile.resolvedPath);
// If this is the source file thats in the cache and new program doesnt need it,
// remove the cached entry.
// Note we arent deleting entry if file became missing in new program or
// there was version update and new source file was created.
if (hostSourceFileInfo !== undefined) {
// record the missing file paths so they can be removed later if watchers arent tracking them
if (isFileMissingOnHost(hostSourceFileInfo)) {
(missingFilePathsRequestedForRelease || (missingFilePathsRequestedForRelease = [])).push(oldSourceFile.path);
}
else if (hostSourceFileInfo.sourceFile === oldSourceFile) {
if (hostSourceFileInfo.fileWatcher) {
hostSourceFileInfo.fileWatcher.close();
}
sourceFilesCache.delete(oldSourceFile.resolvedPath);
if (!hasSourceFileByPath) {
resolutionCache.removeResolutionsOfFile(oldSourceFile.path);
}
}
}
}
function reportWatchDiagnostic(message) {
if (host.onWatchStatusChange) {
host.onWatchStatusChange(ts.createCompilerDiagnostic(message), newLine, compilerOptions || optionsToExtendForConfigFile);
}
}
function hasChangedAutomaticTypeDirectiveNames() {
return resolutionCache.hasChangedAutomaticTypeDirectiveNames();
}
function clearInvalidateResolutionsOfFailedLookupLocations() {
if (!timerToInvalidateFailedLookupResolutions)
return false;
host.clearTimeout(timerToInvalidateFailedLookupResolutions);
timerToInvalidateFailedLookupResolutions = undefined;
return true;
}
function scheduleInvalidateResolutionsOfFailedLookupLocations() {
if (!host.setTimeout || !host.clearTimeout) {
return resolutionCache.invalidateResolutionsOfFailedLookupLocations();
}
var pending = clearInvalidateResolutionsOfFailedLookupLocations();
writeLog("Scheduling invalidateFailedLookup" + (pending ? ", Cancelled earlier one" : ""));
timerToInvalidateFailedLookupResolutions = host.setTimeout(invalidateResolutionsOfFailedLookup, 250);
}
function invalidateResolutionsOfFailedLookup() {
timerToInvalidateFailedLookupResolutions = undefined;
if (resolutionCache.invalidateResolutionsOfFailedLookupLocations()) {
scheduleProgramUpdate();
}
}
// Upon detecting a file change, wait for 250ms and then perform a recompilation. This gives batch
// operations (such as saving all modified files in an editor) a chance to complete before we kick
// off a new compilation.
function scheduleProgramUpdate() {
if (!host.setTimeout || !host.clearTimeout) {
return;
}
if (timerToUpdateProgram) {
host.clearTimeout(timerToUpdateProgram);
}
writeLog("Scheduling update");
timerToUpdateProgram = host.setTimeout(updateProgramWithWatchStatus, 250);
}
function scheduleProgramReload() {
ts.Debug.assert(!!configFileName);
reloadLevel = ts.ConfigFileProgramReloadLevel.Full;
scheduleProgramUpdate();
}
function updateProgramWithWatchStatus() {
timerToUpdateProgram = undefined;
reportWatchDiagnostic(ts.Diagnostics.File_change_detected_Starting_incremental_compilation);
updateProgram();
}
function updateProgram() {
switch (reloadLevel) {
case ts.ConfigFileProgramReloadLevel.Partial:
ts.perfLogger.logStartUpdateProgram("PartialConfigReload");
reloadFileNamesFromConfigFile();
break;
case ts.ConfigFileProgramReloadLevel.Full:
ts.perfLogger.logStartUpdateProgram("FullConfigReload");
reloadConfigFile();
break;
default:
ts.perfLogger.logStartUpdateProgram("SynchronizeProgram");
synchronizeProgram();
break;
}
ts.perfLogger.logStopUpdateProgram("Done");
return getCurrentBuilderProgram();
}
function reloadFileNamesFromConfigFile() {
writeLog("Reloading new file names and options");
rootFileNames = ts.getFileNamesFromConfigSpecs(compilerOptions.configFile.configFileSpecs, ts.getNormalizedAbsolutePath(ts.getDirectoryPath(configFileName), currentDirectory), compilerOptions, parseConfigFileHost, extraFileExtensions);
if (ts.updateErrorForNoInputFiles(rootFileNames, ts.getNormalizedAbsolutePath(configFileName, currentDirectory), compilerOptions.configFile.configFileSpecs, configFileParsingDiagnostics, canConfigFileJsonReportNoInputFiles)) {
hasChangedConfigFileParsingErrors = true;
}
// Update the program
synchronizeProgram();
}
function reloadConfigFile() {
writeLog("Reloading config file: " + configFileName);
reloadLevel = ts.ConfigFileProgramReloadLevel.None;
if (cachedDirectoryStructureHost) {
cachedDirectoryStructureHost.clearCache();
}
parseConfigFile();
hasChangedCompilerOptions = true;
synchronizeProgram();
// Update the wild card directory watch
watchConfigFileWildCardDirectories();
// Update extended config file watch
updateExtendedConfigFilesWatches(toPath(configFileName), compilerOptions, watchOptions, ts.WatchType.ExtendedConfigFile);
}
function parseConfigFile() {
setConfigFileParsingResult(ts.getParsedCommandLineOfConfigFile(configFileName, optionsToExtendForConfigFile, parseConfigFileHost, extendedConfigCache || (extendedConfigCache = new ts.Map()), watchOptionsToExtend, extraFileExtensions)); // TODO: GH#18217
}
function setConfigFileParsingResult(configFileParseResult) {
rootFileNames = configFileParseResult.fileNames;
compilerOptions = configFileParseResult.options;
watchOptions = configFileParseResult.watchOptions;
projectReferences = configFileParseResult.projectReferences;
wildcardDirectories = configFileParseResult.wildcardDirectories;
configFileParsingDiagnostics = ts.getConfigFileParsingDiagnostics(configFileParseResult).slice();
canConfigFileJsonReportNoInputFiles = ts.canJsonReportNoInputFiles(configFileParseResult.raw);
hasChangedConfigFileParsingErrors = true;
}
function getParsedCommandLine(configFileName) {
var configPath = toPath(configFileName);
var config = parsedConfigs === null || parsedConfigs === void 0 ? void 0 : parsedConfigs.get(configPath);
if (config) {
if (!config.reloadLevel)
return config.parsedCommandLine;
// With host implementing getParsedCommandLine we cant just update file names
if (config.parsedCommandLine && config.reloadLevel === ts.ConfigFileProgramReloadLevel.Partial && !host.getParsedCommandLine) {
writeLog("Reloading new file names and options");
var fileNames = ts.getFileNamesFromConfigSpecs(config.parsedCommandLine.options.configFile.configFileSpecs, ts.getNormalizedAbsolutePath(ts.getDirectoryPath(configFileName), currentDirectory), compilerOptions, parseConfigFileHost);
config.parsedCommandLine = __assign(__assign({}, config.parsedCommandLine), { fileNames: fileNames });
config.reloadLevel = undefined;
return config.parsedCommandLine;
}
}
writeLog("Loading config file: " + configFileName);
var parsedCommandLine = host.getParsedCommandLine ?
host.getParsedCommandLine(configFileName) :
getParsedCommandLineFromConfigFileHost(configFileName);
if (config) {
config.parsedCommandLine = parsedCommandLine;
config.reloadLevel = undefined;
}
else {
(parsedConfigs || (parsedConfigs = new ts.Map())).set(configPath, config = { parsedCommandLine: parsedCommandLine });
}
watchReferencedProject(configFileName, configPath, config);
return parsedCommandLine;
}
function getParsedCommandLineFromConfigFileHost(configFileName) {
// Ignore the file absent errors
var onUnRecoverableConfigFileDiagnostic = parseConfigFileHost.onUnRecoverableConfigFileDiagnostic;
parseConfigFileHost.onUnRecoverableConfigFileDiagnostic = ts.noop;
var parsedCommandLine = ts.getParsedCommandLineOfConfigFile(configFileName,
/*optionsToExtend*/ undefined, parseConfigFileHost, extendedConfigCache || (extendedConfigCache = new ts.Map()), watchOptionsToExtend);
parseConfigFileHost.onUnRecoverableConfigFileDiagnostic = onUnRecoverableConfigFileDiagnostic;
return parsedCommandLine;
}
function onReleaseParsedCommandLine(fileName) {
var _a;
var path = toPath(fileName);
var config = parsedConfigs === null || parsedConfigs === void 0 ? void 0 : parsedConfigs.get(path);
if (!config)
return;
parsedConfigs.delete(path);
if (config.watchedDirectories)
ts.clearMap(config.watchedDirectories, ts.closeFileWatcherOf);
(_a = config.watcher) === null || _a === void 0 ? void 0 : _a.close();
ts.clearSharedExtendedConfigFileWatcher(path, sharedExtendedConfigFileWatchers);
}
function watchFilePath(path, file, callback, pollingInterval, options, watchType) {
return watchFile(file, function (fileName, eventKind) { return callback(fileName, eventKind, path); }, pollingInterval, options, watchType);
}
function onSourceFileChange(fileName, eventKind, path) {
updateCachedSystemWithFile(fileName, path, eventKind);
// Update the source file cache
if (eventKind === ts.FileWatcherEventKind.Deleted && sourceFilesCache.has(path)) {
resolutionCache.invalidateResolutionOfFile(path);
}
nextSourceFileVersion(path);
// Update the program
scheduleProgramUpdate();
}
function updateCachedSystemWithFile(fileName, path, eventKind) {
if (cachedDirectoryStructureHost) {
cachedDirectoryStructureHost.addOrDeleteFile(fileName, path, eventKind);
}
}
function watchMissingFilePath(missingFilePath) {
// If watching missing referenced config file, we are already watching it so no need for separate watcher
return (parsedConfigs === null || parsedConfigs === void 0 ? void 0 : parsedConfigs.has(missingFilePath)) ?
ts.noopFileWatcher :
watchFilePath(missingFilePath, missingFilePath, onMissingFileChange, ts.PollingInterval.Medium, watchOptions, ts.WatchType.MissingFile);
}
function watchPackageJsonLookupPath(packageJsonPath) {
// If the package.json is pulled into the compilation itself (eg, via json imports), don't add a second watcher here
return sourceFilesCache.has(packageJsonPath) ?
ts.noopFileWatcher :
watchFilePath(packageJsonPath, packageJsonPath, onPackageJsonChange, ts.PollingInterval.High, watchOptions, ts.WatchType.PackageJson);
}
function onPackageJsonChange(fileName, eventKind, path) {
updateCachedSystemWithFile(fileName, path, eventKind);
// package.json changes invalidate module resolution and can change the set of loaded files
// so if we witness a change to one, we have to do a full reload
reloadLevel = ts.ConfigFileProgramReloadLevel.Full;
changesAffectResolution = true;
// Update the program
scheduleProgramUpdate();
}
function onMissingFileChange(fileName, eventKind, missingFilePath) {
updateCachedSystemWithFile(fileName, missingFilePath, eventKind);
if (eventKind === ts.FileWatcherEventKind.Created && missingFilesMap.has(missingFilePath)) {
missingFilesMap.get(missingFilePath).close();
missingFilesMap.delete(missingFilePath);
// Delete the entry in the source files cache so that new source file is created
nextSourceFileVersion(missingFilePath);
// When a missing file is created, we should update the graph.
scheduleProgramUpdate();
}
}
function watchConfigFileWildCardDirectories() {
if (wildcardDirectories) {
ts.updateWatchingWildcardDirectories(watchedWildcardDirectories || (watchedWildcardDirectories = new ts.Map()), new ts.Map(ts.getEntries(wildcardDirectories)), watchWildcardDirectory);
}
else if (watchedWildcardDirectories) {
ts.clearMap(watchedWildcardDirectories, ts.closeFileWatcherOf);
}
}
function watchWildcardDirectory(directory, flags) {
return watchDirectory(directory, function (fileOrDirectory) {
ts.Debug.assert(!!configFileName);
var fileOrDirectoryPath = toPath(fileOrDirectory);
// Since the file existence changed, update the sourceFiles cache
if (cachedDirectoryStructureHost) {
cachedDirectoryStructureHost.addOrDeleteFileOrDirectory(fileOrDirectory, fileOrDirectoryPath);
}
nextSourceFileVersion(fileOrDirectoryPath);
if (ts.isIgnoredFileFromWildCardWatching({
watchedDirPath: toPath(directory),
fileOrDirectory: fileOrDirectory,
fileOrDirectoryPath: fileOrDirectoryPath,
configFileName: configFileName,
extraFileExtensions: extraFileExtensions,
options: compilerOptions,
program: getCurrentBuilderProgram() || rootFileNames,
currentDirectory: currentDirectory,
useCaseSensitiveFileNames: useCaseSensitiveFileNames,
writeLog: writeLog,
toPath: toPath,
}))
return;
// Reload is pending, do the reload
if (reloadLevel !== ts.ConfigFileProgramReloadLevel.Full) {
reloadLevel = ts.ConfigFileProgramReloadLevel.Partial;
// Schedule Update the program
scheduleProgramUpdate();
}
}, flags, watchOptions, ts.WatchType.WildcardDirectory);
}
function updateExtendedConfigFilesWatches(forProjectPath, options, watchOptions, watchType) {
ts.updateSharedExtendedConfigFileWatcher(forProjectPath, options, sharedExtendedConfigFileWatchers || (sharedExtendedConfigFileWatchers = new ts.Map()), function (extendedConfigFileName, extendedConfigFilePath) { return watchFile(extendedConfigFileName, function (_fileName, eventKind) {
var _a;
updateCachedSystemWithFile(extendedConfigFileName, extendedConfigFilePath, eventKind);
// Update extended config cache
if (extendedConfigCache)
ts.cleanExtendedConfigCache(extendedConfigCache, extendedConfigFilePath, toPath);
// Update projects
var projects = (_a = sharedExtendedConfigFileWatchers.get(extendedConfigFilePath)) === null || _a === void 0 ? void 0 : _a.projects;
// If there are no referenced projects this extended config file watcher depend on ignore
if (!(projects === null || projects === void 0 ? void 0 : projects.size))
return;
projects.forEach(function (projectPath) {
if (toPath(configFileName) === projectPath) {
// If this is the config file of the project, reload completely
reloadLevel = ts.ConfigFileProgramReloadLevel.Full;
}
else {
// Reload config for the referenced projects and remove the resolutions from referenced projects since the config file changed
var config = parsedConfigs === null || parsedConfigs === void 0 ? void 0 : parsedConfigs.get(projectPath);
if (config)
config.reloadLevel = ts.ConfigFileProgramReloadLevel.Full;
resolutionCache.removeResolutionsFromProjectReferenceRedirects(projectPath);
}
scheduleProgramUpdate();
});
}, ts.PollingInterval.High, watchOptions, watchType); }, toPath);
}
function watchReferencedProject(configFileName, configPath, commandLine) {
var _a, _b, _c, _d, _e;
// Watch file
commandLine.watcher || (commandLine.watcher = watchFile(configFileName, function (_fileName, eventKind) {
updateCachedSystemWithFile(configFileName, configPath, eventKind);
var config = parsedConfigs === null || parsedConfigs === void 0 ? void 0 : parsedConfigs.get(configPath);
if (config)
config.reloadLevel = ts.ConfigFileProgramReloadLevel.Full;
resolutionCache.removeResolutionsFromProjectReferenceRedirects(configPath);
scheduleProgramUpdate();
}, ts.PollingInterval.High, ((_a = commandLine.parsedCommandLine) === null || _a === void 0 ? void 0 : _a.watchOptions) || watchOptions, ts.WatchType.ConfigFileOfReferencedProject));
// Watch Wild card
if ((_b = commandLine.parsedCommandLine) === null || _b === void 0 ? void 0 : _b.wildcardDirectories) {
ts.updateWatchingWildcardDirectories(commandLine.watchedDirectories || (commandLine.watchedDirectories = new ts.Map()), new ts.Map(ts.getEntries((_c = commandLine.parsedCommandLine) === null || _c === void 0 ? void 0 : _c.wildcardDirectories)), function (directory, flags) {
var _a;
return watchDirectory(directory, function (fileOrDirectory) {
var fileOrDirectoryPath = toPath(fileOrDirectory);
// Since the file existence changed, update the sourceFiles cache
if (cachedDirectoryStructureHost) {
cachedDirectoryStructureHost.addOrDeleteFileOrDirectory(fileOrDirectory, fileOrDirectoryPath);
}
nextSourceFileVersion(fileOrDirectoryPath);
var config = parsedConfigs === null || parsedConfigs === void 0 ? void 0 : parsedConfigs.get(configPath);
if (!(config === null || config === void 0 ? void 0 : config.parsedCommandLine))
return;
if (ts.isIgnoredFileFromWildCardWatching({
watchedDirPath: toPath(directory),
fileOrDirectory: fileOrDirectory,
fileOrDirectoryPath: fileOrDirectoryPath,
configFileName: configFileName,
options: config.parsedCommandLine.options,
program: config.parsedCommandLine.fileNames,
currentDirectory: currentDirectory,
useCaseSensitiveFileNames: useCaseSensitiveFileNames,
writeLog: writeLog,
toPath: toPath,
}))
return;
// Reload is pending, do the reload
if (config.reloadLevel !== ts.ConfigFileProgramReloadLevel.Full) {
config.reloadLevel = ts.ConfigFileProgramReloadLevel.Partial;
// Schedule Update the program
scheduleProgramUpdate();
}
}, flags, ((_a = commandLine.parsedCommandLine) === null || _a === void 0 ? void 0 : _a.watchOptions) || watchOptions, ts.WatchType.WildcardDirectoryOfReferencedProject);
});
}
else if (commandLine.watchedDirectories) {
ts.clearMap(commandLine.watchedDirectories, ts.closeFileWatcherOf);
commandLine.watchedDirectories = undefined;
}
// Watch extended config files
updateExtendedConfigFilesWatches(configPath, (_d = commandLine.parsedCommandLine) === null || _d === void 0 ? void 0 : _d.options, ((_e = commandLine.parsedCommandLine) === null || _e === void 0 ? void 0 : _e.watchOptions) || watchOptions, ts.WatchType.ExtendedConfigOfReferencedProject);
}
}
ts.createWatchProgram = createWatchProgram;
})(ts || (ts = {}));
/*@internal*/
var ts;
(function (ts) {
var UpToDateStatusType;
(function (UpToDateStatusType) {
UpToDateStatusType[UpToDateStatusType["Unbuildable"] = 0] = "Unbuildable";
UpToDateStatusType[UpToDateStatusType["UpToDate"] = 1] = "UpToDate";
/**
* The project appears out of date because its upstream inputs are newer than its outputs,
* but all of its outputs are actually newer than the previous identical outputs of its (.d.ts) inputs.
* This means we can Pseudo-build (just touch timestamps), as if we had actually built this project.
*/
UpToDateStatusType[UpToDateStatusType["UpToDateWithUpstreamTypes"] = 2] = "UpToDateWithUpstreamTypes";
/**
* The project appears out of date because its upstream inputs are newer than its outputs,
* but all of its outputs are actually newer than the previous identical outputs of its (.d.ts) inputs.
* This means we can Pseudo-build (just manipulate outputs), as if we had actually built this project.
*/
UpToDateStatusType[UpToDateStatusType["OutOfDateWithPrepend"] = 3] = "OutOfDateWithPrepend";
UpToDateStatusType[UpToDateStatusType["OutputMissing"] = 4] = "OutputMissing";
UpToDateStatusType[UpToDateStatusType["OutOfDateWithSelf"] = 5] = "OutOfDateWithSelf";
UpToDateStatusType[UpToDateStatusType["OutOfDateWithUpstream"] = 6] = "OutOfDateWithUpstream";
UpToDateStatusType[UpToDateStatusType["UpstreamOutOfDate"] = 7] = "UpstreamOutOfDate";
UpToDateStatusType[UpToDateStatusType["UpstreamBlocked"] = 8] = "UpstreamBlocked";
UpToDateStatusType[UpToDateStatusType["ComputingUpstream"] = 9] = "ComputingUpstream";
UpToDateStatusType[UpToDateStatusType["TsVersionOutputOfDate"] = 10] = "TsVersionOutputOfDate";
/**
* Projects with no outputs (i.e. "solution" files)
*/
UpToDateStatusType[UpToDateStatusType["ContainerOnly"] = 11] = "ContainerOnly";
})(UpToDateStatusType = ts.UpToDateStatusType || (ts.UpToDateStatusType = {}));
function resolveConfigFileProjectName(project) {
if (ts.fileExtensionIs(project, ".json" /* Json */)) {
return project;
}
return ts.combinePaths(project, "tsconfig.json");
}
ts.resolveConfigFileProjectName = resolveConfigFileProjectName;
})(ts || (ts = {}));
var ts;
(function (ts) {
var minimumDate = new Date(-8640000000000000);
var maximumDate = new Date(8640000000000000);
var BuildResultFlags;
(function (BuildResultFlags) {
BuildResultFlags[BuildResultFlags["None"] = 0] = "None";
/**
* No errors of any kind occurred during build
*/
BuildResultFlags[BuildResultFlags["Success"] = 1] = "Success";
/**
* None of the .d.ts files emitted by this build were
* different from the existing files on disk
*/
BuildResultFlags[BuildResultFlags["DeclarationOutputUnchanged"] = 2] = "DeclarationOutputUnchanged";
BuildResultFlags[BuildResultFlags["ConfigFileErrors"] = 4] = "ConfigFileErrors";
BuildResultFlags[BuildResultFlags["SyntaxErrors"] = 8] = "SyntaxErrors";
BuildResultFlags[BuildResultFlags["TypeErrors"] = 16] = "TypeErrors";
BuildResultFlags[BuildResultFlags["DeclarationEmitErrors"] = 32] = "DeclarationEmitErrors";
BuildResultFlags[BuildResultFlags["EmitErrors"] = 64] = "EmitErrors";
BuildResultFlags[BuildResultFlags["AnyErrors"] = 124] = "AnyErrors";
})(BuildResultFlags || (BuildResultFlags = {}));
function getOrCreateValueFromConfigFileMap(configFileMap, resolved, createT) {
var existingValue = configFileMap.get(resolved);
var newValue;
if (!existingValue) {
newValue = createT();
configFileMap.set(resolved, newValue);
}
return existingValue || newValue;
}
function getOrCreateValueMapFromConfigFileMap(configFileMap, resolved) {
return getOrCreateValueFromConfigFileMap(configFileMap, resolved, function () { return new ts.Map(); });
}
function newer(date1, date2) {
return date2 > date1 ? date2 : date1;
}
function isDeclarationFile(fileName) {
return ts.fileExtensionIs(fileName, ".d.ts" /* Dts */);
}
/*@internal*/
function isCircularBuildOrder(buildOrder) {
return !!buildOrder && !!buildOrder.buildOrder;
}
ts.isCircularBuildOrder = isCircularBuildOrder;
/*@internal*/
function getBuildOrderFromAnyBuildOrder(anyBuildOrder) {
return isCircularBuildOrder(anyBuildOrder) ? anyBuildOrder.buildOrder : anyBuildOrder;
}
ts.getBuildOrderFromAnyBuildOrder = getBuildOrderFromAnyBuildOrder;
/**
* Create a function that reports watch status by writing to the system and handles the formating of the diagnostic
*/
function createBuilderStatusReporter(system, pretty) {
return function (diagnostic) {
var output = pretty ? "[" + ts.formatColorAndReset(ts.getLocaleTimeString(system), ts.ForegroundColorEscapeSequences.Grey) + "] " : ts.getLocaleTimeString(system) + " - ";
output += "" + ts.flattenDiagnosticMessageText(diagnostic.messageText, system.newLine) + (system.newLine + system.newLine);
system.write(output);
};
}
ts.createBuilderStatusReporter = createBuilderStatusReporter;
function createSolutionBuilderHostBase(system, createProgram, reportDiagnostic, reportSolutionBuilderStatus) {
var host = ts.createProgramHost(system, createProgram);
host.getModifiedTime = system.getModifiedTime ? function (path) { return system.getModifiedTime(path); } : ts.returnUndefined;
host.setModifiedTime = system.setModifiedTime ? function (path, date) { return system.setModifiedTime(path, date); } : ts.noop;
host.deleteFile = system.deleteFile ? function (path) { return system.deleteFile(path); } : ts.noop;
host.reportDiagnostic = reportDiagnostic || ts.createDiagnosticReporter(system);
host.reportSolutionBuilderStatus = reportSolutionBuilderStatus || createBuilderStatusReporter(system);
host.now = ts.maybeBind(system, system.now); // For testing
return host;
}
function createSolutionBuilderHost(system, createProgram, reportDiagnostic, reportSolutionBuilderStatus, reportErrorSummary) {
if (system === void 0) { system = ts.sys; }
var host = createSolutionBuilderHostBase(system, createProgram, reportDiagnostic, reportSolutionBuilderStatus);
host.reportErrorSummary = reportErrorSummary;
return host;
}
ts.createSolutionBuilderHost = createSolutionBuilderHost;
function createSolutionBuilderWithWatchHost(system, createProgram, reportDiagnostic, reportSolutionBuilderStatus, reportWatchStatus) {
if (system === void 0) { system = ts.sys; }
var host = createSolutionBuilderHostBase(system, createProgram, reportDiagnostic, reportSolutionBuilderStatus);
var watchHost = ts.createWatchHost(system, reportWatchStatus);
ts.copyProperties(host, watchHost);
return host;
}
ts.createSolutionBuilderWithWatchHost = createSolutionBuilderWithWatchHost;
function getCompilerOptionsOfBuildOptions(buildOptions) {
var result = {};
ts.commonOptionsWithBuild.forEach(function (option) {
if (ts.hasProperty(buildOptions, option.name))
result[option.name] = buildOptions[option.name];
});
return result;
}
function createSolutionBuilder(host, rootNames, defaultOptions) {
return createSolutionBuilderWorker(/*watch*/ false, host, rootNames, defaultOptions);
}
ts.createSolutionBuilder = createSolutionBuilder;
function createSolutionBuilderWithWatch(host, rootNames, defaultOptions, baseWatchOptions) {
return createSolutionBuilderWorker(/*watch*/ true, host, rootNames, defaultOptions, baseWatchOptions);
}
ts.createSolutionBuilderWithWatch = createSolutionBuilderWithWatch;
function createSolutionBuilderState(watch, hostOrHostWithWatch, rootNames, options, baseWatchOptions) {
var host = hostOrHostWithWatch;
var hostWithWatch = hostOrHostWithWatch;
var currentDirectory = host.getCurrentDirectory();
var getCanonicalFileName = ts.createGetCanonicalFileName(host.useCaseSensitiveFileNames());
// State of the solution
var baseCompilerOptions = getCompilerOptionsOfBuildOptions(options);
var compilerHost = ts.createCompilerHostFromProgramHost(host, function () { return state.projectCompilerOptions; });
ts.setGetSourceFileAsHashVersioned(compilerHost, host);
compilerHost.getParsedCommandLine = function (fileName) { return parseConfigFile(state, fileName, toResolvedConfigFilePath(state, fileName)); };
compilerHost.resolveModuleNames = ts.maybeBind(host, host.resolveModuleNames);
compilerHost.resolveTypeReferenceDirectives = ts.maybeBind(host, host.resolveTypeReferenceDirectives);
var moduleResolutionCache = !compilerHost.resolveModuleNames ? ts.createModuleResolutionCache(currentDirectory, getCanonicalFileName) : undefined;
var typeReferenceDirectiveResolutionCache = !compilerHost.resolveTypeReferenceDirectives ? ts.createTypeReferenceDirectiveResolutionCache(currentDirectory, getCanonicalFileName, /*options*/ undefined, moduleResolutionCache === null || moduleResolutionCache === void 0 ? void 0 : moduleResolutionCache.getPackageJsonInfoCache()) : undefined;
if (!compilerHost.resolveModuleNames) {
var loader_3 = function (moduleName, containingFile, redirectedReference) { return ts.resolveModuleName(moduleName, containingFile, state.projectCompilerOptions, compilerHost, moduleResolutionCache, redirectedReference).resolvedModule; };
compilerHost.resolveModuleNames = function (moduleNames, containingFile, _reusedNames, redirectedReference) {
return ts.loadWithLocalCache(ts.Debug.checkEachDefined(moduleNames), containingFile, redirectedReference, loader_3);
};
}
if (!compilerHost.resolveTypeReferenceDirectives) {
var loader_4 = function (moduleName, containingFile, redirectedReference) { return ts.resolveTypeReferenceDirective(moduleName, containingFile, state.projectCompilerOptions, compilerHost, redirectedReference, state.typeReferenceDirectiveResolutionCache).resolvedTypeReferenceDirective; };
compilerHost.resolveTypeReferenceDirectives = function (typeReferenceDirectiveNames, containingFile, redirectedReference) {
return ts.loadWithLocalCache(ts.Debug.checkEachDefined(typeReferenceDirectiveNames), containingFile, redirectedReference, loader_4);
};
}
var _a = ts.createWatchFactory(hostWithWatch, options), watchFile = _a.watchFile, watchDirectory = _a.watchDirectory, writeLog = _a.writeLog;
var state = {
host: host,
hostWithWatch: hostWithWatch,
currentDirectory: currentDirectory,
getCanonicalFileName: getCanonicalFileName,
parseConfigFileHost: ts.parseConfigHostFromCompilerHostLike(host),
write: ts.maybeBind(host, host.trace),
// State of solution
options: options,
baseCompilerOptions: baseCompilerOptions,
rootNames: rootNames,
baseWatchOptions: baseWatchOptions,
resolvedConfigFilePaths: new ts.Map(),
configFileCache: new ts.Map(),
projectStatus: new ts.Map(),
buildInfoChecked: new ts.Map(),
extendedConfigCache: new ts.Map(),
builderPrograms: new ts.Map(),
diagnostics: new ts.Map(),
projectPendingBuild: new ts.Map(),
projectErrorsReported: new ts.Map(),
compilerHost: compilerHost,
moduleResolutionCache: moduleResolutionCache,
typeReferenceDirectiveResolutionCache: typeReferenceDirectiveResolutionCache,
// Mutable state
buildOrder: undefined,
readFileWithCache: function (f) { return host.readFile(f); },
projectCompilerOptions: baseCompilerOptions,
cache: undefined,
allProjectBuildPending: true,
needsSummary: true,
watchAllProjectsPending: watch,
currentInvalidatedProject: undefined,
// Watch state
watch: watch,
allWatchedWildcardDirectories: new ts.Map(),
allWatchedInputFiles: new ts.Map(),
allWatchedConfigFiles: new ts.Map(),
allWatchedExtendedConfigFiles: new ts.Map(),
allWatchedPackageJsonFiles: new ts.Map(),
lastCachedPackageJsonLookups: new ts.Map(),
timerToBuildInvalidatedProject: undefined,
reportFileChangeDetected: false,
watchFile: watchFile,
watchDirectory: watchDirectory,
writeLog: writeLog,
};
return state;
}
function toPath(state, fileName) {
return ts.toPath(fileName, state.currentDirectory, state.getCanonicalFileName);
}
function toResolvedConfigFilePath(state, fileName) {
var resolvedConfigFilePaths = state.resolvedConfigFilePaths;
var path = resolvedConfigFilePaths.get(fileName);
if (path !== undefined)
return path;
var resolvedPath = toPath(state, fileName);
resolvedConfigFilePaths.set(fileName, resolvedPath);
return resolvedPath;
}
function isParsedCommandLine(entry) {
return !!entry.options;
}
function getCachedParsedConfigFile(state, configFilePath) {
var value = state.configFileCache.get(configFilePath);
return value && isParsedCommandLine(value) ? value : undefined;
}
function parseConfigFile(state, configFileName, configFilePath) {
var configFileCache = state.configFileCache;
var value = configFileCache.get(configFilePath);
if (value) {
return isParsedCommandLine(value) ? value : undefined;
}
var diagnostic;
var parseConfigFileHost = state.parseConfigFileHost, baseCompilerOptions = state.baseCompilerOptions, baseWatchOptions = state.baseWatchOptions, extendedConfigCache = state.extendedConfigCache, host = state.host;
var parsed;
if (host.getParsedCommandLine) {
parsed = host.getParsedCommandLine(configFileName);
if (!parsed)
diagnostic = ts.createCompilerDiagnostic(ts.Diagnostics.File_0_not_found, configFileName);
}
else {
parseConfigFileHost.onUnRecoverableConfigFileDiagnostic = function (d) { return diagnostic = d; };
parsed = ts.getParsedCommandLineOfConfigFile(configFileName, baseCompilerOptions, parseConfigFileHost, extendedConfigCache, baseWatchOptions);
parseConfigFileHost.onUnRecoverableConfigFileDiagnostic = ts.noop;
}
configFileCache.set(configFilePath, parsed || diagnostic);
return parsed;
}
function resolveProjectName(state, name) {
return ts.resolveConfigFileProjectName(ts.resolvePath(state.currentDirectory, name));
}
function createBuildOrder(state, roots) {
var temporaryMarks = new ts.Map();
var permanentMarks = new ts.Map();
var circularityReportStack = [];
var buildOrder;
var circularDiagnostics;
for (var _i = 0, roots_1 = roots; _i < roots_1.length; _i++) {
var root = roots_1[_i];
visit(root);
}
return circularDiagnostics ?
{ buildOrder: buildOrder || ts.emptyArray, circularDiagnostics: circularDiagnostics } :
buildOrder || ts.emptyArray;
function visit(configFileName, inCircularContext) {
var projPath = toResolvedConfigFilePath(state, configFileName);
// Already visited
if (permanentMarks.has(projPath))
return;
// Circular
if (temporaryMarks.has(projPath)) {
if (!inCircularContext) {
(circularDiagnostics || (circularDiagnostics = [])).push(ts.createCompilerDiagnostic(ts.Diagnostics.Project_references_may_not_form_a_circular_graph_Cycle_detected_Colon_0, circularityReportStack.join("\r\n")));
}
return;
}
temporaryMarks.set(projPath, true);
circularityReportStack.push(configFileName);
var parsed = parseConfigFile(state, configFileName, projPath);
if (parsed && parsed.projectReferences) {
for (var _i = 0, _a = parsed.projectReferences; _i < _a.length; _i++) {
var ref = _a[_i];
var resolvedRefPath = resolveProjectName(state, ref.path);
visit(resolvedRefPath, inCircularContext || ref.circular);
}
}
circularityReportStack.pop();
permanentMarks.set(projPath, true);
(buildOrder || (buildOrder = [])).push(configFileName);
}
}
function getBuildOrder(state) {
return state.buildOrder || createStateBuildOrder(state);
}
function createStateBuildOrder(state) {
var buildOrder = createBuildOrder(state, state.rootNames.map(function (f) { return resolveProjectName(state, f); }));
// Clear all to ResolvedConfigFilePaths cache to start fresh
state.resolvedConfigFilePaths.clear();
// TODO(rbuckton): Should be a `Set`, but that requires changing the code below that uses `mutateMapSkippingNewValues`
var currentProjects = new ts.Map(getBuildOrderFromAnyBuildOrder(buildOrder).map(function (resolved) { return [toResolvedConfigFilePath(state, resolved), true]; }));
var noopOnDelete = { onDeleteValue: ts.noop };
// Config file cache
ts.mutateMapSkippingNewValues(state.configFileCache, currentProjects, noopOnDelete);
ts.mutateMapSkippingNewValues(state.projectStatus, currentProjects, noopOnDelete);
ts.mutateMapSkippingNewValues(state.buildInfoChecked, currentProjects, noopOnDelete);
ts.mutateMapSkippingNewValues(state.builderPrograms, currentProjects, noopOnDelete);
ts.mutateMapSkippingNewValues(state.diagnostics, currentProjects, noopOnDelete);
ts.mutateMapSkippingNewValues(state.projectPendingBuild, currentProjects, noopOnDelete);
ts.mutateMapSkippingNewValues(state.projectErrorsReported, currentProjects, noopOnDelete);
// Remove watches for the program no longer in the solution
if (state.watch) {
ts.mutateMapSkippingNewValues(state.allWatchedConfigFiles, currentProjects, { onDeleteValue: ts.closeFileWatcher });
state.allWatchedExtendedConfigFiles.forEach(function (watcher) {
watcher.projects.forEach(function (project) {
if (!currentProjects.has(project)) {
watcher.projects.delete(project);
}
});
watcher.close();
});
ts.mutateMapSkippingNewValues(state.allWatchedWildcardDirectories, currentProjects, { onDeleteValue: function (existingMap) { return existingMap.forEach(ts.closeFileWatcherOf); } });
ts.mutateMapSkippingNewValues(state.allWatchedInputFiles, currentProjects, { onDeleteValue: function (existingMap) { return existingMap.forEach(ts.closeFileWatcher); } });
ts.mutateMapSkippingNewValues(state.allWatchedPackageJsonFiles, currentProjects, { onDeleteValue: function (existingMap) { return existingMap.forEach(ts.closeFileWatcher); } });
}
return state.buildOrder = buildOrder;
}
function getBuildOrderFor(state, project, onlyReferences) {
var resolvedProject = project && resolveProjectName(state, project);
var buildOrderFromState = getBuildOrder(state);
if (isCircularBuildOrder(buildOrderFromState))
return buildOrderFromState;
if (resolvedProject) {
var projectPath_1 = toResolvedConfigFilePath(state, resolvedProject);
var projectIndex = ts.findIndex(buildOrderFromState, function (configFileName) { return toResolvedConfigFilePath(state, configFileName) === projectPath_1; });
if (projectIndex === -1)
return undefined;
}
var buildOrder = resolvedProject ? createBuildOrder(state, [resolvedProject]) : buildOrderFromState;
ts.Debug.assert(!isCircularBuildOrder(buildOrder));
ts.Debug.assert(!onlyReferences || resolvedProject !== undefined);
ts.Debug.assert(!onlyReferences || buildOrder[buildOrder.length - 1] === resolvedProject);
return onlyReferences ? buildOrder.slice(0, buildOrder.length - 1) : buildOrder;
}
function enableCache(state) {
if (state.cache) {
disableCache(state);
}
var compilerHost = state.compilerHost, host = state.host;
var originalReadFileWithCache = state.readFileWithCache;
var originalGetSourceFile = compilerHost.getSourceFile;
var _a = ts.changeCompilerHostLikeToUseCache(host, function (fileName) { return toPath(state, fileName); }, function () {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
return originalGetSourceFile.call.apply(originalGetSourceFile, __spreadArray([compilerHost], args, false));
}), originalReadFile = _a.originalReadFile, originalFileExists = _a.originalFileExists, originalDirectoryExists = _a.originalDirectoryExists, originalCreateDirectory = _a.originalCreateDirectory, originalWriteFile = _a.originalWriteFile, getSourceFileWithCache = _a.getSourceFileWithCache, readFileWithCache = _a.readFileWithCache;
state.readFileWithCache = readFileWithCache;
compilerHost.getSourceFile = getSourceFileWithCache;
state.cache = {
originalReadFile: originalReadFile,
originalFileExists: originalFileExists,
originalDirectoryExists: originalDirectoryExists,
originalCreateDirectory: originalCreateDirectory,
originalWriteFile: originalWriteFile,
originalReadFileWithCache: originalReadFileWithCache,
originalGetSourceFile: originalGetSourceFile,
};
}
function disableCache(state) {
if (!state.cache)
return;
var cache = state.cache, host = state.host, compilerHost = state.compilerHost, extendedConfigCache = state.extendedConfigCache, moduleResolutionCache = state.moduleResolutionCache, typeReferenceDirectiveResolutionCache = state.typeReferenceDirectiveResolutionCache;
host.readFile = cache.originalReadFile;
host.fileExists = cache.originalFileExists;
host.directoryExists = cache.originalDirectoryExists;
host.createDirectory = cache.originalCreateDirectory;
host.writeFile = cache.originalWriteFile;
compilerHost.getSourceFile = cache.originalGetSourceFile;
state.readFileWithCache = cache.originalReadFileWithCache;
extendedConfigCache.clear();
moduleResolutionCache === null || moduleResolutionCache === void 0 ? void 0 : moduleResolutionCache.clear();
typeReferenceDirectiveResolutionCache === null || typeReferenceDirectiveResolutionCache === void 0 ? void 0 : typeReferenceDirectiveResolutionCache.clear();
state.cache = undefined;
}
function clearProjectStatus(state, resolved) {
state.projectStatus.delete(resolved);
state.diagnostics.delete(resolved);
}
function addProjToQueue(_a, proj, reloadLevel) {
var projectPendingBuild = _a.projectPendingBuild;
var value = projectPendingBuild.get(proj);
if (value === undefined) {
projectPendingBuild.set(proj, reloadLevel);
}
else if (value < reloadLevel) {
projectPendingBuild.set(proj, reloadLevel);
}
}
function setupInitialBuild(state, cancellationToken) {
// Set initial build if not already built
if (!state.allProjectBuildPending)
return;
state.allProjectBuildPending = false;
if (state.options.watch) {
reportWatchStatus(state, ts.Diagnostics.Starting_compilation_in_watch_mode);
}
enableCache(state);
var buildOrder = getBuildOrderFromAnyBuildOrder(getBuildOrder(state));
buildOrder.forEach(function (configFileName) {
return state.projectPendingBuild.set(toResolvedConfigFilePath(state, configFileName), ts.ConfigFileProgramReloadLevel.None);
});
if (cancellationToken) {
cancellationToken.throwIfCancellationRequested();
}
}
var InvalidatedProjectKind;
(function (InvalidatedProjectKind) {
InvalidatedProjectKind[InvalidatedProjectKind["Build"] = 0] = "Build";
InvalidatedProjectKind[InvalidatedProjectKind["UpdateBundle"] = 1] = "UpdateBundle";
InvalidatedProjectKind[InvalidatedProjectKind["UpdateOutputFileStamps"] = 2] = "UpdateOutputFileStamps";
})(InvalidatedProjectKind = ts.InvalidatedProjectKind || (ts.InvalidatedProjectKind = {}));
function doneInvalidatedProject(state, projectPath) {
state.projectPendingBuild.delete(projectPath);
state.currentInvalidatedProject = undefined;
return state.diagnostics.has(projectPath) ?
ts.ExitStatus.DiagnosticsPresent_OutputsSkipped :
ts.ExitStatus.Success;
}
function createUpdateOutputFileStampsProject(state, project, projectPath, config, buildOrder) {
var updateOutputFileStampsPending = true;
return {
kind: InvalidatedProjectKind.UpdateOutputFileStamps,
project: project,
projectPath: projectPath,
buildOrder: buildOrder,
getCompilerOptions: function () { return config.options; },
getCurrentDirectory: function () { return state.currentDirectory; },
updateOutputFileStatmps: function () {
updateOutputTimestamps(state, config, projectPath);
updateOutputFileStampsPending = false;
},
done: function () {
if (updateOutputFileStampsPending) {
updateOutputTimestamps(state, config, projectPath);
}
return doneInvalidatedProject(state, projectPath);
}
};
}
var BuildStep;
(function (BuildStep) {
BuildStep[BuildStep["CreateProgram"] = 0] = "CreateProgram";
BuildStep[BuildStep["SyntaxDiagnostics"] = 1] = "SyntaxDiagnostics";
BuildStep[BuildStep["SemanticDiagnostics"] = 2] = "SemanticDiagnostics";
BuildStep[BuildStep["Emit"] = 3] = "Emit";
BuildStep[BuildStep["EmitBundle"] = 4] = "EmitBundle";
BuildStep[BuildStep["EmitBuildInfo"] = 5] = "EmitBuildInfo";
BuildStep[BuildStep["BuildInvalidatedProjectOfBundle"] = 6] = "BuildInvalidatedProjectOfBundle";
BuildStep[BuildStep["QueueReferencingProjects"] = 7] = "QueueReferencingProjects";
BuildStep[BuildStep["Done"] = 8] = "Done";
})(BuildStep || (BuildStep = {}));
function createBuildOrUpdateInvalidedProject(kind, state, project, projectPath, projectIndex, config, buildOrder) {
var step = kind === InvalidatedProjectKind.Build ? BuildStep.CreateProgram : BuildStep.EmitBundle;
var program;
var buildResult;
var invalidatedProjectOfBundle;
return kind === InvalidatedProjectKind.Build ?
{
kind: kind,
project: project,
projectPath: projectPath,
buildOrder: buildOrder,
getCompilerOptions: function () { return config.options; },
getCurrentDirectory: function () { return state.currentDirectory; },
getBuilderProgram: function () { return withProgramOrUndefined(ts.identity); },
getProgram: function () {
return withProgramOrUndefined(function (program) { return program.getProgramOrUndefined(); });
},
getSourceFile: function (fileName) {
return withProgramOrUndefined(function (program) { return program.getSourceFile(fileName); });
},
getSourceFiles: function () {
return withProgramOrEmptyArray(function (program) { return program.getSourceFiles(); });
},
getOptionsDiagnostics: function (cancellationToken) {
return withProgramOrEmptyArray(function (program) { return program.getOptionsDiagnostics(cancellationToken); });
},
getGlobalDiagnostics: function (cancellationToken) {
return withProgramOrEmptyArray(function (program) { return program.getGlobalDiagnostics(cancellationToken); });
},
getConfigFileParsingDiagnostics: function () {
return withProgramOrEmptyArray(function (program) { return program.getConfigFileParsingDiagnostics(); });
},
getSyntacticDiagnostics: function (sourceFile, cancellationToken) {
return withProgramOrEmptyArray(function (program) { return program.getSyntacticDiagnostics(sourceFile, cancellationToken); });
},
getAllDependencies: function (sourceFile) {
return withProgramOrEmptyArray(function (program) { return program.getAllDependencies(sourceFile); });
},
getSemanticDiagnostics: function (sourceFile, cancellationToken) {
return withProgramOrEmptyArray(function (program) { return program.getSemanticDiagnostics(sourceFile, cancellationToken); });
},
getSemanticDiagnosticsOfNextAffectedFile: function (cancellationToken, ignoreSourceFile) {
return withProgramOrUndefined(function (program) {
return (program.getSemanticDiagnosticsOfNextAffectedFile) &&
program.getSemanticDiagnosticsOfNextAffectedFile(cancellationToken, ignoreSourceFile);
});
},
emit: function (targetSourceFile, writeFile, cancellationToken, emitOnlyDtsFiles, customTransformers) {
if (targetSourceFile || emitOnlyDtsFiles) {
return withProgramOrUndefined(function (program) { var _a, _b; return program.emit(targetSourceFile, writeFile, cancellationToken, emitOnlyDtsFiles, customTransformers || ((_b = (_a = state.host).getCustomTransformers) === null || _b === void 0 ? void 0 : _b.call(_a, project))); });
}
executeSteps(BuildStep.SemanticDiagnostics, cancellationToken);
if (step === BuildStep.EmitBuildInfo) {
return emitBuildInfo(writeFile, cancellationToken);
}
if (step !== BuildStep.Emit)
return undefined;
return emit(writeFile, cancellationToken, customTransformers);
},
done: done
} :
{
kind: kind,
project: project,
projectPath: projectPath,
buildOrder: buildOrder,
getCompilerOptions: function () { return config.options; },
getCurrentDirectory: function () { return state.currentDirectory; },
emit: function (writeFile, customTransformers) {
if (step !== BuildStep.EmitBundle)
return invalidatedProjectOfBundle;
return emitBundle(writeFile, customTransformers);
},
done: done,
};
function done(cancellationToken, writeFile, customTransformers) {
executeSteps(BuildStep.Done, cancellationToken, writeFile, customTransformers);
return doneInvalidatedProject(state, projectPath);
}
function withProgramOrUndefined(action) {
executeSteps(BuildStep.CreateProgram);
return program && action(program);
}
function withProgramOrEmptyArray(action) {
return withProgramOrUndefined(action) || ts.emptyArray;
}
function createProgram() {
var _a, _b;
ts.Debug.assert(program === undefined);
if (state.options.dry) {
reportStatus(state, ts.Diagnostics.A_non_dry_build_would_build_project_0, project);
buildResult = BuildResultFlags.Success;
step = BuildStep.QueueReferencingProjects;
return;
}
if (state.options.verbose)
reportStatus(state, ts.Diagnostics.Building_project_0, project);
if (config.fileNames.length === 0) {
reportAndStoreErrors(state, projectPath, ts.getConfigFileParsingDiagnostics(config));
// Nothing to build - must be a solution file, basically
buildResult = BuildResultFlags.None;
step = BuildStep.QueueReferencingProjects;
return;
}
var host = state.host, compilerHost = state.compilerHost;
state.projectCompilerOptions = config.options;
// Update module resolution cache if needed
(_a = state.moduleResolutionCache) === null || _a === void 0 ? void 0 : _a.update(config.options);
(_b = state.typeReferenceDirectiveResolutionCache) === null || _b === void 0 ? void 0 : _b.update(config.options);
// Create program
program = host.createProgram(config.fileNames, config.options, compilerHost, getOldProgram(state, projectPath, config), ts.getConfigFileParsingDiagnostics(config), config.projectReferences);
if (state.watch) {
state.lastCachedPackageJsonLookups.set(projectPath, state.moduleResolutionCache && ts.map(state.moduleResolutionCache.getPackageJsonInfoCache().entries(), function (_a) {
var path = _a[0], data = _a[1];
return [state.host.realpath && data ? toPath(state, state.host.realpath(path)) : path, data];
}));
state.builderPrograms.set(projectPath, program);
}
step++;
}
function handleDiagnostics(diagnostics, errorFlags, errorType) {
var _a;
if (diagnostics.length) {
(_a = buildErrors(state, projectPath, program, config, diagnostics, errorFlags, errorType), buildResult = _a.buildResult, step = _a.step);
}
else {
step++;
}
}
function getSyntaxDiagnostics(cancellationToken) {
ts.Debug.assertIsDefined(program);
handleDiagnostics(__spreadArray(__spreadArray(__spreadArray(__spreadArray([], program.getConfigFileParsingDiagnostics(), true), program.getOptionsDiagnostics(cancellationToken), true), program.getGlobalDiagnostics(cancellationToken), true), program.getSyntacticDiagnostics(/*sourceFile*/ undefined, cancellationToken), true), BuildResultFlags.SyntaxErrors, "Syntactic");
}
function getSemanticDiagnostics(cancellationToken) {
handleDiagnostics(ts.Debug.checkDefined(program).getSemanticDiagnostics(/*sourceFile*/ undefined, cancellationToken), BuildResultFlags.TypeErrors, "Semantic");
}
function emit(writeFileCallback, cancellationToken, customTransformers) {
var _a;
var _b, _c;
ts.Debug.assertIsDefined(program);
ts.Debug.assert(step === BuildStep.Emit);
// Before emitting lets backup state, so we can revert it back if there are declaration errors to handle emit and declaration errors correctly
program.backupState();
var declDiagnostics;
var reportDeclarationDiagnostics = function (d) { return (declDiagnostics || (declDiagnostics = [])).push(d); };
var outputFiles = [];
var emitResult = ts.emitFilesAndReportErrors(program, reportDeclarationDiagnostics,
/*write*/ undefined,
/*reportSummary*/ undefined, function (name, text, writeByteOrderMark) { return outputFiles.push({ name: name, text: text, writeByteOrderMark: writeByteOrderMark }); }, cancellationToken,
/*emitOnlyDts*/ false, customTransformers || ((_c = (_b = state.host).getCustomTransformers) === null || _c === void 0 ? void 0 : _c.call(_b, project))).emitResult;
// Don't emit .d.ts if there are decl file errors
if (declDiagnostics) {
program.restoreState();
(_a = buildErrors(state, projectPath, program, config, declDiagnostics, BuildResultFlags.DeclarationEmitErrors, "Declaration file"), buildResult = _a.buildResult, step = _a.step);
return {
emitSkipped: true,
diagnostics: emitResult.diagnostics
};
}
// Actual Emit
var host = state.host, compilerHost = state.compilerHost;
var resultFlags = BuildResultFlags.DeclarationOutputUnchanged;
var newestDeclarationFileContentChangedTime = minimumDate;
var anyDtsChanged = false;
var emitterDiagnostics = ts.createDiagnosticCollection();
var emittedOutputs = new ts.Map();
outputFiles.forEach(function (_a) {
var name = _a.name, text = _a.text, writeByteOrderMark = _a.writeByteOrderMark;
var priorChangeTime;
if (!anyDtsChanged && isDeclarationFile(name)) {
// Check for unchanged .d.ts files
if (host.fileExists(name) && state.readFileWithCache(name) === text) {
priorChangeTime = host.getModifiedTime(name);
}
else {
resultFlags &= ~BuildResultFlags.DeclarationOutputUnchanged;
anyDtsChanged = true;
}
}
emittedOutputs.set(toPath(state, name), name);
ts.writeFile(writeFileCallback ? { writeFile: writeFileCallback } : compilerHost, emitterDiagnostics, name, text, writeByteOrderMark);
if (priorChangeTime !== undefined) {
newestDeclarationFileContentChangedTime = newer(priorChangeTime, newestDeclarationFileContentChangedTime);
}
});
finishEmit(emitterDiagnostics, emittedOutputs, newestDeclarationFileContentChangedTime,
/*newestDeclarationFileContentChangedTimeIsMaximumDate*/ anyDtsChanged, outputFiles.length ? outputFiles[0].name : ts.getFirstProjectOutput(config, !host.useCaseSensitiveFileNames()), resultFlags);
return emitResult;
}
function emitBuildInfo(writeFileCallback, cancellationToken) {
ts.Debug.assertIsDefined(program);
ts.Debug.assert(step === BuildStep.EmitBuildInfo);
var emitResult = program.emitBuildInfo(writeFileCallback, cancellationToken);
if (emitResult.diagnostics.length) {
reportErrors(state, emitResult.diagnostics);
state.diagnostics.set(projectPath, __spreadArray(__spreadArray([], state.diagnostics.get(projectPath), true), emitResult.diagnostics, true));
buildResult = BuildResultFlags.EmitErrors & buildResult;
}
if (emitResult.emittedFiles && state.write) {
emitResult.emittedFiles.forEach(function (name) { return listEmittedFile(state, config, name); });
}
afterProgramDone(state, program, config);
step = BuildStep.QueueReferencingProjects;
return emitResult;
}
function finishEmit(emitterDiagnostics, emittedOutputs, priorNewestUpdateTime, newestDeclarationFileContentChangedTimeIsMaximumDate, oldestOutputFileName, resultFlags) {
var _a;
var emitDiagnostics = emitterDiagnostics.getDiagnostics();
if (emitDiagnostics.length) {
(_a = buildErrors(state, projectPath, program, config, emitDiagnostics, BuildResultFlags.EmitErrors, "Emit"), buildResult = _a.buildResult, step = _a.step);
return emitDiagnostics;
}
if (state.write) {
emittedOutputs.forEach(function (name) { return listEmittedFile(state, config, name); });
}
// Update time stamps for rest of the outputs
var newestDeclarationFileContentChangedTime = updateOutputTimestampsWorker(state, config, priorNewestUpdateTime, ts.Diagnostics.Updating_unchanged_output_timestamps_of_project_0, emittedOutputs);
state.diagnostics.delete(projectPath);
state.projectStatus.set(projectPath, {
type: ts.UpToDateStatusType.UpToDate,
newestDeclarationFileContentChangedTime: newestDeclarationFileContentChangedTimeIsMaximumDate ?
maximumDate :
newestDeclarationFileContentChangedTime,
oldestOutputFileName: oldestOutputFileName
});
afterProgramDone(state, program, config);
step = BuildStep.QueueReferencingProjects;
buildResult = resultFlags;
return emitDiagnostics;
}
function emitBundle(writeFileCallback, customTransformers) {
var _a, _b;
ts.Debug.assert(kind === InvalidatedProjectKind.UpdateBundle);
if (state.options.dry) {
reportStatus(state, ts.Diagnostics.A_non_dry_build_would_update_output_of_project_0, project);
buildResult = BuildResultFlags.Success;
step = BuildStep.QueueReferencingProjects;
return undefined;
}
if (state.options.verbose)
reportStatus(state, ts.Diagnostics.Updating_output_of_project_0, project);
// Update js, and source map
var compilerHost = state.compilerHost;
state.projectCompilerOptions = config.options;
var outputFiles = ts.emitUsingBuildInfo(config, compilerHost, function (ref) {
var refName = resolveProjectName(state, ref.path);
return parseConfigFile(state, refName, toResolvedConfigFilePath(state, refName));
}, customTransformers || ((_b = (_a = state.host).getCustomTransformers) === null || _b === void 0 ? void 0 : _b.call(_a, project)));
if (ts.isString(outputFiles)) {
reportStatus(state, ts.Diagnostics.Cannot_update_output_of_project_0_because_there_was_error_reading_file_1, project, relName(state, outputFiles));
step = BuildStep.BuildInvalidatedProjectOfBundle;
return invalidatedProjectOfBundle = createBuildOrUpdateInvalidedProject(InvalidatedProjectKind.Build, state, project, projectPath, projectIndex, config, buildOrder);
}
// Actual Emit
ts.Debug.assert(!!outputFiles.length);
var emitterDiagnostics = ts.createDiagnosticCollection();
var emittedOutputs = new ts.Map();
outputFiles.forEach(function (_a) {
var name = _a.name, text = _a.text, writeByteOrderMark = _a.writeByteOrderMark;
emittedOutputs.set(toPath(state, name), name);
ts.writeFile(writeFileCallback ? { writeFile: writeFileCallback } : compilerHost, emitterDiagnostics, name, text, writeByteOrderMark);
});
var emitDiagnostics = finishEmit(emitterDiagnostics, emittedOutputs, minimumDate,
/*newestDeclarationFileContentChangedTimeIsMaximumDate*/ false, outputFiles[0].name, BuildResultFlags.DeclarationOutputUnchanged);
return { emitSkipped: false, diagnostics: emitDiagnostics };
}
function executeSteps(till, cancellationToken, writeFile, customTransformers) {
while (step <= till && step < BuildStep.Done) {
var currentStep = step;
switch (step) {
case BuildStep.CreateProgram:
createProgram();
break;
case BuildStep.SyntaxDiagnostics:
getSyntaxDiagnostics(cancellationToken);
break;
case BuildStep.SemanticDiagnostics:
getSemanticDiagnostics(cancellationToken);
break;
case BuildStep.Emit:
emit(writeFile, cancellationToken, customTransformers);
break;
case BuildStep.EmitBuildInfo:
emitBuildInfo(writeFile, cancellationToken);
break;
case BuildStep.EmitBundle:
emitBundle(writeFile, customTransformers);
break;
case BuildStep.BuildInvalidatedProjectOfBundle:
ts.Debug.checkDefined(invalidatedProjectOfBundle).done(cancellationToken, writeFile, customTransformers);
step = BuildStep.Done;
break;
case BuildStep.QueueReferencingProjects:
queueReferencingProjects(state, project, projectPath, projectIndex, config, buildOrder, ts.Debug.checkDefined(buildResult));
step++;
break;
// Should never be done
case BuildStep.Done:
default:
ts.assertType(step);
}
ts.Debug.assert(step > currentStep);
}
}
}
function needsBuild(_a, status, config) {
var options = _a.options;
if (status.type !== ts.UpToDateStatusType.OutOfDateWithPrepend || options.force)
return true;
return config.fileNames.length === 0 ||
!!ts.getConfigFileParsingDiagnostics(config).length ||
!ts.isIncrementalCompilation(config.options);
}
function getNextInvalidatedProject(state, buildOrder, reportQueue) {
if (!state.projectPendingBuild.size)
return undefined;
if (isCircularBuildOrder(buildOrder))
return undefined;
if (state.currentInvalidatedProject) {
// Only if same buildOrder the currentInvalidated project can be sent again
return ts.arrayIsEqualTo(state.currentInvalidatedProject.buildOrder, buildOrder) ?
state.currentInvalidatedProject :
undefined;
}
var options = state.options, projectPendingBuild = state.projectPendingBuild;
for (var projectIndex = 0; projectIndex < buildOrder.length; projectIndex++) {
var project = buildOrder[projectIndex];
var projectPath = toResolvedConfigFilePath(state, project);
var reloadLevel = state.projectPendingBuild.get(projectPath);
if (reloadLevel === undefined)
continue;
if (reportQueue) {
reportQueue = false;
reportBuildQueue(state, buildOrder);
}
var config = parseConfigFile(state, project, projectPath);
if (!config) {
reportParseConfigFileDiagnostic(state, projectPath);
projectPendingBuild.delete(projectPath);
continue;
}
if (reloadLevel === ts.ConfigFileProgramReloadLevel.Full) {
watchConfigFile(state, project, projectPath, config);
watchExtendedConfigFiles(state, projectPath, config);
watchWildCardDirectories(state, project, projectPath, config);
watchInputFiles(state, project, projectPath, config);
watchPackageJsonFiles(state, project, projectPath, config);
}
else if (reloadLevel === ts.ConfigFileProgramReloadLevel.Partial) {
// Update file names
config.fileNames = ts.getFileNamesFromConfigSpecs(config.options.configFile.configFileSpecs, ts.getDirectoryPath(project), config.options, state.parseConfigFileHost);
ts.updateErrorForNoInputFiles(config.fileNames, project, config.options.configFile.configFileSpecs, config.errors, ts.canJsonReportNoInputFiles(config.raw));
watchInputFiles(state, project, projectPath, config);
watchPackageJsonFiles(state, project, projectPath, config);
}
var status = getUpToDateStatus(state, config, projectPath);
verboseReportProjectStatus(state, project, status);
if (!options.force) {
if (status.type === ts.UpToDateStatusType.UpToDate) {
reportAndStoreErrors(state, projectPath, ts.getConfigFileParsingDiagnostics(config));
projectPendingBuild.delete(projectPath);
// Up to date, skip
if (options.dry) {
// In a dry build, inform the user of this fact
reportStatus(state, ts.Diagnostics.Project_0_is_up_to_date, project);
}
continue;
}
if (status.type === ts.UpToDateStatusType.UpToDateWithUpstreamTypes) {
reportAndStoreErrors(state, projectPath, ts.getConfigFileParsingDiagnostics(config));
return createUpdateOutputFileStampsProject(state, project, projectPath, config, buildOrder);
}
}
if (status.type === ts.UpToDateStatusType.UpstreamBlocked) {
reportAndStoreErrors(state, projectPath, ts.getConfigFileParsingDiagnostics(config));
projectPendingBuild.delete(projectPath);
if (options.verbose) {
reportStatus(state, status.upstreamProjectBlocked ?
ts.Diagnostics.Skipping_build_of_project_0_because_its_dependency_1_was_not_built :
ts.Diagnostics.Skipping_build_of_project_0_because_its_dependency_1_has_errors, project, status.upstreamProjectName);
}
continue;
}
if (status.type === ts.UpToDateStatusType.ContainerOnly) {
reportAndStoreErrors(state, projectPath, ts.getConfigFileParsingDiagnostics(config));
projectPendingBuild.delete(projectPath);
// Do nothing
continue;
}
return createBuildOrUpdateInvalidedProject(needsBuild(state, status, config) ?
InvalidatedProjectKind.Build :
InvalidatedProjectKind.UpdateBundle, state, project, projectPath, projectIndex, config, buildOrder);
}
return undefined;
}
function listEmittedFile(_a, proj, file) {
var write = _a.write;
if (write && proj.options.listEmittedFiles) {
write("TSFILE: " + file);
}
}
function getOldProgram(_a, proj, parsed) {
var options = _a.options, builderPrograms = _a.builderPrograms, compilerHost = _a.compilerHost;
if (options.force)
return undefined;
var value = builderPrograms.get(proj);
if (value)
return value;
return ts.readBuilderProgram(parsed.options, compilerHost);
}
function afterProgramDone(state, program, config) {
if (program) {
if (program && state.write)
ts.listFiles(program, state.write);
if (state.host.afterProgramEmitAndDiagnostics) {
state.host.afterProgramEmitAndDiagnostics(program);
}
program.releaseProgram();
}
else if (state.host.afterEmitBundle) {
state.host.afterEmitBundle(config);
}
state.projectCompilerOptions = state.baseCompilerOptions;
}
function buildErrors(state, resolvedPath, program, config, diagnostics, buildResult, errorType) {
var canEmitBuildInfo = !(buildResult & BuildResultFlags.SyntaxErrors) && program && !ts.outFile(program.getCompilerOptions());
reportAndStoreErrors(state, resolvedPath, diagnostics);
state.projectStatus.set(resolvedPath, { type: ts.UpToDateStatusType.Unbuildable, reason: errorType + " errors" });
if (canEmitBuildInfo)
return { buildResult: buildResult, step: BuildStep.EmitBuildInfo };
afterProgramDone(state, program, config);
return { buildResult: buildResult, step: BuildStep.QueueReferencingProjects };
}
function checkConfigFileUpToDateStatus(state, configFile, oldestOutputFileTime, oldestOutputFileName) {
// Check tsconfig time
var tsconfigTime = ts.getModifiedTime(state.host, configFile);
if (oldestOutputFileTime < tsconfigTime) {
return {
type: ts.UpToDateStatusType.OutOfDateWithSelf,
outOfDateOutputFileName: oldestOutputFileName,
newerInputFileName: configFile
};
}
}
function getUpToDateStatusWorker(state, project, resolvedPath) {
var force = !!state.options.force;
var newestInputFileName = undefined;
var newestInputFileTime = minimumDate;
var host = state.host;
// Get timestamps of input files
for (var _i = 0, _a = project.fileNames; _i < _a.length; _i++) {
var inputFile = _a[_i];
if (!host.fileExists(inputFile)) {
return {
type: ts.UpToDateStatusType.Unbuildable,
reason: inputFile + " does not exist"
};
}
if (!force) {
var inputTime = ts.getModifiedTime(host, inputFile);
host.getModifiedTime(inputFile);
if (inputTime > newestInputFileTime) {
newestInputFileName = inputFile;
newestInputFileTime = inputTime;
}
}
}
// Container if no files are specified in the project
if (!project.fileNames.length && !ts.canJsonReportNoInputFiles(project.raw)) {
return {
type: ts.UpToDateStatusType.ContainerOnly
};
}
// Collect the expected outputs of this project
var outputs = ts.getAllProjectOutputs(project, !host.useCaseSensitiveFileNames());
// Now see if all outputs are newer than the newest input
var oldestOutputFileName = "(none)";
var oldestOutputFileTime = maximumDate;
var newestOutputFileName = "(none)";
var newestOutputFileTime = minimumDate;
var missingOutputFileName;
var newestDeclarationFileContentChangedTime = minimumDate;
var isOutOfDateWithInputs = false;
if (!force) {
for (var _b = 0, outputs_1 = outputs; _b < outputs_1.length; _b++) {
var output = outputs_1[_b];
// Output is missing; can stop checking
// Don't immediately return because we can still be upstream-blocked, which is a higher-priority status
if (!host.fileExists(output)) {
missingOutputFileName = output;
break;
}
var outputTime = ts.getModifiedTime(host, output);
if (outputTime < oldestOutputFileTime) {
oldestOutputFileTime = outputTime;
oldestOutputFileName = output;
}
// If an output is older than the newest input, we can stop checking
// Don't immediately return because we can still be upstream-blocked, which is a higher-priority status
if (outputTime < newestInputFileTime) {
isOutOfDateWithInputs = true;
break;
}
if (outputTime > newestOutputFileTime) {
newestOutputFileTime = outputTime;
newestOutputFileName = output;
}
// Keep track of when the most recent time a .d.ts file was changed.
// In addition to file timestamps, we also keep track of when a .d.ts file
// had its file touched but not had its contents changed - this allows us
// to skip a downstream typecheck
if (isDeclarationFile(output)) {
var outputModifiedTime = ts.getModifiedTime(host, output);
newestDeclarationFileContentChangedTime = newer(newestDeclarationFileContentChangedTime, outputModifiedTime);
}
}
}
var pseudoUpToDate = false;
var usesPrepend = false;
var upstreamChangedProject;
if (project.projectReferences) {
state.projectStatus.set(resolvedPath, { type: ts.UpToDateStatusType.ComputingUpstream });
for (var _c = 0, _d = project.projectReferences; _c < _d.length; _c++) {
var ref = _d[_c];
usesPrepend = usesPrepend || !!(ref.prepend);
var resolvedRef = ts.resolveProjectReferencePath(ref);
var resolvedRefPath = toResolvedConfigFilePath(state, resolvedRef);
var refStatus = getUpToDateStatus(state, parseConfigFile(state, resolvedRef, resolvedRefPath), resolvedRefPath);
// Its a circular reference ignore the status of this project
if (refStatus.type === ts.UpToDateStatusType.ComputingUpstream ||
refStatus.type === ts.UpToDateStatusType.ContainerOnly) { // Container only ignore this project
continue;
}
// An upstream project is blocked
if (refStatus.type === ts.UpToDateStatusType.Unbuildable ||
refStatus.type === ts.UpToDateStatusType.UpstreamBlocked) {
return {
type: ts.UpToDateStatusType.UpstreamBlocked,
upstreamProjectName: ref.path,
upstreamProjectBlocked: refStatus.type === ts.UpToDateStatusType.UpstreamBlocked
};
}
// If the upstream project is out of date, then so are we (someone shouldn't have asked, though?)
if (refStatus.type !== ts.UpToDateStatusType.UpToDate) {
return {
type: ts.UpToDateStatusType.UpstreamOutOfDate,
upstreamProjectName: ref.path
};
}
// Check oldest output file name only if there is no missing output file name
// (a check we will have skipped if this is a forced build)
if (!force && !missingOutputFileName) {
// If the upstream project's newest file is older than our oldest output, we
// can't be out of date because of it
if (refStatus.newestInputFileTime && refStatus.newestInputFileTime <= oldestOutputFileTime) {
continue;
}
// If the upstream project has only change .d.ts files, and we've built
// *after* those files, then we're "psuedo up to date" and eligible for a fast rebuild
if (refStatus.newestDeclarationFileContentChangedTime && refStatus.newestDeclarationFileContentChangedTime <= oldestOutputFileTime) {
pseudoUpToDate = true;
upstreamChangedProject = ref.path;
continue;
}
// We have an output older than an upstream output - we are out of date
ts.Debug.assert(oldestOutputFileName !== undefined, "Should have an oldest output filename here");
return {
type: ts.UpToDateStatusType.OutOfDateWithUpstream,
outOfDateOutputFileName: oldestOutputFileName,
newerProjectName: ref.path
};
}
}
}
if (missingOutputFileName !== undefined) {
return {
type: ts.UpToDateStatusType.OutputMissing,
missingOutputFileName: missingOutputFileName
};
}
if (isOutOfDateWithInputs) {
return {
type: ts.UpToDateStatusType.OutOfDateWithSelf,
outOfDateOutputFileName: oldestOutputFileName,
newerInputFileName: newestInputFileName
};
}
else {
// Check tsconfig time
var configStatus = checkConfigFileUpToDateStatus(state, project.options.configFilePath, oldestOutputFileTime, oldestOutputFileName);
if (configStatus)
return configStatus;
// Check extended config time
var extendedConfigStatus = ts.forEach(project.options.configFile.extendedSourceFiles || ts.emptyArray, function (configFile) { return checkConfigFileUpToDateStatus(state, configFile, oldestOutputFileTime, oldestOutputFileName); });
if (extendedConfigStatus)
return extendedConfigStatus;
// Check package file time
var dependentPackageFileStatus = ts.forEach(state.lastCachedPackageJsonLookups.get(resolvedPath) || ts.emptyArray, function (_a) {
var path = _a[0];
return checkConfigFileUpToDateStatus(state, path, oldestOutputFileTime, oldestOutputFileName);
});
if (dependentPackageFileStatus)
return dependentPackageFileStatus;
}
if (!force && !state.buildInfoChecked.has(resolvedPath)) {
state.buildInfoChecked.set(resolvedPath, true);
var buildInfoPath = ts.getTsBuildInfoEmitOutputFilePath(project.options);
if (buildInfoPath) {
var value = state.readFileWithCache(buildInfoPath);
var buildInfo = value && ts.getBuildInfo(value);
if (buildInfo && (buildInfo.bundle || buildInfo.program) && buildInfo.version !== ts.version) {
return {
type: ts.UpToDateStatusType.TsVersionOutputOfDate,
version: buildInfo.version
};
}
}
}
if (usesPrepend && pseudoUpToDate) {
return {
type: ts.UpToDateStatusType.OutOfDateWithPrepend,
outOfDateOutputFileName: oldestOutputFileName,
newerProjectName: upstreamChangedProject
};
}
// Up to date
return {
type: pseudoUpToDate ? ts.UpToDateStatusType.UpToDateWithUpstreamTypes : ts.UpToDateStatusType.UpToDate,
newestDeclarationFileContentChangedTime: newestDeclarationFileContentChangedTime,
newestInputFileTime: newestInputFileTime,
newestOutputFileTime: newestOutputFileTime,
newestInputFileName: newestInputFileName,
newestOutputFileName: newestOutputFileName,
oldestOutputFileName: oldestOutputFileName
};
}
function getUpToDateStatus(state, project, resolvedPath) {
if (project === undefined) {
return { type: ts.UpToDateStatusType.Unbuildable, reason: "File deleted mid-build" };
}
var prior = state.projectStatus.get(resolvedPath);
if (prior !== undefined) {
return prior;
}
var actual = getUpToDateStatusWorker(state, project, resolvedPath);
state.projectStatus.set(resolvedPath, actual);
return actual;
}
function updateOutputTimestampsWorker(state, proj, priorNewestUpdateTime, verboseMessage, skipOutputs) {
if (proj.options.noEmit)
return priorNewestUpdateTime;
var host = state.host;
var outputs = ts.getAllProjectOutputs(proj, !host.useCaseSensitiveFileNames());
if (!skipOutputs || outputs.length !== skipOutputs.size) {
var reportVerbose = !!state.options.verbose;
var now = host.now ? host.now() : new Date();
for (var _i = 0, outputs_2 = outputs; _i < outputs_2.length; _i++) {
var file = outputs_2[_i];
if (skipOutputs && skipOutputs.has(toPath(state, file))) {
continue;
}
if (reportVerbose) {
reportVerbose = false;
reportStatus(state, verboseMessage, proj.options.configFilePath);
}
if (isDeclarationFile(file)) {
priorNewestUpdateTime = newer(priorNewestUpdateTime, ts.getModifiedTime(host, file));
}
host.setModifiedTime(file, now);
}
}
return priorNewestUpdateTime;
}
function updateOutputTimestamps(state, proj, resolvedPath) {
if (state.options.dry) {
return reportStatus(state, ts.Diagnostics.A_non_dry_build_would_update_timestamps_for_output_of_project_0, proj.options.configFilePath);
}
var priorNewestUpdateTime = updateOutputTimestampsWorker(state, proj, minimumDate, ts.Diagnostics.Updating_output_timestamps_of_project_0);
state.projectStatus.set(resolvedPath, {
type: ts.UpToDateStatusType.UpToDate,
newestDeclarationFileContentChangedTime: priorNewestUpdateTime,
oldestOutputFileName: ts.getFirstProjectOutput(proj, !state.host.useCaseSensitiveFileNames())
});
}
function queueReferencingProjects(state, project, projectPath, projectIndex, config, buildOrder, buildResult) {
// Queue only if there are no errors
if (buildResult & BuildResultFlags.AnyErrors)
return;
// Only composite projects can be referenced by other projects
if (!config.options.composite)
return;
// Always use build order to queue projects
for (var index = projectIndex + 1; index < buildOrder.length; index++) {
var nextProject = buildOrder[index];
var nextProjectPath = toResolvedConfigFilePath(state, nextProject);
if (state.projectPendingBuild.has(nextProjectPath))
continue;
var nextProjectConfig = parseConfigFile(state, nextProject, nextProjectPath);
if (!nextProjectConfig || !nextProjectConfig.projectReferences)
continue;
for (var _i = 0, _a = nextProjectConfig.projectReferences; _i < _a.length; _i++) {
var ref = _a[_i];
var resolvedRefPath = resolveProjectName(state, ref.path);
if (toResolvedConfigFilePath(state, resolvedRefPath) !== projectPath)
continue;
// If the project is referenced with prepend, always build downstream projects,
// If declaration output is changed, build the project
// otherwise mark the project UpToDateWithUpstreamTypes so it updates output time stamps
var status = state.projectStatus.get(nextProjectPath);
if (status) {
switch (status.type) {
case ts.UpToDateStatusType.UpToDate:
if (buildResult & BuildResultFlags.DeclarationOutputUnchanged) {
if (ref.prepend) {
state.projectStatus.set(nextProjectPath, {
type: ts.UpToDateStatusType.OutOfDateWithPrepend,
outOfDateOutputFileName: status.oldestOutputFileName,
newerProjectName: project
});
}
else {
status.type = ts.UpToDateStatusType.UpToDateWithUpstreamTypes;
}
break;
}
// falls through
case ts.UpToDateStatusType.UpToDateWithUpstreamTypes:
case ts.UpToDateStatusType.OutOfDateWithPrepend:
if (!(buildResult & BuildResultFlags.DeclarationOutputUnchanged)) {
state.projectStatus.set(nextProjectPath, {
type: ts.UpToDateStatusType.OutOfDateWithUpstream,
outOfDateOutputFileName: status.type === ts.UpToDateStatusType.OutOfDateWithPrepend ? status.outOfDateOutputFileName : status.oldestOutputFileName,
newerProjectName: project
});
}
break;
case ts.UpToDateStatusType.UpstreamBlocked:
if (toResolvedConfigFilePath(state, resolveProjectName(state, status.upstreamProjectName)) === projectPath) {
clearProjectStatus(state, nextProjectPath);
}
break;
}
}
addProjToQueue(state, nextProjectPath, ts.ConfigFileProgramReloadLevel.None);
break;
}
}
}
function build(state, project, cancellationToken, writeFile, getCustomTransformers, onlyReferences) {
var buildOrder = getBuildOrderFor(state, project, onlyReferences);
if (!buildOrder)
return ts.ExitStatus.InvalidProject_OutputsSkipped;
setupInitialBuild(state, cancellationToken);
var reportQueue = true;
var successfulProjects = 0;
while (true) {
var invalidatedProject = getNextInvalidatedProject(state, buildOrder, reportQueue);
if (!invalidatedProject)
break;
reportQueue = false;
invalidatedProject.done(cancellationToken, writeFile, getCustomTransformers === null || getCustomTransformers === void 0 ? void 0 : getCustomTransformers(invalidatedProject.project));
if (!state.diagnostics.has(invalidatedProject.projectPath))
successfulProjects++;
}
disableCache(state);
reportErrorSummary(state, buildOrder);
startWatching(state, buildOrder);
return isCircularBuildOrder(buildOrder)
? ts.ExitStatus.ProjectReferenceCycle_OutputsSkipped
: !buildOrder.some(function (p) { return state.diagnostics.has(toResolvedConfigFilePath(state, p)); })
? ts.ExitStatus.Success
: successfulProjects
? ts.ExitStatus.DiagnosticsPresent_OutputsGenerated
: ts.ExitStatus.DiagnosticsPresent_OutputsSkipped;
}
function clean(state, project, onlyReferences) {
var buildOrder = getBuildOrderFor(state, project, onlyReferences);
if (!buildOrder)
return ts.ExitStatus.InvalidProject_OutputsSkipped;
if (isCircularBuildOrder(buildOrder)) {
reportErrors(state, buildOrder.circularDiagnostics);
return ts.ExitStatus.ProjectReferenceCycle_OutputsSkipped;
}
var options = state.options, host = state.host;
var filesToDelete = options.dry ? [] : undefined;
for (var _i = 0, buildOrder_1 = buildOrder; _i < buildOrder_1.length; _i++) {
var proj = buildOrder_1[_i];
var resolvedPath = toResolvedConfigFilePath(state, proj);
var parsed = parseConfigFile(state, proj, resolvedPath);
if (parsed === undefined) {
// File has gone missing; fine to ignore here
reportParseConfigFileDiagnostic(state, resolvedPath);
continue;
}
var outputs = ts.getAllProjectOutputs(parsed, !host.useCaseSensitiveFileNames());
if (!outputs.length)
continue;
var inputFileNames = new ts.Set(parsed.fileNames.map(function (f) { return toPath(state, f); }));
for (var _a = 0, outputs_3 = outputs; _a < outputs_3.length; _a++) {
var output = outputs_3[_a];
// If output name is same as input file name, do not delete and ignore the error
if (inputFileNames.has(toPath(state, output)))
continue;
if (host.fileExists(output)) {
if (filesToDelete) {
filesToDelete.push(output);
}
else {
host.deleteFile(output);
invalidateProject(state, resolvedPath, ts.ConfigFileProgramReloadLevel.None);
}
}
}
}
if (filesToDelete) {
reportStatus(state, ts.Diagnostics.A_non_dry_build_would_delete_the_following_files_Colon_0, filesToDelete.map(function (f) { return "\r\n * " + f; }).join(""));
}
return ts.ExitStatus.Success;
}
function invalidateProject(state, resolved, reloadLevel) {
// If host implements getParsedCommandLine, we cant get list of files from parseConfigFileHost
if (state.host.getParsedCommandLine && reloadLevel === ts.ConfigFileProgramReloadLevel.Partial) {
reloadLevel = ts.ConfigFileProgramReloadLevel.Full;
}
if (reloadLevel === ts.ConfigFileProgramReloadLevel.Full) {
state.configFileCache.delete(resolved);
state.buildOrder = undefined;
}
state.needsSummary = true;
clearProjectStatus(state, resolved);
addProjToQueue(state, resolved, reloadLevel);
enableCache(state);
}
function invalidateProjectAndScheduleBuilds(state, resolvedPath, reloadLevel) {
state.reportFileChangeDetected = true;
invalidateProject(state, resolvedPath, reloadLevel);
scheduleBuildInvalidatedProject(state);
}
function scheduleBuildInvalidatedProject(state) {
var hostWithWatch = state.hostWithWatch;
if (!hostWithWatch.setTimeout || !hostWithWatch.clearTimeout) {
return;
}
if (state.timerToBuildInvalidatedProject) {
hostWithWatch.clearTimeout(state.timerToBuildInvalidatedProject);
}
state.timerToBuildInvalidatedProject = hostWithWatch.setTimeout(buildNextInvalidatedProject, 250, state);
}
function buildNextInvalidatedProject(state) {
state.timerToBuildInvalidatedProject = undefined;
if (state.reportFileChangeDetected) {
state.reportFileChangeDetected = false;
state.projectErrorsReported.clear();
reportWatchStatus(state, ts.Diagnostics.File_change_detected_Starting_incremental_compilation);
}
var buildOrder = getBuildOrder(state);
var invalidatedProject = getNextInvalidatedProject(state, buildOrder, /*reportQueue*/ false);
if (invalidatedProject) {
invalidatedProject.done();
if (state.projectPendingBuild.size) {
// Schedule next project for build
if (state.watch && !state.timerToBuildInvalidatedProject) {
scheduleBuildInvalidatedProject(state);
}
return;
}
}
disableCache(state);
reportErrorSummary(state, buildOrder);
}
function watchConfigFile(state, resolved, resolvedPath, parsed) {
if (!state.watch || state.allWatchedConfigFiles.has(resolvedPath))
return;
state.allWatchedConfigFiles.set(resolvedPath, state.watchFile(resolved, function () {
invalidateProjectAndScheduleBuilds(state, resolvedPath, ts.ConfigFileProgramReloadLevel.Full);
}, ts.PollingInterval.High, parsed === null || parsed === void 0 ? void 0 : parsed.watchOptions, ts.WatchType.ConfigFile, resolved));
}
function watchExtendedConfigFiles(state, resolvedPath, parsed) {
ts.updateSharedExtendedConfigFileWatcher(resolvedPath, parsed === null || parsed === void 0 ? void 0 : parsed.options, state.allWatchedExtendedConfigFiles, function (extendedConfigFileName, extendedConfigFilePath) { return state.watchFile(extendedConfigFileName, function () {
var _a;
return (_a = state.allWatchedExtendedConfigFiles.get(extendedConfigFilePath)) === null || _a === void 0 ? void 0 : _a.projects.forEach(function (projectConfigFilePath) {
return invalidateProjectAndScheduleBuilds(state, projectConfigFilePath, ts.ConfigFileProgramReloadLevel.Full);
});
}, ts.PollingInterval.High, parsed === null || parsed === void 0 ? void 0 : parsed.watchOptions, ts.WatchType.ExtendedConfigFile); }, function (fileName) { return toPath(state, fileName); });
}
function watchWildCardDirectories(state, resolved, resolvedPath, parsed) {
if (!state.watch)
return;
ts.updateWatchingWildcardDirectories(getOrCreateValueMapFromConfigFileMap(state.allWatchedWildcardDirectories, resolvedPath), new ts.Map(ts.getEntries(parsed.wildcardDirectories)), function (dir, flags) { return state.watchDirectory(dir, function (fileOrDirectory) {
var _a;
if (ts.isIgnoredFileFromWildCardWatching({
watchedDirPath: toPath(state, dir),
fileOrDirectory: fileOrDirectory,
fileOrDirectoryPath: toPath(state, fileOrDirectory),
configFileName: resolved,
currentDirectory: state.currentDirectory,
options: parsed.options,
program: state.builderPrograms.get(resolvedPath) || ((_a = getCachedParsedConfigFile(state, resolvedPath)) === null || _a === void 0 ? void 0 : _a.fileNames),
useCaseSensitiveFileNames: state.parseConfigFileHost.useCaseSensitiveFileNames,
writeLog: function (s) { return state.writeLog(s); },
toPath: function (fileName) { return toPath(state, fileName); }
}))
return;
invalidateProjectAndScheduleBuilds(state, resolvedPath, ts.ConfigFileProgramReloadLevel.Partial);
}, flags, parsed === null || parsed === void 0 ? void 0 : parsed.watchOptions, ts.WatchType.WildcardDirectory, resolved); });
}
function watchInputFiles(state, resolved, resolvedPath, parsed) {
if (!state.watch)
return;
ts.mutateMap(getOrCreateValueMapFromConfigFileMap(state.allWatchedInputFiles, resolvedPath), ts.arrayToMap(parsed.fileNames, function (fileName) { return toPath(state, fileName); }), {
createNewValue: function (_path, input) { return state.watchFile(input, function () { return invalidateProjectAndScheduleBuilds(state, resolvedPath, ts.ConfigFileProgramReloadLevel.None); }, ts.PollingInterval.Low, parsed === null || parsed === void 0 ? void 0 : parsed.watchOptions, ts.WatchType.SourceFile, resolved); },
onDeleteValue: ts.closeFileWatcher,
});
}
function watchPackageJsonFiles(state, resolved, resolvedPath, parsed) {
if (!state.watch || !state.lastCachedPackageJsonLookups)
return;
ts.mutateMap(getOrCreateValueMapFromConfigFileMap(state.allWatchedPackageJsonFiles, resolvedPath), new ts.Map(state.lastCachedPackageJsonLookups.get(resolvedPath)), {
createNewValue: function (path, _input) { return state.watchFile(path, function () { return invalidateProjectAndScheduleBuilds(state, resolvedPath, ts.ConfigFileProgramReloadLevel.Full); }, ts.PollingInterval.High, parsed === null || parsed === void 0 ? void 0 : parsed.watchOptions, ts.WatchType.PackageJson, resolved); },
onDeleteValue: ts.closeFileWatcher,
});
}
function startWatching(state, buildOrder) {
if (!state.watchAllProjectsPending)
return;
state.watchAllProjectsPending = false;
for (var _i = 0, _a = getBuildOrderFromAnyBuildOrder(buildOrder); _i < _a.length; _i++) {
var resolved = _a[_i];
var resolvedPath = toResolvedConfigFilePath(state, resolved);
var cfg = parseConfigFile(state, resolved, resolvedPath);
// Watch this file
watchConfigFile(state, resolved, resolvedPath, cfg);
watchExtendedConfigFiles(state, resolvedPath, cfg);
if (cfg) {
// Update watchers for wildcard directories
watchWildCardDirectories(state, resolved, resolvedPath, cfg);
// Watch input files
watchInputFiles(state, resolved, resolvedPath, cfg);
// Watch package json files
watchPackageJsonFiles(state, resolved, resolvedPath, cfg);
}
}
}
function stopWatching(state) {
ts.clearMap(state.allWatchedConfigFiles, ts.closeFileWatcher);
ts.clearMap(state.allWatchedExtendedConfigFiles, ts.closeFileWatcherOf);
ts.clearMap(state.allWatchedWildcardDirectories, function (watchedWildcardDirectories) { return ts.clearMap(watchedWildcardDirectories, ts.closeFileWatcherOf); });
ts.clearMap(state.allWatchedInputFiles, function (watchedWildcardDirectories) { return ts.clearMap(watchedWildcardDirectories, ts.closeFileWatcher); });
ts.clearMap(state.allWatchedPackageJsonFiles, function (watchedPacageJsonFiles) { return ts.clearMap(watchedPacageJsonFiles, ts.closeFileWatcher); });
}
function createSolutionBuilderWorker(watch, hostOrHostWithWatch, rootNames, options, baseWatchOptions) {
var state = createSolutionBuilderState(watch, hostOrHostWithWatch, rootNames, options, baseWatchOptions);
return {
build: function (project, cancellationToken, writeFile, getCustomTransformers) { return build(state, project, cancellationToken, writeFile, getCustomTransformers); },
clean: function (project) { return clean(state, project); },
buildReferences: function (project, cancellationToken, writeFile, getCustomTransformers) { return build(state, project, cancellationToken, writeFile, getCustomTransformers, /*onlyReferences*/ true); },
cleanReferences: function (project) { return clean(state, project, /*onlyReferences*/ true); },
getNextInvalidatedProject: function (cancellationToken) {
setupInitialBuild(state, cancellationToken);
return getNextInvalidatedProject(state, getBuildOrder(state), /*reportQueue*/ false);
},
getBuildOrder: function () { return getBuildOrder(state); },
getUpToDateStatusOfProject: function (project) {
var configFileName = resolveProjectName(state, project);
var configFilePath = toResolvedConfigFilePath(state, configFileName);
return getUpToDateStatus(state, parseConfigFile(state, configFileName, configFilePath), configFilePath);
},
invalidateProject: function (configFilePath, reloadLevel) { return invalidateProject(state, configFilePath, reloadLevel || ts.ConfigFileProgramReloadLevel.None); },
buildNextInvalidatedProject: function () { return buildNextInvalidatedProject(state); },
getAllParsedConfigs: function () { return ts.arrayFrom(ts.mapDefinedIterator(state.configFileCache.values(), function (config) { return isParsedCommandLine(config) ? config : undefined; })); },
close: function () { return stopWatching(state); },
};
}
function relName(state, path) {
return ts.convertToRelativePath(path, state.currentDirectory, function (f) { return state.getCanonicalFileName(f); });
}
function reportStatus(state, message) {
var args = [];
for (var _i = 2; _i < arguments.length; _i++) {
args[_i - 2] = arguments[_i];
}
state.host.reportSolutionBuilderStatus(ts.createCompilerDiagnostic.apply(void 0, __spreadArray([message], args, false)));
}
function reportWatchStatus(state, message) {
var _a, _b;
var args = [];
for (var _i = 2; _i < arguments.length; _i++) {
args[_i - 2] = arguments[_i];
}
(_b = (_a = state.hostWithWatch).onWatchStatusChange) === null || _b === void 0 ? void 0 : _b.call(_a, ts.createCompilerDiagnostic.apply(void 0, __spreadArray([message], args, false)), state.host.getNewLine(), state.baseCompilerOptions);
}
function reportErrors(_a, errors) {
var host = _a.host;
errors.forEach(function (err) { return host.reportDiagnostic(err); });
}
function reportAndStoreErrors(state, proj, errors) {
reportErrors(state, errors);
state.projectErrorsReported.set(proj, true);
if (errors.length) {
state.diagnostics.set(proj, errors);
}
}
function reportParseConfigFileDiagnostic(state, proj) {
reportAndStoreErrors(state, proj, [state.configFileCache.get(proj)]);
}
function reportErrorSummary(state, buildOrder) {
if (!state.needsSummary)
return;
state.needsSummary = false;
var canReportSummary = state.watch || !!state.host.reportErrorSummary;
var diagnostics = state.diagnostics;
var totalErrors = 0;
if (isCircularBuildOrder(buildOrder)) {
reportBuildQueue(state, buildOrder.buildOrder);
reportErrors(state, buildOrder.circularDiagnostics);
if (canReportSummary)
totalErrors += ts.getErrorCountForSummary(buildOrder.circularDiagnostics);
}
else {
// Report errors from the other projects
buildOrder.forEach(function (project) {
var projectPath = toResolvedConfigFilePath(state, project);
if (!state.projectErrorsReported.has(projectPath)) {
reportErrors(state, diagnostics.get(projectPath) || ts.emptyArray);
}
});
if (canReportSummary)
diagnostics.forEach(function (singleProjectErrors) { return totalErrors += ts.getErrorCountForSummary(singleProjectErrors); });
}
if (state.watch) {
reportWatchStatus(state, ts.getWatchErrorSummaryDiagnosticMessage(totalErrors), totalErrors);
}
else if (state.host.reportErrorSummary) {
state.host.reportErrorSummary(totalErrors);
}
}
/**
* Report the build ordering inferred from the current project graph if we're in verbose mode
*/
function reportBuildQueue(state, buildQueue) {
if (state.options.verbose) {
reportStatus(state, ts.Diagnostics.Projects_in_this_build_Colon_0, buildQueue.map(function (s) { return "\r\n * " + relName(state, s); }).join(""));
}
}
function reportUpToDateStatus(state, configFileName, status) {
if (state.options.force && (status.type === ts.UpToDateStatusType.UpToDate || status.type === ts.UpToDateStatusType.UpToDateWithUpstreamTypes)) {
return reportStatus(state, ts.Diagnostics.Project_0_is_being_forcibly_rebuilt, relName(state, configFileName));
}
switch (status.type) {
case ts.UpToDateStatusType.OutOfDateWithSelf:
return reportStatus(state, ts.Diagnostics.Project_0_is_out_of_date_because_oldest_output_1_is_older_than_newest_input_2, relName(state, configFileName), relName(state, status.outOfDateOutputFileName), relName(state, status.newerInputFileName));
case ts.UpToDateStatusType.OutOfDateWithUpstream:
return reportStatus(state, ts.Diagnostics.Project_0_is_out_of_date_because_oldest_output_1_is_older_than_newest_input_2, relName(state, configFileName), relName(state, status.outOfDateOutputFileName), relName(state, status.newerProjectName));
case ts.UpToDateStatusType.OutputMissing:
return reportStatus(state, ts.Diagnostics.Project_0_is_out_of_date_because_output_file_1_does_not_exist, relName(state, configFileName), relName(state, status.missingOutputFileName));
case ts.UpToDateStatusType.UpToDate:
if (status.newestInputFileTime !== undefined) {
return reportStatus(state, ts.Diagnostics.Project_0_is_up_to_date_because_newest_input_1_is_older_than_oldest_output_2, relName(state, configFileName), relName(state, status.newestInputFileName || ""), relName(state, status.oldestOutputFileName || ""));
}
// Don't report anything for "up to date because it was already built" -- too verbose
break;
case ts.UpToDateStatusType.OutOfDateWithPrepend:
return reportStatus(state, ts.Diagnostics.Project_0_is_out_of_date_because_output_of_its_dependency_1_has_changed, relName(state, configFileName), relName(state, status.newerProjectName));
case ts.UpToDateStatusType.UpToDateWithUpstreamTypes:
return reportStatus(state, ts.Diagnostics.Project_0_is_up_to_date_with_d_ts_files_from_its_dependencies, relName(state, configFileName));
case ts.UpToDateStatusType.UpstreamOutOfDate:
return reportStatus(state, ts.Diagnostics.Project_0_is_out_of_date_because_its_dependency_1_is_out_of_date, relName(state, configFileName), relName(state, status.upstreamProjectName));
case ts.UpToDateStatusType.UpstreamBlocked:
return reportStatus(state, status.upstreamProjectBlocked ?
ts.Diagnostics.Project_0_can_t_be_built_because_its_dependency_1_was_not_built :
ts.Diagnostics.Project_0_can_t_be_built_because_its_dependency_1_has_errors, relName(state, configFileName), relName(state, status.upstreamProjectName));
case ts.UpToDateStatusType.Unbuildable:
return reportStatus(state, ts.Diagnostics.Failed_to_parse_file_0_Colon_1, relName(state, configFileName), status.reason);
case ts.UpToDateStatusType.TsVersionOutputOfDate:
return reportStatus(state, ts.Diagnostics.Project_0_is_out_of_date_because_output_for_it_was_generated_with_version_1_that_differs_with_current_version_2, relName(state, configFileName), status.version, ts.version);
case ts.UpToDateStatusType.ContainerOnly:
// Don't report status on "solution" projects
// falls through
case ts.UpToDateStatusType.ComputingUpstream:
// Should never leak from getUptoDateStatusWorker
break;
default:
ts.assertType(status);
}
}
/**
* Report the up-to-date status of a project if we're in verbose mode
*/
function verboseReportProjectStatus(state, configFileName, status) {
if (state.options.verbose) {
reportUpToDateStatus(state, configFileName, status);
}
}
})(ts || (ts = {}));
var ts;
(function (ts) {
var server;
(function (server) {
/* @internal */
server.ActionSet = "action::set";
/* @internal */
server.ActionInvalidate = "action::invalidate";
/* @internal */
server.ActionPackageInstalled = "action::packageInstalled";
/* @internal */
server.EventTypesRegistry = "event::typesRegistry";
/* @internal */
server.EventBeginInstallTypes = "event::beginInstallTypes";
/* @internal */
server.EventEndInstallTypes = "event::endInstallTypes";
/* @internal */
server.EventInitializationFailed = "event::initializationFailed";
/* @internal */
var Arguments;
(function (Arguments) {
Arguments.GlobalCacheLocation = "--globalTypingsCacheLocation";
Arguments.LogFile = "--logFile";
Arguments.EnableTelemetry = "--enableTelemetry";
Arguments.TypingSafeListLocation = "--typingSafeListLocation";
Arguments.TypesMapLocation = "--typesMapLocation";
/**
* This argument specifies the location of the NPM executable.
* typingsInstaller will run the command with `${npmLocation} install ...`.
*/
Arguments.NpmLocation = "--npmLocation";
/**
* Flag indicating that the typings installer should try to validate the default npm location.
* If the default npm is not found when this flag is enabled, fallback to `npm install`
*/
Arguments.ValidateDefaultNpmLocation = "--validateDefaultNpmLocation";
})(Arguments = server.Arguments || (server.Arguments = {}));
/* @internal */
function hasArgument(argumentName) {
return ts.sys.args.indexOf(argumentName) >= 0;
}
server.hasArgument = hasArgument;
/* @internal */
function findArgument(argumentName) {
var index = ts.sys.args.indexOf(argumentName);
return index >= 0 && index < ts.sys.args.length - 1
? ts.sys.args[index + 1]
: undefined;
}
server.findArgument = findArgument;
/* @internal */
function nowString() {
// E.g. "12:34:56.789"
var d = new Date();
return ts.padLeft(d.getHours().toString(), 2, "0") + ":" + ts.padLeft(d.getMinutes().toString(), 2, "0") + ":" + ts.padLeft(d.getSeconds().toString(), 2, "0") + "." + ts.padLeft(d.getMilliseconds().toString(), 3, "0");
}
server.nowString = nowString;
})(server = ts.server || (ts.server = {}));
})(ts || (ts = {}));
/* @internal */
var ts;
(function (ts) {
var JsTyping;
(function (JsTyping) {
function isTypingUpToDate(cachedTyping, availableTypingVersions) {
var availableVersion = new ts.Version(ts.getProperty(availableTypingVersions, "ts" + ts.versionMajorMinor) || ts.getProperty(availableTypingVersions, "latest"));
return availableVersion.compareTo(cachedTyping.version) <= 0;
}
JsTyping.isTypingUpToDate = isTypingUpToDate;
var unprefixedNodeCoreModuleList = [
"assert",
"assert/strict",
"async_hooks",
"buffer",
"child_process",
"cluster",
"console",
"constants",
"crypto",
"dgram",
"diagnostics_channel",
"dns",
"dns/promises",
"domain",
"events",
"fs",
"fs/promises",
"http",
"https",
"http2",
"inspector",
"module",
"net",
"os",
"path",
"perf_hooks",
"process",
"punycode",
"querystring",
"readline",
"repl",
"stream",
"stream/promises",
"string_decoder",
"timers",
"timers/promises",
"tls",
"trace_events",
"tty",
"url",
"util",
"util/types",
"v8",
"vm",
"wasi",
"worker_threads",
"zlib"
];
JsTyping.prefixedNodeCoreModuleList = unprefixedNodeCoreModuleList.map(function (name) { return "node:" + name; });
JsTyping.nodeCoreModuleList = __spreadArray(__spreadArray([], unprefixedNodeCoreModuleList, true), JsTyping.prefixedNodeCoreModuleList, true);
JsTyping.nodeCoreModules = new ts.Set(JsTyping.nodeCoreModuleList);
function nonRelativeModuleNameForTypingCache(moduleName) {
return JsTyping.nodeCoreModules.has(moduleName) ? "node" : moduleName;
}
JsTyping.nonRelativeModuleNameForTypingCache = nonRelativeModuleNameForTypingCache;
function loadSafeList(host, safeListPath) {
var result = ts.readConfigFile(safeListPath, function (path) { return host.readFile(path); });
return new ts.Map(ts.getEntries(result.config));
}
JsTyping.loadSafeList = loadSafeList;
function loadTypesMap(host, typesMapPath) {
var result = ts.readConfigFile(typesMapPath, function (path) { return host.readFile(path); });
if (result.config) {
return new ts.Map(ts.getEntries(result.config.simpleMap));
}
return undefined;
}
JsTyping.loadTypesMap = loadTypesMap;
/**
* @param host is the object providing I/O related operations.
* @param fileNames are the file names that belong to the same project
* @param projectRootPath is the path to the project root directory
* @param safeListPath is the path used to retrieve the safe list
* @param packageNameToTypingLocation is the map of package names to their cached typing locations and installed versions
* @param typeAcquisition is used to customize the typing acquisition process
* @param compilerOptions are used as a source for typing inference
*/
function discoverTypings(host, log, fileNames, projectRootPath, safeList, packageNameToTypingLocation, typeAcquisition, unresolvedImports, typesRegistry) {
if (!typeAcquisition || !typeAcquisition.enable) {
return { cachedTypingPaths: [], newTypingNames: [], filesToWatch: [] };
}
// A typing name to typing file path mapping
var inferredTypings = new ts.Map();
// Only infer typings for .js and .jsx files
fileNames = ts.mapDefined(fileNames, function (fileName) {
var path = ts.normalizePath(fileName);
if (ts.hasJSFileExtension(path)) {
return path;
}
});
var filesToWatch = [];
if (typeAcquisition.include)
addInferredTypings(typeAcquisition.include, "Explicitly included types");
var exclude = typeAcquisition.exclude || [];
// Directories to search for package.json, bower.json and other typing information
var possibleSearchDirs = new ts.Set(fileNames.map(ts.getDirectoryPath));
possibleSearchDirs.add(projectRootPath);
possibleSearchDirs.forEach(function (searchDir) {
var packageJsonPath = ts.combinePaths(searchDir, "package.json");
getTypingNamesFromJson(packageJsonPath, filesToWatch);
var bowerJsonPath = ts.combinePaths(searchDir, "bower.json");
getTypingNamesFromJson(bowerJsonPath, filesToWatch);
var bowerComponentsPath = ts.combinePaths(searchDir, "bower_components");
getTypingNamesFromPackagesFolder(bowerComponentsPath, filesToWatch);
var nodeModulesPath = ts.combinePaths(searchDir, "node_modules");
getTypingNamesFromPackagesFolder(nodeModulesPath, filesToWatch);
});
if (!typeAcquisition.disableFilenameBasedTypeAcquisition) {
getTypingNamesFromSourceFileNames(fileNames);
}
// add typings for unresolved imports
if (unresolvedImports) {
var module_1 = ts.deduplicate(unresolvedImports.map(nonRelativeModuleNameForTypingCache), ts.equateStringsCaseSensitive, ts.compareStringsCaseSensitive);
addInferredTypings(module_1, "Inferred typings from unresolved imports");
}
// Add the cached typing locations for inferred typings that are already installed
packageNameToTypingLocation.forEach(function (typing, name) {
var registryEntry = typesRegistry.get(name);
if (inferredTypings.has(name) && inferredTypings.get(name) === undefined && registryEntry !== undefined && isTypingUpToDate(typing, registryEntry)) {
inferredTypings.set(name, typing.typingLocation);
}
});
// Remove typings that the user has added to the exclude list
for (var _i = 0, exclude_1 = exclude; _i < exclude_1.length; _i++) {
var excludeTypingName = exclude_1[_i];
var didDelete = inferredTypings.delete(excludeTypingName);
if (didDelete && log)
log("Typing for " + excludeTypingName + " is in exclude list, will be ignored.");
}
var newTypingNames = [];
var cachedTypingPaths = [];
inferredTypings.forEach(function (inferred, typing) {
if (inferred !== undefined) {
cachedTypingPaths.push(inferred);
}
else {
newTypingNames.push(typing);
}
});
var result = { cachedTypingPaths: cachedTypingPaths, newTypingNames: newTypingNames, filesToWatch: filesToWatch };
if (log)
log("Result: " + JSON.stringify(result));
return result;
function addInferredTyping(typingName) {
if (!inferredTypings.has(typingName)) {
inferredTypings.set(typingName, undefined); // TODO: GH#18217
}
}
function addInferredTypings(typingNames, message) {
if (log)
log(message + ": " + JSON.stringify(typingNames));
ts.forEach(typingNames, addInferredTyping);
}
/**
* Get the typing info from common package manager json files like package.json or bower.json
*/
function getTypingNamesFromJson(jsonPath, filesToWatch) {
if (!host.fileExists(jsonPath)) {
return;
}
filesToWatch.push(jsonPath);
var jsonConfig = ts.readConfigFile(jsonPath, function (path) { return host.readFile(path); }).config;
var jsonTypingNames = ts.flatMap([jsonConfig.dependencies, jsonConfig.devDependencies, jsonConfig.optionalDependencies, jsonConfig.peerDependencies], ts.getOwnKeys);
addInferredTypings(jsonTypingNames, "Typing names in '" + jsonPath + "' dependencies");
}
/**
* Infer typing names from given file names. For example, the file name "jquery-min.2.3.4.js"
* should be inferred to the 'jquery' typing name; and "angular-route.1.2.3.js" should be inferred
* to the 'angular-route' typing name.
* @param fileNames are the names for source files in the project
*/
function getTypingNamesFromSourceFileNames(fileNames) {
var fromFileNames = ts.mapDefined(fileNames, function (j) {
if (!ts.hasJSFileExtension(j))
return undefined;
var inferredTypingName = ts.removeFileExtension(ts.getBaseFileName(j.toLowerCase()));
var cleanedTypingName = ts.removeMinAndVersionNumbers(inferredTypingName);
return safeList.get(cleanedTypingName);
});
if (fromFileNames.length) {
addInferredTypings(fromFileNames, "Inferred typings from file names");
}
var hasJsxFile = ts.some(fileNames, function (f) { return ts.fileExtensionIs(f, ".jsx" /* Jsx */); });
if (hasJsxFile) {
if (log)
log("Inferred 'react' typings due to presence of '.jsx' extension");
addInferredTyping("react");
}
}
/**
* Infer typing names from packages folder (ex: node_module, bower_components)
* @param packagesFolderPath is the path to the packages folder
*/
function getTypingNamesFromPackagesFolder(packagesFolderPath, filesToWatch) {
filesToWatch.push(packagesFolderPath);
// Todo: add support for ModuleResolutionHost too
if (!host.directoryExists(packagesFolderPath)) {
return;
}
// depth of 2, so we access `node_modules/foo` but not `node_modules/foo/bar`
var fileNames = host.readDirectory(packagesFolderPath, [".json" /* Json */], /*excludes*/ undefined, /*includes*/ undefined, /*depth*/ 2);
if (log)
log("Searching for typing names in " + packagesFolderPath + "; all files: " + JSON.stringify(fileNames));
var packageNames = [];
for (var _i = 0, fileNames_1 = fileNames; _i < fileNames_1.length; _i++) {
var fileName = fileNames_1[_i];
var normalizedFileName = ts.normalizePath(fileName);
var baseFileName = ts.getBaseFileName(normalizedFileName);
if (baseFileName !== "package.json" && baseFileName !== "bower.json") {
continue;
}
var result_1 = ts.readConfigFile(normalizedFileName, function (path) { return host.readFile(path); });
var packageJson = result_1.config;
// npm 3's package.json contains a "_requiredBy" field
// we should include all the top level module names for npm 2, and only module names whose
// "_requiredBy" field starts with "#" or equals "/" for npm 3.
if (baseFileName === "package.json" && packageJson._requiredBy &&
ts.filter(packageJson._requiredBy, function (r) { return r[0] === "#" || r === "/"; }).length === 0) {
continue;
}
// If the package has its own d.ts typings, those will take precedence. Otherwise the package name will be used
// to download d.ts files from DefinitelyTyped
if (!packageJson.name) {
continue;
}
var ownTypes = packageJson.types || packageJson.typings;
if (ownTypes) {
var absolutePath = ts.getNormalizedAbsolutePath(ownTypes, ts.getDirectoryPath(normalizedFileName));
if (log)
log(" Package '" + packageJson.name + "' provides its own types.");
inferredTypings.set(packageJson.name, absolutePath);
}
else {
packageNames.push(packageJson.name);
}
}
addInferredTypings(packageNames, " Found package names");
}
}
JsTyping.discoverTypings = discoverTypings;
var NameValidationResult;
(function (NameValidationResult) {
NameValidationResult[NameValidationResult["Ok"] = 0] = "Ok";
NameValidationResult[NameValidationResult["EmptyName"] = 1] = "EmptyName";
NameValidationResult[NameValidationResult["NameTooLong"] = 2] = "NameTooLong";
NameValidationResult[NameValidationResult["NameStartsWithDot"] = 3] = "NameStartsWithDot";
NameValidationResult[NameValidationResult["NameStartsWithUnderscore"] = 4] = "NameStartsWithUnderscore";
NameValidationResult[NameValidationResult["NameContainsNonURISafeCharacters"] = 5] = "NameContainsNonURISafeCharacters";
})(NameValidationResult = JsTyping.NameValidationResult || (JsTyping.NameValidationResult = {}));
var maxPackageNameLength = 214;
/**
* Validates package name using rules defined at https://docs.npmjs.com/files/package.json
*/
function validatePackageName(packageName) {
return validatePackageNameWorker(packageName, /*supportScopedPackage*/ true);
}
JsTyping.validatePackageName = validatePackageName;
function validatePackageNameWorker(packageName, supportScopedPackage) {
if (!packageName) {
return 1 /* EmptyName */;
}
if (packageName.length > maxPackageNameLength) {
return 2 /* NameTooLong */;
}
if (packageName.charCodeAt(0) === 46 /* dot */) {
return 3 /* NameStartsWithDot */;
}
if (packageName.charCodeAt(0) === 95 /* _ */) {
return 4 /* NameStartsWithUnderscore */;
}
// check if name is scope package like: starts with @ and has one '/' in the middle
// scoped packages are not currently supported
if (supportScopedPackage) {
var matches = /^@([^/]+)\/([^/]+)$/.exec(packageName);
if (matches) {
var scopeResult = validatePackageNameWorker(matches[1], /*supportScopedPackage*/ false);
if (scopeResult !== 0 /* Ok */) {
return { name: matches[1], isScopeName: true, result: scopeResult };
}
var packageResult = validatePackageNameWorker(matches[2], /*supportScopedPackage*/ false);
if (packageResult !== 0 /* Ok */) {
return { name: matches[2], isScopeName: false, result: packageResult };
}
return 0 /* Ok */;
}
}
if (encodeURIComponent(packageName) !== packageName) {
return 5 /* NameContainsNonURISafeCharacters */;
}
return 0 /* Ok */;
}
function renderPackageNameValidationFailure(result, typing) {
return typeof result === "object" ?
renderPackageNameValidationFailureWorker(typing, result.result, result.name, result.isScopeName) :
renderPackageNameValidationFailureWorker(typing, result, typing, /*isScopeName*/ false);
}
JsTyping.renderPackageNameValidationFailure = renderPackageNameValidationFailure;
function renderPackageNameValidationFailureWorker(typing, result, name, isScopeName) {
var kind = isScopeName ? "Scope" : "Package";
switch (result) {
case 1 /* EmptyName */:
return "'" + typing + "':: " + kind + " name '" + name + "' cannot be empty";
case 2 /* NameTooLong */:
return "'" + typing + "':: " + kind + " name '" + name + "' should be less than " + maxPackageNameLength + " characters";
case 3 /* NameStartsWithDot */:
return "'" + typing + "':: " + kind + " name '" + name + "' cannot start with '.'";
case 4 /* NameStartsWithUnderscore */:
return "'" + typing + "':: " + kind + " name '" + name + "' cannot start with '_'";
case 5 /* NameContainsNonURISafeCharacters */:
return "'" + typing + "':: " + kind + " name '" + name + "' contains non URI safe characters";
case 0 /* Ok */:
return ts.Debug.fail(); // Shouldn't have called this.
default:
throw ts.Debug.assertNever(result);
}
}
})(JsTyping = ts.JsTyping || (ts.JsTyping = {}));
})(ts || (ts = {}));
var ts;
(function (ts) {
var server;
(function (server) {
var typingsInstaller;
(function (typingsInstaller) {
var nullLog = {
isEnabled: function () { return false; },
writeLine: ts.noop
};
function typingToFileName(cachePath, packageName, installTypingHost, log) {
try {
var result = ts.resolveModuleName(packageName, ts.combinePaths(cachePath, "index.d.ts"), { moduleResolution: ts.ModuleResolutionKind.NodeJs }, installTypingHost);
return result.resolvedModule && result.resolvedModule.resolvedFileName;
}
catch (e) {
if (log.isEnabled()) {
log.writeLine("Failed to resolve " + packageName + " in folder '" + cachePath + "': " + e.message);
}
return undefined;
}
}
/*@internal*/
function installNpmPackages(npmPath, tsVersion, packageNames, install) {
var hasError = false;
for (var remaining = packageNames.length; remaining > 0;) {
var result = getNpmCommandForInstallation(npmPath, tsVersion, packageNames, remaining);
remaining = result.remaining;
hasError = install(result.command) || hasError;
}
return hasError;
}
typingsInstaller.installNpmPackages = installNpmPackages;
/*@internal*/
function getNpmCommandForInstallation(npmPath, tsVersion, packageNames, remaining) {
var sliceStart = packageNames.length - remaining;
var command, toSlice = remaining;
while (true) {
command = npmPath + " install --ignore-scripts " + (toSlice === packageNames.length ? packageNames : packageNames.slice(sliceStart, sliceStart + toSlice)).join(" ") + " --save-dev --user-agent=\"typesInstaller/" + tsVersion + "\"";
if (command.length < 8000) {
break;
}
toSlice = toSlice - Math.floor(toSlice / 2);
}
return { command: command, remaining: remaining - toSlice };
}
typingsInstaller.getNpmCommandForInstallation = getNpmCommandForInstallation;
function endsWith(str, suffix, caseSensitive) {
var expectedPos = str.length - suffix.length;
return expectedPos >= 0 &&
(str.indexOf(suffix, expectedPos) === expectedPos ||
(!caseSensitive && ts.compareStringsCaseInsensitive(str.substr(expectedPos), suffix) === 0 /* EqualTo */));
}
function isPackageOrBowerJson(fileName, caseSensitive) {
return endsWith(fileName, "/package.json", caseSensitive) || endsWith(fileName, "/bower.json", caseSensitive);
}
function sameFiles(a, b, caseSensitive) {
return a === b || (!caseSensitive && ts.compareStringsCaseInsensitive(a, b) === 0 /* EqualTo */);
}
var ProjectWatcherType;
(function (ProjectWatcherType) {
ProjectWatcherType["FileWatcher"] = "FileWatcher";
ProjectWatcherType["DirectoryWatcher"] = "DirectoryWatcher";
})(ProjectWatcherType || (ProjectWatcherType = {}));
function getDetailWatchInfo(projectName, watchers) {
return "Project: " + projectName + " watcher already invoked: " + watchers.isInvoked;
}
var TypingsInstaller = /** @class */ (function () {
function TypingsInstaller(installTypingHost, globalCachePath, safeListPath, typesMapLocation, throttleLimit, log) {
var _this = this;
if (log === void 0) { log = nullLog; }
this.installTypingHost = installTypingHost;
this.globalCachePath = globalCachePath;
this.safeListPath = safeListPath;
this.typesMapLocation = typesMapLocation;
this.throttleLimit = throttleLimit;
this.log = log;
this.packageNameToTypingLocation = new ts.Map();
this.missingTypingsSet = new ts.Set();
this.knownCachesSet = new ts.Set();
this.projectWatchers = new ts.Map();
this.pendingRunRequests = [];
this.installRunCount = 1;
this.inFlightRequestCount = 0;
this.latestDistTag = "latest";
this.toCanonicalFileName = ts.createGetCanonicalFileName(installTypingHost.useCaseSensitiveFileNames);
this.globalCachePackageJsonPath = ts.combinePaths(globalCachePath, "package.json");
var isLoggingEnabled = this.log.isEnabled();
if (isLoggingEnabled) {
this.log.writeLine("Global cache location '" + globalCachePath + "', safe file path '" + safeListPath + "', types map path " + typesMapLocation);
}
this.watchFactory = ts.getWatchFactory(this.installTypingHost, isLoggingEnabled ? ts.WatchLogLevel.Verbose : ts.WatchLogLevel.None, function (s) { return _this.log.writeLine(s); }, getDetailWatchInfo);
this.processCacheLocation(this.globalCachePath);
}
TypingsInstaller.prototype.closeProject = function (req) {
this.closeWatchers(req.projectName);
};
TypingsInstaller.prototype.closeWatchers = function (projectName) {
if (this.log.isEnabled()) {
this.log.writeLine("Closing file watchers for project '" + projectName + "'");
}
var watchers = this.projectWatchers.get(projectName);
if (!watchers) {
if (this.log.isEnabled()) {
this.log.writeLine("No watchers are registered for project '" + projectName + "'");
}
return;
}
ts.clearMap(watchers, ts.closeFileWatcher);
this.projectWatchers.delete(projectName);
if (this.log.isEnabled()) {
this.log.writeLine("Closing file watchers for project '" + projectName + "' - done.");
}
};
TypingsInstaller.prototype.install = function (req) {
var _this = this;
if (this.log.isEnabled()) {
this.log.writeLine("Got install request " + JSON.stringify(req));
}
// load existing typing information from the cache
if (req.cachePath) {
if (this.log.isEnabled()) {
this.log.writeLine("Request specifies cache path '" + req.cachePath + "', loading cached information...");
}
this.processCacheLocation(req.cachePath);
}
if (this.safeList === undefined) {
this.initializeSafeList();
}
var discoverTypingsResult = ts.JsTyping.discoverTypings(this.installTypingHost, this.log.isEnabled() ? (function (s) { return _this.log.writeLine(s); }) : undefined, req.fileNames, req.projectRootPath, this.safeList, this.packageNameToTypingLocation, req.typeAcquisition, req.unresolvedImports, this.typesRegistry);
if (this.log.isEnabled()) {
this.log.writeLine("Finished typings discovery: " + JSON.stringify(discoverTypingsResult));
}
// start watching files
this.watchFiles(req.projectName, discoverTypingsResult.filesToWatch, req.projectRootPath, req.watchOptions);
// install typings
if (discoverTypingsResult.newTypingNames.length) {
this.installTypings(req, req.cachePath || this.globalCachePath, discoverTypingsResult.cachedTypingPaths, discoverTypingsResult.newTypingNames);
}
else {
this.sendResponse(this.createSetTypings(req, discoverTypingsResult.cachedTypingPaths));
if (this.log.isEnabled()) {
this.log.writeLine("No new typings were requested as a result of typings discovery");
}
}
};
TypingsInstaller.prototype.initializeSafeList = function () {
// Prefer the safe list from the types map if it exists
if (this.typesMapLocation) {
var safeListFromMap = ts.JsTyping.loadTypesMap(this.installTypingHost, this.typesMapLocation);
if (safeListFromMap) {
this.log.writeLine("Loaded safelist from types map file '" + this.typesMapLocation + "'");
this.safeList = safeListFromMap;
return;
}
this.log.writeLine("Failed to load safelist from types map file '" + this.typesMapLocation + "'");
}
this.safeList = ts.JsTyping.loadSafeList(this.installTypingHost, this.safeListPath);
};
TypingsInstaller.prototype.processCacheLocation = function (cacheLocation) {
if (this.log.isEnabled()) {
this.log.writeLine("Processing cache location '" + cacheLocation + "'");
}
if (this.knownCachesSet.has(cacheLocation)) {
if (this.log.isEnabled()) {
this.log.writeLine("Cache location was already processed...");
}
return;
}
var packageJson = ts.combinePaths(cacheLocation, "package.json");
var packageLockJson = ts.combinePaths(cacheLocation, "package-lock.json");
if (this.log.isEnabled()) {
this.log.writeLine("Trying to find '" + packageJson + "'...");
}
if (this.installTypingHost.fileExists(packageJson) && this.installTypingHost.fileExists(packageLockJson)) {
var npmConfig = JSON.parse(this.installTypingHost.readFile(packageJson)); // TODO: GH#18217
var npmLock = JSON.parse(this.installTypingHost.readFile(packageLockJson)); // TODO: GH#18217
if (this.log.isEnabled()) {
this.log.writeLine("Loaded content of '" + packageJson + "': " + JSON.stringify(npmConfig));
this.log.writeLine("Loaded content of '" + packageLockJson + "'");
}
if (npmConfig.devDependencies && npmLock.dependencies) {
for (var key in npmConfig.devDependencies) {
if (!ts.hasProperty(npmLock.dependencies, key)) {
// if package in package.json but not package-lock.json, skip adding to cache so it is reinstalled on next use
continue;
}
// key is @types/<package name>
var packageName = ts.getBaseFileName(key);
if (!packageName) {
continue;
}
var typingFile = typingToFileName(cacheLocation, packageName, this.installTypingHost, this.log);
if (!typingFile) {
this.missingTypingsSet.add(packageName);
continue;
}
var existingTypingFile = this.packageNameToTypingLocation.get(packageName);
if (existingTypingFile) {
if (existingTypingFile.typingLocation === typingFile) {
continue;
}
if (this.log.isEnabled()) {
this.log.writeLine("New typing for package " + packageName + " from '" + typingFile + "' conflicts with existing typing file '" + existingTypingFile + "'");
}
}
if (this.log.isEnabled()) {
this.log.writeLine("Adding entry into typings cache: '" + packageName + "' => '" + typingFile + "'");
}
var info = ts.getProperty(npmLock.dependencies, key);
var version_1 = info && info.version;
if (!version_1) {
continue;
}
var newTyping = { typingLocation: typingFile, version: new ts.Version(version_1) };
this.packageNameToTypingLocation.set(packageName, newTyping);
}
}
}
if (this.log.isEnabled()) {
this.log.writeLine("Finished processing cache location '" + cacheLocation + "'");
}
this.knownCachesSet.add(cacheLocation);
};
TypingsInstaller.prototype.filterTypings = function (typingsToInstall) {
var _this = this;
return ts.mapDefined(typingsToInstall, function (typing) {
var typingKey = ts.mangleScopedPackageName(typing);
if (_this.missingTypingsSet.has(typingKey)) {
if (_this.log.isEnabled())
_this.log.writeLine("'" + typing + "':: '" + typingKey + "' is in missingTypingsSet - skipping...");
return undefined;
}
var validationResult = ts.JsTyping.validatePackageName(typing);
if (validationResult !== 0 /* Ok */) {
// add typing name to missing set so we won't process it again
_this.missingTypingsSet.add(typingKey);
if (_this.log.isEnabled())
_this.log.writeLine(ts.JsTyping.renderPackageNameValidationFailure(validationResult, typing));
return undefined;
}
if (!_this.typesRegistry.has(typingKey)) {
if (_this.log.isEnabled())
_this.log.writeLine("'" + typing + "':: Entry for package '" + typingKey + "' does not exist in local types registry - skipping...");
return undefined;
}
if (_this.packageNameToTypingLocation.get(typingKey) && ts.JsTyping.isTypingUpToDate(_this.packageNameToTypingLocation.get(typingKey), _this.typesRegistry.get(typingKey))) {
if (_this.log.isEnabled())
_this.log.writeLine("'" + typing + "':: '" + typingKey + "' already has an up-to-date typing - skipping...");
return undefined;
}
return typingKey;
});
};
TypingsInstaller.prototype.ensurePackageDirectoryExists = function (directory) {
var npmConfigPath = ts.combinePaths(directory, "package.json");
if (this.log.isEnabled()) {
this.log.writeLine("Npm config file: " + npmConfigPath);
}
if (!this.installTypingHost.fileExists(npmConfigPath)) {
if (this.log.isEnabled()) {
this.log.writeLine("Npm config file: '" + npmConfigPath + "' is missing, creating new one...");
}
this.ensureDirectoryExists(directory, this.installTypingHost);
this.installTypingHost.writeFile(npmConfigPath, '{ "private": true }');
}
};
TypingsInstaller.prototype.installTypings = function (req, cachePath, currentlyCachedTypings, typingsToInstall) {
var _this = this;
if (this.log.isEnabled()) {
this.log.writeLine("Installing typings " + JSON.stringify(typingsToInstall));
}
var filteredTypings = this.filterTypings(typingsToInstall);
if (filteredTypings.length === 0) {
if (this.log.isEnabled()) {
this.log.writeLine("All typings are known to be missing or invalid - no need to install more typings");
}
this.sendResponse(this.createSetTypings(req, currentlyCachedTypings));
return;
}
this.ensurePackageDirectoryExists(cachePath);
var requestId = this.installRunCount;
this.installRunCount++;
// send progress event
this.sendResponse({
kind: server.EventBeginInstallTypes,
eventId: requestId,
// qualified explicitly to prevent occasional shadowing
// eslint-disable-next-line @typescript-eslint/no-unnecessary-qualifier
typingsInstallerVersion: ts.version,
projectName: req.projectName
});
var scopedTypings = filteredTypings.map(typingsName);
this.installTypingsAsync(requestId, scopedTypings, cachePath, function (ok) {
try {
if (!ok) {
if (_this.log.isEnabled()) {
_this.log.writeLine("install request failed, marking packages as missing to prevent repeated requests: " + JSON.stringify(filteredTypings));
}
for (var _i = 0, filteredTypings_1 = filteredTypings; _i < filteredTypings_1.length; _i++) {
var typing = filteredTypings_1[_i];
_this.missingTypingsSet.add(typing);
}
return;
}
// TODO: watch project directory
if (_this.log.isEnabled()) {
_this.log.writeLine("Installed typings " + JSON.stringify(scopedTypings));
}
var installedTypingFiles = [];
for (var _a = 0, filteredTypings_2 = filteredTypings; _a < filteredTypings_2.length; _a++) {
var packageName = filteredTypings_2[_a];
var typingFile = typingToFileName(cachePath, packageName, _this.installTypingHost, _this.log);
if (!typingFile) {
_this.missingTypingsSet.add(packageName);
continue;
}
// packageName is guaranteed to exist in typesRegistry by filterTypings
var distTags = _this.typesRegistry.get(packageName);
var newVersion = new ts.Version(distTags["ts" + ts.versionMajorMinor] || distTags[_this.latestDistTag]);
var newTyping = { typingLocation: typingFile, version: newVersion };
_this.packageNameToTypingLocation.set(packageName, newTyping);
installedTypingFiles.push(typingFile);
}
if (_this.log.isEnabled()) {
_this.log.writeLine("Installed typing files " + JSON.stringify(installedTypingFiles));
}
_this.sendResponse(_this.createSetTypings(req, currentlyCachedTypings.concat(installedTypingFiles)));
}
finally {
var response = {
kind: server.EventEndInstallTypes,
eventId: requestId,
projectName: req.projectName,
packagesToInstall: scopedTypings,
installSuccess: ok,
// qualified explicitly to prevent occasional shadowing
// eslint-disable-next-line @typescript-eslint/no-unnecessary-qualifier
typingsInstallerVersion: ts.version
};
_this.sendResponse(response);
}
});
};
TypingsInstaller.prototype.ensureDirectoryExists = function (directory, host) {
var directoryName = ts.getDirectoryPath(directory);
if (!host.directoryExists(directoryName)) {
this.ensureDirectoryExists(directoryName, host);
}
if (!host.directoryExists(directory)) {
host.createDirectory(directory);
}
};
TypingsInstaller.prototype.watchFiles = function (projectName, files, projectRootPath, options) {
var _this = this;
if (!files.length) {
// shut down existing watchers
this.closeWatchers(projectName);
return;
}
var watchers = this.projectWatchers.get(projectName);
var toRemove = new ts.Map();
if (!watchers) {
watchers = new ts.Map();
this.projectWatchers.set(projectName, watchers);
}
else {
ts.copyEntries(watchers, toRemove);
}
// handler should be invoked once for the entire set of files since it will trigger full rediscovery of typings
watchers.isInvoked = false;
var isLoggingEnabled = this.log.isEnabled();
var createProjectWatcher = function (path, projectWatcherType) {
var canonicalPath = _this.toCanonicalFileName(path);
toRemove.delete(canonicalPath);
if (watchers.has(canonicalPath)) {
return;
}
if (isLoggingEnabled) {
_this.log.writeLine(projectWatcherType + ":: Added:: WatchInfo: " + path);
}
var watcher = projectWatcherType === "FileWatcher" /* FileWatcher */ ?
_this.watchFactory.watchFile(path, function () {
if (!watchers.isInvoked) {
watchers.isInvoked = true;
_this.sendResponse({ projectName: projectName, kind: server.ActionInvalidate });
}
}, ts.PollingInterval.High, options, projectName, watchers) :
_this.watchFactory.watchDirectory(path, function (f) {
if (watchers.isInvoked || !ts.fileExtensionIs(f, ".json" /* Json */)) {
return;
}
if (isPackageOrBowerJson(f, _this.installTypingHost.useCaseSensitiveFileNames) &&
!sameFiles(f, _this.globalCachePackageJsonPath, _this.installTypingHost.useCaseSensitiveFileNames)) {
watchers.isInvoked = true;
_this.sendResponse({ projectName: projectName, kind: server.ActionInvalidate });
}
}, 1 /* Recursive */, options, projectName, watchers);
watchers.set(canonicalPath, isLoggingEnabled ? {
close: function () {
_this.log.writeLine(projectWatcherType + ":: Closed:: WatchInfo: " + path);
watcher.close();
}
} : watcher);
};
// Create watches from list of files
for (var _i = 0, files_1 = files; _i < files_1.length; _i++) {
var file = files_1[_i];
if (file.endsWith("/package.json") || file.endsWith("/bower.json")) {
// package.json or bower.json exists, watch the file to detect changes and update typings
createProjectWatcher(file, "FileWatcher" /* FileWatcher */);
continue;
}
// path in projectRoot, watch project root
if (ts.containsPath(projectRootPath, file, projectRootPath, !this.installTypingHost.useCaseSensitiveFileNames)) {
var subDirectory = file.indexOf(ts.directorySeparator, projectRootPath.length + 1);
if (subDirectory !== -1) {
// Watch subDirectory
createProjectWatcher(file.substr(0, subDirectory), "DirectoryWatcher" /* DirectoryWatcher */);
}
else {
// Watch the directory itself
createProjectWatcher(file, "DirectoryWatcher" /* DirectoryWatcher */);
}
continue;
}
// path in global cache, watch global cache
if (ts.containsPath(this.globalCachePath, file, projectRootPath, !this.installTypingHost.useCaseSensitiveFileNames)) {
createProjectWatcher(this.globalCachePath, "DirectoryWatcher" /* DirectoryWatcher */);
continue;
}
// watch node_modules or bower_components
createProjectWatcher(file, "DirectoryWatcher" /* DirectoryWatcher */);
}
// Remove unused watches
toRemove.forEach(function (watch, path) {
watch.close();
watchers.delete(path);
});
};
TypingsInstaller.prototype.createSetTypings = function (request, typings) {
return {
projectName: request.projectName,
typeAcquisition: request.typeAcquisition,
compilerOptions: request.compilerOptions,
typings: typings,
unresolvedImports: request.unresolvedImports,
kind: server.ActionSet
};
};
TypingsInstaller.prototype.installTypingsAsync = function (requestId, packageNames, cwd, onRequestCompleted) {
this.pendingRunRequests.unshift({ requestId: requestId, packageNames: packageNames, cwd: cwd, onRequestCompleted: onRequestCompleted });
this.executeWithThrottling();
};
TypingsInstaller.prototype.executeWithThrottling = function () {
var _this = this;
var _loop_1 = function () {
this_1.inFlightRequestCount++;
var request = this_1.pendingRunRequests.pop();
this_1.installWorker(request.requestId, request.packageNames, request.cwd, function (ok) {
_this.inFlightRequestCount--;
request.onRequestCompleted(ok);
_this.executeWithThrottling();
});
};
var this_1 = this;
while (this.inFlightRequestCount < this.throttleLimit && this.pendingRunRequests.length) {
_loop_1();
}
};
return TypingsInstaller;
}());
typingsInstaller.TypingsInstaller = TypingsInstaller;
/* @internal */
function typingsName(packageName) {
return "@types/" + packageName + "@ts" + ts.versionMajorMinor;
}
typingsInstaller.typingsName = typingsName;
})(typingsInstaller = server.typingsInstaller || (server.typingsInstaller = {}));
})(server = ts.server || (ts.server = {}));
})(ts || (ts = {}));
var ts;
(function (ts) {
var server;
(function (server) {
var typingsInstaller;
(function (typingsInstaller) {
var fs = require("fs");
var path = require("path");
var FileLog = (function () {
function FileLog(logFile) {
var _this = this;
this.logFile = logFile;
this.isEnabled = function () {
return typeof _this.logFile === "string";
};
this.writeLine = function (text) {
if (typeof _this.logFile !== "string")
return;
try {
fs.appendFileSync(_this.logFile, "[" + server.nowString() + "] " + text + ts.sys.newLine);
}
catch (e) {
_this.logFile = undefined;
}
};
}
return FileLog;
}());
function getDefaultNPMLocation(processName, validateDefaultNpmLocation, host) {
if (path.basename(processName).indexOf("node") === 0) {
var npmPath = path.join(path.dirname(process.argv[0]), "npm");
if (!validateDefaultNpmLocation) {
return npmPath;
}
if (host.fileExists(npmPath)) {
return "\"" + npmPath + "\"";
}
}
return "npm";
}
function loadTypesRegistryFile(typesRegistryFilePath, host, log) {
if (!host.fileExists(typesRegistryFilePath)) {
if (log.isEnabled()) {
log.writeLine("Types registry file '" + typesRegistryFilePath + "' does not exist");
}
return new ts.Map();
}
try {
var content = JSON.parse(host.readFile(typesRegistryFilePath));
return new ts.Map(ts.getEntries(content.entries));
}
catch (e) {
if (log.isEnabled()) {
log.writeLine("Error when loading types registry file '" + typesRegistryFilePath + "': " + e.message + ", " + e.stack);
}
return new ts.Map();
}
}
var typesRegistryPackageName = "types-registry";
function getTypesRegistryFileLocation(globalTypingsCacheLocation) {
return ts.combinePaths(ts.normalizeSlashes(globalTypingsCacheLocation), "node_modules/" + typesRegistryPackageName + "/index.json");
}
var NodeTypingsInstaller = (function (_super) {
__extends(NodeTypingsInstaller, _super);
function NodeTypingsInstaller(globalTypingsCacheLocation, typingSafeListLocation, typesMapLocation, npmLocation, validateDefaultNpmLocation, throttleLimit, log) {
var _this = _super.call(this, ts.sys, globalTypingsCacheLocation, typingSafeListLocation ? ts.toPath(typingSafeListLocation, "", ts.createGetCanonicalFileName(ts.sys.useCaseSensitiveFileNames)) : ts.toPath("typingSafeList.json", __dirname, ts.createGetCanonicalFileName(ts.sys.useCaseSensitiveFileNames)), typesMapLocation ? ts.toPath(typesMapLocation, "", ts.createGetCanonicalFileName(ts.sys.useCaseSensitiveFileNames)) : ts.toPath("typesMap.json", __dirname, ts.createGetCanonicalFileName(ts.sys.useCaseSensitiveFileNames)), throttleLimit, log) || this;
_this.npmPath = npmLocation !== undefined ? npmLocation : getDefaultNPMLocation(process.argv[0], validateDefaultNpmLocation, _this.installTypingHost);
if (ts.stringContains(_this.npmPath, " ") && _this.npmPath[0] !== "\"") {
_this.npmPath = "\"" + _this.npmPath + "\"";
}
if (_this.log.isEnabled()) {
_this.log.writeLine("Process id: " + process.pid);
_this.log.writeLine("NPM location: " + _this.npmPath + " (explicit '" + server.Arguments.NpmLocation + "' " + (npmLocation === undefined ? "not " : "") + " provided)");
_this.log.writeLine("validateDefaultNpmLocation: " + validateDefaultNpmLocation);
}
(_this.nodeExecSync = require("child_process").execSync);
_this.ensurePackageDirectoryExists(globalTypingsCacheLocation);
try {
if (_this.log.isEnabled()) {
_this.log.writeLine("Updating " + typesRegistryPackageName + " npm package...");
}
_this.execSyncAndLog(_this.npmPath + " install --ignore-scripts " + typesRegistryPackageName + "@" + _this.latestDistTag, { cwd: globalTypingsCacheLocation });
if (_this.log.isEnabled()) {
_this.log.writeLine("Updated " + typesRegistryPackageName + " npm package");
}
}
catch (e) {
if (_this.log.isEnabled()) {
_this.log.writeLine("Error updating " + typesRegistryPackageName + " package: " + e.message);
}
_this.delayedInitializationError = {
kind: "event::initializationFailed",
message: e.message,
stack: e.stack,
};
}
_this.typesRegistry = loadTypesRegistryFile(getTypesRegistryFileLocation(globalTypingsCacheLocation), _this.installTypingHost, _this.log);
return _this;
}
NodeTypingsInstaller.prototype.listen = function () {
var _this = this;
process.on("message", function (req) {
if (_this.delayedInitializationError) {
_this.sendResponse(_this.delayedInitializationError);
_this.delayedInitializationError = undefined;
}
switch (req.kind) {
case "discover":
_this.install(req);
break;
case "closeProject":
_this.closeProject(req);
break;
case "typesRegistry": {
var typesRegistry_1 = {};
_this.typesRegistry.forEach(function (value, key) {
typesRegistry_1[key] = value;
});
var response = { kind: server.EventTypesRegistry, typesRegistry: typesRegistry_1 };
_this.sendResponse(response);
break;
}
case "installPackage": {
var fileName = req.fileName, packageName_1 = req.packageName, projectName_1 = req.projectName, projectRootPath = req.projectRootPath;
var cwd = getDirectoryOfPackageJson(fileName, _this.installTypingHost) || projectRootPath;
if (cwd) {
_this.installWorker(-1, [packageName_1], cwd, function (success) {
var message = success ? "Package " + packageName_1 + " installed." : "There was an error installing " + packageName_1 + ".";
var response = { kind: server.ActionPackageInstalled, projectName: projectName_1, success: success, message: message };
_this.sendResponse(response);
});
}
else {
var response = { kind: server.ActionPackageInstalled, projectName: projectName_1, success: false, message: "Could not determine a project root path." };
_this.sendResponse(response);
}
break;
}
default:
ts.Debug.assertNever(req);
}
});
};
NodeTypingsInstaller.prototype.sendResponse = function (response) {
if (this.log.isEnabled()) {
this.log.writeLine("Sending response:\n " + JSON.stringify(response));
}
process.send(response);
if (this.log.isEnabled()) {
this.log.writeLine("Response has been sent.");
}
};
NodeTypingsInstaller.prototype.installWorker = function (requestId, packageNames, cwd, onRequestCompleted) {
var _this = this;
if (this.log.isEnabled()) {
this.log.writeLine("#" + requestId + " with arguments'" + JSON.stringify(packageNames) + "'.");
}
var start = Date.now();
var hasError = typingsInstaller.installNpmPackages(this.npmPath, ts.version, packageNames, function (command) { return _this.execSyncAndLog(command, { cwd: cwd }); });
if (this.log.isEnabled()) {
this.log.writeLine("npm install #" + requestId + " took: " + (Date.now() - start) + " ms");
}
onRequestCompleted(!hasError);
};
NodeTypingsInstaller.prototype.execSyncAndLog = function (command, options) {
if (this.log.isEnabled()) {
this.log.writeLine("Exec: " + command);
}
try {
var stdout = this.nodeExecSync(command, __assign(__assign({}, options), { encoding: "utf-8" }));
if (this.log.isEnabled()) {
this.log.writeLine(" Succeeded. stdout:" + indent(ts.sys.newLine, stdout));
}
return false;
}
catch (error) {
var stdout = error.stdout, stderr = error.stderr;
this.log.writeLine(" Failed. stdout:" + indent(ts.sys.newLine, stdout) + ts.sys.newLine + " stderr:" + indent(ts.sys.newLine, stderr));
return true;
}
};
return NodeTypingsInstaller;
}(typingsInstaller.TypingsInstaller));
typingsInstaller.NodeTypingsInstaller = NodeTypingsInstaller;
function getDirectoryOfPackageJson(fileName, host) {
return ts.forEachAncestorDirectory(ts.getDirectoryPath(fileName), function (directory) {
if (host.fileExists(ts.combinePaths(directory, "package.json"))) {
return directory;
}
});
}
var logFilePath = server.findArgument(server.Arguments.LogFile);
var globalTypingsCacheLocation = server.findArgument(server.Arguments.GlobalCacheLocation);
var typingSafeListLocation = server.findArgument(server.Arguments.TypingSafeListLocation);
var typesMapLocation = server.findArgument(server.Arguments.TypesMapLocation);
var npmLocation = server.findArgument(server.Arguments.NpmLocation);
var validateDefaultNpmLocation = server.hasArgument(server.Arguments.ValidateDefaultNpmLocation);
var log = new FileLog(logFilePath);
if (log.isEnabled()) {
process.on("uncaughtException", function (e) {
log.writeLine("Unhandled exception: " + e + " at " + e.stack);
});
}
process.on("disconnect", function () {
if (log.isEnabled()) {
log.writeLine("Parent process has exited, shutting down...");
}
process.exit(0);
});
var installer = new NodeTypingsInstaller(globalTypingsCacheLocation, typingSafeListLocation, typesMapLocation, npmLocation, validateDefaultNpmLocation, 5, log);
installer.listen();
function indent(newline, str) {
return str && str.length
? newline + " " + str.replace(/\r?\n/, newline + " ")
: "";
}
})(typingsInstaller = server.typingsInstaller || (server.typingsInstaller = {}));
})(server = ts.server || (ts.server = {}));
})(ts || (ts = {}));
//# sourceMappingURL=typingsInstaller.js.map
Reference in a new issue View git blame Copy permalink