47534 lines
2.6 MiB
47534 lines
2.6 MiB
/*! *****************************************************************************
|
|
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.
|
|
***************************************************************************** */
|
|
|
|
var ts;
|
|
(function (ts) {
|
|
// token > SyntaxKind.Identifer => token is a keyword
|
|
(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 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"] = 6] = "ConflictMarkerTrivia";
|
|
// Literals
|
|
SyntaxKind[SyntaxKind["NumericLiteral"] = 7] = "NumericLiteral";
|
|
SyntaxKind[SyntaxKind["StringLiteral"] = 8] = "StringLiteral";
|
|
SyntaxKind[SyntaxKind["RegularExpressionLiteral"] = 9] = "RegularExpressionLiteral";
|
|
SyntaxKind[SyntaxKind["NoSubstitutionTemplateLiteral"] = 10] = "NoSubstitutionTemplateLiteral";
|
|
// Pseudo-literals
|
|
SyntaxKind[SyntaxKind["TemplateHead"] = 11] = "TemplateHead";
|
|
SyntaxKind[SyntaxKind["TemplateMiddle"] = 12] = "TemplateMiddle";
|
|
SyntaxKind[SyntaxKind["TemplateTail"] = 13] = "TemplateTail";
|
|
// Punctuation
|
|
SyntaxKind[SyntaxKind["OpenBraceToken"] = 14] = "OpenBraceToken";
|
|
SyntaxKind[SyntaxKind["CloseBraceToken"] = 15] = "CloseBraceToken";
|
|
SyntaxKind[SyntaxKind["OpenParenToken"] = 16] = "OpenParenToken";
|
|
SyntaxKind[SyntaxKind["CloseParenToken"] = 17] = "CloseParenToken";
|
|
SyntaxKind[SyntaxKind["OpenBracketToken"] = 18] = "OpenBracketToken";
|
|
SyntaxKind[SyntaxKind["CloseBracketToken"] = 19] = "CloseBracketToken";
|
|
SyntaxKind[SyntaxKind["DotToken"] = 20] = "DotToken";
|
|
SyntaxKind[SyntaxKind["DotDotDotToken"] = 21] = "DotDotDotToken";
|
|
SyntaxKind[SyntaxKind["SemicolonToken"] = 22] = "SemicolonToken";
|
|
SyntaxKind[SyntaxKind["CommaToken"] = 23] = "CommaToken";
|
|
SyntaxKind[SyntaxKind["LessThanToken"] = 24] = "LessThanToken";
|
|
SyntaxKind[SyntaxKind["LessThanSlashToken"] = 25] = "LessThanSlashToken";
|
|
SyntaxKind[SyntaxKind["GreaterThanToken"] = 26] = "GreaterThanToken";
|
|
SyntaxKind[SyntaxKind["LessThanEqualsToken"] = 27] = "LessThanEqualsToken";
|
|
SyntaxKind[SyntaxKind["GreaterThanEqualsToken"] = 28] = "GreaterThanEqualsToken";
|
|
SyntaxKind[SyntaxKind["EqualsEqualsToken"] = 29] = "EqualsEqualsToken";
|
|
SyntaxKind[SyntaxKind["ExclamationEqualsToken"] = 30] = "ExclamationEqualsToken";
|
|
SyntaxKind[SyntaxKind["EqualsEqualsEqualsToken"] = 31] = "EqualsEqualsEqualsToken";
|
|
SyntaxKind[SyntaxKind["ExclamationEqualsEqualsToken"] = 32] = "ExclamationEqualsEqualsToken";
|
|
SyntaxKind[SyntaxKind["EqualsGreaterThanToken"] = 33] = "EqualsGreaterThanToken";
|
|
SyntaxKind[SyntaxKind["PlusToken"] = 34] = "PlusToken";
|
|
SyntaxKind[SyntaxKind["MinusToken"] = 35] = "MinusToken";
|
|
SyntaxKind[SyntaxKind["AsteriskToken"] = 36] = "AsteriskToken";
|
|
SyntaxKind[SyntaxKind["SlashToken"] = 37] = "SlashToken";
|
|
SyntaxKind[SyntaxKind["PercentToken"] = 38] = "PercentToken";
|
|
SyntaxKind[SyntaxKind["PlusPlusToken"] = 39] = "PlusPlusToken";
|
|
SyntaxKind[SyntaxKind["MinusMinusToken"] = 40] = "MinusMinusToken";
|
|
SyntaxKind[SyntaxKind["LessThanLessThanToken"] = 41] = "LessThanLessThanToken";
|
|
SyntaxKind[SyntaxKind["GreaterThanGreaterThanToken"] = 42] = "GreaterThanGreaterThanToken";
|
|
SyntaxKind[SyntaxKind["GreaterThanGreaterThanGreaterThanToken"] = 43] = "GreaterThanGreaterThanGreaterThanToken";
|
|
SyntaxKind[SyntaxKind["AmpersandToken"] = 44] = "AmpersandToken";
|
|
SyntaxKind[SyntaxKind["BarToken"] = 45] = "BarToken";
|
|
SyntaxKind[SyntaxKind["CaretToken"] = 46] = "CaretToken";
|
|
SyntaxKind[SyntaxKind["ExclamationToken"] = 47] = "ExclamationToken";
|
|
SyntaxKind[SyntaxKind["TildeToken"] = 48] = "TildeToken";
|
|
SyntaxKind[SyntaxKind["AmpersandAmpersandToken"] = 49] = "AmpersandAmpersandToken";
|
|
SyntaxKind[SyntaxKind["BarBarToken"] = 50] = "BarBarToken";
|
|
SyntaxKind[SyntaxKind["QuestionToken"] = 51] = "QuestionToken";
|
|
SyntaxKind[SyntaxKind["ColonToken"] = 52] = "ColonToken";
|
|
SyntaxKind[SyntaxKind["AtToken"] = 53] = "AtToken";
|
|
// Assignments
|
|
SyntaxKind[SyntaxKind["EqualsToken"] = 54] = "EqualsToken";
|
|
SyntaxKind[SyntaxKind["PlusEqualsToken"] = 55] = "PlusEqualsToken";
|
|
SyntaxKind[SyntaxKind["MinusEqualsToken"] = 56] = "MinusEqualsToken";
|
|
SyntaxKind[SyntaxKind["AsteriskEqualsToken"] = 57] = "AsteriskEqualsToken";
|
|
SyntaxKind[SyntaxKind["SlashEqualsToken"] = 58] = "SlashEqualsToken";
|
|
SyntaxKind[SyntaxKind["PercentEqualsToken"] = 59] = "PercentEqualsToken";
|
|
SyntaxKind[SyntaxKind["LessThanLessThanEqualsToken"] = 60] = "LessThanLessThanEqualsToken";
|
|
SyntaxKind[SyntaxKind["GreaterThanGreaterThanEqualsToken"] = 61] = "GreaterThanGreaterThanEqualsToken";
|
|
SyntaxKind[SyntaxKind["GreaterThanGreaterThanGreaterThanEqualsToken"] = 62] = "GreaterThanGreaterThanGreaterThanEqualsToken";
|
|
SyntaxKind[SyntaxKind["AmpersandEqualsToken"] = 63] = "AmpersandEqualsToken";
|
|
SyntaxKind[SyntaxKind["BarEqualsToken"] = 64] = "BarEqualsToken";
|
|
SyntaxKind[SyntaxKind["CaretEqualsToken"] = 65] = "CaretEqualsToken";
|
|
// Identifiers
|
|
SyntaxKind[SyntaxKind["Identifier"] = 66] = "Identifier";
|
|
// Reserved words
|
|
SyntaxKind[SyntaxKind["BreakKeyword"] = 67] = "BreakKeyword";
|
|
SyntaxKind[SyntaxKind["CaseKeyword"] = 68] = "CaseKeyword";
|
|
SyntaxKind[SyntaxKind["CatchKeyword"] = 69] = "CatchKeyword";
|
|
SyntaxKind[SyntaxKind["ClassKeyword"] = 70] = "ClassKeyword";
|
|
SyntaxKind[SyntaxKind["ConstKeyword"] = 71] = "ConstKeyword";
|
|
SyntaxKind[SyntaxKind["ContinueKeyword"] = 72] = "ContinueKeyword";
|
|
SyntaxKind[SyntaxKind["DebuggerKeyword"] = 73] = "DebuggerKeyword";
|
|
SyntaxKind[SyntaxKind["DefaultKeyword"] = 74] = "DefaultKeyword";
|
|
SyntaxKind[SyntaxKind["DeleteKeyword"] = 75] = "DeleteKeyword";
|
|
SyntaxKind[SyntaxKind["DoKeyword"] = 76] = "DoKeyword";
|
|
SyntaxKind[SyntaxKind["ElseKeyword"] = 77] = "ElseKeyword";
|
|
SyntaxKind[SyntaxKind["EnumKeyword"] = 78] = "EnumKeyword";
|
|
SyntaxKind[SyntaxKind["ExportKeyword"] = 79] = "ExportKeyword";
|
|
SyntaxKind[SyntaxKind["ExtendsKeyword"] = 80] = "ExtendsKeyword";
|
|
SyntaxKind[SyntaxKind["FalseKeyword"] = 81] = "FalseKeyword";
|
|
SyntaxKind[SyntaxKind["FinallyKeyword"] = 82] = "FinallyKeyword";
|
|
SyntaxKind[SyntaxKind["ForKeyword"] = 83] = "ForKeyword";
|
|
SyntaxKind[SyntaxKind["FunctionKeyword"] = 84] = "FunctionKeyword";
|
|
SyntaxKind[SyntaxKind["IfKeyword"] = 85] = "IfKeyword";
|
|
SyntaxKind[SyntaxKind["ImportKeyword"] = 86] = "ImportKeyword";
|
|
SyntaxKind[SyntaxKind["InKeyword"] = 87] = "InKeyword";
|
|
SyntaxKind[SyntaxKind["InstanceOfKeyword"] = 88] = "InstanceOfKeyword";
|
|
SyntaxKind[SyntaxKind["NewKeyword"] = 89] = "NewKeyword";
|
|
SyntaxKind[SyntaxKind["NullKeyword"] = 90] = "NullKeyword";
|
|
SyntaxKind[SyntaxKind["ReturnKeyword"] = 91] = "ReturnKeyword";
|
|
SyntaxKind[SyntaxKind["SuperKeyword"] = 92] = "SuperKeyword";
|
|
SyntaxKind[SyntaxKind["SwitchKeyword"] = 93] = "SwitchKeyword";
|
|
SyntaxKind[SyntaxKind["ThisKeyword"] = 94] = "ThisKeyword";
|
|
SyntaxKind[SyntaxKind["ThrowKeyword"] = 95] = "ThrowKeyword";
|
|
SyntaxKind[SyntaxKind["TrueKeyword"] = 96] = "TrueKeyword";
|
|
SyntaxKind[SyntaxKind["TryKeyword"] = 97] = "TryKeyword";
|
|
SyntaxKind[SyntaxKind["TypeOfKeyword"] = 98] = "TypeOfKeyword";
|
|
SyntaxKind[SyntaxKind["VarKeyword"] = 99] = "VarKeyword";
|
|
SyntaxKind[SyntaxKind["VoidKeyword"] = 100] = "VoidKeyword";
|
|
SyntaxKind[SyntaxKind["WhileKeyword"] = 101] = "WhileKeyword";
|
|
SyntaxKind[SyntaxKind["WithKeyword"] = 102] = "WithKeyword";
|
|
// Strict mode reserved words
|
|
SyntaxKind[SyntaxKind["ImplementsKeyword"] = 103] = "ImplementsKeyword";
|
|
SyntaxKind[SyntaxKind["InterfaceKeyword"] = 104] = "InterfaceKeyword";
|
|
SyntaxKind[SyntaxKind["LetKeyword"] = 105] = "LetKeyword";
|
|
SyntaxKind[SyntaxKind["PackageKeyword"] = 106] = "PackageKeyword";
|
|
SyntaxKind[SyntaxKind["PrivateKeyword"] = 107] = "PrivateKeyword";
|
|
SyntaxKind[SyntaxKind["ProtectedKeyword"] = 108] = "ProtectedKeyword";
|
|
SyntaxKind[SyntaxKind["PublicKeyword"] = 109] = "PublicKeyword";
|
|
SyntaxKind[SyntaxKind["StaticKeyword"] = 110] = "StaticKeyword";
|
|
SyntaxKind[SyntaxKind["YieldKeyword"] = 111] = "YieldKeyword";
|
|
// Contextual keywords
|
|
SyntaxKind[SyntaxKind["AbstractKeyword"] = 112] = "AbstractKeyword";
|
|
SyntaxKind[SyntaxKind["AsKeyword"] = 113] = "AsKeyword";
|
|
SyntaxKind[SyntaxKind["AnyKeyword"] = 114] = "AnyKeyword";
|
|
SyntaxKind[SyntaxKind["AsyncKeyword"] = 115] = "AsyncKeyword";
|
|
SyntaxKind[SyntaxKind["AwaitKeyword"] = 116] = "AwaitKeyword";
|
|
SyntaxKind[SyntaxKind["BooleanKeyword"] = 117] = "BooleanKeyword";
|
|
SyntaxKind[SyntaxKind["ConstructorKeyword"] = 118] = "ConstructorKeyword";
|
|
SyntaxKind[SyntaxKind["DeclareKeyword"] = 119] = "DeclareKeyword";
|
|
SyntaxKind[SyntaxKind["GetKeyword"] = 120] = "GetKeyword";
|
|
SyntaxKind[SyntaxKind["IsKeyword"] = 121] = "IsKeyword";
|
|
SyntaxKind[SyntaxKind["ModuleKeyword"] = 122] = "ModuleKeyword";
|
|
SyntaxKind[SyntaxKind["NamespaceKeyword"] = 123] = "NamespaceKeyword";
|
|
SyntaxKind[SyntaxKind["RequireKeyword"] = 124] = "RequireKeyword";
|
|
SyntaxKind[SyntaxKind["NumberKeyword"] = 125] = "NumberKeyword";
|
|
SyntaxKind[SyntaxKind["SetKeyword"] = 126] = "SetKeyword";
|
|
SyntaxKind[SyntaxKind["StringKeyword"] = 127] = "StringKeyword";
|
|
SyntaxKind[SyntaxKind["SymbolKeyword"] = 128] = "SymbolKeyword";
|
|
SyntaxKind[SyntaxKind["TypeKeyword"] = 129] = "TypeKeyword";
|
|
SyntaxKind[SyntaxKind["FromKeyword"] = 130] = "FromKeyword";
|
|
SyntaxKind[SyntaxKind["OfKeyword"] = 131] = "OfKeyword";
|
|
// Parse tree nodes
|
|
// Names
|
|
SyntaxKind[SyntaxKind["QualifiedName"] = 132] = "QualifiedName";
|
|
SyntaxKind[SyntaxKind["ComputedPropertyName"] = 133] = "ComputedPropertyName";
|
|
// Signature elements
|
|
SyntaxKind[SyntaxKind["TypeParameter"] = 134] = "TypeParameter";
|
|
SyntaxKind[SyntaxKind["Parameter"] = 135] = "Parameter";
|
|
SyntaxKind[SyntaxKind["Decorator"] = 136] = "Decorator";
|
|
// TypeMember
|
|
SyntaxKind[SyntaxKind["PropertySignature"] = 137] = "PropertySignature";
|
|
SyntaxKind[SyntaxKind["PropertyDeclaration"] = 138] = "PropertyDeclaration";
|
|
SyntaxKind[SyntaxKind["MethodSignature"] = 139] = "MethodSignature";
|
|
SyntaxKind[SyntaxKind["MethodDeclaration"] = 140] = "MethodDeclaration";
|
|
SyntaxKind[SyntaxKind["Constructor"] = 141] = "Constructor";
|
|
SyntaxKind[SyntaxKind["GetAccessor"] = 142] = "GetAccessor";
|
|
SyntaxKind[SyntaxKind["SetAccessor"] = 143] = "SetAccessor";
|
|
SyntaxKind[SyntaxKind["CallSignature"] = 144] = "CallSignature";
|
|
SyntaxKind[SyntaxKind["ConstructSignature"] = 145] = "ConstructSignature";
|
|
SyntaxKind[SyntaxKind["IndexSignature"] = 146] = "IndexSignature";
|
|
// Type
|
|
SyntaxKind[SyntaxKind["TypePredicate"] = 147] = "TypePredicate";
|
|
SyntaxKind[SyntaxKind["TypeReference"] = 148] = "TypeReference";
|
|
SyntaxKind[SyntaxKind["FunctionType"] = 149] = "FunctionType";
|
|
SyntaxKind[SyntaxKind["ConstructorType"] = 150] = "ConstructorType";
|
|
SyntaxKind[SyntaxKind["TypeQuery"] = 151] = "TypeQuery";
|
|
SyntaxKind[SyntaxKind["TypeLiteral"] = 152] = "TypeLiteral";
|
|
SyntaxKind[SyntaxKind["ArrayType"] = 153] = "ArrayType";
|
|
SyntaxKind[SyntaxKind["TupleType"] = 154] = "TupleType";
|
|
SyntaxKind[SyntaxKind["UnionType"] = 155] = "UnionType";
|
|
SyntaxKind[SyntaxKind["IntersectionType"] = 156] = "IntersectionType";
|
|
SyntaxKind[SyntaxKind["ParenthesizedType"] = 157] = "ParenthesizedType";
|
|
// Binding patterns
|
|
SyntaxKind[SyntaxKind["ObjectBindingPattern"] = 158] = "ObjectBindingPattern";
|
|
SyntaxKind[SyntaxKind["ArrayBindingPattern"] = 159] = "ArrayBindingPattern";
|
|
SyntaxKind[SyntaxKind["BindingElement"] = 160] = "BindingElement";
|
|
// Expression
|
|
SyntaxKind[SyntaxKind["ArrayLiteralExpression"] = 161] = "ArrayLiteralExpression";
|
|
SyntaxKind[SyntaxKind["ObjectLiteralExpression"] = 162] = "ObjectLiteralExpression";
|
|
SyntaxKind[SyntaxKind["PropertyAccessExpression"] = 163] = "PropertyAccessExpression";
|
|
SyntaxKind[SyntaxKind["ElementAccessExpression"] = 164] = "ElementAccessExpression";
|
|
SyntaxKind[SyntaxKind["CallExpression"] = 165] = "CallExpression";
|
|
SyntaxKind[SyntaxKind["NewExpression"] = 166] = "NewExpression";
|
|
SyntaxKind[SyntaxKind["TaggedTemplateExpression"] = 167] = "TaggedTemplateExpression";
|
|
SyntaxKind[SyntaxKind["TypeAssertionExpression"] = 168] = "TypeAssertionExpression";
|
|
SyntaxKind[SyntaxKind["ParenthesizedExpression"] = 169] = "ParenthesizedExpression";
|
|
SyntaxKind[SyntaxKind["FunctionExpression"] = 170] = "FunctionExpression";
|
|
SyntaxKind[SyntaxKind["ArrowFunction"] = 171] = "ArrowFunction";
|
|
SyntaxKind[SyntaxKind["DeleteExpression"] = 172] = "DeleteExpression";
|
|
SyntaxKind[SyntaxKind["TypeOfExpression"] = 173] = "TypeOfExpression";
|
|
SyntaxKind[SyntaxKind["VoidExpression"] = 174] = "VoidExpression";
|
|
SyntaxKind[SyntaxKind["AwaitExpression"] = 175] = "AwaitExpression";
|
|
SyntaxKind[SyntaxKind["PrefixUnaryExpression"] = 176] = "PrefixUnaryExpression";
|
|
SyntaxKind[SyntaxKind["PostfixUnaryExpression"] = 177] = "PostfixUnaryExpression";
|
|
SyntaxKind[SyntaxKind["BinaryExpression"] = 178] = "BinaryExpression";
|
|
SyntaxKind[SyntaxKind["ConditionalExpression"] = 179] = "ConditionalExpression";
|
|
SyntaxKind[SyntaxKind["TemplateExpression"] = 180] = "TemplateExpression";
|
|
SyntaxKind[SyntaxKind["YieldExpression"] = 181] = "YieldExpression";
|
|
SyntaxKind[SyntaxKind["SpreadElementExpression"] = 182] = "SpreadElementExpression";
|
|
SyntaxKind[SyntaxKind["ClassExpression"] = 183] = "ClassExpression";
|
|
SyntaxKind[SyntaxKind["OmittedExpression"] = 184] = "OmittedExpression";
|
|
SyntaxKind[SyntaxKind["ExpressionWithTypeArguments"] = 185] = "ExpressionWithTypeArguments";
|
|
SyntaxKind[SyntaxKind["AsExpression"] = 186] = "AsExpression";
|
|
// Misc
|
|
SyntaxKind[SyntaxKind["TemplateSpan"] = 187] = "TemplateSpan";
|
|
SyntaxKind[SyntaxKind["SemicolonClassElement"] = 188] = "SemicolonClassElement";
|
|
// Element
|
|
SyntaxKind[SyntaxKind["Block"] = 189] = "Block";
|
|
SyntaxKind[SyntaxKind["VariableStatement"] = 190] = "VariableStatement";
|
|
SyntaxKind[SyntaxKind["EmptyStatement"] = 191] = "EmptyStatement";
|
|
SyntaxKind[SyntaxKind["ExpressionStatement"] = 192] = "ExpressionStatement";
|
|
SyntaxKind[SyntaxKind["IfStatement"] = 193] = "IfStatement";
|
|
SyntaxKind[SyntaxKind["DoStatement"] = 194] = "DoStatement";
|
|
SyntaxKind[SyntaxKind["WhileStatement"] = 195] = "WhileStatement";
|
|
SyntaxKind[SyntaxKind["ForStatement"] = 196] = "ForStatement";
|
|
SyntaxKind[SyntaxKind["ForInStatement"] = 197] = "ForInStatement";
|
|
SyntaxKind[SyntaxKind["ForOfStatement"] = 198] = "ForOfStatement";
|
|
SyntaxKind[SyntaxKind["ContinueStatement"] = 199] = "ContinueStatement";
|
|
SyntaxKind[SyntaxKind["BreakStatement"] = 200] = "BreakStatement";
|
|
SyntaxKind[SyntaxKind["ReturnStatement"] = 201] = "ReturnStatement";
|
|
SyntaxKind[SyntaxKind["WithStatement"] = 202] = "WithStatement";
|
|
SyntaxKind[SyntaxKind["SwitchStatement"] = 203] = "SwitchStatement";
|
|
SyntaxKind[SyntaxKind["LabeledStatement"] = 204] = "LabeledStatement";
|
|
SyntaxKind[SyntaxKind["ThrowStatement"] = 205] = "ThrowStatement";
|
|
SyntaxKind[SyntaxKind["TryStatement"] = 206] = "TryStatement";
|
|
SyntaxKind[SyntaxKind["DebuggerStatement"] = 207] = "DebuggerStatement";
|
|
SyntaxKind[SyntaxKind["VariableDeclaration"] = 208] = "VariableDeclaration";
|
|
SyntaxKind[SyntaxKind["VariableDeclarationList"] = 209] = "VariableDeclarationList";
|
|
SyntaxKind[SyntaxKind["FunctionDeclaration"] = 210] = "FunctionDeclaration";
|
|
SyntaxKind[SyntaxKind["ClassDeclaration"] = 211] = "ClassDeclaration";
|
|
SyntaxKind[SyntaxKind["InterfaceDeclaration"] = 212] = "InterfaceDeclaration";
|
|
SyntaxKind[SyntaxKind["TypeAliasDeclaration"] = 213] = "TypeAliasDeclaration";
|
|
SyntaxKind[SyntaxKind["EnumDeclaration"] = 214] = "EnumDeclaration";
|
|
SyntaxKind[SyntaxKind["ModuleDeclaration"] = 215] = "ModuleDeclaration";
|
|
SyntaxKind[SyntaxKind["ModuleBlock"] = 216] = "ModuleBlock";
|
|
SyntaxKind[SyntaxKind["CaseBlock"] = 217] = "CaseBlock";
|
|
SyntaxKind[SyntaxKind["ImportEqualsDeclaration"] = 218] = "ImportEqualsDeclaration";
|
|
SyntaxKind[SyntaxKind["ImportDeclaration"] = 219] = "ImportDeclaration";
|
|
SyntaxKind[SyntaxKind["ImportClause"] = 220] = "ImportClause";
|
|
SyntaxKind[SyntaxKind["NamespaceImport"] = 221] = "NamespaceImport";
|
|
SyntaxKind[SyntaxKind["NamedImports"] = 222] = "NamedImports";
|
|
SyntaxKind[SyntaxKind["ImportSpecifier"] = 223] = "ImportSpecifier";
|
|
SyntaxKind[SyntaxKind["ExportAssignment"] = 224] = "ExportAssignment";
|
|
SyntaxKind[SyntaxKind["ExportDeclaration"] = 225] = "ExportDeclaration";
|
|
SyntaxKind[SyntaxKind["NamedExports"] = 226] = "NamedExports";
|
|
SyntaxKind[SyntaxKind["ExportSpecifier"] = 227] = "ExportSpecifier";
|
|
SyntaxKind[SyntaxKind["MissingDeclaration"] = 228] = "MissingDeclaration";
|
|
// Module references
|
|
SyntaxKind[SyntaxKind["ExternalModuleReference"] = 229] = "ExternalModuleReference";
|
|
// JSX
|
|
SyntaxKind[SyntaxKind["JsxElement"] = 230] = "JsxElement";
|
|
SyntaxKind[SyntaxKind["JsxSelfClosingElement"] = 231] = "JsxSelfClosingElement";
|
|
SyntaxKind[SyntaxKind["JsxOpeningElement"] = 232] = "JsxOpeningElement";
|
|
SyntaxKind[SyntaxKind["JsxText"] = 233] = "JsxText";
|
|
SyntaxKind[SyntaxKind["JsxClosingElement"] = 234] = "JsxClosingElement";
|
|
SyntaxKind[SyntaxKind["JsxAttribute"] = 235] = "JsxAttribute";
|
|
SyntaxKind[SyntaxKind["JsxSpreadAttribute"] = 236] = "JsxSpreadAttribute";
|
|
SyntaxKind[SyntaxKind["JsxExpression"] = 237] = "JsxExpression";
|
|
// Clauses
|
|
SyntaxKind[SyntaxKind["CaseClause"] = 238] = "CaseClause";
|
|
SyntaxKind[SyntaxKind["DefaultClause"] = 239] = "DefaultClause";
|
|
SyntaxKind[SyntaxKind["HeritageClause"] = 240] = "HeritageClause";
|
|
SyntaxKind[SyntaxKind["CatchClause"] = 241] = "CatchClause";
|
|
// Property assignments
|
|
SyntaxKind[SyntaxKind["PropertyAssignment"] = 242] = "PropertyAssignment";
|
|
SyntaxKind[SyntaxKind["ShorthandPropertyAssignment"] = 243] = "ShorthandPropertyAssignment";
|
|
// Enum
|
|
SyntaxKind[SyntaxKind["EnumMember"] = 244] = "EnumMember";
|
|
// Top-level nodes
|
|
SyntaxKind[SyntaxKind["SourceFile"] = 245] = "SourceFile";
|
|
// JSDoc nodes.
|
|
SyntaxKind[SyntaxKind["JSDocTypeExpression"] = 246] = "JSDocTypeExpression";
|
|
// The * type.
|
|
SyntaxKind[SyntaxKind["JSDocAllType"] = 247] = "JSDocAllType";
|
|
// The ? type.
|
|
SyntaxKind[SyntaxKind["JSDocUnknownType"] = 248] = "JSDocUnknownType";
|
|
SyntaxKind[SyntaxKind["JSDocArrayType"] = 249] = "JSDocArrayType";
|
|
SyntaxKind[SyntaxKind["JSDocUnionType"] = 250] = "JSDocUnionType";
|
|
SyntaxKind[SyntaxKind["JSDocTupleType"] = 251] = "JSDocTupleType";
|
|
SyntaxKind[SyntaxKind["JSDocNullableType"] = 252] = "JSDocNullableType";
|
|
SyntaxKind[SyntaxKind["JSDocNonNullableType"] = 253] = "JSDocNonNullableType";
|
|
SyntaxKind[SyntaxKind["JSDocRecordType"] = 254] = "JSDocRecordType";
|
|
SyntaxKind[SyntaxKind["JSDocRecordMember"] = 255] = "JSDocRecordMember";
|
|
SyntaxKind[SyntaxKind["JSDocTypeReference"] = 256] = "JSDocTypeReference";
|
|
SyntaxKind[SyntaxKind["JSDocOptionalType"] = 257] = "JSDocOptionalType";
|
|
SyntaxKind[SyntaxKind["JSDocFunctionType"] = 258] = "JSDocFunctionType";
|
|
SyntaxKind[SyntaxKind["JSDocVariadicType"] = 259] = "JSDocVariadicType";
|
|
SyntaxKind[SyntaxKind["JSDocConstructorType"] = 260] = "JSDocConstructorType";
|
|
SyntaxKind[SyntaxKind["JSDocThisType"] = 261] = "JSDocThisType";
|
|
SyntaxKind[SyntaxKind["JSDocComment"] = 262] = "JSDocComment";
|
|
SyntaxKind[SyntaxKind["JSDocTag"] = 263] = "JSDocTag";
|
|
SyntaxKind[SyntaxKind["JSDocParameterTag"] = 264] = "JSDocParameterTag";
|
|
SyntaxKind[SyntaxKind["JSDocReturnTag"] = 265] = "JSDocReturnTag";
|
|
SyntaxKind[SyntaxKind["JSDocTypeTag"] = 266] = "JSDocTypeTag";
|
|
SyntaxKind[SyntaxKind["JSDocTemplateTag"] = 267] = "JSDocTemplateTag";
|
|
// Synthesized list
|
|
SyntaxKind[SyntaxKind["SyntaxList"] = 268] = "SyntaxList";
|
|
// Enum value count
|
|
SyntaxKind[SyntaxKind["Count"] = 269] = "Count";
|
|
// Markers
|
|
SyntaxKind[SyntaxKind["FirstAssignment"] = 54] = "FirstAssignment";
|
|
SyntaxKind[SyntaxKind["LastAssignment"] = 65] = "LastAssignment";
|
|
SyntaxKind[SyntaxKind["FirstReservedWord"] = 67] = "FirstReservedWord";
|
|
SyntaxKind[SyntaxKind["LastReservedWord"] = 102] = "LastReservedWord";
|
|
SyntaxKind[SyntaxKind["FirstKeyword"] = 67] = "FirstKeyword";
|
|
SyntaxKind[SyntaxKind["LastKeyword"] = 131] = "LastKeyword";
|
|
SyntaxKind[SyntaxKind["FirstFutureReservedWord"] = 103] = "FirstFutureReservedWord";
|
|
SyntaxKind[SyntaxKind["LastFutureReservedWord"] = 111] = "LastFutureReservedWord";
|
|
SyntaxKind[SyntaxKind["FirstTypeNode"] = 148] = "FirstTypeNode";
|
|
SyntaxKind[SyntaxKind["LastTypeNode"] = 157] = "LastTypeNode";
|
|
SyntaxKind[SyntaxKind["FirstPunctuation"] = 14] = "FirstPunctuation";
|
|
SyntaxKind[SyntaxKind["LastPunctuation"] = 65] = "LastPunctuation";
|
|
SyntaxKind[SyntaxKind["FirstToken"] = 0] = "FirstToken";
|
|
SyntaxKind[SyntaxKind["LastToken"] = 131] = "LastToken";
|
|
SyntaxKind[SyntaxKind["FirstTriviaToken"] = 2] = "FirstTriviaToken";
|
|
SyntaxKind[SyntaxKind["LastTriviaToken"] = 6] = "LastTriviaToken";
|
|
SyntaxKind[SyntaxKind["FirstLiteralToken"] = 7] = "FirstLiteralToken";
|
|
SyntaxKind[SyntaxKind["LastLiteralToken"] = 10] = "LastLiteralToken";
|
|
SyntaxKind[SyntaxKind["FirstTemplateToken"] = 10] = "FirstTemplateToken";
|
|
SyntaxKind[SyntaxKind["LastTemplateToken"] = 13] = "LastTemplateToken";
|
|
SyntaxKind[SyntaxKind["FirstBinaryOperator"] = 24] = "FirstBinaryOperator";
|
|
SyntaxKind[SyntaxKind["LastBinaryOperator"] = 65] = "LastBinaryOperator";
|
|
SyntaxKind[SyntaxKind["FirstNode"] = 132] = "FirstNode";
|
|
})(ts.SyntaxKind || (ts.SyntaxKind = {}));
|
|
var SyntaxKind = ts.SyntaxKind;
|
|
(function (NodeFlags) {
|
|
NodeFlags[NodeFlags["Export"] = 1] = "Export";
|
|
NodeFlags[NodeFlags["Ambient"] = 2] = "Ambient";
|
|
NodeFlags[NodeFlags["Public"] = 16] = "Public";
|
|
NodeFlags[NodeFlags["Private"] = 32] = "Private";
|
|
NodeFlags[NodeFlags["Protected"] = 64] = "Protected";
|
|
NodeFlags[NodeFlags["Static"] = 128] = "Static";
|
|
NodeFlags[NodeFlags["Abstract"] = 256] = "Abstract";
|
|
NodeFlags[NodeFlags["Async"] = 512] = "Async";
|
|
NodeFlags[NodeFlags["Default"] = 1024] = "Default";
|
|
NodeFlags[NodeFlags["MultiLine"] = 2048] = "MultiLine";
|
|
NodeFlags[NodeFlags["Synthetic"] = 4096] = "Synthetic";
|
|
NodeFlags[NodeFlags["DeclarationFile"] = 8192] = "DeclarationFile";
|
|
NodeFlags[NodeFlags["Let"] = 16384] = "Let";
|
|
NodeFlags[NodeFlags["Const"] = 32768] = "Const";
|
|
NodeFlags[NodeFlags["OctalLiteral"] = 65536] = "OctalLiteral";
|
|
NodeFlags[NodeFlags["Namespace"] = 131072] = "Namespace";
|
|
NodeFlags[NodeFlags["ExportContext"] = 262144] = "ExportContext";
|
|
NodeFlags[NodeFlags["Modifier"] = 2035] = "Modifier";
|
|
NodeFlags[NodeFlags["AccessibilityModifier"] = 112] = "AccessibilityModifier";
|
|
NodeFlags[NodeFlags["BlockScoped"] = 49152] = "BlockScoped";
|
|
})(ts.NodeFlags || (ts.NodeFlags = {}));
|
|
var NodeFlags = ts.NodeFlags;
|
|
/* @internal */
|
|
(function (ParserContextFlags) {
|
|
ParserContextFlags[ParserContextFlags["None"] = 0] = "None";
|
|
// If this node was parsed in a context where 'in-expressions' are not allowed.
|
|
ParserContextFlags[ParserContextFlags["DisallowIn"] = 1] = "DisallowIn";
|
|
// If this node was parsed in the 'yield' context created when parsing a generator.
|
|
ParserContextFlags[ParserContextFlags["Yield"] = 2] = "Yield";
|
|
// If this node was parsed as part of a decorator
|
|
ParserContextFlags[ParserContextFlags["Decorator"] = 4] = "Decorator";
|
|
// If this node was parsed in the 'await' context created when parsing an async function.
|
|
ParserContextFlags[ParserContextFlags["Await"] = 8] = "Await";
|
|
// If the parser encountered an error when parsing the code that created this node. Note
|
|
// the parser only sets this directly on the node it creates right after encountering the
|
|
// error.
|
|
ParserContextFlags[ParserContextFlags["ThisNodeHasError"] = 16] = "ThisNodeHasError";
|
|
// This node was parsed in a JavaScript file and can be processed differently. For example
|
|
// its type can be specified usign a JSDoc comment.
|
|
ParserContextFlags[ParserContextFlags["JavaScriptFile"] = 32] = "JavaScriptFile";
|
|
// Context flags set directly by the parser.
|
|
ParserContextFlags[ParserContextFlags["ParserGeneratedFlags"] = 31] = "ParserGeneratedFlags";
|
|
// Exclude these flags when parsing a Type
|
|
ParserContextFlags[ParserContextFlags["TypeExcludesFlags"] = 10] = "TypeExcludesFlags";
|
|
// Context flags computed by aggregating child flags upwards.
|
|
// Used during incremental parsing to determine if this node or any of its children had an
|
|
// error. Computed only once and then cached.
|
|
ParserContextFlags[ParserContextFlags["ThisNodeOrAnySubNodesHasError"] = 64] = "ThisNodeOrAnySubNodesHasError";
|
|
// Used to know if we've computed data from children and cached it in this node.
|
|
ParserContextFlags[ParserContextFlags["HasAggregatedChildData"] = 128] = "HasAggregatedChildData";
|
|
})(ts.ParserContextFlags || (ts.ParserContextFlags = {}));
|
|
var ParserContextFlags = ts.ParserContextFlags;
|
|
(function (JsxFlags) {
|
|
JsxFlags[JsxFlags["None"] = 0] = "None";
|
|
JsxFlags[JsxFlags["IntrinsicNamedElement"] = 1] = "IntrinsicNamedElement";
|
|
JsxFlags[JsxFlags["IntrinsicIndexedElement"] = 2] = "IntrinsicIndexedElement";
|
|
JsxFlags[JsxFlags["ClassElement"] = 4] = "ClassElement";
|
|
JsxFlags[JsxFlags["UnknownElement"] = 8] = "UnknownElement";
|
|
JsxFlags[JsxFlags["IntrinsicElement"] = 3] = "IntrinsicElement";
|
|
})(ts.JsxFlags || (ts.JsxFlags = {}));
|
|
var JsxFlags = ts.JsxFlags;
|
|
/* @internal */
|
|
(function (RelationComparisonResult) {
|
|
RelationComparisonResult[RelationComparisonResult["Succeeded"] = 1] = "Succeeded";
|
|
RelationComparisonResult[RelationComparisonResult["Failed"] = 2] = "Failed";
|
|
RelationComparisonResult[RelationComparisonResult["FailedAndReported"] = 3] = "FailedAndReported";
|
|
})(ts.RelationComparisonResult || (ts.RelationComparisonResult = {}));
|
|
var RelationComparisonResult = ts.RelationComparisonResult;
|
|
var OperationCanceledException = (function () {
|
|
function OperationCanceledException() {
|
|
}
|
|
return OperationCanceledException;
|
|
})();
|
|
ts.OperationCanceledException = OperationCanceledException;
|
|
/** Return code used by getEmitOutput function to indicate status of the function */
|
|
(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";
|
|
})(ts.ExitStatus || (ts.ExitStatus = {}));
|
|
var ExitStatus = ts.ExitStatus;
|
|
(function (TypeFormatFlags) {
|
|
TypeFormatFlags[TypeFormatFlags["None"] = 0] = "None";
|
|
TypeFormatFlags[TypeFormatFlags["WriteArrayAsGenericType"] = 1] = "WriteArrayAsGenericType";
|
|
TypeFormatFlags[TypeFormatFlags["UseTypeOfFunction"] = 2] = "UseTypeOfFunction";
|
|
TypeFormatFlags[TypeFormatFlags["NoTruncation"] = 4] = "NoTruncation";
|
|
TypeFormatFlags[TypeFormatFlags["WriteArrowStyleSignature"] = 8] = "WriteArrowStyleSignature";
|
|
TypeFormatFlags[TypeFormatFlags["WriteOwnNameForAnyLike"] = 16] = "WriteOwnNameForAnyLike";
|
|
TypeFormatFlags[TypeFormatFlags["WriteTypeArgumentsOfSignature"] = 32] = "WriteTypeArgumentsOfSignature";
|
|
TypeFormatFlags[TypeFormatFlags["InElementType"] = 64] = "InElementType";
|
|
TypeFormatFlags[TypeFormatFlags["UseFullyQualifiedType"] = 128] = "UseFullyQualifiedType";
|
|
})(ts.TypeFormatFlags || (ts.TypeFormatFlags = {}));
|
|
var TypeFormatFlags = ts.TypeFormatFlags;
|
|
(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";
|
|
})(ts.SymbolFormatFlags || (ts.SymbolFormatFlags = {}));
|
|
var SymbolFormatFlags = ts.SymbolFormatFlags;
|
|
/* @internal */
|
|
(function (SymbolAccessibility) {
|
|
SymbolAccessibility[SymbolAccessibility["Accessible"] = 0] = "Accessible";
|
|
SymbolAccessibility[SymbolAccessibility["NotAccessible"] = 1] = "NotAccessible";
|
|
SymbolAccessibility[SymbolAccessibility["CannotBeNamed"] = 2] = "CannotBeNamed";
|
|
})(ts.SymbolAccessibility || (ts.SymbolAccessibility = {}));
|
|
var SymbolAccessibility = ts.SymbolAccessibility;
|
|
/** Indicates how to serialize the name for a TypeReferenceNode when emitting decorator
|
|
* metadata */
|
|
/* @internal */
|
|
(function (TypeReferenceSerializationKind) {
|
|
TypeReferenceSerializationKind[TypeReferenceSerializationKind["Unknown"] = 0] = "Unknown";
|
|
// should be emitted using a safe fallback.
|
|
TypeReferenceSerializationKind[TypeReferenceSerializationKind["TypeWithConstructSignatureAndValue"] = 1] = "TypeWithConstructSignatureAndValue";
|
|
// 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["VoidType"] = 2] = "VoidType";
|
|
TypeReferenceSerializationKind[TypeReferenceSerializationKind["NumberLikeType"] = 3] = "NumberLikeType";
|
|
TypeReferenceSerializationKind[TypeReferenceSerializationKind["StringLikeType"] = 4] = "StringLikeType";
|
|
TypeReferenceSerializationKind[TypeReferenceSerializationKind["BooleanType"] = 5] = "BooleanType";
|
|
TypeReferenceSerializationKind[TypeReferenceSerializationKind["ArrayLikeType"] = 6] = "ArrayLikeType";
|
|
TypeReferenceSerializationKind[TypeReferenceSerializationKind["ESSymbolType"] = 7] = "ESSymbolType";
|
|
TypeReferenceSerializationKind[TypeReferenceSerializationKind["TypeWithCallSignature"] = 8] = "TypeWithCallSignature";
|
|
// with call signatures.
|
|
TypeReferenceSerializationKind[TypeReferenceSerializationKind["ObjectType"] = 9] = "ObjectType";
|
|
})(ts.TypeReferenceSerializationKind || (ts.TypeReferenceSerializationKind = {}));
|
|
var TypeReferenceSerializationKind = ts.TypeReferenceSerializationKind;
|
|
(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["ExportType"] = 2097152] = "ExportType";
|
|
SymbolFlags[SymbolFlags["ExportNamespace"] = 4194304] = "ExportNamespace";
|
|
SymbolFlags[SymbolFlags["Alias"] = 8388608] = "Alias";
|
|
SymbolFlags[SymbolFlags["Instantiated"] = 16777216] = "Instantiated";
|
|
SymbolFlags[SymbolFlags["Merged"] = 33554432] = "Merged";
|
|
SymbolFlags[SymbolFlags["Transient"] = 67108864] = "Transient";
|
|
SymbolFlags[SymbolFlags["Prototype"] = 134217728] = "Prototype";
|
|
SymbolFlags[SymbolFlags["SyntheticProperty"] = 268435456] = "SyntheticProperty";
|
|
SymbolFlags[SymbolFlags["Optional"] = 536870912] = "Optional";
|
|
SymbolFlags[SymbolFlags["ExportStar"] = 1073741824] = "ExportStar";
|
|
SymbolFlags[SymbolFlags["Enum"] = 384] = "Enum";
|
|
SymbolFlags[SymbolFlags["Variable"] = 3] = "Variable";
|
|
SymbolFlags[SymbolFlags["Value"] = 107455] = "Value";
|
|
SymbolFlags[SymbolFlags["Type"] = 793056] = "Type";
|
|
SymbolFlags[SymbolFlags["Namespace"] = 1536] = "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"] = 107454] = "FunctionScopedVariableExcludes";
|
|
// Block-scoped declarations are not allowed to be re-declared
|
|
// they can not merge with anything in the value space
|
|
SymbolFlags[SymbolFlags["BlockScopedVariableExcludes"] = 107455] = "BlockScopedVariableExcludes";
|
|
SymbolFlags[SymbolFlags["ParameterExcludes"] = 107455] = "ParameterExcludes";
|
|
SymbolFlags[SymbolFlags["PropertyExcludes"] = 107455] = "PropertyExcludes";
|
|
SymbolFlags[SymbolFlags["EnumMemberExcludes"] = 107455] = "EnumMemberExcludes";
|
|
SymbolFlags[SymbolFlags["FunctionExcludes"] = 106927] = "FunctionExcludes";
|
|
SymbolFlags[SymbolFlags["ClassExcludes"] = 899519] = "ClassExcludes";
|
|
SymbolFlags[SymbolFlags["InterfaceExcludes"] = 792960] = "InterfaceExcludes";
|
|
SymbolFlags[SymbolFlags["RegularEnumExcludes"] = 899327] = "RegularEnumExcludes";
|
|
SymbolFlags[SymbolFlags["ConstEnumExcludes"] = 899967] = "ConstEnumExcludes";
|
|
SymbolFlags[SymbolFlags["ValueModuleExcludes"] = 106639] = "ValueModuleExcludes";
|
|
SymbolFlags[SymbolFlags["NamespaceModuleExcludes"] = 0] = "NamespaceModuleExcludes";
|
|
SymbolFlags[SymbolFlags["MethodExcludes"] = 99263] = "MethodExcludes";
|
|
SymbolFlags[SymbolFlags["GetAccessorExcludes"] = 41919] = "GetAccessorExcludes";
|
|
SymbolFlags[SymbolFlags["SetAccessorExcludes"] = 74687] = "SetAccessorExcludes";
|
|
SymbolFlags[SymbolFlags["TypeParameterExcludes"] = 530912] = "TypeParameterExcludes";
|
|
SymbolFlags[SymbolFlags["TypeAliasExcludes"] = 793056] = "TypeAliasExcludes";
|
|
SymbolFlags[SymbolFlags["AliasExcludes"] = 8388608] = "AliasExcludes";
|
|
SymbolFlags[SymbolFlags["ModuleMember"] = 8914931] = "ModuleMember";
|
|
SymbolFlags[SymbolFlags["ExportHasLocal"] = 944] = "ExportHasLocal";
|
|
SymbolFlags[SymbolFlags["HasExports"] = 1952] = "HasExports";
|
|
SymbolFlags[SymbolFlags["HasMembers"] = 6240] = "HasMembers";
|
|
SymbolFlags[SymbolFlags["BlockScoped"] = 418] = "BlockScoped";
|
|
SymbolFlags[SymbolFlags["PropertyOrAccessor"] = 98308] = "PropertyOrAccessor";
|
|
SymbolFlags[SymbolFlags["Export"] = 7340032] = "Export";
|
|
/* @internal */
|
|
// The set of things we consider semantically classifiable. Used to speed up the LS during
|
|
// classification.
|
|
SymbolFlags[SymbolFlags["Classifiable"] = 788448] = "Classifiable";
|
|
})(ts.SymbolFlags || (ts.SymbolFlags = {}));
|
|
var SymbolFlags = ts.SymbolFlags;
|
|
/* @internal */
|
|
(function (NodeCheckFlags) {
|
|
NodeCheckFlags[NodeCheckFlags["TypeChecked"] = 1] = "TypeChecked";
|
|
NodeCheckFlags[NodeCheckFlags["LexicalThis"] = 2] = "LexicalThis";
|
|
NodeCheckFlags[NodeCheckFlags["CaptureThis"] = 4] = "CaptureThis";
|
|
NodeCheckFlags[NodeCheckFlags["EmitExtends"] = 8] = "EmitExtends";
|
|
NodeCheckFlags[NodeCheckFlags["EmitDecorate"] = 16] = "EmitDecorate";
|
|
NodeCheckFlags[NodeCheckFlags["EmitParam"] = 32] = "EmitParam";
|
|
NodeCheckFlags[NodeCheckFlags["EmitAwaiter"] = 64] = "EmitAwaiter";
|
|
NodeCheckFlags[NodeCheckFlags["EmitGenerator"] = 128] = "EmitGenerator";
|
|
NodeCheckFlags[NodeCheckFlags["SuperInstance"] = 256] = "SuperInstance";
|
|
NodeCheckFlags[NodeCheckFlags["SuperStatic"] = 512] = "SuperStatic";
|
|
NodeCheckFlags[NodeCheckFlags["ContextChecked"] = 1024] = "ContextChecked";
|
|
NodeCheckFlags[NodeCheckFlags["LexicalArguments"] = 2048] = "LexicalArguments";
|
|
NodeCheckFlags[NodeCheckFlags["CaptureArguments"] = 4096] = "CaptureArguments";
|
|
// Values for enum members have been computed, and any errors have been reported for them.
|
|
NodeCheckFlags[NodeCheckFlags["EnumValuesComputed"] = 8192] = "EnumValuesComputed";
|
|
NodeCheckFlags[NodeCheckFlags["BlockScopedBindingInLoop"] = 16384] = "BlockScopedBindingInLoop";
|
|
NodeCheckFlags[NodeCheckFlags["LexicalModuleMergesWithClass"] = 32768] = "LexicalModuleMergesWithClass";
|
|
})(ts.NodeCheckFlags || (ts.NodeCheckFlags = {}));
|
|
var NodeCheckFlags = ts.NodeCheckFlags;
|
|
(function (TypeFlags) {
|
|
TypeFlags[TypeFlags["Any"] = 1] = "Any";
|
|
TypeFlags[TypeFlags["String"] = 2] = "String";
|
|
TypeFlags[TypeFlags["Number"] = 4] = "Number";
|
|
TypeFlags[TypeFlags["Boolean"] = 8] = "Boolean";
|
|
TypeFlags[TypeFlags["Void"] = 16] = "Void";
|
|
TypeFlags[TypeFlags["Undefined"] = 32] = "Undefined";
|
|
TypeFlags[TypeFlags["Null"] = 64] = "Null";
|
|
TypeFlags[TypeFlags["Enum"] = 128] = "Enum";
|
|
TypeFlags[TypeFlags["StringLiteral"] = 256] = "StringLiteral";
|
|
TypeFlags[TypeFlags["TypeParameter"] = 512] = "TypeParameter";
|
|
TypeFlags[TypeFlags["Class"] = 1024] = "Class";
|
|
TypeFlags[TypeFlags["Interface"] = 2048] = "Interface";
|
|
TypeFlags[TypeFlags["Reference"] = 4096] = "Reference";
|
|
TypeFlags[TypeFlags["Tuple"] = 8192] = "Tuple";
|
|
TypeFlags[TypeFlags["Union"] = 16384] = "Union";
|
|
TypeFlags[TypeFlags["Intersection"] = 32768] = "Intersection";
|
|
TypeFlags[TypeFlags["Anonymous"] = 65536] = "Anonymous";
|
|
TypeFlags[TypeFlags["Instantiated"] = 131072] = "Instantiated";
|
|
/* @internal */
|
|
TypeFlags[TypeFlags["FromSignature"] = 262144] = "FromSignature";
|
|
TypeFlags[TypeFlags["ObjectLiteral"] = 524288] = "ObjectLiteral";
|
|
/* @internal */
|
|
TypeFlags[TypeFlags["ContainsUndefinedOrNull"] = 1048576] = "ContainsUndefinedOrNull";
|
|
/* @internal */
|
|
TypeFlags[TypeFlags["ContainsObjectLiteral"] = 2097152] = "ContainsObjectLiteral";
|
|
TypeFlags[TypeFlags["ESSymbol"] = 4194304] = "ESSymbol";
|
|
/* @internal */
|
|
TypeFlags[TypeFlags["Intrinsic"] = 4194431] = "Intrinsic";
|
|
/* @internal */
|
|
TypeFlags[TypeFlags["Primitive"] = 4194814] = "Primitive";
|
|
TypeFlags[TypeFlags["StringLike"] = 258] = "StringLike";
|
|
TypeFlags[TypeFlags["NumberLike"] = 132] = "NumberLike";
|
|
TypeFlags[TypeFlags["ObjectType"] = 80896] = "ObjectType";
|
|
TypeFlags[TypeFlags["UnionOrIntersection"] = 49152] = "UnionOrIntersection";
|
|
TypeFlags[TypeFlags["StructuredType"] = 130048] = "StructuredType";
|
|
/* @internal */
|
|
TypeFlags[TypeFlags["RequiresWidening"] = 3145728] = "RequiresWidening";
|
|
})(ts.TypeFlags || (ts.TypeFlags = {}));
|
|
var TypeFlags = ts.TypeFlags;
|
|
(function (SignatureKind) {
|
|
SignatureKind[SignatureKind["Call"] = 0] = "Call";
|
|
SignatureKind[SignatureKind["Construct"] = 1] = "Construct";
|
|
})(ts.SignatureKind || (ts.SignatureKind = {}));
|
|
var SignatureKind = ts.SignatureKind;
|
|
(function (IndexKind) {
|
|
IndexKind[IndexKind["String"] = 0] = "String";
|
|
IndexKind[IndexKind["Number"] = 1] = "Number";
|
|
})(ts.IndexKind || (ts.IndexKind = {}));
|
|
var IndexKind = ts.IndexKind;
|
|
(function (DiagnosticCategory) {
|
|
DiagnosticCategory[DiagnosticCategory["Warning"] = 0] = "Warning";
|
|
DiagnosticCategory[DiagnosticCategory["Error"] = 1] = "Error";
|
|
DiagnosticCategory[DiagnosticCategory["Message"] = 2] = "Message";
|
|
})(ts.DiagnosticCategory || (ts.DiagnosticCategory = {}));
|
|
var DiagnosticCategory = ts.DiagnosticCategory;
|
|
(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";
|
|
})(ts.ModuleKind || (ts.ModuleKind = {}));
|
|
var ModuleKind = ts.ModuleKind;
|
|
(function (JsxEmit) {
|
|
JsxEmit[JsxEmit["None"] = 0] = "None";
|
|
JsxEmit[JsxEmit["Preserve"] = 1] = "Preserve";
|
|
JsxEmit[JsxEmit["React"] = 2] = "React";
|
|
})(ts.JsxEmit || (ts.JsxEmit = {}));
|
|
var JsxEmit = ts.JsxEmit;
|
|
(function (NewLineKind) {
|
|
NewLineKind[NewLineKind["CarriageReturnLineFeed"] = 0] = "CarriageReturnLineFeed";
|
|
NewLineKind[NewLineKind["LineFeed"] = 1] = "LineFeed";
|
|
})(ts.NewLineKind || (ts.NewLineKind = {}));
|
|
var NewLineKind = ts.NewLineKind;
|
|
(function (ScriptTarget) {
|
|
ScriptTarget[ScriptTarget["ES3"] = 0] = "ES3";
|
|
ScriptTarget[ScriptTarget["ES5"] = 1] = "ES5";
|
|
ScriptTarget[ScriptTarget["ES6"] = 2] = "ES6";
|
|
ScriptTarget[ScriptTarget["Latest"] = 2] = "Latest";
|
|
})(ts.ScriptTarget || (ts.ScriptTarget = {}));
|
|
var ScriptTarget = ts.ScriptTarget;
|
|
(function (LanguageVariant) {
|
|
LanguageVariant[LanguageVariant["Standard"] = 0] = "Standard";
|
|
LanguageVariant[LanguageVariant["JSX"] = 1] = "JSX";
|
|
})(ts.LanguageVariant || (ts.LanguageVariant = {}));
|
|
var LanguageVariant = ts.LanguageVariant;
|
|
/* @internal */
|
|
(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";
|
|
})(ts.CharacterCodes || (ts.CharacterCodes = {}));
|
|
var CharacterCodes = ts.CharacterCodes;
|
|
})(ts || (ts = {}));
|
|
/// <reference path="types.ts"/>
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
/**
|
|
* Ternary values are defined such that
|
|
* x & y is False if either x or y is False.
|
|
* x & y is Maybe if either x or y is Maybe, but neither x or y is False.
|
|
* x & y is True if both x and y are True.
|
|
* x | y is False if both x and y are False.
|
|
* x | y is Maybe if either x or y is Maybe, but neither x or y is True.
|
|
* x | y is True if either x or y is True.
|
|
*/
|
|
(function (Ternary) {
|
|
Ternary[Ternary["False"] = 0] = "False";
|
|
Ternary[Ternary["Maybe"] = 1] = "Maybe";
|
|
Ternary[Ternary["True"] = -1] = "True";
|
|
})(ts.Ternary || (ts.Ternary = {}));
|
|
var Ternary = ts.Ternary;
|
|
function createFileMap(getCanonicalFileName) {
|
|
var files = {};
|
|
return {
|
|
get: get,
|
|
set: set,
|
|
contains: contains,
|
|
remove: remove,
|
|
forEachValue: forEachValueInMap
|
|
};
|
|
function set(fileName, value) {
|
|
files[normalizeKey(fileName)] = value;
|
|
}
|
|
function get(fileName) {
|
|
return files[normalizeKey(fileName)];
|
|
}
|
|
function contains(fileName) {
|
|
return hasProperty(files, normalizeKey(fileName));
|
|
}
|
|
function remove(fileName) {
|
|
var key = normalizeKey(fileName);
|
|
delete files[key];
|
|
}
|
|
function forEachValueInMap(f) {
|
|
forEachValue(files, f);
|
|
}
|
|
function normalizeKey(key) {
|
|
return getCanonicalFileName(normalizeSlashes(key));
|
|
}
|
|
}
|
|
ts.createFileMap = createFileMap;
|
|
(function (Comparison) {
|
|
Comparison[Comparison["LessThan"] = -1] = "LessThan";
|
|
Comparison[Comparison["EqualTo"] = 0] = "EqualTo";
|
|
Comparison[Comparison["GreaterThan"] = 1] = "GreaterThan";
|
|
})(ts.Comparison || (ts.Comparison = {}));
|
|
var Comparison = ts.Comparison;
|
|
/**
|
|
* 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, len = array.length; i < len; i++) {
|
|
var result = callback(array[i], i);
|
|
if (result) {
|
|
return result;
|
|
}
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
ts.forEach = forEach;
|
|
function contains(array, value) {
|
|
if (array) {
|
|
for (var _i = 0; _i < array.length; _i++) {
|
|
var v = array[_i];
|
|
if (v === value) {
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
ts.contains = contains;
|
|
function indexOf(array, value) {
|
|
if (array) {
|
|
for (var i = 0, len = array.length; i < len; i++) {
|
|
if (array[i] === value) {
|
|
return i;
|
|
}
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
ts.indexOf = indexOf;
|
|
function countWhere(array, predicate) {
|
|
var count = 0;
|
|
if (array) {
|
|
for (var _i = 0; _i < array.length; _i++) {
|
|
var v = array[_i];
|
|
if (predicate(v)) {
|
|
count++;
|
|
}
|
|
}
|
|
}
|
|
return count;
|
|
}
|
|
ts.countWhere = countWhere;
|
|
function filter(array, f) {
|
|
var result;
|
|
if (array) {
|
|
result = [];
|
|
for (var _i = 0; _i < array.length; _i++) {
|
|
var item = array[_i];
|
|
if (f(item)) {
|
|
result.push(item);
|
|
}
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
ts.filter = filter;
|
|
function map(array, f) {
|
|
var result;
|
|
if (array) {
|
|
result = [];
|
|
for (var _i = 0; _i < array.length; _i++) {
|
|
var v = array[_i];
|
|
result.push(f(v));
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
ts.map = map;
|
|
function concatenate(array1, array2) {
|
|
if (!array2 || !array2.length)
|
|
return array1;
|
|
if (!array1 || !array1.length)
|
|
return array2;
|
|
return array1.concat(array2);
|
|
}
|
|
ts.concatenate = concatenate;
|
|
function deduplicate(array) {
|
|
var result;
|
|
if (array) {
|
|
result = [];
|
|
for (var _i = 0; _i < array.length; _i++) {
|
|
var item = array[_i];
|
|
if (!contains(result, item)) {
|
|
result.push(item);
|
|
}
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
ts.deduplicate = deduplicate;
|
|
function sum(array, prop) {
|
|
var result = 0;
|
|
for (var _i = 0; _i < array.length; _i++) {
|
|
var v = array[_i];
|
|
result += v[prop];
|
|
}
|
|
return result;
|
|
}
|
|
ts.sum = sum;
|
|
function addRange(to, from) {
|
|
if (to && from) {
|
|
for (var _i = 0; _i < from.length; _i++) {
|
|
var v = from[_i];
|
|
to.push(v);
|
|
}
|
|
}
|
|
}
|
|
ts.addRange = addRange;
|
|
function rangeEquals(array1, array2, pos, end) {
|
|
while (pos < end) {
|
|
if (array1[pos] !== array2[pos]) {
|
|
return false;
|
|
}
|
|
pos++;
|
|
}
|
|
return true;
|
|
}
|
|
ts.rangeEquals = rangeEquals;
|
|
/**
|
|
* Returns the last element of an array if non-empty, undefined otherwise.
|
|
*/
|
|
function lastOrUndefined(array) {
|
|
if (array.length === 0) {
|
|
return undefined;
|
|
}
|
|
return array[array.length - 1];
|
|
}
|
|
ts.lastOrUndefined = lastOrUndefined;
|
|
function binarySearch(array, value) {
|
|
var low = 0;
|
|
var high = array.length - 1;
|
|
while (low <= high) {
|
|
var middle = low + ((high - low) >> 1);
|
|
var midValue = array[middle];
|
|
if (midValue === value) {
|
|
return middle;
|
|
}
|
|
else if (midValue > value) {
|
|
high = middle - 1;
|
|
}
|
|
else {
|
|
low = middle + 1;
|
|
}
|
|
}
|
|
return ~low;
|
|
}
|
|
ts.binarySearch = binarySearch;
|
|
function reduceLeft(array, f, initial) {
|
|
if (array) {
|
|
var count = array.length;
|
|
if (count > 0) {
|
|
var pos = 0;
|
|
var result = arguments.length <= 2 ? array[pos++] : initial;
|
|
while (pos < count) {
|
|
result = f(result, array[pos++]);
|
|
}
|
|
return result;
|
|
}
|
|
}
|
|
return initial;
|
|
}
|
|
ts.reduceLeft = reduceLeft;
|
|
function reduceRight(array, f, initial) {
|
|
if (array) {
|
|
var pos = array.length - 1;
|
|
if (pos >= 0) {
|
|
var result = arguments.length <= 2 ? array[pos--] : initial;
|
|
while (pos >= 0) {
|
|
result = f(result, array[pos--]);
|
|
}
|
|
return result;
|
|
}
|
|
}
|
|
return initial;
|
|
}
|
|
ts.reduceRight = reduceRight;
|
|
var hasOwnProperty = Object.prototype.hasOwnProperty;
|
|
function hasProperty(map, key) {
|
|
return hasOwnProperty.call(map, key);
|
|
}
|
|
ts.hasProperty = hasProperty;
|
|
function getProperty(map, key) {
|
|
return hasOwnProperty.call(map, key) ? map[key] : undefined;
|
|
}
|
|
ts.getProperty = getProperty;
|
|
function isEmpty(map) {
|
|
for (var id in map) {
|
|
if (hasProperty(map, id)) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
ts.isEmpty = isEmpty;
|
|
function clone(object) {
|
|
var result = {};
|
|
for (var id in object) {
|
|
result[id] = object[id];
|
|
}
|
|
return result;
|
|
}
|
|
ts.clone = clone;
|
|
function extend(first, second) {
|
|
var result = {};
|
|
for (var id in first) {
|
|
result[id] = first[id];
|
|
}
|
|
for (var id in second) {
|
|
if (!hasProperty(result, id)) {
|
|
result[id] = second[id];
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
ts.extend = extend;
|
|
function forEachValue(map, callback) {
|
|
var result;
|
|
for (var id in map) {
|
|
if (result = callback(map[id]))
|
|
break;
|
|
}
|
|
return result;
|
|
}
|
|
ts.forEachValue = forEachValue;
|
|
function forEachKey(map, callback) {
|
|
var result;
|
|
for (var id in map) {
|
|
if (result = callback(id))
|
|
break;
|
|
}
|
|
return result;
|
|
}
|
|
ts.forEachKey = forEachKey;
|
|
function lookUp(map, key) {
|
|
return hasProperty(map, key) ? map[key] : undefined;
|
|
}
|
|
ts.lookUp = lookUp;
|
|
function copyMap(source, target) {
|
|
for (var p in source) {
|
|
target[p] = source[p];
|
|
}
|
|
}
|
|
ts.copyMap = copyMap;
|
|
/**
|
|
* Creates a map from the elements of an array.
|
|
*
|
|
* @param array the array of input elements.
|
|
* @param makeKey a function that produces a key for a given element.
|
|
*
|
|
* This function makes no effort to avoid collisions; if any two elements produce
|
|
* the same key with the given 'makeKey' function, then the element with the higher
|
|
* index in the array will be the one associated with the produced key.
|
|
*/
|
|
function arrayToMap(array, makeKey) {
|
|
var result = {};
|
|
forEach(array, function (value) {
|
|
result[makeKey(value)] = value;
|
|
});
|
|
return result;
|
|
}
|
|
ts.arrayToMap = arrayToMap;
|
|
function memoize(callback) {
|
|
var value;
|
|
return function () {
|
|
if (callback) {
|
|
value = callback();
|
|
callback = undefined;
|
|
}
|
|
return value;
|
|
};
|
|
}
|
|
ts.memoize = memoize;
|
|
function formatStringFromArgs(text, args, baseIndex) {
|
|
baseIndex = baseIndex || 0;
|
|
return text.replace(/{(\d+)}/g, function (match, index) { return args[+index + baseIndex]; });
|
|
}
|
|
ts.localizedDiagnosticMessages = undefined;
|
|
function getLocaleSpecificMessage(message) {
|
|
return ts.localizedDiagnosticMessages && ts.localizedDiagnosticMessages[message]
|
|
? ts.localizedDiagnosticMessages[message]
|
|
: message;
|
|
}
|
|
ts.getLocaleSpecificMessage = getLocaleSpecificMessage;
|
|
function createFileDiagnostic(file, start, length, message) {
|
|
var end = start + length;
|
|
Debug.assert(start >= 0, "start must be non-negative, is " + start);
|
|
Debug.assert(length >= 0, "length must be non-negative, is " + length);
|
|
if (file) {
|
|
Debug.assert(start <= file.text.length, "start must be within the bounds of the file. " + start + " > " + file.text.length);
|
|
Debug.assert(end <= file.text.length, "end must be the bounds of the file. " + end + " > " + file.text.length);
|
|
}
|
|
var text = getLocaleSpecificMessage(message.key);
|
|
if (arguments.length > 4) {
|
|
text = formatStringFromArgs(text, arguments, 4);
|
|
}
|
|
return {
|
|
file: file,
|
|
start: start,
|
|
length: length,
|
|
messageText: text,
|
|
category: message.category,
|
|
code: message.code
|
|
};
|
|
}
|
|
ts.createFileDiagnostic = createFileDiagnostic;
|
|
function createCompilerDiagnostic(message) {
|
|
var text = getLocaleSpecificMessage(message.key);
|
|
if (arguments.length > 1) {
|
|
text = formatStringFromArgs(text, arguments, 1);
|
|
}
|
|
return {
|
|
file: undefined,
|
|
start: undefined,
|
|
length: undefined,
|
|
messageText: text,
|
|
category: message.category,
|
|
code: message.code
|
|
};
|
|
}
|
|
ts.createCompilerDiagnostic = createCompilerDiagnostic;
|
|
function chainDiagnosticMessages(details, message) {
|
|
var text = getLocaleSpecificMessage(message.key);
|
|
if (arguments.length > 2) {
|
|
text = formatStringFromArgs(text, arguments, 2);
|
|
}
|
|
return {
|
|
messageText: text,
|
|
category: message.category,
|
|
code: message.code,
|
|
next: details
|
|
};
|
|
}
|
|
ts.chainDiagnosticMessages = chainDiagnosticMessages;
|
|
function concatenateDiagnosticMessageChains(headChain, tailChain) {
|
|
Debug.assert(!headChain.next);
|
|
headChain.next = tailChain;
|
|
return headChain;
|
|
}
|
|
ts.concatenateDiagnosticMessageChains = concatenateDiagnosticMessageChains;
|
|
function compareValues(a, b) {
|
|
if (a === b)
|
|
return 0 /* EqualTo */;
|
|
if (a === undefined)
|
|
return -1 /* LessThan */;
|
|
if (b === undefined)
|
|
return 1 /* GreaterThan */;
|
|
return a < b ? -1 /* LessThan */ : 1 /* GreaterThan */;
|
|
}
|
|
ts.compareValues = compareValues;
|
|
function getDiagnosticFileName(diagnostic) {
|
|
return diagnostic.file ? diagnostic.file.fileName : undefined;
|
|
}
|
|
function compareDiagnostics(d1, d2) {
|
|
return compareValues(getDiagnosticFileName(d1), getDiagnosticFileName(d2)) ||
|
|
compareValues(d1.start, d2.start) ||
|
|
compareValues(d1.length, d2.length) ||
|
|
compareValues(d1.code, d2.code) ||
|
|
compareMessageText(d1.messageText, d2.messageText) ||
|
|
0 /* EqualTo */;
|
|
}
|
|
ts.compareDiagnostics = compareDiagnostics;
|
|
function compareMessageText(text1, text2) {
|
|
while (text1 && text2) {
|
|
// We still have both chains.
|
|
var string1 = typeof text1 === "string" ? text1 : text1.messageText;
|
|
var string2 = typeof text2 === "string" ? text2 : text2.messageText;
|
|
var res = compareValues(string1, string2);
|
|
if (res) {
|
|
return res;
|
|
}
|
|
text1 = typeof text1 === "string" ? undefined : text1.next;
|
|
text2 = typeof text2 === "string" ? undefined : text2.next;
|
|
}
|
|
if (!text1 && !text2) {
|
|
// if the chains are done, then these messages are the same.
|
|
return 0 /* EqualTo */;
|
|
}
|
|
// We still have one chain remaining. The shorter chain should come first.
|
|
return text1 ? 1 /* GreaterThan */ : -1 /* LessThan */;
|
|
}
|
|
function sortAndDeduplicateDiagnostics(diagnostics) {
|
|
return deduplicateSortedDiagnostics(diagnostics.sort(compareDiagnostics));
|
|
}
|
|
ts.sortAndDeduplicateDiagnostics = sortAndDeduplicateDiagnostics;
|
|
function deduplicateSortedDiagnostics(diagnostics) {
|
|
if (diagnostics.length < 2) {
|
|
return diagnostics;
|
|
}
|
|
var newDiagnostics = [diagnostics[0]];
|
|
var previousDiagnostic = diagnostics[0];
|
|
for (var i = 1; i < diagnostics.length; i++) {
|
|
var currentDiagnostic = diagnostics[i];
|
|
var isDupe = compareDiagnostics(currentDiagnostic, previousDiagnostic) === 0 /* EqualTo */;
|
|
if (!isDupe) {
|
|
newDiagnostics.push(currentDiagnostic);
|
|
previousDiagnostic = currentDiagnostic;
|
|
}
|
|
}
|
|
return newDiagnostics;
|
|
}
|
|
ts.deduplicateSortedDiagnostics = deduplicateSortedDiagnostics;
|
|
function normalizeSlashes(path) {
|
|
return path.replace(/\\/g, "/");
|
|
}
|
|
ts.normalizeSlashes = normalizeSlashes;
|
|
// Returns length of path root (i.e. length of "/", "x:/", "//server/share/, file:///user/files")
|
|
function getRootLength(path) {
|
|
if (path.charCodeAt(0) === 47 /* slash */) {
|
|
if (path.charCodeAt(1) !== 47 /* slash */)
|
|
return 1;
|
|
var p1 = path.indexOf("/", 2);
|
|
if (p1 < 0)
|
|
return 2;
|
|
var p2 = path.indexOf("/", p1 + 1);
|
|
if (p2 < 0)
|
|
return p1 + 1;
|
|
return p2 + 1;
|
|
}
|
|
if (path.charCodeAt(1) === 58 /* colon */) {
|
|
if (path.charCodeAt(2) === 47 /* slash */)
|
|
return 3;
|
|
return 2;
|
|
}
|
|
// Per RFC 1738 'file' URI schema has the shape file://<host>/<path>
|
|
// if <host> is omitted then it is assumed that host value is 'localhost',
|
|
// however slash after the omitted <host> is not removed.
|
|
// file:///folder1/file1 - this is a correct URI
|
|
// file://folder2/file2 - this is an incorrect URI
|
|
if (path.lastIndexOf("file:///", 0) === 0) {
|
|
return "file:///".length;
|
|
}
|
|
var idx = path.indexOf('://');
|
|
if (idx !== -1) {
|
|
return idx + "://".length;
|
|
}
|
|
return 0;
|
|
}
|
|
ts.getRootLength = getRootLength;
|
|
ts.directorySeparator = "/";
|
|
function getNormalizedParts(normalizedSlashedPath, rootLength) {
|
|
var parts = normalizedSlashedPath.substr(rootLength).split(ts.directorySeparator);
|
|
var normalized = [];
|
|
for (var _i = 0; _i < parts.length; _i++) {
|
|
var part = parts[_i];
|
|
if (part !== ".") {
|
|
if (part === ".." && normalized.length > 0 && lastOrUndefined(normalized) !== "..") {
|
|
normalized.pop();
|
|
}
|
|
else {
|
|
// A part may be an empty string (which is 'falsy') if the path had consecutive slashes,
|
|
// e.g. "path//file.ts". Drop these before re-joining the parts.
|
|
if (part) {
|
|
normalized.push(part);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return normalized;
|
|
}
|
|
function normalizePath(path) {
|
|
path = normalizeSlashes(path);
|
|
var rootLength = getRootLength(path);
|
|
var normalized = getNormalizedParts(path, rootLength);
|
|
return path.substr(0, rootLength) + normalized.join(ts.directorySeparator);
|
|
}
|
|
ts.normalizePath = normalizePath;
|
|
function getDirectoryPath(path) {
|
|
return path.substr(0, Math.max(getRootLength(path), path.lastIndexOf(ts.directorySeparator)));
|
|
}
|
|
ts.getDirectoryPath = getDirectoryPath;
|
|
function isUrl(path) {
|
|
return path && !isRootedDiskPath(path) && path.indexOf("://") !== -1;
|
|
}
|
|
ts.isUrl = isUrl;
|
|
function isRootedDiskPath(path) {
|
|
return getRootLength(path) !== 0;
|
|
}
|
|
ts.isRootedDiskPath = isRootedDiskPath;
|
|
function normalizedPathComponents(path, rootLength) {
|
|
var normalizedParts = getNormalizedParts(path, rootLength);
|
|
return [path.substr(0, rootLength)].concat(normalizedParts);
|
|
}
|
|
function getNormalizedPathComponents(path, currentDirectory) {
|
|
path = normalizeSlashes(path);
|
|
var rootLength = getRootLength(path);
|
|
if (rootLength === 0) {
|
|
// If the path is not rooted it is relative to current directory
|
|
path = combinePaths(normalizeSlashes(currentDirectory), path);
|
|
rootLength = getRootLength(path);
|
|
}
|
|
return normalizedPathComponents(path, rootLength);
|
|
}
|
|
ts.getNormalizedPathComponents = getNormalizedPathComponents;
|
|
function getNormalizedAbsolutePath(fileName, currentDirectory) {
|
|
return getNormalizedPathFromPathComponents(getNormalizedPathComponents(fileName, currentDirectory));
|
|
}
|
|
ts.getNormalizedAbsolutePath = getNormalizedAbsolutePath;
|
|
function getNormalizedPathFromPathComponents(pathComponents) {
|
|
if (pathComponents && pathComponents.length) {
|
|
return pathComponents[0] + pathComponents.slice(1).join(ts.directorySeparator);
|
|
}
|
|
}
|
|
ts.getNormalizedPathFromPathComponents = getNormalizedPathFromPathComponents;
|
|
function getNormalizedPathComponentsOfUrl(url) {
|
|
// Get root length of http://www.website.com/folder1/foler2/
|
|
// In this example the root is: http://www.website.com/
|
|
// normalized path components should be ["http://www.website.com/", "folder1", "folder2"]
|
|
var urlLength = url.length;
|
|
// Initial root length is http:// part
|
|
var rootLength = url.indexOf("://") + "://".length;
|
|
while (rootLength < urlLength) {
|
|
// Consume all immediate slashes in the protocol
|
|
// eg.initial rootlength is just file:// but it needs to consume another "/" in file:///
|
|
if (url.charCodeAt(rootLength) === 47 /* slash */) {
|
|
rootLength++;
|
|
}
|
|
else {
|
|
// non slash character means we continue proceeding to next component of root search
|
|
break;
|
|
}
|
|
}
|
|
// there are no parts after http:// just return current string as the pathComponent
|
|
if (rootLength === urlLength) {
|
|
return [url];
|
|
}
|
|
// Find the index of "/" after website.com so the root can be http://www.website.com/ (from existing http://)
|
|
var indexOfNextSlash = url.indexOf(ts.directorySeparator, rootLength);
|
|
if (indexOfNextSlash !== -1) {
|
|
// Found the "/" after the website.com so the root is length of http://www.website.com/
|
|
// and get components afetr the root normally like any other folder components
|
|
rootLength = indexOfNextSlash + 1;
|
|
return normalizedPathComponents(url, rootLength);
|
|
}
|
|
else {
|
|
// Can't find the host assume the rest of the string as component
|
|
// but make sure we append "/" to it as root is not joined using "/"
|
|
// eg. if url passed in was http://website.com we want to use root as [http://website.com/]
|
|
// so that other path manipulations will be correct and it can be merged with relative paths correctly
|
|
return [url + ts.directorySeparator];
|
|
}
|
|
}
|
|
function getNormalizedPathOrUrlComponents(pathOrUrl, currentDirectory) {
|
|
if (isUrl(pathOrUrl)) {
|
|
return getNormalizedPathComponentsOfUrl(pathOrUrl);
|
|
}
|
|
else {
|
|
return getNormalizedPathComponents(pathOrUrl, currentDirectory);
|
|
}
|
|
}
|
|
function getRelativePathToDirectoryOrUrl(directoryPathOrUrl, relativeOrAbsolutePath, currentDirectory, getCanonicalFileName, isAbsolutePathAnUrl) {
|
|
var pathComponents = getNormalizedPathOrUrlComponents(relativeOrAbsolutePath, currentDirectory);
|
|
var directoryComponents = getNormalizedPathOrUrlComponents(directoryPathOrUrl, currentDirectory);
|
|
if (directoryComponents.length > 1 && lastOrUndefined(directoryComponents) === "") {
|
|
// If the directory path given was of type test/cases/ then we really need components of directory to be only till its name
|
|
// that is ["test", "cases", ""] needs to be actually ["test", "cases"]
|
|
directoryComponents.length--;
|
|
}
|
|
// Find the component that differs
|
|
for (var joinStartIndex = 0; joinStartIndex < pathComponents.length && joinStartIndex < directoryComponents.length; joinStartIndex++) {
|
|
if (getCanonicalFileName(directoryComponents[joinStartIndex]) !== getCanonicalFileName(pathComponents[joinStartIndex])) {
|
|
break;
|
|
}
|
|
}
|
|
// Get the relative path
|
|
if (joinStartIndex) {
|
|
var relativePath = "";
|
|
var relativePathComponents = pathComponents.slice(joinStartIndex, pathComponents.length);
|
|
for (; joinStartIndex < directoryComponents.length; joinStartIndex++) {
|
|
if (directoryComponents[joinStartIndex] !== "") {
|
|
relativePath = relativePath + ".." + ts.directorySeparator;
|
|
}
|
|
}
|
|
return relativePath + relativePathComponents.join(ts.directorySeparator);
|
|
}
|
|
// Cant find the relative path, get the absolute path
|
|
var absolutePath = getNormalizedPathFromPathComponents(pathComponents);
|
|
if (isAbsolutePathAnUrl && isRootedDiskPath(absolutePath)) {
|
|
absolutePath = "file:///" + absolutePath;
|
|
}
|
|
return absolutePath;
|
|
}
|
|
ts.getRelativePathToDirectoryOrUrl = getRelativePathToDirectoryOrUrl;
|
|
function getBaseFileName(path) {
|
|
var i = path.lastIndexOf(ts.directorySeparator);
|
|
return i < 0 ? path : path.substring(i + 1);
|
|
}
|
|
ts.getBaseFileName = getBaseFileName;
|
|
function combinePaths(path1, path2) {
|
|
if (!(path1 && path1.length))
|
|
return path2;
|
|
if (!(path2 && path2.length))
|
|
return path1;
|
|
if (getRootLength(path2) !== 0)
|
|
return path2;
|
|
if (path1.charAt(path1.length - 1) === ts.directorySeparator)
|
|
return path1 + path2;
|
|
return path1 + ts.directorySeparator + path2;
|
|
}
|
|
ts.combinePaths = combinePaths;
|
|
function fileExtensionIs(path, extension) {
|
|
var pathLen = path.length;
|
|
var extLen = extension.length;
|
|
return pathLen > extLen && path.substr(pathLen - extLen, extLen) === extension;
|
|
}
|
|
ts.fileExtensionIs = fileExtensionIs;
|
|
/**
|
|
* List of supported extensions in order of file resolution precedence.
|
|
*/
|
|
ts.supportedExtensions = [".tsx", ".ts", ".d.ts"];
|
|
var extensionsToRemove = [".d.ts", ".ts", ".js", ".tsx", ".jsx"];
|
|
function removeFileExtension(path) {
|
|
for (var _i = 0; _i < extensionsToRemove.length; _i++) {
|
|
var ext = extensionsToRemove[_i];
|
|
if (fileExtensionIs(path, ext)) {
|
|
return path.substr(0, path.length - ext.length);
|
|
}
|
|
}
|
|
return path;
|
|
}
|
|
ts.removeFileExtension = removeFileExtension;
|
|
var backslashOrDoubleQuote = /[\"\\]/g;
|
|
var escapedCharsRegExp = /[\u0000-\u001f\t\v\f\b\r\n\u2028\u2029\u0085]/g;
|
|
var escapedCharsMap = {
|
|
"\0": "\\0",
|
|
"\t": "\\t",
|
|
"\v": "\\v",
|
|
"\f": "\\f",
|
|
"\b": "\\b",
|
|
"\r": "\\r",
|
|
"\n": "\\n",
|
|
"\\": "\\\\",
|
|
"\"": "\\\"",
|
|
"\u2028": "\\u2028",
|
|
"\u2029": "\\u2029",
|
|
"\u0085": "\\u0085" // nextLine
|
|
};
|
|
function Symbol(flags, name) {
|
|
this.flags = flags;
|
|
this.name = name;
|
|
this.declarations = undefined;
|
|
}
|
|
function Type(checker, flags) {
|
|
this.flags = flags;
|
|
}
|
|
function Signature(checker) {
|
|
}
|
|
ts.objectAllocator = {
|
|
getNodeConstructor: function (kind) {
|
|
function Node() {
|
|
}
|
|
Node.prototype = {
|
|
kind: kind,
|
|
pos: -1,
|
|
end: -1,
|
|
flags: 0,
|
|
parent: undefined
|
|
};
|
|
return Node;
|
|
},
|
|
getSymbolConstructor: function () { return Symbol; },
|
|
getTypeConstructor: function () { return Type; },
|
|
getSignatureConstructor: function () { return Signature; }
|
|
};
|
|
(function (AssertionLevel) {
|
|
AssertionLevel[AssertionLevel["None"] = 0] = "None";
|
|
AssertionLevel[AssertionLevel["Normal"] = 1] = "Normal";
|
|
AssertionLevel[AssertionLevel["Aggressive"] = 2] = "Aggressive";
|
|
AssertionLevel[AssertionLevel["VeryAggressive"] = 3] = "VeryAggressive";
|
|
})(ts.AssertionLevel || (ts.AssertionLevel = {}));
|
|
var AssertionLevel = ts.AssertionLevel;
|
|
var Debug;
|
|
(function (Debug) {
|
|
var currentAssertionLevel = 0 /* None */;
|
|
function shouldAssert(level) {
|
|
return currentAssertionLevel >= level;
|
|
}
|
|
Debug.shouldAssert = shouldAssert;
|
|
function assert(expression, message, verboseDebugInfo) {
|
|
if (!expression) {
|
|
var verboseDebugString = "";
|
|
if (verboseDebugInfo) {
|
|
verboseDebugString = "\r\nVerbose Debug Information: " + verboseDebugInfo();
|
|
}
|
|
throw new Error("Debug Failure. False expression: " + (message || "") + verboseDebugString);
|
|
}
|
|
}
|
|
Debug.assert = assert;
|
|
function fail(message) {
|
|
Debug.assert(false, message);
|
|
}
|
|
Debug.fail = fail;
|
|
})(Debug = ts.Debug || (ts.Debug = {}));
|
|
})(ts || (ts = {}));
|
|
/// <reference path="core.ts"/>
|
|
var ts;
|
|
(function (ts) {
|
|
ts.sys = (function () {
|
|
function getWScriptSystem() {
|
|
var fso = new ActiveXObject("Scripting.FileSystemObject");
|
|
var fileStream = new ActiveXObject("ADODB.Stream");
|
|
fileStream.Type = 2 /*text*/;
|
|
var binaryStream = new ActiveXObject("ADODB.Stream");
|
|
binaryStream.Type = 1 /*binary*/;
|
|
var args = [];
|
|
for (var i = 0; i < WScript.Arguments.length; i++) {
|
|
args[i] = WScript.Arguments.Item(i);
|
|
}
|
|
function readFile(fileName, encoding) {
|
|
if (!fso.FileExists(fileName)) {
|
|
return undefined;
|
|
}
|
|
fileStream.Open();
|
|
try {
|
|
if (encoding) {
|
|
fileStream.Charset = encoding;
|
|
fileStream.LoadFromFile(fileName);
|
|
}
|
|
else {
|
|
// Load file and read the first two bytes into a string with no interpretation
|
|
fileStream.Charset = "x-ansi";
|
|
fileStream.LoadFromFile(fileName);
|
|
var bom = fileStream.ReadText(2) || "";
|
|
// Position must be at 0 before encoding can be changed
|
|
fileStream.Position = 0;
|
|
// [0xFF,0xFE] and [0xFE,0xFF] mean utf-16 (little or big endian), otherwise default to utf-8
|
|
fileStream.Charset = bom.length >= 2 && (bom.charCodeAt(0) === 0xFF && bom.charCodeAt(1) === 0xFE || bom.charCodeAt(0) === 0xFE && bom.charCodeAt(1) === 0xFF) ? "unicode" : "utf-8";
|
|
}
|
|
// ReadText method always strips byte order mark from resulting string
|
|
return fileStream.ReadText();
|
|
}
|
|
catch (e) {
|
|
throw e;
|
|
}
|
|
finally {
|
|
fileStream.Close();
|
|
}
|
|
}
|
|
function writeFile(fileName, data, writeByteOrderMark) {
|
|
fileStream.Open();
|
|
binaryStream.Open();
|
|
try {
|
|
// Write characters in UTF-8 encoding
|
|
fileStream.Charset = "utf-8";
|
|
fileStream.WriteText(data);
|
|
// If we don't want the BOM, then skip it by setting the starting location to 3 (size of BOM).
|
|
// If not, start from position 0, as the BOM will be added automatically when charset==utf8.
|
|
if (writeByteOrderMark) {
|
|
fileStream.Position = 0;
|
|
}
|
|
else {
|
|
fileStream.Position = 3;
|
|
}
|
|
fileStream.CopyTo(binaryStream);
|
|
binaryStream.SaveToFile(fileName, 2 /*overwrite*/);
|
|
}
|
|
finally {
|
|
binaryStream.Close();
|
|
fileStream.Close();
|
|
}
|
|
}
|
|
function getCanonicalPath(path) {
|
|
return path.toLowerCase();
|
|
}
|
|
function getNames(collection) {
|
|
var result = [];
|
|
for (var e = new Enumerator(collection); !e.atEnd(); e.moveNext()) {
|
|
result.push(e.item().Name);
|
|
}
|
|
return result.sort();
|
|
}
|
|
function readDirectory(path, extension, exclude) {
|
|
var result = [];
|
|
exclude = ts.map(exclude, function (s) { return getCanonicalPath(ts.combinePaths(path, s)); });
|
|
visitDirectory(path);
|
|
return result;
|
|
function visitDirectory(path) {
|
|
var folder = fso.GetFolder(path || ".");
|
|
var files = getNames(folder.files);
|
|
for (var _i = 0; _i < files.length; _i++) {
|
|
var current = files[_i];
|
|
var name_1 = ts.combinePaths(path, current);
|
|
if ((!extension || ts.fileExtensionIs(name_1, extension)) && !ts.contains(exclude, getCanonicalPath(name_1))) {
|
|
result.push(name_1);
|
|
}
|
|
}
|
|
var subfolders = getNames(folder.subfolders);
|
|
for (var _a = 0; _a < subfolders.length; _a++) {
|
|
var current = subfolders[_a];
|
|
var name_2 = ts.combinePaths(path, current);
|
|
if (!ts.contains(exclude, getCanonicalPath(name_2))) {
|
|
visitDirectory(name_2);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return {
|
|
args: args,
|
|
newLine: "\r\n",
|
|
useCaseSensitiveFileNames: false,
|
|
write: function (s) {
|
|
WScript.StdOut.Write(s);
|
|
},
|
|
readFile: readFile,
|
|
writeFile: writeFile,
|
|
resolvePath: function (path) {
|
|
return fso.GetAbsolutePathName(path);
|
|
},
|
|
fileExists: function (path) {
|
|
return fso.FileExists(path);
|
|
},
|
|
directoryExists: function (path) {
|
|
return fso.FolderExists(path);
|
|
},
|
|
createDirectory: function (directoryName) {
|
|
if (!this.directoryExists(directoryName)) {
|
|
fso.CreateFolder(directoryName);
|
|
}
|
|
},
|
|
getExecutingFilePath: function () {
|
|
return WScript.ScriptFullName;
|
|
},
|
|
getCurrentDirectory: function () {
|
|
return new ActiveXObject("WScript.Shell").CurrentDirectory;
|
|
},
|
|
readDirectory: readDirectory,
|
|
exit: function (exitCode) {
|
|
try {
|
|
WScript.Quit(exitCode);
|
|
}
|
|
catch (e) {
|
|
}
|
|
}
|
|
};
|
|
}
|
|
function getNodeSystem() {
|
|
var _fs = require("fs");
|
|
var _path = require("path");
|
|
var _os = require('os');
|
|
var platform = _os.platform();
|
|
// win32\win64 are case insensitive platforms, MacOS (darwin) by default is also case insensitive
|
|
var useCaseSensitiveFileNames = platform !== "win32" && platform !== "win64" && platform !== "darwin";
|
|
function readFile(fileName, encoding) {
|
|
if (!_fs.existsSync(fileName)) {
|
|
return undefined;
|
|
}
|
|
var buffer = _fs.readFileSync(fileName);
|
|
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;
|
|
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 writeFile(fileName, data, writeByteOrderMark) {
|
|
// If a BOM is required, emit one
|
|
if (writeByteOrderMark) {
|
|
data = '\uFEFF' + data;
|
|
}
|
|
_fs.writeFileSync(fileName, data, "utf8");
|
|
}
|
|
function getCanonicalPath(path) {
|
|
return useCaseSensitiveFileNames ? path.toLowerCase() : path;
|
|
}
|
|
function readDirectory(path, extension, exclude) {
|
|
var result = [];
|
|
exclude = ts.map(exclude, function (s) { return getCanonicalPath(ts.combinePaths(path, s)); });
|
|
visitDirectory(path);
|
|
return result;
|
|
function visitDirectory(path) {
|
|
var files = _fs.readdirSync(path || ".").sort();
|
|
var directories = [];
|
|
for (var _i = 0; _i < files.length; _i++) {
|
|
var current = files[_i];
|
|
var name_3 = ts.combinePaths(path, current);
|
|
if (!ts.contains(exclude, getCanonicalPath(name_3))) {
|
|
var stat = _fs.statSync(name_3);
|
|
if (stat.isFile()) {
|
|
if (!extension || ts.fileExtensionIs(name_3, extension)) {
|
|
result.push(name_3);
|
|
}
|
|
}
|
|
else if (stat.isDirectory()) {
|
|
directories.push(name_3);
|
|
}
|
|
}
|
|
}
|
|
for (var _a = 0; _a < directories.length; _a++) {
|
|
var current = directories[_a];
|
|
visitDirectory(current);
|
|
}
|
|
}
|
|
}
|
|
return {
|
|
args: process.argv.slice(2),
|
|
newLine: _os.EOL,
|
|
useCaseSensitiveFileNames: useCaseSensitiveFileNames,
|
|
write: function (s) {
|
|
var buffer = new Buffer(s, 'utf8');
|
|
var offset = 0;
|
|
var toWrite = buffer.length;
|
|
var written = 0;
|
|
// 1 is a standard descriptor for stdout
|
|
while ((written = _fs.writeSync(1, buffer, offset, toWrite)) < toWrite) {
|
|
offset += written;
|
|
toWrite -= written;
|
|
}
|
|
},
|
|
readFile: readFile,
|
|
writeFile: writeFile,
|
|
watchFile: function (fileName, callback) {
|
|
// watchFile polls a file every 250ms, picking up file notifications.
|
|
_fs.watchFile(fileName, { persistent: true, interval: 250 }, fileChanged);
|
|
return {
|
|
close: function () { _fs.unwatchFile(fileName, fileChanged); }
|
|
};
|
|
function fileChanged(curr, prev) {
|
|
if (+curr.mtime <= +prev.mtime) {
|
|
return;
|
|
}
|
|
callback(fileName);
|
|
}
|
|
;
|
|
},
|
|
resolvePath: function (path) {
|
|
return _path.resolve(path);
|
|
},
|
|
fileExists: function (path) {
|
|
return _fs.existsSync(path);
|
|
},
|
|
directoryExists: function (path) {
|
|
return _fs.existsSync(path) && _fs.statSync(path).isDirectory();
|
|
},
|
|
createDirectory: function (directoryName) {
|
|
if (!this.directoryExists(directoryName)) {
|
|
_fs.mkdirSync(directoryName);
|
|
}
|
|
},
|
|
getExecutingFilePath: function () {
|
|
return __filename;
|
|
},
|
|
getCurrentDirectory: function () {
|
|
return process.cwd();
|
|
},
|
|
readDirectory: readDirectory,
|
|
getMemoryUsage: function () {
|
|
if (global.gc) {
|
|
global.gc();
|
|
}
|
|
return process.memoryUsage().heapUsed;
|
|
},
|
|
exit: function (exitCode) {
|
|
process.exit(exitCode);
|
|
}
|
|
};
|
|
}
|
|
if (typeof WScript !== "undefined" && typeof ActiveXObject === "function") {
|
|
return getWScriptSystem();
|
|
}
|
|
else if (typeof module !== "undefined" && module.exports) {
|
|
return getNodeSystem();
|
|
}
|
|
else {
|
|
return undefined; // Unsupported host
|
|
}
|
|
})();
|
|
})(ts || (ts = {}));
|
|
// <auto-generated />
|
|
/// <reference path="types.ts" />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
ts.Diagnostics = {
|
|
Unterminated_string_literal: { code: 1002, category: ts.DiagnosticCategory.Error, key: "Unterminated string literal." },
|
|
Identifier_expected: { code: 1003, category: ts.DiagnosticCategory.Error, key: "Identifier expected." },
|
|
_0_expected: { code: 1005, category: ts.DiagnosticCategory.Error, key: "'{0}' expected." },
|
|
A_file_cannot_have_a_reference_to_itself: { code: 1006, category: ts.DiagnosticCategory.Error, key: "A file cannot have a reference to itself." },
|
|
Trailing_comma_not_allowed: { code: 1009, category: ts.DiagnosticCategory.Error, key: "Trailing comma not allowed." },
|
|
Asterisk_Slash_expected: { code: 1010, category: ts.DiagnosticCategory.Error, key: "'*/' expected." },
|
|
Unexpected_token: { code: 1012, category: ts.DiagnosticCategory.Error, key: "Unexpected token." },
|
|
A_rest_parameter_must_be_last_in_a_parameter_list: { code: 1014, category: ts.DiagnosticCategory.Error, key: "A rest parameter must be last in a parameter list." },
|
|
Parameter_cannot_have_question_mark_and_initializer: { code: 1015, category: ts.DiagnosticCategory.Error, key: "Parameter cannot have question mark and initializer." },
|
|
A_required_parameter_cannot_follow_an_optional_parameter: { code: 1016, category: ts.DiagnosticCategory.Error, key: "A required parameter cannot follow an optional parameter." },
|
|
An_index_signature_cannot_have_a_rest_parameter: { code: 1017, category: ts.DiagnosticCategory.Error, key: "An index signature cannot have a rest parameter." },
|
|
An_index_signature_parameter_cannot_have_an_accessibility_modifier: { code: 1018, category: ts.DiagnosticCategory.Error, key: "An index signature parameter cannot have an accessibility modifier." },
|
|
An_index_signature_parameter_cannot_have_a_question_mark: { code: 1019, category: ts.DiagnosticCategory.Error, key: "An index signature parameter cannot have a question mark." },
|
|
An_index_signature_parameter_cannot_have_an_initializer: { code: 1020, category: ts.DiagnosticCategory.Error, key: "An index signature parameter cannot have an initializer." },
|
|
An_index_signature_must_have_a_type_annotation: { code: 1021, category: ts.DiagnosticCategory.Error, key: "An index signature must have a type annotation." },
|
|
An_index_signature_parameter_must_have_a_type_annotation: { code: 1022, category: ts.DiagnosticCategory.Error, key: "An index signature parameter must have a type annotation." },
|
|
An_index_signature_parameter_type_must_be_string_or_number: { code: 1023, category: ts.DiagnosticCategory.Error, key: "An index signature parameter type must be 'string' or 'number'." },
|
|
Accessibility_modifier_already_seen: { code: 1028, category: ts.DiagnosticCategory.Error, key: "Accessibility modifier already seen." },
|
|
_0_modifier_must_precede_1_modifier: { code: 1029, category: ts.DiagnosticCategory.Error, key: "'{0}' modifier must precede '{1}' modifier." },
|
|
_0_modifier_already_seen: { code: 1030, category: ts.DiagnosticCategory.Error, key: "'{0}' modifier already seen." },
|
|
_0_modifier_cannot_appear_on_a_class_element: { code: 1031, category: ts.DiagnosticCategory.Error, key: "'{0}' modifier cannot appear on a class element." },
|
|
super_must_be_followed_by_an_argument_list_or_member_access: { code: 1034, category: ts.DiagnosticCategory.Error, key: "'super' must be followed by an argument list or member access." },
|
|
Only_ambient_modules_can_use_quoted_names: { code: 1035, category: ts.DiagnosticCategory.Error, key: "Only ambient modules can use quoted names." },
|
|
Statements_are_not_allowed_in_ambient_contexts: { code: 1036, category: ts.DiagnosticCategory.Error, key: "Statements are not allowed in ambient contexts." },
|
|
A_declare_modifier_cannot_be_used_in_an_already_ambient_context: { code: 1038, category: ts.DiagnosticCategory.Error, key: "A 'declare' modifier cannot be used in an already ambient context." },
|
|
Initializers_are_not_allowed_in_ambient_contexts: { code: 1039, category: ts.DiagnosticCategory.Error, key: "Initializers are not allowed in ambient contexts." },
|
|
_0_modifier_cannot_be_used_in_an_ambient_context: { code: 1040, category: ts.DiagnosticCategory.Error, key: "'{0}' modifier cannot be used in an ambient context." },
|
|
_0_modifier_cannot_be_used_with_a_class_declaration: { code: 1041, category: ts.DiagnosticCategory.Error, key: "'{0}' modifier cannot be used with a class declaration." },
|
|
_0_modifier_cannot_be_used_here: { code: 1042, category: ts.DiagnosticCategory.Error, key: "'{0}' modifier cannot be used here." },
|
|
_0_modifier_cannot_appear_on_a_data_property: { code: 1043, category: ts.DiagnosticCategory.Error, key: "'{0}' modifier cannot appear on a data property." },
|
|
_0_modifier_cannot_appear_on_a_module_element: { code: 1044, category: ts.DiagnosticCategory.Error, key: "'{0}' modifier cannot appear on a module element." },
|
|
A_0_modifier_cannot_be_used_with_an_interface_declaration: { code: 1045, category: ts.DiagnosticCategory.Error, key: "A '{0}' modifier cannot be used with an interface declaration." },
|
|
A_declare_modifier_is_required_for_a_top_level_declaration_in_a_d_ts_file: { code: 1046, category: ts.DiagnosticCategory.Error, key: "A 'declare' modifier is required for a top level declaration in a .d.ts file." },
|
|
A_rest_parameter_cannot_be_optional: { code: 1047, category: ts.DiagnosticCategory.Error, key: "A rest parameter cannot be optional." },
|
|
A_rest_parameter_cannot_have_an_initializer: { code: 1048, category: ts.DiagnosticCategory.Error, key: "A rest parameter cannot have an initializer." },
|
|
A_set_accessor_must_have_exactly_one_parameter: { code: 1049, category: ts.DiagnosticCategory.Error, key: "A 'set' accessor must have exactly one parameter." },
|
|
A_set_accessor_cannot_have_an_optional_parameter: { code: 1051, category: ts.DiagnosticCategory.Error, key: "A 'set' accessor cannot have an optional parameter." },
|
|
A_set_accessor_parameter_cannot_have_an_initializer: { code: 1052, category: ts.DiagnosticCategory.Error, key: "A 'set' accessor parameter cannot have an initializer." },
|
|
A_set_accessor_cannot_have_rest_parameter: { code: 1053, category: ts.DiagnosticCategory.Error, key: "A 'set' accessor cannot have rest parameter." },
|
|
A_get_accessor_cannot_have_parameters: { code: 1054, category: ts.DiagnosticCategory.Error, key: "A 'get' accessor cannot have parameters." },
|
|
Type_0_is_not_a_valid_async_function_return_type: { code: 1055, category: ts.DiagnosticCategory.Error, key: "Type '{0}' is not a valid async function return type." },
|
|
Accessors_are_only_available_when_targeting_ECMAScript_5_and_higher: { code: 1056, category: ts.DiagnosticCategory.Error, key: "Accessors are only available when targeting ECMAScript 5 and higher." },
|
|
An_async_function_or_method_must_have_a_valid_awaitable_return_type: { code: 1057, category: ts.DiagnosticCategory.Error, key: "An async function or method must have a valid awaitable return type." },
|
|
Operand_for_await_does_not_have_a_valid_callable_then_member: { code: 1058, category: ts.DiagnosticCategory.Error, key: "Operand for 'await' does not have a valid callable 'then' member." },
|
|
Return_expression_in_async_function_does_not_have_a_valid_callable_then_member: { code: 1059, category: ts.DiagnosticCategory.Error, key: "Return expression in async function does not have a valid callable 'then' member." },
|
|
Expression_body_for_async_arrow_function_does_not_have_a_valid_callable_then_member: { code: 1060, category: ts.DiagnosticCategory.Error, key: "Expression body for async arrow function does not have a valid callable 'then' member." },
|
|
Enum_member_must_have_initializer: { code: 1061, category: ts.DiagnosticCategory.Error, key: "Enum member must have initializer." },
|
|
_0_is_referenced_directly_or_indirectly_in_the_fulfillment_callback_of_its_own_then_method: { code: 1062, category: ts.DiagnosticCategory.Error, key: "{0} is referenced directly or indirectly in the fulfillment callback of its own 'then' method." },
|
|
An_export_assignment_cannot_be_used_in_a_namespace: { code: 1063, category: ts.DiagnosticCategory.Error, key: "An export assignment cannot be used in a namespace." },
|
|
Ambient_enum_elements_can_only_have_integer_literal_initializers: { code: 1066, category: ts.DiagnosticCategory.Error, key: "Ambient enum elements can only have integer literal initializers." },
|
|
Unexpected_token_A_constructor_method_accessor_or_property_was_expected: { code: 1068, category: ts.DiagnosticCategory.Error, key: "Unexpected token. A constructor, method, accessor, or property was expected." },
|
|
A_0_modifier_cannot_be_used_with_an_import_declaration: { code: 1079, category: ts.DiagnosticCategory.Error, key: "A '{0}' modifier cannot be used with an import declaration." },
|
|
Invalid_reference_directive_syntax: { code: 1084, category: ts.DiagnosticCategory.Error, key: "Invalid 'reference' directive syntax." },
|
|
Octal_literals_are_not_available_when_targeting_ECMAScript_5_and_higher: { code: 1085, category: ts.DiagnosticCategory.Error, key: "Octal literals are not available when targeting ECMAScript 5 and higher." },
|
|
An_accessor_cannot_be_declared_in_an_ambient_context: { code: 1086, category: ts.DiagnosticCategory.Error, key: "An accessor cannot be declared in an ambient context." },
|
|
_0_modifier_cannot_appear_on_a_constructor_declaration: { code: 1089, category: ts.DiagnosticCategory.Error, key: "'{0}' modifier cannot appear on a constructor declaration." },
|
|
_0_modifier_cannot_appear_on_a_parameter: { code: 1090, category: ts.DiagnosticCategory.Error, key: "'{0}' modifier cannot appear on a parameter." },
|
|
Only_a_single_variable_declaration_is_allowed_in_a_for_in_statement: { code: 1091, category: ts.DiagnosticCategory.Error, key: "Only a single variable declaration is allowed in a 'for...in' statement." },
|
|
Type_parameters_cannot_appear_on_a_constructor_declaration: { code: 1092, category: ts.DiagnosticCategory.Error, key: "Type parameters cannot appear on a constructor declaration." },
|
|
Type_annotation_cannot_appear_on_a_constructor_declaration: { code: 1093, category: ts.DiagnosticCategory.Error, key: "Type annotation cannot appear on a constructor declaration." },
|
|
An_accessor_cannot_have_type_parameters: { code: 1094, category: ts.DiagnosticCategory.Error, key: "An accessor cannot have type parameters." },
|
|
A_set_accessor_cannot_have_a_return_type_annotation: { code: 1095, category: ts.DiagnosticCategory.Error, key: "A 'set' accessor cannot have a return type annotation." },
|
|
An_index_signature_must_have_exactly_one_parameter: { code: 1096, category: ts.DiagnosticCategory.Error, key: "An index signature must have exactly one parameter." },
|
|
_0_list_cannot_be_empty: { code: 1097, category: ts.DiagnosticCategory.Error, key: "'{0}' list cannot be empty." },
|
|
Type_parameter_list_cannot_be_empty: { code: 1098, category: ts.DiagnosticCategory.Error, key: "Type parameter list cannot be empty." },
|
|
Type_argument_list_cannot_be_empty: { code: 1099, category: ts.DiagnosticCategory.Error, key: "Type argument list cannot be empty." },
|
|
Invalid_use_of_0_in_strict_mode: { code: 1100, category: ts.DiagnosticCategory.Error, key: "Invalid use of '{0}' in strict mode." },
|
|
with_statements_are_not_allowed_in_strict_mode: { code: 1101, category: ts.DiagnosticCategory.Error, key: "'with' statements are not allowed in strict mode." },
|
|
delete_cannot_be_called_on_an_identifier_in_strict_mode: { code: 1102, category: ts.DiagnosticCategory.Error, key: "'delete' cannot be called on an identifier in strict mode." },
|
|
A_continue_statement_can_only_be_used_within_an_enclosing_iteration_statement: { code: 1104, category: ts.DiagnosticCategory.Error, key: "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: { code: 1105, category: ts.DiagnosticCategory.Error, key: "A 'break' statement can only be used within an enclosing iteration or switch statement." },
|
|
Jump_target_cannot_cross_function_boundary: { code: 1107, category: ts.DiagnosticCategory.Error, key: "Jump target cannot cross function boundary." },
|
|
A_return_statement_can_only_be_used_within_a_function_body: { code: 1108, category: ts.DiagnosticCategory.Error, key: "A 'return' statement can only be used within a function body." },
|
|
Expression_expected: { code: 1109, category: ts.DiagnosticCategory.Error, key: "Expression expected." },
|
|
Type_expected: { code: 1110, category: ts.DiagnosticCategory.Error, key: "Type expected." },
|
|
A_class_member_cannot_be_declared_optional: { code: 1112, category: ts.DiagnosticCategory.Error, key: "A class member cannot be declared optional." },
|
|
A_default_clause_cannot_appear_more_than_once_in_a_switch_statement: { code: 1113, category: ts.DiagnosticCategory.Error, key: "A 'default' clause cannot appear more than once in a 'switch' statement." },
|
|
Duplicate_label_0: { code: 1114, category: ts.DiagnosticCategory.Error, key: "Duplicate label '{0}'" },
|
|
A_continue_statement_can_only_jump_to_a_label_of_an_enclosing_iteration_statement: { code: 1115, category: ts.DiagnosticCategory.Error, key: "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: { code: 1116, category: ts.DiagnosticCategory.Error, key: "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: { code: 1117, category: ts.DiagnosticCategory.Error, key: "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: { code: 1118, category: ts.DiagnosticCategory.Error, key: "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: { code: 1119, category: ts.DiagnosticCategory.Error, key: "An object literal cannot have property and accessor with the same name." },
|
|
An_export_assignment_cannot_have_modifiers: { code: 1120, category: ts.DiagnosticCategory.Error, key: "An export assignment cannot have modifiers." },
|
|
Octal_literals_are_not_allowed_in_strict_mode: { code: 1121, category: ts.DiagnosticCategory.Error, key: "Octal literals are not allowed in strict mode." },
|
|
A_tuple_type_element_list_cannot_be_empty: { code: 1122, category: ts.DiagnosticCategory.Error, key: "A tuple type element list cannot be empty." },
|
|
Variable_declaration_list_cannot_be_empty: { code: 1123, category: ts.DiagnosticCategory.Error, key: "Variable declaration list cannot be empty." },
|
|
Digit_expected: { code: 1124, category: ts.DiagnosticCategory.Error, key: "Digit expected." },
|
|
Hexadecimal_digit_expected: { code: 1125, category: ts.DiagnosticCategory.Error, key: "Hexadecimal digit expected." },
|
|
Unexpected_end_of_text: { code: 1126, category: ts.DiagnosticCategory.Error, key: "Unexpected end of text." },
|
|
Invalid_character: { code: 1127, category: ts.DiagnosticCategory.Error, key: "Invalid character." },
|
|
Declaration_or_statement_expected: { code: 1128, category: ts.DiagnosticCategory.Error, key: "Declaration or statement expected." },
|
|
Statement_expected: { code: 1129, category: ts.DiagnosticCategory.Error, key: "Statement expected." },
|
|
case_or_default_expected: { code: 1130, category: ts.DiagnosticCategory.Error, key: "'case' or 'default' expected." },
|
|
Property_or_signature_expected: { code: 1131, category: ts.DiagnosticCategory.Error, key: "Property or signature expected." },
|
|
Enum_member_expected: { code: 1132, category: ts.DiagnosticCategory.Error, key: "Enum member expected." },
|
|
Variable_declaration_expected: { code: 1134, category: ts.DiagnosticCategory.Error, key: "Variable declaration expected." },
|
|
Argument_expression_expected: { code: 1135, category: ts.DiagnosticCategory.Error, key: "Argument expression expected." },
|
|
Property_assignment_expected: { code: 1136, category: ts.DiagnosticCategory.Error, key: "Property assignment expected." },
|
|
Expression_or_comma_expected: { code: 1137, category: ts.DiagnosticCategory.Error, key: "Expression or comma expected." },
|
|
Parameter_declaration_expected: { code: 1138, category: ts.DiagnosticCategory.Error, key: "Parameter declaration expected." },
|
|
Type_parameter_declaration_expected: { code: 1139, category: ts.DiagnosticCategory.Error, key: "Type parameter declaration expected." },
|
|
Type_argument_expected: { code: 1140, category: ts.DiagnosticCategory.Error, key: "Type argument expected." },
|
|
String_literal_expected: { code: 1141, category: ts.DiagnosticCategory.Error, key: "String literal expected." },
|
|
Line_break_not_permitted_here: { code: 1142, category: ts.DiagnosticCategory.Error, key: "Line break not permitted here." },
|
|
or_expected: { code: 1144, category: ts.DiagnosticCategory.Error, key: "'{' or ';' expected." },
|
|
Modifiers_not_permitted_on_index_signature_members: { code: 1145, category: ts.DiagnosticCategory.Error, key: "Modifiers not permitted on index signature members." },
|
|
Declaration_expected: { code: 1146, category: ts.DiagnosticCategory.Error, key: "Declaration expected." },
|
|
Import_declarations_in_a_namespace_cannot_reference_a_module: { code: 1147, category: ts.DiagnosticCategory.Error, key: "Import declarations in a namespace cannot reference a module." },
|
|
Cannot_compile_modules_unless_the_module_flag_is_provided: { code: 1148, category: ts.DiagnosticCategory.Error, key: "Cannot compile modules unless the '--module' flag is provided." },
|
|
File_name_0_differs_from_already_included_file_name_1_only_in_casing: { code: 1149, category: ts.DiagnosticCategory.Error, key: "File name '{0}' differs from already included file name '{1}' only in casing" },
|
|
new_T_cannot_be_used_to_create_an_array_Use_new_Array_T_instead: { code: 1150, category: ts.DiagnosticCategory.Error, key: "'new T[]' cannot be used to create an array. Use 'new Array<T>()' instead." },
|
|
const_declarations_must_be_initialized: { code: 1155, category: ts.DiagnosticCategory.Error, key: "'const' declarations must be initialized" },
|
|
const_declarations_can_only_be_declared_inside_a_block: { code: 1156, category: ts.DiagnosticCategory.Error, key: "'const' declarations can only be declared inside a block." },
|
|
let_declarations_can_only_be_declared_inside_a_block: { code: 1157, category: ts.DiagnosticCategory.Error, key: "'let' declarations can only be declared inside a block." },
|
|
Unterminated_template_literal: { code: 1160, category: ts.DiagnosticCategory.Error, key: "Unterminated template literal." },
|
|
Unterminated_regular_expression_literal: { code: 1161, category: ts.DiagnosticCategory.Error, key: "Unterminated regular expression literal." },
|
|
An_object_member_cannot_be_declared_optional: { code: 1162, category: ts.DiagnosticCategory.Error, key: "An object member cannot be declared optional." },
|
|
A_yield_expression_is_only_allowed_in_a_generator_body: { code: 1163, category: ts.DiagnosticCategory.Error, key: "A 'yield' expression is only allowed in a generator body." },
|
|
Computed_property_names_are_not_allowed_in_enums: { code: 1164, category: ts.DiagnosticCategory.Error, key: "Computed property names are not allowed in enums." },
|
|
A_computed_property_name_in_an_ambient_context_must_directly_refer_to_a_built_in_symbol: { code: 1165, category: ts.DiagnosticCategory.Error, key: "A computed property name in an ambient context must directly refer to a built-in symbol." },
|
|
A_computed_property_name_in_a_class_property_declaration_must_directly_refer_to_a_built_in_symbol: { code: 1166, category: ts.DiagnosticCategory.Error, key: "A computed property name in a class property declaration must directly refer to a built-in symbol." },
|
|
A_computed_property_name_in_a_method_overload_must_directly_refer_to_a_built_in_symbol: { code: 1168, category: ts.DiagnosticCategory.Error, key: "A computed property name in a method overload must directly refer to a built-in symbol." },
|
|
A_computed_property_name_in_an_interface_must_directly_refer_to_a_built_in_symbol: { code: 1169, category: ts.DiagnosticCategory.Error, key: "A computed property name in an interface must directly refer to a built-in symbol." },
|
|
A_computed_property_name_in_a_type_literal_must_directly_refer_to_a_built_in_symbol: { code: 1170, category: ts.DiagnosticCategory.Error, key: "A computed property name in a type literal must directly refer to a built-in symbol." },
|
|
A_comma_expression_is_not_allowed_in_a_computed_property_name: { code: 1171, category: ts.DiagnosticCategory.Error, key: "A comma expression is not allowed in a computed property name." },
|
|
extends_clause_already_seen: { code: 1172, category: ts.DiagnosticCategory.Error, key: "'extends' clause already seen." },
|
|
extends_clause_must_precede_implements_clause: { code: 1173, category: ts.DiagnosticCategory.Error, key: "'extends' clause must precede 'implements' clause." },
|
|
Classes_can_only_extend_a_single_class: { code: 1174, category: ts.DiagnosticCategory.Error, key: "Classes can only extend a single class." },
|
|
implements_clause_already_seen: { code: 1175, category: ts.DiagnosticCategory.Error, key: "'implements' clause already seen." },
|
|
Interface_declaration_cannot_have_implements_clause: { code: 1176, category: ts.DiagnosticCategory.Error, key: "Interface declaration cannot have 'implements' clause." },
|
|
Binary_digit_expected: { code: 1177, category: ts.DiagnosticCategory.Error, key: "Binary digit expected." },
|
|
Octal_digit_expected: { code: 1178, category: ts.DiagnosticCategory.Error, key: "Octal digit expected." },
|
|
Unexpected_token_expected: { code: 1179, category: ts.DiagnosticCategory.Error, key: "Unexpected token. '{' expected." },
|
|
Property_destructuring_pattern_expected: { code: 1180, category: ts.DiagnosticCategory.Error, key: "Property destructuring pattern expected." },
|
|
Array_element_destructuring_pattern_expected: { code: 1181, category: ts.DiagnosticCategory.Error, key: "Array element destructuring pattern expected." },
|
|
A_destructuring_declaration_must_have_an_initializer: { code: 1182, category: ts.DiagnosticCategory.Error, key: "A destructuring declaration must have an initializer." },
|
|
An_implementation_cannot_be_declared_in_ambient_contexts: { code: 1184, category: ts.DiagnosticCategory.Error, key: "An implementation cannot be declared in ambient contexts." },
|
|
Modifiers_cannot_appear_here: { code: 1184, category: ts.DiagnosticCategory.Error, key: "Modifiers cannot appear here." },
|
|
Merge_conflict_marker_encountered: { code: 1185, category: ts.DiagnosticCategory.Error, key: "Merge conflict marker encountered." },
|
|
A_rest_element_cannot_have_an_initializer: { code: 1186, category: ts.DiagnosticCategory.Error, key: "A rest element cannot have an initializer." },
|
|
A_parameter_property_may_not_be_a_binding_pattern: { code: 1187, category: ts.DiagnosticCategory.Error, key: "A parameter property may not be a binding pattern." },
|
|
Only_a_single_variable_declaration_is_allowed_in_a_for_of_statement: { code: 1188, category: ts.DiagnosticCategory.Error, key: "Only a single variable declaration is allowed in a 'for...of' statement." },
|
|
The_variable_declaration_of_a_for_in_statement_cannot_have_an_initializer: { code: 1189, category: ts.DiagnosticCategory.Error, key: "The variable declaration of a 'for...in' statement cannot have an initializer." },
|
|
The_variable_declaration_of_a_for_of_statement_cannot_have_an_initializer: { code: 1190, category: ts.DiagnosticCategory.Error, key: "The variable declaration of a 'for...of' statement cannot have an initializer." },
|
|
An_import_declaration_cannot_have_modifiers: { code: 1191, category: ts.DiagnosticCategory.Error, key: "An import declaration cannot have modifiers." },
|
|
Module_0_has_no_default_export: { code: 1192, category: ts.DiagnosticCategory.Error, key: "Module '{0}' has no default export." },
|
|
An_export_declaration_cannot_have_modifiers: { code: 1193, category: ts.DiagnosticCategory.Error, key: "An export declaration cannot have modifiers." },
|
|
Export_declarations_are_not_permitted_in_a_namespace: { code: 1194, category: ts.DiagnosticCategory.Error, key: "Export declarations are not permitted in a namespace." },
|
|
Catch_clause_variable_name_must_be_an_identifier: { code: 1195, category: ts.DiagnosticCategory.Error, key: "Catch clause variable name must be an identifier." },
|
|
Catch_clause_variable_cannot_have_a_type_annotation: { code: 1196, category: ts.DiagnosticCategory.Error, key: "Catch clause variable cannot have a type annotation." },
|
|
Catch_clause_variable_cannot_have_an_initializer: { code: 1197, category: ts.DiagnosticCategory.Error, key: "Catch clause variable cannot have an initializer." },
|
|
An_extended_Unicode_escape_value_must_be_between_0x0_and_0x10FFFF_inclusive: { code: 1198, category: ts.DiagnosticCategory.Error, key: "An extended Unicode escape value must be between 0x0 and 0x10FFFF inclusive." },
|
|
Unterminated_Unicode_escape_sequence: { code: 1199, category: ts.DiagnosticCategory.Error, key: "Unterminated Unicode escape sequence." },
|
|
Line_terminator_not_permitted_before_arrow: { code: 1200, category: ts.DiagnosticCategory.Error, key: "Line terminator not permitted before arrow." },
|
|
Import_assignment_cannot_be_used_when_targeting_ECMAScript_6_or_higher_Consider_using_import_Asterisk_as_ns_from_mod_import_a_from_mod_or_import_d_from_mod_instead: { code: 1202, category: ts.DiagnosticCategory.Error, key: "Import assignment cannot be used when targeting ECMAScript 6 or higher. Consider using 'import * as ns from \"mod\"', 'import {a} from \"mod\"' or 'import d from \"mod\"' instead." },
|
|
Export_assignment_cannot_be_used_when_targeting_ECMAScript_6_or_higher_Consider_using_export_default_instead: { code: 1203, category: ts.DiagnosticCategory.Error, key: "Export assignment cannot be used when targeting ECMAScript 6 or higher. Consider using 'export default' instead." },
|
|
Cannot_compile_modules_into_commonjs_amd_system_or_umd_when_targeting_ES6_or_higher: { code: 1204, category: ts.DiagnosticCategory.Error, key: "Cannot compile modules into 'commonjs', 'amd', 'system' or 'umd' when targeting 'ES6' or higher." },
|
|
Decorators_are_only_available_when_targeting_ECMAScript_5_and_higher: { code: 1205, category: ts.DiagnosticCategory.Error, key: "Decorators are only available when targeting ECMAScript 5 and higher." },
|
|
Decorators_are_not_valid_here: { code: 1206, category: ts.DiagnosticCategory.Error, key: "Decorators are not valid here." },
|
|
Decorators_cannot_be_applied_to_multiple_get_Slashset_accessors_of_the_same_name: { code: 1207, category: ts.DiagnosticCategory.Error, key: "Decorators cannot be applied to multiple get/set accessors of the same name." },
|
|
Cannot_compile_namespaces_when_the_isolatedModules_flag_is_provided: { code: 1208, category: ts.DiagnosticCategory.Error, key: "Cannot compile namespaces when the '--isolatedModules' flag is provided." },
|
|
Ambient_const_enums_are_not_allowed_when_the_isolatedModules_flag_is_provided: { code: 1209, category: ts.DiagnosticCategory.Error, key: "Ambient const enums are not allowed when the '--isolatedModules' flag is provided." },
|
|
Invalid_use_of_0_Class_definitions_are_automatically_in_strict_mode: { code: 1210, category: ts.DiagnosticCategory.Error, key: "Invalid use of '{0}'. Class definitions are automatically in strict mode." },
|
|
A_class_declaration_without_the_default_modifier_must_have_a_name: { code: 1211, category: ts.DiagnosticCategory.Error, key: "A class declaration without the 'default' modifier must have a name" },
|
|
Identifier_expected_0_is_a_reserved_word_in_strict_mode: { code: 1212, category: ts.DiagnosticCategory.Error, key: "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: { code: 1213, category: ts.DiagnosticCategory.Error, key: "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: { code: 1214, category: ts.DiagnosticCategory.Error, key: "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: { code: 1215, category: ts.DiagnosticCategory.Error, key: "Invalid use of '{0}'. Modules are automatically in strict mode." },
|
|
Export_assignment_is_not_supported_when_module_flag_is_system: { code: 1218, category: ts.DiagnosticCategory.Error, key: "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_Specify_experimentalDecorators_to_remove_this_warning: { code: 1219, category: ts.DiagnosticCategory.Error, key: "Experimental support for decorators is a feature that is subject to change in a future release. Specify '--experimentalDecorators' to remove this warning." },
|
|
Generators_are_only_available_when_targeting_ECMAScript_6_or_higher: { code: 1220, category: ts.DiagnosticCategory.Error, key: "Generators are only available when targeting ECMAScript 6 or higher." },
|
|
Generators_are_not_allowed_in_an_ambient_context: { code: 1221, category: ts.DiagnosticCategory.Error, key: "Generators are not allowed in an ambient context." },
|
|
An_overload_signature_cannot_be_declared_as_a_generator: { code: 1222, category: ts.DiagnosticCategory.Error, key: "An overload signature cannot be declared as a generator." },
|
|
_0_tag_already_specified: { code: 1223, category: ts.DiagnosticCategory.Error, key: "'{0}' tag already specified." },
|
|
Signature_0_must_have_a_type_predicate: { code: 1224, category: ts.DiagnosticCategory.Error, key: "Signature '{0}' must have a type predicate." },
|
|
Cannot_find_parameter_0: { code: 1225, category: ts.DiagnosticCategory.Error, key: "Cannot find parameter '{0}'." },
|
|
Type_predicate_0_is_not_assignable_to_1: { code: 1226, category: ts.DiagnosticCategory.Error, key: "Type predicate '{0}' is not assignable to '{1}'." },
|
|
Parameter_0_is_not_in_the_same_position_as_parameter_1: { code: 1227, category: ts.DiagnosticCategory.Error, key: "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: { code: 1228, category: ts.DiagnosticCategory.Error, key: "A type predicate is only allowed in return type position for functions and methods." },
|
|
A_type_predicate_cannot_reference_a_rest_parameter: { code: 1229, category: ts.DiagnosticCategory.Error, key: "A type predicate cannot reference a rest parameter." },
|
|
A_type_predicate_cannot_reference_element_0_in_a_binding_pattern: { code: 1230, category: ts.DiagnosticCategory.Error, key: "A type predicate cannot reference element '{0}' in a binding pattern." },
|
|
An_export_assignment_can_only_be_used_in_a_module: { code: 1231, category: ts.DiagnosticCategory.Error, key: "An export assignment can only be used in a module." },
|
|
An_import_declaration_can_only_be_used_in_a_namespace_or_module: { code: 1232, category: ts.DiagnosticCategory.Error, key: "An import declaration can only be used in a namespace or module." },
|
|
An_export_declaration_can_only_be_used_in_a_module: { code: 1233, category: ts.DiagnosticCategory.Error, key: "An export declaration can only be used in a module." },
|
|
An_ambient_module_declaration_is_only_allowed_at_the_top_level_in_a_file: { code: 1234, category: ts.DiagnosticCategory.Error, key: "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: { code: 1235, category: ts.DiagnosticCategory.Error, key: "A namespace declaration is only allowed in a namespace or module." },
|
|
Experimental_support_for_async_functions_is_a_feature_that_is_subject_to_change_in_a_future_release_Specify_experimentalAsyncFunctions_to_remove_this_warning: { code: 1236, category: ts.DiagnosticCategory.Error, key: "Experimental support for async functions is a feature that is subject to change in a future release. Specify '--experimentalAsyncFunctions' to remove this warning." },
|
|
with_statements_are_not_allowed_in_an_async_function_block: { code: 1300, category: ts.DiagnosticCategory.Error, key: "'with' statements are not allowed in an async function block." },
|
|
await_expression_is_only_allowed_within_an_async_function: { code: 1308, category: ts.DiagnosticCategory.Error, key: "'await' expression is only allowed within an async function." },
|
|
Async_functions_are_only_available_when_targeting_ECMAScript_6_and_higher: { code: 1311, category: ts.DiagnosticCategory.Error, key: "Async functions are only available when targeting ECMAScript 6 and higher." },
|
|
The_return_type_of_a_property_decorator_function_must_be_either_void_or_any: { code: 1236, category: ts.DiagnosticCategory.Error, key: "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: { code: 1237, category: ts.DiagnosticCategory.Error, key: "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: { code: 1238, category: ts.DiagnosticCategory.Error, key: "Unable to resolve signature of class decorator when called as an expression." },
|
|
Unable_to_resolve_signature_of_parameter_decorator_when_called_as_an_expression: { code: 1239, category: ts.DiagnosticCategory.Error, key: "Unable to resolve signature of parameter decorator when called as an expression." },
|
|
Unable_to_resolve_signature_of_property_decorator_when_called_as_an_expression: { code: 1240, category: ts.DiagnosticCategory.Error, key: "Unable to resolve signature of property decorator when called as an expression." },
|
|
Unable_to_resolve_signature_of_method_decorator_when_called_as_an_expression: { code: 1241, category: ts.DiagnosticCategory.Error, key: "Unable to resolve signature of method decorator when called as an expression." },
|
|
abstract_modifier_can_only_appear_on_a_class_or_method_declaration: { code: 1242, category: ts.DiagnosticCategory.Error, key: "'abstract' modifier can only appear on a class or method declaration." },
|
|
_0_modifier_cannot_be_used_with_1_modifier: { code: 1243, category: ts.DiagnosticCategory.Error, key: "'{0}' modifier cannot be used with '{1}' modifier." },
|
|
Abstract_methods_can_only_appear_within_an_abstract_class: { code: 1244, category: ts.DiagnosticCategory.Error, key: "Abstract methods can only appear within an abstract class." },
|
|
Method_0_cannot_have_an_implementation_because_it_is_marked_abstract: { code: 1245, category: ts.DiagnosticCategory.Error, key: "Method '{0}' cannot have an implementation because it is marked abstract." },
|
|
Duplicate_identifier_0: { code: 2300, category: ts.DiagnosticCategory.Error, key: "Duplicate identifier '{0}'." },
|
|
Initializer_of_instance_member_variable_0_cannot_reference_identifier_1_declared_in_the_constructor: { code: 2301, category: ts.DiagnosticCategory.Error, key: "Initializer of instance member variable '{0}' cannot reference identifier '{1}' declared in the constructor." },
|
|
Static_members_cannot_reference_class_type_parameters: { code: 2302, category: ts.DiagnosticCategory.Error, key: "Static members cannot reference class type parameters." },
|
|
Circular_definition_of_import_alias_0: { code: 2303, category: ts.DiagnosticCategory.Error, key: "Circular definition of import alias '{0}'." },
|
|
Cannot_find_name_0: { code: 2304, category: ts.DiagnosticCategory.Error, key: "Cannot find name '{0}'." },
|
|
Module_0_has_no_exported_member_1: { code: 2305, category: ts.DiagnosticCategory.Error, key: "Module '{0}' has no exported member '{1}'." },
|
|
File_0_is_not_a_module: { code: 2306, category: ts.DiagnosticCategory.Error, key: "File '{0}' is not a module." },
|
|
Cannot_find_module_0: { code: 2307, category: ts.DiagnosticCategory.Error, key: "Cannot find module '{0}'." },
|
|
An_export_assignment_cannot_be_used_in_a_module_with_other_exported_elements: { code: 2309, category: ts.DiagnosticCategory.Error, key: "An export assignment cannot be used in a module with other exported elements." },
|
|
Type_0_recursively_references_itself_as_a_base_type: { code: 2310, category: ts.DiagnosticCategory.Error, key: "Type '{0}' recursively references itself as a base type." },
|
|
A_class_may_only_extend_another_class: { code: 2311, category: ts.DiagnosticCategory.Error, key: "A class may only extend another class." },
|
|
An_interface_may_only_extend_a_class_or_another_interface: { code: 2312, category: ts.DiagnosticCategory.Error, key: "An interface may only extend a class or another interface." },
|
|
Constraint_of_a_type_parameter_cannot_reference_any_type_parameter_from_the_same_type_parameter_list: { code: 2313, category: ts.DiagnosticCategory.Error, key: "Constraint of a type parameter cannot reference any type parameter from the same type parameter list." },
|
|
Generic_type_0_requires_1_type_argument_s: { code: 2314, category: ts.DiagnosticCategory.Error, key: "Generic type '{0}' requires {1} type argument(s)." },
|
|
Type_0_is_not_generic: { code: 2315, category: ts.DiagnosticCategory.Error, key: "Type '{0}' is not generic." },
|
|
Global_type_0_must_be_a_class_or_interface_type: { code: 2316, category: ts.DiagnosticCategory.Error, key: "Global type '{0}' must be a class or interface type." },
|
|
Global_type_0_must_have_1_type_parameter_s: { code: 2317, category: ts.DiagnosticCategory.Error, key: "Global type '{0}' must have {1} type parameter(s)." },
|
|
Cannot_find_global_type_0: { code: 2318, category: ts.DiagnosticCategory.Error, key: "Cannot find global type '{0}'." },
|
|
Named_property_0_of_types_1_and_2_are_not_identical: { code: 2319, category: ts.DiagnosticCategory.Error, key: "Named property '{0}' of types '{1}' and '{2}' are not identical." },
|
|
Interface_0_cannot_simultaneously_extend_types_1_and_2: { code: 2320, category: ts.DiagnosticCategory.Error, key: "Interface '{0}' cannot simultaneously extend types '{1}' and '{2}'." },
|
|
Excessive_stack_depth_comparing_types_0_and_1: { code: 2321, category: ts.DiagnosticCategory.Error, key: "Excessive stack depth comparing types '{0}' and '{1}'." },
|
|
Type_0_is_not_assignable_to_type_1: { code: 2322, category: ts.DiagnosticCategory.Error, key: "Type '{0}' is not assignable to type '{1}'." },
|
|
Property_0_is_missing_in_type_1: { code: 2324, category: ts.DiagnosticCategory.Error, key: "Property '{0}' is missing in type '{1}'." },
|
|
Property_0_is_private_in_type_1_but_not_in_type_2: { code: 2325, category: ts.DiagnosticCategory.Error, key: "Property '{0}' is private in type '{1}' but not in type '{2}'." },
|
|
Types_of_property_0_are_incompatible: { code: 2326, category: ts.DiagnosticCategory.Error, key: "Types of property '{0}' are incompatible." },
|
|
Property_0_is_optional_in_type_1_but_required_in_type_2: { code: 2327, category: ts.DiagnosticCategory.Error, key: "Property '{0}' is optional in type '{1}' but required in type '{2}'." },
|
|
Types_of_parameters_0_and_1_are_incompatible: { code: 2328, category: ts.DiagnosticCategory.Error, key: "Types of parameters '{0}' and '{1}' are incompatible." },
|
|
Index_signature_is_missing_in_type_0: { code: 2329, category: ts.DiagnosticCategory.Error, key: "Index signature is missing in type '{0}'." },
|
|
Index_signatures_are_incompatible: { code: 2330, category: ts.DiagnosticCategory.Error, key: "Index signatures are incompatible." },
|
|
this_cannot_be_referenced_in_a_module_or_namespace_body: { code: 2331, category: ts.DiagnosticCategory.Error, key: "'this' cannot be referenced in a module or namespace body." },
|
|
this_cannot_be_referenced_in_current_location: { code: 2332, category: ts.DiagnosticCategory.Error, key: "'this' cannot be referenced in current location." },
|
|
this_cannot_be_referenced_in_constructor_arguments: { code: 2333, category: ts.DiagnosticCategory.Error, key: "'this' cannot be referenced in constructor arguments." },
|
|
this_cannot_be_referenced_in_a_static_property_initializer: { code: 2334, category: ts.DiagnosticCategory.Error, key: "'this' cannot be referenced in a static property initializer." },
|
|
super_can_only_be_referenced_in_a_derived_class: { code: 2335, category: ts.DiagnosticCategory.Error, key: "'super' can only be referenced in a derived class." },
|
|
super_cannot_be_referenced_in_constructor_arguments: { code: 2336, category: ts.DiagnosticCategory.Error, key: "'super' cannot be referenced in constructor arguments." },
|
|
Super_calls_are_not_permitted_outside_constructors_or_in_nested_functions_inside_constructors: { code: 2337, category: ts.DiagnosticCategory.Error, key: "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: { code: 2338, category: ts.DiagnosticCategory.Error, key: "'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: { code: 2339, category: ts.DiagnosticCategory.Error, key: "Property '{0}' does not exist on type '{1}'." },
|
|
Only_public_and_protected_methods_of_the_base_class_are_accessible_via_the_super_keyword: { code: 2340, category: ts.DiagnosticCategory.Error, key: "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: { code: 2341, category: ts.DiagnosticCategory.Error, key: "Property '{0}' is private and only accessible within class '{1}'." },
|
|
An_index_expression_argument_must_be_of_type_string_number_symbol_or_any: { code: 2342, category: ts.DiagnosticCategory.Error, key: "An index expression argument must be of type 'string', 'number', 'symbol, or 'any'." },
|
|
Type_0_does_not_satisfy_the_constraint_1: { code: 2344, category: ts.DiagnosticCategory.Error, key: "Type '{0}' does not satisfy the constraint '{1}'." },
|
|
Argument_of_type_0_is_not_assignable_to_parameter_of_type_1: { code: 2345, category: ts.DiagnosticCategory.Error, key: "Argument of type '{0}' is not assignable to parameter of type '{1}'." },
|
|
Supplied_parameters_do_not_match_any_signature_of_call_target: { code: 2346, category: ts.DiagnosticCategory.Error, key: "Supplied parameters do not match any signature of call target." },
|
|
Untyped_function_calls_may_not_accept_type_arguments: { code: 2347, category: ts.DiagnosticCategory.Error, key: "Untyped function calls may not accept type arguments." },
|
|
Value_of_type_0_is_not_callable_Did_you_mean_to_include_new: { code: 2348, category: ts.DiagnosticCategory.Error, key: "Value of type '{0}' is not callable. Did you mean to include 'new'?" },
|
|
Cannot_invoke_an_expression_whose_type_lacks_a_call_signature: { code: 2349, category: ts.DiagnosticCategory.Error, key: "Cannot invoke an expression whose type lacks a call signature." },
|
|
Only_a_void_function_can_be_called_with_the_new_keyword: { code: 2350, category: ts.DiagnosticCategory.Error, key: "Only a void function can be called with the 'new' keyword." },
|
|
Cannot_use_new_with_an_expression_whose_type_lacks_a_call_or_construct_signature: { code: 2351, category: ts.DiagnosticCategory.Error, key: "Cannot use 'new' with an expression whose type lacks a call or construct signature." },
|
|
Neither_type_0_nor_type_1_is_assignable_to_the_other: { code: 2352, category: ts.DiagnosticCategory.Error, key: "Neither type '{0}' nor type '{1}' is assignable to the other." },
|
|
No_best_common_type_exists_among_return_expressions: { code: 2354, category: ts.DiagnosticCategory.Error, key: "No best common type exists among return expressions." },
|
|
A_function_whose_declared_type_is_neither_void_nor_any_must_return_a_value_or_consist_of_a_single_throw_statement: { code: 2355, category: ts.DiagnosticCategory.Error, key: "A function whose declared type is neither 'void' nor 'any' must return a value or consist of a single 'throw' statement." },
|
|
An_arithmetic_operand_must_be_of_type_any_number_or_an_enum_type: { code: 2356, category: ts.DiagnosticCategory.Error, key: "An arithmetic operand must be of type 'any', 'number' or an enum type." },
|
|
The_operand_of_an_increment_or_decrement_operator_must_be_a_variable_property_or_indexer: { code: 2357, category: ts.DiagnosticCategory.Error, key: "The operand of an increment or decrement operator must be a variable, property or indexer." },
|
|
The_left_hand_side_of_an_instanceof_expression_must_be_of_type_any_an_object_type_or_a_type_parameter: { code: 2358, category: ts.DiagnosticCategory.Error, key: "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: { code: 2359, category: ts.DiagnosticCategory.Error, key: "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: { code: 2360, category: ts.DiagnosticCategory.Error, key: "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_be_of_type_any_an_object_type_or_a_type_parameter: { code: 2361, category: ts.DiagnosticCategory.Error, key: "The right-hand side of an 'in' expression must be of type 'any', an object type or a type parameter" },
|
|
The_left_hand_side_of_an_arithmetic_operation_must_be_of_type_any_number_or_an_enum_type: { code: 2362, category: ts.DiagnosticCategory.Error, key: "The left-hand side of an arithmetic operation must be of type 'any', 'number' or an enum type." },
|
|
The_right_hand_side_of_an_arithmetic_operation_must_be_of_type_any_number_or_an_enum_type: { code: 2363, category: ts.DiagnosticCategory.Error, key: "The right-hand side of an arithmetic operation must be of type 'any', 'number' or an enum type." },
|
|
Invalid_left_hand_side_of_assignment_expression: { code: 2364, category: ts.DiagnosticCategory.Error, key: "Invalid left-hand side of assignment expression." },
|
|
Operator_0_cannot_be_applied_to_types_1_and_2: { code: 2365, category: ts.DiagnosticCategory.Error, key: "Operator '{0}' cannot be applied to types '{1}' and '{2}'." },
|
|
Type_parameter_name_cannot_be_0: { code: 2368, category: ts.DiagnosticCategory.Error, key: "Type parameter name cannot be '{0}'" },
|
|
A_parameter_property_is_only_allowed_in_a_constructor_implementation: { code: 2369, category: ts.DiagnosticCategory.Error, key: "A parameter property is only allowed in a constructor implementation." },
|
|
A_rest_parameter_must_be_of_an_array_type: { code: 2370, category: ts.DiagnosticCategory.Error, key: "A rest parameter must be of an array type." },
|
|
A_parameter_initializer_is_only_allowed_in_a_function_or_constructor_implementation: { code: 2371, category: ts.DiagnosticCategory.Error, key: "A parameter initializer is only allowed in a function or constructor implementation." },
|
|
Parameter_0_cannot_be_referenced_in_its_initializer: { code: 2372, category: ts.DiagnosticCategory.Error, key: "Parameter '{0}' cannot be referenced in its initializer." },
|
|
Initializer_of_parameter_0_cannot_reference_identifier_1_declared_after_it: { code: 2373, category: ts.DiagnosticCategory.Error, key: "Initializer of parameter '{0}' cannot reference identifier '{1}' declared after it." },
|
|
Duplicate_string_index_signature: { code: 2374, category: ts.DiagnosticCategory.Error, key: "Duplicate string index signature." },
|
|
Duplicate_number_index_signature: { code: 2375, category: ts.DiagnosticCategory.Error, key: "Duplicate number index signature." },
|
|
A_super_call_must_be_the_first_statement_in_the_constructor_when_a_class_contains_initialized_properties_or_has_parameter_properties: { code: 2376, category: ts.DiagnosticCategory.Error, key: "A 'super' call must be the first statement in the constructor when a class contains initialized properties or has parameter properties." },
|
|
Constructors_for_derived_classes_must_contain_a_super_call: { code: 2377, category: ts.DiagnosticCategory.Error, key: "Constructors for derived classes must contain a 'super' call." },
|
|
A_get_accessor_must_return_a_value_or_consist_of_a_single_throw_statement: { code: 2378, category: ts.DiagnosticCategory.Error, key: "A 'get' accessor must return a value or consist of a single 'throw' statement." },
|
|
Getter_and_setter_accessors_do_not_agree_in_visibility: { code: 2379, category: ts.DiagnosticCategory.Error, key: "Getter and setter accessors do not agree in visibility." },
|
|
get_and_set_accessor_must_have_the_same_type: { code: 2380, category: ts.DiagnosticCategory.Error, key: "'get' and 'set' accessor must have the same type." },
|
|
A_signature_with_an_implementation_cannot_use_a_string_literal_type: { code: 2381, category: ts.DiagnosticCategory.Error, key: "A signature with an implementation cannot use a string literal type." },
|
|
Specialized_overload_signature_is_not_assignable_to_any_non_specialized_signature: { code: 2382, category: ts.DiagnosticCategory.Error, key: "Specialized overload signature is not assignable to any non-specialized signature." },
|
|
Overload_signatures_must_all_be_exported_or_not_exported: { code: 2383, category: ts.DiagnosticCategory.Error, key: "Overload signatures must all be exported or not exported." },
|
|
Overload_signatures_must_all_be_ambient_or_non_ambient: { code: 2384, category: ts.DiagnosticCategory.Error, key: "Overload signatures must all be ambient or non-ambient." },
|
|
Overload_signatures_must_all_be_public_private_or_protected: { code: 2385, category: ts.DiagnosticCategory.Error, key: "Overload signatures must all be public, private or protected." },
|
|
Overload_signatures_must_all_be_optional_or_required: { code: 2386, category: ts.DiagnosticCategory.Error, key: "Overload signatures must all be optional or required." },
|
|
Function_overload_must_be_static: { code: 2387, category: ts.DiagnosticCategory.Error, key: "Function overload must be static." },
|
|
Function_overload_must_not_be_static: { code: 2388, category: ts.DiagnosticCategory.Error, key: "Function overload must not be static." },
|
|
Function_implementation_name_must_be_0: { code: 2389, category: ts.DiagnosticCategory.Error, key: "Function implementation name must be '{0}'." },
|
|
Constructor_implementation_is_missing: { code: 2390, category: ts.DiagnosticCategory.Error, key: "Constructor implementation is missing." },
|
|
Function_implementation_is_missing_or_not_immediately_following_the_declaration: { code: 2391, category: ts.DiagnosticCategory.Error, key: "Function implementation is missing or not immediately following the declaration." },
|
|
Multiple_constructor_implementations_are_not_allowed: { code: 2392, category: ts.DiagnosticCategory.Error, key: "Multiple constructor implementations are not allowed." },
|
|
Duplicate_function_implementation: { code: 2393, category: ts.DiagnosticCategory.Error, key: "Duplicate function implementation." },
|
|
Overload_signature_is_not_compatible_with_function_implementation: { code: 2394, category: ts.DiagnosticCategory.Error, key: "Overload signature is not compatible with function implementation." },
|
|
Individual_declarations_in_merged_declaration_0_must_be_all_exported_or_all_local: { code: 2395, category: ts.DiagnosticCategory.Error, key: "Individual declarations in merged declaration {0} must be all exported or all local." },
|
|
Duplicate_identifier_arguments_Compiler_uses_arguments_to_initialize_rest_parameters: { code: 2396, category: ts.DiagnosticCategory.Error, key: "Duplicate identifier 'arguments'. Compiler uses 'arguments' to initialize rest parameters." },
|
|
Duplicate_identifier_this_Compiler_uses_variable_declaration_this_to_capture_this_reference: { code: 2399, category: ts.DiagnosticCategory.Error, key: "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: { code: 2400, category: ts.DiagnosticCategory.Error, key: "Expression resolves to variable declaration '_this' that compiler uses to capture 'this' reference." },
|
|
Duplicate_identifier_super_Compiler_uses_super_to_capture_base_class_reference: { code: 2401, category: ts.DiagnosticCategory.Error, key: "Duplicate identifier '_super'. Compiler uses '_super' to capture base class reference." },
|
|
Expression_resolves_to_super_that_compiler_uses_to_capture_base_class_reference: { code: 2402, category: ts.DiagnosticCategory.Error, key: "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: { code: 2403, category: ts.DiagnosticCategory.Error, key: "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: { code: 2404, category: ts.DiagnosticCategory.Error, key: "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: { code: 2405, category: ts.DiagnosticCategory.Error, key: "The left-hand side of a 'for...in' statement must be of type 'string' or 'any'." },
|
|
Invalid_left_hand_side_in_for_in_statement: { code: 2406, category: ts.DiagnosticCategory.Error, key: "Invalid left-hand side in 'for...in' statement." },
|
|
The_right_hand_side_of_a_for_in_statement_must_be_of_type_any_an_object_type_or_a_type_parameter: { code: 2407, category: ts.DiagnosticCategory.Error, key: "The right-hand side of a 'for...in' statement must be of type 'any', an object type or a type parameter." },
|
|
Setters_cannot_return_a_value: { code: 2408, category: ts.DiagnosticCategory.Error, key: "Setters cannot return a value." },
|
|
Return_type_of_constructor_signature_must_be_assignable_to_the_instance_type_of_the_class: { code: 2409, category: ts.DiagnosticCategory.Error, key: "Return type of constructor signature must be assignable to the instance type of the class" },
|
|
All_symbols_within_a_with_block_will_be_resolved_to_any: { code: 2410, category: ts.DiagnosticCategory.Error, key: "All symbols within a 'with' block will be resolved to 'any'." },
|
|
Property_0_of_type_1_is_not_assignable_to_string_index_type_2: { code: 2411, category: ts.DiagnosticCategory.Error, key: "Property '{0}' of type '{1}' is not assignable to string index type '{2}'." },
|
|
Property_0_of_type_1_is_not_assignable_to_numeric_index_type_2: { code: 2412, category: ts.DiagnosticCategory.Error, key: "Property '{0}' of type '{1}' is not assignable to numeric index type '{2}'." },
|
|
Numeric_index_type_0_is_not_assignable_to_string_index_type_1: { code: 2413, category: ts.DiagnosticCategory.Error, key: "Numeric index type '{0}' is not assignable to string index type '{1}'." },
|
|
Class_name_cannot_be_0: { code: 2414, category: ts.DiagnosticCategory.Error, key: "Class name cannot be '{0}'" },
|
|
Class_0_incorrectly_extends_base_class_1: { code: 2415, category: ts.DiagnosticCategory.Error, key: "Class '{0}' incorrectly extends base class '{1}'." },
|
|
Class_static_side_0_incorrectly_extends_base_class_static_side_1: { code: 2417, category: ts.DiagnosticCategory.Error, key: "Class static side '{0}' incorrectly extends base class static side '{1}'." },
|
|
Type_name_0_in_extends_clause_does_not_reference_constructor_function_for_0: { code: 2419, category: ts.DiagnosticCategory.Error, key: "Type name '{0}' in extends clause does not reference constructor function for '{0}'." },
|
|
Class_0_incorrectly_implements_interface_1: { code: 2420, category: ts.DiagnosticCategory.Error, key: "Class '{0}' incorrectly implements interface '{1}'." },
|
|
A_class_may_only_implement_another_class_or_interface: { code: 2422, category: ts.DiagnosticCategory.Error, key: "A class may only implement another class or interface." },
|
|
Class_0_defines_instance_member_function_1_but_extended_class_2_defines_it_as_instance_member_accessor: { code: 2423, category: ts.DiagnosticCategory.Error, key: "Class '{0}' defines instance member function '{1}', but extended class '{2}' defines it as instance member accessor." },
|
|
Class_0_defines_instance_member_function_1_but_extended_class_2_defines_it_as_instance_member_property: { code: 2424, category: ts.DiagnosticCategory.Error, key: "Class '{0}' defines instance member function '{1}', but extended class '{2}' defines it as instance member property." },
|
|
Class_0_defines_instance_member_property_1_but_extended_class_2_defines_it_as_instance_member_function: { code: 2425, category: ts.DiagnosticCategory.Error, key: "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: { code: 2426, category: ts.DiagnosticCategory.Error, key: "Class '{0}' defines instance member accessor '{1}', but extended class '{2}' defines it as instance member function." },
|
|
Interface_name_cannot_be_0: { code: 2427, category: ts.DiagnosticCategory.Error, key: "Interface name cannot be '{0}'" },
|
|
All_declarations_of_an_interface_must_have_identical_type_parameters: { code: 2428, category: ts.DiagnosticCategory.Error, key: "All declarations of an interface must have identical type parameters." },
|
|
Interface_0_incorrectly_extends_interface_1: { code: 2430, category: ts.DiagnosticCategory.Error, key: "Interface '{0}' incorrectly extends interface '{1}'." },
|
|
Enum_name_cannot_be_0: { code: 2431, category: ts.DiagnosticCategory.Error, key: "Enum name cannot be '{0}'" },
|
|
In_an_enum_with_multiple_declarations_only_one_declaration_can_omit_an_initializer_for_its_first_enum_element: { code: 2432, category: ts.DiagnosticCategory.Error, key: "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: { code: 2433, category: ts.DiagnosticCategory.Error, key: "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: { code: 2434, category: ts.DiagnosticCategory.Error, key: "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: { code: 2435, category: ts.DiagnosticCategory.Error, key: "Ambient modules cannot be nested in other modules." },
|
|
Ambient_module_declaration_cannot_specify_relative_module_name: { code: 2436, category: ts.DiagnosticCategory.Error, key: "Ambient module declaration cannot specify relative module name." },
|
|
Module_0_is_hidden_by_a_local_declaration_with_the_same_name: { code: 2437, category: ts.DiagnosticCategory.Error, key: "Module '{0}' is hidden by a local declaration with the same name" },
|
|
Import_name_cannot_be_0: { code: 2438, category: ts.DiagnosticCategory.Error, key: "Import name cannot be '{0}'" },
|
|
Import_or_export_declaration_in_an_ambient_module_declaration_cannot_reference_module_through_relative_module_name: { code: 2439, category: ts.DiagnosticCategory.Error, key: "Import or export declaration in an ambient module declaration cannot reference module through relative module name." },
|
|
Import_declaration_conflicts_with_local_declaration_of_0: { code: 2440, category: ts.DiagnosticCategory.Error, key: "Import declaration conflicts with local declaration of '{0}'" },
|
|
Duplicate_identifier_0_Compiler_reserves_name_1_in_top_level_scope_of_a_module: { code: 2441, category: ts.DiagnosticCategory.Error, key: "Duplicate identifier '{0}'. Compiler reserves name '{1}' in top level scope of a module." },
|
|
Types_have_separate_declarations_of_a_private_property_0: { code: 2442, category: ts.DiagnosticCategory.Error, key: "Types have separate declarations of a private property '{0}'." },
|
|
Property_0_is_protected_but_type_1_is_not_a_class_derived_from_2: { code: 2443, category: ts.DiagnosticCategory.Error, key: "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: { code: 2444, category: ts.DiagnosticCategory.Error, key: "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: { code: 2445, category: ts.DiagnosticCategory.Error, key: "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: { code: 2446, category: ts.DiagnosticCategory.Error, key: "Property '{0}' is protected and only accessible through an instance of class '{1}'." },
|
|
The_0_operator_is_not_allowed_for_boolean_types_Consider_using_1_instead: { code: 2447, category: ts.DiagnosticCategory.Error, key: "The '{0}' operator is not allowed for boolean types. Consider using '{1}' instead." },
|
|
Block_scoped_variable_0_used_before_its_declaration: { code: 2448, category: ts.DiagnosticCategory.Error, key: "Block-scoped variable '{0}' used before its declaration." },
|
|
The_operand_of_an_increment_or_decrement_operator_cannot_be_a_constant: { code: 2449, category: ts.DiagnosticCategory.Error, key: "The operand of an increment or decrement operator cannot be a constant." },
|
|
Left_hand_side_of_assignment_expression_cannot_be_a_constant: { code: 2450, category: ts.DiagnosticCategory.Error, key: "Left-hand side of assignment expression cannot be a constant." },
|
|
Cannot_redeclare_block_scoped_variable_0: { code: 2451, category: ts.DiagnosticCategory.Error, key: "Cannot redeclare block-scoped variable '{0}'." },
|
|
An_enum_member_cannot_have_a_numeric_name: { code: 2452, category: ts.DiagnosticCategory.Error, key: "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: { code: 2453, category: ts.DiagnosticCategory.Error, key: "The type argument for type parameter '{0}' cannot be inferred from the usage. Consider specifying the type arguments explicitly." },
|
|
Type_argument_candidate_1_is_not_a_valid_type_argument_because_it_is_not_a_supertype_of_candidate_0: { code: 2455, category: ts.DiagnosticCategory.Error, key: "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: { code: 2456, category: ts.DiagnosticCategory.Error, key: "Type alias '{0}' circularly references itself." },
|
|
Type_alias_name_cannot_be_0: { code: 2457, category: ts.DiagnosticCategory.Error, key: "Type alias name cannot be '{0}'" },
|
|
An_AMD_module_cannot_have_multiple_name_assignments: { code: 2458, category: ts.DiagnosticCategory.Error, key: "An AMD module cannot have multiple name assignments." },
|
|
Type_0_has_no_property_1_and_no_string_index_signature: { code: 2459, category: ts.DiagnosticCategory.Error, key: "Type '{0}' has no property '{1}' and no string index signature." },
|
|
Type_0_has_no_property_1: { code: 2460, category: ts.DiagnosticCategory.Error, key: "Type '{0}' has no property '{1}'." },
|
|
Type_0_is_not_an_array_type: { code: 2461, category: ts.DiagnosticCategory.Error, key: "Type '{0}' is not an array type." },
|
|
A_rest_element_must_be_last_in_an_array_destructuring_pattern: { code: 2462, category: ts.DiagnosticCategory.Error, key: "A rest element must be last in an array destructuring pattern" },
|
|
A_binding_pattern_parameter_cannot_be_optional_in_an_implementation_signature: { code: 2463, category: ts.DiagnosticCategory.Error, key: "A binding pattern parameter cannot be optional in an implementation signature." },
|
|
A_computed_property_name_must_be_of_type_string_number_symbol_or_any: { code: 2464, category: ts.DiagnosticCategory.Error, key: "A computed property name must be of type 'string', 'number', 'symbol', or 'any'." },
|
|
this_cannot_be_referenced_in_a_computed_property_name: { code: 2465, category: ts.DiagnosticCategory.Error, key: "'this' cannot be referenced in a computed property name." },
|
|
super_cannot_be_referenced_in_a_computed_property_name: { code: 2466, category: ts.DiagnosticCategory.Error, key: "'super' cannot be referenced in a computed property name." },
|
|
A_computed_property_name_cannot_reference_a_type_parameter_from_its_containing_type: { code: 2467, category: ts.DiagnosticCategory.Error, key: "A computed property name cannot reference a type parameter from its containing type." },
|
|
Cannot_find_global_value_0: { code: 2468, category: ts.DiagnosticCategory.Error, key: "Cannot find global value '{0}'." },
|
|
The_0_operator_cannot_be_applied_to_type_symbol: { code: 2469, category: ts.DiagnosticCategory.Error, key: "The '{0}' operator cannot be applied to type 'symbol'." },
|
|
Symbol_reference_does_not_refer_to_the_global_Symbol_constructor_object: { code: 2470, category: ts.DiagnosticCategory.Error, key: "'Symbol' reference does not refer to the global Symbol constructor object." },
|
|
A_computed_property_name_of_the_form_0_must_be_of_type_symbol: { code: 2471, category: ts.DiagnosticCategory.Error, key: "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: { code: 2472, category: ts.DiagnosticCategory.Error, key: "Spread operator in 'new' expressions is only available when targeting ECMAScript 5 and higher." },
|
|
Enum_declarations_must_all_be_const_or_non_const: { code: 2473, category: ts.DiagnosticCategory.Error, key: "Enum declarations must all be const or non-const." },
|
|
In_const_enum_declarations_member_initializer_must_be_constant_expression: { code: 2474, category: ts.DiagnosticCategory.Error, key: "In 'const' enum declarations member initializer must be constant expression." },
|
|
const_enums_can_only_be_used_in_property_or_index_access_expressions_or_the_right_hand_side_of_an_import_declaration_or_export_assignment: { code: 2475, category: ts.DiagnosticCategory.Error, key: "'const' enums can only be used in property or index access expressions or the right hand side of an import declaration or export assignment." },
|
|
A_const_enum_member_can_only_be_accessed_using_a_string_literal: { code: 2476, category: ts.DiagnosticCategory.Error, key: "A const enum member can only be accessed using a string literal." },
|
|
const_enum_member_initializer_was_evaluated_to_a_non_finite_value: { code: 2477, category: ts.DiagnosticCategory.Error, key: "'const' enum member initializer was evaluated to a non-finite value." },
|
|
const_enum_member_initializer_was_evaluated_to_disallowed_value_NaN: { code: 2478, category: ts.DiagnosticCategory.Error, key: "'const' enum member initializer was evaluated to disallowed value 'NaN'." },
|
|
Property_0_does_not_exist_on_const_enum_1: { code: 2479, category: ts.DiagnosticCategory.Error, key: "Property '{0}' does not exist on 'const' enum '{1}'." },
|
|
let_is_not_allowed_to_be_used_as_a_name_in_let_or_const_declarations: { code: 2480, category: ts.DiagnosticCategory.Error, key: "'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: { code: 2481, category: ts.DiagnosticCategory.Error, key: "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: { code: 2483, category: ts.DiagnosticCategory.Error, key: "The left-hand side of a 'for...of' statement cannot use a type annotation." },
|
|
Export_declaration_conflicts_with_exported_declaration_of_0: { code: 2484, category: ts.DiagnosticCategory.Error, key: "Export declaration conflicts with exported declaration of '{0}'" },
|
|
The_left_hand_side_of_a_for_of_statement_cannot_be_a_previously_defined_constant: { code: 2485, category: ts.DiagnosticCategory.Error, key: "The left-hand side of a 'for...of' statement cannot be a previously defined constant." },
|
|
The_left_hand_side_of_a_for_in_statement_cannot_be_a_previously_defined_constant: { code: 2486, category: ts.DiagnosticCategory.Error, key: "The left-hand side of a 'for...in' statement cannot be a previously defined constant." },
|
|
Invalid_left_hand_side_in_for_of_statement: { code: 2487, category: ts.DiagnosticCategory.Error, key: "Invalid left-hand side in 'for...of' statement." },
|
|
Type_must_have_a_Symbol_iterator_method_that_returns_an_iterator: { code: 2488, category: ts.DiagnosticCategory.Error, key: "Type must have a '[Symbol.iterator]()' method that returns an iterator." },
|
|
An_iterator_must_have_a_next_method: { code: 2489, category: ts.DiagnosticCategory.Error, key: "An iterator must have a 'next()' method." },
|
|
The_type_returned_by_the_next_method_of_an_iterator_must_have_a_value_property: { code: 2490, category: ts.DiagnosticCategory.Error, key: "The type returned by the 'next()' method of an iterator must have a 'value' property." },
|
|
The_left_hand_side_of_a_for_in_statement_cannot_be_a_destructuring_pattern: { code: 2491, category: ts.DiagnosticCategory.Error, key: "The left-hand side of a 'for...in' statement cannot be a destructuring pattern." },
|
|
Cannot_redeclare_identifier_0_in_catch_clause: { code: 2492, category: ts.DiagnosticCategory.Error, key: "Cannot redeclare identifier '{0}' in catch clause" },
|
|
Tuple_type_0_with_length_1_cannot_be_assigned_to_tuple_with_length_2: { code: 2493, category: ts.DiagnosticCategory.Error, key: "Tuple type '{0}' with length '{1}' cannot be assigned to tuple with length '{2}'." },
|
|
Using_a_string_in_a_for_of_statement_is_only_supported_in_ECMAScript_5_and_higher: { code: 2494, category: ts.DiagnosticCategory.Error, key: "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: { code: 2495, category: ts.DiagnosticCategory.Error, key: "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: { code: 2496, category: ts.DiagnosticCategory.Error, key: "The 'arguments' object cannot be referenced in an arrow function in ES3 and ES5. Consider using a standard function expression." },
|
|
Module_0_resolves_to_a_non_module_entity_and_cannot_be_imported_using_this_construct: { code: 2497, category: ts.DiagnosticCategory.Error, key: "Module '{0}' resolves to a non-module entity and cannot be imported using this construct." },
|
|
Module_0_uses_export_and_cannot_be_used_with_export_Asterisk: { code: 2498, category: ts.DiagnosticCategory.Error, key: "Module '{0}' uses 'export =' and cannot be used with 'export *'." },
|
|
An_interface_can_only_extend_an_identifier_Slashqualified_name_with_optional_type_arguments: { code: 2499, category: ts.DiagnosticCategory.Error, key: "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: { code: 2500, category: ts.DiagnosticCategory.Error, key: "A class can only implement an identifier/qualified-name with optional type arguments." },
|
|
A_rest_element_cannot_contain_a_binding_pattern: { code: 2501, category: ts.DiagnosticCategory.Error, key: "A rest element cannot contain a binding pattern." },
|
|
_0_is_referenced_directly_or_indirectly_in_its_own_type_annotation: { code: 2502, category: ts.DiagnosticCategory.Error, key: "'{0}' is referenced directly or indirectly in its own type annotation." },
|
|
Cannot_find_namespace_0: { code: 2503, category: ts.DiagnosticCategory.Error, key: "Cannot find namespace '{0}'." },
|
|
No_best_common_type_exists_among_yield_expressions: { code: 2504, category: ts.DiagnosticCategory.Error, key: "No best common type exists among yield expressions." },
|
|
A_generator_cannot_have_a_void_type_annotation: { code: 2505, category: ts.DiagnosticCategory.Error, key: "A generator cannot have a 'void' type annotation." },
|
|
_0_is_referenced_directly_or_indirectly_in_its_own_base_expression: { code: 2506, category: ts.DiagnosticCategory.Error, key: "'{0}' is referenced directly or indirectly in its own base expression." },
|
|
Type_0_is_not_a_constructor_function_type: { code: 2507, category: ts.DiagnosticCategory.Error, key: "Type '{0}' is not a constructor function type." },
|
|
No_base_constructor_has_the_specified_number_of_type_arguments: { code: 2508, category: ts.DiagnosticCategory.Error, key: "No base constructor has the specified number of type arguments." },
|
|
Base_constructor_return_type_0_is_not_a_class_or_interface_type: { code: 2509, category: ts.DiagnosticCategory.Error, key: "Base constructor return type '{0}' is not a class or interface type." },
|
|
Base_constructors_must_all_have_the_same_return_type: { code: 2510, category: ts.DiagnosticCategory.Error, key: "Base constructors must all have the same return type." },
|
|
Cannot_create_an_instance_of_the_abstract_class_0: { code: 2511, category: ts.DiagnosticCategory.Error, key: "Cannot create an instance of the abstract class '{0}'." },
|
|
Overload_signatures_must_all_be_abstract_or_not_abstract: { code: 2512, category: ts.DiagnosticCategory.Error, key: "Overload signatures must all be abstract or not abstract." },
|
|
Abstract_method_0_in_class_1_cannot_be_accessed_via_super_expression: { code: 2513, category: ts.DiagnosticCategory.Error, key: "Abstract method '{0}' in class '{1}' cannot be accessed via super expression." },
|
|
Classes_containing_abstract_methods_must_be_marked_abstract: { code: 2514, category: ts.DiagnosticCategory.Error, key: "Classes containing abstract methods must be marked abstract." },
|
|
Non_abstract_class_0_does_not_implement_inherited_abstract_member_1_from_class_2: { code: 2515, category: ts.DiagnosticCategory.Error, key: "Non-abstract class '{0}' does not implement inherited abstract member '{1}' from class '{2}'." },
|
|
All_declarations_of_an_abstract_method_must_be_consecutive: { code: 2516, category: ts.DiagnosticCategory.Error, key: "All declarations of an abstract method must be consecutive." },
|
|
Cannot_assign_an_abstract_constructor_type_to_a_non_abstract_constructor_type: { code: 2517, category: ts.DiagnosticCategory.Error, key: "Cannot assign an abstract constructor type to a non-abstract constructor type." },
|
|
Only_an_ambient_class_can_be_merged_with_an_interface: { code: 2518, category: ts.DiagnosticCategory.Error, key: "Only an ambient class can be merged with an interface." },
|
|
Duplicate_identifier_0_Compiler_uses_declaration_1_to_support_async_functions: { code: 2520, category: ts.DiagnosticCategory.Error, key: "Duplicate identifier '{0}'. Compiler uses declaration '{1}' to support async functions." },
|
|
Expression_resolves_to_variable_declaration_0_that_compiler_uses_to_support_async_functions: { code: 2521, category: ts.DiagnosticCategory.Error, key: "Expression resolves to variable declaration '{0}' that compiler uses to support async functions." },
|
|
The_arguments_object_cannot_be_referenced_in_an_async_arrow_function_Consider_using_a_standard_async_function_expression: { code: 2522, category: ts.DiagnosticCategory.Error, key: "The 'arguments' object cannot be referenced in an async arrow function. Consider using a standard async function expression." },
|
|
yield_expressions_cannot_be_used_in_a_parameter_initializer: { code: 2523, category: ts.DiagnosticCategory.Error, key: "'yield' expressions cannot be used in a parameter initializer." },
|
|
await_expressions_cannot_be_used_in_a_parameter_initializer: { code: 2524, category: ts.DiagnosticCategory.Error, key: "'await' expressions cannot be used in a parameter initializer." },
|
|
JSX_element_attributes_type_0_must_be_an_object_type: { code: 2600, category: ts.DiagnosticCategory.Error, key: "JSX element attributes type '{0}' must be an object type." },
|
|
The_return_type_of_a_JSX_element_constructor_must_return_an_object_type: { code: 2601, category: ts.DiagnosticCategory.Error, key: "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: { code: 2602, category: ts.DiagnosticCategory.Error, key: "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: { code: 2603, category: ts.DiagnosticCategory.Error, key: "Property '{0}' in type '{1}' is not assignable to type '{2}'" },
|
|
JSX_element_type_0_does_not_have_any_construct_or_call_signatures: { code: 2604, category: ts.DiagnosticCategory.Error, key: "JSX element type '{0}' does not have any construct or call signatures." },
|
|
JSX_element_type_0_is_not_a_constructor_function_for_JSX_elements: { code: 2605, category: ts.DiagnosticCategory.Error, key: "JSX element type '{0}' is not a constructor function for JSX elements." },
|
|
Property_0_of_JSX_spread_attribute_is_not_assignable_to_target_property: { code: 2606, category: ts.DiagnosticCategory.Error, key: "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: { code: 2607, category: ts.DiagnosticCategory.Error, key: "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: { code: 2608, category: ts.DiagnosticCategory.Error, key: "The global type 'JSX.{0}' may not have more than one property" },
|
|
Cannot_emit_namespaced_JSX_elements_in_React: { code: 2650, category: ts.DiagnosticCategory.Error, key: "Cannot emit namespaced JSX elements in React" },
|
|
Import_declaration_0_is_using_private_name_1: { code: 4000, category: ts.DiagnosticCategory.Error, key: "Import declaration '{0}' is using private name '{1}'." },
|
|
Type_parameter_0_of_exported_class_has_or_is_using_private_name_1: { code: 4002, category: ts.DiagnosticCategory.Error, key: "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: { code: 4004, category: ts.DiagnosticCategory.Error, key: "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: { code: 4006, category: ts.DiagnosticCategory.Error, key: "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: { code: 4008, category: ts.DiagnosticCategory.Error, key: "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: { code: 4010, category: ts.DiagnosticCategory.Error, key: "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: { code: 4012, category: ts.DiagnosticCategory.Error, key: "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: { code: 4014, category: ts.DiagnosticCategory.Error, key: "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: { code: 4016, category: ts.DiagnosticCategory.Error, key: "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: { code: 4019, category: ts.DiagnosticCategory.Error, key: "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: { code: 4020, category: ts.DiagnosticCategory.Error, key: "Extends clause of exported class '{0}' has or is using private name '{1}'." },
|
|
Extends_clause_of_exported_interface_0_has_or_is_using_private_name_1: { code: 4022, category: ts.DiagnosticCategory.Error, key: "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: { code: 4023, category: ts.DiagnosticCategory.Error, key: "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: { code: 4024, category: ts.DiagnosticCategory.Error, key: "Exported variable '{0}' has or is using name '{1}' from private module '{2}'." },
|
|
Exported_variable_0_has_or_is_using_private_name_1: { code: 4025, category: ts.DiagnosticCategory.Error, key: "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: { code: 4026, category: ts.DiagnosticCategory.Error, key: "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: { code: 4027, category: ts.DiagnosticCategory.Error, key: "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: { code: 4028, category: ts.DiagnosticCategory.Error, key: "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: { code: 4029, category: ts.DiagnosticCategory.Error, key: "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: { code: 4030, category: ts.DiagnosticCategory.Error, key: "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: { code: 4031, category: ts.DiagnosticCategory.Error, key: "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: { code: 4032, category: ts.DiagnosticCategory.Error, key: "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: { code: 4033, category: ts.DiagnosticCategory.Error, key: "Property '{0}' of exported interface has or is using private name '{1}'." },
|
|
Parameter_0_of_public_static_property_setter_from_exported_class_has_or_is_using_name_1_from_private_module_2: { code: 4034, category: ts.DiagnosticCategory.Error, key: "Parameter '{0}' of public static property setter from exported class has or is using name '{1}' from private module '{2}'." },
|
|
Parameter_0_of_public_static_property_setter_from_exported_class_has_or_is_using_private_name_1: { code: 4035, category: ts.DiagnosticCategory.Error, key: "Parameter '{0}' of public static property setter from exported class has or is using private name '{1}'." },
|
|
Parameter_0_of_public_property_setter_from_exported_class_has_or_is_using_name_1_from_private_module_2: { code: 4036, category: ts.DiagnosticCategory.Error, key: "Parameter '{0}' of public property setter from exported class has or is using name '{1}' from private module '{2}'." },
|
|
Parameter_0_of_public_property_setter_from_exported_class_has_or_is_using_private_name_1: { code: 4037, category: ts.DiagnosticCategory.Error, key: "Parameter '{0}' of public property setter from exported class has or is using private name '{1}'." },
|
|
Return_type_of_public_static_property_getter_from_exported_class_has_or_is_using_name_0_from_external_module_1_but_cannot_be_named: { code: 4038, category: ts.DiagnosticCategory.Error, key: "Return type of public static property getter from exported class has or is using name '{0}' from external module {1} but cannot be named." },
|
|
Return_type_of_public_static_property_getter_from_exported_class_has_or_is_using_name_0_from_private_module_1: { code: 4039, category: ts.DiagnosticCategory.Error, key: "Return type of public static property getter from exported class has or is using name '{0}' from private module '{1}'." },
|
|
Return_type_of_public_static_property_getter_from_exported_class_has_or_is_using_private_name_0: { code: 4040, category: ts.DiagnosticCategory.Error, key: "Return type of public static property getter from exported class has or is using private name '{0}'." },
|
|
Return_type_of_public_property_getter_from_exported_class_has_or_is_using_name_0_from_external_module_1_but_cannot_be_named: { code: 4041, category: ts.DiagnosticCategory.Error, key: "Return type of public property getter from exported class has or is using name '{0}' from external module {1} but cannot be named." },
|
|
Return_type_of_public_property_getter_from_exported_class_has_or_is_using_name_0_from_private_module_1: { code: 4042, category: ts.DiagnosticCategory.Error, key: "Return type of public property getter from exported class has or is using name '{0}' from private module '{1}'." },
|
|
Return_type_of_public_property_getter_from_exported_class_has_or_is_using_private_name_0: { code: 4043, category: ts.DiagnosticCategory.Error, key: "Return type of public property getter from exported class has or is using private name '{0}'." },
|
|
Return_type_of_constructor_signature_from_exported_interface_has_or_is_using_name_0_from_private_module_1: { code: 4044, category: ts.DiagnosticCategory.Error, key: "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: { code: 4045, category: ts.DiagnosticCategory.Error, key: "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: { code: 4046, category: ts.DiagnosticCategory.Error, key: "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: { code: 4047, category: ts.DiagnosticCategory.Error, key: "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: { code: 4048, category: ts.DiagnosticCategory.Error, key: "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: { code: 4049, category: ts.DiagnosticCategory.Error, key: "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: { code: 4050, category: ts.DiagnosticCategory.Error, key: "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: { code: 4051, category: ts.DiagnosticCategory.Error, key: "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: { code: 4052, category: ts.DiagnosticCategory.Error, key: "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: { code: 4053, category: ts.DiagnosticCategory.Error, key: "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: { code: 4054, category: ts.DiagnosticCategory.Error, key: "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: { code: 4055, category: ts.DiagnosticCategory.Error, key: "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: { code: 4056, category: ts.DiagnosticCategory.Error, key: "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: { code: 4057, category: ts.DiagnosticCategory.Error, key: "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: { code: 4058, category: ts.DiagnosticCategory.Error, key: "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: { code: 4059, category: ts.DiagnosticCategory.Error, key: "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: { code: 4060, category: ts.DiagnosticCategory.Error, key: "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: { code: 4061, category: ts.DiagnosticCategory.Error, key: "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: { code: 4062, category: ts.DiagnosticCategory.Error, key: "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: { code: 4063, category: ts.DiagnosticCategory.Error, key: "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: { code: 4064, category: ts.DiagnosticCategory.Error, key: "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: { code: 4065, category: ts.DiagnosticCategory.Error, key: "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: { code: 4066, category: ts.DiagnosticCategory.Error, key: "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: { code: 4067, category: ts.DiagnosticCategory.Error, key: "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: { code: 4068, category: ts.DiagnosticCategory.Error, key: "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: { code: 4069, category: ts.DiagnosticCategory.Error, key: "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: { code: 4070, category: ts.DiagnosticCategory.Error, key: "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: { code: 4071, category: ts.DiagnosticCategory.Error, key: "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: { code: 4072, category: ts.DiagnosticCategory.Error, key: "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: { code: 4073, category: ts.DiagnosticCategory.Error, key: "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: { code: 4074, category: ts.DiagnosticCategory.Error, key: "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: { code: 4075, category: ts.DiagnosticCategory.Error, key: "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: { code: 4076, category: ts.DiagnosticCategory.Error, key: "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: { code: 4077, category: ts.DiagnosticCategory.Error, key: "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: { code: 4078, category: ts.DiagnosticCategory.Error, key: "Parameter '{0}' of exported function has or is using private name '{1}'." },
|
|
Exported_type_alias_0_has_or_is_using_private_name_1: { code: 4081, category: ts.DiagnosticCategory.Error, key: "Exported type alias '{0}' has or is using private name '{1}'." },
|
|
Default_export_of_the_module_has_or_is_using_private_name_0: { code: 4082, category: ts.DiagnosticCategory.Error, key: "Default export of the module has or is using private name '{0}'." },
|
|
Loop_contains_block_scoped_variable_0_referenced_by_a_function_in_the_loop_This_is_only_supported_in_ECMAScript_6_or_higher: { code: 4091, category: ts.DiagnosticCategory.Error, key: "Loop contains block-scoped variable '{0}' referenced by a function in the loop. This is only supported in ECMAScript 6 or higher." },
|
|
The_current_host_does_not_support_the_0_option: { code: 5001, category: ts.DiagnosticCategory.Error, key: "The current host does not support the '{0}' option." },
|
|
Cannot_find_the_common_subdirectory_path_for_the_input_files: { code: 5009, category: ts.DiagnosticCategory.Error, key: "Cannot find the common subdirectory path for the input files." },
|
|
Cannot_read_file_0_Colon_1: { code: 5012, category: ts.DiagnosticCategory.Error, key: "Cannot read file '{0}': {1}" },
|
|
Unsupported_file_encoding: { code: 5013, category: ts.DiagnosticCategory.Error, key: "Unsupported file encoding." },
|
|
Failed_to_parse_file_0_Colon_1: { code: 5014, category: ts.DiagnosticCategory.Error, key: "Failed to parse file '{0}': {1}." },
|
|
Unknown_compiler_option_0: { code: 5023, category: ts.DiagnosticCategory.Error, key: "Unknown compiler option '{0}'." },
|
|
Compiler_option_0_requires_a_value_of_type_1: { code: 5024, category: ts.DiagnosticCategory.Error, key: "Compiler option '{0}' requires a value of type {1}." },
|
|
Could_not_write_file_0_Colon_1: { code: 5033, category: ts.DiagnosticCategory.Error, key: "Could not write file '{0}': {1}" },
|
|
Option_mapRoot_cannot_be_specified_without_specifying_sourceMap_option: { code: 5038, category: ts.DiagnosticCategory.Error, key: "Option 'mapRoot' cannot be specified without specifying 'sourceMap' option." },
|
|
Option_sourceRoot_cannot_be_specified_without_specifying_sourceMap_option: { code: 5039, category: ts.DiagnosticCategory.Error, key: "Option 'sourceRoot' cannot be specified without specifying 'sourceMap' option." },
|
|
Option_noEmit_cannot_be_specified_with_option_out_or_outDir: { code: 5040, category: ts.DiagnosticCategory.Error, key: "Option 'noEmit' cannot be specified with option 'out' or 'outDir'." },
|
|
Option_noEmit_cannot_be_specified_with_option_declaration: { code: 5041, category: ts.DiagnosticCategory.Error, key: "Option 'noEmit' cannot be specified with option 'declaration'." },
|
|
Option_project_cannot_be_mixed_with_source_files_on_a_command_line: { code: 5042, category: ts.DiagnosticCategory.Error, key: "Option 'project' cannot be mixed with source files on a command line." },
|
|
Option_sourceMap_cannot_be_specified_with_option_isolatedModules: { code: 5043, category: ts.DiagnosticCategory.Error, key: "Option 'sourceMap' cannot be specified with option 'isolatedModules'." },
|
|
Option_declaration_cannot_be_specified_with_option_isolatedModules: { code: 5044, category: ts.DiagnosticCategory.Error, key: "Option 'declaration' cannot be specified with option 'isolatedModules'." },
|
|
Option_noEmitOnError_cannot_be_specified_with_option_isolatedModules: { code: 5045, category: ts.DiagnosticCategory.Error, key: "Option 'noEmitOnError' cannot be specified with option 'isolatedModules'." },
|
|
Option_out_cannot_be_specified_with_option_isolatedModules: { code: 5046, category: ts.DiagnosticCategory.Error, key: "Option 'out' cannot be specified with option 'isolatedModules'." },
|
|
Option_isolatedModules_can_only_be_used_when_either_option_module_is_provided_or_option_target_is_ES6_or_higher: { code: 5047, category: ts.DiagnosticCategory.Error, key: "Option 'isolatedModules' can only be used when either option'--module' is provided or option 'target' is 'ES6' or higher." },
|
|
Option_sourceMap_cannot_be_specified_with_option_inlineSourceMap: { code: 5048, category: ts.DiagnosticCategory.Error, key: "Option 'sourceMap' cannot be specified with option 'inlineSourceMap'." },
|
|
Option_sourceRoot_cannot_be_specified_with_option_inlineSourceMap: { code: 5049, category: ts.DiagnosticCategory.Error, key: "Option 'sourceRoot' cannot be specified with option 'inlineSourceMap'." },
|
|
Option_mapRoot_cannot_be_specified_with_option_inlineSourceMap: { code: 5050, category: ts.DiagnosticCategory.Error, key: "Option 'mapRoot' cannot be specified with option 'inlineSourceMap'." },
|
|
Option_inlineSources_can_only_be_used_when_either_option_inlineSourceMap_or_option_sourceMap_is_provided: { code: 5051, category: ts.DiagnosticCategory.Error, key: "Option 'inlineSources' can only be used when either option '--inlineSourceMap' or option '--sourceMap' is provided." },
|
|
Concatenate_and_emit_output_to_single_file: { code: 6001, category: ts.DiagnosticCategory.Message, key: "Concatenate and emit output to single file." },
|
|
Generates_corresponding_d_ts_file: { code: 6002, category: ts.DiagnosticCategory.Message, key: "Generates corresponding '.d.ts' file." },
|
|
Specifies_the_location_where_debugger_should_locate_map_files_instead_of_generated_locations: { code: 6003, category: ts.DiagnosticCategory.Message, key: "Specifies the location where debugger should locate map files instead of generated locations." },
|
|
Specifies_the_location_where_debugger_should_locate_TypeScript_files_instead_of_source_locations: { code: 6004, category: ts.DiagnosticCategory.Message, key: "Specifies the location where debugger should locate TypeScript files instead of source locations." },
|
|
Watch_input_files: { code: 6005, category: ts.DiagnosticCategory.Message, key: "Watch input files." },
|
|
Redirect_output_structure_to_the_directory: { code: 6006, category: ts.DiagnosticCategory.Message, key: "Redirect output structure to the directory." },
|
|
Do_not_erase_const_enum_declarations_in_generated_code: { code: 6007, category: ts.DiagnosticCategory.Message, key: "Do not erase const enum declarations in generated code." },
|
|
Do_not_emit_outputs_if_any_errors_were_reported: { code: 6008, category: ts.DiagnosticCategory.Message, key: "Do not emit outputs if any errors were reported." },
|
|
Do_not_emit_comments_to_output: { code: 6009, category: ts.DiagnosticCategory.Message, key: "Do not emit comments to output." },
|
|
Do_not_emit_outputs: { code: 6010, category: ts.DiagnosticCategory.Message, key: "Do not emit outputs." },
|
|
Specify_ECMAScript_target_version_Colon_ES3_default_ES5_or_ES6_experimental: { code: 6015, category: ts.DiagnosticCategory.Message, key: "Specify ECMAScript target version: 'ES3' (default), 'ES5', or 'ES6' (experimental)" },
|
|
Specify_module_code_generation_Colon_commonjs_amd_system_or_umd: { code: 6016, category: ts.DiagnosticCategory.Message, key: "Specify module code generation: 'commonjs', 'amd', 'system' or 'umd'" },
|
|
Print_this_message: { code: 6017, category: ts.DiagnosticCategory.Message, key: "Print this message." },
|
|
Print_the_compiler_s_version: { code: 6019, category: ts.DiagnosticCategory.Message, key: "Print the compiler's version." },
|
|
Compile_the_project_in_the_given_directory: { code: 6020, category: ts.DiagnosticCategory.Message, key: "Compile the project in the given directory." },
|
|
Syntax_Colon_0: { code: 6023, category: ts.DiagnosticCategory.Message, key: "Syntax: {0}" },
|
|
options: { code: 6024, category: ts.DiagnosticCategory.Message, key: "options" },
|
|
file: { code: 6025, category: ts.DiagnosticCategory.Message, key: "file" },
|
|
Examples_Colon_0: { code: 6026, category: ts.DiagnosticCategory.Message, key: "Examples: {0}" },
|
|
Options_Colon: { code: 6027, category: ts.DiagnosticCategory.Message, key: "Options:" },
|
|
Version_0: { code: 6029, category: ts.DiagnosticCategory.Message, key: "Version {0}" },
|
|
Insert_command_line_options_and_files_from_a_file: { code: 6030, category: ts.DiagnosticCategory.Message, key: "Insert command line options and files from a file." },
|
|
File_change_detected_Starting_incremental_compilation: { code: 6032, category: ts.DiagnosticCategory.Message, key: "File change detected. Starting incremental compilation..." },
|
|
KIND: { code: 6034, category: ts.DiagnosticCategory.Message, key: "KIND" },
|
|
FILE: { code: 6035, category: ts.DiagnosticCategory.Message, key: "FILE" },
|
|
VERSION: { code: 6036, category: ts.DiagnosticCategory.Message, key: "VERSION" },
|
|
LOCATION: { code: 6037, category: ts.DiagnosticCategory.Message, key: "LOCATION" },
|
|
DIRECTORY: { code: 6038, category: ts.DiagnosticCategory.Message, key: "DIRECTORY" },
|
|
Compilation_complete_Watching_for_file_changes: { code: 6042, category: ts.DiagnosticCategory.Message, key: "Compilation complete. Watching for file changes." },
|
|
Generates_corresponding_map_file: { code: 6043, category: ts.DiagnosticCategory.Message, key: "Generates corresponding '.map' file." },
|
|
Compiler_option_0_expects_an_argument: { code: 6044, category: ts.DiagnosticCategory.Error, key: "Compiler option '{0}' expects an argument." },
|
|
Unterminated_quoted_string_in_response_file_0: { code: 6045, category: ts.DiagnosticCategory.Error, key: "Unterminated quoted string in response file '{0}'." },
|
|
Argument_for_module_option_must_be_commonjs_amd_system_or_umd: { code: 6046, category: ts.DiagnosticCategory.Error, key: "Argument for '--module' option must be 'commonjs', 'amd', 'system' or 'umd'." },
|
|
Argument_for_target_option_must_be_ES3_ES5_or_ES6: { code: 6047, category: ts.DiagnosticCategory.Error, key: "Argument for '--target' option must be 'ES3', 'ES5', or 'ES6'." },
|
|
Locale_must_be_of_the_form_language_or_language_territory_For_example_0_or_1: { code: 6048, category: ts.DiagnosticCategory.Error, key: "Locale must be of the form <language> or <language>-<territory>. For example '{0}' or '{1}'." },
|
|
Unsupported_locale_0: { code: 6049, category: ts.DiagnosticCategory.Error, key: "Unsupported locale '{0}'." },
|
|
Unable_to_open_file_0: { code: 6050, category: ts.DiagnosticCategory.Error, key: "Unable to open file '{0}'." },
|
|
Corrupted_locale_file_0: { code: 6051, category: ts.DiagnosticCategory.Error, key: "Corrupted locale file {0}." },
|
|
Raise_error_on_expressions_and_declarations_with_an_implied_any_type: { code: 6052, category: ts.DiagnosticCategory.Message, key: "Raise error on expressions and declarations with an implied 'any' type." },
|
|
File_0_not_found: { code: 6053, category: ts.DiagnosticCategory.Error, key: "File '{0}' not found." },
|
|
File_0_has_unsupported_extension_The_only_supported_extensions_are_1: { code: 6054, category: ts.DiagnosticCategory.Error, key: "File '{0}' has unsupported extension. The only supported extensions are {1}." },
|
|
Suppress_noImplicitAny_errors_for_indexing_objects_lacking_index_signatures: { code: 6055, category: ts.DiagnosticCategory.Message, key: "Suppress noImplicitAny errors for indexing objects lacking index signatures." },
|
|
Do_not_emit_declarations_for_code_that_has_an_internal_annotation: { code: 6056, category: ts.DiagnosticCategory.Message, key: "Do not emit declarations for code that has an '@internal' annotation." },
|
|
Specifies_the_root_directory_of_input_files_Use_to_control_the_output_directory_structure_with_outDir: { code: 6058, category: ts.DiagnosticCategory.Message, key: "Specifies 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: { code: 6059, category: ts.DiagnosticCategory.Error, key: "File '{0}' is not under 'rootDir' '{1}'. 'rootDir' is expected to contain all source files." },
|
|
Specifies_the_end_of_line_sequence_to_be_used_when_emitting_files_Colon_CRLF_dos_or_LF_unix: { code: 6060, category: ts.DiagnosticCategory.Message, key: "Specifies the end of line sequence to be used when emitting files: 'CRLF' (dos) or 'LF' (unix)." },
|
|
NEWLINE: { code: 6061, category: ts.DiagnosticCategory.Message, key: "NEWLINE" },
|
|
Argument_for_newLine_option_must_be_CRLF_or_LF: { code: 6062, category: ts.DiagnosticCategory.Error, key: "Argument for '--newLine' option must be 'CRLF' or 'LF'." },
|
|
Specify_JSX_code_generation_Colon_preserve_or_react: { code: 6080, category: ts.DiagnosticCategory.Message, key: "Specify JSX code generation: 'preserve' or 'react'" },
|
|
Argument_for_jsx_must_be_preserve_or_react: { code: 6081, category: ts.DiagnosticCategory.Message, key: "Argument for '--jsx' must be 'preserve' or 'react'." },
|
|
Option_experimentalDecorators_must_also_be_specified_when_option_emitDecoratorMetadata_is_specified: { code: 6064, category: ts.DiagnosticCategory.Error, key: "Option 'experimentalDecorators' must also be specified when option 'emitDecoratorMetadata' is specified." },
|
|
Enables_experimental_support_for_ES7_decorators: { code: 6065, category: ts.DiagnosticCategory.Message, key: "Enables experimental support for ES7 decorators." },
|
|
Enables_experimental_support_for_emitting_type_metadata_for_decorators: { code: 6066, category: ts.DiagnosticCategory.Message, key: "Enables experimental support for emitting type metadata for decorators." },
|
|
Option_experimentalAsyncFunctions_cannot_be_specified_when_targeting_ES5_or_lower: { code: 6067, category: ts.DiagnosticCategory.Message, key: "Option 'experimentalAsyncFunctions' cannot be specified when targeting ES5 or lower." },
|
|
Enables_experimental_support_for_ES7_async_functions: { code: 6068, category: ts.DiagnosticCategory.Message, key: "Enables experimental support for ES7 async functions." },
|
|
Variable_0_implicitly_has_an_1_type: { code: 7005, category: ts.DiagnosticCategory.Error, key: "Variable '{0}' implicitly has an '{1}' type." },
|
|
Parameter_0_implicitly_has_an_1_type: { code: 7006, category: ts.DiagnosticCategory.Error, key: "Parameter '{0}' implicitly has an '{1}' type." },
|
|
Member_0_implicitly_has_an_1_type: { code: 7008, category: ts.DiagnosticCategory.Error, key: "Member '{0}' implicitly has an '{1}' type." },
|
|
new_expression_whose_target_lacks_a_construct_signature_implicitly_has_an_any_type: { code: 7009, category: ts.DiagnosticCategory.Error, key: "'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: { code: 7010, category: ts.DiagnosticCategory.Error, key: "'{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: { code: 7011, category: ts.DiagnosticCategory.Error, key: "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: { code: 7013, category: ts.DiagnosticCategory.Error, key: "Construct signature, which lacks return-type annotation, implicitly has an 'any' return type." },
|
|
Property_0_implicitly_has_type_any_because_its_set_accessor_lacks_a_type_annotation: { code: 7016, category: ts.DiagnosticCategory.Error, key: "Property '{0}' implicitly has type 'any', because its 'set' accessor lacks a type annotation." },
|
|
Index_signature_of_object_type_implicitly_has_an_any_type: { code: 7017, category: ts.DiagnosticCategory.Error, key: "Index signature of object type implicitly has an 'any' type." },
|
|
Object_literal_s_property_0_implicitly_has_an_1_type: { code: 7018, category: ts.DiagnosticCategory.Error, key: "Object literal's property '{0}' implicitly has an '{1}' type." },
|
|
Rest_parameter_0_implicitly_has_an_any_type: { code: 7019, category: ts.DiagnosticCategory.Error, key: "Rest parameter '{0}' implicitly has an 'any[]' type." },
|
|
Call_signature_which_lacks_return_type_annotation_implicitly_has_an_any_return_type: { code: 7020, category: ts.DiagnosticCategory.Error, key: "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: { code: 7022, category: ts.DiagnosticCategory.Error, key: "'{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: { code: 7023, category: ts.DiagnosticCategory.Error, key: "'{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: { code: 7024, category: ts.DiagnosticCategory.Error, key: "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_type_0_because_it_does_not_yield_any_values_Consider_supplying_a_return_type: { code: 7025, category: ts.DiagnosticCategory.Error, key: "Generator implicitly has type '{0}' because it does not yield any values. Consider supplying a return type." },
|
|
JSX_element_implicitly_has_type_any_because_no_interface_JSX_0_exists: { code: 7026, category: ts.DiagnosticCategory.Error, key: "JSX element implicitly has type 'any' because no interface 'JSX.{0}' exists" },
|
|
You_cannot_rename_this_element: { code: 8000, category: ts.DiagnosticCategory.Error, key: "You cannot rename this element." },
|
|
You_cannot_rename_elements_that_are_defined_in_the_standard_TypeScript_library: { code: 8001, category: ts.DiagnosticCategory.Error, key: "You cannot rename elements that are defined in the standard TypeScript library." },
|
|
import_can_only_be_used_in_a_ts_file: { code: 8002, category: ts.DiagnosticCategory.Error, key: "'import ... =' can only be used in a .ts file." },
|
|
export_can_only_be_used_in_a_ts_file: { code: 8003, category: ts.DiagnosticCategory.Error, key: "'export=' can only be used in a .ts file." },
|
|
type_parameter_declarations_can_only_be_used_in_a_ts_file: { code: 8004, category: ts.DiagnosticCategory.Error, key: "'type parameter declarations' can only be used in a .ts file." },
|
|
implements_clauses_can_only_be_used_in_a_ts_file: { code: 8005, category: ts.DiagnosticCategory.Error, key: "'implements clauses' can only be used in a .ts file." },
|
|
interface_declarations_can_only_be_used_in_a_ts_file: { code: 8006, category: ts.DiagnosticCategory.Error, key: "'interface declarations' can only be used in a .ts file." },
|
|
module_declarations_can_only_be_used_in_a_ts_file: { code: 8007, category: ts.DiagnosticCategory.Error, key: "'module declarations' can only be used in a .ts file." },
|
|
type_aliases_can_only_be_used_in_a_ts_file: { code: 8008, category: ts.DiagnosticCategory.Error, key: "'type aliases' can only be used in a .ts file." },
|
|
_0_can_only_be_used_in_a_ts_file: { code: 8009, category: ts.DiagnosticCategory.Error, key: "'{0}' can only be used in a .ts file." },
|
|
types_can_only_be_used_in_a_ts_file: { code: 8010, category: ts.DiagnosticCategory.Error, key: "'types' can only be used in a .ts file." },
|
|
type_arguments_can_only_be_used_in_a_ts_file: { code: 8011, category: ts.DiagnosticCategory.Error, key: "'type arguments' can only be used in a .ts file." },
|
|
parameter_modifiers_can_only_be_used_in_a_ts_file: { code: 8012, category: ts.DiagnosticCategory.Error, key: "'parameter modifiers' can only be used in a .ts file." },
|
|
property_declarations_can_only_be_used_in_a_ts_file: { code: 8014, category: ts.DiagnosticCategory.Error, key: "'property declarations' can only be used in a .ts file." },
|
|
enum_declarations_can_only_be_used_in_a_ts_file: { code: 8015, category: ts.DiagnosticCategory.Error, key: "'enum declarations' can only be used in a .ts file." },
|
|
type_assertion_expressions_can_only_be_used_in_a_ts_file: { code: 8016, category: ts.DiagnosticCategory.Error, key: "'type assertion expressions' can only be used in a .ts file." },
|
|
decorators_can_only_be_used_in_a_ts_file: { code: 8017, category: ts.DiagnosticCategory.Error, key: "'decorators' can only be used in a .ts file." },
|
|
Only_identifiers_Slashqualified_names_with_optional_type_arguments_are_currently_supported_in_a_class_extends_clauses: { code: 9002, category: ts.DiagnosticCategory.Error, key: "Only identifiers/qualified-names with optional type arguments are currently supported in a class 'extends' clauses." },
|
|
class_expressions_are_not_currently_supported: { code: 9003, category: ts.DiagnosticCategory.Error, key: "'class' expressions are not currently supported." },
|
|
JSX_attributes_must_only_be_assigned_a_non_empty_expression: { code: 17000, category: ts.DiagnosticCategory.Error, key: "JSX attributes must only be assigned a non-empty 'expression'." },
|
|
JSX_elements_cannot_have_multiple_attributes_with_the_same_name: { code: 17001, category: ts.DiagnosticCategory.Error, key: "JSX elements cannot have multiple attributes with the same name." },
|
|
Expected_corresponding_JSX_closing_tag_for_0: { code: 17002, category: ts.DiagnosticCategory.Error, key: "Expected corresponding JSX closing tag for '{0}'." },
|
|
JSX_attribute_expected: { code: 17003, category: ts.DiagnosticCategory.Error, key: "JSX attribute expected." },
|
|
Cannot_use_JSX_unless_the_jsx_flag_is_provided: { code: 17004, category: ts.DiagnosticCategory.Error, key: "Cannot use JSX unless the '--jsx' flag is provided." }
|
|
};
|
|
})(ts || (ts = {}));
|
|
/// <reference path="core.ts"/>
|
|
/// <reference path="diagnosticInformationMap.generated.ts"/>
|
|
var ts;
|
|
(function (ts) {
|
|
var textToToken = {
|
|
"abstract": 112 /* AbstractKeyword */,
|
|
"any": 114 /* AnyKeyword */,
|
|
"as": 113 /* AsKeyword */,
|
|
"boolean": 117 /* BooleanKeyword */,
|
|
"break": 67 /* BreakKeyword */,
|
|
"case": 68 /* CaseKeyword */,
|
|
"catch": 69 /* CatchKeyword */,
|
|
"class": 70 /* ClassKeyword */,
|
|
"continue": 72 /* ContinueKeyword */,
|
|
"const": 71 /* ConstKeyword */,
|
|
"constructor": 118 /* ConstructorKeyword */,
|
|
"debugger": 73 /* DebuggerKeyword */,
|
|
"declare": 119 /* DeclareKeyword */,
|
|
"default": 74 /* DefaultKeyword */,
|
|
"delete": 75 /* DeleteKeyword */,
|
|
"do": 76 /* DoKeyword */,
|
|
"else": 77 /* ElseKeyword */,
|
|
"enum": 78 /* EnumKeyword */,
|
|
"export": 79 /* ExportKeyword */,
|
|
"extends": 80 /* ExtendsKeyword */,
|
|
"false": 81 /* FalseKeyword */,
|
|
"finally": 82 /* FinallyKeyword */,
|
|
"for": 83 /* ForKeyword */,
|
|
"from": 130 /* FromKeyword */,
|
|
"function": 84 /* FunctionKeyword */,
|
|
"get": 120 /* GetKeyword */,
|
|
"if": 85 /* IfKeyword */,
|
|
"implements": 103 /* ImplementsKeyword */,
|
|
"import": 86 /* ImportKeyword */,
|
|
"in": 87 /* InKeyword */,
|
|
"instanceof": 88 /* InstanceOfKeyword */,
|
|
"interface": 104 /* InterfaceKeyword */,
|
|
"is": 121 /* IsKeyword */,
|
|
"let": 105 /* LetKeyword */,
|
|
"module": 122 /* ModuleKeyword */,
|
|
"namespace": 123 /* NamespaceKeyword */,
|
|
"new": 89 /* NewKeyword */,
|
|
"null": 90 /* NullKeyword */,
|
|
"number": 125 /* NumberKeyword */,
|
|
"package": 106 /* PackageKeyword */,
|
|
"private": 107 /* PrivateKeyword */,
|
|
"protected": 108 /* ProtectedKeyword */,
|
|
"public": 109 /* PublicKeyword */,
|
|
"require": 124 /* RequireKeyword */,
|
|
"return": 91 /* ReturnKeyword */,
|
|
"set": 126 /* SetKeyword */,
|
|
"static": 110 /* StaticKeyword */,
|
|
"string": 127 /* StringKeyword */,
|
|
"super": 92 /* SuperKeyword */,
|
|
"switch": 93 /* SwitchKeyword */,
|
|
"symbol": 128 /* SymbolKeyword */,
|
|
"this": 94 /* ThisKeyword */,
|
|
"throw": 95 /* ThrowKeyword */,
|
|
"true": 96 /* TrueKeyword */,
|
|
"try": 97 /* TryKeyword */,
|
|
"type": 129 /* TypeKeyword */,
|
|
"typeof": 98 /* TypeOfKeyword */,
|
|
"var": 99 /* VarKeyword */,
|
|
"void": 100 /* VoidKeyword */,
|
|
"while": 101 /* WhileKeyword */,
|
|
"with": 102 /* WithKeyword */,
|
|
"yield": 111 /* YieldKeyword */,
|
|
"async": 115 /* AsyncKeyword */,
|
|
"await": 116 /* AwaitKeyword */,
|
|
"of": 131 /* OfKeyword */,
|
|
"{": 14 /* OpenBraceToken */,
|
|
"}": 15 /* CloseBraceToken */,
|
|
"(": 16 /* OpenParenToken */,
|
|
")": 17 /* CloseParenToken */,
|
|
"[": 18 /* OpenBracketToken */,
|
|
"]": 19 /* CloseBracketToken */,
|
|
".": 20 /* DotToken */,
|
|
"...": 21 /* DotDotDotToken */,
|
|
";": 22 /* SemicolonToken */,
|
|
",": 23 /* CommaToken */,
|
|
"<": 24 /* LessThanToken */,
|
|
">": 26 /* GreaterThanToken */,
|
|
"<=": 27 /* LessThanEqualsToken */,
|
|
">=": 28 /* GreaterThanEqualsToken */,
|
|
"==": 29 /* EqualsEqualsToken */,
|
|
"!=": 30 /* ExclamationEqualsToken */,
|
|
"===": 31 /* EqualsEqualsEqualsToken */,
|
|
"!==": 32 /* ExclamationEqualsEqualsToken */,
|
|
"=>": 33 /* EqualsGreaterThanToken */,
|
|
"+": 34 /* PlusToken */,
|
|
"-": 35 /* MinusToken */,
|
|
"*": 36 /* AsteriskToken */,
|
|
"/": 37 /* SlashToken */,
|
|
"%": 38 /* PercentToken */,
|
|
"++": 39 /* PlusPlusToken */,
|
|
"--": 40 /* MinusMinusToken */,
|
|
"<<": 41 /* LessThanLessThanToken */,
|
|
"</": 25 /* LessThanSlashToken */,
|
|
">>": 42 /* GreaterThanGreaterThanToken */,
|
|
">>>": 43 /* GreaterThanGreaterThanGreaterThanToken */,
|
|
"&": 44 /* AmpersandToken */,
|
|
"|": 45 /* BarToken */,
|
|
"^": 46 /* CaretToken */,
|
|
"!": 47 /* ExclamationToken */,
|
|
"~": 48 /* TildeToken */,
|
|
"&&": 49 /* AmpersandAmpersandToken */,
|
|
"||": 50 /* BarBarToken */,
|
|
"?": 51 /* QuestionToken */,
|
|
":": 52 /* ColonToken */,
|
|
"=": 54 /* EqualsToken */,
|
|
"+=": 55 /* PlusEqualsToken */,
|
|
"-=": 56 /* MinusEqualsToken */,
|
|
"*=": 57 /* AsteriskEqualsToken */,
|
|
"/=": 58 /* SlashEqualsToken */,
|
|
"%=": 59 /* PercentEqualsToken */,
|
|
"<<=": 60 /* LessThanLessThanEqualsToken */,
|
|
">>=": 61 /* GreaterThanGreaterThanEqualsToken */,
|
|
">>>=": 62 /* GreaterThanGreaterThanGreaterThanEqualsToken */,
|
|
"&=": 63 /* AmpersandEqualsToken */,
|
|
"|=": 64 /* BarEqualsToken */,
|
|
"^=": 65 /* CaretEqualsToken */,
|
|
"@": 53 /* AtToken */
|
|
};
|
|
/*
|
|
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,];
|
|
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 >= 1 /* ES5 */ ?
|
|
lookupInUnicodeMap(code, unicodeES5IdentifierStart) :
|
|
lookupInUnicodeMap(code, unicodeES3IdentifierStart);
|
|
}
|
|
ts.isUnicodeIdentifierStart = isUnicodeIdentifierStart;
|
|
function isUnicodeIdentifierPart(code, languageVersion) {
|
|
return languageVersion >= 1 /* ES5 */ ?
|
|
lookupInUnicodeMap(code, unicodeES5IdentifierPart) :
|
|
lookupInUnicodeMap(code, unicodeES3IdentifierPart);
|
|
}
|
|
function makeReverseMap(source) {
|
|
var result = [];
|
|
for (var name_4 in source) {
|
|
if (source.hasOwnProperty(name_4)) {
|
|
result[source[name_4]] = name_4;
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
var tokenStrings = makeReverseMap(textToToken);
|
|
function tokenToString(t) {
|
|
return tokenStrings[t];
|
|
}
|
|
ts.tokenToString = tokenToString;
|
|
/* @internal */
|
|
function stringToToken(s) {
|
|
return textToToken[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++);
|
|
switch (ch) {
|
|
case 13 /* carriageReturn */:
|
|
if (text.charCodeAt(pos) === 10 /* lineFeed */) {
|
|
pos++;
|
|
}
|
|
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) {
|
|
return computePositionOfLineAndCharacter(getLineStarts(sourceFile), line, character);
|
|
}
|
|
ts.getPositionOfLineAndCharacter = getPositionOfLineAndCharacter;
|
|
/* @internal */
|
|
function computePositionOfLineAndCharacter(lineStarts, line, character) {
|
|
ts.Debug.assert(line >= 0 && line < lineStarts.length);
|
|
return lineStarts[line] + character;
|
|
}
|
|
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 = ts.binarySearch(lineStarts, position);
|
|
if (lineNumber < 0) {
|
|
// If the actual position was not found,
|
|
// the binary search returns the negative value 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
|
|
lineNumber = ~lineNumber - 1;
|
|
}
|
|
return {
|
|
line: lineNumber,
|
|
character: position - lineStarts[lineNumber]
|
|
};
|
|
}
|
|
ts.computeLineAndCharacterOfPosition = computeLineAndCharacterOfPosition;
|
|
function getLineAndCharacterOfPosition(sourceFile, position) {
|
|
return computeLineAndCharacterOfPosition(getLineStarts(sourceFile), position);
|
|
}
|
|
ts.getLineAndCharacterOfPosition = getLineAndCharacterOfPosition;
|
|
var hasOwnProperty = Object.prototype.hasOwnProperty;
|
|
function isWhiteSpace(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.isWhiteSpace = isWhiteSpace;
|
|
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 */;
|
|
}
|
|
/* @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
|
|
case 60 /* lessThan */:
|
|
case 61 /* equals */:
|
|
case 62 /* greaterThan */:
|
|
// Starts of conflict marker trivia
|
|
return true;
|
|
default:
|
|
return ch > 127 /* maxAsciiCharacter */;
|
|
}
|
|
}
|
|
ts.couldStartTrivia = couldStartTrivia;
|
|
/* @internal */
|
|
function skipTrivia(text, pos, stopAfterLineBreak) {
|
|
// 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++;
|
|
}
|
|
case 10 /* lineFeed */:
|
|
pos++;
|
|
if (stopAfterLineBreak) {
|
|
return pos;
|
|
}
|
|
continue;
|
|
case 9 /* tab */:
|
|
case 11 /* verticalTab */:
|
|
case 12 /* formFeed */:
|
|
case 32 /* space */:
|
|
pos++;
|
|
continue;
|
|
case 47 /* slash */:
|
|
if (text.charCodeAt(pos + 1) === 47 /* slash */) {
|
|
pos += 2;
|
|
while (pos < text.length) {
|
|
if (isLineBreak(text.charCodeAt(pos))) {
|
|
break;
|
|
}
|
|
pos++;
|
|
}
|
|
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++;
|
|
}
|
|
continue;
|
|
}
|
|
break;
|
|
case 60 /* lessThan */:
|
|
case 61 /* equals */:
|
|
case 62 /* greaterThan */:
|
|
if (isConflictMarkerTrivia(text, pos)) {
|
|
pos = scanConflictMarkerTrivia(text, pos);
|
|
continue;
|
|
}
|
|
break;
|
|
default:
|
|
if (ch > 127 /* maxAsciiCharacter */ && (isWhiteSpace(ch) || isLineBreak(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 followd 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, n = mergeConflictMarkerLength; i < n; 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, 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 === 61 /* equals */);
|
|
// Consume everything from the start of the mid-conlict marker to the start of the next
|
|
// end-conflict marker.
|
|
while (pos < len) {
|
|
var ch_1 = text.charCodeAt(pos);
|
|
if (ch_1 === 62 /* greaterThan */ && isConflictMarkerTrivia(text, pos)) {
|
|
break;
|
|
}
|
|
pos++;
|
|
}
|
|
}
|
|
return pos;
|
|
}
|
|
// Extract comments from the given source text starting at the given position. If trailing is
|
|
// false, whitespace is skipped until the first line break and comments between that location
|
|
// and the next token are returned.If trailing is true, comments occurring between the given
|
|
// position and the next line break are returned.The return value is an array containing a
|
|
// TextRange for each comment. Single-line comment ranges include the beginning '//' characters
|
|
// but not the ending line break. Multi - line comment ranges include the beginning '/* and
|
|
// ending '*/' characters.The return value is undefined if no comments were found.
|
|
function getCommentRanges(text, pos, trailing) {
|
|
var result;
|
|
var collecting = trailing || pos === 0;
|
|
while (true) {
|
|
var ch = text.charCodeAt(pos);
|
|
switch (ch) {
|
|
case 13 /* carriageReturn */:
|
|
if (text.charCodeAt(pos + 1) === 10 /* lineFeed */) {
|
|
pos++;
|
|
}
|
|
case 10 /* lineFeed */:
|
|
pos++;
|
|
if (trailing) {
|
|
return result;
|
|
}
|
|
collecting = true;
|
|
if (result && result.length) {
|
|
ts.lastOrUndefined(result).hasTrailingNewLine = 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 (!result) {
|
|
result = [];
|
|
}
|
|
result.push({ pos: startPos, end: pos, hasTrailingNewLine: hasTrailingNewLine, kind: kind });
|
|
}
|
|
continue;
|
|
}
|
|
break;
|
|
default:
|
|
if (ch > 127 /* maxAsciiCharacter */ && (isWhiteSpace(ch) || isLineBreak(ch))) {
|
|
if (result && result.length && isLineBreak(ch)) {
|
|
ts.lastOrUndefined(result).hasTrailingNewLine = true;
|
|
}
|
|
pos++;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
return result;
|
|
}
|
|
}
|
|
function getLeadingCommentRanges(text, pos) {
|
|
return getCommentRanges(text, pos, false);
|
|
}
|
|
ts.getLeadingCommentRanges = getLeadingCommentRanges;
|
|
function getTrailingCommentRanges(text, pos) {
|
|
return getCommentRanges(text, pos, true);
|
|
}
|
|
ts.getTrailingCommentRanges = getTrailingCommentRanges;
|
|
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) {
|
|
return ch >= 65 /* A */ && ch <= 90 /* Z */ || ch >= 97 /* a */ && ch <= 122 /* z */ ||
|
|
ch >= 48 /* _0 */ && ch <= 57 /* _9 */ || ch === 36 /* $ */ || ch === 95 /* _ */ ||
|
|
ch > 127 /* maxAsciiCharacter */ && isUnicodeIdentifierPart(ch, languageVersion);
|
|
}
|
|
ts.isIdentifierPart = isIdentifierPart;
|
|
/* @internal */
|
|
// Creates a scanner over a (possibly unspecified) range of a piece of text.
|
|
function createScanner(languageVersion, skipTrivia, languageVariant, text, onError, start, length) {
|
|
if (languageVariant === void 0) { languageVariant = 0 /* Standard */; }
|
|
// 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 precedingLineBreak;
|
|
var hasExtendedUnicodeEscape;
|
|
var tokenIsUnterminated;
|
|
setText(text, start, length);
|
|
return {
|
|
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; },
|
|
hasExtendedUnicodeEscape: function () { return hasExtendedUnicodeEscape; },
|
|
hasPrecedingLineBreak: function () { return precedingLineBreak; },
|
|
isIdentifier: function () { return token === 66 /* Identifier */ || token > 102 /* LastReservedWord */; },
|
|
isReservedWord: function () { return token >= 67 /* FirstReservedWord */ && token <= 102 /* LastReservedWord */; },
|
|
isUnterminated: function () { return tokenIsUnterminated; },
|
|
reScanGreaterToken: reScanGreaterToken,
|
|
reScanSlashToken: reScanSlashToken,
|
|
reScanTemplateToken: reScanTemplateToken,
|
|
scanJsxIdentifier: scanJsxIdentifier,
|
|
reScanJsxToken: reScanJsxToken,
|
|
scanJsxToken: scanJsxToken,
|
|
scan: scan,
|
|
setText: setText,
|
|
setScriptTarget: setScriptTarget,
|
|
setLanguageVariant: setLanguageVariant,
|
|
setOnError: setOnError,
|
|
setTextPos: setTextPos,
|
|
tryScan: tryScan,
|
|
lookAhead: lookAhead
|
|
};
|
|
function error(message, length) {
|
|
if (onError) {
|
|
onError(message, length || 0);
|
|
}
|
|
}
|
|
function isIdentifierStart(ch) {
|
|
return ch >= 65 /* A */ && ch <= 90 /* Z */ || ch >= 97 /* a */ && ch <= 122 /* z */ ||
|
|
ch === 36 /* $ */ || ch === 95 /* _ */ ||
|
|
ch > 127 /* maxAsciiCharacter */ && isUnicodeIdentifierStart(ch, languageVersion);
|
|
}
|
|
function isIdentifierPart(ch) {
|
|
return ch >= 65 /* A */ && ch <= 90 /* Z */ || ch >= 97 /* a */ && ch <= 122 /* z */ ||
|
|
ch >= 48 /* _0 */ && ch <= 57 /* _9 */ || ch === 36 /* $ */ || ch === 95 /* _ */ ||
|
|
ch > 127 /* maxAsciiCharacter */ && isUnicodeIdentifierPart(ch, languageVersion);
|
|
}
|
|
function scanNumber() {
|
|
var start = pos;
|
|
while (isDigit(text.charCodeAt(pos)))
|
|
pos++;
|
|
if (text.charCodeAt(pos) === 46 /* dot */) {
|
|
pos++;
|
|
while (isDigit(text.charCodeAt(pos)))
|
|
pos++;
|
|
}
|
|
var end = pos;
|
|
if (text.charCodeAt(pos) === 69 /* E */ || text.charCodeAt(pos) === 101 /* e */) {
|
|
pos++;
|
|
if (text.charCodeAt(pos) === 43 /* plus */ || text.charCodeAt(pos) === 45 /* minus */)
|
|
pos++;
|
|
if (isDigit(text.charCodeAt(pos))) {
|
|
pos++;
|
|
while (isDigit(text.charCodeAt(pos)))
|
|
pos++;
|
|
end = pos;
|
|
}
|
|
else {
|
|
error(ts.Diagnostics.Digit_expected);
|
|
}
|
|
}
|
|
return +(text.substring(start, end));
|
|
}
|
|
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) {
|
|
return scanHexDigits(count, false);
|
|
}
|
|
/**
|
|
* Scans as many hexadecimal digits as are available in the text,
|
|
* returning -1 if the given number of digits was unavailable.
|
|
*/
|
|
function scanMinimumNumberOfHexDigits(count) {
|
|
return scanHexDigits(count, true);
|
|
}
|
|
function scanHexDigits(minCount, scanAsManyAsPossible) {
|
|
var digits = 0;
|
|
var value = 0;
|
|
while (digits < minCount || scanAsManyAsPossible) {
|
|
var ch = text.charCodeAt(pos);
|
|
if (ch >= 48 /* _0 */ && ch <= 57 /* _9 */) {
|
|
value = value * 16 + ch - 48 /* _0 */;
|
|
}
|
|
else if (ch >= 65 /* A */ && ch <= 70 /* F */) {
|
|
value = value * 16 + ch - 65 /* A */ + 10;
|
|
}
|
|
else if (ch >= 97 /* a */ && ch <= 102 /* f */) {
|
|
value = value * 16 + ch - 97 /* a */ + 10;
|
|
}
|
|
else {
|
|
break;
|
|
}
|
|
pos++;
|
|
digits++;
|
|
}
|
|
if (digits < minCount) {
|
|
value = -1;
|
|
}
|
|
return value;
|
|
}
|
|
function scanString() {
|
|
var quote = text.charCodeAt(pos++);
|
|
var result = "";
|
|
var start = pos;
|
|
while (true) {
|
|
if (pos >= end) {
|
|
result += text.substring(start, pos);
|
|
tokenIsUnterminated = true;
|
|
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 */) {
|
|
result += text.substring(start, pos);
|
|
result += scanEscapeSequence();
|
|
start = pos;
|
|
continue;
|
|
}
|
|
if (isLineBreak(ch)) {
|
|
result += text.substring(start, pos);
|
|
tokenIsUnterminated = true;
|
|
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() {
|
|
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);
|
|
tokenIsUnterminated = true;
|
|
error(ts.Diagnostics.Unterminated_template_literal);
|
|
resultingToken = startedWithBacktick ? 10 /* NoSubstitutionTemplateLiteral */ : 13 /* TemplateTail */;
|
|
break;
|
|
}
|
|
var currChar = text.charCodeAt(pos);
|
|
// '`'
|
|
if (currChar === 96 /* backtick */) {
|
|
contents += text.substring(start, pos);
|
|
pos++;
|
|
resultingToken = startedWithBacktick ? 10 /* NoSubstitutionTemplateLiteral */ : 13 /* TemplateTail */;
|
|
break;
|
|
}
|
|
// '${'
|
|
if (currChar === 36 /* $ */ && pos + 1 < end && text.charCodeAt(pos + 1) === 123 /* openBrace */) {
|
|
contents += text.substring(start, pos);
|
|
pos += 2;
|
|
resultingToken = startedWithBacktick ? 11 /* TemplateHead */ : 12 /* TemplateMiddle */;
|
|
break;
|
|
}
|
|
// Escape character
|
|
if (currChar === 92 /* backslash */) {
|
|
contents += text.substring(start, pos);
|
|
contents += scanEscapeSequence();
|
|
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() {
|
|
pos++;
|
|
if (pos >= end) {
|
|
error(ts.Diagnostics.Unexpected_end_of_text);
|
|
return "";
|
|
}
|
|
var ch = text.charCodeAt(pos++);
|
|
switch (ch) {
|
|
case 48 /* _0 */:
|
|
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 */:
|
|
// '\u{DDDDDDDD}'
|
|
if (pos < end && text.charCodeAt(pos) === 123 /* openBrace */) {
|
|
hasExtendedUnicodeEscape = true;
|
|
pos++;
|
|
return scanExtendedUnicodeEscape();
|
|
}
|
|
// '\uDDDD'
|
|
return scanHexadecimalEscape(4);
|
|
case 120 /* x */:
|
|
// '\xDD'
|
|
return scanHexadecimalEscape(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++;
|
|
}
|
|
// fall through
|
|
case 10 /* lineFeed */:
|
|
case 8232 /* lineSeparator */:
|
|
case 8233 /* paragraphSeparator */:
|
|
return "";
|
|
default:
|
|
return String.fromCharCode(ch);
|
|
}
|
|
}
|
|
function scanHexadecimalEscape(numDigits) {
|
|
var escapedValue = scanExactNumberOfHexDigits(numDigits);
|
|
if (escapedValue >= 0) {
|
|
return String.fromCharCode(escapedValue);
|
|
}
|
|
else {
|
|
error(ts.Diagnostics.Hexadecimal_digit_expected);
|
|
return "";
|
|
}
|
|
}
|
|
function scanExtendedUnicodeEscape() {
|
|
var escapedValue = scanMinimumNumberOfHexDigits(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);
|
|
}
|
|
// Derived from the 10.1.1 UTF16Encoding of the ES6 Spec.
|
|
function utf16EncodeAsString(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);
|
|
}
|
|
// 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);
|
|
pos = start_1;
|
|
return value;
|
|
}
|
|
return -1;
|
|
}
|
|
function scanIdentifierParts() {
|
|
var result = "";
|
|
var start = pos;
|
|
while (pos < end) {
|
|
var ch = text.charCodeAt(pos);
|
|
if (isIdentifierPart(ch)) {
|
|
pos++;
|
|
}
|
|
else if (ch === 92 /* backslash */) {
|
|
ch = peekUnicodeEscape();
|
|
if (!(ch >= 0 && isIdentifierPart(ch))) {
|
|
break;
|
|
}
|
|
result += text.substring(start, pos);
|
|
result += String.fromCharCode(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 11 characters long and start with a lowercase letter
|
|
var len = tokenValue.length;
|
|
if (len >= 2 && len <= 11) {
|
|
var ch = tokenValue.charCodeAt(0);
|
|
if (ch >= 97 /* a */ && ch <= 122 /* z */ && hasOwnProperty.call(textToToken, tokenValue)) {
|
|
return token = textToToken[tokenValue];
|
|
}
|
|
}
|
|
return token = 66 /* Identifier */;
|
|
}
|
|
function scanBinaryOrOctalDigits(base) {
|
|
ts.Debug.assert(base !== 2 || base !== 8, "Expected either base 2 or base 8");
|
|
var value = 0;
|
|
// 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 numberOfDigits = 0;
|
|
while (true) {
|
|
var ch = text.charCodeAt(pos);
|
|
var valueOfCh = ch - 48 /* _0 */;
|
|
if (!isDigit(ch) || valueOfCh >= base) {
|
|
break;
|
|
}
|
|
value = value * base + valueOfCh;
|
|
pos++;
|
|
numberOfDigits++;
|
|
}
|
|
// Invalid binaryIntegerLiteral or octalIntegerLiteral
|
|
if (numberOfDigits === 0) {
|
|
return -1;
|
|
}
|
|
return value;
|
|
}
|
|
function scan() {
|
|
startPos = pos;
|
|
hasExtendedUnicodeEscape = false;
|
|
precedingLineBreak = false;
|
|
tokenIsUnterminated = false;
|
|
while (true) {
|
|
tokenPos = pos;
|
|
if (pos >= end) {
|
|
return token = 1 /* EndOfFileToken */;
|
|
}
|
|
var ch = text.charCodeAt(pos);
|
|
switch (ch) {
|
|
case 10 /* lineFeed */:
|
|
case 13 /* carriageReturn */:
|
|
precedingLineBreak = true;
|
|
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 */:
|
|
if (skipTrivia) {
|
|
pos++;
|
|
continue;
|
|
}
|
|
else {
|
|
while (pos < end && isWhiteSpace(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 = 32 /* ExclamationEqualsEqualsToken */;
|
|
}
|
|
return pos += 2, token = 30 /* ExclamationEqualsToken */;
|
|
}
|
|
return pos++, token = 47 /* ExclamationToken */;
|
|
case 34 /* doubleQuote */:
|
|
case 39 /* singleQuote */:
|
|
tokenValue = scanString();
|
|
return token = 8 /* StringLiteral */;
|
|
case 96 /* backtick */:
|
|
return token = scanTemplateAndSetTokenValue();
|
|
case 37 /* percent */:
|
|
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
|
|
return pos += 2, token = 59 /* PercentEqualsToken */;
|
|
}
|
|
return pos++, token = 38 /* PercentToken */;
|
|
case 38 /* ampersand */:
|
|
if (text.charCodeAt(pos + 1) === 38 /* ampersand */) {
|
|
return pos += 2, token = 49 /* AmpersandAmpersandToken */;
|
|
}
|
|
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
|
|
return pos += 2, token = 63 /* AmpersandEqualsToken */;
|
|
}
|
|
return pos++, token = 44 /* AmpersandToken */;
|
|
case 40 /* openParen */:
|
|
return pos++, token = 16 /* OpenParenToken */;
|
|
case 41 /* closeParen */:
|
|
return pos++, token = 17 /* CloseParenToken */;
|
|
case 42 /* asterisk */:
|
|
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
|
|
return pos += 2, token = 57 /* AsteriskEqualsToken */;
|
|
}
|
|
return pos++, token = 36 /* AsteriskToken */;
|
|
case 43 /* plus */:
|
|
if (text.charCodeAt(pos + 1) === 43 /* plus */) {
|
|
return pos += 2, token = 39 /* PlusPlusToken */;
|
|
}
|
|
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
|
|
return pos += 2, token = 55 /* PlusEqualsToken */;
|
|
}
|
|
return pos++, token = 34 /* PlusToken */;
|
|
case 44 /* comma */:
|
|
return pos++, token = 23 /* CommaToken */;
|
|
case 45 /* minus */:
|
|
if (text.charCodeAt(pos + 1) === 45 /* minus */) {
|
|
return pos += 2, token = 40 /* MinusMinusToken */;
|
|
}
|
|
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
|
|
return pos += 2, token = 56 /* MinusEqualsToken */;
|
|
}
|
|
return pos++, token = 35 /* MinusToken */;
|
|
case 46 /* dot */:
|
|
if (isDigit(text.charCodeAt(pos + 1))) {
|
|
tokenValue = "" + scanNumber();
|
|
return token = 7 /* NumericLiteral */;
|
|
}
|
|
if (text.charCodeAt(pos + 1) === 46 /* dot */ && text.charCodeAt(pos + 2) === 46 /* dot */) {
|
|
return pos += 3, token = 21 /* DotDotDotToken */;
|
|
}
|
|
return pos++, token = 20 /* 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++;
|
|
}
|
|
if (skipTrivia) {
|
|
continue;
|
|
}
|
|
else {
|
|
return token = 2 /* SingleLineCommentTrivia */;
|
|
}
|
|
}
|
|
// Multi-line comment
|
|
if (text.charCodeAt(pos + 1) === 42 /* asterisk */) {
|
|
pos += 2;
|
|
var commentClosed = false;
|
|
while (pos < end) {
|
|
var ch_2 = text.charCodeAt(pos);
|
|
if (ch_2 === 42 /* asterisk */ && text.charCodeAt(pos + 1) === 47 /* slash */) {
|
|
pos += 2;
|
|
commentClosed = true;
|
|
break;
|
|
}
|
|
if (isLineBreak(ch_2)) {
|
|
precedingLineBreak = true;
|
|
}
|
|
pos++;
|
|
}
|
|
if (!commentClosed) {
|
|
error(ts.Diagnostics.Asterisk_Slash_expected);
|
|
}
|
|
if (skipTrivia) {
|
|
continue;
|
|
}
|
|
else {
|
|
tokenIsUnterminated = !commentClosed;
|
|
return token = 3 /* MultiLineCommentTrivia */;
|
|
}
|
|
}
|
|
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
|
|
return pos += 2, token = 58 /* SlashEqualsToken */;
|
|
}
|
|
return pos++, token = 37 /* SlashToken */;
|
|
case 48 /* _0 */:
|
|
if (pos + 2 < end && (text.charCodeAt(pos + 1) === 88 /* X */ || text.charCodeAt(pos + 1) === 120 /* x */)) {
|
|
pos += 2;
|
|
var value = scanMinimumNumberOfHexDigits(1);
|
|
if (value < 0) {
|
|
error(ts.Diagnostics.Hexadecimal_digit_expected);
|
|
value = 0;
|
|
}
|
|
tokenValue = "" + value;
|
|
return token = 7 /* NumericLiteral */;
|
|
}
|
|
else if (pos + 2 < end && (text.charCodeAt(pos + 1) === 66 /* B */ || text.charCodeAt(pos + 1) === 98 /* b */)) {
|
|
pos += 2;
|
|
var value = scanBinaryOrOctalDigits(2);
|
|
if (value < 0) {
|
|
error(ts.Diagnostics.Binary_digit_expected);
|
|
value = 0;
|
|
}
|
|
tokenValue = "" + value;
|
|
return token = 7 /* NumericLiteral */;
|
|
}
|
|
else if (pos + 2 < end && (text.charCodeAt(pos + 1) === 79 /* O */ || text.charCodeAt(pos + 1) === 111 /* o */)) {
|
|
pos += 2;
|
|
var value = scanBinaryOrOctalDigits(8);
|
|
if (value < 0) {
|
|
error(ts.Diagnostics.Octal_digit_expected);
|
|
value = 0;
|
|
}
|
|
tokenValue = "" + value;
|
|
return token = 7 /* NumericLiteral */;
|
|
}
|
|
// Try to parse as an octal
|
|
if (pos + 1 < end && isOctalDigit(text.charCodeAt(pos + 1))) {
|
|
tokenValue = "" + scanOctalDigits();
|
|
return token = 7 /* 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).
|
|
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 */:
|
|
tokenValue = "" + scanNumber();
|
|
return token = 7 /* NumericLiteral */;
|
|
case 58 /* colon */:
|
|
return pos++, token = 52 /* ColonToken */;
|
|
case 59 /* semicolon */:
|
|
return pos++, token = 22 /* SemicolonToken */;
|
|
case 60 /* lessThan */:
|
|
if (isConflictMarkerTrivia(text, pos)) {
|
|
pos = scanConflictMarkerTrivia(text, pos, error);
|
|
if (skipTrivia) {
|
|
continue;
|
|
}
|
|
else {
|
|
return token = 6 /* ConflictMarkerTrivia */;
|
|
}
|
|
}
|
|
if (text.charCodeAt(pos + 1) === 60 /* lessThan */) {
|
|
if (text.charCodeAt(pos + 2) === 61 /* equals */) {
|
|
return pos += 3, token = 60 /* LessThanLessThanEqualsToken */;
|
|
}
|
|
return pos += 2, token = 41 /* LessThanLessThanToken */;
|
|
}
|
|
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
|
|
return pos += 2, token = 27 /* LessThanEqualsToken */;
|
|
}
|
|
if (text.charCodeAt(pos + 1) === 47 /* slash */ && languageVariant === 1 /* JSX */) {
|
|
return pos += 2, token = 25 /* LessThanSlashToken */;
|
|
}
|
|
return pos++, token = 24 /* LessThanToken */;
|
|
case 61 /* equals */:
|
|
if (isConflictMarkerTrivia(text, pos)) {
|
|
pos = scanConflictMarkerTrivia(text, pos, error);
|
|
if (skipTrivia) {
|
|
continue;
|
|
}
|
|
else {
|
|
return token = 6 /* ConflictMarkerTrivia */;
|
|
}
|
|
}
|
|
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
|
|
if (text.charCodeAt(pos + 2) === 61 /* equals */) {
|
|
return pos += 3, token = 31 /* EqualsEqualsEqualsToken */;
|
|
}
|
|
return pos += 2, token = 29 /* EqualsEqualsToken */;
|
|
}
|
|
if (text.charCodeAt(pos + 1) === 62 /* greaterThan */) {
|
|
return pos += 2, token = 33 /* EqualsGreaterThanToken */;
|
|
}
|
|
return pos++, token = 54 /* EqualsToken */;
|
|
case 62 /* greaterThan */:
|
|
if (isConflictMarkerTrivia(text, pos)) {
|
|
pos = scanConflictMarkerTrivia(text, pos, error);
|
|
if (skipTrivia) {
|
|
continue;
|
|
}
|
|
else {
|
|
return token = 6 /* ConflictMarkerTrivia */;
|
|
}
|
|
}
|
|
return pos++, token = 26 /* GreaterThanToken */;
|
|
case 63 /* question */:
|
|
return pos++, token = 51 /* QuestionToken */;
|
|
case 91 /* openBracket */:
|
|
return pos++, token = 18 /* OpenBracketToken */;
|
|
case 93 /* closeBracket */:
|
|
return pos++, token = 19 /* CloseBracketToken */;
|
|
case 94 /* caret */:
|
|
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
|
|
return pos += 2, token = 65 /* CaretEqualsToken */;
|
|
}
|
|
return pos++, token = 46 /* CaretToken */;
|
|
case 123 /* openBrace */:
|
|
return pos++, token = 14 /* OpenBraceToken */;
|
|
case 124 /* bar */:
|
|
if (text.charCodeAt(pos + 1) === 124 /* bar */) {
|
|
return pos += 2, token = 50 /* BarBarToken */;
|
|
}
|
|
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
|
|
return pos += 2, token = 64 /* BarEqualsToken */;
|
|
}
|
|
return pos++, token = 45 /* BarToken */;
|
|
case 125 /* closeBrace */:
|
|
return pos++, token = 15 /* CloseBraceToken */;
|
|
case 126 /* tilde */:
|
|
return pos++, token = 48 /* TildeToken */;
|
|
case 64 /* at */:
|
|
return pos++, token = 53 /* AtToken */;
|
|
case 92 /* backslash */:
|
|
var cookedChar = peekUnicodeEscape();
|
|
if (cookedChar >= 0 && isIdentifierStart(cookedChar)) {
|
|
pos += 6;
|
|
tokenValue = String.fromCharCode(cookedChar) + scanIdentifierParts();
|
|
return token = getIdentifierToken();
|
|
}
|
|
error(ts.Diagnostics.Invalid_character);
|
|
return pos++, token = 0 /* Unknown */;
|
|
default:
|
|
if (isIdentifierStart(ch)) {
|
|
pos++;
|
|
while (pos < end && isIdentifierPart(ch = text.charCodeAt(pos)))
|
|
pos++;
|
|
tokenValue = text.substring(tokenPos, pos);
|
|
if (ch === 92 /* backslash */) {
|
|
tokenValue += scanIdentifierParts();
|
|
}
|
|
return token = getIdentifierToken();
|
|
}
|
|
else if (isWhiteSpace(ch)) {
|
|
pos++;
|
|
continue;
|
|
}
|
|
else if (isLineBreak(ch)) {
|
|
precedingLineBreak = true;
|
|
pos++;
|
|
continue;
|
|
}
|
|
error(ts.Diagnostics.Invalid_character);
|
|
return pos++, token = 0 /* Unknown */;
|
|
}
|
|
}
|
|
}
|
|
function reScanGreaterToken() {
|
|
if (token === 26 /* 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 = 62 /* GreaterThanGreaterThanGreaterThanEqualsToken */;
|
|
}
|
|
return pos += 2, token = 43 /* GreaterThanGreaterThanGreaterThanToken */;
|
|
}
|
|
if (text.charCodeAt(pos + 1) === 61 /* equals */) {
|
|
return pos += 2, token = 61 /* GreaterThanGreaterThanEqualsToken */;
|
|
}
|
|
return pos++, token = 42 /* GreaterThanGreaterThanToken */;
|
|
}
|
|
if (text.charCodeAt(pos) === 61 /* equals */) {
|
|
return pos++, token = 28 /* GreaterThanEqualsToken */;
|
|
}
|
|
}
|
|
return token;
|
|
}
|
|
function reScanSlashToken() {
|
|
if (token === 37 /* SlashToken */ || token === 58 /* 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) {
|
|
tokenIsUnterminated = true;
|
|
error(ts.Diagnostics.Unterminated_regular_expression_literal);
|
|
break;
|
|
}
|
|
var ch = text.charCodeAt(p);
|
|
if (isLineBreak(ch)) {
|
|
tokenIsUnterminated = true;
|
|
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))) {
|
|
p++;
|
|
}
|
|
pos = p;
|
|
tokenValue = text.substring(tokenPos, pos);
|
|
token = 9 /* RegularExpressionLiteral */;
|
|
}
|
|
return token;
|
|
}
|
|
/**
|
|
* Unconditionally back up and scan a template expression portion.
|
|
*/
|
|
function reScanTemplateToken() {
|
|
ts.Debug.assert(token === 15 /* CloseBraceToken */, "'reScanTemplateToken' should only be called on a '}'");
|
|
pos = tokenPos;
|
|
return token = scanTemplateAndSetTokenValue();
|
|
}
|
|
function reScanJsxToken() {
|
|
pos = tokenPos = startPos;
|
|
return token = scanJsxToken();
|
|
}
|
|
function scanJsxToken() {
|
|
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 = 25 /* LessThanSlashToken */;
|
|
}
|
|
pos++;
|
|
return token = 24 /* LessThanToken */;
|
|
}
|
|
if (char === 123 /* openBrace */) {
|
|
pos++;
|
|
return token = 14 /* OpenBraceToken */;
|
|
}
|
|
while (pos < end) {
|
|
pos++;
|
|
char = text.charCodeAt(pos);
|
|
if ((char === 123 /* openBrace */) || (char === 60 /* lessThan */)) {
|
|
break;
|
|
}
|
|
}
|
|
return token = 233 /* JsxText */;
|
|
}
|
|
// Scans a JSX identifier; these differ from normal identifiers in that
|
|
// they allow dashes
|
|
function scanJsxIdentifier() {
|
|
if (token === 66 /* Identifier */) {
|
|
var firstCharPosition = pos;
|
|
while (pos < end) {
|
|
var ch = text.charCodeAt(pos);
|
|
if (ch === 45 /* minus */ || ((firstCharPosition === pos) ? isIdentifierStart(ch) : isIdentifierPart(ch))) {
|
|
pos++;
|
|
}
|
|
else {
|
|
break;
|
|
}
|
|
}
|
|
tokenValue += text.substr(firstCharPosition, pos - firstCharPosition);
|
|
}
|
|
return token;
|
|
}
|
|
function speculationHelper(callback, isLookahead) {
|
|
var savePos = pos;
|
|
var saveStartPos = startPos;
|
|
var saveTokenPos = tokenPos;
|
|
var saveToken = token;
|
|
var saveTokenValue = tokenValue;
|
|
var savePrecedingLineBreak = precedingLineBreak;
|
|
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;
|
|
precedingLineBreak = savePrecedingLineBreak;
|
|
}
|
|
return result;
|
|
}
|
|
function lookAhead(callback) {
|
|
return speculationHelper(callback, true);
|
|
}
|
|
function tryScan(callback) {
|
|
return speculationHelper(callback, false);
|
|
}
|
|
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 */;
|
|
precedingLineBreak = false;
|
|
tokenValue = undefined;
|
|
hasExtendedUnicodeEscape = false;
|
|
tokenIsUnterminated = false;
|
|
}
|
|
}
|
|
ts.createScanner = createScanner;
|
|
})(ts || (ts = {}));
|
|
/// <reference path="parser.ts"/>
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
ts.bindTime = 0;
|
|
(function (ModuleInstanceState) {
|
|
ModuleInstanceState[ModuleInstanceState["NonInstantiated"] = 0] = "NonInstantiated";
|
|
ModuleInstanceState[ModuleInstanceState["Instantiated"] = 1] = "Instantiated";
|
|
ModuleInstanceState[ModuleInstanceState["ConstEnumOnly"] = 2] = "ConstEnumOnly";
|
|
})(ts.ModuleInstanceState || (ts.ModuleInstanceState = {}));
|
|
var ModuleInstanceState = ts.ModuleInstanceState;
|
|
function getModuleInstanceState(node) {
|
|
// A module is uninstantiated if it contains only
|
|
// 1. interface declarations, type alias declarations
|
|
if (node.kind === 212 /* InterfaceDeclaration */ || node.kind === 213 /* TypeAliasDeclaration */) {
|
|
return 0 /* NonInstantiated */;
|
|
}
|
|
else if (ts.isConstEnumDeclaration(node)) {
|
|
return 2 /* ConstEnumOnly */;
|
|
}
|
|
else if ((node.kind === 219 /* ImportDeclaration */ || node.kind === 218 /* ImportEqualsDeclaration */) && !(node.flags & 1 /* Export */)) {
|
|
return 0 /* NonInstantiated */;
|
|
}
|
|
else if (node.kind === 216 /* ModuleBlock */) {
|
|
var state = 0 /* NonInstantiated */;
|
|
ts.forEachChild(node, function (n) {
|
|
switch (getModuleInstanceState(n)) {
|
|
case 0 /* NonInstantiated */:
|
|
// child is non-instantiated - continue searching
|
|
return false;
|
|
case 2 /* ConstEnumOnly */:
|
|
// child is const enum only - record state and continue searching
|
|
state = 2 /* ConstEnumOnly */;
|
|
return false;
|
|
case 1 /* Instantiated */:
|
|
// child is instantiated - record state and stop
|
|
state = 1 /* Instantiated */;
|
|
return true;
|
|
}
|
|
});
|
|
return state;
|
|
}
|
|
else if (node.kind === 215 /* ModuleDeclaration */) {
|
|
return getModuleInstanceState(node.body);
|
|
}
|
|
else {
|
|
return 1 /* Instantiated */;
|
|
}
|
|
}
|
|
ts.getModuleInstanceState = getModuleInstanceState;
|
|
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";
|
|
ContainerFlags[ContainerFlags["HasLocals"] = 4] = "HasLocals";
|
|
// If the current node is a container that also container that also contains locals. Examples:
|
|
//
|
|
// Functions, Methods, Modules, Source-files.
|
|
ContainerFlags[ContainerFlags["IsContainerWithLocals"] = 5] = "IsContainerWithLocals";
|
|
})(ContainerFlags || (ContainerFlags = {}));
|
|
function bindSourceFile(file) {
|
|
var start = new Date().getTime();
|
|
bindSourceFileWorker(file);
|
|
ts.bindTime += new Date().getTime() - start;
|
|
}
|
|
ts.bindSourceFile = bindSourceFile;
|
|
function bindSourceFileWorker(file) {
|
|
var parent;
|
|
var container;
|
|
var blockScopeContainer;
|
|
var lastContainer;
|
|
// 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).
|
|
var inStrictMode = !!file.externalModuleIndicator;
|
|
var symbolCount = 0;
|
|
var Symbol = ts.objectAllocator.getSymbolConstructor();
|
|
var classifiableNames = {};
|
|
if (!file.locals) {
|
|
bind(file);
|
|
file.symbolCount = symbolCount;
|
|
file.classifiableNames = classifiableNames;
|
|
}
|
|
return;
|
|
function createSymbol(flags, name) {
|
|
symbolCount++;
|
|
return new Symbol(flags, name);
|
|
}
|
|
function addDeclarationToSymbol(symbol, node, symbolFlags) {
|
|
symbol.flags |= symbolFlags;
|
|
node.symbol = symbol;
|
|
if (!symbol.declarations) {
|
|
symbol.declarations = [];
|
|
}
|
|
symbol.declarations.push(node);
|
|
if (symbolFlags & 1952 /* HasExports */ && !symbol.exports) {
|
|
symbol.exports = {};
|
|
}
|
|
if (symbolFlags & 6240 /* HasMembers */ && !symbol.members) {
|
|
symbol.members = {};
|
|
}
|
|
if (symbolFlags & 107455 /* Value */ && !symbol.valueDeclaration) {
|
|
symbol.valueDeclaration = 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.name) {
|
|
if (node.kind === 215 /* ModuleDeclaration */ && node.name.kind === 8 /* StringLiteral */) {
|
|
return '"' + node.name.text + '"';
|
|
}
|
|
if (node.name.kind === 133 /* ComputedPropertyName */) {
|
|
var nameExpression = node.name.expression;
|
|
ts.Debug.assert(ts.isWellKnownSymbolSyntactically(nameExpression));
|
|
return ts.getPropertyNameForKnownSymbolName(nameExpression.name.text);
|
|
}
|
|
return node.name.text;
|
|
}
|
|
switch (node.kind) {
|
|
case 141 /* Constructor */:
|
|
return "__constructor";
|
|
case 149 /* FunctionType */:
|
|
case 144 /* CallSignature */:
|
|
return "__call";
|
|
case 150 /* ConstructorType */:
|
|
case 145 /* ConstructSignature */:
|
|
return "__new";
|
|
case 146 /* IndexSignature */:
|
|
return "__index";
|
|
case 225 /* ExportDeclaration */:
|
|
return "__export";
|
|
case 224 /* ExportAssignment */:
|
|
return node.isExportEquals ? "export=" : "default";
|
|
case 210 /* FunctionDeclaration */:
|
|
case 211 /* ClassDeclaration */:
|
|
return node.flags & 1024 /* Default */ ? "default" : undefined;
|
|
}
|
|
}
|
|
function getDisplayName(node) {
|
|
return node.name ? ts.declarationNameToString(node.name) : 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) {
|
|
ts.Debug.assert(!ts.hasDynamicName(node));
|
|
// The exported symbol for an export default function/class node is always named "default"
|
|
var name = node.flags & 1024 /* Default */ && parent ? "default" : getDeclarationName(node);
|
|
var symbol;
|
|
if (name !== undefined) {
|
|
// 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.
|
|
//
|
|
// 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 = ts.hasProperty(symbolTable, name)
|
|
? symbolTable[name]
|
|
: (symbolTable[name] = createSymbol(0 /* None */, name));
|
|
if (name && (includes & 788448 /* Classifiable */)) {
|
|
classifiableNames[name] = name;
|
|
}
|
|
if (symbol.flags & excludes) {
|
|
if (node.name) {
|
|
node.name.parent = node;
|
|
}
|
|
// Report errors every position with duplicate declaration
|
|
// Report errors on previous encountered declarations
|
|
var message = symbol.flags & 2 /* BlockScopedVariable */
|
|
? ts.Diagnostics.Cannot_redeclare_block_scoped_variable_0
|
|
: ts.Diagnostics.Duplicate_identifier_0;
|
|
ts.forEach(symbol.declarations, function (declaration) {
|
|
file.bindDiagnostics.push(ts.createDiagnosticForNode(declaration.name || declaration, message, getDisplayName(declaration)));
|
|
});
|
|
file.bindDiagnostics.push(ts.createDiagnosticForNode(node.name || node, message, getDisplayName(node)));
|
|
symbol = createSymbol(0 /* None */, name);
|
|
}
|
|
}
|
|
else {
|
|
symbol = createSymbol(0 /* None */, "__missing");
|
|
}
|
|
addDeclarationToSymbol(symbol, node, includes);
|
|
symbol.parent = parent;
|
|
return symbol;
|
|
}
|
|
function declareModuleMember(node, symbolFlags, symbolExcludes) {
|
|
var hasExportModifier = ts.getCombinedNodeFlags(node) & 1 /* Export */;
|
|
if (symbolFlags & 8388608 /* Alias */) {
|
|
if (node.kind === 227 /* ExportSpecifier */ || (node.kind === 218 /* ImportEqualsDeclaration */ && hasExportModifier)) {
|
|
return declareSymbol(container.symbol.exports, container.symbol, node, symbolFlags, symbolExcludes);
|
|
}
|
|
else {
|
|
return declareSymbol(container.locals, undefined, node, symbolFlags, symbolExcludes);
|
|
}
|
|
}
|
|
else {
|
|
// Exported module members are given 2 symbols: A local symbol that is classified with an ExportValue,
|
|
// ExportType, or ExportContainer 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.
|
|
if (hasExportModifier || container.flags & 262144 /* ExportContext */) {
|
|
var exportKind = (symbolFlags & 107455 /* Value */ ? 1048576 /* ExportValue */ : 0) |
|
|
(symbolFlags & 793056 /* Type */ ? 2097152 /* ExportType */ : 0) |
|
|
(symbolFlags & 1536 /* Namespace */ ? 4194304 /* ExportNamespace */ : 0);
|
|
var local = declareSymbol(container.locals, 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, undefined, node, symbolFlags, symbolExcludes);
|
|
}
|
|
}
|
|
}
|
|
// 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 bindChildren(node) {
|
|
// Before we recurse into a node's chilren, 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 saveParent = parent;
|
|
var saveContainer = container;
|
|
var savedBlockScopeContainer = blockScopeContainer;
|
|
// This node will now be set as the parent of all of its children as we recurse into them.
|
|
parent = node;
|
|
// 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 proactively 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 accidently move any stale data forward from
|
|
// a previous compilation.
|
|
var containerFlags = getContainerFlags(node);
|
|
if (containerFlags & 1 /* IsContainer */) {
|
|
container = blockScopeContainer = node;
|
|
if (containerFlags & 4 /* HasLocals */) {
|
|
container.locals = {};
|
|
}
|
|
addToContainerChain(container);
|
|
}
|
|
else if (containerFlags & 2 /* IsBlockScopedContainer */) {
|
|
blockScopeContainer = node;
|
|
blockScopeContainer.locals = undefined;
|
|
}
|
|
ts.forEachChild(node, bind);
|
|
container = saveContainer;
|
|
parent = saveParent;
|
|
blockScopeContainer = savedBlockScopeContainer;
|
|
}
|
|
function getContainerFlags(node) {
|
|
switch (node.kind) {
|
|
case 183 /* ClassExpression */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 152 /* TypeLiteral */:
|
|
case 162 /* ObjectLiteralExpression */:
|
|
return 1 /* IsContainer */;
|
|
case 144 /* CallSignature */:
|
|
case 145 /* ConstructSignature */:
|
|
case 146 /* IndexSignature */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 141 /* Constructor */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 149 /* FunctionType */:
|
|
case 150 /* ConstructorType */:
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
case 215 /* ModuleDeclaration */:
|
|
case 245 /* SourceFile */:
|
|
case 213 /* TypeAliasDeclaration */:
|
|
return 5 /* IsContainerWithLocals */;
|
|
case 241 /* CatchClause */:
|
|
case 196 /* ForStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
case 217 /* CaseBlock */:
|
|
return 2 /* IsBlockScopedContainer */;
|
|
case 189 /* 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. Othewise '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) ? 0 /* None */ : 2 /* IsBlockScopedContainer */;
|
|
}
|
|
return 0 /* None */;
|
|
}
|
|
function addToContainerChain(next) {
|
|
if (lastContainer) {
|
|
lastContainer.nextContainer = next;
|
|
}
|
|
lastContainer = next;
|
|
}
|
|
function declareSymbolAndAddToSymbolTable(node, symbolFlags, symbolExcludes) {
|
|
// Just call this directly so that the return type of this function stays "void".
|
|
declareSymbolAndAddToSymbolTableWorker(node, symbolFlags, symbolExcludes);
|
|
}
|
|
function declareSymbolAndAddToSymbolTableWorker(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 215 /* ModuleDeclaration */:
|
|
return declareModuleMember(node, symbolFlags, symbolExcludes);
|
|
case 245 /* SourceFile */:
|
|
return declareSourceFileMember(node, symbolFlags, symbolExcludes);
|
|
case 183 /* ClassExpression */:
|
|
case 211 /* ClassDeclaration */:
|
|
return declareClassMember(node, symbolFlags, symbolExcludes);
|
|
case 214 /* EnumDeclaration */:
|
|
return declareSymbol(container.symbol.exports, container.symbol, node, symbolFlags, symbolExcludes);
|
|
case 152 /* TypeLiteral */:
|
|
case 162 /* ObjectLiteralExpression */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
// 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 149 /* FunctionType */:
|
|
case 150 /* ConstructorType */:
|
|
case 144 /* CallSignature */:
|
|
case 145 /* ConstructSignature */:
|
|
case 146 /* IndexSignature */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 141 /* Constructor */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
case 213 /* TypeAliasDeclaration */:
|
|
// 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, undefined, node, symbolFlags, symbolExcludes);
|
|
}
|
|
}
|
|
function declareClassMember(node, symbolFlags, symbolExcludes) {
|
|
return node.flags & 128 /* Static */
|
|
? 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, undefined, node, symbolFlags, symbolExcludes);
|
|
}
|
|
function isAmbientContext(node) {
|
|
while (node) {
|
|
if (node.flags & 2 /* Ambient */) {
|
|
return true;
|
|
}
|
|
node = node.parent;
|
|
}
|
|
return false;
|
|
}
|
|
function hasExportDeclarations(node) {
|
|
var body = node.kind === 245 /* SourceFile */ ? node : node.body;
|
|
if (body.kind === 245 /* SourceFile */ || body.kind === 216 /* ModuleBlock */) {
|
|
for (var _i = 0, _a = body.statements; _i < _a.length; _i++) {
|
|
var stat = _a[_i];
|
|
if (stat.kind === 225 /* ExportDeclaration */ || stat.kind === 224 /* ExportAssignment */) {
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
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 (isAmbientContext(node) && !hasExportDeclarations(node)) {
|
|
node.flags |= 262144 /* ExportContext */;
|
|
}
|
|
else {
|
|
node.flags &= ~262144 /* ExportContext */;
|
|
}
|
|
}
|
|
function bindModuleDeclaration(node) {
|
|
setExportContextFlag(node);
|
|
if (node.name.kind === 8 /* StringLiteral */) {
|
|
declareSymbolAndAddToSymbolTable(node, 512 /* ValueModule */, 106639 /* ValueModuleExcludes */);
|
|
}
|
|
else {
|
|
var state = getModuleInstanceState(node);
|
|
if (state === 0 /* NonInstantiated */) {
|
|
declareSymbolAndAddToSymbolTable(node, 1024 /* NamespaceModule */, 0 /* NamespaceModuleExcludes */);
|
|
}
|
|
else {
|
|
declareSymbolAndAddToSymbolTable(node, 512 /* ValueModule */, 106639 /* ValueModuleExcludes */);
|
|
var currentModuleIsConstEnumOnly = state === 2 /* ConstEnumOnly */;
|
|
if (node.symbol.constEnumOnlyModule === undefined) {
|
|
// non-merged case - use the current state
|
|
node.symbol.constEnumOnlyModule = currentModuleIsConstEnumOnly;
|
|
}
|
|
else {
|
|
// merged case: module is const enum only if all its pieces are non-instantiated or const enum
|
|
node.symbol.constEnumOnlyModule = node.symbol.constEnumOnlyModule && currentModuleIsConstEnumOnly;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
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));
|
|
addDeclarationToSymbol(symbol, node, 131072 /* Signature */);
|
|
var typeLiteralSymbol = createSymbol(2048 /* TypeLiteral */, "__type");
|
|
addDeclarationToSymbol(typeLiteralSymbol, node, 2048 /* TypeLiteral */);
|
|
typeLiteralSymbol.members = (_a = {}, _a[symbol.name] = symbol, _a);
|
|
var _a;
|
|
}
|
|
function bindObjectLiteralExpression(node) {
|
|
var ElementKind;
|
|
(function (ElementKind) {
|
|
ElementKind[ElementKind["Property"] = 1] = "Property";
|
|
ElementKind[ElementKind["Accessor"] = 2] = "Accessor";
|
|
})(ElementKind || (ElementKind = {}));
|
|
if (inStrictMode) {
|
|
var seen = {};
|
|
for (var _i = 0, _a = node.properties; _i < _a.length; _i++) {
|
|
var prop = _a[_i];
|
|
if (prop.name.kind !== 66 /* Identifier */) {
|
|
continue;
|
|
}
|
|
var identifier = prop.name;
|
|
// ECMA-262 11.1.5 Object Initialiser
|
|
// 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 === 242 /* PropertyAssignment */ || prop.kind === 243 /* ShorthandPropertyAssignment */ || prop.kind === 140 /* MethodDeclaration */
|
|
? 1 /* Property */
|
|
: 2 /* Accessor */;
|
|
var existingKind = seen[identifier.text];
|
|
if (!existingKind) {
|
|
seen[identifier.text] = 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");
|
|
}
|
|
function bindAnonymousDeclaration(node, symbolFlags, name) {
|
|
var symbol = createSymbol(symbolFlags, name);
|
|
addDeclarationToSymbol(symbol, node, symbolFlags);
|
|
}
|
|
function bindBlockScopedDeclaration(node, symbolFlags, symbolExcludes) {
|
|
switch (blockScopeContainer.kind) {
|
|
case 215 /* ModuleDeclaration */:
|
|
declareModuleMember(node, symbolFlags, symbolExcludes);
|
|
break;
|
|
case 245 /* SourceFile */:
|
|
if (ts.isExternalModule(container)) {
|
|
declareModuleMember(node, symbolFlags, symbolExcludes);
|
|
break;
|
|
}
|
|
// fall through.
|
|
default:
|
|
if (!blockScopeContainer.locals) {
|
|
blockScopeContainer.locals = {};
|
|
addToContainerChain(blockScopeContainer);
|
|
}
|
|
declareSymbol(blockScopeContainer.locals, undefined, node, symbolFlags, symbolExcludes);
|
|
}
|
|
}
|
|
function bindBlockScopedVariableDeclaration(node) {
|
|
bindBlockScopedDeclaration(node, 2 /* BlockScopedVariable */, 107455 /* BlockScopedVariableExcludes */);
|
|
}
|
|
// 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.
|
|
function checkStrictModeIdentifier(node) {
|
|
if (inStrictMode &&
|
|
node.originalKeywordKind >= 103 /* FirstFutureReservedWord */ &&
|
|
node.originalKeywordKind <= 111 /* LastFutureReservedWord */ &&
|
|
!ts.isIdentifierName(node)) {
|
|
// Report error only if there are no parse errors in file
|
|
if (!file.parseDiagnostics.length) {
|
|
file.bindDiagnostics.push(ts.createDiagnosticForNode(node, getStrictModeIdentifierMessage(node), 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;
|
|
}
|
|
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 === 66 /* 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 node.kind === 66 /* Identifier */ &&
|
|
(node.text === "eval" || node.text === "arguments");
|
|
}
|
|
function checkStrictModeEvalOrArguments(contextNode, name) {
|
|
if (name && name.kind === 66 /* 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), identifier.text));
|
|
}
|
|
}
|
|
}
|
|
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.Invalid_use_of_0_Class_definitions_are_automatically_in_strict_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 checkStrictModeNumericLiteral(node) {
|
|
if (inStrictMode && node.flags & 65536 /* OctalLiteral */) {
|
|
file.bindDiagnostics.push(ts.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 === 39 /* PlusPlusToken */ || node.operator === 40 /* MinusMinusToken */) {
|
|
checkStrictModeEvalOrArguments(node, node.operand);
|
|
}
|
|
}
|
|
}
|
|
function checkStrictModeWithStatement(node) {
|
|
// Grammar checking for withStatement
|
|
if (inStrictMode) {
|
|
grammarErrorOnFirstToken(node, ts.Diagnostics.with_statements_are_not_allowed_in_strict_mode);
|
|
}
|
|
}
|
|
function grammarErrorOnFirstToken(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 getDestructuringParameterName(node) {
|
|
return "__" + ts.indexOf(node.parent.parameters, node);
|
|
}
|
|
function bind(node) {
|
|
node.parent = parent;
|
|
var savedInStrictMode = inStrictMode;
|
|
if (!savedInStrictMode) {
|
|
updateStrictMode(node);
|
|
}
|
|
// 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.
|
|
bindChildren(node);
|
|
inStrictMode = savedInStrictMode;
|
|
}
|
|
function updateStrictMode(node) {
|
|
switch (node.kind) {
|
|
case 245 /* SourceFile */:
|
|
case 216 /* ModuleBlock */:
|
|
updateStrictModeStatementList(node.statements);
|
|
return;
|
|
case 189 /* Block */:
|
|
if (ts.isFunctionLike(node.parent)) {
|
|
updateStrictModeStatementList(node.statements);
|
|
}
|
|
return;
|
|
case 211 /* ClassDeclaration */:
|
|
case 183 /* ClassExpression */:
|
|
// All classes are automatically in strict mode in ES6.
|
|
inStrictMode = true;
|
|
return;
|
|
}
|
|
}
|
|
function updateStrictModeStatementList(statements) {
|
|
for (var _i = 0; _i < statements.length; _i++) {
|
|
var statement = statements[_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.getTextOfNodeFromSourceText(file.text, 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) {
|
|
case 66 /* Identifier */:
|
|
return checkStrictModeIdentifier(node);
|
|
case 178 /* BinaryExpression */:
|
|
return checkStrictModeBinaryExpression(node);
|
|
case 241 /* CatchClause */:
|
|
return checkStrictModeCatchClause(node);
|
|
case 172 /* DeleteExpression */:
|
|
return checkStrictModeDeleteExpression(node);
|
|
case 7 /* NumericLiteral */:
|
|
return checkStrictModeNumericLiteral(node);
|
|
case 177 /* PostfixUnaryExpression */:
|
|
return checkStrictModePostfixUnaryExpression(node);
|
|
case 176 /* PrefixUnaryExpression */:
|
|
return checkStrictModePrefixUnaryExpression(node);
|
|
case 202 /* WithStatement */:
|
|
return checkStrictModeWithStatement(node);
|
|
case 134 /* TypeParameter */:
|
|
return declareSymbolAndAddToSymbolTable(node, 262144 /* TypeParameter */, 530912 /* TypeParameterExcludes */);
|
|
case 135 /* Parameter */:
|
|
return bindParameter(node);
|
|
case 208 /* VariableDeclaration */:
|
|
case 160 /* BindingElement */:
|
|
return bindVariableDeclarationOrBindingElement(node);
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
return bindPropertyOrMethodOrAccessor(node, 4 /* Property */ | (node.questionToken ? 536870912 /* Optional */ : 0 /* None */), 107455 /* PropertyExcludes */);
|
|
case 242 /* PropertyAssignment */:
|
|
case 243 /* ShorthandPropertyAssignment */:
|
|
return bindPropertyOrMethodOrAccessor(node, 4 /* Property */, 107455 /* PropertyExcludes */);
|
|
case 244 /* EnumMember */:
|
|
return bindPropertyOrMethodOrAccessor(node, 8 /* EnumMember */, 107455 /* EnumMemberExcludes */);
|
|
case 144 /* CallSignature */:
|
|
case 145 /* ConstructSignature */:
|
|
case 146 /* IndexSignature */:
|
|
return declareSymbolAndAddToSymbolTable(node, 131072 /* Signature */, 0 /* None */);
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* 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 ? 536870912 /* Optional */ : 0 /* None */), ts.isObjectLiteralMethod(node) ? 107455 /* PropertyExcludes */ : 99263 /* MethodExcludes */);
|
|
case 210 /* FunctionDeclaration */:
|
|
checkStrictModeFunctionName(node);
|
|
return declareSymbolAndAddToSymbolTable(node, 16 /* Function */, 106927 /* FunctionExcludes */);
|
|
case 141 /* Constructor */:
|
|
return declareSymbolAndAddToSymbolTable(node, 16384 /* Constructor */, 0 /* None */);
|
|
case 142 /* GetAccessor */:
|
|
return bindPropertyOrMethodOrAccessor(node, 32768 /* GetAccessor */, 41919 /* GetAccessorExcludes */);
|
|
case 143 /* SetAccessor */:
|
|
return bindPropertyOrMethodOrAccessor(node, 65536 /* SetAccessor */, 74687 /* SetAccessorExcludes */);
|
|
case 149 /* FunctionType */:
|
|
case 150 /* ConstructorType */:
|
|
return bindFunctionOrConstructorType(node);
|
|
case 152 /* TypeLiteral */:
|
|
return bindAnonymousDeclaration(node, 2048 /* TypeLiteral */, "__type");
|
|
case 162 /* ObjectLiteralExpression */:
|
|
return bindObjectLiteralExpression(node);
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
checkStrictModeFunctionName(node);
|
|
var bindingName = node.name ? node.name.text : "__function";
|
|
return bindAnonymousDeclaration(node, 16 /* Function */, bindingName);
|
|
case 183 /* ClassExpression */:
|
|
case 211 /* ClassDeclaration */:
|
|
return bindClassLikeDeclaration(node);
|
|
case 212 /* InterfaceDeclaration */:
|
|
return bindBlockScopedDeclaration(node, 64 /* Interface */, 792960 /* InterfaceExcludes */);
|
|
case 213 /* TypeAliasDeclaration */:
|
|
return bindBlockScopedDeclaration(node, 524288 /* TypeAlias */, 793056 /* TypeAliasExcludes */);
|
|
case 214 /* EnumDeclaration */:
|
|
return bindEnumDeclaration(node);
|
|
case 215 /* ModuleDeclaration */:
|
|
return bindModuleDeclaration(node);
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 221 /* NamespaceImport */:
|
|
case 223 /* ImportSpecifier */:
|
|
case 227 /* ExportSpecifier */:
|
|
return declareSymbolAndAddToSymbolTable(node, 8388608 /* Alias */, 8388608 /* AliasExcludes */);
|
|
case 220 /* ImportClause */:
|
|
return bindImportClause(node);
|
|
case 225 /* ExportDeclaration */:
|
|
return bindExportDeclaration(node);
|
|
case 224 /* ExportAssignment */:
|
|
return bindExportAssignment(node);
|
|
case 245 /* SourceFile */:
|
|
return bindSourceFileIfExternalModule();
|
|
}
|
|
}
|
|
function bindSourceFileIfExternalModule() {
|
|
setExportContextFlag(file);
|
|
if (ts.isExternalModule(file)) {
|
|
bindAnonymousDeclaration(file, 512 /* ValueModule */, '"' + ts.removeFileExtension(file.fileName) + '"');
|
|
}
|
|
}
|
|
function bindExportAssignment(node) {
|
|
if (!container.symbol || !container.symbol.exports) {
|
|
// Export assignment in some sort of block construct
|
|
bindAnonymousDeclaration(node, 8388608 /* Alias */, getDeclarationName(node));
|
|
}
|
|
else if (node.expression.kind === 66 /* Identifier */) {
|
|
// An export default clause with an identifier exports all meanings of that identifier
|
|
declareSymbol(container.symbol.exports, container.symbol, node, 8388608 /* Alias */, 107455 /* PropertyExcludes */ | 8388608 /* AliasExcludes */);
|
|
}
|
|
else {
|
|
// An export default clause with an expression exports a value
|
|
declareSymbol(container.symbol.exports, container.symbol, node, 4 /* Property */, 107455 /* PropertyExcludes */ | 8388608 /* AliasExcludes */);
|
|
}
|
|
}
|
|
function bindExportDeclaration(node) {
|
|
if (!container.symbol || !container.symbol.exports) {
|
|
// Export * in some sort of block construct
|
|
bindAnonymousDeclaration(node, 1073741824 /* ExportStar */, getDeclarationName(node));
|
|
}
|
|
else if (!node.exportClause) {
|
|
// All export * declarations are collected in an __export symbol
|
|
declareSymbol(container.symbol.exports, container.symbol, node, 1073741824 /* ExportStar */, 0 /* None */);
|
|
}
|
|
}
|
|
function bindImportClause(node) {
|
|
if (node.name) {
|
|
declareSymbolAndAddToSymbolTable(node, 8388608 /* Alias */, 8388608 /* AliasExcludes */);
|
|
}
|
|
}
|
|
function bindClassLikeDeclaration(node) {
|
|
if (node.kind === 211 /* ClassDeclaration */) {
|
|
bindBlockScopedDeclaration(node, 32 /* Class */, 899519 /* ClassExcludes */);
|
|
}
|
|
else {
|
|
var bindingName = node.name ? node.name.text : "__class";
|
|
bindAnonymousDeclaration(node, 32 /* Class */, bindingName);
|
|
}
|
|
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 */ | 134217728 /* Prototype */, "prototype");
|
|
if (ts.hasProperty(symbol.exports, prototypeSymbol.name)) {
|
|
if (node.name) {
|
|
node.name.parent = node;
|
|
}
|
|
file.bindDiagnostics.push(ts.createDiagnosticForNode(symbol.exports[prototypeSymbol.name].declarations[0], ts.Diagnostics.Duplicate_identifier_0, prototypeSymbol.name));
|
|
}
|
|
symbol.exports[prototypeSymbol.name] = prototypeSymbol;
|
|
prototypeSymbol.parent = symbol;
|
|
}
|
|
function bindEnumDeclaration(node) {
|
|
return ts.isConst(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.isBlockOrCatchScoped(node)) {
|
|
bindBlockScopedVariableDeclaration(node);
|
|
}
|
|
else if (ts.isParameterDeclaration(node)) {
|
|
// It is safe to walk up parent chain to find whether the node is a destructing 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 */, 107455 /* ParameterExcludes */);
|
|
}
|
|
else {
|
|
declareSymbolAndAddToSymbolTable(node, 1 /* FunctionScopedVariable */, 107454 /* FunctionScopedVariableExcludes */);
|
|
}
|
|
}
|
|
}
|
|
function bindParameter(node) {
|
|
if (inStrictMode) {
|
|
// 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 */, getDestructuringParameterName(node));
|
|
}
|
|
else {
|
|
declareSymbolAndAddToSymbolTable(node, 1 /* FunctionScopedVariable */, 107455 /* ParameterExcludes */);
|
|
}
|
|
// If this is a property-parameter, then also declare the property symbol into the
|
|
// containing class.
|
|
if (node.flags & 112 /* AccessibilityModifier */ &&
|
|
node.parent.kind === 141 /* Constructor */ &&
|
|
ts.isClassLike(node.parent.parent)) {
|
|
var classDeclaration = node.parent.parent;
|
|
declareSymbol(classDeclaration.symbol.members, classDeclaration.symbol, node, 4 /* Property */, 107455 /* PropertyExcludes */);
|
|
}
|
|
}
|
|
function bindPropertyOrMethodOrAccessor(node, symbolFlags, symbolExcludes) {
|
|
return ts.hasDynamicName(node)
|
|
? bindAnonymousDeclaration(node, symbolFlags, "__computed")
|
|
: declareSymbolAndAddToSymbolTable(node, symbolFlags, symbolExcludes);
|
|
}
|
|
}
|
|
})(ts || (ts = {}));
|
|
/// <reference path="binder.ts" />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
function getDeclarationOfKind(symbol, kind) {
|
|
var declarations = symbol.declarations;
|
|
if (declarations) {
|
|
for (var _i = 0; _i < declarations.length; _i++) {
|
|
var declaration = declarations[_i];
|
|
if (declaration.kind === kind) {
|
|
return declaration;
|
|
}
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
ts.getDeclarationOfKind = getDeclarationOfKind;
|
|
// Pool writers to avoid needing to allocate them for every symbol we write.
|
|
var stringWriters = [];
|
|
function getSingleLineStringWriter() {
|
|
if (stringWriters.length === 0) {
|
|
var str = "";
|
|
var writeText = function (text) { return str += text; };
|
|
return {
|
|
string: function () { return str; },
|
|
writeKeyword: writeText,
|
|
writeOperator: writeText,
|
|
writePunctuation: writeText,
|
|
writeSpace: writeText,
|
|
writeStringLiteral: writeText,
|
|
writeParameter: writeText,
|
|
writeSymbol: writeText,
|
|
// Completely ignore indentation for string writers. And map newlines to
|
|
// a single space.
|
|
writeLine: function () { return str += " "; },
|
|
increaseIndent: function () { },
|
|
decreaseIndent: function () { },
|
|
clear: function () { return str = ""; },
|
|
trackSymbol: function () { }
|
|
};
|
|
}
|
|
return stringWriters.pop();
|
|
}
|
|
ts.getSingleLineStringWriter = getSingleLineStringWriter;
|
|
function releaseStringWriter(writer) {
|
|
writer.clear();
|
|
stringWriters.push(writer);
|
|
}
|
|
ts.releaseStringWriter = releaseStringWriter;
|
|
function getFullWidth(node) {
|
|
return node.end - node.pos;
|
|
}
|
|
ts.getFullWidth = getFullWidth;
|
|
// Returns true if this node contains a parse error anywhere underneath it.
|
|
function containsParseError(node) {
|
|
aggregateChildData(node);
|
|
return (node.parserContextFlags & 64 /* ThisNodeOrAnySubNodesHasError */) !== 0;
|
|
}
|
|
ts.containsParseError = containsParseError;
|
|
function aggregateChildData(node) {
|
|
if (!(node.parserContextFlags & 128 /* 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.parserContextFlags & 16 /* ThisNodeHasError */) !== 0) ||
|
|
ts.forEachChild(node, containsParseError);
|
|
// If so, mark ourselves accordingly.
|
|
if (thisNodeOrAnySubNodesHasError) {
|
|
node.parserContextFlags |= 64 /* ThisNodeOrAnySubNodesHasError */;
|
|
}
|
|
// Also mark that we've propogated 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.parserContextFlags |= 128 /* HasAggregatedChildData */;
|
|
}
|
|
}
|
|
function getSourceFileOfNode(node) {
|
|
while (node && node.kind !== 245 /* SourceFile */) {
|
|
node = node.parent;
|
|
}
|
|
return node;
|
|
}
|
|
ts.getSourceFileOfNode = getSourceFileOfNode;
|
|
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 getStartPosOfNode(node) {
|
|
return node.pos;
|
|
}
|
|
ts.getStartPosOfNode = getStartPosOfNode;
|
|
// Returns true if this node is missing from the actual source code. 'missing' is different
|
|
// from 'undefined/defined'. When a node is undefined (which can happen for optional nodes
|
|
// in the tree), it is definitel 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) {
|
|
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 getTokenPosOfNode(node, sourceFile) {
|
|
// 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;
|
|
}
|
|
return ts.skipTrivia((sourceFile || getSourceFileOfNode(node)).text, node.pos);
|
|
}
|
|
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; }
|
|
if (nodeIsMissing(node)) {
|
|
return "";
|
|
}
|
|
var text = sourceFile.text;
|
|
return text.substring(includeTrivia ? node.pos : ts.skipTrivia(text, node.pos), node.end);
|
|
}
|
|
ts.getSourceTextOfNodeFromSourceFile = getSourceTextOfNodeFromSourceFile;
|
|
function getTextOfNodeFromSourceText(sourceText, node) {
|
|
if (nodeIsMissing(node)) {
|
|
return "";
|
|
}
|
|
return sourceText.substring(ts.skipTrivia(sourceText, node.pos), node.end);
|
|
}
|
|
ts.getTextOfNodeFromSourceText = getTextOfNodeFromSourceText;
|
|
function getTextOfNode(node, includeTrivia) {
|
|
if (includeTrivia === void 0) { includeTrivia = false; }
|
|
return getSourceTextOfNodeFromSourceFile(getSourceFileOfNode(node), node, includeTrivia);
|
|
}
|
|
ts.getTextOfNode = getTextOfNode;
|
|
// Add an extra underscore to identifiers that start with two underscores to avoid issues with magic names like '__proto__'
|
|
function escapeIdentifier(identifier) {
|
|
return identifier.length >= 2 && identifier.charCodeAt(0) === 95 /* _ */ && identifier.charCodeAt(1) === 95 /* _ */ ? "_" + identifier : identifier;
|
|
}
|
|
ts.escapeIdentifier = escapeIdentifier;
|
|
// Remove extra underscore from escaped identifier
|
|
function unescapeIdentifier(identifier) {
|
|
return identifier.length >= 3 && identifier.charCodeAt(0) === 95 /* _ */ && identifier.charCodeAt(1) === 95 /* _ */ && identifier.charCodeAt(2) === 95 /* _ */ ? identifier.substr(1) : identifier;
|
|
}
|
|
ts.unescapeIdentifier = unescapeIdentifier;
|
|
// 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(/\W/g, "_");
|
|
}
|
|
ts.makeIdentifierFromModuleName = makeIdentifierFromModuleName;
|
|
function isBlockOrCatchScoped(declaration) {
|
|
return (getCombinedNodeFlags(declaration) & 49152 /* BlockScoped */) !== 0 ||
|
|
isCatchClauseVariableDeclaration(declaration);
|
|
}
|
|
ts.isBlockOrCatchScoped = isBlockOrCatchScoped;
|
|
// Gets the nearest enclosing block scope container that has the provided node
|
|
// as a descendant, that is not the provided node.
|
|
function getEnclosingBlockScopeContainer(node) {
|
|
var current = node.parent;
|
|
while (current) {
|
|
if (isFunctionLike(current)) {
|
|
return current;
|
|
}
|
|
switch (current.kind) {
|
|
case 245 /* SourceFile */:
|
|
case 217 /* CaseBlock */:
|
|
case 241 /* CatchClause */:
|
|
case 215 /* ModuleDeclaration */:
|
|
case 196 /* ForStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
return current;
|
|
case 189 /* Block */:
|
|
// function block is not considered block-scope container
|
|
// see comment in binder.ts: bind(...), case for SyntaxKind.Block
|
|
if (!isFunctionLike(current.parent)) {
|
|
return current;
|
|
}
|
|
}
|
|
current = current.parent;
|
|
}
|
|
}
|
|
ts.getEnclosingBlockScopeContainer = getEnclosingBlockScopeContainer;
|
|
function isCatchClauseVariableDeclaration(declaration) {
|
|
return declaration &&
|
|
declaration.kind === 208 /* VariableDeclaration */ &&
|
|
declaration.parent &&
|
|
declaration.parent.kind === 241 /* CatchClause */;
|
|
}
|
|
ts.isCatchClauseVariableDeclaration = isCatchClauseVariableDeclaration;
|
|
// 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 getFullWidth(name) === 0 ? "(Missing)" : getTextOfNode(name);
|
|
}
|
|
ts.declarationNameToString = declarationNameToString;
|
|
function createDiagnosticForNode(node, message, arg0, arg1, arg2) {
|
|
var sourceFile = getSourceFileOfNode(node);
|
|
var span = getErrorSpanForNode(sourceFile, node);
|
|
return ts.createFileDiagnostic(sourceFile, span.start, span.length, message, arg0, arg1, arg2);
|
|
}
|
|
ts.createDiagnosticForNode = createDiagnosticForNode;
|
|
function createDiagnosticForNodeFromMessageChain(node, messageChain) {
|
|
var sourceFile = getSourceFileOfNode(node);
|
|
var span = getErrorSpanForNode(sourceFile, node);
|
|
return {
|
|
file: sourceFile,
|
|
start: span.start,
|
|
length: span.length,
|
|
code: messageChain.code,
|
|
category: messageChain.category,
|
|
messageText: messageChain.next ? messageChain : messageChain.messageText
|
|
};
|
|
}
|
|
ts.createDiagnosticForNodeFromMessageChain = createDiagnosticForNodeFromMessageChain;
|
|
function getSpanOfTokenAtPosition(sourceFile, pos) {
|
|
var scanner = ts.createScanner(sourceFile.languageVersion, true, sourceFile.languageVariant, sourceFile.text, undefined, pos);
|
|
scanner.scan();
|
|
var start = scanner.getTokenPos();
|
|
return ts.createTextSpanFromBounds(start, scanner.getTextPos());
|
|
}
|
|
ts.getSpanOfTokenAtPosition = getSpanOfTokenAtPosition;
|
|
function getErrorSpanForNode(sourceFile, node) {
|
|
var errorNode = node;
|
|
switch (node.kind) {
|
|
case 245 /* SourceFile */:
|
|
var pos_1 = ts.skipTrivia(sourceFile.text, 0, 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 208 /* VariableDeclaration */:
|
|
case 160 /* BindingElement */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 183 /* ClassExpression */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 215 /* ModuleDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 244 /* EnumMember */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
errorNode = node.name;
|
|
break;
|
|
}
|
|
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);
|
|
}
|
|
var pos = nodeIsMissing(errorNode)
|
|
? errorNode.pos
|
|
: ts.skipTrivia(sourceFile.text, errorNode.pos);
|
|
return ts.createTextSpanFromBounds(pos, errorNode.end);
|
|
}
|
|
ts.getErrorSpanForNode = getErrorSpanForNode;
|
|
function isExternalModule(file) {
|
|
return file.externalModuleIndicator !== undefined;
|
|
}
|
|
ts.isExternalModule = isExternalModule;
|
|
function isDeclarationFile(file) {
|
|
return (file.flags & 8192 /* DeclarationFile */) !== 0;
|
|
}
|
|
ts.isDeclarationFile = isDeclarationFile;
|
|
function isConstEnumDeclaration(node) {
|
|
return node.kind === 214 /* EnumDeclaration */ && isConst(node);
|
|
}
|
|
ts.isConstEnumDeclaration = isConstEnumDeclaration;
|
|
function walkUpBindingElementsAndPatterns(node) {
|
|
while (node && (node.kind === 160 /* BindingElement */ || isBindingPattern(node))) {
|
|
node = node.parent;
|
|
}
|
|
return node;
|
|
}
|
|
// 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 store 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) {
|
|
node = walkUpBindingElementsAndPatterns(node);
|
|
var flags = node.flags;
|
|
if (node.kind === 208 /* VariableDeclaration */) {
|
|
node = node.parent;
|
|
}
|
|
if (node && node.kind === 209 /* VariableDeclarationList */) {
|
|
flags |= node.flags;
|
|
node = node.parent;
|
|
}
|
|
if (node && node.kind === 190 /* VariableStatement */) {
|
|
flags |= node.flags;
|
|
}
|
|
return flags;
|
|
}
|
|
ts.getCombinedNodeFlags = getCombinedNodeFlags;
|
|
function isConst(node) {
|
|
return !!(getCombinedNodeFlags(node) & 32768 /* Const */);
|
|
}
|
|
ts.isConst = isConst;
|
|
function isLet(node) {
|
|
return !!(getCombinedNodeFlags(node) & 16384 /* Let */);
|
|
}
|
|
ts.isLet = isLet;
|
|
function isPrologueDirective(node) {
|
|
return node.kind === 192 /* ExpressionStatement */ && node.expression.kind === 8 /* StringLiteral */;
|
|
}
|
|
ts.isPrologueDirective = isPrologueDirective;
|
|
function getLeadingCommentRangesOfNode(node, sourceFileOfNode) {
|
|
// If parameter/type parameter, the prev token trailing comments are part of this node too
|
|
if (node.kind === 135 /* Parameter */ || node.kind === 134 /* TypeParameter */) {
|
|
// e.g. (/** blah */ a, /** blah */ b);
|
|
// e.g.: (
|
|
// /** blah */ a,
|
|
// /** blah */ b);
|
|
return ts.concatenate(ts.getTrailingCommentRanges(sourceFileOfNode.text, node.pos), ts.getLeadingCommentRanges(sourceFileOfNode.text, node.pos));
|
|
}
|
|
else {
|
|
return ts.getLeadingCommentRanges(sourceFileOfNode.text, node.pos);
|
|
}
|
|
}
|
|
ts.getLeadingCommentRangesOfNode = getLeadingCommentRangesOfNode;
|
|
function getJsDocComments(node, sourceFileOfNode) {
|
|
return ts.filter(getLeadingCommentRangesOfNode(node, sourceFileOfNode), isJsDocComment);
|
|
function isJsDocComment(comment) {
|
|
// True if the comment starts with '/**' but not if it is '/**/'
|
|
return sourceFileOfNode.text.charCodeAt(comment.pos + 1) === 42 /* asterisk */ &&
|
|
sourceFileOfNode.text.charCodeAt(comment.pos + 2) === 42 /* asterisk */ &&
|
|
sourceFileOfNode.text.charCodeAt(comment.pos + 3) !== 47 /* slash */;
|
|
}
|
|
}
|
|
ts.getJsDocComments = getJsDocComments;
|
|
ts.fullTripleSlashReferencePathRegEx = /^(\/\/\/\s*<reference\s+path\s*=\s*)('|")(.+?)\2.*?\/>/;
|
|
function isTypeNode(node) {
|
|
if (148 /* FirstTypeNode */ <= node.kind && node.kind <= 157 /* LastTypeNode */) {
|
|
return true;
|
|
}
|
|
switch (node.kind) {
|
|
case 114 /* AnyKeyword */:
|
|
case 125 /* NumberKeyword */:
|
|
case 127 /* StringKeyword */:
|
|
case 117 /* BooleanKeyword */:
|
|
case 128 /* SymbolKeyword */:
|
|
return true;
|
|
case 100 /* VoidKeyword */:
|
|
return node.parent.kind !== 174 /* VoidExpression */;
|
|
case 8 /* StringLiteral */:
|
|
// Specialized signatures can have string literals as their parameters' type names
|
|
return node.parent.kind === 135 /* Parameter */;
|
|
case 185 /* ExpressionWithTypeArguments */:
|
|
return !isExpressionWithTypeArgumentsInClassExtendsClause(node);
|
|
// Identifiers and qualified names may be type nodes, depending on their context. Climb
|
|
// above them to find the lowest container
|
|
case 66 /* Identifier */:
|
|
// If the identifier is the RHS of a qualified name, then it's a type iff its parent is.
|
|
if (node.parent.kind === 132 /* QualifiedName */ && node.parent.right === node) {
|
|
node = node.parent;
|
|
}
|
|
else if (node.parent.kind === 163 /* PropertyAccessExpression */ && node.parent.name === node) {
|
|
node = node.parent;
|
|
}
|
|
// fall through
|
|
case 132 /* QualifiedName */:
|
|
case 163 /* PropertyAccessExpression */:
|
|
// At this point, node is either a qualified name or an identifier
|
|
ts.Debug.assert(node.kind === 66 /* Identifier */ || node.kind === 132 /* QualifiedName */ || node.kind === 163 /* PropertyAccessExpression */, "'node' was expected to be a qualified name, identifier or property access in 'isTypeNode'.");
|
|
var parent_1 = node.parent;
|
|
if (parent_1.kind === 151 /* TypeQuery */) {
|
|
return false;
|
|
}
|
|
// Do not recursively call isTypeNode on the parent. In the example:
|
|
//
|
|
// let a: A.B.C;
|
|
//
|
|
// Calling isTypeNode would consider the qualified name A.B a type node. Only C or
|
|
// A.B.C is a type node.
|
|
if (148 /* FirstTypeNode */ <= parent_1.kind && parent_1.kind <= 157 /* LastTypeNode */) {
|
|
return true;
|
|
}
|
|
switch (parent_1.kind) {
|
|
case 185 /* ExpressionWithTypeArguments */:
|
|
return !isExpressionWithTypeArgumentsInClassExtendsClause(parent_1);
|
|
case 134 /* TypeParameter */:
|
|
return node === parent_1.constraint;
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 135 /* Parameter */:
|
|
case 208 /* VariableDeclaration */:
|
|
return node === parent_1.type;
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
case 141 /* Constructor */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
return node === parent_1.type;
|
|
case 144 /* CallSignature */:
|
|
case 145 /* ConstructSignature */:
|
|
case 146 /* IndexSignature */:
|
|
return node === parent_1.type;
|
|
case 168 /* TypeAssertionExpression */:
|
|
return node === parent_1.type;
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
return parent_1.typeArguments && ts.indexOf(parent_1.typeArguments, node) >= 0;
|
|
case 167 /* TaggedTemplateExpression */:
|
|
// TODO (drosen): TaggedTemplateExpressions may eventually support type arguments.
|
|
return false;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
ts.isTypeNode = isTypeNode;
|
|
// 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 201 /* ReturnStatement */:
|
|
return visitor(node);
|
|
case 217 /* CaseBlock */:
|
|
case 189 /* Block */:
|
|
case 193 /* IfStatement */:
|
|
case 194 /* DoStatement */:
|
|
case 195 /* WhileStatement */:
|
|
case 196 /* ForStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
case 202 /* WithStatement */:
|
|
case 203 /* SwitchStatement */:
|
|
case 238 /* CaseClause */:
|
|
case 239 /* DefaultClause */:
|
|
case 204 /* LabeledStatement */:
|
|
case 206 /* TryStatement */:
|
|
case 241 /* CatchClause */:
|
|
return ts.forEachChild(node, traverse);
|
|
}
|
|
}
|
|
}
|
|
ts.forEachReturnStatement = forEachReturnStatement;
|
|
function forEachYieldExpression(body, visitor) {
|
|
return traverse(body);
|
|
function traverse(node) {
|
|
switch (node.kind) {
|
|
case 181 /* YieldExpression */:
|
|
visitor(node);
|
|
var operand = node.expression;
|
|
if (operand) {
|
|
traverse(operand);
|
|
}
|
|
case 214 /* EnumDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 215 /* ModuleDeclaration */:
|
|
case 213 /* TypeAliasDeclaration */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 183 /* ClassExpression */:
|
|
// These are not allowed inside a generator now, but eventually they may be allowed
|
|
// as local types. Regardless, any yield statements contained within them should be
|
|
// skipped in this traversal.
|
|
return;
|
|
default:
|
|
if (isFunctionLike(node)) {
|
|
var name_5 = node.name;
|
|
if (name_5 && name_5.kind === 133 /* 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(name_5.expression);
|
|
return;
|
|
}
|
|
}
|
|
else if (!isTypeNode(node)) {
|
|
// This is the general case, which should include mostly expressions and statements.
|
|
// Also includes NodeArrays.
|
|
ts.forEachChild(node, traverse);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
ts.forEachYieldExpression = forEachYieldExpression;
|
|
function isVariableLike(node) {
|
|
if (node) {
|
|
switch (node.kind) {
|
|
case 160 /* BindingElement */:
|
|
case 244 /* EnumMember */:
|
|
case 135 /* Parameter */:
|
|
case 242 /* PropertyAssignment */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 243 /* ShorthandPropertyAssignment */:
|
|
case 208 /* VariableDeclaration */:
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
ts.isVariableLike = isVariableLike;
|
|
function isAccessor(node) {
|
|
return node && (node.kind === 142 /* GetAccessor */ || node.kind === 143 /* SetAccessor */);
|
|
}
|
|
ts.isAccessor = isAccessor;
|
|
function isClassLike(node) {
|
|
return node && (node.kind === 211 /* ClassDeclaration */ || node.kind === 183 /* ClassExpression */);
|
|
}
|
|
ts.isClassLike = isClassLike;
|
|
function isFunctionLike(node) {
|
|
if (node) {
|
|
switch (node.kind) {
|
|
case 141 /* Constructor */:
|
|
case 170 /* FunctionExpression */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 171 /* ArrowFunction */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 144 /* CallSignature */:
|
|
case 145 /* ConstructSignature */:
|
|
case 146 /* IndexSignature */:
|
|
case 149 /* FunctionType */:
|
|
case 150 /* ConstructorType */:
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
ts.isFunctionLike = isFunctionLike;
|
|
function isFunctionBlock(node) {
|
|
return node && node.kind === 189 /* Block */ && isFunctionLike(node.parent);
|
|
}
|
|
ts.isFunctionBlock = isFunctionBlock;
|
|
function isObjectLiteralMethod(node) {
|
|
return node && node.kind === 140 /* MethodDeclaration */ && node.parent.kind === 162 /* ObjectLiteralExpression */;
|
|
}
|
|
ts.isObjectLiteralMethod = isObjectLiteralMethod;
|
|
function getContainingFunction(node) {
|
|
while (true) {
|
|
node = node.parent;
|
|
if (!node || isFunctionLike(node)) {
|
|
return node;
|
|
}
|
|
}
|
|
}
|
|
ts.getContainingFunction = getContainingFunction;
|
|
function getContainingClass(node) {
|
|
while (true) {
|
|
node = node.parent;
|
|
if (!node || isClassLike(node)) {
|
|
return node;
|
|
}
|
|
}
|
|
}
|
|
ts.getContainingClass = getContainingClass;
|
|
function getThisContainer(node, includeArrowFunctions) {
|
|
while (true) {
|
|
node = node.parent;
|
|
if (!node) {
|
|
return undefined;
|
|
}
|
|
switch (node.kind) {
|
|
case 133 /* 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 (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 136 /* Decorator */:
|
|
// Decorators are always applied outside of the body of a class or method.
|
|
if (node.parent.kind === 135 /* Parameter */ && 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 (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 171 /* ArrowFunction */:
|
|
if (!includeArrowFunctions) {
|
|
continue;
|
|
}
|
|
// Fall through
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 215 /* ModuleDeclaration */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 141 /* Constructor */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 245 /* SourceFile */:
|
|
return node;
|
|
}
|
|
}
|
|
}
|
|
ts.getThisContainer = getThisContainer;
|
|
function getSuperContainer(node, includeFunctions) {
|
|
while (true) {
|
|
node = node.parent;
|
|
if (!node)
|
|
return node;
|
|
switch (node.kind) {
|
|
case 133 /* ComputedPropertyName */:
|
|
// If the grandparent node is an object literal (as opposed to a class),
|
|
// then the computed property is not a 'super' container.
|
|
// A computed property name in a class needs to be a super container
|
|
// so that we can error on it.
|
|
if (isClassLike(node.parent.parent)) {
|
|
return node;
|
|
}
|
|
// If this is a computed property, then the parent should not
|
|
// make it a super 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 super container, the reference must be in
|
|
// the *body* of the container.
|
|
node = node.parent;
|
|
break;
|
|
case 136 /* Decorator */:
|
|
// Decorators are always applied outside of the body of a class or method.
|
|
if (node.parent.kind === 135 /* Parameter */ && 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 (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 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
if (!includeFunctions) {
|
|
continue;
|
|
}
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 141 /* Constructor */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
return node;
|
|
}
|
|
}
|
|
}
|
|
ts.getSuperContainer = getSuperContainer;
|
|
function getEntityNameFromTypeNode(node) {
|
|
if (node) {
|
|
switch (node.kind) {
|
|
case 148 /* TypeReference */:
|
|
return node.typeName;
|
|
case 185 /* ExpressionWithTypeArguments */:
|
|
return node.expression;
|
|
case 66 /* Identifier */:
|
|
case 132 /* QualifiedName */:
|
|
return node;
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
ts.getEntityNameFromTypeNode = getEntityNameFromTypeNode;
|
|
function getInvokedExpression(node) {
|
|
if (node.kind === 167 /* TaggedTemplateExpression */) {
|
|
return node.tag;
|
|
}
|
|
// Will either be a CallExpression, NewExpression, or Decorator.
|
|
return node.expression;
|
|
}
|
|
ts.getInvokedExpression = getInvokedExpression;
|
|
function nodeCanBeDecorated(node) {
|
|
switch (node.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
// classes are valid targets
|
|
return true;
|
|
case 138 /* PropertyDeclaration */:
|
|
// property declarations are valid if their parent is a class declaration.
|
|
return node.parent.kind === 211 /* ClassDeclaration */;
|
|
case 135 /* Parameter */:
|
|
// if the parameter's parent has a body and its grandparent is a class declaration, this is a valid target;
|
|
return node.parent.body && node.parent.parent.kind === 211 /* ClassDeclaration */;
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 140 /* MethodDeclaration */:
|
|
// if this method has a body and its parent is a class declaration, this is a valid target.
|
|
return node.body && node.parent.kind === 211 /* ClassDeclaration */;
|
|
}
|
|
return false;
|
|
}
|
|
ts.nodeCanBeDecorated = nodeCanBeDecorated;
|
|
function nodeIsDecorated(node) {
|
|
switch (node.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
if (node.decorators) {
|
|
return true;
|
|
}
|
|
return false;
|
|
case 138 /* PropertyDeclaration */:
|
|
case 135 /* Parameter */:
|
|
if (node.decorators) {
|
|
return true;
|
|
}
|
|
return false;
|
|
case 142 /* GetAccessor */:
|
|
if (node.body && node.decorators) {
|
|
return true;
|
|
}
|
|
return false;
|
|
case 140 /* MethodDeclaration */:
|
|
case 143 /* SetAccessor */:
|
|
if (node.body && node.decorators) {
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
return false;
|
|
}
|
|
ts.nodeIsDecorated = nodeIsDecorated;
|
|
function childIsDecorated(node) {
|
|
switch (node.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
return ts.forEach(node.members, nodeOrChildIsDecorated);
|
|
case 140 /* MethodDeclaration */:
|
|
case 143 /* SetAccessor */:
|
|
return ts.forEach(node.parameters, nodeIsDecorated);
|
|
}
|
|
return false;
|
|
}
|
|
ts.childIsDecorated = childIsDecorated;
|
|
function nodeOrChildIsDecorated(node) {
|
|
return nodeIsDecorated(node) || childIsDecorated(node);
|
|
}
|
|
ts.nodeOrChildIsDecorated = nodeOrChildIsDecorated;
|
|
function isExpression(node) {
|
|
switch (node.kind) {
|
|
case 94 /* ThisKeyword */:
|
|
case 92 /* SuperKeyword */:
|
|
case 90 /* NullKeyword */:
|
|
case 96 /* TrueKeyword */:
|
|
case 81 /* FalseKeyword */:
|
|
case 9 /* RegularExpressionLiteral */:
|
|
case 161 /* ArrayLiteralExpression */:
|
|
case 162 /* ObjectLiteralExpression */:
|
|
case 163 /* PropertyAccessExpression */:
|
|
case 164 /* ElementAccessExpression */:
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
case 167 /* TaggedTemplateExpression */:
|
|
case 186 /* AsExpression */:
|
|
case 168 /* TypeAssertionExpression */:
|
|
case 169 /* ParenthesizedExpression */:
|
|
case 170 /* FunctionExpression */:
|
|
case 183 /* ClassExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
case 174 /* VoidExpression */:
|
|
case 172 /* DeleteExpression */:
|
|
case 173 /* TypeOfExpression */:
|
|
case 176 /* PrefixUnaryExpression */:
|
|
case 177 /* PostfixUnaryExpression */:
|
|
case 178 /* BinaryExpression */:
|
|
case 179 /* ConditionalExpression */:
|
|
case 182 /* SpreadElementExpression */:
|
|
case 180 /* TemplateExpression */:
|
|
case 10 /* NoSubstitutionTemplateLiteral */:
|
|
case 184 /* OmittedExpression */:
|
|
case 230 /* JsxElement */:
|
|
case 231 /* JsxSelfClosingElement */:
|
|
case 181 /* YieldExpression */:
|
|
return true;
|
|
case 132 /* QualifiedName */:
|
|
while (node.parent.kind === 132 /* QualifiedName */) {
|
|
node = node.parent;
|
|
}
|
|
return node.parent.kind === 151 /* TypeQuery */;
|
|
case 66 /* Identifier */:
|
|
if (node.parent.kind === 151 /* TypeQuery */) {
|
|
return true;
|
|
}
|
|
// fall through
|
|
case 7 /* NumericLiteral */:
|
|
case 8 /* StringLiteral */:
|
|
var parent_2 = node.parent;
|
|
switch (parent_2.kind) {
|
|
case 208 /* VariableDeclaration */:
|
|
case 135 /* Parameter */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 244 /* EnumMember */:
|
|
case 242 /* PropertyAssignment */:
|
|
case 160 /* BindingElement */:
|
|
return parent_2.initializer === node;
|
|
case 192 /* ExpressionStatement */:
|
|
case 193 /* IfStatement */:
|
|
case 194 /* DoStatement */:
|
|
case 195 /* WhileStatement */:
|
|
case 201 /* ReturnStatement */:
|
|
case 202 /* WithStatement */:
|
|
case 203 /* SwitchStatement */:
|
|
case 238 /* CaseClause */:
|
|
case 205 /* ThrowStatement */:
|
|
case 203 /* SwitchStatement */:
|
|
return parent_2.expression === node;
|
|
case 196 /* ForStatement */:
|
|
var forStatement = parent_2;
|
|
return (forStatement.initializer === node && forStatement.initializer.kind !== 209 /* VariableDeclarationList */) ||
|
|
forStatement.condition === node ||
|
|
forStatement.incrementor === node;
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
var forInStatement = parent_2;
|
|
return (forInStatement.initializer === node && forInStatement.initializer.kind !== 209 /* VariableDeclarationList */) ||
|
|
forInStatement.expression === node;
|
|
case 168 /* TypeAssertionExpression */:
|
|
case 186 /* AsExpression */:
|
|
return node === parent_2.expression;
|
|
case 187 /* TemplateSpan */:
|
|
return node === parent_2.expression;
|
|
case 133 /* ComputedPropertyName */:
|
|
return node === parent_2.expression;
|
|
case 136 /* Decorator */:
|
|
return true;
|
|
case 185 /* ExpressionWithTypeArguments */:
|
|
return parent_2.expression === node && isExpressionWithTypeArgumentsInClassExtendsClause(parent_2);
|
|
default:
|
|
if (isExpression(parent_2)) {
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
ts.isExpression = isExpression;
|
|
function isInstantiatedModule(node, preserveConstEnums) {
|
|
var moduleState = ts.getModuleInstanceState(node);
|
|
return moduleState === 1 /* Instantiated */ ||
|
|
(preserveConstEnums && moduleState === 2 /* ConstEnumOnly */);
|
|
}
|
|
ts.isInstantiatedModule = isInstantiatedModule;
|
|
function isExternalModuleImportEqualsDeclaration(node) {
|
|
return node.kind === 218 /* ImportEqualsDeclaration */ && node.moduleReference.kind === 229 /* ExternalModuleReference */;
|
|
}
|
|
ts.isExternalModuleImportEqualsDeclaration = isExternalModuleImportEqualsDeclaration;
|
|
function getExternalModuleImportEqualsDeclarationExpression(node) {
|
|
ts.Debug.assert(isExternalModuleImportEqualsDeclaration(node));
|
|
return node.moduleReference.expression;
|
|
}
|
|
ts.getExternalModuleImportEqualsDeclarationExpression = getExternalModuleImportEqualsDeclarationExpression;
|
|
function isInternalModuleImportEqualsDeclaration(node) {
|
|
return node.kind === 218 /* ImportEqualsDeclaration */ && node.moduleReference.kind !== 229 /* ExternalModuleReference */;
|
|
}
|
|
ts.isInternalModuleImportEqualsDeclaration = isInternalModuleImportEqualsDeclaration;
|
|
function getExternalModuleName(node) {
|
|
if (node.kind === 219 /* ImportDeclaration */) {
|
|
return node.moduleSpecifier;
|
|
}
|
|
if (node.kind === 218 /* ImportEqualsDeclaration */) {
|
|
var reference = node.moduleReference;
|
|
if (reference.kind === 229 /* ExternalModuleReference */) {
|
|
return reference.expression;
|
|
}
|
|
}
|
|
if (node.kind === 225 /* ExportDeclaration */) {
|
|
return node.moduleSpecifier;
|
|
}
|
|
}
|
|
ts.getExternalModuleName = getExternalModuleName;
|
|
function hasQuestionToken(node) {
|
|
if (node) {
|
|
switch (node.kind) {
|
|
case 135 /* Parameter */:
|
|
return node.questionToken !== undefined;
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
return node.questionToken !== undefined;
|
|
case 243 /* ShorthandPropertyAssignment */:
|
|
case 242 /* PropertyAssignment */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
return node.questionToken !== undefined;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
ts.hasQuestionToken = hasQuestionToken;
|
|
function isJSDocConstructSignature(node) {
|
|
return node.kind === 258 /* JSDocFunctionType */ &&
|
|
node.parameters.length > 0 &&
|
|
node.parameters[0].type.kind === 260 /* JSDocConstructorType */;
|
|
}
|
|
ts.isJSDocConstructSignature = isJSDocConstructSignature;
|
|
function getJSDocTag(node, kind) {
|
|
if (node && node.jsDocComment) {
|
|
for (var _i = 0, _a = node.jsDocComment.tags; _i < _a.length; _i++) {
|
|
var tag = _a[_i];
|
|
if (tag.kind === kind) {
|
|
return tag;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function getJSDocTypeTag(node) {
|
|
return getJSDocTag(node, 266 /* JSDocTypeTag */);
|
|
}
|
|
ts.getJSDocTypeTag = getJSDocTypeTag;
|
|
function getJSDocReturnTag(node) {
|
|
return getJSDocTag(node, 265 /* JSDocReturnTag */);
|
|
}
|
|
ts.getJSDocReturnTag = getJSDocReturnTag;
|
|
function getJSDocTemplateTag(node) {
|
|
return getJSDocTag(node, 267 /* JSDocTemplateTag */);
|
|
}
|
|
ts.getJSDocTemplateTag = getJSDocTemplateTag;
|
|
function getCorrespondingJSDocParameterTag(parameter) {
|
|
if (parameter.name && parameter.name.kind === 66 /* Identifier */) {
|
|
// If it's a parameter, see if the parent has a jsdoc comment with an @param
|
|
// annotation.
|
|
var parameterName = parameter.name.text;
|
|
var docComment = parameter.parent.jsDocComment;
|
|
if (docComment) {
|
|
return ts.forEach(docComment.tags, function (t) {
|
|
if (t.kind === 264 /* JSDocParameterTag */) {
|
|
var parameterTag = t;
|
|
var name_6 = parameterTag.preParameterName || parameterTag.postParameterName;
|
|
if (name_6.text === parameterName) {
|
|
return t;
|
|
}
|
|
}
|
|
});
|
|
}
|
|
}
|
|
}
|
|
ts.getCorrespondingJSDocParameterTag = getCorrespondingJSDocParameterTag;
|
|
function hasRestParameter(s) {
|
|
return isRestParameter(ts.lastOrUndefined(s.parameters));
|
|
}
|
|
ts.hasRestParameter = hasRestParameter;
|
|
function isRestParameter(node) {
|
|
if (node) {
|
|
if (node.parserContextFlags & 32 /* JavaScriptFile */) {
|
|
if (node.type && node.type.kind === 259 /* JSDocVariadicType */) {
|
|
return true;
|
|
}
|
|
var paramTag = getCorrespondingJSDocParameterTag(node);
|
|
if (paramTag && paramTag.typeExpression) {
|
|
return paramTag.typeExpression.type.kind === 259 /* JSDocVariadicType */;
|
|
}
|
|
}
|
|
return node.dotDotDotToken !== undefined;
|
|
}
|
|
return false;
|
|
}
|
|
ts.isRestParameter = isRestParameter;
|
|
function isLiteralKind(kind) {
|
|
return 7 /* FirstLiteralToken */ <= kind && kind <= 10 /* LastLiteralToken */;
|
|
}
|
|
ts.isLiteralKind = isLiteralKind;
|
|
function isTextualLiteralKind(kind) {
|
|
return kind === 8 /* StringLiteral */ || kind === 10 /* NoSubstitutionTemplateLiteral */;
|
|
}
|
|
ts.isTextualLiteralKind = isTextualLiteralKind;
|
|
function isTemplateLiteralKind(kind) {
|
|
return 10 /* FirstTemplateToken */ <= kind && kind <= 13 /* LastTemplateToken */;
|
|
}
|
|
ts.isTemplateLiteralKind = isTemplateLiteralKind;
|
|
function isBindingPattern(node) {
|
|
return !!node && (node.kind === 159 /* ArrayBindingPattern */ || node.kind === 158 /* ObjectBindingPattern */);
|
|
}
|
|
ts.isBindingPattern = isBindingPattern;
|
|
function isInAmbientContext(node) {
|
|
while (node) {
|
|
if (node.flags & (2 /* Ambient */ | 8192 /* DeclarationFile */)) {
|
|
return true;
|
|
}
|
|
node = node.parent;
|
|
}
|
|
return false;
|
|
}
|
|
ts.isInAmbientContext = isInAmbientContext;
|
|
function isDeclaration(node) {
|
|
switch (node.kind) {
|
|
case 171 /* ArrowFunction */:
|
|
case 160 /* BindingElement */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 183 /* ClassExpression */:
|
|
case 141 /* Constructor */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 244 /* EnumMember */:
|
|
case 227 /* ExportSpecifier */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 142 /* GetAccessor */:
|
|
case 220 /* ImportClause */:
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 223 /* ImportSpecifier */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 215 /* ModuleDeclaration */:
|
|
case 221 /* NamespaceImport */:
|
|
case 135 /* Parameter */:
|
|
case 242 /* PropertyAssignment */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 143 /* SetAccessor */:
|
|
case 243 /* ShorthandPropertyAssignment */:
|
|
case 213 /* TypeAliasDeclaration */:
|
|
case 134 /* TypeParameter */:
|
|
case 208 /* VariableDeclaration */:
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
ts.isDeclaration = isDeclaration;
|
|
function isStatement(n) {
|
|
switch (n.kind) {
|
|
case 200 /* BreakStatement */:
|
|
case 199 /* ContinueStatement */:
|
|
case 207 /* DebuggerStatement */:
|
|
case 194 /* DoStatement */:
|
|
case 192 /* ExpressionStatement */:
|
|
case 191 /* EmptyStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
case 196 /* ForStatement */:
|
|
case 193 /* IfStatement */:
|
|
case 204 /* LabeledStatement */:
|
|
case 201 /* ReturnStatement */:
|
|
case 203 /* SwitchStatement */:
|
|
case 95 /* ThrowKeyword */:
|
|
case 206 /* TryStatement */:
|
|
case 190 /* VariableStatement */:
|
|
case 195 /* WhileStatement */:
|
|
case 202 /* WithStatement */:
|
|
case 224 /* ExportAssignment */:
|
|
return true;
|
|
default:
|
|
return false;
|
|
}
|
|
}
|
|
ts.isStatement = isStatement;
|
|
function isClassElement(n) {
|
|
switch (n.kind) {
|
|
case 141 /* Constructor */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 139 /* MethodSignature */:
|
|
case 146 /* IndexSignature */:
|
|
return true;
|
|
default:
|
|
return false;
|
|
}
|
|
}
|
|
ts.isClassElement = isClassElement;
|
|
// True if the given identifier, string literal, or number literal is the name of a declaration node
|
|
function isDeclarationName(name) {
|
|
if (name.kind !== 66 /* Identifier */ && name.kind !== 8 /* StringLiteral */ && name.kind !== 7 /* NumericLiteral */) {
|
|
return false;
|
|
}
|
|
var parent = name.parent;
|
|
if (parent.kind === 223 /* ImportSpecifier */ || parent.kind === 227 /* ExportSpecifier */) {
|
|
if (parent.propertyName) {
|
|
return true;
|
|
}
|
|
}
|
|
if (isDeclaration(parent)) {
|
|
return parent.name === name;
|
|
}
|
|
return false;
|
|
}
|
|
ts.isDeclarationName = isDeclarationName;
|
|
// Return true if the given identifier is classified as an IdentifierName
|
|
function isIdentifierName(node) {
|
|
var parent = node.parent;
|
|
switch (parent.kind) {
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 244 /* EnumMember */:
|
|
case 242 /* PropertyAssignment */:
|
|
case 163 /* PropertyAccessExpression */:
|
|
// Name in member declaration or property name in property access
|
|
return parent.name === node;
|
|
case 132 /* QualifiedName */:
|
|
// Name on right hand side of dot in a type query
|
|
if (parent.right === node) {
|
|
while (parent.kind === 132 /* QualifiedName */) {
|
|
parent = parent.parent;
|
|
}
|
|
return parent.kind === 151 /* TypeQuery */;
|
|
}
|
|
return false;
|
|
case 160 /* BindingElement */:
|
|
case 223 /* ImportSpecifier */:
|
|
// Property name in binding element or import specifier
|
|
return parent.propertyName === node;
|
|
case 227 /* ExportSpecifier */:
|
|
// Any name in an export specifier
|
|
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 = ...
|
|
// export default ...
|
|
function isAliasSymbolDeclaration(node) {
|
|
return node.kind === 218 /* ImportEqualsDeclaration */ ||
|
|
node.kind === 220 /* ImportClause */ && !!node.name ||
|
|
node.kind === 221 /* NamespaceImport */ ||
|
|
node.kind === 223 /* ImportSpecifier */ ||
|
|
node.kind === 227 /* ExportSpecifier */ ||
|
|
node.kind === 224 /* ExportAssignment */ && node.expression.kind === 66 /* Identifier */;
|
|
}
|
|
ts.isAliasSymbolDeclaration = isAliasSymbolDeclaration;
|
|
function getClassExtendsHeritageClauseElement(node) {
|
|
var heritageClause = getHeritageClause(node.heritageClauses, 80 /* ExtendsKeyword */);
|
|
return heritageClause && heritageClause.types.length > 0 ? heritageClause.types[0] : undefined;
|
|
}
|
|
ts.getClassExtendsHeritageClauseElement = getClassExtendsHeritageClauseElement;
|
|
function getClassImplementsHeritageClauseElements(node) {
|
|
var heritageClause = getHeritageClause(node.heritageClauses, 103 /* ImplementsKeyword */);
|
|
return heritageClause ? heritageClause.types : undefined;
|
|
}
|
|
ts.getClassImplementsHeritageClauseElements = getClassImplementsHeritageClauseElements;
|
|
function getInterfaceBaseTypeNodes(node) {
|
|
var heritageClause = getHeritageClause(node.heritageClauses, 80 /* ExtendsKeyword */);
|
|
return heritageClause ? heritageClause.types : undefined;
|
|
}
|
|
ts.getInterfaceBaseTypeNodes = getInterfaceBaseTypeNodes;
|
|
function getHeritageClause(clauses, kind) {
|
|
if (clauses) {
|
|
for (var _i = 0; _i < clauses.length; _i++) {
|
|
var clause = clauses[_i];
|
|
if (clause.token === kind) {
|
|
return clause;
|
|
}
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
ts.getHeritageClause = getHeritageClause;
|
|
function tryResolveScriptReference(host, sourceFile, reference) {
|
|
if (!host.getCompilerOptions().noResolve) {
|
|
var referenceFileName = ts.isRootedDiskPath(reference.fileName) ? reference.fileName : ts.combinePaths(ts.getDirectoryPath(sourceFile.fileName), reference.fileName);
|
|
referenceFileName = ts.getNormalizedAbsolutePath(referenceFileName, host.getCurrentDirectory());
|
|
return host.getSourceFile(referenceFileName);
|
|
}
|
|
}
|
|
ts.tryResolveScriptReference = tryResolveScriptReference;
|
|
function getAncestor(node, kind) {
|
|
while (node) {
|
|
if (node.kind === kind) {
|
|
return node;
|
|
}
|
|
node = node.parent;
|
|
}
|
|
return undefined;
|
|
}
|
|
ts.getAncestor = getAncestor;
|
|
function getFileReferenceFromReferencePath(comment, commentRange) {
|
|
var simpleReferenceRegEx = /^\/\/\/\s*<reference\s+/gim;
|
|
var isNoDefaultLibRegEx = /^(\/\/\/\s*<reference\s+no-default-lib\s*=\s*)('|")(.+?)\2\s*\/>/gim;
|
|
if (simpleReferenceRegEx.exec(comment)) {
|
|
if (isNoDefaultLibRegEx.exec(comment)) {
|
|
return {
|
|
isNoDefaultLib: true
|
|
};
|
|
}
|
|
else {
|
|
var matchResult = ts.fullTripleSlashReferencePathRegEx.exec(comment);
|
|
if (matchResult) {
|
|
var start = commentRange.pos;
|
|
var end = commentRange.end;
|
|
return {
|
|
fileReference: {
|
|
pos: start,
|
|
end: end,
|
|
fileName: matchResult[3]
|
|
},
|
|
isNoDefaultLib: false
|
|
};
|
|
}
|
|
else {
|
|
return {
|
|
diagnosticMessage: ts.Diagnostics.Invalid_reference_directive_syntax,
|
|
isNoDefaultLib: false
|
|
};
|
|
}
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
ts.getFileReferenceFromReferencePath = getFileReferenceFromReferencePath;
|
|
function isKeyword(token) {
|
|
return 67 /* FirstKeyword */ <= token && token <= 131 /* LastKeyword */;
|
|
}
|
|
ts.isKeyword = isKeyword;
|
|
function isTrivia(token) {
|
|
return 2 /* FirstTriviaToken */ <= token && token <= 6 /* LastTriviaToken */;
|
|
}
|
|
ts.isTrivia = isTrivia;
|
|
function isAsyncFunctionLike(node) {
|
|
return isFunctionLike(node) && (node.flags & 512 /* Async */) !== 0 && !isAccessor(node);
|
|
}
|
|
ts.isAsyncFunctionLike = isAsyncFunctionLike;
|
|
/**
|
|
* A declaration has a dynamic name if both of the following are true:
|
|
* 1. The declaration has a computed property name
|
|
* 2. The computed name is *not* expressed as Symbol.<name>, where name
|
|
* is a property of the Symbol constructor that denotes a built in
|
|
* Symbol.
|
|
*/
|
|
function hasDynamicName(declaration) {
|
|
return declaration.name &&
|
|
declaration.name.kind === 133 /* ComputedPropertyName */ &&
|
|
!isWellKnownSymbolSyntactically(declaration.name.expression);
|
|
}
|
|
ts.hasDynamicName = hasDynamicName;
|
|
/**
|
|
* Checks if the expression is of the form:
|
|
* Symbol.name
|
|
* where Symbol is literally the word "Symbol", and name is any identifierName
|
|
*/
|
|
function isWellKnownSymbolSyntactically(node) {
|
|
return node.kind === 163 /* PropertyAccessExpression */ && isESSymbolIdentifier(node.expression);
|
|
}
|
|
ts.isWellKnownSymbolSyntactically = isWellKnownSymbolSyntactically;
|
|
function getPropertyNameForPropertyNameNode(name) {
|
|
if (name.kind === 66 /* Identifier */ || name.kind === 8 /* StringLiteral */ || name.kind === 7 /* NumericLiteral */) {
|
|
return name.text;
|
|
}
|
|
if (name.kind === 133 /* ComputedPropertyName */) {
|
|
var nameExpression = name.expression;
|
|
if (isWellKnownSymbolSyntactically(nameExpression)) {
|
|
var rightHandSideName = nameExpression.name.text;
|
|
return getPropertyNameForKnownSymbolName(rightHandSideName);
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
ts.getPropertyNameForPropertyNameNode = getPropertyNameForPropertyNameNode;
|
|
function getPropertyNameForKnownSymbolName(symbolName) {
|
|
return "__@" + symbolName;
|
|
}
|
|
ts.getPropertyNameForKnownSymbolName = getPropertyNameForKnownSymbolName;
|
|
/**
|
|
* Includes the word "Symbol" with unicode escapes
|
|
*/
|
|
function isESSymbolIdentifier(node) {
|
|
return node.kind === 66 /* Identifier */ && node.text === "Symbol";
|
|
}
|
|
ts.isESSymbolIdentifier = isESSymbolIdentifier;
|
|
function isModifier(token) {
|
|
switch (token) {
|
|
case 112 /* AbstractKeyword */:
|
|
case 115 /* AsyncKeyword */:
|
|
case 71 /* ConstKeyword */:
|
|
case 119 /* DeclareKeyword */:
|
|
case 74 /* DefaultKeyword */:
|
|
case 79 /* ExportKeyword */:
|
|
case 109 /* PublicKeyword */:
|
|
case 107 /* PrivateKeyword */:
|
|
case 108 /* ProtectedKeyword */:
|
|
case 110 /* StaticKeyword */:
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
ts.isModifier = isModifier;
|
|
function isParameterDeclaration(node) {
|
|
var root = getRootDeclaration(node);
|
|
return root.kind === 135 /* Parameter */;
|
|
}
|
|
ts.isParameterDeclaration = isParameterDeclaration;
|
|
function getRootDeclaration(node) {
|
|
while (node.kind === 160 /* BindingElement */) {
|
|
node = node.parent.parent;
|
|
}
|
|
return node;
|
|
}
|
|
ts.getRootDeclaration = getRootDeclaration;
|
|
function nodeStartsNewLexicalEnvironment(n) {
|
|
return isFunctionLike(n) || n.kind === 215 /* ModuleDeclaration */ || n.kind === 245 /* SourceFile */;
|
|
}
|
|
ts.nodeStartsNewLexicalEnvironment = nodeStartsNewLexicalEnvironment;
|
|
function nodeIsSynthesized(node) {
|
|
return node.pos === -1;
|
|
}
|
|
ts.nodeIsSynthesized = nodeIsSynthesized;
|
|
function createSynthesizedNode(kind, startsOnNewLine) {
|
|
var node = ts.createNode(kind);
|
|
node.startsOnNewLine = startsOnNewLine;
|
|
return node;
|
|
}
|
|
ts.createSynthesizedNode = createSynthesizedNode;
|
|
function createSynthesizedNodeArray() {
|
|
var array = [];
|
|
array.pos = -1;
|
|
array.end = -1;
|
|
return array;
|
|
}
|
|
ts.createSynthesizedNodeArray = createSynthesizedNodeArray;
|
|
function createDiagnosticCollection() {
|
|
var nonFileDiagnostics = [];
|
|
var fileDiagnostics = {};
|
|
var diagnosticsModified = false;
|
|
var modificationCount = 0;
|
|
return {
|
|
add: add,
|
|
getGlobalDiagnostics: getGlobalDiagnostics,
|
|
getDiagnostics: getDiagnostics,
|
|
getModificationCount: getModificationCount
|
|
};
|
|
function getModificationCount() {
|
|
return modificationCount;
|
|
}
|
|
function add(diagnostic) {
|
|
var diagnostics;
|
|
if (diagnostic.file) {
|
|
diagnostics = fileDiagnostics[diagnostic.file.fileName];
|
|
if (!diagnostics) {
|
|
diagnostics = [];
|
|
fileDiagnostics[diagnostic.file.fileName] = diagnostics;
|
|
}
|
|
}
|
|
else {
|
|
diagnostics = nonFileDiagnostics;
|
|
}
|
|
diagnostics.push(diagnostic);
|
|
diagnosticsModified = true;
|
|
modificationCount++;
|
|
}
|
|
function getGlobalDiagnostics() {
|
|
sortAndDeduplicate();
|
|
return nonFileDiagnostics;
|
|
}
|
|
function getDiagnostics(fileName) {
|
|
sortAndDeduplicate();
|
|
if (fileName) {
|
|
return fileDiagnostics[fileName] || [];
|
|
}
|
|
var allDiagnostics = [];
|
|
function pushDiagnostic(d) {
|
|
allDiagnostics.push(d);
|
|
}
|
|
ts.forEach(nonFileDiagnostics, pushDiagnostic);
|
|
for (var key in fileDiagnostics) {
|
|
if (ts.hasProperty(fileDiagnostics, key)) {
|
|
ts.forEach(fileDiagnostics[key], pushDiagnostic);
|
|
}
|
|
}
|
|
return ts.sortAndDeduplicateDiagnostics(allDiagnostics);
|
|
}
|
|
function sortAndDeduplicate() {
|
|
if (!diagnosticsModified) {
|
|
return;
|
|
}
|
|
diagnosticsModified = false;
|
|
nonFileDiagnostics = ts.sortAndDeduplicateDiagnostics(nonFileDiagnostics);
|
|
for (var key in fileDiagnostics) {
|
|
if (ts.hasProperty(fileDiagnostics, key)) {
|
|
fileDiagnostics[key] = ts.sortAndDeduplicateDiagnostics(fileDiagnostics[key]);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
ts.createDiagnosticCollection = createDiagnosticCollection;
|
|
// 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 escapedCharsRegExp = /[\\\"\u0000-\u001f\t\v\f\b\r\n\u2028\u2029\u0085]/g;
|
|
var escapedCharsMap = {
|
|
"\0": "\\0",
|
|
"\t": "\\t",
|
|
"\v": "\\v",
|
|
"\f": "\\f",
|
|
"\b": "\\b",
|
|
"\r": "\\r",
|
|
"\n": "\\n",
|
|
"\\": "\\\\",
|
|
"\"": "\\\"",
|
|
"\u2028": "\\u2028",
|
|
"\u2029": "\\u2029",
|
|
"\u0085": "\\u0085" // nextLine
|
|
};
|
|
/**
|
|
* 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) {
|
|
s = escapedCharsRegExp.test(s) ? s.replace(escapedCharsRegExp, getReplacement) : s;
|
|
return s;
|
|
function getReplacement(c) {
|
|
return escapedCharsMap[c] || get16BitUnicodeEscapeSequence(c.charCodeAt(0));
|
|
}
|
|
}
|
|
ts.escapeString = escapeString;
|
|
function isIntrinsicJsxName(name) {
|
|
var ch = name.substr(0, 1);
|
|
return ch.toLowerCase() === ch;
|
|
}
|
|
ts.isIntrinsicJsxName = isIntrinsicJsxName;
|
|
function get16BitUnicodeEscapeSequence(charCode) {
|
|
var hexCharCode = charCode.toString(16).toUpperCase();
|
|
var paddedHexCode = ("0000" + hexCharCode).slice(-4);
|
|
return "\\u" + paddedHexCode;
|
|
}
|
|
var nonAsciiCharacters = /[^\u0000-\u007F]/g;
|
|
function escapeNonAsciiCharacters(s) {
|
|
// 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 get16BitUnicodeEscapeSequence(c.charCodeAt(0)); }) :
|
|
s;
|
|
}
|
|
ts.escapeNonAsciiCharacters = escapeNonAsciiCharacters;
|
|
var indentStrings = ["", " "];
|
|
function getIndentString(level) {
|
|
if (indentStrings[level] === undefined) {
|
|
indentStrings[level] = getIndentString(level - 1) + indentStrings[1];
|
|
}
|
|
return indentStrings[level];
|
|
}
|
|
ts.getIndentString = getIndentString;
|
|
function getIndentSize() {
|
|
return indentStrings[1].length;
|
|
}
|
|
ts.getIndentSize = getIndentSize;
|
|
function createTextWriter(newLine) {
|
|
var output = "";
|
|
var indent = 0;
|
|
var lineStart = true;
|
|
var lineCount = 0;
|
|
var linePos = 0;
|
|
function write(s) {
|
|
if (s && s.length) {
|
|
if (lineStart) {
|
|
output += getIndentString(indent);
|
|
lineStart = false;
|
|
}
|
|
output += s;
|
|
}
|
|
}
|
|
function rawWrite(s) {
|
|
if (s !== undefined) {
|
|
if (lineStart) {
|
|
lineStart = false;
|
|
}
|
|
output += s;
|
|
}
|
|
}
|
|
function writeLiteral(s) {
|
|
if (s && s.length) {
|
|
write(s);
|
|
var lineStartsOfS = ts.computeLineStarts(s);
|
|
if (lineStartsOfS.length > 1) {
|
|
lineCount = lineCount + lineStartsOfS.length - 1;
|
|
linePos = output.length - s.length + ts.lastOrUndefined(lineStartsOfS);
|
|
}
|
|
}
|
|
}
|
|
function writeLine() {
|
|
if (!lineStart) {
|
|
output += newLine;
|
|
lineCount++;
|
|
linePos = output.length;
|
|
lineStart = true;
|
|
}
|
|
}
|
|
function writeTextOfNode(sourceFile, node) {
|
|
write(getSourceTextOfNodeFromSourceFile(sourceFile, node));
|
|
}
|
|
return {
|
|
write: write,
|
|
rawWrite: rawWrite,
|
|
writeTextOfNode: writeTextOfNode,
|
|
writeLiteral: writeLiteral,
|
|
writeLine: writeLine,
|
|
increaseIndent: function () { return indent++; },
|
|
decreaseIndent: function () { return indent--; },
|
|
getIndent: function () { return indent; },
|
|
getTextPos: function () { return output.length; },
|
|
getLine: function () { return lineCount + 1; },
|
|
getColumn: function () { return lineStart ? indent * getIndentSize() + 1 : output.length - linePos + 1; },
|
|
getText: function () { return output; }
|
|
};
|
|
}
|
|
ts.createTextWriter = createTextWriter;
|
|
function getOwnEmitOutputFilePath(sourceFile, host, extension) {
|
|
var compilerOptions = host.getCompilerOptions();
|
|
var emitOutputFilePathWithoutExtension;
|
|
if (compilerOptions.outDir) {
|
|
emitOutputFilePathWithoutExtension = ts.removeFileExtension(getSourceFilePathInNewDir(sourceFile, host, compilerOptions.outDir));
|
|
}
|
|
else {
|
|
emitOutputFilePathWithoutExtension = ts.removeFileExtension(sourceFile.fileName);
|
|
}
|
|
return emitOutputFilePathWithoutExtension + extension;
|
|
}
|
|
ts.getOwnEmitOutputFilePath = getOwnEmitOutputFilePath;
|
|
function getSourceFilePathInNewDir(sourceFile, host, newDirPath) {
|
|
var sourceFilePath = ts.getNormalizedAbsolutePath(sourceFile.fileName, host.getCurrentDirectory());
|
|
sourceFilePath = sourceFilePath.replace(host.getCommonSourceDirectory(), "");
|
|
return ts.combinePaths(newDirPath, sourceFilePath);
|
|
}
|
|
ts.getSourceFilePathInNewDir = getSourceFilePathInNewDir;
|
|
function writeFile(host, diagnostics, fileName, data, writeByteOrderMark) {
|
|
host.writeFile(fileName, data, writeByteOrderMark, function (hostErrorMessage) {
|
|
diagnostics.push(ts.createCompilerDiagnostic(ts.Diagnostics.Could_not_write_file_0_Colon_1, fileName, hostErrorMessage));
|
|
});
|
|
}
|
|
ts.writeFile = writeFile;
|
|
function getLineOfLocalPosition(currentSourceFile, pos) {
|
|
return ts.getLineAndCharacterOfPosition(currentSourceFile, pos).line;
|
|
}
|
|
ts.getLineOfLocalPosition = getLineOfLocalPosition;
|
|
function getFirstConstructorWithBody(node) {
|
|
return ts.forEach(node.members, function (member) {
|
|
if (member.kind === 141 /* Constructor */ && nodeIsPresent(member.body)) {
|
|
return member;
|
|
}
|
|
});
|
|
}
|
|
ts.getFirstConstructorWithBody = getFirstConstructorWithBody;
|
|
function getSetAccessorTypeAnnotationNode(accessor) {
|
|
return accessor && accessor.parameters.length > 0 && accessor.parameters[0].type;
|
|
}
|
|
ts.getSetAccessorTypeAnnotationNode = getSetAccessorTypeAnnotationNode;
|
|
function shouldEmitToOwnFile(sourceFile, compilerOptions) {
|
|
if (!isDeclarationFile(sourceFile)) {
|
|
if ((isExternalModule(sourceFile) || !compilerOptions.out)) {
|
|
// 1. in-browser single file compilation scenario
|
|
// 2. non .js file
|
|
return compilerOptions.isolatedModules || !ts.fileExtensionIs(sourceFile.fileName, ".js");
|
|
}
|
|
return false;
|
|
}
|
|
return false;
|
|
}
|
|
ts.shouldEmitToOwnFile = shouldEmitToOwnFile;
|
|
function getAllAccessorDeclarations(declarations, accessor) {
|
|
var firstAccessor;
|
|
var secondAccessor;
|
|
var getAccessor;
|
|
var setAccessor;
|
|
if (hasDynamicName(accessor)) {
|
|
firstAccessor = accessor;
|
|
if (accessor.kind === 142 /* GetAccessor */) {
|
|
getAccessor = accessor;
|
|
}
|
|
else if (accessor.kind === 143 /* SetAccessor */) {
|
|
setAccessor = accessor;
|
|
}
|
|
else {
|
|
ts.Debug.fail("Accessor has wrong kind");
|
|
}
|
|
}
|
|
else {
|
|
ts.forEach(declarations, function (member) {
|
|
if ((member.kind === 142 /* GetAccessor */ || member.kind === 143 /* SetAccessor */)
|
|
&& (member.flags & 128 /* Static */) === (accessor.flags & 128 /* Static */)) {
|
|
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 === 142 /* GetAccessor */ && !getAccessor) {
|
|
getAccessor = member;
|
|
}
|
|
if (member.kind === 143 /* SetAccessor */ && !setAccessor) {
|
|
setAccessor = member;
|
|
}
|
|
}
|
|
}
|
|
});
|
|
}
|
|
return {
|
|
firstAccessor: firstAccessor,
|
|
secondAccessor: secondAccessor,
|
|
getAccessor: getAccessor,
|
|
setAccessor: setAccessor
|
|
};
|
|
}
|
|
ts.getAllAccessorDeclarations = getAllAccessorDeclarations;
|
|
function emitNewLineBeforeLeadingComments(currentSourceFile, writer, node, leadingComments) {
|
|
// If the leading comments start on different line than the start of node, write new line
|
|
if (leadingComments && leadingComments.length && node.pos !== leadingComments[0].pos &&
|
|
getLineOfLocalPosition(currentSourceFile, node.pos) !== getLineOfLocalPosition(currentSourceFile, leadingComments[0].pos)) {
|
|
writer.writeLine();
|
|
}
|
|
}
|
|
ts.emitNewLineBeforeLeadingComments = emitNewLineBeforeLeadingComments;
|
|
function emitComments(currentSourceFile, writer, comments, trailingSeparator, newLine, writeComment) {
|
|
var emitLeadingSpace = !trailingSeparator;
|
|
ts.forEach(comments, function (comment) {
|
|
if (emitLeadingSpace) {
|
|
writer.write(" ");
|
|
emitLeadingSpace = false;
|
|
}
|
|
writeComment(currentSourceFile, writer, comment, newLine);
|
|
if (comment.hasTrailingNewLine) {
|
|
writer.writeLine();
|
|
}
|
|
else if (trailingSeparator) {
|
|
writer.write(" ");
|
|
}
|
|
else {
|
|
// Emit leading space to separate comment during next comment emit
|
|
emitLeadingSpace = true;
|
|
}
|
|
});
|
|
}
|
|
ts.emitComments = emitComments;
|
|
function writeCommentRange(currentSourceFile, writer, comment, newLine) {
|
|
if (currentSourceFile.text.charCodeAt(comment.pos + 1) === 42 /* asterisk */) {
|
|
var firstCommentLineAndCharacter = ts.getLineAndCharacterOfPosition(currentSourceFile, comment.pos);
|
|
var lineCount = ts.getLineStarts(currentSourceFile).length;
|
|
var firstCommentLineIndent;
|
|
for (var pos = comment.pos, currentLine = firstCommentLineAndCharacter.line; pos < comment.end; currentLine++) {
|
|
var nextLineStart = (currentLine + 1) === lineCount
|
|
? currentSourceFile.text.length + 1
|
|
: getStartPositionOfLine(currentLine + 1, currentSourceFile);
|
|
if (pos !== comment.pos) {
|
|
// If we are not emitting first line, we need to write the spaces to adjust the alignment
|
|
if (firstCommentLineIndent === undefined) {
|
|
firstCommentLineIndent = calculateIndent(getStartPositionOfLine(firstCommentLineAndCharacter.line, currentSourceFile), comment.pos);
|
|
}
|
|
// 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(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(pos, nextLineStart);
|
|
pos = nextLineStart;
|
|
}
|
|
}
|
|
else {
|
|
// Single line comment of style //....
|
|
writer.write(currentSourceFile.text.substring(comment.pos, comment.end));
|
|
}
|
|
function writeTrimmedCurrentLine(pos, nextLineStart) {
|
|
var end = Math.min(comment.end, nextLineStart - 1);
|
|
var currentLineText = currentSourceFile.text.substring(pos, end).replace(/^\s+|\s+$/g, '');
|
|
if (currentLineText) {
|
|
// trimmed forward and ending spaces text
|
|
writer.write(currentLineText);
|
|
if (end !== comment.end) {
|
|
writer.writeLine();
|
|
}
|
|
}
|
|
else {
|
|
// Empty string - make sure we write empty line
|
|
writer.writeLiteral(newLine);
|
|
}
|
|
}
|
|
function calculateIndent(pos, end) {
|
|
var currentLineIndent = 0;
|
|
for (; pos < end && ts.isWhiteSpace(currentSourceFile.text.charCodeAt(pos)); pos++) {
|
|
if (currentSourceFile.text.charCodeAt(pos) === 9 /* tab */) {
|
|
// Tabs = TabSize = indent size and go to next tabStop
|
|
currentLineIndent += getIndentSize() - (currentLineIndent % getIndentSize());
|
|
}
|
|
else {
|
|
// Single space
|
|
currentLineIndent++;
|
|
}
|
|
}
|
|
return currentLineIndent;
|
|
}
|
|
}
|
|
ts.writeCommentRange = writeCommentRange;
|
|
function modifierToFlag(token) {
|
|
switch (token) {
|
|
case 110 /* StaticKeyword */: return 128 /* Static */;
|
|
case 109 /* PublicKeyword */: return 16 /* Public */;
|
|
case 108 /* ProtectedKeyword */: return 64 /* Protected */;
|
|
case 107 /* PrivateKeyword */: return 32 /* Private */;
|
|
case 112 /* AbstractKeyword */: return 256 /* Abstract */;
|
|
case 79 /* ExportKeyword */: return 1 /* Export */;
|
|
case 119 /* DeclareKeyword */: return 2 /* Ambient */;
|
|
case 71 /* ConstKeyword */: return 32768 /* Const */;
|
|
case 74 /* DefaultKeyword */: return 1024 /* Default */;
|
|
case 115 /* AsyncKeyword */: return 512 /* Async */;
|
|
}
|
|
return 0;
|
|
}
|
|
ts.modifierToFlag = modifierToFlag;
|
|
function isLeftHandSideExpression(expr) {
|
|
if (expr) {
|
|
switch (expr.kind) {
|
|
case 163 /* PropertyAccessExpression */:
|
|
case 164 /* ElementAccessExpression */:
|
|
case 166 /* NewExpression */:
|
|
case 165 /* CallExpression */:
|
|
case 230 /* JsxElement */:
|
|
case 231 /* JsxSelfClosingElement */:
|
|
case 167 /* TaggedTemplateExpression */:
|
|
case 161 /* ArrayLiteralExpression */:
|
|
case 169 /* ParenthesizedExpression */:
|
|
case 162 /* ObjectLiteralExpression */:
|
|
case 183 /* ClassExpression */:
|
|
case 170 /* FunctionExpression */:
|
|
case 66 /* Identifier */:
|
|
case 9 /* RegularExpressionLiteral */:
|
|
case 7 /* NumericLiteral */:
|
|
case 8 /* StringLiteral */:
|
|
case 10 /* NoSubstitutionTemplateLiteral */:
|
|
case 180 /* TemplateExpression */:
|
|
case 81 /* FalseKeyword */:
|
|
case 90 /* NullKeyword */:
|
|
case 94 /* ThisKeyword */:
|
|
case 96 /* TrueKeyword */:
|
|
case 92 /* SuperKeyword */:
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
ts.isLeftHandSideExpression = isLeftHandSideExpression;
|
|
function isAssignmentOperator(token) {
|
|
return token >= 54 /* FirstAssignment */ && token <= 65 /* LastAssignment */;
|
|
}
|
|
ts.isAssignmentOperator = isAssignmentOperator;
|
|
function isExpressionWithTypeArgumentsInClassExtendsClause(node) {
|
|
return node.kind === 185 /* ExpressionWithTypeArguments */ &&
|
|
node.parent.token === 80 /* ExtendsKeyword */ &&
|
|
isClassLike(node.parent.parent);
|
|
}
|
|
ts.isExpressionWithTypeArgumentsInClassExtendsClause = isExpressionWithTypeArgumentsInClassExtendsClause;
|
|
// Returns false if this heritage clause element's expression contains something unsupported
|
|
// (i.e. not a name or dotted name).
|
|
function isSupportedExpressionWithTypeArguments(node) {
|
|
return isSupportedExpressionWithTypeArgumentsRest(node.expression);
|
|
}
|
|
ts.isSupportedExpressionWithTypeArguments = isSupportedExpressionWithTypeArguments;
|
|
function isSupportedExpressionWithTypeArgumentsRest(node) {
|
|
if (node.kind === 66 /* Identifier */) {
|
|
return true;
|
|
}
|
|
else if (node.kind === 163 /* PropertyAccessExpression */) {
|
|
return isSupportedExpressionWithTypeArgumentsRest(node.expression);
|
|
}
|
|
else {
|
|
return false;
|
|
}
|
|
}
|
|
function isRightSideOfQualifiedNameOrPropertyAccess(node) {
|
|
return (node.parent.kind === 132 /* QualifiedName */ && node.parent.right === node) ||
|
|
(node.parent.kind === 163 /* PropertyAccessExpression */ && node.parent.name === node);
|
|
}
|
|
ts.isRightSideOfQualifiedNameOrPropertyAccess = isRightSideOfQualifiedNameOrPropertyAccess;
|
|
function getLocalSymbolForExportDefault(symbol) {
|
|
return symbol && symbol.valueDeclaration && (symbol.valueDeclaration.flags & 1024 /* Default */) ? symbol.valueDeclaration.localSymbol : undefined;
|
|
}
|
|
ts.getLocalSymbolForExportDefault = getLocalSymbolForExportDefault;
|
|
function isJavaScript(fileName) {
|
|
return ts.fileExtensionIs(fileName, ".js");
|
|
}
|
|
ts.isJavaScript = isJavaScript;
|
|
function isTsx(fileName) {
|
|
return ts.fileExtensionIs(fileName, ".tsx");
|
|
}
|
|
ts.isTsx = isTsx;
|
|
/**
|
|
* 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);
|
|
// handel 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 ouput
|
|
result += base64Digits.charAt(byte1) + base64Digits.charAt(byte2) + base64Digits.charAt(byte3) + base64Digits.charAt(byte4);
|
|
i += 3;
|
|
}
|
|
return result;
|
|
}
|
|
ts.convertToBase64 = convertToBase64;
|
|
var carriageReturnLineFeed = "\r\n";
|
|
var lineFeed = "\n";
|
|
function getNewLineCharacter(options) {
|
|
if (options.newLine === 0 /* CarriageReturnLineFeed */) {
|
|
return carriageReturnLineFeed;
|
|
}
|
|
else if (options.newLine === 1 /* LineFeed */) {
|
|
return lineFeed;
|
|
}
|
|
else if (ts.sys) {
|
|
return ts.sys.newLine;
|
|
}
|
|
return carriageReturnLineFeed;
|
|
}
|
|
ts.getNewLineCharacter = getNewLineCharacter;
|
|
})(ts || (ts = {}));
|
|
var ts;
|
|
(function (ts) {
|
|
function getDefaultLibFileName(options) {
|
|
return options.target === 2 /* ES6 */ ? "lib.es6.d.ts" : "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;
|
|
// 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) {
|
|
var overlapStart = Math.max(span.start, other.start);
|
|
var overlapEnd = Math.min(textSpanEnd(span), textSpanEnd(other));
|
|
return overlapStart < overlapEnd;
|
|
}
|
|
ts.textSpanOverlapsWith = textSpanOverlapsWith;
|
|
function textSpanOverlap(span1, span2) {
|
|
var overlapStart = Math.max(span1.start, span2.start);
|
|
var overlapEnd = Math.min(textSpanEnd(span1), textSpanEnd(span2));
|
|
if (overlapStart < overlapEnd) {
|
|
return createTextSpanFromBounds(overlapStart, overlapEnd);
|
|
}
|
|
return undefined;
|
|
}
|
|
ts.textSpanOverlap = textSpanOverlap;
|
|
function textSpanIntersectsWithTextSpan(span, other) {
|
|
return other.start <= textSpanEnd(span) && textSpanEnd(other) >= span.start;
|
|
}
|
|
ts.textSpanIntersectsWithTextSpan = textSpanIntersectsWithTextSpan;
|
|
function textSpanIntersectsWith(span, start, length) {
|
|
var end = start + length;
|
|
return start <= textSpanEnd(span) && end >= span.start;
|
|
}
|
|
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 intersectStart = Math.max(span1.start, span2.start);
|
|
var intersectEnd = Math.min(textSpanEnd(span1), textSpanEnd(span2));
|
|
if (intersectStart <= intersectEnd) {
|
|
return createTextSpanFromBounds(intersectStart, intersectEnd);
|
|
}
|
|
return 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);
|
|
/**
|
|
* 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 inferrred start.
|
|
// Determining the new and old end is also pretty simple. Basically it boils down to paying attention to the
|
|
// absolute positions at the asterixes, 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 rahter
|
|
// than pusing 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), newEndN - oldStartN);
|
|
}
|
|
ts.collapseTextChangeRangesAcrossMultipleVersions = collapseTextChangeRangesAcrossMultipleVersions;
|
|
function getTypeParameterOwner(d) {
|
|
if (d && d.kind === 134 /* TypeParameter */) {
|
|
for (var current = d; current; current = current.parent) {
|
|
if (ts.isFunctionLike(current) || ts.isClassLike(current) || current.kind === 212 /* InterfaceDeclaration */) {
|
|
return current;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
ts.getTypeParameterOwner = getTypeParameterOwner;
|
|
})(ts || (ts = {}));
|
|
/// <reference path="scanner.ts"/>
|
|
/// <reference path="utilities.ts"/>
|
|
var ts;
|
|
(function (ts) {
|
|
var nodeConstructors = new Array(269 /* Count */);
|
|
/* @internal */ ts.parseTime = 0;
|
|
function getNodeConstructor(kind) {
|
|
return nodeConstructors[kind] || (nodeConstructors[kind] = ts.objectAllocator.getNodeConstructor(kind));
|
|
}
|
|
ts.getNodeConstructor = getNodeConstructor;
|
|
function createNode(kind) {
|
|
return new (getNodeConstructor(kind))();
|
|
}
|
|
ts.createNode = createNode;
|
|
function visitNode(cbNode, node) {
|
|
if (node) {
|
|
return cbNode(node);
|
|
}
|
|
}
|
|
function visitNodeArray(cbNodes, nodes) {
|
|
if (nodes) {
|
|
return cbNodes(nodes);
|
|
}
|
|
}
|
|
function visitEachNode(cbNode, nodes) {
|
|
if (nodes) {
|
|
for (var _i = 0; _i < nodes.length; _i++) {
|
|
var node = nodes[_i];
|
|
var result = cbNode(node);
|
|
if (result) {
|
|
return result;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
// 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.
|
|
function forEachChild(node, cbNode, cbNodeArray) {
|
|
if (!node) {
|
|
return;
|
|
}
|
|
// The visitXXX functions could be written as local functions that close over the cbNode and cbNodeArray
|
|
// callback parameters, but that causes a closure allocation for each invocation with noticeable effects
|
|
// on performance.
|
|
var visitNodes = cbNodeArray ? visitNodeArray : visitEachNode;
|
|
var cbNodes = cbNodeArray || cbNode;
|
|
switch (node.kind) {
|
|
case 132 /* QualifiedName */:
|
|
return visitNode(cbNode, node.left) ||
|
|
visitNode(cbNode, node.right);
|
|
case 134 /* TypeParameter */:
|
|
return visitNode(cbNode, node.name) ||
|
|
visitNode(cbNode, node.constraint) ||
|
|
visitNode(cbNode, node.expression);
|
|
case 135 /* Parameter */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 242 /* PropertyAssignment */:
|
|
case 243 /* ShorthandPropertyAssignment */:
|
|
case 208 /* VariableDeclaration */:
|
|
case 160 /* BindingElement */:
|
|
return visitNodes(cbNodes, node.decorators) ||
|
|
visitNodes(cbNodes, node.modifiers) ||
|
|
visitNode(cbNode, node.propertyName) ||
|
|
visitNode(cbNode, node.dotDotDotToken) ||
|
|
visitNode(cbNode, node.name) ||
|
|
visitNode(cbNode, node.questionToken) ||
|
|
visitNode(cbNode, node.type) ||
|
|
visitNode(cbNode, node.initializer);
|
|
case 149 /* FunctionType */:
|
|
case 150 /* ConstructorType */:
|
|
case 144 /* CallSignature */:
|
|
case 145 /* ConstructSignature */:
|
|
case 146 /* IndexSignature */:
|
|
return visitNodes(cbNodes, node.decorators) ||
|
|
visitNodes(cbNodes, node.modifiers) ||
|
|
visitNodes(cbNodes, node.typeParameters) ||
|
|
visitNodes(cbNodes, node.parameters) ||
|
|
visitNode(cbNode, node.type);
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 141 /* Constructor */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 170 /* FunctionExpression */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 171 /* ArrowFunction */:
|
|
return visitNodes(cbNodes, node.decorators) ||
|
|
visitNodes(cbNodes, node.modifiers) ||
|
|
visitNode(cbNode, node.asteriskToken) ||
|
|
visitNode(cbNode, node.name) ||
|
|
visitNode(cbNode, node.questionToken) ||
|
|
visitNodes(cbNodes, node.typeParameters) ||
|
|
visitNodes(cbNodes, node.parameters) ||
|
|
visitNode(cbNode, node.type) ||
|
|
visitNode(cbNode, node.equalsGreaterThanToken) ||
|
|
visitNode(cbNode, node.body);
|
|
case 148 /* TypeReference */:
|
|
return visitNode(cbNode, node.typeName) ||
|
|
visitNodes(cbNodes, node.typeArguments);
|
|
case 147 /* TypePredicate */:
|
|
return visitNode(cbNode, node.parameterName) ||
|
|
visitNode(cbNode, node.type);
|
|
case 151 /* TypeQuery */:
|
|
return visitNode(cbNode, node.exprName);
|
|
case 152 /* TypeLiteral */:
|
|
return visitNodes(cbNodes, node.members);
|
|
case 153 /* ArrayType */:
|
|
return visitNode(cbNode, node.elementType);
|
|
case 154 /* TupleType */:
|
|
return visitNodes(cbNodes, node.elementTypes);
|
|
case 155 /* UnionType */:
|
|
case 156 /* IntersectionType */:
|
|
return visitNodes(cbNodes, node.types);
|
|
case 157 /* ParenthesizedType */:
|
|
return visitNode(cbNode, node.type);
|
|
case 158 /* ObjectBindingPattern */:
|
|
case 159 /* ArrayBindingPattern */:
|
|
return visitNodes(cbNodes, node.elements);
|
|
case 161 /* ArrayLiteralExpression */:
|
|
return visitNodes(cbNodes, node.elements);
|
|
case 162 /* ObjectLiteralExpression */:
|
|
return visitNodes(cbNodes, node.properties);
|
|
case 163 /* PropertyAccessExpression */:
|
|
return visitNode(cbNode, node.expression) ||
|
|
visitNode(cbNode, node.dotToken) ||
|
|
visitNode(cbNode, node.name);
|
|
case 164 /* ElementAccessExpression */:
|
|
return visitNode(cbNode, node.expression) ||
|
|
visitNode(cbNode, node.argumentExpression);
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
return visitNode(cbNode, node.expression) ||
|
|
visitNodes(cbNodes, node.typeArguments) ||
|
|
visitNodes(cbNodes, node.arguments);
|
|
case 167 /* TaggedTemplateExpression */:
|
|
return visitNode(cbNode, node.tag) ||
|
|
visitNode(cbNode, node.template);
|
|
case 168 /* TypeAssertionExpression */:
|
|
return visitNode(cbNode, node.type) ||
|
|
visitNode(cbNode, node.expression);
|
|
case 169 /* ParenthesizedExpression */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 172 /* DeleteExpression */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 173 /* TypeOfExpression */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 174 /* VoidExpression */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 176 /* PrefixUnaryExpression */:
|
|
return visitNode(cbNode, node.operand);
|
|
case 181 /* YieldExpression */:
|
|
return visitNode(cbNode, node.asteriskToken) ||
|
|
visitNode(cbNode, node.expression);
|
|
case 175 /* AwaitExpression */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 177 /* PostfixUnaryExpression */:
|
|
return visitNode(cbNode, node.operand);
|
|
case 178 /* BinaryExpression */:
|
|
return visitNode(cbNode, node.left) ||
|
|
visitNode(cbNode, node.operatorToken) ||
|
|
visitNode(cbNode, node.right);
|
|
case 186 /* AsExpression */:
|
|
return visitNode(cbNode, node.expression) ||
|
|
visitNode(cbNode, node.type);
|
|
case 179 /* ConditionalExpression */:
|
|
return visitNode(cbNode, node.condition) ||
|
|
visitNode(cbNode, node.questionToken) ||
|
|
visitNode(cbNode, node.whenTrue) ||
|
|
visitNode(cbNode, node.colonToken) ||
|
|
visitNode(cbNode, node.whenFalse);
|
|
case 182 /* SpreadElementExpression */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 189 /* Block */:
|
|
case 216 /* ModuleBlock */:
|
|
return visitNodes(cbNodes, node.statements);
|
|
case 245 /* SourceFile */:
|
|
return visitNodes(cbNodes, node.statements) ||
|
|
visitNode(cbNode, node.endOfFileToken);
|
|
case 190 /* VariableStatement */:
|
|
return visitNodes(cbNodes, node.decorators) ||
|
|
visitNodes(cbNodes, node.modifiers) ||
|
|
visitNode(cbNode, node.declarationList);
|
|
case 209 /* VariableDeclarationList */:
|
|
return visitNodes(cbNodes, node.declarations);
|
|
case 192 /* ExpressionStatement */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 193 /* IfStatement */:
|
|
return visitNode(cbNode, node.expression) ||
|
|
visitNode(cbNode, node.thenStatement) ||
|
|
visitNode(cbNode, node.elseStatement);
|
|
case 194 /* DoStatement */:
|
|
return visitNode(cbNode, node.statement) ||
|
|
visitNode(cbNode, node.expression);
|
|
case 195 /* WhileStatement */:
|
|
return visitNode(cbNode, node.expression) ||
|
|
visitNode(cbNode, node.statement);
|
|
case 196 /* ForStatement */:
|
|
return visitNode(cbNode, node.initializer) ||
|
|
visitNode(cbNode, node.condition) ||
|
|
visitNode(cbNode, node.incrementor) ||
|
|
visitNode(cbNode, node.statement);
|
|
case 197 /* ForInStatement */:
|
|
return visitNode(cbNode, node.initializer) ||
|
|
visitNode(cbNode, node.expression) ||
|
|
visitNode(cbNode, node.statement);
|
|
case 198 /* ForOfStatement */:
|
|
return visitNode(cbNode, node.initializer) ||
|
|
visitNode(cbNode, node.expression) ||
|
|
visitNode(cbNode, node.statement);
|
|
case 199 /* ContinueStatement */:
|
|
case 200 /* BreakStatement */:
|
|
return visitNode(cbNode, node.label);
|
|
case 201 /* ReturnStatement */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 202 /* WithStatement */:
|
|
return visitNode(cbNode, node.expression) ||
|
|
visitNode(cbNode, node.statement);
|
|
case 203 /* SwitchStatement */:
|
|
return visitNode(cbNode, node.expression) ||
|
|
visitNode(cbNode, node.caseBlock);
|
|
case 217 /* CaseBlock */:
|
|
return visitNodes(cbNodes, node.clauses);
|
|
case 238 /* CaseClause */:
|
|
return visitNode(cbNode, node.expression) ||
|
|
visitNodes(cbNodes, node.statements);
|
|
case 239 /* DefaultClause */:
|
|
return visitNodes(cbNodes, node.statements);
|
|
case 204 /* LabeledStatement */:
|
|
return visitNode(cbNode, node.label) ||
|
|
visitNode(cbNode, node.statement);
|
|
case 205 /* ThrowStatement */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 206 /* TryStatement */:
|
|
return visitNode(cbNode, node.tryBlock) ||
|
|
visitNode(cbNode, node.catchClause) ||
|
|
visitNode(cbNode, node.finallyBlock);
|
|
case 241 /* CatchClause */:
|
|
return visitNode(cbNode, node.variableDeclaration) ||
|
|
visitNode(cbNode, node.block);
|
|
case 136 /* Decorator */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 211 /* ClassDeclaration */:
|
|
case 183 /* ClassExpression */:
|
|
return visitNodes(cbNodes, node.decorators) ||
|
|
visitNodes(cbNodes, node.modifiers) ||
|
|
visitNode(cbNode, node.name) ||
|
|
visitNodes(cbNodes, node.typeParameters) ||
|
|
visitNodes(cbNodes, node.heritageClauses) ||
|
|
visitNodes(cbNodes, node.members);
|
|
case 212 /* InterfaceDeclaration */:
|
|
return visitNodes(cbNodes, node.decorators) ||
|
|
visitNodes(cbNodes, node.modifiers) ||
|
|
visitNode(cbNode, node.name) ||
|
|
visitNodes(cbNodes, node.typeParameters) ||
|
|
visitNodes(cbNodes, node.heritageClauses) ||
|
|
visitNodes(cbNodes, node.members);
|
|
case 213 /* TypeAliasDeclaration */:
|
|
return visitNodes(cbNodes, node.decorators) ||
|
|
visitNodes(cbNodes, node.modifiers) ||
|
|
visitNode(cbNode, node.name) ||
|
|
visitNodes(cbNodes, node.typeParameters) ||
|
|
visitNode(cbNode, node.type);
|
|
case 214 /* EnumDeclaration */:
|
|
return visitNodes(cbNodes, node.decorators) ||
|
|
visitNodes(cbNodes, node.modifiers) ||
|
|
visitNode(cbNode, node.name) ||
|
|
visitNodes(cbNodes, node.members);
|
|
case 244 /* EnumMember */:
|
|
return visitNode(cbNode, node.name) ||
|
|
visitNode(cbNode, node.initializer);
|
|
case 215 /* ModuleDeclaration */:
|
|
return visitNodes(cbNodes, node.decorators) ||
|
|
visitNodes(cbNodes, node.modifiers) ||
|
|
visitNode(cbNode, node.name) ||
|
|
visitNode(cbNode, node.body);
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
return visitNodes(cbNodes, node.decorators) ||
|
|
visitNodes(cbNodes, node.modifiers) ||
|
|
visitNode(cbNode, node.name) ||
|
|
visitNode(cbNode, node.moduleReference);
|
|
case 219 /* ImportDeclaration */:
|
|
return visitNodes(cbNodes, node.decorators) ||
|
|
visitNodes(cbNodes, node.modifiers) ||
|
|
visitNode(cbNode, node.importClause) ||
|
|
visitNode(cbNode, node.moduleSpecifier);
|
|
case 220 /* ImportClause */:
|
|
return visitNode(cbNode, node.name) ||
|
|
visitNode(cbNode, node.namedBindings);
|
|
case 221 /* NamespaceImport */:
|
|
return visitNode(cbNode, node.name);
|
|
case 222 /* NamedImports */:
|
|
case 226 /* NamedExports */:
|
|
return visitNodes(cbNodes, node.elements);
|
|
case 225 /* ExportDeclaration */:
|
|
return visitNodes(cbNodes, node.decorators) ||
|
|
visitNodes(cbNodes, node.modifiers) ||
|
|
visitNode(cbNode, node.exportClause) ||
|
|
visitNode(cbNode, node.moduleSpecifier);
|
|
case 223 /* ImportSpecifier */:
|
|
case 227 /* ExportSpecifier */:
|
|
return visitNode(cbNode, node.propertyName) ||
|
|
visitNode(cbNode, node.name);
|
|
case 224 /* ExportAssignment */:
|
|
return visitNodes(cbNodes, node.decorators) ||
|
|
visitNodes(cbNodes, node.modifiers) ||
|
|
visitNode(cbNode, node.expression);
|
|
case 180 /* TemplateExpression */:
|
|
return visitNode(cbNode, node.head) || visitNodes(cbNodes, node.templateSpans);
|
|
case 187 /* TemplateSpan */:
|
|
return visitNode(cbNode, node.expression) || visitNode(cbNode, node.literal);
|
|
case 133 /* ComputedPropertyName */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 240 /* HeritageClause */:
|
|
return visitNodes(cbNodes, node.types);
|
|
case 185 /* ExpressionWithTypeArguments */:
|
|
return visitNode(cbNode, node.expression) ||
|
|
visitNodes(cbNodes, node.typeArguments);
|
|
case 229 /* ExternalModuleReference */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 228 /* MissingDeclaration */:
|
|
return visitNodes(cbNodes, node.decorators);
|
|
case 230 /* JsxElement */:
|
|
return visitNode(cbNode, node.openingElement) ||
|
|
visitNodes(cbNodes, node.children) ||
|
|
visitNode(cbNode, node.closingElement);
|
|
case 231 /* JsxSelfClosingElement */:
|
|
case 232 /* JsxOpeningElement */:
|
|
return visitNode(cbNode, node.tagName) ||
|
|
visitNodes(cbNodes, node.attributes);
|
|
case 235 /* JsxAttribute */:
|
|
return visitNode(cbNode, node.name) ||
|
|
visitNode(cbNode, node.initializer);
|
|
case 236 /* JsxSpreadAttribute */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 237 /* JsxExpression */:
|
|
return visitNode(cbNode, node.expression);
|
|
case 234 /* JsxClosingElement */:
|
|
return visitNode(cbNode, node.tagName);
|
|
case 246 /* JSDocTypeExpression */:
|
|
return visitNode(cbNode, node.type);
|
|
case 250 /* JSDocUnionType */:
|
|
return visitNodes(cbNodes, node.types);
|
|
case 251 /* JSDocTupleType */:
|
|
return visitNodes(cbNodes, node.types);
|
|
case 249 /* JSDocArrayType */:
|
|
return visitNode(cbNode, node.elementType);
|
|
case 253 /* JSDocNonNullableType */:
|
|
return visitNode(cbNode, node.type);
|
|
case 252 /* JSDocNullableType */:
|
|
return visitNode(cbNode, node.type);
|
|
case 254 /* JSDocRecordType */:
|
|
return visitNodes(cbNodes, node.members);
|
|
case 256 /* JSDocTypeReference */:
|
|
return visitNode(cbNode, node.name) ||
|
|
visitNodes(cbNodes, node.typeArguments);
|
|
case 257 /* JSDocOptionalType */:
|
|
return visitNode(cbNode, node.type);
|
|
case 258 /* JSDocFunctionType */:
|
|
return visitNodes(cbNodes, node.parameters) ||
|
|
visitNode(cbNode, node.type);
|
|
case 259 /* JSDocVariadicType */:
|
|
return visitNode(cbNode, node.type);
|
|
case 260 /* JSDocConstructorType */:
|
|
return visitNode(cbNode, node.type);
|
|
case 261 /* JSDocThisType */:
|
|
return visitNode(cbNode, node.type);
|
|
case 255 /* JSDocRecordMember */:
|
|
return visitNode(cbNode, node.name) ||
|
|
visitNode(cbNode, node.type);
|
|
case 262 /* JSDocComment */:
|
|
return visitNodes(cbNodes, node.tags);
|
|
case 264 /* JSDocParameterTag */:
|
|
return visitNode(cbNode, node.preParameterName) ||
|
|
visitNode(cbNode, node.typeExpression) ||
|
|
visitNode(cbNode, node.postParameterName);
|
|
case 265 /* JSDocReturnTag */:
|
|
return visitNode(cbNode, node.typeExpression);
|
|
case 266 /* JSDocTypeTag */:
|
|
return visitNode(cbNode, node.typeExpression);
|
|
case 267 /* JSDocTemplateTag */:
|
|
return visitNodes(cbNodes, node.typeParameters);
|
|
}
|
|
}
|
|
ts.forEachChild = forEachChild;
|
|
function createSourceFile(fileName, sourceText, languageVersion, setParentNodes) {
|
|
if (setParentNodes === void 0) { setParentNodes = false; }
|
|
var start = new Date().getTime();
|
|
var result = Parser.parseSourceFile(fileName, sourceText, languageVersion, undefined, setParentNodes);
|
|
ts.parseTime += new Date().getTime() - start;
|
|
return result;
|
|
}
|
|
ts.createSourceFile = createSourceFile;
|
|
// 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) {
|
|
return IncrementalParser.updateSourceFile(sourceFile, newText, textChangeRange, aggressiveChecks);
|
|
}
|
|
ts.updateSourceFile = updateSourceFile;
|
|
/* @internal */
|
|
function parseIsolatedJSDocComment(content, start, length) {
|
|
return Parser.JSDocParser.parseIsolatedJSDocComment(content, start, length);
|
|
}
|
|
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(2 /* Latest */, true);
|
|
var disallowInAndDecoratorContext = 1 /* DisallowIn */ | 4 /* Decorator */;
|
|
var sourceFile;
|
|
var parseDiagnostics;
|
|
var syntaxCursor;
|
|
var token;
|
|
var sourceText;
|
|
var nodeCount;
|
|
var identifiers;
|
|
var identifierCount;
|
|
var parsingContext;
|
|
// 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;
|
|
// 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) {
|
|
initializeState(fileName, _sourceText, languageVersion, _syntaxCursor);
|
|
var result = parseSourceFileWorker(fileName, languageVersion, setParentNodes);
|
|
clearState();
|
|
return result;
|
|
}
|
|
Parser.parseSourceFile = parseSourceFile;
|
|
function initializeState(fileName, _sourceText, languageVersion, _syntaxCursor) {
|
|
sourceText = _sourceText;
|
|
syntaxCursor = _syntaxCursor;
|
|
parseDiagnostics = [];
|
|
parsingContext = 0;
|
|
identifiers = {};
|
|
identifierCount = 0;
|
|
nodeCount = 0;
|
|
contextFlags = ts.isJavaScript(fileName) ? 32 /* JavaScriptFile */ : 0 /* None */;
|
|
parseErrorBeforeNextFinishedNode = false;
|
|
// Initialize and prime the scanner before parsing the source elements.
|
|
scanner.setText(sourceText);
|
|
scanner.setOnError(scanError);
|
|
scanner.setScriptTarget(languageVersion);
|
|
scanner.setLanguageVariant(ts.isTsx(fileName) ? 1 /* JSX */ : 0 /* Standard */);
|
|
}
|
|
function clearState() {
|
|
// Clear out the text the scanner is pointing at, so it doesn't keep anything alive unnecessarily.
|
|
scanner.setText("");
|
|
scanner.setOnError(undefined);
|
|
// Clear any data. We don't want to accidently hold onto it for too long.
|
|
parseDiagnostics = undefined;
|
|
sourceFile = undefined;
|
|
identifiers = undefined;
|
|
syntaxCursor = undefined;
|
|
sourceText = undefined;
|
|
}
|
|
function parseSourceFileWorker(fileName, languageVersion, setParentNodes) {
|
|
sourceFile = createSourceFile(fileName, languageVersion);
|
|
// Prime the scanner.
|
|
token = nextToken();
|
|
processReferenceComments(sourceFile);
|
|
sourceFile.statements = parseList(0 /* SourceElements */, parseStatement);
|
|
ts.Debug.assert(token === 1 /* EndOfFileToken */);
|
|
sourceFile.endOfFileToken = parseTokenNode();
|
|
setExternalModuleIndicator(sourceFile);
|
|
sourceFile.nodeCount = nodeCount;
|
|
sourceFile.identifierCount = identifierCount;
|
|
sourceFile.identifiers = identifiers;
|
|
sourceFile.parseDiagnostics = parseDiagnostics;
|
|
if (setParentNodes) {
|
|
fixupParentReferences(sourceFile);
|
|
}
|
|
// If this is a javascript file, proactively see if we can get JSDoc comments for
|
|
// relevant nodes in the file. We'll use these to provide typing informaion if they're
|
|
// available.
|
|
if (ts.isJavaScript(fileName)) {
|
|
addJSDocComments();
|
|
}
|
|
return sourceFile;
|
|
}
|
|
function addJSDocComments() {
|
|
forEachChild(sourceFile, visit);
|
|
return;
|
|
function visit(node) {
|
|
// Add additional cases as necessary depending on how we see JSDoc comments used
|
|
// in the wild.
|
|
switch (node.kind) {
|
|
case 190 /* VariableStatement */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 135 /* Parameter */:
|
|
addJSDocComment(node);
|
|
}
|
|
forEachChild(node, visit);
|
|
}
|
|
}
|
|
function addJSDocComment(node) {
|
|
var comments = ts.getLeadingCommentRangesOfNode(node, sourceFile);
|
|
if (comments) {
|
|
for (var _i = 0; _i < comments.length; _i++) {
|
|
var comment = comments[_i];
|
|
var jsDocComment = JSDocParser.parseJSDocComment(node, comment.pos, comment.end - comment.pos);
|
|
if (jsDocComment) {
|
|
node.jsDocComment = jsDocComment;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function fixupParentReferences(sourceFile) {
|
|
// 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.
|
|
var parent = sourceFile;
|
|
forEachChild(sourceFile, visitNode);
|
|
return;
|
|
function visitNode(n) {
|
|
// walk down setting parents that differ from the parent we think it should be. This
|
|
// allows us to quickly bail out of setting parents for subtrees during incremental
|
|
// parsing
|
|
if (n.parent !== parent) {
|
|
n.parent = parent;
|
|
var saveParent = parent;
|
|
parent = n;
|
|
forEachChild(n, visitNode);
|
|
parent = saveParent;
|
|
}
|
|
}
|
|
}
|
|
Parser.fixupParentReferences = fixupParentReferences;
|
|
function createSourceFile(fileName, languageVersion) {
|
|
var sourceFile = createNode(245 /* SourceFile */, 0);
|
|
sourceFile.pos = 0;
|
|
sourceFile.end = sourceText.length;
|
|
sourceFile.text = sourceText;
|
|
sourceFile.bindDiagnostics = [];
|
|
sourceFile.languageVersion = languageVersion;
|
|
sourceFile.fileName = ts.normalizePath(fileName);
|
|
sourceFile.flags = ts.fileExtensionIs(sourceFile.fileName, ".d.ts") ? 8192 /* DeclarationFile */ : 0;
|
|
sourceFile.languageVariant = ts.isTsx(sourceFile.fileName) ? 1 /* JSX */ : 0 /* Standard */;
|
|
return sourceFile;
|
|
}
|
|
function setContextFlag(val, flag) {
|
|
if (val) {
|
|
contextFlags |= flag;
|
|
}
|
|
else {
|
|
contextFlags &= ~flag;
|
|
}
|
|
}
|
|
function setDisallowInContext(val) {
|
|
setContextFlag(val, 1 /* DisallowIn */);
|
|
}
|
|
function setYieldContext(val) {
|
|
setContextFlag(val, 2 /* Yield */);
|
|
}
|
|
function setDecoratorContext(val) {
|
|
setContextFlag(val, 4 /* Decorator */);
|
|
}
|
|
function setAwaitContext(val) {
|
|
setContextFlag(val, 8 /* Await */);
|
|
}
|
|
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(false, contextFlagsToClear);
|
|
var result = func();
|
|
// restore the context flags we just cleared
|
|
setContextFlag(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(true, contextFlagsToSet);
|
|
var result = func();
|
|
// reset the context flags we just set
|
|
setContextFlag(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(1 /* DisallowIn */, func);
|
|
}
|
|
function disallowInAnd(func) {
|
|
return doInsideOfContext(1 /* DisallowIn */, func);
|
|
}
|
|
function doInYieldContext(func) {
|
|
return doInsideOfContext(2 /* Yield */, func);
|
|
}
|
|
function doOutsideOfYieldContext(func) {
|
|
return doOutsideOfContext(2 /* Yield */, func);
|
|
}
|
|
function doInDecoratorContext(func) {
|
|
return doInsideOfContext(4 /* Decorator */, func);
|
|
}
|
|
function doInAwaitContext(func) {
|
|
return doInsideOfContext(8 /* Await */, func);
|
|
}
|
|
function doOutsideOfAwaitContext(func) {
|
|
return doOutsideOfContext(8 /* Await */, func);
|
|
}
|
|
function doInYieldAndAwaitContext(func) {
|
|
return doInsideOfContext(2 /* Yield */ | 8 /* Await */, func);
|
|
}
|
|
function doOutsideOfYieldAndAwaitContext(func) {
|
|
return doOutsideOfContext(2 /* Yield */ | 8 /* Await */, func);
|
|
}
|
|
function inContext(flags) {
|
|
return (contextFlags & flags) !== 0;
|
|
}
|
|
function inYieldContext() {
|
|
return inContext(2 /* Yield */);
|
|
}
|
|
function inDisallowInContext() {
|
|
return inContext(1 /* DisallowIn */);
|
|
}
|
|
function inDecoratorContext() {
|
|
return inContext(4 /* Decorator */);
|
|
}
|
|
function inAwaitContext() {
|
|
return inContext(8 /* Await */);
|
|
}
|
|
function parseErrorAtCurrentToken(message, arg0) {
|
|
var start = scanner.getTokenPos();
|
|
var length = scanner.getTextPos() - start;
|
|
parseErrorAtPosition(start, length, 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.createFileDiagnostic(sourceFile, 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 scanError(message, length) {
|
|
var pos = scanner.getTextPos();
|
|
parseErrorAtPosition(pos, length || 0, message);
|
|
}
|
|
function getNodePos() {
|
|
return scanner.getStartPos();
|
|
}
|
|
function getNodeEnd() {
|
|
return scanner.getStartPos();
|
|
}
|
|
function nextToken() {
|
|
return token = scanner.scan();
|
|
}
|
|
function getTokenPos(pos) {
|
|
return ts.skipTrivia(sourceText, pos);
|
|
}
|
|
function reScanGreaterToken() {
|
|
return token = scanner.reScanGreaterToken();
|
|
}
|
|
function reScanSlashToken() {
|
|
return token = scanner.reScanSlashToken();
|
|
}
|
|
function reScanTemplateToken() {
|
|
return token = scanner.reScanTemplateToken();
|
|
}
|
|
function scanJsxIdentifier() {
|
|
return token = scanner.scanJsxIdentifier();
|
|
}
|
|
function speculationHelper(callback, isLookAhead) {
|
|
// 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 = token;
|
|
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/restorating 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 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 = isLookAhead
|
|
? 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 || isLookAhead) {
|
|
token = saveToken;
|
|
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, true);
|
|
}
|
|
// 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, false);
|
|
}
|
|
// Ignore strict mode flag because we will report an error in type checker instead.
|
|
function isIdentifier() {
|
|
if (token === 66 /* 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 === 111 /* 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 === 116 /* AwaitKeyword */ && inAwaitContext()) {
|
|
return false;
|
|
}
|
|
return token > 102 /* LastReservedWord */;
|
|
}
|
|
function parseExpected(kind, diagnosticMessage) {
|
|
if (token === kind) {
|
|
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;
|
|
}
|
|
function parseOptional(t) {
|
|
if (token === t) {
|
|
nextToken();
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function parseOptionalToken(t) {
|
|
if (token === t) {
|
|
return parseTokenNode();
|
|
}
|
|
return undefined;
|
|
}
|
|
function parseExpectedToken(t, reportAtCurrentPosition, diagnosticMessage, arg0) {
|
|
return parseOptionalToken(t) ||
|
|
createMissingNode(t, reportAtCurrentPosition, diagnosticMessage, arg0);
|
|
}
|
|
function parseTokenNode() {
|
|
var node = createNode(token);
|
|
nextToken();
|
|
return finishNode(node);
|
|
}
|
|
function canParseSemicolon() {
|
|
// If there's a real semicolon, then we can always parse it out.
|
|
if (token === 22 /* SemicolonToken */) {
|
|
return true;
|
|
}
|
|
// We can parse out an optional semicolon in ASI cases in the following cases.
|
|
return token === 15 /* CloseBraceToken */ || token === 1 /* EndOfFileToken */ || scanner.hasPrecedingLineBreak();
|
|
}
|
|
function parseSemicolon() {
|
|
if (canParseSemicolon()) {
|
|
if (token === 22 /* SemicolonToken */) {
|
|
// consume the semicolon if it was explicitly provided.
|
|
nextToken();
|
|
}
|
|
return true;
|
|
}
|
|
else {
|
|
return parseExpected(22 /* SemicolonToken */);
|
|
}
|
|
}
|
|
function createNode(kind, pos) {
|
|
nodeCount++;
|
|
var node = new (nodeConstructors[kind] || (nodeConstructors[kind] = ts.objectAllocator.getNodeConstructor(kind)))();
|
|
if (!(pos >= 0)) {
|
|
pos = scanner.getStartPos();
|
|
}
|
|
node.pos = pos;
|
|
node.end = pos;
|
|
return node;
|
|
}
|
|
function finishNode(node, end) {
|
|
node.end = end === undefined ? scanner.getStartPos() : end;
|
|
if (contextFlags) {
|
|
node.parserContextFlags = 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.parserContextFlags |= 16 /* ThisNodeHasError */;
|
|
}
|
|
return node;
|
|
}
|
|
function createMissingNode(kind, reportAtCurrentPosition, diagnosticMessage, arg0) {
|
|
if (reportAtCurrentPosition) {
|
|
parseErrorAtPosition(scanner.getStartPos(), 0, diagnosticMessage, arg0);
|
|
}
|
|
else {
|
|
parseErrorAtCurrentToken(diagnosticMessage, arg0);
|
|
}
|
|
var result = createNode(kind, scanner.getStartPos());
|
|
result.text = "";
|
|
return finishNode(result);
|
|
}
|
|
function internIdentifier(text) {
|
|
text = ts.escapeIdentifier(text);
|
|
return ts.hasProperty(identifiers, text) ? identifiers[text] : (identifiers[text] = text);
|
|
}
|
|
// 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) {
|
|
identifierCount++;
|
|
if (isIdentifier) {
|
|
var node = createNode(66 /* Identifier */);
|
|
// Store original token kind if it is not just an Identifier so we can report appropriate error later in type checker
|
|
if (token !== 66 /* Identifier */) {
|
|
node.originalKeywordKind = token;
|
|
}
|
|
node.text = internIdentifier(scanner.getTokenValue());
|
|
nextToken();
|
|
return finishNode(node);
|
|
}
|
|
return createMissingNode(66 /* Identifier */, false, diagnosticMessage || ts.Diagnostics.Identifier_expected);
|
|
}
|
|
function parseIdentifier(diagnosticMessage) {
|
|
return createIdentifier(isIdentifier(), diagnosticMessage);
|
|
}
|
|
function parseIdentifierName() {
|
|
return createIdentifier(isIdentifierOrKeyword());
|
|
}
|
|
function isLiteralPropertyName() {
|
|
return isIdentifierOrKeyword() ||
|
|
token === 8 /* StringLiteral */ ||
|
|
token === 7 /* NumericLiteral */;
|
|
}
|
|
function parsePropertyNameWorker(allowComputedPropertyNames) {
|
|
if (token === 8 /* StringLiteral */ || token === 7 /* NumericLiteral */) {
|
|
return parseLiteralNode(true);
|
|
}
|
|
if (allowComputedPropertyNames && token === 18 /* OpenBracketToken */) {
|
|
return parseComputedPropertyName();
|
|
}
|
|
return parseIdentifierName();
|
|
}
|
|
function parsePropertyName() {
|
|
return parsePropertyNameWorker(true);
|
|
}
|
|
function parseSimplePropertyName() {
|
|
return parsePropertyNameWorker(false);
|
|
}
|
|
function isSimplePropertyName() {
|
|
return token === 8 /* StringLiteral */ || token === 7 /* NumericLiteral */ || isIdentifierOrKeyword();
|
|
}
|
|
function parseComputedPropertyName() {
|
|
// PropertyName [Yield]:
|
|
// LiteralPropertyName
|
|
// ComputedPropertyName[?Yield]
|
|
var node = createNode(133 /* ComputedPropertyName */);
|
|
parseExpected(18 /* 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.
|
|
node.expression = allowInAnd(parseExpression);
|
|
parseExpected(19 /* CloseBracketToken */);
|
|
return finishNode(node);
|
|
}
|
|
function parseContextualModifier(t) {
|
|
return token === t && tryParse(nextTokenCanFollowModifier);
|
|
}
|
|
function nextTokenCanFollowModifier() {
|
|
if (token === 71 /* ConstKeyword */) {
|
|
// 'const' is only a modifier if followed by 'enum'.
|
|
return nextToken() === 78 /* EnumKeyword */;
|
|
}
|
|
if (token === 79 /* ExportKeyword */) {
|
|
nextToken();
|
|
if (token === 74 /* DefaultKeyword */) {
|
|
return lookAhead(nextTokenIsClassOrFunction);
|
|
}
|
|
return token !== 36 /* AsteriskToken */ && token !== 14 /* OpenBraceToken */ && canFollowModifier();
|
|
}
|
|
if (token === 74 /* DefaultKeyword */) {
|
|
return nextTokenIsClassOrFunction();
|
|
}
|
|
nextToken();
|
|
return canFollowModifier();
|
|
}
|
|
function parseAnyContextualModifier() {
|
|
return ts.isModifier(token) && tryParse(nextTokenCanFollowModifier);
|
|
}
|
|
function canFollowModifier() {
|
|
return token === 18 /* OpenBracketToken */
|
|
|| token === 14 /* OpenBraceToken */
|
|
|| token === 36 /* AsteriskToken */
|
|
|| isLiteralPropertyName();
|
|
}
|
|
function nextTokenIsClassOrFunction() {
|
|
nextToken();
|
|
return token === 70 /* ClassKeyword */ || token === 84 /* FunctionKeyword */;
|
|
}
|
|
// 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 === 22 /* SemicolonToken */ && inErrorRecovery) && isStartOfStatement();
|
|
case 2 /* SwitchClauses */:
|
|
return token === 68 /* CaseKeyword */ || token === 74 /* DefaultKeyword */;
|
|
case 4 /* TypeMembers */:
|
|
return isStartOfTypeMember();
|
|
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 === 22 /* 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 === 18 /* OpenBracketToken */ || isLiteralPropertyName();
|
|
case 12 /* ObjectLiteralMembers */:
|
|
return token === 18 /* OpenBracketToken */ || token === 36 /* AsteriskToken */ || isLiteralPropertyName();
|
|
case 9 /* ObjectBindingElements */:
|
|
return 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 === 14 /* 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 isIdentifierOrPattern();
|
|
case 10 /* ArrayBindingElements */:
|
|
return token === 23 /* CommaToken */ || token === 21 /* DotDotDotToken */ || isIdentifierOrPattern();
|
|
case 17 /* TypeParameters */:
|
|
return isIdentifier();
|
|
case 11 /* ArgumentExpressions */:
|
|
case 15 /* ArrayLiteralMembers */:
|
|
return token === 23 /* CommaToken */ || token === 21 /* DotDotDotToken */ || isStartOfExpression();
|
|
case 16 /* Parameters */:
|
|
return isStartOfParameter();
|
|
case 18 /* TypeArguments */:
|
|
case 19 /* TupleElementTypes */:
|
|
return token === 23 /* CommaToken */ || isStartOfType();
|
|
case 20 /* HeritageClauses */:
|
|
return isHeritageClause();
|
|
case 21 /* ImportOrExportSpecifiers */:
|
|
return isIdentifierOrKeyword();
|
|
case 13 /* JsxAttributes */:
|
|
return isIdentifierOrKeyword() || token === 14 /* OpenBraceToken */;
|
|
case 14 /* JsxChildren */:
|
|
return true;
|
|
case 22 /* JSDocFunctionParameters */:
|
|
case 23 /* JSDocTypeArguments */:
|
|
case 25 /* JSDocTupleTypes */:
|
|
return JSDocParser.isJSDocType();
|
|
case 24 /* JSDocRecordMembers */:
|
|
return isSimplePropertyName();
|
|
}
|
|
ts.Debug.fail("Non-exhaustive case in 'isListElement'.");
|
|
}
|
|
function isValidHeritageClauseObjectLiteral() {
|
|
ts.Debug.assert(token === 14 /* OpenBraceToken */);
|
|
if (nextToken() === 15 /* 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 === 23 /* CommaToken */ || next === 14 /* OpenBraceToken */ || next === 80 /* ExtendsKeyword */ || next === 103 /* ImplementsKeyword */;
|
|
}
|
|
return true;
|
|
}
|
|
function nextTokenIsIdentifier() {
|
|
nextToken();
|
|
return isIdentifier();
|
|
}
|
|
function nextTokenIsIdentifierOrKeyword() {
|
|
nextToken();
|
|
return isIdentifierOrKeyword();
|
|
}
|
|
function isHeritageClauseExtendsOrImplementsKeyword() {
|
|
if (token === 103 /* ImplementsKeyword */ ||
|
|
token === 80 /* ExtendsKeyword */) {
|
|
return lookAhead(nextTokenIsStartOfExpression);
|
|
}
|
|
return false;
|
|
}
|
|
function nextTokenIsStartOfExpression() {
|
|
nextToken();
|
|
return isStartOfExpression();
|
|
}
|
|
// 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 21 /* ImportOrExportSpecifiers */:
|
|
return token === 15 /* CloseBraceToken */;
|
|
case 3 /* SwitchClauseStatements */:
|
|
return token === 15 /* CloseBraceToken */ || token === 68 /* CaseKeyword */ || token === 74 /* DefaultKeyword */;
|
|
case 7 /* HeritageClauseElement */:
|
|
return token === 14 /* OpenBraceToken */ || token === 80 /* ExtendsKeyword */ || token === 103 /* ImplementsKeyword */;
|
|
case 8 /* VariableDeclarations */:
|
|
return isVariableDeclaratorListTerminator();
|
|
case 17 /* TypeParameters */:
|
|
// Tokens other than '>' are here for better error recovery
|
|
return token === 26 /* GreaterThanToken */ || token === 16 /* OpenParenToken */ || token === 14 /* OpenBraceToken */ || token === 80 /* ExtendsKeyword */ || token === 103 /* ImplementsKeyword */;
|
|
case 11 /* ArgumentExpressions */:
|
|
// Tokens other than ')' are here for better error recovery
|
|
return token === 17 /* CloseParenToken */ || token === 22 /* SemicolonToken */;
|
|
case 15 /* ArrayLiteralMembers */:
|
|
case 19 /* TupleElementTypes */:
|
|
case 10 /* ArrayBindingElements */:
|
|
return token === 19 /* CloseBracketToken */;
|
|
case 16 /* Parameters */:
|
|
// Tokens other than ')' and ']' (the latter for index signatures) are here for better error recovery
|
|
return token === 17 /* CloseParenToken */ || token === 19 /* CloseBracketToken */ /*|| token === SyntaxKind.OpenBraceToken*/;
|
|
case 18 /* TypeArguments */:
|
|
// Tokens other than '>' are here for better error recovery
|
|
return token === 26 /* GreaterThanToken */ || token === 16 /* OpenParenToken */;
|
|
case 20 /* HeritageClauses */:
|
|
return token === 14 /* OpenBraceToken */ || token === 15 /* CloseBraceToken */;
|
|
case 13 /* JsxAttributes */:
|
|
return token === 26 /* GreaterThanToken */ || token === 37 /* SlashToken */;
|
|
case 14 /* JsxChildren */:
|
|
return token === 24 /* LessThanToken */ && lookAhead(nextTokenIsSlash);
|
|
case 22 /* JSDocFunctionParameters */:
|
|
return token === 17 /* CloseParenToken */ || token === 52 /* ColonToken */ || token === 15 /* CloseBraceToken */;
|
|
case 23 /* JSDocTypeArguments */:
|
|
return token === 26 /* GreaterThanToken */ || token === 15 /* CloseBraceToken */;
|
|
case 25 /* JSDocTupleTypes */:
|
|
return token === 19 /* CloseBracketToken */ || token === 15 /* CloseBraceToken */;
|
|
case 24 /* JSDocRecordMembers */:
|
|
return token === 15 /* CloseBraceToken */;
|
|
}
|
|
}
|
|
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 === 33 /* 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 < 26 /* Count */; kind++) {
|
|
if (parsingContext & (1 << kind)) {
|
|
if (isListElement(kind, true) || isListTerminator(kind)) {
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
// Parses a list of elements
|
|
function parseList(kind, parseElement) {
|
|
var saveParsingContext = parsingContext;
|
|
parsingContext |= 1 << kind;
|
|
var result = [];
|
|
result.pos = getNodePos();
|
|
while (!isListTerminator(kind)) {
|
|
if (isListElement(kind, false)) {
|
|
var element = parseListElement(kind, parseElement);
|
|
result.push(element);
|
|
continue;
|
|
}
|
|
if (abortParsingListOrMoveToNextToken(kind)) {
|
|
break;
|
|
}
|
|
}
|
|
result.end = getNodeEnd();
|
|
parsingContext = saveParsingContext;
|
|
return result;
|
|
}
|
|
function parseListElement(parsingContext, parseElement) {
|
|
var node = currentNode(parsingContext);
|
|
if (node) {
|
|
return consumeNode(node);
|
|
}
|
|
return parseElement();
|
|
}
|
|
function currentNode(parsingContext) {
|
|
// 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 (parseErrorBeforeNextFinishedNode) {
|
|
return undefined;
|
|
}
|
|
if (!syntaxCursor) {
|
|
// if we don't have a cursor, we could never return a node from the old tree.
|
|
return undefined;
|
|
}
|
|
var node = syntaxCursor.currentNode(scanner.getStartPos());
|
|
// Can't reuse a missing node.
|
|
if (ts.nodeIsMissing(node)) {
|
|
return undefined;
|
|
}
|
|
// Can't reuse a node that intersected the change range.
|
|
if (node.intersectsChange) {
|
|
return undefined;
|
|
}
|
|
// 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.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 presense of strict mode may cause us to parse the tokens in the file
|
|
// differetly.
|
|
//
|
|
// 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.parserContextFlags & 31 /* ParserGeneratedFlags */;
|
|
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 currest list parsing context that we're currently at.
|
|
if (!canReuseNode(node, parsingContext)) {
|
|
return 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 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 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 20 /* HeritageClauses */:
|
|
// This would probably be safe to reuse. There is no speculative parsing with
|
|
// heritage clauses.
|
|
case 17 /* 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 19 /* 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 18 /* 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 11 /* 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 12 /* 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 7 /* 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 13 /* JsxAttributes */:
|
|
case 14 /* JsxChildren */:
|
|
}
|
|
return false;
|
|
}
|
|
function isReusableClassMember(node) {
|
|
if (node) {
|
|
switch (node.kind) {
|
|
case 141 /* Constructor */:
|
|
case 146 /* IndexSignature */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 188 /* SemicolonClassElement */:
|
|
return true;
|
|
case 140 /* 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 === 66 /* Identifier */ &&
|
|
methodDeclaration.name.originalKeywordKind === 118 /* ConstructorKeyword */;
|
|
return !nameIsConstructor;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function isReusableSwitchClause(node) {
|
|
if (node) {
|
|
switch (node.kind) {
|
|
case 238 /* CaseClause */:
|
|
case 239 /* DefaultClause */:
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function isReusableStatement(node) {
|
|
if (node) {
|
|
switch (node.kind) {
|
|
case 210 /* FunctionDeclaration */:
|
|
case 190 /* VariableStatement */:
|
|
case 189 /* Block */:
|
|
case 193 /* IfStatement */:
|
|
case 192 /* ExpressionStatement */:
|
|
case 205 /* ThrowStatement */:
|
|
case 201 /* ReturnStatement */:
|
|
case 203 /* SwitchStatement */:
|
|
case 200 /* BreakStatement */:
|
|
case 199 /* ContinueStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
case 196 /* ForStatement */:
|
|
case 195 /* WhileStatement */:
|
|
case 202 /* WithStatement */:
|
|
case 191 /* EmptyStatement */:
|
|
case 206 /* TryStatement */:
|
|
case 204 /* LabeledStatement */:
|
|
case 194 /* DoStatement */:
|
|
case 207 /* DebuggerStatement */:
|
|
case 219 /* ImportDeclaration */:
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 225 /* ExportDeclaration */:
|
|
case 224 /* ExportAssignment */:
|
|
case 215 /* ModuleDeclaration */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 213 /* TypeAliasDeclaration */:
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function isReusableEnumMember(node) {
|
|
return node.kind === 244 /* EnumMember */;
|
|
}
|
|
function isReusableTypeMember(node) {
|
|
if (node) {
|
|
switch (node.kind) {
|
|
case 145 /* ConstructSignature */:
|
|
case 139 /* MethodSignature */:
|
|
case 146 /* IndexSignature */:
|
|
case 137 /* PropertySignature */:
|
|
case 144 /* CallSignature */:
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function isReusableVariableDeclaration(node) {
|
|
if (node.kind !== 208 /* 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 !== 135 /* 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) {
|
|
parseErrorAtCurrentToken(parsingContextErrors(kind));
|
|
if (isInSomeParsingContext()) {
|
|
return true;
|
|
}
|
|
nextToken();
|
|
return false;
|
|
}
|
|
function parsingContextErrors(context) {
|
|
switch (context) {
|
|
case 0 /* SourceElements */: return ts.Diagnostics.Declaration_or_statement_expected;
|
|
case 1 /* BlockStatements */: return ts.Diagnostics.Declaration_or_statement_expected;
|
|
case 2 /* SwitchClauses */: return ts.Diagnostics.case_or_default_expected;
|
|
case 3 /* SwitchClauseStatements */: return ts.Diagnostics.Statement_expected;
|
|
case 4 /* TypeMembers */: return ts.Diagnostics.Property_or_signature_expected;
|
|
case 5 /* ClassMembers */: return ts.Diagnostics.Unexpected_token_A_constructor_method_accessor_or_property_was_expected;
|
|
case 6 /* EnumMembers */: return ts.Diagnostics.Enum_member_expected;
|
|
case 7 /* HeritageClauseElement */: return ts.Diagnostics.Expression_expected;
|
|
case 8 /* VariableDeclarations */: return ts.Diagnostics.Variable_declaration_expected;
|
|
case 9 /* ObjectBindingElements */: return ts.Diagnostics.Property_destructuring_pattern_expected;
|
|
case 10 /* ArrayBindingElements */: return ts.Diagnostics.Array_element_destructuring_pattern_expected;
|
|
case 11 /* ArgumentExpressions */: return ts.Diagnostics.Argument_expression_expected;
|
|
case 12 /* ObjectLiteralMembers */: return ts.Diagnostics.Property_assignment_expected;
|
|
case 15 /* ArrayLiteralMembers */: return ts.Diagnostics.Expression_or_comma_expected;
|
|
case 16 /* Parameters */: return ts.Diagnostics.Parameter_declaration_expected;
|
|
case 17 /* TypeParameters */: return ts.Diagnostics.Type_parameter_declaration_expected;
|
|
case 18 /* TypeArguments */: return ts.Diagnostics.Type_argument_expected;
|
|
case 19 /* TupleElementTypes */: return ts.Diagnostics.Type_expected;
|
|
case 20 /* HeritageClauses */: return ts.Diagnostics.Unexpected_token_expected;
|
|
case 21 /* ImportOrExportSpecifiers */: return ts.Diagnostics.Identifier_expected;
|
|
case 13 /* JsxAttributes */: return ts.Diagnostics.Identifier_expected;
|
|
case 14 /* JsxChildren */: return ts.Diagnostics.Identifier_expected;
|
|
case 22 /* JSDocFunctionParameters */: return ts.Diagnostics.Parameter_declaration_expected;
|
|
case 23 /* JSDocTypeArguments */: return ts.Diagnostics.Type_argument_expected;
|
|
case 25 /* JSDocTupleTypes */: return ts.Diagnostics.Type_expected;
|
|
case 24 /* JSDocRecordMembers */: return ts.Diagnostics.Property_assignment_expected;
|
|
}
|
|
}
|
|
;
|
|
// Parses a comma-delimited list of elements
|
|
function parseDelimitedList(kind, parseElement, considerSemicolonAsDelimeter) {
|
|
var saveParsingContext = parsingContext;
|
|
parsingContext |= 1 << kind;
|
|
var result = [];
|
|
result.pos = getNodePos();
|
|
var commaStart = -1; // Meaning the previous token was not a comma
|
|
while (true) {
|
|
if (isListElement(kind, false)) {
|
|
result.push(parseListElement(kind, parseElement));
|
|
commaStart = scanner.getTokenPos();
|
|
if (parseOptional(23 /* CommaToken */)) {
|
|
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(23 /* CommaToken */);
|
|
// 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 (considerSemicolonAsDelimeter && token === 22 /* SemicolonToken */ && !scanner.hasPrecedingLineBreak()) {
|
|
nextToken();
|
|
}
|
|
continue;
|
|
}
|
|
if (isListTerminator(kind)) {
|
|
break;
|
|
}
|
|
if (abortParsingListOrMoveToNextToken(kind)) {
|
|
break;
|
|
}
|
|
}
|
|
// 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.
|
|
if (commaStart >= 0) {
|
|
// Always preserve a trailing comma by marking it on the NodeArray
|
|
result.hasTrailingComma = true;
|
|
}
|
|
result.end = getNodeEnd();
|
|
parsingContext = saveParsingContext;
|
|
return result;
|
|
}
|
|
function createMissingList() {
|
|
var pos = getNodePos();
|
|
var result = [];
|
|
result.pos = pos;
|
|
result.end = pos;
|
|
return result;
|
|
}
|
|
function parseBracketedList(kind, parseElement, open, close) {
|
|
if (parseExpected(open)) {
|
|
var result = parseDelimitedList(kind, parseElement);
|
|
parseExpected(close);
|
|
return result;
|
|
}
|
|
return createMissingList();
|
|
}
|
|
// The allowReservedWords parameter controls whether reserved words are permitted after the first dot
|
|
function parseEntityName(allowReservedWords, diagnosticMessage) {
|
|
var entity = parseIdentifier(diagnosticMessage);
|
|
while (parseOptional(20 /* DotToken */)) {
|
|
var node = createNode(132 /* QualifiedName */, entity.pos);
|
|
node.left = entity;
|
|
node.right = parseRightSideOfDot(allowReservedWords);
|
|
entity = finishNode(node);
|
|
}
|
|
return entity;
|
|
}
|
|
function parseRightSideOfDot(allowIdentifierNames) {
|
|
// 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() && isIdentifierOrKeyword()) {
|
|
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(66 /* Identifier */, true, ts.Diagnostics.Identifier_expected);
|
|
}
|
|
}
|
|
return allowIdentifierNames ? parseIdentifierName() : parseIdentifier();
|
|
}
|
|
function parseTemplateExpression() {
|
|
var template = createNode(180 /* TemplateExpression */);
|
|
template.head = parseLiteralNode();
|
|
ts.Debug.assert(template.head.kind === 11 /* TemplateHead */, "Template head has wrong token kind");
|
|
var templateSpans = [];
|
|
templateSpans.pos = getNodePos();
|
|
do {
|
|
templateSpans.push(parseTemplateSpan());
|
|
} while (ts.lastOrUndefined(templateSpans).literal.kind === 12 /* TemplateMiddle */);
|
|
templateSpans.end = getNodeEnd();
|
|
template.templateSpans = templateSpans;
|
|
return finishNode(template);
|
|
}
|
|
function parseTemplateSpan() {
|
|
var span = createNode(187 /* TemplateSpan */);
|
|
span.expression = allowInAnd(parseExpression);
|
|
var literal;
|
|
if (token === 15 /* CloseBraceToken */) {
|
|
reScanTemplateToken();
|
|
literal = parseLiteralNode();
|
|
}
|
|
else {
|
|
literal = parseExpectedToken(13 /* TemplateTail */, false, ts.Diagnostics._0_expected, ts.tokenToString(15 /* CloseBraceToken */));
|
|
}
|
|
span.literal = literal;
|
|
return finishNode(span);
|
|
}
|
|
function parseLiteralNode(internName) {
|
|
var node = createNode(token);
|
|
var text = scanner.getTokenValue();
|
|
node.text = internName ? internIdentifier(text) : text;
|
|
if (scanner.hasExtendedUnicodeEscape()) {
|
|
node.hasExtendedUnicodeEscape = true;
|
|
}
|
|
if (scanner.isUnterminated()) {
|
|
node.isUnterminated = true;
|
|
}
|
|
var tokenPos = scanner.getTokenPos();
|
|
nextToken();
|
|
finishNode(node);
|
|
// 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.
|
|
if (node.kind === 7 /* NumericLiteral */
|
|
&& sourceText.charCodeAt(tokenPos) === 48 /* _0 */
|
|
&& ts.isOctalDigit(sourceText.charCodeAt(tokenPos + 1))) {
|
|
node.flags |= 65536 /* OctalLiteral */;
|
|
}
|
|
return node;
|
|
}
|
|
// TYPES
|
|
function parseTypeReferenceOrTypePredicate() {
|
|
var typeName = parseEntityName(false, ts.Diagnostics.Type_expected);
|
|
if (typeName.kind === 66 /* Identifier */ && token === 121 /* IsKeyword */ && !scanner.hasPrecedingLineBreak()) {
|
|
nextToken();
|
|
var node_1 = createNode(147 /* TypePredicate */, typeName.pos);
|
|
node_1.parameterName = typeName;
|
|
node_1.type = parseType();
|
|
return finishNode(node_1);
|
|
}
|
|
var node = createNode(148 /* TypeReference */, typeName.pos);
|
|
node.typeName = typeName;
|
|
if (!scanner.hasPrecedingLineBreak() && token === 24 /* LessThanToken */) {
|
|
node.typeArguments = parseBracketedList(18 /* TypeArguments */, parseType, 24 /* LessThanToken */, 26 /* GreaterThanToken */);
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
function parseTypeQuery() {
|
|
var node = createNode(151 /* TypeQuery */);
|
|
parseExpected(98 /* TypeOfKeyword */);
|
|
node.exprName = parseEntityName(true);
|
|
return finishNode(node);
|
|
}
|
|
function parseTypeParameter() {
|
|
var node = createNode(134 /* TypeParameter */);
|
|
node.name = parseIdentifier();
|
|
if (parseOptional(80 /* 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()) {
|
|
node.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 "".
|
|
node.expression = parseUnaryExpressionOrHigher();
|
|
}
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
function parseTypeParameters() {
|
|
if (token === 24 /* LessThanToken */) {
|
|
return parseBracketedList(17 /* TypeParameters */, parseTypeParameter, 24 /* LessThanToken */, 26 /* GreaterThanToken */);
|
|
}
|
|
}
|
|
function parseParameterType() {
|
|
if (parseOptional(52 /* ColonToken */)) {
|
|
return token === 8 /* StringLiteral */
|
|
? parseLiteralNode(true)
|
|
: parseType();
|
|
}
|
|
return undefined;
|
|
}
|
|
function isStartOfParameter() {
|
|
return token === 21 /* DotDotDotToken */ || isIdentifierOrPattern() || ts.isModifier(token) || token === 53 /* AtToken */;
|
|
}
|
|
function setModifiers(node, modifiers) {
|
|
if (modifiers) {
|
|
node.flags |= modifiers.flags;
|
|
node.modifiers = modifiers;
|
|
}
|
|
}
|
|
function parseParameter() {
|
|
var node = createNode(135 /* Parameter */);
|
|
node.decorators = parseDecorators();
|
|
setModifiers(node, parseModifiers());
|
|
node.dotDotDotToken = parseOptionalToken(21 /* DotDotDotToken */);
|
|
// FormalParameter [Yield,Await]:
|
|
// BindingElement[?Yield,?Await]
|
|
node.name = parseIdentifierOrPattern();
|
|
if (ts.getFullWidth(node.name) === 0 && node.flags === 0 && ts.isModifier(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();
|
|
}
|
|
node.questionToken = parseOptionalToken(51 /* QuestionToken */);
|
|
node.type = parseParameterType();
|
|
node.initializer = parseBindingElementInitializer(true);
|
|
// Do not check for initializers in an ambient context for parameters. This is not
|
|
// a grammar error because the grammar allows arbitrary call signatures in
|
|
// an ambient context.
|
|
// It is actually not necessary for this to be an error at all. The reason is that
|
|
// function/constructor implementations are syntactically disallowed in ambient
|
|
// contexts. In addition, parameter initializers are semantically disallowed in
|
|
// overload signatures. So parameter initializers are transitively disallowed in
|
|
// ambient contexts.
|
|
return finishNode(node);
|
|
}
|
|
function parseBindingElementInitializer(inParameter) {
|
|
return inParameter ? parseParameterInitializer() : parseNonParameterInitializer();
|
|
}
|
|
function parseParameterInitializer() {
|
|
return parseInitializer(true);
|
|
}
|
|
function fillSignature(returnToken, yieldContext, awaitContext, requireCompleteParameterList, signature) {
|
|
var returnTokenRequired = returnToken === 33 /* EqualsGreaterThanToken */;
|
|
signature.typeParameters = parseTypeParameters();
|
|
signature.parameters = parseParameterList(yieldContext, awaitContext, requireCompleteParameterList);
|
|
if (returnTokenRequired) {
|
|
parseExpected(returnToken);
|
|
signature.type = parseType();
|
|
}
|
|
else if (parseOptional(returnToken)) {
|
|
signature.type = parseType();
|
|
}
|
|
}
|
|
function parseParameterList(yieldContext, awaitContext, requireCompleteParameterList) {
|
|
// 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(16 /* OpenParenToken */)) {
|
|
var savedYieldContext = inYieldContext();
|
|
var savedAwaitContext = inAwaitContext();
|
|
setYieldContext(yieldContext);
|
|
setAwaitContext(awaitContext);
|
|
var result = parseDelimitedList(16 /* Parameters */, parseParameter);
|
|
setYieldContext(savedYieldContext);
|
|
setAwaitContext(savedAwaitContext);
|
|
if (!parseExpected(17 /* CloseParenToken */) && requireCompleteParameterList) {
|
|
// Caller insisted that we had to end with a ) We didn't. So just return
|
|
// undefined here.
|
|
return undefined;
|
|
}
|
|
return result;
|
|
}
|
|
// We didn't even have an open paren. If the caller requires a complete parameter list,
|
|
// we definitely can't provide that. However, if they're ok with an incomplete one,
|
|
// then just return an empty set of parameters.
|
|
return requireCompleteParameterList ? undefined : createMissingList();
|
|
}
|
|
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(23 /* CommaToken */)) {
|
|
return;
|
|
}
|
|
// Didn't have a comma. We must have a (possible ASI) semicolon.
|
|
parseSemicolon();
|
|
}
|
|
function parseSignatureMember(kind) {
|
|
var node = createNode(kind);
|
|
if (kind === 145 /* ConstructSignature */) {
|
|
parseExpected(89 /* NewKeyword */);
|
|
}
|
|
fillSignature(52 /* ColonToken */, false, false, false, node);
|
|
parseTypeMemberSemicolon();
|
|
return finishNode(node);
|
|
}
|
|
function isIndexSignature() {
|
|
if (token !== 18 /* OpenBracketToken */) {
|
|
return false;
|
|
}
|
|
return 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 === 21 /* DotDotDotToken */ || token === 19 /* CloseBracketToken */) {
|
|
return true;
|
|
}
|
|
if (ts.isModifier(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 === 52 /* ColonToken */ || token === 23 /* 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 !== 51 /* 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 === 52 /* ColonToken */ || token === 23 /* CommaToken */ || token === 19 /* CloseBracketToken */;
|
|
}
|
|
function parseIndexSignatureDeclaration(fullStart, decorators, modifiers) {
|
|
var node = createNode(146 /* IndexSignature */, fullStart);
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
node.parameters = parseBracketedList(16 /* Parameters */, parseParameter, 18 /* OpenBracketToken */, 19 /* CloseBracketToken */);
|
|
node.type = parseTypeAnnotation();
|
|
parseTypeMemberSemicolon();
|
|
return finishNode(node);
|
|
}
|
|
function parsePropertyOrMethodSignature() {
|
|
var fullStart = scanner.getStartPos();
|
|
var name = parsePropertyName();
|
|
var questionToken = parseOptionalToken(51 /* QuestionToken */);
|
|
if (token === 16 /* OpenParenToken */ || token === 24 /* LessThanToken */) {
|
|
var method = createNode(139 /* MethodSignature */, fullStart);
|
|
method.name = name;
|
|
method.questionToken = questionToken;
|
|
// Method signatues don't exist in expression contexts. So they have neither
|
|
// [Yield] nor [Await]
|
|
fillSignature(52 /* ColonToken */, false, false, false, method);
|
|
parseTypeMemberSemicolon();
|
|
return finishNode(method);
|
|
}
|
|
else {
|
|
var property = createNode(137 /* PropertySignature */, fullStart);
|
|
property.name = name;
|
|
property.questionToken = questionToken;
|
|
property.type = parseTypeAnnotation();
|
|
parseTypeMemberSemicolon();
|
|
return finishNode(property);
|
|
}
|
|
}
|
|
function isStartOfTypeMember() {
|
|
switch (token) {
|
|
case 16 /* OpenParenToken */:
|
|
case 24 /* LessThanToken */:
|
|
case 18 /* OpenBracketToken */:
|
|
return true;
|
|
default:
|
|
if (ts.isModifier(token)) {
|
|
var result = lookAhead(isStartOfIndexSignatureDeclaration);
|
|
if (result) {
|
|
return result;
|
|
}
|
|
}
|
|
return isLiteralPropertyName() && lookAhead(isTypeMemberWithLiteralPropertyName);
|
|
}
|
|
}
|
|
function isStartOfIndexSignatureDeclaration() {
|
|
while (ts.isModifier(token)) {
|
|
nextToken();
|
|
}
|
|
return isIndexSignature();
|
|
}
|
|
function isTypeMemberWithLiteralPropertyName() {
|
|
nextToken();
|
|
return token === 16 /* OpenParenToken */ ||
|
|
token === 24 /* LessThanToken */ ||
|
|
token === 51 /* QuestionToken */ ||
|
|
token === 52 /* ColonToken */ ||
|
|
canParseSemicolon();
|
|
}
|
|
function parseTypeMember() {
|
|
switch (token) {
|
|
case 16 /* OpenParenToken */:
|
|
case 24 /* LessThanToken */:
|
|
return parseSignatureMember(144 /* CallSignature */);
|
|
case 18 /* OpenBracketToken */:
|
|
// Indexer or computed property
|
|
return isIndexSignature()
|
|
? parseIndexSignatureDeclaration(scanner.getStartPos(), undefined, undefined)
|
|
: parsePropertyOrMethodSignature();
|
|
case 89 /* NewKeyword */:
|
|
if (lookAhead(isStartOfConstructSignature)) {
|
|
return parseSignatureMember(145 /* ConstructSignature */);
|
|
}
|
|
// fall through.
|
|
case 8 /* StringLiteral */:
|
|
case 7 /* NumericLiteral */:
|
|
return parsePropertyOrMethodSignature();
|
|
default:
|
|
// Index declaration as allowed as a type member. But as per the grammar,
|
|
// they also allow modifiers. So we have to check for an index declaration
|
|
// that might be following modifiers. This ensures that things work properly
|
|
// when incrementally parsing as the parser will produce the Index declaration
|
|
// if it has the same text regardless of whether it is inside a class or an
|
|
// object type.
|
|
if (ts.isModifier(token)) {
|
|
var result = tryParse(parseIndexSignatureWithModifiers);
|
|
if (result) {
|
|
return result;
|
|
}
|
|
}
|
|
if (isIdentifierOrKeyword()) {
|
|
return parsePropertyOrMethodSignature();
|
|
}
|
|
}
|
|
}
|
|
function parseIndexSignatureWithModifiers() {
|
|
var fullStart = scanner.getStartPos();
|
|
var decorators = parseDecorators();
|
|
var modifiers = parseModifiers();
|
|
return isIndexSignature()
|
|
? parseIndexSignatureDeclaration(fullStart, decorators, modifiers)
|
|
: undefined;
|
|
}
|
|
function isStartOfConstructSignature() {
|
|
nextToken();
|
|
return token === 16 /* OpenParenToken */ || token === 24 /* LessThanToken */;
|
|
}
|
|
function parseTypeLiteral() {
|
|
var node = createNode(152 /* TypeLiteral */);
|
|
node.members = parseObjectTypeMembers();
|
|
return finishNode(node);
|
|
}
|
|
function parseObjectTypeMembers() {
|
|
var members;
|
|
if (parseExpected(14 /* OpenBraceToken */)) {
|
|
members = parseList(4 /* TypeMembers */, parseTypeMember);
|
|
parseExpected(15 /* CloseBraceToken */);
|
|
}
|
|
else {
|
|
members = createMissingList();
|
|
}
|
|
return members;
|
|
}
|
|
function parseTupleType() {
|
|
var node = createNode(154 /* TupleType */);
|
|
node.elementTypes = parseBracketedList(19 /* TupleElementTypes */, parseType, 18 /* OpenBracketToken */, 19 /* CloseBracketToken */);
|
|
return finishNode(node);
|
|
}
|
|
function parseParenthesizedType() {
|
|
var node = createNode(157 /* ParenthesizedType */);
|
|
parseExpected(16 /* OpenParenToken */);
|
|
node.type = parseType();
|
|
parseExpected(17 /* CloseParenToken */);
|
|
return finishNode(node);
|
|
}
|
|
function parseFunctionOrConstructorType(kind) {
|
|
var node = createNode(kind);
|
|
if (kind === 150 /* ConstructorType */) {
|
|
parseExpected(89 /* NewKeyword */);
|
|
}
|
|
fillSignature(33 /* EqualsGreaterThanToken */, false, false, false, node);
|
|
return finishNode(node);
|
|
}
|
|
function parseKeywordAndNoDot() {
|
|
var node = parseTokenNode();
|
|
return token === 20 /* DotToken */ ? undefined : node;
|
|
}
|
|
function parseNonArrayType() {
|
|
switch (token) {
|
|
case 114 /* AnyKeyword */:
|
|
case 127 /* StringKeyword */:
|
|
case 125 /* NumberKeyword */:
|
|
case 117 /* BooleanKeyword */:
|
|
case 128 /* SymbolKeyword */:
|
|
// If these are followed by a dot, then parse these out as a dotted type reference instead.
|
|
var node = tryParse(parseKeywordAndNoDot);
|
|
return node || parseTypeReferenceOrTypePredicate();
|
|
case 100 /* VoidKeyword */:
|
|
return parseTokenNode();
|
|
case 98 /* TypeOfKeyword */:
|
|
return parseTypeQuery();
|
|
case 14 /* OpenBraceToken */:
|
|
return parseTypeLiteral();
|
|
case 18 /* OpenBracketToken */:
|
|
return parseTupleType();
|
|
case 16 /* OpenParenToken */:
|
|
return parseParenthesizedType();
|
|
default:
|
|
return parseTypeReferenceOrTypePredicate();
|
|
}
|
|
}
|
|
function isStartOfType() {
|
|
switch (token) {
|
|
case 114 /* AnyKeyword */:
|
|
case 127 /* StringKeyword */:
|
|
case 125 /* NumberKeyword */:
|
|
case 117 /* BooleanKeyword */:
|
|
case 128 /* SymbolKeyword */:
|
|
case 100 /* VoidKeyword */:
|
|
case 98 /* TypeOfKeyword */:
|
|
case 14 /* OpenBraceToken */:
|
|
case 18 /* OpenBracketToken */:
|
|
case 24 /* LessThanToken */:
|
|
case 89 /* NewKeyword */:
|
|
return true;
|
|
case 16 /* 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 lookAhead(isStartOfParenthesizedOrFunctionType);
|
|
default:
|
|
return isIdentifier();
|
|
}
|
|
}
|
|
function isStartOfParenthesizedOrFunctionType() {
|
|
nextToken();
|
|
return token === 17 /* CloseParenToken */ || isStartOfParameter() || isStartOfType();
|
|
}
|
|
function parseArrayTypeOrHigher() {
|
|
var type = parseNonArrayType();
|
|
while (!scanner.hasPrecedingLineBreak() && parseOptional(18 /* OpenBracketToken */)) {
|
|
parseExpected(19 /* CloseBracketToken */);
|
|
var node = createNode(153 /* ArrayType */, type.pos);
|
|
node.elementType = type;
|
|
type = finishNode(node);
|
|
}
|
|
return type;
|
|
}
|
|
function parseUnionOrIntersectionType(kind, parseConstituentType, operator) {
|
|
var type = parseConstituentType();
|
|
if (token === operator) {
|
|
var types = [type];
|
|
types.pos = type.pos;
|
|
while (parseOptional(operator)) {
|
|
types.push(parseConstituentType());
|
|
}
|
|
types.end = getNodeEnd();
|
|
var node = createNode(kind, type.pos);
|
|
node.types = types;
|
|
type = finishNode(node);
|
|
}
|
|
return type;
|
|
}
|
|
function parseIntersectionTypeOrHigher() {
|
|
return parseUnionOrIntersectionType(156 /* IntersectionType */, parseArrayTypeOrHigher, 44 /* AmpersandToken */);
|
|
}
|
|
function parseUnionTypeOrHigher() {
|
|
return parseUnionOrIntersectionType(155 /* UnionType */, parseIntersectionTypeOrHigher, 45 /* BarToken */);
|
|
}
|
|
function isStartOfFunctionType() {
|
|
if (token === 24 /* LessThanToken */) {
|
|
return true;
|
|
}
|
|
return token === 16 /* OpenParenToken */ && lookAhead(isUnambiguouslyStartOfFunctionType);
|
|
}
|
|
function isUnambiguouslyStartOfFunctionType() {
|
|
nextToken();
|
|
if (token === 17 /* CloseParenToken */ || token === 21 /* DotDotDotToken */) {
|
|
// ( )
|
|
// ( ...
|
|
return true;
|
|
}
|
|
if (isIdentifier() || ts.isModifier(token)) {
|
|
nextToken();
|
|
if (token === 52 /* ColonToken */ || token === 23 /* CommaToken */ ||
|
|
token === 51 /* QuestionToken */ || token === 54 /* EqualsToken */ ||
|
|
isIdentifier() || ts.isModifier(token)) {
|
|
// ( id :
|
|
// ( id ,
|
|
// ( id ?
|
|
// ( id =
|
|
// ( modifier id
|
|
return true;
|
|
}
|
|
if (token === 17 /* CloseParenToken */) {
|
|
nextToken();
|
|
if (token === 33 /* EqualsGreaterThanToken */) {
|
|
// ( id ) =>
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
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(10 /* TypeExcludesFlags */, parseTypeWorker);
|
|
}
|
|
function parseTypeWorker() {
|
|
if (isStartOfFunctionType()) {
|
|
return parseFunctionOrConstructorType(149 /* FunctionType */);
|
|
}
|
|
if (token === 89 /* NewKeyword */) {
|
|
return parseFunctionOrConstructorType(150 /* ConstructorType */);
|
|
}
|
|
return parseUnionTypeOrHigher();
|
|
}
|
|
function parseTypeAnnotation() {
|
|
return parseOptional(52 /* ColonToken */) ? parseType() : undefined;
|
|
}
|
|
// EXPRESSIONS
|
|
function isStartOfLeftHandSideExpression() {
|
|
switch (token) {
|
|
case 94 /* ThisKeyword */:
|
|
case 92 /* SuperKeyword */:
|
|
case 90 /* NullKeyword */:
|
|
case 96 /* TrueKeyword */:
|
|
case 81 /* FalseKeyword */:
|
|
case 7 /* NumericLiteral */:
|
|
case 8 /* StringLiteral */:
|
|
case 10 /* NoSubstitutionTemplateLiteral */:
|
|
case 11 /* TemplateHead */:
|
|
case 16 /* OpenParenToken */:
|
|
case 18 /* OpenBracketToken */:
|
|
case 14 /* OpenBraceToken */:
|
|
case 84 /* FunctionKeyword */:
|
|
case 70 /* ClassKeyword */:
|
|
case 89 /* NewKeyword */:
|
|
case 37 /* SlashToken */:
|
|
case 58 /* SlashEqualsToken */:
|
|
case 66 /* Identifier */:
|
|
return true;
|
|
default:
|
|
return isIdentifier();
|
|
}
|
|
}
|
|
function isStartOfExpression() {
|
|
if (isStartOfLeftHandSideExpression()) {
|
|
return true;
|
|
}
|
|
switch (token) {
|
|
case 34 /* PlusToken */:
|
|
case 35 /* MinusToken */:
|
|
case 48 /* TildeToken */:
|
|
case 47 /* ExclamationToken */:
|
|
case 75 /* DeleteKeyword */:
|
|
case 98 /* TypeOfKeyword */:
|
|
case 100 /* VoidKeyword */:
|
|
case 39 /* PlusPlusToken */:
|
|
case 40 /* MinusMinusToken */:
|
|
case 24 /* LessThanToken */:
|
|
case 116 /* AwaitKeyword */:
|
|
case 111 /* YieldKeyword */:
|
|
// 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 !== 14 /* OpenBraceToken */ &&
|
|
token !== 84 /* FunctionKeyword */ &&
|
|
token !== 70 /* ClassKeyword */ &&
|
|
token !== 53 /* AtToken */ &&
|
|
isStartOfExpression();
|
|
}
|
|
function allowInAndParseExpression() {
|
|
return allowInAnd(parseExpression);
|
|
}
|
|
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(false);
|
|
}
|
|
var expr = parseAssignmentExpressionOrHigher();
|
|
var operatorToken;
|
|
while ((operatorToken = parseOptionalToken(23 /* CommaToken */))) {
|
|
expr = makeBinaryExpression(expr, operatorToken, parseAssignmentExpressionOrHigher());
|
|
}
|
|
if (saveDecoratorContext) {
|
|
setDecoratorContext(true);
|
|
}
|
|
return expr;
|
|
}
|
|
function parseInitializer(inParameter) {
|
|
if (token !== 54 /* EqualsToken */) {
|
|
// It's not uncommon during typing for the user to miss writing the '=' token. Check if
|
|
// there is no newline after the last token and if we're on an expression. If so, parse
|
|
// this as an equals-value clause with a missing equals.
|
|
// NOTE: There are two places where we allow equals-value clauses. The first is in a
|
|
// variable declarator. The second is with a parameter. For variable declarators
|
|
// it's more likely that a { would be a allowed (as an object literal). While this
|
|
// is also allowed for parameters, the risk is that we consume the { as an object
|
|
// literal when it really will be for the block following the parameter.
|
|
if (scanner.hasPrecedingLineBreak() || (inParameter && token === 14 /* OpenBraceToken */) || !isStartOfExpression()) {
|
|
// preceding line break, open brace in a parameter (likely a function body) or current token is not an expression -
|
|
// do not try to parse initializer
|
|
return undefined;
|
|
}
|
|
}
|
|
// Initializer[In, Yield] :
|
|
// = AssignmentExpression[?In, ?Yield]
|
|
parseExpected(54 /* EqualsToken */);
|
|
return parseAssignmentExpressionOrHigher();
|
|
}
|
|
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) [+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 '5').
|
|
if (isYieldExpression()) {
|
|
return parseYieldExpression();
|
|
}
|
|
// Then, check if we have an arrow function (production '4') that starts with a parenthesized
|
|
// parameter list. If we do, 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();
|
|
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 expr = parseBinaryExpressionOrHigher(0);
|
|
// 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 === 66 /* Identifier */ && token === 33 /* EqualsGreaterThanToken */) {
|
|
return parseSimpleArrowFunctionExpression(expr);
|
|
}
|
|
// 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());
|
|
}
|
|
// It wasn't an assignment or a lambda. This is a conditional expression:
|
|
return parseConditionalExpressionRest(expr);
|
|
}
|
|
function isYieldExpression() {
|
|
if (token === 111 /* YieldKeyword */) {
|
|
// If we have a 'yield' keyword, and htis 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 accidently consume something legal.
|
|
return lookAhead(nextTokenIsIdentifierOrKeywordOrNumberOnSameLine);
|
|
}
|
|
return false;
|
|
}
|
|
function nextTokenIsIdentifierOnSameLine() {
|
|
nextToken();
|
|
return !scanner.hasPrecedingLineBreak() && isIdentifier();
|
|
}
|
|
function parseYieldExpression() {
|
|
var node = createNode(181 /* YieldExpression */);
|
|
// 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 === 36 /* AsteriskToken */ || isStartOfExpression())) {
|
|
node.asteriskToken = parseOptionalToken(36 /* AsteriskToken */);
|
|
node.expression = parseAssignmentExpressionOrHigher();
|
|
return finishNode(node);
|
|
}
|
|
else {
|
|
// if the next token is not on the same line as yield. or we don't have an '*' or
|
|
// the start of an expressin, then this is just a simple "yield" expression.
|
|
return finishNode(node);
|
|
}
|
|
}
|
|
function parseSimpleArrowFunctionExpression(identifier) {
|
|
ts.Debug.assert(token === 33 /* EqualsGreaterThanToken */, "parseSimpleArrowFunctionExpression should only have been called if we had a =>");
|
|
var node = createNode(171 /* ArrowFunction */, identifier.pos);
|
|
var parameter = createNode(135 /* Parameter */, identifier.pos);
|
|
parameter.name = identifier;
|
|
finishNode(parameter);
|
|
node.parameters = [parameter];
|
|
node.parameters.pos = parameter.pos;
|
|
node.parameters.end = parameter.end;
|
|
node.equalsGreaterThanToken = parseExpectedToken(33 /* EqualsGreaterThanToken */, false, ts.Diagnostics._0_expected, "=>");
|
|
node.body = parseArrowFunctionExpressionBody(false);
|
|
return finishNode(node);
|
|
}
|
|
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.
|
|
var arrowFunction = triState === 1 /* True */
|
|
? parseParenthesizedArrowFunctionExpressionHead(true)
|
|
: tryParse(parsePossibleParenthesizedArrowFunctionExpressionHead);
|
|
if (!arrowFunction) {
|
|
// Didn't appear to actually be a parenthesized arrow function. Just bail out.
|
|
return undefined;
|
|
}
|
|
var isAsync = !!(arrowFunction.flags & 512 /* Async */);
|
|
// 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;
|
|
arrowFunction.equalsGreaterThanToken = parseExpectedToken(33 /* EqualsGreaterThanToken */, false, ts.Diagnostics._0_expected, "=>");
|
|
arrowFunction.body = (lastToken === 33 /* EqualsGreaterThanToken */ || lastToken === 14 /* OpenBraceToken */)
|
|
? parseArrowFunctionExpressionBody(isAsync)
|
|
: parseIdentifier();
|
|
return finishNode(arrowFunction);
|
|
}
|
|
// 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 === 16 /* OpenParenToken */ || token === 24 /* LessThanToken */ || token === 115 /* AsyncKeyword */) {
|
|
return lookAhead(isParenthesizedArrowFunctionExpressionWorker);
|
|
}
|
|
if (token === 33 /* 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 === 115 /* AsyncKeyword */) {
|
|
nextToken();
|
|
if (scanner.hasPrecedingLineBreak()) {
|
|
return 0 /* False */;
|
|
}
|
|
if (token !== 16 /* OpenParenToken */ && token !== 24 /* LessThanToken */) {
|
|
return 0 /* False */;
|
|
}
|
|
}
|
|
var first = token;
|
|
var second = nextToken();
|
|
if (first === 16 /* OpenParenToken */) {
|
|
if (second === 17 /* 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 33 /* EqualsGreaterThanToken */:
|
|
case 52 /* ColonToken */:
|
|
case 14 /* 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 === 18 /* OpenBracketToken */ || second === 14 /* OpenBraceToken */) {
|
|
return 2 /* Unknown */;
|
|
}
|
|
// Simple case: "(..."
|
|
// This is an arrow function with a rest parameter.
|
|
if (second === 21 /* DotDotDotToken */) {
|
|
return 1 /* True */;
|
|
}
|
|
// If we had "(" followed by something that's not an identifier,
|
|
// then this definitely doesn't look like a lambda.
|
|
// Note: we could be a little more lenient and allow
|
|
// "(public" or "(private". These would not ever actually be allowed,
|
|
// but we could provide a good error message instead of bailing out.
|
|
if (!isIdentifier()) {
|
|
return 0 /* False */;
|
|
}
|
|
// If we have something like "(a:", then we must have a
|
|
// type-annotated parameter in an arrow function expression.
|
|
if (nextToken() === 52 /* ColonToken */) {
|
|
return 1 /* True */;
|
|
}
|
|
// This *could* be a parenthesized arrow function.
|
|
// Return Unknown to let the caller know.
|
|
return 2 /* Unknown */;
|
|
}
|
|
else {
|
|
ts.Debug.assert(first === 24 /* 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 (sourceFile.languageVariant === 1 /* JSX */) {
|
|
var isArrowFunctionInJsx = lookAhead(function () {
|
|
var third = nextToken();
|
|
if (third === 80 /* ExtendsKeyword */) {
|
|
var fourth = nextToken();
|
|
switch (fourth) {
|
|
case 54 /* EqualsToken */:
|
|
case 26 /* GreaterThanToken */:
|
|
return false;
|
|
default:
|
|
return true;
|
|
}
|
|
}
|
|
else if (third === 23 /* CommaToken */) {
|
|
return true;
|
|
}
|
|
return false;
|
|
});
|
|
if (isArrowFunctionInJsx) {
|
|
return 1 /* True */;
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
// This *could* be a parenthesized arrow function.
|
|
return 2 /* Unknown */;
|
|
}
|
|
}
|
|
function parsePossibleParenthesizedArrowFunctionExpressionHead() {
|
|
return parseParenthesizedArrowFunctionExpressionHead(false);
|
|
}
|
|
function parseParenthesizedArrowFunctionExpressionHead(allowAmbiguity) {
|
|
var node = createNode(171 /* ArrowFunction */);
|
|
setModifiers(node, parseModifiersForArrowFunction());
|
|
var isAsync = !!(node.flags & 512 /* Async */);
|
|
// 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.
|
|
fillSignature(52 /* ColonToken */, false, isAsync, !allowAmbiguity, node);
|
|
// If we couldn't get parameters, we definitely could not parse out an arrow function.
|
|
if (!node.parameters) {
|
|
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.
|
|
//
|
|
// So we need just a bit of lookahead to ensure that it can only be a signature.
|
|
if (!allowAmbiguity && token !== 33 /* EqualsGreaterThanToken */ && token !== 14 /* OpenBraceToken */) {
|
|
// Returning undefined here will cause our caller to rewind to where we started from.
|
|
return undefined;
|
|
}
|
|
return node;
|
|
}
|
|
function parseArrowFunctionExpressionBody(isAsync) {
|
|
if (token === 14 /* OpenBraceToken */) {
|
|
return parseFunctionBlock(false, isAsync, false);
|
|
}
|
|
if (token !== 22 /* SemicolonToken */ &&
|
|
token !== 84 /* FunctionKeyword */ &&
|
|
token !== 70 /* 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 as true, parseBody will still error.
|
|
return parseFunctionBlock(false, isAsync, true);
|
|
}
|
|
return isAsync
|
|
? doInAwaitContext(parseAssignmentExpressionOrHigher)
|
|
: doOutsideOfAwaitContext(parseAssignmentExpressionOrHigher);
|
|
}
|
|
function parseConditionalExpressionRest(leftOperand) {
|
|
// Note: we are passed in an expression which was produced from parseBinaryExpressionOrHigher.
|
|
var questionToken = parseOptionalToken(51 /* 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 node = createNode(179 /* ConditionalExpression */, leftOperand.pos);
|
|
node.condition = leftOperand;
|
|
node.questionToken = questionToken;
|
|
node.whenTrue = doOutsideOfContext(disallowInAndDecoratorContext, parseAssignmentExpressionOrHigher);
|
|
node.colonToken = parseExpectedToken(52 /* ColonToken */, false, ts.Diagnostics._0_expected, ts.tokenToString(52 /* ColonToken */));
|
|
node.whenFalse = parseAssignmentExpressionOrHigher();
|
|
return finishNode(node);
|
|
}
|
|
function parseBinaryExpressionOrHigher(precedence) {
|
|
var leftOperand = parseUnaryExpressionOrHigher();
|
|
return parseBinaryExpressionRest(precedence, leftOperand);
|
|
}
|
|
function isInOrOfKeyword(t) {
|
|
return t === 87 /* InKeyword */ || t === 131 /* OfKeyword */;
|
|
}
|
|
function parseBinaryExpressionRest(precedence, leftOperand) {
|
|
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 = getBinaryOperatorPrecedence();
|
|
// Check the precedence to see if we should "take" this operator
|
|
if (newPrecedence <= precedence) {
|
|
break;
|
|
}
|
|
if (token === 87 /* InKeyword */ && inDisallowInContext()) {
|
|
break;
|
|
}
|
|
if (token === 113 /* 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));
|
|
}
|
|
}
|
|
return leftOperand;
|
|
}
|
|
function isBinaryOperator() {
|
|
if (inDisallowInContext() && token === 87 /* InKeyword */) {
|
|
return false;
|
|
}
|
|
return getBinaryOperatorPrecedence() > 0;
|
|
}
|
|
function getBinaryOperatorPrecedence() {
|
|
switch (token) {
|
|
case 50 /* BarBarToken */:
|
|
return 1;
|
|
case 49 /* AmpersandAmpersandToken */:
|
|
return 2;
|
|
case 45 /* BarToken */:
|
|
return 3;
|
|
case 46 /* CaretToken */:
|
|
return 4;
|
|
case 44 /* AmpersandToken */:
|
|
return 5;
|
|
case 29 /* EqualsEqualsToken */:
|
|
case 30 /* ExclamationEqualsToken */:
|
|
case 31 /* EqualsEqualsEqualsToken */:
|
|
case 32 /* ExclamationEqualsEqualsToken */:
|
|
return 6;
|
|
case 24 /* LessThanToken */:
|
|
case 26 /* GreaterThanToken */:
|
|
case 27 /* LessThanEqualsToken */:
|
|
case 28 /* GreaterThanEqualsToken */:
|
|
case 88 /* InstanceOfKeyword */:
|
|
case 87 /* InKeyword */:
|
|
case 113 /* AsKeyword */:
|
|
return 7;
|
|
case 41 /* LessThanLessThanToken */:
|
|
case 42 /* GreaterThanGreaterThanToken */:
|
|
case 43 /* GreaterThanGreaterThanGreaterThanToken */:
|
|
return 8;
|
|
case 34 /* PlusToken */:
|
|
case 35 /* MinusToken */:
|
|
return 9;
|
|
case 36 /* AsteriskToken */:
|
|
case 37 /* SlashToken */:
|
|
case 38 /* PercentToken */:
|
|
return 10;
|
|
}
|
|
// -1 is lower than all other precedences. Returning it will cause binary expression
|
|
// parsing to stop.
|
|
return -1;
|
|
}
|
|
function makeBinaryExpression(left, operatorToken, right) {
|
|
var node = createNode(178 /* BinaryExpression */, left.pos);
|
|
node.left = left;
|
|
node.operatorToken = operatorToken;
|
|
node.right = right;
|
|
return finishNode(node);
|
|
}
|
|
function makeAsExpression(left, right) {
|
|
var node = createNode(186 /* AsExpression */, left.pos);
|
|
node.expression = left;
|
|
node.type = right;
|
|
return finishNode(node);
|
|
}
|
|
function parsePrefixUnaryExpression() {
|
|
var node = createNode(176 /* PrefixUnaryExpression */);
|
|
node.operator = token;
|
|
nextToken();
|
|
node.operand = parseUnaryExpressionOrHigher();
|
|
return finishNode(node);
|
|
}
|
|
function parseDeleteExpression() {
|
|
var node = createNode(172 /* DeleteExpression */);
|
|
nextToken();
|
|
node.expression = parseUnaryExpressionOrHigher();
|
|
return finishNode(node);
|
|
}
|
|
function parseTypeOfExpression() {
|
|
var node = createNode(173 /* TypeOfExpression */);
|
|
nextToken();
|
|
node.expression = parseUnaryExpressionOrHigher();
|
|
return finishNode(node);
|
|
}
|
|
function parseVoidExpression() {
|
|
var node = createNode(174 /* VoidExpression */);
|
|
nextToken();
|
|
node.expression = parseUnaryExpressionOrHigher();
|
|
return finishNode(node);
|
|
}
|
|
function isAwaitExpression() {
|
|
if (token === 116 /* AwaitKeyword */) {
|
|
if (inAwaitContext()) {
|
|
return true;
|
|
}
|
|
// here we are using similar heuristics as 'isYieldExpression'
|
|
return lookAhead(nextTokenIsIdentifierOnSameLine);
|
|
}
|
|
return false;
|
|
}
|
|
function parseAwaitExpression() {
|
|
var node = createNode(175 /* AwaitExpression */);
|
|
nextToken();
|
|
node.expression = parseUnaryExpressionOrHigher();
|
|
return finishNode(node);
|
|
}
|
|
function parseUnaryExpressionOrHigher() {
|
|
if (isAwaitExpression()) {
|
|
return parseAwaitExpression();
|
|
}
|
|
switch (token) {
|
|
case 34 /* PlusToken */:
|
|
case 35 /* MinusToken */:
|
|
case 48 /* TildeToken */:
|
|
case 47 /* ExclamationToken */:
|
|
case 39 /* PlusPlusToken */:
|
|
case 40 /* MinusMinusToken */:
|
|
return parsePrefixUnaryExpression();
|
|
case 75 /* DeleteKeyword */:
|
|
return parseDeleteExpression();
|
|
case 98 /* TypeOfKeyword */:
|
|
return parseTypeOfExpression();
|
|
case 100 /* VoidKeyword */:
|
|
return parseVoidExpression();
|
|
case 24 /* LessThanToken */:
|
|
if (sourceFile.languageVariant !== 1 /* JSX */) {
|
|
return parseTypeAssertion();
|
|
}
|
|
if (lookAhead(nextTokenIsIdentifierOrKeyword)) {
|
|
return parseJsxElementOrSelfClosingElement();
|
|
}
|
|
// Fall through
|
|
default:
|
|
return parsePostfixExpressionOrHigher();
|
|
}
|
|
}
|
|
function parsePostfixExpressionOrHigher() {
|
|
var expression = parseLeftHandSideExpressionOrHigher();
|
|
ts.Debug.assert(ts.isLeftHandSideExpression(expression));
|
|
if ((token === 39 /* PlusPlusToken */ || token === 40 /* MinusMinusToken */) && !scanner.hasPrecedingLineBreak()) {
|
|
var node = createNode(177 /* PostfixUnaryExpression */, expression.pos);
|
|
node.operand = expression;
|
|
node.operator = token;
|
|
nextToken();
|
|
return finishNode(node);
|
|
}
|
|
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
|
|
// super ( ArgumentListopt )
|
|
// super.IdentifierName
|
|
//
|
|
// Because of the recursion in these calls, we need to bottom out first. There are two
|
|
// bottom out states we can run into. Either we see 'super' which must start either of
|
|
// the last two CallExpression productions. Or we have a MemberExpression which either
|
|
// completes the LeftHandSideExpression, or starts the beginning of the first four
|
|
// CallExpression productions.
|
|
var expression = token === 92 /* SuperKeyword */
|
|
? parseSuperExpression()
|
|
: parseMemberExpressionOrHigher();
|
|
// Now, we *may* be complete. However, we might have consumed the start of a
|
|
// CallExpression. As such, we need to consume the rest of it here to be complete.
|
|
return parseCallExpressionRest(expression);
|
|
}
|
|
function parseMemberExpressionOrHigher() {
|
|
// Note: to make our lives simpler, we decompose the 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 expression = parsePrimaryExpression();
|
|
return parseMemberExpressionRest(expression);
|
|
}
|
|
function parseSuperExpression() {
|
|
var expression = parseTokenNode();
|
|
if (token === 16 /* OpenParenToken */ || token === 20 /* DotToken */) {
|
|
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.
|
|
var node = createNode(163 /* PropertyAccessExpression */, expression.pos);
|
|
node.expression = expression;
|
|
node.dotToken = parseExpectedToken(20 /* DotToken */, false, ts.Diagnostics.super_must_be_followed_by_an_argument_list_or_member_access);
|
|
node.name = parseRightSideOfDot(true);
|
|
return finishNode(node);
|
|
}
|
|
function parseJsxElementOrSelfClosingElement() {
|
|
var opening = parseJsxOpeningOrSelfClosingElement();
|
|
if (opening.kind === 232 /* JsxOpeningElement */) {
|
|
var node = createNode(230 /* JsxElement */, opening.pos);
|
|
node.openingElement = opening;
|
|
node.children = parseJsxChildren(node.openingElement.tagName);
|
|
node.closingElement = parseJsxClosingElement();
|
|
return finishNode(node);
|
|
}
|
|
else {
|
|
ts.Debug.assert(opening.kind === 231 /* JsxSelfClosingElement */);
|
|
// Nothing else to do for self-closing elements
|
|
return opening;
|
|
}
|
|
}
|
|
function parseJsxText() {
|
|
var node = createNode(233 /* JsxText */, scanner.getStartPos());
|
|
token = scanner.scanJsxToken();
|
|
return finishNode(node);
|
|
}
|
|
function parseJsxChild() {
|
|
switch (token) {
|
|
case 233 /* JsxText */:
|
|
return parseJsxText();
|
|
case 14 /* OpenBraceToken */:
|
|
return parseJsxExpression();
|
|
case 24 /* LessThanToken */:
|
|
return parseJsxElementOrSelfClosingElement();
|
|
}
|
|
ts.Debug.fail('Unknown JSX child kind ' + token);
|
|
}
|
|
function parseJsxChildren(openingTagName) {
|
|
var result = [];
|
|
result.pos = scanner.getStartPos();
|
|
var saveParsingContext = parsingContext;
|
|
parsingContext |= 1 << 14 /* JsxChildren */;
|
|
while (true) {
|
|
token = scanner.reScanJsxToken();
|
|
if (token === 25 /* LessThanSlashToken */) {
|
|
break;
|
|
}
|
|
else if (token === 1 /* EndOfFileToken */) {
|
|
parseErrorAtCurrentToken(ts.Diagnostics.Expected_corresponding_JSX_closing_tag_for_0, ts.getTextOfNodeFromSourceText(sourceText, openingTagName));
|
|
break;
|
|
}
|
|
result.push(parseJsxChild());
|
|
}
|
|
result.end = scanner.getTokenPos();
|
|
parsingContext = saveParsingContext;
|
|
return result;
|
|
}
|
|
function parseJsxOpeningOrSelfClosingElement() {
|
|
var fullStart = scanner.getStartPos();
|
|
parseExpected(24 /* LessThanToken */);
|
|
var tagName = parseJsxElementName();
|
|
var attributes = parseList(13 /* JsxAttributes */, parseJsxAttribute);
|
|
var node;
|
|
if (parseOptional(26 /* GreaterThanToken */)) {
|
|
node = createNode(232 /* JsxOpeningElement */, fullStart);
|
|
}
|
|
else {
|
|
parseExpected(37 /* SlashToken */);
|
|
parseExpected(26 /* GreaterThanToken */);
|
|
node = createNode(231 /* JsxSelfClosingElement */, fullStart);
|
|
}
|
|
node.tagName = tagName;
|
|
node.attributes = attributes;
|
|
return finishNode(node);
|
|
}
|
|
function parseJsxElementName() {
|
|
scanJsxIdentifier();
|
|
var elementName = parseIdentifierName();
|
|
while (parseOptional(20 /* DotToken */)) {
|
|
scanJsxIdentifier();
|
|
var node = createNode(132 /* QualifiedName */, elementName.pos);
|
|
node.left = elementName;
|
|
node.right = parseIdentifierName();
|
|
elementName = finishNode(node);
|
|
}
|
|
return elementName;
|
|
}
|
|
function parseJsxExpression() {
|
|
var node = createNode(237 /* JsxExpression */);
|
|
parseExpected(14 /* OpenBraceToken */);
|
|
if (token !== 15 /* CloseBraceToken */) {
|
|
node.expression = parseExpression();
|
|
}
|
|
parseExpected(15 /* CloseBraceToken */);
|
|
return finishNode(node);
|
|
}
|
|
function parseJsxAttribute() {
|
|
if (token === 14 /* OpenBraceToken */) {
|
|
return parseJsxSpreadAttribute();
|
|
}
|
|
scanJsxIdentifier();
|
|
var node = createNode(235 /* JsxAttribute */);
|
|
node.name = parseIdentifierName();
|
|
if (parseOptional(54 /* EqualsToken */)) {
|
|
switch (token) {
|
|
case 8 /* StringLiteral */:
|
|
node.initializer = parseLiteralNode();
|
|
break;
|
|
default:
|
|
node.initializer = parseJsxExpression();
|
|
break;
|
|
}
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
function parseJsxSpreadAttribute() {
|
|
var node = createNode(236 /* JsxSpreadAttribute */);
|
|
parseExpected(14 /* OpenBraceToken */);
|
|
parseExpected(21 /* DotDotDotToken */);
|
|
node.expression = parseExpression();
|
|
parseExpected(15 /* CloseBraceToken */);
|
|
return finishNode(node);
|
|
}
|
|
function parseJsxClosingElement() {
|
|
var node = createNode(234 /* JsxClosingElement */);
|
|
parseExpected(25 /* LessThanSlashToken */);
|
|
node.tagName = parseJsxElementName();
|
|
parseExpected(26 /* GreaterThanToken */);
|
|
return finishNode(node);
|
|
}
|
|
function parseTypeAssertion() {
|
|
var node = createNode(168 /* TypeAssertionExpression */);
|
|
parseExpected(24 /* LessThanToken */);
|
|
node.type = parseType();
|
|
parseExpected(26 /* GreaterThanToken */);
|
|
node.expression = parseUnaryExpressionOrHigher();
|
|
return finishNode(node);
|
|
}
|
|
function parseMemberExpressionRest(expression) {
|
|
while (true) {
|
|
var dotToken = parseOptionalToken(20 /* DotToken */);
|
|
if (dotToken) {
|
|
var propertyAccess = createNode(163 /* PropertyAccessExpression */, expression.pos);
|
|
propertyAccess.expression = expression;
|
|
propertyAccess.dotToken = dotToken;
|
|
propertyAccess.name = parseRightSideOfDot(true);
|
|
expression = finishNode(propertyAccess);
|
|
continue;
|
|
}
|
|
// when in the [Decorator] context, we do not parse ElementAccess as it could be part of a ComputedPropertyName
|
|
if (!inDecoratorContext() && parseOptional(18 /* OpenBracketToken */)) {
|
|
var indexedAccess = createNode(164 /* ElementAccessExpression */, expression.pos);
|
|
indexedAccess.expression = expression;
|
|
// It's not uncommon for a user to write: "new Type[]".
|
|
// Check for that common pattern and report a better error message.
|
|
if (token !== 19 /* CloseBracketToken */) {
|
|
indexedAccess.argumentExpression = allowInAnd(parseExpression);
|
|
if (indexedAccess.argumentExpression.kind === 8 /* StringLiteral */ || indexedAccess.argumentExpression.kind === 7 /* NumericLiteral */) {
|
|
var literal = indexedAccess.argumentExpression;
|
|
literal.text = internIdentifier(literal.text);
|
|
}
|
|
}
|
|
parseExpected(19 /* CloseBracketToken */);
|
|
expression = finishNode(indexedAccess);
|
|
continue;
|
|
}
|
|
if (token === 10 /* NoSubstitutionTemplateLiteral */ || token === 11 /* TemplateHead */) {
|
|
var tagExpression = createNode(167 /* TaggedTemplateExpression */, expression.pos);
|
|
tagExpression.tag = expression;
|
|
tagExpression.template = token === 10 /* NoSubstitutionTemplateLiteral */
|
|
? parseLiteralNode()
|
|
: parseTemplateExpression();
|
|
expression = finishNode(tagExpression);
|
|
continue;
|
|
}
|
|
return expression;
|
|
}
|
|
}
|
|
function parseCallExpressionRest(expression) {
|
|
while (true) {
|
|
expression = parseMemberExpressionRest(expression);
|
|
if (token === 24 /* LessThanToken */) {
|
|
// 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) {
|
|
return expression;
|
|
}
|
|
var callExpr = createNode(165 /* CallExpression */, expression.pos);
|
|
callExpr.expression = expression;
|
|
callExpr.typeArguments = typeArguments;
|
|
callExpr.arguments = parseArgumentList();
|
|
expression = finishNode(callExpr);
|
|
continue;
|
|
}
|
|
else if (token === 16 /* OpenParenToken */) {
|
|
var callExpr = createNode(165 /* CallExpression */, expression.pos);
|
|
callExpr.expression = expression;
|
|
callExpr.arguments = parseArgumentList();
|
|
expression = finishNode(callExpr);
|
|
continue;
|
|
}
|
|
return expression;
|
|
}
|
|
}
|
|
function parseArgumentList() {
|
|
parseExpected(16 /* OpenParenToken */);
|
|
var result = parseDelimitedList(11 /* ArgumentExpressions */, parseArgumentExpression);
|
|
parseExpected(17 /* CloseParenToken */);
|
|
return result;
|
|
}
|
|
function parseTypeArgumentsInExpression() {
|
|
if (!parseOptional(24 /* LessThanToken */)) {
|
|
return undefined;
|
|
}
|
|
var typeArguments = parseDelimitedList(18 /* TypeArguments */, parseType);
|
|
if (!parseExpected(26 /* 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 arugment 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 16 /* OpenParenToken */: // foo<x>(
|
|
// this case are the only case where this token can legally follow a type argument
|
|
// list. So we definitely want to treat this as a type arg list.
|
|
case 20 /* DotToken */: // foo<x>.
|
|
case 17 /* CloseParenToken */: // foo<x>)
|
|
case 19 /* CloseBracketToken */: // foo<x>]
|
|
case 52 /* ColonToken */: // foo<x>:
|
|
case 22 /* SemicolonToken */: // foo<x>;
|
|
case 51 /* QuestionToken */: // foo<x>?
|
|
case 29 /* EqualsEqualsToken */: // foo<x> ==
|
|
case 31 /* EqualsEqualsEqualsToken */: // foo<x> ===
|
|
case 30 /* ExclamationEqualsToken */: // foo<x> !=
|
|
case 32 /* ExclamationEqualsEqualsToken */: // foo<x> !==
|
|
case 49 /* AmpersandAmpersandToken */: // foo<x> &&
|
|
case 50 /* BarBarToken */: // foo<x> ||
|
|
case 46 /* CaretToken */: // foo<x> ^
|
|
case 44 /* AmpersandToken */: // foo<x> &
|
|
case 45 /* BarToken */: // foo<x> |
|
|
case 15 /* CloseBraceToken */: // foo<x> }
|
|
case 1 /* EndOfFileToken */:
|
|
// 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 23 /* CommaToken */: // foo<x>,
|
|
case 14 /* 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.
|
|
default:
|
|
// Anything else treat as an expression.
|
|
return false;
|
|
}
|
|
}
|
|
function parsePrimaryExpression() {
|
|
switch (token) {
|
|
case 7 /* NumericLiteral */:
|
|
case 8 /* StringLiteral */:
|
|
case 10 /* NoSubstitutionTemplateLiteral */:
|
|
return parseLiteralNode();
|
|
case 94 /* ThisKeyword */:
|
|
case 92 /* SuperKeyword */:
|
|
case 90 /* NullKeyword */:
|
|
case 96 /* TrueKeyword */:
|
|
case 81 /* FalseKeyword */:
|
|
return parseTokenNode();
|
|
case 16 /* OpenParenToken */:
|
|
return parseParenthesizedExpression();
|
|
case 18 /* OpenBracketToken */:
|
|
return parseArrayLiteralExpression();
|
|
case 14 /* OpenBraceToken */:
|
|
return parseObjectLiteralExpression();
|
|
case 115 /* 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 70 /* ClassKeyword */:
|
|
return parseClassExpression();
|
|
case 84 /* FunctionKeyword */:
|
|
return parseFunctionExpression();
|
|
case 89 /* NewKeyword */:
|
|
return parseNewExpression();
|
|
case 37 /* SlashToken */:
|
|
case 58 /* SlashEqualsToken */:
|
|
if (reScanSlashToken() === 9 /* RegularExpressionLiteral */) {
|
|
return parseLiteralNode();
|
|
}
|
|
break;
|
|
case 11 /* TemplateHead */:
|
|
return parseTemplateExpression();
|
|
}
|
|
return parseIdentifier(ts.Diagnostics.Expression_expected);
|
|
}
|
|
function parseParenthesizedExpression() {
|
|
var node = createNode(169 /* ParenthesizedExpression */);
|
|
parseExpected(16 /* OpenParenToken */);
|
|
node.expression = allowInAnd(parseExpression);
|
|
parseExpected(17 /* CloseParenToken */);
|
|
return finishNode(node);
|
|
}
|
|
function parseSpreadElement() {
|
|
var node = createNode(182 /* SpreadElementExpression */);
|
|
parseExpected(21 /* DotDotDotToken */);
|
|
node.expression = parseAssignmentExpressionOrHigher();
|
|
return finishNode(node);
|
|
}
|
|
function parseArgumentOrArrayLiteralElement() {
|
|
return token === 21 /* DotDotDotToken */ ? parseSpreadElement() :
|
|
token === 23 /* CommaToken */ ? createNode(184 /* OmittedExpression */) :
|
|
parseAssignmentExpressionOrHigher();
|
|
}
|
|
function parseArgumentExpression() {
|
|
return doOutsideOfContext(disallowInAndDecoratorContext, parseArgumentOrArrayLiteralElement);
|
|
}
|
|
function parseArrayLiteralExpression() {
|
|
var node = createNode(161 /* ArrayLiteralExpression */);
|
|
parseExpected(18 /* OpenBracketToken */);
|
|
if (scanner.hasPrecedingLineBreak())
|
|
node.flags |= 2048 /* MultiLine */;
|
|
node.elements = parseDelimitedList(15 /* ArrayLiteralMembers */, parseArgumentOrArrayLiteralElement);
|
|
parseExpected(19 /* CloseBracketToken */);
|
|
return finishNode(node);
|
|
}
|
|
function tryParseAccessorDeclaration(fullStart, decorators, modifiers) {
|
|
if (parseContextualModifier(120 /* GetKeyword */)) {
|
|
return parseAccessorDeclaration(142 /* GetAccessor */, fullStart, decorators, modifiers);
|
|
}
|
|
else if (parseContextualModifier(126 /* SetKeyword */)) {
|
|
return parseAccessorDeclaration(143 /* SetAccessor */, fullStart, decorators, modifiers);
|
|
}
|
|
return undefined;
|
|
}
|
|
function parseObjectLiteralElement() {
|
|
var fullStart = scanner.getStartPos();
|
|
var decorators = parseDecorators();
|
|
var modifiers = parseModifiers();
|
|
var accessor = tryParseAccessorDeclaration(fullStart, decorators, modifiers);
|
|
if (accessor) {
|
|
return accessor;
|
|
}
|
|
var asteriskToken = parseOptionalToken(36 /* AsteriskToken */);
|
|
var tokenIsIdentifier = isIdentifier();
|
|
var nameToken = token;
|
|
var propertyName = parsePropertyName();
|
|
// Disallowing of optional property assignments happens in the grammar checker.
|
|
var questionToken = parseOptionalToken(51 /* QuestionToken */);
|
|
if (asteriskToken || token === 16 /* OpenParenToken */ || token === 24 /* LessThanToken */) {
|
|
return parseMethodDeclaration(fullStart, decorators, modifiers, asteriskToken, propertyName, questionToken);
|
|
}
|
|
// Parse to check if it is short-hand property assignment or normal property assignment
|
|
if ((token === 23 /* CommaToken */ || token === 15 /* CloseBraceToken */) && tokenIsIdentifier) {
|
|
var shorthandDeclaration = createNode(243 /* ShorthandPropertyAssignment */, fullStart);
|
|
shorthandDeclaration.name = propertyName;
|
|
shorthandDeclaration.questionToken = questionToken;
|
|
return finishNode(shorthandDeclaration);
|
|
}
|
|
else {
|
|
var propertyAssignment = createNode(242 /* PropertyAssignment */, fullStart);
|
|
propertyAssignment.name = propertyName;
|
|
propertyAssignment.questionToken = questionToken;
|
|
parseExpected(52 /* ColonToken */);
|
|
propertyAssignment.initializer = allowInAnd(parseAssignmentExpressionOrHigher);
|
|
return finishNode(propertyAssignment);
|
|
}
|
|
}
|
|
function parseObjectLiteralExpression() {
|
|
var node = createNode(162 /* ObjectLiteralExpression */);
|
|
parseExpected(14 /* OpenBraceToken */);
|
|
if (scanner.hasPrecedingLineBreak()) {
|
|
node.flags |= 2048 /* MultiLine */;
|
|
}
|
|
node.properties = parseDelimitedList(12 /* ObjectLiteralMembers */, parseObjectLiteralElement, true);
|
|
parseExpected(15 /* CloseBraceToken */);
|
|
return finishNode(node);
|
|
}
|
|
function parseFunctionExpression() {
|
|
// GeneratorExpression:
|
|
// function* BindingIdentifier [Yield][opt](FormalParameters[Yield]){ GeneratorBody }
|
|
//
|
|
// FunctionExpression:
|
|
// function BindingIdentifier[opt](FormalParameters){ FunctionBody }
|
|
var saveDecoratorContext = inDecoratorContext();
|
|
if (saveDecoratorContext) {
|
|
setDecoratorContext(false);
|
|
}
|
|
var node = createNode(170 /* FunctionExpression */);
|
|
setModifiers(node, parseModifiers());
|
|
parseExpected(84 /* FunctionKeyword */);
|
|
node.asteriskToken = parseOptionalToken(36 /* AsteriskToken */);
|
|
var isGenerator = !!node.asteriskToken;
|
|
var isAsync = !!(node.flags & 512 /* Async */);
|
|
node.name =
|
|
isGenerator && isAsync ? doInYieldAndAwaitContext(parseOptionalIdentifier) :
|
|
isGenerator ? doInYieldContext(parseOptionalIdentifier) :
|
|
isAsync ? doInAwaitContext(parseOptionalIdentifier) :
|
|
parseOptionalIdentifier();
|
|
fillSignature(52 /* ColonToken */, isGenerator, isAsync, false, node);
|
|
node.body = parseFunctionBlock(isGenerator, isAsync, false);
|
|
if (saveDecoratorContext) {
|
|
setDecoratorContext(true);
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
function parseOptionalIdentifier() {
|
|
return isIdentifier() ? parseIdentifier() : undefined;
|
|
}
|
|
function parseNewExpression() {
|
|
var node = createNode(166 /* NewExpression */);
|
|
parseExpected(89 /* NewKeyword */);
|
|
node.expression = parseMemberExpressionOrHigher();
|
|
node.typeArguments = tryParse(parseTypeArgumentsInExpression);
|
|
if (node.typeArguments || token === 16 /* OpenParenToken */) {
|
|
node.arguments = parseArgumentList();
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
// STATEMENTS
|
|
function parseBlock(ignoreMissingOpenBrace, diagnosticMessage) {
|
|
var node = createNode(189 /* Block */);
|
|
if (parseExpected(14 /* OpenBraceToken */, diagnosticMessage) || ignoreMissingOpenBrace) {
|
|
node.statements = parseList(1 /* BlockStatements */, parseStatement);
|
|
parseExpected(15 /* CloseBraceToken */);
|
|
}
|
|
else {
|
|
node.statements = createMissingList();
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
function parseFunctionBlock(allowYield, allowAwait, ignoreMissingOpenBrace, diagnosticMessage) {
|
|
var savedYieldContext = inYieldContext();
|
|
setYieldContext(allowYield);
|
|
var savedAwaitContext = inAwaitContext();
|
|
setAwaitContext(allowAwait);
|
|
// 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(false);
|
|
}
|
|
var block = parseBlock(ignoreMissingOpenBrace, diagnosticMessage);
|
|
if (saveDecoratorContext) {
|
|
setDecoratorContext(true);
|
|
}
|
|
setYieldContext(savedYieldContext);
|
|
setAwaitContext(savedAwaitContext);
|
|
return block;
|
|
}
|
|
function parseEmptyStatement() {
|
|
var node = createNode(191 /* EmptyStatement */);
|
|
parseExpected(22 /* SemicolonToken */);
|
|
return finishNode(node);
|
|
}
|
|
function parseIfStatement() {
|
|
var node = createNode(193 /* IfStatement */);
|
|
parseExpected(85 /* IfKeyword */);
|
|
parseExpected(16 /* OpenParenToken */);
|
|
node.expression = allowInAnd(parseExpression);
|
|
parseExpected(17 /* CloseParenToken */);
|
|
node.thenStatement = parseStatement();
|
|
node.elseStatement = parseOptional(77 /* ElseKeyword */) ? parseStatement() : undefined;
|
|
return finishNode(node);
|
|
}
|
|
function parseDoStatement() {
|
|
var node = createNode(194 /* DoStatement */);
|
|
parseExpected(76 /* DoKeyword */);
|
|
node.statement = parseStatement();
|
|
parseExpected(101 /* WhileKeyword */);
|
|
parseExpected(16 /* OpenParenToken */);
|
|
node.expression = allowInAnd(parseExpression);
|
|
parseExpected(17 /* 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(22 /* SemicolonToken */);
|
|
return finishNode(node);
|
|
}
|
|
function parseWhileStatement() {
|
|
var node = createNode(195 /* WhileStatement */);
|
|
parseExpected(101 /* WhileKeyword */);
|
|
parseExpected(16 /* OpenParenToken */);
|
|
node.expression = allowInAnd(parseExpression);
|
|
parseExpected(17 /* CloseParenToken */);
|
|
node.statement = parseStatement();
|
|
return finishNode(node);
|
|
}
|
|
function parseForOrForInOrForOfStatement() {
|
|
var pos = getNodePos();
|
|
parseExpected(83 /* ForKeyword */);
|
|
parseExpected(16 /* OpenParenToken */);
|
|
var initializer = undefined;
|
|
if (token !== 22 /* SemicolonToken */) {
|
|
if (token === 99 /* VarKeyword */ || token === 105 /* LetKeyword */ || token === 71 /* ConstKeyword */) {
|
|
initializer = parseVariableDeclarationList(true);
|
|
}
|
|
else {
|
|
initializer = disallowInAnd(parseExpression);
|
|
}
|
|
}
|
|
var forOrForInOrForOfStatement;
|
|
if (parseOptional(87 /* InKeyword */)) {
|
|
var forInStatement = createNode(197 /* ForInStatement */, pos);
|
|
forInStatement.initializer = initializer;
|
|
forInStatement.expression = allowInAnd(parseExpression);
|
|
parseExpected(17 /* CloseParenToken */);
|
|
forOrForInOrForOfStatement = forInStatement;
|
|
}
|
|
else if (parseOptional(131 /* OfKeyword */)) {
|
|
var forOfStatement = createNode(198 /* ForOfStatement */, pos);
|
|
forOfStatement.initializer = initializer;
|
|
forOfStatement.expression = allowInAnd(parseAssignmentExpressionOrHigher);
|
|
parseExpected(17 /* CloseParenToken */);
|
|
forOrForInOrForOfStatement = forOfStatement;
|
|
}
|
|
else {
|
|
var forStatement = createNode(196 /* ForStatement */, pos);
|
|
forStatement.initializer = initializer;
|
|
parseExpected(22 /* SemicolonToken */);
|
|
if (token !== 22 /* SemicolonToken */ && token !== 17 /* CloseParenToken */) {
|
|
forStatement.condition = allowInAnd(parseExpression);
|
|
}
|
|
parseExpected(22 /* SemicolonToken */);
|
|
if (token !== 17 /* CloseParenToken */) {
|
|
forStatement.incrementor = allowInAnd(parseExpression);
|
|
}
|
|
parseExpected(17 /* CloseParenToken */);
|
|
forOrForInOrForOfStatement = forStatement;
|
|
}
|
|
forOrForInOrForOfStatement.statement = parseStatement();
|
|
return finishNode(forOrForInOrForOfStatement);
|
|
}
|
|
function parseBreakOrContinueStatement(kind) {
|
|
var node = createNode(kind);
|
|
parseExpected(kind === 200 /* BreakStatement */ ? 67 /* BreakKeyword */ : 72 /* ContinueKeyword */);
|
|
if (!canParseSemicolon()) {
|
|
node.label = parseIdentifier();
|
|
}
|
|
parseSemicolon();
|
|
return finishNode(node);
|
|
}
|
|
function parseReturnStatement() {
|
|
var node = createNode(201 /* ReturnStatement */);
|
|
parseExpected(91 /* ReturnKeyword */);
|
|
if (!canParseSemicolon()) {
|
|
node.expression = allowInAnd(parseExpression);
|
|
}
|
|
parseSemicolon();
|
|
return finishNode(node);
|
|
}
|
|
function parseWithStatement() {
|
|
var node = createNode(202 /* WithStatement */);
|
|
parseExpected(102 /* WithKeyword */);
|
|
parseExpected(16 /* OpenParenToken */);
|
|
node.expression = allowInAnd(parseExpression);
|
|
parseExpected(17 /* CloseParenToken */);
|
|
node.statement = parseStatement();
|
|
return finishNode(node);
|
|
}
|
|
function parseCaseClause() {
|
|
var node = createNode(238 /* CaseClause */);
|
|
parseExpected(68 /* CaseKeyword */);
|
|
node.expression = allowInAnd(parseExpression);
|
|
parseExpected(52 /* ColonToken */);
|
|
node.statements = parseList(3 /* SwitchClauseStatements */, parseStatement);
|
|
return finishNode(node);
|
|
}
|
|
function parseDefaultClause() {
|
|
var node = createNode(239 /* DefaultClause */);
|
|
parseExpected(74 /* DefaultKeyword */);
|
|
parseExpected(52 /* ColonToken */);
|
|
node.statements = parseList(3 /* SwitchClauseStatements */, parseStatement);
|
|
return finishNode(node);
|
|
}
|
|
function parseCaseOrDefaultClause() {
|
|
return token === 68 /* CaseKeyword */ ? parseCaseClause() : parseDefaultClause();
|
|
}
|
|
function parseSwitchStatement() {
|
|
var node = createNode(203 /* SwitchStatement */);
|
|
parseExpected(93 /* SwitchKeyword */);
|
|
parseExpected(16 /* OpenParenToken */);
|
|
node.expression = allowInAnd(parseExpression);
|
|
parseExpected(17 /* CloseParenToken */);
|
|
var caseBlock = createNode(217 /* CaseBlock */, scanner.getStartPos());
|
|
parseExpected(14 /* OpenBraceToken */);
|
|
caseBlock.clauses = parseList(2 /* SwitchClauses */, parseCaseOrDefaultClause);
|
|
parseExpected(15 /* CloseBraceToken */);
|
|
node.caseBlock = finishNode(caseBlock);
|
|
return finishNode(node);
|
|
}
|
|
function parseThrowStatement() {
|
|
// ThrowStatement[Yield] :
|
|
// throw [no LineTerminator here]Expression[In, ?Yield];
|
|
// 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.
|
|
// We just return 'undefined' in that case. The actual error will be reported in the
|
|
// grammar walker.
|
|
var node = createNode(205 /* ThrowStatement */);
|
|
parseExpected(95 /* ThrowKeyword */);
|
|
node.expression = scanner.hasPrecedingLineBreak() ? undefined : allowInAnd(parseExpression);
|
|
parseSemicolon();
|
|
return finishNode(node);
|
|
}
|
|
// TODO: Review for error recovery
|
|
function parseTryStatement() {
|
|
var node = createNode(206 /* TryStatement */);
|
|
parseExpected(97 /* TryKeyword */);
|
|
node.tryBlock = parseBlock(false);
|
|
node.catchClause = token === 69 /* 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.
|
|
if (!node.catchClause || token === 82 /* FinallyKeyword */) {
|
|
parseExpected(82 /* FinallyKeyword */);
|
|
node.finallyBlock = parseBlock(false);
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
function parseCatchClause() {
|
|
var result = createNode(241 /* CatchClause */);
|
|
parseExpected(69 /* CatchKeyword */);
|
|
if (parseExpected(16 /* OpenParenToken */)) {
|
|
result.variableDeclaration = parseVariableDeclaration();
|
|
}
|
|
parseExpected(17 /* CloseParenToken */);
|
|
result.block = parseBlock(false);
|
|
return finishNode(result);
|
|
}
|
|
function parseDebuggerStatement() {
|
|
var node = createNode(207 /* DebuggerStatement */);
|
|
parseExpected(73 /* DebuggerKeyword */);
|
|
parseSemicolon();
|
|
return finishNode(node);
|
|
}
|
|
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 fullStart = scanner.getStartPos();
|
|
var expression = allowInAnd(parseExpression);
|
|
if (expression.kind === 66 /* Identifier */ && parseOptional(52 /* ColonToken */)) {
|
|
var labeledStatement = createNode(204 /* LabeledStatement */, fullStart);
|
|
labeledStatement.label = expression;
|
|
labeledStatement.statement = parseStatement();
|
|
return finishNode(labeledStatement);
|
|
}
|
|
else {
|
|
var expressionStatement = createNode(192 /* ExpressionStatement */, fullStart);
|
|
expressionStatement.expression = expression;
|
|
parseSemicolon();
|
|
return finishNode(expressionStatement);
|
|
}
|
|
}
|
|
function isIdentifierOrKeyword() {
|
|
return token >= 66 /* Identifier */;
|
|
}
|
|
function nextTokenIsIdentifierOrKeywordOnSameLine() {
|
|
nextToken();
|
|
return isIdentifierOrKeyword() && !scanner.hasPrecedingLineBreak();
|
|
}
|
|
function nextTokenIsFunctionKeywordOnSameLine() {
|
|
nextToken();
|
|
return token === 84 /* FunctionKeyword */ && !scanner.hasPrecedingLineBreak();
|
|
}
|
|
function nextTokenIsIdentifierOrKeywordOrNumberOnSameLine() {
|
|
nextToken();
|
|
return (isIdentifierOrKeyword() || token === 7 /* NumericLiteral */) && !scanner.hasPrecedingLineBreak();
|
|
}
|
|
function isDeclaration() {
|
|
while (true) {
|
|
switch (token) {
|
|
case 99 /* VarKeyword */:
|
|
case 105 /* LetKeyword */:
|
|
case 71 /* ConstKeyword */:
|
|
case 84 /* FunctionKeyword */:
|
|
case 70 /* ClassKeyword */:
|
|
case 78 /* 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 104 /* InterfaceKeyword */:
|
|
case 129 /* TypeKeyword */:
|
|
return nextTokenIsIdentifierOnSameLine();
|
|
case 122 /* ModuleKeyword */:
|
|
case 123 /* NamespaceKeyword */:
|
|
return nextTokenIsIdentifierOrStringLiteralOnSameLine();
|
|
case 115 /* AsyncKeyword */:
|
|
case 119 /* DeclareKeyword */:
|
|
nextToken();
|
|
// ASI takes effect for this modifier.
|
|
if (scanner.hasPrecedingLineBreak()) {
|
|
return false;
|
|
}
|
|
continue;
|
|
case 86 /* ImportKeyword */:
|
|
nextToken();
|
|
return token === 8 /* StringLiteral */ || token === 36 /* AsteriskToken */ ||
|
|
token === 14 /* OpenBraceToken */ || isIdentifierOrKeyword();
|
|
case 79 /* ExportKeyword */:
|
|
nextToken();
|
|
if (token === 54 /* EqualsToken */ || token === 36 /* AsteriskToken */ ||
|
|
token === 14 /* OpenBraceToken */ || token === 74 /* DefaultKeyword */) {
|
|
return true;
|
|
}
|
|
continue;
|
|
case 109 /* PublicKeyword */:
|
|
case 107 /* PrivateKeyword */:
|
|
case 108 /* ProtectedKeyword */:
|
|
case 110 /* StaticKeyword */:
|
|
case 112 /* AbstractKeyword */:
|
|
nextToken();
|
|
continue;
|
|
default:
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
function isStartOfDeclaration() {
|
|
return lookAhead(isDeclaration);
|
|
}
|
|
function isStartOfStatement() {
|
|
switch (token) {
|
|
case 53 /* AtToken */:
|
|
case 22 /* SemicolonToken */:
|
|
case 14 /* OpenBraceToken */:
|
|
case 99 /* VarKeyword */:
|
|
case 105 /* LetKeyword */:
|
|
case 84 /* FunctionKeyword */:
|
|
case 70 /* ClassKeyword */:
|
|
case 78 /* EnumKeyword */:
|
|
case 85 /* IfKeyword */:
|
|
case 76 /* DoKeyword */:
|
|
case 101 /* WhileKeyword */:
|
|
case 83 /* ForKeyword */:
|
|
case 72 /* ContinueKeyword */:
|
|
case 67 /* BreakKeyword */:
|
|
case 91 /* ReturnKeyword */:
|
|
case 102 /* WithKeyword */:
|
|
case 93 /* SwitchKeyword */:
|
|
case 95 /* ThrowKeyword */:
|
|
case 97 /* TryKeyword */:
|
|
case 73 /* 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.
|
|
case 69 /* CatchKeyword */:
|
|
case 82 /* FinallyKeyword */:
|
|
return true;
|
|
case 71 /* ConstKeyword */:
|
|
case 79 /* ExportKeyword */:
|
|
case 86 /* ImportKeyword */:
|
|
return isStartOfDeclaration();
|
|
case 115 /* AsyncKeyword */:
|
|
case 119 /* DeclareKeyword */:
|
|
case 104 /* InterfaceKeyword */:
|
|
case 122 /* ModuleKeyword */:
|
|
case 123 /* NamespaceKeyword */:
|
|
case 129 /* TypeKeyword */:
|
|
// When these don't start a declaration, they're an identifier in an expression statement
|
|
return true;
|
|
case 109 /* PublicKeyword */:
|
|
case 107 /* PrivateKeyword */:
|
|
case 108 /* ProtectedKeyword */:
|
|
case 110 /* StaticKeyword */:
|
|
// 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 nextTokenIsIdentifierOrStartOfDestructuring() {
|
|
nextToken();
|
|
return isIdentifier() || token === 14 /* OpenBraceToken */ || token === 18 /* OpenBracketToken */;
|
|
}
|
|
function isLetDeclaration() {
|
|
// In ES6 'let' always starts a lexical declaration if followed by an identifier or {
|
|
// or [.
|
|
return lookAhead(nextTokenIsIdentifierOrStartOfDestructuring);
|
|
}
|
|
function parseStatement() {
|
|
switch (token) {
|
|
case 22 /* SemicolonToken */:
|
|
return parseEmptyStatement();
|
|
case 14 /* OpenBraceToken */:
|
|
return parseBlock(false);
|
|
case 99 /* VarKeyword */:
|
|
return parseVariableStatement(scanner.getStartPos(), undefined, undefined);
|
|
case 105 /* LetKeyword */:
|
|
if (isLetDeclaration()) {
|
|
return parseVariableStatement(scanner.getStartPos(), undefined, undefined);
|
|
}
|
|
break;
|
|
case 84 /* FunctionKeyword */:
|
|
return parseFunctionDeclaration(scanner.getStartPos(), undefined, undefined);
|
|
case 70 /* ClassKeyword */:
|
|
return parseClassDeclaration(scanner.getStartPos(), undefined, undefined);
|
|
case 85 /* IfKeyword */:
|
|
return parseIfStatement();
|
|
case 76 /* DoKeyword */:
|
|
return parseDoStatement();
|
|
case 101 /* WhileKeyword */:
|
|
return parseWhileStatement();
|
|
case 83 /* ForKeyword */:
|
|
return parseForOrForInOrForOfStatement();
|
|
case 72 /* ContinueKeyword */:
|
|
return parseBreakOrContinueStatement(199 /* ContinueStatement */);
|
|
case 67 /* BreakKeyword */:
|
|
return parseBreakOrContinueStatement(200 /* BreakStatement */);
|
|
case 91 /* ReturnKeyword */:
|
|
return parseReturnStatement();
|
|
case 102 /* WithKeyword */:
|
|
return parseWithStatement();
|
|
case 93 /* SwitchKeyword */:
|
|
return parseSwitchStatement();
|
|
case 95 /* ThrowKeyword */:
|
|
return parseThrowStatement();
|
|
case 97 /* TryKeyword */:
|
|
// Include 'catch' and 'finally' for error recovery.
|
|
case 69 /* CatchKeyword */:
|
|
case 82 /* FinallyKeyword */:
|
|
return parseTryStatement();
|
|
case 73 /* DebuggerKeyword */:
|
|
return parseDebuggerStatement();
|
|
case 53 /* AtToken */:
|
|
return parseDeclaration();
|
|
case 115 /* AsyncKeyword */:
|
|
case 104 /* InterfaceKeyword */:
|
|
case 129 /* TypeKeyword */:
|
|
case 122 /* ModuleKeyword */:
|
|
case 123 /* NamespaceKeyword */:
|
|
case 119 /* DeclareKeyword */:
|
|
case 71 /* ConstKeyword */:
|
|
case 78 /* EnumKeyword */:
|
|
case 79 /* ExportKeyword */:
|
|
case 86 /* ImportKeyword */:
|
|
case 107 /* PrivateKeyword */:
|
|
case 108 /* ProtectedKeyword */:
|
|
case 109 /* PublicKeyword */:
|
|
case 112 /* AbstractKeyword */:
|
|
case 110 /* StaticKeyword */:
|
|
if (isStartOfDeclaration()) {
|
|
return parseDeclaration();
|
|
}
|
|
break;
|
|
}
|
|
return parseExpressionOrLabeledStatement();
|
|
}
|
|
function parseDeclaration() {
|
|
var fullStart = getNodePos();
|
|
var decorators = parseDecorators();
|
|
var modifiers = parseModifiers();
|
|
switch (token) {
|
|
case 99 /* VarKeyword */:
|
|
case 105 /* LetKeyword */:
|
|
case 71 /* ConstKeyword */:
|
|
return parseVariableStatement(fullStart, decorators, modifiers);
|
|
case 84 /* FunctionKeyword */:
|
|
return parseFunctionDeclaration(fullStart, decorators, modifiers);
|
|
case 70 /* ClassKeyword */:
|
|
return parseClassDeclaration(fullStart, decorators, modifiers);
|
|
case 104 /* InterfaceKeyword */:
|
|
return parseInterfaceDeclaration(fullStart, decorators, modifiers);
|
|
case 129 /* TypeKeyword */:
|
|
return parseTypeAliasDeclaration(fullStart, decorators, modifiers);
|
|
case 78 /* EnumKeyword */:
|
|
return parseEnumDeclaration(fullStart, decorators, modifiers);
|
|
case 122 /* ModuleKeyword */:
|
|
case 123 /* NamespaceKeyword */:
|
|
return parseModuleDeclaration(fullStart, decorators, modifiers);
|
|
case 86 /* ImportKeyword */:
|
|
return parseImportDeclarationOrImportEqualsDeclaration(fullStart, decorators, modifiers);
|
|
case 79 /* ExportKeyword */:
|
|
nextToken();
|
|
return token === 74 /* DefaultKeyword */ || token === 54 /* EqualsToken */ ?
|
|
parseExportAssignment(fullStart, decorators, modifiers) :
|
|
parseExportDeclaration(fullStart, 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 node = createMissingNode(228 /* MissingDeclaration */, true, ts.Diagnostics.Declaration_expected);
|
|
node.pos = fullStart;
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
return finishNode(node);
|
|
}
|
|
}
|
|
}
|
|
function nextTokenIsIdentifierOrStringLiteralOnSameLine() {
|
|
nextToken();
|
|
return !scanner.hasPrecedingLineBreak() && (isIdentifier() || token === 8 /* StringLiteral */);
|
|
}
|
|
function parseFunctionBlockOrSemicolon(isGenerator, isAsync, diagnosticMessage) {
|
|
if (token !== 14 /* OpenBraceToken */ && canParseSemicolon()) {
|
|
parseSemicolon();
|
|
return;
|
|
}
|
|
return parseFunctionBlock(isGenerator, isAsync, false, diagnosticMessage);
|
|
}
|
|
// DECLARATIONS
|
|
function parseArrayBindingElement() {
|
|
if (token === 23 /* CommaToken */) {
|
|
return createNode(184 /* OmittedExpression */);
|
|
}
|
|
var node = createNode(160 /* BindingElement */);
|
|
node.dotDotDotToken = parseOptionalToken(21 /* DotDotDotToken */);
|
|
node.name = parseIdentifierOrPattern();
|
|
node.initializer = parseBindingElementInitializer(false);
|
|
return finishNode(node);
|
|
}
|
|
function parseObjectBindingElement() {
|
|
var node = createNode(160 /* BindingElement */);
|
|
// TODO(andersh): Handle computed properties
|
|
var tokenIsIdentifier = isIdentifier();
|
|
var propertyName = parsePropertyName();
|
|
if (tokenIsIdentifier && token !== 52 /* ColonToken */) {
|
|
node.name = propertyName;
|
|
}
|
|
else {
|
|
parseExpected(52 /* ColonToken */);
|
|
node.propertyName = propertyName;
|
|
node.name = parseIdentifierOrPattern();
|
|
}
|
|
node.initializer = parseBindingElementInitializer(false);
|
|
return finishNode(node);
|
|
}
|
|
function parseObjectBindingPattern() {
|
|
var node = createNode(158 /* ObjectBindingPattern */);
|
|
parseExpected(14 /* OpenBraceToken */);
|
|
node.elements = parseDelimitedList(9 /* ObjectBindingElements */, parseObjectBindingElement);
|
|
parseExpected(15 /* CloseBraceToken */);
|
|
return finishNode(node);
|
|
}
|
|
function parseArrayBindingPattern() {
|
|
var node = createNode(159 /* ArrayBindingPattern */);
|
|
parseExpected(18 /* OpenBracketToken */);
|
|
node.elements = parseDelimitedList(10 /* ArrayBindingElements */, parseArrayBindingElement);
|
|
parseExpected(19 /* CloseBracketToken */);
|
|
return finishNode(node);
|
|
}
|
|
function isIdentifierOrPattern() {
|
|
return token === 14 /* OpenBraceToken */ || token === 18 /* OpenBracketToken */ || isIdentifier();
|
|
}
|
|
function parseIdentifierOrPattern() {
|
|
if (token === 18 /* OpenBracketToken */) {
|
|
return parseArrayBindingPattern();
|
|
}
|
|
if (token === 14 /* OpenBraceToken */) {
|
|
return parseObjectBindingPattern();
|
|
}
|
|
return parseIdentifier();
|
|
}
|
|
function parseVariableDeclaration() {
|
|
var node = createNode(208 /* VariableDeclaration */);
|
|
node.name = parseIdentifierOrPattern();
|
|
node.type = parseTypeAnnotation();
|
|
if (!isInOrOfKeyword(token)) {
|
|
node.initializer = parseInitializer(false);
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
function parseVariableDeclarationList(inForStatementInitializer) {
|
|
var node = createNode(209 /* VariableDeclarationList */);
|
|
switch (token) {
|
|
case 99 /* VarKeyword */:
|
|
break;
|
|
case 105 /* LetKeyword */:
|
|
node.flags |= 16384 /* Let */;
|
|
break;
|
|
case 71 /* ConstKeyword */:
|
|
node.flags |= 32768 /* 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.
|
|
if (token === 131 /* OfKeyword */ && lookAhead(canFollowContextualOfKeyword)) {
|
|
node.declarations = createMissingList();
|
|
}
|
|
else {
|
|
var savedDisallowIn = inDisallowInContext();
|
|
setDisallowInContext(inForStatementInitializer);
|
|
node.declarations = parseDelimitedList(8 /* VariableDeclarations */, parseVariableDeclaration);
|
|
setDisallowInContext(savedDisallowIn);
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
function canFollowContextualOfKeyword() {
|
|
return nextTokenIsIdentifier() && nextToken() === 17 /* CloseParenToken */;
|
|
}
|
|
function parseVariableStatement(fullStart, decorators, modifiers) {
|
|
var node = createNode(190 /* VariableStatement */, fullStart);
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
node.declarationList = parseVariableDeclarationList(false);
|
|
parseSemicolon();
|
|
return finishNode(node);
|
|
}
|
|
function parseFunctionDeclaration(fullStart, decorators, modifiers) {
|
|
var node = createNode(210 /* FunctionDeclaration */, fullStart);
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
parseExpected(84 /* FunctionKeyword */);
|
|
node.asteriskToken = parseOptionalToken(36 /* AsteriskToken */);
|
|
node.name = node.flags & 1024 /* Default */ ? parseOptionalIdentifier() : parseIdentifier();
|
|
var isGenerator = !!node.asteriskToken;
|
|
var isAsync = !!(node.flags & 512 /* Async */);
|
|
fillSignature(52 /* ColonToken */, isGenerator, isAsync, false, node);
|
|
node.body = parseFunctionBlockOrSemicolon(isGenerator, isAsync, ts.Diagnostics.or_expected);
|
|
return finishNode(node);
|
|
}
|
|
function parseConstructorDeclaration(pos, decorators, modifiers) {
|
|
var node = createNode(141 /* Constructor */, pos);
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
parseExpected(118 /* ConstructorKeyword */);
|
|
fillSignature(52 /* ColonToken */, false, false, false, node);
|
|
node.body = parseFunctionBlockOrSemicolon(false, false, ts.Diagnostics.or_expected);
|
|
return finishNode(node);
|
|
}
|
|
function parseMethodDeclaration(fullStart, decorators, modifiers, asteriskToken, name, questionToken, diagnosticMessage) {
|
|
var method = createNode(140 /* MethodDeclaration */, fullStart);
|
|
method.decorators = decorators;
|
|
setModifiers(method, modifiers);
|
|
method.asteriskToken = asteriskToken;
|
|
method.name = name;
|
|
method.questionToken = questionToken;
|
|
var isGenerator = !!asteriskToken;
|
|
var isAsync = !!(method.flags & 512 /* Async */);
|
|
fillSignature(52 /* ColonToken */, isGenerator, isAsync, false, method);
|
|
method.body = parseFunctionBlockOrSemicolon(isGenerator, isAsync, diagnosticMessage);
|
|
return finishNode(method);
|
|
}
|
|
function parsePropertyDeclaration(fullStart, decorators, modifiers, name, questionToken) {
|
|
var property = createNode(138 /* PropertyDeclaration */, fullStart);
|
|
property.decorators = decorators;
|
|
setModifiers(property, modifiers);
|
|
property.name = name;
|
|
property.questionToken = questionToken;
|
|
property.type = parseTypeAnnotation();
|
|
// For instance properties specifically, since they are evaluated inside the constructor,
|
|
// we do *not * want to parse yield expressions, so we specifically turn the yield context
|
|
// off. The grammar would look something like this:
|
|
//
|
|
// MemberVariableDeclaration[Yield]:
|
|
// AccessibilityModifier_opt PropertyName TypeAnnotation_opt Initialiser_opt[In];
|
|
// AccessibilityModifier_opt static_opt PropertyName TypeAnnotation_opt Initialiser_opt[In, ?Yield];
|
|
//
|
|
// The checker may still error in the static case to explicitly disallow the yield expression.
|
|
property.initializer = modifiers && modifiers.flags & 128 /* Static */
|
|
? allowInAnd(parseNonParameterInitializer)
|
|
: doOutsideOfContext(2 /* Yield */ | 1 /* DisallowIn */, parseNonParameterInitializer);
|
|
parseSemicolon();
|
|
return finishNode(property);
|
|
}
|
|
function parsePropertyOrMethodDeclaration(fullStart, decorators, modifiers) {
|
|
var asteriskToken = parseOptionalToken(36 /* 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(51 /* QuestionToken */);
|
|
if (asteriskToken || token === 16 /* OpenParenToken */ || token === 24 /* LessThanToken */) {
|
|
return parseMethodDeclaration(fullStart, decorators, modifiers, asteriskToken, name, questionToken, ts.Diagnostics.or_expected);
|
|
}
|
|
else {
|
|
return parsePropertyDeclaration(fullStart, decorators, modifiers, name, questionToken);
|
|
}
|
|
}
|
|
function parseNonParameterInitializer() {
|
|
return parseInitializer(false);
|
|
}
|
|
function parseAccessorDeclaration(kind, fullStart, decorators, modifiers) {
|
|
var node = createNode(kind, fullStart);
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
node.name = parsePropertyName();
|
|
fillSignature(52 /* ColonToken */, false, false, false, node);
|
|
node.body = parseFunctionBlockOrSemicolon(false, false);
|
|
return finishNode(node);
|
|
}
|
|
function isClassMemberModifier(idToken) {
|
|
switch (idToken) {
|
|
case 109 /* PublicKeyword */:
|
|
case 107 /* PrivateKeyword */:
|
|
case 108 /* ProtectedKeyword */:
|
|
case 110 /* StaticKeyword */:
|
|
return true;
|
|
default:
|
|
return false;
|
|
}
|
|
}
|
|
function isClassMemberStart() {
|
|
var idToken;
|
|
if (token === 53 /* AtToken */) {
|
|
return true;
|
|
}
|
|
// Eat up all modifiers, but hold on to the last one in case it is actually an identifier.
|
|
while (ts.isModifier(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 (isClassMemberModifier(idToken)) {
|
|
return true;
|
|
}
|
|
nextToken();
|
|
}
|
|
if (token === 36 /* 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 === 18 /* 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 === 126 /* SetKeyword */ || idToken === 120 /* 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 16 /* OpenParenToken */: // Method declaration
|
|
case 24 /* LessThanToken */: // Generic Method declaration
|
|
case 52 /* ColonToken */: // Type Annotation for declaration
|
|
case 54 /* EqualsToken */: // Initializer for declaration
|
|
case 51 /* QuestionToken */:
|
|
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 parseDecorators() {
|
|
var decorators;
|
|
while (true) {
|
|
var decoratorStart = getNodePos();
|
|
if (!parseOptional(53 /* AtToken */)) {
|
|
break;
|
|
}
|
|
if (!decorators) {
|
|
decorators = [];
|
|
decorators.pos = scanner.getStartPos();
|
|
}
|
|
var decorator = createNode(136 /* Decorator */, decoratorStart);
|
|
decorator.expression = doInDecoratorContext(parseLeftHandSideExpressionOrHigher);
|
|
decorators.push(finishNode(decorator));
|
|
}
|
|
if (decorators) {
|
|
decorators.end = getNodeEnd();
|
|
}
|
|
return decorators;
|
|
}
|
|
function parseModifiers() {
|
|
var flags = 0;
|
|
var modifiers;
|
|
while (true) {
|
|
var modifierStart = scanner.getStartPos();
|
|
var modifierKind = token;
|
|
if (!parseAnyContextualModifier()) {
|
|
break;
|
|
}
|
|
if (!modifiers) {
|
|
modifiers = [];
|
|
modifiers.pos = modifierStart;
|
|
}
|
|
flags |= ts.modifierToFlag(modifierKind);
|
|
modifiers.push(finishNode(createNode(modifierKind, modifierStart)));
|
|
}
|
|
if (modifiers) {
|
|
modifiers.flags = flags;
|
|
modifiers.end = scanner.getStartPos();
|
|
}
|
|
return modifiers;
|
|
}
|
|
function parseModifiersForArrowFunction() {
|
|
var flags = 0;
|
|
var modifiers;
|
|
if (token === 115 /* AsyncKeyword */) {
|
|
var modifierStart = scanner.getStartPos();
|
|
var modifierKind = token;
|
|
nextToken();
|
|
modifiers = [];
|
|
modifiers.pos = modifierStart;
|
|
flags |= ts.modifierToFlag(modifierKind);
|
|
modifiers.push(finishNode(createNode(modifierKind, modifierStart)));
|
|
modifiers.flags = flags;
|
|
modifiers.end = scanner.getStartPos();
|
|
}
|
|
return modifiers;
|
|
}
|
|
function parseClassElement() {
|
|
if (token === 22 /* SemicolonToken */) {
|
|
var result = createNode(188 /* SemicolonClassElement */);
|
|
nextToken();
|
|
return finishNode(result);
|
|
}
|
|
var fullStart = getNodePos();
|
|
var decorators = parseDecorators();
|
|
var modifiers = parseModifiers();
|
|
var accessor = tryParseAccessorDeclaration(fullStart, decorators, modifiers);
|
|
if (accessor) {
|
|
return accessor;
|
|
}
|
|
if (token === 118 /* ConstructorKeyword */) {
|
|
return parseConstructorDeclaration(fullStart, decorators, modifiers);
|
|
}
|
|
if (isIndexSignature()) {
|
|
return parseIndexSignatureDeclaration(fullStart, 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 (isIdentifierOrKeyword() ||
|
|
token === 8 /* StringLiteral */ ||
|
|
token === 7 /* NumericLiteral */ ||
|
|
token === 36 /* AsteriskToken */ ||
|
|
token === 18 /* OpenBracketToken */) {
|
|
return parsePropertyOrMethodDeclaration(fullStart, decorators, modifiers);
|
|
}
|
|
if (decorators || modifiers) {
|
|
// treat this as a property declaration with a missing name.
|
|
var name_7 = createMissingNode(66 /* Identifier */, true, ts.Diagnostics.Declaration_expected);
|
|
return parsePropertyDeclaration(fullStart, decorators, modifiers, name_7, undefined);
|
|
}
|
|
// 'isClassMemberStart' should have hinted not to attempt parsing.
|
|
ts.Debug.fail("Should not have attempted to parse class member declaration.");
|
|
}
|
|
function parseClassExpression() {
|
|
return parseClassDeclarationOrExpression(
|
|
/*fullStart*/ scanner.getStartPos(),
|
|
/*decorators*/ undefined,
|
|
/*modifiers*/ undefined, 183 /* ClassExpression */);
|
|
}
|
|
function parseClassDeclaration(fullStart, decorators, modifiers) {
|
|
return parseClassDeclarationOrExpression(fullStart, decorators, modifiers, 211 /* ClassDeclaration */);
|
|
}
|
|
function parseClassDeclarationOrExpression(fullStart, decorators, modifiers, kind) {
|
|
var node = createNode(kind, fullStart);
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
parseExpected(70 /* ClassKeyword */);
|
|
node.name = parseOptionalIdentifier();
|
|
node.typeParameters = parseTypeParameters();
|
|
node.heritageClauses = parseHeritageClauses(true);
|
|
if (parseExpected(14 /* OpenBraceToken */)) {
|
|
// ClassTail[Yield,Await] : (Modified) See 14.5
|
|
// ClassHeritage[?Yield,?Await]opt { ClassBody[?Yield,?Await]opt }
|
|
node.members = parseClassMembers();
|
|
parseExpected(15 /* CloseBraceToken */);
|
|
}
|
|
else {
|
|
node.members = createMissingList();
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
function parseHeritageClauses(isClassHeritageClause) {
|
|
// ClassTail[Yield,Await] : (Modified) See 14.5
|
|
// ClassHeritage[?Yield,?Await]opt { ClassBody[?Yield,?Await]opt }
|
|
if (isHeritageClause()) {
|
|
return parseList(20 /* HeritageClauses */, parseHeritageClause);
|
|
}
|
|
return undefined;
|
|
}
|
|
function parseHeritageClausesWorker() {
|
|
return parseList(20 /* HeritageClauses */, parseHeritageClause);
|
|
}
|
|
function parseHeritageClause() {
|
|
if (token === 80 /* ExtendsKeyword */ || token === 103 /* ImplementsKeyword */) {
|
|
var node = createNode(240 /* HeritageClause */);
|
|
node.token = token;
|
|
nextToken();
|
|
node.types = parseDelimitedList(7 /* HeritageClauseElement */, parseExpressionWithTypeArguments);
|
|
return finishNode(node);
|
|
}
|
|
return undefined;
|
|
}
|
|
function parseExpressionWithTypeArguments() {
|
|
var node = createNode(185 /* ExpressionWithTypeArguments */);
|
|
node.expression = parseLeftHandSideExpressionOrHigher();
|
|
if (token === 24 /* LessThanToken */) {
|
|
node.typeArguments = parseBracketedList(18 /* TypeArguments */, parseType, 24 /* LessThanToken */, 26 /* GreaterThanToken */);
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
function isHeritageClause() {
|
|
return token === 80 /* ExtendsKeyword */ || token === 103 /* ImplementsKeyword */;
|
|
}
|
|
function parseClassMembers() {
|
|
return parseList(5 /* ClassMembers */, parseClassElement);
|
|
}
|
|
function parseInterfaceDeclaration(fullStart, decorators, modifiers) {
|
|
var node = createNode(212 /* InterfaceDeclaration */, fullStart);
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
parseExpected(104 /* InterfaceKeyword */);
|
|
node.name = parseIdentifier();
|
|
node.typeParameters = parseTypeParameters();
|
|
node.heritageClauses = parseHeritageClauses(false);
|
|
node.members = parseObjectTypeMembers();
|
|
return finishNode(node);
|
|
}
|
|
function parseTypeAliasDeclaration(fullStart, decorators, modifiers) {
|
|
var node = createNode(213 /* TypeAliasDeclaration */, fullStart);
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
parseExpected(129 /* TypeKeyword */);
|
|
node.name = parseIdentifier();
|
|
node.typeParameters = parseTypeParameters();
|
|
parseExpected(54 /* EqualsToken */);
|
|
node.type = parseType();
|
|
parseSemicolon();
|
|
return finishNode(node);
|
|
}
|
|
// 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 node = createNode(244 /* EnumMember */, scanner.getStartPos());
|
|
node.name = parsePropertyName();
|
|
node.initializer = allowInAnd(parseNonParameterInitializer);
|
|
return finishNode(node);
|
|
}
|
|
function parseEnumDeclaration(fullStart, decorators, modifiers) {
|
|
var node = createNode(214 /* EnumDeclaration */, fullStart);
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
parseExpected(78 /* EnumKeyword */);
|
|
node.name = parseIdentifier();
|
|
if (parseExpected(14 /* OpenBraceToken */)) {
|
|
node.members = parseDelimitedList(6 /* EnumMembers */, parseEnumMember);
|
|
parseExpected(15 /* CloseBraceToken */);
|
|
}
|
|
else {
|
|
node.members = createMissingList();
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
function parseModuleBlock() {
|
|
var node = createNode(216 /* ModuleBlock */, scanner.getStartPos());
|
|
if (parseExpected(14 /* OpenBraceToken */)) {
|
|
node.statements = parseList(1 /* BlockStatements */, parseStatement);
|
|
parseExpected(15 /* CloseBraceToken */);
|
|
}
|
|
else {
|
|
node.statements = createMissingList();
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
function parseModuleOrNamespaceDeclaration(fullStart, decorators, modifiers, flags) {
|
|
var node = createNode(215 /* ModuleDeclaration */, fullStart);
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
node.flags |= flags;
|
|
node.name = parseIdentifier();
|
|
node.body = parseOptional(20 /* DotToken */)
|
|
? parseModuleOrNamespaceDeclaration(getNodePos(), undefined, undefined, 1 /* Export */)
|
|
: parseModuleBlock();
|
|
return finishNode(node);
|
|
}
|
|
function parseAmbientExternalModuleDeclaration(fullStart, decorators, modifiers) {
|
|
var node = createNode(215 /* ModuleDeclaration */, fullStart);
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
node.name = parseLiteralNode(true);
|
|
node.body = parseModuleBlock();
|
|
return finishNode(node);
|
|
}
|
|
function parseModuleDeclaration(fullStart, decorators, modifiers) {
|
|
var flags = modifiers ? modifiers.flags : 0;
|
|
if (parseOptional(123 /* NamespaceKeyword */)) {
|
|
flags |= 131072 /* Namespace */;
|
|
}
|
|
else {
|
|
parseExpected(122 /* ModuleKeyword */);
|
|
if (token === 8 /* StringLiteral */) {
|
|
return parseAmbientExternalModuleDeclaration(fullStart, decorators, modifiers);
|
|
}
|
|
}
|
|
return parseModuleOrNamespaceDeclaration(fullStart, decorators, modifiers, flags);
|
|
}
|
|
function isExternalModuleReference() {
|
|
return token === 124 /* RequireKeyword */ &&
|
|
lookAhead(nextTokenIsOpenParen);
|
|
}
|
|
function nextTokenIsOpenParen() {
|
|
return nextToken() === 16 /* OpenParenToken */;
|
|
}
|
|
function nextTokenIsSlash() {
|
|
return nextToken() === 37 /* SlashToken */;
|
|
}
|
|
function nextTokenIsCommaOrFromKeyword() {
|
|
nextToken();
|
|
return token === 23 /* CommaToken */ ||
|
|
token === 130 /* FromKeyword */;
|
|
}
|
|
function parseImportDeclarationOrImportEqualsDeclaration(fullStart, decorators, modifiers) {
|
|
parseExpected(86 /* ImportKeyword */);
|
|
var afterImportPos = scanner.getStartPos();
|
|
var identifier;
|
|
if (isIdentifier()) {
|
|
identifier = parseIdentifier();
|
|
if (token !== 23 /* CommaToken */ && token !== 130 /* FromKeyword */) {
|
|
// ImportEquals declaration of type:
|
|
// import x = require("mod"); or
|
|
// import x = M.x;
|
|
var importEqualsDeclaration = createNode(218 /* ImportEqualsDeclaration */, fullStart);
|
|
importEqualsDeclaration.decorators = decorators;
|
|
setModifiers(importEqualsDeclaration, modifiers);
|
|
importEqualsDeclaration.name = identifier;
|
|
parseExpected(54 /* EqualsToken */);
|
|
importEqualsDeclaration.moduleReference = parseModuleReference();
|
|
parseSemicolon();
|
|
return finishNode(importEqualsDeclaration);
|
|
}
|
|
}
|
|
// Import statement
|
|
var importDeclaration = createNode(219 /* ImportDeclaration */, fullStart);
|
|
importDeclaration.decorators = decorators;
|
|
setModifiers(importDeclaration, modifiers);
|
|
// ImportDeclaration:
|
|
// import ImportClause from ModuleSpecifier ;
|
|
// import ModuleSpecifier;
|
|
if (identifier ||
|
|
token === 36 /* AsteriskToken */ ||
|
|
token === 14 /* OpenBraceToken */) {
|
|
importDeclaration.importClause = parseImportClause(identifier, afterImportPos);
|
|
parseExpected(130 /* FromKeyword */);
|
|
}
|
|
importDeclaration.moduleSpecifier = parseModuleSpecifier();
|
|
parseSemicolon();
|
|
return finishNode(importDeclaration);
|
|
}
|
|
function parseImportClause(identifier, fullStart) {
|
|
// ImportClause:
|
|
// ImportedDefaultBinding
|
|
// NameSpaceImport
|
|
// NamedImports
|
|
// ImportedDefaultBinding, NameSpaceImport
|
|
// ImportedDefaultBinding, NamedImports
|
|
var importClause = createNode(220 /* ImportClause */, fullStart);
|
|
if (identifier) {
|
|
// ImportedDefaultBinding:
|
|
// ImportedBinding
|
|
importClause.name = identifier;
|
|
}
|
|
// If there was no default import or if there is comma token after default import
|
|
// parse namespace or named imports
|
|
if (!importClause.name ||
|
|
parseOptional(23 /* CommaToken */)) {
|
|
importClause.namedBindings = token === 36 /* AsteriskToken */ ? parseNamespaceImport() : parseNamedImportsOrExports(222 /* NamedImports */);
|
|
}
|
|
return finishNode(importClause);
|
|
}
|
|
function parseModuleReference() {
|
|
return isExternalModuleReference()
|
|
? parseExternalModuleReference()
|
|
: parseEntityName(false);
|
|
}
|
|
function parseExternalModuleReference() {
|
|
var node = createNode(229 /* ExternalModuleReference */);
|
|
parseExpected(124 /* RequireKeyword */);
|
|
parseExpected(16 /* OpenParenToken */);
|
|
node.expression = parseModuleSpecifier();
|
|
parseExpected(17 /* CloseParenToken */);
|
|
return finishNode(node);
|
|
}
|
|
function parseModuleSpecifier() {
|
|
// 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
|
|
// walker.
|
|
var result = parseExpression();
|
|
// Ensure the string being required is in our 'identifier' table. This will ensure
|
|
// that features like 'find refs' will look inside this file when search for its name.
|
|
if (result.kind === 8 /* StringLiteral */) {
|
|
internIdentifier(result.text);
|
|
}
|
|
return result;
|
|
}
|
|
function parseNamespaceImport() {
|
|
// NameSpaceImport:
|
|
// * as ImportedBinding
|
|
var namespaceImport = createNode(221 /* NamespaceImport */);
|
|
parseExpected(36 /* AsteriskToken */);
|
|
parseExpected(113 /* AsKeyword */);
|
|
namespaceImport.name = parseIdentifier();
|
|
return finishNode(namespaceImport);
|
|
}
|
|
function parseNamedImportsOrExports(kind) {
|
|
var node = createNode(kind);
|
|
// NamedImports:
|
|
// { }
|
|
// { ImportsList }
|
|
// { ImportsList, }
|
|
// ImportsList:
|
|
// ImportSpecifier
|
|
// ImportsList, ImportSpecifier
|
|
node.elements = parseBracketedList(21 /* ImportOrExportSpecifiers */, kind === 222 /* NamedImports */ ? parseImportSpecifier : parseExportSpecifier, 14 /* OpenBraceToken */, 15 /* CloseBraceToken */);
|
|
return finishNode(node);
|
|
}
|
|
function parseExportSpecifier() {
|
|
return parseImportOrExportSpecifier(227 /* ExportSpecifier */);
|
|
}
|
|
function parseImportSpecifier() {
|
|
return parseImportOrExportSpecifier(223 /* ImportSpecifier */);
|
|
}
|
|
function parseImportOrExportSpecifier(kind) {
|
|
var node = createNode(kind);
|
|
// ImportSpecifier:
|
|
// BindingIdentifier
|
|
// IdentifierName as BindingIdentifier
|
|
// ExportSpecififer:
|
|
// IdentifierName
|
|
// IdentifierName as IdentifierName
|
|
var checkIdentifierIsKeyword = ts.isKeyword(token) && !isIdentifier();
|
|
var checkIdentifierStart = scanner.getTokenPos();
|
|
var checkIdentifierEnd = scanner.getTextPos();
|
|
var identifierName = parseIdentifierName();
|
|
if (token === 113 /* AsKeyword */) {
|
|
node.propertyName = identifierName;
|
|
parseExpected(113 /* AsKeyword */);
|
|
checkIdentifierIsKeyword = ts.isKeyword(token) && !isIdentifier();
|
|
checkIdentifierStart = scanner.getTokenPos();
|
|
checkIdentifierEnd = scanner.getTextPos();
|
|
node.name = parseIdentifierName();
|
|
}
|
|
else {
|
|
node.name = identifierName;
|
|
}
|
|
if (kind === 223 /* ImportSpecifier */ && checkIdentifierIsKeyword) {
|
|
// Report error identifier expected
|
|
parseErrorAtPosition(checkIdentifierStart, checkIdentifierEnd - checkIdentifierStart, ts.Diagnostics.Identifier_expected);
|
|
}
|
|
return finishNode(node);
|
|
}
|
|
function parseExportDeclaration(fullStart, decorators, modifiers) {
|
|
var node = createNode(225 /* ExportDeclaration */, fullStart);
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
if (parseOptional(36 /* AsteriskToken */)) {
|
|
parseExpected(130 /* FromKeyword */);
|
|
node.moduleSpecifier = parseModuleSpecifier();
|
|
}
|
|
else {
|
|
node.exportClause = parseNamedImportsOrExports(226 /* 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 === 130 /* FromKeyword */ || (token === 8 /* StringLiteral */ && !scanner.hasPrecedingLineBreak())) {
|
|
parseExpected(130 /* FromKeyword */);
|
|
node.moduleSpecifier = parseModuleSpecifier();
|
|
}
|
|
}
|
|
parseSemicolon();
|
|
return finishNode(node);
|
|
}
|
|
function parseExportAssignment(fullStart, decorators, modifiers) {
|
|
var node = createNode(224 /* ExportAssignment */, fullStart);
|
|
node.decorators = decorators;
|
|
setModifiers(node, modifiers);
|
|
if (parseOptional(54 /* EqualsToken */)) {
|
|
node.isExportEquals = true;
|
|
}
|
|
else {
|
|
parseExpected(74 /* DefaultKeyword */);
|
|
}
|
|
node.expression = parseAssignmentExpressionOrHigher();
|
|
parseSemicolon();
|
|
return finishNode(node);
|
|
}
|
|
function processReferenceComments(sourceFile) {
|
|
var triviaScanner = ts.createScanner(sourceFile.languageVersion, false, 0 /* Standard */, sourceText);
|
|
var referencedFiles = [];
|
|
var amdDependencies = [];
|
|
var amdModuleName;
|
|
// Keep scanning all the leading trivia in the file until we get to something that
|
|
// isn't trivia. Any single line comment will be analyzed to see if it is a
|
|
// reference comment.
|
|
while (true) {
|
|
var kind = triviaScanner.scan();
|
|
if (kind === 5 /* WhitespaceTrivia */ || kind === 4 /* NewLineTrivia */ || kind === 3 /* MultiLineCommentTrivia */) {
|
|
continue;
|
|
}
|
|
if (kind !== 2 /* SingleLineCommentTrivia */) {
|
|
break;
|
|
}
|
|
var range = { pos: triviaScanner.getTokenPos(), end: triviaScanner.getTextPos(), kind: triviaScanner.getToken() };
|
|
var comment = sourceText.substring(range.pos, range.end);
|
|
var referencePathMatchResult = ts.getFileReferenceFromReferencePath(comment, range);
|
|
if (referencePathMatchResult) {
|
|
var fileReference = referencePathMatchResult.fileReference;
|
|
sourceFile.hasNoDefaultLib = referencePathMatchResult.isNoDefaultLib;
|
|
var diagnosticMessage = referencePathMatchResult.diagnosticMessage;
|
|
if (fileReference) {
|
|
referencedFiles.push(fileReference);
|
|
}
|
|
if (diagnosticMessage) {
|
|
parseDiagnostics.push(ts.createFileDiagnostic(sourceFile, range.pos, range.end - range.pos, diagnosticMessage));
|
|
}
|
|
}
|
|
else {
|
|
var amdModuleNameRegEx = /^\/\/\/\s*<amd-module\s+name\s*=\s*('|")(.+?)\1/gim;
|
|
var amdModuleNameMatchResult = amdModuleNameRegEx.exec(comment);
|
|
if (amdModuleNameMatchResult) {
|
|
if (amdModuleName) {
|
|
parseDiagnostics.push(ts.createFileDiagnostic(sourceFile, range.pos, range.end - range.pos, ts.Diagnostics.An_AMD_module_cannot_have_multiple_name_assignments));
|
|
}
|
|
amdModuleName = amdModuleNameMatchResult[2];
|
|
}
|
|
var amdDependencyRegEx = /^\/\/\/\s*<amd-dependency\s/gim;
|
|
var pathRegex = /\spath\s*=\s*('|")(.+?)\1/gim;
|
|
var nameRegex = /\sname\s*=\s*('|")(.+?)\1/gim;
|
|
var amdDependencyMatchResult = amdDependencyRegEx.exec(comment);
|
|
if (amdDependencyMatchResult) {
|
|
var pathMatchResult = pathRegex.exec(comment);
|
|
var nameMatchResult = nameRegex.exec(comment);
|
|
if (pathMatchResult) {
|
|
var amdDependency = { path: pathMatchResult[2], name: nameMatchResult ? nameMatchResult[2] : undefined };
|
|
amdDependencies.push(amdDependency);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
sourceFile.referencedFiles = referencedFiles;
|
|
sourceFile.amdDependencies = amdDependencies;
|
|
sourceFile.moduleName = amdModuleName;
|
|
}
|
|
function setExternalModuleIndicator(sourceFile) {
|
|
sourceFile.externalModuleIndicator = ts.forEach(sourceFile.statements, function (node) {
|
|
return node.flags & 1 /* Export */
|
|
|| node.kind === 218 /* ImportEqualsDeclaration */ && node.moduleReference.kind === 229 /* ExternalModuleReference */
|
|
|| node.kind === 219 /* ImportDeclaration */
|
|
|| node.kind === 224 /* ExportAssignment */
|
|
|| node.kind === 225 /* ExportDeclaration */
|
|
? node
|
|
: undefined;
|
|
});
|
|
}
|
|
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["TypeParameters"] = 17] = "TypeParameters";
|
|
ParsingContext[ParsingContext["TypeArguments"] = 18] = "TypeArguments";
|
|
ParsingContext[ParsingContext["TupleElementTypes"] = 19] = "TupleElementTypes";
|
|
ParsingContext[ParsingContext["HeritageClauses"] = 20] = "HeritageClauses";
|
|
ParsingContext[ParsingContext["ImportOrExportSpecifiers"] = 21] = "ImportOrExportSpecifiers";
|
|
ParsingContext[ParsingContext["JSDocFunctionParameters"] = 22] = "JSDocFunctionParameters";
|
|
ParsingContext[ParsingContext["JSDocTypeArguments"] = 23] = "JSDocTypeArguments";
|
|
ParsingContext[ParsingContext["JSDocRecordMembers"] = 24] = "JSDocRecordMembers";
|
|
ParsingContext[ParsingContext["JSDocTupleTypes"] = 25] = "JSDocTupleTypes";
|
|
ParsingContext[ParsingContext["Count"] = 26] = "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 isJSDocType() {
|
|
switch (token) {
|
|
case 36 /* AsteriskToken */:
|
|
case 51 /* QuestionToken */:
|
|
case 16 /* OpenParenToken */:
|
|
case 18 /* OpenBracketToken */:
|
|
case 47 /* ExclamationToken */:
|
|
case 14 /* OpenBraceToken */:
|
|
case 84 /* FunctionKeyword */:
|
|
case 21 /* DotDotDotToken */:
|
|
case 89 /* NewKeyword */:
|
|
case 94 /* ThisKeyword */:
|
|
return true;
|
|
}
|
|
return isIdentifierOrKeyword();
|
|
}
|
|
JSDocParser.isJSDocType = isJSDocType;
|
|
function parseJSDocTypeExpressionForTests(content, start, length) {
|
|
initializeState("file.js", content, 2 /* Latest */, undefined);
|
|
var jsDocTypeExpression = parseJSDocTypeExpression(start, length);
|
|
var diagnostics = parseDiagnostics;
|
|
clearState();
|
|
return jsDocTypeExpression ? { jsDocTypeExpression: jsDocTypeExpression, diagnostics: diagnostics } : undefined;
|
|
}
|
|
JSDocParser.parseJSDocTypeExpressionForTests = parseJSDocTypeExpressionForTests;
|
|
// Parses out a JSDoc type expression. The starting position should be right at the open
|
|
// curly in the type expression. Returns 'undefined' if it encounters any errors while parsing.
|
|
/* @internal */
|
|
function parseJSDocTypeExpression(start, length) {
|
|
scanner.setText(sourceText, start, length);
|
|
// Prime the first token for us to start processing.
|
|
token = nextToken();
|
|
var result = createNode(246 /* JSDocTypeExpression */);
|
|
parseExpected(14 /* OpenBraceToken */);
|
|
result.type = parseJSDocTopLevelType();
|
|
parseExpected(15 /* CloseBraceToken */);
|
|
fixupParentReferences(result);
|
|
return finishNode(result);
|
|
}
|
|
JSDocParser.parseJSDocTypeExpression = parseJSDocTypeExpression;
|
|
function parseJSDocTopLevelType() {
|
|
var type = parseJSDocType();
|
|
if (token === 45 /* BarToken */) {
|
|
var unionType = createNode(250 /* JSDocUnionType */, type.pos);
|
|
unionType.types = parseJSDocTypeList(type);
|
|
type = finishNode(unionType);
|
|
}
|
|
if (token === 54 /* EqualsToken */) {
|
|
var optionalType = createNode(257 /* JSDocOptionalType */, type.pos);
|
|
nextToken();
|
|
optionalType.type = type;
|
|
type = finishNode(optionalType);
|
|
}
|
|
return type;
|
|
}
|
|
function parseJSDocType() {
|
|
var type = parseBasicTypeExpression();
|
|
while (true) {
|
|
if (token === 18 /* OpenBracketToken */) {
|
|
var arrayType = createNode(249 /* JSDocArrayType */, type.pos);
|
|
arrayType.elementType = type;
|
|
nextToken();
|
|
parseExpected(19 /* CloseBracketToken */);
|
|
type = finishNode(arrayType);
|
|
}
|
|
else if (token === 51 /* QuestionToken */) {
|
|
var nullableType = createNode(252 /* JSDocNullableType */, type.pos);
|
|
nullableType.type = type;
|
|
nextToken();
|
|
type = finishNode(nullableType);
|
|
}
|
|
else if (token === 47 /* ExclamationToken */) {
|
|
var nonNullableType = createNode(253 /* JSDocNonNullableType */, type.pos);
|
|
nonNullableType.type = type;
|
|
nextToken();
|
|
type = finishNode(nonNullableType);
|
|
}
|
|
else {
|
|
break;
|
|
}
|
|
}
|
|
return type;
|
|
}
|
|
function parseBasicTypeExpression() {
|
|
switch (token) {
|
|
case 36 /* AsteriskToken */:
|
|
return parseJSDocAllType();
|
|
case 51 /* QuestionToken */:
|
|
return parseJSDocUnknownOrNullableType();
|
|
case 16 /* OpenParenToken */:
|
|
return parseJSDocUnionType();
|
|
case 18 /* OpenBracketToken */:
|
|
return parseJSDocTupleType();
|
|
case 47 /* ExclamationToken */:
|
|
return parseJSDocNonNullableType();
|
|
case 14 /* OpenBraceToken */:
|
|
return parseJSDocRecordType();
|
|
case 84 /* FunctionKeyword */:
|
|
return parseJSDocFunctionType();
|
|
case 21 /* DotDotDotToken */:
|
|
return parseJSDocVariadicType();
|
|
case 89 /* NewKeyword */:
|
|
return parseJSDocConstructorType();
|
|
case 94 /* ThisKeyword */:
|
|
return parseJSDocThisType();
|
|
case 114 /* AnyKeyword */:
|
|
case 127 /* StringKeyword */:
|
|
case 125 /* NumberKeyword */:
|
|
case 117 /* BooleanKeyword */:
|
|
case 128 /* SymbolKeyword */:
|
|
case 100 /* VoidKeyword */:
|
|
return parseTokenNode();
|
|
}
|
|
return parseJSDocTypeReference();
|
|
}
|
|
function parseJSDocThisType() {
|
|
var result = createNode(261 /* JSDocThisType */);
|
|
nextToken();
|
|
parseExpected(52 /* ColonToken */);
|
|
result.type = parseJSDocType();
|
|
return finishNode(result);
|
|
}
|
|
function parseJSDocConstructorType() {
|
|
var result = createNode(260 /* JSDocConstructorType */);
|
|
nextToken();
|
|
parseExpected(52 /* ColonToken */);
|
|
result.type = parseJSDocType();
|
|
return finishNode(result);
|
|
}
|
|
function parseJSDocVariadicType() {
|
|
var result = createNode(259 /* JSDocVariadicType */);
|
|
nextToken();
|
|
result.type = parseJSDocType();
|
|
return finishNode(result);
|
|
}
|
|
function parseJSDocFunctionType() {
|
|
var result = createNode(258 /* JSDocFunctionType */);
|
|
nextToken();
|
|
parseExpected(16 /* OpenParenToken */);
|
|
result.parameters = parseDelimitedList(22 /* JSDocFunctionParameters */, parseJSDocParameter);
|
|
checkForTrailingComma(result.parameters);
|
|
parseExpected(17 /* CloseParenToken */);
|
|
if (token === 52 /* ColonToken */) {
|
|
nextToken();
|
|
result.type = parseJSDocType();
|
|
}
|
|
return finishNode(result);
|
|
}
|
|
function parseJSDocParameter() {
|
|
var parameter = createNode(135 /* Parameter */);
|
|
parameter.type = parseJSDocType();
|
|
return finishNode(parameter);
|
|
}
|
|
function parseJSDocOptionalType(type) {
|
|
var result = createNode(257 /* JSDocOptionalType */, type.pos);
|
|
nextToken();
|
|
result.type = type;
|
|
return finishNode(result);
|
|
}
|
|
function parseJSDocTypeReference() {
|
|
var result = createNode(256 /* JSDocTypeReference */);
|
|
result.name = parseSimplePropertyName();
|
|
while (parseOptional(20 /* DotToken */)) {
|
|
if (token === 24 /* LessThanToken */) {
|
|
result.typeArguments = parseTypeArguments();
|
|
break;
|
|
}
|
|
else {
|
|
result.name = parseQualifiedName(result.name);
|
|
}
|
|
}
|
|
return finishNode(result);
|
|
}
|
|
function parseTypeArguments() {
|
|
// Move past the <
|
|
nextToken();
|
|
var typeArguments = parseDelimitedList(23 /* JSDocTypeArguments */, parseJSDocType);
|
|
checkForTrailingComma(typeArguments);
|
|
checkForEmptyTypeArgumentList(typeArguments);
|
|
parseExpected(26 /* GreaterThanToken */);
|
|
return typeArguments;
|
|
}
|
|
function checkForEmptyTypeArgumentList(typeArguments) {
|
|
if (parseDiagnostics.length === 0 && typeArguments && typeArguments.length === 0) {
|
|
var start = typeArguments.pos - "<".length;
|
|
var end = ts.skipTrivia(sourceText, typeArguments.end) + ">".length;
|
|
return parseErrorAtPosition(start, end - start, ts.Diagnostics.Type_argument_list_cannot_be_empty);
|
|
}
|
|
}
|
|
function parseQualifiedName(left) {
|
|
var result = createNode(132 /* QualifiedName */, left.pos);
|
|
result.left = left;
|
|
result.right = parseIdentifierName();
|
|
return finishNode(result);
|
|
}
|
|
function parseJSDocRecordType() {
|
|
var result = createNode(254 /* JSDocRecordType */);
|
|
nextToken();
|
|
result.members = parseDelimitedList(24 /* JSDocRecordMembers */, parseJSDocRecordMember);
|
|
checkForTrailingComma(result.members);
|
|
parseExpected(15 /* CloseBraceToken */);
|
|
return finishNode(result);
|
|
}
|
|
function parseJSDocRecordMember() {
|
|
var result = createNode(255 /* JSDocRecordMember */);
|
|
result.name = parseSimplePropertyName();
|
|
if (token === 52 /* ColonToken */) {
|
|
nextToken();
|
|
result.type = parseJSDocType();
|
|
}
|
|
return finishNode(result);
|
|
}
|
|
function parseJSDocNonNullableType() {
|
|
var result = createNode(253 /* JSDocNonNullableType */);
|
|
nextToken();
|
|
result.type = parseJSDocType();
|
|
return finishNode(result);
|
|
}
|
|
function parseJSDocTupleType() {
|
|
var result = createNode(251 /* JSDocTupleType */);
|
|
nextToken();
|
|
result.types = parseDelimitedList(25 /* JSDocTupleTypes */, parseJSDocType);
|
|
checkForTrailingComma(result.types);
|
|
parseExpected(19 /* CloseBracketToken */);
|
|
return finishNode(result);
|
|
}
|
|
function checkForTrailingComma(list) {
|
|
if (parseDiagnostics.length === 0 && list.hasTrailingComma) {
|
|
var start = list.end - ",".length;
|
|
parseErrorAtPosition(start, ",".length, ts.Diagnostics.Trailing_comma_not_allowed);
|
|
}
|
|
}
|
|
function parseJSDocUnionType() {
|
|
var result = createNode(250 /* JSDocUnionType */);
|
|
nextToken();
|
|
result.types = parseJSDocTypeList(parseJSDocType());
|
|
parseExpected(17 /* CloseParenToken */);
|
|
return finishNode(result);
|
|
}
|
|
function parseJSDocTypeList(firstType) {
|
|
ts.Debug.assert(!!firstType);
|
|
var types = [];
|
|
types.pos = firstType.pos;
|
|
types.push(firstType);
|
|
while (parseOptional(45 /* BarToken */)) {
|
|
types.push(parseJSDocType());
|
|
}
|
|
types.end = scanner.getStartPos();
|
|
return types;
|
|
}
|
|
function parseJSDocAllType() {
|
|
var result = createNode(247 /* JSDocAllType */);
|
|
nextToken();
|
|
return finishNode(result);
|
|
}
|
|
function parseJSDocUnknownOrNullableType() {
|
|
var pos = scanner.getStartPos();
|
|
// 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 === 23 /* CommaToken */ ||
|
|
token === 15 /* CloseBraceToken */ ||
|
|
token === 17 /* CloseParenToken */ ||
|
|
token === 26 /* GreaterThanToken */ ||
|
|
token === 54 /* EqualsToken */ ||
|
|
token === 45 /* BarToken */) {
|
|
var result = createNode(248 /* JSDocUnknownType */, pos);
|
|
return finishNode(result);
|
|
}
|
|
else {
|
|
var result = createNode(252 /* JSDocNullableType */, pos);
|
|
result.type = parseJSDocType();
|
|
return finishNode(result);
|
|
}
|
|
}
|
|
function parseIsolatedJSDocComment(content, start, length) {
|
|
initializeState("file.js", content, 2 /* Latest */, undefined);
|
|
var jsDocComment = parseJSDocComment(undefined, start, length);
|
|
var diagnostics = parseDiagnostics;
|
|
clearState();
|
|
return jsDocComment ? { jsDocComment: jsDocComment, diagnostics: diagnostics } : undefined;
|
|
}
|
|
JSDocParser.parseIsolatedJSDocComment = parseIsolatedJSDocComment;
|
|
function parseJSDocComment(parent, start, length) {
|
|
var comment = parseJSDocCommentWorker(start, length);
|
|
if (comment) {
|
|
fixupParentReferences(comment);
|
|
comment.parent = parent;
|
|
}
|
|
return comment;
|
|
}
|
|
JSDocParser.parseJSDocComment = parseJSDocComment;
|
|
function parseJSDocCommentWorker(start, length) {
|
|
var content = sourceText;
|
|
start = start || 0;
|
|
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);
|
|
var tags;
|
|
var pos;
|
|
// NOTE(cyrusn): This is essentially a handwritten scanner for JSDocComments. I
|
|
// considered using an actual Scanner, but this would complicate things. The
|
|
// scanner would need to know it was in a Doc Comment. Otherwise, it would then
|
|
// produce comments *inside* the doc comment. In the end it was just easier to
|
|
// write a simple scanner rather than go that route.
|
|
if (length >= "/** */".length) {
|
|
if (content.charCodeAt(start) === 47 /* slash */ &&
|
|
content.charCodeAt(start + 1) === 42 /* asterisk */ &&
|
|
content.charCodeAt(start + 2) === 42 /* asterisk */ &&
|
|
content.charCodeAt(start + 3) !== 42 /* asterisk */) {
|
|
// Initially we can parse out a tag. We also have seen a starting asterisk.
|
|
// This is so that /** * @type */ doesn't parse.
|
|
var canParseTag = true;
|
|
var seenAsterisk = true;
|
|
for (pos = start + "/**".length; pos < end;) {
|
|
var ch = content.charCodeAt(pos);
|
|
pos++;
|
|
if (ch === 64 /* at */ && canParseTag) {
|
|
parseTag();
|
|
// Once we parse out a tag, we cannot keep parsing out tags on this line.
|
|
canParseTag = false;
|
|
continue;
|
|
}
|
|
if (ts.isLineBreak(ch)) {
|
|
// After a line break, we can parse a tag, and we haven't seen as asterisk
|
|
// on the next line yet.
|
|
canParseTag = true;
|
|
seenAsterisk = false;
|
|
continue;
|
|
}
|
|
if (ts.isWhiteSpace(ch)) {
|
|
// Whitespace doesn't affect any of our parsing.
|
|
continue;
|
|
}
|
|
// Ignore the first asterisk on a line.
|
|
if (ch === 42 /* asterisk */) {
|
|
if (seenAsterisk) {
|
|
// If we've already seen an asterisk, then we can no longer parse a tag
|
|
// on this line.
|
|
canParseTag = false;
|
|
}
|
|
seenAsterisk = true;
|
|
continue;
|
|
}
|
|
// Anything else is doc comment text. We can't do anything with it. Because it
|
|
// wasn't a tag, we can no longer parse a tag on this line until we hit the next
|
|
// line break.
|
|
canParseTag = false;
|
|
}
|
|
}
|
|
}
|
|
return createJSDocComment();
|
|
function createJSDocComment() {
|
|
if (!tags) {
|
|
return undefined;
|
|
}
|
|
var result = createNode(262 /* JSDocComment */, start);
|
|
result.tags = tags;
|
|
return finishNode(result, end);
|
|
}
|
|
function skipWhitespace() {
|
|
while (pos < end && ts.isWhiteSpace(content.charCodeAt(pos))) {
|
|
pos++;
|
|
}
|
|
}
|
|
function parseTag() {
|
|
ts.Debug.assert(content.charCodeAt(pos - 1) === 64 /* at */);
|
|
var atToken = createNode(53 /* AtToken */, pos - 1);
|
|
atToken.end = pos;
|
|
var tagName = scanIdentifier();
|
|
if (!tagName) {
|
|
return;
|
|
}
|
|
var tag = handleTag(atToken, tagName) || handleUnknownTag(atToken, tagName);
|
|
addTag(tag);
|
|
}
|
|
function handleTag(atToken, tagName) {
|
|
if (tagName) {
|
|
switch (tagName.text) {
|
|
case "param":
|
|
return handleParamTag(atToken, tagName);
|
|
case "return":
|
|
case "returns":
|
|
return handleReturnTag(atToken, tagName);
|
|
case "template":
|
|
return handleTemplateTag(atToken, tagName);
|
|
case "type":
|
|
return handleTypeTag(atToken, tagName);
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function handleUnknownTag(atToken, tagName) {
|
|
var result = createNode(263 /* JSDocTag */, atToken.pos);
|
|
result.atToken = atToken;
|
|
result.tagName = tagName;
|
|
return finishNode(result, pos);
|
|
}
|
|
function addTag(tag) {
|
|
if (tag) {
|
|
if (!tags) {
|
|
tags = [];
|
|
tags.pos = tag.pos;
|
|
}
|
|
tags.push(tag);
|
|
tags.end = tag.end;
|
|
}
|
|
}
|
|
function tryParseTypeExpression() {
|
|
skipWhitespace();
|
|
if (content.charCodeAt(pos) !== 123 /* openBrace */) {
|
|
return undefined;
|
|
}
|
|
var typeExpression = parseJSDocTypeExpression(pos, end - pos);
|
|
pos = typeExpression.end;
|
|
return typeExpression;
|
|
}
|
|
function handleParamTag(atToken, tagName) {
|
|
var typeExpression = tryParseTypeExpression();
|
|
skipWhitespace();
|
|
var name;
|
|
var isBracketed;
|
|
if (content.charCodeAt(pos) === 91 /* openBracket */) {
|
|
pos++;
|
|
skipWhitespace();
|
|
name = scanIdentifier();
|
|
isBracketed = true;
|
|
}
|
|
else {
|
|
name = scanIdentifier();
|
|
}
|
|
if (!name) {
|
|
parseErrorAtPosition(pos, 0, ts.Diagnostics.Identifier_expected);
|
|
return undefined;
|
|
}
|
|
var preName, postName;
|
|
if (typeExpression) {
|
|
postName = name;
|
|
}
|
|
else {
|
|
preName = name;
|
|
}
|
|
if (!typeExpression) {
|
|
typeExpression = tryParseTypeExpression();
|
|
}
|
|
var result = createNode(264 /* JSDocParameterTag */, atToken.pos);
|
|
result.atToken = atToken;
|
|
result.tagName = tagName;
|
|
result.preParameterName = preName;
|
|
result.typeExpression = typeExpression;
|
|
result.postParameterName = postName;
|
|
result.isBracketed = isBracketed;
|
|
return finishNode(result, pos);
|
|
}
|
|
function handleReturnTag(atToken, tagName) {
|
|
if (ts.forEach(tags, function (t) { return t.kind === 265 /* JSDocReturnTag */; })) {
|
|
parseErrorAtPosition(tagName.pos, pos - tagName.pos, ts.Diagnostics._0_tag_already_specified, tagName.text);
|
|
}
|
|
var result = createNode(265 /* JSDocReturnTag */, atToken.pos);
|
|
result.atToken = atToken;
|
|
result.tagName = tagName;
|
|
result.typeExpression = tryParseTypeExpression();
|
|
return finishNode(result, pos);
|
|
}
|
|
function handleTypeTag(atToken, tagName) {
|
|
if (ts.forEach(tags, function (t) { return t.kind === 266 /* JSDocTypeTag */; })) {
|
|
parseErrorAtPosition(tagName.pos, pos - tagName.pos, ts.Diagnostics._0_tag_already_specified, tagName.text);
|
|
}
|
|
var result = createNode(266 /* JSDocTypeTag */, atToken.pos);
|
|
result.atToken = atToken;
|
|
result.tagName = tagName;
|
|
result.typeExpression = tryParseTypeExpression();
|
|
return finishNode(result, pos);
|
|
}
|
|
function handleTemplateTag(atToken, tagName) {
|
|
if (ts.forEach(tags, function (t) { return t.kind === 267 /* JSDocTemplateTag */; })) {
|
|
parseErrorAtPosition(tagName.pos, pos - tagName.pos, ts.Diagnostics._0_tag_already_specified, tagName.text);
|
|
}
|
|
var typeParameters = [];
|
|
typeParameters.pos = pos;
|
|
while (true) {
|
|
skipWhitespace();
|
|
var startPos = pos;
|
|
var name_8 = scanIdentifier();
|
|
if (!name_8) {
|
|
parseErrorAtPosition(startPos, 0, ts.Diagnostics.Identifier_expected);
|
|
return undefined;
|
|
}
|
|
var typeParameter = createNode(134 /* TypeParameter */, name_8.pos);
|
|
typeParameter.name = name_8;
|
|
finishNode(typeParameter, pos);
|
|
typeParameters.push(typeParameter);
|
|
skipWhitespace();
|
|
if (content.charCodeAt(pos) !== 44 /* comma */) {
|
|
break;
|
|
}
|
|
pos++;
|
|
}
|
|
typeParameters.end = pos;
|
|
var result = createNode(267 /* JSDocTemplateTag */, atToken.pos);
|
|
result.atToken = atToken;
|
|
result.tagName = tagName;
|
|
result.typeParameters = typeParameters;
|
|
return finishNode(result, pos);
|
|
}
|
|
function scanIdentifier() {
|
|
var startPos = pos;
|
|
for (; pos < end; pos++) {
|
|
var ch = content.charCodeAt(pos);
|
|
if (pos === startPos && ts.isIdentifierStart(ch, 2 /* Latest */)) {
|
|
continue;
|
|
}
|
|
else if (pos > startPos && ts.isIdentifierPart(ch, 2 /* Latest */)) {
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
if (startPos === pos) {
|
|
return undefined;
|
|
}
|
|
var result = createNode(66 /* Identifier */, startPos);
|
|
result.text = content.substring(startPos, pos);
|
|
return finishNode(result, pos);
|
|
}
|
|
}
|
|
JSDocParser.parseJSDocCommentWorker = parseJSDocCommentWorker;
|
|
})(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, undefined, true);
|
|
}
|
|
// 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 unusbale 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;
|
|
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, true);
|
|
return result;
|
|
}
|
|
IncrementalParser.updateSourceFile = updateSourceFile;
|
|
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;
|
|
}
|
|
if (node.jsDocComment) {
|
|
node.jsDocComment = undefined;
|
|
}
|
|
node.pos += delta;
|
|
node.end += delta;
|
|
if (aggressiveChecks && shouldCheckNode(node)) {
|
|
ts.Debug.assert(text === newText.substring(node.pos, node.end));
|
|
}
|
|
forEachChild(node, visitNode, visitArray);
|
|
checkNodePositions(node, aggressiveChecks);
|
|
}
|
|
function visitArray(array) {
|
|
array._children = undefined;
|
|
array.pos += delta;
|
|
array.end += delta;
|
|
for (var _i = 0; _i < array.length; _i++) {
|
|
var node = array[_i];
|
|
visitNode(node);
|
|
}
|
|
}
|
|
}
|
|
function shouldCheckNode(node) {
|
|
switch (node.kind) {
|
|
case 8 /* StringLiteral */:
|
|
case 7 /* NumericLiteral */:
|
|
case 66 /* 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
|
|
// chlidren 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 htat 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.
|
|
element.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 htat 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.
|
|
if (element.end >= changeRangeOldEnd) {
|
|
// Element ends after the change range. Always adjust the end pos.
|
|
element.end += delta;
|
|
}
|
|
else {
|
|
// 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.
|
|
element.end = Math.min(element.end, changeRangeNewEnd);
|
|
}
|
|
ts.Debug.assert(element.pos <= element.end);
|
|
if (element.parent) {
|
|
ts.Debug.assert(element.pos >= element.parent.pos);
|
|
ts.Debug.assert(element.end <= element.parent.end);
|
|
}
|
|
}
|
|
function checkNodePositions(node, aggressiveChecks) {
|
|
if (aggressiveChecks) {
|
|
var pos = node.pos;
|
|
forEachChild(node, function (child) {
|
|
ts.Debug.assert(child.pos >= pos);
|
|
pos = child.end;
|
|
});
|
|
ts.Debug.assert(pos <= 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, 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);
|
|
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, 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; _i < array.length; _i++) {
|
|
var node = array[_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 = getLastChild(lastNodeEntirelyBeforePosition);
|
|
if (lastChildOfLastEntireNodeBeforePosition.pos > bestResult.pos) {
|
|
bestResult = lastChildOfLastEntireNodeBeforePosition;
|
|
}
|
|
}
|
|
return bestResult;
|
|
function getLastChild(node) {
|
|
while (true) {
|
|
var lastChild = getLastChildWorker(node);
|
|
if (lastChild) {
|
|
node = lastChild;
|
|
}
|
|
else {
|
|
return node;
|
|
}
|
|
}
|
|
}
|
|
function getLastChildWorker(node) {
|
|
var last = undefined;
|
|
forEachChild(node, function (child) {
|
|
if (ts.nodeIsPresent(child)) {
|
|
last = child;
|
|
}
|
|
});
|
|
return last;
|
|
}
|
|
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 procede any futher 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, n = array.length; i < n; 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;
|
|
}
|
|
}
|
|
}
|
|
var InvalidPosition;
|
|
(function (InvalidPosition) {
|
|
InvalidPosition[InvalidPosition["Value"] = -1] = "Value";
|
|
})(InvalidPosition || (InvalidPosition = {}));
|
|
})(IncrementalParser || (IncrementalParser = {}));
|
|
})(ts || (ts = {}));
|
|
/// <reference path="binder.ts"/>
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var nextSymbolId = 1;
|
|
var nextNodeId = 1;
|
|
var nextMergeId = 1;
|
|
function getNodeId(node) {
|
|
if (!node.id)
|
|
node.id = nextNodeId++;
|
|
return node.id;
|
|
}
|
|
ts.getNodeId = getNodeId;
|
|
ts.checkTime = 0;
|
|
function getSymbolId(symbol) {
|
|
if (!symbol.id) {
|
|
symbol.id = nextSymbolId++;
|
|
}
|
|
return symbol.id;
|
|
}
|
|
ts.getSymbolId = getSymbolId;
|
|
function createTypeChecker(host, produceDiagnostics) {
|
|
// 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 Symbol = ts.objectAllocator.getSymbolConstructor();
|
|
var Type = ts.objectAllocator.getTypeConstructor();
|
|
var Signature = ts.objectAllocator.getSignatureConstructor();
|
|
var typeCount = 0;
|
|
var emptyArray = [];
|
|
var emptySymbols = {};
|
|
var compilerOptions = host.getCompilerOptions();
|
|
var languageVersion = compilerOptions.target || 0 /* ES3 */;
|
|
var emitResolver = createResolver();
|
|
var undefinedSymbol = createSymbol(4 /* Property */ | 67108864 /* Transient */, "undefined");
|
|
var argumentsSymbol = createSymbol(4 /* Property */ | 67108864 /* Transient */, "arguments");
|
|
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"); },
|
|
getTypeCount: function () { return typeCount; },
|
|
isUndefinedSymbol: function (symbol) { return symbol === undefinedSymbol; },
|
|
isArgumentsSymbol: function (symbol) { return symbol === argumentsSymbol; },
|
|
getDiagnostics: getDiagnostics,
|
|
getGlobalDiagnostics: getGlobalDiagnostics,
|
|
getTypeOfSymbolAtLocation: getTypeOfSymbolAtLocation,
|
|
getDeclaredTypeOfSymbol: getDeclaredTypeOfSymbol,
|
|
getPropertiesOfType: getPropertiesOfType,
|
|
getPropertyOfType: getPropertyOfType,
|
|
getSignaturesOfType: getSignaturesOfType,
|
|
getIndexTypeOfType: getIndexTypeOfType,
|
|
getReturnTypeOfSignature: getReturnTypeOfSignature,
|
|
getSymbolsInScope: getSymbolsInScope,
|
|
getSymbolAtLocation: getSymbolAtLocation,
|
|
getShorthandAssignmentValueSymbol: getShorthandAssignmentValueSymbol,
|
|
getTypeAtLocation: getTypeAtLocation,
|
|
typeToString: typeToString,
|
|
getSymbolDisplayBuilder: getSymbolDisplayBuilder,
|
|
symbolToString: symbolToString,
|
|
getAugmentedPropertiesOfType: getAugmentedPropertiesOfType,
|
|
getRootSymbols: getRootSymbols,
|
|
getContextualType: getContextualType,
|
|
getFullyQualifiedName: getFullyQualifiedName,
|
|
getResolvedSignature: getResolvedSignature,
|
|
getConstantValue: getConstantValue,
|
|
isValidPropertyAccess: isValidPropertyAccess,
|
|
getSignatureFromDeclaration: getSignatureFromDeclaration,
|
|
isImplementationOfOverload: isImplementationOfOverload,
|
|
getAliasedSymbol: resolveAlias,
|
|
getEmitResolver: getEmitResolver,
|
|
getExportsOfModule: getExportsOfModuleAsArray,
|
|
getJsxElementAttributesType: getJsxElementAttributesType,
|
|
getJsxIntrinsicTagNames: getJsxIntrinsicTagNames
|
|
};
|
|
var unknownSymbol = createSymbol(4 /* Property */ | 67108864 /* Transient */, "unknown");
|
|
var resolvingSymbol = createSymbol(67108864 /* Transient */, "__resolving__");
|
|
var anyType = createIntrinsicType(1 /* Any */, "any");
|
|
var stringType = createIntrinsicType(2 /* String */, "string");
|
|
var numberType = createIntrinsicType(4 /* Number */, "number");
|
|
var booleanType = createIntrinsicType(8 /* Boolean */, "boolean");
|
|
var esSymbolType = createIntrinsicType(4194304 /* ESSymbol */, "symbol");
|
|
var voidType = createIntrinsicType(16 /* Void */, "void");
|
|
var undefinedType = createIntrinsicType(32 /* Undefined */ | 1048576 /* ContainsUndefinedOrNull */, "undefined");
|
|
var nullType = createIntrinsicType(64 /* Null */ | 1048576 /* ContainsUndefinedOrNull */, "null");
|
|
var unknownType = createIntrinsicType(1 /* Any */, "unknown");
|
|
var circularType = createIntrinsicType(1 /* Any */, "__circular__");
|
|
var emptyObjectType = createAnonymousType(undefined, emptySymbols, emptyArray, emptyArray, undefined, undefined);
|
|
var emptyGenericType = createAnonymousType(undefined, emptySymbols, emptyArray, emptyArray, undefined, undefined);
|
|
emptyGenericType.instantiations = {};
|
|
var anyFunctionType = createAnonymousType(undefined, emptySymbols, emptyArray, emptyArray, undefined, undefined);
|
|
var noConstraintType = createAnonymousType(undefined, emptySymbols, emptyArray, emptyArray, undefined, undefined);
|
|
var anySignature = createSignature(undefined, undefined, emptyArray, anyType, undefined, 0, false, false);
|
|
var unknownSignature = createSignature(undefined, undefined, emptyArray, unknownType, undefined, 0, false, false);
|
|
var globals = {};
|
|
var globalESSymbolConstructorSymbol;
|
|
var getGlobalPromiseConstructorSymbol;
|
|
var globalObjectType;
|
|
var globalFunctionType;
|
|
var globalArrayType;
|
|
var globalStringType;
|
|
var globalNumberType;
|
|
var globalBooleanType;
|
|
var globalRegExpType;
|
|
var globalTemplateStringsArrayType;
|
|
var globalESSymbolType;
|
|
var jsxElementType;
|
|
/** Lazily loaded, use getJsxIntrinsicElementType() */
|
|
var jsxIntrinsicElementsType;
|
|
var globalIterableType;
|
|
var globalIteratorType;
|
|
var globalIterableIteratorType;
|
|
var anyArrayType;
|
|
var getGlobalClassDecoratorType;
|
|
var getGlobalParameterDecoratorType;
|
|
var getGlobalPropertyDecoratorType;
|
|
var getGlobalMethodDecoratorType;
|
|
var getGlobalTypedPropertyDescriptorType;
|
|
var getGlobalPromiseType;
|
|
var tryGetGlobalPromiseType;
|
|
var getGlobalPromiseLikeType;
|
|
var getInstantiatedGlobalPromiseLikeType;
|
|
var getGlobalPromiseConstructorLikeType;
|
|
var getGlobalThenableType;
|
|
var tupleTypes = {};
|
|
var unionTypes = {};
|
|
var intersectionTypes = {};
|
|
var stringLiteralTypes = {};
|
|
var emitExtends = false;
|
|
var emitDecorate = false;
|
|
var emitParam = false;
|
|
var emitAwaiter = false;
|
|
var emitGenerator = false;
|
|
var resolutionTargets = [];
|
|
var resolutionResults = [];
|
|
var mergedSymbols = [];
|
|
var symbolLinks = [];
|
|
var nodeLinks = [];
|
|
var potentialThisCollisions = [];
|
|
var awaitedTypeStack = [];
|
|
var diagnostics = ts.createDiagnosticCollection();
|
|
var primitiveTypeInfo = {
|
|
"string": {
|
|
type: stringType,
|
|
flags: 258 /* StringLike */
|
|
},
|
|
"number": {
|
|
type: numberType,
|
|
flags: 132 /* NumberLike */
|
|
},
|
|
"boolean": {
|
|
type: booleanType,
|
|
flags: 8 /* Boolean */
|
|
},
|
|
"symbol": {
|
|
type: esSymbolType,
|
|
flags: 4194304 /* ESSymbol */
|
|
}
|
|
};
|
|
var JsxNames = {
|
|
JSX: "JSX",
|
|
IntrinsicElements: "IntrinsicElements",
|
|
ElementClass: "ElementClass",
|
|
ElementAttributesPropertyNameContainer: "ElementAttributesProperty",
|
|
Element: "Element"
|
|
};
|
|
var subtypeRelation = {};
|
|
var assignableRelation = {};
|
|
var identityRelation = {};
|
|
initializeTypeChecker();
|
|
return checker;
|
|
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 error(location, message, arg0, arg1, arg2) {
|
|
var diagnostic = location
|
|
? ts.createDiagnosticForNode(location, message, arg0, arg1, arg2)
|
|
: ts.createCompilerDiagnostic(message, arg0, arg1, arg2);
|
|
diagnostics.add(diagnostic);
|
|
}
|
|
function createSymbol(flags, name) {
|
|
return new Symbol(flags, name);
|
|
}
|
|
function getExcludedSymbolFlags(flags) {
|
|
var result = 0;
|
|
if (flags & 2 /* BlockScopedVariable */)
|
|
result |= 107455 /* BlockScopedVariableExcludes */;
|
|
if (flags & 1 /* FunctionScopedVariable */)
|
|
result |= 107454 /* FunctionScopedVariableExcludes */;
|
|
if (flags & 4 /* Property */)
|
|
result |= 107455 /* PropertyExcludes */;
|
|
if (flags & 8 /* EnumMember */)
|
|
result |= 107455 /* EnumMemberExcludes */;
|
|
if (flags & 16 /* Function */)
|
|
result |= 106927 /* FunctionExcludes */;
|
|
if (flags & 32 /* Class */)
|
|
result |= 899519 /* ClassExcludes */;
|
|
if (flags & 64 /* Interface */)
|
|
result |= 792960 /* InterfaceExcludes */;
|
|
if (flags & 256 /* RegularEnum */)
|
|
result |= 899327 /* RegularEnumExcludes */;
|
|
if (flags & 128 /* ConstEnum */)
|
|
result |= 899967 /* ConstEnumExcludes */;
|
|
if (flags & 512 /* ValueModule */)
|
|
result |= 106639 /* ValueModuleExcludes */;
|
|
if (flags & 8192 /* Method */)
|
|
result |= 99263 /* MethodExcludes */;
|
|
if (flags & 32768 /* GetAccessor */)
|
|
result |= 41919 /* GetAccessorExcludes */;
|
|
if (flags & 65536 /* SetAccessor */)
|
|
result |= 74687 /* SetAccessorExcludes */;
|
|
if (flags & 262144 /* TypeParameter */)
|
|
result |= 530912 /* TypeParameterExcludes */;
|
|
if (flags & 524288 /* TypeAlias */)
|
|
result |= 793056 /* TypeAliasExcludes */;
|
|
if (flags & 8388608 /* Alias */)
|
|
result |= 8388608 /* AliasExcludes */;
|
|
return result;
|
|
}
|
|
function recordMergedSymbol(target, source) {
|
|
if (!source.mergeId)
|
|
source.mergeId = nextMergeId++;
|
|
mergedSymbols[source.mergeId] = target;
|
|
}
|
|
function cloneSymbol(symbol) {
|
|
var result = createSymbol(symbol.flags | 33554432 /* Merged */, symbol.name);
|
|
result.declarations = symbol.declarations.slice(0);
|
|
result.parent = symbol.parent;
|
|
if (symbol.valueDeclaration)
|
|
result.valueDeclaration = symbol.valueDeclaration;
|
|
if (symbol.constEnumOnlyModule)
|
|
result.constEnumOnlyModule = true;
|
|
if (symbol.members)
|
|
result.members = cloneSymbolTable(symbol.members);
|
|
if (symbol.exports)
|
|
result.exports = cloneSymbolTable(symbol.exports);
|
|
recordMergedSymbol(result, symbol);
|
|
return result;
|
|
}
|
|
function mergeSymbol(target, source) {
|
|
if (!(target.flags & getExcludedSymbolFlags(source.flags))) {
|
|
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 (!target.valueDeclaration && source.valueDeclaration)
|
|
target.valueDeclaration = source.valueDeclaration;
|
|
ts.forEach(source.declarations, function (node) {
|
|
target.declarations.push(node);
|
|
});
|
|
if (source.members) {
|
|
if (!target.members)
|
|
target.members = {};
|
|
mergeSymbolTable(target.members, source.members);
|
|
}
|
|
if (source.exports) {
|
|
if (!target.exports)
|
|
target.exports = {};
|
|
mergeSymbolTable(target.exports, source.exports);
|
|
}
|
|
recordMergedSymbol(target, source);
|
|
}
|
|
else {
|
|
var message = target.flags & 2 /* BlockScopedVariable */ || source.flags & 2 /* BlockScopedVariable */
|
|
? ts.Diagnostics.Cannot_redeclare_block_scoped_variable_0 : ts.Diagnostics.Duplicate_identifier_0;
|
|
ts.forEach(source.declarations, function (node) {
|
|
error(node.name ? node.name : node, message, symbolToString(source));
|
|
});
|
|
ts.forEach(target.declarations, function (node) {
|
|
error(node.name ? node.name : node, message, symbolToString(source));
|
|
});
|
|
}
|
|
}
|
|
function cloneSymbolTable(symbolTable) {
|
|
var result = {};
|
|
for (var id in symbolTable) {
|
|
if (ts.hasProperty(symbolTable, id)) {
|
|
result[id] = symbolTable[id];
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
function mergeSymbolTable(target, source) {
|
|
for (var id in source) {
|
|
if (ts.hasProperty(source, id)) {
|
|
if (!ts.hasProperty(target, id)) {
|
|
target[id] = source[id];
|
|
}
|
|
else {
|
|
var symbol = target[id];
|
|
if (!(symbol.flags & 33554432 /* Merged */)) {
|
|
target[id] = symbol = cloneSymbol(symbol);
|
|
}
|
|
mergeSymbol(symbol, source[id]);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function getSymbolLinks(symbol) {
|
|
if (symbol.flags & 67108864 /* Transient */)
|
|
return symbol;
|
|
var id = getSymbolId(symbol);
|
|
return symbolLinks[id] || (symbolLinks[id] = {});
|
|
}
|
|
function getNodeLinks(node) {
|
|
var nodeId = getNodeId(node);
|
|
return nodeLinks[nodeId] || (nodeLinks[nodeId] = {});
|
|
}
|
|
function getSourceFile(node) {
|
|
return ts.getAncestor(node, 245 /* SourceFile */);
|
|
}
|
|
function isGlobalSourceFile(node) {
|
|
return node.kind === 245 /* SourceFile */ && !ts.isExternalModule(node);
|
|
}
|
|
function getSymbol(symbols, name, meaning) {
|
|
if (meaning && ts.hasProperty(symbols, name)) {
|
|
var symbol = symbols[name];
|
|
ts.Debug.assert((symbol.flags & 16777216 /* Instantiated */) === 0, "Should never get an instantiated symbol here.");
|
|
if (symbol.flags & meaning) {
|
|
return symbol;
|
|
}
|
|
if (symbol.flags & 8388608 /* 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.
|
|
}
|
|
/** Returns true if node1 is defined before node 2**/
|
|
function isDefinedBefore(node1, node2) {
|
|
var file1 = ts.getSourceFileOfNode(node1);
|
|
var file2 = ts.getSourceFileOfNode(node2);
|
|
if (file1 === file2) {
|
|
return node1.pos <= node2.pos;
|
|
}
|
|
if (!compilerOptions.out) {
|
|
return true;
|
|
}
|
|
var sourceFiles = host.getSourceFiles();
|
|
return sourceFiles.indexOf(file1) <= sourceFiles.indexOf(file2);
|
|
}
|
|
// 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.
|
|
function resolveName(location, name, meaning, nameNotFoundMessage, nameArg) {
|
|
var result;
|
|
var lastLocation;
|
|
var propertyWithInvalidInitializer;
|
|
var errorLocation = location;
|
|
var grandparent;
|
|
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 = getSymbol(location.locals, name, meaning)) {
|
|
// 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.
|
|
if (!(meaning & 793056 /* Type */) ||
|
|
!(result.flags & (793056 /* Type */ & ~262144 /* TypeParameter */)) ||
|
|
!ts.isFunctionLike(location) ||
|
|
lastLocation === location.body) {
|
|
break loop;
|
|
}
|
|
result = undefined;
|
|
}
|
|
}
|
|
switch (location.kind) {
|
|
case 245 /* SourceFile */:
|
|
if (!ts.isExternalModule(location))
|
|
break;
|
|
case 215 /* ModuleDeclaration */:
|
|
var moduleExports = getSymbolOfNode(location).exports;
|
|
if (location.kind === 245 /* SourceFile */ ||
|
|
(location.kind === 215 /* ModuleDeclaration */ && location.name.kind === 8 /* StringLiteral */)) {
|
|
// It's an external module. 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.
|
|
if (ts.hasProperty(moduleExports, name) &&
|
|
moduleExports[name].flags === 8388608 /* Alias */ &&
|
|
ts.getDeclarationOfKind(moduleExports[name], 227 /* ExportSpecifier */)) {
|
|
break;
|
|
}
|
|
result = moduleExports["default"];
|
|
var localSymbol = ts.getLocalSymbolForExportDefault(result);
|
|
if (result && localSymbol && (result.flags & meaning) && localSymbol.name === name) {
|
|
break loop;
|
|
}
|
|
result = undefined;
|
|
}
|
|
if (result = getSymbol(moduleExports, name, meaning & 8914931 /* ModuleMember */)) {
|
|
break loop;
|
|
}
|
|
break;
|
|
case 214 /* EnumDeclaration */:
|
|
if (result = getSymbol(getSymbolOfNode(location).exports, name, meaning & 8 /* EnumMember */)) {
|
|
break loop;
|
|
}
|
|
break;
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
// 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.isClassLike(location.parent) && !(location.flags & 128 /* Static */)) {
|
|
var ctor = findConstructorDeclaration(location.parent);
|
|
if (ctor && ctor.locals) {
|
|
if (getSymbol(ctor.locals, name, meaning & 107455 /* Value */)) {
|
|
// Remember the property node, it will be used later to report appropriate error
|
|
propertyWithInvalidInitializer = location;
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
case 211 /* ClassDeclaration */:
|
|
case 183 /* ClassExpression */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
if (result = getSymbol(getSymbolOfNode(location).members, name, meaning & 793056 /* Type */)) {
|
|
if (lastLocation && lastLocation.flags & 128 /* Static */) {
|
|
// 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 === 183 /* ClassExpression */ && meaning & 32 /* Class */) {
|
|
var className = location.name;
|
|
if (className && name === className.text) {
|
|
result = location.symbol;
|
|
break loop;
|
|
}
|
|
}
|
|
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 133 /* ComputedPropertyName */:
|
|
grandparent = location.parent.parent;
|
|
if (ts.isClassLike(grandparent) || grandparent.kind === 212 /* InterfaceDeclaration */) {
|
|
// A reference to this grandparent's type parameters would be an error
|
|
if (result = getSymbol(getSymbolOfNode(grandparent).members, name, meaning & 793056 /* Type */)) {
|
|
error(errorLocation, ts.Diagnostics.A_computed_property_name_cannot_reference_a_type_parameter_from_its_containing_type);
|
|
return undefined;
|
|
}
|
|
}
|
|
break;
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 141 /* Constructor */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 171 /* ArrowFunction */:
|
|
if (meaning & 3 /* Variable */ && name === "arguments") {
|
|
result = argumentsSymbol;
|
|
break loop;
|
|
}
|
|
break;
|
|
case 170 /* FunctionExpression */:
|
|
if (meaning & 3 /* Variable */ && name === "arguments") {
|
|
result = argumentsSymbol;
|
|
break loop;
|
|
}
|
|
if (meaning & 16 /* Function */) {
|
|
var functionName = location.name;
|
|
if (functionName && name === functionName.text) {
|
|
result = location.symbol;
|
|
break loop;
|
|
}
|
|
}
|
|
break;
|
|
case 136 /* 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 === 135 /* Parameter */) {
|
|
location = location.parent;
|
|
}
|
|
//
|
|
// function y() {}
|
|
// class C {
|
|
// @y method(x, y) {} // <-- decorator y should be resolved at the class declaration, not the method.
|
|
// }
|
|
//
|
|
if (location.parent && ts.isClassElement(location.parent)) {
|
|
location = location.parent;
|
|
}
|
|
break;
|
|
}
|
|
lastLocation = location;
|
|
location = location.parent;
|
|
}
|
|
if (!result) {
|
|
result = getSymbol(globals, name, meaning);
|
|
}
|
|
if (!result) {
|
|
if (nameNotFoundMessage) {
|
|
error(errorLocation, nameNotFoundMessage, typeof nameArg === "string" ? nameArg : ts.declarationNameToString(nameArg));
|
|
}
|
|
return undefined;
|
|
}
|
|
// Perform extra checks only if error reporting was requested
|
|
if (nameNotFoundMessage) {
|
|
if (propertyWithInvalidInitializer) {
|
|
// 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.
|
|
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), typeof nameArg === "string" ? nameArg : ts.declarationNameToString(nameArg));
|
|
return undefined;
|
|
}
|
|
if (result.flags & 2 /* BlockScopedVariable */) {
|
|
checkResolvedBlockScopedVariable(result, errorLocation);
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
function checkResolvedBlockScopedVariable(result, errorLocation) {
|
|
ts.Debug.assert((result.flags & 2 /* BlockScopedVariable */) !== 0);
|
|
// Block-scoped variables cannot be used before their definition
|
|
var declaration = ts.forEach(result.declarations, function (d) { return ts.isBlockOrCatchScoped(d) ? d : undefined; });
|
|
ts.Debug.assert(declaration !== undefined, "Block-scoped variable declaration is undefined");
|
|
// first check if usage is lexically located after the declaration
|
|
var isUsedBeforeDeclaration = !isDefinedBefore(declaration, errorLocation);
|
|
if (!isUsedBeforeDeclaration) {
|
|
// lexical check succeeded however code still can be illegal.
|
|
// - block scoped variables cannot be used in its initializers
|
|
// let x = x; // illegal but usage is lexically after definition
|
|
// - in ForIn/ForOf statements variable cannot be contained in expression part
|
|
// for (let x in x)
|
|
// for (let x of x)
|
|
// climb up to the variable declaration skipping binding patterns
|
|
var variableDeclaration = ts.getAncestor(declaration, 208 /* VariableDeclaration */);
|
|
var container = ts.getEnclosingBlockScopeContainer(variableDeclaration);
|
|
if (variableDeclaration.parent.parent.kind === 190 /* VariableStatement */ ||
|
|
variableDeclaration.parent.parent.kind === 196 /* ForStatement */) {
|
|
// variable statement/for statement case,
|
|
// use site should not be inside variable declaration (initializer of declaration or binding element)
|
|
isUsedBeforeDeclaration = isSameScopeDescendentOf(errorLocation, variableDeclaration, container);
|
|
}
|
|
else if (variableDeclaration.parent.parent.kind === 198 /* ForOfStatement */ ||
|
|
variableDeclaration.parent.parent.kind === 197 /* ForInStatement */) {
|
|
// ForIn/ForOf case - use site should not be used in expression part
|
|
var expression = variableDeclaration.parent.parent.expression;
|
|
isUsedBeforeDeclaration = isSameScopeDescendentOf(errorLocation, expression, container);
|
|
}
|
|
}
|
|
if (isUsedBeforeDeclaration) {
|
|
error(errorLocation, ts.Diagnostics.Block_scoped_variable_0_used_before_its_declaration, ts.declarationNameToString(declaration.name));
|
|
}
|
|
}
|
|
/* 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) {
|
|
if (!parent) {
|
|
return false;
|
|
}
|
|
for (var current = initial; current && current !== stopAt && !ts.isFunctionLike(current); current = current.parent) {
|
|
if (current === parent) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function getAnyImportSyntax(node) {
|
|
if (ts.isAliasSymbolDeclaration(node)) {
|
|
if (node.kind === 218 /* ImportEqualsDeclaration */) {
|
|
return node;
|
|
}
|
|
while (node && node.kind !== 219 /* ImportDeclaration */) {
|
|
node = node.parent;
|
|
}
|
|
return node;
|
|
}
|
|
}
|
|
function getDeclarationOfAliasSymbol(symbol) {
|
|
return ts.forEach(symbol.declarations, function (d) { return ts.isAliasSymbolDeclaration(d) ? d : undefined; });
|
|
}
|
|
function getTargetOfImportEqualsDeclaration(node) {
|
|
if (node.moduleReference.kind === 229 /* ExternalModuleReference */) {
|
|
return resolveExternalModuleSymbol(resolveExternalModuleName(node, ts.getExternalModuleImportEqualsDeclarationExpression(node)));
|
|
}
|
|
return getSymbolOfPartOfRightHandSideOfImportEquals(node.moduleReference, node);
|
|
}
|
|
function getTargetOfImportClause(node) {
|
|
var moduleSymbol = resolveExternalModuleName(node, node.parent.moduleSpecifier);
|
|
if (moduleSymbol) {
|
|
var exportDefaultSymbol = resolveSymbol(moduleSymbol.exports["default"]);
|
|
if (!exportDefaultSymbol) {
|
|
error(node.name, ts.Diagnostics.Module_0_has_no_default_export, symbolToString(moduleSymbol));
|
|
}
|
|
return exportDefaultSymbol;
|
|
}
|
|
}
|
|
function getTargetOfNamespaceImport(node) {
|
|
var moduleSpecifier = node.parent.parent.moduleSpecifier;
|
|
return resolveESModuleSymbol(resolveExternalModuleName(node, moduleSpecifier), moduleSpecifier);
|
|
}
|
|
function getMemberOfModuleVariable(moduleSymbol, name) {
|
|
if (moduleSymbol.flags & 3 /* Variable */) {
|
|
var typeAnnotation = moduleSymbol.valueDeclaration.type;
|
|
if (typeAnnotation) {
|
|
return getPropertyOfType(getTypeFromTypeNode(typeAnnotation), name);
|
|
}
|
|
}
|
|
}
|
|
// 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.flags & (793056 /* Type */ | 1536 /* Namespace */)) {
|
|
return valueSymbol;
|
|
}
|
|
var result = createSymbol(valueSymbol.flags | typeSymbol.flags, valueSymbol.name);
|
|
result.declarations = ts.concatenate(valueSymbol.declarations, typeSymbol.declarations);
|
|
result.parent = valueSymbol.parent || typeSymbol.parent;
|
|
if (valueSymbol.valueDeclaration)
|
|
result.valueDeclaration = valueSymbol.valueDeclaration;
|
|
if (typeSymbol.members)
|
|
result.members = typeSymbol.members;
|
|
if (valueSymbol.exports)
|
|
result.exports = valueSymbol.exports;
|
|
return result;
|
|
}
|
|
function getExportOfModule(symbol, name) {
|
|
if (symbol.flags & 1536 /* Module */) {
|
|
var exports = getExportsOfSymbol(symbol);
|
|
if (ts.hasProperty(exports, name)) {
|
|
return resolveSymbol(exports[name]);
|
|
}
|
|
}
|
|
}
|
|
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) {
|
|
var moduleSymbol = resolveExternalModuleName(node, node.moduleSpecifier);
|
|
var targetSymbol = resolveESModuleSymbol(moduleSymbol, node.moduleSpecifier);
|
|
if (targetSymbol) {
|
|
var name_9 = specifier.propertyName || specifier.name;
|
|
if (name_9.text) {
|
|
var symbolFromModule = getExportOfModule(targetSymbol, name_9.text);
|
|
var symbolFromVariable = getPropertyOfVariable(targetSymbol, name_9.text);
|
|
var symbol = symbolFromModule && symbolFromVariable ?
|
|
combineValueAndTypeSymbols(symbolFromVariable, symbolFromModule) :
|
|
symbolFromModule || symbolFromVariable;
|
|
if (!symbol) {
|
|
error(name_9, ts.Diagnostics.Module_0_has_no_exported_member_1, getFullyQualifiedName(moduleSymbol), ts.declarationNameToString(name_9));
|
|
}
|
|
return symbol;
|
|
}
|
|
}
|
|
}
|
|
function getTargetOfImportSpecifier(node) {
|
|
return getExternalModuleMember(node.parent.parent.parent, node);
|
|
}
|
|
function getTargetOfExportSpecifier(node) {
|
|
return node.parent.parent.moduleSpecifier ?
|
|
getExternalModuleMember(node.parent.parent, node) :
|
|
resolveEntityName(node.propertyName || node.name, 107455 /* Value */ | 793056 /* Type */ | 1536 /* Namespace */);
|
|
}
|
|
function getTargetOfExportAssignment(node) {
|
|
return resolveEntityName(node.expression, 107455 /* Value */ | 793056 /* Type */ | 1536 /* Namespace */);
|
|
}
|
|
function getTargetOfAliasDeclaration(node) {
|
|
switch (node.kind) {
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
return getTargetOfImportEqualsDeclaration(node);
|
|
case 220 /* ImportClause */:
|
|
return getTargetOfImportClause(node);
|
|
case 221 /* NamespaceImport */:
|
|
return getTargetOfNamespaceImport(node);
|
|
case 223 /* ImportSpecifier */:
|
|
return getTargetOfImportSpecifier(node);
|
|
case 227 /* ExportSpecifier */:
|
|
return getTargetOfExportSpecifier(node);
|
|
case 224 /* ExportAssignment */:
|
|
return getTargetOfExportAssignment(node);
|
|
}
|
|
}
|
|
function resolveSymbol(symbol) {
|
|
return symbol && symbol.flags & 8388608 /* Alias */ && !(symbol.flags & (107455 /* Value */ | 793056 /* Type */ | 1536 /* Namespace */)) ? resolveAlias(symbol) : symbol;
|
|
}
|
|
function resolveAlias(symbol) {
|
|
ts.Debug.assert((symbol.flags & 8388608 /* Alias */) !== 0, "Should only get Alias here.");
|
|
var links = getSymbolLinks(symbol);
|
|
if (!links.target) {
|
|
links.target = resolvingSymbol;
|
|
var node = getDeclarationOfAliasSymbol(symbol);
|
|
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 markExportAsReferenced(node) {
|
|
var symbol = getSymbolOfNode(node);
|
|
var target = resolveAlias(symbol);
|
|
if (target) {
|
|
var markAlias = (target === unknownSymbol && compilerOptions.isolatedModules) ||
|
|
(target !== unknownSymbol && (target.flags & 107455 /* Value */) && !isConstEnumOrConstEnumOnlyModule(target));
|
|
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.kind === 224 /* ExportAssignment */) {
|
|
// export default <symbol>
|
|
checkExpressionCached(node.expression);
|
|
}
|
|
else if (node.kind === 227 /* ExportSpecifier */) {
|
|
// export { <symbol> } or export { <symbol> as foo }
|
|
checkExpressionCached(node.propertyName || node.name);
|
|
}
|
|
else if (ts.isInternalModuleImportEqualsDeclaration(node)) {
|
|
// import foo = <symbol>
|
|
checkExpressionCached(node.moduleReference);
|
|
}
|
|
}
|
|
}
|
|
// This function is only for imports with entity names
|
|
function getSymbolOfPartOfRightHandSideOfImportEquals(entityName, importDeclaration) {
|
|
if (!importDeclaration) {
|
|
importDeclaration = ts.getAncestor(entityName, 218 /* ImportEqualsDeclaration */);
|
|
ts.Debug.assert(importDeclaration !== undefined);
|
|
}
|
|
// 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 === 66 /* Identifier */ && ts.isRightSideOfQualifiedNameOrPropertyAccess(entityName)) {
|
|
entityName = entityName.parent;
|
|
}
|
|
// Check for case 1 and 3 in the above example
|
|
if (entityName.kind === 66 /* Identifier */ || entityName.parent.kind === 132 /* QualifiedName */) {
|
|
return resolveEntityName(entityName, 1536 /* Namespace */);
|
|
}
|
|
else {
|
|
// Case 2 in above example
|
|
// entityName.kind could be a QualifiedName or a Missing identifier
|
|
ts.Debug.assert(entityName.parent.kind === 218 /* ImportEqualsDeclaration */);
|
|
return resolveEntityName(entityName, 107455 /* Value */ | 793056 /* Type */ | 1536 /* Namespace */);
|
|
}
|
|
}
|
|
function getFullyQualifiedName(symbol) {
|
|
return symbol.parent ? getFullyQualifiedName(symbol.parent) + "." + symbolToString(symbol) : symbolToString(symbol);
|
|
}
|
|
// Resolves a qualified name and any involved aliases
|
|
function resolveEntityName(name, meaning, ignoreErrors) {
|
|
if (ts.nodeIsMissing(name)) {
|
|
return undefined;
|
|
}
|
|
var symbol;
|
|
if (name.kind === 66 /* Identifier */) {
|
|
var message = meaning === 1536 /* Namespace */ ? ts.Diagnostics.Cannot_find_namespace_0 : ts.Diagnostics.Cannot_find_name_0;
|
|
symbol = resolveName(name, name.text, meaning, ignoreErrors ? undefined : message, name);
|
|
if (!symbol) {
|
|
return undefined;
|
|
}
|
|
}
|
|
else if (name.kind === 132 /* QualifiedName */ || name.kind === 163 /* PropertyAccessExpression */) {
|
|
var left = name.kind === 132 /* QualifiedName */ ? name.left : name.expression;
|
|
var right = name.kind === 132 /* QualifiedName */ ? name.right : name.name;
|
|
var namespace = resolveEntityName(left, 1536 /* Namespace */, ignoreErrors);
|
|
if (!namespace || namespace === unknownSymbol || ts.nodeIsMissing(right)) {
|
|
return undefined;
|
|
}
|
|
symbol = getSymbol(getExportsOfSymbol(namespace), right.text, meaning);
|
|
if (!symbol) {
|
|
if (!ignoreErrors) {
|
|
error(right, ts.Diagnostics.Module_0_has_no_exported_member_1, getFullyQualifiedName(namespace), ts.declarationNameToString(right));
|
|
}
|
|
return undefined;
|
|
}
|
|
}
|
|
else {
|
|
ts.Debug.fail("Unknown entity name kind.");
|
|
}
|
|
ts.Debug.assert((symbol.flags & 16777216 /* Instantiated */) === 0, "Should never get an instantiated symbol here.");
|
|
return symbol.flags & meaning ? symbol : resolveAlias(symbol);
|
|
}
|
|
function isExternalModuleNameRelative(moduleName) {
|
|
// TypeScript 1.0 spec (April 2014): 11.2.1
|
|
// An external module name is "relative" if the first term is "." or "..".
|
|
return moduleName.substr(0, 2) === "./" || moduleName.substr(0, 3) === "../" || moduleName.substr(0, 2) === ".\\" || moduleName.substr(0, 3) === "..\\";
|
|
}
|
|
function resolveExternalModuleName(location, moduleReferenceExpression) {
|
|
if (moduleReferenceExpression.kind !== 8 /* StringLiteral */) {
|
|
return;
|
|
}
|
|
var moduleReferenceLiteral = moduleReferenceExpression;
|
|
var searchPath = ts.getDirectoryPath(getSourceFile(location).fileName);
|
|
// Module names are escaped in our symbol table. However, string literal values aren't.
|
|
// Escape the name in the "require(...)" clause to ensure we find the right symbol.
|
|
var moduleName = ts.escapeIdentifier(moduleReferenceLiteral.text);
|
|
if (!moduleName)
|
|
return;
|
|
var isRelative = isExternalModuleNameRelative(moduleName);
|
|
if (!isRelative) {
|
|
var symbol = getSymbol(globals, '"' + moduleName + '"', 512 /* ValueModule */);
|
|
if (symbol) {
|
|
return symbol;
|
|
}
|
|
}
|
|
var fileName;
|
|
var sourceFile;
|
|
while (true) {
|
|
fileName = ts.normalizePath(ts.combinePaths(searchPath, moduleName));
|
|
sourceFile = ts.forEach(ts.supportedExtensions, function (extension) { return host.getSourceFile(fileName + extension); });
|
|
if (sourceFile || isRelative) {
|
|
break;
|
|
}
|
|
var parentPath = ts.getDirectoryPath(searchPath);
|
|
if (parentPath === searchPath) {
|
|
break;
|
|
}
|
|
searchPath = parentPath;
|
|
}
|
|
if (sourceFile) {
|
|
if (sourceFile.symbol) {
|
|
return sourceFile.symbol;
|
|
}
|
|
error(moduleReferenceLiteral, ts.Diagnostics.File_0_is_not_a_module, sourceFile.fileName);
|
|
return;
|
|
}
|
|
error(moduleReferenceLiteral, ts.Diagnostics.Cannot_find_module_0, moduleName);
|
|
}
|
|
// An external module with an 'export =' declaration resolves to the target of the 'export =' declaration,
|
|
// and an external module with no 'export =' declaration resolves to the module itself.
|
|
function resolveExternalModuleSymbol(moduleSymbol) {
|
|
return moduleSymbol && resolveSymbol(moduleSymbol.exports["export="]) || moduleSymbol;
|
|
}
|
|
// 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, moduleReferenceExpression) {
|
|
var symbol = resolveExternalModuleSymbol(moduleSymbol);
|
|
if (symbol && !(symbol.flags & (1536 /* Module */ | 3 /* Variable */))) {
|
|
error(moduleReferenceExpression, ts.Diagnostics.Module_0_resolves_to_a_non_module_entity_and_cannot_be_imported_using_this_construct, symbolToString(moduleSymbol));
|
|
symbol = undefined;
|
|
}
|
|
return symbol;
|
|
}
|
|
function getExportAssignmentSymbol(moduleSymbol) {
|
|
return moduleSymbol.exports["export="];
|
|
}
|
|
function getExportsOfModuleAsArray(moduleSymbol) {
|
|
return symbolsToArray(getExportsOfModule(moduleSymbol));
|
|
}
|
|
function getExportsOfSymbol(symbol) {
|
|
return symbol.flags & 1536 /* Module */ ? getExportsOfModule(symbol) : symbol.exports || emptySymbols;
|
|
}
|
|
function getExportsOfModule(moduleSymbol) {
|
|
var links = getSymbolLinks(moduleSymbol);
|
|
return links.resolvedExports || (links.resolvedExports = getExportsForModule(moduleSymbol));
|
|
}
|
|
function extendExportSymbols(target, source) {
|
|
for (var id in source) {
|
|
if (id !== "default" && !ts.hasProperty(target, id)) {
|
|
target[id] = source[id];
|
|
}
|
|
}
|
|
}
|
|
function getExportsForModule(moduleSymbol) {
|
|
var result;
|
|
var visitedSymbols = [];
|
|
visit(moduleSymbol);
|
|
return result || moduleSymbol.exports;
|
|
// 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.flags & 1952 /* HasExports */ && !ts.contains(visitedSymbols, symbol)) {
|
|
visitedSymbols.push(symbol);
|
|
if (symbol !== moduleSymbol) {
|
|
if (!result) {
|
|
result = cloneSymbolTable(moduleSymbol.exports);
|
|
}
|
|
extendExportSymbols(result, symbol.exports);
|
|
}
|
|
// All export * declarations are collected in an __export symbol by the binder
|
|
var exportStars = symbol.exports["__export"];
|
|
if (exportStars) {
|
|
for (var _i = 0, _a = exportStars.declarations; _i < _a.length; _i++) {
|
|
var node = _a[_i];
|
|
visit(resolveExternalModuleName(node, node.moduleSpecifier));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function getMergedSymbol(symbol) {
|
|
var merged;
|
|
return symbol && symbol.mergeId && (merged = mergedSymbols[symbol.mergeId]) ? merged : symbol;
|
|
}
|
|
function getSymbolOfNode(node) {
|
|
return getMergedSymbol(node.symbol);
|
|
}
|
|
function getParentOfSymbol(symbol) {
|
|
return getMergedSymbol(symbol.parent);
|
|
}
|
|
function getExportSymbolOfValueSymbolIfExported(symbol) {
|
|
return symbol && (symbol.flags & 1048576 /* ExportValue */) !== 0
|
|
? getMergedSymbol(symbol.exportSymbol)
|
|
: symbol;
|
|
}
|
|
function symbolIsValue(symbol) {
|
|
// If it is an instantiated symbol, then it is a value if the symbol it is an
|
|
// instantiation of is a value.
|
|
if (symbol.flags & 16777216 /* Instantiated */) {
|
|
return symbolIsValue(getSymbolLinks(symbol).target);
|
|
}
|
|
// If the symbol has the value flag, it is trivially a value.
|
|
if (symbol.flags & 107455 /* Value */) {
|
|
return true;
|
|
}
|
|
// If it is an alias, then it is a value if the symbol it resolves to is a value.
|
|
if (symbol.flags & 8388608 /* Alias */) {
|
|
return (resolveAlias(symbol).flags & 107455 /* Value */) !== 0;
|
|
}
|
|
return false;
|
|
}
|
|
function findConstructorDeclaration(node) {
|
|
var members = node.members;
|
|
for (var _i = 0; _i < members.length; _i++) {
|
|
var member = members[_i];
|
|
if (member.kind === 141 /* Constructor */ && ts.nodeIsPresent(member.body)) {
|
|
return member;
|
|
}
|
|
}
|
|
}
|
|
function createType(flags) {
|
|
var result = new Type(checker, flags);
|
|
result.id = typeCount++;
|
|
return result;
|
|
}
|
|
function createIntrinsicType(kind, intrinsicName) {
|
|
var type = createType(kind);
|
|
type.intrinsicName = intrinsicName;
|
|
return type;
|
|
}
|
|
function createObjectType(kind, symbol) {
|
|
var type = createType(kind);
|
|
type.symbol = symbol;
|
|
return type;
|
|
}
|
|
// A reserved member name starts with two underscores, but the third character cannot be an underscore
|
|
// or the @ symbol. A third underscore indicates an escaped form of an identifer that started
|
|
// with at least two underscores. The @ character indicates that the name is denoted by a well known ES
|
|
// Symbol instance.
|
|
function isReservedMemberName(name) {
|
|
return name.charCodeAt(0) === 95 /* _ */ &&
|
|
name.charCodeAt(1) === 95 /* _ */ &&
|
|
name.charCodeAt(2) !== 95 /* _ */ &&
|
|
name.charCodeAt(2) !== 64 /* at */;
|
|
}
|
|
function getNamedMembers(members) {
|
|
var result;
|
|
for (var id in members) {
|
|
if (ts.hasProperty(members, id)) {
|
|
if (!isReservedMemberName(id)) {
|
|
if (!result)
|
|
result = [];
|
|
var symbol = members[id];
|
|
if (symbolIsValue(symbol)) {
|
|
result.push(symbol);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return result || emptyArray;
|
|
}
|
|
function setObjectTypeMembers(type, members, callSignatures, constructSignatures, stringIndexType, numberIndexType) {
|
|
type.members = members;
|
|
type.properties = getNamedMembers(members);
|
|
type.callSignatures = callSignatures;
|
|
type.constructSignatures = constructSignatures;
|
|
if (stringIndexType)
|
|
type.stringIndexType = stringIndexType;
|
|
if (numberIndexType)
|
|
type.numberIndexType = numberIndexType;
|
|
return type;
|
|
}
|
|
function createAnonymousType(symbol, members, callSignatures, constructSignatures, stringIndexType, numberIndexType) {
|
|
return setObjectTypeMembers(createObjectType(65536 /* Anonymous */, symbol), members, callSignatures, constructSignatures, stringIndexType, numberIndexType);
|
|
}
|
|
function forEachSymbolTableInScope(enclosingDeclaration, callback) {
|
|
var result;
|
|
for (var location_1 = enclosingDeclaration; location_1; location_1 = location_1.parent) {
|
|
// Locals of a source file are not in scope (because they get merged into the global symbol table)
|
|
if (location_1.locals && !isGlobalSourceFile(location_1)) {
|
|
if (result = callback(location_1.locals)) {
|
|
return result;
|
|
}
|
|
}
|
|
switch (location_1.kind) {
|
|
case 245 /* SourceFile */:
|
|
if (!ts.isExternalModule(location_1)) {
|
|
break;
|
|
}
|
|
case 215 /* ModuleDeclaration */:
|
|
if (result = callback(getSymbolOfNode(location_1).exports)) {
|
|
return result;
|
|
}
|
|
break;
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
if (result = callback(getSymbolOfNode(location_1).members)) {
|
|
return result;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
return callback(globals);
|
|
}
|
|
function getQualifiedLeftMeaning(rightMeaning) {
|
|
// If we are looking in value space, the parent meaning is value, other wise it is namespace
|
|
return rightMeaning === 107455 /* Value */ ? 107455 /* Value */ : 1536 /* Namespace */;
|
|
}
|
|
function getAccessibleSymbolChain(symbol, enclosingDeclaration, meaning, useOnlyExternalAliasing) {
|
|
function getAccessibleSymbolChainFromSymbolTable(symbols) {
|
|
function canQualifySymbol(symbolFromSymbolTable, meaning) {
|
|
// If the symbol is equivalent and doesn't need further qualification, this symbol is accessible
|
|
if (!needsQualification(symbolFromSymbolTable, enclosingDeclaration, meaning)) {
|
|
return true;
|
|
}
|
|
// If symbol needs qualification, make sure that parent is accessible, if it is then this symbol is accessible too
|
|
var accessibleParent = getAccessibleSymbolChain(symbolFromSymbolTable.parent, enclosingDeclaration, getQualifiedLeftMeaning(meaning), useOnlyExternalAliasing);
|
|
return !!accessibleParent;
|
|
}
|
|
function isAccessible(symbolFromSymbolTable, resolvedAliasSymbol) {
|
|
if (symbol === (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 symbolfrom symbolTable or alias resolution matches the symbol,
|
|
// check the symbol can be qualified, it is only then this symbol is accessible
|
|
return !ts.forEach(symbolFromSymbolTable.declarations, hasExternalModuleSymbol) &&
|
|
canQualifySymbol(symbolFromSymbolTable, meaning);
|
|
}
|
|
}
|
|
// If symbol is directly available by its name in the symbol table
|
|
if (isAccessible(ts.lookUp(symbols, symbol.name))) {
|
|
return [symbol];
|
|
}
|
|
// Check if symbol is any of the alias
|
|
return ts.forEachValue(symbols, function (symbolFromSymbolTable) {
|
|
if (symbolFromSymbolTable.flags & 8388608 /* Alias */
|
|
&& symbolFromSymbolTable.name !== "export="
|
|
&& !ts.getDeclarationOfKind(symbolFromSymbolTable, 227 /* ExportSpecifier */)) {
|
|
if (!useOnlyExternalAliasing ||
|
|
// Is this external alias, then use it to name
|
|
ts.forEach(symbolFromSymbolTable.declarations, ts.isExternalModuleImportEqualsDeclaration)) {
|
|
var resolvedImportedSymbol = resolveAlias(symbolFromSymbolTable);
|
|
if (isAccessible(symbolFromSymbolTable, resolveAlias(symbolFromSymbolTable))) {
|
|
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 accessibleSymbolsFromExports = resolvedImportedSymbol.exports ? getAccessibleSymbolChainFromSymbolTable(resolvedImportedSymbol.exports) : undefined;
|
|
if (accessibleSymbolsFromExports && canQualifySymbol(symbolFromSymbolTable, getQualifiedLeftMeaning(meaning))) {
|
|
return [symbolFromSymbolTable].concat(accessibleSymbolsFromExports);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
}
|
|
if (symbol) {
|
|
return forEachSymbolTableInScope(enclosingDeclaration, getAccessibleSymbolChainFromSymbolTable);
|
|
}
|
|
}
|
|
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
|
|
if (!ts.hasProperty(symbolTable, symbol.name)) {
|
|
// Continue to the next symbol table
|
|
return false;
|
|
}
|
|
// If the symbol with this name is present it should refer to the symbol
|
|
var symbolFromSymbolTable = symbolTable[symbol.name];
|
|
if (symbolFromSymbolTable === symbol) {
|
|
// No need to qualify
|
|
return true;
|
|
}
|
|
// Qualify if the symbol from symbol table has same meaning as expected
|
|
symbolFromSymbolTable = (symbolFromSymbolTable.flags & 8388608 /* Alias */ && !ts.getDeclarationOfKind(symbolFromSymbolTable, 227 /* ExportSpecifier */)) ? resolveAlias(symbolFromSymbolTable) : symbolFromSymbolTable;
|
|
if (symbolFromSymbolTable.flags & meaning) {
|
|
qualify = true;
|
|
return true;
|
|
}
|
|
// Continue to the next symbol table
|
|
return false;
|
|
});
|
|
return qualify;
|
|
}
|
|
function isSymbolAccessible(symbol, enclosingDeclaration, meaning) {
|
|
if (symbol && enclosingDeclaration && !(symbol.flags & 262144 /* TypeParameter */)) {
|
|
var initialSymbol = symbol;
|
|
var meaningToLook = meaning;
|
|
while (symbol) {
|
|
// Symbol is accessible if it by itself is accessible
|
|
var accessibleSymbolChain = getAccessibleSymbolChain(symbol, enclosingDeclaration, meaningToLook, false);
|
|
if (accessibleSymbolChain) {
|
|
var hasAccessibleDeclarations = hasVisibleDeclarations(accessibleSymbolChain[0]);
|
|
if (!hasAccessibleDeclarations) {
|
|
return {
|
|
accessibility: 1 /* NotAccessible */,
|
|
errorSymbolName: symbolToString(initialSymbol, enclosingDeclaration, meaning),
|
|
errorModuleName: symbol !== initialSymbol ? symbolToString(symbol, enclosingDeclaration, 1536 /* Namespace */) : undefined
|
|
};
|
|
}
|
|
return hasAccessibleDeclarations;
|
|
}
|
|
// 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 {
|
|
// }
|
|
// }
|
|
// let 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
|
|
meaningToLook = getQualifiedLeftMeaning(meaning);
|
|
symbol = getParentOfSymbol(symbol);
|
|
}
|
|
// 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(initialSymbol.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(initialSymbol, enclosingDeclaration, meaning),
|
|
errorModuleName: symbolToString(symbolExternalModule)
|
|
};
|
|
}
|
|
}
|
|
// Just a local name that is not accessible
|
|
return {
|
|
accessibility: 1 /* NotAccessible */,
|
|
errorSymbolName: symbolToString(initialSymbol, enclosingDeclaration, meaning)
|
|
};
|
|
}
|
|
return { accessibility: 0 /* Accessible */ };
|
|
function getExternalModuleContainer(declaration) {
|
|
for (; declaration; declaration = declaration.parent) {
|
|
if (hasExternalModuleSymbol(declaration)) {
|
|
return getSymbolOfNode(declaration);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function hasExternalModuleSymbol(declaration) {
|
|
return (declaration.kind === 215 /* ModuleDeclaration */ && declaration.name.kind === 8 /* StringLiteral */) ||
|
|
(declaration.kind === 245 /* SourceFile */ && ts.isExternalModule(declaration));
|
|
}
|
|
function hasVisibleDeclarations(symbol) {
|
|
var aliasesToMakeVisible;
|
|
if (ts.forEach(symbol.declarations, function (declaration) { return !getIsDeclarationVisible(declaration); })) {
|
|
return undefined;
|
|
}
|
|
return { accessibility: 0 /* Accessible */, aliasesToMakeVisible: aliasesToMakeVisible };
|
|
function getIsDeclarationVisible(declaration) {
|
|
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 &&
|
|
!(anyImportSyntax.flags & 1 /* Export */) &&
|
|
isDeclarationVisible(anyImportSyntax.parent)) {
|
|
getNodeLinks(declaration).isVisible = true;
|
|
if (aliasesToMakeVisible) {
|
|
if (!ts.contains(aliasesToMakeVisible, anyImportSyntax)) {
|
|
aliasesToMakeVisible.push(anyImportSyntax);
|
|
}
|
|
}
|
|
else {
|
|
aliasesToMakeVisible = [anyImportSyntax];
|
|
}
|
|
return true;
|
|
}
|
|
// Declaration is not visible
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
}
|
|
function isEntityNameVisible(entityName, enclosingDeclaration) {
|
|
// get symbol of the first identifier of the entityName
|
|
var meaning;
|
|
if (entityName.parent.kind === 151 /* TypeQuery */) {
|
|
// Typeof value
|
|
meaning = 107455 /* Value */ | 1048576 /* ExportValue */;
|
|
}
|
|
else if (entityName.kind === 132 /* QualifiedName */ || entityName.kind === 163 /* PropertyAccessExpression */ ||
|
|
entityName.parent.kind === 218 /* ImportEqualsDeclaration */) {
|
|
// Left identifier from type reference or TypeAlias
|
|
// Entity name of the import declaration
|
|
meaning = 1536 /* Namespace */;
|
|
}
|
|
else {
|
|
// Type Reference or TypeAlias entity = Identifier
|
|
meaning = 793056 /* Type */;
|
|
}
|
|
var firstIdentifier = getFirstIdentifier(entityName);
|
|
var symbol = resolveName(enclosingDeclaration, firstIdentifier.text, meaning, undefined, undefined);
|
|
// Verify if the symbol is accessible
|
|
return (symbol && hasVisibleDeclarations(symbol)) || {
|
|
accessibility: 1 /* NotAccessible */,
|
|
errorSymbolName: ts.getTextOfNode(firstIdentifier),
|
|
errorNode: firstIdentifier
|
|
};
|
|
}
|
|
function writeKeyword(writer, kind) {
|
|
writer.writeKeyword(ts.tokenToString(kind));
|
|
}
|
|
function writePunctuation(writer, kind) {
|
|
writer.writePunctuation(ts.tokenToString(kind));
|
|
}
|
|
function writeSpace(writer) {
|
|
writer.writeSpace(" ");
|
|
}
|
|
function symbolToString(symbol, enclosingDeclaration, meaning) {
|
|
var writer = ts.getSingleLineStringWriter();
|
|
getSymbolDisplayBuilder().buildSymbolDisplay(symbol, writer, enclosingDeclaration, meaning);
|
|
var result = writer.string();
|
|
ts.releaseStringWriter(writer);
|
|
return result;
|
|
}
|
|
function signatureToString(signature, enclosingDeclaration, flags) {
|
|
var writer = ts.getSingleLineStringWriter();
|
|
getSymbolDisplayBuilder().buildSignatureDisplay(signature, writer, enclosingDeclaration, flags);
|
|
var result = writer.string();
|
|
ts.releaseStringWriter(writer);
|
|
return result;
|
|
}
|
|
function typeToString(type, enclosingDeclaration, flags) {
|
|
var writer = ts.getSingleLineStringWriter();
|
|
getSymbolDisplayBuilder().buildTypeDisplay(type, writer, enclosingDeclaration, flags);
|
|
var result = writer.string();
|
|
ts.releaseStringWriter(writer);
|
|
var maxLength = compilerOptions.noErrorTruncation || flags & 4 /* NoTruncation */ ? undefined : 100;
|
|
if (maxLength && result.length >= maxLength) {
|
|
result = result.substr(0, maxLength - "...".length) + "...";
|
|
}
|
|
return result;
|
|
}
|
|
function getTypeAliasForTypeLiteral(type) {
|
|
if (type.symbol && type.symbol.flags & 2048 /* TypeLiteral */) {
|
|
var node = type.symbol.declarations[0].parent;
|
|
while (node.kind === 157 /* ParenthesizedType */) {
|
|
node = node.parent;
|
|
}
|
|
if (node.kind === 213 /* TypeAliasDeclaration */) {
|
|
return getSymbolOfNode(node);
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
// This is for caching the result of getSymbolDisplayBuilder. Do not access directly.
|
|
var _displayBuilder;
|
|
function getSymbolDisplayBuilder() {
|
|
function getNameOfSymbol(symbol) {
|
|
if (symbol.declarations && symbol.declarations.length) {
|
|
var declaration = symbol.declarations[0];
|
|
if (declaration.name) {
|
|
return ts.declarationNameToString(declaration.name);
|
|
}
|
|
switch (declaration.kind) {
|
|
case 183 /* ClassExpression */:
|
|
return "(Anonymous class)";
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
return "(Anonymous function)";
|
|
}
|
|
}
|
|
return symbol.name;
|
|
}
|
|
/**
|
|
* Writes only the name of the symbol out to the writer. Uses the original source text
|
|
* for the name of the symbol if it is available to match how the user inputted the name.
|
|
*/
|
|
function appendSymbolNameOnly(symbol, writer) {
|
|
writer.writeSymbol(getNameOfSymbol(symbol), symbol);
|
|
}
|
|
/**
|
|
* Enclosing declaration is optional when we don't want to get qualified name in the enclosing declaration scope
|
|
* Meaning needs to be specified if the enclosing declaration is given
|
|
*/
|
|
function buildSymbolDisplay(symbol, writer, enclosingDeclaration, meaning, flags, typeFlags) {
|
|
var parentSymbol;
|
|
function appendParentTypeArgumentsAndSymbolName(symbol) {
|
|
if (parentSymbol) {
|
|
// Write type arguments of instantiated class/interface here
|
|
if (flags & 1 /* WriteTypeParametersOrArguments */) {
|
|
if (symbol.flags & 16777216 /* Instantiated */) {
|
|
buildDisplayForTypeArgumentsAndDelimiters(getTypeParametersOfClassOrInterface(parentSymbol), symbol.mapper, writer, enclosingDeclaration);
|
|
}
|
|
else {
|
|
buildTypeParameterDisplayFromSymbol(parentSymbol, writer, enclosingDeclaration);
|
|
}
|
|
}
|
|
writePunctuation(writer, 20 /* DotToken */);
|
|
}
|
|
parentSymbol = symbol;
|
|
appendSymbolNameOnly(symbol, writer);
|
|
}
|
|
// Let the writer know we just wrote out a symbol. The declaration emitter writer uses
|
|
// this to determine if an import it has previously seen (and not written out) needs
|
|
// to be written to the file once the walk of the tree is complete.
|
|
//
|
|
// NOTE(cyrusn): This approach feels somewhat unfortunate. A simple pass over the tree
|
|
// up front (for example, during checking) could determine if we need to emit the imports
|
|
// and we could then access that data during declaration emit.
|
|
writer.trackSymbol(symbol, enclosingDeclaration, meaning);
|
|
function walkSymbol(symbol, meaning) {
|
|
if (symbol) {
|
|
var accessibleSymbolChain = getAccessibleSymbolChain(symbol, enclosingDeclaration, meaning, !!(flags & 2 /* UseOnlyExternalAliasing */));
|
|
if (!accessibleSymbolChain ||
|
|
needsQualification(accessibleSymbolChain[0], enclosingDeclaration, accessibleSymbolChain.length === 1 ? meaning : getQualifiedLeftMeaning(meaning))) {
|
|
// Go up and add our parent.
|
|
walkSymbol(getParentOfSymbol(accessibleSymbolChain ? accessibleSymbolChain[0] : symbol), getQualifiedLeftMeaning(meaning));
|
|
}
|
|
if (accessibleSymbolChain) {
|
|
for (var _i = 0; _i < accessibleSymbolChain.length; _i++) {
|
|
var accessibleSymbol = accessibleSymbolChain[_i];
|
|
appendParentTypeArgumentsAndSymbolName(accessibleSymbol);
|
|
}
|
|
}
|
|
else {
|
|
// If we didn't find accessible symbol chain for this symbol, break if this is external module
|
|
if (!parentSymbol && ts.forEach(symbol.declarations, hasExternalModuleSymbol)) {
|
|
return;
|
|
}
|
|
// if this is anonymous type break
|
|
if (symbol.flags & 2048 /* TypeLiteral */ || symbol.flags & 4096 /* ObjectLiteral */) {
|
|
return;
|
|
}
|
|
appendParentTypeArgumentsAndSymbolName(symbol);
|
|
}
|
|
}
|
|
}
|
|
// Get qualified name if the symbol is not a type parameter
|
|
// and there is an enclosing declaration or we specifically
|
|
// asked for it
|
|
var isTypeParameter = symbol.flags & 262144 /* TypeParameter */;
|
|
var typeFormatFlag = 128 /* UseFullyQualifiedType */ & typeFlags;
|
|
if (!isTypeParameter && (enclosingDeclaration || typeFormatFlag)) {
|
|
walkSymbol(symbol, meaning);
|
|
return;
|
|
}
|
|
return appendParentTypeArgumentsAndSymbolName(symbol);
|
|
}
|
|
function buildTypeDisplay(type, writer, enclosingDeclaration, globalFlags, symbolStack) {
|
|
var globalFlagsToPass = globalFlags & 16 /* WriteOwnNameForAnyLike */;
|
|
return writeType(type, globalFlags);
|
|
function writeType(type, flags) {
|
|
// Write undefined/null type as any
|
|
if (type.flags & 4194431 /* Intrinsic */) {
|
|
// Special handling for unknown / resolving types, they should show up as any and not unknown or __resolving
|
|
writer.writeKeyword(!(globalFlags & 16 /* WriteOwnNameForAnyLike */) && isTypeAny(type)
|
|
? "any"
|
|
: type.intrinsicName);
|
|
}
|
|
else if (type.flags & 4096 /* Reference */) {
|
|
writeTypeReference(type, flags);
|
|
}
|
|
else if (type.flags & (1024 /* Class */ | 2048 /* Interface */ | 128 /* Enum */ | 512 /* TypeParameter */)) {
|
|
// The specified symbol flags need to be reinterpreted as type flags
|
|
buildSymbolDisplay(type.symbol, writer, enclosingDeclaration, 793056 /* Type */, 0 /* None */, flags);
|
|
}
|
|
else if (type.flags & 8192 /* Tuple */) {
|
|
writeTupleType(type);
|
|
}
|
|
else if (type.flags & 49152 /* UnionOrIntersection */) {
|
|
writeUnionOrIntersectionType(type, flags);
|
|
}
|
|
else if (type.flags & 65536 /* Anonymous */) {
|
|
writeAnonymousType(type, flags);
|
|
}
|
|
else if (type.flags & 256 /* StringLiteral */) {
|
|
writer.writeStringLiteral(type.text);
|
|
}
|
|
else {
|
|
// Should never get here
|
|
// { ... }
|
|
writePunctuation(writer, 14 /* OpenBraceToken */);
|
|
writeSpace(writer);
|
|
writePunctuation(writer, 21 /* DotDotDotToken */);
|
|
writeSpace(writer);
|
|
writePunctuation(writer, 15 /* CloseBraceToken */);
|
|
}
|
|
}
|
|
function writeTypeList(types, delimiter) {
|
|
for (var i = 0; i < types.length; i++) {
|
|
if (i > 0) {
|
|
if (delimiter !== 23 /* CommaToken */) {
|
|
writeSpace(writer);
|
|
}
|
|
writePunctuation(writer, delimiter);
|
|
writeSpace(writer);
|
|
}
|
|
writeType(types[i], delimiter === 23 /* CommaToken */ ? 0 /* None */ : 64 /* InElementType */);
|
|
}
|
|
}
|
|
function writeSymbolTypeReference(symbol, typeArguments, pos, end) {
|
|
// Unnamed function expressions, arrow functions, and unnamed class expressions have reserved names that
|
|
// we don't want to display
|
|
if (!isReservedMemberName(symbol.name)) {
|
|
buildSymbolDisplay(symbol, writer, enclosingDeclaration, 793056 /* Type */);
|
|
}
|
|
if (pos < end) {
|
|
writePunctuation(writer, 24 /* LessThanToken */);
|
|
writeType(typeArguments[pos++], 0 /* None */);
|
|
while (pos < end) {
|
|
writePunctuation(writer, 23 /* CommaToken */);
|
|
writeSpace(writer);
|
|
writeType(typeArguments[pos++], 0 /* None */);
|
|
}
|
|
writePunctuation(writer, 26 /* GreaterThanToken */);
|
|
}
|
|
}
|
|
function writeTypeReference(type, flags) {
|
|
var typeArguments = type.typeArguments;
|
|
if (type.target === globalArrayType && !(flags & 1 /* WriteArrayAsGenericType */)) {
|
|
writeType(typeArguments[0], 64 /* InElementType */);
|
|
writePunctuation(writer, 18 /* OpenBracketToken */);
|
|
writePunctuation(writer, 19 /* CloseBracketToken */);
|
|
}
|
|
else {
|
|
// Write the type reference in the format f<A>.g<B>.C<X, Y> where A and B are type arguments
|
|
// for outer type parameters, and f and g are the respective declaring containers of those
|
|
// type parameters.
|
|
var outerTypeParameters = type.target.outerTypeParameters;
|
|
var i = 0;
|
|
if (outerTypeParameters) {
|
|
var length_1 = outerTypeParameters.length;
|
|
while (i < length_1) {
|
|
// Find group of type arguments for type parameters with the same declaring container.
|
|
var start = i;
|
|
var parent_3 = getParentSymbolOfTypeParameter(outerTypeParameters[i]);
|
|
do {
|
|
i++;
|
|
} while (i < length_1 && getParentSymbolOfTypeParameter(outerTypeParameters[i]) === parent_3);
|
|
// 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)) {
|
|
writeSymbolTypeReference(parent_3, typeArguments, start, i);
|
|
writePunctuation(writer, 20 /* DotToken */);
|
|
}
|
|
}
|
|
}
|
|
writeSymbolTypeReference(type.symbol, typeArguments, i, typeArguments.length);
|
|
}
|
|
}
|
|
function writeTupleType(type) {
|
|
writePunctuation(writer, 18 /* OpenBracketToken */);
|
|
writeTypeList(type.elementTypes, 23 /* CommaToken */);
|
|
writePunctuation(writer, 19 /* CloseBracketToken */);
|
|
}
|
|
function writeUnionOrIntersectionType(type, flags) {
|
|
if (flags & 64 /* InElementType */) {
|
|
writePunctuation(writer, 16 /* OpenParenToken */);
|
|
}
|
|
writeTypeList(type.types, type.flags & 16384 /* Union */ ? 45 /* BarToken */ : 44 /* AmpersandToken */);
|
|
if (flags & 64 /* InElementType */) {
|
|
writePunctuation(writer, 17 /* CloseParenToken */);
|
|
}
|
|
}
|
|
function writeAnonymousType(type, flags) {
|
|
var symbol = type.symbol;
|
|
if (symbol) {
|
|
// Always use 'typeof T' for type of class, enum, and module objects
|
|
if (symbol.flags & (32 /* Class */ | 384 /* Enum */ | 512 /* ValueModule */)) {
|
|
writeTypeofSymbol(type, flags);
|
|
}
|
|
else if (shouldWriteTypeOfFunctionSymbol()) {
|
|
writeTypeofSymbol(type, flags);
|
|
}
|
|
else if (ts.contains(symbolStack, symbol)) {
|
|
// 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
|
|
buildSymbolDisplay(typeAlias, writer, enclosingDeclaration, 793056 /* Type */, 0 /* None */, flags);
|
|
}
|
|
else {
|
|
// Recursive usage, use any
|
|
writeKeyword(writer, 114 /* AnyKeyword */);
|
|
}
|
|
}
|
|
else {
|
|
// 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 (!symbolStack) {
|
|
symbolStack = [];
|
|
}
|
|
symbolStack.push(symbol);
|
|
writeLiteralType(type, flags);
|
|
symbolStack.pop();
|
|
}
|
|
}
|
|
else {
|
|
// Anonymous types with no symbol are never circular
|
|
writeLiteralType(type, flags);
|
|
}
|
|
function shouldWriteTypeOfFunctionSymbol() {
|
|
var isStaticMethodSymbol = !!(symbol.flags & 8192 /* Method */ &&
|
|
ts.forEach(symbol.declarations, function (declaration) { return declaration.flags & 128 /* Static */; }));
|
|
var isNonLocalFunctionSymbol = !!(symbol.flags & 16 /* Function */) &&
|
|
(symbol.parent ||
|
|
ts.forEach(symbol.declarations, function (declaration) {
|
|
return declaration.parent.kind === 245 /* SourceFile */ || declaration.parent.kind === 216 /* ModuleBlock */;
|
|
}));
|
|
if (isStaticMethodSymbol || isNonLocalFunctionSymbol) {
|
|
// typeof is allowed only for static/non local functions
|
|
return !!(flags & 2 /* UseTypeOfFunction */) ||
|
|
(ts.contains(symbolStack, symbol)); // it is type of the symbol uses itself recursively
|
|
}
|
|
}
|
|
}
|
|
function writeTypeofSymbol(type, typeFormatFlags) {
|
|
writeKeyword(writer, 98 /* TypeOfKeyword */);
|
|
writeSpace(writer);
|
|
buildSymbolDisplay(type.symbol, writer, enclosingDeclaration, 107455 /* Value */, 0 /* None */, typeFormatFlags);
|
|
}
|
|
function getIndexerParameterName(type, indexKind, fallbackName) {
|
|
var declaration = getIndexDeclarationOfSymbol(type.symbol, indexKind);
|
|
if (!declaration) {
|
|
// declaration might not be found if indexer was added from the contextual type.
|
|
// in this case use fallback name
|
|
return fallbackName;
|
|
}
|
|
ts.Debug.assert(declaration.parameters.length !== 0);
|
|
return ts.declarationNameToString(declaration.parameters[0].name);
|
|
}
|
|
function writeLiteralType(type, flags) {
|
|
var resolved = resolveStructuredTypeMembers(type);
|
|
if (!resolved.properties.length && !resolved.stringIndexType && !resolved.numberIndexType) {
|
|
if (!resolved.callSignatures.length && !resolved.constructSignatures.length) {
|
|
writePunctuation(writer, 14 /* OpenBraceToken */);
|
|
writePunctuation(writer, 15 /* CloseBraceToken */);
|
|
return;
|
|
}
|
|
if (resolved.callSignatures.length === 1 && !resolved.constructSignatures.length) {
|
|
if (flags & 64 /* InElementType */) {
|
|
writePunctuation(writer, 16 /* OpenParenToken */);
|
|
}
|
|
buildSignatureDisplay(resolved.callSignatures[0], writer, enclosingDeclaration, globalFlagsToPass | 8 /* WriteArrowStyleSignature */, symbolStack);
|
|
if (flags & 64 /* InElementType */) {
|
|
writePunctuation(writer, 17 /* CloseParenToken */);
|
|
}
|
|
return;
|
|
}
|
|
if (resolved.constructSignatures.length === 1 && !resolved.callSignatures.length) {
|
|
if (flags & 64 /* InElementType */) {
|
|
writePunctuation(writer, 16 /* OpenParenToken */);
|
|
}
|
|
writeKeyword(writer, 89 /* NewKeyword */);
|
|
writeSpace(writer);
|
|
buildSignatureDisplay(resolved.constructSignatures[0], writer, enclosingDeclaration, globalFlagsToPass | 8 /* WriteArrowStyleSignature */, symbolStack);
|
|
if (flags & 64 /* InElementType */) {
|
|
writePunctuation(writer, 17 /* CloseParenToken */);
|
|
}
|
|
return;
|
|
}
|
|
}
|
|
writePunctuation(writer, 14 /* OpenBraceToken */);
|
|
writer.writeLine();
|
|
writer.increaseIndent();
|
|
for (var _i = 0, _a = resolved.callSignatures; _i < _a.length; _i++) {
|
|
var signature = _a[_i];
|
|
buildSignatureDisplay(signature, writer, enclosingDeclaration, globalFlagsToPass, symbolStack);
|
|
writePunctuation(writer, 22 /* SemicolonToken */);
|
|
writer.writeLine();
|
|
}
|
|
for (var _b = 0, _c = resolved.constructSignatures; _b < _c.length; _b++) {
|
|
var signature = _c[_b];
|
|
writeKeyword(writer, 89 /* NewKeyword */);
|
|
writeSpace(writer);
|
|
buildSignatureDisplay(signature, writer, enclosingDeclaration, globalFlagsToPass, symbolStack);
|
|
writePunctuation(writer, 22 /* SemicolonToken */);
|
|
writer.writeLine();
|
|
}
|
|
if (resolved.stringIndexType) {
|
|
// [x: string]:
|
|
writePunctuation(writer, 18 /* OpenBracketToken */);
|
|
writer.writeParameter(getIndexerParameterName(resolved, 0 /* String */, "x"));
|
|
writePunctuation(writer, 52 /* ColonToken */);
|
|
writeSpace(writer);
|
|
writeKeyword(writer, 127 /* StringKeyword */);
|
|
writePunctuation(writer, 19 /* CloseBracketToken */);
|
|
writePunctuation(writer, 52 /* ColonToken */);
|
|
writeSpace(writer);
|
|
writeType(resolved.stringIndexType, 0 /* None */);
|
|
writePunctuation(writer, 22 /* SemicolonToken */);
|
|
writer.writeLine();
|
|
}
|
|
if (resolved.numberIndexType) {
|
|
// [x: number]:
|
|
writePunctuation(writer, 18 /* OpenBracketToken */);
|
|
writer.writeParameter(getIndexerParameterName(resolved, 1 /* Number */, "x"));
|
|
writePunctuation(writer, 52 /* ColonToken */);
|
|
writeSpace(writer);
|
|
writeKeyword(writer, 125 /* NumberKeyword */);
|
|
writePunctuation(writer, 19 /* CloseBracketToken */);
|
|
writePunctuation(writer, 52 /* ColonToken */);
|
|
writeSpace(writer);
|
|
writeType(resolved.numberIndexType, 0 /* None */);
|
|
writePunctuation(writer, 22 /* SemicolonToken */);
|
|
writer.writeLine();
|
|
}
|
|
for (var _d = 0, _e = resolved.properties; _d < _e.length; _d++) {
|
|
var p = _e[_d];
|
|
var t = getTypeOfSymbol(p);
|
|
if (p.flags & (16 /* Function */ | 8192 /* Method */) && !getPropertiesOfObjectType(t).length) {
|
|
var signatures = getSignaturesOfType(t, 0 /* Call */);
|
|
for (var _f = 0; _f < signatures.length; _f++) {
|
|
var signature = signatures[_f];
|
|
buildSymbolDisplay(p, writer);
|
|
if (p.flags & 536870912 /* Optional */) {
|
|
writePunctuation(writer, 51 /* QuestionToken */);
|
|
}
|
|
buildSignatureDisplay(signature, writer, enclosingDeclaration, globalFlagsToPass, symbolStack);
|
|
writePunctuation(writer, 22 /* SemicolonToken */);
|
|
writer.writeLine();
|
|
}
|
|
}
|
|
else {
|
|
buildSymbolDisplay(p, writer);
|
|
if (p.flags & 536870912 /* Optional */) {
|
|
writePunctuation(writer, 51 /* QuestionToken */);
|
|
}
|
|
writePunctuation(writer, 52 /* ColonToken */);
|
|
writeSpace(writer);
|
|
writeType(t, 0 /* None */);
|
|
writePunctuation(writer, 22 /* SemicolonToken */);
|
|
writer.writeLine();
|
|
}
|
|
}
|
|
writer.decreaseIndent();
|
|
writePunctuation(writer, 15 /* CloseBraceToken */);
|
|
}
|
|
}
|
|
function buildTypeParameterDisplayFromSymbol(symbol, writer, enclosingDeclaraiton, flags) {
|
|
var targetSymbol = getTargetSymbol(symbol);
|
|
if (targetSymbol.flags & 32 /* Class */ || targetSymbol.flags & 64 /* Interface */) {
|
|
buildDisplayForTypeParametersAndDelimiters(getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(symbol), writer, enclosingDeclaraiton, flags);
|
|
}
|
|
}
|
|
function buildTypeParameterDisplay(tp, writer, enclosingDeclaration, flags, symbolStack) {
|
|
appendSymbolNameOnly(tp.symbol, writer);
|
|
var constraint = getConstraintOfTypeParameter(tp);
|
|
if (constraint) {
|
|
writeSpace(writer);
|
|
writeKeyword(writer, 80 /* ExtendsKeyword */);
|
|
writeSpace(writer);
|
|
buildTypeDisplay(constraint, writer, enclosingDeclaration, flags, symbolStack);
|
|
}
|
|
}
|
|
function buildParameterDisplay(p, writer, enclosingDeclaration, flags, symbolStack) {
|
|
var parameterNode = p.valueDeclaration;
|
|
if (ts.isRestParameter(parameterNode)) {
|
|
writePunctuation(writer, 21 /* DotDotDotToken */);
|
|
}
|
|
appendSymbolNameOnly(p, writer);
|
|
if (isOptionalParameter(parameterNode)) {
|
|
writePunctuation(writer, 51 /* QuestionToken */);
|
|
}
|
|
writePunctuation(writer, 52 /* ColonToken */);
|
|
writeSpace(writer);
|
|
buildTypeDisplay(getTypeOfSymbol(p), writer, enclosingDeclaration, flags, symbolStack);
|
|
}
|
|
function buildDisplayForTypeParametersAndDelimiters(typeParameters, writer, enclosingDeclaration, flags, symbolStack) {
|
|
if (typeParameters && typeParameters.length) {
|
|
writePunctuation(writer, 24 /* LessThanToken */);
|
|
for (var i = 0; i < typeParameters.length; i++) {
|
|
if (i > 0) {
|
|
writePunctuation(writer, 23 /* CommaToken */);
|
|
writeSpace(writer);
|
|
}
|
|
buildTypeParameterDisplay(typeParameters[i], writer, enclosingDeclaration, flags, symbolStack);
|
|
}
|
|
writePunctuation(writer, 26 /* GreaterThanToken */);
|
|
}
|
|
}
|
|
function buildDisplayForTypeArgumentsAndDelimiters(typeParameters, mapper, writer, enclosingDeclaration, flags, symbolStack) {
|
|
if (typeParameters && typeParameters.length) {
|
|
writePunctuation(writer, 24 /* LessThanToken */);
|
|
for (var i = 0; i < typeParameters.length; i++) {
|
|
if (i > 0) {
|
|
writePunctuation(writer, 23 /* CommaToken */);
|
|
writeSpace(writer);
|
|
}
|
|
buildTypeDisplay(mapper(typeParameters[i]), writer, enclosingDeclaration, 0 /* None */);
|
|
}
|
|
writePunctuation(writer, 26 /* GreaterThanToken */);
|
|
}
|
|
}
|
|
function buildDisplayForParametersAndDelimiters(parameters, writer, enclosingDeclaration, flags, symbolStack) {
|
|
writePunctuation(writer, 16 /* OpenParenToken */);
|
|
for (var i = 0; i < parameters.length; i++) {
|
|
if (i > 0) {
|
|
writePunctuation(writer, 23 /* CommaToken */);
|
|
writeSpace(writer);
|
|
}
|
|
buildParameterDisplay(parameters[i], writer, enclosingDeclaration, flags, symbolStack);
|
|
}
|
|
writePunctuation(writer, 17 /* CloseParenToken */);
|
|
}
|
|
function buildReturnTypeDisplay(signature, writer, enclosingDeclaration, flags, symbolStack) {
|
|
if (flags & 8 /* WriteArrowStyleSignature */) {
|
|
writeSpace(writer);
|
|
writePunctuation(writer, 33 /* EqualsGreaterThanToken */);
|
|
}
|
|
else {
|
|
writePunctuation(writer, 52 /* ColonToken */);
|
|
}
|
|
writeSpace(writer);
|
|
var returnType;
|
|
if (signature.typePredicate) {
|
|
writer.writeParameter(signature.typePredicate.parameterName);
|
|
writeSpace(writer);
|
|
writeKeyword(writer, 121 /* IsKeyword */);
|
|
writeSpace(writer);
|
|
returnType = signature.typePredicate.type;
|
|
}
|
|
else {
|
|
returnType = getReturnTypeOfSignature(signature);
|
|
}
|
|
buildTypeDisplay(returnType, writer, enclosingDeclaration, flags, symbolStack);
|
|
}
|
|
function buildSignatureDisplay(signature, writer, enclosingDeclaration, flags, symbolStack) {
|
|
if (signature.target && (flags & 32 /* WriteTypeArgumentsOfSignature */)) {
|
|
// Instantiated signature, write type arguments instead
|
|
// This is achieved by passing in the mapper separately
|
|
buildDisplayForTypeArgumentsAndDelimiters(signature.target.typeParameters, signature.mapper, writer, enclosingDeclaration);
|
|
}
|
|
else {
|
|
buildDisplayForTypeParametersAndDelimiters(signature.typeParameters, writer, enclosingDeclaration, flags, symbolStack);
|
|
}
|
|
buildDisplayForParametersAndDelimiters(signature.parameters, writer, enclosingDeclaration, flags, symbolStack);
|
|
buildReturnTypeDisplay(signature, writer, enclosingDeclaration, flags, symbolStack);
|
|
}
|
|
return _displayBuilder || (_displayBuilder = {
|
|
symbolToString: symbolToString,
|
|
typeToString: typeToString,
|
|
buildSymbolDisplay: buildSymbolDisplay,
|
|
buildTypeDisplay: buildTypeDisplay,
|
|
buildTypeParameterDisplay: buildTypeParameterDisplay,
|
|
buildParameterDisplay: buildParameterDisplay,
|
|
buildDisplayForParametersAndDelimiters: buildDisplayForParametersAndDelimiters,
|
|
buildDisplayForTypeParametersAndDelimiters: buildDisplayForTypeParametersAndDelimiters,
|
|
buildDisplayForTypeArgumentsAndDelimiters: buildDisplayForTypeArgumentsAndDelimiters,
|
|
buildTypeParameterDisplayFromSymbol: buildTypeParameterDisplayFromSymbol,
|
|
buildSignatureDisplay: buildSignatureDisplay,
|
|
buildReturnTypeDisplay: buildReturnTypeDisplay
|
|
});
|
|
}
|
|
function isDeclarationVisible(node) {
|
|
function getContainingExternalModule(node) {
|
|
for (; node; node = node.parent) {
|
|
if (node.kind === 215 /* ModuleDeclaration */) {
|
|
if (node.name.kind === 8 /* StringLiteral */) {
|
|
return node;
|
|
}
|
|
}
|
|
else if (node.kind === 245 /* SourceFile */) {
|
|
return ts.isExternalModule(node) ? node : undefined;
|
|
}
|
|
}
|
|
ts.Debug.fail("getContainingModule cant reach here");
|
|
}
|
|
function isUsedInExportAssignment(node) {
|
|
// Get source File and see if it is external module and has export assigned symbol
|
|
var externalModule = getContainingExternalModule(node);
|
|
var exportAssignmentSymbol;
|
|
var resolvedExportSymbol;
|
|
if (externalModule) {
|
|
// This is export assigned symbol node
|
|
var externalModuleSymbol = getSymbolOfNode(externalModule);
|
|
exportAssignmentSymbol = getExportAssignmentSymbol(externalModuleSymbol);
|
|
var symbolOfNode = getSymbolOfNode(node);
|
|
if (isSymbolUsedInExportAssignment(symbolOfNode)) {
|
|
return true;
|
|
}
|
|
// if symbolOfNode is alias declaration, resolve the symbol declaration and check
|
|
if (symbolOfNode.flags & 8388608 /* Alias */) {
|
|
return isSymbolUsedInExportAssignment(resolveAlias(symbolOfNode));
|
|
}
|
|
}
|
|
// Check if the symbol is used in export assignment
|
|
function isSymbolUsedInExportAssignment(symbol) {
|
|
if (exportAssignmentSymbol === symbol) {
|
|
return true;
|
|
}
|
|
if (exportAssignmentSymbol && !!(exportAssignmentSymbol.flags & 8388608 /* Alias */)) {
|
|
// if export assigned symbol is alias declaration, resolve the alias
|
|
resolvedExportSymbol = resolvedExportSymbol || resolveAlias(exportAssignmentSymbol);
|
|
if (resolvedExportSymbol === symbol) {
|
|
return true;
|
|
}
|
|
// Container of resolvedExportSymbol is visible
|
|
return ts.forEach(resolvedExportSymbol.declarations, function (current) {
|
|
while (current) {
|
|
if (current === node) {
|
|
return true;
|
|
}
|
|
current = current.parent;
|
|
}
|
|
});
|
|
}
|
|
}
|
|
}
|
|
function determineIfDeclarationIsVisible() {
|
|
switch (node.kind) {
|
|
case 160 /* BindingElement */:
|
|
return isDeclarationVisible(node.parent.parent);
|
|
case 208 /* VariableDeclaration */:
|
|
if (ts.isBindingPattern(node.name) &&
|
|
!node.name.elements.length) {
|
|
// If the binding pattern is empty, this variable declaration is not visible
|
|
return false;
|
|
}
|
|
// Otherwise fall through
|
|
case 215 /* ModuleDeclaration */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 213 /* TypeAliasDeclaration */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
var parent_4 = getDeclarationContainer(node);
|
|
// If the node is not exported or it is not ambient module element (except import declaration)
|
|
if (!(ts.getCombinedNodeFlags(node) & 1 /* Export */) &&
|
|
!(node.kind !== 218 /* ImportEqualsDeclaration */ && parent_4.kind !== 245 /* SourceFile */ && ts.isInAmbientContext(parent_4))) {
|
|
return isGlobalSourceFile(parent_4);
|
|
}
|
|
// Exported members/ambient module elements (exception import declaration) are visible if parent is visible
|
|
return isDeclarationVisible(parent_4);
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
if (node.flags & (32 /* Private */ | 64 /* Protected */)) {
|
|
// Private/protected properties/methods are not visible
|
|
return false;
|
|
}
|
|
// Public properties/methods are visible if its parents are visible, so let it fall into next case statement
|
|
case 141 /* Constructor */:
|
|
case 145 /* ConstructSignature */:
|
|
case 144 /* CallSignature */:
|
|
case 146 /* IndexSignature */:
|
|
case 135 /* Parameter */:
|
|
case 216 /* ModuleBlock */:
|
|
case 149 /* FunctionType */:
|
|
case 150 /* ConstructorType */:
|
|
case 152 /* TypeLiteral */:
|
|
case 148 /* TypeReference */:
|
|
case 153 /* ArrayType */:
|
|
case 154 /* TupleType */:
|
|
case 155 /* UnionType */:
|
|
case 156 /* IntersectionType */:
|
|
case 157 /* ParenthesizedType */:
|
|
return isDeclarationVisible(node.parent);
|
|
// Default binding, import specifier and namespace import is visible
|
|
// only on demand so by default it is not visible
|
|
case 220 /* ImportClause */:
|
|
case 221 /* NamespaceImport */:
|
|
case 223 /* ImportSpecifier */:
|
|
return false;
|
|
// Type parameters are always visible
|
|
case 134 /* TypeParameter */:
|
|
// Source file is always visible
|
|
case 245 /* SourceFile */:
|
|
return true;
|
|
// Export assignements do not create name bindings outside the module
|
|
case 224 /* ExportAssignment */:
|
|
return false;
|
|
default:
|
|
ts.Debug.fail("isDeclarationVisible unknown: SyntaxKind: " + node.kind);
|
|
}
|
|
}
|
|
if (node) {
|
|
var links = getNodeLinks(node);
|
|
if (links.isVisible === undefined) {
|
|
links.isVisible = !!determineIfDeclarationIsVisible();
|
|
}
|
|
return links.isVisible;
|
|
}
|
|
}
|
|
function collectLinkedAliases(node) {
|
|
var exportSymbol;
|
|
if (node.parent && node.parent.kind === 224 /* ExportAssignment */) {
|
|
exportSymbol = resolveName(node.parent, node.text, 107455 /* Value */ | 793056 /* Type */ | 1536 /* Namespace */, ts.Diagnostics.Cannot_find_name_0, node);
|
|
}
|
|
else if (node.parent.kind === 227 /* ExportSpecifier */) {
|
|
exportSymbol = getTargetOfExportSpecifier(node.parent);
|
|
}
|
|
var result = [];
|
|
if (exportSymbol) {
|
|
buildVisibleNodeList(exportSymbol.declarations);
|
|
}
|
|
return result;
|
|
function buildVisibleNodeList(declarations) {
|
|
ts.forEach(declarations, function (declaration) {
|
|
getNodeLinks(declaration).isVisible = true;
|
|
var resultNode = getAnyImportSyntax(declaration) || declaration;
|
|
if (!ts.contains(result, resultNode)) {
|
|
result.push(resultNode);
|
|
}
|
|
if (ts.isInternalModuleImportEqualsDeclaration(declaration)) {
|
|
// Add the referenced top container visible
|
|
var internalModuleReference = declaration.moduleReference;
|
|
var firstIdentifier = getFirstIdentifier(internalModuleReference);
|
|
var importSymbol = resolveName(declaration, firstIdentifier.text, 107455 /* Value */ | 793056 /* Type */ | 1536 /* Namespace */, ts.Diagnostics.Cannot_find_name_0, firstIdentifier);
|
|
buildVisibleNodeList(importSymbol.declarations);
|
|
}
|
|
});
|
|
}
|
|
}
|
|
// Push an entry on the type resolution stack. If an entry with the given target is not already on the stack,
|
|
// a new entry with that target and an associated result value of true is pushed on the stack, and the value
|
|
// true is returned. Otherwise, a circularity has occurred and the result values of the existing entry and
|
|
// all entries pushed after it are changed to false, and the value false is returned. The target object provides
|
|
// a unique identity for a particular type resolution result: Symbol instances are used to track resolution of
|
|
// SymbolLinks.type, SymbolLinks instances are used to track resolution of SymbolLinks.declaredType, and
|
|
// Signature instances are used to track resolution of Signature.resolvedReturnType.
|
|
function pushTypeResolution(target) {
|
|
var i = 0;
|
|
var count = resolutionTargets.length;
|
|
while (i < count && resolutionTargets[i] !== target) {
|
|
i++;
|
|
}
|
|
if (i < count) {
|
|
do {
|
|
resolutionResults[i++] = false;
|
|
} while (i < count);
|
|
return false;
|
|
}
|
|
resolutionTargets.push(target);
|
|
resolutionResults.push(true);
|
|
return true;
|
|
}
|
|
// 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();
|
|
return resolutionResults.pop();
|
|
}
|
|
function getDeclarationContainer(node) {
|
|
node = ts.getRootDeclaration(node);
|
|
// Parent chain:
|
|
// VaribleDeclaration -> VariableDeclarationList -> VariableStatement -> 'Declaration Container'
|
|
return node.kind === 208 /* VariableDeclaration */ ? node.parent.parent.parent : node.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(prototype.parent);
|
|
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 isTypeAny(type) {
|
|
return type && (type.flags & 1 /* Any */) !== 0;
|
|
}
|
|
// Return the inferred type for a binding element
|
|
function getTypeForBindingElement(declaration) {
|
|
var pattern = declaration.parent;
|
|
var parentType = getTypeForVariableLikeDeclaration(pattern.parent);
|
|
// If parent has the unknown (error) type, then so does this binding element
|
|
if (parentType === unknownType) {
|
|
return unknownType;
|
|
}
|
|
// If no type was specified or inferred for parent, or if the specified or inferred type is any,
|
|
// infer from the initializer of the binding element if one is present. Otherwise, go with the
|
|
// undefined or any type of the parent.
|
|
if (!parentType || isTypeAny(parentType)) {
|
|
if (declaration.initializer) {
|
|
return checkExpressionCached(declaration.initializer);
|
|
}
|
|
return parentType;
|
|
}
|
|
var type;
|
|
if (pattern.kind === 158 /* ObjectBindingPattern */) {
|
|
// Use explicitly specified property name ({ p: xxx } form), or otherwise the implied name ({ p } form)
|
|
var name_10 = declaration.propertyName || declaration.name;
|
|
// Use type of the specified property, or otherwise, for a numeric name, the type of the numeric index signature,
|
|
// or otherwise the type of the string index signature.
|
|
type = getTypeOfPropertyOfType(parentType, name_10.text) ||
|
|
isNumericLiteralName(name_10.text) && getIndexTypeOfType(parentType, 1 /* Number */) ||
|
|
getIndexTypeOfType(parentType, 0 /* String */);
|
|
if (!type) {
|
|
error(name_10, ts.Diagnostics.Type_0_has_no_property_1_and_no_string_index_signature, typeToString(parentType), ts.declarationNameToString(name_10));
|
|
return unknownType;
|
|
}
|
|
}
|
|
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(parentType, pattern, false);
|
|
if (!declaration.dotDotDotToken) {
|
|
if (isTypeAny(elementType)) {
|
|
return elementType;
|
|
}
|
|
// Use specific property type when parent is a tuple or numeric index type when parent is an array
|
|
var propName = "" + ts.indexOf(pattern.elements, declaration);
|
|
type = isTupleLikeType(parentType)
|
|
? getTypeOfPropertyOfType(parentType, propName)
|
|
: elementType;
|
|
if (!type) {
|
|
if (isTupleType(parentType)) {
|
|
error(declaration, ts.Diagnostics.Tuple_type_0_with_length_1_cannot_be_assigned_to_tuple_with_length_2, typeToString(parentType), parentType.elementTypes.length, pattern.elements.length);
|
|
}
|
|
else {
|
|
error(declaration, ts.Diagnostics.Type_0_has_no_property_1, typeToString(parentType), propName);
|
|
}
|
|
return unknownType;
|
|
}
|
|
}
|
|
else {
|
|
// Rest element has an array type with the same element type as the parent type
|
|
type = createArrayType(elementType);
|
|
}
|
|
}
|
|
return type;
|
|
}
|
|
// Return the inferred type for a variable, parameter, or property declaration
|
|
function getTypeForVariableLikeDeclaration(declaration) {
|
|
// A variable declared in a for..in statement is always of type any
|
|
if (declaration.parent.parent.kind === 197 /* ForInStatement */) {
|
|
return anyType;
|
|
}
|
|
if (declaration.parent.parent.kind === 198 /* 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.
|
|
return checkRightHandSideOfForOf(declaration.parent.parent.expression) || anyType;
|
|
}
|
|
if (ts.isBindingPattern(declaration.parent)) {
|
|
return getTypeForBindingElement(declaration);
|
|
}
|
|
// Use type from type annotation if one is present
|
|
if (declaration.type) {
|
|
return getTypeFromTypeNode(declaration.type);
|
|
}
|
|
if (declaration.kind === 135 /* Parameter */) {
|
|
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 === 143 /* SetAccessor */ && !ts.hasDynamicName(func)) {
|
|
var getter = ts.getDeclarationOfKind(declaration.parent.symbol, 142 /* GetAccessor */);
|
|
if (getter) {
|
|
return getReturnTypeOfSignature(getSignatureFromDeclaration(getter));
|
|
}
|
|
}
|
|
// Use contextual parameter type if one is available
|
|
var type = getContextuallyTypedParameterType(declaration);
|
|
if (type) {
|
|
return type;
|
|
}
|
|
}
|
|
// Use the type of the initializer expression if one is present
|
|
if (declaration.initializer) {
|
|
return checkExpressionCached(declaration.initializer);
|
|
}
|
|
// If it is a short-hand property assignment, use the type of the identifier
|
|
if (declaration.kind === 243 /* ShorthandPropertyAssignment */) {
|
|
return checkIdentifier(declaration.name);
|
|
}
|
|
// No type specified and nothing can be inferred
|
|
return undefined;
|
|
}
|
|
// 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) {
|
|
if (element.initializer) {
|
|
return getWidenedType(checkExpressionCached(element.initializer));
|
|
}
|
|
if (ts.isBindingPattern(element.name)) {
|
|
return getTypeFromBindingPattern(element.name);
|
|
}
|
|
return anyType;
|
|
}
|
|
// Return the type implied by an object binding pattern
|
|
function getTypeFromObjectBindingPattern(pattern) {
|
|
var members = {};
|
|
ts.forEach(pattern.elements, function (e) {
|
|
var flags = 4 /* Property */ | 67108864 /* Transient */ | (e.initializer ? 536870912 /* Optional */ : 0);
|
|
var name = e.propertyName || e.name;
|
|
var symbol = createSymbol(flags, name.text);
|
|
symbol.type = getTypeFromBindingElement(e);
|
|
members[symbol.name] = symbol;
|
|
});
|
|
return createAnonymousType(undefined, members, emptyArray, emptyArray, undefined, undefined);
|
|
}
|
|
// Return the type implied by an array binding pattern
|
|
function getTypeFromArrayBindingPattern(pattern) {
|
|
var hasSpreadElement = false;
|
|
var elementTypes = [];
|
|
ts.forEach(pattern.elements, function (e) {
|
|
elementTypes.push(e.kind === 184 /* OmittedExpression */ || e.dotDotDotToken ? anyType : getTypeFromBindingElement(e));
|
|
if (e.dotDotDotToken) {
|
|
hasSpreadElement = true;
|
|
}
|
|
});
|
|
if (!elementTypes.length) {
|
|
return languageVersion >= 2 /* ES6 */ ? createIterableType(anyType) : anyArrayType;
|
|
}
|
|
else if (hasSpreadElement) {
|
|
var unionOfElements = getUnionType(elementTypes);
|
|
return languageVersion >= 2 /* ES6 */ ? createIterableType(unionOfElements) : createArrayType(unionOfElements);
|
|
}
|
|
// If the pattern has at least one element, and no rest element, then it should imply a tuple type.
|
|
return createTupleType(elementTypes);
|
|
}
|
|
// 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) {
|
|
return pattern.kind === 158 /* ObjectBindingPattern */
|
|
? getTypeFromObjectBindingPattern(pattern)
|
|
: getTypeFromArrayBindingPattern(pattern);
|
|
}
|
|
// 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) {
|
|
var type = getTypeForVariableLikeDeclaration(declaration);
|
|
if (type) {
|
|
if (reportErrors) {
|
|
reportErrorsFromWidening(declaration, type);
|
|
}
|
|
// During a normal type check we'll never get to here with a property assignment (the check of the containing
|
|
// object literal uses a different path). We exclude widening only so that language services and type verification
|
|
// tools see the actual type.
|
|
return declaration.kind !== 242 /* PropertyAssignment */ ? getWidenedType(type) : type;
|
|
}
|
|
// If no type was specified and nothing could be inferred, and if the declaration specifies a binding pattern, use
|
|
// the type implied by the binding pattern
|
|
if (ts.isBindingPattern(declaration.name)) {
|
|
return getTypeFromBindingPattern(declaration.name);
|
|
}
|
|
// Rest parameters default to type any[], other parameters default to type any
|
|
type = declaration.dotDotDotToken ? anyArrayType : anyType;
|
|
// Report implicit any errors unless this is a private property within an ambient declaration
|
|
if (reportErrors && compilerOptions.noImplicitAny) {
|
|
var root = ts.getRootDeclaration(declaration);
|
|
if (!isPrivateWithinAmbient(root) && !(root.kind === 135 /* Parameter */ && isPrivateWithinAmbient(root.parent))) {
|
|
reportImplicitAnyError(declaration, type);
|
|
}
|
|
}
|
|
return type;
|
|
}
|
|
function getTypeOfVariableOrParameterOrProperty(symbol) {
|
|
var links = getSymbolLinks(symbol);
|
|
if (!links.type) {
|
|
// Handle prototype property
|
|
if (symbol.flags & 134217728 /* Prototype */) {
|
|
return links.type = getTypeOfPrototypeProperty(symbol);
|
|
}
|
|
// Handle catch clause variables
|
|
var declaration = symbol.valueDeclaration;
|
|
if (declaration.parent.kind === 241 /* CatchClause */) {
|
|
return links.type = anyType;
|
|
}
|
|
// Handle export default expressions
|
|
if (declaration.kind === 224 /* ExportAssignment */) {
|
|
return links.type = checkExpression(declaration.expression);
|
|
}
|
|
// Handle variable, parameter or property
|
|
if (!pushTypeResolution(symbol)) {
|
|
return unknownType;
|
|
}
|
|
var type = getWidenedTypeForVariableLikeDeclaration(declaration, true);
|
|
if (!popTypeResolution()) {
|
|
if (symbol.valueDeclaration.type) {
|
|
// Variable has type annotation that circularly references the variable itself
|
|
type = unknownType;
|
|
error(symbol.valueDeclaration, ts.Diagnostics._0_is_referenced_directly_or_indirectly_in_its_own_type_annotation, symbolToString(symbol));
|
|
}
|
|
else {
|
|
// Variable has initializer that circularly references the variable itself
|
|
type = anyType;
|
|
if (compilerOptions.noImplicitAny) {
|
|
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));
|
|
}
|
|
}
|
|
}
|
|
links.type = type;
|
|
}
|
|
return links.type;
|
|
}
|
|
function getAnnotatedAccessorType(accessor) {
|
|
if (accessor) {
|
|
if (accessor.kind === 142 /* GetAccessor */) {
|
|
return accessor.type && getTypeFromTypeNode(accessor.type);
|
|
}
|
|
else {
|
|
var setterTypeAnnotation = ts.getSetAccessorTypeAnnotationNode(accessor);
|
|
return setterTypeAnnotation && getTypeFromTypeNode(setterTypeAnnotation);
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function getTypeOfAccessors(symbol) {
|
|
var links = getSymbolLinks(symbol);
|
|
if (!links.type) {
|
|
if (!pushTypeResolution(symbol)) {
|
|
return unknownType;
|
|
}
|
|
var getter = ts.getDeclarationOfKind(symbol, 142 /* GetAccessor */);
|
|
var setter = ts.getDeclarationOfKind(symbol, 143 /* SetAccessor */);
|
|
var type;
|
|
// First try to see if the user specified a return type on the get-accessor.
|
|
var getterReturnType = getAnnotatedAccessorType(getter);
|
|
if (getterReturnType) {
|
|
type = getterReturnType;
|
|
}
|
|
else {
|
|
// If the user didn't specify a return type, try to use the set-accessor's parameter type.
|
|
var setterParameterType = getAnnotatedAccessorType(setter);
|
|
if (setterParameterType) {
|
|
type = setterParameterType;
|
|
}
|
|
else {
|
|
// If there are no specified types, try to infer it from the body of the get accessor if it exists.
|
|
if (getter && getter.body) {
|
|
type = getReturnTypeFromBody(getter);
|
|
}
|
|
else {
|
|
if (compilerOptions.noImplicitAny) {
|
|
error(setter, ts.Diagnostics.Property_0_implicitly_has_type_any_because_its_set_accessor_lacks_a_type_annotation, symbolToString(symbol));
|
|
}
|
|
type = anyType;
|
|
}
|
|
}
|
|
}
|
|
if (!popTypeResolution()) {
|
|
type = anyType;
|
|
if (compilerOptions.noImplicitAny) {
|
|
var getter_1 = ts.getDeclarationOfKind(symbol, 142 /* GetAccessor */);
|
|
error(getter_1, 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));
|
|
}
|
|
}
|
|
links.type = type;
|
|
}
|
|
return links.type;
|
|
}
|
|
function getTypeOfFuncClassEnumModule(symbol) {
|
|
var links = getSymbolLinks(symbol);
|
|
if (!links.type) {
|
|
links.type = createObjectType(65536 /* Anonymous */, symbol);
|
|
}
|
|
return links.type;
|
|
}
|
|
function getTypeOfEnumMember(symbol) {
|
|
var links = getSymbolLinks(symbol);
|
|
if (!links.type) {
|
|
links.type = getDeclaredTypeOfEnum(getParentOfSymbol(symbol));
|
|
}
|
|
return links.type;
|
|
}
|
|
function getTypeOfAlias(symbol) {
|
|
var links = getSymbolLinks(symbol);
|
|
if (!links.type) {
|
|
var targetSymbol = resolveAlias(symbol);
|
|
// 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 = targetSymbol.flags & 107455 /* Value */
|
|
? getTypeOfSymbol(targetSymbol)
|
|
: unknownType;
|
|
}
|
|
return links.type;
|
|
}
|
|
function getTypeOfInstantiatedSymbol(symbol) {
|
|
var links = getSymbolLinks(symbol);
|
|
if (!links.type) {
|
|
links.type = instantiateType(getTypeOfSymbol(links.target), links.mapper);
|
|
}
|
|
return links.type;
|
|
}
|
|
function getTypeOfSymbol(symbol) {
|
|
if (symbol.flags & 16777216 /* Instantiated */) {
|
|
return getTypeOfInstantiatedSymbol(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 & 8388608 /* Alias */) {
|
|
return getTypeOfAlias(symbol);
|
|
}
|
|
return unknownType;
|
|
}
|
|
function getTargetType(type) {
|
|
return type.flags & 4096 /* Reference */ ? type.target : type;
|
|
}
|
|
function hasBaseType(type, checkBase) {
|
|
return check(type);
|
|
function check(type) {
|
|
var target = getTargetType(type);
|
|
return target === checkBase || ts.forEach(getBaseTypes(target), check);
|
|
}
|
|
}
|
|
// 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; _i < declarations.length; _i++) {
|
|
var declaration = declarations[_i];
|
|
var tp = getDeclaredTypeOfTypeParameter(getSymbolOfNode(declaration));
|
|
if (!typeParameters) {
|
|
typeParameters = [tp];
|
|
}
|
|
else if (!ts.contains(typeParameters, tp)) {
|
|
typeParameters.push(tp);
|
|
}
|
|
}
|
|
return typeParameters;
|
|
}
|
|
// Appends the outer type parameters of a node 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 appendOuterTypeParameters(typeParameters, node) {
|
|
while (true) {
|
|
node = node.parent;
|
|
if (!node) {
|
|
return typeParameters;
|
|
}
|
|
if (node.kind === 211 /* ClassDeclaration */ || node.kind === 183 /* ClassExpression */ ||
|
|
node.kind === 210 /* FunctionDeclaration */ || node.kind === 170 /* FunctionExpression */ ||
|
|
node.kind === 140 /* MethodDeclaration */ || node.kind === 171 /* ArrowFunction */) {
|
|
var declarations = node.typeParameters;
|
|
if (declarations) {
|
|
return appendTypeParameters(appendOuterTypeParameters(typeParameters, node), declarations);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
// 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, 212 /* InterfaceDeclaration */);
|
|
return appendOuterTypeParameters(undefined, 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) {
|
|
var result;
|
|
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
|
|
var node = _a[_i];
|
|
if (node.kind === 212 /* InterfaceDeclaration */ || node.kind === 211 /* ClassDeclaration */ ||
|
|
node.kind === 183 /* ClassExpression */ || node.kind === 213 /* TypeAliasDeclaration */) {
|
|
var declaration = node;
|
|
if (declaration.typeParameters) {
|
|
result = appendTypeParameters(result, declaration.typeParameters);
|
|
}
|
|
}
|
|
}
|
|
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));
|
|
}
|
|
function isConstructorType(type) {
|
|
return type.flags & 80896 /* ObjectType */ && getSignaturesOfType(type, 1 /* Construct */).length > 0;
|
|
}
|
|
function getBaseTypeNodeOfClass(type) {
|
|
return ts.getClassExtendsHeritageClauseElement(type.symbol.valueDeclaration);
|
|
}
|
|
function getConstructorsForTypeArguments(type, typeArgumentNodes) {
|
|
var typeArgCount = typeArgumentNodes ? typeArgumentNodes.length : 0;
|
|
return ts.filter(getSignaturesOfType(type, 1 /* Construct */), function (sig) { return (sig.typeParameters ? sig.typeParameters.length : 0) === typeArgCount; });
|
|
}
|
|
function getInstantiatedConstructorsForTypeArguments(type, typeArgumentNodes) {
|
|
var signatures = getConstructorsForTypeArguments(type, typeArgumentNodes);
|
|
if (typeArgumentNodes) {
|
|
var typeArguments = ts.map(typeArgumentNodes, getTypeFromTypeNode);
|
|
signatures = ts.map(signatures, function (sig) { return getSignatureInstantiation(sig, typeArguments); });
|
|
}
|
|
return signatures;
|
|
}
|
|
// 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, or
|
|
// an object type with at least one construct signature.
|
|
function getBaseConstructorTypeOfClass(type) {
|
|
if (!type.resolvedBaseConstructorType) {
|
|
var baseTypeNode = getBaseTypeNodeOfClass(type);
|
|
if (!baseTypeNode) {
|
|
return type.resolvedBaseConstructorType = undefinedType;
|
|
}
|
|
if (!pushTypeResolution(type)) {
|
|
return unknownType;
|
|
}
|
|
var baseConstructorType = checkExpression(baseTypeNode.expression);
|
|
if (baseConstructorType.flags & 80896 /* ObjectType */) {
|
|
// 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 = unknownType;
|
|
}
|
|
if (baseConstructorType !== unknownType && baseConstructorType !== nullType && !isConstructorType(baseConstructorType)) {
|
|
error(baseTypeNode.expression, ts.Diagnostics.Type_0_is_not_a_constructor_function_type, typeToString(baseConstructorType));
|
|
return type.resolvedBaseConstructorType = unknownType;
|
|
}
|
|
type.resolvedBaseConstructorType = baseConstructorType;
|
|
}
|
|
return type.resolvedBaseConstructorType;
|
|
}
|
|
function getBaseTypes(type) {
|
|
if (!type.resolvedBaseTypes) {
|
|
if (type.symbol.flags & 32 /* Class */) {
|
|
resolveBaseTypesOfClass(type);
|
|
}
|
|
else if (type.symbol.flags & 64 /* Interface */) {
|
|
resolveBaseTypesOfInterface(type);
|
|
}
|
|
else {
|
|
ts.Debug.fail("type must be class or interface");
|
|
}
|
|
}
|
|
return type.resolvedBaseTypes;
|
|
}
|
|
function resolveBaseTypesOfClass(type) {
|
|
type.resolvedBaseTypes = emptyArray;
|
|
var baseContructorType = getBaseConstructorTypeOfClass(type);
|
|
if (!(baseContructorType.flags & 80896 /* ObjectType */)) {
|
|
return;
|
|
}
|
|
var baseTypeNode = getBaseTypeNodeOfClass(type);
|
|
var baseType;
|
|
if (baseContructorType.symbol && baseContructorType.symbol.flags & 32 /* Class */) {
|
|
// When base constructor type is a class 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, baseContructorType.symbol);
|
|
}
|
|
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(baseContructorType, baseTypeNode.typeArguments);
|
|
if (!constructors.length) {
|
|
error(baseTypeNode.expression, ts.Diagnostics.No_base_constructor_has_the_specified_number_of_type_arguments);
|
|
return;
|
|
}
|
|
baseType = getReturnTypeOfSignature(constructors[0]);
|
|
}
|
|
if (baseType === unknownType) {
|
|
return;
|
|
}
|
|
if (!(getTargetType(baseType).flags & (1024 /* Class */ | 2048 /* Interface */))) {
|
|
error(baseTypeNode.expression, ts.Diagnostics.Base_constructor_return_type_0_is_not_a_class_or_interface_type, typeToString(baseType));
|
|
return;
|
|
}
|
|
if (type === baseType || hasBaseType(baseType, type)) {
|
|
error(type.symbol.valueDeclaration, ts.Diagnostics.Type_0_recursively_references_itself_as_a_base_type, typeToString(type, undefined, 1 /* WriteArrayAsGenericType */));
|
|
return;
|
|
}
|
|
type.resolvedBaseTypes = [baseType];
|
|
}
|
|
function resolveBaseTypesOfInterface(type) {
|
|
type.resolvedBaseTypes = [];
|
|
for (var _i = 0, _a = type.symbol.declarations; _i < _a.length; _i++) {
|
|
var declaration = _a[_i];
|
|
if (declaration.kind === 212 /* InterfaceDeclaration */ && ts.getInterfaceBaseTypeNodes(declaration)) {
|
|
for (var _b = 0, _c = ts.getInterfaceBaseTypeNodes(declaration); _b < _c.length; _b++) {
|
|
var node = _c[_b];
|
|
var baseType = getTypeFromTypeNode(node);
|
|
if (baseType !== unknownType) {
|
|
if (getTargetType(baseType).flags & (1024 /* Class */ | 2048 /* Interface */)) {
|
|
if (type !== baseType && !hasBaseType(baseType, type)) {
|
|
type.resolvedBaseTypes.push(baseType);
|
|
}
|
|
else {
|
|
error(declaration, ts.Diagnostics.Type_0_recursively_references_itself_as_a_base_type, typeToString(type, undefined, 1 /* WriteArrayAsGenericType */));
|
|
}
|
|
}
|
|
else {
|
|
error(node, ts.Diagnostics.An_interface_may_only_extend_a_class_or_another_interface);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function getDeclaredTypeOfClassOrInterface(symbol) {
|
|
var links = getSymbolLinks(symbol);
|
|
if (!links.declaredType) {
|
|
var kind = symbol.flags & 32 /* Class */ ? 1024 /* Class */ : 2048 /* Interface */;
|
|
var type = links.declaredType = createObjectType(kind, symbol);
|
|
var outerTypeParameters = getOuterTypeParametersOfClassOrInterface(symbol);
|
|
var localTypeParameters = getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(symbol);
|
|
if (outerTypeParameters || localTypeParameters) {
|
|
type.flags |= 4096 /* Reference */;
|
|
type.typeParameters = ts.concatenate(outerTypeParameters, localTypeParameters);
|
|
type.outerTypeParameters = outerTypeParameters;
|
|
type.localTypeParameters = localTypeParameters;
|
|
type.instantiations = {};
|
|
type.instantiations[getTypeListId(type.typeParameters)] = type;
|
|
type.target = type;
|
|
type.typeArguments = type.typeParameters;
|
|
}
|
|
}
|
|
return links.declaredType;
|
|
}
|
|
function getDeclaredTypeOfTypeAlias(symbol) {
|
|
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(links)) {
|
|
return unknownType;
|
|
}
|
|
var declaration = ts.getDeclarationOfKind(symbol, 213 /* TypeAliasDeclaration */);
|
|
var type = getTypeFromTypeNode(declaration.type);
|
|
if (popTypeResolution()) {
|
|
links.typeParameters = getLocalTypeParametersOfClassOrInterfaceOrTypeAlias(symbol);
|
|
if (links.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.instantiations = {};
|
|
links.instantiations[getTypeListId(links.typeParameters)] = type;
|
|
}
|
|
}
|
|
else {
|
|
type = unknownType;
|
|
error(declaration.name, ts.Diagnostics.Type_alias_0_circularly_references_itself, symbolToString(symbol));
|
|
}
|
|
links.declaredType = type;
|
|
}
|
|
return links.declaredType;
|
|
}
|
|
function getDeclaredTypeOfEnum(symbol) {
|
|
var links = getSymbolLinks(symbol);
|
|
if (!links.declaredType) {
|
|
var type = createType(128 /* Enum */);
|
|
type.symbol = symbol;
|
|
links.declaredType = type;
|
|
}
|
|
return links.declaredType;
|
|
}
|
|
function getDeclaredTypeOfTypeParameter(symbol) {
|
|
var links = getSymbolLinks(symbol);
|
|
if (!links.declaredType) {
|
|
var type = createType(512 /* TypeParameter */);
|
|
type.symbol = symbol;
|
|
if (!ts.getDeclarationOfKind(symbol, 134 /* TypeParameter */).constraint) {
|
|
type.constraint = noConstraintType;
|
|
}
|
|
links.declaredType = type;
|
|
}
|
|
return links.declaredType;
|
|
}
|
|
function getDeclaredTypeOfAlias(symbol) {
|
|
var links = getSymbolLinks(symbol);
|
|
if (!links.declaredType) {
|
|
links.declaredType = getDeclaredTypeOfSymbol(resolveAlias(symbol));
|
|
}
|
|
return links.declaredType;
|
|
}
|
|
function getDeclaredTypeOfSymbol(symbol) {
|
|
ts.Debug.assert((symbol.flags & 16777216 /* Instantiated */) === 0);
|
|
if (symbol.flags & (32 /* Class */ | 64 /* Interface */)) {
|
|
return getDeclaredTypeOfClassOrInterface(symbol);
|
|
}
|
|
if (symbol.flags & 524288 /* TypeAlias */) {
|
|
return getDeclaredTypeOfTypeAlias(symbol);
|
|
}
|
|
if (symbol.flags & 384 /* Enum */) {
|
|
return getDeclaredTypeOfEnum(symbol);
|
|
}
|
|
if (symbol.flags & 262144 /* TypeParameter */) {
|
|
return getDeclaredTypeOfTypeParameter(symbol);
|
|
}
|
|
if (symbol.flags & 8388608 /* Alias */) {
|
|
return getDeclaredTypeOfAlias(symbol);
|
|
}
|
|
return unknownType;
|
|
}
|
|
function createSymbolTable(symbols) {
|
|
var result = {};
|
|
for (var _i = 0; _i < symbols.length; _i++) {
|
|
var symbol = symbols[_i];
|
|
result[symbol.name] = symbol;
|
|
}
|
|
return result;
|
|
}
|
|
function createInstantiatedSymbolTable(symbols, mapper) {
|
|
var result = {};
|
|
for (var _i = 0; _i < symbols.length; _i++) {
|
|
var symbol = symbols[_i];
|
|
result[symbol.name] = instantiateSymbol(symbol, mapper);
|
|
}
|
|
return result;
|
|
}
|
|
function addInheritedMembers(symbols, baseSymbols) {
|
|
for (var _i = 0; _i < baseSymbols.length; _i++) {
|
|
var s = baseSymbols[_i];
|
|
if (!ts.hasProperty(symbols, s.name)) {
|
|
symbols[s.name] = s;
|
|
}
|
|
}
|
|
}
|
|
function addInheritedSignatures(signatures, baseSignatures) {
|
|
if (baseSignatures) {
|
|
for (var _i = 0; _i < baseSignatures.length; _i++) {
|
|
var signature = baseSignatures[_i];
|
|
signatures.push(signature);
|
|
}
|
|
}
|
|
}
|
|
function resolveDeclaredMembers(type) {
|
|
if (!type.declaredProperties) {
|
|
var symbol = type.symbol;
|
|
type.declaredProperties = getNamedMembers(symbol.members);
|
|
type.declaredCallSignatures = getSignaturesOfSymbol(symbol.members["__call"]);
|
|
type.declaredConstructSignatures = getSignaturesOfSymbol(symbol.members["__new"]);
|
|
type.declaredStringIndexType = getIndexTypeOfSymbol(symbol, 0 /* String */);
|
|
type.declaredNumberIndexType = getIndexTypeOfSymbol(symbol, 1 /* Number */);
|
|
}
|
|
return type;
|
|
}
|
|
function resolveClassOrInterfaceMembers(type) {
|
|
var target = resolveDeclaredMembers(type);
|
|
var members = target.symbol.members;
|
|
var callSignatures = target.declaredCallSignatures;
|
|
var constructSignatures = target.declaredConstructSignatures;
|
|
var stringIndexType = target.declaredStringIndexType;
|
|
var numberIndexType = target.declaredNumberIndexType;
|
|
var baseTypes = getBaseTypes(target);
|
|
if (baseTypes.length) {
|
|
members = createSymbolTable(target.declaredProperties);
|
|
for (var _i = 0; _i < baseTypes.length; _i++) {
|
|
var baseType = baseTypes[_i];
|
|
addInheritedMembers(members, getPropertiesOfObjectType(baseType));
|
|
callSignatures = ts.concatenate(callSignatures, getSignaturesOfType(baseType, 0 /* Call */));
|
|
constructSignatures = ts.concatenate(constructSignatures, getSignaturesOfType(baseType, 1 /* Construct */));
|
|
stringIndexType = stringIndexType || getIndexTypeOfType(baseType, 0 /* String */);
|
|
numberIndexType = numberIndexType || getIndexTypeOfType(baseType, 1 /* Number */);
|
|
}
|
|
}
|
|
setObjectTypeMembers(type, members, callSignatures, constructSignatures, stringIndexType, numberIndexType);
|
|
}
|
|
function resolveTypeReferenceMembers(type) {
|
|
var target = resolveDeclaredMembers(type.target);
|
|
var mapper = createTypeMapper(target.typeParameters, type.typeArguments);
|
|
var members = createInstantiatedSymbolTable(target.declaredProperties, mapper);
|
|
var callSignatures = instantiateList(target.declaredCallSignatures, mapper, instantiateSignature);
|
|
var constructSignatures = instantiateList(target.declaredConstructSignatures, mapper, instantiateSignature);
|
|
var stringIndexType = target.declaredStringIndexType ? instantiateType(target.declaredStringIndexType, mapper) : undefined;
|
|
var numberIndexType = target.declaredNumberIndexType ? instantiateType(target.declaredNumberIndexType, mapper) : undefined;
|
|
ts.forEach(getBaseTypes(target), function (baseType) {
|
|
var instantiatedBaseType = instantiateType(baseType, mapper);
|
|
addInheritedMembers(members, getPropertiesOfObjectType(instantiatedBaseType));
|
|
callSignatures = ts.concatenate(callSignatures, getSignaturesOfType(instantiatedBaseType, 0 /* Call */));
|
|
constructSignatures = ts.concatenate(constructSignatures, getSignaturesOfType(instantiatedBaseType, 1 /* Construct */));
|
|
stringIndexType = stringIndexType || getIndexTypeOfType(instantiatedBaseType, 0 /* String */);
|
|
numberIndexType = numberIndexType || getIndexTypeOfType(instantiatedBaseType, 1 /* Number */);
|
|
});
|
|
setObjectTypeMembers(type, members, callSignatures, constructSignatures, stringIndexType, numberIndexType);
|
|
}
|
|
function createSignature(declaration, typeParameters, parameters, resolvedReturnType, typePredicate, minArgumentCount, hasRestParameter, hasStringLiterals) {
|
|
var sig = new Signature(checker);
|
|
sig.declaration = declaration;
|
|
sig.typeParameters = typeParameters;
|
|
sig.parameters = parameters;
|
|
sig.resolvedReturnType = resolvedReturnType;
|
|
sig.typePredicate = typePredicate;
|
|
sig.minArgumentCount = minArgumentCount;
|
|
sig.hasRestParameter = hasRestParameter;
|
|
sig.hasStringLiterals = hasStringLiterals;
|
|
return sig;
|
|
}
|
|
function cloneSignature(sig) {
|
|
return createSignature(sig.declaration, sig.typeParameters, sig.parameters, sig.resolvedReturnType, sig.typePredicate, sig.minArgumentCount, sig.hasRestParameter, sig.hasStringLiterals);
|
|
}
|
|
function getDefaultConstructSignatures(classType) {
|
|
if (!getBaseTypes(classType).length) {
|
|
return [createSignature(undefined, classType.localTypeParameters, emptyArray, classType, undefined, 0, false, false)];
|
|
}
|
|
var baseConstructorType = getBaseConstructorTypeOfClass(classType);
|
|
var baseSignatures = getSignaturesOfType(baseConstructorType, 1 /* Construct */);
|
|
var baseTypeNode = getBaseTypeNodeOfClass(classType);
|
|
var typeArguments = ts.map(baseTypeNode.typeArguments, getTypeFromTypeNode);
|
|
var typeArgCount = typeArguments ? typeArguments.length : 0;
|
|
var result = [];
|
|
for (var _i = 0; _i < baseSignatures.length; _i++) {
|
|
var baseSig = baseSignatures[_i];
|
|
var typeParamCount = baseSig.typeParameters ? baseSig.typeParameters.length : 0;
|
|
if (typeParamCount === typeArgCount) {
|
|
var sig = typeParamCount ? getSignatureInstantiation(baseSig, typeArguments) : cloneSignature(baseSig);
|
|
sig.typeParameters = classType.localTypeParameters;
|
|
sig.resolvedReturnType = classType;
|
|
result.push(sig);
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
function createTupleTypeMemberSymbols(memberTypes) {
|
|
var members = {};
|
|
for (var i = 0; i < memberTypes.length; i++) {
|
|
var symbol = createSymbol(4 /* Property */ | 67108864 /* Transient */, "" + i);
|
|
symbol.type = memberTypes[i];
|
|
members[i] = symbol;
|
|
}
|
|
return members;
|
|
}
|
|
function resolveTupleTypeMembers(type) {
|
|
var arrayType = resolveStructuredTypeMembers(createArrayType(getUnionType(type.elementTypes)));
|
|
var members = createTupleTypeMemberSymbols(type.elementTypes);
|
|
addInheritedMembers(members, arrayType.properties);
|
|
setObjectTypeMembers(type, members, arrayType.callSignatures, arrayType.constructSignatures, arrayType.stringIndexType, arrayType.numberIndexType);
|
|
}
|
|
function signatureListsIdentical(s, t) {
|
|
if (s.length !== t.length) {
|
|
return false;
|
|
}
|
|
for (var i = 0; i < s.length; i++) {
|
|
if (!compareSignatures(s[i], t[i], false, compareTypes)) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
// If the lists of call or construct signatures in the given types are all identical except for return types,
|
|
// and if none of the signatures are generic, return a list of signatures that has substitutes a union of the
|
|
// return types of the corresponding signatures in each resulting signature.
|
|
function getUnionSignatures(types, kind) {
|
|
var signatureLists = ts.map(types, function (t) { return getSignaturesOfType(t, kind); });
|
|
var signatures = signatureLists[0];
|
|
for (var _i = 0; _i < signatures.length; _i++) {
|
|
var signature = signatures[_i];
|
|
if (signature.typeParameters) {
|
|
return emptyArray;
|
|
}
|
|
}
|
|
for (var i_1 = 1; i_1 < signatureLists.length; i_1++) {
|
|
if (!signatureListsIdentical(signatures, signatureLists[i_1])) {
|
|
return emptyArray;
|
|
}
|
|
}
|
|
var result = ts.map(signatures, cloneSignature);
|
|
for (var i = 0; i < result.length; i++) {
|
|
var s = result[i];
|
|
// Clear resolved return type we possibly got from cloneSignature
|
|
s.resolvedReturnType = undefined;
|
|
s.unionSignatures = ts.map(signatureLists, function (signatures) { return signatures[i]; });
|
|
}
|
|
return result;
|
|
}
|
|
function getUnionIndexType(types, kind) {
|
|
var indexTypes = [];
|
|
for (var _i = 0; _i < types.length; _i++) {
|
|
var type = types[_i];
|
|
var indexType = getIndexTypeOfType(type, kind);
|
|
if (!indexType) {
|
|
return undefined;
|
|
}
|
|
indexTypes.push(indexType);
|
|
}
|
|
return getUnionType(indexTypes);
|
|
}
|
|
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(type.types, 0 /* Call */);
|
|
var constructSignatures = getUnionSignatures(type.types, 1 /* Construct */);
|
|
var stringIndexType = getUnionIndexType(type.types, 0 /* String */);
|
|
var numberIndexType = getUnionIndexType(type.types, 1 /* Number */);
|
|
setObjectTypeMembers(type, emptySymbols, callSignatures, constructSignatures, stringIndexType, numberIndexType);
|
|
}
|
|
function intersectTypes(type1, type2) {
|
|
return !type1 ? type2 : !type2 ? type1 : getIntersectionType([type1, type2]);
|
|
}
|
|
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 = emptyArray;
|
|
var constructSignatures = emptyArray;
|
|
var stringIndexType = undefined;
|
|
var numberIndexType = undefined;
|
|
for (var _i = 0, _a = type.types; _i < _a.length; _i++) {
|
|
var t = _a[_i];
|
|
callSignatures = ts.concatenate(callSignatures, getSignaturesOfType(t, 0 /* Call */));
|
|
constructSignatures = ts.concatenate(constructSignatures, getSignaturesOfType(t, 1 /* Construct */));
|
|
stringIndexType = intersectTypes(stringIndexType, getIndexTypeOfType(t, 0 /* String */));
|
|
numberIndexType = intersectTypes(numberIndexType, getIndexTypeOfType(t, 1 /* Number */));
|
|
}
|
|
setObjectTypeMembers(type, emptySymbols, callSignatures, constructSignatures, stringIndexType, numberIndexType);
|
|
}
|
|
function resolveAnonymousTypeMembers(type) {
|
|
var symbol = type.symbol;
|
|
var members;
|
|
var callSignatures;
|
|
var constructSignatures;
|
|
var stringIndexType;
|
|
var numberIndexType;
|
|
if (symbol.flags & 2048 /* TypeLiteral */) {
|
|
members = symbol.members;
|
|
callSignatures = getSignaturesOfSymbol(members["__call"]);
|
|
constructSignatures = getSignaturesOfSymbol(members["__new"]);
|
|
stringIndexType = getIndexTypeOfSymbol(symbol, 0 /* String */);
|
|
numberIndexType = getIndexTypeOfSymbol(symbol, 1 /* Number */);
|
|
}
|
|
else {
|
|
// Combinations of function, class, enum and module
|
|
members = emptySymbols;
|
|
callSignatures = emptyArray;
|
|
constructSignatures = emptyArray;
|
|
if (symbol.flags & 1952 /* HasExports */) {
|
|
members = getExportsOfSymbol(symbol);
|
|
}
|
|
if (symbol.flags & (16 /* Function */ | 8192 /* Method */)) {
|
|
callSignatures = getSignaturesOfSymbol(symbol);
|
|
}
|
|
if (symbol.flags & 32 /* Class */) {
|
|
var classType = getDeclaredTypeOfClassOrInterface(symbol);
|
|
constructSignatures = getSignaturesOfSymbol(symbol.members["__constructor"]);
|
|
if (!constructSignatures.length) {
|
|
constructSignatures = getDefaultConstructSignatures(classType);
|
|
}
|
|
var baseConstructorType = getBaseConstructorTypeOfClass(classType);
|
|
if (baseConstructorType.flags & 80896 /* ObjectType */) {
|
|
members = createSymbolTable(getNamedMembers(members));
|
|
addInheritedMembers(members, getPropertiesOfObjectType(baseConstructorType));
|
|
}
|
|
}
|
|
stringIndexType = undefined;
|
|
numberIndexType = (symbol.flags & 384 /* Enum */) ? stringType : undefined;
|
|
}
|
|
setObjectTypeMembers(type, members, callSignatures, constructSignatures, stringIndexType, numberIndexType);
|
|
}
|
|
function resolveStructuredTypeMembers(type) {
|
|
if (!type.members) {
|
|
if (type.flags & (1024 /* Class */ | 2048 /* Interface */)) {
|
|
resolveClassOrInterfaceMembers(type);
|
|
}
|
|
else if (type.flags & 65536 /* Anonymous */) {
|
|
resolveAnonymousTypeMembers(type);
|
|
}
|
|
else if (type.flags & 8192 /* Tuple */) {
|
|
resolveTupleTypeMembers(type);
|
|
}
|
|
else if (type.flags & 16384 /* Union */) {
|
|
resolveUnionTypeMembers(type);
|
|
}
|
|
else if (type.flags & 32768 /* Intersection */) {
|
|
resolveIntersectionTypeMembers(type);
|
|
}
|
|
else {
|
|
resolveTypeReferenceMembers(type);
|
|
}
|
|
}
|
|
return type;
|
|
}
|
|
// Return properties of an object type or an empty array for other types
|
|
function getPropertiesOfObjectType(type) {
|
|
if (type.flags & 80896 /* ObjectType */) {
|
|
return resolveStructuredTypeMembers(type).properties;
|
|
}
|
|
return 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 & 80896 /* ObjectType */) {
|
|
var resolved = resolveStructuredTypeMembers(type);
|
|
if (ts.hasProperty(resolved.members, name)) {
|
|
var symbol = resolved.members[name];
|
|
if (symbolIsValue(symbol)) {
|
|
return symbol;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function getPropertiesOfUnionOrIntersectionType(type) {
|
|
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];
|
|
getPropertyOfUnionOrIntersectionType(type, prop.name);
|
|
}
|
|
// 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
|
|
if (type.flags & 16384 /* Union */) {
|
|
break;
|
|
}
|
|
}
|
|
return type.resolvedProperties ? symbolsToArray(type.resolvedProperties) : emptyArray;
|
|
}
|
|
function getPropertiesOfType(type) {
|
|
type = getApparentType(type);
|
|
return type.flags & 49152 /* UnionOrIntersection */ ? getPropertiesOfUnionOrIntersectionType(type) : getPropertiesOfObjectType(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. Note that the apparent type of a union type is the union type itself.
|
|
*/
|
|
function getApparentType(type) {
|
|
if (type.flags & 16384 /* Union */) {
|
|
type = getReducedTypeOfUnionType(type);
|
|
}
|
|
if (type.flags & 512 /* TypeParameter */) {
|
|
do {
|
|
type = getConstraintOfTypeParameter(type);
|
|
} while (type && type.flags & 512 /* TypeParameter */);
|
|
if (!type) {
|
|
type = emptyObjectType;
|
|
}
|
|
}
|
|
if (type.flags & 258 /* StringLike */) {
|
|
type = globalStringType;
|
|
}
|
|
else if (type.flags & 132 /* NumberLike */) {
|
|
type = globalNumberType;
|
|
}
|
|
else if (type.flags & 8 /* Boolean */) {
|
|
type = globalBooleanType;
|
|
}
|
|
else if (type.flags & 4194304 /* ESSymbol */) {
|
|
type = globalESSymbolType;
|
|
}
|
|
return type;
|
|
}
|
|
function createUnionOrIntersectionProperty(containingType, name) {
|
|
var types = containingType.types;
|
|
var props;
|
|
for (var _i = 0; _i < types.length; _i++) {
|
|
var current = types[_i];
|
|
var type = getApparentType(current);
|
|
if (type !== unknownType) {
|
|
var prop = getPropertyOfType(type, name);
|
|
if (prop && !(getDeclarationFlagsFromSymbol(prop) & (32 /* Private */ | 64 /* Protected */))) {
|
|
if (!props) {
|
|
props = [prop];
|
|
}
|
|
else if (!ts.contains(props, prop)) {
|
|
props.push(prop);
|
|
}
|
|
}
|
|
else if (containingType.flags & 16384 /* Union */) {
|
|
// A union type requires the property to be present in all constituent types
|
|
return undefined;
|
|
}
|
|
}
|
|
}
|
|
if (!props) {
|
|
return undefined;
|
|
}
|
|
if (props.length === 1) {
|
|
return props[0];
|
|
}
|
|
var propTypes = [];
|
|
var declarations = [];
|
|
for (var _a = 0; _a < props.length; _a++) {
|
|
var prop = props[_a];
|
|
if (prop.declarations) {
|
|
ts.addRange(declarations, prop.declarations);
|
|
}
|
|
propTypes.push(getTypeOfSymbol(prop));
|
|
}
|
|
var result = createSymbol(4 /* Property */ | 67108864 /* Transient */ | 268435456 /* SyntheticProperty */, name);
|
|
result.containingType = containingType;
|
|
result.declarations = declarations;
|
|
result.type = containingType.flags & 16384 /* Union */ ? getUnionType(propTypes) : getIntersectionType(propTypes);
|
|
return result;
|
|
}
|
|
function getPropertyOfUnionOrIntersectionType(type, name) {
|
|
var properties = type.resolvedProperties || (type.resolvedProperties = {});
|
|
if (ts.hasProperty(properties, name)) {
|
|
return properties[name];
|
|
}
|
|
var property = createUnionOrIntersectionProperty(type, name);
|
|
if (property) {
|
|
properties[name] = property;
|
|
}
|
|
return property;
|
|
}
|
|
// 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.
|
|
function getPropertyOfType(type, name) {
|
|
type = getApparentType(type);
|
|
if (type.flags & 80896 /* ObjectType */) {
|
|
var resolved = resolveStructuredTypeMembers(type);
|
|
if (ts.hasProperty(resolved.members, name)) {
|
|
var symbol = resolved.members[name];
|
|
if (symbolIsValue(symbol)) {
|
|
return symbol;
|
|
}
|
|
}
|
|
if (resolved === anyFunctionType || resolved.callSignatures.length || resolved.constructSignatures.length) {
|
|
var symbol = getPropertyOfObjectType(globalFunctionType, name);
|
|
if (symbol) {
|
|
return symbol;
|
|
}
|
|
}
|
|
return getPropertyOfObjectType(globalObjectType, name);
|
|
}
|
|
if (type.flags & 49152 /* UnionOrIntersection */) {
|
|
return getPropertyOfUnionOrIntersectionType(type, name);
|
|
}
|
|
return undefined;
|
|
}
|
|
function getSignaturesOfStructuredType(type, kind) {
|
|
if (type.flags & 130048 /* StructuredType */) {
|
|
var resolved = resolveStructuredTypeMembers(type);
|
|
return kind === 0 /* Call */ ? resolved.callSignatures : resolved.constructSignatures;
|
|
}
|
|
return 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(getApparentType(type), kind);
|
|
}
|
|
function typeHasConstructSignatures(type) {
|
|
var apparentType = getApparentType(type);
|
|
if (apparentType.flags & (80896 /* ObjectType */ | 16384 /* Union */)) {
|
|
var resolved = resolveStructuredTypeMembers(type);
|
|
return resolved.constructSignatures.length > 0;
|
|
}
|
|
return false;
|
|
}
|
|
function typeHasCallOrConstructSignatures(type) {
|
|
var apparentType = getApparentType(type);
|
|
if (apparentType.flags & 130048 /* StructuredType */) {
|
|
var resolved = resolveStructuredTypeMembers(type);
|
|
return resolved.callSignatures.length > 0 || resolved.constructSignatures.length > 0;
|
|
}
|
|
return false;
|
|
}
|
|
function getIndexTypeOfStructuredType(type, kind) {
|
|
if (type.flags & 130048 /* StructuredType */) {
|
|
var resolved = resolveStructuredTypeMembers(type);
|
|
return kind === 0 /* String */ ? resolved.stringIndexType : resolved.numberIndexType;
|
|
}
|
|
}
|
|
// 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, kind) {
|
|
return getIndexTypeOfStructuredType(getApparentType(type), kind);
|
|
}
|
|
// Return list of type parameters with duplicates removed (duplicate identifier errors are generated in the actual
|
|
// type checking functions).
|
|
function getTypeParametersFromDeclaration(typeParameterDeclarations) {
|
|
var result = [];
|
|
ts.forEach(typeParameterDeclarations, function (node) {
|
|
var tp = getDeclaredTypeOfTypeParameter(node.symbol);
|
|
if (!ts.contains(result, tp)) {
|
|
result.push(tp);
|
|
}
|
|
});
|
|
return result;
|
|
}
|
|
function symbolsToArray(symbols) {
|
|
var result = [];
|
|
for (var id in symbols) {
|
|
if (!isReservedMemberName(id)) {
|
|
result.push(symbols[id]);
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
function isOptionalParameter(node) {
|
|
return ts.hasQuestionToken(node) || !!node.initializer;
|
|
}
|
|
function getSignatureFromDeclaration(declaration) {
|
|
var links = getNodeLinks(declaration);
|
|
if (!links.resolvedSignature) {
|
|
var classType = declaration.kind === 141 /* Constructor */ ? getDeclaredTypeOfClassOrInterface(declaration.parent.symbol) : undefined;
|
|
var typeParameters = classType ? classType.localTypeParameters :
|
|
declaration.typeParameters ? getTypeParametersFromDeclaration(declaration.typeParameters) : undefined;
|
|
var parameters = [];
|
|
var hasStringLiterals = false;
|
|
var minArgumentCount = -1;
|
|
for (var i = 0, n = declaration.parameters.length; i < n; i++) {
|
|
var param = declaration.parameters[i];
|
|
parameters.push(param.symbol);
|
|
if (param.type && param.type.kind === 8 /* StringLiteral */) {
|
|
hasStringLiterals = true;
|
|
}
|
|
if (minArgumentCount < 0) {
|
|
if (param.initializer || param.questionToken || param.dotDotDotToken) {
|
|
minArgumentCount = i;
|
|
}
|
|
}
|
|
}
|
|
if (minArgumentCount < 0) {
|
|
minArgumentCount = declaration.parameters.length;
|
|
}
|
|
var returnType;
|
|
var typePredicate;
|
|
if (classType) {
|
|
returnType = classType;
|
|
}
|
|
else if (declaration.type) {
|
|
returnType = getTypeFromTypeNode(declaration.type);
|
|
if (declaration.type.kind === 147 /* TypePredicate */) {
|
|
var typePredicateNode = declaration.type;
|
|
typePredicate = {
|
|
parameterName: typePredicateNode.parameterName ? typePredicateNode.parameterName.text : undefined,
|
|
parameterIndex: typePredicateNode.parameterName ? getTypePredicateParameterIndex(declaration.parameters, typePredicateNode.parameterName) : undefined,
|
|
type: getTypeFromTypeNode(typePredicateNode.type)
|
|
};
|
|
}
|
|
}
|
|
else {
|
|
// TypeScript 1.0 spec (April 2014):
|
|
// If only one accessor includes a type annotation, the other behaves as if it had the same type annotation.
|
|
if (declaration.kind === 142 /* GetAccessor */ && !ts.hasDynamicName(declaration)) {
|
|
var setter = ts.getDeclarationOfKind(declaration.symbol, 143 /* SetAccessor */);
|
|
returnType = getAnnotatedAccessorType(setter);
|
|
}
|
|
if (!returnType && ts.nodeIsMissing(declaration.body)) {
|
|
returnType = anyType;
|
|
}
|
|
}
|
|
links.resolvedSignature = createSignature(declaration, typeParameters, parameters, returnType, typePredicate, minArgumentCount, ts.hasRestParameter(declaration), hasStringLiterals);
|
|
}
|
|
return links.resolvedSignature;
|
|
}
|
|
function getSignaturesOfSymbol(symbol) {
|
|
if (!symbol)
|
|
return emptyArray;
|
|
var result = [];
|
|
for (var i = 0, len = symbol.declarations.length; i < len; i++) {
|
|
var node = symbol.declarations[i];
|
|
switch (node.kind) {
|
|
case 149 /* FunctionType */:
|
|
case 150 /* ConstructorType */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 141 /* Constructor */:
|
|
case 144 /* CallSignature */:
|
|
case 145 /* ConstructSignature */:
|
|
case 146 /* IndexSignature */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
// 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 && node.body) {
|
|
var previous = symbol.declarations[i - 1];
|
|
if (node.parent === previous.parent && node.kind === previous.kind && node.pos === previous.end) {
|
|
break;
|
|
}
|
|
}
|
|
result.push(getSignatureFromDeclaration(node));
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
function getReturnTypeOfSignature(signature) {
|
|
if (!signature.resolvedReturnType) {
|
|
if (!pushTypeResolution(signature)) {
|
|
return unknownType;
|
|
}
|
|
var type;
|
|
if (signature.target) {
|
|
type = instantiateType(getReturnTypeOfSignature(signature.target), signature.mapper);
|
|
}
|
|
else if (signature.unionSignatures) {
|
|
type = getUnionType(ts.map(signature.unionSignatures, getReturnTypeOfSignature));
|
|
}
|
|
else {
|
|
type = getReturnTypeFromBody(signature.declaration);
|
|
}
|
|
if (!popTypeResolution()) {
|
|
type = anyType;
|
|
if (compilerOptions.noImplicitAny) {
|
|
var declaration = signature.declaration;
|
|
if (declaration.name) {
|
|
error(declaration.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(declaration.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);
|
|
}
|
|
}
|
|
}
|
|
signature.resolvedReturnType = type;
|
|
}
|
|
return signature.resolvedReturnType;
|
|
}
|
|
function getRestTypeOfSignature(signature) {
|
|
if (signature.hasRestParameter) {
|
|
var type = getTypeOfSymbol(ts.lastOrUndefined(signature.parameters));
|
|
if (type.flags & 4096 /* Reference */ && type.target === globalArrayType) {
|
|
return type.typeArguments[0];
|
|
}
|
|
}
|
|
return anyType;
|
|
}
|
|
function getSignatureInstantiation(signature, typeArguments) {
|
|
return instantiateSignature(signature, createTypeMapper(signature.typeParameters, typeArguments), true);
|
|
}
|
|
function getErasedSignature(signature) {
|
|
if (!signature.typeParameters)
|
|
return signature;
|
|
if (!signature.erasedSignatureCache) {
|
|
if (signature.target) {
|
|
signature.erasedSignatureCache = instantiateSignature(getErasedSignature(signature.target), signature.mapper);
|
|
}
|
|
else {
|
|
signature.erasedSignatureCache = instantiateSignature(signature, createTypeEraser(signature.typeParameters), true);
|
|
}
|
|
}
|
|
return signature.erasedSignatureCache;
|
|
}
|
|
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 isConstructor = signature.declaration.kind === 141 /* Constructor */ || signature.declaration.kind === 145 /* ConstructSignature */;
|
|
var type = createObjectType(65536 /* Anonymous */ | 262144 /* FromSignature */);
|
|
type.members = emptySymbols;
|
|
type.properties = emptyArray;
|
|
type.callSignatures = !isConstructor ? [signature] : emptyArray;
|
|
type.constructSignatures = isConstructor ? [signature] : emptyArray;
|
|
signature.isolatedSignatureType = type;
|
|
}
|
|
return signature.isolatedSignatureType;
|
|
}
|
|
function getIndexSymbol(symbol) {
|
|
return symbol.members["__index"];
|
|
}
|
|
function getIndexDeclarationOfSymbol(symbol, kind) {
|
|
var syntaxKind = kind === 1 /* Number */ ? 125 /* NumberKeyword */ : 127 /* StringKeyword */;
|
|
var indexSymbol = getIndexSymbol(symbol);
|
|
if (indexSymbol) {
|
|
for (var _i = 0, _a = indexSymbol.declarations; _i < _a.length; _i++) {
|
|
var decl = _a[_i];
|
|
var node = decl;
|
|
if (node.parameters.length === 1) {
|
|
var parameter = node.parameters[0];
|
|
if (parameter && parameter.type && parameter.type.kind === syntaxKind) {
|
|
return node;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function getIndexTypeOfSymbol(symbol, kind) {
|
|
var declaration = getIndexDeclarationOfSymbol(symbol, kind);
|
|
return declaration
|
|
? declaration.type ? getTypeFromTypeNode(declaration.type) : anyType
|
|
: undefined;
|
|
}
|
|
function getConstraintOfTypeParameter(type) {
|
|
if (!type.constraint) {
|
|
if (type.target) {
|
|
var targetConstraint = getConstraintOfTypeParameter(type.target);
|
|
type.constraint = targetConstraint ? instantiateType(targetConstraint, type.mapper) : noConstraintType;
|
|
}
|
|
else {
|
|
type.constraint = getTypeFromTypeNode(ts.getDeclarationOfKind(type.symbol, 134 /* TypeParameter */).constraint);
|
|
}
|
|
}
|
|
return type.constraint === noConstraintType ? undefined : type.constraint;
|
|
}
|
|
function getParentSymbolOfTypeParameter(typeParameter) {
|
|
return getSymbolOfNode(ts.getDeclarationOfKind(typeParameter.symbol, 134 /* TypeParameter */).parent);
|
|
}
|
|
function getTypeListId(types) {
|
|
switch (types.length) {
|
|
case 1:
|
|
return "" + types[0].id;
|
|
case 2:
|
|
return types[0].id + "," + types[1].id;
|
|
default:
|
|
var result = "";
|
|
for (var i = 0; i < types.length; i++) {
|
|
if (i > 0) {
|
|
result += ",";
|
|
}
|
|
result += types[i].id;
|
|
}
|
|
return result;
|
|
}
|
|
}
|
|
// This function is used to propagate widening flags when creating new object types references and union types.
|
|
// It is only necessary to do so if a constituent type might be the undefined type, the null type, or the type
|
|
// of an object literal (since those types have widening related information we need to track).
|
|
function getWideningFlagsOfTypes(types) {
|
|
var result = 0;
|
|
for (var _i = 0; _i < types.length; _i++) {
|
|
var type = types[_i];
|
|
result |= type.flags;
|
|
}
|
|
return result & 3145728 /* RequiresWidening */;
|
|
}
|
|
function createTypeReference(target, typeArguments) {
|
|
var id = getTypeListId(typeArguments);
|
|
var type = target.instantiations[id];
|
|
if (!type) {
|
|
var flags = 4096 /* Reference */ | getWideningFlagsOfTypes(typeArguments);
|
|
type = target.instantiations[id] = createObjectType(flags, target.symbol);
|
|
type.target = target;
|
|
type.typeArguments = typeArguments;
|
|
}
|
|
return type;
|
|
}
|
|
function isTypeParameterReferenceIllegalInConstraint(typeReferenceNode, typeParameterSymbol) {
|
|
var links = getNodeLinks(typeReferenceNode);
|
|
if (links.isIllegalTypeReferenceInConstraint !== undefined) {
|
|
return links.isIllegalTypeReferenceInConstraint;
|
|
}
|
|
// bubble up to the declaration
|
|
var currentNode = typeReferenceNode;
|
|
// forEach === exists
|
|
while (!ts.forEach(typeParameterSymbol.declarations, function (d) { return d.parent === currentNode.parent; })) {
|
|
currentNode = currentNode.parent;
|
|
}
|
|
// if last step was made from the type parameter this means that path has started somewhere in constraint which is illegal
|
|
links.isIllegalTypeReferenceInConstraint = currentNode.kind === 134 /* TypeParameter */;
|
|
return links.isIllegalTypeReferenceInConstraint;
|
|
}
|
|
function checkTypeParameterHasIllegalReferencesInConstraint(typeParameter) {
|
|
var typeParameterSymbol;
|
|
function check(n) {
|
|
if (n.kind === 148 /* TypeReference */ && n.typeName.kind === 66 /* Identifier */) {
|
|
var links = getNodeLinks(n);
|
|
if (links.isIllegalTypeReferenceInConstraint === undefined) {
|
|
var symbol = resolveName(typeParameter, n.typeName.text, 793056 /* Type */, undefined, undefined);
|
|
if (symbol && (symbol.flags & 262144 /* TypeParameter */)) {
|
|
// TypeScript 1.0 spec (April 2014): 3.4.1
|
|
// Type parameters declared in a particular type parameter list
|
|
// may not be referenced in constraints in that type parameter list
|
|
// symbol.declaration.parent === typeParameter.parent
|
|
// -> typeParameter and symbol.declaration originate from the same type parameter list
|
|
// -> illegal for all declarations in symbol
|
|
// forEach === exists
|
|
links.isIllegalTypeReferenceInConstraint = ts.forEach(symbol.declarations, function (d) { return d.parent === typeParameter.parent; });
|
|
}
|
|
}
|
|
if (links.isIllegalTypeReferenceInConstraint) {
|
|
error(typeParameter, ts.Diagnostics.Constraint_of_a_type_parameter_cannot_reference_any_type_parameter_from_the_same_type_parameter_list);
|
|
}
|
|
}
|
|
ts.forEachChild(n, check);
|
|
}
|
|
if (typeParameter.constraint) {
|
|
typeParameterSymbol = getSymbolOfNode(typeParameter);
|
|
check(typeParameter.constraint);
|
|
}
|
|
}
|
|
// Get type from reference to class or interface
|
|
function getTypeFromClassOrInterfaceReference(node, symbol) {
|
|
var type = getDeclaredTypeOfSymbol(symbol);
|
|
var typeParameters = type.localTypeParameters;
|
|
if (typeParameters) {
|
|
if (!node.typeArguments || node.typeArguments.length !== typeParameters.length) {
|
|
error(node, ts.Diagnostics.Generic_type_0_requires_1_type_argument_s, typeToString(type, undefined, 1 /* WriteArrayAsGenericType */), typeParameters.length);
|
|
return unknownType;
|
|
}
|
|
// 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.
|
|
return createTypeReference(type, ts.concatenate(type.outerTypeParameters, ts.map(node.typeArguments, getTypeFromTypeNode)));
|
|
}
|
|
if (node.typeArguments) {
|
|
error(node, ts.Diagnostics.Type_0_is_not_generic, typeToString(type));
|
|
return unknownType;
|
|
}
|
|
return type;
|
|
}
|
|
// 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 links = getSymbolLinks(symbol);
|
|
var typeParameters = links.typeParameters;
|
|
if (typeParameters) {
|
|
if (!node.typeArguments || node.typeArguments.length !== typeParameters.length) {
|
|
error(node, ts.Diagnostics.Generic_type_0_requires_1_type_argument_s, symbolToString(symbol), typeParameters.length);
|
|
return unknownType;
|
|
}
|
|
var typeArguments = ts.map(node.typeArguments, getTypeFromTypeNode);
|
|
var id = getTypeListId(typeArguments);
|
|
return links.instantiations[id] || (links.instantiations[id] = instantiateType(type, createTypeMapper(typeParameters, typeArguments)));
|
|
}
|
|
if (node.typeArguments) {
|
|
error(node, ts.Diagnostics.Type_0_is_not_generic, symbolToString(symbol));
|
|
return unknownType;
|
|
}
|
|
return type;
|
|
}
|
|
// Get type from reference to named type that cannot be generic (enum or type parameter)
|
|
function getTypeFromNonGenericTypeReference(node, symbol) {
|
|
if (symbol.flags & 262144 /* TypeParameter */ && isTypeParameterReferenceIllegalInConstraint(node, symbol)) {
|
|
// TypeScript 1.0 spec (April 2014): 3.4.1
|
|
// Type parameters declared in a particular type parameter list
|
|
// may not be referenced in constraints in that type parameter list
|
|
// Implementation: such type references are resolved to 'unknown' type that usually denotes error
|
|
return unknownType;
|
|
}
|
|
if (node.typeArguments) {
|
|
error(node, ts.Diagnostics.Type_0_is_not_generic, symbolToString(symbol));
|
|
return unknownType;
|
|
}
|
|
return getDeclaredTypeOfSymbol(symbol);
|
|
}
|
|
function getTypeFromTypeReference(node) {
|
|
var links = getNodeLinks(node);
|
|
if (!links.resolvedType) {
|
|
// We only support expressions that are simple qualified names. For other expressions this produces undefined.
|
|
var typeNameOrExpression = node.kind === 148 /* TypeReference */ ? node.typeName :
|
|
ts.isSupportedExpressionWithTypeArguments(node) ? node.expression :
|
|
undefined;
|
|
var symbol = typeNameOrExpression && resolveEntityName(typeNameOrExpression, 793056 /* Type */) || unknownSymbol;
|
|
var type = symbol === unknownSymbol ? unknownType :
|
|
symbol.flags & (32 /* Class */ | 64 /* Interface */) ? getTypeFromClassOrInterfaceReference(node, symbol) :
|
|
symbol.flags & 524288 /* TypeAlias */ ? getTypeFromTypeAliasReference(node, symbol) :
|
|
getTypeFromNonGenericTypeReference(node, symbol);
|
|
// Cache both the resolved symbol and the resolved type. The resolved symbol is needed in when we check the
|
|
// type reference in checkTypeReferenceOrExpressionWithTypeArguments.
|
|
links.resolvedSymbol = symbol;
|
|
links.resolvedType = type;
|
|
}
|
|
return links.resolvedType;
|
|
}
|
|
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.
|
|
links.resolvedType = getWidenedType(checkExpression(node.exprName));
|
|
}
|
|
return links.resolvedType;
|
|
}
|
|
function getTypeOfGlobalSymbol(symbol, arity) {
|
|
function getTypeDeclaration(symbol) {
|
|
var declarations = symbol.declarations;
|
|
for (var _i = 0; _i < declarations.length; _i++) {
|
|
var declaration = declarations[_i];
|
|
switch (declaration.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
return declaration;
|
|
}
|
|
}
|
|
}
|
|
if (!symbol) {
|
|
return arity ? emptyGenericType : emptyObjectType;
|
|
}
|
|
var type = getDeclaredTypeOfSymbol(symbol);
|
|
if (!(type.flags & 80896 /* ObjectType */)) {
|
|
error(getTypeDeclaration(symbol), ts.Diagnostics.Global_type_0_must_be_a_class_or_interface_type, symbol.name);
|
|
return arity ? emptyGenericType : emptyObjectType;
|
|
}
|
|
if ((type.typeParameters ? type.typeParameters.length : 0) !== arity) {
|
|
error(getTypeDeclaration(symbol), ts.Diagnostics.Global_type_0_must_have_1_type_parameter_s, symbol.name, arity);
|
|
return arity ? emptyGenericType : emptyObjectType;
|
|
}
|
|
return type;
|
|
}
|
|
function getGlobalValueSymbol(name) {
|
|
return getGlobalSymbol(name, 107455 /* Value */, ts.Diagnostics.Cannot_find_global_value_0);
|
|
}
|
|
function getGlobalTypeSymbol(name) {
|
|
return getGlobalSymbol(name, 793056 /* Type */, ts.Diagnostics.Cannot_find_global_type_0);
|
|
}
|
|
function getGlobalSymbol(name, meaning, diagnostic) {
|
|
return resolveName(undefined, name, meaning, diagnostic, name);
|
|
}
|
|
function getGlobalType(name, arity) {
|
|
if (arity === void 0) { arity = 0; }
|
|
return getTypeOfGlobalSymbol(getGlobalTypeSymbol(name), arity);
|
|
}
|
|
function tryGetGlobalType(name, arity) {
|
|
if (arity === void 0) { arity = 0; }
|
|
return getTypeOfGlobalSymbol(getGlobalSymbol(name, 793056 /* Type */, undefined), arity);
|
|
}
|
|
/**
|
|
* Returns a type that is inside a namespace at the global scope, e.g.
|
|
* getExportedTypeFromNamespace('JSX', 'Element') returns the JSX.Element type
|
|
*/
|
|
function getExportedTypeFromNamespace(namespace, name) {
|
|
var namespaceSymbol = getGlobalSymbol(namespace, 1536 /* Namespace */, undefined);
|
|
var typeSymbol = namespaceSymbol && getSymbol(namespaceSymbol.exports, name, 793056 /* Type */);
|
|
return typeSymbol && getDeclaredTypeOfSymbol(typeSymbol);
|
|
}
|
|
function getGlobalESSymbolConstructorSymbol() {
|
|
return globalESSymbolConstructorSymbol || (globalESSymbolConstructorSymbol = getGlobalValueSymbol("Symbol"));
|
|
}
|
|
/**
|
|
* Creates a TypeReference for a generic `TypedPropertyDescriptor<T>`.
|
|
*/
|
|
function createTypedPropertyDescriptorType(propertyType) {
|
|
var globalTypedPropertyDescriptorType = getGlobalTypedPropertyDescriptorType();
|
|
return globalTypedPropertyDescriptorType !== emptyObjectType
|
|
? createTypeReference(globalTypedPropertyDescriptorType, [propertyType])
|
|
: emptyObjectType;
|
|
}
|
|
/**
|
|
* Instantiates a global type that is generic with some element type, and returns that instantiation.
|
|
*/
|
|
function createTypeFromGenericGlobalType(genericGlobalType, elementType) {
|
|
return genericGlobalType !== emptyGenericType ? createTypeReference(genericGlobalType, [elementType]) : emptyObjectType;
|
|
}
|
|
function createIterableType(elementType) {
|
|
return createTypeFromGenericGlobalType(globalIterableType, elementType);
|
|
}
|
|
function createIterableIteratorType(elementType) {
|
|
return createTypeFromGenericGlobalType(globalIterableIteratorType, elementType);
|
|
}
|
|
function createArrayType(elementType) {
|
|
return createTypeFromGenericGlobalType(globalArrayType, elementType);
|
|
}
|
|
function getTypeFromArrayTypeNode(node) {
|
|
var links = getNodeLinks(node);
|
|
if (!links.resolvedType) {
|
|
links.resolvedType = createArrayType(getTypeFromTypeNode(node.elementType));
|
|
}
|
|
return links.resolvedType;
|
|
}
|
|
function createTupleType(elementTypes) {
|
|
var id = getTypeListId(elementTypes);
|
|
var type = tupleTypes[id];
|
|
if (!type) {
|
|
type = tupleTypes[id] = createObjectType(8192 /* Tuple */ | getWideningFlagsOfTypes(elementTypes));
|
|
type.elementTypes = elementTypes;
|
|
}
|
|
return type;
|
|
}
|
|
function getTypeFromTupleTypeNode(node) {
|
|
var links = getNodeLinks(node);
|
|
if (!links.resolvedType) {
|
|
links.resolvedType = createTupleType(ts.map(node.elementTypes, getTypeFromTypeNode));
|
|
}
|
|
return links.resolvedType;
|
|
}
|
|
function addTypeToSet(typeSet, type, typeSetKind) {
|
|
if (type.flags & typeSetKind) {
|
|
addTypesToSet(typeSet, type.types, typeSetKind);
|
|
}
|
|
else if (!ts.contains(typeSet, type)) {
|
|
typeSet.push(type);
|
|
}
|
|
}
|
|
// 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 addTypesToSet(typeSet, types, typeSetKind) {
|
|
for (var _i = 0; _i < types.length; _i++) {
|
|
var type = types[_i];
|
|
addTypeToSet(typeSet, type, typeSetKind);
|
|
}
|
|
}
|
|
function isSubtypeOfAny(candidate, types) {
|
|
for (var _i = 0; _i < types.length; _i++) {
|
|
var type = types[_i];
|
|
if (candidate !== type && isTypeSubtypeOf(candidate, type)) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function removeSubtypes(types) {
|
|
var i = types.length;
|
|
while (i > 0) {
|
|
i--;
|
|
if (isSubtypeOfAny(types[i], types)) {
|
|
types.splice(i, 1);
|
|
}
|
|
}
|
|
}
|
|
function containsTypeAny(types) {
|
|
for (var _i = 0; _i < types.length; _i++) {
|
|
var type = types[_i];
|
|
if (isTypeAny(type)) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function removeAllButLast(types, typeToRemove) {
|
|
var i = types.length;
|
|
while (i > 0 && types.length > 1) {
|
|
i--;
|
|
if (types[i] === typeToRemove) {
|
|
types.splice(i, 1);
|
|
}
|
|
}
|
|
}
|
|
function compareTypeIds(type1, type2) {
|
|
return type1.id - type2.id;
|
|
}
|
|
// The noSubtypeReduction flag is there because it isn't possible to always do subtype reduction. The flag
|
|
// is true when creating a union type from a type node and when instantiating a union type. In both of those
|
|
// cases subtype reduction has to be deferred to properly support recursive union types. For example, a
|
|
// type alias of the form "type Item = string | (() => Item)" cannot be reduced during its declaration.
|
|
function getUnionType(types, noSubtypeReduction) {
|
|
if (types.length === 0) {
|
|
return emptyObjectType;
|
|
}
|
|
var typeSet = [];
|
|
addTypesToSet(typeSet, types, 16384 /* Union */);
|
|
typeSet.sort(compareTypeIds);
|
|
if (noSubtypeReduction) {
|
|
if (containsTypeAny(typeSet)) {
|
|
return anyType;
|
|
}
|
|
removeAllButLast(typeSet, undefinedType);
|
|
removeAllButLast(typeSet, nullType);
|
|
}
|
|
else {
|
|
removeSubtypes(typeSet);
|
|
}
|
|
if (typeSet.length === 1) {
|
|
return typeSet[0];
|
|
}
|
|
var id = getTypeListId(typeSet);
|
|
var type = unionTypes[id];
|
|
if (!type) {
|
|
type = unionTypes[id] = createObjectType(16384 /* Union */ | getWideningFlagsOfTypes(typeSet));
|
|
type.types = typeSet;
|
|
type.reducedType = noSubtypeReduction ? undefined : type;
|
|
}
|
|
return type;
|
|
}
|
|
// Subtype reduction is basically an optimization we do to avoid excessively large union types, which take longer
|
|
// to process and look strange in quick info and error messages. Semantically there is no difference between the
|
|
// reduced type and the type itself. So, when we detect a circularity we simply say that the reduced type is the
|
|
// type itself.
|
|
function getReducedTypeOfUnionType(type) {
|
|
if (!type.reducedType) {
|
|
type.reducedType = circularType;
|
|
var reducedType = getUnionType(type.types, false);
|
|
if (type.reducedType === circularType) {
|
|
type.reducedType = reducedType;
|
|
}
|
|
}
|
|
else if (type.reducedType === circularType) {
|
|
type.reducedType = type;
|
|
}
|
|
return type.reducedType;
|
|
}
|
|
function getTypeFromUnionTypeNode(node) {
|
|
var links = getNodeLinks(node);
|
|
if (!links.resolvedType) {
|
|
links.resolvedType = getUnionType(ts.map(node.types, getTypeFromTypeNode), true);
|
|
}
|
|
return links.resolvedType;
|
|
}
|
|
// We do not perform supertype reduction 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) {
|
|
if (types.length === 0) {
|
|
return emptyObjectType;
|
|
}
|
|
var typeSet = [];
|
|
addTypesToSet(typeSet, types, 32768 /* Intersection */);
|
|
if (containsTypeAny(typeSet)) {
|
|
return anyType;
|
|
}
|
|
if (typeSet.length === 1) {
|
|
return typeSet[0];
|
|
}
|
|
var id = getTypeListId(typeSet);
|
|
var type = intersectionTypes[id];
|
|
if (!type) {
|
|
type = intersectionTypes[id] = createObjectType(32768 /* Intersection */ | getWideningFlagsOfTypes(typeSet));
|
|
type.types = typeSet;
|
|
}
|
|
return type;
|
|
}
|
|
function getTypeFromIntersectionTypeNode(node) {
|
|
var links = getNodeLinks(node);
|
|
if (!links.resolvedType) {
|
|
links.resolvedType = getIntersectionType(ts.map(node.types, getTypeFromTypeNode));
|
|
}
|
|
return links.resolvedType;
|
|
}
|
|
function getTypeFromTypeLiteralOrFunctionOrConstructorTypeNode(node) {
|
|
var links = getNodeLinks(node);
|
|
if (!links.resolvedType) {
|
|
// Deferred resolution of members is handled by resolveObjectTypeMembers
|
|
links.resolvedType = createObjectType(65536 /* Anonymous */, node.symbol);
|
|
}
|
|
return links.resolvedType;
|
|
}
|
|
function getStringLiteralType(node) {
|
|
if (ts.hasProperty(stringLiteralTypes, node.text)) {
|
|
return stringLiteralTypes[node.text];
|
|
}
|
|
var type = stringLiteralTypes[node.text] = createType(256 /* StringLiteral */);
|
|
type.text = ts.getTextOfNode(node);
|
|
return type;
|
|
}
|
|
function getTypeFromStringLiteral(node) {
|
|
var links = getNodeLinks(node);
|
|
if (!links.resolvedType) {
|
|
links.resolvedType = getStringLiteralType(node);
|
|
}
|
|
return links.resolvedType;
|
|
}
|
|
function getTypeFromTypeNode(node) {
|
|
switch (node.kind) {
|
|
case 114 /* AnyKeyword */:
|
|
return anyType;
|
|
case 127 /* StringKeyword */:
|
|
return stringType;
|
|
case 125 /* NumberKeyword */:
|
|
return numberType;
|
|
case 117 /* BooleanKeyword */:
|
|
return booleanType;
|
|
case 128 /* SymbolKeyword */:
|
|
return esSymbolType;
|
|
case 100 /* VoidKeyword */:
|
|
return voidType;
|
|
case 8 /* StringLiteral */:
|
|
return getTypeFromStringLiteral(node);
|
|
case 148 /* TypeReference */:
|
|
return getTypeFromTypeReference(node);
|
|
case 147 /* TypePredicate */:
|
|
return booleanType;
|
|
case 185 /* ExpressionWithTypeArguments */:
|
|
return getTypeFromTypeReference(node);
|
|
case 151 /* TypeQuery */:
|
|
return getTypeFromTypeQueryNode(node);
|
|
case 153 /* ArrayType */:
|
|
return getTypeFromArrayTypeNode(node);
|
|
case 154 /* TupleType */:
|
|
return getTypeFromTupleTypeNode(node);
|
|
case 155 /* UnionType */:
|
|
return getTypeFromUnionTypeNode(node);
|
|
case 156 /* IntersectionType */:
|
|
return getTypeFromIntersectionTypeNode(node);
|
|
case 157 /* ParenthesizedType */:
|
|
return getTypeFromTypeNode(node.type);
|
|
case 149 /* FunctionType */:
|
|
case 150 /* ConstructorType */:
|
|
case 152 /* TypeLiteral */:
|
|
return getTypeFromTypeLiteralOrFunctionOrConstructorTypeNode(node);
|
|
// This function assumes that an identifier or qualified name is a type expression
|
|
// Callers should first ensure this by calling isTypeNode
|
|
case 66 /* Identifier */:
|
|
case 132 /* QualifiedName */:
|
|
var symbol = getSymbolInfo(node);
|
|
return symbol && getDeclaredTypeOfSymbol(symbol);
|
|
default:
|
|
return unknownType;
|
|
}
|
|
}
|
|
function instantiateList(items, mapper, instantiator) {
|
|
if (items && items.length) {
|
|
var result = [];
|
|
for (var _i = 0; _i < items.length; _i++) {
|
|
var v = items[_i];
|
|
result.push(instantiator(v, mapper));
|
|
}
|
|
return result;
|
|
}
|
|
return items;
|
|
}
|
|
function createUnaryTypeMapper(source, target) {
|
|
return function (t) { return t === source ? target : t; };
|
|
}
|
|
function createBinaryTypeMapper(source1, target1, source2, target2) {
|
|
return function (t) { return t === source1 ? target1 : t === source2 ? target2 : t; };
|
|
}
|
|
function createTypeMapper(sources, targets) {
|
|
switch (sources.length) {
|
|
case 1: return createUnaryTypeMapper(sources[0], targets[0]);
|
|
case 2: return createBinaryTypeMapper(sources[0], targets[0], sources[1], targets[1]);
|
|
}
|
|
return function (t) {
|
|
for (var i = 0; i < sources.length; i++) {
|
|
if (t === sources[i]) {
|
|
return targets[i];
|
|
}
|
|
}
|
|
return t;
|
|
};
|
|
}
|
|
function createUnaryTypeEraser(source) {
|
|
return function (t) { return t === source ? anyType : t; };
|
|
}
|
|
function createBinaryTypeEraser(source1, source2) {
|
|
return function (t) { return t === source1 || t === source2 ? anyType : t; };
|
|
}
|
|
function createTypeEraser(sources) {
|
|
switch (sources.length) {
|
|
case 1: return createUnaryTypeEraser(sources[0]);
|
|
case 2: return createBinaryTypeEraser(sources[0], sources[1]);
|
|
}
|
|
return function (t) {
|
|
for (var _i = 0; _i < sources.length; _i++) {
|
|
var source = sources[_i];
|
|
if (t === source) {
|
|
return anyType;
|
|
}
|
|
}
|
|
return t;
|
|
};
|
|
}
|
|
function createInferenceMapper(context) {
|
|
return function (t) {
|
|
for (var i = 0; i < context.typeParameters.length; i++) {
|
|
if (t === context.typeParameters[i]) {
|
|
context.inferences[i].isFixed = true;
|
|
return getInferredType(context, i);
|
|
}
|
|
}
|
|
return t;
|
|
};
|
|
}
|
|
function identityMapper(type) {
|
|
return type;
|
|
}
|
|
function combineTypeMappers(mapper1, mapper2) {
|
|
return function (t) { return instantiateType(mapper1(t), mapper2); };
|
|
}
|
|
function instantiateTypeParameter(typeParameter, mapper) {
|
|
var result = createType(512 /* TypeParameter */);
|
|
result.symbol = typeParameter.symbol;
|
|
if (typeParameter.constraint) {
|
|
result.constraint = instantiateType(typeParameter.constraint, mapper);
|
|
}
|
|
else {
|
|
result.target = typeParameter;
|
|
result.mapper = mapper;
|
|
}
|
|
return result;
|
|
}
|
|
function instantiateSignature(signature, mapper, eraseTypeParameters) {
|
|
var freshTypeParameters;
|
|
var freshTypePredicate;
|
|
if (signature.typeParameters && !eraseTypeParameters) {
|
|
freshTypeParameters = instantiateList(signature.typeParameters, mapper, instantiateTypeParameter);
|
|
mapper = combineTypeMappers(createTypeMapper(signature.typeParameters, freshTypeParameters), mapper);
|
|
}
|
|
if (signature.typePredicate) {
|
|
freshTypePredicate = {
|
|
parameterName: signature.typePredicate.parameterName,
|
|
parameterIndex: signature.typePredicate.parameterIndex,
|
|
type: instantiateType(signature.typePredicate.type, mapper)
|
|
};
|
|
}
|
|
var result = createSignature(signature.declaration, freshTypeParameters, instantiateList(signature.parameters, mapper, instantiateSymbol), signature.resolvedReturnType ? instantiateType(signature.resolvedReturnType, mapper) : undefined, freshTypePredicate, signature.minArgumentCount, signature.hasRestParameter, signature.hasStringLiterals);
|
|
result.target = signature;
|
|
result.mapper = mapper;
|
|
return result;
|
|
}
|
|
function instantiateSymbol(symbol, mapper) {
|
|
if (symbol.flags & 16777216 /* Instantiated */) {
|
|
var links = getSymbolLinks(symbol);
|
|
// 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(16777216 /* Instantiated */ | 67108864 /* Transient */ | symbol.flags, symbol.name);
|
|
result.declarations = symbol.declarations;
|
|
result.parent = symbol.parent;
|
|
result.target = symbol;
|
|
result.mapper = mapper;
|
|
if (symbol.valueDeclaration) {
|
|
result.valueDeclaration = symbol.valueDeclaration;
|
|
}
|
|
return result;
|
|
}
|
|
function instantiateAnonymousType(type, mapper) {
|
|
// Mark the anonymous type as instantiated such that our infinite instantiation detection logic can recognize it
|
|
var result = createObjectType(65536 /* Anonymous */ | 131072 /* Instantiated */, type.symbol);
|
|
result.properties = instantiateList(getPropertiesOfObjectType(type), mapper, instantiateSymbol);
|
|
result.members = createSymbolTable(result.properties);
|
|
result.callSignatures = instantiateList(getSignaturesOfType(type, 0 /* Call */), mapper, instantiateSignature);
|
|
result.constructSignatures = instantiateList(getSignaturesOfType(type, 1 /* Construct */), mapper, instantiateSignature);
|
|
var stringIndexType = getIndexTypeOfType(type, 0 /* String */);
|
|
var numberIndexType = getIndexTypeOfType(type, 1 /* Number */);
|
|
if (stringIndexType)
|
|
result.stringIndexType = instantiateType(stringIndexType, mapper);
|
|
if (numberIndexType)
|
|
result.numberIndexType = instantiateType(numberIndexType, mapper);
|
|
return result;
|
|
}
|
|
function instantiateType(type, mapper) {
|
|
if (mapper !== identityMapper) {
|
|
if (type.flags & 512 /* TypeParameter */) {
|
|
return mapper(type);
|
|
}
|
|
if (type.flags & 65536 /* Anonymous */) {
|
|
return type.symbol && type.symbol.flags & (16 /* Function */ | 8192 /* Method */ | 32 /* Class */ | 2048 /* TypeLiteral */ | 4096 /* ObjectLiteral */) ?
|
|
instantiateAnonymousType(type, mapper) : type;
|
|
}
|
|
if (type.flags & 4096 /* Reference */) {
|
|
return createTypeReference(type.target, instantiateList(type.typeArguments, mapper, instantiateType));
|
|
}
|
|
if (type.flags & 8192 /* Tuple */) {
|
|
return createTupleType(instantiateList(type.elementTypes, mapper, instantiateType));
|
|
}
|
|
if (type.flags & 16384 /* Union */) {
|
|
return getUnionType(instantiateList(type.types, mapper, instantiateType), true);
|
|
}
|
|
if (type.flags & 32768 /* Intersection */) {
|
|
return getIntersectionType(instantiateList(type.types, mapper, instantiateType));
|
|
}
|
|
}
|
|
return type;
|
|
}
|
|
// 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 !== 140 /* MethodDeclaration */ || ts.isObjectLiteralMethod(node));
|
|
switch (node.kind) {
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
return isContextSensitiveFunctionLikeDeclaration(node);
|
|
case 162 /* ObjectLiteralExpression */:
|
|
return ts.forEach(node.properties, isContextSensitive);
|
|
case 161 /* ArrayLiteralExpression */:
|
|
return ts.forEach(node.elements, isContextSensitive);
|
|
case 179 /* ConditionalExpression */:
|
|
return isContextSensitive(node.whenTrue) ||
|
|
isContextSensitive(node.whenFalse);
|
|
case 178 /* BinaryExpression */:
|
|
return node.operatorToken.kind === 50 /* BarBarToken */ &&
|
|
(isContextSensitive(node.left) || isContextSensitive(node.right));
|
|
case 242 /* PropertyAssignment */:
|
|
return isContextSensitive(node.initializer);
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
return isContextSensitiveFunctionLikeDeclaration(node);
|
|
case 169 /* ParenthesizedExpression */:
|
|
return isContextSensitive(node.expression);
|
|
}
|
|
return false;
|
|
}
|
|
function isContextSensitiveFunctionLikeDeclaration(node) {
|
|
return !node.typeParameters && node.parameters.length && !ts.forEach(node.parameters, function (p) { return p.type; });
|
|
}
|
|
function getTypeWithoutSignatures(type) {
|
|
if (type.flags & 80896 /* ObjectType */) {
|
|
var resolved = resolveStructuredTypeMembers(type);
|
|
if (resolved.constructSignatures.length) {
|
|
var result = createObjectType(65536 /* Anonymous */, type.symbol);
|
|
result.members = resolved.members;
|
|
result.properties = resolved.properties;
|
|
result.callSignatures = emptyArray;
|
|
result.constructSignatures = emptyArray;
|
|
type = result;
|
|
}
|
|
}
|
|
return type;
|
|
}
|
|
// TYPE CHECKING
|
|
function isTypeIdenticalTo(source, target) {
|
|
return checkTypeRelatedTo(source, target, identityRelation, undefined);
|
|
}
|
|
function compareTypes(source, target) {
|
|
return checkTypeRelatedTo(source, target, identityRelation, undefined) ? -1 /* True */ : 0 /* False */;
|
|
}
|
|
function isTypeSubtypeOf(source, target) {
|
|
return checkTypeSubtypeOf(source, target, undefined);
|
|
}
|
|
function isTypeAssignableTo(source, target) {
|
|
return checkTypeAssignableTo(source, target, undefined);
|
|
}
|
|
function checkTypeSubtypeOf(source, target, errorNode, headMessage, containingMessageChain) {
|
|
return checkTypeRelatedTo(source, target, subtypeRelation, errorNode, headMessage, containingMessageChain);
|
|
}
|
|
function checkTypeAssignableTo(source, target, errorNode, headMessage, containingMessageChain) {
|
|
return checkTypeRelatedTo(source, target, assignableRelation, errorNode, headMessage, containingMessageChain);
|
|
}
|
|
function isSignatureAssignableTo(source, target) {
|
|
var sourceType = getOrCreateTypeFromSignature(source);
|
|
var targetType = getOrCreateTypeFromSignature(target);
|
|
return checkTypeRelatedTo(sourceType, targetType, assignableRelation, undefined);
|
|
}
|
|
/**
|
|
* 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', 'assignableRelation', or 'subTypeRelation'.
|
|
* Used as both to determine which checks are performed and as a cache of previously computed results.
|
|
* @param errorNode The node upon which all errors will be reported, if defined.
|
|
* @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.
|
|
*/
|
|
function checkTypeRelatedTo(source, target, relation, errorNode, headMessage, containingMessageChain) {
|
|
var errorInfo;
|
|
var sourceStack;
|
|
var targetStack;
|
|
var maybeStack;
|
|
var expandingFlags;
|
|
var depth = 0;
|
|
var overflow = false;
|
|
var elaborateErrors = false;
|
|
ts.Debug.assert(relation !== identityRelation || !errorNode, "no error reporting in identity checking");
|
|
var result = isRelatedTo(source, target, errorNode !== undefined, headMessage);
|
|
if (overflow) {
|
|
error(errorNode, ts.Diagnostics.Excessive_stack_depth_comparing_types_0_and_1, typeToString(source), typeToString(target));
|
|
}
|
|
else if (errorInfo) {
|
|
// If we already computed this relation, but in a context where we didn't want to report errors (e.g. overload resolution),
|
|
// then we'll only have a top-level error (e.g. 'Class X does not implement interface Y') without any details. If this happened,
|
|
// request a recompuation to get a complete error message. This will be skipped if we've already done this computation in a context
|
|
// where errors were being reported.
|
|
if (errorInfo.next === undefined) {
|
|
errorInfo = undefined;
|
|
elaborateErrors = true;
|
|
isRelatedTo(source, target, errorNode !== undefined, headMessage);
|
|
}
|
|
if (containingMessageChain) {
|
|
errorInfo = ts.concatenateDiagnosticMessageChains(containingMessageChain, errorInfo);
|
|
}
|
|
diagnostics.add(ts.createDiagnosticForNodeFromMessageChain(errorNode, errorInfo));
|
|
}
|
|
return result !== 0 /* False */;
|
|
function reportError(message, arg0, arg1, arg2) {
|
|
errorInfo = ts.chainDiagnosticMessages(errorInfo, message, arg0, arg1, arg2);
|
|
}
|
|
// 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(source, target, reportErrors, headMessage) {
|
|
var result;
|
|
// both types are the same - covers 'they are the same primitive type or both are Any' or the same type parameter cases
|
|
if (source === target)
|
|
return -1 /* True */;
|
|
if (relation !== identityRelation) {
|
|
if (isTypeAny(target))
|
|
return -1 /* True */;
|
|
if (source === undefinedType)
|
|
return -1 /* True */;
|
|
if (source === nullType && target !== undefinedType)
|
|
return -1 /* True */;
|
|
if (source.flags & 128 /* Enum */ && target === numberType)
|
|
return -1 /* True */;
|
|
if (source.flags & 256 /* StringLiteral */ && target === stringType)
|
|
return -1 /* True */;
|
|
if (relation === assignableRelation) {
|
|
if (isTypeAny(source))
|
|
return -1 /* True */;
|
|
if (source === numberType && target.flags & 128 /* Enum */)
|
|
return -1 /* True */;
|
|
}
|
|
}
|
|
var saveErrorInfo = errorInfo;
|
|
if (source.flags & 4096 /* Reference */ && target.flags & 4096 /* Reference */ && source.target === target.target) {
|
|
// We have type references to same target type, see if relationship holds for all type arguments
|
|
if (result = typesRelatedTo(source.typeArguments, target.typeArguments, reportErrors)) {
|
|
return result;
|
|
}
|
|
}
|
|
else if (source.flags & 512 /* TypeParameter */ && target.flags & 512 /* TypeParameter */) {
|
|
if (result = typeParameterRelatedTo(source, target, reportErrors)) {
|
|
return result;
|
|
}
|
|
}
|
|
else if (relation !== identityRelation) {
|
|
// Note that the "each" checks must precede the "some" checks to produce the correct results
|
|
if (source.flags & 16384 /* Union */) {
|
|
if (result = eachTypeRelatedToType(source, target, reportErrors)) {
|
|
return result;
|
|
}
|
|
}
|
|
else if (target.flags & 32768 /* Intersection */) {
|
|
if (result = typeRelatedToEachType(source, target, reportErrors)) {
|
|
return result;
|
|
}
|
|
}
|
|
else {
|
|
// It is necessary to try "each" checks on both sides because there may be nested "some" checks
|
|
// on either side that need to be prioritized. For example, A | B = (A | B) & (C | D) or
|
|
// A & B = (A & B) | (C & D).
|
|
if (source.flags & 32768 /* Intersection */) {
|
|
// If target is a union type the following check will report errors so we suppress them here
|
|
if (result = someTypeRelatedToType(source, target, reportErrors && !(target.flags & 16384 /* Union */))) {
|
|
return result;
|
|
}
|
|
}
|
|
if (target.flags & 16384 /* Union */) {
|
|
if (result = typeRelatedToSomeType(source, target, reportErrors)) {
|
|
return result;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
if (source.flags & 16384 /* Union */ && target.flags & 16384 /* Union */ ||
|
|
source.flags & 32768 /* Intersection */ && target.flags & 32768 /* Intersection */) {
|
|
if (result = eachTypeRelatedToSomeType(source, target)) {
|
|
if (result &= eachTypeRelatedToSomeType(target, source)) {
|
|
return result;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
// Even if relationship doesn't hold for unions, type parameters, or generic type references,
|
|
// it may hold in a structural comparison.
|
|
// Report structural errors only if we haven't reported any errors yet
|
|
var reportStructuralErrors = reportErrors && errorInfo === saveErrorInfo;
|
|
// Identity relation does not use apparent type
|
|
var sourceOrApparentType = relation === identityRelation ? source : getApparentType(source);
|
|
// 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 (sourceOrApparentType.flags & (80896 /* ObjectType */ | 32768 /* Intersection */) && target.flags & 80896 /* ObjectType */) {
|
|
if (result = objectTypeRelatedTo(sourceOrApparentType, target, reportStructuralErrors)) {
|
|
errorInfo = saveErrorInfo;
|
|
return result;
|
|
}
|
|
}
|
|
else if (source.flags & 512 /* TypeParameter */ && sourceOrApparentType.flags & 49152 /* UnionOrIntersection */) {
|
|
// We clear the errors first because the following check often gives a better error than
|
|
// the union or intersection comparison above if it is applicable.
|
|
errorInfo = saveErrorInfo;
|
|
if (result = isRelatedTo(sourceOrApparentType, target, reportErrors)) {
|
|
return result;
|
|
}
|
|
}
|
|
if (reportErrors) {
|
|
headMessage = headMessage || ts.Diagnostics.Type_0_is_not_assignable_to_type_1;
|
|
var sourceType = typeToString(source);
|
|
var targetType = typeToString(target);
|
|
if (sourceType === targetType) {
|
|
sourceType = typeToString(source, undefined, 128 /* UseFullyQualifiedType */);
|
|
targetType = typeToString(target, undefined, 128 /* UseFullyQualifiedType */);
|
|
}
|
|
reportError(headMessage, sourceType, targetType);
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
function eachTypeRelatedToSomeType(source, target) {
|
|
var result = -1 /* True */;
|
|
var sourceTypes = source.types;
|
|
for (var _i = 0; _i < sourceTypes.length; _i++) {
|
|
var sourceType = sourceTypes[_i];
|
|
var related = typeRelatedToSomeType(sourceType, target, false);
|
|
if (!related) {
|
|
return 0 /* False */;
|
|
}
|
|
result &= related;
|
|
}
|
|
return result;
|
|
}
|
|
function typeRelatedToSomeType(source, target, reportErrors) {
|
|
var targetTypes = target.types;
|
|
for (var i = 0, len = targetTypes.length; i < len; i++) {
|
|
var related = isRelatedTo(source, targetTypes[i], reportErrors && i === len - 1);
|
|
if (related) {
|
|
return related;
|
|
}
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
function typeRelatedToEachType(source, target, reportErrors) {
|
|
var result = -1 /* True */;
|
|
var targetTypes = target.types;
|
|
for (var _i = 0; _i < targetTypes.length; _i++) {
|
|
var targetType = targetTypes[_i];
|
|
var related = isRelatedTo(source, targetType, reportErrors);
|
|
if (!related) {
|
|
return 0 /* False */;
|
|
}
|
|
result &= related;
|
|
}
|
|
return result;
|
|
}
|
|
function someTypeRelatedToType(source, target, reportErrors) {
|
|
var sourceTypes = source.types;
|
|
for (var i = 0, len = sourceTypes.length; i < len; i++) {
|
|
var related = isRelatedTo(sourceTypes[i], target, reportErrors && i === len - 1);
|
|
if (related) {
|
|
return related;
|
|
}
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
function eachTypeRelatedToType(source, target, reportErrors) {
|
|
var result = -1 /* True */;
|
|
var sourceTypes = source.types;
|
|
for (var _i = 0; _i < sourceTypes.length; _i++) {
|
|
var sourceType = sourceTypes[_i];
|
|
var related = isRelatedTo(sourceType, target, reportErrors);
|
|
if (!related) {
|
|
return 0 /* False */;
|
|
}
|
|
result &= related;
|
|
}
|
|
return result;
|
|
}
|
|
function typesRelatedTo(sources, targets, reportErrors) {
|
|
var result = -1 /* True */;
|
|
for (var i = 0, len = sources.length; i < len; i++) {
|
|
var related = isRelatedTo(sources[i], targets[i], reportErrors);
|
|
if (!related) {
|
|
return 0 /* False */;
|
|
}
|
|
result &= related;
|
|
}
|
|
return result;
|
|
}
|
|
function typeParameterRelatedTo(source, target, reportErrors) {
|
|
if (relation === identityRelation) {
|
|
if (source.symbol.name !== target.symbol.name) {
|
|
return 0 /* False */;
|
|
}
|
|
// covers case when both type parameters does not have constraint (both equal to noConstraintType)
|
|
if (source.constraint === target.constraint) {
|
|
return -1 /* True */;
|
|
}
|
|
if (source.constraint === noConstraintType || target.constraint === noConstraintType) {
|
|
return 0 /* False */;
|
|
}
|
|
return isRelatedTo(source.constraint, target.constraint, reportErrors);
|
|
}
|
|
else {
|
|
while (true) {
|
|
var constraint = getConstraintOfTypeParameter(source);
|
|
if (constraint === target)
|
|
return -1 /* True */;
|
|
if (!(constraint && constraint.flags & 512 /* TypeParameter */))
|
|
break;
|
|
source = constraint;
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
}
|
|
// Determine if two object types are related by structure. 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 objectTypeRelatedTo(source, target, reportErrors) {
|
|
if (overflow) {
|
|
return 0 /* False */;
|
|
}
|
|
var id = relation !== identityRelation || source.id < target.id ? source.id + "," + target.id : target.id + "," + source.id;
|
|
var related = relation[id];
|
|
if (related !== undefined) {
|
|
// If we computed this relation already and it was failed and reported, or if we're not being asked to elaborate
|
|
// errors, we can use the cached value. Otherwise, recompute the relation
|
|
if (!elaborateErrors || (related === 3 /* FailedAndReported */)) {
|
|
return related === 1 /* Succeeded */ ? -1 /* True */ : 0 /* False */;
|
|
}
|
|
}
|
|
if (depth > 0) {
|
|
for (var i = 0; i < depth; i++) {
|
|
// If source and target are already being compared, consider them related with assumptions
|
|
if (maybeStack[i][id]) {
|
|
return 1 /* Maybe */;
|
|
}
|
|
}
|
|
if (depth === 100) {
|
|
overflow = true;
|
|
return 0 /* False */;
|
|
}
|
|
}
|
|
else {
|
|
sourceStack = [];
|
|
targetStack = [];
|
|
maybeStack = [];
|
|
expandingFlags = 0;
|
|
}
|
|
sourceStack[depth] = source;
|
|
targetStack[depth] = target;
|
|
maybeStack[depth] = {};
|
|
maybeStack[depth][id] = 1 /* Succeeded */;
|
|
depth++;
|
|
var saveExpandingFlags = expandingFlags;
|
|
if (!(expandingFlags & 1) && isDeeplyNestedGeneric(source, sourceStack, depth))
|
|
expandingFlags |= 1;
|
|
if (!(expandingFlags & 2) && isDeeplyNestedGeneric(target, targetStack, depth))
|
|
expandingFlags |= 2;
|
|
var result;
|
|
if (expandingFlags === 3) {
|
|
result = 1 /* Maybe */;
|
|
}
|
|
else {
|
|
result = propertiesRelatedTo(source, target, reportErrors);
|
|
if (result) {
|
|
result &= signaturesRelatedTo(source, target, 0 /* Call */, reportErrors);
|
|
if (result) {
|
|
result &= signaturesRelatedTo(source, target, 1 /* Construct */, reportErrors);
|
|
if (result) {
|
|
result &= stringIndexTypesRelatedTo(source, target, reportErrors);
|
|
if (result) {
|
|
result &= numberIndexTypesRelatedTo(source, target, reportErrors);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
expandingFlags = saveExpandingFlags;
|
|
depth--;
|
|
if (result) {
|
|
var maybeCache = maybeStack[depth];
|
|
// If result is definitely true, copy assumptions to global cache, else copy to next level up
|
|
var destinationCache = (result === -1 /* True */ || depth === 0) ? relation : maybeStack[depth - 1];
|
|
ts.copyMap(maybeCache, destinationCache);
|
|
}
|
|
else {
|
|
// A false result goes straight into global cache (when something is false under assumptions it
|
|
// will also be false without assumptions)
|
|
relation[id] = reportErrors ? 3 /* FailedAndReported */ : 2 /* Failed */;
|
|
}
|
|
return result;
|
|
}
|
|
function propertiesRelatedTo(source, target, reportErrors) {
|
|
if (relation === identityRelation) {
|
|
return propertiesIdenticalTo(source, target);
|
|
}
|
|
var result = -1 /* True */;
|
|
var properties = getPropertiesOfObjectType(target);
|
|
var requireOptionalProperties = relation === subtypeRelation && !(source.flags & 524288 /* ObjectLiteral */);
|
|
for (var _i = 0; _i < properties.length; _i++) {
|
|
var targetProp = properties[_i];
|
|
var sourceProp = getPropertyOfType(source, targetProp.name);
|
|
if (sourceProp !== targetProp) {
|
|
if (!sourceProp) {
|
|
if (!(targetProp.flags & 536870912 /* Optional */) || requireOptionalProperties) {
|
|
if (reportErrors) {
|
|
reportError(ts.Diagnostics.Property_0_is_missing_in_type_1, symbolToString(targetProp), typeToString(source));
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
}
|
|
else if (!(targetProp.flags & 134217728 /* Prototype */)) {
|
|
var sourcePropFlags = getDeclarationFlagsFromSymbol(sourceProp);
|
|
var targetPropFlags = getDeclarationFlagsFromSymbol(targetProp);
|
|
if (sourcePropFlags & 32 /* Private */ || targetPropFlags & 32 /* Private */) {
|
|
if (sourceProp.valueDeclaration !== targetProp.valueDeclaration) {
|
|
if (reportErrors) {
|
|
if (sourcePropFlags & 32 /* Private */ && targetPropFlags & 32 /* 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 & 32 /* Private */ ? source : target), typeToString(sourcePropFlags & 32 /* Private */ ? target : source));
|
|
}
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
}
|
|
else if (targetPropFlags & 64 /* Protected */) {
|
|
var sourceDeclaredInClass = sourceProp.parent && sourceProp.parent.flags & 32 /* Class */;
|
|
var sourceClass = sourceDeclaredInClass ? getDeclaredTypeOfSymbol(sourceProp.parent) : undefined;
|
|
var targetClass = getDeclaredTypeOfSymbol(targetProp.parent);
|
|
if (!sourceClass || !hasBaseType(sourceClass, targetClass)) {
|
|
if (reportErrors) {
|
|
reportError(ts.Diagnostics.Property_0_is_protected_but_type_1_is_not_a_class_derived_from_2, symbolToString(targetProp), typeToString(sourceClass || source), typeToString(targetClass));
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
}
|
|
else if (sourcePropFlags & 64 /* 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 */;
|
|
}
|
|
var related = isRelatedTo(getTypeOfSymbol(sourceProp), getTypeOfSymbol(targetProp), reportErrors);
|
|
if (!related) {
|
|
if (reportErrors) {
|
|
reportError(ts.Diagnostics.Types_of_property_0_are_incompatible, symbolToString(targetProp));
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
result &= related;
|
|
if (sourceProp.flags & 536870912 /* Optional */ && !(targetProp.flags & 536870912 /* 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 result;
|
|
}
|
|
function propertiesIdenticalTo(source, target) {
|
|
if (!(source.flags & 80896 /* ObjectType */ && target.flags & 80896 /* ObjectType */)) {
|
|
return 0 /* False */;
|
|
}
|
|
var sourceProperties = getPropertiesOfObjectType(source);
|
|
var targetProperties = getPropertiesOfObjectType(target);
|
|
if (sourceProperties.length !== targetProperties.length) {
|
|
return 0 /* False */;
|
|
}
|
|
var result = -1 /* True */;
|
|
for (var _i = 0; _i < sourceProperties.length; _i++) {
|
|
var sourceProp = sourceProperties[_i];
|
|
var targetProp = getPropertyOfObjectType(target, sourceProp.name);
|
|
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) {
|
|
if (relation === identityRelation) {
|
|
return signaturesIdenticalTo(source, target, kind);
|
|
}
|
|
if (target === anyFunctionType || source === anyFunctionType) {
|
|
return -1 /* True */;
|
|
}
|
|
var sourceSignatures = getSignaturesOfType(source, kind);
|
|
var targetSignatures = getSignaturesOfType(target, kind);
|
|
var result = -1 /* True */;
|
|
var saveErrorInfo = errorInfo;
|
|
// Because the "abstractness" of a class is the same across all construct signatures
|
|
// (internally we are checking the corresponding declaration), it is enough to perform
|
|
// the check and report an error once over all pairs of source and target construct signatures.
|
|
var sourceSig = sourceSignatures[0];
|
|
// Note that in an extends-clause, targetSignatures is stripped, so the check never proceeds.
|
|
var targetSig = targetSignatures[0];
|
|
if (sourceSig && targetSig) {
|
|
var sourceErasedSignature = getErasedSignature(sourceSig);
|
|
var targetErasedSignature = getErasedSignature(targetSig);
|
|
var sourceReturnType = sourceErasedSignature && getReturnTypeOfSignature(sourceErasedSignature);
|
|
var targetReturnType = targetErasedSignature && getReturnTypeOfSignature(targetErasedSignature);
|
|
var sourceReturnDecl = sourceReturnType && sourceReturnType.symbol && ts.getDeclarationOfKind(sourceReturnType.symbol, 211 /* ClassDeclaration */);
|
|
var targetReturnDecl = targetReturnType && targetReturnType.symbol && ts.getDeclarationOfKind(targetReturnType.symbol, 211 /* ClassDeclaration */);
|
|
var sourceIsAbstract = sourceReturnDecl && sourceReturnDecl.flags & 256 /* Abstract */;
|
|
var targetIsAbstract = targetReturnDecl && targetReturnDecl.flags & 256 /* Abstract */;
|
|
if (sourceIsAbstract && !targetIsAbstract) {
|
|
if (reportErrors) {
|
|
reportError(ts.Diagnostics.Cannot_assign_an_abstract_constructor_type_to_a_non_abstract_constructor_type);
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
}
|
|
outer: for (var _i = 0; _i < targetSignatures.length; _i++) {
|
|
var t = targetSignatures[_i];
|
|
if (!t.hasStringLiterals || target.flags & 262144 /* FromSignature */) {
|
|
var localErrors = reportErrors;
|
|
var checkedAbstractAssignability = false;
|
|
for (var _a = 0; _a < sourceSignatures.length; _a++) {
|
|
var s = sourceSignatures[_a];
|
|
if (!s.hasStringLiterals || source.flags & 262144 /* FromSignature */) {
|
|
var related = signatureRelatedTo(s, t, localErrors);
|
|
if (related) {
|
|
result &= related;
|
|
errorInfo = saveErrorInfo;
|
|
continue outer;
|
|
}
|
|
// Only report errors from the first failure
|
|
localErrors = false;
|
|
}
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
function signatureRelatedTo(source, target, reportErrors) {
|
|
if (source === target) {
|
|
return -1 /* True */;
|
|
}
|
|
if (!target.hasRestParameter && source.minArgumentCount > target.parameters.length) {
|
|
return 0 /* False */;
|
|
}
|
|
var sourceMax = source.parameters.length;
|
|
var targetMax = target.parameters.length;
|
|
var checkCount;
|
|
if (source.hasRestParameter && target.hasRestParameter) {
|
|
checkCount = sourceMax > targetMax ? sourceMax : targetMax;
|
|
sourceMax--;
|
|
targetMax--;
|
|
}
|
|
else if (source.hasRestParameter) {
|
|
sourceMax--;
|
|
checkCount = targetMax;
|
|
}
|
|
else if (target.hasRestParameter) {
|
|
targetMax--;
|
|
checkCount = sourceMax;
|
|
}
|
|
else {
|
|
checkCount = sourceMax < targetMax ? sourceMax : targetMax;
|
|
}
|
|
// Spec 1.0 Section 3.8.3 & 3.8.4:
|
|
// M and N (the signatures) are instantiated using type Any as the type argument for all type parameters declared by M and N
|
|
source = getErasedSignature(source);
|
|
target = getErasedSignature(target);
|
|
var result = -1 /* True */;
|
|
for (var i = 0; i < checkCount; i++) {
|
|
var s = i < sourceMax ? getTypeOfSymbol(source.parameters[i]) : getRestTypeOfSignature(source);
|
|
var t = i < targetMax ? getTypeOfSymbol(target.parameters[i]) : getRestTypeOfSignature(target);
|
|
var saveErrorInfo = errorInfo;
|
|
var related = isRelatedTo(s, t, reportErrors);
|
|
if (!related) {
|
|
related = isRelatedTo(t, s, false);
|
|
if (!related) {
|
|
if (reportErrors) {
|
|
reportError(ts.Diagnostics.Types_of_parameters_0_and_1_are_incompatible, source.parameters[i < sourceMax ? i : sourceMax].name, target.parameters[i < targetMax ? i : targetMax].name);
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
errorInfo = saveErrorInfo;
|
|
}
|
|
result &= related;
|
|
}
|
|
if (source.typePredicate && target.typePredicate) {
|
|
var hasDifferentParameterIndex = source.typePredicate.parameterIndex !== target.typePredicate.parameterIndex;
|
|
var hasDifferentTypes;
|
|
if (hasDifferentParameterIndex ||
|
|
(hasDifferentTypes = !isTypeIdenticalTo(source.typePredicate.type, target.typePredicate.type))) {
|
|
if (reportErrors) {
|
|
var sourceParamText = source.typePredicate.parameterName;
|
|
var targetParamText = target.typePredicate.parameterName;
|
|
var sourceTypeText = typeToString(source.typePredicate.type);
|
|
var targetTypeText = typeToString(target.typePredicate.type);
|
|
if (hasDifferentParameterIndex) {
|
|
reportError(ts.Diagnostics.Parameter_0_is_not_in_the_same_position_as_parameter_1, sourceParamText, targetParamText);
|
|
}
|
|
else if (hasDifferentTypes) {
|
|
reportError(ts.Diagnostics.Type_0_is_not_assignable_to_type_1, sourceTypeText, targetTypeText);
|
|
}
|
|
reportError(ts.Diagnostics.Type_predicate_0_is_not_assignable_to_1, sourceParamText + " is " + sourceTypeText, targetParamText + " is " + targetTypeText);
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
}
|
|
else if (!source.typePredicate && target.typePredicate) {
|
|
if (reportErrors) {
|
|
reportError(ts.Diagnostics.Signature_0_must_have_a_type_predicate, signatureToString(source));
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
var targetReturnType = getReturnTypeOfSignature(target);
|
|
if (targetReturnType === voidType)
|
|
return result;
|
|
var sourceReturnType = getReturnTypeOfSignature(source);
|
|
return result & isRelatedTo(sourceReturnType, targetReturnType, reportErrors);
|
|
}
|
|
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, len = sourceSignatures.length; i < len; ++i) {
|
|
var related = compareSignatures(sourceSignatures[i], targetSignatures[i], true, isRelatedTo);
|
|
if (!related) {
|
|
return 0 /* False */;
|
|
}
|
|
result &= related;
|
|
}
|
|
return result;
|
|
}
|
|
function stringIndexTypesRelatedTo(source, target, reportErrors) {
|
|
if (relation === identityRelation) {
|
|
return indexTypesIdenticalTo(0 /* String */, source, target);
|
|
}
|
|
var targetType = getIndexTypeOfType(target, 0 /* String */);
|
|
if (targetType) {
|
|
var sourceType = getIndexTypeOfType(source, 0 /* String */);
|
|
if (!sourceType) {
|
|
if (reportErrors) {
|
|
reportError(ts.Diagnostics.Index_signature_is_missing_in_type_0, typeToString(source));
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
var related = isRelatedTo(sourceType, targetType, reportErrors);
|
|
if (!related) {
|
|
if (reportErrors) {
|
|
reportError(ts.Diagnostics.Index_signatures_are_incompatible);
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
return related;
|
|
}
|
|
return -1 /* True */;
|
|
}
|
|
function numberIndexTypesRelatedTo(source, target, reportErrors) {
|
|
if (relation === identityRelation) {
|
|
return indexTypesIdenticalTo(1 /* Number */, source, target);
|
|
}
|
|
var targetType = getIndexTypeOfType(target, 1 /* Number */);
|
|
if (targetType) {
|
|
var sourceStringType = getIndexTypeOfType(source, 0 /* String */);
|
|
var sourceNumberType = getIndexTypeOfType(source, 1 /* Number */);
|
|
if (!(sourceStringType || sourceNumberType)) {
|
|
if (reportErrors) {
|
|
reportError(ts.Diagnostics.Index_signature_is_missing_in_type_0, typeToString(source));
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
var related;
|
|
if (sourceStringType && sourceNumberType) {
|
|
// If we know for sure we're testing both string and numeric index types then only report errors from the second one
|
|
related = isRelatedTo(sourceStringType, targetType, false) || isRelatedTo(sourceNumberType, targetType, reportErrors);
|
|
}
|
|
else {
|
|
related = isRelatedTo(sourceStringType || sourceNumberType, targetType, reportErrors);
|
|
}
|
|
if (!related) {
|
|
if (reportErrors) {
|
|
reportError(ts.Diagnostics.Index_signatures_are_incompatible);
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
return related;
|
|
}
|
|
return -1 /* True */;
|
|
}
|
|
function indexTypesIdenticalTo(indexKind, source, target) {
|
|
var targetType = getIndexTypeOfType(target, indexKind);
|
|
var sourceType = getIndexTypeOfType(source, indexKind);
|
|
if (!sourceType && !targetType) {
|
|
return -1 /* True */;
|
|
}
|
|
if (sourceType && targetType) {
|
|
return isRelatedTo(sourceType, targetType);
|
|
}
|
|
return 0 /* False */;
|
|
}
|
|
}
|
|
// Return true if the given type is part of a deeply nested chain of generic instantiations. We consider this to be the case
|
|
// when structural type comparisons have been started for 10 or more instantiations of the same generic type. 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 10 levels, but unequal at
|
|
// some level beyond that.
|
|
function isDeeplyNestedGeneric(type, stack, depth) {
|
|
// We track type references (created by createTypeReference) and instantiated types (created by instantiateType)
|
|
if (type.flags & (4096 /* Reference */ | 131072 /* Instantiated */) && depth >= 5) {
|
|
var symbol = type.symbol;
|
|
var count = 0;
|
|
for (var i = 0; i < depth; i++) {
|
|
var t = stack[i];
|
|
if (t.flags & (4096 /* Reference */ | 131072 /* Instantiated */) && t.symbol === symbol) {
|
|
count++;
|
|
if (count >= 5)
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function isPropertyIdenticalTo(sourceProp, targetProp) {
|
|
return compareProperties(sourceProp, targetProp, compareTypes) !== 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 = getDeclarationFlagsFromSymbol(sourceProp) & (32 /* Private */ | 64 /* Protected */);
|
|
var targetPropAccessibility = getDeclarationFlagsFromSymbol(targetProp) & (32 /* Private */ | 64 /* Protected */);
|
|
if (sourcePropAccessibility !== targetPropAccessibility) {
|
|
return 0 /* False */;
|
|
}
|
|
if (sourcePropAccessibility) {
|
|
if (getTargetSymbol(sourceProp) !== getTargetSymbol(targetProp)) {
|
|
return 0 /* False */;
|
|
}
|
|
}
|
|
else {
|
|
if ((sourceProp.flags & 536870912 /* Optional */) !== (targetProp.flags & 536870912 /* Optional */)) {
|
|
return 0 /* False */;
|
|
}
|
|
}
|
|
return compareTypes(getTypeOfSymbol(sourceProp), getTypeOfSymbol(targetProp));
|
|
}
|
|
function compareSignatures(source, target, compareReturnTypes, compareTypes) {
|
|
if (source === target) {
|
|
return -1 /* True */;
|
|
}
|
|
if (source.parameters.length !== target.parameters.length ||
|
|
source.minArgumentCount !== target.minArgumentCount ||
|
|
source.hasRestParameter !== target.hasRestParameter) {
|
|
return 0 /* False */;
|
|
}
|
|
var result = -1 /* True */;
|
|
if (source.typeParameters && target.typeParameters) {
|
|
if (source.typeParameters.length !== target.typeParameters.length) {
|
|
return 0 /* False */;
|
|
}
|
|
for (var i = 0, len = source.typeParameters.length; i < len; ++i) {
|
|
var related = compareTypes(source.typeParameters[i], target.typeParameters[i]);
|
|
if (!related) {
|
|
return 0 /* False */;
|
|
}
|
|
result &= related;
|
|
}
|
|
}
|
|
else if (source.typeParameters || target.typeParameters) {
|
|
return 0 /* False */;
|
|
}
|
|
// Spec 1.0 Section 3.8.3 & 3.8.4:
|
|
// M and N (the signatures) are instantiated using type Any as the type argument for all type parameters declared by M and N
|
|
source = getErasedSignature(source);
|
|
target = getErasedSignature(target);
|
|
for (var i = 0, len = source.parameters.length; i < len; i++) {
|
|
var s = source.hasRestParameter && i === len - 1 ? getRestTypeOfSignature(source) : getTypeOfSymbol(source.parameters[i]);
|
|
var t = target.hasRestParameter && i === len - 1 ? getRestTypeOfSignature(target) : getTypeOfSymbol(target.parameters[i]);
|
|
var related = compareTypes(s, t);
|
|
if (!related) {
|
|
return 0 /* False */;
|
|
}
|
|
result &= related;
|
|
}
|
|
if (compareReturnTypes) {
|
|
result &= compareTypes(getReturnTypeOfSignature(source), getReturnTypeOfSignature(target));
|
|
}
|
|
return result;
|
|
}
|
|
function isSupertypeOfEach(candidate, types) {
|
|
for (var _i = 0; _i < types.length; _i++) {
|
|
var type = types[_i];
|
|
if (candidate !== type && !isTypeSubtypeOf(type, candidate))
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
function getCommonSupertype(types) {
|
|
return ts.forEach(types, function (t) { return isSupertypeOfEach(t, types) ? t : undefined; });
|
|
}
|
|
function reportNoCommonSupertypeError(types, errorLocation, errorMessageChainHead) {
|
|
// The downfallType/bestSupertypeDownfallType is the first type that caused a particular candidate
|
|
// to not be the common supertype. So if it weren't for this one downfallType (and possibly others),
|
|
// the type in question could have been the common supertype.
|
|
var bestSupertype;
|
|
var bestSupertypeDownfallType;
|
|
var bestSupertypeScore = 0;
|
|
for (var i = 0; i < types.length; i++) {
|
|
var score = 0;
|
|
var downfallType = undefined;
|
|
for (var j = 0; j < types.length; j++) {
|
|
if (isTypeSubtypeOf(types[j], types[i])) {
|
|
score++;
|
|
}
|
|
else if (!downfallType) {
|
|
downfallType = types[j];
|
|
}
|
|
}
|
|
ts.Debug.assert(!!downfallType, "If there is no common supertype, each type should have a downfallType");
|
|
if (score > bestSupertypeScore) {
|
|
bestSupertype = types[i];
|
|
bestSupertypeDownfallType = downfallType;
|
|
bestSupertypeScore = score;
|
|
}
|
|
// types.length - 1 is the maximum score, given that getCommonSupertype returned false
|
|
if (bestSupertypeScore === types.length - 1) {
|
|
break;
|
|
}
|
|
}
|
|
// In the following errors, the {1} slot is before the {0} slot because checkTypeSubtypeOf supplies the
|
|
// subtype as the first argument to the error
|
|
checkTypeSubtypeOf(bestSupertypeDownfallType, bestSupertype, errorLocation, ts.Diagnostics.Type_argument_candidate_1_is_not_a_valid_type_argument_because_it_is_not_a_supertype_of_candidate_0, errorMessageChainHead);
|
|
}
|
|
function isArrayType(type) {
|
|
return type.flags & 4096 /* Reference */ && type.target === globalArrayType;
|
|
}
|
|
function isArrayLikeType(type) {
|
|
// A type is array-like if it is not the undefined or null type and if it is assignable to any[]
|
|
return !(type.flags & (32 /* Undefined */ | 64 /* Null */)) && isTypeAssignableTo(type, anyArrayType);
|
|
}
|
|
function isTupleLikeType(type) {
|
|
return !!getPropertyOfType(type, "0");
|
|
}
|
|
/**
|
|
* Check if a Type was written as a tuple type literal.
|
|
* Prefer using isTupleLikeType() unless the use of `elementTypes` is required.
|
|
*/
|
|
function isTupleType(type) {
|
|
return !!(type.flags & 8192 /* Tuple */);
|
|
}
|
|
function getWidenedTypeOfObjectLiteral(type) {
|
|
var properties = getPropertiesOfObjectType(type);
|
|
var members = {};
|
|
ts.forEach(properties, function (p) {
|
|
var propType = getTypeOfSymbol(p);
|
|
var widenedType = getWidenedType(propType);
|
|
if (propType !== widenedType) {
|
|
var symbol = createSymbol(p.flags | 67108864 /* Transient */, p.name);
|
|
symbol.declarations = p.declarations;
|
|
symbol.parent = p.parent;
|
|
symbol.type = widenedType;
|
|
symbol.target = p;
|
|
if (p.valueDeclaration)
|
|
symbol.valueDeclaration = p.valueDeclaration;
|
|
p = symbol;
|
|
}
|
|
members[p.name] = p;
|
|
});
|
|
var stringIndexType = getIndexTypeOfType(type, 0 /* String */);
|
|
var numberIndexType = getIndexTypeOfType(type, 1 /* Number */);
|
|
if (stringIndexType)
|
|
stringIndexType = getWidenedType(stringIndexType);
|
|
if (numberIndexType)
|
|
numberIndexType = getWidenedType(numberIndexType);
|
|
return createAnonymousType(type.symbol, members, emptyArray, emptyArray, stringIndexType, numberIndexType);
|
|
}
|
|
function getWidenedType(type) {
|
|
if (type.flags & 3145728 /* RequiresWidening */) {
|
|
if (type.flags & (32 /* Undefined */ | 64 /* Null */)) {
|
|
return anyType;
|
|
}
|
|
if (type.flags & 524288 /* ObjectLiteral */) {
|
|
return getWidenedTypeOfObjectLiteral(type);
|
|
}
|
|
if (type.flags & 16384 /* Union */) {
|
|
return getUnionType(ts.map(type.types, getWidenedType));
|
|
}
|
|
if (isArrayType(type)) {
|
|
return createArrayType(getWidenedType(type.typeArguments[0]));
|
|
}
|
|
if (isTupleType(type)) {
|
|
return createTupleType(ts.map(type.elementTypes, getWidenedType));
|
|
}
|
|
}
|
|
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 (type.flags & 16384 /* Union */) {
|
|
for (var _i = 0, _a = type.types; _i < _a.length; _i++) {
|
|
var t = _a[_i];
|
|
if (reportWideningErrorsInType(t)) {
|
|
errorReported = true;
|
|
}
|
|
}
|
|
}
|
|
if (isArrayType(type)) {
|
|
return reportWideningErrorsInType(type.typeArguments[0]);
|
|
}
|
|
if (isTupleType(type)) {
|
|
for (var _b = 0, _c = type.elementTypes; _b < _c.length; _b++) {
|
|
var t = _c[_b];
|
|
if (reportWideningErrorsInType(t)) {
|
|
errorReported = true;
|
|
}
|
|
}
|
|
}
|
|
if (type.flags & 524288 /* ObjectLiteral */) {
|
|
for (var _d = 0, _e = getPropertiesOfObjectType(type); _d < _e.length; _d++) {
|
|
var p = _e[_d];
|
|
var t = getTypeOfSymbol(p);
|
|
if (t.flags & 1048576 /* ContainsUndefinedOrNull */) {
|
|
if (!reportWideningErrorsInType(t)) {
|
|
error(p.valueDeclaration, ts.Diagnostics.Object_literal_s_property_0_implicitly_has_an_1_type, p.name, typeToString(getWidenedType(t)));
|
|
}
|
|
errorReported = true;
|
|
}
|
|
}
|
|
}
|
|
return errorReported;
|
|
}
|
|
function reportImplicitAnyError(declaration, type) {
|
|
var typeAsString = typeToString(getWidenedType(type));
|
|
var diagnostic;
|
|
switch (declaration.kind) {
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
diagnostic = ts.Diagnostics.Member_0_implicitly_has_an_1_type;
|
|
break;
|
|
case 135 /* Parameter */:
|
|
diagnostic = declaration.dotDotDotToken ?
|
|
ts.Diagnostics.Rest_parameter_0_implicitly_has_an_any_type :
|
|
ts.Diagnostics.Parameter_0_implicitly_has_an_1_type;
|
|
break;
|
|
case 210 /* FunctionDeclaration */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
if (!declaration.name) {
|
|
error(declaration, ts.Diagnostics.Function_expression_which_lacks_return_type_annotation_implicitly_has_an_0_return_type, typeAsString);
|
|
return;
|
|
}
|
|
diagnostic = ts.Diagnostics._0_which_lacks_return_type_annotation_implicitly_has_an_1_return_type;
|
|
break;
|
|
default:
|
|
diagnostic = ts.Diagnostics.Variable_0_implicitly_has_an_1_type;
|
|
}
|
|
error(declaration, diagnostic, ts.declarationNameToString(declaration.name), typeAsString);
|
|
}
|
|
function reportErrorsFromWidening(declaration, type) {
|
|
if (produceDiagnostics && compilerOptions.noImplicitAny && type.flags & 1048576 /* ContainsUndefinedOrNull */) {
|
|
// Report implicit any error within type if possible, otherwise report error on declaration
|
|
if (!reportWideningErrorsInType(type)) {
|
|
reportImplicitAnyError(declaration, type);
|
|
}
|
|
}
|
|
}
|
|
function forEachMatchingParameterType(source, target, callback) {
|
|
var sourceMax = source.parameters.length;
|
|
var targetMax = target.parameters.length;
|
|
var count;
|
|
if (source.hasRestParameter && target.hasRestParameter) {
|
|
count = sourceMax > targetMax ? sourceMax : targetMax;
|
|
sourceMax--;
|
|
targetMax--;
|
|
}
|
|
else if (source.hasRestParameter) {
|
|
sourceMax--;
|
|
count = targetMax;
|
|
}
|
|
else if (target.hasRestParameter) {
|
|
targetMax--;
|
|
count = sourceMax;
|
|
}
|
|
else {
|
|
count = sourceMax < targetMax ? sourceMax : targetMax;
|
|
}
|
|
for (var i = 0; i < count; i++) {
|
|
var s = i < sourceMax ? getTypeOfSymbol(source.parameters[i]) : getRestTypeOfSignature(source);
|
|
var t = i < targetMax ? getTypeOfSymbol(target.parameters[i]) : getRestTypeOfSignature(target);
|
|
callback(s, t);
|
|
}
|
|
}
|
|
function createInferenceContext(typeParameters, inferUnionTypes) {
|
|
var inferences = [];
|
|
for (var _i = 0; _i < typeParameters.length; _i++) {
|
|
var unused = typeParameters[_i];
|
|
inferences.push({ primary: undefined, secondary: undefined, isFixed: false });
|
|
}
|
|
return {
|
|
typeParameters: typeParameters,
|
|
inferUnionTypes: inferUnionTypes,
|
|
inferences: inferences,
|
|
inferredTypes: new Array(typeParameters.length)
|
|
};
|
|
}
|
|
function inferTypes(context, source, target) {
|
|
var sourceStack;
|
|
var targetStack;
|
|
var depth = 0;
|
|
var inferiority = 0;
|
|
inferFromTypes(source, target);
|
|
function isInProcess(source, target) {
|
|
for (var i = 0; i < depth; i++) {
|
|
if (source === sourceStack[i] && target === targetStack[i]) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function inferFromTypes(source, target) {
|
|
if (source === anyFunctionType) {
|
|
return;
|
|
}
|
|
if (target.flags & 512 /* TypeParameter */) {
|
|
// If target is a type parameter, make an inference
|
|
var typeParameters = context.typeParameters;
|
|
for (var i = 0; i < typeParameters.length; i++) {
|
|
if (target === typeParameters[i]) {
|
|
var inferences = context.inferences[i];
|
|
if (!inferences.isFixed) {
|
|
// Any inferences that are made to a type parameter in a union type are inferior
|
|
// to inferences made to a flat (non-union) type. This is because if we infer to
|
|
// T | string[], we really don't know if we should be inferring to T or not (because
|
|
// the correct constituent on the target side could be string[]). Therefore, we put
|
|
// such inferior inferences into a secondary bucket, and only use them if the primary
|
|
// bucket is empty.
|
|
var candidates = inferiority ?
|
|
inferences.secondary || (inferences.secondary = []) :
|
|
inferences.primary || (inferences.primary = []);
|
|
if (!ts.contains(candidates, source)) {
|
|
candidates.push(source);
|
|
}
|
|
}
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
else if (source.flags & 4096 /* Reference */ && target.flags & 4096 /* Reference */ && source.target === target.target) {
|
|
// If source and target are references to the same generic type, infer from type arguments
|
|
var sourceTypes = source.typeArguments;
|
|
var targetTypes = target.typeArguments;
|
|
for (var i = 0; i < sourceTypes.length; i++) {
|
|
inferFromTypes(sourceTypes[i], targetTypes[i]);
|
|
}
|
|
}
|
|
else if (target.flags & 49152 /* UnionOrIntersection */) {
|
|
var targetTypes = target.types;
|
|
var typeParameterCount = 0;
|
|
var typeParameter;
|
|
// First infer to each type in union or intersection that isn't a type parameter
|
|
for (var _i = 0; _i < targetTypes.length; _i++) {
|
|
var t = targetTypes[_i];
|
|
if (t.flags & 512 /* TypeParameter */ && ts.contains(context.typeParameters, t)) {
|
|
typeParameter = t;
|
|
typeParameterCount++;
|
|
}
|
|
else {
|
|
inferFromTypes(source, t);
|
|
}
|
|
}
|
|
// Next, if target is a union type containing a single naked type parameter, make a
|
|
// secondary inference to that type parameter. We don't do this for intersection types
|
|
// because in a target type like Foo & T we don't know how which parts of the source type
|
|
// should be matched by Foo and which should be inferred to T.
|
|
if (target.flags & 16384 /* Union */ && typeParameterCount === 1) {
|
|
inferiority++;
|
|
inferFromTypes(source, typeParameter);
|
|
inferiority--;
|
|
}
|
|
}
|
|
else if (source.flags & 49152 /* UnionOrIntersection */) {
|
|
// Source is a union or intersection type, infer from each consituent type
|
|
var sourceTypes = source.types;
|
|
for (var _a = 0; _a < sourceTypes.length; _a++) {
|
|
var sourceType = sourceTypes[_a];
|
|
inferFromTypes(sourceType, target);
|
|
}
|
|
}
|
|
else {
|
|
source = getApparentType(source);
|
|
if (source.flags & 80896 /* ObjectType */ && (target.flags & (4096 /* Reference */ | 8192 /* Tuple */) ||
|
|
(target.flags & 65536 /* Anonymous */) && target.symbol && target.symbol.flags & (8192 /* Method */ | 2048 /* TypeLiteral */ | 32 /* Class */))) {
|
|
// If source is an object type, and target is a type reference, a tuple type, the type of a method, or a type literal, infer from members
|
|
if (isInProcess(source, target)) {
|
|
return;
|
|
}
|
|
if (isDeeplyNestedGeneric(source, sourceStack, depth) && isDeeplyNestedGeneric(target, targetStack, depth)) {
|
|
return;
|
|
}
|
|
if (depth === 0) {
|
|
sourceStack = [];
|
|
targetStack = [];
|
|
}
|
|
sourceStack[depth] = source;
|
|
targetStack[depth] = target;
|
|
depth++;
|
|
inferFromProperties(source, target);
|
|
inferFromSignatures(source, target, 0 /* Call */);
|
|
inferFromSignatures(source, target, 1 /* Construct */);
|
|
inferFromIndexTypes(source, target, 0 /* String */, 0 /* String */);
|
|
inferFromIndexTypes(source, target, 1 /* Number */, 1 /* Number */);
|
|
inferFromIndexTypes(source, target, 0 /* String */, 1 /* Number */);
|
|
depth--;
|
|
}
|
|
}
|
|
}
|
|
function inferFromProperties(source, target) {
|
|
var properties = getPropertiesOfObjectType(target);
|
|
for (var _i = 0; _i < properties.length; _i++) {
|
|
var targetProp = properties[_i];
|
|
var sourceProp = getPropertyOfObjectType(source, targetProp.name);
|
|
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;
|
|
for (var i = 0; i < len; i++) {
|
|
inferFromSignature(getErasedSignature(sourceSignatures[sourceLen - len + i]), getErasedSignature(targetSignatures[targetLen - len + i]));
|
|
}
|
|
}
|
|
function inferFromSignature(source, target) {
|
|
forEachMatchingParameterType(source, target, inferFromTypes);
|
|
if (source.typePredicate && target.typePredicate) {
|
|
if (target.typePredicate.parameterIndex === source.typePredicate.parameterIndex) {
|
|
// Return types from type predicates are treated as booleans. In order to infer types
|
|
// from type predicates we would need to infer using the type within the type predicate
|
|
// (i.e. 'Foo' from 'x is Foo').
|
|
inferFromTypes(source.typePredicate.type, target.typePredicate.type);
|
|
}
|
|
}
|
|
else {
|
|
inferFromTypes(getReturnTypeOfSignature(source), getReturnTypeOfSignature(target));
|
|
}
|
|
}
|
|
function inferFromIndexTypes(source, target, sourceKind, targetKind) {
|
|
var targetIndexType = getIndexTypeOfType(target, targetKind);
|
|
if (targetIndexType) {
|
|
var sourceIndexType = getIndexTypeOfType(source, sourceKind);
|
|
if (sourceIndexType) {
|
|
inferFromTypes(sourceIndexType, targetIndexType);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function getInferenceCandidates(context, index) {
|
|
var inferences = context.inferences[index];
|
|
return inferences.primary || inferences.secondary || emptyArray;
|
|
}
|
|
function getInferredType(context, index) {
|
|
var inferredType = context.inferredTypes[index];
|
|
var inferenceSucceeded;
|
|
if (!inferredType) {
|
|
var inferences = getInferenceCandidates(context, index);
|
|
if (inferences.length) {
|
|
// Infer widened union or supertype, or the unknown type for no common supertype
|
|
var unionOrSuperType = context.inferUnionTypes ? getUnionType(inferences) : getCommonSupertype(inferences);
|
|
inferredType = unionOrSuperType ? getWidenedType(unionOrSuperType) : unknownType;
|
|
inferenceSucceeded = !!unionOrSuperType;
|
|
}
|
|
else {
|
|
// Infer 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.
|
|
inferredType = emptyObjectType;
|
|
inferenceSucceeded = true;
|
|
}
|
|
// Only do the constraint check if inference succeeded (to prevent cascading errors)
|
|
if (inferenceSucceeded) {
|
|
var constraint = getConstraintOfTypeParameter(context.typeParameters[index]);
|
|
inferredType = constraint && !isTypeAssignableTo(inferredType, constraint) ? constraint : inferredType;
|
|
}
|
|
else if (context.failedTypeParameterIndex === undefined || context.failedTypeParameterIndex > index) {
|
|
// If inference failed, it is necessary to record the index of the failed type parameter (the one we are on).
|
|
// It might be that inference has already failed on a later type parameter on a previous call to inferTypeArguments.
|
|
// So if this failure is on preceding type parameter, this type parameter is the new failure index.
|
|
context.failedTypeParameterIndex = index;
|
|
}
|
|
context.inferredTypes[index] = inferredType;
|
|
}
|
|
return inferredType;
|
|
}
|
|
function getInferredTypes(context) {
|
|
for (var i = 0; i < context.inferredTypes.length; i++) {
|
|
getInferredType(context, i);
|
|
}
|
|
return context.inferredTypes;
|
|
}
|
|
function hasAncestor(node, kind) {
|
|
return ts.getAncestor(node, kind) !== undefined;
|
|
}
|
|
// EXPRESSION TYPE CHECKING
|
|
function getResolvedSymbol(node) {
|
|
var links = getNodeLinks(node);
|
|
if (!links.resolvedSymbol) {
|
|
links.resolvedSymbol = (!ts.nodeIsMissing(node) && resolveName(node, node.text, 107455 /* Value */ | 1048576 /* ExportValue */, ts.Diagnostics.Cannot_find_name_0, node)) || 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
|
|
while (node) {
|
|
switch (node.kind) {
|
|
case 151 /* TypeQuery */:
|
|
return true;
|
|
case 66 /* Identifier */:
|
|
case 132 /* QualifiedName */:
|
|
node = node.parent;
|
|
continue;
|
|
default:
|
|
return false;
|
|
}
|
|
}
|
|
ts.Debug.fail("should not get here");
|
|
}
|
|
// For a union type, remove all constituent types that are of the given type kind (when isOfTypeKind is true)
|
|
// or not of the given type kind (when isOfTypeKind is false)
|
|
function removeTypesFromUnionType(type, typeKind, isOfTypeKind, allowEmptyUnionResult) {
|
|
if (type.flags & 16384 /* Union */) {
|
|
var types = type.types;
|
|
if (ts.forEach(types, function (t) { return !!(t.flags & typeKind) === isOfTypeKind; })) {
|
|
// Above we checked if we have anything to remove, now use the opposite test to do the removal
|
|
var narrowedType = getUnionType(ts.filter(types, function (t) { return !(t.flags & typeKind) === isOfTypeKind; }));
|
|
if (allowEmptyUnionResult || narrowedType !== emptyObjectType) {
|
|
return narrowedType;
|
|
}
|
|
}
|
|
}
|
|
else if (allowEmptyUnionResult && !!(type.flags & typeKind) === isOfTypeKind) {
|
|
// Use getUnionType(emptyArray) instead of emptyObjectType in case the way empty union types
|
|
// are represented ever changes.
|
|
return getUnionType(emptyArray);
|
|
}
|
|
return type;
|
|
}
|
|
function hasInitializer(node) {
|
|
return !!(node.initializer || ts.isBindingPattern(node.parent) && hasInitializer(node.parent.parent));
|
|
}
|
|
// Check if a given variable is assigned within a given syntax node
|
|
function isVariableAssignedWithin(symbol, node) {
|
|
var links = getNodeLinks(node);
|
|
if (links.assignmentChecks) {
|
|
var cachedResult = links.assignmentChecks[symbol.id];
|
|
if (cachedResult !== undefined) {
|
|
return cachedResult;
|
|
}
|
|
}
|
|
else {
|
|
links.assignmentChecks = {};
|
|
}
|
|
return links.assignmentChecks[symbol.id] = isAssignedIn(node);
|
|
function isAssignedInBinaryExpression(node) {
|
|
if (node.operatorToken.kind >= 54 /* FirstAssignment */ && node.operatorToken.kind <= 65 /* LastAssignment */) {
|
|
var n = node.left;
|
|
while (n.kind === 169 /* ParenthesizedExpression */) {
|
|
n = n.expression;
|
|
}
|
|
if (n.kind === 66 /* Identifier */ && getResolvedSymbol(n) === symbol) {
|
|
return true;
|
|
}
|
|
}
|
|
return ts.forEachChild(node, isAssignedIn);
|
|
}
|
|
function isAssignedInVariableDeclaration(node) {
|
|
if (!ts.isBindingPattern(node.name) && getSymbolOfNode(node) === symbol && hasInitializer(node)) {
|
|
return true;
|
|
}
|
|
return ts.forEachChild(node, isAssignedIn);
|
|
}
|
|
function isAssignedIn(node) {
|
|
switch (node.kind) {
|
|
case 178 /* BinaryExpression */:
|
|
return isAssignedInBinaryExpression(node);
|
|
case 208 /* VariableDeclaration */:
|
|
case 160 /* BindingElement */:
|
|
return isAssignedInVariableDeclaration(node);
|
|
case 158 /* ObjectBindingPattern */:
|
|
case 159 /* ArrayBindingPattern */:
|
|
case 161 /* ArrayLiteralExpression */:
|
|
case 162 /* ObjectLiteralExpression */:
|
|
case 163 /* PropertyAccessExpression */:
|
|
case 164 /* ElementAccessExpression */:
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
case 168 /* TypeAssertionExpression */:
|
|
case 186 /* AsExpression */:
|
|
case 169 /* ParenthesizedExpression */:
|
|
case 176 /* PrefixUnaryExpression */:
|
|
case 172 /* DeleteExpression */:
|
|
case 175 /* AwaitExpression */:
|
|
case 173 /* TypeOfExpression */:
|
|
case 174 /* VoidExpression */:
|
|
case 177 /* PostfixUnaryExpression */:
|
|
case 181 /* YieldExpression */:
|
|
case 179 /* ConditionalExpression */:
|
|
case 182 /* SpreadElementExpression */:
|
|
case 189 /* Block */:
|
|
case 190 /* VariableStatement */:
|
|
case 192 /* ExpressionStatement */:
|
|
case 193 /* IfStatement */:
|
|
case 194 /* DoStatement */:
|
|
case 195 /* WhileStatement */:
|
|
case 196 /* ForStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
case 201 /* ReturnStatement */:
|
|
case 202 /* WithStatement */:
|
|
case 203 /* SwitchStatement */:
|
|
case 238 /* CaseClause */:
|
|
case 239 /* DefaultClause */:
|
|
case 204 /* LabeledStatement */:
|
|
case 205 /* ThrowStatement */:
|
|
case 206 /* TryStatement */:
|
|
case 241 /* CatchClause */:
|
|
case 230 /* JsxElement */:
|
|
case 231 /* JsxSelfClosingElement */:
|
|
case 235 /* JsxAttribute */:
|
|
case 236 /* JsxSpreadAttribute */:
|
|
case 232 /* JsxOpeningElement */:
|
|
case 237 /* JsxExpression */:
|
|
return ts.forEachChild(node, isAssignedIn);
|
|
}
|
|
return false;
|
|
}
|
|
}
|
|
function resolveLocation(node) {
|
|
// Resolve location from top down towards node if it is a context sensitive expression
|
|
// That helps in making sure not assigning types as any when resolved out of order
|
|
var containerNodes = [];
|
|
for (var parent_5 = node.parent; parent_5; parent_5 = parent_5.parent) {
|
|
if ((ts.isExpression(parent_5) || ts.isObjectLiteralMethod(node)) &&
|
|
isContextSensitive(parent_5)) {
|
|
containerNodes.unshift(parent_5);
|
|
}
|
|
}
|
|
ts.forEach(containerNodes, function (node) { getTypeOfNode(node); });
|
|
}
|
|
function getSymbolAtLocation(node) {
|
|
resolveLocation(node);
|
|
return getSymbolInfo(node);
|
|
}
|
|
function getTypeAtLocation(node) {
|
|
resolveLocation(node);
|
|
return getTypeOfNode(node);
|
|
}
|
|
function getTypeOfSymbolAtLocation(symbol, node) {
|
|
resolveLocation(node);
|
|
// Get the narrowed type of symbol at given location instead of just getting
|
|
// the type of the symbol.
|
|
// eg.
|
|
// function foo(a: string | number) {
|
|
// if (typeof a === "string") {
|
|
// a/**/
|
|
// }
|
|
// }
|
|
// getTypeOfSymbol for a would return type of parameter symbol string | number
|
|
// Unless we provide location /**/, checker wouldn't know how to narrow the type
|
|
// By using getNarrowedTypeOfSymbol would return string since it would be able to narrow
|
|
// it by typeguard in the if true condition
|
|
return getNarrowedTypeOfSymbol(symbol, node);
|
|
}
|
|
// Get the narrowed type of a given symbol at a given location
|
|
function getNarrowedTypeOfSymbol(symbol, node) {
|
|
var type = getTypeOfSymbol(symbol);
|
|
// Only narrow when symbol is variable of type any or an object, union, or type parameter type
|
|
if (node && symbol.flags & 3 /* Variable */) {
|
|
if (isTypeAny(type) || type.flags & (80896 /* ObjectType */ | 16384 /* Union */ | 512 /* TypeParameter */)) {
|
|
loop: while (node.parent) {
|
|
var child = node;
|
|
node = node.parent;
|
|
var narrowedType = type;
|
|
switch (node.kind) {
|
|
case 193 /* IfStatement */:
|
|
// In a branch of an if statement, narrow based on controlling expression
|
|
if (child !== node.expression) {
|
|
narrowedType = narrowType(type, node.expression, child === node.thenStatement);
|
|
}
|
|
break;
|
|
case 179 /* ConditionalExpression */:
|
|
// In a branch of a conditional expression, narrow based on controlling condition
|
|
if (child !== node.condition) {
|
|
narrowedType = narrowType(type, node.condition, child === node.whenTrue);
|
|
}
|
|
break;
|
|
case 178 /* BinaryExpression */:
|
|
// In the right operand of an && or ||, narrow based on left operand
|
|
if (child === node.right) {
|
|
if (node.operatorToken.kind === 49 /* AmpersandAmpersandToken */) {
|
|
narrowedType = narrowType(type, node.left, true);
|
|
}
|
|
else if (node.operatorToken.kind === 50 /* BarBarToken */) {
|
|
narrowedType = narrowType(type, node.left, false);
|
|
}
|
|
}
|
|
break;
|
|
case 245 /* SourceFile */:
|
|
case 215 /* ModuleDeclaration */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 141 /* Constructor */:
|
|
// Stop at the first containing function or module declaration
|
|
break loop;
|
|
}
|
|
// Use narrowed type if construct contains no assignments to variable
|
|
if (narrowedType !== type) {
|
|
if (isVariableAssignedWithin(symbol, node)) {
|
|
break;
|
|
}
|
|
type = narrowedType;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return type;
|
|
function narrowTypeByEquality(type, expr, assumeTrue) {
|
|
// Check that we have 'typeof <symbol>' on the left and string literal on the right
|
|
if (expr.left.kind !== 173 /* TypeOfExpression */ || expr.right.kind !== 8 /* StringLiteral */) {
|
|
return type;
|
|
}
|
|
var left = expr.left;
|
|
var right = expr.right;
|
|
if (left.expression.kind !== 66 /* Identifier */ || getResolvedSymbol(left.expression) !== symbol) {
|
|
return type;
|
|
}
|
|
var typeInfo = primitiveTypeInfo[right.text];
|
|
if (expr.operatorToken.kind === 32 /* ExclamationEqualsEqualsToken */) {
|
|
assumeTrue = !assumeTrue;
|
|
}
|
|
if (assumeTrue) {
|
|
// Assumed result is true. If check was not for a primitive type, remove all primitive types
|
|
if (!typeInfo) {
|
|
return removeTypesFromUnionType(type, 258 /* StringLike */ | 132 /* NumberLike */ | 8 /* Boolean */ | 4194304 /* ESSymbol */,
|
|
/*isOfTypeKind*/ true, false);
|
|
}
|
|
// Check was for a primitive type, return that primitive type if it is a subtype
|
|
if (isTypeSubtypeOf(typeInfo.type, type)) {
|
|
return typeInfo.type;
|
|
}
|
|
// Otherwise, remove all types that aren't of the primitive type kind. This can happen when the type is
|
|
// union of enum types and other types.
|
|
return removeTypesFromUnionType(type, typeInfo.flags, false, false);
|
|
}
|
|
else {
|
|
// Assumed result is false. If check was for a primitive type, remove that primitive type
|
|
if (typeInfo) {
|
|
return removeTypesFromUnionType(type, typeInfo.flags, true, false);
|
|
}
|
|
// Otherwise we don't have enough information to do anything.
|
|
return type;
|
|
}
|
|
}
|
|
function narrowTypeByAnd(type, expr, assumeTrue) {
|
|
if (assumeTrue) {
|
|
// The assumed result is true, therefore we narrow assuming each operand to be true.
|
|
return narrowType(narrowType(type, expr.left, true), expr.right, true);
|
|
}
|
|
else {
|
|
// The assumed result is false. This means either the first operand was false, or the first operand was true
|
|
// and the second operand was false. We narrow with those assumptions and union the two resulting types.
|
|
return getUnionType([
|
|
narrowType(type, expr.left, false),
|
|
narrowType(narrowType(type, expr.left, true), expr.right, false)
|
|
]);
|
|
}
|
|
}
|
|
function narrowTypeByOr(type, expr, assumeTrue) {
|
|
if (assumeTrue) {
|
|
// The assumed result is true. This means either the first operand was true, or the first operand was false
|
|
// and the second operand was true. We narrow with those assumptions and union the two resulting types.
|
|
return getUnionType([
|
|
narrowType(type, expr.left, true),
|
|
narrowType(narrowType(type, expr.left, false), expr.right, true)
|
|
]);
|
|
}
|
|
else {
|
|
// The assumed result is false, therefore we narrow assuming each operand to be false.
|
|
return narrowType(narrowType(type, expr.left, false), expr.right, false);
|
|
}
|
|
}
|
|
function narrowTypeByInstanceof(type, expr, assumeTrue) {
|
|
// Check that type is not any, assumed result is true, and we have variable symbol on the left
|
|
if (isTypeAny(type) || !assumeTrue || expr.left.kind !== 66 /* Identifier */ || getResolvedSymbol(expr.left) !== symbol) {
|
|
return type;
|
|
}
|
|
// Check that right operand is a function type with a prototype property
|
|
var rightType = checkExpression(expr.right);
|
|
if (!isTypeSubtypeOf(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;
|
|
}
|
|
}
|
|
if (!targetType) {
|
|
// Target type is type of construct signature
|
|
var constructSignatures;
|
|
if (rightType.flags & 2048 /* Interface */) {
|
|
constructSignatures = resolveDeclaredMembers(rightType).declaredConstructSignatures;
|
|
}
|
|
else if (rightType.flags & 65536 /* Anonymous */) {
|
|
constructSignatures = getSignaturesOfType(rightType, 1 /* Construct */);
|
|
}
|
|
if (constructSignatures && constructSignatures.length) {
|
|
targetType = getUnionType(ts.map(constructSignatures, function (signature) { return getReturnTypeOfSignature(getErasedSignature(signature)); }));
|
|
}
|
|
}
|
|
if (targetType) {
|
|
return getNarrowedType(type, targetType);
|
|
}
|
|
return type;
|
|
}
|
|
function getNarrowedType(originalType, narrowedTypeCandidate) {
|
|
// Narrow to the target type if it's a subtype of the current type
|
|
if (isTypeSubtypeOf(narrowedTypeCandidate, originalType)) {
|
|
return narrowedTypeCandidate;
|
|
}
|
|
// If the current type is a union type, remove all constituents that aren't subtypes of the target.
|
|
if (originalType.flags & 16384 /* Union */) {
|
|
return getUnionType(ts.filter(originalType.types, function (t) { return isTypeSubtypeOf(t, narrowedTypeCandidate); }));
|
|
}
|
|
return originalType;
|
|
}
|
|
function narrowTypeByTypePredicate(type, expr, assumeTrue) {
|
|
if (type.flags & 1 /* Any */) {
|
|
return type;
|
|
}
|
|
var signature = getResolvedSignature(expr);
|
|
if (signature.typePredicate &&
|
|
expr.arguments[signature.typePredicate.parameterIndex] &&
|
|
getSymbolAtLocation(expr.arguments[signature.typePredicate.parameterIndex]) === symbol) {
|
|
if (!assumeTrue) {
|
|
if (type.flags & 16384 /* Union */) {
|
|
return getUnionType(ts.filter(type.types, function (t) { return !isTypeSubtypeOf(t, signature.typePredicate.type); }));
|
|
}
|
|
return type;
|
|
}
|
|
return getNarrowedType(type, signature.typePredicate.type);
|
|
}
|
|
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) {
|
|
switch (expr.kind) {
|
|
case 165 /* CallExpression */:
|
|
return narrowTypeByTypePredicate(type, expr, assumeTrue);
|
|
case 169 /* ParenthesizedExpression */:
|
|
return narrowType(type, expr.expression, assumeTrue);
|
|
case 178 /* BinaryExpression */:
|
|
var operator = expr.operatorToken.kind;
|
|
if (operator === 31 /* EqualsEqualsEqualsToken */ || operator === 32 /* ExclamationEqualsEqualsToken */) {
|
|
return narrowTypeByEquality(type, expr, assumeTrue);
|
|
}
|
|
else if (operator === 49 /* AmpersandAmpersandToken */) {
|
|
return narrowTypeByAnd(type, expr, assumeTrue);
|
|
}
|
|
else if (operator === 50 /* BarBarToken */) {
|
|
return narrowTypeByOr(type, expr, assumeTrue);
|
|
}
|
|
else if (operator === 88 /* InstanceOfKeyword */) {
|
|
return narrowTypeByInstanceof(type, expr, assumeTrue);
|
|
}
|
|
break;
|
|
case 176 /* PrefixUnaryExpression */:
|
|
if (expr.operator === 47 /* ExclamationToken */) {
|
|
return narrowType(type, expr.operand, !assumeTrue);
|
|
}
|
|
break;
|
|
}
|
|
return type;
|
|
}
|
|
}
|
|
function checkIdentifier(node) {
|
|
var symbol = getResolvedSymbol(node);
|
|
// 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) {
|
|
var container = ts.getContainingFunction(node);
|
|
if (container.kind === 171 /* ArrowFunction */) {
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
error(node, ts.Diagnostics.The_arguments_object_cannot_be_referenced_in_an_arrow_function_in_ES3_and_ES5_Consider_using_a_standard_function_expression);
|
|
}
|
|
}
|
|
if (node.parserContextFlags & 8 /* Await */) {
|
|
getNodeLinks(container).flags |= 4096 /* CaptureArguments */;
|
|
getNodeLinks(node).flags |= 2048 /* LexicalArguments */;
|
|
}
|
|
}
|
|
if (symbol.flags & 8388608 /* Alias */ && !isInTypeQuery(node) && !isConstEnumOrConstEnumOnlyModule(resolveAlias(symbol))) {
|
|
markAliasSymbolAsReferenced(symbol);
|
|
}
|
|
checkCollisionWithCapturedSuperVariable(node, node);
|
|
checkCollisionWithCapturedThisVariable(node, node);
|
|
checkBlockScopedBindingCapturedInLoop(node, symbol);
|
|
return getNarrowedTypeOfSymbol(getExportSymbolOfValueSymbolIfExported(symbol), node);
|
|
}
|
|
function isInsideFunction(node, threshold) {
|
|
var current = node;
|
|
while (current && current !== threshold) {
|
|
if (ts.isFunctionLike(current)) {
|
|
return true;
|
|
}
|
|
current = current.parent;
|
|
}
|
|
return false;
|
|
}
|
|
function checkBlockScopedBindingCapturedInLoop(node, symbol) {
|
|
if (languageVersion >= 2 /* ES6 */ ||
|
|
(symbol.flags & 2 /* BlockScopedVariable */) === 0 ||
|
|
symbol.valueDeclaration.parent.kind === 241 /* CatchClause */) {
|
|
return;
|
|
}
|
|
// - check if binding is used in some function
|
|
// (stop the walk when reaching container of binding declaration)
|
|
// - if first check succeeded - check if variable is declared inside the loop
|
|
// nesting structure:
|
|
// (variable declaration or binding element) -> variable declaration list -> container
|
|
var container = symbol.valueDeclaration;
|
|
while (container.kind !== 209 /* VariableDeclarationList */) {
|
|
container = container.parent;
|
|
}
|
|
// get the parent of variable declaration list
|
|
container = container.parent;
|
|
if (container.kind === 190 /* VariableStatement */) {
|
|
// if parent is variable statement - get its parent
|
|
container = container.parent;
|
|
}
|
|
var inFunction = isInsideFunction(node.parent, container);
|
|
var current = container;
|
|
while (current && !ts.nodeStartsNewLexicalEnvironment(current)) {
|
|
if (isIterationStatement(current, false)) {
|
|
if (inFunction) {
|
|
grammarErrorOnFirstToken(current, ts.Diagnostics.Loop_contains_block_scoped_variable_0_referenced_by_a_function_in_the_loop_This_is_only_supported_in_ECMAScript_6_or_higher, ts.declarationNameToString(node));
|
|
}
|
|
// mark value declaration so during emit they can have a special handling
|
|
getNodeLinks(symbol.valueDeclaration).flags |= 16384 /* BlockScopedBindingInLoop */;
|
|
break;
|
|
}
|
|
current = current.parent;
|
|
}
|
|
}
|
|
function captureLexicalThis(node, container) {
|
|
getNodeLinks(node).flags |= 2 /* LexicalThis */;
|
|
if (container.kind === 138 /* PropertyDeclaration */ || container.kind === 141 /* Constructor */) {
|
|
var classNode = container.parent;
|
|
getNodeLinks(classNode).flags |= 4 /* CaptureThis */;
|
|
}
|
|
else {
|
|
getNodeLinks(container).flags |= 4 /* CaptureThis */;
|
|
}
|
|
}
|
|
function checkThisExpression(node) {
|
|
// Stop at the first arrow function so that we can
|
|
// tell whether 'this' needs to be captured.
|
|
var container = ts.getThisContainer(node, true);
|
|
var needToCaptureLexicalThis = false;
|
|
// Now skip arrow functions to get the "real" owner of 'this'.
|
|
if (container.kind === 171 /* ArrowFunction */) {
|
|
container = ts.getThisContainer(container, false);
|
|
// When targeting es6, arrow function lexically bind "this" so we do not need to do the work of binding "this" in emitted code
|
|
needToCaptureLexicalThis = (languageVersion < 2 /* ES6 */);
|
|
}
|
|
switch (container.kind) {
|
|
case 215 /* 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 214 /* 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 141 /* Constructor */:
|
|
if (isInConstructorArgumentInitializer(node, container)) {
|
|
error(node, ts.Diagnostics.this_cannot_be_referenced_in_constructor_arguments);
|
|
}
|
|
break;
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
if (container.flags & 128 /* Static */) {
|
|
error(node, ts.Diagnostics.this_cannot_be_referenced_in_a_static_property_initializer);
|
|
}
|
|
break;
|
|
case 133 /* ComputedPropertyName */:
|
|
error(node, ts.Diagnostics.this_cannot_be_referenced_in_a_computed_property_name);
|
|
break;
|
|
}
|
|
if (needToCaptureLexicalThis) {
|
|
captureLexicalThis(node, container);
|
|
}
|
|
if (ts.isClassLike(container.parent)) {
|
|
var symbol = getSymbolOfNode(container.parent);
|
|
return container.flags & 128 /* Static */ ? getTypeOfSymbol(symbol) : getDeclaredTypeOfSymbol(symbol);
|
|
}
|
|
return anyType;
|
|
}
|
|
function isInConstructorArgumentInitializer(node, constructorDecl) {
|
|
for (var n = node; n && n !== constructorDecl; n = n.parent) {
|
|
if (n.kind === 135 /* Parameter */) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function checkSuperExpression(node) {
|
|
var isCallExpression = node.parent.kind === 165 /* CallExpression */ && node.parent.expression === node;
|
|
var classDeclaration = ts.getContainingClass(node);
|
|
var classType = classDeclaration && getDeclaredTypeOfSymbol(getSymbolOfNode(classDeclaration));
|
|
var baseClassType = classType && getBaseTypes(classType)[0];
|
|
if (!baseClassType) {
|
|
if (!classDeclaration || !ts.getClassExtendsHeritageClauseElement(classDeclaration)) {
|
|
error(node, ts.Diagnostics.super_can_only_be_referenced_in_a_derived_class);
|
|
}
|
|
return unknownType;
|
|
}
|
|
var container = ts.getSuperContainer(node, true);
|
|
if (container) {
|
|
var canUseSuperExpression = false;
|
|
var needToCaptureLexicalThis;
|
|
if (isCallExpression) {
|
|
// TS 1.0 SPEC (April 2014): 4.8.1
|
|
// Super calls are only permitted in constructors of derived classes
|
|
canUseSuperExpression = container.kind === 141 /* 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
|
|
// super property access might appear in arrow functions with arbitrary deep nesting
|
|
needToCaptureLexicalThis = false;
|
|
while (container && container.kind === 171 /* ArrowFunction */) {
|
|
container = ts.getSuperContainer(container, true);
|
|
needToCaptureLexicalThis = languageVersion < 2 /* ES6 */;
|
|
}
|
|
// topmost container must be something that is directly nested in the class declaration
|
|
if (container && ts.isClassLike(container.parent)) {
|
|
if (container.flags & 128 /* Static */) {
|
|
canUseSuperExpression =
|
|
container.kind === 140 /* MethodDeclaration */ ||
|
|
container.kind === 139 /* MethodSignature */ ||
|
|
container.kind === 142 /* GetAccessor */ ||
|
|
container.kind === 143 /* SetAccessor */;
|
|
}
|
|
else {
|
|
canUseSuperExpression =
|
|
container.kind === 140 /* MethodDeclaration */ ||
|
|
container.kind === 139 /* MethodSignature */ ||
|
|
container.kind === 142 /* GetAccessor */ ||
|
|
container.kind === 143 /* SetAccessor */ ||
|
|
container.kind === 138 /* PropertyDeclaration */ ||
|
|
container.kind === 137 /* PropertySignature */ ||
|
|
container.kind === 141 /* Constructor */;
|
|
}
|
|
}
|
|
}
|
|
if (canUseSuperExpression) {
|
|
var returnType;
|
|
if ((container.flags & 128 /* Static */) || isCallExpression) {
|
|
getNodeLinks(node).flags |= 512 /* SuperStatic */;
|
|
returnType = getBaseConstructorTypeOfClass(classType);
|
|
}
|
|
else {
|
|
getNodeLinks(node).flags |= 256 /* SuperInstance */;
|
|
returnType = baseClassType;
|
|
}
|
|
if (container.kind === 141 /* 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);
|
|
returnType = unknownType;
|
|
}
|
|
if (!isCallExpression && 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);
|
|
}
|
|
return returnType;
|
|
}
|
|
}
|
|
if (container && container.kind === 133 /* 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 {
|
|
error(node, ts.Diagnostics.super_property_access_is_permitted_only_in_a_constructor_member_function_or_member_accessor_of_a_derived_class);
|
|
}
|
|
return unknownType;
|
|
}
|
|
// Return contextual type of parameter or undefined if no contextual type is available
|
|
function getContextuallyTypedParameterType(parameter) {
|
|
if (isFunctionExpressionOrArrowFunction(parameter.parent)) {
|
|
var func = parameter.parent;
|
|
if (isContextSensitive(func)) {
|
|
var contextualSignature = getContextualSignature(func);
|
|
if (contextualSignature) {
|
|
var funcHasRestParameters = ts.hasRestParameter(func);
|
|
var len = func.parameters.length - (funcHasRestParameters ? 1 : 0);
|
|
var indexOfParameter = ts.indexOf(func.parameters, parameter);
|
|
if (indexOfParameter < len) {
|
|
return getTypeAtPosition(contextualSignature, indexOfParameter);
|
|
}
|
|
// If last parameter is contextually rest parameter get its type
|
|
if (indexOfParameter === (func.parameters.length - 1) &&
|
|
funcHasRestParameters && contextualSignature.hasRestParameter && func.parameters.length >= contextualSignature.parameters.length) {
|
|
return getTypeOfSymbol(ts.lastOrUndefined(contextualSignature.parameters));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
// 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.
|
|
function getContextualTypeForInitializerExpression(node) {
|
|
var declaration = node.parent;
|
|
if (node === declaration.initializer) {
|
|
if (declaration.type) {
|
|
return getTypeFromTypeNode(declaration.type);
|
|
}
|
|
if (declaration.kind === 135 /* Parameter */) {
|
|
var type = getContextuallyTypedParameterType(declaration);
|
|
if (type) {
|
|
return type;
|
|
}
|
|
}
|
|
if (ts.isBindingPattern(declaration.name)) {
|
|
return getTypeFromBindingPattern(declaration.name);
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function getContextualTypeForReturnExpression(node) {
|
|
var func = ts.getContainingFunction(node);
|
|
if (func && !func.asteriskToken) {
|
|
return getContextualReturnType(func);
|
|
}
|
|
return undefined;
|
|
}
|
|
function getContextualTypeForYieldOperand(node) {
|
|
var func = ts.getContainingFunction(node);
|
|
if (func) {
|
|
var contextualReturnType = getContextualReturnType(func);
|
|
if (contextualReturnType) {
|
|
return node.asteriskToken
|
|
? contextualReturnType
|
|
: getElementTypeOfIterableIterator(contextualReturnType);
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function isInParameterInitializerBeforeContainingFunction(node) {
|
|
while (node.parent && !ts.isFunctionLike(node.parent)) {
|
|
if (node.parent.kind === 135 /* Parameter */ && node.parent.initializer === node) {
|
|
return true;
|
|
}
|
|
node = node.parent;
|
|
}
|
|
return false;
|
|
}
|
|
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
|
|
if (functionDecl.type ||
|
|
functionDecl.kind === 141 /* Constructor */ ||
|
|
functionDecl.kind === 142 /* GetAccessor */ && ts.getSetAccessorTypeAnnotationNode(ts.getDeclarationOfKind(functionDecl.symbol, 143 /* SetAccessor */))) {
|
|
return getReturnTypeOfSignature(getSignatureFromDeclaration(functionDecl));
|
|
}
|
|
// 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) {
|
|
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 = ts.indexOf(args, arg);
|
|
if (argIndex >= 0) {
|
|
var signature = getResolvedSignature(callTarget);
|
|
return getTypeAtPosition(signature, argIndex);
|
|
}
|
|
return undefined;
|
|
}
|
|
function getContextualTypeForSubstitutionExpression(template, substitutionExpression) {
|
|
if (template.parent.kind === 167 /* TaggedTemplateExpression */) {
|
|
return getContextualTypeForArgument(template.parent, substitutionExpression);
|
|
}
|
|
return undefined;
|
|
}
|
|
function getContextualTypeForBinaryOperand(node) {
|
|
var binaryExpression = node.parent;
|
|
var operator = binaryExpression.operatorToken.kind;
|
|
if (operator >= 54 /* FirstAssignment */ && operator <= 65 /* LastAssignment */) {
|
|
// In an assignment expression, the right operand is contextually typed by the type of the left operand.
|
|
if (node === binaryExpression.right) {
|
|
return checkExpression(binaryExpression.left);
|
|
}
|
|
}
|
|
else if (operator === 50 /* BarBarToken */) {
|
|
// When an || expression has a contextual type, the operands are contextually typed by that type. When an ||
|
|
// expression has no contextual type, the right operand is contextually typed by the type of the left operand.
|
|
var type = getContextualType(binaryExpression);
|
|
if (!type && node === binaryExpression.right) {
|
|
type = checkExpression(binaryExpression.left);
|
|
}
|
|
return type;
|
|
}
|
|
return undefined;
|
|
}
|
|
// Apply a mapping function to a contextual type and return the resulting type. If the contextual type
|
|
// is a union type, the mapping function is applied to each constituent type and a union of the resulting
|
|
// types is returned.
|
|
function applyToContextualType(type, mapper) {
|
|
if (!(type.flags & 16384 /* Union */)) {
|
|
return mapper(type);
|
|
}
|
|
var types = type.types;
|
|
var mappedType;
|
|
var mappedTypes;
|
|
for (var _i = 0; _i < types.length; _i++) {
|
|
var current = types[_i];
|
|
var t = mapper(current);
|
|
if (t) {
|
|
if (!mappedType) {
|
|
mappedType = t;
|
|
}
|
|
else if (!mappedTypes) {
|
|
mappedTypes = [mappedType, t];
|
|
}
|
|
else {
|
|
mappedTypes.push(t);
|
|
}
|
|
}
|
|
}
|
|
return mappedTypes ? getUnionType(mappedTypes) : mappedType;
|
|
}
|
|
function getTypeOfPropertyOfContextualType(type, name) {
|
|
return applyToContextualType(type, function (t) {
|
|
var prop = t.flags & 130048 /* StructuredType */ ? getPropertyOfType(t, name) : undefined;
|
|
return prop ? getTypeOfSymbol(prop) : undefined;
|
|
});
|
|
}
|
|
function getIndexTypeOfContextualType(type, kind) {
|
|
return applyToContextualType(type, function (t) { return getIndexTypeOfStructuredType(t, kind); });
|
|
}
|
|
// Return true if the given contextual type is a tuple-like type
|
|
function contextualTypeIsTupleLikeType(type) {
|
|
return !!(type.flags & 16384 /* Union */ ? ts.forEach(type.types, isTupleLikeType) : isTupleLikeType(type));
|
|
}
|
|
// Return true if the given contextual type provides an index signature of the given kind
|
|
function contextualTypeHasIndexSignature(type, kind) {
|
|
return !!(type.flags & 16384 /* Union */ ? ts.forEach(type.types, function (t) { return getIndexTypeOfStructuredType(t, kind); }) : getIndexTypeOfStructuredType(type, kind));
|
|
}
|
|
// 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) {
|
|
ts.Debug.assert(ts.isObjectLiteralMethod(node));
|
|
if (isInsideWithStatementBody(node)) {
|
|
// We cannot answer semantic questions within a with block, do not proceed any further
|
|
return undefined;
|
|
}
|
|
return getContextualTypeForObjectLiteralElement(node);
|
|
}
|
|
function getContextualTypeForObjectLiteralElement(element) {
|
|
var objectLiteral = element.parent;
|
|
var type = getContextualType(objectLiteral);
|
|
if (type) {
|
|
if (!ts.hasDynamicName(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.
|
|
var symbolName = getSymbolOfNode(element).name;
|
|
var propertyType = getTypeOfPropertyOfContextualType(type, symbolName);
|
|
if (propertyType) {
|
|
return propertyType;
|
|
}
|
|
}
|
|
return isNumericName(element.name) && getIndexTypeOfContextualType(type, 1 /* Number */) ||
|
|
getIndexTypeOfContextualType(type, 0 /* String */);
|
|
}
|
|
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(node) {
|
|
var arrayLiteral = node.parent;
|
|
var type = getContextualType(arrayLiteral);
|
|
if (type) {
|
|
var index = ts.indexOf(arrayLiteral.elements, node);
|
|
return getTypeOfPropertyOfContextualType(type, "" + index)
|
|
|| getIndexTypeOfContextualType(type, 1 /* Number */)
|
|
|| (languageVersion >= 2 /* ES6 */ ? getElementTypeOfIterable(type, undefined) : undefined);
|
|
}
|
|
return undefined;
|
|
}
|
|
// In a contextually typed conditional expression, the true/false expressions are contextually typed by the same type.
|
|
function getContextualTypeForConditionalOperand(node) {
|
|
var conditional = node.parent;
|
|
return node === conditional.whenTrue || node === conditional.whenFalse ? getContextualType(conditional) : undefined;
|
|
}
|
|
function getContextualTypeForJsxExpression(expr) {
|
|
// Contextual type only applies to JSX expressions that are in attribute assignments (not in 'Children' positions)
|
|
if (expr.parent.kind === 235 /* JsxAttribute */) {
|
|
var attrib = expr.parent;
|
|
var attrsType = getJsxElementAttributesType(attrib.parent);
|
|
if (!attrsType || isTypeAny(attrsType)) {
|
|
return undefined;
|
|
}
|
|
else {
|
|
return getTypeOfPropertyOfType(attrsType, attrib.name.text);
|
|
}
|
|
}
|
|
if (expr.kind === 236 /* JsxSpreadAttribute */) {
|
|
return getJsxElementAttributesType(expr.parent);
|
|
}
|
|
return undefined;
|
|
}
|
|
// 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 getContextualType(node) {
|
|
var type = getContextualTypeWorker(node);
|
|
return type && getApparentType(type);
|
|
}
|
|
function getContextualTypeWorker(node) {
|
|
if (isInsideWithStatementBody(node)) {
|
|
// 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 208 /* VariableDeclaration */:
|
|
case 135 /* Parameter */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 160 /* BindingElement */:
|
|
return getContextualTypeForInitializerExpression(node);
|
|
case 171 /* ArrowFunction */:
|
|
case 201 /* ReturnStatement */:
|
|
return getContextualTypeForReturnExpression(node);
|
|
case 181 /* YieldExpression */:
|
|
return getContextualTypeForYieldOperand(parent);
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
return getContextualTypeForArgument(parent, node);
|
|
case 168 /* TypeAssertionExpression */:
|
|
case 186 /* AsExpression */:
|
|
return getTypeFromTypeNode(parent.type);
|
|
case 178 /* BinaryExpression */:
|
|
return getContextualTypeForBinaryOperand(node);
|
|
case 242 /* PropertyAssignment */:
|
|
return getContextualTypeForObjectLiteralElement(parent);
|
|
case 161 /* ArrayLiteralExpression */:
|
|
return getContextualTypeForElementExpression(node);
|
|
case 179 /* ConditionalExpression */:
|
|
return getContextualTypeForConditionalOperand(node);
|
|
case 187 /* TemplateSpan */:
|
|
ts.Debug.assert(parent.parent.kind === 180 /* TemplateExpression */);
|
|
return getContextualTypeForSubstitutionExpression(parent.parent, node);
|
|
case 169 /* ParenthesizedExpression */:
|
|
return getContextualType(parent);
|
|
case 237 /* JsxExpression */:
|
|
case 236 /* JsxSpreadAttribute */:
|
|
return getContextualTypeForJsxExpression(parent);
|
|
}
|
|
return undefined;
|
|
}
|
|
// If the given type is an object or union type, if that type has a single signature, and if
|
|
// that signature is non-generic, return the signature. Otherwise return undefined.
|
|
function getNonGenericSignature(type) {
|
|
var signatures = getSignaturesOfStructuredType(type, 0 /* Call */);
|
|
if (signatures.length === 1) {
|
|
var signature = signatures[0];
|
|
if (!signature.typeParameters) {
|
|
return signature;
|
|
}
|
|
}
|
|
}
|
|
function isFunctionExpressionOrArrowFunction(node) {
|
|
return node.kind === 170 /* FunctionExpression */ || node.kind === 171 /* 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 !== 140 /* MethodDeclaration */ || ts.isObjectLiteralMethod(node));
|
|
var type = ts.isObjectLiteralMethod(node)
|
|
? getContextualTypeForObjectLiteralMethod(node)
|
|
: getContextualType(node);
|
|
if (!type) {
|
|
return undefined;
|
|
}
|
|
if (!(type.flags & 16384 /* Union */)) {
|
|
return getNonGenericSignature(type);
|
|
}
|
|
var signatureList;
|
|
var types = type.types;
|
|
for (var _i = 0; _i < types.length; _i++) {
|
|
var current = types[_i];
|
|
// The signature set of all constituent type with call signatures should match
|
|
// So number of signatures allowed is either 0 or 1
|
|
if (signatureList &&
|
|
getSignaturesOfStructuredType(current, 0 /* Call */).length > 1) {
|
|
return undefined;
|
|
}
|
|
var signature = getNonGenericSignature(current);
|
|
if (signature) {
|
|
if (!signatureList) {
|
|
// This signature will contribute to contextual union signature
|
|
signatureList = [signature];
|
|
}
|
|
else if (!compareSignatures(signatureList[0], signature, false, compareTypes)) {
|
|
// 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)
|
|
var result;
|
|
if (signatureList) {
|
|
result = cloneSignature(signatureList[0]);
|
|
// Clear resolved return type we possibly got from cloneSignature
|
|
result.resolvedReturnType = undefined;
|
|
result.unionSignatures = signatureList;
|
|
}
|
|
return result;
|
|
}
|
|
// Presence of a contextual type mapper indicates inferential typing, except the identityMapper object is
|
|
// used as a special marker for other purposes.
|
|
function isInferentialContext(mapper) {
|
|
return mapper && mapper !== identityMapper;
|
|
}
|
|
// 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', '[{ p: a}] = xxx'.
|
|
function isAssignmentTarget(node) {
|
|
var parent = node.parent;
|
|
if (parent.kind === 178 /* BinaryExpression */ && parent.operatorToken.kind === 54 /* EqualsToken */ && parent.left === node) {
|
|
return true;
|
|
}
|
|
if (parent.kind === 242 /* PropertyAssignment */) {
|
|
return isAssignmentTarget(parent.parent);
|
|
}
|
|
if (parent.kind === 161 /* ArrayLiteralExpression */) {
|
|
return isAssignmentTarget(parent);
|
|
}
|
|
return false;
|
|
}
|
|
function checkSpreadElementExpression(node, contextualMapper) {
|
|
// It is usually not safe to call checkExpressionCached if we can be contextually typing.
|
|
// You can tell that we are contextually typing because of the contextualMapper parameter.
|
|
// While it is true that a spread element can have a contextual type, it does not do anything
|
|
// with this type. It is neither affected by it, nor does it propagate it to its operand.
|
|
// So the fact that contextualMapper is passed is not important, because the operand of a spread
|
|
// element is not contextually typed.
|
|
var arrayOrIterableType = checkExpressionCached(node.expression, contextualMapper);
|
|
return checkIteratedTypeOrElementType(arrayOrIterableType, node.expression, false);
|
|
}
|
|
function checkArrayLiteral(node, contextualMapper) {
|
|
var elements = node.elements;
|
|
if (!elements.length) {
|
|
return createArrayType(undefinedType);
|
|
}
|
|
var hasSpreadElement = false;
|
|
var elementTypes = [];
|
|
var inDestructuringPattern = isAssignmentTarget(node);
|
|
for (var _i = 0; _i < elements.length; _i++) {
|
|
var e = elements[_i];
|
|
if (inDestructuringPattern && e.kind === 182 /* SpreadElementExpression */) {
|
|
// 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 restArrayType = checkExpression(e.expression, contextualMapper);
|
|
var restElementType = getIndexTypeOfType(restArrayType, 1 /* Number */) ||
|
|
(languageVersion >= 2 /* ES6 */ ? getElementTypeOfIterable(restArrayType, undefined) : undefined);
|
|
if (restElementType) {
|
|
elementTypes.push(restElementType);
|
|
}
|
|
}
|
|
else {
|
|
var type = checkExpression(e, contextualMapper);
|
|
elementTypes.push(type);
|
|
}
|
|
hasSpreadElement = hasSpreadElement || e.kind === 182 /* SpreadElementExpression */;
|
|
}
|
|
if (!hasSpreadElement) {
|
|
var contextualType = getContextualType(node);
|
|
if (contextualType && contextualTypeIsTupleLikeType(contextualType) || inDestructuringPattern) {
|
|
return createTupleType(elementTypes);
|
|
}
|
|
}
|
|
return createArrayType(getUnionType(elementTypes));
|
|
}
|
|
function isNumericName(name) {
|
|
return name.kind === 133 /* ComputedPropertyName */ ? isNumericComputedName(name) : isNumericLiteralName(name.text);
|
|
}
|
|
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 isTypeAnyOrAllConstituentTypesHaveKind(checkComputedPropertyName(name), 132 /* NumberLike */);
|
|
}
|
|
function isTypeAnyOrAllConstituentTypesHaveKind(type, kind) {
|
|
return isTypeAny(type) || allConstituentTypesHaveKind(type, kind);
|
|
}
|
|
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);
|
|
// 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 (!isTypeAnyOrAllConstituentTypesHaveKind(links.resolvedType, 132 /* NumberLike */ | 258 /* StringLike */ | 4194304 /* ESSymbol */)) {
|
|
error(node, ts.Diagnostics.A_computed_property_name_must_be_of_type_string_number_symbol_or_any);
|
|
}
|
|
else {
|
|
checkThatExpressionIsProperSymbolReference(node.expression, links.resolvedType, true);
|
|
}
|
|
}
|
|
return links.resolvedType;
|
|
}
|
|
function checkObjectLiteral(node, contextualMapper) {
|
|
// Grammar checking
|
|
checkGrammarObjectLiteralExpression(node);
|
|
var propertiesTable = {};
|
|
var propertiesArray = [];
|
|
var contextualType = getContextualType(node);
|
|
var typeFlags;
|
|
for (var _i = 0, _a = node.properties; _i < _a.length; _i++) {
|
|
var memberDecl = _a[_i];
|
|
var member = memberDecl.symbol;
|
|
if (memberDecl.kind === 242 /* PropertyAssignment */ ||
|
|
memberDecl.kind === 243 /* ShorthandPropertyAssignment */ ||
|
|
ts.isObjectLiteralMethod(memberDecl)) {
|
|
var type = void 0;
|
|
if (memberDecl.kind === 242 /* PropertyAssignment */) {
|
|
type = checkPropertyAssignment(memberDecl, contextualMapper);
|
|
}
|
|
else if (memberDecl.kind === 140 /* MethodDeclaration */) {
|
|
type = checkObjectLiteralMethod(memberDecl, contextualMapper);
|
|
}
|
|
else {
|
|
ts.Debug.assert(memberDecl.kind === 243 /* ShorthandPropertyAssignment */);
|
|
type = checkExpression(memberDecl.name, contextualMapper);
|
|
}
|
|
typeFlags |= type.flags;
|
|
var prop = createSymbol(4 /* Property */ | 67108864 /* Transient */ | member.flags, member.name);
|
|
prop.declarations = member.declarations;
|
|
prop.parent = member.parent;
|
|
if (member.valueDeclaration) {
|
|
prop.valueDeclaration = member.valueDeclaration;
|
|
}
|
|
prop.type = type;
|
|
prop.target = member;
|
|
member = prop;
|
|
}
|
|
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 === 142 /* GetAccessor */ || memberDecl.kind === 143 /* SetAccessor */);
|
|
checkAccessorDeclaration(memberDecl);
|
|
}
|
|
if (!ts.hasDynamicName(memberDecl)) {
|
|
propertiesTable[member.name] = member;
|
|
}
|
|
propertiesArray.push(member);
|
|
}
|
|
var stringIndexType = getIndexType(0 /* String */);
|
|
var numberIndexType = getIndexType(1 /* Number */);
|
|
var result = createAnonymousType(node.symbol, propertiesTable, emptyArray, emptyArray, stringIndexType, numberIndexType);
|
|
result.flags |= 524288 /* ObjectLiteral */ | 2097152 /* ContainsObjectLiteral */ | (typeFlags & 1048576 /* ContainsUndefinedOrNull */);
|
|
return result;
|
|
function getIndexType(kind) {
|
|
if (contextualType && contextualTypeHasIndexSignature(contextualType, kind)) {
|
|
var propTypes = [];
|
|
for (var i = 0; i < propertiesArray.length; i++) {
|
|
var propertyDecl = node.properties[i];
|
|
if (kind === 0 /* String */ || isNumericName(propertyDecl.name)) {
|
|
// Do not call getSymbolOfNode(propertyDecl), as that will get the
|
|
// original symbol for the node. We actually want to get the symbol
|
|
// created by checkObjectLiteral, since that will be appropriately
|
|
// contextually typed and resolved.
|
|
var type = getTypeOfSymbol(propertiesArray[i]);
|
|
if (!ts.contains(propTypes, type)) {
|
|
propTypes.push(type);
|
|
}
|
|
}
|
|
}
|
|
var result_1 = propTypes.length ? getUnionType(propTypes) : undefinedType;
|
|
typeFlags |= result_1.flags;
|
|
return result_1;
|
|
}
|
|
return undefined;
|
|
}
|
|
}
|
|
function checkJsxSelfClosingElement(node) {
|
|
checkJsxOpeningLikeElement(node);
|
|
return jsxElementType || anyType;
|
|
}
|
|
function tagNamesAreEquivalent(lhs, rhs) {
|
|
if (lhs.kind !== rhs.kind) {
|
|
return false;
|
|
}
|
|
if (lhs.kind === 66 /* Identifier */) {
|
|
return lhs.text === rhs.text;
|
|
}
|
|
return lhs.right.text === rhs.right.text &&
|
|
tagNamesAreEquivalent(lhs.left, rhs.left);
|
|
}
|
|
function checkJsxElement(node) {
|
|
// Check that the closing tag matches
|
|
if (!tagNamesAreEquivalent(node.openingElement.tagName, node.closingElement.tagName)) {
|
|
error(node.closingElement, ts.Diagnostics.Expected_corresponding_JSX_closing_tag_for_0, ts.getTextOfNode(node.openingElement.tagName));
|
|
}
|
|
// Check attributes
|
|
checkJsxOpeningLikeElement(node.openingElement);
|
|
// Check children
|
|
for (var _i = 0, _a = node.children; _i < _a.length; _i++) {
|
|
var child = _a[_i];
|
|
switch (child.kind) {
|
|
case 237 /* JsxExpression */:
|
|
checkJsxExpression(child);
|
|
break;
|
|
case 230 /* JsxElement */:
|
|
checkJsxElement(child);
|
|
break;
|
|
case 231 /* JsxSelfClosingElement */:
|
|
checkJsxSelfClosingElement(child);
|
|
break;
|
|
default:
|
|
// No checks for JSX Text
|
|
ts.Debug.assert(child.kind === 233 /* JsxText */);
|
|
}
|
|
}
|
|
return jsxElementType || anyType;
|
|
}
|
|
/**
|
|
* Returns true iff the JSX element name would be a valid JS identifier, ignoring restrictions about keywords not being identifiers
|
|
*/
|
|
function isUnhyphenatedJsxName(name) {
|
|
// - is the only character supported in JSX attribute names that isn't valid in JavaScript identifiers
|
|
return name.indexOf("-") < 0;
|
|
}
|
|
/**
|
|
* Returns true iff React would emit this tag name as a string rather than an identifier or qualified name
|
|
*/
|
|
function isJsxIntrinsicIdentifier(tagName) {
|
|
if (tagName.kind === 132 /* QualifiedName */) {
|
|
return false;
|
|
}
|
|
else {
|
|
return ts.isIntrinsicJsxName(tagName.text);
|
|
}
|
|
}
|
|
function checkJsxAttribute(node, elementAttributesType, nameTable) {
|
|
var correspondingPropType = undefined;
|
|
// Look up the corresponding property for this attribute
|
|
if (elementAttributesType === emptyObjectType && isUnhyphenatedJsxName(node.name.text)) {
|
|
// If there is no 'props' property, you may not have non-"data-" attributes
|
|
error(node.parent, ts.Diagnostics.JSX_element_class_does_not_support_attributes_because_it_does_not_have_a_0_property, getJsxElementPropertiesName());
|
|
}
|
|
else if (elementAttributesType && !isTypeAny(elementAttributesType)) {
|
|
var correspondingPropSymbol = getPropertyOfType(elementAttributesType, node.name.text);
|
|
correspondingPropType = correspondingPropSymbol && getTypeOfSymbol(correspondingPropSymbol);
|
|
// If there's no corresponding property with this name, error
|
|
if (!correspondingPropType && isUnhyphenatedJsxName(node.name.text)) {
|
|
error(node.name, ts.Diagnostics.Property_0_does_not_exist_on_type_1, node.name.text, typeToString(elementAttributesType));
|
|
return unknownType;
|
|
}
|
|
}
|
|
var exprType;
|
|
if (node.initializer) {
|
|
exprType = checkExpression(node.initializer);
|
|
}
|
|
else {
|
|
// <Elem attr /> is sugar for <Elem attr={true} />
|
|
exprType = booleanType;
|
|
}
|
|
if (correspondingPropType) {
|
|
checkTypeAssignableTo(exprType, correspondingPropType, node);
|
|
}
|
|
nameTable[node.name.text] = true;
|
|
return exprType;
|
|
}
|
|
function checkJsxSpreadAttribute(node, elementAttributesType, nameTable) {
|
|
var type = checkExpression(node.expression);
|
|
var props = getPropertiesOfType(type);
|
|
for (var _i = 0; _i < props.length; _i++) {
|
|
var prop = props[_i];
|
|
// Is there a corresponding property in the element attributes type? Skip checking of properties
|
|
// that have already been assigned to, as these are not actually pushed into the resulting type
|
|
if (!nameTable[prop.name]) {
|
|
var targetPropSym = getPropertyOfType(elementAttributesType, prop.name);
|
|
if (targetPropSym) {
|
|
var msg = ts.chainDiagnosticMessages(undefined, ts.Diagnostics.Property_0_of_JSX_spread_attribute_is_not_assignable_to_target_property, prop.name);
|
|
checkTypeAssignableTo(getTypeOfSymbol(prop), getTypeOfSymbol(targetPropSym), node, undefined, msg);
|
|
}
|
|
nameTable[prop.name] = true;
|
|
}
|
|
}
|
|
return type;
|
|
}
|
|
/// Returns the type JSX.IntrinsicElements. May return `unknownType` if that type is not present.
|
|
function getJsxIntrinsicElementsType() {
|
|
if (!jsxIntrinsicElementsType) {
|
|
jsxIntrinsicElementsType = getExportedTypeFromNamespace(JsxNames.JSX, JsxNames.IntrinsicElements) || unknownType;
|
|
}
|
|
return jsxIntrinsicElementsType;
|
|
}
|
|
/// Given a JSX opening element or self-closing element, return the symbol of the property that the tag name points to if
|
|
/// this is an intrinsic tag. This might be a named
|
|
/// property of the IntrinsicElements interface, or its string indexer.
|
|
/// If this is a class-based tag (otherwise returns undefined), returns the symbol of the class
|
|
/// type or factory function.
|
|
/// Otherwise, returns unknownSymbol.
|
|
function getJsxElementTagSymbol(node) {
|
|
var flags = 8 /* UnknownElement */;
|
|
var links = getNodeLinks(node);
|
|
if (!links.resolvedSymbol) {
|
|
if (isJsxIntrinsicIdentifier(node.tagName)) {
|
|
links.resolvedSymbol = lookupIntrinsicTag(node);
|
|
}
|
|
else {
|
|
links.resolvedSymbol = lookupClassTag(node);
|
|
}
|
|
}
|
|
return links.resolvedSymbol;
|
|
function lookupIntrinsicTag(node) {
|
|
var intrinsicElementsType = getJsxIntrinsicElementsType();
|
|
if (intrinsicElementsType !== unknownType) {
|
|
// Property case
|
|
var intrinsicProp = getPropertyOfType(intrinsicElementsType, node.tagName.text);
|
|
if (intrinsicProp) {
|
|
links.jsxFlags |= 1 /* IntrinsicNamedElement */;
|
|
return intrinsicProp;
|
|
}
|
|
// Intrinsic string indexer case
|
|
var indexSignatureType = getIndexTypeOfType(intrinsicElementsType, 0 /* String */);
|
|
if (indexSignatureType) {
|
|
links.jsxFlags |= 2 /* IntrinsicIndexedElement */;
|
|
return intrinsicElementsType.symbol;
|
|
}
|
|
// Wasn't found
|
|
error(node, ts.Diagnostics.Property_0_does_not_exist_on_type_1, node.tagName.text, 'JSX.' + JsxNames.IntrinsicElements);
|
|
return unknownSymbol;
|
|
}
|
|
else {
|
|
if (compilerOptions.noImplicitAny) {
|
|
error(node, ts.Diagnostics.JSX_element_implicitly_has_type_any_because_no_interface_JSX_0_exists, JsxNames.IntrinsicElements);
|
|
}
|
|
}
|
|
}
|
|
function lookupClassTag(node) {
|
|
var valueSymbol;
|
|
// Look up the value in the current scope
|
|
if (node.tagName.kind === 66 /* Identifier */) {
|
|
var tag = node.tagName;
|
|
var sym = getResolvedSymbol(tag);
|
|
valueSymbol = sym.exportSymbol || sym;
|
|
}
|
|
else {
|
|
valueSymbol = checkQualifiedName(node.tagName).symbol;
|
|
}
|
|
if (valueSymbol && valueSymbol !== unknownSymbol) {
|
|
links.jsxFlags |= 4 /* ClassElement */;
|
|
getSymbolLinks(valueSymbol).referenced = true;
|
|
}
|
|
return valueSymbol || unknownSymbol;
|
|
}
|
|
}
|
|
/**
|
|
* Given a JSX element that is a class element, finds the Element Instance Type. If the
|
|
* element is not a class element, or the class element type cannot be determined, returns 'undefined'.
|
|
* For example, in the element <MyClass>, the element instance type is `MyClass` (not `typeof MyClass`).
|
|
*/
|
|
function getJsxElementInstanceType(node) {
|
|
if (!(getNodeLinks(node).jsxFlags & 4 /* ClassElement */)) {
|
|
// There is no such thing as an instance type for a non-class element
|
|
return undefined;
|
|
}
|
|
var classSymbol = getJsxElementTagSymbol(node);
|
|
if (classSymbol === unknownSymbol) {
|
|
// Couldn't find the class instance type. Error has already been issued
|
|
return anyType;
|
|
}
|
|
var valueType = getTypeOfSymbol(classSymbol);
|
|
if (isTypeAny(valueType)) {
|
|
// Short-circuit if the class tag is using an element type 'any'
|
|
return anyType;
|
|
}
|
|
// Resolve the signatures, preferring constructors
|
|
var signatures = getSignaturesOfType(valueType, 1 /* Construct */);
|
|
if (signatures.length === 0) {
|
|
// No construct signatures, try call signatures
|
|
signatures = getSignaturesOfType(valueType, 0 /* Call */);
|
|
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 undefined;
|
|
}
|
|
}
|
|
// Check that the constructor/factory returns an object type
|
|
var returnType = getUnionType(signatures.map(function (s) { return getReturnTypeOfSignature(s); }));
|
|
if (!isTypeAny(returnType) && !(returnType.flags & 80896 /* ObjectType */)) {
|
|
error(node.tagName, ts.Diagnostics.The_return_type_of_a_JSX_element_constructor_must_return_an_object_type);
|
|
return undefined;
|
|
}
|
|
// Issue an error if this return type isn't assignable to JSX.ElementClass
|
|
var elemClassType = getJsxGlobalElementClassType();
|
|
if (elemClassType) {
|
|
checkTypeRelatedTo(returnType, elemClassType, assignableRelation, node, ts.Diagnostics.JSX_element_type_0_is_not_a_constructor_function_for_JSX_elements);
|
|
}
|
|
return returnType;
|
|
}
|
|
/// e.g. "props" for React.d.ts,
|
|
/// or 'undefined' if ElementAttributesPropery doesn't exist (which means all
|
|
/// non-intrinsic elements' attributes type is 'any'),
|
|
/// or '' if it has 0 properties (which means every
|
|
/// non-instrinsic elements' attributes type is the element instance type)
|
|
function getJsxElementPropertiesName() {
|
|
// JSX
|
|
var jsxNamespace = getGlobalSymbol(JsxNames.JSX, 1536 /* Namespace */, undefined);
|
|
// JSX.ElementAttributesProperty [symbol]
|
|
var attribsPropTypeSym = jsxNamespace && getSymbol(jsxNamespace.exports, JsxNames.ElementAttributesPropertyNameContainer, 793056 /* Type */);
|
|
// JSX.ElementAttributesProperty [type]
|
|
var attribPropType = attribsPropTypeSym && getDeclaredTypeOfSymbol(attribsPropTypeSym);
|
|
// The properites of JSX.ElementAttributesProperty
|
|
var attribProperties = attribPropType && getPropertiesOfType(attribPropType);
|
|
if (attribProperties) {
|
|
// Element Attributes has zero properties, so the element attributes type will be the class instance type
|
|
if (attribProperties.length === 0) {
|
|
return "";
|
|
}
|
|
else if (attribProperties.length === 1) {
|
|
return attribProperties[0].name;
|
|
}
|
|
else {
|
|
error(attribsPropTypeSym.declarations[0], ts.Diagnostics.The_global_type_JSX_0_may_not_have_more_than_one_property, JsxNames.ElementAttributesPropertyNameContainer);
|
|
return undefined;
|
|
}
|
|
}
|
|
else {
|
|
// No interface exists, so the element attributes type will be an implicit any
|
|
return undefined;
|
|
}
|
|
}
|
|
/**
|
|
* Given an opening/self-closing element, get the 'element attributes type', i.e. the type that tells
|
|
* us which attributes are valid on a given element.
|
|
*/
|
|
function getJsxElementAttributesType(node) {
|
|
var links = getNodeLinks(node);
|
|
if (!links.resolvedJsxType) {
|
|
var sym = getJsxElementTagSymbol(node);
|
|
if (links.jsxFlags & 4 /* ClassElement */) {
|
|
var elemInstanceType = getJsxElementInstanceType(node);
|
|
if (isTypeAny(elemInstanceType)) {
|
|
return links.resolvedJsxType = anyType;
|
|
}
|
|
var propsName = getJsxElementPropertiesName();
|
|
if (propsName === undefined) {
|
|
// There is no type ElementAttributesProperty, return 'any'
|
|
return links.resolvedJsxType = anyType;
|
|
}
|
|
else if (propsName === "") {
|
|
// If there is no e.g. 'props' member in ElementAttributesProperty, use the element class type instead
|
|
return links.resolvedJsxType = elemInstanceType;
|
|
}
|
|
else {
|
|
var attributesType = getTypeOfPropertyOfType(elemInstanceType, propsName);
|
|
if (!attributesType) {
|
|
// There is no property named 'props' on this instance type
|
|
return links.resolvedJsxType = emptyObjectType;
|
|
}
|
|
else if (isTypeAny(attributesType) || (attributesType === unknownType)) {
|
|
return links.resolvedJsxType = attributesType;
|
|
}
|
|
else if (!(attributesType.flags & 80896 /* ObjectType */)) {
|
|
error(node.tagName, ts.Diagnostics.JSX_element_attributes_type_0_must_be_an_object_type, typeToString(attributesType));
|
|
return links.resolvedJsxType = anyType;
|
|
}
|
|
else {
|
|
return links.resolvedJsxType = attributesType;
|
|
}
|
|
}
|
|
}
|
|
else if (links.jsxFlags & 1 /* IntrinsicNamedElement */) {
|
|
return links.resolvedJsxType = getTypeOfSymbol(sym);
|
|
}
|
|
else if (links.jsxFlags & 2 /* IntrinsicIndexedElement */) {
|
|
return links.resolvedJsxType = getIndexTypeOfSymbol(sym, 0 /* String */);
|
|
}
|
|
else {
|
|
// Resolution failed, so we don't know
|
|
return links.resolvedJsxType = anyType;
|
|
}
|
|
}
|
|
return links.resolvedJsxType;
|
|
}
|
|
/**
|
|
* Given a JSX attribute, returns the symbol for the corresponds property
|
|
* of the element attributes type. Will return unknownSymbol for attributes
|
|
* that have no matching element attributes type property.
|
|
*/
|
|
function getJsxAttributePropertySymbol(attrib) {
|
|
var attributesType = getJsxElementAttributesType(attrib.parent);
|
|
var prop = getPropertyOfType(attributesType, attrib.name.text);
|
|
return prop || unknownSymbol;
|
|
}
|
|
var jsxElementClassType = undefined;
|
|
function getJsxGlobalElementClassType() {
|
|
if (!jsxElementClassType) {
|
|
jsxElementClassType = getExportedTypeFromNamespace(JsxNames.JSX, JsxNames.ElementClass);
|
|
}
|
|
return jsxElementClassType;
|
|
}
|
|
/// Returns all the properties of the Jsx.IntrinsicElements interface
|
|
function getJsxIntrinsicTagNames() {
|
|
var intrinsics = getJsxIntrinsicElementsType();
|
|
return intrinsics ? getPropertiesOfType(intrinsics) : 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 (jsxElementType === undefined) {
|
|
if (compilerOptions.noImplicitAny) {
|
|
error(errorNode, ts.Diagnostics.JSX_element_implicitly_has_type_any_because_the_global_type_JSX_Element_does_not_exist);
|
|
}
|
|
}
|
|
}
|
|
function checkJsxOpeningLikeElement(node) {
|
|
checkGrammarJsxElement(node);
|
|
checkJsxPreconditions(node);
|
|
// If we're compiling under --jsx react, the symbol 'React' should
|
|
// be marked as 'used' so we don't incorrectly elide its import. And if there
|
|
// is no 'React' symbol in scope, we should issue an error.
|
|
if (compilerOptions.jsx === 2 /* React */) {
|
|
var reactSym = resolveName(node.tagName, 'React', 107455 /* Value */, ts.Diagnostics.Cannot_find_name_0, 'React');
|
|
if (reactSym) {
|
|
getSymbolLinks(reactSym).referenced = true;
|
|
}
|
|
}
|
|
var targetAttributesType = getJsxElementAttributesType(node);
|
|
var nameTable = {};
|
|
// Process this array in right-to-left order so we know which
|
|
// attributes (mostly from spreads) are being overwritten and
|
|
// thus should have their types ignored
|
|
var sawSpreadedAny = false;
|
|
for (var i = node.attributes.length - 1; i >= 0; i--) {
|
|
if (node.attributes[i].kind === 235 /* JsxAttribute */) {
|
|
checkJsxAttribute((node.attributes[i]), targetAttributesType, nameTable);
|
|
}
|
|
else {
|
|
ts.Debug.assert(node.attributes[i].kind === 236 /* JsxSpreadAttribute */);
|
|
var spreadType = checkJsxSpreadAttribute((node.attributes[i]), targetAttributesType, nameTable);
|
|
if (isTypeAny(spreadType)) {
|
|
sawSpreadedAny = true;
|
|
}
|
|
}
|
|
}
|
|
// Check that all required properties have been provided. If an 'any'
|
|
// was spreaded in, though, assume that it provided all required properties
|
|
if (targetAttributesType && !sawSpreadedAny) {
|
|
var targetProperties = getPropertiesOfType(targetAttributesType);
|
|
for (var i = 0; i < targetProperties.length; i++) {
|
|
if (!(targetProperties[i].flags & 536870912 /* Optional */) &&
|
|
nameTable[targetProperties[i].name] === undefined) {
|
|
error(node, ts.Diagnostics.Property_0_is_missing_in_type_1, targetProperties[i].name, typeToString(targetAttributesType));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function checkJsxExpression(node) {
|
|
if (node.expression) {
|
|
return checkExpression(node.expression);
|
|
}
|
|
else {
|
|
return unknownType;
|
|
}
|
|
}
|
|
// If a symbol is a synthesized symbol with no value declaration, we assume it is a property. Example of this are the synthesized
|
|
// '.prototype' property as well as synthesized tuple index properties.
|
|
function getDeclarationKindFromSymbol(s) {
|
|
return s.valueDeclaration ? s.valueDeclaration.kind : 138 /* PropertyDeclaration */;
|
|
}
|
|
function getDeclarationFlagsFromSymbol(s) {
|
|
return s.valueDeclaration ? ts.getCombinedNodeFlags(s.valueDeclaration) : s.flags & 134217728 /* Prototype */ ? 16 /* Public */ | 128 /* Static */ : 0;
|
|
}
|
|
/**
|
|
* 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 left The left hand side of the property access (e.g.: the super in `super.foo`).
|
|
* @param type The type of left.
|
|
* @param prop The symbol for the right hand side of the property access.
|
|
*/
|
|
function checkClassPropertyAccess(node, left, type, prop) {
|
|
var flags = getDeclarationFlagsFromSymbol(prop);
|
|
var declaringClass = getDeclaredTypeOfSymbol(prop.parent);
|
|
if (left.kind === 92 /* SuperKeyword */) {
|
|
var errorNode = node.kind === 163 /* PropertyAccessExpression */ ?
|
|
node.name :
|
|
node.right;
|
|
// 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 (getDeclarationKindFromSymbol(prop) !== 140 /* MethodDeclaration */) {
|
|
// `prop` refers to a *property* declared in the super class
|
|
// rather than a *method*, so it does not satisfy the above criteria.
|
|
error(errorNode, ts.Diagnostics.Only_public_and_protected_methods_of_the_base_class_are_accessible_via_the_super_keyword);
|
|
return false;
|
|
}
|
|
if (flags & 256 /* 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.
|
|
error(errorNode, ts.Diagnostics.Abstract_method_0_in_class_1_cannot_be_accessed_via_super_expression, symbolToString(prop), typeToString(declaringClass));
|
|
return false;
|
|
}
|
|
}
|
|
// Public properties are otherwise accessible.
|
|
if (!(flags & (32 /* Private */ | 64 /* Protected */))) {
|
|
return true;
|
|
}
|
|
// Property is known to be private or protected at this point
|
|
// Get the declaring and enclosing class instance types
|
|
var enclosingClassDeclaration = ts.getContainingClass(node);
|
|
var enclosingClass = enclosingClassDeclaration ? getDeclaredTypeOfSymbol(getSymbolOfNode(enclosingClassDeclaration)) : undefined;
|
|
// Private property is accessible if declaring and enclosing class are the same
|
|
if (flags & 32 /* Private */) {
|
|
if (declaringClass !== enclosingClass) {
|
|
error(node, ts.Diagnostics.Property_0_is_private_and_only_accessible_within_class_1, symbolToString(prop), typeToString(declaringClass));
|
|
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 (left.kind === 92 /* SuperKeyword */) {
|
|
return true;
|
|
}
|
|
// A protected property is accessible in the declaring class and classes derived from it
|
|
if (!enclosingClass || !hasBaseType(enclosingClass, declaringClass)) {
|
|
error(node, ts.Diagnostics.Property_0_is_protected_and_only_accessible_within_class_1_and_its_subclasses, symbolToString(prop), typeToString(declaringClass));
|
|
return false;
|
|
}
|
|
// No further restrictions for static properties
|
|
if (flags & 128 /* Static */) {
|
|
return true;
|
|
}
|
|
// An instance property must be accessed through an instance of the enclosing class
|
|
// TODO: why is the first part of this check here?
|
|
if (!(getTargetType(type).flags & (1024 /* Class */ | 2048 /* Interface */) && hasBaseType(type, enclosingClass))) {
|
|
error(node, ts.Diagnostics.Property_0_is_protected_and_only_accessible_through_an_instance_of_class_1, symbolToString(prop), typeToString(enclosingClass));
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
function checkPropertyAccessExpression(node) {
|
|
return checkPropertyAccessExpressionOrQualifiedName(node, node.expression, node.name);
|
|
}
|
|
function checkQualifiedName(node) {
|
|
return checkPropertyAccessExpressionOrQualifiedName(node, node.left, node.right);
|
|
}
|
|
function checkPropertyAccessExpressionOrQualifiedName(node, left, right) {
|
|
var type = checkExpression(left);
|
|
if (isTypeAny(type)) {
|
|
return type;
|
|
}
|
|
var apparentType = getApparentType(getWidenedType(type));
|
|
if (apparentType === unknownType) {
|
|
// handle cases when type is Type parameter with invalid constraint
|
|
return unknownType;
|
|
}
|
|
var prop = getPropertyOfType(apparentType, right.text);
|
|
if (!prop) {
|
|
if (right.text) {
|
|
error(right, ts.Diagnostics.Property_0_does_not_exist_on_type_1, ts.declarationNameToString(right), typeToString(type));
|
|
}
|
|
return unknownType;
|
|
}
|
|
getNodeLinks(node).resolvedSymbol = prop;
|
|
if (prop.parent && prop.parent.flags & 32 /* Class */) {
|
|
checkClassPropertyAccess(node, left, type, prop);
|
|
}
|
|
return getTypeOfSymbol(prop);
|
|
}
|
|
function isValidPropertyAccess(node, propertyName) {
|
|
var left = node.kind === 163 /* PropertyAccessExpression */
|
|
? node.expression
|
|
: node.left;
|
|
var type = checkExpression(left);
|
|
if (type !== unknownType && !isTypeAny(type)) {
|
|
var prop = getPropertyOfType(getWidenedType(type), propertyName);
|
|
if (prop && prop.parent && prop.parent.flags & 32 /* Class */) {
|
|
return checkClassPropertyAccess(node, left, type, prop);
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
function checkIndexedAccess(node) {
|
|
// Grammar checking
|
|
if (!node.argumentExpression) {
|
|
var sourceFile = getSourceFile(node);
|
|
if (node.parent.kind === 166 /* NewExpression */ && node.parent.expression === node) {
|
|
var start = ts.skipTrivia(sourceFile.text, node.expression.end);
|
|
var end = node.end;
|
|
grammarErrorAtPos(sourceFile, start, end - start, ts.Diagnostics.new_T_cannot_be_used_to_create_an_array_Use_new_Array_T_instead);
|
|
}
|
|
else {
|
|
var start = node.end - "]".length;
|
|
var end = node.end;
|
|
grammarErrorAtPos(sourceFile, start, end - start, ts.Diagnostics.Expression_expected);
|
|
}
|
|
}
|
|
// Obtain base constraint such that we can bail out if the constraint is an unknown type
|
|
var objectType = getApparentType(checkExpression(node.expression));
|
|
var indexType = node.argumentExpression ? checkExpression(node.argumentExpression) : unknownType;
|
|
if (objectType === unknownType) {
|
|
return unknownType;
|
|
}
|
|
var isConstEnum = isConstEnumObjectType(objectType);
|
|
if (isConstEnum &&
|
|
(!node.argumentExpression || node.argumentExpression.kind !== 8 /* StringLiteral */)) {
|
|
error(node.argumentExpression, ts.Diagnostics.A_const_enum_member_can_only_be_accessed_using_a_string_literal);
|
|
return unknownType;
|
|
}
|
|
// TypeScript 1.0 spec (April 2014): 4.10 Property Access
|
|
// - If IndexExpr is a string literal or a numeric literal and ObjExpr's apparent type has a property with the name
|
|
// given by that literal(converted to its string representation in the case of a numeric literal), the property access is of the type of that property.
|
|
// - Otherwise, if ObjExpr's apparent type has a numeric index signature and IndexExpr is of type Any, the Number primitive type, or an enum type,
|
|
// the property access is of the type of that index signature.
|
|
// - Otherwise, if ObjExpr's apparent type has a string index signature and IndexExpr is of type Any, the String or Number primitive type, or an enum type,
|
|
// the property access is of the type of that index signature.
|
|
// - Otherwise, if IndexExpr is of type Any, the String or Number primitive type, or an enum type, the property access is of type Any.
|
|
// See if we can index as a property.
|
|
if (node.argumentExpression) {
|
|
var name_11 = getPropertyNameForIndexedAccess(node.argumentExpression, indexType);
|
|
if (name_11 !== undefined) {
|
|
var prop = getPropertyOfType(objectType, name_11);
|
|
if (prop) {
|
|
getNodeLinks(node).resolvedSymbol = prop;
|
|
return getTypeOfSymbol(prop);
|
|
}
|
|
else if (isConstEnum) {
|
|
error(node.argumentExpression, ts.Diagnostics.Property_0_does_not_exist_on_const_enum_1, name_11, symbolToString(objectType.symbol));
|
|
return unknownType;
|
|
}
|
|
}
|
|
}
|
|
// Check for compatible indexer types.
|
|
if (isTypeAnyOrAllConstituentTypesHaveKind(indexType, 258 /* StringLike */ | 132 /* NumberLike */ | 4194304 /* ESSymbol */)) {
|
|
// Try to use a number indexer.
|
|
if (isTypeAnyOrAllConstituentTypesHaveKind(indexType, 132 /* NumberLike */)) {
|
|
var numberIndexType = getIndexTypeOfType(objectType, 1 /* Number */);
|
|
if (numberIndexType) {
|
|
return numberIndexType;
|
|
}
|
|
}
|
|
// Try to use string indexing.
|
|
var stringIndexType = getIndexTypeOfType(objectType, 0 /* String */);
|
|
if (stringIndexType) {
|
|
return stringIndexType;
|
|
}
|
|
// Fall back to any.
|
|
if (compilerOptions.noImplicitAny && !compilerOptions.suppressImplicitAnyIndexErrors && !isTypeAny(objectType)) {
|
|
error(node, ts.Diagnostics.Index_signature_of_object_type_implicitly_has_an_any_type);
|
|
}
|
|
return anyType;
|
|
}
|
|
// REVIEW: Users should know the type that was actually used.
|
|
error(node, ts.Diagnostics.An_index_expression_argument_must_be_of_type_string_number_symbol_or_any);
|
|
return unknownType;
|
|
}
|
|
/**
|
|
* If indexArgumentExpression is a string literal or number literal, returns its text.
|
|
* If indexArgumentExpression is a well known symbol, returns the property name corresponding
|
|
* to this symbol, as long as it is a proper symbol reference.
|
|
* Otherwise, returns undefined.
|
|
*/
|
|
function getPropertyNameForIndexedAccess(indexArgumentExpression, indexArgumentType) {
|
|
if (indexArgumentExpression.kind === 8 /* StringLiteral */ || indexArgumentExpression.kind === 7 /* NumericLiteral */) {
|
|
return indexArgumentExpression.text;
|
|
}
|
|
if (checkThatExpressionIsProperSymbolReference(indexArgumentExpression, indexArgumentType, false)) {
|
|
var rightHandSideName = indexArgumentExpression.name.text;
|
|
return ts.getPropertyNameForKnownSymbolName(rightHandSideName);
|
|
}
|
|
return undefined;
|
|
}
|
|
/**
|
|
* A proper symbol reference requires the following:
|
|
* 1. The property access denotes a property that exists
|
|
* 2. The expression is of the form Symbol.<identifier>
|
|
* 3. The property access is of the primitive type symbol.
|
|
* 4. Symbol in this context resolves to the global Symbol object
|
|
*/
|
|
function checkThatExpressionIsProperSymbolReference(expression, expressionType, reportError) {
|
|
if (expressionType === unknownType) {
|
|
// There is already an error, so no need to report one.
|
|
return false;
|
|
}
|
|
if (!ts.isWellKnownSymbolSyntactically(expression)) {
|
|
return false;
|
|
}
|
|
// Make sure the property type is the primitive symbol type
|
|
if ((expressionType.flags & 4194304 /* ESSymbol */) === 0) {
|
|
if (reportError) {
|
|
error(expression, ts.Diagnostics.A_computed_property_name_of_the_form_0_must_be_of_type_symbol, ts.getTextOfNode(expression));
|
|
}
|
|
return false;
|
|
}
|
|
// The name is Symbol.<someName>, so make sure Symbol actually resolves to the
|
|
// global Symbol object
|
|
var leftHandSide = expression.expression;
|
|
var leftHandSideSymbol = getResolvedSymbol(leftHandSide);
|
|
if (!leftHandSideSymbol) {
|
|
return false;
|
|
}
|
|
var globalESSymbol = getGlobalESSymbolConstructorSymbol();
|
|
if (!globalESSymbol) {
|
|
// Already errored when we tried to look up the symbol
|
|
return false;
|
|
}
|
|
if (leftHandSideSymbol !== globalESSymbol) {
|
|
if (reportError) {
|
|
error(leftHandSide, ts.Diagnostics.Symbol_reference_does_not_refer_to_the_global_Symbol_constructor_object);
|
|
}
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
function resolveUntypedCall(node) {
|
|
if (node.kind === 167 /* TaggedTemplateExpression */) {
|
|
checkExpression(node.template);
|
|
}
|
|
else if (node.kind !== 136 /* 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 }
|
|
// let b: B;
|
|
// b('foo') // <- here overloads should be processed as [(x:'foo'): string, (x: string): void]
|
|
function reorderCandidates(signatures, result) {
|
|
var lastParent;
|
|
var lastSymbol;
|
|
var cutoffIndex = 0;
|
|
var index;
|
|
var specializedIndex = -1;
|
|
var spliceIndex;
|
|
ts.Debug.assert(!result.length);
|
|
for (var _i = 0; _i < signatures.length; _i++) {
|
|
var signature = signatures[_i];
|
|
var symbol = signature.declaration && getSymbolOfNode(signature.declaration);
|
|
var parent_6 = signature.declaration && signature.declaration.parent;
|
|
if (!lastSymbol || symbol === lastSymbol) {
|
|
if (lastParent && parent_6 === lastParent) {
|
|
index++;
|
|
}
|
|
else {
|
|
lastParent = parent_6;
|
|
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_6;
|
|
}
|
|
lastSymbol = symbol;
|
|
// specialized signatures always need to be placed before non-specialized signatures regardless
|
|
// of the cutoff position; see GH#1133
|
|
if (signature.hasStringLiterals) {
|
|
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, signature);
|
|
}
|
|
}
|
|
function getSpreadArgumentIndex(args) {
|
|
for (var i = 0; i < args.length; i++) {
|
|
var arg = args[i];
|
|
if (arg && arg.kind === 182 /* SpreadElementExpression */) {
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
function hasCorrectArity(node, args, signature) {
|
|
var adjustedArgCount; // Apparent number of arguments we will have in this call
|
|
var typeArguments; // Type arguments (undefined if none)
|
|
var callIsIncomplete; // In incomplete call we want to be lenient when we have too few arguments
|
|
var isDecorator;
|
|
var spreadArgIndex = -1;
|
|
if (node.kind === 167 /* TaggedTemplateExpression */) {
|
|
var tagExpression = node;
|
|
// Even if the call is incomplete, we'll have a missing expression as our last argument,
|
|
// so we can say the count is just the arg list length
|
|
adjustedArgCount = args.length;
|
|
typeArguments = undefined;
|
|
if (tagExpression.template.kind === 180 /* 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 templateExpression = tagExpression.template;
|
|
var lastSpan = ts.lastOrUndefined(templateExpression.templateSpans);
|
|
ts.Debug.assert(lastSpan !== undefined); // 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 = tagExpression.template;
|
|
ts.Debug.assert(templateLiteral.kind === 10 /* NoSubstitutionTemplateLiteral */);
|
|
callIsIncomplete = !!templateLiteral.isUnterminated;
|
|
}
|
|
}
|
|
else if (node.kind === 136 /* Decorator */) {
|
|
isDecorator = true;
|
|
typeArguments = undefined;
|
|
adjustedArgCount = getEffectiveArgumentCount(node, undefined, signature);
|
|
}
|
|
else {
|
|
var callExpression = node;
|
|
if (!callExpression.arguments) {
|
|
// This only happens when we have something of the form: 'new C'
|
|
ts.Debug.assert(callExpression.kind === 166 /* NewExpression */);
|
|
return signature.minArgumentCount === 0;
|
|
}
|
|
// For IDE scenarios we may have an incomplete call, so a trailing comma is tantamount to adding another argument.
|
|
adjustedArgCount = callExpression.arguments.hasTrailingComma ? args.length + 1 : args.length;
|
|
// If we are missing the close paren, the call is incomplete.
|
|
callIsIncomplete = callExpression.arguments.end === callExpression.end;
|
|
typeArguments = callExpression.typeArguments;
|
|
spreadArgIndex = getSpreadArgumentIndex(args);
|
|
}
|
|
// 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 hasRightNumberOfTypeArgs = !typeArguments ||
|
|
(signature.typeParameters && typeArguments.length === signature.typeParameters.length);
|
|
if (!hasRightNumberOfTypeArgs) {
|
|
return false;
|
|
}
|
|
// If spread arguments are present, check that they correspond to a rest parameter. If so, no
|
|
// further checking is necessary.
|
|
if (spreadArgIndex >= 0) {
|
|
return signature.hasRestParameter && spreadArgIndex >= signature.parameters.length - 1;
|
|
}
|
|
// Too many arguments implies incorrect arity.
|
|
if (!signature.hasRestParameter && adjustedArgCount > signature.parameters.length) {
|
|
return false;
|
|
}
|
|
// If the call is incomplete, we should skip the lower bound check.
|
|
var hasEnoughArguments = adjustedArgCount >= signature.minArgumentCount;
|
|
return callIsIncomplete || hasEnoughArguments;
|
|
}
|
|
// If type has a single call signature and no other members, return that signature. Otherwise, return undefined.
|
|
function getSingleCallSignature(type) {
|
|
if (type.flags & 80896 /* ObjectType */) {
|
|
var resolved = resolveStructuredTypeMembers(type);
|
|
if (resolved.callSignatures.length === 1 && resolved.constructSignatures.length === 0 &&
|
|
resolved.properties.length === 0 && !resolved.stringIndexType && !resolved.numberIndexType) {
|
|
return resolved.callSignatures[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, contextualMapper) {
|
|
var context = createInferenceContext(signature.typeParameters, true);
|
|
forEachMatchingParameterType(contextualSignature, signature, function (source, target) {
|
|
// Type parameters from outer context referenced by source type are fixed by instantiation of the source type
|
|
inferTypes(context, instantiateType(source, contextualMapper), target);
|
|
});
|
|
return getSignatureInstantiation(signature, getInferredTypes(context));
|
|
}
|
|
function inferTypeArguments(node, signature, args, excludeArgument, context) {
|
|
var typeParameters = signature.typeParameters;
|
|
var inferenceMapper = createInferenceMapper(context);
|
|
// Clear out all the inference results from the last time inferTypeArguments was called on this context
|
|
for (var i = 0; i < typeParameters.length; i++) {
|
|
// As an optimization, we don't have to clear (and later recompute) inferred types
|
|
// for type parameters that have already been fixed on the previous call to inferTypeArguments.
|
|
// It would be just as correct to reset all of them. But then we'd be repeating the same work
|
|
// for the type parameters that were fixed, namely the work done by getInferredType.
|
|
if (!context.inferences[i].isFixed) {
|
|
context.inferredTypes[i] = undefined;
|
|
}
|
|
}
|
|
// On this call to inferTypeArguments, we may get more inferences for certain type parameters that were not
|
|
// fixed last time. This means that a type parameter that failed inference last time may succeed this time,
|
|
// or vice versa. Therefore, the failedTypeParameterIndex is useless if it points to an unfixed type parameter,
|
|
// because it may change. So here we reset it. However, getInferredType will not revisit any type parameters
|
|
// that were previously fixed. So if a fixed type parameter failed previously, it will fail again because
|
|
// it will contain the exact same set of inferences. So if we reset the index from a fixed type parameter,
|
|
// we will lose information that we won't recover this time around.
|
|
if (context.failedTypeParameterIndex !== undefined && !context.inferences[context.failedTypeParameterIndex].isFixed) {
|
|
context.failedTypeParameterIndex = undefined;
|
|
}
|
|
// We perform two passes over the arguments. In the first pass we infer from all arguments, but use
|
|
// wildcards for all context sensitive function expressions.
|
|
var argCount = getEffectiveArgumentCount(node, args, signature);
|
|
for (var i = 0; i < argCount; i++) {
|
|
var arg = getEffectiveArgument(node, args, i);
|
|
// If the effective argument is 'undefined', then it is an argument that is present but is synthetic.
|
|
if (arg === undefined || arg.kind !== 184 /* OmittedExpression */) {
|
|
var paramType = getTypeAtPosition(signature, i);
|
|
var argType = getEffectiveArgumentType(node, i, arg);
|
|
// If the effective argument type is 'undefined', there is no synthetic type
|
|
// for the argument. In that case, we should check the argument.
|
|
if (argType === undefined) {
|
|
// For context sensitive arguments we pass the identityMapper, which is a signal to treat all
|
|
// context sensitive function expressions as wildcards
|
|
var mapper = excludeArgument && excludeArgument[i] !== undefined ? identityMapper : inferenceMapper;
|
|
argType = checkExpressionWithContextualType(arg, paramType, mapper);
|
|
}
|
|
inferTypes(context, argType, paramType);
|
|
}
|
|
}
|
|
// In the second pass we visit only context sensitive arguments, and only those that aren't excluded, this
|
|
// time treating function expressions normally (which may cause previously inferred type arguments to be fixed
|
|
// as we construct types for contextually typed parameters)
|
|
// Decorators will not have `excludeArgument`, as their arguments cannot be contextually typed.
|
|
// Tagged template expressions will always have `undefined` for `excludeArgument[0]`.
|
|
if (excludeArgument) {
|
|
for (var i = 0; i < argCount; i++) {
|
|
// No need to check for omitted args and template expressions, their exlusion value is always undefined
|
|
if (excludeArgument[i] === false) {
|
|
var arg = args[i];
|
|
var paramType = getTypeAtPosition(signature, i);
|
|
inferTypes(context, checkExpressionWithContextualType(arg, paramType, inferenceMapper), paramType);
|
|
}
|
|
}
|
|
}
|
|
getInferredTypes(context);
|
|
}
|
|
function checkTypeArguments(signature, typeArguments, typeArgumentResultTypes, reportErrors, headMessage) {
|
|
var typeParameters = signature.typeParameters;
|
|
var typeArgumentsAreAssignable = true;
|
|
for (var i = 0; i < typeParameters.length; i++) {
|
|
var typeArgNode = typeArguments[i];
|
|
var typeArgument = getTypeFromTypeNode(typeArgNode);
|
|
// Do not push on this array! It has a preallocated length
|
|
typeArgumentResultTypes[i] = typeArgument;
|
|
if (typeArgumentsAreAssignable /* so far */) {
|
|
var constraint = getConstraintOfTypeParameter(typeParameters[i]);
|
|
if (constraint) {
|
|
var errorInfo = void 0;
|
|
var typeArgumentHeadMessage = ts.Diagnostics.Type_0_does_not_satisfy_the_constraint_1;
|
|
if (reportErrors && headMessage) {
|
|
errorInfo = ts.chainDiagnosticMessages(errorInfo, typeArgumentHeadMessage);
|
|
typeArgumentHeadMessage = headMessage;
|
|
}
|
|
typeArgumentsAreAssignable = checkTypeAssignableTo(typeArgument, constraint, reportErrors ? typeArgNode : undefined, typeArgumentHeadMessage, errorInfo);
|
|
}
|
|
}
|
|
}
|
|
return typeArgumentsAreAssignable;
|
|
}
|
|
function checkApplicableSignature(node, args, signature, relation, excludeArgument, reportErrors) {
|
|
var argCount = getEffectiveArgumentCount(node, args, signature);
|
|
for (var i = 0; i < argCount; i++) {
|
|
var arg = getEffectiveArgument(node, args, i);
|
|
// If the effective argument is 'undefined', then it is an argument that is present but is synthetic.
|
|
if (arg === undefined || arg.kind !== 184 /* OmittedExpression */) {
|
|
// Check spread elements against rest type (from arity check we know spread argument corresponds to a rest parameter)
|
|
var paramType = getTypeAtPosition(signature, i);
|
|
var argType = getEffectiveArgumentType(node, i, arg);
|
|
// If the effective argument type is 'undefined', there is no synthetic type
|
|
// for the argument. In that case, we should check the argument.
|
|
if (argType === undefined) {
|
|
argType = arg.kind === 8 /* StringLiteral */ && !reportErrors
|
|
? getStringLiteralType(arg)
|
|
: checkExpressionWithContextualType(arg, paramType, excludeArgument && excludeArgument[i] ? identityMapper : undefined);
|
|
}
|
|
// Use argument expression as error location when reporting errors
|
|
var errorNode = reportErrors ? getEffectiveArgumentErrorNode(node, i, arg) : undefined;
|
|
var headMessage = ts.Diagnostics.Argument_of_type_0_is_not_assignable_to_parameter_of_type_1;
|
|
if (!checkTypeRelatedTo(argType, paramType, relation, errorNode, headMessage)) {
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
/**
|
|
* Returns the effective arguments for an expression that works like a function invocation.
|
|
*
|
|
* If 'node' is a CallExpression or a NewExpression, then its argument list is returned.
|
|
* If 'node' is a TaggedTemplateExpression, a new argument list is constructed from the substitution
|
|
* expressions, where the first element of the list is `undefined`.
|
|
* If 'node' is a Decorator, the argument list will be `undefined`, and its arguments and types
|
|
* will be supplied from calls to `getEffectiveArgumentCount` and `getEffectiveArgumentType`.
|
|
*/
|
|
function getEffectiveCallArguments(node) {
|
|
var args;
|
|
if (node.kind === 167 /* TaggedTemplateExpression */) {
|
|
var template = node.template;
|
|
args = [undefined];
|
|
if (template.kind === 180 /* TemplateExpression */) {
|
|
ts.forEach(template.templateSpans, function (span) {
|
|
args.push(span.expression);
|
|
});
|
|
}
|
|
}
|
|
else if (node.kind === 136 /* Decorator */) {
|
|
// For a decorator, we return undefined as we will determine
|
|
// the number and types of arguments for a decorator using
|
|
// `getEffectiveArgumentCount` and `getEffectiveArgumentType` below.
|
|
return undefined;
|
|
}
|
|
else {
|
|
args = node.arguments || emptyArray;
|
|
}
|
|
return args;
|
|
}
|
|
/**
|
|
* Returns the effective argument count for a node that works like a function invocation.
|
|
* If 'node' is a Decorator, the number of arguments is derived from the decoration
|
|
* target and the signature:
|
|
* If 'node.target' is a class declaration or class expression, the effective argument
|
|
* count is 1.
|
|
* If 'node.target' is a parameter declaration, the effective argument count is 3.
|
|
* If 'node.target' is a property declaration, the effective argument count is 2.
|
|
* If 'node.target' is a method or accessor declaration, the effective argument count
|
|
* is 3, although it can be 2 if the signature only accepts two arguments, allowing
|
|
* us to match a property decorator.
|
|
* Otherwise, the argument count is the length of the 'args' array.
|
|
*/
|
|
function getEffectiveArgumentCount(node, args, signature) {
|
|
if (node.kind === 136 /* Decorator */) {
|
|
switch (node.parent.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
case 183 /* ClassExpression */:
|
|
// A class decorator will have one argument (see `ClassDecorator` in core.d.ts)
|
|
return 1;
|
|
case 138 /* PropertyDeclaration */:
|
|
// A property declaration decorator will have two arguments (see
|
|
// `PropertyDecorator` in core.d.ts)
|
|
return 2;
|
|
case 140 /* MethodDeclaration */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
// A method or accessor declaration decorator will have two or three arguments (see
|
|
// `PropertyDecorator` and `MethodDecorator` in core.d.ts)
|
|
// If the method decorator signature only accepts a target and a key, we will only
|
|
// type check those arguments.
|
|
return signature.parameters.length >= 3 ? 3 : 2;
|
|
case 135 /* Parameter */:
|
|
// A parameter declaration decorator will have three arguments (see
|
|
// `ParameterDecorator` in core.d.ts)
|
|
return 3;
|
|
}
|
|
}
|
|
else {
|
|
return args.length;
|
|
}
|
|
}
|
|
/**
|
|
* Returns the effective type of the first argument to a decorator.
|
|
* If 'node' is a class declaration or class expression, the effective argument type
|
|
* is the type of the static side of the class.
|
|
* If 'node' is a parameter declaration, the effective argument type is either the type
|
|
* of the static or instance side of the class for the parameter's parent method,
|
|
* depending on whether the method is declared static.
|
|
* For a constructor, the type is always the type of the static side of the class.
|
|
* If 'node' is a property, method, or accessor declaration, the effective argument
|
|
* type is the type of the static or instance side of the parent class for class
|
|
* element, depending on whether the element is declared static.
|
|
*/
|
|
function getEffectiveDecoratorFirstArgumentType(node) {
|
|
// The first argument to a decorator is its `target`.
|
|
switch (node.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
case 183 /* ClassExpression */:
|
|
// For a class decorator, the `target` is the type of the class (e.g. the
|
|
// "static" or "constructor" side of the class)
|
|
var classSymbol = getSymbolOfNode(node);
|
|
return getTypeOfSymbol(classSymbol);
|
|
case 135 /* Parameter */:
|
|
// For a parameter decorator, the `target` is the parent type of the
|
|
// parameter's containing method.
|
|
node = node.parent;
|
|
if (node.kind === 141 /* Constructor */) {
|
|
var classSymbol_1 = getSymbolOfNode(node);
|
|
return getTypeOfSymbol(classSymbol_1);
|
|
}
|
|
// fall-through
|
|
case 138 /* PropertyDeclaration */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
// For a property or method decorator, the `target` is the
|
|
// "static"-side type of the parent of the member if the member is
|
|
// declared "static"; otherwise, it is the "instance"-side type of the
|
|
// parent of the member.
|
|
return getParentTypeOfClassElement(node);
|
|
default:
|
|
ts.Debug.fail("Unsupported decorator target.");
|
|
return unknownType;
|
|
}
|
|
}
|
|
/**
|
|
* Returns the effective type for the second argument to a decorator.
|
|
* If 'node' is a parameter, its effective argument type is one of the following:
|
|
* If 'node.parent' is a constructor, the effective argument type is 'any', as we
|
|
* will emit `undefined`.
|
|
* If 'node.parent' is a member with an identifier, numeric, or string literal name,
|
|
* the effective argument type will be a string literal type for the member name.
|
|
* If 'node.parent' is a computed property name, the effective argument type will
|
|
* either be a symbol type or the string type.
|
|
* If 'node' is a member with an identifier, numeric, or string literal name, the
|
|
* effective argument type will be a string literal type for the member name.
|
|
* If 'node' is a computed property name, the effective argument type will either
|
|
* be a symbol type or the string type.
|
|
* A class decorator does not have a second argument type.
|
|
*/
|
|
function getEffectiveDecoratorSecondArgumentType(node) {
|
|
// The second argument to a decorator is its `propertyKey`
|
|
switch (node.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
ts.Debug.fail("Class decorators should not have a second synthetic argument.");
|
|
return unknownType;
|
|
case 135 /* Parameter */:
|
|
node = node.parent;
|
|
if (node.kind === 141 /* Constructor */) {
|
|
// For a constructor parameter decorator, the `propertyKey` will be `undefined`.
|
|
return anyType;
|
|
}
|
|
// For a non-constructor parameter decorator, the `propertyKey` will be either
|
|
// a string or a symbol, based on the name of the parameter's containing method.
|
|
// fall-through
|
|
case 138 /* PropertyDeclaration */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
// The `propertyKey` for a property or method decorator will be a
|
|
// string literal type if the member name is an identifier, number, or string;
|
|
// otherwise, if the member name is a computed property name it will
|
|
// be either string or symbol.
|
|
var element = node;
|
|
switch (element.name.kind) {
|
|
case 66 /* Identifier */:
|
|
case 7 /* NumericLiteral */:
|
|
case 8 /* StringLiteral */:
|
|
return getStringLiteralType(element.name);
|
|
case 133 /* ComputedPropertyName */:
|
|
var nameType = checkComputedPropertyName(element.name);
|
|
if (allConstituentTypesHaveKind(nameType, 4194304 /* ESSymbol */)) {
|
|
return nameType;
|
|
}
|
|
else {
|
|
return stringType;
|
|
}
|
|
default:
|
|
ts.Debug.fail("Unsupported property name.");
|
|
return unknownType;
|
|
}
|
|
default:
|
|
ts.Debug.fail("Unsupported decorator target.");
|
|
return unknownType;
|
|
}
|
|
}
|
|
/**
|
|
* Returns the effective argument type for the third argument to a decorator.
|
|
* If 'node' is a parameter, the effective argument type is the number type.
|
|
* If 'node' is a method or accessor, the effective argument type is a
|
|
* `TypedPropertyDescriptor<T>` instantiated with the type of the member.
|
|
* Class and property decorators do not have a third effective argument.
|
|
*/
|
|
function getEffectiveDecoratorThirdArgumentType(node) {
|
|
// The third argument to a decorator is either its `descriptor` for a method decorator
|
|
// or its `parameterIndex` for a paramter decorator
|
|
switch (node.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
ts.Debug.fail("Class decorators should not have a third synthetic argument.");
|
|
return unknownType;
|
|
case 135 /* Parameter */:
|
|
// The `parameterIndex` for a parameter decorator is always a number
|
|
return numberType;
|
|
case 138 /* PropertyDeclaration */:
|
|
ts.Debug.fail("Property decorators should not have a third synthetic argument.");
|
|
return unknownType;
|
|
case 140 /* MethodDeclaration */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
// The `descriptor` for a method decorator will be a `TypedPropertyDescriptor<T>`
|
|
// for the type of the member.
|
|
var propertyType = getTypeOfNode(node);
|
|
return createTypedPropertyDescriptorType(propertyType);
|
|
default:
|
|
ts.Debug.fail("Unsupported decorator target.");
|
|
return unknownType;
|
|
}
|
|
}
|
|
/**
|
|
* Returns the effective argument type for the provided argument to a decorator.
|
|
*/
|
|
function getEffectiveDecoratorArgumentType(node, argIndex) {
|
|
if (argIndex === 0) {
|
|
return getEffectiveDecoratorFirstArgumentType(node.parent);
|
|
}
|
|
else if (argIndex === 1) {
|
|
return getEffectiveDecoratorSecondArgumentType(node.parent);
|
|
}
|
|
else if (argIndex === 2) {
|
|
return getEffectiveDecoratorThirdArgumentType(node.parent);
|
|
}
|
|
ts.Debug.fail("Decorators should not have a fourth synthetic argument.");
|
|
return unknownType;
|
|
}
|
|
/**
|
|
* Gets the effective argument type for an argument in a call expression.
|
|
*/
|
|
function getEffectiveArgumentType(node, argIndex, arg) {
|
|
// Decorators provide special arguments, a tagged template expression provides
|
|
// a special first argument, and string literals get string literal types
|
|
// unless we're reporting errors
|
|
if (node.kind === 136 /* Decorator */) {
|
|
return getEffectiveDecoratorArgumentType(node, argIndex);
|
|
}
|
|
else if (argIndex === 0 && node.kind === 167 /* TaggedTemplateExpression */) {
|
|
return globalTemplateStringsArrayType;
|
|
}
|
|
// This is not a synthetic argument, so we return 'undefined'
|
|
// to signal that the caller needs to check the argument.
|
|
return undefined;
|
|
}
|
|
/**
|
|
* Gets the effective argument expression for an argument in a call expression.
|
|
*/
|
|
function getEffectiveArgument(node, args, argIndex) {
|
|
// For a decorator or the first argument of a tagged template expression we return undefined.
|
|
if (node.kind === 136 /* Decorator */ ||
|
|
(argIndex === 0 && node.kind === 167 /* TaggedTemplateExpression */)) {
|
|
return undefined;
|
|
}
|
|
return args[argIndex];
|
|
}
|
|
/**
|
|
* Gets the error node to use when reporting errors for an effective argument.
|
|
*/
|
|
function getEffectiveArgumentErrorNode(node, argIndex, arg) {
|
|
if (node.kind === 136 /* Decorator */) {
|
|
// For a decorator, we use the expression of the decorator for error reporting.
|
|
return node.expression;
|
|
}
|
|
else if (argIndex === 0 && node.kind === 167 /* TaggedTemplateExpression */) {
|
|
// For a the first argument of a tagged template expression, we use the template of the tag for error reporting.
|
|
return node.template;
|
|
}
|
|
else {
|
|
return arg;
|
|
}
|
|
}
|
|
function resolveCall(node, signatures, candidatesOutArray, headMessage) {
|
|
var isTaggedTemplate = node.kind === 167 /* TaggedTemplateExpression */;
|
|
var isDecorator = node.kind === 136 /* Decorator */;
|
|
var typeArguments;
|
|
if (!isTaggedTemplate && !isDecorator) {
|
|
typeArguments = node.typeArguments;
|
|
// We already perform checking on the type arguments on the class declaration itself.
|
|
if (node.expression.kind !== 92 /* SuperKeyword */) {
|
|
ts.forEach(typeArguments, checkSourceElement);
|
|
}
|
|
}
|
|
var candidates = candidatesOutArray || [];
|
|
// reorderCandidates fills up the candidates array directly
|
|
reorderCandidates(signatures, candidates);
|
|
if (!candidates.length) {
|
|
reportError(ts.Diagnostics.Supplied_parameters_do_not_match_any_signature_of_call_target);
|
|
return resolveErrorCall(node);
|
|
}
|
|
var args = getEffectiveCallArguments(node);
|
|
// The following applies to any value of 'excludeArgument[i]':
|
|
// - true: the argument at 'i' is susceptible to a one-time permanent contextual typing.
|
|
// - undefined: the argument at 'i' is *not* susceptible to permanent contextual typing.
|
|
// - false: the argument at 'i' *was* and *has been* permanently contextually typed.
|
|
//
|
|
// 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 each of 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 excludeArgument;
|
|
if (!isDecorator) {
|
|
// We do not need to call `getEffectiveArgumentCount` here as it only
|
|
// applies when calculating the number of arguments for a decorator.
|
|
for (var i = isTaggedTemplate ? 1 : 0; i < args.length; i++) {
|
|
if (isContextSensitive(args[i])) {
|
|
if (!excludeArgument) {
|
|
excludeArgument = new Array(args.length);
|
|
}
|
|
excludeArgument[i] = true;
|
|
}
|
|
}
|
|
}
|
|
// 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) {}
|
|
// function foo(n: number) {} // Report argument error on this overload
|
|
// function foo() {}
|
|
// 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>(x: T, y: T) {} // Report type argument inference error
|
|
// function foo() {}
|
|
// foo(0, true);
|
|
//
|
|
var candidateForArgumentError;
|
|
var candidateForTypeArgumentError;
|
|
var resultOfFailedInference;
|
|
var result;
|
|
// 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);
|
|
}
|
|
if (!result) {
|
|
// Reinitialize these pointers for round two
|
|
candidateForArgumentError = undefined;
|
|
candidateForTypeArgumentError = undefined;
|
|
resultOfFailedInference = undefined;
|
|
result = chooseOverload(candidates, assignableRelation);
|
|
}
|
|
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 (candidateForArgumentError) {
|
|
// excludeArgument is undefined, in this case also equivalent to [undefined, undefined, ...]
|
|
// The importance of excludeArgument is to prevent us from typing function expression parameters
|
|
// in arguments too early. If possible, we'd like to only type them once we know the correct
|
|
// overload. However, this matters for the case where the call is correct. When the call is
|
|
// an error, we don't need to exclude any arguments, although it would cause no harm to do so.
|
|
checkApplicableSignature(node, args, candidateForArgumentError, assignableRelation, undefined, true);
|
|
}
|
|
else if (candidateForTypeArgumentError) {
|
|
if (!isTaggedTemplate && !isDecorator && typeArguments) {
|
|
checkTypeArguments(candidateForTypeArgumentError, node.typeArguments, [], true, headMessage);
|
|
}
|
|
else {
|
|
ts.Debug.assert(resultOfFailedInference.failedTypeParameterIndex >= 0);
|
|
var failedTypeParameter = candidateForTypeArgumentError.typeParameters[resultOfFailedInference.failedTypeParameterIndex];
|
|
var inferenceCandidates = getInferenceCandidates(resultOfFailedInference, resultOfFailedInference.failedTypeParameterIndex);
|
|
var diagnosticChainHead = ts.chainDiagnosticMessages(undefined, ts.Diagnostics.The_type_argument_for_type_parameter_0_cannot_be_inferred_from_the_usage_Consider_specifying_the_type_arguments_explicitly, typeToString(failedTypeParameter));
|
|
if (headMessage) {
|
|
diagnosticChainHead = ts.chainDiagnosticMessages(diagnosticChainHead, headMessage);
|
|
}
|
|
reportNoCommonSupertypeError(inferenceCandidates, node.expression || node.tag, diagnosticChainHead);
|
|
}
|
|
}
|
|
else {
|
|
reportError(ts.Diagnostics.Supplied_parameters_do_not_match_any_signature_of_call_target);
|
|
}
|
|
// No signature was applicable. We have already reported the errors for the invalid signature.
|
|
// If this is a type resolution session, e.g. Language Service, try to get better information that anySignature.
|
|
// Pick the first candidate that matches the arity. This way we can get a contextual type for cases like:
|
|
// declare function f(a: { xa: number; xb: number; });
|
|
// f({ |
|
|
if (!produceDiagnostics) {
|
|
for (var _i = 0; _i < candidates.length; _i++) {
|
|
var candidate = candidates[_i];
|
|
if (hasCorrectArity(node, args, candidate)) {
|
|
return candidate;
|
|
}
|
|
}
|
|
}
|
|
return resolveErrorCall(node);
|
|
function reportError(message, arg0, arg1, arg2) {
|
|
var errorInfo;
|
|
errorInfo = ts.chainDiagnosticMessages(errorInfo, message, arg0, arg1, arg2);
|
|
if (headMessage) {
|
|
errorInfo = ts.chainDiagnosticMessages(errorInfo, headMessage);
|
|
}
|
|
diagnostics.add(ts.createDiagnosticForNodeFromMessageChain(node, errorInfo));
|
|
}
|
|
function chooseOverload(candidates, relation) {
|
|
for (var _i = 0; _i < candidates.length; _i++) {
|
|
var originalCandidate = candidates[_i];
|
|
if (!hasCorrectArity(node, args, originalCandidate)) {
|
|
continue;
|
|
}
|
|
var candidate = void 0;
|
|
var typeArgumentsAreValid = void 0;
|
|
var inferenceContext = originalCandidate.typeParameters
|
|
? createInferenceContext(originalCandidate.typeParameters, false)
|
|
: undefined;
|
|
while (true) {
|
|
candidate = originalCandidate;
|
|
if (candidate.typeParameters) {
|
|
var typeArgumentTypes = void 0;
|
|
if (typeArguments) {
|
|
typeArgumentTypes = new Array(candidate.typeParameters.length);
|
|
typeArgumentsAreValid = checkTypeArguments(candidate, typeArguments, typeArgumentTypes, false);
|
|
}
|
|
else {
|
|
inferTypeArguments(node, candidate, args, excludeArgument, inferenceContext);
|
|
typeArgumentsAreValid = inferenceContext.failedTypeParameterIndex === undefined;
|
|
typeArgumentTypes = inferenceContext.inferredTypes;
|
|
}
|
|
if (!typeArgumentsAreValid) {
|
|
break;
|
|
}
|
|
candidate = getSignatureInstantiation(candidate, typeArgumentTypes);
|
|
}
|
|
if (!checkApplicableSignature(node, args, candidate, relation, excludeArgument, false)) {
|
|
break;
|
|
}
|
|
var index = excludeArgument ? ts.indexOf(excludeArgument, true) : -1;
|
|
if (index < 0) {
|
|
return candidate;
|
|
}
|
|
excludeArgument[index] = false;
|
|
}
|
|
// A post-mortem of this iteration of the loop. The signature was not applicable,
|
|
// so we want to track it as a candidate for reporting an error. If the candidate
|
|
// had no type parameters, or had no issues related to type arguments, we can
|
|
// report an error based on the arguments. If there was an issue with type
|
|
// arguments, then we can only report an error based on the type arguments.
|
|
if (originalCandidate.typeParameters) {
|
|
var instantiatedCandidate = candidate;
|
|
if (typeArgumentsAreValid) {
|
|
candidateForArgumentError = instantiatedCandidate;
|
|
}
|
|
else {
|
|
candidateForTypeArgumentError = originalCandidate;
|
|
if (!typeArguments) {
|
|
resultOfFailedInference = inferenceContext;
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
ts.Debug.assert(originalCandidate === candidate);
|
|
candidateForArgumentError = originalCandidate;
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
}
|
|
function resolveCallExpression(node, candidatesOutArray) {
|
|
if (node.expression.kind === 92 /* SuperKeyword */) {
|
|
var superType = checkSuperExpression(node.expression);
|
|
if (superType !== unknownType) {
|
|
// 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.getClassExtendsHeritageClauseElement(ts.getContainingClass(node));
|
|
var baseConstructors = getInstantiatedConstructorsForTypeArguments(superType, baseTypeNode.typeArguments);
|
|
return resolveCall(node, baseConstructors, candidatesOutArray);
|
|
}
|
|
return resolveUntypedCall(node);
|
|
}
|
|
var funcType = checkExpression(node.expression);
|
|
var apparentType = getApparentType(funcType);
|
|
if (apparentType === unknownType) {
|
|
// 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 constructSignatures = getSignaturesOfType(apparentType, 1 /* Construct */);
|
|
// 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. 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.
|
|
// We exclude union types because we may have a union of function types that happen to have
|
|
// no common signatures.
|
|
if (isTypeAny(funcType) || (!callSignatures.length && !constructSignatures.length && !(funcType.flags & 16384 /* Union */) && isTypeAssignableTo(funcType, globalFunctionType))) {
|
|
// The unknownType indicates that an error already occured (and was reported). No
|
|
// need to report another error in this case.
|
|
if (funcType !== unknownType && 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 (constructSignatures.length) {
|
|
error(node, ts.Diagnostics.Value_of_type_0_is_not_callable_Did_you_mean_to_include_new, typeToString(funcType));
|
|
}
|
|
else {
|
|
error(node, ts.Diagnostics.Cannot_invoke_an_expression_whose_type_lacks_a_call_signature);
|
|
}
|
|
return resolveErrorCall(node);
|
|
}
|
|
return resolveCall(node, callSignatures, candidatesOutArray);
|
|
}
|
|
function resolveNewExpression(node, candidatesOutArray) {
|
|
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 = checkExpression(node.expression);
|
|
// 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 === unknownType) {
|
|
// Another error has already been reported
|
|
return resolveErrorCall(node);
|
|
}
|
|
// If the expression is a class of abstract type, then it cannot be instantiated.
|
|
// Note, only class declarations can be declared abstract.
|
|
// In the case of a merged class-module or class-interface declaration,
|
|
// only the class declaration node will have the Abstract flag set.
|
|
var valueDecl = expressionType.symbol && ts.getDeclarationOfKind(expressionType.symbol, 211 /* ClassDeclaration */);
|
|
if (valueDecl && valueDecl.flags & 256 /* Abstract */) {
|
|
error(node, ts.Diagnostics.Cannot_create_an_instance_of_the_abstract_class_0, ts.declarationNameToString(valueDecl.name));
|
|
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) {
|
|
return resolveCall(node, constructSignatures, candidatesOutArray);
|
|
}
|
|
// 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.
|
|
var callSignatures = getSignaturesOfType(expressionType, 0 /* Call */);
|
|
if (callSignatures.length) {
|
|
var signature = resolveCall(node, callSignatures, candidatesOutArray);
|
|
if (getReturnTypeOfSignature(signature) !== voidType) {
|
|
error(node, ts.Diagnostics.Only_a_void_function_can_be_called_with_the_new_keyword);
|
|
}
|
|
return signature;
|
|
}
|
|
error(node, ts.Diagnostics.Cannot_use_new_with_an_expression_whose_type_lacks_a_call_or_construct_signature);
|
|
return resolveErrorCall(node);
|
|
}
|
|
function resolveTaggedTemplateExpression(node, candidatesOutArray) {
|
|
var tagType = checkExpression(node.tag);
|
|
var apparentType = getApparentType(tagType);
|
|
if (apparentType === unknownType) {
|
|
// Another error has already been reported
|
|
return resolveErrorCall(node);
|
|
}
|
|
var callSignatures = getSignaturesOfType(apparentType, 0 /* Call */);
|
|
if (isTypeAny(tagType) || (!callSignatures.length && !(tagType.flags & 16384 /* Union */) && isTypeAssignableTo(tagType, globalFunctionType))) {
|
|
return resolveUntypedCall(node);
|
|
}
|
|
if (!callSignatures.length) {
|
|
error(node, ts.Diagnostics.Cannot_invoke_an_expression_whose_type_lacks_a_call_signature);
|
|
return resolveErrorCall(node);
|
|
}
|
|
return resolveCall(node, callSignatures, candidatesOutArray);
|
|
}
|
|
/**
|
|
* 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 211 /* ClassDeclaration */:
|
|
case 183 /* ClassExpression */:
|
|
return ts.Diagnostics.Unable_to_resolve_signature_of_class_decorator_when_called_as_an_expression;
|
|
case 135 /* Parameter */:
|
|
return ts.Diagnostics.Unable_to_resolve_signature_of_parameter_decorator_when_called_as_an_expression;
|
|
case 138 /* PropertyDeclaration */:
|
|
return ts.Diagnostics.Unable_to_resolve_signature_of_property_decorator_when_called_as_an_expression;
|
|
case 140 /* MethodDeclaration */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
return ts.Diagnostics.Unable_to_resolve_signature_of_method_decorator_when_called_as_an_expression;
|
|
}
|
|
}
|
|
/**
|
|
* Resolves a decorator as if it were a call expression.
|
|
*/
|
|
function resolveDecorator(node, candidatesOutArray) {
|
|
var funcType = checkExpression(node.expression);
|
|
var apparentType = getApparentType(funcType);
|
|
if (apparentType === unknownType) {
|
|
return resolveErrorCall(node);
|
|
}
|
|
var callSignatures = getSignaturesOfType(apparentType, 0 /* Call */);
|
|
if (funcType === anyType || (!callSignatures.length && !(funcType.flags & 16384 /* Union */) && isTypeAssignableTo(funcType, globalFunctionType))) {
|
|
return resolveUntypedCall(node);
|
|
}
|
|
var headMessage = getDiagnosticHeadMessageForDecoratorResolution(node);
|
|
if (!callSignatures.length) {
|
|
var errorInfo;
|
|
errorInfo = ts.chainDiagnosticMessages(errorInfo, ts.Diagnostics.Cannot_invoke_an_expression_whose_type_lacks_a_call_signature);
|
|
errorInfo = ts.chainDiagnosticMessages(errorInfo, headMessage);
|
|
diagnostics.add(ts.createDiagnosticForNodeFromMessageChain(node, errorInfo));
|
|
return resolveErrorCall(node);
|
|
}
|
|
return resolveCall(node, callSignatures, candidatesOutArray, headMessage);
|
|
}
|
|
// candidatesOutArray is passed by signature help in the language service, and collectCandidates
|
|
// must fill it up with the appropriate candidate signatures
|
|
function getResolvedSignature(node, candidatesOutArray) {
|
|
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.
|
|
if (!links.resolvedSignature || candidatesOutArray) {
|
|
links.resolvedSignature = anySignature;
|
|
if (node.kind === 165 /* CallExpression */) {
|
|
links.resolvedSignature = resolveCallExpression(node, candidatesOutArray);
|
|
}
|
|
else if (node.kind === 166 /* NewExpression */) {
|
|
links.resolvedSignature = resolveNewExpression(node, candidatesOutArray);
|
|
}
|
|
else if (node.kind === 167 /* TaggedTemplateExpression */) {
|
|
links.resolvedSignature = resolveTaggedTemplateExpression(node, candidatesOutArray);
|
|
}
|
|
else if (node.kind === 136 /* Decorator */) {
|
|
links.resolvedSignature = resolveDecorator(node, candidatesOutArray);
|
|
}
|
|
else {
|
|
ts.Debug.fail("Branch in 'getResolvedSignature' should be unreachable.");
|
|
}
|
|
}
|
|
return links.resolvedSignature;
|
|
}
|
|
/**
|
|
* 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) {
|
|
// Grammar checking; stop grammar-checking if checkGrammarTypeArguments return true
|
|
checkGrammarTypeArguments(node, node.typeArguments) || checkGrammarArguments(node, node.arguments);
|
|
var signature = getResolvedSignature(node);
|
|
if (node.expression.kind === 92 /* SuperKeyword */) {
|
|
return voidType;
|
|
}
|
|
if (node.kind === 166 /* NewExpression */) {
|
|
var declaration = signature.declaration;
|
|
if (declaration &&
|
|
declaration.kind !== 141 /* Constructor */ &&
|
|
declaration.kind !== 145 /* ConstructSignature */ &&
|
|
declaration.kind !== 150 /* ConstructorType */) {
|
|
// When resolved signature is a call signature (and not a construct signature) the result type is any
|
|
if (compilerOptions.noImplicitAny) {
|
|
error(node, ts.Diagnostics.new_expression_whose_target_lacks_a_construct_signature_implicitly_has_an_any_type);
|
|
}
|
|
return anyType;
|
|
}
|
|
}
|
|
return getReturnTypeOfSignature(signature);
|
|
}
|
|
function checkTaggedTemplateExpression(node) {
|
|
return getReturnTypeOfSignature(getResolvedSignature(node));
|
|
}
|
|
function checkAssertion(node) {
|
|
var exprType = checkExpression(node.expression);
|
|
var targetType = getTypeFromTypeNode(node.type);
|
|
if (produceDiagnostics && targetType !== unknownType) {
|
|
var widenedType = getWidenedType(exprType);
|
|
if (!(isTypeAssignableTo(targetType, widenedType))) {
|
|
checkTypeAssignableTo(exprType, targetType, node, ts.Diagnostics.Neither_type_0_nor_type_1_is_assignable_to_the_other);
|
|
}
|
|
}
|
|
return targetType;
|
|
}
|
|
function getTypeAtPosition(signature, pos) {
|
|
return signature.hasRestParameter ?
|
|
pos < signature.parameters.length - 1 ? getTypeOfSymbol(signature.parameters[pos]) : getRestTypeOfSignature(signature) :
|
|
pos < signature.parameters.length ? getTypeOfSymbol(signature.parameters[pos]) : anyType;
|
|
}
|
|
function assignContextualParameterTypes(signature, context, mapper) {
|
|
var len = signature.parameters.length - (signature.hasRestParameter ? 1 : 0);
|
|
for (var i = 0; i < len; i++) {
|
|
var parameter = signature.parameters[i];
|
|
var links = getSymbolLinks(parameter);
|
|
links.type = instantiateType(getTypeAtPosition(context, i), mapper);
|
|
}
|
|
if (signature.hasRestParameter && context.hasRestParameter && signature.parameters.length >= context.parameters.length) {
|
|
var parameter = ts.lastOrUndefined(signature.parameters);
|
|
var links = getSymbolLinks(parameter);
|
|
links.type = instantiateType(getTypeOfSymbol(ts.lastOrUndefined(context.parameters)), mapper);
|
|
}
|
|
}
|
|
function createPromiseType(promisedType) {
|
|
// creates a `Promise<T>` type where `T` is the promisedType argument
|
|
var globalPromiseType = getGlobalPromiseType();
|
|
if (globalPromiseType !== emptyObjectType) {
|
|
// if the promised type is itself a promise, get the underlying type; otherwise, fallback to the promised type
|
|
promisedType = getAwaitedType(promisedType);
|
|
return createTypeReference(globalPromiseType, [promisedType]);
|
|
}
|
|
return emptyObjectType;
|
|
}
|
|
function getReturnTypeFromBody(func, contextualMapper) {
|
|
var contextualSignature = getContextualSignatureForFunctionLikeDeclaration(func);
|
|
if (!func.body) {
|
|
return unknownType;
|
|
}
|
|
var isAsync = ts.isAsyncFunctionLike(func);
|
|
var type;
|
|
if (func.body.kind !== 189 /* Block */) {
|
|
type = checkExpressionCached(func.body, contextualMapper);
|
|
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.
|
|
type = checkAwaitedType(type, func, ts.Diagnostics.Return_expression_in_async_function_does_not_have_a_valid_callable_then_member);
|
|
}
|
|
}
|
|
else {
|
|
var types;
|
|
var funcIsGenerator = !!func.asteriskToken;
|
|
if (funcIsGenerator) {
|
|
types = checkAndAggregateYieldOperandTypes(func.body, contextualMapper);
|
|
if (types.length === 0) {
|
|
var iterableIteratorAny = createIterableIteratorType(anyType);
|
|
if (compilerOptions.noImplicitAny) {
|
|
error(func.asteriskToken, ts.Diagnostics.Generator_implicitly_has_type_0_because_it_does_not_yield_any_values_Consider_supplying_a_return_type, typeToString(iterableIteratorAny));
|
|
}
|
|
return iterableIteratorAny;
|
|
}
|
|
}
|
|
else {
|
|
types = checkAndAggregateReturnExpressionTypes(func.body, contextualMapper, isAsync);
|
|
if (types.length === 0) {
|
|
if (isAsync) {
|
|
// For an async function, the return type will not be void, but rather a Promise for void.
|
|
var promiseType = createPromiseType(voidType);
|
|
if (promiseType === emptyObjectType) {
|
|
error(func, ts.Diagnostics.An_async_function_or_method_must_have_a_valid_awaitable_return_type);
|
|
return unknownType;
|
|
}
|
|
return promiseType;
|
|
}
|
|
else {
|
|
return voidType;
|
|
}
|
|
}
|
|
}
|
|
// When yield/return statements are contextually typed we allow the return type to be a union type.
|
|
// Otherwise we require the yield/return expressions to have a best common supertype.
|
|
type = contextualSignature ? getUnionType(types) : getCommonSupertype(types);
|
|
if (!type) {
|
|
if (funcIsGenerator) {
|
|
error(func, ts.Diagnostics.No_best_common_type_exists_among_yield_expressions);
|
|
return createIterableIteratorType(unknownType);
|
|
}
|
|
else {
|
|
error(func, ts.Diagnostics.No_best_common_type_exists_among_return_expressions);
|
|
return unknownType;
|
|
}
|
|
}
|
|
if (funcIsGenerator) {
|
|
type = createIterableIteratorType(type);
|
|
}
|
|
}
|
|
if (!contextualSignature) {
|
|
reportErrorsFromWidening(func, type);
|
|
}
|
|
var widenedType = getWidenedType(type);
|
|
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 is awaited type of the body, wrapped in a native Promise<T> type.
|
|
var promiseType = createPromiseType(widenedType);
|
|
if (promiseType === emptyObjectType) {
|
|
error(func, ts.Diagnostics.An_async_function_or_method_must_have_a_valid_awaitable_return_type);
|
|
return unknownType;
|
|
}
|
|
return promiseType;
|
|
}
|
|
else {
|
|
return widenedType;
|
|
}
|
|
}
|
|
function checkAndAggregateYieldOperandTypes(body, contextualMapper) {
|
|
var aggregatedTypes = [];
|
|
ts.forEachYieldExpression(body, function (yieldExpression) {
|
|
var expr = yieldExpression.expression;
|
|
if (expr) {
|
|
var type = checkExpressionCached(expr, contextualMapper);
|
|
if (yieldExpression.asteriskToken) {
|
|
// A yield* expression effectively yields everything that its operand yields
|
|
type = checkElementTypeOfIterable(type, yieldExpression.expression);
|
|
}
|
|
if (!ts.contains(aggregatedTypes, type)) {
|
|
aggregatedTypes.push(type);
|
|
}
|
|
}
|
|
});
|
|
return aggregatedTypes;
|
|
}
|
|
function checkAndAggregateReturnExpressionTypes(body, contextualMapper, isAsync) {
|
|
var aggregatedTypes = [];
|
|
ts.forEachReturnStatement(body, function (returnStatement) {
|
|
var expr = returnStatement.expression;
|
|
if (expr) {
|
|
var type = checkExpressionCached(expr, contextualMapper);
|
|
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 should be wrapped in
|
|
// the native Promise<T> type by the caller.
|
|
type = checkAwaitedType(type, body.parent, ts.Diagnostics.Return_expression_in_async_function_does_not_have_a_valid_callable_then_member);
|
|
}
|
|
if (!ts.contains(aggregatedTypes, type)) {
|
|
aggregatedTypes.push(type);
|
|
}
|
|
}
|
|
});
|
|
return aggregatedTypes;
|
|
}
|
|
function bodyContainsAReturnStatement(funcBody) {
|
|
return ts.forEachReturnStatement(funcBody, function (returnStatement) {
|
|
return true;
|
|
});
|
|
}
|
|
function bodyContainsSingleThrowStatement(body) {
|
|
return (body.statements.length === 1) && (body.statements[0].kind === 205 /* ThrowStatement */);
|
|
}
|
|
// TypeScript Specification 1.0 (6.3) - July 2014
|
|
// An explicitly typed function whose return type isn't the Void or the Any type
|
|
// 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.
|
|
function checkIfNonVoidFunctionHasReturnExpressionsOrSingleThrowStatment(func, returnType) {
|
|
if (!produceDiagnostics) {
|
|
return;
|
|
}
|
|
// Functions that return 'void' or 'any' don't need any return expressions.
|
|
if (returnType === voidType || isTypeAny(returnType)) {
|
|
return;
|
|
}
|
|
// If all we have is a function signature, or an arrow function with an expression body, then there is nothing to check.
|
|
if (ts.nodeIsMissing(func.body) || func.body.kind !== 189 /* Block */) {
|
|
return;
|
|
}
|
|
var bodyBlock = func.body;
|
|
// Ensure the body has at least one return expression.
|
|
if (bodyContainsAReturnStatement(bodyBlock)) {
|
|
return;
|
|
}
|
|
// If there are no return expressions, then we need to check if
|
|
// the function body consists solely of a throw statement;
|
|
// this is to make an exception for unimplemented functions.
|
|
if (bodyContainsSingleThrowStatement(bodyBlock)) {
|
|
return;
|
|
}
|
|
// This function does not conform to the specification.
|
|
error(func.type, ts.Diagnostics.A_function_whose_declared_type_is_neither_void_nor_any_must_return_a_value_or_consist_of_a_single_throw_statement);
|
|
}
|
|
function checkFunctionExpressionOrObjectLiteralMethod(node, contextualMapper) {
|
|
ts.Debug.assert(node.kind !== 140 /* MethodDeclaration */ || ts.isObjectLiteralMethod(node));
|
|
// Grammar checking
|
|
var hasGrammarError = checkGrammarFunctionLikeDeclaration(node);
|
|
if (!hasGrammarError && node.kind === 170 /* FunctionExpression */) {
|
|
checkGrammarForGenerator(node);
|
|
}
|
|
// The identityMapper object is used to indicate that function expressions are wildcards
|
|
if (contextualMapper === identityMapper && isContextSensitive(node)) {
|
|
return anyFunctionType;
|
|
}
|
|
var isAsync = ts.isAsyncFunctionLike(node);
|
|
if (isAsync) {
|
|
emitAwaiter = true;
|
|
}
|
|
var links = getNodeLinks(node);
|
|
var type = getTypeOfSymbol(node.symbol);
|
|
// 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 */;
|
|
if (contextualSignature) {
|
|
var signature = getSignaturesOfType(type, 0 /* Call */)[0];
|
|
if (isContextSensitive(node)) {
|
|
assignContextualParameterTypes(signature, contextualSignature, contextualMapper || identityMapper);
|
|
}
|
|
if (!node.type && !signature.resolvedReturnType) {
|
|
var returnType = getReturnTypeFromBody(node, contextualMapper);
|
|
if (!signature.resolvedReturnType) {
|
|
signature.resolvedReturnType = returnType;
|
|
}
|
|
}
|
|
}
|
|
checkSignatureDeclaration(node);
|
|
}
|
|
}
|
|
if (produceDiagnostics && node.kind !== 140 /* MethodDeclaration */ && node.kind !== 139 /* MethodSignature */) {
|
|
checkCollisionWithCapturedSuperVariable(node, node.name);
|
|
checkCollisionWithCapturedThisVariable(node, node.name);
|
|
}
|
|
return type;
|
|
}
|
|
function checkFunctionExpressionOrObjectLiteralMethodBody(node) {
|
|
ts.Debug.assert(node.kind !== 140 /* MethodDeclaration */ || ts.isObjectLiteralMethod(node));
|
|
var isAsync = ts.isAsyncFunctionLike(node);
|
|
if (isAsync) {
|
|
emitAwaiter = true;
|
|
}
|
|
var returnType = node.type && getTypeFromTypeNode(node.type);
|
|
var promisedType;
|
|
if (returnType && isAsync) {
|
|
promisedType = checkAsyncFunctionReturnType(node);
|
|
}
|
|
if (returnType && !node.asteriskToken) {
|
|
checkIfNonVoidFunctionHasReturnExpressionsOrSingleThrowStatment(node, isAsync ? promisedType : returnType);
|
|
}
|
|
if (node.body) {
|
|
if (!node.type) {
|
|
// 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 === 189 /* 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);
|
|
if (returnType) {
|
|
if (isAsync) {
|
|
var awaitedType = checkAwaitedType(exprType, node.body, ts.Diagnostics.Expression_body_for_async_arrow_function_does_not_have_a_valid_callable_then_member);
|
|
checkTypeAssignableTo(awaitedType, promisedType, node.body);
|
|
}
|
|
else {
|
|
checkTypeAssignableTo(exprType, returnType, node.body);
|
|
}
|
|
}
|
|
checkFunctionAndClassExpressionBodies(node.body);
|
|
}
|
|
}
|
|
}
|
|
function checkArithmeticOperandType(operand, type, diagnostic) {
|
|
if (!isTypeAnyOrAllConstituentTypesHaveKind(type, 132 /* NumberLike */)) {
|
|
error(operand, diagnostic);
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
function checkReferenceExpression(n, invalidReferenceMessage, constantVariableMessage) {
|
|
function findSymbol(n) {
|
|
var symbol = getNodeLinks(n).resolvedSymbol;
|
|
// Because we got the symbol from the resolvedSymbol property, it might be of kind
|
|
// SymbolFlags.ExportValue. In this case it is necessary to get the actual export
|
|
// symbol, which will have the correct flags set on it.
|
|
return symbol && getExportSymbolOfValueSymbolIfExported(symbol);
|
|
}
|
|
function isReferenceOrErrorExpression(n) {
|
|
// TypeScript 1.0 spec (April 2014):
|
|
// Expressions are classified as values or references.
|
|
// References are the subset of expressions that are permitted as the target of an assignment.
|
|
// Specifically, references are combinations of identifiers(section 4.3), parentheses(section 4.7),
|
|
// and property accesses(section 4.10).
|
|
// All other expression constructs described in this chapter are classified as values.
|
|
switch (n.kind) {
|
|
case 66 /* Identifier */: {
|
|
var symbol = findSymbol(n);
|
|
// TypeScript 1.0 spec (April 2014): 4.3
|
|
// An identifier expression that references a variable or parameter is classified as a reference.
|
|
// An identifier expression that references any other kind of entity is classified as a value(and therefore cannot be the target of an assignment).
|
|
return !symbol || symbol === unknownSymbol || symbol === argumentsSymbol || (symbol.flags & 3 /* Variable */) !== 0;
|
|
}
|
|
case 163 /* PropertyAccessExpression */: {
|
|
var symbol = findSymbol(n);
|
|
// TypeScript 1.0 spec (April 2014): 4.10
|
|
// A property access expression is always classified as a reference.
|
|
// NOTE (not in spec): assignment to enum members should not be allowed
|
|
return !symbol || symbol === unknownSymbol || (symbol.flags & ~8 /* EnumMember */) !== 0;
|
|
}
|
|
case 164 /* ElementAccessExpression */:
|
|
// old compiler doesn't check indexed assess
|
|
return true;
|
|
case 169 /* ParenthesizedExpression */:
|
|
return isReferenceOrErrorExpression(n.expression);
|
|
default:
|
|
return false;
|
|
}
|
|
}
|
|
function isConstVariableReference(n) {
|
|
switch (n.kind) {
|
|
case 66 /* Identifier */:
|
|
case 163 /* PropertyAccessExpression */: {
|
|
var symbol = findSymbol(n);
|
|
return symbol && (symbol.flags & 3 /* Variable */) !== 0 && (getDeclarationFlagsFromSymbol(symbol) & 32768 /* Const */) !== 0;
|
|
}
|
|
case 164 /* ElementAccessExpression */: {
|
|
var index = n.argumentExpression;
|
|
var symbol = findSymbol(n.expression);
|
|
if (symbol && index && index.kind === 8 /* StringLiteral */) {
|
|
var name_12 = index.text;
|
|
var prop = getPropertyOfType(getTypeOfSymbol(symbol), name_12);
|
|
return prop && (prop.flags & 3 /* Variable */) !== 0 && (getDeclarationFlagsFromSymbol(prop) & 32768 /* Const */) !== 0;
|
|
}
|
|
return false;
|
|
}
|
|
case 169 /* ParenthesizedExpression */:
|
|
return isConstVariableReference(n.expression);
|
|
default:
|
|
return false;
|
|
}
|
|
}
|
|
if (!isReferenceOrErrorExpression(n)) {
|
|
error(n, invalidReferenceMessage);
|
|
return false;
|
|
}
|
|
if (isConstVariableReference(n)) {
|
|
error(n, constantVariableMessage);
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
function checkDeleteExpression(node) {
|
|
checkExpression(node.expression);
|
|
return booleanType;
|
|
}
|
|
function checkTypeOfExpression(node) {
|
|
checkExpression(node.expression);
|
|
return stringType;
|
|
}
|
|
function checkVoidExpression(node) {
|
|
checkExpression(node.expression);
|
|
return undefinedType;
|
|
}
|
|
function checkAwaitExpression(node) {
|
|
// Grammar checking
|
|
if (produceDiagnostics) {
|
|
if (!(node.parserContextFlags & 8 /* Await */)) {
|
|
grammarErrorOnFirstToken(node, ts.Diagnostics.await_expression_is_only_allowed_within_an_async_function);
|
|
}
|
|
if (isInParameterInitializerBeforeContainingFunction(node)) {
|
|
error(node, ts.Diagnostics.await_expressions_cannot_be_used_in_a_parameter_initializer);
|
|
}
|
|
}
|
|
var operandType = checkExpression(node.expression);
|
|
return checkAwaitedType(operandType, node);
|
|
}
|
|
function checkPrefixUnaryExpression(node) {
|
|
var operandType = checkExpression(node.operand);
|
|
switch (node.operator) {
|
|
case 34 /* PlusToken */:
|
|
case 35 /* MinusToken */:
|
|
case 48 /* TildeToken */:
|
|
if (someConstituentTypeHasKind(operandType, 4194304 /* ESSymbol */)) {
|
|
error(node.operand, ts.Diagnostics.The_0_operator_cannot_be_applied_to_type_symbol, ts.tokenToString(node.operator));
|
|
}
|
|
return numberType;
|
|
case 47 /* ExclamationToken */:
|
|
return booleanType;
|
|
case 39 /* PlusPlusToken */:
|
|
case 40 /* MinusMinusToken */:
|
|
var ok = checkArithmeticOperandType(node.operand, operandType, ts.Diagnostics.An_arithmetic_operand_must_be_of_type_any_number_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_property_or_indexer, ts.Diagnostics.The_operand_of_an_increment_or_decrement_operator_cannot_be_a_constant);
|
|
}
|
|
return numberType;
|
|
}
|
|
return unknownType;
|
|
}
|
|
function checkPostfixUnaryExpression(node) {
|
|
var operandType = checkExpression(node.operand);
|
|
var ok = checkArithmeticOperandType(node.operand, operandType, ts.Diagnostics.An_arithmetic_operand_must_be_of_type_any_number_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_property_or_indexer, ts.Diagnostics.The_operand_of_an_increment_or_decrement_operator_cannot_be_a_constant);
|
|
}
|
|
return numberType;
|
|
}
|
|
// Just like isTypeOfKind below, except that it returns true if *any* constituent
|
|
// has this kind.
|
|
function someConstituentTypeHasKind(type, kind) {
|
|
if (type.flags & kind) {
|
|
return true;
|
|
}
|
|
if (type.flags & 49152 /* UnionOrIntersection */) {
|
|
var types = type.types;
|
|
for (var _i = 0; _i < types.length; _i++) {
|
|
var current = types[_i];
|
|
if (current.flags & kind) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
return false;
|
|
}
|
|
// Return true if type has the given flags, or is a union or intersection type composed of types that all have those flags.
|
|
function allConstituentTypesHaveKind(type, kind) {
|
|
if (type.flags & kind) {
|
|
return true;
|
|
}
|
|
if (type.flags & 49152 /* UnionOrIntersection */) {
|
|
var types = type.types;
|
|
for (var _i = 0; _i < types.length; _i++) {
|
|
var current = types[_i];
|
|
if (!(current.flags & kind)) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function isConstEnumObjectType(type) {
|
|
return type.flags & (80896 /* ObjectType */ | 65536 /* Anonymous */) && type.symbol && isConstEnumSymbol(type.symbol);
|
|
}
|
|
function isConstEnumSymbol(symbol) {
|
|
return (symbol.flags & 128 /* ConstEnum */) !== 0;
|
|
}
|
|
function checkInstanceOfExpression(node, leftType, rightType) {
|
|
// 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 or a subtype of the 'Function' interface type.
|
|
// 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 (allConstituentTypesHaveKind(leftType, 4194814 /* Primitive */)) {
|
|
error(node.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) || isTypeSubtypeOf(rightType, globalFunctionType))) {
|
|
error(node.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(node, leftType, rightType) {
|
|
// 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 of type Any, an object type, or a type parameter type.
|
|
// The result is always of the Boolean primitive type.
|
|
if (!isTypeAnyOrAllConstituentTypesHaveKind(leftType, 258 /* StringLike */ | 132 /* NumberLike */ | 4194304 /* ESSymbol */)) {
|
|
error(node.left, ts.Diagnostics.The_left_hand_side_of_an_in_expression_must_be_of_type_any_string_number_or_symbol);
|
|
}
|
|
if (!isTypeAnyOrAllConstituentTypesHaveKind(rightType, 80896 /* ObjectType */ | 512 /* TypeParameter */)) {
|
|
error(node.right, ts.Diagnostics.The_right_hand_side_of_an_in_expression_must_be_of_type_any_an_object_type_or_a_type_parameter);
|
|
}
|
|
return booleanType;
|
|
}
|
|
function checkObjectLiteralAssignment(node, sourceType, contextualMapper) {
|
|
var properties = node.properties;
|
|
for (var _i = 0; _i < properties.length; _i++) {
|
|
var p = properties[_i];
|
|
if (p.kind === 242 /* PropertyAssignment */ || p.kind === 243 /* ShorthandPropertyAssignment */) {
|
|
// TODO(andersh): Computed property support
|
|
var name_13 = p.name;
|
|
var type = isTypeAny(sourceType)
|
|
? sourceType
|
|
: getTypeOfPropertyOfType(sourceType, name_13.text) ||
|
|
isNumericLiteralName(name_13.text) && getIndexTypeOfType(sourceType, 1 /* Number */) ||
|
|
getIndexTypeOfType(sourceType, 0 /* String */);
|
|
if (type) {
|
|
checkDestructuringAssignment(p.initializer || name_13, type);
|
|
}
|
|
else {
|
|
error(name_13, ts.Diagnostics.Type_0_has_no_property_1_and_no_string_index_signature, typeToString(sourceType), ts.declarationNameToString(name_13));
|
|
}
|
|
}
|
|
else {
|
|
error(p, ts.Diagnostics.Property_assignment_expected);
|
|
}
|
|
}
|
|
return sourceType;
|
|
}
|
|
function checkArrayLiteralAssignment(node, sourceType, contextualMapper) {
|
|
// 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(sourceType, node, false) || unknownType;
|
|
var elements = node.elements;
|
|
for (var i = 0; i < elements.length; i++) {
|
|
var e = elements[i];
|
|
if (e.kind !== 184 /* OmittedExpression */) {
|
|
if (e.kind !== 182 /* SpreadElementExpression */) {
|
|
var propName = "" + i;
|
|
var type = isTypeAny(sourceType)
|
|
? sourceType
|
|
: isTupleLikeType(sourceType)
|
|
? getTypeOfPropertyOfType(sourceType, propName)
|
|
: elementType;
|
|
if (type) {
|
|
checkDestructuringAssignment(e, type, contextualMapper);
|
|
}
|
|
else {
|
|
if (isTupleType(sourceType)) {
|
|
error(e, ts.Diagnostics.Tuple_type_0_with_length_1_cannot_be_assigned_to_tuple_with_length_2, typeToString(sourceType), sourceType.elementTypes.length, elements.length);
|
|
}
|
|
else {
|
|
error(e, ts.Diagnostics.Type_0_has_no_property_1, typeToString(sourceType), propName);
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
if (i < elements.length - 1) {
|
|
error(e, ts.Diagnostics.A_rest_element_must_be_last_in_an_array_destructuring_pattern);
|
|
}
|
|
else {
|
|
var restExpression = e.expression;
|
|
if (restExpression.kind === 178 /* BinaryExpression */ && restExpression.operatorToken.kind === 54 /* EqualsToken */) {
|
|
error(restExpression.operatorToken, ts.Diagnostics.A_rest_element_cannot_have_an_initializer);
|
|
}
|
|
else {
|
|
checkDestructuringAssignment(restExpression, createArrayType(elementType), contextualMapper);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return sourceType;
|
|
}
|
|
function checkDestructuringAssignment(target, sourceType, contextualMapper) {
|
|
if (target.kind === 178 /* BinaryExpression */ && target.operatorToken.kind === 54 /* EqualsToken */) {
|
|
checkBinaryExpression(target, contextualMapper);
|
|
target = target.left;
|
|
}
|
|
if (target.kind === 162 /* ObjectLiteralExpression */) {
|
|
return checkObjectLiteralAssignment(target, sourceType, contextualMapper);
|
|
}
|
|
if (target.kind === 161 /* ArrayLiteralExpression */) {
|
|
return checkArrayLiteralAssignment(target, sourceType, contextualMapper);
|
|
}
|
|
return checkReferenceAssignment(target, sourceType, contextualMapper);
|
|
}
|
|
function checkReferenceAssignment(target, sourceType, contextualMapper) {
|
|
var targetType = checkExpression(target, contextualMapper);
|
|
if (checkReferenceExpression(target, ts.Diagnostics.Invalid_left_hand_side_of_assignment_expression, ts.Diagnostics.Left_hand_side_of_assignment_expression_cannot_be_a_constant)) {
|
|
checkTypeAssignableTo(sourceType, targetType, target, undefined);
|
|
}
|
|
return sourceType;
|
|
}
|
|
function checkBinaryExpression(node, contextualMapper) {
|
|
var operator = node.operatorToken.kind;
|
|
if (operator === 54 /* EqualsToken */ && (node.left.kind === 162 /* ObjectLiteralExpression */ || node.left.kind === 161 /* ArrayLiteralExpression */)) {
|
|
return checkDestructuringAssignment(node.left, checkExpression(node.right, contextualMapper), contextualMapper);
|
|
}
|
|
var leftType = checkExpression(node.left, contextualMapper);
|
|
var rightType = checkExpression(node.right, contextualMapper);
|
|
switch (operator) {
|
|
case 36 /* AsteriskToken */:
|
|
case 57 /* AsteriskEqualsToken */:
|
|
case 37 /* SlashToken */:
|
|
case 58 /* SlashEqualsToken */:
|
|
case 38 /* PercentToken */:
|
|
case 59 /* PercentEqualsToken */:
|
|
case 35 /* MinusToken */:
|
|
case 56 /* MinusEqualsToken */:
|
|
case 41 /* LessThanLessThanToken */:
|
|
case 60 /* LessThanLessThanEqualsToken */:
|
|
case 42 /* GreaterThanGreaterThanToken */:
|
|
case 61 /* GreaterThanGreaterThanEqualsToken */:
|
|
case 43 /* GreaterThanGreaterThanGreaterThanToken */:
|
|
case 62 /* GreaterThanGreaterThanGreaterThanEqualsToken */:
|
|
case 45 /* BarToken */:
|
|
case 64 /* BarEqualsToken */:
|
|
case 46 /* CaretToken */:
|
|
case 65 /* CaretEqualsToken */:
|
|
case 44 /* AmpersandToken */:
|
|
case 63 /* AmpersandEqualsToken */:
|
|
// TypeScript 1.0 spec (April 2014): 4.15.1
|
|
// These operators require their operands to be of type Any, the Number primitive type,
|
|
// or an enum type. Operands of an enum type are treated
|
|
// as having the primitive type Number. If one operand is the null or undefined value,
|
|
// it is treated as having the type of the other operand.
|
|
// The result is always of the Number primitive type.
|
|
if (leftType.flags & (32 /* Undefined */ | 64 /* Null */))
|
|
leftType = rightType;
|
|
if (rightType.flags & (32 /* Undefined */ | 64 /* Null */))
|
|
rightType = leftType;
|
|
var suggestedOperator;
|
|
// if a user tries to apply a bitwise operator to 2 boolean operands
|
|
// try and return them a helpful suggestion
|
|
if ((leftType.flags & 8 /* Boolean */) &&
|
|
(rightType.flags & 8 /* Boolean */) &&
|
|
(suggestedOperator = getSuggestedBooleanOperator(node.operatorToken.kind)) !== undefined) {
|
|
error(node, ts.Diagnostics.The_0_operator_is_not_allowed_for_boolean_types_Consider_using_1_instead, ts.tokenToString(node.operatorToken.kind), ts.tokenToString(suggestedOperator));
|
|
}
|
|
else {
|
|
// otherwise just check each operand separately and report errors as normal
|
|
var leftOk = checkArithmeticOperandType(node.left, leftType, ts.Diagnostics.The_left_hand_side_of_an_arithmetic_operation_must_be_of_type_any_number_or_an_enum_type);
|
|
var rightOk = checkArithmeticOperandType(node.right, rightType, ts.Diagnostics.The_right_hand_side_of_an_arithmetic_operation_must_be_of_type_any_number_or_an_enum_type);
|
|
if (leftOk && rightOk) {
|
|
checkAssignmentOperator(numberType);
|
|
}
|
|
}
|
|
return numberType;
|
|
case 34 /* PlusToken */:
|
|
case 55 /* PlusEqualsToken */:
|
|
// TypeScript 1.0 spec (April 2014): 4.15.2
|
|
// The binary + operator requires both operands to be of the Number primitive type or an enum type,
|
|
// or at least one of the operands to be of type Any or the String primitive type.
|
|
// If one operand is the null or undefined value, it is treated as having the type of the other operand.
|
|
if (leftType.flags & (32 /* Undefined */ | 64 /* Null */))
|
|
leftType = rightType;
|
|
if (rightType.flags & (32 /* Undefined */ | 64 /* Null */))
|
|
rightType = leftType;
|
|
var resultType;
|
|
if (allConstituentTypesHaveKind(leftType, 132 /* NumberLike */) && allConstituentTypesHaveKind(rightType, 132 /* NumberLike */)) {
|
|
// 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 (allConstituentTypesHaveKind(leftType, 258 /* StringLike */) || allConstituentTypesHaveKind(rightType, 258 /* StringLike */)) {
|
|
// 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 === unknownType || rightType === unknownType ? unknownType : anyType;
|
|
}
|
|
// Symbols are not allowed at all in arithmetic expressions
|
|
if (resultType && !checkForDisallowedESSymbolOperand(operator)) {
|
|
return resultType;
|
|
}
|
|
}
|
|
if (!resultType) {
|
|
reportOperatorError();
|
|
return anyType;
|
|
}
|
|
if (operator === 55 /* PlusEqualsToken */) {
|
|
checkAssignmentOperator(resultType);
|
|
}
|
|
return resultType;
|
|
case 24 /* LessThanToken */:
|
|
case 26 /* GreaterThanToken */:
|
|
case 27 /* LessThanEqualsToken */:
|
|
case 28 /* GreaterThanEqualsToken */:
|
|
if (!checkForDisallowedESSymbolOperand(operator)) {
|
|
return booleanType;
|
|
}
|
|
// Fall through
|
|
case 29 /* EqualsEqualsToken */:
|
|
case 30 /* ExclamationEqualsToken */:
|
|
case 31 /* EqualsEqualsEqualsToken */:
|
|
case 32 /* ExclamationEqualsEqualsToken */:
|
|
if (!isTypeAssignableTo(leftType, rightType) && !isTypeAssignableTo(rightType, leftType)) {
|
|
reportOperatorError();
|
|
}
|
|
return booleanType;
|
|
case 88 /* InstanceOfKeyword */:
|
|
return checkInstanceOfExpression(node, leftType, rightType);
|
|
case 87 /* InKeyword */:
|
|
return checkInExpression(node, leftType, rightType);
|
|
case 49 /* AmpersandAmpersandToken */:
|
|
return rightType;
|
|
case 50 /* BarBarToken */:
|
|
return getUnionType([leftType, rightType]);
|
|
case 54 /* EqualsToken */:
|
|
checkAssignmentOperator(rightType);
|
|
return rightType;
|
|
case 23 /* CommaToken */:
|
|
return rightType;
|
|
}
|
|
// Return true if there was no error, false if there was an error.
|
|
function checkForDisallowedESSymbolOperand(operator) {
|
|
var offendingSymbolOperand = someConstituentTypeHasKind(leftType, 4194304 /* ESSymbol */) ? node.left :
|
|
someConstituentTypeHasKind(rightType, 4194304 /* ESSymbol */) ? node.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 45 /* BarToken */:
|
|
case 64 /* BarEqualsToken */:
|
|
return 50 /* BarBarToken */;
|
|
case 46 /* CaretToken */:
|
|
case 65 /* CaretEqualsToken */:
|
|
return 32 /* ExclamationEqualsEqualsToken */;
|
|
case 44 /* AmpersandToken */:
|
|
case 63 /* AmpersandEqualsToken */:
|
|
return 49 /* AmpersandAmpersandToken */;
|
|
default:
|
|
return undefined;
|
|
}
|
|
}
|
|
function checkAssignmentOperator(valueType) {
|
|
if (produceDiagnostics && operator >= 54 /* FirstAssignment */ && operator <= 65 /* LastAssignment */) {
|
|
// 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.
|
|
var ok = checkReferenceExpression(node.left, ts.Diagnostics.Invalid_left_hand_side_of_assignment_expression, ts.Diagnostics.Left_hand_side_of_assignment_expression_cannot_be_a_constant);
|
|
// Use default messages
|
|
if (ok) {
|
|
// to avoid cascading errors check assignability only if 'isReference' check succeeded and no errors were reported
|
|
checkTypeAssignableTo(valueType, leftType, node.left, undefined);
|
|
}
|
|
}
|
|
}
|
|
function reportOperatorError() {
|
|
error(node, ts.Diagnostics.Operator_0_cannot_be_applied_to_types_1_and_2, ts.tokenToString(node.operatorToken.kind), typeToString(leftType), typeToString(rightType));
|
|
}
|
|
}
|
|
function isYieldExpressionInClass(node) {
|
|
var current = node;
|
|
var parent = node.parent;
|
|
while (parent) {
|
|
if (ts.isFunctionLike(parent) && current === parent.body) {
|
|
return false;
|
|
}
|
|
else if (ts.isClassLike(current)) {
|
|
return true;
|
|
}
|
|
current = parent;
|
|
parent = parent.parent;
|
|
}
|
|
return false;
|
|
}
|
|
function checkYieldExpression(node) {
|
|
// Grammar checking
|
|
if (produceDiagnostics) {
|
|
if (!(node.parserContextFlags & 2 /* Yield */) || isYieldExpressionInClass(node)) {
|
|
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);
|
|
}
|
|
}
|
|
if (node.expression) {
|
|
var func = ts.getContainingFunction(node);
|
|
// If the user's code is syntactically correct, the func should always have a star. After all,
|
|
// we are in a yield context.
|
|
if (func && func.asteriskToken) {
|
|
var expressionType = checkExpressionCached(node.expression, undefined);
|
|
var expressionElementType;
|
|
var nodeIsYieldStar = !!node.asteriskToken;
|
|
if (nodeIsYieldStar) {
|
|
expressionElementType = checkElementTypeOfIterable(expressionType, node.expression);
|
|
}
|
|
// 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.
|
|
if (func.type) {
|
|
var signatureElementType = getElementTypeOfIterableIterator(getTypeFromTypeNode(func.type)) || anyType;
|
|
if (nodeIsYieldStar) {
|
|
checkTypeAssignableTo(expressionElementType, signatureElementType, node.expression, undefined);
|
|
}
|
|
else {
|
|
checkTypeAssignableTo(expressionType, signatureElementType, node.expression, undefined);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
// Both yield and yield* expressions have type 'any'
|
|
return anyType;
|
|
}
|
|
function checkConditionalExpression(node, contextualMapper) {
|
|
checkExpression(node.condition);
|
|
var type1 = checkExpression(node.whenTrue, contextualMapper);
|
|
var type2 = checkExpression(node.whenFalse, contextualMapper);
|
|
return getUnionType([type1, type2]);
|
|
}
|
|
function checkTemplateExpression(node) {
|
|
// We just want to check each expressions, but we are unconcerned with
|
|
// the type of each expression, as any value may be coerced into a string.
|
|
// It is worth asking whether this is what we really want though.
|
|
// A place where we actually *are* concerned with the expressions' types are
|
|
// in tagged templates.
|
|
ts.forEach(node.templateSpans, function (templateSpan) {
|
|
checkExpression(templateSpan.expression);
|
|
});
|
|
return stringType;
|
|
}
|
|
function checkExpressionWithContextualType(node, contextualType, contextualMapper) {
|
|
var saveContextualType = node.contextualType;
|
|
node.contextualType = contextualType;
|
|
var result = checkExpression(node, contextualMapper);
|
|
node.contextualType = saveContextualType;
|
|
return result;
|
|
}
|
|
function checkExpressionCached(node, contextualMapper) {
|
|
var links = getNodeLinks(node);
|
|
if (!links.resolvedType) {
|
|
links.resolvedType = checkExpression(node, contextualMapper);
|
|
}
|
|
return links.resolvedType;
|
|
}
|
|
function checkPropertyAssignment(node, contextualMapper) {
|
|
// 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 === 133 /* ComputedPropertyName */) {
|
|
checkComputedPropertyName(node.name);
|
|
}
|
|
return checkExpression(node.initializer, contextualMapper);
|
|
}
|
|
function checkObjectLiteralMethod(node, contextualMapper) {
|
|
// 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 === 133 /* ComputedPropertyName */) {
|
|
checkComputedPropertyName(node.name);
|
|
}
|
|
var uninstantiatedType = checkFunctionExpressionOrObjectLiteralMethod(node, contextualMapper);
|
|
return instantiateTypeWithSingleGenericCallSignature(node, uninstantiatedType, contextualMapper);
|
|
}
|
|
function instantiateTypeWithSingleGenericCallSignature(node, type, contextualMapper) {
|
|
if (contextualMapper && contextualMapper !== identityMapper) {
|
|
var signature = getSingleCallSignature(type);
|
|
if (signature && signature.typeParameters) {
|
|
var contextualType = getContextualType(node);
|
|
if (contextualType) {
|
|
var contextualSignature = getSingleCallSignature(contextualType);
|
|
if (contextualSignature && !contextualSignature.typeParameters) {
|
|
return getOrCreateTypeFromSignature(instantiateSignatureInContextOf(signature, contextualSignature, contextualMapper));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return type;
|
|
}
|
|
// Checks an expression and returns its type. The contextualMapper parameter serves two purposes: When
|
|
// contextualMapper is not undefined and not equal to the identityMapper function object it indicates that the
|
|
// expression is being inferentially typed (section 4.12.2 in spec) and provides the type mapper to use in
|
|
// conjunction with the generic contextual type. When contextualMapper is equal to the identityMapper function
|
|
// object, it serves as an indicator that all contained function and arrow expressions should be considered to
|
|
// have the wildcard function type; this form of type check is used during overload resolution to exclude
|
|
// contextually typed function and arrow expressions in the initial phase.
|
|
function checkExpression(node, contextualMapper) {
|
|
var type;
|
|
if (node.kind === 132 /* QualifiedName */) {
|
|
type = checkQualifiedName(node);
|
|
}
|
|
else {
|
|
var uninstantiatedType = checkExpressionWorker(node, contextualMapper);
|
|
type = instantiateTypeWithSingleGenericCallSignature(node, uninstantiatedType, contextualMapper);
|
|
}
|
|
if (isConstEnumObjectType(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 === 163 /* PropertyAccessExpression */ && node.parent.expression === node) ||
|
|
(node.parent.kind === 164 /* ElementAccessExpression */ && node.parent.expression === node) ||
|
|
((node.kind === 66 /* Identifier */ || node.kind === 132 /* QualifiedName */) && isInRightSideOfImportOrExportAssignment(node));
|
|
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);
|
|
}
|
|
}
|
|
return type;
|
|
}
|
|
function checkNumericLiteral(node) {
|
|
// Grammar checking
|
|
checkGrammarNumericLiteral(node);
|
|
return numberType;
|
|
}
|
|
function checkExpressionWorker(node, contextualMapper) {
|
|
switch (node.kind) {
|
|
case 66 /* Identifier */:
|
|
return checkIdentifier(node);
|
|
case 94 /* ThisKeyword */:
|
|
return checkThisExpression(node);
|
|
case 92 /* SuperKeyword */:
|
|
return checkSuperExpression(node);
|
|
case 90 /* NullKeyword */:
|
|
return nullType;
|
|
case 96 /* TrueKeyword */:
|
|
case 81 /* FalseKeyword */:
|
|
return booleanType;
|
|
case 7 /* NumericLiteral */:
|
|
return checkNumericLiteral(node);
|
|
case 180 /* TemplateExpression */:
|
|
return checkTemplateExpression(node);
|
|
case 8 /* StringLiteral */:
|
|
case 10 /* NoSubstitutionTemplateLiteral */:
|
|
return stringType;
|
|
case 9 /* RegularExpressionLiteral */:
|
|
return globalRegExpType;
|
|
case 161 /* ArrayLiteralExpression */:
|
|
return checkArrayLiteral(node, contextualMapper);
|
|
case 162 /* ObjectLiteralExpression */:
|
|
return checkObjectLiteral(node, contextualMapper);
|
|
case 163 /* PropertyAccessExpression */:
|
|
return checkPropertyAccessExpression(node);
|
|
case 164 /* ElementAccessExpression */:
|
|
return checkIndexedAccess(node);
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
return checkCallExpression(node);
|
|
case 167 /* TaggedTemplateExpression */:
|
|
return checkTaggedTemplateExpression(node);
|
|
case 169 /* ParenthesizedExpression */:
|
|
return checkExpression(node.expression, contextualMapper);
|
|
case 183 /* ClassExpression */:
|
|
return checkClassExpression(node);
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
return checkFunctionExpressionOrObjectLiteralMethod(node, contextualMapper);
|
|
case 173 /* TypeOfExpression */:
|
|
return checkTypeOfExpression(node);
|
|
case 168 /* TypeAssertionExpression */:
|
|
case 186 /* AsExpression */:
|
|
return checkAssertion(node);
|
|
case 172 /* DeleteExpression */:
|
|
return checkDeleteExpression(node);
|
|
case 174 /* VoidExpression */:
|
|
return checkVoidExpression(node);
|
|
case 175 /* AwaitExpression */:
|
|
return checkAwaitExpression(node);
|
|
case 176 /* PrefixUnaryExpression */:
|
|
return checkPrefixUnaryExpression(node);
|
|
case 177 /* PostfixUnaryExpression */:
|
|
return checkPostfixUnaryExpression(node);
|
|
case 178 /* BinaryExpression */:
|
|
return checkBinaryExpression(node, contextualMapper);
|
|
case 179 /* ConditionalExpression */:
|
|
return checkConditionalExpression(node, contextualMapper);
|
|
case 182 /* SpreadElementExpression */:
|
|
return checkSpreadElementExpression(node, contextualMapper);
|
|
case 184 /* OmittedExpression */:
|
|
return undefinedType;
|
|
case 181 /* YieldExpression */:
|
|
return checkYieldExpression(node);
|
|
case 237 /* JsxExpression */:
|
|
return checkJsxExpression(node);
|
|
case 230 /* JsxElement */:
|
|
return checkJsxElement(node);
|
|
case 231 /* JsxSelfClosingElement */:
|
|
return checkJsxSelfClosingElement(node);
|
|
case 232 /* JsxOpeningElement */:
|
|
ts.Debug.fail("Shouldn't ever directly check a JsxOpeningElement");
|
|
}
|
|
return unknownType;
|
|
}
|
|
// DECLARATION AND STATEMENT TYPE CHECKING
|
|
function checkTypeParameter(node) {
|
|
// Grammar Checking
|
|
if (node.expression) {
|
|
grammarErrorOnFirstToken(node.expression, ts.Diagnostics.Type_expected);
|
|
}
|
|
checkSourceElement(node.constraint);
|
|
if (produceDiagnostics) {
|
|
checkTypeParameterHasIllegalReferencesInConstraint(node);
|
|
checkTypeNameIsReserved(node.name, ts.Diagnostics.Type_parameter_name_cannot_be_0);
|
|
}
|
|
// TODO: Check multiple declarations are identical
|
|
}
|
|
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).
|
|
// Grammar checking
|
|
checkGrammarDecorators(node) || checkGrammarModifiers(node);
|
|
checkVariableLikeDeclaration(node);
|
|
var func = ts.getContainingFunction(node);
|
|
if (node.flags & 112 /* AccessibilityModifier */) {
|
|
func = ts.getContainingFunction(node);
|
|
if (!(func.kind === 141 /* Constructor */ && ts.nodeIsPresent(func.body))) {
|
|
error(node, ts.Diagnostics.A_parameter_property_is_only_allowed_in_a_constructor_implementation);
|
|
}
|
|
}
|
|
if (node.questionToken && ts.isBindingPattern(node.name) && func.body) {
|
|
error(node, ts.Diagnostics.A_binding_pattern_parameter_cannot_be_optional_in_an_implementation_signature);
|
|
}
|
|
// 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) && !isArrayType(getTypeOfSymbol(node.symbol))) {
|
|
error(node, ts.Diagnostics.A_rest_parameter_must_be_of_an_array_type);
|
|
}
|
|
}
|
|
function isSyntacticallyValidGenerator(node) {
|
|
if (!node.asteriskToken || !node.body) {
|
|
return false;
|
|
}
|
|
return node.kind === 140 /* MethodDeclaration */ ||
|
|
node.kind === 210 /* FunctionDeclaration */ ||
|
|
node.kind === 170 /* FunctionExpression */;
|
|
}
|
|
function getTypePredicateParameterIndex(parameterList, parameter) {
|
|
if (parameterList) {
|
|
for (var i = 0; i < parameterList.length; i++) {
|
|
var param = parameterList[i];
|
|
if (param.name.kind === 66 /* Identifier */ &&
|
|
param.name.text === parameter.text) {
|
|
return i;
|
|
}
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
function isInLegalTypePredicatePosition(node) {
|
|
switch (node.parent.kind) {
|
|
case 171 /* ArrowFunction */:
|
|
case 144 /* CallSignature */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 149 /* FunctionType */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
return node === node.parent.type;
|
|
}
|
|
return false;
|
|
}
|
|
function checkSignatureDeclaration(node) {
|
|
// Grammar checking
|
|
if (node.kind === 146 /* IndexSignature */) {
|
|
checkGrammarIndexSignature(node);
|
|
}
|
|
else if (node.kind === 149 /* FunctionType */ || node.kind === 210 /* FunctionDeclaration */ || node.kind === 150 /* ConstructorType */ ||
|
|
node.kind === 144 /* CallSignature */ || node.kind === 141 /* Constructor */ ||
|
|
node.kind === 145 /* ConstructSignature */) {
|
|
checkGrammarFunctionLikeDeclaration(node);
|
|
}
|
|
checkTypeParameters(node.typeParameters);
|
|
ts.forEach(node.parameters, checkParameter);
|
|
if (node.type) {
|
|
if (node.type.kind === 147 /* TypePredicate */) {
|
|
var typePredicate = getSignatureFromDeclaration(node).typePredicate;
|
|
var typePredicateNode = node.type;
|
|
if (isInLegalTypePredicatePosition(typePredicateNode)) {
|
|
if (typePredicate.parameterIndex >= 0) {
|
|
if (node.parameters[typePredicate.parameterIndex].dotDotDotToken) {
|
|
error(typePredicateNode.parameterName, ts.Diagnostics.A_type_predicate_cannot_reference_a_rest_parameter);
|
|
}
|
|
else {
|
|
checkTypeAssignableTo(typePredicate.type, getTypeAtLocation(node.parameters[typePredicate.parameterIndex]), typePredicateNode.type);
|
|
}
|
|
}
|
|
else if (typePredicateNode.parameterName) {
|
|
var hasReportedError = false;
|
|
for (var _i = 0, _a = node.parameters; _i < _a.length; _i++) {
|
|
var param = _a[_i];
|
|
if (hasReportedError) {
|
|
break;
|
|
}
|
|
if (param.name.kind === 158 /* ObjectBindingPattern */ ||
|
|
param.name.kind === 159 /* ArrayBindingPattern */) {
|
|
(function checkBindingPattern(pattern) {
|
|
for (var _i = 0, _a = pattern.elements; _i < _a.length; _i++) {
|
|
var element = _a[_i];
|
|
if (element.name.kind === 66 /* Identifier */ &&
|
|
element.name.text === typePredicate.parameterName) {
|
|
error(typePredicateNode.parameterName, ts.Diagnostics.A_type_predicate_cannot_reference_element_0_in_a_binding_pattern, typePredicate.parameterName);
|
|
hasReportedError = true;
|
|
break;
|
|
}
|
|
else if (element.name.kind === 159 /* ArrayBindingPattern */ ||
|
|
element.name.kind === 158 /* ObjectBindingPattern */) {
|
|
checkBindingPattern(element.name);
|
|
}
|
|
}
|
|
})(param.name);
|
|
}
|
|
}
|
|
if (!hasReportedError) {
|
|
error(typePredicateNode.parameterName, ts.Diagnostics.Cannot_find_parameter_0, typePredicate.parameterName);
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
error(typePredicateNode, ts.Diagnostics.A_type_predicate_is_only_allowed_in_return_type_position_for_functions_and_methods);
|
|
}
|
|
}
|
|
else {
|
|
checkSourceElement(node.type);
|
|
}
|
|
}
|
|
if (produceDiagnostics) {
|
|
checkCollisionWithArgumentsInGeneratedCode(node);
|
|
if (compilerOptions.noImplicitAny && !node.type) {
|
|
switch (node.kind) {
|
|
case 145 /* ConstructSignature */:
|
|
error(node, ts.Diagnostics.Construct_signature_which_lacks_return_type_annotation_implicitly_has_an_any_return_type);
|
|
break;
|
|
case 144 /* CallSignature */:
|
|
error(node, ts.Diagnostics.Call_signature_which_lacks_return_type_annotation_implicitly_has_an_any_return_type);
|
|
break;
|
|
}
|
|
}
|
|
if (node.type) {
|
|
if (languageVersion >= 2 /* ES6 */ && isSyntacticallyValidGenerator(node)) {
|
|
var returnType = getTypeFromTypeNode(node.type);
|
|
if (returnType === voidType) {
|
|
error(node.type, ts.Diagnostics.A_generator_cannot_have_a_void_type_annotation);
|
|
}
|
|
else {
|
|
var generatorElementType = getElementTypeOfIterableIterator(returnType) || anyType;
|
|
var iterableIteratorInstantiation = createIterableIteratorType(generatorElementType);
|
|
// Naively, one could check that IterableIterator<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!
|
|
//
|
|
checkTypeAssignableTo(iterableIteratorInstantiation, returnType, node.type);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
checkSpecializedSignatureDeclaration(node);
|
|
}
|
|
function checkTypeForDuplicateIndexSignatures(node) {
|
|
if (node.kind === 212 /* 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.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) {
|
|
var seenNumericIndexer = false;
|
|
var seenStringIndexer = false;
|
|
for (var _i = 0, _a = indexSymbol.declarations; _i < _a.length; _i++) {
|
|
var decl = _a[_i];
|
|
var declaration = decl;
|
|
if (declaration.parameters.length === 1 && declaration.parameters[0].type) {
|
|
switch (declaration.parameters[0].type.kind) {
|
|
case 127 /* StringKeyword */:
|
|
if (!seenStringIndexer) {
|
|
seenStringIndexer = true;
|
|
}
|
|
else {
|
|
error(declaration, ts.Diagnostics.Duplicate_string_index_signature);
|
|
}
|
|
break;
|
|
case 125 /* NumberKeyword */:
|
|
if (!seenNumericIndexer) {
|
|
seenNumericIndexer = true;
|
|
}
|
|
else {
|
|
error(declaration, ts.Diagnostics.Duplicate_number_index_signature);
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function checkPropertyDeclaration(node) {
|
|
// Grammar checking
|
|
checkGrammarDecorators(node) || checkGrammarModifiers(node) || checkGrammarProperty(node) || checkGrammarComputedPropertyName(node.name);
|
|
checkVariableLikeDeclaration(node);
|
|
}
|
|
function checkMethodDeclaration(node) {
|
|
// Grammar checking
|
|
checkGrammarMethod(node) || checkGrammarComputedPropertyName(node.name);
|
|
// Grammar checking for modifiers is done inside the function checkGrammarFunctionLikeDeclaration
|
|
checkFunctionLikeDeclaration(node);
|
|
// Abstract methods cannot have an implementation.
|
|
// Extra checks are to avoid reporting multiple errors relating to the "abstractness" of the node.
|
|
if (node.flags & 256 /* Abstract */ && node.body) {
|
|
error(node, ts.Diagnostics.Method_0_cannot_have_an_implementation_because_it_is_marked_abstract, ts.declarationNameToString(node.name));
|
|
}
|
|
}
|
|
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 constructoDeclaration
|
|
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 isSuperCallExpression(n) {
|
|
return n.kind === 165 /* CallExpression */ && n.expression.kind === 92 /* SuperKeyword */;
|
|
}
|
|
function containsSuperCall(n) {
|
|
if (isSuperCallExpression(n)) {
|
|
return true;
|
|
}
|
|
switch (n.kind) {
|
|
case 170 /* FunctionExpression */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 171 /* ArrowFunction */:
|
|
case 162 /* ObjectLiteralExpression */: return false;
|
|
default: return ts.forEachChild(n, containsSuperCall);
|
|
}
|
|
}
|
|
function markThisReferencesAsErrors(n) {
|
|
if (n.kind === 94 /* ThisKeyword */) {
|
|
error(n, ts.Diagnostics.this_cannot_be_referenced_in_current_location);
|
|
}
|
|
else if (n.kind !== 170 /* FunctionExpression */ && n.kind !== 210 /* FunctionDeclaration */) {
|
|
ts.forEachChild(n, markThisReferencesAsErrors);
|
|
}
|
|
}
|
|
function isInstancePropertyWithInitializer(n) {
|
|
return n.kind === 138 /* PropertyDeclaration */ &&
|
|
!(n.flags & 128 /* Static */) &&
|
|
!!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.
|
|
if (ts.getClassExtendsHeritageClauseElement(node.parent)) {
|
|
if (containsSuperCall(node.body)) {
|
|
// The first statement in the body of a constructor 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 = ts.forEach(node.parent.members, isInstancePropertyWithInitializer) ||
|
|
ts.forEach(node.parameters, function (p) { return p.flags & (16 /* Public */ | 32 /* Private */ | 64 /* Protected */); });
|
|
if (superCallShouldBeFirst) {
|
|
var statements = node.body.statements;
|
|
if (!statements.length || statements[0].kind !== 192 /* ExpressionStatement */ || !isSuperCallExpression(statements[0].expression)) {
|
|
error(node, ts.Diagnostics.A_super_call_must_be_the_first_statement_in_the_constructor_when_a_class_contains_initialized_properties_or_has_parameter_properties);
|
|
}
|
|
else {
|
|
// In such a required super call, it is a compile-time error for argument expressions to reference this.
|
|
markThisReferencesAsErrors(statements[0].expression);
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
error(node, ts.Diagnostics.Constructors_for_derived_classes_must_contain_a_super_call);
|
|
}
|
|
}
|
|
}
|
|
function checkAccessorDeclaration(node) {
|
|
if (produceDiagnostics) {
|
|
// Grammar checking accessors
|
|
checkGrammarFunctionLikeDeclaration(node) || checkGrammarAccessor(node) || checkGrammarComputedPropertyName(node.name);
|
|
if (node.kind === 142 /* GetAccessor */) {
|
|
if (!ts.isInAmbientContext(node) && ts.nodeIsPresent(node.body) && !(bodyContainsAReturnStatement(node.body) || bodyContainsSingleThrowStatement(node.body))) {
|
|
error(node.name, ts.Diagnostics.A_get_accessor_must_return_a_value_or_consist_of_a_single_throw_statement);
|
|
}
|
|
}
|
|
if (!ts.hasDynamicName(node)) {
|
|
// TypeScript 1.0 spec (April 2014): 8.4.3
|
|
// Accessors for the same member name must specify the same accessibility.
|
|
var otherKind = node.kind === 142 /* GetAccessor */ ? 143 /* SetAccessor */ : 142 /* GetAccessor */;
|
|
var otherAccessor = ts.getDeclarationOfKind(node.symbol, otherKind);
|
|
if (otherAccessor) {
|
|
if (((node.flags & 112 /* AccessibilityModifier */) !== (otherAccessor.flags & 112 /* AccessibilityModifier */))) {
|
|
error(node.name, ts.Diagnostics.Getter_and_setter_accessors_do_not_agree_in_visibility);
|
|
}
|
|
var currentAccessorType = getAnnotatedAccessorType(node);
|
|
var otherAccessorType = getAnnotatedAccessorType(otherAccessor);
|
|
// TypeScript 1.0 spec (April 2014): 4.5
|
|
// If both accessors include type annotations, the specified types must be identical.
|
|
if (currentAccessorType && otherAccessorType) {
|
|
if (!isTypeIdenticalTo(currentAccessorType, otherAccessorType)) {
|
|
error(node, ts.Diagnostics.get_and_set_accessor_must_have_the_same_type);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
getTypeOfAccessors(getSymbolOfNode(node));
|
|
}
|
|
checkFunctionLikeDeclaration(node);
|
|
}
|
|
function checkMissingDeclaration(node) {
|
|
checkDecorators(node);
|
|
}
|
|
function checkTypeArgumentConstraints(typeParameters, typeArguments) {
|
|
var result = true;
|
|
for (var i = 0; i < typeParameters.length; i++) {
|
|
var constraint = getConstraintOfTypeParameter(typeParameters[i]);
|
|
if (constraint) {
|
|
var typeArgument = typeArguments[i];
|
|
result = result && checkTypeAssignableTo(getTypeFromTypeNode(typeArgument), constraint, typeArgument, ts.Diagnostics.Type_0_does_not_satisfy_the_constraint_1);
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
function checkTypeReferenceNode(node) {
|
|
checkGrammarTypeArguments(node, node.typeArguments);
|
|
var type = getTypeFromTypeReference(node);
|
|
if (type !== unknownType && node.typeArguments) {
|
|
// Do type argument local checks only if referenced type is successfully resolved
|
|
ts.forEach(node.typeArguments, checkSourceElement);
|
|
if (produceDiagnostics) {
|
|
var symbol = getNodeLinks(node).resolvedSymbol;
|
|
var typeParameters = symbol.flags & 524288 /* TypeAlias */ ? getSymbolLinks(symbol).typeParameters : type.target.localTypeParameters;
|
|
checkTypeArgumentConstraints(typeParameters, node.typeArguments);
|
|
}
|
|
}
|
|
}
|
|
function checkTypeQuery(node) {
|
|
getTypeFromTypeQueryNode(node);
|
|
}
|
|
function checkTypeLiteral(node) {
|
|
ts.forEach(node.members, checkSourceElement);
|
|
if (produceDiagnostics) {
|
|
var type = getTypeFromTypeLiteralOrFunctionOrConstructorTypeNode(node);
|
|
checkIndexConstraints(type);
|
|
checkTypeForDuplicateIndexSignatures(node);
|
|
}
|
|
}
|
|
function checkArrayType(node) {
|
|
checkSourceElement(node.elementType);
|
|
}
|
|
function checkTupleType(node) {
|
|
// Grammar checking
|
|
var hasErrorFromDisallowedTrailingComma = checkGrammarForDisallowedTrailingComma(node.elementTypes);
|
|
if (!hasErrorFromDisallowedTrailingComma && node.elementTypes.length === 0) {
|
|
grammarErrorOnNode(node, ts.Diagnostics.A_tuple_type_element_list_cannot_be_empty);
|
|
}
|
|
ts.forEach(node.elementTypes, checkSourceElement);
|
|
}
|
|
function checkUnionOrIntersectionType(node) {
|
|
ts.forEach(node.types, checkSourceElement);
|
|
}
|
|
function isPrivateWithinAmbient(node) {
|
|
return (node.flags & 32 /* Private */) && ts.isInAmbientContext(node);
|
|
}
|
|
function checkSpecializedSignatureDeclaration(signatureDeclarationNode) {
|
|
if (!produceDiagnostics) {
|
|
return;
|
|
}
|
|
var signature = getSignatureFromDeclaration(signatureDeclarationNode);
|
|
if (!signature.hasStringLiterals) {
|
|
return;
|
|
}
|
|
// TypeScript 1.0 spec (April 2014): 3.7.2.2
|
|
// Specialized signatures are not permitted in conjunction with a function body
|
|
if (ts.nodeIsPresent(signatureDeclarationNode.body)) {
|
|
error(signatureDeclarationNode, ts.Diagnostics.A_signature_with_an_implementation_cannot_use_a_string_literal_type);
|
|
return;
|
|
}
|
|
// TypeScript 1.0 spec (April 2014): 3.7.2.4
|
|
// Every specialized call or construct signature in an object type must be assignable
|
|
// to at least one non-specialized call or construct signature in the same object type
|
|
var signaturesToCheck;
|
|
// Unnamed (call\construct) signatures in interfaces are inherited and not shadowed so examining just node symbol won't give complete answer.
|
|
// Use declaring type to obtain full list of signatures.
|
|
if (!signatureDeclarationNode.name && signatureDeclarationNode.parent && signatureDeclarationNode.parent.kind === 212 /* InterfaceDeclaration */) {
|
|
ts.Debug.assert(signatureDeclarationNode.kind === 144 /* CallSignature */ || signatureDeclarationNode.kind === 145 /* ConstructSignature */);
|
|
var signatureKind = signatureDeclarationNode.kind === 144 /* CallSignature */ ? 0 /* Call */ : 1 /* Construct */;
|
|
var containingSymbol = getSymbolOfNode(signatureDeclarationNode.parent);
|
|
var containingType = getDeclaredTypeOfSymbol(containingSymbol);
|
|
signaturesToCheck = getSignaturesOfType(containingType, signatureKind);
|
|
}
|
|
else {
|
|
signaturesToCheck = getSignaturesOfSymbol(getSymbolOfNode(signatureDeclarationNode));
|
|
}
|
|
for (var _i = 0; _i < signaturesToCheck.length; _i++) {
|
|
var otherSignature = signaturesToCheck[_i];
|
|
if (!otherSignature.hasStringLiterals && isSignatureAssignableTo(signature, otherSignature)) {
|
|
return;
|
|
}
|
|
}
|
|
error(signatureDeclarationNode, ts.Diagnostics.Specialized_overload_signature_is_not_assignable_to_any_non_specialized_signature);
|
|
}
|
|
function getEffectiveDeclarationFlags(n, flagsToCheck) {
|
|
var flags = ts.getCombinedNodeFlags(n);
|
|
if (n.parent.kind !== 212 /* InterfaceDeclaration */ && ts.isInAmbientContext(n)) {
|
|
if (!(flags & 2 /* Ambient */)) {
|
|
// 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 = getEffectiveDeclarationFlags(getCanonicalOverload(overloads, implementation), flagsToCheck);
|
|
ts.forEach(overloads, function (o) {
|
|
var deviation = getEffectiveDeclarationFlags(o, flagsToCheck) ^ canonicalFlags;
|
|
if (deviation & 1 /* Export */) {
|
|
error(o.name, ts.Diagnostics.Overload_signatures_must_all_be_exported_or_not_exported);
|
|
}
|
|
else if (deviation & 2 /* Ambient */) {
|
|
error(o.name, ts.Diagnostics.Overload_signatures_must_all_be_ambient_or_non_ambient);
|
|
}
|
|
else if (deviation & (32 /* Private */ | 64 /* Protected */)) {
|
|
error(o.name, ts.Diagnostics.Overload_signatures_must_all_be_public_private_or_protected);
|
|
}
|
|
else if (deviation & 256 /* Abstract */) {
|
|
error(o.name, ts.Diagnostics.Overload_signatures_must_all_be_abstract_or_not_abstract);
|
|
}
|
|
});
|
|
}
|
|
}
|
|
function checkQuestionTokenAgreementBetweenOverloads(overloads, implementation, someHaveQuestionToken, allHaveQuestionToken) {
|
|
if (someHaveQuestionToken !== allHaveQuestionToken) {
|
|
var canonicalHasQuestionToken = ts.hasQuestionToken(getCanonicalOverload(overloads, implementation));
|
|
ts.forEach(overloads, function (o) {
|
|
var deviation = ts.hasQuestionToken(o) !== canonicalHasQuestionToken;
|
|
if (deviation) {
|
|
error(o.name, ts.Diagnostics.Overload_signatures_must_all_be_optional_or_required);
|
|
}
|
|
});
|
|
}
|
|
}
|
|
var flagsToCheck = 1 /* Export */ | 2 /* Ambient */ | 32 /* Private */ | 64 /* Protected */ | 256 /* Abstract */;
|
|
var someNodeFlags = 0;
|
|
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;
|
|
}
|
|
});
|
|
if (subsequentNode) {
|
|
if (subsequentNode.kind === node.kind) {
|
|
var errorNode_1 = subsequentNode.name || subsequentNode;
|
|
// TODO(jfreeman): These are methods, so handle computed name case
|
|
if (node.name && subsequentNode.name && node.name.text === subsequentNode.name.text) {
|
|
// the only situation when this is possible (same kind\same name but different symbol) - mixed static and instance class members
|
|
ts.Debug.assert(node.kind === 140 /* MethodDeclaration */ || node.kind === 139 /* MethodSignature */);
|
|
ts.Debug.assert((node.flags & 128 /* Static */) !== (subsequentNode.flags & 128 /* Static */));
|
|
var diagnostic = node.flags & 128 /* Static */ ? ts.Diagnostics.Function_overload_must_be_static : ts.Diagnostics.Function_overload_must_not_be_static;
|
|
error(errorNode_1, diagnostic);
|
|
return;
|
|
}
|
|
else 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 (node.flags & 256 /* 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);
|
|
}
|
|
}
|
|
}
|
|
// when checking exported function declarations across modules check only duplicate implementations
|
|
// names and consistency of modifiers are verified when we check local symbol
|
|
var isExportSymbolInsideModule = symbol.parent && symbol.parent.flags & 1536 /* Module */;
|
|
var duplicateFunctionDeclaration = false;
|
|
var multipleConstructorImplementation = false;
|
|
for (var _i = 0; _i < declarations.length; _i++) {
|
|
var current = declarations[_i];
|
|
var node = current;
|
|
var inAmbientContext = ts.isInAmbientContext(node);
|
|
var inAmbientContextOrInterface = node.parent.kind === 212 /* InterfaceDeclaration */ || node.parent.kind === 152 /* 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 === 210 /* FunctionDeclaration */ || node.kind === 140 /* MethodDeclaration */ || node.kind === 139 /* MethodSignature */ || node.kind === 141 /* Constructor */) {
|
|
var currentNodeFlags = getEffectiveDeclarationFlags(node, flagsToCheck);
|
|
someNodeFlags |= currentNodeFlags;
|
|
allNodeFlags &= currentNodeFlags;
|
|
someHaveQuestionToken = someHaveQuestionToken || ts.hasQuestionToken(node);
|
|
allHaveQuestionToken = allHaveQuestionToken && ts.hasQuestionToken(node);
|
|
if (ts.nodeIsPresent(node.body) && bodyDeclaration) {
|
|
if (isConstructor) {
|
|
multipleConstructorImplementation = true;
|
|
}
|
|
else {
|
|
duplicateFunctionDeclaration = true;
|
|
}
|
|
}
|
|
else if (!isExportSymbolInsideModule && previousDeclaration && previousDeclaration.parent === node.parent && previousDeclaration.end !== node.pos) {
|
|
reportImplementationExpectedError(previousDeclaration);
|
|
}
|
|
if (ts.nodeIsPresent(node.body)) {
|
|
if (!bodyDeclaration) {
|
|
bodyDeclaration = node;
|
|
}
|
|
}
|
|
else {
|
|
hasOverloads = true;
|
|
}
|
|
previousDeclaration = node;
|
|
if (!inAmbientContextOrInterface) {
|
|
lastSeenNonAmbientDeclaration = node;
|
|
}
|
|
}
|
|
}
|
|
if (multipleConstructorImplementation) {
|
|
ts.forEach(declarations, function (declaration) {
|
|
error(declaration, ts.Diagnostics.Multiple_constructor_implementations_are_not_allowed);
|
|
});
|
|
}
|
|
if (duplicateFunctionDeclaration) {
|
|
ts.forEach(declarations, function (declaration) {
|
|
error(declaration.name, ts.Diagnostics.Duplicate_function_implementation);
|
|
});
|
|
}
|
|
// Abstract methods can't have an implementation -- in particular, they don't need one.
|
|
if (!isExportSymbolInsideModule && lastSeenNonAmbientDeclaration && !lastSeenNonAmbientDeclaration.body &&
|
|
!(lastSeenNonAmbientDeclaration.flags & 256 /* Abstract */)) {
|
|
reportImplementationExpectedError(lastSeenNonAmbientDeclaration);
|
|
}
|
|
if (hasOverloads) {
|
|
checkFlagAgreementBetweenOverloads(declarations, bodyDeclaration, flagsToCheck, someNodeFlags, allNodeFlags);
|
|
checkQuestionTokenAgreementBetweenOverloads(declarations, bodyDeclaration, someHaveQuestionToken, allHaveQuestionToken);
|
|
if (bodyDeclaration) {
|
|
var signatures = getSignaturesOfSymbol(symbol);
|
|
var bodySignature = getSignatureFromDeclaration(bodyDeclaration);
|
|
// If the implementation signature has string literals, we will have reported an error in
|
|
// checkSpecializedSignatureDeclaration
|
|
if (!bodySignature.hasStringLiterals) {
|
|
// TypeScript 1.0 spec (April 2014): 6.1
|
|
// If a function declaration includes overloads, the overloads determine the call
|
|
// signatures of the type given to the function object
|
|
// and the function implementation signature must be assignable to that type
|
|
//
|
|
// TypeScript 1.0 spec (April 2014): 3.8.4
|
|
// Note that specialized call and construct signatures (section 3.7.2.4) are not significant when determining assignment compatibility
|
|
// Consider checking against specialized signatures too. Not doing so creates a type hole:
|
|
//
|
|
// function g(x: "hi", y: boolean);
|
|
// function g(x: string, y: {});
|
|
// function g(x: string, y: string) { }
|
|
//
|
|
// The implementation is completely unrelated to the specialized signature, yet we do not check this.
|
|
for (var _a = 0; _a < signatures.length; _a++) {
|
|
var signature = signatures[_a];
|
|
if (!signature.hasStringLiterals && !isSignatureAssignableTo(bodySignature, signature)) {
|
|
error(signature.declaration, ts.Diagnostics.Overload_signature_is_not_compatible_with_function_implementation);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function checkExportsOnMergedDeclarations(node) {
|
|
if (!produceDiagnostics) {
|
|
return;
|
|
}
|
|
// Exports should be checked only if enclosing module contains both exported and non exported declarations.
|
|
// In case if all declarations are non-exported check is unnecessary.
|
|
// 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.flags & 7340032 /* Export */)) {
|
|
// 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;
|
|
}
|
|
// we use SymbolFlags.ExportValue, SymbolFlags.ExportType and SymbolFlags.ExportNamespace
|
|
// to denote disjoint declarationSpaces (without making new enum type).
|
|
var exportedDeclarationSpaces = 0;
|
|
var nonExportedDeclarationSpaces = 0;
|
|
ts.forEach(symbol.declarations, function (d) {
|
|
var declarationSpaces = getDeclarationSpaces(d);
|
|
if (getEffectiveDeclarationFlags(d, 1 /* Export */)) {
|
|
exportedDeclarationSpaces |= declarationSpaces;
|
|
}
|
|
else {
|
|
nonExportedDeclarationSpaces |= declarationSpaces;
|
|
}
|
|
});
|
|
var commonDeclarationSpace = exportedDeclarationSpaces & nonExportedDeclarationSpaces;
|
|
if (commonDeclarationSpace) {
|
|
// declaration spaces for exported and non-exported declarations intersect
|
|
ts.forEach(symbol.declarations, function (d) {
|
|
if (getDeclarationSpaces(d) & commonDeclarationSpace) {
|
|
error(d.name, ts.Diagnostics.Individual_declarations_in_merged_declaration_0_must_be_all_exported_or_all_local, ts.declarationNameToString(d.name));
|
|
}
|
|
});
|
|
}
|
|
function getDeclarationSpaces(d) {
|
|
switch (d.kind) {
|
|
case 212 /* InterfaceDeclaration */:
|
|
return 2097152 /* ExportType */;
|
|
case 215 /* ModuleDeclaration */:
|
|
return d.name.kind === 8 /* StringLiteral */ || ts.getModuleInstanceState(d) !== 0 /* NonInstantiated */
|
|
? 4194304 /* ExportNamespace */ | 1048576 /* ExportValue */
|
|
: 4194304 /* ExportNamespace */;
|
|
case 211 /* ClassDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
return 2097152 /* ExportType */ | 1048576 /* ExportValue */;
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
var result = 0;
|
|
var target = resolveAlias(getSymbolOfNode(d));
|
|
ts.forEach(target.declarations, function (d) { result |= getDeclarationSpaces(d); });
|
|
return result;
|
|
default:
|
|
return 1048576 /* ExportValue */;
|
|
}
|
|
}
|
|
}
|
|
function checkNonThenableType(type, location, message) {
|
|
if (!(type.flags & 1 /* Any */) && isTypeAssignableTo(type, getGlobalThenableType())) {
|
|
if (location) {
|
|
if (!message) {
|
|
message = ts.Diagnostics.Operand_for_await_does_not_have_a_valid_callable_then_member;
|
|
}
|
|
error(location, message);
|
|
}
|
|
return unknownType;
|
|
}
|
|
return type;
|
|
}
|
|
/**
|
|
* 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 getPromisedType(promise) {
|
|
//
|
|
// { // promise
|
|
// then( // thenFunction
|
|
// onfulfilled: ( // onfulfilledParameterType
|
|
// value: T // valueParameterType
|
|
// ) => any
|
|
// ): any;
|
|
// }
|
|
//
|
|
if (promise.flags & 1 /* Any */) {
|
|
return undefined;
|
|
}
|
|
if ((promise.flags & 4096 /* Reference */) && promise.target === tryGetGlobalPromiseType()) {
|
|
return promise.typeArguments[0];
|
|
}
|
|
var globalPromiseLikeType = getInstantiatedGlobalPromiseLikeType();
|
|
if (globalPromiseLikeType === emptyObjectType || !isTypeAssignableTo(promise, globalPromiseLikeType)) {
|
|
return undefined;
|
|
}
|
|
var thenFunction = getTypeOfPropertyOfType(promise, "then");
|
|
if (thenFunction && (thenFunction.flags & 1 /* Any */)) {
|
|
return undefined;
|
|
}
|
|
var thenSignatures = thenFunction ? getSignaturesOfType(thenFunction, 0 /* Call */) : emptyArray;
|
|
if (thenSignatures.length === 0) {
|
|
return undefined;
|
|
}
|
|
var onfulfilledParameterType = getUnionType(ts.map(thenSignatures, getTypeOfFirstParameterOfSignature));
|
|
if (onfulfilledParameterType.flags & 1 /* Any */) {
|
|
return undefined;
|
|
}
|
|
var onfulfilledParameterSignatures = getSignaturesOfType(onfulfilledParameterType, 0 /* Call */);
|
|
if (onfulfilledParameterSignatures.length === 0) {
|
|
return undefined;
|
|
}
|
|
var valueParameterType = getUnionType(ts.map(onfulfilledParameterSignatures, getTypeOfFirstParameterOfSignature));
|
|
return valueParameterType;
|
|
}
|
|
function getTypeOfFirstParameterOfSignature(signature) {
|
|
return getTypeAtPosition(signature, 0);
|
|
}
|
|
/**
|
|
* 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 getAwaitedType(type) {
|
|
return checkAwaitedType(type, undefined, undefined);
|
|
}
|
|
function checkAwaitedType(type, location, message) {
|
|
return checkAwaitedTypeWorker(type);
|
|
function checkAwaitedTypeWorker(type) {
|
|
if (type.flags & 16384 /* Union */) {
|
|
var types = [];
|
|
for (var _i = 0, _a = type.types; _i < _a.length; _i++) {
|
|
var constituentType = _a[_i];
|
|
types.push(checkAwaitedTypeWorker(constituentType));
|
|
}
|
|
return getUnionType(types);
|
|
}
|
|
else {
|
|
var promisedType = getPromisedType(type);
|
|
if (promisedType === undefined) {
|
|
// The type was not a PromiseLike, 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 will have been reported in
|
|
// the call to checkNonThenableType and we will return unknownType.
|
|
//
|
|
// An example of a non-promise "thenable" might be:
|
|
//
|
|
// await { then(): void {} }
|
|
//
|
|
// The "thenable" does not match the minimal definition for a PromiseLike. 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>.
|
|
return checkNonThenableType(type, location, message);
|
|
}
|
|
else {
|
|
if (type.id === promisedType.id || awaitedTypeStack.indexOf(promisedType.id) >= 0) {
|
|
// We have a bad actor in the form of a promise whose promised type is
|
|
// the same promise type, or a mutually recursive promise. Return the
|
|
// unknown type 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 (location) {
|
|
error(location, ts.Diagnostics._0_is_referenced_directly_or_indirectly_in_the_fulfillment_callback_of_its_own_then_method, symbolToString(type.symbol));
|
|
}
|
|
return unknownType;
|
|
}
|
|
// 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 = checkAwaitedTypeWorker(promisedType);
|
|
awaitedTypeStack.pop();
|
|
return awaitedType;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
/**
|
|
* Checks the return type of an async function to ensure it is a compatible
|
|
* Promise implementation.
|
|
* @param node The signature to check
|
|
* @param returnType The return type for the function
|
|
* @remarks
|
|
* This checks that an async function has a valid Promise-compatible return type,
|
|
* and returns the *awaited type* of the promise. 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.
|
|
*/
|
|
function checkAsyncFunctionReturnType(node) {
|
|
var globalPromiseConstructorLikeType = getGlobalPromiseConstructorLikeType();
|
|
if (globalPromiseConstructorLikeType === emptyObjectType) {
|
|
// If we couldn't resolve the global PromiseConstructorLike type we cannot verify
|
|
// compatibility with __awaiter.
|
|
return unknownType;
|
|
}
|
|
// 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>;
|
|
// }
|
|
//
|
|
// When we get the type of the `Promise` symbol here, we get the type of the static
|
|
// side of the `Promise` class, which would be `{ new <T>(...): Promise<T> }`.
|
|
var promiseType = getTypeFromTypeNode(node.type);
|
|
if (promiseType === unknownType && compilerOptions.isolatedModules) {
|
|
// If we are compiling with isolatedModules, we may not be able to resolve the
|
|
// type as a value. As such, we will just return unknownType;
|
|
return unknownType;
|
|
}
|
|
var promiseConstructor = getMergedSymbol(promiseType.symbol);
|
|
if (!promiseConstructor || !symbolIsValue(promiseConstructor)) {
|
|
error(node, ts.Diagnostics.Type_0_is_not_a_valid_async_function_return_type, typeToString(promiseType));
|
|
return unknownType;
|
|
}
|
|
// Validate the promise constructor type.
|
|
var promiseConstructorType = getTypeOfSymbol(promiseConstructor);
|
|
if (!checkTypeAssignableTo(promiseConstructorType, globalPromiseConstructorLikeType, node, ts.Diagnostics.Type_0_is_not_a_valid_async_function_return_type)) {
|
|
return unknownType;
|
|
}
|
|
// Verify there is no local declaration that could collide with the promise constructor.
|
|
var promiseName = ts.getEntityNameFromTypeNode(node.type);
|
|
var root = getFirstIdentifier(promiseName);
|
|
var rootSymbol = getSymbol(node.locals, root.text, 107455 /* Value */);
|
|
if (rootSymbol) {
|
|
error(rootSymbol.valueDeclaration, ts.Diagnostics.Duplicate_identifier_0_Compiler_uses_declaration_1_to_support_async_functions, root.text, getFullyQualifiedName(promiseConstructor));
|
|
return unknownType;
|
|
}
|
|
// Get and return the awaited type of the return type.
|
|
return checkAwaitedType(promiseType, node, ts.Diagnostics.An_async_function_or_method_must_have_a_valid_awaitable_return_type);
|
|
}
|
|
/** Check a decorator */
|
|
function checkDecorator(node) {
|
|
var signature = getResolvedSignature(node);
|
|
var returnType = getReturnTypeOfSignature(signature);
|
|
if (returnType.flags & 1 /* Any */) {
|
|
return;
|
|
}
|
|
var expectedReturnType;
|
|
var headMessage = getDiagnosticHeadMessageForDecoratorResolution(node);
|
|
var errorInfo;
|
|
switch (node.parent.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
var classSymbol = getSymbolOfNode(node.parent);
|
|
var classConstructorType = getTypeOfSymbol(classSymbol);
|
|
expectedReturnType = getUnionType([classConstructorType, voidType]);
|
|
break;
|
|
case 135 /* Parameter */:
|
|
expectedReturnType = voidType;
|
|
errorInfo = ts.chainDiagnosticMessages(errorInfo, ts.Diagnostics.The_return_type_of_a_parameter_decorator_function_must_be_either_void_or_any);
|
|
break;
|
|
case 138 /* PropertyDeclaration */:
|
|
expectedReturnType = voidType;
|
|
errorInfo = ts.chainDiagnosticMessages(errorInfo, ts.Diagnostics.The_return_type_of_a_property_decorator_function_must_be_either_void_or_any);
|
|
break;
|
|
case 140 /* MethodDeclaration */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
var methodType = getTypeOfNode(node.parent);
|
|
var descriptorType = createTypedPropertyDescriptorType(methodType);
|
|
expectedReturnType = getUnionType([descriptorType, voidType]);
|
|
break;
|
|
}
|
|
checkTypeAssignableTo(returnType, expectedReturnType, node, headMessage, errorInfo);
|
|
}
|
|
/** Checks a type reference node as an expression. */
|
|
function checkTypeNodeAsExpression(node) {
|
|
// When we are emitting type metadata for decorators, we need to try to check the type
|
|
// as if it were an expression so that we can emit the type in a value position when we
|
|
// serialize the type metadata.
|
|
if (node && node.kind === 148 /* TypeReference */) {
|
|
var root = getFirstIdentifier(node.typeName);
|
|
var rootSymbol = resolveName(root, root.text, 107455 /* Value */, undefined, undefined);
|
|
if (rootSymbol && rootSymbol.flags & 8388608 /* Alias */ && !isInTypeQuery(node) && !isConstEnumOrConstEnumOnlyModule(resolveAlias(rootSymbol))) {
|
|
markAliasSymbolAsReferenced(rootSymbol);
|
|
}
|
|
}
|
|
}
|
|
/**
|
|
* Checks the type annotation of an accessor declaration or property declaration as
|
|
* an expression if it is a type reference to a type with a value declaration.
|
|
*/
|
|
function checkTypeAnnotationAsExpression(node) {
|
|
switch (node.kind) {
|
|
case 138 /* PropertyDeclaration */:
|
|
checkTypeNodeAsExpression(node.type);
|
|
break;
|
|
case 135 /* Parameter */:
|
|
checkTypeNodeAsExpression(node.type);
|
|
break;
|
|
case 140 /* MethodDeclaration */:
|
|
checkTypeNodeAsExpression(node.type);
|
|
break;
|
|
case 142 /* GetAccessor */:
|
|
checkTypeNodeAsExpression(node.type);
|
|
break;
|
|
case 143 /* SetAccessor */:
|
|
checkTypeNodeAsExpression(ts.getSetAccessorTypeAnnotationNode(node));
|
|
break;
|
|
}
|
|
}
|
|
/** Checks the type annotation of the parameters of a function/method or the constructor of a class as expressions */
|
|
function checkParameterTypeAnnotationsAsExpressions(node) {
|
|
// ensure all type annotations with a value declaration are checked as an expression
|
|
for (var _i = 0, _a = node.parameters; _i < _a.length; _i++) {
|
|
var parameter = _a[_i];
|
|
checkTypeAnnotationAsExpression(parameter);
|
|
}
|
|
}
|
|
/** 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)) {
|
|
return;
|
|
}
|
|
if (!compilerOptions.experimentalDecorators) {
|
|
error(node, ts.Diagnostics.Experimental_support_for_decorators_is_a_feature_that_is_subject_to_change_in_a_future_release_Specify_experimentalDecorators_to_remove_this_warning);
|
|
}
|
|
if (compilerOptions.emitDecoratorMetadata) {
|
|
// we only need to perform these checks if we are emitting serialized type metadata for the target of a decorator.
|
|
switch (node.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
var constructor = ts.getFirstConstructorWithBody(node);
|
|
if (constructor) {
|
|
checkParameterTypeAnnotationsAsExpressions(constructor);
|
|
}
|
|
break;
|
|
case 140 /* MethodDeclaration */:
|
|
checkParameterTypeAnnotationsAsExpressions(node);
|
|
// fall-through
|
|
case 143 /* SetAccessor */:
|
|
case 142 /* GetAccessor */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 135 /* Parameter */:
|
|
checkTypeAnnotationAsExpression(node);
|
|
break;
|
|
}
|
|
}
|
|
emitDecorate = true;
|
|
if (node.kind === 135 /* Parameter */) {
|
|
emitParam = true;
|
|
}
|
|
ts.forEach(node.decorators, checkDecorator);
|
|
}
|
|
function checkFunctionDeclaration(node) {
|
|
if (produceDiagnostics) {
|
|
checkFunctionLikeDeclaration(node) || checkGrammarForGenerator(node);
|
|
checkCollisionWithCapturedSuperVariable(node, node.name);
|
|
checkCollisionWithCapturedThisVariable(node, node.name);
|
|
checkCollisionWithRequireExportsInGeneratedCode(node, node.name);
|
|
}
|
|
}
|
|
function checkFunctionLikeDeclaration(node) {
|
|
checkDecorators(node);
|
|
checkSignatureDeclaration(node);
|
|
var isAsync = ts.isAsyncFunctionLike(node);
|
|
if (isAsync) {
|
|
if (!compilerOptions.experimentalAsyncFunctions) {
|
|
error(node, ts.Diagnostics.Experimental_support_for_async_functions_is_a_feature_that_is_subject_to_change_in_a_future_release_Specify_experimentalAsyncFunctions_to_remove_this_warning);
|
|
}
|
|
emitAwaiter = true;
|
|
}
|
|
// 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 === 133 /* ComputedPropertyName */) {
|
|
// This check will account for methods in class/interface declarations,
|
|
// as well as accessors in classes/object literals
|
|
checkComputedPropertyName(node.name);
|
|
}
|
|
if (!ts.hasDynamicName(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;
|
|
var firstDeclaration = ts.getDeclarationOfKind(localSymbol, node.kind);
|
|
// Only type check the symbol once
|
|
if (node === firstDeclaration) {
|
|
checkFunctionOrConstructorSymbol(localSymbol);
|
|
}
|
|
if (symbol.parent) {
|
|
// run check once for the first declaration
|
|
if (ts.getDeclarationOfKind(symbol, node.kind) === node) {
|
|
// run check on export symbol to check that modifiers agree across all exported declarations
|
|
checkFunctionOrConstructorSymbol(symbol);
|
|
}
|
|
}
|
|
}
|
|
checkSourceElement(node.body);
|
|
if (node.type && !isAccessor(node.kind) && !node.asteriskToken) {
|
|
var returnType = getTypeFromTypeNode(node.type);
|
|
var promisedType;
|
|
if (isAsync) {
|
|
promisedType = checkAsyncFunctionReturnType(node);
|
|
}
|
|
checkIfNonVoidFunctionHasReturnExpressionsOrSingleThrowStatment(node, isAsync ? promisedType : returnType);
|
|
}
|
|
if (produceDiagnostics && !node.type) {
|
|
// 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 (compilerOptions.noImplicitAny && ts.nodeIsMissing(node.body) && !isPrivateWithinAmbient(node)) {
|
|
reportImplicitAnyError(node, anyType);
|
|
}
|
|
if (node.asteriskToken && ts.nodeIsPresent(node.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));
|
|
}
|
|
}
|
|
}
|
|
function checkBlock(node) {
|
|
// Grammar checking for SyntaxKind.Block
|
|
if (node.kind === 189 /* Block */) {
|
|
checkGrammarStatementInAmbientContext(node);
|
|
}
|
|
ts.forEach(node.statements, checkSourceElement);
|
|
if (ts.isFunctionBlock(node) || node.kind === 216 /* ModuleBlock */) {
|
|
checkFunctionAndClassExpressionBodies(node);
|
|
}
|
|
}
|
|
function checkCollisionWithArgumentsInGeneratedCode(node) {
|
|
// no rest parameters \ declaration context \ overload - no codegen impact
|
|
if (!ts.hasRestParameter(node) || ts.isInAmbientContext(node) || ts.nodeIsMissing(node.body)) {
|
|
return;
|
|
}
|
|
ts.forEach(node.parameters, function (p) {
|
|
if (p.name && !ts.isBindingPattern(p.name) && p.name.text === argumentsSymbol.name) {
|
|
error(p, ts.Diagnostics.Duplicate_identifier_arguments_Compiler_uses_arguments_to_initialize_rest_parameters);
|
|
}
|
|
});
|
|
}
|
|
function needCollisionCheckForIdentifier(node, identifier, name) {
|
|
if (!(identifier && identifier.text === name)) {
|
|
return false;
|
|
}
|
|
if (node.kind === 138 /* PropertyDeclaration */ ||
|
|
node.kind === 137 /* PropertySignature */ ||
|
|
node.kind === 140 /* MethodDeclaration */ ||
|
|
node.kind === 139 /* MethodSignature */ ||
|
|
node.kind === 142 /* GetAccessor */ ||
|
|
node.kind === 143 /* SetAccessor */) {
|
|
// it is ok to have member named '_super' or '_this' - member access is always qualified
|
|
return false;
|
|
}
|
|
if (ts.isInAmbientContext(node)) {
|
|
// ambient context - no codegen impact
|
|
return false;
|
|
}
|
|
var root = ts.getRootDeclaration(node);
|
|
if (root.kind === 135 /* Parameter */ && ts.nodeIsMissing(root.parent.body)) {
|
|
// just an overload - no codegen impact
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
function checkCollisionWithCapturedThisVariable(node, name) {
|
|
if (needCollisionCheckForIdentifier(node, name, "_this")) {
|
|
potentialThisCollisions.push(node);
|
|
}
|
|
}
|
|
// this function will run after checking the source file so 'CaptureThis' is correct for all nodes
|
|
function checkIfThisIsCapturedInEnclosingScope(node) {
|
|
var current = node;
|
|
while (current) {
|
|
if (getNodeCheckFlags(current) & 4 /* CaptureThis */) {
|
|
var isDeclaration_1 = node.kind !== 66 /* Identifier */;
|
|
if (isDeclaration_1) {
|
|
error(node.name, 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;
|
|
}
|
|
current = current.parent;
|
|
}
|
|
}
|
|
function checkCollisionWithCapturedSuperVariable(node, name) {
|
|
if (!needCollisionCheckForIdentifier(node, name, "_super")) {
|
|
return;
|
|
}
|
|
// bubble up and find containing type
|
|
var enclosingClass = ts.getContainingClass(node);
|
|
// if containing type was not found or it is ambient - exit (no codegen)
|
|
if (!enclosingClass || ts.isInAmbientContext(enclosingClass)) {
|
|
return;
|
|
}
|
|
if (ts.getClassExtendsHeritageClauseElement(enclosingClass)) {
|
|
var isDeclaration_2 = node.kind !== 66 /* Identifier */;
|
|
if (isDeclaration_2) {
|
|
error(node, ts.Diagnostics.Duplicate_identifier_super_Compiler_uses_super_to_capture_base_class_reference);
|
|
}
|
|
else {
|
|
error(node, ts.Diagnostics.Expression_resolves_to_super_that_compiler_uses_to_capture_base_class_reference);
|
|
}
|
|
}
|
|
}
|
|
function checkCollisionWithRequireExportsInGeneratedCode(node, name) {
|
|
if (!needCollisionCheckForIdentifier(node, name, "require") && !needCollisionCheckForIdentifier(node, name, "exports")) {
|
|
return;
|
|
}
|
|
// Uninstantiated modules shouldnt do this check
|
|
if (node.kind === 215 /* ModuleDeclaration */ && 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 === 245 /* SourceFile */ && ts.isExternalModule(parent)) {
|
|
// If the declaration happens to be in external module, report error that require and exports are reserved keywords
|
|
error(name, ts.Diagnostics.Duplicate_identifier_0_Compiler_reserves_name_1_in_top_level_scope_of_a_module, ts.declarationNameToString(name), ts.declarationNameToString(name));
|
|
}
|
|
}
|
|
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 let declarations will not
|
|
// step on a let/const variable.
|
|
// Do not consider let and const declarations, as duplicate block-scoped declarations
|
|
// are handled by the binder.
|
|
// We are only looking for let 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
|
|
// let x = 0; // symbol for this declaration will be 'symbol'
|
|
// }
|
|
// skip block-scoped variables and parameters
|
|
if ((ts.getCombinedNodeFlags(node) & 49152 /* 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 === 208 /* VariableDeclaration */ && !node.initializer) {
|
|
return;
|
|
}
|
|
var symbol = getSymbolOfNode(node);
|
|
if (symbol.flags & 1 /* FunctionScopedVariable */) {
|
|
var localDeclarationSymbol = resolveName(node, node.name.text, 3 /* Variable */, undefined, undefined);
|
|
if (localDeclarationSymbol &&
|
|
localDeclarationSymbol !== symbol &&
|
|
localDeclarationSymbol.flags & 2 /* BlockScopedVariable */) {
|
|
if (getDeclarationFlagsFromSymbol(localDeclarationSymbol) & 49152 /* BlockScoped */) {
|
|
var varDeclList = ts.getAncestor(localDeclarationSymbol.valueDeclaration, 209 /* VariableDeclarationList */);
|
|
var container = varDeclList.parent.kind === 190 /* 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 === 189 /* Block */ && ts.isFunctionLike(container.parent) ||
|
|
container.kind === 216 /* ModuleBlock */ ||
|
|
container.kind === 215 /* ModuleDeclaration */ ||
|
|
container.kind === 245 /* 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_14 = symbolToString(localDeclarationSymbol);
|
|
error(node, ts.Diagnostics.Cannot_initialize_outer_scoped_variable_0_in_the_same_scope_as_block_scoped_declaration_1, name_14, name_14);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
// Check that a parameter initializer contains no references to parameters declared to the right of itself
|
|
function checkParameterInitializer(node) {
|
|
if (ts.getRootDeclaration(node).kind !== 135 /* Parameter */) {
|
|
return;
|
|
}
|
|
var func = ts.getContainingFunction(node);
|
|
visit(node.initializer);
|
|
function visit(n) {
|
|
if (n.kind === 66 /* Identifier */) {
|
|
var referencedSymbol = getNodeLinks(n).resolvedSymbol;
|
|
// check FunctionLikeDeclaration.locals (stores parameters\function local variable)
|
|
// if it contains entry with a specified name and if this entry matches the resolved symbol
|
|
if (referencedSymbol && referencedSymbol !== unknownSymbol && getSymbol(func.locals, referencedSymbol.name, 107455 /* Value */) === referencedSymbol) {
|
|
if (referencedSymbol.valueDeclaration.kind === 135 /* Parameter */) {
|
|
if (referencedSymbol.valueDeclaration === node) {
|
|
error(n, ts.Diagnostics.Parameter_0_cannot_be_referenced_in_its_initializer, ts.declarationNameToString(node.name));
|
|
return;
|
|
}
|
|
if (referencedSymbol.valueDeclaration.pos < node.pos) {
|
|
// legal case - parameter initializer references some parameter strictly on left of current parameter declaration
|
|
return;
|
|
}
|
|
}
|
|
error(n, ts.Diagnostics.Initializer_of_parameter_0_cannot_reference_identifier_1_declared_after_it, ts.declarationNameToString(node.name), ts.declarationNameToString(n));
|
|
}
|
|
}
|
|
else {
|
|
ts.forEachChild(n, visit);
|
|
}
|
|
}
|
|
}
|
|
// Check variable, parameter, or property declaration
|
|
function checkVariableLikeDeclaration(node) {
|
|
checkDecorators(node);
|
|
checkSourceElement(node.type);
|
|
// 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 === 133 /* ComputedPropertyName */) {
|
|
checkComputedPropertyName(node.name);
|
|
if (node.initializer) {
|
|
checkExpressionCached(node.initializer);
|
|
}
|
|
}
|
|
// For a binding pattern, check contained binding elements
|
|
if (ts.isBindingPattern(node.name)) {
|
|
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.getRootDeclaration(node).kind === 135 /* Parameter */ && 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)) {
|
|
if (node.initializer) {
|
|
checkTypeAssignableTo(checkExpressionCached(node.initializer), getWidenedTypeForVariableLikeDeclaration(node), node, undefined);
|
|
checkParameterInitializer(node);
|
|
}
|
|
return;
|
|
}
|
|
var symbol = getSymbolOfNode(node);
|
|
var type = getTypeOfVariableOrParameterOrProperty(symbol);
|
|
if (node === symbol.valueDeclaration) {
|
|
// Node is the primary declaration of the symbol, just validate the initializer
|
|
if (node.initializer) {
|
|
checkTypeAssignableTo(checkExpressionCached(node.initializer), type, node, undefined);
|
|
checkParameterInitializer(node);
|
|
}
|
|
}
|
|
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 = getWidenedTypeForVariableLikeDeclaration(node);
|
|
if (type !== unknownType && declarationType !== unknownType && !isTypeIdenticalTo(type, declarationType)) {
|
|
error(node.name, ts.Diagnostics.Subsequent_variable_declarations_must_have_the_same_type_Variable_0_must_be_of_type_1_but_here_has_type_2, ts.declarationNameToString(node.name), typeToString(type), typeToString(declarationType));
|
|
}
|
|
if (node.initializer) {
|
|
checkTypeAssignableTo(checkExpressionCached(node.initializer), declarationType, node, undefined);
|
|
}
|
|
}
|
|
if (node.kind !== 138 /* PropertyDeclaration */ && node.kind !== 137 /* PropertySignature */) {
|
|
// We know we don't have a binding pattern or computed name here
|
|
checkExportsOnMergedDeclarations(node);
|
|
if (node.kind === 208 /* VariableDeclaration */ || node.kind === 160 /* BindingElement */) {
|
|
checkVarDeclaredNamesNotShadowed(node);
|
|
}
|
|
checkCollisionWithCapturedSuperVariable(node, node.name);
|
|
checkCollisionWithCapturedThisVariable(node, node.name);
|
|
checkCollisionWithRequireExportsInGeneratedCode(node, node.name);
|
|
}
|
|
}
|
|
function checkVariableDeclaration(node) {
|
|
checkGrammarVariableDeclaration(node);
|
|
return checkVariableLikeDeclaration(node);
|
|
}
|
|
function checkBindingElement(node) {
|
|
checkGrammarBindingElement(node);
|
|
return checkVariableLikeDeclaration(node);
|
|
}
|
|
function checkVariableStatement(node) {
|
|
// Grammar checking
|
|
checkGrammarDecorators(node) || checkGrammarModifiers(node) || checkGrammarVariableDeclarationList(node.declarationList) || checkGrammarForDisallowedLetOrConstStatement(node);
|
|
ts.forEach(node.declarationList.declarations, checkSourceElement);
|
|
}
|
|
function checkGrammarDisallowedModifiersOnObjectLiteralExpressionMethod(node) {
|
|
// We only disallow modifier on a method declaration if it is a property of object-literal-expression
|
|
if (node.modifiers && node.parent.kind === 162 /* ObjectLiteralExpression */) {
|
|
if (ts.isAsyncFunctionLike(node)) {
|
|
if (node.modifiers.length > 1) {
|
|
return grammarErrorOnFirstToken(node, ts.Diagnostics.Modifiers_cannot_appear_here);
|
|
}
|
|
}
|
|
else {
|
|
return grammarErrorOnFirstToken(node, ts.Diagnostics.Modifiers_cannot_appear_here);
|
|
}
|
|
}
|
|
}
|
|
function checkExpressionStatement(node) {
|
|
// Grammar checking
|
|
checkGrammarStatementInAmbientContext(node);
|
|
checkExpression(node.expression);
|
|
}
|
|
function checkIfStatement(node) {
|
|
// Grammar checking
|
|
checkGrammarStatementInAmbientContext(node);
|
|
checkExpression(node.expression);
|
|
checkSourceElement(node.thenStatement);
|
|
checkSourceElement(node.elseStatement);
|
|
}
|
|
function checkDoStatement(node) {
|
|
// Grammar checking
|
|
checkGrammarStatementInAmbientContext(node);
|
|
checkSourceElement(node.statement);
|
|
checkExpression(node.expression);
|
|
}
|
|
function checkWhileStatement(node) {
|
|
// Grammar checking
|
|
checkGrammarStatementInAmbientContext(node);
|
|
checkExpression(node.expression);
|
|
checkSourceElement(node.statement);
|
|
}
|
|
function checkForStatement(node) {
|
|
// Grammar checking
|
|
if (!checkGrammarStatementInAmbientContext(node)) {
|
|
if (node.initializer && node.initializer.kind === 209 /* VariableDeclarationList */) {
|
|
checkGrammarVariableDeclarationList(node.initializer);
|
|
}
|
|
}
|
|
if (node.initializer) {
|
|
if (node.initializer.kind === 209 /* VariableDeclarationList */) {
|
|
ts.forEach(node.initializer.declarations, checkVariableDeclaration);
|
|
}
|
|
else {
|
|
checkExpression(node.initializer);
|
|
}
|
|
}
|
|
if (node.condition)
|
|
checkExpression(node.condition);
|
|
if (node.incrementor)
|
|
checkExpression(node.incrementor);
|
|
checkSourceElement(node.statement);
|
|
}
|
|
function checkForOfStatement(node) {
|
|
checkGrammarForInOrForOfStatement(node);
|
|
// 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 === 209 /* VariableDeclarationList */) {
|
|
checkForInOrForOfVariableDeclaration(node);
|
|
}
|
|
else {
|
|
var varExpr = node.initializer;
|
|
var iteratedType = checkRightHandSideOfForOf(node.expression);
|
|
// There may be a destructuring assignment on the left side
|
|
if (varExpr.kind === 161 /* ArrayLiteralExpression */ || varExpr.kind === 162 /* 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 || unknownType);
|
|
}
|
|
else {
|
|
var leftType = checkExpression(varExpr);
|
|
checkReferenceExpression(varExpr, ts.Diagnostics.Invalid_left_hand_side_in_for_of_statement,
|
|
/*constantVariableMessage*/ ts.Diagnostics.The_left_hand_side_of_a_for_of_statement_cannot_be_a_previously_defined_constant);
|
|
// 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) {
|
|
checkTypeAssignableTo(iteratedType, leftType, varExpr, undefined);
|
|
}
|
|
}
|
|
}
|
|
checkSourceElement(node.statement);
|
|
}
|
|
function checkForInStatement(node) {
|
|
// Grammar checking
|
|
checkGrammarForInOrForOfStatement(node);
|
|
// 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 === 209 /* 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 === 161 /* ArrayLiteralExpression */ || varExpr.kind === 162 /* ObjectLiteralExpression */) {
|
|
error(varExpr, ts.Diagnostics.The_left_hand_side_of_a_for_in_statement_cannot_be_a_destructuring_pattern);
|
|
}
|
|
else if (!isTypeAnyOrAllConstituentTypesHaveKind(leftType, 258 /* StringLike */)) {
|
|
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.Invalid_left_hand_side_in_for_in_statement, ts.Diagnostics.The_left_hand_side_of_a_for_in_statement_cannot_be_a_previously_defined_constant);
|
|
}
|
|
}
|
|
var rightType = checkExpression(node.expression);
|
|
// 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 (!isTypeAnyOrAllConstituentTypesHaveKind(rightType, 80896 /* ObjectType */ | 512 /* TypeParameter */)) {
|
|
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);
|
|
}
|
|
checkSourceElement(node.statement);
|
|
}
|
|
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(rhsExpression) {
|
|
var expressionType = getTypeOfExpression(rhsExpression);
|
|
return checkIteratedTypeOrElementType(expressionType, rhsExpression, true);
|
|
}
|
|
function checkIteratedTypeOrElementType(inputType, errorNode, allowStringInput) {
|
|
if (isTypeAny(inputType)) {
|
|
return inputType;
|
|
}
|
|
if (languageVersion >= 2 /* ES6 */) {
|
|
return checkElementTypeOfIterable(inputType, errorNode);
|
|
}
|
|
if (allowStringInput) {
|
|
return checkElementTypeOfArrayOrString(inputType, errorNode);
|
|
}
|
|
if (isArrayLikeType(inputType)) {
|
|
var indexType = getIndexTypeOfType(inputType, 1 /* Number */);
|
|
if (indexType) {
|
|
return indexType;
|
|
}
|
|
}
|
|
error(errorNode, ts.Diagnostics.Type_0_is_not_an_array_type, typeToString(inputType));
|
|
return unknownType;
|
|
}
|
|
/**
|
|
* When errorNode is undefined, it means we should not report any errors.
|
|
*/
|
|
function checkElementTypeOfIterable(iterable, errorNode) {
|
|
var elementType = getElementTypeOfIterable(iterable, errorNode);
|
|
// Now even though we have extracted the iteratedType, we will have to validate that the type
|
|
// passed in is actually an Iterable.
|
|
if (errorNode && elementType) {
|
|
checkTypeAssignableTo(iterable, createIterableType(elementType), errorNode);
|
|
}
|
|
return elementType || anyType;
|
|
}
|
|
/**
|
|
* We want to treat type as an iterable, and get the type it is an iterable of. The iterable
|
|
* must have the following structure (annotated with the names of the variables below):
|
|
*
|
|
* { // iterable
|
|
* [Symbol.iterator]: { // iteratorFunction
|
|
* (): Iterator<T>
|
|
* }
|
|
* }
|
|
*
|
|
* T is the type we are after. 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 iterated 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. This is different from returning anyType, because that would signify that we have matched the
|
|
* whole pattern and that T (above) is 'any'.
|
|
*/
|
|
function getElementTypeOfIterable(type, errorNode) {
|
|
if (isTypeAny(type)) {
|
|
return undefined;
|
|
}
|
|
var typeAsIterable = type;
|
|
if (!typeAsIterable.iterableElementType) {
|
|
// As an optimization, if the type is instantiated directly using the globalIterableType (Iterable<number>),
|
|
// then just grab its type argument.
|
|
if ((type.flags & 4096 /* Reference */) && type.target === globalIterableType) {
|
|
typeAsIterable.iterableElementType = type.typeArguments[0];
|
|
}
|
|
else {
|
|
var iteratorFunction = getTypeOfPropertyOfType(type, ts.getPropertyNameForKnownSymbolName("iterator"));
|
|
if (isTypeAny(iteratorFunction)) {
|
|
return undefined;
|
|
}
|
|
var iteratorFunctionSignatures = iteratorFunction ? getSignaturesOfType(iteratorFunction, 0 /* Call */) : emptyArray;
|
|
if (iteratorFunctionSignatures.length === 0) {
|
|
if (errorNode) {
|
|
error(errorNode, ts.Diagnostics.Type_must_have_a_Symbol_iterator_method_that_returns_an_iterator);
|
|
}
|
|
return undefined;
|
|
}
|
|
typeAsIterable.iterableElementType = getElementTypeOfIterator(getUnionType(ts.map(iteratorFunctionSignatures, getReturnTypeOfSignature)), errorNode);
|
|
}
|
|
}
|
|
return typeAsIterable.iterableElementType;
|
|
}
|
|
/**
|
|
* This function has very similar logic as getElementTypeOfIterable, except that it operates on
|
|
* Iterators instead of Iterables. Here is the structure:
|
|
*
|
|
* { // iterator
|
|
* next: { // iteratorNextFunction
|
|
* (): { // iteratorNextResult
|
|
* value: T // iteratorNextValue
|
|
* }
|
|
* }
|
|
* }
|
|
*
|
|
*/
|
|
function getElementTypeOfIterator(type, errorNode) {
|
|
if (isTypeAny(type)) {
|
|
return undefined;
|
|
}
|
|
var typeAsIterator = type;
|
|
if (!typeAsIterator.iteratorElementType) {
|
|
// As an optimization, if the type is instantiated directly using the globalIteratorType (Iterator<number>),
|
|
// then just grab its type argument.
|
|
if ((type.flags & 4096 /* Reference */) && type.target === globalIteratorType) {
|
|
typeAsIterator.iteratorElementType = type.typeArguments[0];
|
|
}
|
|
else {
|
|
var iteratorNextFunction = getTypeOfPropertyOfType(type, "next");
|
|
if (isTypeAny(iteratorNextFunction)) {
|
|
return undefined;
|
|
}
|
|
var iteratorNextFunctionSignatures = iteratorNextFunction ? getSignaturesOfType(iteratorNextFunction, 0 /* Call */) : emptyArray;
|
|
if (iteratorNextFunctionSignatures.length === 0) {
|
|
if (errorNode) {
|
|
error(errorNode, ts.Diagnostics.An_iterator_must_have_a_next_method);
|
|
}
|
|
return undefined;
|
|
}
|
|
var iteratorNextResult = getUnionType(ts.map(iteratorNextFunctionSignatures, getReturnTypeOfSignature));
|
|
if (isTypeAny(iteratorNextResult)) {
|
|
return undefined;
|
|
}
|
|
var iteratorNextValue = getTypeOfPropertyOfType(iteratorNextResult, "value");
|
|
if (!iteratorNextValue) {
|
|
if (errorNode) {
|
|
error(errorNode, ts.Diagnostics.The_type_returned_by_the_next_method_of_an_iterator_must_have_a_value_property);
|
|
}
|
|
return undefined;
|
|
}
|
|
typeAsIterator.iteratorElementType = iteratorNextValue;
|
|
}
|
|
}
|
|
return typeAsIterator.iteratorElementType;
|
|
}
|
|
function getElementTypeOfIterableIterator(type) {
|
|
if (isTypeAny(type)) {
|
|
return undefined;
|
|
}
|
|
// As an optimization, if the type is instantiated directly using the globalIterableIteratorType (IterableIterator<number>),
|
|
// then just grab its type argument.
|
|
if ((type.flags & 4096 /* Reference */) && type.target === globalIterableIteratorType) {
|
|
return type.typeArguments[0];
|
|
}
|
|
return getElementTypeOfIterable(type, undefined) ||
|
|
getElementTypeOfIterator(type, undefined);
|
|
}
|
|
/**
|
|
* This function does the following steps:
|
|
* 1. Break up arrayOrStringType (possibly a union) into its string constituents and array constituents.
|
|
* 2. Take the element types of the array constituents.
|
|
* 3. Return the union of the element types, and string if there was a string constitutent.
|
|
*
|
|
* For example:
|
|
* string -> string
|
|
* number[] -> number
|
|
* string[] | number[] -> string | number
|
|
* string | number[] -> string | number
|
|
* string | string[] | number[] -> string | number
|
|
*
|
|
* It also errors if:
|
|
* 1. Some constituent is neither a string nor an array.
|
|
* 2. Some constituent is a string and target is less than ES5 (because in ES3 string is not indexable).
|
|
*/
|
|
function checkElementTypeOfArrayOrString(arrayOrStringType, errorNode) {
|
|
ts.Debug.assert(languageVersion < 2 /* ES6 */);
|
|
// After we remove all types that are StringLike, we will know if there was a string constituent
|
|
// based on whether the remaining type is the same as the initial type.
|
|
var arrayType = removeTypesFromUnionType(arrayOrStringType, 258 /* StringLike */, true, true);
|
|
var hasStringConstituent = arrayOrStringType !== arrayType;
|
|
var reportedError = false;
|
|
if (hasStringConstituent) {
|
|
if (languageVersion < 1 /* ES5 */) {
|
|
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 === emptyObjectType) {
|
|
return stringType;
|
|
}
|
|
}
|
|
if (!isArrayLikeType(arrayType)) {
|
|
if (!reportedError) {
|
|
// Which error we report depends on whether 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, we want to say that number is not an array type
|
|
// or a string type.
|
|
var diagnostic = hasStringConstituent
|
|
? ts.Diagnostics.Type_0_is_not_an_array_type
|
|
: ts.Diagnostics.Type_0_is_not_an_array_type_or_a_string_type;
|
|
error(errorNode, diagnostic, typeToString(arrayType));
|
|
}
|
|
return hasStringConstituent ? stringType : unknownType;
|
|
}
|
|
var arrayElementType = getIndexTypeOfType(arrayType, 1 /* Number */) || unknownType;
|
|
if (hasStringConstituent) {
|
|
// This is just an optimization for the case where arrayOrStringType is string | string[]
|
|
if (arrayElementType.flags & 258 /* StringLike */) {
|
|
return stringType;
|
|
}
|
|
return getUnionType([arrayElementType, stringType]);
|
|
}
|
|
return arrayElementType;
|
|
}
|
|
function checkBreakOrContinueStatement(node) {
|
|
// Grammar checking
|
|
checkGrammarStatementInAmbientContext(node) || checkGrammarBreakOrContinueStatement(node);
|
|
// TODO: Check that target label is valid
|
|
}
|
|
function isGetAccessorWithAnnotatatedSetAccessor(node) {
|
|
return !!(node.kind === 142 /* GetAccessor */ && ts.getSetAccessorTypeAnnotationNode(ts.getDeclarationOfKind(node.symbol, 143 /* SetAccessor */)));
|
|
}
|
|
function checkReturnStatement(node) {
|
|
// Grammar checking
|
|
if (!checkGrammarStatementInAmbientContext(node)) {
|
|
var functionBlock = ts.getContainingFunction(node);
|
|
if (!functionBlock) {
|
|
grammarErrorOnFirstToken(node, ts.Diagnostics.A_return_statement_can_only_be_used_within_a_function_body);
|
|
}
|
|
}
|
|
if (node.expression) {
|
|
var func = ts.getContainingFunction(node);
|
|
if (func) {
|
|
var signature = getSignatureFromDeclaration(func);
|
|
var returnType = getReturnTypeOfSignature(signature);
|
|
var exprType = checkExpressionCached(node.expression);
|
|
if (func.asteriskToken) {
|
|
// A generator does not need its return expressions checked against its return type.
|
|
// Instead, the yield expressions are checked against the element type.
|
|
// TODO: Check return expressions of generators when return type tracking is added
|
|
// for generators.
|
|
return;
|
|
}
|
|
if (func.kind === 143 /* SetAccessor */) {
|
|
error(node.expression, ts.Diagnostics.Setters_cannot_return_a_value);
|
|
}
|
|
else if (func.kind === 141 /* Constructor */) {
|
|
if (!isTypeAssignableTo(exprType, returnType)) {
|
|
error(node.expression, ts.Diagnostics.Return_type_of_constructor_signature_must_be_assignable_to_the_instance_type_of_the_class);
|
|
}
|
|
}
|
|
else if (func.type || isGetAccessorWithAnnotatatedSetAccessor(func) || signature.typePredicate) {
|
|
if (ts.isAsyncFunctionLike(func)) {
|
|
var promisedType = getPromisedType(returnType);
|
|
var awaitedType = checkAwaitedType(exprType, node.expression, ts.Diagnostics.Return_expression_in_async_function_does_not_have_a_valid_callable_then_member);
|
|
checkTypeAssignableTo(awaitedType, promisedType, node.expression);
|
|
}
|
|
else {
|
|
checkTypeAssignableTo(exprType, returnType, node.expression);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function checkWithStatement(node) {
|
|
// Grammar checking for withStatement
|
|
if (!checkGrammarStatementInAmbientContext(node)) {
|
|
if (node.parserContextFlags & 8 /* Await */) {
|
|
grammarErrorOnFirstToken(node, ts.Diagnostics.with_statements_are_not_allowed_in_an_async_function_block);
|
|
}
|
|
}
|
|
checkExpression(node.expression);
|
|
error(node.expression, ts.Diagnostics.All_symbols_within_a_with_block_will_be_resolved_to_any);
|
|
}
|
|
function checkSwitchStatement(node) {
|
|
// Grammar checking
|
|
checkGrammarStatementInAmbientContext(node);
|
|
var firstDefaultClause;
|
|
var hasDuplicateDefaultClause = false;
|
|
var expressionType = checkExpression(node.expression);
|
|
ts.forEach(node.caseBlock.clauses, function (clause) {
|
|
// Grammar check for duplicate default clauses, skip if we already report duplicate default clause
|
|
if (clause.kind === 239 /* DefaultClause */ && !hasDuplicateDefaultClause) {
|
|
if (firstDefaultClause === undefined) {
|
|
firstDefaultClause = clause;
|
|
}
|
|
else {
|
|
var sourceFile = ts.getSourceFileOfNode(node);
|
|
var start = ts.skipTrivia(sourceFile.text, clause.pos);
|
|
var end = clause.statements.length > 0 ? clause.statements[0].pos : clause.end;
|
|
grammarErrorAtPos(sourceFile, start, end - start, ts.Diagnostics.A_default_clause_cannot_appear_more_than_once_in_a_switch_statement);
|
|
hasDuplicateDefaultClause = true;
|
|
}
|
|
}
|
|
if (produceDiagnostics && clause.kind === 238 /* CaseClause */) {
|
|
var caseClause = clause;
|
|
// TypeScript 1.0 spec (April 2014):5.9
|
|
// In a 'switch' statement, each 'case' expression must be of a type that is assignable to or from the type of the 'switch' expression.
|
|
var caseType = checkExpression(caseClause.expression);
|
|
if (!isTypeAssignableTo(expressionType, caseType)) {
|
|
// check 'expressionType isAssignableTo caseType' failed, try the reversed check and report errors if it fails
|
|
checkTypeAssignableTo(caseType, expressionType, caseClause.expression, undefined);
|
|
}
|
|
}
|
|
ts.forEach(clause.statements, checkSourceElement);
|
|
});
|
|
}
|
|
function checkLabeledStatement(node) {
|
|
// Grammar checking
|
|
if (!checkGrammarStatementInAmbientContext(node)) {
|
|
var current = node.parent;
|
|
while (current) {
|
|
if (ts.isFunctionLike(current)) {
|
|
break;
|
|
}
|
|
if (current.kind === 204 /* LabeledStatement */ && current.label.text === node.label.text) {
|
|
var sourceFile = ts.getSourceFileOfNode(node);
|
|
grammarErrorOnNode(node.label, ts.Diagnostics.Duplicate_label_0, ts.getTextOfNodeFromSourceText(sourceFile.text, node.label));
|
|
break;
|
|
}
|
|
current = current.parent;
|
|
}
|
|
}
|
|
// ensure that label is unique
|
|
checkSourceElement(node.statement);
|
|
}
|
|
function checkThrowStatement(node) {
|
|
// Grammar checking
|
|
if (!checkGrammarStatementInAmbientContext(node)) {
|
|
if (node.expression === undefined) {
|
|
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) {
|
|
if (catchClause.variableDeclaration.name.kind !== 66 /* Identifier */) {
|
|
grammarErrorOnFirstToken(catchClause.variableDeclaration.name, ts.Diagnostics.Catch_clause_variable_name_must_be_an_identifier);
|
|
}
|
|
else if (catchClause.variableDeclaration.type) {
|
|
grammarErrorOnFirstToken(catchClause.variableDeclaration.type, ts.Diagnostics.Catch_clause_variable_cannot_have_a_type_annotation);
|
|
}
|
|
else if (catchClause.variableDeclaration.initializer) {
|
|
grammarErrorOnFirstToken(catchClause.variableDeclaration.initializer, ts.Diagnostics.Catch_clause_variable_cannot_have_an_initializer);
|
|
}
|
|
else {
|
|
var identifierName = catchClause.variableDeclaration.name.text;
|
|
var locals = catchClause.block.locals;
|
|
if (locals && ts.hasProperty(locals, identifierName)) {
|
|
var localSymbol = locals[identifierName];
|
|
if (localSymbol && (localSymbol.flags & 2 /* BlockScopedVariable */) !== 0) {
|
|
grammarErrorOnNode(localSymbol.valueDeclaration, ts.Diagnostics.Cannot_redeclare_identifier_0_in_catch_clause, identifierName);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
checkBlock(catchClause.block);
|
|
}
|
|
if (node.finallyBlock) {
|
|
checkBlock(node.finallyBlock);
|
|
}
|
|
}
|
|
function checkIndexConstraints(type) {
|
|
var declaredNumberIndexer = getIndexDeclarationOfSymbol(type.symbol, 1 /* Number */);
|
|
var declaredStringIndexer = getIndexDeclarationOfSymbol(type.symbol, 0 /* String */);
|
|
var stringIndexType = getIndexTypeOfType(type, 0 /* String */);
|
|
var numberIndexType = getIndexTypeOfType(type, 1 /* Number */);
|
|
if (stringIndexType || numberIndexType) {
|
|
ts.forEach(getPropertiesOfObjectType(type), function (prop) {
|
|
var propType = getTypeOfSymbol(prop);
|
|
checkIndexConstraintForProperty(prop, propType, type, declaredStringIndexer, stringIndexType, 0 /* String */);
|
|
checkIndexConstraintForProperty(prop, propType, type, declaredNumberIndexer, numberIndexType, 1 /* Number */);
|
|
});
|
|
if (type.flags & 1024 /* Class */ && ts.isClassLike(type.symbol.valueDeclaration)) {
|
|
var classDeclaration = type.symbol.valueDeclaration;
|
|
for (var _i = 0, _a = classDeclaration.members; _i < _a.length; _i++) {
|
|
var member = _a[_i];
|
|
// 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 (!(member.flags & 128 /* Static */) && ts.hasDynamicName(member)) {
|
|
var propType = getTypeOfSymbol(member.symbol);
|
|
checkIndexConstraintForProperty(member.symbol, propType, type, declaredStringIndexer, stringIndexType, 0 /* String */);
|
|
checkIndexConstraintForProperty(member.symbol, propType, type, declaredNumberIndexer, numberIndexType, 1 /* Number */);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
var errorNode;
|
|
if (stringIndexType && numberIndexType) {
|
|
errorNode = declaredNumberIndexer || declaredStringIndexer;
|
|
// condition 'errorNode === undefined' may appear if types does not declare nor string neither number indexer
|
|
if (!errorNode && (type.flags & 2048 /* Interface */)) {
|
|
var someBaseTypeHasBothIndexers = ts.forEach(getBaseTypes(type), function (base) { return getIndexTypeOfType(base, 0 /* String */) && getIndexTypeOfType(base, 1 /* Number */); });
|
|
errorNode = someBaseTypeHasBothIndexers ? undefined : type.symbol.declarations[0];
|
|
}
|
|
}
|
|
if (errorNode && !isTypeAssignableTo(numberIndexType, stringIndexType)) {
|
|
error(errorNode, ts.Diagnostics.Numeric_index_type_0_is_not_assignable_to_string_index_type_1, typeToString(numberIndexType), typeToString(stringIndexType));
|
|
}
|
|
function checkIndexConstraintForProperty(prop, propertyType, containingType, indexDeclaration, indexType, indexKind) {
|
|
if (!indexType) {
|
|
return;
|
|
}
|
|
// index is numeric and property name is not valid numeric literal
|
|
if (indexKind === 1 /* Number */ && !isNumericName(prop.valueDeclaration.name)) {
|
|
return;
|
|
}
|
|
// perform property check if property or indexer is declared in 'type'
|
|
// this allows to rule out cases when both property and indexer are inherited from the base class
|
|
var errorNode;
|
|
if (prop.valueDeclaration.name.kind === 133 /* ComputedPropertyName */ || prop.parent === containingType.symbol) {
|
|
errorNode = prop.valueDeclaration;
|
|
}
|
|
else if (indexDeclaration) {
|
|
errorNode = indexDeclaration;
|
|
}
|
|
else if (containingType.flags & 2048 /* Interface */) {
|
|
// for interfaces property and indexer might be inherited from different bases
|
|
// check if any base class already has both property and indexer.
|
|
// check should be performed only if 'type' is the first type that brings property\indexer together
|
|
var someBaseClassHasBothPropertyAndIndexer = ts.forEach(getBaseTypes(containingType), function (base) { return getPropertyOfObjectType(base, prop.name) && getIndexTypeOfType(base, indexKind); });
|
|
errorNode = someBaseClassHasBothPropertyAndIndexer ? undefined : containingType.symbol.declarations[0];
|
|
}
|
|
if (errorNode && !isTypeAssignableTo(propertyType, indexType)) {
|
|
var errorMessage = indexKind === 0 /* String */
|
|
? ts.Diagnostics.Property_0_of_type_1_is_not_assignable_to_string_index_type_2
|
|
: ts.Diagnostics.Property_0_of_type_1_is_not_assignable_to_numeric_index_type_2;
|
|
error(errorNode, errorMessage, symbolToString(prop), typeToString(propertyType), typeToString(indexType));
|
|
}
|
|
}
|
|
}
|
|
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.text) {
|
|
case "any":
|
|
case "number":
|
|
case "boolean":
|
|
case "string":
|
|
case "symbol":
|
|
case "void":
|
|
error(name, message, name.text);
|
|
}
|
|
}
|
|
// Check each type parameter and check that list has no duplicate type parameter declarations
|
|
function checkTypeParameters(typeParameterDeclarations) {
|
|
if (typeParameterDeclarations) {
|
|
for (var i = 0, n = typeParameterDeclarations.length; i < n; i++) {
|
|
var node = typeParameterDeclarations[i];
|
|
checkTypeParameter(node);
|
|
if (produceDiagnostics) {
|
|
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));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function checkClassExpression(node) {
|
|
checkClassLikeDeclaration(node);
|
|
return getTypeOfSymbol(getSymbolOfNode(node));
|
|
}
|
|
function checkClassDeclaration(node) {
|
|
if (!node.name && !(node.flags & 1024 /* Default */)) {
|
|
grammarErrorOnFirstToken(node, ts.Diagnostics.A_class_declaration_without_the_default_modifier_must_have_a_name);
|
|
}
|
|
checkClassLikeDeclaration(node);
|
|
// Interfaces cannot be merged with non-ambient classes.
|
|
if (getSymbolOfNode(node).flags & 64 /* Interface */ && !ts.isInAmbientContext(node)) {
|
|
error(node, ts.Diagnostics.Only_an_ambient_class_can_be_merged_with_an_interface);
|
|
}
|
|
ts.forEach(node.members, checkSourceElement);
|
|
}
|
|
function checkClassLikeDeclaration(node) {
|
|
checkGrammarClassDeclarationHeritageClauses(node);
|
|
checkDecorators(node);
|
|
if (node.name) {
|
|
checkTypeNameIsReserved(node.name, ts.Diagnostics.Class_name_cannot_be_0);
|
|
checkCollisionWithCapturedThisVariable(node, node.name);
|
|
checkCollisionWithRequireExportsInGeneratedCode(node, node.name);
|
|
}
|
|
checkTypeParameters(node.typeParameters);
|
|
checkExportsOnMergedDeclarations(node);
|
|
var symbol = getSymbolOfNode(node);
|
|
var type = getDeclaredTypeOfSymbol(symbol);
|
|
var staticType = getTypeOfSymbol(symbol);
|
|
var baseTypeNode = ts.getClassExtendsHeritageClauseElement(node);
|
|
if (baseTypeNode) {
|
|
emitExtends = emitExtends || !ts.isInAmbientContext(node);
|
|
var baseTypes = getBaseTypes(type);
|
|
if (baseTypes.length && produceDiagnostics) {
|
|
var baseType = baseTypes[0];
|
|
var staticBaseType = getBaseConstructorTypeOfClass(type);
|
|
if (baseTypeNode.typeArguments) {
|
|
ts.forEach(baseTypeNode.typeArguments, checkSourceElement);
|
|
for (var _i = 0, _a = getConstructorsForTypeArguments(staticBaseType, baseTypeNode.typeArguments); _i < _a.length; _i++) {
|
|
var constructor = _a[_i];
|
|
if (!checkTypeArgumentConstraints(constructor.typeParameters, baseTypeNode.typeArguments)) {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
checkTypeAssignableTo(type, baseType, node.name || node, ts.Diagnostics.Class_0_incorrectly_extends_base_class_1);
|
|
checkTypeAssignableTo(staticType, getTypeWithoutSignatures(staticBaseType), node.name || node, ts.Diagnostics.Class_static_side_0_incorrectly_extends_base_class_static_side_1);
|
|
if (!(staticBaseType.symbol && staticBaseType.symbol.flags & 32 /* Class */)) {
|
|
// 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. We can simply compare the type
|
|
// references (as opposed to checking the structure of the types) because elsewhere we have already checked
|
|
// that the base type is a class or interface type (and not, for example, an anonymous object type).
|
|
var constructors = getInstantiatedConstructorsForTypeArguments(staticBaseType, baseTypeNode.typeArguments);
|
|
if (ts.forEach(constructors, function (sig) { return getReturnTypeOfSignature(sig) !== baseType; })) {
|
|
error(baseTypeNode.expression, ts.Diagnostics.Base_constructors_must_all_have_the_same_return_type);
|
|
}
|
|
}
|
|
checkKindsOfPropertyMemberOverrides(type, baseType);
|
|
}
|
|
}
|
|
var implementedTypeNodes = ts.getClassImplementsHeritageClauseElements(node);
|
|
if (implementedTypeNodes) {
|
|
ts.forEach(implementedTypeNodes, function (typeRefNode) {
|
|
if (!ts.isSupportedExpressionWithTypeArguments(typeRefNode)) {
|
|
error(typeRefNode.expression, ts.Diagnostics.A_class_can_only_implement_an_identifier_Slashqualified_name_with_optional_type_arguments);
|
|
}
|
|
checkTypeReferenceNode(typeRefNode);
|
|
if (produceDiagnostics) {
|
|
var t = getTypeFromTypeNode(typeRefNode);
|
|
if (t !== unknownType) {
|
|
var declaredType = (t.flags & 4096 /* Reference */) ? t.target : t;
|
|
if (declaredType.flags & (1024 /* Class */ | 2048 /* Interface */)) {
|
|
checkTypeAssignableTo(type, t, node.name || node, ts.Diagnostics.Class_0_incorrectly_implements_interface_1);
|
|
}
|
|
else {
|
|
error(typeRefNode, ts.Diagnostics.A_class_may_only_implement_another_class_or_interface);
|
|
}
|
|
}
|
|
}
|
|
});
|
|
}
|
|
if (produceDiagnostics) {
|
|
checkIndexConstraints(type);
|
|
checkTypeForDuplicateIndexSignatures(node);
|
|
}
|
|
}
|
|
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 s.flags & 16777216 /* Instantiated */ ? getSymbolLinks(s).target : s;
|
|
}
|
|
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.
|
|
// NOTE: assignability is checked in checkClassDeclaration
|
|
var baseProperties = getPropertiesOfObjectType(baseType);
|
|
for (var _i = 0; _i < baseProperties.length; _i++) {
|
|
var baseProperty = baseProperties[_i];
|
|
var base = getTargetSymbol(baseProperty);
|
|
if (base.flags & 134217728 /* Prototype */) {
|
|
continue;
|
|
}
|
|
var derived = getTargetSymbol(getPropertyOfObjectType(type, base.name));
|
|
var baseDeclarationFlags = getDeclarationFlagsFromSymbol(base);
|
|
ts.Debug.assert(!!derived, "derived should point to something, even if it is the base class' declaration.");
|
|
if (derived) {
|
|
// In order to resolve whether the inherited method was overriden 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.getDeclarationOfKind(type.symbol, 211 /* ClassDeclaration */);
|
|
// 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 & 256 /* Abstract */ && (!derivedClassDecl || !(derivedClassDecl.flags & 256 /* Abstract */))) {
|
|
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 = getDeclarationFlagsFromSymbol(derived);
|
|
if ((baseDeclarationFlags & 32 /* Private */) || (derivedDeclarationFlags & 32 /* Private */)) {
|
|
// either base or derived property is private - not override, skip it
|
|
continue;
|
|
}
|
|
if ((baseDeclarationFlags & 128 /* Static */) !== (derivedDeclarationFlags & 128 /* Static */)) {
|
|
// value of 'static' is not the same for properties - not override, skip it
|
|
continue;
|
|
}
|
|
if ((base.flags & derived.flags & 8192 /* Method */) || ((base.flags & 98308 /* PropertyOrAccessor */) && (derived.flags & 98308 /* PropertyOrAccessor */))) {
|
|
// method is overridden with method or property/accessor is overridden with property/accessor - correct case
|
|
continue;
|
|
}
|
|
var errorMessage = void 0;
|
|
if (base.flags & 8192 /* Method */) {
|
|
if (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 {
|
|
ts.Debug.assert((derived.flags & 4 /* Property */) !== 0);
|
|
errorMessage = ts.Diagnostics.Class_0_defines_instance_member_function_1_but_extended_class_2_defines_it_as_instance_member_property;
|
|
}
|
|
}
|
|
else if (base.flags & 4 /* Property */) {
|
|
ts.Debug.assert((derived.flags & 8192 /* Method */) !== 0);
|
|
errorMessage = ts.Diagnostics.Class_0_defines_instance_member_property_1_but_extended_class_2_defines_it_as_instance_member_function;
|
|
}
|
|
else {
|
|
ts.Debug.assert((base.flags & 98304 /* Accessor */) !== 0);
|
|
ts.Debug.assert((derived.flags & 8192 /* Method */) !== 0);
|
|
errorMessage = ts.Diagnostics.Class_0_defines_instance_member_accessor_1_but_extended_class_2_defines_it_as_instance_member_function;
|
|
}
|
|
error(derived.valueDeclaration.name, errorMessage, typeToString(baseType), symbolToString(base), typeToString(type));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function isAccessor(kind) {
|
|
return kind === 142 /* GetAccessor */ || kind === 143 /* SetAccessor */;
|
|
}
|
|
function areTypeParametersIdentical(list1, list2) {
|
|
if (!list1 && !list2) {
|
|
return true;
|
|
}
|
|
if (!list1 || !list2 || list1.length !== list2.length) {
|
|
return false;
|
|
}
|
|
// TypeScript 1.0 spec (April 2014):
|
|
// When a generic interface has multiple declarations, all declarations must have identical type parameter
|
|
// lists, i.e. identical type parameter names with identical constraints in identical order.
|
|
for (var i = 0, len = list1.length; i < len; i++) {
|
|
var tp1 = list1[i];
|
|
var tp2 = list2[i];
|
|
if (tp1.name.text !== tp2.name.text) {
|
|
return false;
|
|
}
|
|
if (!tp1.constraint && !tp2.constraint) {
|
|
continue;
|
|
}
|
|
if (!tp1.constraint || !tp2.constraint) {
|
|
return false;
|
|
}
|
|
if (!isTypeIdenticalTo(getTypeFromTypeNode(tp1.constraint), getTypeFromTypeNode(tp2.constraint))) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
function checkInheritedPropertiesAreIdentical(type, typeNode) {
|
|
var baseTypes = getBaseTypes(type);
|
|
if (baseTypes.length < 2) {
|
|
return true;
|
|
}
|
|
var seen = {};
|
|
ts.forEach(resolveDeclaredMembers(type).declaredProperties, function (p) { seen[p.name] = { prop: p, containingType: type }; });
|
|
var ok = true;
|
|
for (var _i = 0; _i < baseTypes.length; _i++) {
|
|
var base = baseTypes[_i];
|
|
var properties = getPropertiesOfObjectType(base);
|
|
for (var _a = 0; _a < properties.length; _a++) {
|
|
var prop = properties[_a];
|
|
if (!ts.hasProperty(seen, prop.name)) {
|
|
seen[prop.name] = { prop: prop, containingType: base };
|
|
}
|
|
else {
|
|
var existing = seen[prop.name];
|
|
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(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 checkInterfaceDeclaration(node) {
|
|
// Grammar checking
|
|
checkGrammarDecorators(node) || checkGrammarModifiers(node) || checkGrammarInterfaceDeclaration(node);
|
|
checkTypeParameters(node.typeParameters);
|
|
if (produceDiagnostics) {
|
|
checkTypeNameIsReserved(node.name, ts.Diagnostics.Interface_name_cannot_be_0);
|
|
checkExportsOnMergedDeclarations(node);
|
|
var symbol = getSymbolOfNode(node);
|
|
var firstInterfaceDecl = ts.getDeclarationOfKind(symbol, 212 /* InterfaceDeclaration */);
|
|
if (symbol.declarations.length > 1) {
|
|
if (node !== firstInterfaceDecl && !areTypeParametersIdentical(firstInterfaceDecl.typeParameters, node.typeParameters)) {
|
|
error(node.name, ts.Diagnostics.All_declarations_of_an_interface_must_have_identical_type_parameters);
|
|
}
|
|
}
|
|
// Only check this symbol once
|
|
if (node === firstInterfaceDecl) {
|
|
var type = getDeclaredTypeOfSymbol(symbol);
|
|
// run subsequent checks only if first set succeeded
|
|
if (checkInheritedPropertiesAreIdentical(type, node.name)) {
|
|
ts.forEach(getBaseTypes(type), function (baseType) {
|
|
checkTypeAssignableTo(type, baseType, node.name, ts.Diagnostics.Interface_0_incorrectly_extends_interface_1);
|
|
});
|
|
checkIndexConstraints(type);
|
|
}
|
|
}
|
|
// Interfaces cannot merge with non-ambient classes.
|
|
if (symbol && symbol.declarations) {
|
|
for (var _i = 0, _a = symbol.declarations; _i < _a.length; _i++) {
|
|
var declaration = _a[_i];
|
|
if (declaration.kind === 211 /* ClassDeclaration */ && !ts.isInAmbientContext(declaration)) {
|
|
error(node, ts.Diagnostics.Only_an_ambient_class_can_be_merged_with_an_interface);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
ts.forEach(ts.getInterfaceBaseTypeNodes(node), function (heritageElement) {
|
|
if (!ts.isSupportedExpressionWithTypeArguments(heritageElement)) {
|
|
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);
|
|
}
|
|
}
|
|
function checkTypeAliasDeclaration(node) {
|
|
// Grammar checking
|
|
checkGrammarDecorators(node) || checkGrammarModifiers(node);
|
|
checkTypeNameIsReserved(node.name, ts.Diagnostics.Type_alias_name_cannot_be_0);
|
|
checkSourceElement(node.type);
|
|
}
|
|
function computeEnumMemberValues(node) {
|
|
var nodeLinks = getNodeLinks(node);
|
|
if (!(nodeLinks.flags & 8192 /* EnumValuesComputed */)) {
|
|
var enumSymbol = getSymbolOfNode(node);
|
|
var enumType = getDeclaredTypeOfSymbol(enumSymbol);
|
|
var autoValue = 0;
|
|
var ambient = ts.isInAmbientContext(node);
|
|
var enumIsConst = ts.isConst(node);
|
|
ts.forEach(node.members, function (member) {
|
|
if (member.name.kind !== 133 /* ComputedPropertyName */ && isNumericLiteralName(member.name.text)) {
|
|
error(member.name, ts.Diagnostics.An_enum_member_cannot_have_a_numeric_name);
|
|
}
|
|
var initializer = member.initializer;
|
|
if (initializer) {
|
|
autoValue = getConstantValueForEnumMemberInitializer(initializer);
|
|
if (autoValue === undefined) {
|
|
if (enumIsConst) {
|
|
error(initializer, ts.Diagnostics.In_const_enum_declarations_member_initializer_must_be_constant_expression);
|
|
}
|
|
else if (!ambient) {
|
|
// Only here do we need to check that the initializer is assignable to the enum type.
|
|
// If it is a constant value (not undefined), it is syntactically constrained to be a number.
|
|
// Also, we do not need to check this for ambients because there is already
|
|
// a syntax error if it is not a constant.
|
|
checkTypeAssignableTo(checkExpression(initializer), enumType, initializer, undefined);
|
|
}
|
|
}
|
|
else if (enumIsConst) {
|
|
if (isNaN(autoValue)) {
|
|
error(initializer, ts.Diagnostics.const_enum_member_initializer_was_evaluated_to_disallowed_value_NaN);
|
|
}
|
|
else if (!isFinite(autoValue)) {
|
|
error(initializer, ts.Diagnostics.const_enum_member_initializer_was_evaluated_to_a_non_finite_value);
|
|
}
|
|
}
|
|
}
|
|
else if (ambient && !enumIsConst) {
|
|
autoValue = undefined;
|
|
}
|
|
if (autoValue !== undefined) {
|
|
getNodeLinks(member).enumMemberValue = autoValue++;
|
|
}
|
|
});
|
|
nodeLinks.flags |= 8192 /* EnumValuesComputed */;
|
|
}
|
|
function getConstantValueForEnumMemberInitializer(initializer) {
|
|
return evalConstant(initializer);
|
|
function evalConstant(e) {
|
|
switch (e.kind) {
|
|
case 176 /* PrefixUnaryExpression */:
|
|
var value = evalConstant(e.operand);
|
|
if (value === undefined) {
|
|
return undefined;
|
|
}
|
|
switch (e.operator) {
|
|
case 34 /* PlusToken */: return value;
|
|
case 35 /* MinusToken */: return -value;
|
|
case 48 /* TildeToken */: return ~value;
|
|
}
|
|
return undefined;
|
|
case 178 /* BinaryExpression */:
|
|
var left = evalConstant(e.left);
|
|
if (left === undefined) {
|
|
return undefined;
|
|
}
|
|
var right = evalConstant(e.right);
|
|
if (right === undefined) {
|
|
return undefined;
|
|
}
|
|
switch (e.operatorToken.kind) {
|
|
case 45 /* BarToken */: return left | right;
|
|
case 44 /* AmpersandToken */: return left & right;
|
|
case 42 /* GreaterThanGreaterThanToken */: return left >> right;
|
|
case 43 /* GreaterThanGreaterThanGreaterThanToken */: return left >>> right;
|
|
case 41 /* LessThanLessThanToken */: return left << right;
|
|
case 46 /* CaretToken */: return left ^ right;
|
|
case 36 /* AsteriskToken */: return left * right;
|
|
case 37 /* SlashToken */: return left / right;
|
|
case 34 /* PlusToken */: return left + right;
|
|
case 35 /* MinusToken */: return left - right;
|
|
case 38 /* PercentToken */: return left % right;
|
|
}
|
|
return undefined;
|
|
case 7 /* NumericLiteral */:
|
|
return +e.text;
|
|
case 169 /* ParenthesizedExpression */:
|
|
return evalConstant(e.expression);
|
|
case 66 /* Identifier */:
|
|
case 164 /* ElementAccessExpression */:
|
|
case 163 /* PropertyAccessExpression */:
|
|
var member = initializer.parent;
|
|
var currentType = getTypeOfSymbol(getSymbolOfNode(member.parent));
|
|
var enumType;
|
|
var propertyName;
|
|
if (e.kind === 66 /* Identifier */) {
|
|
// unqualified names can refer to member that reside in different declaration of the enum so just doing name resolution won't work.
|
|
// instead pick current enum type and later try to fetch member from the type
|
|
enumType = currentType;
|
|
propertyName = e.text;
|
|
}
|
|
else {
|
|
var expression;
|
|
if (e.kind === 164 /* ElementAccessExpression */) {
|
|
if (e.argumentExpression === undefined ||
|
|
e.argumentExpression.kind !== 8 /* StringLiteral */) {
|
|
return undefined;
|
|
}
|
|
expression = e.expression;
|
|
propertyName = e.argumentExpression.text;
|
|
}
|
|
else {
|
|
expression = e.expression;
|
|
propertyName = e.name.text;
|
|
}
|
|
// expression part in ElementAccess\PropertyAccess should be either identifier or dottedName
|
|
var current = expression;
|
|
while (current) {
|
|
if (current.kind === 66 /* Identifier */) {
|
|
break;
|
|
}
|
|
else if (current.kind === 163 /* PropertyAccessExpression */) {
|
|
current = current.expression;
|
|
}
|
|
else {
|
|
return undefined;
|
|
}
|
|
}
|
|
enumType = checkExpression(expression);
|
|
// allow references to constant members of other enums
|
|
if (!(enumType.symbol && (enumType.symbol.flags & 384 /* Enum */))) {
|
|
return undefined;
|
|
}
|
|
}
|
|
if (propertyName === undefined) {
|
|
return undefined;
|
|
}
|
|
var property = getPropertyOfObjectType(enumType, propertyName);
|
|
if (!property || !(property.flags & 8 /* EnumMember */)) {
|
|
return undefined;
|
|
}
|
|
var propertyDecl = property.valueDeclaration;
|
|
// self references are illegal
|
|
if (member === propertyDecl) {
|
|
return undefined;
|
|
}
|
|
// illegal case: forward reference
|
|
if (!isDefinedBefore(propertyDecl, member)) {
|
|
return undefined;
|
|
}
|
|
return getNodeLinks(propertyDecl).enumMemberValue;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function checkEnumDeclaration(node) {
|
|
if (!produceDiagnostics) {
|
|
return;
|
|
}
|
|
// Grammar checking
|
|
checkGrammarDecorators(node) || checkGrammarModifiers(node) || checkGrammarEnumDeclaration(node);
|
|
checkTypeNameIsReserved(node.name, ts.Diagnostics.Enum_name_cannot_be_0);
|
|
checkCollisionWithCapturedThisVariable(node, node.name);
|
|
checkCollisionWithRequireExportsInGeneratedCode(node, node.name);
|
|
checkExportsOnMergedDeclarations(node);
|
|
computeEnumMemberValues(node);
|
|
var enumIsConst = ts.isConst(node);
|
|
if (compilerOptions.isolatedModules && enumIsConst && ts.isInAmbientContext(node)) {
|
|
error(node.name, ts.Diagnostics.Ambient_const_enums_are_not_allowed_when_the_isolatedModules_flag_is_provided);
|
|
}
|
|
// 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.length > 1) {
|
|
// check that const is placed\omitted on all enum declarations
|
|
ts.forEach(enumSymbol.declarations, function (decl) {
|
|
if (ts.isConstEnumDeclaration(decl) !== enumIsConst) {
|
|
error(decl.name, ts.Diagnostics.Enum_declarations_must_all_be_const_or_non_const);
|
|
}
|
|
});
|
|
}
|
|
var seenEnumMissingInitialInitializer = false;
|
|
ts.forEach(enumSymbol.declarations, function (declaration) {
|
|
// return true if we hit a violation of the rule, false otherwise
|
|
if (declaration.kind !== 214 /* EnumDeclaration */) {
|
|
return false;
|
|
}
|
|
var enumDeclaration = declaration;
|
|
if (!enumDeclaration.members.length) {
|
|
return false;
|
|
}
|
|
var firstEnumMember = enumDeclaration.members[0];
|
|
if (!firstEnumMember.initializer) {
|
|
if (seenEnumMissingInitialInitializer) {
|
|
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 = true;
|
|
}
|
|
}
|
|
});
|
|
}
|
|
}
|
|
function getFirstNonAmbientClassOrFunctionDeclaration(symbol) {
|
|
var declarations = symbol.declarations;
|
|
for (var _i = 0; _i < declarations.length; _i++) {
|
|
var declaration = declarations[_i];
|
|
if ((declaration.kind === 211 /* ClassDeclaration */ ||
|
|
(declaration.kind === 210 /* FunctionDeclaration */ && ts.nodeIsPresent(declaration.body))) &&
|
|
!ts.isInAmbientContext(declaration)) {
|
|
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 isAmbientExternalModule = node.name.kind === 8 /* StringLiteral */;
|
|
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 (!checkGrammarDecorators(node) && !checkGrammarModifiers(node)) {
|
|
if (!ts.isInAmbientContext(node) && node.name.kind === 8 /* StringLiteral */) {
|
|
grammarErrorOnNode(node.name, ts.Diagnostics.Only_ambient_modules_can_use_quoted_names);
|
|
}
|
|
}
|
|
checkCollisionWithCapturedThisVariable(node, node.name);
|
|
checkCollisionWithRequireExportsInGeneratedCode(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 */
|
|
&& symbol.declarations.length > 1
|
|
&& !ts.isInAmbientContext(node)
|
|
&& ts.isInstantiatedModule(node, compilerOptions.preserveConstEnums || compilerOptions.isolatedModules)) {
|
|
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, 211 /* ClassDeclaration */);
|
|
if (mergedClass &&
|
|
inSameLexicalScope(node, mergedClass)) {
|
|
getNodeLinks(node).flags |= 32768 /* LexicalModuleMergesWithClass */;
|
|
}
|
|
}
|
|
// Checks for ambient external modules.
|
|
if (isAmbientExternalModule) {
|
|
if (!isGlobalSourceFile(node.parent)) {
|
|
error(node.name, ts.Diagnostics.Ambient_modules_cannot_be_nested_in_other_modules);
|
|
}
|
|
if (isExternalModuleNameRelative(node.name.text)) {
|
|
error(node.name, ts.Diagnostics.Ambient_module_declaration_cannot_specify_relative_module_name);
|
|
}
|
|
}
|
|
}
|
|
checkSourceElement(node.body);
|
|
}
|
|
function getFirstIdentifier(node) {
|
|
while (true) {
|
|
if (node.kind === 132 /* QualifiedName */) {
|
|
node = node.left;
|
|
}
|
|
else if (node.kind === 163 /* PropertyAccessExpression */) {
|
|
node = node.expression;
|
|
}
|
|
else {
|
|
break;
|
|
}
|
|
}
|
|
ts.Debug.assert(node.kind === 66 /* Identifier */);
|
|
return node;
|
|
}
|
|
function checkExternalImportOrExportDeclaration(node) {
|
|
var moduleName = ts.getExternalModuleName(node);
|
|
if (!ts.nodeIsMissing(moduleName) && moduleName.kind !== 8 /* StringLiteral */) {
|
|
error(moduleName, ts.Diagnostics.String_literal_expected);
|
|
return false;
|
|
}
|
|
var inAmbientExternalModule = node.parent.kind === 216 /* ModuleBlock */ && node.parent.parent.name.kind === 8 /* StringLiteral */;
|
|
if (node.parent.kind !== 245 /* SourceFile */ && !inAmbientExternalModule) {
|
|
error(moduleName, node.kind === 225 /* 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 && isExternalModuleNameRelative(moduleName.text)) {
|
|
// 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 symbol = getSymbolOfNode(node);
|
|
var target = resolveAlias(symbol);
|
|
if (target !== unknownSymbol) {
|
|
var excludedMeanings = (symbol.flags & 107455 /* Value */ ? 107455 /* Value */ : 0) |
|
|
(symbol.flags & 793056 /* Type */ ? 793056 /* Type */ : 0) |
|
|
(symbol.flags & 1536 /* Namespace */ ? 1536 /* Namespace */ : 0);
|
|
if (target.flags & excludedMeanings) {
|
|
var message = node.kind === 227 /* 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));
|
|
}
|
|
}
|
|
}
|
|
function checkImportBinding(node) {
|
|
checkCollisionWithCapturedThisVariable(node, node.name);
|
|
checkCollisionWithRequireExportsInGeneratedCode(node, node.name);
|
|
checkAliasSymbol(node);
|
|
}
|
|
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 (!checkGrammarDecorators(node) && !checkGrammarModifiers(node) && (node.flags & 2035 /* Modifier */)) {
|
|
grammarErrorOnFirstToken(node, ts.Diagnostics.An_import_declaration_cannot_have_modifiers);
|
|
}
|
|
if (checkExternalImportOrExportDeclaration(node)) {
|
|
var importClause = node.importClause;
|
|
if (importClause) {
|
|
if (importClause.name) {
|
|
checkImportBinding(importClause);
|
|
}
|
|
if (importClause.namedBindings) {
|
|
if (importClause.namedBindings.kind === 221 /* NamespaceImport */) {
|
|
checkImportBinding(importClause.namedBindings);
|
|
}
|
|
else {
|
|
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;
|
|
}
|
|
checkGrammarDecorators(node) || checkGrammarModifiers(node);
|
|
if (ts.isInternalModuleImportEqualsDeclaration(node) || checkExternalImportOrExportDeclaration(node)) {
|
|
checkImportBinding(node);
|
|
if (node.flags & 1 /* Export */) {
|
|
markExportAsReferenced(node);
|
|
}
|
|
if (ts.isInternalModuleImportEqualsDeclaration(node)) {
|
|
var target = resolveAlias(getSymbolOfNode(node));
|
|
if (target !== unknownSymbol) {
|
|
if (target.flags & 107455 /* Value */) {
|
|
// Target is a value symbol, check that it is not hidden by a local declaration with the same name
|
|
var moduleName = getFirstIdentifier(node.moduleReference);
|
|
if (!(resolveEntityName(moduleName, 107455 /* Value */ | 1536 /* Namespace */).flags & 1536 /* Namespace */)) {
|
|
error(moduleName, ts.Diagnostics.Module_0_is_hidden_by_a_local_declaration_with_the_same_name, ts.declarationNameToString(moduleName));
|
|
}
|
|
}
|
|
if (target.flags & 793056 /* Type */) {
|
|
checkTypeNameIsReserved(node.name, ts.Diagnostics.Import_name_cannot_be_0);
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
if (languageVersion >= 2 /* ES6 */) {
|
|
// Import equals declaration is deprecated in es6 or above
|
|
grammarErrorOnNode(node, ts.Diagnostics.Import_assignment_cannot_be_used_when_targeting_ECMAScript_6_or_higher_Consider_using_import_Asterisk_as_ns_from_mod_import_a_from_mod_or_import_d_from_mod_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 (!checkGrammarDecorators(node) && !checkGrammarModifiers(node) && (node.flags & 2035 /* Modifier */)) {
|
|
grammarErrorOnFirstToken(node, ts.Diagnostics.An_export_declaration_cannot_have_modifiers);
|
|
}
|
|
if (!node.moduleSpecifier || checkExternalImportOrExportDeclaration(node)) {
|
|
if (node.exportClause) {
|
|
// export { x, y }
|
|
// export { x, y } from "foo"
|
|
ts.forEach(node.exportClause.elements, checkExportSpecifier);
|
|
var inAmbientExternalModule = node.parent.kind === 216 /* ModuleBlock */ && node.parent.parent.name.kind === 8 /* StringLiteral */;
|
|
if (node.parent.kind !== 245 /* SourceFile */ && !inAmbientExternalModule) {
|
|
error(node, ts.Diagnostics.Export_declarations_are_not_permitted_in_a_namespace);
|
|
}
|
|
}
|
|
else {
|
|
// export * from "foo"
|
|
var moduleSymbol = resolveExternalModuleName(node, node.moduleSpecifier);
|
|
if (moduleSymbol && moduleSymbol.exports["export="]) {
|
|
error(node.moduleSpecifier, ts.Diagnostics.Module_0_uses_export_and_cannot_be_used_with_export_Asterisk, symbolToString(moduleSymbol));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function checkGrammarModuleElementContext(node, errorMessage) {
|
|
if (node.parent.kind !== 245 /* SourceFile */ && node.parent.kind !== 216 /* ModuleBlock */ && node.parent.kind !== 215 /* ModuleDeclaration */) {
|
|
return grammarErrorOnFirstToken(node, errorMessage);
|
|
}
|
|
}
|
|
function checkExportSpecifier(node) {
|
|
checkAliasSymbol(node);
|
|
if (!node.parent.parent.moduleSpecifier) {
|
|
markExportAsReferenced(node);
|
|
}
|
|
}
|
|
function checkExportAssignment(node) {
|
|
if (checkGrammarModuleElementContext(node, ts.Diagnostics.An_export_assignment_can_only_be_used_in_a_module)) {
|
|
// If we hit an export assignment in an illegal context, just bail out to avoid cascading errors.
|
|
return;
|
|
}
|
|
var container = node.parent.kind === 245 /* SourceFile */ ? node.parent : node.parent.parent;
|
|
if (container.kind === 215 /* ModuleDeclaration */ && container.name.kind === 66 /* Identifier */) {
|
|
error(node, ts.Diagnostics.An_export_assignment_cannot_be_used_in_a_namespace);
|
|
return;
|
|
}
|
|
// Grammar checking
|
|
if (!checkGrammarDecorators(node) && !checkGrammarModifiers(node) && (node.flags & 2035 /* Modifier */)) {
|
|
grammarErrorOnFirstToken(node, ts.Diagnostics.An_export_assignment_cannot_have_modifiers);
|
|
}
|
|
if (node.expression.kind === 66 /* Identifier */) {
|
|
markExportAsReferenced(node);
|
|
}
|
|
else {
|
|
checkExpressionCached(node.expression);
|
|
}
|
|
checkExternalModuleExports(container);
|
|
if (node.isExportEquals && !ts.isInAmbientContext(node)) {
|
|
if (languageVersion >= 2 /* ES6 */) {
|
|
// export assignment is deprecated in es6 or above
|
|
grammarErrorOnNode(node, ts.Diagnostics.Export_assignment_cannot_be_used_when_targeting_ECMAScript_6_or_higher_Consider_using_export_default_instead);
|
|
}
|
|
else if (compilerOptions.module === 4 /* System */) {
|
|
// system modules does not support export assignment
|
|
grammarErrorOnNode(node, ts.Diagnostics.Export_assignment_is_not_supported_when_module_flag_is_system);
|
|
}
|
|
}
|
|
}
|
|
function getModuleStatements(node) {
|
|
if (node.kind === 245 /* SourceFile */) {
|
|
return node.statements;
|
|
}
|
|
if (node.kind === 215 /* ModuleDeclaration */ && node.body.kind === 216 /* ModuleBlock */) {
|
|
return node.body.statements;
|
|
}
|
|
return emptyArray;
|
|
}
|
|
function hasExportedMembers(moduleSymbol) {
|
|
for (var id in moduleSymbol.exports) {
|
|
if (id !== "export=") {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function checkExternalModuleExports(node) {
|
|
var moduleSymbol = getSymbolOfNode(node);
|
|
var links = getSymbolLinks(moduleSymbol);
|
|
if (!links.exportsChecked) {
|
|
var exportEqualsSymbol = moduleSymbol.exports["export="];
|
|
if (exportEqualsSymbol && hasExportedMembers(moduleSymbol)) {
|
|
var declaration = getDeclarationOfAliasSymbol(exportEqualsSymbol) || exportEqualsSymbol.valueDeclaration;
|
|
error(declaration, ts.Diagnostics.An_export_assignment_cannot_be_used_in_a_module_with_other_exported_elements);
|
|
}
|
|
links.exportsChecked = true;
|
|
}
|
|
}
|
|
function checkTypePredicate(node) {
|
|
if (!isInLegalTypePredicatePosition(node)) {
|
|
error(node, ts.Diagnostics.A_type_predicate_is_only_allowed_in_return_type_position_for_functions_and_methods);
|
|
}
|
|
}
|
|
function checkSourceElement(node) {
|
|
if (!node) {
|
|
return;
|
|
}
|
|
var kind = node.kind;
|
|
if (cancellationToken) {
|
|
// Only bother checking on a few construct kinds. We don't want to be excessivly
|
|
// hitting the cancellation token on every node we check.
|
|
switch (kind) {
|
|
case 215 /* ModuleDeclaration */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 210 /* FunctionDeclaration */:
|
|
cancellationToken.throwIfCancellationRequested();
|
|
}
|
|
}
|
|
switch (kind) {
|
|
case 134 /* TypeParameter */:
|
|
return checkTypeParameter(node);
|
|
case 135 /* Parameter */:
|
|
return checkParameter(node);
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
return checkPropertyDeclaration(node);
|
|
case 149 /* FunctionType */:
|
|
case 150 /* ConstructorType */:
|
|
case 144 /* CallSignature */:
|
|
case 145 /* ConstructSignature */:
|
|
return checkSignatureDeclaration(node);
|
|
case 146 /* IndexSignature */:
|
|
return checkSignatureDeclaration(node);
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
return checkMethodDeclaration(node);
|
|
case 141 /* Constructor */:
|
|
return checkConstructorDeclaration(node);
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
return checkAccessorDeclaration(node);
|
|
case 148 /* TypeReference */:
|
|
return checkTypeReferenceNode(node);
|
|
case 147 /* TypePredicate */:
|
|
return checkTypePredicate(node);
|
|
case 151 /* TypeQuery */:
|
|
return checkTypeQuery(node);
|
|
case 152 /* TypeLiteral */:
|
|
return checkTypeLiteral(node);
|
|
case 153 /* ArrayType */:
|
|
return checkArrayType(node);
|
|
case 154 /* TupleType */:
|
|
return checkTupleType(node);
|
|
case 155 /* UnionType */:
|
|
case 156 /* IntersectionType */:
|
|
return checkUnionOrIntersectionType(node);
|
|
case 157 /* ParenthesizedType */:
|
|
return checkSourceElement(node.type);
|
|
case 210 /* FunctionDeclaration */:
|
|
return checkFunctionDeclaration(node);
|
|
case 189 /* Block */:
|
|
case 216 /* ModuleBlock */:
|
|
return checkBlock(node);
|
|
case 190 /* VariableStatement */:
|
|
return checkVariableStatement(node);
|
|
case 192 /* ExpressionStatement */:
|
|
return checkExpressionStatement(node);
|
|
case 193 /* IfStatement */:
|
|
return checkIfStatement(node);
|
|
case 194 /* DoStatement */:
|
|
return checkDoStatement(node);
|
|
case 195 /* WhileStatement */:
|
|
return checkWhileStatement(node);
|
|
case 196 /* ForStatement */:
|
|
return checkForStatement(node);
|
|
case 197 /* ForInStatement */:
|
|
return checkForInStatement(node);
|
|
case 198 /* ForOfStatement */:
|
|
return checkForOfStatement(node);
|
|
case 199 /* ContinueStatement */:
|
|
case 200 /* BreakStatement */:
|
|
return checkBreakOrContinueStatement(node);
|
|
case 201 /* ReturnStatement */:
|
|
return checkReturnStatement(node);
|
|
case 202 /* WithStatement */:
|
|
return checkWithStatement(node);
|
|
case 203 /* SwitchStatement */:
|
|
return checkSwitchStatement(node);
|
|
case 204 /* LabeledStatement */:
|
|
return checkLabeledStatement(node);
|
|
case 205 /* ThrowStatement */:
|
|
return checkThrowStatement(node);
|
|
case 206 /* TryStatement */:
|
|
return checkTryStatement(node);
|
|
case 208 /* VariableDeclaration */:
|
|
return checkVariableDeclaration(node);
|
|
case 160 /* BindingElement */:
|
|
return checkBindingElement(node);
|
|
case 211 /* ClassDeclaration */:
|
|
return checkClassDeclaration(node);
|
|
case 212 /* InterfaceDeclaration */:
|
|
return checkInterfaceDeclaration(node);
|
|
case 213 /* TypeAliasDeclaration */:
|
|
return checkTypeAliasDeclaration(node);
|
|
case 214 /* EnumDeclaration */:
|
|
return checkEnumDeclaration(node);
|
|
case 215 /* ModuleDeclaration */:
|
|
return checkModuleDeclaration(node);
|
|
case 219 /* ImportDeclaration */:
|
|
return checkImportDeclaration(node);
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
return checkImportEqualsDeclaration(node);
|
|
case 225 /* ExportDeclaration */:
|
|
return checkExportDeclaration(node);
|
|
case 224 /* ExportAssignment */:
|
|
return checkExportAssignment(node);
|
|
case 191 /* EmptyStatement */:
|
|
checkGrammarStatementInAmbientContext(node);
|
|
return;
|
|
case 207 /* DebuggerStatement */:
|
|
checkGrammarStatementInAmbientContext(node);
|
|
return;
|
|
case 228 /* MissingDeclaration */:
|
|
return checkMissingDeclaration(node);
|
|
}
|
|
}
|
|
// Function and class expression bodies are checked after all statements in the enclosing body. This is
|
|
// to ensure constructs like the following are permitted:
|
|
// let foo = function () {
|
|
// let 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 checkFunctionAndClassExpressionBodies(node) {
|
|
switch (node.kind) {
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
ts.forEach(node.parameters, checkFunctionAndClassExpressionBodies);
|
|
checkFunctionExpressionOrObjectLiteralMethodBody(node);
|
|
break;
|
|
case 183 /* ClassExpression */:
|
|
ts.forEach(node.members, checkSourceElement);
|
|
break;
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
ts.forEach(node.decorators, checkFunctionAndClassExpressionBodies);
|
|
ts.forEach(node.parameters, checkFunctionAndClassExpressionBodies);
|
|
if (ts.isObjectLiteralMethod(node)) {
|
|
checkFunctionExpressionOrObjectLiteralMethodBody(node);
|
|
}
|
|
break;
|
|
case 141 /* Constructor */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 210 /* FunctionDeclaration */:
|
|
ts.forEach(node.parameters, checkFunctionAndClassExpressionBodies);
|
|
break;
|
|
case 202 /* WithStatement */:
|
|
checkFunctionAndClassExpressionBodies(node.expression);
|
|
break;
|
|
case 136 /* Decorator */:
|
|
case 135 /* Parameter */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 158 /* ObjectBindingPattern */:
|
|
case 159 /* ArrayBindingPattern */:
|
|
case 160 /* BindingElement */:
|
|
case 161 /* ArrayLiteralExpression */:
|
|
case 162 /* ObjectLiteralExpression */:
|
|
case 242 /* PropertyAssignment */:
|
|
case 163 /* PropertyAccessExpression */:
|
|
case 164 /* ElementAccessExpression */:
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
case 167 /* TaggedTemplateExpression */:
|
|
case 180 /* TemplateExpression */:
|
|
case 187 /* TemplateSpan */:
|
|
case 168 /* TypeAssertionExpression */:
|
|
case 186 /* AsExpression */:
|
|
case 169 /* ParenthesizedExpression */:
|
|
case 173 /* TypeOfExpression */:
|
|
case 174 /* VoidExpression */:
|
|
case 175 /* AwaitExpression */:
|
|
case 172 /* DeleteExpression */:
|
|
case 176 /* PrefixUnaryExpression */:
|
|
case 177 /* PostfixUnaryExpression */:
|
|
case 178 /* BinaryExpression */:
|
|
case 179 /* ConditionalExpression */:
|
|
case 182 /* SpreadElementExpression */:
|
|
case 181 /* YieldExpression */:
|
|
case 189 /* Block */:
|
|
case 216 /* ModuleBlock */:
|
|
case 190 /* VariableStatement */:
|
|
case 192 /* ExpressionStatement */:
|
|
case 193 /* IfStatement */:
|
|
case 194 /* DoStatement */:
|
|
case 195 /* WhileStatement */:
|
|
case 196 /* ForStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
case 199 /* ContinueStatement */:
|
|
case 200 /* BreakStatement */:
|
|
case 201 /* ReturnStatement */:
|
|
case 203 /* SwitchStatement */:
|
|
case 217 /* CaseBlock */:
|
|
case 238 /* CaseClause */:
|
|
case 239 /* DefaultClause */:
|
|
case 204 /* LabeledStatement */:
|
|
case 205 /* ThrowStatement */:
|
|
case 206 /* TryStatement */:
|
|
case 241 /* CatchClause */:
|
|
case 208 /* VariableDeclaration */:
|
|
case 209 /* VariableDeclarationList */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 244 /* EnumMember */:
|
|
case 224 /* ExportAssignment */:
|
|
case 245 /* SourceFile */:
|
|
case 237 /* JsxExpression */:
|
|
case 230 /* JsxElement */:
|
|
case 231 /* JsxSelfClosingElement */:
|
|
case 235 /* JsxAttribute */:
|
|
case 236 /* JsxSpreadAttribute */:
|
|
case 232 /* JsxOpeningElement */:
|
|
ts.forEachChild(node, checkFunctionAndClassExpressionBodies);
|
|
break;
|
|
}
|
|
}
|
|
function checkSourceFile(node) {
|
|
var start = new Date().getTime();
|
|
checkSourceFileWorker(node);
|
|
ts.checkTime += new Date().getTime() - start;
|
|
}
|
|
// Fully type check a source file and collect the relevant diagnostics.
|
|
function checkSourceFileWorker(node) {
|
|
var links = getNodeLinks(node);
|
|
if (!(links.flags & 1 /* TypeChecked */)) {
|
|
// Check whether the file has declared it is the default lib,
|
|
// and whether the user has specifically chosen to avoid checking it.
|
|
if (node.isDefaultLib && compilerOptions.skipDefaultLibCheck) {
|
|
return;
|
|
}
|
|
// Grammar checking
|
|
checkGrammarSourceFile(node);
|
|
emitExtends = false;
|
|
emitDecorate = false;
|
|
emitParam = false;
|
|
potentialThisCollisions.length = 0;
|
|
ts.forEach(node.statements, checkSourceElement);
|
|
checkFunctionAndClassExpressionBodies(node);
|
|
if (ts.isExternalModule(node)) {
|
|
checkExternalModuleExports(node);
|
|
}
|
|
if (potentialThisCollisions.length) {
|
|
ts.forEach(potentialThisCollisions, checkIfThisIsCapturedInEnclosingScope);
|
|
potentialThisCollisions.length = 0;
|
|
}
|
|
if (emitExtends) {
|
|
links.flags |= 8 /* EmitExtends */;
|
|
}
|
|
if (emitDecorate) {
|
|
links.flags |= 16 /* EmitDecorate */;
|
|
}
|
|
if (emitParam) {
|
|
links.flags |= 32 /* EmitParam */;
|
|
}
|
|
if (emitAwaiter) {
|
|
links.flags |= 64 /* EmitAwaiter */;
|
|
}
|
|
if (emitGenerator || (emitAwaiter && languageVersion < 2 /* ES6 */)) {
|
|
links.flags |= 128 /* EmitGenerator */;
|
|
}
|
|
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) {
|
|
checkSourceFile(sourceFile);
|
|
return diagnostics.getDiagnostics(sourceFile.fileName);
|
|
}
|
|
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 isInsideWithStatementBody(node) {
|
|
if (node) {
|
|
while (node.parent) {
|
|
if (node.parent.kind === 202 /* WithStatement */ && node.parent.statement === node) {
|
|
return true;
|
|
}
|
|
node = node.parent;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function getSymbolsInScope(location, meaning) {
|
|
var symbols = {};
|
|
var memberFlags = 0;
|
|
if (isInsideWithStatementBody(location)) {
|
|
// We cannot answer semantic questions within a with block, do not proceed any further
|
|
return [];
|
|
}
|
|
populateSymbols();
|
|
return symbolsToArray(symbols);
|
|
function populateSymbols() {
|
|
while (location) {
|
|
if (location.locals && !isGlobalSourceFile(location)) {
|
|
copySymbols(location.locals, meaning);
|
|
}
|
|
switch (location.kind) {
|
|
case 245 /* SourceFile */:
|
|
if (!ts.isExternalModule(location)) {
|
|
break;
|
|
}
|
|
case 215 /* ModuleDeclaration */:
|
|
copySymbols(getSymbolOfNode(location).exports, meaning & 8914931 /* ModuleMember */);
|
|
break;
|
|
case 214 /* EnumDeclaration */:
|
|
copySymbols(getSymbolOfNode(location).exports, meaning & 8 /* EnumMember */);
|
|
break;
|
|
case 183 /* ClassExpression */:
|
|
var className = location.name;
|
|
if (className) {
|
|
copySymbol(location.symbol, meaning);
|
|
}
|
|
// fall through; 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
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* 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 (!(memberFlags & 128 /* Static */)) {
|
|
copySymbols(getSymbolOfNode(location).members, meaning & 793056 /* Type */);
|
|
}
|
|
break;
|
|
case 170 /* FunctionExpression */:
|
|
var funcName = location.name;
|
|
if (funcName) {
|
|
copySymbol(location.symbol, meaning);
|
|
}
|
|
break;
|
|
}
|
|
memberFlags = location.flags;
|
|
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 (symbol.flags & meaning) {
|
|
var id = symbol.name;
|
|
// 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 (!ts.hasProperty(symbols, id)) {
|
|
symbols[id] = symbol;
|
|
}
|
|
}
|
|
}
|
|
function copySymbols(source, meaning) {
|
|
if (meaning) {
|
|
for (var id in source) {
|
|
var symbol = source[id];
|
|
copySymbol(symbol, meaning);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function isTypeDeclarationName(name) {
|
|
return name.kind === 66 /* Identifier */ &&
|
|
isTypeDeclaration(name.parent) &&
|
|
name.parent.name === name;
|
|
}
|
|
function isTypeDeclaration(node) {
|
|
switch (node.kind) {
|
|
case 134 /* TypeParameter */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 213 /* TypeAliasDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
return true;
|
|
}
|
|
}
|
|
// True if the given identifier is part of a type reference
|
|
function isTypeReferenceIdentifier(entityName) {
|
|
var node = entityName;
|
|
while (node.parent && node.parent.kind === 132 /* QualifiedName */) {
|
|
node = node.parent;
|
|
}
|
|
return node.parent && node.parent.kind === 148 /* TypeReference */;
|
|
}
|
|
function isHeritageClauseElementIdentifier(entityName) {
|
|
var node = entityName;
|
|
while (node.parent && node.parent.kind === 163 /* PropertyAccessExpression */) {
|
|
node = node.parent;
|
|
}
|
|
return node.parent && node.parent.kind === 185 /* ExpressionWithTypeArguments */;
|
|
}
|
|
function getLeftSideOfImportEqualsOrExportAssignment(nodeOnRightSide) {
|
|
while (nodeOnRightSide.parent.kind === 132 /* QualifiedName */) {
|
|
nodeOnRightSide = nodeOnRightSide.parent;
|
|
}
|
|
if (nodeOnRightSide.parent.kind === 218 /* ImportEqualsDeclaration */) {
|
|
return nodeOnRightSide.parent.moduleReference === nodeOnRightSide && nodeOnRightSide.parent;
|
|
}
|
|
if (nodeOnRightSide.parent.kind === 224 /* ExportAssignment */) {
|
|
return nodeOnRightSide.parent.expression === nodeOnRightSide && nodeOnRightSide.parent;
|
|
}
|
|
return undefined;
|
|
}
|
|
function isInRightSideOfImportOrExportAssignment(node) {
|
|
return getLeftSideOfImportEqualsOrExportAssignment(node) !== undefined;
|
|
}
|
|
function getSymbolOfEntityNameOrPropertyAccessExpression(entityName) {
|
|
if (ts.isDeclarationName(entityName)) {
|
|
return getSymbolOfNode(entityName.parent);
|
|
}
|
|
if (entityName.parent.kind === 224 /* ExportAssignment */) {
|
|
return resolveEntityName(entityName,
|
|
/*all meanings*/ 107455 /* Value */ | 793056 /* Type */ | 1536 /* Namespace */ | 8388608 /* Alias */);
|
|
}
|
|
if (entityName.kind !== 163 /* PropertyAccessExpression */) {
|
|
if (isInRightSideOfImportOrExportAssignment(entityName)) {
|
|
// Since we already checked for ExportAssignment, this really could only be an Import
|
|
return getSymbolOfPartOfRightHandSideOfImportEquals(entityName);
|
|
}
|
|
}
|
|
if (ts.isRightSideOfQualifiedNameOrPropertyAccess(entityName)) {
|
|
entityName = entityName.parent;
|
|
}
|
|
if (isHeritageClauseElementIdentifier(entityName)) {
|
|
var meaning = entityName.parent.kind === 185 /* ExpressionWithTypeArguments */ ? 793056 /* Type */ : 1536 /* Namespace */;
|
|
meaning |= 8388608 /* Alias */;
|
|
return resolveEntityName(entityName, meaning);
|
|
}
|
|
else if ((entityName.parent.kind === 232 /* JsxOpeningElement */) || (entityName.parent.kind === 231 /* JsxSelfClosingElement */)) {
|
|
return getJsxElementTagSymbol(entityName.parent);
|
|
}
|
|
else if (ts.isExpression(entityName)) {
|
|
if (ts.nodeIsMissing(entityName)) {
|
|
// Missing entity name.
|
|
return undefined;
|
|
}
|
|
if (entityName.kind === 66 /* Identifier */) {
|
|
// Include aliases in the meaning, this ensures that we do not follow aliases to where they point and instead
|
|
// return the alias symbol.
|
|
var meaning = 107455 /* Value */ | 8388608 /* Alias */;
|
|
return resolveEntityName(entityName, meaning);
|
|
}
|
|
else if (entityName.kind === 163 /* PropertyAccessExpression */) {
|
|
var symbol = getNodeLinks(entityName).resolvedSymbol;
|
|
if (!symbol) {
|
|
checkPropertyAccessExpression(entityName);
|
|
}
|
|
return getNodeLinks(entityName).resolvedSymbol;
|
|
}
|
|
else if (entityName.kind === 132 /* QualifiedName */) {
|
|
var symbol = getNodeLinks(entityName).resolvedSymbol;
|
|
if (!symbol) {
|
|
checkQualifiedName(entityName);
|
|
}
|
|
return getNodeLinks(entityName).resolvedSymbol;
|
|
}
|
|
}
|
|
else if (isTypeReferenceIdentifier(entityName)) {
|
|
var meaning = entityName.parent.kind === 148 /* TypeReference */ ? 793056 /* Type */ : 1536 /* Namespace */;
|
|
// Include aliases in the meaning, this ensures that we do not follow aliases to where they point and instead
|
|
// return the alias symbol.
|
|
meaning |= 8388608 /* Alias */;
|
|
return resolveEntityName(entityName, meaning);
|
|
}
|
|
else if (entityName.parent.kind === 235 /* JsxAttribute */) {
|
|
return getJsxAttributePropertySymbol(entityName.parent);
|
|
}
|
|
if (entityName.parent.kind === 147 /* TypePredicate */) {
|
|
return resolveEntityName(entityName, 1 /* FunctionScopedVariable */);
|
|
}
|
|
// Do we want to return undefined here?
|
|
return undefined;
|
|
}
|
|
function getSymbolInfo(node) {
|
|
if (isInsideWithStatementBody(node)) {
|
|
// We cannot answer semantic questions within a with block, do not proceed any further
|
|
return undefined;
|
|
}
|
|
if (ts.isDeclarationName(node)) {
|
|
// This is a declaration, call getSymbolOfNode
|
|
return getSymbolOfNode(node.parent);
|
|
}
|
|
if (node.kind === 66 /* Identifier */ && isInRightSideOfImportOrExportAssignment(node)) {
|
|
return node.parent.kind === 224 /* ExportAssignment */
|
|
? getSymbolOfEntityNameOrPropertyAccessExpression(node)
|
|
: getSymbolOfPartOfRightHandSideOfImportEquals(node);
|
|
}
|
|
switch (node.kind) {
|
|
case 66 /* Identifier */:
|
|
case 163 /* PropertyAccessExpression */:
|
|
case 132 /* QualifiedName */:
|
|
return getSymbolOfEntityNameOrPropertyAccessExpression(node);
|
|
case 94 /* ThisKeyword */:
|
|
case 92 /* SuperKeyword */:
|
|
var type = checkExpression(node);
|
|
return type.symbol;
|
|
case 118 /* ConstructorKeyword */:
|
|
// constructor keyword for an overload, should take us to the definition if it exist
|
|
var constructorDeclaration = node.parent;
|
|
if (constructorDeclaration && constructorDeclaration.kind === 141 /* Constructor */) {
|
|
return constructorDeclaration.parent.symbol;
|
|
}
|
|
return undefined;
|
|
case 8 /* StringLiteral */:
|
|
// External module name in an import declaration
|
|
if ((ts.isExternalModuleImportEqualsDeclaration(node.parent.parent) &&
|
|
ts.getExternalModuleImportEqualsDeclarationExpression(node.parent.parent) === node) ||
|
|
((node.parent.kind === 219 /* ImportDeclaration */ || node.parent.kind === 225 /* ExportDeclaration */) &&
|
|
node.parent.moduleSpecifier === node)) {
|
|
return resolveExternalModuleName(node, node);
|
|
}
|
|
// Fall through
|
|
case 7 /* NumericLiteral */:
|
|
// index access
|
|
if (node.parent.kind === 164 /* ElementAccessExpression */ && node.parent.argumentExpression === node) {
|
|
var objectType = checkExpression(node.parent.expression);
|
|
if (objectType === unknownType)
|
|
return undefined;
|
|
var apparentType = getApparentType(objectType);
|
|
if (apparentType === unknownType)
|
|
return undefined;
|
|
return getPropertyOfType(apparentType, node.text);
|
|
}
|
|
break;
|
|
}
|
|
return undefined;
|
|
}
|
|
function getShorthandAssignmentValueSymbol(location) {
|
|
// The function returns a value symbol of an identifier in the short-hand property assignment.
|
|
// This is necessary as an identifier in short-hand property assignment can contains two meaning:
|
|
// property name and property value.
|
|
if (location && location.kind === 243 /* ShorthandPropertyAssignment */) {
|
|
return resolveEntityName(location.name, 107455 /* Value */);
|
|
}
|
|
return undefined;
|
|
}
|
|
function getTypeOfNode(node) {
|
|
if (isInsideWithStatementBody(node)) {
|
|
// We cannot answer semantic questions within a with block, do not proceed any further
|
|
return unknownType;
|
|
}
|
|
if (ts.isTypeNode(node)) {
|
|
return getTypeFromTypeNode(node);
|
|
}
|
|
if (ts.isExpression(node)) {
|
|
return getTypeOfExpression(node);
|
|
}
|
|
if (ts.isExpressionWithTypeArgumentsInClassExtendsClause(node)) {
|
|
// A SyntaxKind.ExpressionWithTypeArguments is considered a type node, except when it occurs in the
|
|
// extends clause of a class. We handle that case here.
|
|
return getBaseTypes(getDeclaredTypeOfSymbol(getSymbolOfNode(node.parent.parent)))[0];
|
|
}
|
|
if (isTypeDeclaration(node)) {
|
|
// In this case, we call getSymbolOfNode instead of getSymbolInfo because it is a declaration
|
|
var symbol = getSymbolOfNode(node);
|
|
return getDeclaredTypeOfSymbol(symbol);
|
|
}
|
|
if (isTypeDeclarationName(node)) {
|
|
var symbol = getSymbolInfo(node);
|
|
return symbol && getDeclaredTypeOfSymbol(symbol);
|
|
}
|
|
if (ts.isDeclaration(node)) {
|
|
// In this case, we call getSymbolOfNode instead of getSymbolInfo because it is a declaration
|
|
var symbol = getSymbolOfNode(node);
|
|
return getTypeOfSymbol(symbol);
|
|
}
|
|
if (ts.isDeclarationName(node)) {
|
|
var symbol = getSymbolInfo(node);
|
|
return symbol && getTypeOfSymbol(symbol);
|
|
}
|
|
if (ts.isBindingPattern(node)) {
|
|
return getTypeForVariableLikeDeclaration(node.parent);
|
|
}
|
|
if (isInRightSideOfImportOrExportAssignment(node)) {
|
|
var symbol = getSymbolInfo(node);
|
|
var declaredType = symbol && getDeclaredTypeOfSymbol(symbol);
|
|
return declaredType !== unknownType ? declaredType : getTypeOfSymbol(symbol);
|
|
}
|
|
return unknownType;
|
|
}
|
|
function getTypeOfExpression(expr) {
|
|
if (ts.isRightSideOfQualifiedNameOrPropertyAccess(expr)) {
|
|
expr = expr.parent;
|
|
}
|
|
return checkExpression(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 node.flags & 128 /* Static */
|
|
? getTypeOfSymbol(classSymbol)
|
|
: getDeclaredTypeOfSymbol(classSymbol);
|
|
}
|
|
// 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 = createSymbolTable(getPropertiesOfType(type));
|
|
if (getSignaturesOfType(type, 0 /* Call */).length || getSignaturesOfType(type, 1 /* Construct */).length) {
|
|
ts.forEach(getPropertiesOfType(globalFunctionType), function (p) {
|
|
if (!ts.hasProperty(propsByName, p.name)) {
|
|
propsByName[p.name] = p;
|
|
}
|
|
});
|
|
}
|
|
return getNamedMembers(propsByName);
|
|
}
|
|
function getRootSymbols(symbol) {
|
|
if (symbol.flags & 268435456 /* SyntheticProperty */) {
|
|
var symbols = [];
|
|
var name_15 = symbol.name;
|
|
ts.forEach(getSymbolLinks(symbol).containingType.types, function (t) {
|
|
symbols.push(getPropertyOfType(t, name_15));
|
|
});
|
|
return symbols;
|
|
}
|
|
else if (symbol.flags & 67108864 /* Transient */) {
|
|
var target = getSymbolLinks(symbol).target;
|
|
if (target) {
|
|
return [target];
|
|
}
|
|
}
|
|
return [symbol];
|
|
}
|
|
// Emitter support
|
|
// 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(node) {
|
|
var symbol = getReferencedValueSymbol(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 (exportSymbol.flags & 944 /* ExportHasLocal */) {
|
|
return undefined;
|
|
}
|
|
symbol = exportSymbol;
|
|
}
|
|
var parentSymbol = getParentOfSymbol(symbol);
|
|
if (parentSymbol) {
|
|
if (parentSymbol.flags & 512 /* ValueModule */ && parentSymbol.valueDeclaration.kind === 245 /* SourceFile */) {
|
|
return parentSymbol.valueDeclaration;
|
|
}
|
|
for (var n = node.parent; n; n = n.parent) {
|
|
if ((n.kind === 215 /* ModuleDeclaration */ || n.kind === 214 /* EnumDeclaration */) && getSymbolOfNode(n) === parentSymbol) {
|
|
return n;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
// When resolved as an expression identifier, if the given node references an import, return the declaration of
|
|
// that import. Otherwise, return undefined.
|
|
function getReferencedImportDeclaration(node) {
|
|
var symbol = getReferencedValueSymbol(node);
|
|
return symbol && symbol.flags & 8388608 /* Alias */ ? getDeclarationOfAliasSymbol(symbol) : undefined;
|
|
}
|
|
function isStatementWithLocals(node) {
|
|
switch (node.kind) {
|
|
case 189 /* Block */:
|
|
case 217 /* CaseBlock */:
|
|
case 196 /* ForStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function isNestedRedeclarationSymbol(symbol) {
|
|
if (symbol.flags & 418 /* BlockScoped */) {
|
|
var links = getSymbolLinks(symbol);
|
|
if (links.isNestedRedeclaration === undefined) {
|
|
var container = ts.getEnclosingBlockScopeContainer(symbol.valueDeclaration);
|
|
links.isNestedRedeclaration = isStatementWithLocals(container) &&
|
|
!!resolveName(container.parent, symbol.name, 107455 /* Value */, undefined, undefined);
|
|
}
|
|
return links.isNestedRedeclaration;
|
|
}
|
|
return false;
|
|
}
|
|
// When resolved as an expression identifier, if the given node references a nested block scoped entity with
|
|
// a name that hides an existing name, return the declaration of that entity. Otherwise, return undefined.
|
|
function getReferencedNestedRedeclaration(node) {
|
|
var symbol = getReferencedValueSymbol(node);
|
|
return symbol && isNestedRedeclarationSymbol(symbol) ? symbol.valueDeclaration : undefined;
|
|
}
|
|
// Return true if the given node is a declaration of a nested block scoped entity with a name that hides an
|
|
// existing name.
|
|
function isNestedRedeclaration(node) {
|
|
return isNestedRedeclarationSymbol(getSymbolOfNode(node));
|
|
}
|
|
function isValueAliasDeclaration(node) {
|
|
switch (node.kind) {
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 220 /* ImportClause */:
|
|
case 221 /* NamespaceImport */:
|
|
case 223 /* ImportSpecifier */:
|
|
case 227 /* ExportSpecifier */:
|
|
return isAliasResolvedToValue(getSymbolOfNode(node));
|
|
case 225 /* ExportDeclaration */:
|
|
var exportClause = node.exportClause;
|
|
return exportClause && ts.forEach(exportClause.elements, isValueAliasDeclaration);
|
|
case 224 /* ExportAssignment */:
|
|
return node.expression && node.expression.kind === 66 /* Identifier */ ? isAliasResolvedToValue(getSymbolOfNode(node)) : true;
|
|
}
|
|
return false;
|
|
}
|
|
function isTopLevelValueImportEqualsWithEntityName(node) {
|
|
if (node.parent.kind !== 245 /* 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 && compilerOptions.isolatedModules) {
|
|
return true;
|
|
}
|
|
// const enums and modules that contain only const enums are not considered values from the emit perespective
|
|
return target !== unknownSymbol && target && target.flags & 107455 /* Value */ && !isConstEnumOrConstEnumOnlyModule(target);
|
|
}
|
|
function isConstEnumOrConstEnumOnlyModule(s) {
|
|
return isConstEnumSymbol(s) || s.constEnumOnlyModule;
|
|
}
|
|
function isReferencedAliasDeclaration(node, checkChildren) {
|
|
if (ts.isAliasSymbolDeclaration(node)) {
|
|
var symbol = getSymbolOfNode(node);
|
|
if (getSymbolLinks(symbol).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)) {
|
|
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 getNodeCheckFlags(node) {
|
|
return getNodeLinks(node).flags;
|
|
}
|
|
function getEnumMemberValue(node) {
|
|
computeEnumMemberValues(node.parent);
|
|
return getNodeLinks(node).enumMemberValue;
|
|
}
|
|
function getConstantValue(node) {
|
|
if (node.kind === 244 /* EnumMember */) {
|
|
return getEnumMemberValue(node);
|
|
}
|
|
var symbol = getNodeLinks(node).resolvedSymbol;
|
|
if (symbol && (symbol.flags & 8 /* EnumMember */)) {
|
|
// inline property\index accesses only for const enums
|
|
if (ts.isConstEnumDeclaration(symbol.valueDeclaration.parent)) {
|
|
return getEnumMemberValue(symbol.valueDeclaration);
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function isFunctionType(type) {
|
|
return type.flags & 80896 /* ObjectType */ && getSignaturesOfType(type, 0 /* Call */).length > 0;
|
|
}
|
|
function getTypeReferenceSerializationKind(node) {
|
|
// Resolve the symbol as a value to ensure the type can be reached at runtime during emit.
|
|
var symbol = resolveEntityName(node.typeName, 107455 /* Value */, true);
|
|
var constructorType = symbol ? getTypeOfSymbol(symbol) : undefined;
|
|
if (constructorType && isConstructorType(constructorType)) {
|
|
return ts.TypeReferenceSerializationKind.TypeWithConstructSignatureAndValue;
|
|
}
|
|
var type = getTypeFromTypeNode(node);
|
|
if (type === unknownType) {
|
|
return ts.TypeReferenceSerializationKind.Unknown;
|
|
}
|
|
else if (type.flags & 1 /* Any */) {
|
|
return ts.TypeReferenceSerializationKind.ObjectType;
|
|
}
|
|
else if (allConstituentTypesHaveKind(type, 16 /* Void */)) {
|
|
return ts.TypeReferenceSerializationKind.VoidType;
|
|
}
|
|
else if (allConstituentTypesHaveKind(type, 8 /* Boolean */)) {
|
|
return ts.TypeReferenceSerializationKind.BooleanType;
|
|
}
|
|
else if (allConstituentTypesHaveKind(type, 132 /* NumberLike */)) {
|
|
return ts.TypeReferenceSerializationKind.NumberLikeType;
|
|
}
|
|
else if (allConstituentTypesHaveKind(type, 258 /* StringLike */)) {
|
|
return ts.TypeReferenceSerializationKind.StringLikeType;
|
|
}
|
|
else if (allConstituentTypesHaveKind(type, 8192 /* Tuple */)) {
|
|
return ts.TypeReferenceSerializationKind.ArrayLikeType;
|
|
}
|
|
else if (allConstituentTypesHaveKind(type, 4194304 /* ESSymbol */)) {
|
|
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 writeTypeOfDeclaration(declaration, enclosingDeclaration, flags, writer) {
|
|
// 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 */))
|
|
? getTypeOfSymbol(symbol)
|
|
: unknownType;
|
|
getSymbolDisplayBuilder().buildTypeDisplay(type, writer, enclosingDeclaration, flags);
|
|
}
|
|
function writeReturnTypeOfSignatureDeclaration(signatureDeclaration, enclosingDeclaration, flags, writer) {
|
|
var signature = getSignatureFromDeclaration(signatureDeclaration);
|
|
getSymbolDisplayBuilder().buildTypeDisplay(getReturnTypeOfSignature(signature), writer, enclosingDeclaration, flags);
|
|
}
|
|
function writeTypeOfExpression(expr, enclosingDeclaration, flags, writer) {
|
|
var type = getTypeOfExpression(expr);
|
|
getSymbolDisplayBuilder().buildTypeDisplay(type, writer, enclosingDeclaration, flags);
|
|
}
|
|
function hasGlobalName(name) {
|
|
return ts.hasProperty(globals, name);
|
|
}
|
|
function getReferencedValueSymbol(reference) {
|
|
return getNodeLinks(reference).resolvedSymbol ||
|
|
resolveName(reference, reference.text, 107455 /* Value */ | 1048576 /* ExportValue */ | 8388608 /* Alias */,
|
|
/*nodeNotFoundMessage*/ undefined, undefined);
|
|
}
|
|
function getReferencedValueDeclaration(reference) {
|
|
ts.Debug.assert(!ts.nodeIsSynthesized(reference));
|
|
var symbol = getReferencedValueSymbol(reference);
|
|
return symbol && getExportSymbolOfValueSymbolIfExported(symbol).valueDeclaration;
|
|
}
|
|
function getBlockScopedVariableId(n) {
|
|
ts.Debug.assert(!ts.nodeIsSynthesized(n));
|
|
var isVariableDeclarationOrBindingElement = n.parent.kind === 160 /* BindingElement */ || (n.parent.kind === 208 /* VariableDeclaration */ && n.parent.name === n);
|
|
var symbol = (isVariableDeclarationOrBindingElement ? getSymbolOfNode(n.parent) : undefined) ||
|
|
getNodeLinks(n).resolvedSymbol ||
|
|
resolveName(n, n.text, 107455 /* Value */ | 8388608 /* Alias */, undefined, undefined);
|
|
var isLetOrConst = symbol &&
|
|
(symbol.flags & 2 /* BlockScopedVariable */) &&
|
|
symbol.valueDeclaration.parent.kind !== 241 /* CatchClause */;
|
|
if (isLetOrConst) {
|
|
// side-effect of calling this method:
|
|
// assign id to symbol if it was not yet set
|
|
getSymbolLinks(symbol);
|
|
return symbol.id;
|
|
}
|
|
return undefined;
|
|
}
|
|
function instantiateSingleCallFunctionType(functionType, typeArguments) {
|
|
if (functionType === unknownType) {
|
|
return unknownType;
|
|
}
|
|
var signature = getSingleCallSignature(functionType);
|
|
if (!signature) {
|
|
return unknownType;
|
|
}
|
|
var instantiatedSignature = getSignatureInstantiation(signature, typeArguments);
|
|
return getOrCreateTypeFromSignature(instantiatedSignature);
|
|
}
|
|
function createResolver() {
|
|
return {
|
|
getReferencedExportContainer: getReferencedExportContainer,
|
|
getReferencedImportDeclaration: getReferencedImportDeclaration,
|
|
getReferencedNestedRedeclaration: getReferencedNestedRedeclaration,
|
|
isNestedRedeclaration: isNestedRedeclaration,
|
|
isValueAliasDeclaration: isValueAliasDeclaration,
|
|
hasGlobalName: hasGlobalName,
|
|
isReferencedAliasDeclaration: isReferencedAliasDeclaration,
|
|
getNodeCheckFlags: getNodeCheckFlags,
|
|
isTopLevelValueImportEqualsWithEntityName: isTopLevelValueImportEqualsWithEntityName,
|
|
isDeclarationVisible: isDeclarationVisible,
|
|
isImplementationOfOverload: isImplementationOfOverload,
|
|
writeTypeOfDeclaration: writeTypeOfDeclaration,
|
|
writeReturnTypeOfSignatureDeclaration: writeReturnTypeOfSignatureDeclaration,
|
|
writeTypeOfExpression: writeTypeOfExpression,
|
|
isSymbolAccessible: isSymbolAccessible,
|
|
isEntityNameVisible: isEntityNameVisible,
|
|
getConstantValue: getConstantValue,
|
|
collectLinkedAliases: collectLinkedAliases,
|
|
getBlockScopedVariableId: getBlockScopedVariableId,
|
|
getReferencedValueDeclaration: getReferencedValueDeclaration,
|
|
getTypeReferenceSerializationKind: getTypeReferenceSerializationKind
|
|
};
|
|
}
|
|
function initializeTypeChecker() {
|
|
// Bind all source files and propagate errors
|
|
ts.forEach(host.getSourceFiles(), function (file) {
|
|
ts.bindSourceFile(file);
|
|
});
|
|
// Initialize global symbol table
|
|
ts.forEach(host.getSourceFiles(), function (file) {
|
|
if (!ts.isExternalModule(file)) {
|
|
mergeSymbolTable(globals, file.locals);
|
|
}
|
|
});
|
|
// Initialize special symbols
|
|
getSymbolLinks(undefinedSymbol).type = undefinedType;
|
|
getSymbolLinks(argumentsSymbol).type = getGlobalType("IArguments");
|
|
getSymbolLinks(unknownSymbol).type = unknownType;
|
|
globals[undefinedSymbol.name] = undefinedSymbol;
|
|
// Initialize special types
|
|
globalArrayType = getGlobalType("Array", 1);
|
|
globalObjectType = getGlobalType("Object");
|
|
globalFunctionType = getGlobalType("Function");
|
|
globalStringType = getGlobalType("String");
|
|
globalNumberType = getGlobalType("Number");
|
|
globalBooleanType = getGlobalType("Boolean");
|
|
globalRegExpType = getGlobalType("RegExp");
|
|
jsxElementType = getExportedTypeFromNamespace("JSX", JsxNames.Element);
|
|
getGlobalClassDecoratorType = ts.memoize(function () { return getGlobalType("ClassDecorator"); });
|
|
getGlobalPropertyDecoratorType = ts.memoize(function () { return getGlobalType("PropertyDecorator"); });
|
|
getGlobalMethodDecoratorType = ts.memoize(function () { return getGlobalType("MethodDecorator"); });
|
|
getGlobalParameterDecoratorType = ts.memoize(function () { return getGlobalType("ParameterDecorator"); });
|
|
getGlobalTypedPropertyDescriptorType = ts.memoize(function () { return getGlobalType("TypedPropertyDescriptor", 1); });
|
|
getGlobalPromiseType = ts.memoize(function () { return getGlobalType("Promise", 1); });
|
|
tryGetGlobalPromiseType = ts.memoize(function () { return getGlobalSymbol("Promise", 793056 /* Type */, undefined) && getGlobalPromiseType(); });
|
|
getGlobalPromiseLikeType = ts.memoize(function () { return getGlobalType("PromiseLike", 1); });
|
|
getInstantiatedGlobalPromiseLikeType = ts.memoize(createInstantiatedPromiseLikeType);
|
|
getGlobalPromiseConstructorSymbol = ts.memoize(function () { return getGlobalValueSymbol("Promise"); });
|
|
getGlobalPromiseConstructorLikeType = ts.memoize(function () { return getGlobalType("PromiseConstructorLike"); });
|
|
getGlobalThenableType = ts.memoize(createThenableType);
|
|
// If we're in ES6 mode, load the TemplateStringsArray.
|
|
// Otherwise, default to 'unknown' for the purposes of type checking in LS scenarios.
|
|
if (languageVersion >= 2 /* ES6 */) {
|
|
globalTemplateStringsArrayType = getGlobalType("TemplateStringsArray");
|
|
globalESSymbolType = getGlobalType("Symbol");
|
|
globalESSymbolConstructorSymbol = getGlobalValueSymbol("Symbol");
|
|
globalIterableType = getGlobalType("Iterable", 1);
|
|
globalIteratorType = getGlobalType("Iterator", 1);
|
|
globalIterableIteratorType = getGlobalType("IterableIterator", 1);
|
|
}
|
|
else {
|
|
globalTemplateStringsArrayType = unknownType;
|
|
// Consider putting Symbol interface in lib.d.ts. On the plus side, putting it in lib.d.ts would make it
|
|
// extensible for Polyfilling Symbols. But putting it into lib.d.ts could also break users that have
|
|
// a global Symbol already, particularly if it is a class.
|
|
globalESSymbolType = createAnonymousType(undefined, emptySymbols, emptyArray, emptyArray, undefined, undefined);
|
|
globalESSymbolConstructorSymbol = undefined;
|
|
globalIterableType = emptyGenericType;
|
|
globalIteratorType = emptyGenericType;
|
|
globalIterableIteratorType = emptyGenericType;
|
|
}
|
|
anyArrayType = createArrayType(anyType);
|
|
}
|
|
function createInstantiatedPromiseLikeType() {
|
|
var promiseLikeType = getGlobalPromiseLikeType();
|
|
if (promiseLikeType !== emptyObjectType) {
|
|
return createTypeReference(promiseLikeType, [anyType]);
|
|
}
|
|
return emptyObjectType;
|
|
}
|
|
function createThenableType() {
|
|
// build the thenable type that is used to verify against a non-promise "thenable" operand to `await`.
|
|
var thenPropertySymbol = createSymbol(67108864 /* Transient */ | 4 /* Property */, "then");
|
|
getSymbolLinks(thenPropertySymbol).type = globalFunctionType;
|
|
var thenableType = createObjectType(65536 /* Anonymous */);
|
|
thenableType.properties = [thenPropertySymbol];
|
|
thenableType.members = createSymbolTable(thenableType.properties);
|
|
thenableType.callSignatures = [];
|
|
thenableType.constructSignatures = [];
|
|
return thenableType;
|
|
}
|
|
// GRAMMAR CHECKING
|
|
function checkGrammarDecorators(node) {
|
|
if (!node.decorators) {
|
|
return false;
|
|
}
|
|
if (!ts.nodeCanBeDecorated(node)) {
|
|
return grammarErrorOnFirstToken(node, ts.Diagnostics.Decorators_are_not_valid_here);
|
|
}
|
|
else if (languageVersion < 1 /* ES5 */) {
|
|
return grammarErrorOnFirstToken(node, ts.Diagnostics.Decorators_are_only_available_when_targeting_ECMAScript_5_and_higher);
|
|
}
|
|
else if (node.kind === 142 /* GetAccessor */ || node.kind === 143 /* 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) {
|
|
switch (node.kind) {
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 141 /* Constructor */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 146 /* IndexSignature */:
|
|
case 215 /* ModuleDeclaration */:
|
|
case 219 /* ImportDeclaration */:
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 225 /* ExportDeclaration */:
|
|
case 224 /* ExportAssignment */:
|
|
case 135 /* Parameter */:
|
|
break;
|
|
case 210 /* FunctionDeclaration */:
|
|
if (node.modifiers && (node.modifiers.length > 1 || node.modifiers[0].kind !== 115 /* AsyncKeyword */) &&
|
|
node.parent.kind !== 216 /* ModuleBlock */ && node.parent.kind !== 245 /* SourceFile */) {
|
|
return grammarErrorOnFirstToken(node, ts.Diagnostics.Modifiers_cannot_appear_here);
|
|
}
|
|
break;
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 190 /* VariableStatement */:
|
|
case 213 /* TypeAliasDeclaration */:
|
|
if (node.modifiers && node.parent.kind !== 216 /* ModuleBlock */ && node.parent.kind !== 245 /* SourceFile */) {
|
|
return grammarErrorOnFirstToken(node, ts.Diagnostics.Modifiers_cannot_appear_here);
|
|
}
|
|
break;
|
|
case 214 /* EnumDeclaration */:
|
|
if (node.modifiers && (node.modifiers.length > 1 || node.modifiers[0].kind !== 71 /* ConstKeyword */) &&
|
|
node.parent.kind !== 216 /* ModuleBlock */ && node.parent.kind !== 245 /* SourceFile */) {
|
|
return grammarErrorOnFirstToken(node, ts.Diagnostics.Modifiers_cannot_appear_here);
|
|
}
|
|
break;
|
|
default:
|
|
return false;
|
|
}
|
|
if (!node.modifiers) {
|
|
return;
|
|
}
|
|
var lastStatic, lastPrivate, lastProtected, lastDeclare, lastAsync;
|
|
var flags = 0;
|
|
for (var _i = 0, _a = node.modifiers; _i < _a.length; _i++) {
|
|
var modifier = _a[_i];
|
|
switch (modifier.kind) {
|
|
case 109 /* PublicKeyword */:
|
|
case 108 /* ProtectedKeyword */:
|
|
case 107 /* PrivateKeyword */:
|
|
var text = void 0;
|
|
if (modifier.kind === 109 /* PublicKeyword */) {
|
|
text = "public";
|
|
}
|
|
else if (modifier.kind === 108 /* ProtectedKeyword */) {
|
|
text = "protected";
|
|
lastProtected = modifier;
|
|
}
|
|
else {
|
|
text = "private";
|
|
lastPrivate = modifier;
|
|
}
|
|
if (flags & 112 /* AccessibilityModifier */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics.Accessibility_modifier_already_seen);
|
|
}
|
|
else if (flags & 128 /* Static */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, text, "static");
|
|
}
|
|
else if (flags & 512 /* Async */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, text, "async");
|
|
}
|
|
else if (node.parent.kind === 216 /* ModuleBlock */ || node.parent.kind === 245 /* SourceFile */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_module_element, text);
|
|
}
|
|
else if (flags & 256 /* Abstract */) {
|
|
if (modifier.kind === 107 /* 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");
|
|
}
|
|
}
|
|
flags |= ts.modifierToFlag(modifier.kind);
|
|
break;
|
|
case 110 /* StaticKeyword */:
|
|
if (flags & 128 /* Static */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_already_seen, "static");
|
|
}
|
|
else if (flags & 512 /* Async */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, "static", "async");
|
|
}
|
|
else if (node.parent.kind === 216 /* ModuleBlock */ || node.parent.kind === 245 /* SourceFile */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_module_element, "static");
|
|
}
|
|
else if (node.kind === 135 /* Parameter */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_parameter, "static");
|
|
}
|
|
else if (flags & 256 /* Abstract */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_with_1_modifier, "static", "abstract");
|
|
}
|
|
flags |= 128 /* Static */;
|
|
lastStatic = modifier;
|
|
break;
|
|
case 79 /* 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 & 256 /* Abstract */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, "export", "abstract");
|
|
}
|
|
else if (flags & 512 /* Async */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_must_precede_1_modifier, "export", "async");
|
|
}
|
|
else if (node.parent.kind === 211 /* ClassDeclaration */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_class_element, "export");
|
|
}
|
|
else if (node.kind === 135 /* Parameter */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_parameter, "export");
|
|
}
|
|
flags |= 1 /* Export */;
|
|
break;
|
|
case 119 /* DeclareKeyword */:
|
|
if (flags & 2 /* Ambient */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_already_seen, "declare");
|
|
}
|
|
else if (flags & 512 /* Async */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_in_an_ambient_context, "async");
|
|
}
|
|
else if (node.parent.kind === 211 /* ClassDeclaration */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_class_element, "declare");
|
|
}
|
|
else if (node.kind === 135 /* Parameter */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_parameter, "declare");
|
|
}
|
|
else if (ts.isInAmbientContext(node.parent) && node.parent.kind === 216 /* ModuleBlock */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics.A_declare_modifier_cannot_be_used_in_an_already_ambient_context);
|
|
}
|
|
flags |= 2 /* Ambient */;
|
|
lastDeclare = modifier;
|
|
break;
|
|
case 112 /* AbstractKeyword */:
|
|
if (flags & 256 /* Abstract */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_already_seen, "abstract");
|
|
}
|
|
if (node.kind !== 211 /* ClassDeclaration */) {
|
|
if (node.kind !== 140 /* MethodDeclaration */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics.abstract_modifier_can_only_appear_on_a_class_or_method_declaration);
|
|
}
|
|
if (!(node.parent.kind === 211 /* ClassDeclaration */ && node.parent.flags & 256 /* Abstract */)) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics.Abstract_methods_can_only_appear_within_an_abstract_class);
|
|
}
|
|
if (flags & 128 /* Static */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_with_1_modifier, "static", "abstract");
|
|
}
|
|
if (flags & 32 /* Private */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_with_1_modifier, "private", "abstract");
|
|
}
|
|
}
|
|
flags |= 256 /* Abstract */;
|
|
break;
|
|
case 115 /* AsyncKeyword */:
|
|
if (flags & 512 /* Async */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_already_seen, "async");
|
|
}
|
|
else if (flags & 2 /* Ambient */ || ts.isInAmbientContext(node.parent)) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_be_used_in_an_ambient_context, "async");
|
|
}
|
|
else if (node.kind === 135 /* Parameter */) {
|
|
return grammarErrorOnNode(modifier, ts.Diagnostics._0_modifier_cannot_appear_on_a_parameter, "async");
|
|
}
|
|
flags |= 512 /* Async */;
|
|
lastAsync = modifier;
|
|
break;
|
|
}
|
|
}
|
|
if (node.kind === 141 /* Constructor */) {
|
|
if (flags & 128 /* Static */) {
|
|
return grammarErrorOnNode(lastStatic, ts.Diagnostics._0_modifier_cannot_appear_on_a_constructor_declaration, "static");
|
|
}
|
|
if (flags & 256 /* Abstract */) {
|
|
return grammarErrorOnNode(lastStatic, ts.Diagnostics._0_modifier_cannot_appear_on_a_constructor_declaration, "abstract");
|
|
}
|
|
else if (flags & 64 /* Protected */) {
|
|
return grammarErrorOnNode(lastProtected, ts.Diagnostics._0_modifier_cannot_appear_on_a_constructor_declaration, "protected");
|
|
}
|
|
else if (flags & 32 /* Private */) {
|
|
return grammarErrorOnNode(lastPrivate, ts.Diagnostics._0_modifier_cannot_appear_on_a_constructor_declaration, "private");
|
|
}
|
|
else if (flags & 512 /* Async */) {
|
|
return grammarErrorOnNode(lastAsync, ts.Diagnostics._0_modifier_cannot_appear_on_a_constructor_declaration, "async");
|
|
}
|
|
return;
|
|
}
|
|
else if ((node.kind === 219 /* ImportDeclaration */ || node.kind === 218 /* ImportEqualsDeclaration */) && flags & 2 /* Ambient */) {
|
|
return grammarErrorOnNode(lastDeclare, ts.Diagnostics.A_0_modifier_cannot_be_used_with_an_import_declaration, "declare");
|
|
}
|
|
else if (node.kind === 135 /* Parameter */ && (flags & 112 /* AccessibilityModifier */) && ts.isBindingPattern(node.name)) {
|
|
return grammarErrorOnNode(node, ts.Diagnostics.A_parameter_property_may_not_be_a_binding_pattern);
|
|
}
|
|
if (flags & 512 /* Async */) {
|
|
return checkGrammarAsyncModifier(node, lastAsync);
|
|
}
|
|
}
|
|
function checkGrammarAsyncModifier(node, asyncModifier) {
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
return grammarErrorOnNode(asyncModifier, ts.Diagnostics.Async_functions_are_only_available_when_targeting_ECMAScript_6_and_higher);
|
|
}
|
|
switch (node.kind) {
|
|
case 140 /* MethodDeclaration */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
if (!node.asteriskToken) {
|
|
return false;
|
|
}
|
|
break;
|
|
}
|
|
return grammarErrorOnNode(asyncModifier, ts.Diagnostics._0_modifier_cannot_be_used_here, "async");
|
|
}
|
|
function checkGrammarForDisallowedTrailingComma(list) {
|
|
if (list && list.hasTrailingComma) {
|
|
var start = list.end - ",".length;
|
|
var end = list.end;
|
|
var sourceFile = ts.getSourceFileOfNode(list[0]);
|
|
return grammarErrorAtPos(sourceFile, start, end - start, ts.Diagnostics.Trailing_comma_not_allowed);
|
|
}
|
|
}
|
|
function checkGrammarTypeParameterList(node, typeParameters, file) {
|
|
if (checkGrammarForDisallowedTrailingComma(typeParameters)) {
|
|
return true;
|
|
}
|
|
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);
|
|
}
|
|
}
|
|
function checkGrammarParameterList(parameters) {
|
|
if (checkGrammarForDisallowedTrailingComma(parameters)) {
|
|
return true;
|
|
}
|
|
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 (ts.isBindingPattern(parameter.name)) {
|
|
return grammarErrorOnNode(parameter.name, ts.Diagnostics.A_rest_element_cannot_contain_a_binding_pattern);
|
|
}
|
|
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 (parameter.questionToken || parameter.initializer) {
|
|
seenOptionalParameter = true;
|
|
if (parameter.questionToken && parameter.initializer) {
|
|
return grammarErrorOnNode(parameter.name, ts.Diagnostics.Parameter_cannot_have_question_mark_and_initializer);
|
|
}
|
|
}
|
|
else {
|
|
if (seenOptionalParameter) {
|
|
return grammarErrorOnNode(parameter.name, ts.Diagnostics.A_required_parameter_cannot_follow_an_optional_parameter);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function checkGrammarFunctionLikeDeclaration(node) {
|
|
// Prevent cascading error by short-circuit
|
|
var file = ts.getSourceFileOfNode(node);
|
|
return checkGrammarDecorators(node) || checkGrammarModifiers(node) || checkGrammarTypeParameterList(node, node.typeParameters, file) ||
|
|
checkGrammarParameterList(node.parameters) || checkGrammarArrowFunction(node, file);
|
|
}
|
|
function checkGrammarArrowFunction(node, file) {
|
|
if (node.kind === 171 /* ArrowFunction */) {
|
|
var arrowFunction = node;
|
|
var startLine = ts.getLineAndCharacterOfPosition(file, arrowFunction.equalsGreaterThanToken.pos).line;
|
|
var endLine = ts.getLineAndCharacterOfPosition(file, arrowFunction.equalsGreaterThanToken.end).line;
|
|
if (startLine !== endLine) {
|
|
return grammarErrorOnNode(arrowFunction.equalsGreaterThanToken, ts.Diagnostics.Line_terminator_not_permitted_before_arrow);
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
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);
|
|
}
|
|
}
|
|
if (parameter.dotDotDotToken) {
|
|
return grammarErrorOnNode(parameter.dotDotDotToken, ts.Diagnostics.An_index_signature_cannot_have_a_rest_parameter);
|
|
}
|
|
if (parameter.flags & 2035 /* Modifier */) {
|
|
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);
|
|
}
|
|
if (parameter.type.kind !== 127 /* StringKeyword */ && parameter.type.kind !== 125 /* NumberKeyword */) {
|
|
return grammarErrorOnNode(parameter.name, ts.Diagnostics.An_index_signature_parameter_type_must_be_string_or_number);
|
|
}
|
|
if (!node.type) {
|
|
return grammarErrorOnNode(node, ts.Diagnostics.An_index_signature_must_have_a_type_annotation);
|
|
}
|
|
}
|
|
function checkGrammarForIndexSignatureModifier(node) {
|
|
if (node.flags & 2035 /* Modifier */) {
|
|
grammarErrorOnFirstToken(node, ts.Diagnostics.Modifiers_not_permitted_on_index_signature_members);
|
|
}
|
|
}
|
|
function checkGrammarIndexSignature(node) {
|
|
// Prevent cascading error by short-circuit
|
|
return checkGrammarDecorators(node) || checkGrammarModifiers(node) || checkGrammarIndexSignatureParameters(node) || checkGrammarForIndexSignatureModifier(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);
|
|
}
|
|
}
|
|
function checkGrammarTypeArguments(node, typeArguments) {
|
|
return checkGrammarForDisallowedTrailingComma(typeArguments) ||
|
|
checkGrammarForAtLeastOneTypeArgument(node, typeArguments);
|
|
}
|
|
function checkGrammarForOmittedArgument(node, args) {
|
|
if (args) {
|
|
var sourceFile = ts.getSourceFileOfNode(node);
|
|
for (var _i = 0; _i < args.length; _i++) {
|
|
var arg = args[_i];
|
|
if (arg.kind === 184 /* OmittedExpression */) {
|
|
return grammarErrorAtPos(sourceFile, arg.pos, 0, ts.Diagnostics.Argument_expression_expected);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function checkGrammarArguments(node, args) {
|
|
return checkGrammarForDisallowedTrailingComma(args) ||
|
|
checkGrammarForOmittedArgument(node, args);
|
|
}
|
|
function checkGrammarHeritageClause(node) {
|
|
var types = node.types;
|
|
if (checkGrammarForDisallowedTrailingComma(types)) {
|
|
return true;
|
|
}
|
|
if (types && types.length === 0) {
|
|
var listType = ts.tokenToString(node.token);
|
|
var sourceFile = ts.getSourceFileOfNode(node);
|
|
return grammarErrorAtPos(sourceFile, types.pos, 0, ts.Diagnostics._0_list_cannot_be_empty, listType);
|
|
}
|
|
}
|
|
function checkGrammarClassDeclarationHeritageClauses(node) {
|
|
var seenExtendsClause = false;
|
|
var seenImplementsClause = false;
|
|
if (!checkGrammarDecorators(node) && !checkGrammarModifiers(node) && node.heritageClauses) {
|
|
for (var _i = 0, _a = node.heritageClauses; _i < _a.length; _i++) {
|
|
var heritageClause = _a[_i];
|
|
if (heritageClause.token === 80 /* 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 === 103 /* 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 === 80 /* ExtendsKeyword */) {
|
|
if (seenExtendsClause) {
|
|
return grammarErrorOnFirstToken(heritageClause, ts.Diagnostics.extends_clause_already_seen);
|
|
}
|
|
seenExtendsClause = true;
|
|
}
|
|
else {
|
|
ts.Debug.assert(heritageClause.token === 103 /* 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 !== 133 /* ComputedPropertyName */) {
|
|
return false;
|
|
}
|
|
var computedPropertyName = node;
|
|
if (computedPropertyName.expression.kind === 178 /* BinaryExpression */ && computedPropertyName.expression.operatorToken.kind === 23 /* CommaToken */) {
|
|
return grammarErrorOnNode(computedPropertyName.expression, ts.Diagnostics.A_comma_expression_is_not_allowed_in_a_computed_property_name);
|
|
}
|
|
}
|
|
function checkGrammarForGenerator(node) {
|
|
if (node.asteriskToken) {
|
|
ts.Debug.assert(node.kind === 210 /* FunctionDeclaration */ ||
|
|
node.kind === 170 /* FunctionExpression */ ||
|
|
node.kind === 140 /* MethodDeclaration */);
|
|
if (ts.isInAmbientContext(node)) {
|
|
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);
|
|
}
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
return grammarErrorOnNode(node.asteriskToken, ts.Diagnostics.Generators_are_only_available_when_targeting_ECMAScript_6_or_higher);
|
|
}
|
|
}
|
|
}
|
|
function checkGrammarForInvalidQuestionMark(node, questionToken, message) {
|
|
if (questionToken) {
|
|
return grammarErrorOnNode(questionToken, message);
|
|
}
|
|
}
|
|
function checkGrammarObjectLiteralExpression(node) {
|
|
var seen = {};
|
|
var Property = 1;
|
|
var GetAccessor = 2;
|
|
var SetAccesor = 4;
|
|
var GetOrSetAccessor = GetAccessor | SetAccesor;
|
|
for (var _i = 0, _a = node.properties; _i < _a.length; _i++) {
|
|
var prop = _a[_i];
|
|
var name_16 = prop.name;
|
|
if (prop.kind === 184 /* OmittedExpression */ ||
|
|
name_16.kind === 133 /* ComputedPropertyName */) {
|
|
// If the name is not a ComputedPropertyName, the grammar checking will skip it
|
|
checkGrammarComputedPropertyName(name_16);
|
|
continue;
|
|
}
|
|
// ECMA-262 11.1.5 Object Initialiser
|
|
// 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;
|
|
if (prop.kind === 242 /* PropertyAssignment */ || prop.kind === 243 /* ShorthandPropertyAssignment */) {
|
|
// Grammar checking for computedPropertName and shorthandPropertyAssignment
|
|
checkGrammarForInvalidQuestionMark(prop, prop.questionToken, ts.Diagnostics.An_object_member_cannot_be_declared_optional);
|
|
if (name_16.kind === 7 /* NumericLiteral */) {
|
|
checkGrammarNumericLiteral(name_16);
|
|
}
|
|
currentKind = Property;
|
|
}
|
|
else if (prop.kind === 140 /* MethodDeclaration */) {
|
|
currentKind = Property;
|
|
}
|
|
else if (prop.kind === 142 /* GetAccessor */) {
|
|
currentKind = GetAccessor;
|
|
}
|
|
else if (prop.kind === 143 /* SetAccessor */) {
|
|
currentKind = SetAccesor;
|
|
}
|
|
else {
|
|
ts.Debug.fail("Unexpected syntax kind:" + prop.kind);
|
|
}
|
|
if (!ts.hasProperty(seen, name_16.text)) {
|
|
seen[name_16.text] = currentKind;
|
|
}
|
|
else {
|
|
var existingKind = seen[name_16.text];
|
|
if (currentKind === Property && existingKind === Property) {
|
|
continue;
|
|
}
|
|
else if ((currentKind & GetOrSetAccessor) && (existingKind & GetOrSetAccessor)) {
|
|
if (existingKind !== GetOrSetAccessor && currentKind !== existingKind) {
|
|
seen[name_16.text] = currentKind | existingKind;
|
|
}
|
|
else {
|
|
return grammarErrorOnNode(name_16, ts.Diagnostics.An_object_literal_cannot_have_multiple_get_Slashset_accessors_with_the_same_name);
|
|
}
|
|
}
|
|
else {
|
|
return grammarErrorOnNode(name_16, ts.Diagnostics.An_object_literal_cannot_have_property_and_accessor_with_the_same_name);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function checkGrammarJsxElement(node) {
|
|
var seen = {};
|
|
for (var _i = 0, _a = node.attributes; _i < _a.length; _i++) {
|
|
var attr = _a[_i];
|
|
if (attr.kind === 236 /* JsxSpreadAttribute */) {
|
|
continue;
|
|
}
|
|
var jsxAttr = attr;
|
|
var name_17 = jsxAttr.name;
|
|
if (!ts.hasProperty(seen, name_17.text)) {
|
|
seen[name_17.text] = true;
|
|
}
|
|
else {
|
|
return grammarErrorOnNode(name_17, ts.Diagnostics.JSX_elements_cannot_have_multiple_attributes_with_the_same_name);
|
|
}
|
|
var initializer = jsxAttr.initializer;
|
|
if (initializer && initializer.kind === 237 /* JsxExpression */ && !initializer.expression) {
|
|
return grammarErrorOnNode(jsxAttr.initializer, ts.Diagnostics.JSX_attributes_must_only_be_assigned_a_non_empty_expression);
|
|
}
|
|
}
|
|
}
|
|
function checkGrammarForInOrForOfStatement(forInOrOfStatement) {
|
|
if (checkGrammarStatementInAmbientContext(forInOrOfStatement)) {
|
|
return true;
|
|
}
|
|
if (forInOrOfStatement.initializer.kind === 209 /* VariableDeclarationList */) {
|
|
var variableList = forInOrOfStatement.initializer;
|
|
if (!checkGrammarVariableDeclarationList(variableList)) {
|
|
if (variableList.declarations.length > 1) {
|
|
var diagnostic = forInOrOfStatement.kind === 197 /* 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 = variableList.declarations[0];
|
|
if (firstDeclaration.initializer) {
|
|
var diagnostic = forInOrOfStatement.kind === 197 /* 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 === 197 /* 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) {
|
|
var kind = accessor.kind;
|
|
if (languageVersion < 1 /* ES5 */) {
|
|
return grammarErrorOnNode(accessor.name, ts.Diagnostics.Accessors_are_only_available_when_targeting_ECMAScript_5_and_higher);
|
|
}
|
|
else if (ts.isInAmbientContext(accessor)) {
|
|
return grammarErrorOnNode(accessor.name, ts.Diagnostics.An_accessor_cannot_be_declared_in_an_ambient_context);
|
|
}
|
|
else if (accessor.body === undefined) {
|
|
return grammarErrorAtPos(ts.getSourceFileOfNode(accessor), accessor.end - 1, ";".length, ts.Diagnostics._0_expected, "{");
|
|
}
|
|
else if (accessor.typeParameters) {
|
|
return grammarErrorOnNode(accessor.name, ts.Diagnostics.An_accessor_cannot_have_type_parameters);
|
|
}
|
|
else if (kind === 142 /* GetAccessor */ && accessor.parameters.length) {
|
|
return grammarErrorOnNode(accessor.name, ts.Diagnostics.A_get_accessor_cannot_have_parameters);
|
|
}
|
|
else if (kind === 143 /* SetAccessor */) {
|
|
if (accessor.type) {
|
|
return grammarErrorOnNode(accessor.name, ts.Diagnostics.A_set_accessor_cannot_have_a_return_type_annotation);
|
|
}
|
|
else if (accessor.parameters.length !== 1) {
|
|
return grammarErrorOnNode(accessor.name, ts.Diagnostics.A_set_accessor_must_have_exactly_one_parameter);
|
|
}
|
|
else {
|
|
var parameter = accessor.parameters[0];
|
|
if (parameter.dotDotDotToken) {
|
|
return grammarErrorOnNode(parameter.dotDotDotToken, ts.Diagnostics.A_set_accessor_cannot_have_rest_parameter);
|
|
}
|
|
else if (parameter.flags & 2035 /* Modifier */) {
|
|
return grammarErrorOnNode(accessor.name, ts.Diagnostics.A_parameter_property_is_only_allowed_in_a_constructor_implementation);
|
|
}
|
|
else if (parameter.questionToken) {
|
|
return grammarErrorOnNode(parameter.questionToken, ts.Diagnostics.A_set_accessor_cannot_have_an_optional_parameter);
|
|
}
|
|
else if (parameter.initializer) {
|
|
return grammarErrorOnNode(accessor.name, ts.Diagnostics.A_set_accessor_parameter_cannot_have_an_initializer);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function checkGrammarForNonSymbolComputedProperty(node, message) {
|
|
if (node.kind === 133 /* ComputedPropertyName */ && !ts.isWellKnownSymbolSyntactically(node.expression)) {
|
|
return grammarErrorOnNode(node, message);
|
|
}
|
|
}
|
|
function checkGrammarMethod(node) {
|
|
if (checkGrammarDisallowedModifiersOnObjectLiteralExpressionMethod(node) ||
|
|
checkGrammarFunctionLikeDeclaration(node) ||
|
|
checkGrammarForGenerator(node)) {
|
|
return true;
|
|
}
|
|
if (node.parent.kind === 162 /* ObjectLiteralExpression */) {
|
|
if (checkGrammarForInvalidQuestionMark(node, node.questionToken, ts.Diagnostics.A_class_member_cannot_be_declared_optional)) {
|
|
return true;
|
|
}
|
|
else if (node.body === undefined) {
|
|
return grammarErrorAtPos(getSourceFile(node), node.end - 1, ";".length, ts.Diagnostics._0_expected, "{");
|
|
}
|
|
}
|
|
if (ts.isClassLike(node.parent)) {
|
|
if (checkGrammarForInvalidQuestionMark(node, node.questionToken, ts.Diagnostics.A_class_member_cannot_be_declared_optional)) {
|
|
return true;
|
|
}
|
|
// 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 (ts.isInAmbientContext(node)) {
|
|
return checkGrammarForNonSymbolComputedProperty(node.name, ts.Diagnostics.A_computed_property_name_in_an_ambient_context_must_directly_refer_to_a_built_in_symbol);
|
|
}
|
|
else if (!node.body) {
|
|
return checkGrammarForNonSymbolComputedProperty(node.name, ts.Diagnostics.A_computed_property_name_in_a_method_overload_must_directly_refer_to_a_built_in_symbol);
|
|
}
|
|
}
|
|
else if (node.parent.kind === 212 /* InterfaceDeclaration */) {
|
|
return checkGrammarForNonSymbolComputedProperty(node.name, ts.Diagnostics.A_computed_property_name_in_an_interface_must_directly_refer_to_a_built_in_symbol);
|
|
}
|
|
else if (node.parent.kind === 152 /* TypeLiteral */) {
|
|
return checkGrammarForNonSymbolComputedProperty(node.name, ts.Diagnostics.A_computed_property_name_in_a_type_literal_must_directly_refer_to_a_built_in_symbol);
|
|
}
|
|
}
|
|
function isIterationStatement(node, lookInLabeledStatements) {
|
|
switch (node.kind) {
|
|
case 196 /* ForStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
case 194 /* DoStatement */:
|
|
case 195 /* WhileStatement */:
|
|
return true;
|
|
case 204 /* LabeledStatement */:
|
|
return lookInLabeledStatements && isIterationStatement(node.statement, lookInLabeledStatements);
|
|
}
|
|
return false;
|
|
}
|
|
function checkGrammarBreakOrContinueStatement(node) {
|
|
var current = node;
|
|
while (current) {
|
|
if (ts.isFunctionLike(current)) {
|
|
return grammarErrorOnNode(node, ts.Diagnostics.Jump_target_cannot_cross_function_boundary);
|
|
}
|
|
switch (current.kind) {
|
|
case 204 /* LabeledStatement */:
|
|
if (node.label && current.label.text === node.label.text) {
|
|
// found matching label - verify that label usage is correct
|
|
// continue can only target labels that are on iteration statements
|
|
var isMisplacedContinueLabel = node.kind === 199 /* ContinueStatement */
|
|
&& !isIterationStatement(current.statement, 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 203 /* SwitchStatement */:
|
|
if (node.kind === 200 /* BreakStatement */ && !node.label) {
|
|
// unlabeled break within switch statement - ok
|
|
return false;
|
|
}
|
|
break;
|
|
default:
|
|
if (isIterationStatement(current, false) && !node.label) {
|
|
// unlabeled break or continue within iteration statement - ok
|
|
return false;
|
|
}
|
|
break;
|
|
}
|
|
current = current.parent;
|
|
}
|
|
if (node.label) {
|
|
var message = node.kind === 200 /* 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 === 200 /* 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.lastOrUndefined(elements)) {
|
|
return grammarErrorOnNode(node, ts.Diagnostics.A_rest_element_must_be_last_in_an_array_destructuring_pattern);
|
|
}
|
|
if (node.name.kind === 159 /* ArrayBindingPattern */ || node.name.kind === 158 /* ObjectBindingPattern */) {
|
|
return grammarErrorOnNode(node.name, ts.Diagnostics.A_rest_element_cannot_contain_a_binding_pattern);
|
|
}
|
|
if (node.initializer) {
|
|
// Error on equals token which immediate precedes the initializer
|
|
return grammarErrorAtPos(ts.getSourceFileOfNode(node), node.initializer.pos - 1, 1, ts.Diagnostics.A_rest_element_cannot_have_an_initializer);
|
|
}
|
|
}
|
|
}
|
|
function checkGrammarVariableDeclaration(node) {
|
|
if (node.parent.parent.kind !== 197 /* ForInStatement */ && node.parent.parent.kind !== 198 /* ForOfStatement */) {
|
|
if (ts.isInAmbientContext(node)) {
|
|
if (node.initializer) {
|
|
// Error on equals token which immediate precedes the initializer
|
|
var equalsTokenLength = "=".length;
|
|
return grammarErrorAtPos(ts.getSourceFileOfNode(node), node.initializer.pos - equalsTokenLength, equalsTokenLength, ts.Diagnostics.Initializers_are_not_allowed_in_ambient_contexts);
|
|
}
|
|
}
|
|
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.isConst(node)) {
|
|
return grammarErrorOnNode(node, ts.Diagnostics.const_declarations_must_be_initialized);
|
|
}
|
|
}
|
|
}
|
|
var checkLetConstNames = languageVersion >= 2 /* ES6 */ && (ts.isLet(node) || ts.isConst(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 checkGrammarNameInLetOrConstDeclarations(name) {
|
|
if (name.kind === 66 /* Identifier */) {
|
|
if (name.text === "let") {
|
|
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; _i < elements.length; _i++) {
|
|
var element = elements[_i];
|
|
if (element.kind !== 184 /* OmittedExpression */) {
|
|
checkGrammarNameInLetOrConstDeclarations(element.name);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function checkGrammarVariableDeclarationList(declarationList) {
|
|
var declarations = declarationList.declarations;
|
|
if (checkGrammarForDisallowedTrailingComma(declarationList.declarations)) {
|
|
return true;
|
|
}
|
|
if (!declarationList.declarations.length) {
|
|
return grammarErrorAtPos(ts.getSourceFileOfNode(declarationList), declarations.pos, declarations.end - declarations.pos, ts.Diagnostics.Variable_declaration_list_cannot_be_empty);
|
|
}
|
|
}
|
|
function allowLetAndConstDeclarations(parent) {
|
|
switch (parent.kind) {
|
|
case 193 /* IfStatement */:
|
|
case 194 /* DoStatement */:
|
|
case 195 /* WhileStatement */:
|
|
case 202 /* WithStatement */:
|
|
case 196 /* ForStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
return false;
|
|
case 204 /* 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.isConst(node.declarationList)) {
|
|
return grammarErrorOnNode(node, ts.Diagnostics.const_declarations_can_only_be_declared_inside_a_block);
|
|
}
|
|
}
|
|
}
|
|
function isIntegerLiteral(expression) {
|
|
if (expression.kind === 176 /* PrefixUnaryExpression */) {
|
|
var unaryExpression = expression;
|
|
if (unaryExpression.operator === 34 /* PlusToken */ || unaryExpression.operator === 35 /* MinusToken */) {
|
|
expression = unaryExpression.operand;
|
|
}
|
|
}
|
|
if (expression.kind === 7 /* NumericLiteral */) {
|
|
// Allows for scientific notation since literalExpression.text was formed by
|
|
// coercing a number to a string. Sometimes this coercion can yield a string
|
|
// in scientific notation.
|
|
// We also don't need special logic for hex because a hex integer is converted
|
|
// to decimal when it is coerced.
|
|
return /^[0-9]+([eE]\+?[0-9]+)?$/.test(expression.text);
|
|
}
|
|
return false;
|
|
}
|
|
function checkGrammarEnumDeclaration(enumDecl) {
|
|
var enumIsConst = (enumDecl.flags & 32768 /* Const */) !== 0;
|
|
var hasError = false;
|
|
// skip checks below for const enums - they allow arbitrary initializers as long as they can be evaluated to constant expressions.
|
|
// since all values are known in compile time - it is not necessary to check that constant enum section precedes computed enum members.
|
|
if (!enumIsConst) {
|
|
var inConstantEnumMemberSection = true;
|
|
var inAmbientContext = ts.isInAmbientContext(enumDecl);
|
|
for (var _i = 0, _a = enumDecl.members; _i < _a.length; _i++) {
|
|
var node = _a[_i];
|
|
// 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 === 133 /* ComputedPropertyName */) {
|
|
hasError = grammarErrorOnNode(node.name, ts.Diagnostics.Computed_property_names_are_not_allowed_in_enums);
|
|
}
|
|
else if (inAmbientContext) {
|
|
if (node.initializer && !isIntegerLiteral(node.initializer)) {
|
|
hasError = grammarErrorOnNode(node.name, ts.Diagnostics.Ambient_enum_elements_can_only_have_integer_literal_initializers) || hasError;
|
|
}
|
|
}
|
|
else if (node.initializer) {
|
|
inConstantEnumMemberSection = isIntegerLiteral(node.initializer);
|
|
}
|
|
else if (!inConstantEnumMemberSection) {
|
|
hasError = grammarErrorOnNode(node.name, ts.Diagnostics.Enum_member_must_have_initializer) || hasError;
|
|
}
|
|
}
|
|
}
|
|
return hasError;
|
|
}
|
|
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;
|
|
}
|
|
}
|
|
function grammarErrorAtPos(sourceFile, start, length, message, arg0, arg1, arg2) {
|
|
if (!hasParseDiagnostics(sourceFile)) {
|
|
diagnostics.add(ts.createFileDiagnostic(sourceFile, start, length, message, arg0, arg1, arg2));
|
|
return true;
|
|
}
|
|
}
|
|
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;
|
|
}
|
|
}
|
|
function isEvalOrArgumentsIdentifier(node) {
|
|
return node.kind === 66 /* Identifier */ &&
|
|
(node.text === "eval" || node.text === "arguments");
|
|
}
|
|
function checkGrammarConstructorTypeParameters(node) {
|
|
if (node.typeParameters) {
|
|
return grammarErrorAtPos(ts.getSourceFileOfNode(node), node.typeParameters.pos, node.typeParameters.end - node.typeParameters.pos, ts.Diagnostics.Type_parameters_cannot_appear_on_a_constructor_declaration);
|
|
}
|
|
}
|
|
function checkGrammarConstructorTypeAnnotation(node) {
|
|
if (node.type) {
|
|
return grammarErrorOnNode(node.type, ts.Diagnostics.Type_annotation_cannot_appear_on_a_constructor_declaration);
|
|
}
|
|
}
|
|
function checkGrammarProperty(node) {
|
|
if (ts.isClassLike(node.parent)) {
|
|
if (checkGrammarForInvalidQuestionMark(node, node.questionToken, ts.Diagnostics.A_class_member_cannot_be_declared_optional) ||
|
|
checkGrammarForNonSymbolComputedProperty(node.name, ts.Diagnostics.A_computed_property_name_in_a_class_property_declaration_must_directly_refer_to_a_built_in_symbol)) {
|
|
return true;
|
|
}
|
|
}
|
|
else if (node.parent.kind === 212 /* InterfaceDeclaration */) {
|
|
if (checkGrammarForNonSymbolComputedProperty(node.name, ts.Diagnostics.A_computed_property_name_in_an_interface_must_directly_refer_to_a_built_in_symbol)) {
|
|
return true;
|
|
}
|
|
}
|
|
else if (node.parent.kind === 152 /* TypeLiteral */) {
|
|
if (checkGrammarForNonSymbolComputedProperty(node.name, ts.Diagnostics.A_computed_property_name_in_a_type_literal_must_directly_refer_to_a_built_in_symbol)) {
|
|
return true;
|
|
}
|
|
}
|
|
if (ts.isInAmbientContext(node) && node.initializer) {
|
|
return grammarErrorOnFirstToken(node.initializer, ts.Diagnostics.Initializers_are_not_allowed_in_ambient_contexts);
|
|
}
|
|
}
|
|
function checkGrammarTopLevelElementForRequiredDeclareModifier(node) {
|
|
// A declare modifier is required for any top level .d.ts declaration except export=, export default,
|
|
// interfaces and imports categories:
|
|
//
|
|
// DeclarationElement:
|
|
// ExportAssignment
|
|
// export_opt InterfaceDeclaration
|
|
// export_opt ImportDeclaration
|
|
// export_opt ExternalImportDeclaration
|
|
// export_opt AmbientDeclaration
|
|
//
|
|
if (node.kind === 212 /* InterfaceDeclaration */ ||
|
|
node.kind === 219 /* ImportDeclaration */ ||
|
|
node.kind === 218 /* ImportEqualsDeclaration */ ||
|
|
node.kind === 225 /* ExportDeclaration */ ||
|
|
node.kind === 224 /* ExportAssignment */ ||
|
|
(node.flags & 2 /* Ambient */) ||
|
|
(node.flags & (1 /* Export */ | 1024 /* Default */))) {
|
|
return false;
|
|
}
|
|
return grammarErrorOnFirstToken(node, ts.Diagnostics.A_declare_modifier_is_required_for_a_top_level_declaration_in_a_d_ts_file);
|
|
}
|
|
function checkGrammarTopLevelElementsForRequiredDeclareModifier(file) {
|
|
for (var _i = 0, _a = file.statements; _i < _a.length; _i++) {
|
|
var decl = _a[_i];
|
|
if (ts.isDeclaration(decl) || decl.kind === 190 /* VariableStatement */) {
|
|
if (checkGrammarTopLevelElementForRequiredDeclareModifier(decl)) {
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function checkGrammarSourceFile(node) {
|
|
return ts.isInAmbientContext(node) && checkGrammarTopLevelElementsForRequiredDeclareModifier(node);
|
|
}
|
|
function checkGrammarStatementInAmbientContext(node) {
|
|
if (ts.isInAmbientContext(node)) {
|
|
// An accessors is already reported about the ambient context
|
|
if (isAccessor(node.parent.kind)) {
|
|
return getNodeLinks(node).hasReportedStatementInAmbientContext = true;
|
|
}
|
|
// Find containing block which is either Block, ModuleBlock, SourceFile
|
|
var links = getNodeLinks(node);
|
|
if (!links.hasReportedStatementInAmbientContext && ts.isFunctionLike(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 noisyness. 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 === 189 /* Block */ || node.parent.kind === 216 /* ModuleBlock */ || node.parent.kind === 245 /* SourceFile */) {
|
|
var links_1 = getNodeLinks(node.parent);
|
|
// Check if the containing block ever report this error
|
|
if (!links_1.hasReportedStatementInAmbientContext) {
|
|
return links_1.hasReportedStatementInAmbientContext = grammarErrorOnFirstToken(node, ts.Diagnostics.Statements_are_not_allowed_in_ambient_contexts);
|
|
}
|
|
}
|
|
else {
|
|
}
|
|
}
|
|
}
|
|
function checkGrammarNumericLiteral(node) {
|
|
// Grammar checking
|
|
if (node.flags & 65536 /* OctalLiteral */ && languageVersion >= 1 /* ES5 */) {
|
|
return grammarErrorOnNode(node, ts.Diagnostics.Octal_literals_are_not_available_when_targeting_ECMAScript_5_and_higher);
|
|
}
|
|
}
|
|
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), 0, message, arg0, arg1, arg2));
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
ts.createTypeChecker = createTypeChecker;
|
|
})(ts || (ts = {}));
|
|
/// <reference path="checker.ts"/>
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
function getDeclarationDiagnostics(host, resolver, targetSourceFile) {
|
|
var diagnostics = [];
|
|
var jsFilePath = ts.getOwnEmitOutputFilePath(targetSourceFile, host, ".js");
|
|
emitDeclarations(host, resolver, diagnostics, jsFilePath, targetSourceFile);
|
|
return diagnostics;
|
|
}
|
|
ts.getDeclarationDiagnostics = getDeclarationDiagnostics;
|
|
function emitDeclarations(host, resolver, diagnostics, jsFilePath, root) {
|
|
var newLine = host.getNewLine();
|
|
var compilerOptions = host.getCompilerOptions();
|
|
var write;
|
|
var writeLine;
|
|
var increaseIndent;
|
|
var decreaseIndent;
|
|
var writeTextOfNode;
|
|
var writer = createAndSetNewTextWriterWithSymbolWriter();
|
|
var enclosingDeclaration;
|
|
var currentSourceFile;
|
|
var reportedDeclarationError = false;
|
|
var emitJsDocComments = compilerOptions.removeComments ? function (declaration) { } : writeJsDocComments;
|
|
var emit = compilerOptions.stripInternal ? stripInternal : emitNode;
|
|
var moduleElementDeclarationEmitInfo = [];
|
|
var asynchronousSubModuleDeclarationEmitInfo;
|
|
// Contains the reference paths that needs to go in the declaration file.
|
|
// Collecting this separately because reference paths need to be first thing in the declaration file
|
|
// and we could be collecting these paths from multiple files into single one with --out option
|
|
var referencePathsOutput = "";
|
|
if (root) {
|
|
// Emitting just a single file, so emit references in this file only
|
|
if (!compilerOptions.noResolve) {
|
|
var addedGlobalFileReference = false;
|
|
ts.forEach(root.referencedFiles, function (fileReference) {
|
|
var referencedFile = ts.tryResolveScriptReference(host, root, fileReference);
|
|
// All the references that are not going to be part of same file
|
|
if (referencedFile && ((referencedFile.flags & 8192 /* DeclarationFile */) ||
|
|
ts.shouldEmitToOwnFile(referencedFile, compilerOptions) ||
|
|
!addedGlobalFileReference)) {
|
|
writeReferencePath(referencedFile);
|
|
if (!ts.isExternalModuleOrDeclarationFile(referencedFile)) {
|
|
addedGlobalFileReference = true;
|
|
}
|
|
}
|
|
});
|
|
}
|
|
emitSourceFile(root);
|
|
// create asynchronous output for the importDeclarations
|
|
if (moduleElementDeclarationEmitInfo.length) {
|
|
var oldWriter = writer;
|
|
ts.forEach(moduleElementDeclarationEmitInfo, function (aliasEmitInfo) {
|
|
if (aliasEmitInfo.isVisible) {
|
|
ts.Debug.assert(aliasEmitInfo.node.kind === 219 /* ImportDeclaration */);
|
|
createAndSetNewTextWriterWithSymbolWriter();
|
|
ts.Debug.assert(aliasEmitInfo.indent === 0);
|
|
writeImportDeclaration(aliasEmitInfo.node);
|
|
aliasEmitInfo.asynchronousOutput = writer.getText();
|
|
}
|
|
});
|
|
setWriter(oldWriter);
|
|
}
|
|
}
|
|
else {
|
|
// Emit references corresponding to this file
|
|
var emittedReferencedFiles = [];
|
|
ts.forEach(host.getSourceFiles(), function (sourceFile) {
|
|
if (!ts.isExternalModuleOrDeclarationFile(sourceFile)) {
|
|
// Check what references need to be added
|
|
if (!compilerOptions.noResolve) {
|
|
ts.forEach(sourceFile.referencedFiles, function (fileReference) {
|
|
var referencedFile = ts.tryResolveScriptReference(host, sourceFile, fileReference);
|
|
// If the reference file is a declaration file or an external module, emit that reference
|
|
if (referencedFile && (ts.isExternalModuleOrDeclarationFile(referencedFile) &&
|
|
!ts.contains(emittedReferencedFiles, referencedFile))) {
|
|
writeReferencePath(referencedFile);
|
|
emittedReferencedFiles.push(referencedFile);
|
|
}
|
|
});
|
|
}
|
|
emitSourceFile(sourceFile);
|
|
}
|
|
});
|
|
}
|
|
return {
|
|
reportedDeclarationError: reportedDeclarationError,
|
|
moduleElementDeclarationEmitInfo: moduleElementDeclarationEmitInfo,
|
|
synchronousDeclarationOutput: writer.getText(),
|
|
referencePathsOutput: referencePathsOutput
|
|
};
|
|
function hasInternalAnnotation(range) {
|
|
var text = currentSourceFile.text;
|
|
var comment = text.substring(range.pos, range.end);
|
|
return comment.indexOf("@internal") >= 0;
|
|
}
|
|
function stripInternal(node) {
|
|
if (node) {
|
|
var leadingCommentRanges = ts.getLeadingCommentRanges(currentSourceFile.text, node.pos);
|
|
if (ts.forEach(leadingCommentRanges, hasInternalAnnotation)) {
|
|
return;
|
|
}
|
|
emitNode(node);
|
|
}
|
|
}
|
|
function createAndSetNewTextWriterWithSymbolWriter() {
|
|
var writer = ts.createTextWriter(newLine);
|
|
writer.trackSymbol = trackSymbol;
|
|
writer.writeKeyword = writer.write;
|
|
writer.writeOperator = writer.write;
|
|
writer.writePunctuation = writer.write;
|
|
writer.writeSpace = writer.write;
|
|
writer.writeStringLiteral = writer.writeLiteral;
|
|
writer.writeParameter = writer.write;
|
|
writer.writeSymbol = writer.write;
|
|
setWriter(writer);
|
|
return writer;
|
|
}
|
|
function setWriter(newWriter) {
|
|
writer = newWriter;
|
|
write = newWriter.write;
|
|
writeTextOfNode = newWriter.writeTextOfNode;
|
|
writeLine = newWriter.writeLine;
|
|
increaseIndent = newWriter.increaseIndent;
|
|
decreaseIndent = newWriter.decreaseIndent;
|
|
}
|
|
function writeAsynchronousModuleElements(nodes) {
|
|
var oldWriter = writer;
|
|
ts.forEach(nodes, function (declaration) {
|
|
var nodeToCheck;
|
|
if (declaration.kind === 208 /* VariableDeclaration */) {
|
|
nodeToCheck = declaration.parent.parent;
|
|
}
|
|
else if (declaration.kind === 222 /* NamedImports */ || declaration.kind === 223 /* ImportSpecifier */ || declaration.kind === 220 /* ImportClause */) {
|
|
ts.Debug.fail("We should be getting ImportDeclaration instead to write");
|
|
}
|
|
else {
|
|
nodeToCheck = declaration;
|
|
}
|
|
var moduleElementEmitInfo = ts.forEach(moduleElementDeclarationEmitInfo, function (declEmitInfo) { return declEmitInfo.node === nodeToCheck ? declEmitInfo : undefined; });
|
|
if (!moduleElementEmitInfo && asynchronousSubModuleDeclarationEmitInfo) {
|
|
moduleElementEmitInfo = ts.forEach(asynchronousSubModuleDeclarationEmitInfo, function (declEmitInfo) { return declEmitInfo.node === nodeToCheck ? declEmitInfo : undefined; });
|
|
}
|
|
// If the alias was marked as not visible when we saw its declaration, we would have saved the aliasEmitInfo, but if we haven't yet visited the alias declaration
|
|
// then we don't need to write it at this point. We will write it when we actually see its declaration
|
|
// Eg.
|
|
// export function bar(a: foo.Foo) { }
|
|
// import foo = require("foo");
|
|
// Writing of function bar would mark alias declaration foo as visible but we haven't yet visited that declaration so do nothing,
|
|
// we would write alias foo declaration when we visit it since it would now be marked as visible
|
|
if (moduleElementEmitInfo) {
|
|
if (moduleElementEmitInfo.node.kind === 219 /* ImportDeclaration */) {
|
|
// we have to create asynchronous output only after we have collected complete information
|
|
// because it is possible to enable multiple bindings as asynchronously visible
|
|
moduleElementEmitInfo.isVisible = true;
|
|
}
|
|
else {
|
|
createAndSetNewTextWriterWithSymbolWriter();
|
|
for (var declarationIndent = moduleElementEmitInfo.indent; declarationIndent; declarationIndent--) {
|
|
increaseIndent();
|
|
}
|
|
if (nodeToCheck.kind === 215 /* ModuleDeclaration */) {
|
|
ts.Debug.assert(asynchronousSubModuleDeclarationEmitInfo === undefined);
|
|
asynchronousSubModuleDeclarationEmitInfo = [];
|
|
}
|
|
writeModuleElement(nodeToCheck);
|
|
if (nodeToCheck.kind === 215 /* ModuleDeclaration */) {
|
|
moduleElementEmitInfo.subModuleElementDeclarationEmitInfo = asynchronousSubModuleDeclarationEmitInfo;
|
|
asynchronousSubModuleDeclarationEmitInfo = undefined;
|
|
}
|
|
moduleElementEmitInfo.asynchronousOutput = writer.getText();
|
|
}
|
|
}
|
|
});
|
|
setWriter(oldWriter);
|
|
}
|
|
function handleSymbolAccessibilityError(symbolAccesibilityResult) {
|
|
if (symbolAccesibilityResult.accessibility === 0 /* Accessible */) {
|
|
// write the aliases
|
|
if (symbolAccesibilityResult && symbolAccesibilityResult.aliasesToMakeVisible) {
|
|
writeAsynchronousModuleElements(symbolAccesibilityResult.aliasesToMakeVisible);
|
|
}
|
|
}
|
|
else {
|
|
// Report error
|
|
reportedDeclarationError = true;
|
|
var errorInfo = writer.getSymbolAccessibilityDiagnostic(symbolAccesibilityResult);
|
|
if (errorInfo) {
|
|
if (errorInfo.typeName) {
|
|
diagnostics.push(ts.createDiagnosticForNode(symbolAccesibilityResult.errorNode || errorInfo.errorNode, errorInfo.diagnosticMessage, ts.getSourceTextOfNodeFromSourceFile(currentSourceFile, errorInfo.typeName), symbolAccesibilityResult.errorSymbolName, symbolAccesibilityResult.errorModuleName));
|
|
}
|
|
else {
|
|
diagnostics.push(ts.createDiagnosticForNode(symbolAccesibilityResult.errorNode || errorInfo.errorNode, errorInfo.diagnosticMessage, symbolAccesibilityResult.errorSymbolName, symbolAccesibilityResult.errorModuleName));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function trackSymbol(symbol, enclosingDeclaration, meaning) {
|
|
handleSymbolAccessibilityError(resolver.isSymbolAccessible(symbol, enclosingDeclaration, meaning));
|
|
}
|
|
function writeTypeOfDeclaration(declaration, type, getSymbolAccessibilityDiagnostic) {
|
|
writer.getSymbolAccessibilityDiagnostic = getSymbolAccessibilityDiagnostic;
|
|
write(": ");
|
|
if (type) {
|
|
// Write the type
|
|
emitType(type);
|
|
}
|
|
else {
|
|
resolver.writeTypeOfDeclaration(declaration, enclosingDeclaration, 2 /* UseTypeOfFunction */, writer);
|
|
}
|
|
}
|
|
function writeReturnTypeAtSignature(signature, getSymbolAccessibilityDiagnostic) {
|
|
writer.getSymbolAccessibilityDiagnostic = getSymbolAccessibilityDiagnostic;
|
|
write(": ");
|
|
if (signature.type) {
|
|
// Write the type
|
|
emitType(signature.type);
|
|
}
|
|
else {
|
|
resolver.writeReturnTypeOfSignatureDeclaration(signature, enclosingDeclaration, 2 /* UseTypeOfFunction */, writer);
|
|
}
|
|
}
|
|
function emitLines(nodes) {
|
|
for (var _i = 0; _i < nodes.length; _i++) {
|
|
var node = nodes[_i];
|
|
emit(node);
|
|
}
|
|
}
|
|
function emitSeparatedList(nodes, separator, eachNodeEmitFn, canEmitFn) {
|
|
var currentWriterPos = writer.getTextPos();
|
|
for (var _i = 0; _i < nodes.length; _i++) {
|
|
var node = nodes[_i];
|
|
if (!canEmitFn || canEmitFn(node)) {
|
|
if (currentWriterPos !== writer.getTextPos()) {
|
|
write(separator);
|
|
}
|
|
currentWriterPos = writer.getTextPos();
|
|
eachNodeEmitFn(node);
|
|
}
|
|
}
|
|
}
|
|
function emitCommaList(nodes, eachNodeEmitFn, canEmitFn) {
|
|
emitSeparatedList(nodes, ", ", eachNodeEmitFn, canEmitFn);
|
|
}
|
|
function writeJsDocComments(declaration) {
|
|
if (declaration) {
|
|
var jsDocComments = ts.getJsDocComments(declaration, currentSourceFile);
|
|
ts.emitNewLineBeforeLeadingComments(currentSourceFile, writer, declaration, jsDocComments);
|
|
// jsDoc comments are emitted at /*leading comment1 */space/*leading comment*/space
|
|
ts.emitComments(currentSourceFile, writer, jsDocComments, true, newLine, ts.writeCommentRange);
|
|
}
|
|
}
|
|
function emitTypeWithNewGetSymbolAccessibilityDiagnostic(type, getSymbolAccessibilityDiagnostic) {
|
|
writer.getSymbolAccessibilityDiagnostic = getSymbolAccessibilityDiagnostic;
|
|
emitType(type);
|
|
}
|
|
function emitType(type) {
|
|
switch (type.kind) {
|
|
case 114 /* AnyKeyword */:
|
|
case 127 /* StringKeyword */:
|
|
case 125 /* NumberKeyword */:
|
|
case 117 /* BooleanKeyword */:
|
|
case 128 /* SymbolKeyword */:
|
|
case 100 /* VoidKeyword */:
|
|
case 8 /* StringLiteral */:
|
|
return writeTextOfNode(currentSourceFile, type);
|
|
case 185 /* ExpressionWithTypeArguments */:
|
|
return emitExpressionWithTypeArguments(type);
|
|
case 148 /* TypeReference */:
|
|
return emitTypeReference(type);
|
|
case 151 /* TypeQuery */:
|
|
return emitTypeQuery(type);
|
|
case 153 /* ArrayType */:
|
|
return emitArrayType(type);
|
|
case 154 /* TupleType */:
|
|
return emitTupleType(type);
|
|
case 155 /* UnionType */:
|
|
return emitUnionType(type);
|
|
case 156 /* IntersectionType */:
|
|
return emitIntersectionType(type);
|
|
case 157 /* ParenthesizedType */:
|
|
return emitParenType(type);
|
|
case 149 /* FunctionType */:
|
|
case 150 /* ConstructorType */:
|
|
return emitSignatureDeclarationWithJsDocComments(type);
|
|
case 152 /* TypeLiteral */:
|
|
return emitTypeLiteral(type);
|
|
case 66 /* Identifier */:
|
|
return emitEntityName(type);
|
|
case 132 /* QualifiedName */:
|
|
return emitEntityName(type);
|
|
case 147 /* TypePredicate */:
|
|
return emitTypePredicate(type);
|
|
}
|
|
function writeEntityName(entityName) {
|
|
if (entityName.kind === 66 /* Identifier */) {
|
|
writeTextOfNode(currentSourceFile, entityName);
|
|
}
|
|
else {
|
|
var left = entityName.kind === 132 /* QualifiedName */ ? entityName.left : entityName.expression;
|
|
var right = entityName.kind === 132 /* QualifiedName */ ? entityName.right : entityName.name;
|
|
writeEntityName(left);
|
|
write(".");
|
|
writeTextOfNode(currentSourceFile, right);
|
|
}
|
|
}
|
|
function emitEntityName(entityName) {
|
|
var visibilityResult = resolver.isEntityNameVisible(entityName,
|
|
// Aliases can be written asynchronously so use correct enclosing declaration
|
|
entityName.parent.kind === 218 /* ImportEqualsDeclaration */ ? entityName.parent : enclosingDeclaration);
|
|
handleSymbolAccessibilityError(visibilityResult);
|
|
writeEntityName(entityName);
|
|
}
|
|
function emitExpressionWithTypeArguments(node) {
|
|
if (ts.isSupportedExpressionWithTypeArguments(node)) {
|
|
ts.Debug.assert(node.expression.kind === 66 /* Identifier */ || node.expression.kind === 163 /* PropertyAccessExpression */);
|
|
emitEntityName(node.expression);
|
|
if (node.typeArguments) {
|
|
write("<");
|
|
emitCommaList(node.typeArguments, emitType);
|
|
write(">");
|
|
}
|
|
}
|
|
}
|
|
function emitTypeReference(type) {
|
|
emitEntityName(type.typeName);
|
|
if (type.typeArguments) {
|
|
write("<");
|
|
emitCommaList(type.typeArguments, emitType);
|
|
write(">");
|
|
}
|
|
}
|
|
function emitTypePredicate(type) {
|
|
writeTextOfNode(currentSourceFile, type.parameterName);
|
|
write(" is ");
|
|
emitType(type.type);
|
|
}
|
|
function emitTypeQuery(type) {
|
|
write("typeof ");
|
|
emitEntityName(type.exprName);
|
|
}
|
|
function emitArrayType(type) {
|
|
emitType(type.elementType);
|
|
write("[]");
|
|
}
|
|
function emitTupleType(type) {
|
|
write("[");
|
|
emitCommaList(type.elementTypes, emitType);
|
|
write("]");
|
|
}
|
|
function emitUnionType(type) {
|
|
emitSeparatedList(type.types, " | ", emitType);
|
|
}
|
|
function emitIntersectionType(type) {
|
|
emitSeparatedList(type.types, " & ", emitType);
|
|
}
|
|
function emitParenType(type) {
|
|
write("(");
|
|
emitType(type.type);
|
|
write(")");
|
|
}
|
|
function emitTypeLiteral(type) {
|
|
write("{");
|
|
if (type.members.length) {
|
|
writeLine();
|
|
increaseIndent();
|
|
// write members
|
|
emitLines(type.members);
|
|
decreaseIndent();
|
|
}
|
|
write("}");
|
|
}
|
|
}
|
|
function emitSourceFile(node) {
|
|
currentSourceFile = node;
|
|
enclosingDeclaration = node;
|
|
emitLines(node.statements);
|
|
}
|
|
// Return a temp variable name to be used in `export default` statements.
|
|
// The temp name will be of the form _default_counter.
|
|
// Note that export default is only allowed at most once in a module, so we
|
|
// do not need to keep track of created temp names.
|
|
function getExportDefaultTempVariableName() {
|
|
var baseName = "_default";
|
|
if (!ts.hasProperty(currentSourceFile.identifiers, baseName)) {
|
|
return baseName;
|
|
}
|
|
var count = 0;
|
|
while (true) {
|
|
var name_18 = baseName + "_" + (++count);
|
|
if (!ts.hasProperty(currentSourceFile.identifiers, name_18)) {
|
|
return name_18;
|
|
}
|
|
}
|
|
}
|
|
function emitExportAssignment(node) {
|
|
if (node.expression.kind === 66 /* Identifier */) {
|
|
write(node.isExportEquals ? "export = " : "export default ");
|
|
writeTextOfNode(currentSourceFile, node.expression);
|
|
}
|
|
else {
|
|
// Expression
|
|
var tempVarName = getExportDefaultTempVariableName();
|
|
write("declare var ");
|
|
write(tempVarName);
|
|
write(": ");
|
|
writer.getSymbolAccessibilityDiagnostic = getDefaultExportAccessibilityDiagnostic;
|
|
resolver.writeTypeOfExpression(node.expression, enclosingDeclaration, 2 /* UseTypeOfFunction */, writer);
|
|
write(";");
|
|
writeLine();
|
|
write(node.isExportEquals ? "export = " : "export default ");
|
|
write(tempVarName);
|
|
}
|
|
write(";");
|
|
writeLine();
|
|
// Make all the declarations visible for the export name
|
|
if (node.expression.kind === 66 /* Identifier */) {
|
|
var nodes = resolver.collectLinkedAliases(node.expression);
|
|
// write each of these declarations asynchronously
|
|
writeAsynchronousModuleElements(nodes);
|
|
}
|
|
function getDefaultExportAccessibilityDiagnostic(diagnostic) {
|
|
return {
|
|
diagnosticMessage: ts.Diagnostics.Default_export_of_the_module_has_or_is_using_private_name_0,
|
|
errorNode: node
|
|
};
|
|
}
|
|
}
|
|
function isModuleElementVisible(node) {
|
|
return resolver.isDeclarationVisible(node);
|
|
}
|
|
function emitModuleElement(node, isModuleElementVisible) {
|
|
if (isModuleElementVisible) {
|
|
writeModuleElement(node);
|
|
}
|
|
else if (node.kind === 218 /* ImportEqualsDeclaration */ ||
|
|
(node.parent.kind === 245 /* SourceFile */ && ts.isExternalModule(currentSourceFile))) {
|
|
var isVisible;
|
|
if (asynchronousSubModuleDeclarationEmitInfo && node.parent.kind !== 245 /* SourceFile */) {
|
|
// Import declaration of another module that is visited async so lets put it in right spot
|
|
asynchronousSubModuleDeclarationEmitInfo.push({
|
|
node: node,
|
|
outputPos: writer.getTextPos(),
|
|
indent: writer.getIndent(),
|
|
isVisible: isVisible
|
|
});
|
|
}
|
|
else {
|
|
if (node.kind === 219 /* ImportDeclaration */) {
|
|
var importDeclaration = node;
|
|
if (importDeclaration.importClause) {
|
|
isVisible = (importDeclaration.importClause.name && resolver.isDeclarationVisible(importDeclaration.importClause)) ||
|
|
isVisibleNamedBinding(importDeclaration.importClause.namedBindings);
|
|
}
|
|
}
|
|
moduleElementDeclarationEmitInfo.push({
|
|
node: node,
|
|
outputPos: writer.getTextPos(),
|
|
indent: writer.getIndent(),
|
|
isVisible: isVisible
|
|
});
|
|
}
|
|
}
|
|
}
|
|
function writeModuleElement(node) {
|
|
switch (node.kind) {
|
|
case 210 /* FunctionDeclaration */:
|
|
return writeFunctionDeclaration(node);
|
|
case 190 /* VariableStatement */:
|
|
return writeVariableStatement(node);
|
|
case 212 /* InterfaceDeclaration */:
|
|
return writeInterfaceDeclaration(node);
|
|
case 211 /* ClassDeclaration */:
|
|
return writeClassDeclaration(node);
|
|
case 213 /* TypeAliasDeclaration */:
|
|
return writeTypeAliasDeclaration(node);
|
|
case 214 /* EnumDeclaration */:
|
|
return writeEnumDeclaration(node);
|
|
case 215 /* ModuleDeclaration */:
|
|
return writeModuleDeclaration(node);
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
return writeImportEqualsDeclaration(node);
|
|
case 219 /* ImportDeclaration */:
|
|
return writeImportDeclaration(node);
|
|
default:
|
|
ts.Debug.fail("Unknown symbol kind");
|
|
}
|
|
}
|
|
function emitModuleElementDeclarationFlags(node) {
|
|
// If the node is parented in the current source file we need to emit export declare or just export
|
|
if (node.parent === currentSourceFile) {
|
|
// If the node is exported
|
|
if (node.flags & 1 /* Export */) {
|
|
write("export ");
|
|
}
|
|
if (node.flags & 1024 /* Default */) {
|
|
write("default ");
|
|
}
|
|
else if (node.kind !== 212 /* InterfaceDeclaration */) {
|
|
write("declare ");
|
|
}
|
|
}
|
|
}
|
|
function emitClassMemberDeclarationFlags(node) {
|
|
if (node.flags & 32 /* Private */) {
|
|
write("private ");
|
|
}
|
|
else if (node.flags & 64 /* Protected */) {
|
|
write("protected ");
|
|
}
|
|
if (node.flags & 128 /* Static */) {
|
|
write("static ");
|
|
}
|
|
if (node.flags & 256 /* Abstract */) {
|
|
write("abstract ");
|
|
}
|
|
}
|
|
function writeImportEqualsDeclaration(node) {
|
|
// note usage of writer. methods instead of aliases created, just to make sure we are using
|
|
// correct writer especially to handle asynchronous alias writing
|
|
emitJsDocComments(node);
|
|
if (node.flags & 1 /* Export */) {
|
|
write("export ");
|
|
}
|
|
write("import ");
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
write(" = ");
|
|
if (ts.isInternalModuleImportEqualsDeclaration(node)) {
|
|
emitTypeWithNewGetSymbolAccessibilityDiagnostic(node.moduleReference, getImportEntityNameVisibilityError);
|
|
write(";");
|
|
}
|
|
else {
|
|
write("require(");
|
|
writeTextOfNode(currentSourceFile, ts.getExternalModuleImportEqualsDeclarationExpression(node));
|
|
write(");");
|
|
}
|
|
writer.writeLine();
|
|
function getImportEntityNameVisibilityError(symbolAccesibilityResult) {
|
|
return {
|
|
diagnosticMessage: ts.Diagnostics.Import_declaration_0_is_using_private_name_1,
|
|
errorNode: node,
|
|
typeName: node.name
|
|
};
|
|
}
|
|
}
|
|
function isVisibleNamedBinding(namedBindings) {
|
|
if (namedBindings) {
|
|
if (namedBindings.kind === 221 /* NamespaceImport */) {
|
|
return resolver.isDeclarationVisible(namedBindings);
|
|
}
|
|
else {
|
|
return ts.forEach(namedBindings.elements, function (namedImport) { return resolver.isDeclarationVisible(namedImport); });
|
|
}
|
|
}
|
|
}
|
|
function writeImportDeclaration(node) {
|
|
if (!node.importClause && !(node.flags & 1 /* Export */)) {
|
|
// do not write non-exported import declarations that don't have import clauses
|
|
return;
|
|
}
|
|
emitJsDocComments(node);
|
|
if (node.flags & 1 /* Export */) {
|
|
write("export ");
|
|
}
|
|
write("import ");
|
|
if (node.importClause) {
|
|
var currentWriterPos = writer.getTextPos();
|
|
if (node.importClause.name && resolver.isDeclarationVisible(node.importClause)) {
|
|
writeTextOfNode(currentSourceFile, node.importClause.name);
|
|
}
|
|
if (node.importClause.namedBindings && isVisibleNamedBinding(node.importClause.namedBindings)) {
|
|
if (currentWriterPos !== writer.getTextPos()) {
|
|
// If the default binding was emitted, write the separated
|
|
write(", ");
|
|
}
|
|
if (node.importClause.namedBindings.kind === 221 /* NamespaceImport */) {
|
|
write("* as ");
|
|
writeTextOfNode(currentSourceFile, node.importClause.namedBindings.name);
|
|
}
|
|
else {
|
|
write("{ ");
|
|
emitCommaList(node.importClause.namedBindings.elements, emitImportOrExportSpecifier, resolver.isDeclarationVisible);
|
|
write(" }");
|
|
}
|
|
}
|
|
write(" from ");
|
|
}
|
|
writeTextOfNode(currentSourceFile, node.moduleSpecifier);
|
|
write(";");
|
|
writer.writeLine();
|
|
}
|
|
function emitImportOrExportSpecifier(node) {
|
|
if (node.propertyName) {
|
|
writeTextOfNode(currentSourceFile, node.propertyName);
|
|
write(" as ");
|
|
}
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
}
|
|
function emitExportSpecifier(node) {
|
|
emitImportOrExportSpecifier(node);
|
|
// Make all the declarations visible for the export name
|
|
var nodes = resolver.collectLinkedAliases(node.propertyName || node.name);
|
|
// write each of these declarations asynchronously
|
|
writeAsynchronousModuleElements(nodes);
|
|
}
|
|
function emitExportDeclaration(node) {
|
|
emitJsDocComments(node);
|
|
write("export ");
|
|
if (node.exportClause) {
|
|
write("{ ");
|
|
emitCommaList(node.exportClause.elements, emitExportSpecifier);
|
|
write(" }");
|
|
}
|
|
else {
|
|
write("*");
|
|
}
|
|
if (node.moduleSpecifier) {
|
|
write(" from ");
|
|
writeTextOfNode(currentSourceFile, node.moduleSpecifier);
|
|
}
|
|
write(";");
|
|
writer.writeLine();
|
|
}
|
|
function writeModuleDeclaration(node) {
|
|
emitJsDocComments(node);
|
|
emitModuleElementDeclarationFlags(node);
|
|
if (node.flags & 131072 /* Namespace */) {
|
|
write("namespace ");
|
|
}
|
|
else {
|
|
write("module ");
|
|
}
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
while (node.body.kind !== 216 /* ModuleBlock */) {
|
|
node = node.body;
|
|
write(".");
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
}
|
|
var prevEnclosingDeclaration = enclosingDeclaration;
|
|
enclosingDeclaration = node;
|
|
write(" {");
|
|
writeLine();
|
|
increaseIndent();
|
|
emitLines(node.body.statements);
|
|
decreaseIndent();
|
|
write("}");
|
|
writeLine();
|
|
enclosingDeclaration = prevEnclosingDeclaration;
|
|
}
|
|
function writeTypeAliasDeclaration(node) {
|
|
emitJsDocComments(node);
|
|
emitModuleElementDeclarationFlags(node);
|
|
write("type ");
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
write(" = ");
|
|
emitTypeWithNewGetSymbolAccessibilityDiagnostic(node.type, getTypeAliasDeclarationVisibilityError);
|
|
write(";");
|
|
writeLine();
|
|
function getTypeAliasDeclarationVisibilityError(symbolAccesibilityResult) {
|
|
return {
|
|
diagnosticMessage: ts.Diagnostics.Exported_type_alias_0_has_or_is_using_private_name_1,
|
|
errorNode: node.type,
|
|
typeName: node.name
|
|
};
|
|
}
|
|
}
|
|
function writeEnumDeclaration(node) {
|
|
emitJsDocComments(node);
|
|
emitModuleElementDeclarationFlags(node);
|
|
if (ts.isConst(node)) {
|
|
write("const ");
|
|
}
|
|
write("enum ");
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
write(" {");
|
|
writeLine();
|
|
increaseIndent();
|
|
emitLines(node.members);
|
|
decreaseIndent();
|
|
write("}");
|
|
writeLine();
|
|
}
|
|
function emitEnumMemberDeclaration(node) {
|
|
emitJsDocComments(node);
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
var enumMemberValue = resolver.getConstantValue(node);
|
|
if (enumMemberValue !== undefined) {
|
|
write(" = ");
|
|
write(enumMemberValue.toString());
|
|
}
|
|
write(",");
|
|
writeLine();
|
|
}
|
|
function isPrivateMethodTypeParameter(node) {
|
|
return node.parent.kind === 140 /* MethodDeclaration */ && (node.parent.flags & 32 /* Private */);
|
|
}
|
|
function emitTypeParameters(typeParameters) {
|
|
function emitTypeParameter(node) {
|
|
increaseIndent();
|
|
emitJsDocComments(node);
|
|
decreaseIndent();
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
// If there is constraint present and this is not a type parameter of the private method emit the constraint
|
|
if (node.constraint && !isPrivateMethodTypeParameter(node)) {
|
|
write(" extends ");
|
|
if (node.parent.kind === 149 /* FunctionType */ ||
|
|
node.parent.kind === 150 /* ConstructorType */ ||
|
|
(node.parent.parent && node.parent.parent.kind === 152 /* TypeLiteral */)) {
|
|
ts.Debug.assert(node.parent.kind === 140 /* MethodDeclaration */ ||
|
|
node.parent.kind === 139 /* MethodSignature */ ||
|
|
node.parent.kind === 149 /* FunctionType */ ||
|
|
node.parent.kind === 150 /* ConstructorType */ ||
|
|
node.parent.kind === 144 /* CallSignature */ ||
|
|
node.parent.kind === 145 /* ConstructSignature */);
|
|
emitType(node.constraint);
|
|
}
|
|
else {
|
|
emitTypeWithNewGetSymbolAccessibilityDiagnostic(node.constraint, getTypeParameterConstraintVisibilityError);
|
|
}
|
|
}
|
|
function getTypeParameterConstraintVisibilityError(symbolAccesibilityResult) {
|
|
// Type parameter constraints are named by user so we should always be able to name it
|
|
var diagnosticMessage;
|
|
switch (node.parent.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_exported_class_has_or_is_using_private_name_1;
|
|
break;
|
|
case 212 /* InterfaceDeclaration */:
|
|
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_exported_interface_has_or_is_using_private_name_1;
|
|
break;
|
|
case 145 /* ConstructSignature */:
|
|
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_constructor_signature_from_exported_interface_has_or_is_using_private_name_1;
|
|
break;
|
|
case 144 /* CallSignature */:
|
|
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_call_signature_from_exported_interface_has_or_is_using_private_name_1;
|
|
break;
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
if (node.parent.flags & 128 /* Static */) {
|
|
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 === 211 /* 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 210 /* FunctionDeclaration */:
|
|
diagnosticMessage = ts.Diagnostics.Type_parameter_0_of_exported_function_has_or_is_using_private_name_1;
|
|
break;
|
|
default:
|
|
ts.Debug.fail("This is unknown parent for type parameter: " + node.parent.kind);
|
|
}
|
|
return {
|
|
diagnosticMessage: diagnosticMessage,
|
|
errorNode: node,
|
|
typeName: node.name
|
|
};
|
|
}
|
|
}
|
|
if (typeParameters) {
|
|
write("<");
|
|
emitCommaList(typeParameters, emitTypeParameter);
|
|
write(">");
|
|
}
|
|
}
|
|
function emitHeritageClause(typeReferences, isImplementsList) {
|
|
if (typeReferences) {
|
|
write(isImplementsList ? " implements " : " extends ");
|
|
emitCommaList(typeReferences, emitTypeOfTypeReference);
|
|
}
|
|
function emitTypeOfTypeReference(node) {
|
|
if (ts.isSupportedExpressionWithTypeArguments(node)) {
|
|
emitTypeWithNewGetSymbolAccessibilityDiagnostic(node, getHeritageClauseVisibilityError);
|
|
}
|
|
function getHeritageClauseVisibilityError(symbolAccesibilityResult) {
|
|
var diagnosticMessage;
|
|
// Heritage clause is written by user so it can always be named
|
|
if (node.parent.parent.kind === 211 /* ClassDeclaration */) {
|
|
// Class or Interface implemented/extended is inaccessible
|
|
diagnosticMessage = isImplementsList ?
|
|
ts.Diagnostics.Implements_clause_of_exported_class_0_has_or_is_using_private_name_1 :
|
|
ts.Diagnostics.Extends_clause_of_exported_class_0_has_or_is_using_private_name_1;
|
|
}
|
|
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: node.parent.parent.name
|
|
};
|
|
}
|
|
}
|
|
}
|
|
function writeClassDeclaration(node) {
|
|
function emitParameterProperties(constructorDeclaration) {
|
|
if (constructorDeclaration) {
|
|
ts.forEach(constructorDeclaration.parameters, function (param) {
|
|
if (param.flags & 112 /* AccessibilityModifier */) {
|
|
emitPropertyDeclaration(param);
|
|
}
|
|
});
|
|
}
|
|
}
|
|
emitJsDocComments(node);
|
|
emitModuleElementDeclarationFlags(node);
|
|
if (node.flags & 256 /* Abstract */) {
|
|
write("abstract ");
|
|
}
|
|
write("class ");
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
var prevEnclosingDeclaration = enclosingDeclaration;
|
|
enclosingDeclaration = node;
|
|
emitTypeParameters(node.typeParameters);
|
|
var baseTypeNode = ts.getClassExtendsHeritageClauseElement(node);
|
|
if (baseTypeNode) {
|
|
emitHeritageClause([baseTypeNode], false);
|
|
}
|
|
emitHeritageClause(ts.getClassImplementsHeritageClauseElements(node), true);
|
|
write(" {");
|
|
writeLine();
|
|
increaseIndent();
|
|
emitParameterProperties(ts.getFirstConstructorWithBody(node));
|
|
emitLines(node.members);
|
|
decreaseIndent();
|
|
write("}");
|
|
writeLine();
|
|
enclosingDeclaration = prevEnclosingDeclaration;
|
|
}
|
|
function writeInterfaceDeclaration(node) {
|
|
emitJsDocComments(node);
|
|
emitModuleElementDeclarationFlags(node);
|
|
write("interface ");
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
var prevEnclosingDeclaration = enclosingDeclaration;
|
|
enclosingDeclaration = node;
|
|
emitTypeParameters(node.typeParameters);
|
|
emitHeritageClause(ts.getInterfaceBaseTypeNodes(node), false);
|
|
write(" {");
|
|
writeLine();
|
|
increaseIndent();
|
|
emitLines(node.members);
|
|
decreaseIndent();
|
|
write("}");
|
|
writeLine();
|
|
enclosingDeclaration = prevEnclosingDeclaration;
|
|
}
|
|
function emitPropertyDeclaration(node) {
|
|
if (ts.hasDynamicName(node)) {
|
|
return;
|
|
}
|
|
emitJsDocComments(node);
|
|
emitClassMemberDeclarationFlags(node);
|
|
emitVariableDeclaration(node);
|
|
write(";");
|
|
writeLine();
|
|
}
|
|
function emitVariableDeclaration(node) {
|
|
// If we are emitting property it isn't moduleElement and hence we already know it needs to be emitted
|
|
// so there is no check needed to see if declaration is visible
|
|
if (node.kind !== 208 /* VariableDeclaration */ || resolver.isDeclarationVisible(node)) {
|
|
if (ts.isBindingPattern(node.name)) {
|
|
emitBindingPattern(node.name);
|
|
}
|
|
else {
|
|
// If this node is a computed name, it can only be a symbol, because we've already skipped
|
|
// it if it's not a well known symbol. In that case, the text of the name will be exactly
|
|
// what we want, namely the name expression enclosed in brackets.
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
// If optional property emit ?
|
|
if ((node.kind === 138 /* PropertyDeclaration */ || node.kind === 137 /* PropertySignature */) && ts.hasQuestionToken(node)) {
|
|
write("?");
|
|
}
|
|
if ((node.kind === 138 /* PropertyDeclaration */ || node.kind === 137 /* PropertySignature */) && node.parent.kind === 152 /* TypeLiteral */) {
|
|
emitTypeOfVariableDeclarationFromTypeLiteral(node);
|
|
}
|
|
else if (!(node.flags & 32 /* Private */)) {
|
|
writeTypeOfDeclaration(node, node.type, getVariableDeclarationTypeVisibilityError);
|
|
}
|
|
}
|
|
}
|
|
function getVariableDeclarationTypeVisibilityDiagnosticMessage(symbolAccesibilityResult) {
|
|
if (node.kind === 208 /* VariableDeclaration */) {
|
|
return symbolAccesibilityResult.errorModuleName ?
|
|
symbolAccesibilityResult.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;
|
|
}
|
|
else if (node.kind === 138 /* PropertyDeclaration */ || node.kind === 137 /* PropertySignature */) {
|
|
// TODO(jfreeman): Deal with computed properties in error reporting.
|
|
if (node.flags & 128 /* Static */) {
|
|
return symbolAccesibilityResult.errorModuleName ?
|
|
symbolAccesibilityResult.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 === 211 /* ClassDeclaration */) {
|
|
return symbolAccesibilityResult.errorModuleName ?
|
|
symbolAccesibilityResult.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 symbolAccesibilityResult.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(symbolAccesibilityResult) {
|
|
var diagnosticMessage = getVariableDeclarationTypeVisibilityDiagnosticMessage(symbolAccesibilityResult);
|
|
return diagnosticMessage !== undefined ? {
|
|
diagnosticMessage: diagnosticMessage,
|
|
errorNode: node,
|
|
typeName: node.name
|
|
} : undefined;
|
|
}
|
|
function emitBindingPattern(bindingPattern) {
|
|
// Only select non-omitted expression from the bindingPattern's elements.
|
|
// We have to do this to avoid emitting trailing commas.
|
|
// For example:
|
|
// original: var [, c,,] = [ 2,3,4]
|
|
// emitted: declare var c: number; // instead of declare var c:number, ;
|
|
var elements = [];
|
|
for (var _i = 0, _a = bindingPattern.elements; _i < _a.length; _i++) {
|
|
var element = _a[_i];
|
|
if (element.kind !== 184 /* OmittedExpression */) {
|
|
elements.push(element);
|
|
}
|
|
}
|
|
emitCommaList(elements, emitBindingElement);
|
|
}
|
|
function emitBindingElement(bindingElement) {
|
|
function getBindingElementTypeVisibilityError(symbolAccesibilityResult) {
|
|
var diagnosticMessage = getVariableDeclarationTypeVisibilityDiagnosticMessage(symbolAccesibilityResult);
|
|
return diagnosticMessage !== undefined ? {
|
|
diagnosticMessage: diagnosticMessage,
|
|
errorNode: bindingElement,
|
|
typeName: bindingElement.name
|
|
} : undefined;
|
|
}
|
|
if (bindingElement.name) {
|
|
if (ts.isBindingPattern(bindingElement.name)) {
|
|
emitBindingPattern(bindingElement.name);
|
|
}
|
|
else {
|
|
writeTextOfNode(currentSourceFile, bindingElement.name);
|
|
writeTypeOfDeclaration(bindingElement, undefined, getBindingElementTypeVisibilityError);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function emitTypeOfVariableDeclarationFromTypeLiteral(node) {
|
|
// if this is property of type literal,
|
|
// or is parameter of method/call/construct/index signature of type literal
|
|
// emit only if type is specified
|
|
if (node.type) {
|
|
write(": ");
|
|
emitType(node.type);
|
|
}
|
|
}
|
|
function isVariableStatementVisible(node) {
|
|
return ts.forEach(node.declarationList.declarations, function (varDeclaration) { return resolver.isDeclarationVisible(varDeclaration); });
|
|
}
|
|
function writeVariableStatement(node) {
|
|
emitJsDocComments(node);
|
|
emitModuleElementDeclarationFlags(node);
|
|
if (ts.isLet(node.declarationList)) {
|
|
write("let ");
|
|
}
|
|
else if (ts.isConst(node.declarationList)) {
|
|
write("const ");
|
|
}
|
|
else {
|
|
write("var ");
|
|
}
|
|
emitCommaList(node.declarationList.declarations, emitVariableDeclaration, resolver.isDeclarationVisible);
|
|
write(";");
|
|
writeLine();
|
|
}
|
|
function emitAccessorDeclaration(node) {
|
|
if (ts.hasDynamicName(node)) {
|
|
return;
|
|
}
|
|
var accessors = ts.getAllAccessorDeclarations(node.parent.members, node);
|
|
var accessorWithTypeAnnotation;
|
|
if (node === accessors.firstAccessor) {
|
|
emitJsDocComments(accessors.getAccessor);
|
|
emitJsDocComments(accessors.setAccessor);
|
|
emitClassMemberDeclarationFlags(node);
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
if (!(node.flags & 32 /* Private */)) {
|
|
accessorWithTypeAnnotation = node;
|
|
var type = getTypeAnnotationFromAccessor(node);
|
|
if (!type) {
|
|
// couldn't get type for the first accessor, try the another one
|
|
var anotherAccessor = node.kind === 142 /* GetAccessor */ ? accessors.setAccessor : accessors.getAccessor;
|
|
type = getTypeAnnotationFromAccessor(anotherAccessor);
|
|
if (type) {
|
|
accessorWithTypeAnnotation = anotherAccessor;
|
|
}
|
|
}
|
|
writeTypeOfDeclaration(node, type, getAccessorDeclarationTypeVisibilityError);
|
|
}
|
|
write(";");
|
|
writeLine();
|
|
}
|
|
function getTypeAnnotationFromAccessor(accessor) {
|
|
if (accessor) {
|
|
return accessor.kind === 142 /* GetAccessor */
|
|
? accessor.type // Getter - return type
|
|
: accessor.parameters.length > 0
|
|
? accessor.parameters[0].type // Setter parameter type
|
|
: undefined;
|
|
}
|
|
}
|
|
function getAccessorDeclarationTypeVisibilityError(symbolAccesibilityResult) {
|
|
var diagnosticMessage;
|
|
if (accessorWithTypeAnnotation.kind === 143 /* SetAccessor */) {
|
|
// Setters have to have type named and cannot infer it so, the type should always be named
|
|
if (accessorWithTypeAnnotation.parent.flags & 128 /* Static */) {
|
|
diagnosticMessage = symbolAccesibilityResult.errorModuleName ?
|
|
ts.Diagnostics.Parameter_0_of_public_static_property_setter_from_exported_class_has_or_is_using_name_1_from_private_module_2 :
|
|
ts.Diagnostics.Parameter_0_of_public_static_property_setter_from_exported_class_has_or_is_using_private_name_1;
|
|
}
|
|
else {
|
|
diagnosticMessage = symbolAccesibilityResult.errorModuleName ?
|
|
ts.Diagnostics.Parameter_0_of_public_property_setter_from_exported_class_has_or_is_using_name_1_from_private_module_2 :
|
|
ts.Diagnostics.Parameter_0_of_public_property_setter_from_exported_class_has_or_is_using_private_name_1;
|
|
}
|
|
return {
|
|
diagnosticMessage: diagnosticMessage,
|
|
errorNode: accessorWithTypeAnnotation.parameters[0],
|
|
// TODO(jfreeman): Investigate why we are passing node.name instead of node.parameters[0].name
|
|
typeName: accessorWithTypeAnnotation.name
|
|
};
|
|
}
|
|
else {
|
|
if (accessorWithTypeAnnotation.flags & 128 /* Static */) {
|
|
diagnosticMessage = symbolAccesibilityResult.errorModuleName ?
|
|
symbolAccesibilityResult.accessibility === 2 /* CannotBeNamed */ ?
|
|
ts.Diagnostics.Return_type_of_public_static_property_getter_from_exported_class_has_or_is_using_name_0_from_external_module_1_but_cannot_be_named :
|
|
ts.Diagnostics.Return_type_of_public_static_property_getter_from_exported_class_has_or_is_using_name_0_from_private_module_1 :
|
|
ts.Diagnostics.Return_type_of_public_static_property_getter_from_exported_class_has_or_is_using_private_name_0;
|
|
}
|
|
else {
|
|
diagnosticMessage = symbolAccesibilityResult.errorModuleName ?
|
|
symbolAccesibilityResult.accessibility === 2 /* CannotBeNamed */ ?
|
|
ts.Diagnostics.Return_type_of_public_property_getter_from_exported_class_has_or_is_using_name_0_from_external_module_1_but_cannot_be_named :
|
|
ts.Diagnostics.Return_type_of_public_property_getter_from_exported_class_has_or_is_using_name_0_from_private_module_1 :
|
|
ts.Diagnostics.Return_type_of_public_property_getter_from_exported_class_has_or_is_using_private_name_0;
|
|
}
|
|
return {
|
|
diagnosticMessage: diagnosticMessage,
|
|
errorNode: accessorWithTypeAnnotation.name,
|
|
typeName: undefined
|
|
};
|
|
}
|
|
}
|
|
}
|
|
function writeFunctionDeclaration(node) {
|
|
if (ts.hasDynamicName(node)) {
|
|
return;
|
|
}
|
|
// If we are emitting Method/Constructor it isn't moduleElement and hence already determined to be emitting
|
|
// so no need to verify if the declaration is visible
|
|
if (!resolver.isImplementationOfOverload(node)) {
|
|
emitJsDocComments(node);
|
|
if (node.kind === 210 /* FunctionDeclaration */) {
|
|
emitModuleElementDeclarationFlags(node);
|
|
}
|
|
else if (node.kind === 140 /* MethodDeclaration */) {
|
|
emitClassMemberDeclarationFlags(node);
|
|
}
|
|
if (node.kind === 210 /* FunctionDeclaration */) {
|
|
write("function ");
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
}
|
|
else if (node.kind === 141 /* Constructor */) {
|
|
write("constructor");
|
|
}
|
|
else {
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
if (ts.hasQuestionToken(node)) {
|
|
write("?");
|
|
}
|
|
}
|
|
emitSignatureDeclaration(node);
|
|
}
|
|
}
|
|
function emitSignatureDeclarationWithJsDocComments(node) {
|
|
emitJsDocComments(node);
|
|
emitSignatureDeclaration(node);
|
|
}
|
|
function emitSignatureDeclaration(node) {
|
|
// Construct signature or constructor type write new Signature
|
|
if (node.kind === 145 /* ConstructSignature */ || node.kind === 150 /* ConstructorType */) {
|
|
write("new ");
|
|
}
|
|
emitTypeParameters(node.typeParameters);
|
|
if (node.kind === 146 /* IndexSignature */) {
|
|
write("[");
|
|
}
|
|
else {
|
|
write("(");
|
|
}
|
|
var prevEnclosingDeclaration = enclosingDeclaration;
|
|
enclosingDeclaration = node;
|
|
// Parameters
|
|
emitCommaList(node.parameters, emitParameterDeclaration);
|
|
if (node.kind === 146 /* IndexSignature */) {
|
|
write("]");
|
|
}
|
|
else {
|
|
write(")");
|
|
}
|
|
// If this is not a constructor and is not private, emit the return type
|
|
var isFunctionTypeOrConstructorType = node.kind === 149 /* FunctionType */ || node.kind === 150 /* ConstructorType */;
|
|
if (isFunctionTypeOrConstructorType || node.parent.kind === 152 /* TypeLiteral */) {
|
|
// Emit type literal signature return type only if specified
|
|
if (node.type) {
|
|
write(isFunctionTypeOrConstructorType ? " => " : ": ");
|
|
emitType(node.type);
|
|
}
|
|
}
|
|
else if (node.kind !== 141 /* Constructor */ && !(node.flags & 32 /* Private */)) {
|
|
writeReturnTypeAtSignature(node, getReturnTypeVisibilityError);
|
|
}
|
|
enclosingDeclaration = prevEnclosingDeclaration;
|
|
if (!isFunctionTypeOrConstructorType) {
|
|
write(";");
|
|
writeLine();
|
|
}
|
|
function getReturnTypeVisibilityError(symbolAccesibilityResult) {
|
|
var diagnosticMessage;
|
|
switch (node.kind) {
|
|
case 145 /* ConstructSignature */:
|
|
// Interfaces cannot have return types that cannot be named
|
|
diagnosticMessage = symbolAccesibilityResult.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 144 /* CallSignature */:
|
|
// Interfaces cannot have return types that cannot be named
|
|
diagnosticMessage = symbolAccesibilityResult.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 146 /* IndexSignature */:
|
|
// Interfaces cannot have return types that cannot be named
|
|
diagnosticMessage = symbolAccesibilityResult.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 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
if (node.flags & 128 /* Static */) {
|
|
diagnosticMessage = symbolAccesibilityResult.errorModuleName ?
|
|
symbolAccesibilityResult.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 === 211 /* ClassDeclaration */) {
|
|
diagnosticMessage = symbolAccesibilityResult.errorModuleName ?
|
|
symbolAccesibilityResult.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 = symbolAccesibilityResult.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 210 /* FunctionDeclaration */:
|
|
diagnosticMessage = symbolAccesibilityResult.errorModuleName ?
|
|
symbolAccesibilityResult.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:
|
|
ts.Debug.fail("This is unknown kind for signature: " + node.kind);
|
|
}
|
|
return {
|
|
diagnosticMessage: diagnosticMessage,
|
|
errorNode: node.name || node
|
|
};
|
|
}
|
|
}
|
|
function emitParameterDeclaration(node) {
|
|
increaseIndent();
|
|
emitJsDocComments(node);
|
|
if (node.dotDotDotToken) {
|
|
write("...");
|
|
}
|
|
if (ts.isBindingPattern(node.name)) {
|
|
// For bindingPattern, we can't simply writeTextOfNode from the source file
|
|
// because we want to omit the initializer and using writeTextOfNode will result in initializer get emitted.
|
|
// Therefore, we will have to recursively emit each element in the bindingPattern.
|
|
emitBindingPattern(node.name);
|
|
}
|
|
else {
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
}
|
|
if (node.initializer || ts.hasQuestionToken(node)) {
|
|
write("?");
|
|
}
|
|
decreaseIndent();
|
|
if (node.parent.kind === 149 /* FunctionType */ ||
|
|
node.parent.kind === 150 /* ConstructorType */ ||
|
|
node.parent.parent.kind === 152 /* TypeLiteral */) {
|
|
emitTypeOfVariableDeclarationFromTypeLiteral(node);
|
|
}
|
|
else if (!(node.parent.flags & 32 /* Private */)) {
|
|
writeTypeOfDeclaration(node, node.type, getParameterDeclarationTypeVisibilityError);
|
|
}
|
|
function getParameterDeclarationTypeVisibilityError(symbolAccesibilityResult) {
|
|
var diagnosticMessage = getParameterDeclarationTypeVisibilityDiagnosticMessage(symbolAccesibilityResult);
|
|
return diagnosticMessage !== undefined ? {
|
|
diagnosticMessage: diagnosticMessage,
|
|
errorNode: node,
|
|
typeName: node.name
|
|
} : undefined;
|
|
}
|
|
function getParameterDeclarationTypeVisibilityDiagnosticMessage(symbolAccesibilityResult) {
|
|
switch (node.parent.kind) {
|
|
case 141 /* Constructor */:
|
|
return symbolAccesibilityResult.errorModuleName ?
|
|
symbolAccesibilityResult.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 145 /* ConstructSignature */:
|
|
// Interfaces cannot have parameter types that cannot be named
|
|
return symbolAccesibilityResult.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 144 /* CallSignature */:
|
|
// Interfaces cannot have parameter types that cannot be named
|
|
return symbolAccesibilityResult.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 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
if (node.parent.flags & 128 /* Static */) {
|
|
return symbolAccesibilityResult.errorModuleName ?
|
|
symbolAccesibilityResult.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 === 211 /* ClassDeclaration */) {
|
|
return symbolAccesibilityResult.errorModuleName ?
|
|
symbolAccesibilityResult.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 symbolAccesibilityResult.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 210 /* FunctionDeclaration */:
|
|
return symbolAccesibilityResult.errorModuleName ?
|
|
symbolAccesibilityResult.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;
|
|
default:
|
|
ts.Debug.fail("This is unknown parent for parameter: " + node.parent.kind);
|
|
}
|
|
}
|
|
function emitBindingPattern(bindingPattern) {
|
|
// We have to explicitly emit square bracket and bracket because these tokens are not store inside the node.
|
|
if (bindingPattern.kind === 158 /* ObjectBindingPattern */) {
|
|
write("{");
|
|
emitCommaList(bindingPattern.elements, emitBindingElement);
|
|
write("}");
|
|
}
|
|
else if (bindingPattern.kind === 159 /* ArrayBindingPattern */) {
|
|
write("[");
|
|
var elements = bindingPattern.elements;
|
|
emitCommaList(elements, emitBindingElement);
|
|
if (elements && elements.hasTrailingComma) {
|
|
write(", ");
|
|
}
|
|
write("]");
|
|
}
|
|
}
|
|
function emitBindingElement(bindingElement) {
|
|
function getBindingElementTypeVisibilityError(symbolAccesibilityResult) {
|
|
var diagnosticMessage = getParameterDeclarationTypeVisibilityDiagnosticMessage(symbolAccesibilityResult);
|
|
return diagnosticMessage !== undefined ? {
|
|
diagnosticMessage: diagnosticMessage,
|
|
errorNode: bindingElement,
|
|
typeName: bindingElement.name
|
|
} : undefined;
|
|
}
|
|
if (bindingElement.kind === 184 /* OmittedExpression */) {
|
|
// If bindingElement is an omittedExpression (i.e. containing elision),
|
|
// we will emit blank space (although this may differ from users' original code,
|
|
// it allows emitSeparatedList to write separator appropriately)
|
|
// Example:
|
|
// original: function foo([, x, ,]) {}
|
|
// emit : function foo([ , x, , ]) {}
|
|
write(" ");
|
|
}
|
|
else if (bindingElement.kind === 160 /* BindingElement */) {
|
|
if (bindingElement.propertyName) {
|
|
// bindingElement has propertyName property in the following case:
|
|
// { y: [a,b,c] ...} -> bindingPattern will have a property called propertyName for "y"
|
|
// We have to explicitly emit the propertyName before descending into its binding elements.
|
|
// Example:
|
|
// original: function foo({y: [a,b,c]}) {}
|
|
// emit : declare function foo({y: [a, b, c]}: { y: [any, any, any] }) void;
|
|
writeTextOfNode(currentSourceFile, bindingElement.propertyName);
|
|
write(": ");
|
|
// If bindingElement has propertyName property, then its name must be another bindingPattern of SyntaxKind.ObjectBindingPattern
|
|
emitBindingPattern(bindingElement.name);
|
|
}
|
|
else if (bindingElement.name) {
|
|
if (ts.isBindingPattern(bindingElement.name)) {
|
|
// If it is a nested binding pattern, we will recursively descend into each element and emit each one separately.
|
|
// In the case of rest element, we will omit rest element.
|
|
// Example:
|
|
// original: function foo([a, [[b]], c] = [1,[["string"]], 3]) {}
|
|
// emit : declare function foo([a, [[b]], c]: [number, [[string]], number]): void;
|
|
// original with rest: function foo([a, ...c]) {}
|
|
// emit : declare function foo([a, ...c]): void;
|
|
emitBindingPattern(bindingElement.name);
|
|
}
|
|
else {
|
|
ts.Debug.assert(bindingElement.name.kind === 66 /* Identifier */);
|
|
// If the node is just an identifier, we will simply emit the text associated with the node's name
|
|
// Example:
|
|
// original: function foo({y = 10, x}) {}
|
|
// emit : declare function foo({y, x}: {number, any}): void;
|
|
if (bindingElement.dotDotDotToken) {
|
|
write("...");
|
|
}
|
|
writeTextOfNode(currentSourceFile, bindingElement.name);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function emitNode(node) {
|
|
switch (node.kind) {
|
|
case 210 /* FunctionDeclaration */:
|
|
case 215 /* ModuleDeclaration */:
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 213 /* TypeAliasDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
return emitModuleElement(node, isModuleElementVisible(node));
|
|
case 190 /* VariableStatement */:
|
|
return emitModuleElement(node, isVariableStatementVisible(node));
|
|
case 219 /* ImportDeclaration */:
|
|
// Import declaration without import clause is visible, otherwise it is not visible
|
|
return emitModuleElement(node, !node.importClause);
|
|
case 225 /* ExportDeclaration */:
|
|
return emitExportDeclaration(node);
|
|
case 141 /* Constructor */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
return writeFunctionDeclaration(node);
|
|
case 145 /* ConstructSignature */:
|
|
case 144 /* CallSignature */:
|
|
case 146 /* IndexSignature */:
|
|
return emitSignatureDeclarationWithJsDocComments(node);
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
return emitAccessorDeclaration(node);
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
return emitPropertyDeclaration(node);
|
|
case 244 /* EnumMember */:
|
|
return emitEnumMemberDeclaration(node);
|
|
case 224 /* ExportAssignment */:
|
|
return emitExportAssignment(node);
|
|
case 245 /* SourceFile */:
|
|
return emitSourceFile(node);
|
|
}
|
|
}
|
|
function writeReferencePath(referencedFile) {
|
|
var declFileName = referencedFile.flags & 8192 /* DeclarationFile */
|
|
? referencedFile.fileName // Declaration file, use declaration file name
|
|
: ts.shouldEmitToOwnFile(referencedFile, compilerOptions)
|
|
? ts.getOwnEmitOutputFilePath(referencedFile, host, ".d.ts") // Own output file so get the .d.ts file
|
|
: ts.removeFileExtension(compilerOptions.out) + ".d.ts"; // Global out file
|
|
declFileName = ts.getRelativePathToDirectoryOrUrl(ts.getDirectoryPath(ts.normalizeSlashes(jsFilePath)), declFileName, host.getCurrentDirectory(), host.getCanonicalFileName,
|
|
/*isAbsolutePathAnUrl*/ false);
|
|
referencePathsOutput += "/// <reference path=\"" + declFileName + "\" />" + newLine;
|
|
}
|
|
}
|
|
/* @internal */
|
|
function writeDeclarationFile(jsFilePath, sourceFile, host, resolver, diagnostics) {
|
|
var emitDeclarationResult = emitDeclarations(host, resolver, diagnostics, jsFilePath, sourceFile);
|
|
// TODO(shkamat): Should we not write any declaration file if any of them can produce error,
|
|
// or should we just not write this file like we are doing now
|
|
if (!emitDeclarationResult.reportedDeclarationError) {
|
|
var declarationOutput = emitDeclarationResult.referencePathsOutput
|
|
+ getDeclarationOutput(emitDeclarationResult.synchronousDeclarationOutput, emitDeclarationResult.moduleElementDeclarationEmitInfo);
|
|
ts.writeFile(host, diagnostics, ts.removeFileExtension(jsFilePath) + ".d.ts", declarationOutput, host.getCompilerOptions().emitBOM);
|
|
}
|
|
function getDeclarationOutput(synchronousDeclarationOutput, moduleElementDeclarationEmitInfo) {
|
|
var appliedSyncOutputPos = 0;
|
|
var declarationOutput = "";
|
|
// apply asynchronous additions to the synchronous output
|
|
ts.forEach(moduleElementDeclarationEmitInfo, function (aliasEmitInfo) {
|
|
if (aliasEmitInfo.asynchronousOutput) {
|
|
declarationOutput += synchronousDeclarationOutput.substring(appliedSyncOutputPos, aliasEmitInfo.outputPos);
|
|
declarationOutput += getDeclarationOutput(aliasEmitInfo.asynchronousOutput, aliasEmitInfo.subModuleElementDeclarationEmitInfo);
|
|
appliedSyncOutputPos = aliasEmitInfo.outputPos;
|
|
}
|
|
});
|
|
declarationOutput += synchronousDeclarationOutput.substring(appliedSyncOutputPos);
|
|
return declarationOutput;
|
|
}
|
|
}
|
|
ts.writeDeclarationFile = writeDeclarationFile;
|
|
})(ts || (ts = {}));
|
|
/// <reference path="checker.ts"/>
|
|
/// <reference path="declarationEmitter.ts"/>
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
function isExternalModuleOrDeclarationFile(sourceFile) {
|
|
return ts.isExternalModule(sourceFile) || ts.isDeclarationFile(sourceFile);
|
|
}
|
|
ts.isExternalModuleOrDeclarationFile = isExternalModuleOrDeclarationFile;
|
|
// 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 = {}));
|
|
// 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) {
|
|
// emit output for the __extends helper function
|
|
var extendsHelper = "\nvar __extends = (this && this.__extends) || function (d, b) {\n for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p];\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n};";
|
|
// emit output for the __decorate helper function
|
|
var decorateHelper = "\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") return Reflect.decorate(decorators, target, key, desc);\n switch (arguments.length) {\n case 2: return decorators.reduceRight(function(o, d) { return (d && d(o)) || o; }, target);\n case 3: return decorators.reduceRight(function(o, d) { return (d && d(target, key)), void 0; }, void 0);\n case 4: return decorators.reduceRight(function(o, d) { return (d && d(target, key, o)) || o; }, desc);\n }\n};";
|
|
// emit output for the __metadata helper function
|
|
var metadataHelper = "\nvar __metadata = (this && this.__metadata) || function (k, v) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(k, v);\n};";
|
|
// emit output for the __param helper function
|
|
var paramHelper = "\nvar __param = (this && this.__param) || function (paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n};";
|
|
var awaiterHelper = "\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, Promise, generator) {\n return new Promise(function (resolve, reject) {\n generator = generator.call(thisArg, _arguments);\n function cast(value) { return value instanceof Promise && value.constructor === Promise ? value : new Promise(function (resolve) { resolve(value); }); }\n function onfulfill(value) { try { step(\"next\", value); } catch (e) { reject(e); } }\n function onreject(value) { try { step(\"throw\", value); } catch (e) { reject(e); } }\n function step(verb, value) {\n var result = generator[verb](value);\n result.done ? resolve(result.value) : cast(result.value).then(onfulfill, onreject);\n }\n step(\"next\", void 0);\n });\n};";
|
|
var compilerOptions = host.getCompilerOptions();
|
|
var languageVersion = compilerOptions.target || 0 /* ES3 */;
|
|
var sourceMapDataList = compilerOptions.sourceMap || compilerOptions.inlineSourceMap ? [] : undefined;
|
|
var diagnostics = [];
|
|
var newLine = host.getNewLine();
|
|
var jsxDesugaring = host.getCompilerOptions().jsx !== 1 /* Preserve */;
|
|
var shouldEmitJsx = function (s) { return (s.languageVariant === 1 /* JSX */ && !jsxDesugaring); };
|
|
if (targetSourceFile === undefined) {
|
|
ts.forEach(host.getSourceFiles(), function (sourceFile) {
|
|
if (ts.shouldEmitToOwnFile(sourceFile, compilerOptions)) {
|
|
var jsFilePath = ts.getOwnEmitOutputFilePath(sourceFile, host, shouldEmitJsx(sourceFile) ? ".jsx" : ".js");
|
|
emitFile(jsFilePath, sourceFile);
|
|
}
|
|
});
|
|
if (compilerOptions.out) {
|
|
emitFile(compilerOptions.out);
|
|
}
|
|
}
|
|
else {
|
|
// targetSourceFile is specified (e.g calling emitter from language service or calling getSemanticDiagnostic from language service)
|
|
if (ts.shouldEmitToOwnFile(targetSourceFile, compilerOptions)) {
|
|
var jsFilePath = ts.getOwnEmitOutputFilePath(targetSourceFile, host, ts.forEach(host.getSourceFiles(), shouldEmitJsx) ? ".jsx" : ".js");
|
|
emitFile(jsFilePath, targetSourceFile);
|
|
}
|
|
else if (!ts.isDeclarationFile(targetSourceFile) && compilerOptions.out) {
|
|
emitFile(compilerOptions.out);
|
|
}
|
|
}
|
|
// Sort and make the unique list of diagnostics
|
|
diagnostics = ts.sortAndDeduplicateDiagnostics(diagnostics);
|
|
return {
|
|
emitSkipped: false,
|
|
diagnostics: diagnostics,
|
|
sourceMaps: sourceMapDataList
|
|
};
|
|
function isNodeDescendentOf(node, ancestor) {
|
|
while (node) {
|
|
if (node === ancestor)
|
|
return true;
|
|
node = node.parent;
|
|
}
|
|
return false;
|
|
}
|
|
function isUniqueLocalName(name, container) {
|
|
for (var node = container; isNodeDescendentOf(node, container); node = node.nextContainer) {
|
|
if (node.locals && ts.hasProperty(node.locals, name)) {
|
|
// We conservatively include alias symbols to cover cases where they're emitted as locals
|
|
if (node.locals[name].flags & (107455 /* Value */ | 1048576 /* ExportValue */ | 8388608 /* Alias */)) {
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
function emitJavaScript(jsFilePath, root) {
|
|
var writer = ts.createTextWriter(newLine);
|
|
var write = writer.write;
|
|
var writeTextOfNode = writer.writeTextOfNode;
|
|
var writeLine = writer.writeLine;
|
|
var increaseIndent = writer.increaseIndent;
|
|
var decreaseIndent = writer.decreaseIndent;
|
|
var currentSourceFile;
|
|
// name of an exporter function if file is a System external module
|
|
// System.register([...], function (<exporter>) {...})
|
|
// exporting in System modules looks like:
|
|
// export var x; ... x = 1
|
|
// =>
|
|
// var x;... exporter("x", x = 1)
|
|
var exportFunctionForFile;
|
|
var generatedNameSet = {};
|
|
var nodeToGeneratedName = [];
|
|
var computedPropertyNamesToGeneratedNames;
|
|
var extendsEmitted = false;
|
|
var decorateEmitted = false;
|
|
var paramEmitted = false;
|
|
var awaiterEmitted = false;
|
|
var tempFlags = 0;
|
|
var tempVariables;
|
|
var tempParameters;
|
|
var externalImports;
|
|
var exportSpecifiers;
|
|
var exportEquals;
|
|
var hasExportStars;
|
|
/** Write emitted output to disk */
|
|
var writeEmittedFiles = writeJavaScriptFile;
|
|
var detachedCommentsInfo;
|
|
var writeComment = ts.writeCommentRange;
|
|
/** Emit a node */
|
|
var emit = emitNodeWithoutSourceMap;
|
|
/** Called just before starting emit of a node */
|
|
var emitStart = function (node) { };
|
|
/** Called once the emit of the node is done */
|
|
var emitEnd = function (node) { };
|
|
/** Emit the text for the given token that comes after startPos
|
|
* This by default writes the text provided with the given tokenKind
|
|
* but if optional emitFn callback is provided the text is emitted using the callback instead of default text
|
|
* @param tokenKind the kind of the token to search and emit
|
|
* @param startPos the position in the source to start searching for the token
|
|
* @param emitFn if given will be invoked to emit the text instead of actual token emit */
|
|
var emitToken = emitTokenText;
|
|
/** Called to before starting the lexical scopes as in function/class in the emitted code because of node
|
|
* @param scopeDeclaration node that starts the lexical scope
|
|
* @param scopeName Optional name of this scope instead of deducing one from the declaration node */
|
|
var scopeEmitStart = function (scopeDeclaration, scopeName) { };
|
|
/** Called after coming out of the scope */
|
|
var scopeEmitEnd = function () { };
|
|
/** Sourcemap data that will get encoded */
|
|
var sourceMapData;
|
|
if (compilerOptions.sourceMap || compilerOptions.inlineSourceMap) {
|
|
initializeEmitterWithSourceMaps();
|
|
}
|
|
if (root) {
|
|
// Do not call emit directly. It does not set the currentSourceFile.
|
|
emitSourceFile(root);
|
|
}
|
|
else {
|
|
ts.forEach(host.getSourceFiles(), function (sourceFile) {
|
|
if (!isExternalModuleOrDeclarationFile(sourceFile)) {
|
|
emitSourceFile(sourceFile);
|
|
}
|
|
});
|
|
}
|
|
writeLine();
|
|
writeEmittedFiles(writer.getText(), compilerOptions.emitBOM);
|
|
return;
|
|
function emitSourceFile(sourceFile) {
|
|
currentSourceFile = sourceFile;
|
|
exportFunctionForFile = undefined;
|
|
emit(sourceFile);
|
|
}
|
|
function isUniqueName(name) {
|
|
return !resolver.hasGlobalName(name) &&
|
|
!ts.hasProperty(currentSourceFile.identifiers, name) &&
|
|
!ts.hasProperty(generatedNameSet, name);
|
|
}
|
|
// 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) {
|
|
if (flags && !(tempFlags & flags)) {
|
|
var name_19 = flags === 268435456 /* _i */ ? "_i" : "_n";
|
|
if (isUniqueName(name_19)) {
|
|
tempFlags |= flags;
|
|
return name_19;
|
|
}
|
|
}
|
|
while (true) {
|
|
var count = tempFlags & 268435455 /* CountMask */;
|
|
tempFlags++;
|
|
// Skip over 'i' and 'n'
|
|
if (count !== 8 && count !== 13) {
|
|
var name_20 = count < 26 ? "_" + String.fromCharCode(97 /* a */ + count) : "_" + (count - 26);
|
|
if (isUniqueName(name_20)) {
|
|
return name_20;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
// 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.
|
|
function makeUniqueName(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 (isUniqueName(generatedName)) {
|
|
return generatedNameSet[generatedName] = generatedName;
|
|
}
|
|
i++;
|
|
}
|
|
}
|
|
function generateNameForModuleOrEnum(node) {
|
|
var name = node.name.text;
|
|
// Use module/enum name itself if it is unique, otherwise make a unique variation
|
|
return isUniqueLocalName(name, node) ? name : makeUniqueName(name);
|
|
}
|
|
function generateNameForImportOrExportDeclaration(node) {
|
|
var expr = ts.getExternalModuleName(node);
|
|
var baseName = expr.kind === 8 /* StringLiteral */ ?
|
|
ts.escapeIdentifier(ts.makeIdentifierFromModuleName(expr.text)) : "module";
|
|
return makeUniqueName(baseName);
|
|
}
|
|
function generateNameForExportDefault() {
|
|
return makeUniqueName("default");
|
|
}
|
|
function generateNameForClassExpression() {
|
|
return makeUniqueName("class");
|
|
}
|
|
function generateNameForNode(node) {
|
|
switch (node.kind) {
|
|
case 66 /* Identifier */:
|
|
return makeUniqueName(node.text);
|
|
case 215 /* ModuleDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
return generateNameForModuleOrEnum(node);
|
|
case 219 /* ImportDeclaration */:
|
|
case 225 /* ExportDeclaration */:
|
|
return generateNameForImportOrExportDeclaration(node);
|
|
case 210 /* FunctionDeclaration */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 224 /* ExportAssignment */:
|
|
return generateNameForExportDefault();
|
|
case 183 /* ClassExpression */:
|
|
return generateNameForClassExpression();
|
|
}
|
|
}
|
|
function getGeneratedNameForNode(node) {
|
|
var id = ts.getNodeId(node);
|
|
return nodeToGeneratedName[id] || (nodeToGeneratedName[id] = ts.unescapeIdentifier(generateNameForNode(node)));
|
|
}
|
|
function initializeEmitterWithSourceMaps() {
|
|
var sourceMapDir; // The directory in which sourcemap will be
|
|
// Current source map file and its index in the sources list
|
|
var sourceMapSourceIndex = -1;
|
|
// Names and its index map
|
|
var sourceMapNameIndexMap = {};
|
|
var sourceMapNameIndices = [];
|
|
function getSourceMapNameIndex() {
|
|
return sourceMapNameIndices.length ? ts.lastOrUndefined(sourceMapNameIndices) : -1;
|
|
}
|
|
// Last recorded and encoded spans
|
|
var lastRecordedSourceMapSpan;
|
|
var lastEncodedSourceMapSpan = {
|
|
emittedLine: 1,
|
|
emittedColumn: 1,
|
|
sourceLine: 1,
|
|
sourceColumn: 1,
|
|
sourceIndex: 0
|
|
};
|
|
var lastEncodedNameIndex = 0;
|
|
// Encoding for sourcemap span
|
|
function encodeLastRecordedSourceMapSpan() {
|
|
if (!lastRecordedSourceMapSpan || lastRecordedSourceMapSpan === lastEncodedSourceMapSpan) {
|
|
return;
|
|
}
|
|
var prevEncodedEmittedColumn = lastEncodedSourceMapSpan.emittedColumn;
|
|
// Line/Comma delimiters
|
|
if (lastEncodedSourceMapSpan.emittedLine === lastRecordedSourceMapSpan.emittedLine) {
|
|
// Emit comma to separate the entry
|
|
if (sourceMapData.sourceMapMappings) {
|
|
sourceMapData.sourceMapMappings += ",";
|
|
}
|
|
}
|
|
else {
|
|
// Emit line delimiters
|
|
for (var encodedLine = lastEncodedSourceMapSpan.emittedLine; encodedLine < lastRecordedSourceMapSpan.emittedLine; encodedLine++) {
|
|
sourceMapData.sourceMapMappings += ";";
|
|
}
|
|
prevEncodedEmittedColumn = 1;
|
|
}
|
|
// 1. Relative Column 0 based
|
|
sourceMapData.sourceMapMappings += base64VLQFormatEncode(lastRecordedSourceMapSpan.emittedColumn - prevEncodedEmittedColumn);
|
|
// 2. Relative sourceIndex
|
|
sourceMapData.sourceMapMappings += base64VLQFormatEncode(lastRecordedSourceMapSpan.sourceIndex - lastEncodedSourceMapSpan.sourceIndex);
|
|
// 3. Relative sourceLine 0 based
|
|
sourceMapData.sourceMapMappings += base64VLQFormatEncode(lastRecordedSourceMapSpan.sourceLine - lastEncodedSourceMapSpan.sourceLine);
|
|
// 4. Relative sourceColumn 0 based
|
|
sourceMapData.sourceMapMappings += base64VLQFormatEncode(lastRecordedSourceMapSpan.sourceColumn - lastEncodedSourceMapSpan.sourceColumn);
|
|
// 5. Relative namePosition 0 based
|
|
if (lastRecordedSourceMapSpan.nameIndex >= 0) {
|
|
sourceMapData.sourceMapMappings += base64VLQFormatEncode(lastRecordedSourceMapSpan.nameIndex - lastEncodedNameIndex);
|
|
lastEncodedNameIndex = lastRecordedSourceMapSpan.nameIndex;
|
|
}
|
|
lastEncodedSourceMapSpan = lastRecordedSourceMapSpan;
|
|
sourceMapData.sourceMapDecodedMappings.push(lastEncodedSourceMapSpan);
|
|
function base64VLQFormatEncode(inValue) {
|
|
function base64FormatEncode(inValue) {
|
|
if (inValue < 64) {
|
|
return 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.charAt(inValue);
|
|
}
|
|
throw TypeError(inValue + ": not a 64 based value");
|
|
}
|
|
// 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
|
|
var encodedStr = "";
|
|
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;
|
|
}
|
|
encodedStr = encodedStr + base64FormatEncode(currentDigit);
|
|
} while (inValue > 0);
|
|
return encodedStr;
|
|
}
|
|
}
|
|
function recordSourceMapSpan(pos) {
|
|
var sourceLinePos = ts.getLineAndCharacterOfPosition(currentSourceFile, pos);
|
|
// Convert the location to be one-based.
|
|
sourceLinePos.line++;
|
|
sourceLinePos.character++;
|
|
var emittedLine = writer.getLine();
|
|
var emittedColumn = writer.getColumn();
|
|
// If this location wasn't recorded or the location in source is going backwards, record the span
|
|
if (!lastRecordedSourceMapSpan ||
|
|
lastRecordedSourceMapSpan.emittedLine !== emittedLine ||
|
|
lastRecordedSourceMapSpan.emittedColumn !== emittedColumn ||
|
|
(lastRecordedSourceMapSpan.sourceIndex === sourceMapSourceIndex &&
|
|
(lastRecordedSourceMapSpan.sourceLine > sourceLinePos.line ||
|
|
(lastRecordedSourceMapSpan.sourceLine === sourceLinePos.line && lastRecordedSourceMapSpan.sourceColumn > sourceLinePos.character)))) {
|
|
// Encode the last recordedSpan before assigning new
|
|
encodeLastRecordedSourceMapSpan();
|
|
// New span
|
|
lastRecordedSourceMapSpan = {
|
|
emittedLine: emittedLine,
|
|
emittedColumn: emittedColumn,
|
|
sourceLine: sourceLinePos.line,
|
|
sourceColumn: sourceLinePos.character,
|
|
nameIndex: getSourceMapNameIndex(),
|
|
sourceIndex: sourceMapSourceIndex
|
|
};
|
|
}
|
|
else {
|
|
// Take the new pos instead since there is no change in emittedLine and column since last location
|
|
lastRecordedSourceMapSpan.sourceLine = sourceLinePos.line;
|
|
lastRecordedSourceMapSpan.sourceColumn = sourceLinePos.character;
|
|
lastRecordedSourceMapSpan.sourceIndex = sourceMapSourceIndex;
|
|
}
|
|
}
|
|
function recordEmitNodeStartSpan(node) {
|
|
// Get the token pos after skipping to the token (ignoring the leading trivia)
|
|
recordSourceMapSpan(ts.skipTrivia(currentSourceFile.text, node.pos));
|
|
}
|
|
function recordEmitNodeEndSpan(node) {
|
|
recordSourceMapSpan(node.end);
|
|
}
|
|
function writeTextWithSpanRecord(tokenKind, startPos, emitFn) {
|
|
var tokenStartPos = ts.skipTrivia(currentSourceFile.text, startPos);
|
|
recordSourceMapSpan(tokenStartPos);
|
|
var tokenEndPos = emitTokenText(tokenKind, tokenStartPos, emitFn);
|
|
recordSourceMapSpan(tokenEndPos);
|
|
return tokenEndPos;
|
|
}
|
|
function recordNewSourceFileStart(node) {
|
|
// Add the file to tsFilePaths
|
|
// If sourceroot option: Use the relative path corresponding to the common directory path
|
|
// otherwise source locations relative to map file location
|
|
var sourcesDirectoryPath = compilerOptions.sourceRoot ? host.getCommonSourceDirectory() : sourceMapDir;
|
|
sourceMapData.sourceMapSources.push(ts.getRelativePathToDirectoryOrUrl(sourcesDirectoryPath, node.fileName, host.getCurrentDirectory(), host.getCanonicalFileName,
|
|
/*isAbsolutePathAnUrl*/ true));
|
|
sourceMapSourceIndex = sourceMapData.sourceMapSources.length - 1;
|
|
// The one that can be used from program to get the actual source file
|
|
sourceMapData.inputSourceFileNames.push(node.fileName);
|
|
if (compilerOptions.inlineSources) {
|
|
if (!sourceMapData.sourceMapSourcesContent) {
|
|
sourceMapData.sourceMapSourcesContent = [];
|
|
}
|
|
sourceMapData.sourceMapSourcesContent.push(node.text);
|
|
}
|
|
}
|
|
function recordScopeNameOfNode(node, scopeName) {
|
|
function recordScopeNameIndex(scopeNameIndex) {
|
|
sourceMapNameIndices.push(scopeNameIndex);
|
|
}
|
|
function recordScopeNameStart(scopeName) {
|
|
var scopeNameIndex = -1;
|
|
if (scopeName) {
|
|
var parentIndex = getSourceMapNameIndex();
|
|
if (parentIndex !== -1) {
|
|
// Child scopes are always shown with a dot (even if they have no name),
|
|
// unless it is a computed property. Then it is shown with brackets,
|
|
// but the brackets are included in the name.
|
|
var name_21 = node.name;
|
|
if (!name_21 || name_21.kind !== 133 /* ComputedPropertyName */) {
|
|
scopeName = "." + scopeName;
|
|
}
|
|
scopeName = sourceMapData.sourceMapNames[parentIndex] + scopeName;
|
|
}
|
|
scopeNameIndex = ts.getProperty(sourceMapNameIndexMap, scopeName);
|
|
if (scopeNameIndex === undefined) {
|
|
scopeNameIndex = sourceMapData.sourceMapNames.length;
|
|
sourceMapData.sourceMapNames.push(scopeName);
|
|
sourceMapNameIndexMap[scopeName] = scopeNameIndex;
|
|
}
|
|
}
|
|
recordScopeNameIndex(scopeNameIndex);
|
|
}
|
|
if (scopeName) {
|
|
// The scope was already given a name use it
|
|
recordScopeNameStart(scopeName);
|
|
}
|
|
else if (node.kind === 210 /* FunctionDeclaration */ ||
|
|
node.kind === 170 /* FunctionExpression */ ||
|
|
node.kind === 140 /* MethodDeclaration */ ||
|
|
node.kind === 139 /* MethodSignature */ ||
|
|
node.kind === 142 /* GetAccessor */ ||
|
|
node.kind === 143 /* SetAccessor */ ||
|
|
node.kind === 215 /* ModuleDeclaration */ ||
|
|
node.kind === 211 /* ClassDeclaration */ ||
|
|
node.kind === 214 /* EnumDeclaration */) {
|
|
// Declaration and has associated name use it
|
|
if (node.name) {
|
|
var name_22 = node.name;
|
|
// For computed property names, the text will include the brackets
|
|
scopeName = name_22.kind === 133 /* ComputedPropertyName */
|
|
? ts.getTextOfNode(name_22)
|
|
: node.name.text;
|
|
}
|
|
recordScopeNameStart(scopeName);
|
|
}
|
|
else {
|
|
// Block just use the name from upper level scope
|
|
recordScopeNameIndex(getSourceMapNameIndex());
|
|
}
|
|
}
|
|
function recordScopeNameEnd() {
|
|
sourceMapNameIndices.pop();
|
|
}
|
|
;
|
|
function writeCommentRangeWithMap(curentSourceFile, writer, comment, newLine) {
|
|
recordSourceMapSpan(comment.pos);
|
|
ts.writeCommentRange(currentSourceFile, writer, comment, newLine);
|
|
recordSourceMapSpan(comment.end);
|
|
}
|
|
function serializeSourceMapContents(version, file, sourceRoot, sources, names, mappings, sourcesContent) {
|
|
if (typeof JSON !== "undefined") {
|
|
var map_1 = {
|
|
version: version,
|
|
file: file,
|
|
sourceRoot: sourceRoot,
|
|
sources: sources,
|
|
names: names,
|
|
mappings: mappings
|
|
};
|
|
if (sourcesContent !== undefined) {
|
|
map_1.sourcesContent = sourcesContent;
|
|
}
|
|
return JSON.stringify(map_1);
|
|
}
|
|
return "{\"version\":" + version + ",\"file\":\"" + ts.escapeString(file) + "\",\"sourceRoot\":\"" + ts.escapeString(sourceRoot) + "\",\"sources\":[" + serializeStringArray(sources) + "],\"names\":[" + serializeStringArray(names) + "],\"mappings\":\"" + ts.escapeString(mappings) + "\" " + (sourcesContent !== undefined ? ",\"sourcesContent\":[" + serializeStringArray(sourcesContent) + "]" : "") + "}";
|
|
function serializeStringArray(list) {
|
|
var output = "";
|
|
for (var i = 0, n = list.length; i < n; i++) {
|
|
if (i) {
|
|
output += ",";
|
|
}
|
|
output += "\"" + ts.escapeString(list[i]) + "\"";
|
|
}
|
|
return output;
|
|
}
|
|
}
|
|
function writeJavaScriptAndSourceMapFile(emitOutput, writeByteOrderMark) {
|
|
encodeLastRecordedSourceMapSpan();
|
|
var sourceMapText = serializeSourceMapContents(3, sourceMapData.sourceMapFile, sourceMapData.sourceMapSourceRoot, sourceMapData.sourceMapSources, sourceMapData.sourceMapNames, sourceMapData.sourceMapMappings, sourceMapData.sourceMapSourcesContent);
|
|
sourceMapDataList.push(sourceMapData);
|
|
var sourceMapUrl;
|
|
if (compilerOptions.inlineSourceMap) {
|
|
// Encode the sourceMap into the sourceMap url
|
|
var base64SourceMapText = ts.convertToBase64(sourceMapText);
|
|
sourceMapUrl = "//# sourceMappingURL=data:application/json;base64," + base64SourceMapText;
|
|
}
|
|
else {
|
|
// Write source map file
|
|
ts.writeFile(host, diagnostics, sourceMapData.sourceMapFilePath, sourceMapText, false);
|
|
sourceMapUrl = "//# sourceMappingURL=" + sourceMapData.jsSourceMappingURL;
|
|
}
|
|
// Write sourcemap url to the js file and write the js file
|
|
writeJavaScriptFile(emitOutput + sourceMapUrl, writeByteOrderMark);
|
|
}
|
|
// Initialize source map data
|
|
var sourceMapJsFile = ts.getBaseFileName(ts.normalizeSlashes(jsFilePath));
|
|
sourceMapData = {
|
|
sourceMapFilePath: jsFilePath + ".map",
|
|
jsSourceMappingURL: sourceMapJsFile + ".map",
|
|
sourceMapFile: sourceMapJsFile,
|
|
sourceMapSourceRoot: compilerOptions.sourceRoot || "",
|
|
sourceMapSources: [],
|
|
inputSourceFileNames: [],
|
|
sourceMapNames: [],
|
|
sourceMapMappings: "",
|
|
sourceMapSourcesContent: undefined,
|
|
sourceMapDecodedMappings: []
|
|
};
|
|
// 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
|
|
sourceMapData.sourceMapSourceRoot = ts.normalizeSlashes(sourceMapData.sourceMapSourceRoot);
|
|
if (sourceMapData.sourceMapSourceRoot.length && sourceMapData.sourceMapSourceRoot.charCodeAt(sourceMapData.sourceMapSourceRoot.length - 1) !== 47 /* slash */) {
|
|
sourceMapData.sourceMapSourceRoot += ts.directorySeparator;
|
|
}
|
|
if (compilerOptions.mapRoot) {
|
|
sourceMapDir = ts.normalizeSlashes(compilerOptions.mapRoot);
|
|
if (root) {
|
|
// 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(root, host, sourceMapDir));
|
|
}
|
|
if (!ts.isRootedDiskPath(sourceMapDir) && !ts.isUrl(sourceMapDir)) {
|
|
// The relative paths are relative to the common directory
|
|
sourceMapDir = ts.combinePaths(host.getCommonSourceDirectory(), sourceMapDir);
|
|
sourceMapData.jsSourceMappingURL = ts.getRelativePathToDirectoryOrUrl(ts.getDirectoryPath(ts.normalizePath(jsFilePath)), ts.combinePaths(sourceMapDir, sourceMapData.jsSourceMappingURL), host.getCurrentDirectory(), host.getCanonicalFileName,
|
|
/*isAbsolutePathAnUrl*/ true);
|
|
}
|
|
else {
|
|
sourceMapData.jsSourceMappingURL = ts.combinePaths(sourceMapDir, sourceMapData.jsSourceMappingURL);
|
|
}
|
|
}
|
|
else {
|
|
sourceMapDir = ts.getDirectoryPath(ts.normalizePath(jsFilePath));
|
|
}
|
|
function emitNodeWithSourceMap(node) {
|
|
if (node) {
|
|
if (ts.nodeIsSynthesized(node)) {
|
|
return emitNodeWithoutSourceMap(node);
|
|
}
|
|
if (node.kind !== 245 /* SourceFile */) {
|
|
recordEmitNodeStartSpan(node);
|
|
emitNodeWithoutSourceMap(node);
|
|
recordEmitNodeEndSpan(node);
|
|
}
|
|
else {
|
|
recordNewSourceFileStart(node);
|
|
emitNodeWithoutSourceMap(node);
|
|
}
|
|
}
|
|
}
|
|
writeEmittedFiles = writeJavaScriptAndSourceMapFile;
|
|
emit = emitNodeWithSourceMap;
|
|
emitStart = recordEmitNodeStartSpan;
|
|
emitEnd = recordEmitNodeEndSpan;
|
|
emitToken = writeTextWithSpanRecord;
|
|
scopeEmitStart = recordScopeNameOfNode;
|
|
scopeEmitEnd = recordScopeNameEnd;
|
|
writeComment = writeCommentRangeWithMap;
|
|
}
|
|
function writeJavaScriptFile(emitOutput, writeByteOrderMark) {
|
|
ts.writeFile(host, diagnostics, jsFilePath, emitOutput, writeByteOrderMark);
|
|
}
|
|
// Create a temporary variable with a unique unused name.
|
|
function createTempVariable(flags) {
|
|
var result = ts.createSynthesizedNode(66 /* Identifier */);
|
|
result.text = makeTempVariableName(flags);
|
|
return result;
|
|
}
|
|
function recordTempDeclaration(name) {
|
|
if (!tempVariables) {
|
|
tempVariables = [];
|
|
}
|
|
tempVariables.push(name);
|
|
}
|
|
function createAndRecordTempVariable(flags) {
|
|
var temp = createTempVariable(flags);
|
|
recordTempDeclaration(temp);
|
|
return temp;
|
|
}
|
|
function emitTempDeclarations(newLine) {
|
|
if (tempVariables) {
|
|
if (newLine) {
|
|
writeLine();
|
|
}
|
|
else {
|
|
write(" ");
|
|
}
|
|
write("var ");
|
|
emitCommaList(tempVariables);
|
|
write(";");
|
|
}
|
|
}
|
|
function emitTokenText(tokenKind, startPos, emitFn) {
|
|
var tokenString = ts.tokenToString(tokenKind);
|
|
if (emitFn) {
|
|
emitFn();
|
|
}
|
|
else {
|
|
write(tokenString);
|
|
}
|
|
return startPos + tokenString.length;
|
|
}
|
|
function emitOptional(prefix, node) {
|
|
if (node) {
|
|
write(prefix);
|
|
emit(node);
|
|
}
|
|
}
|
|
function emitParenthesizedIf(node, parenthesized) {
|
|
if (parenthesized) {
|
|
write("(");
|
|
}
|
|
emit(node);
|
|
if (parenthesized) {
|
|
write(")");
|
|
}
|
|
}
|
|
function emitTrailingCommaIfPresent(nodeList) {
|
|
if (nodeList.hasTrailingComma) {
|
|
write(",");
|
|
}
|
|
}
|
|
function emitLinePreservingList(parent, nodes, allowTrailingComma, spacesBetweenBraces) {
|
|
ts.Debug.assert(nodes.length > 0);
|
|
increaseIndent();
|
|
if (nodeStartPositionsAreOnSameLine(parent, nodes[0])) {
|
|
if (spacesBetweenBraces) {
|
|
write(" ");
|
|
}
|
|
}
|
|
else {
|
|
writeLine();
|
|
}
|
|
for (var i = 0, n = nodes.length; i < n; i++) {
|
|
if (i) {
|
|
if (nodeEndIsOnSameLineAsNodeStart(nodes[i - 1], nodes[i])) {
|
|
write(", ");
|
|
}
|
|
else {
|
|
write(",");
|
|
writeLine();
|
|
}
|
|
}
|
|
emit(nodes[i]);
|
|
}
|
|
if (nodes.hasTrailingComma && allowTrailingComma) {
|
|
write(",");
|
|
}
|
|
decreaseIndent();
|
|
if (nodeEndPositionsAreOnSameLine(parent, ts.lastOrUndefined(nodes))) {
|
|
if (spacesBetweenBraces) {
|
|
write(" ");
|
|
}
|
|
}
|
|
else {
|
|
writeLine();
|
|
}
|
|
}
|
|
function emitList(nodes, start, count, multiLine, trailingComma, leadingComma, noTrailingNewLine, emitNode) {
|
|
if (!emitNode) {
|
|
emitNode = emit;
|
|
}
|
|
for (var i = 0; i < count; i++) {
|
|
if (multiLine) {
|
|
if (i || leadingComma) {
|
|
write(",");
|
|
}
|
|
writeLine();
|
|
}
|
|
else {
|
|
if (i || leadingComma) {
|
|
write(", ");
|
|
}
|
|
}
|
|
emitNode(nodes[start + i]);
|
|
leadingComma = true;
|
|
}
|
|
if (trailingComma) {
|
|
write(",");
|
|
}
|
|
if (multiLine && !noTrailingNewLine) {
|
|
writeLine();
|
|
}
|
|
return count;
|
|
}
|
|
function emitCommaList(nodes) {
|
|
if (nodes) {
|
|
emitList(nodes, 0, nodes.length, false, false);
|
|
}
|
|
}
|
|
function emitLines(nodes) {
|
|
emitLinesStartingAt(nodes, 0);
|
|
}
|
|
function emitLinesStartingAt(nodes, startIndex) {
|
|
for (var i = startIndex; i < nodes.length; i++) {
|
|
writeLine();
|
|
emit(nodes[i]);
|
|
}
|
|
}
|
|
function isBinaryOrOctalIntegerLiteral(node, text) {
|
|
if (node.kind === 7 /* NumericLiteral */ && text.length > 1) {
|
|
switch (text.charCodeAt(1)) {
|
|
case 98 /* b */:
|
|
case 66 /* B */:
|
|
case 111 /* o */:
|
|
case 79 /* O */:
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function emitLiteral(node) {
|
|
var text = getLiteralText(node);
|
|
if ((compilerOptions.sourceMap || compilerOptions.inlineSourceMap) && (node.kind === 8 /* StringLiteral */ || ts.isTemplateLiteralKind(node.kind))) {
|
|
writer.writeLiteral(text);
|
|
}
|
|
else if (languageVersion < 2 /* ES6 */ && isBinaryOrOctalIntegerLiteral(node, text)) {
|
|
write(node.text);
|
|
}
|
|
else {
|
|
write(text);
|
|
}
|
|
}
|
|
function getLiteralText(node) {
|
|
// Any template literal or string literal with an extended escape
|
|
// (e.g. "\u{0067}") will need to be downleveled as a escaped string literal.
|
|
if (languageVersion < 2 /* ES6 */ && (ts.isTemplateLiteralKind(node.kind) || node.hasExtendedUnicodeEscape)) {
|
|
return getQuotedEscapedLiteralText('"', node.text, '"');
|
|
}
|
|
// 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 (node.parent) {
|
|
return ts.getSourceTextOfNodeFromSourceFile(currentSourceFile, node);
|
|
}
|
|
// If we can't reach the original source text, use the canonical form if it's a number,
|
|
// or an escaped quoted form of the original text if it's string-like.
|
|
switch (node.kind) {
|
|
case 8 /* StringLiteral */:
|
|
return getQuotedEscapedLiteralText('"', node.text, '"');
|
|
case 10 /* NoSubstitutionTemplateLiteral */:
|
|
return getQuotedEscapedLiteralText('`', node.text, '`');
|
|
case 11 /* TemplateHead */:
|
|
return getQuotedEscapedLiteralText('`', node.text, '${');
|
|
case 12 /* TemplateMiddle */:
|
|
return getQuotedEscapedLiteralText('}', node.text, '${');
|
|
case 13 /* TemplateTail */:
|
|
return getQuotedEscapedLiteralText('}', node.text, '`');
|
|
case 7 /* NumericLiteral */:
|
|
return node.text;
|
|
}
|
|
ts.Debug.fail("Literal kind '" + node.kind + "' not accounted for.");
|
|
}
|
|
function getQuotedEscapedLiteralText(leftQuote, text, rightQuote) {
|
|
return leftQuote + ts.escapeNonAsciiCharacters(ts.escapeString(text)) + rightQuote;
|
|
}
|
|
function emitDownlevelRawTemplateLiteral(node) {
|
|
// 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 = 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 === 10 /* NoSubstitutionTemplateLiteral */ || node.kind === 13 /* 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");
|
|
text = ts.escapeString(text);
|
|
write('"' + text + '"');
|
|
}
|
|
function emitDownlevelTaggedTemplateArray(node, literalEmitter) {
|
|
write("[");
|
|
if (node.template.kind === 10 /* NoSubstitutionTemplateLiteral */) {
|
|
literalEmitter(node.template);
|
|
}
|
|
else {
|
|
literalEmitter(node.template.head);
|
|
ts.forEach(node.template.templateSpans, function (child) {
|
|
write(", ");
|
|
literalEmitter(child.literal);
|
|
});
|
|
}
|
|
write("]");
|
|
}
|
|
function emitDownlevelTaggedTemplate(node) {
|
|
var tempVariable = createAndRecordTempVariable(0 /* Auto */);
|
|
write("(");
|
|
emit(tempVariable);
|
|
write(" = ");
|
|
emitDownlevelTaggedTemplateArray(node, emit);
|
|
write(", ");
|
|
emit(tempVariable);
|
|
write(".raw = ");
|
|
emitDownlevelTaggedTemplateArray(node, emitDownlevelRawTemplateLiteral);
|
|
write(", ");
|
|
emitParenthesizedIf(node.tag, needsParenthesisForPropertyAccessOrInvocation(node.tag));
|
|
write("(");
|
|
emit(tempVariable);
|
|
// Now we emit the expressions
|
|
if (node.template.kind === 180 /* TemplateExpression */) {
|
|
ts.forEach(node.template.templateSpans, function (templateSpan) {
|
|
write(", ");
|
|
var needsParens = templateSpan.expression.kind === 178 /* BinaryExpression */
|
|
&& templateSpan.expression.operatorToken.kind === 23 /* CommaToken */;
|
|
emitParenthesizedIf(templateSpan.expression, needsParens);
|
|
});
|
|
}
|
|
write("))");
|
|
}
|
|
function emitTemplateExpression(node) {
|
|
// In ES6 mode and above, we can simply emit each portion of a template in order, but in
|
|
// ES3 & ES5 we must convert the template expression into a series of string concatenations.
|
|
if (languageVersion >= 2 /* ES6 */) {
|
|
ts.forEachChild(node, emit);
|
|
return;
|
|
}
|
|
var emitOuterParens = ts.isExpression(node.parent)
|
|
&& templateNeedsParens(node, node.parent);
|
|
if (emitOuterParens) {
|
|
write("(");
|
|
}
|
|
var headEmitted = false;
|
|
if (shouldEmitTemplateHead()) {
|
|
emitLiteral(node.head);
|
|
headEmitted = true;
|
|
}
|
|
for (var i = 0, n = node.templateSpans.length; i < n; i++) {
|
|
var templateSpan = node.templateSpans[i];
|
|
// Check if the expression has operands and binds its operands less closely than binary '+'.
|
|
// If it does, we need to wrap 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 needsParens = templateSpan.expression.kind !== 169 /* ParenthesizedExpression */
|
|
&& comparePrecedenceToBinaryPlus(templateSpan.expression) !== 1 /* GreaterThan */;
|
|
if (i > 0 || headEmitted) {
|
|
// If this is the first span and the head was not emitted, then this templateSpan's
|
|
// expression will be the first to be emitted. Don't emit the preceding ' + ' in that
|
|
// case.
|
|
write(" + ");
|
|
}
|
|
emitParenthesizedIf(templateSpan.expression, needsParens);
|
|
// 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 (templateSpan.literal.text.length !== 0) {
|
|
write(" + ");
|
|
emitLiteral(templateSpan.literal);
|
|
}
|
|
}
|
|
if (emitOuterParens) {
|
|
write(")");
|
|
}
|
|
function shouldEmitTemplateHead() {
|
|
// 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;
|
|
}
|
|
function templateNeedsParens(template, parent) {
|
|
switch (parent.kind) {
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
return parent.expression === template;
|
|
case 167 /* TaggedTemplateExpression */:
|
|
case 169 /* ParenthesizedExpression */:
|
|
return false;
|
|
default:
|
|
return comparePrecedenceToBinaryPlus(parent) !== -1 /* LessThan */;
|
|
}
|
|
}
|
|
/**
|
|
* Returns whether the expression has lesser, greater,
|
|
* or equal precedence to the binary '+' operator
|
|
*/
|
|
function comparePrecedenceToBinaryPlus(expression) {
|
|
// All binary expressions have lower precedence than '+' apart from '*', '/', and '%'
|
|
// which have greater precedence and '-' which has equal precedence.
|
|
// All unary operators have a higher precedence apart from yield.
|
|
// Arrow functions and conditionals have a lower precedence,
|
|
// although we convert the former into regular function expressions in ES5 mode,
|
|
// and in ES6 mode this function won't get called anyway.
|
|
//
|
|
// TODO (drosen): Note that we need to account for the upcoming 'yield' and
|
|
// spread ('...') unary operators that are anticipated for ES6.
|
|
switch (expression.kind) {
|
|
case 178 /* BinaryExpression */:
|
|
switch (expression.operatorToken.kind) {
|
|
case 36 /* AsteriskToken */:
|
|
case 37 /* SlashToken */:
|
|
case 38 /* PercentToken */:
|
|
return 1 /* GreaterThan */;
|
|
case 34 /* PlusToken */:
|
|
case 35 /* MinusToken */:
|
|
return 0 /* EqualTo */;
|
|
default:
|
|
return -1 /* LessThan */;
|
|
}
|
|
case 181 /* YieldExpression */:
|
|
case 179 /* ConditionalExpression */:
|
|
return -1 /* LessThan */;
|
|
default:
|
|
return 1 /* GreaterThan */;
|
|
}
|
|
}
|
|
}
|
|
function emitTemplateSpan(span) {
|
|
emit(span.expression);
|
|
emit(span.literal);
|
|
}
|
|
function jsxEmitReact(node) {
|
|
/// Emit a tag name, which is either '"div"' for lower-cased names, or
|
|
/// 'Div' for upper-cased or dotted names
|
|
function emitTagName(name) {
|
|
if (name.kind === 66 /* Identifier */ && ts.isIntrinsicJsxName(name.text)) {
|
|
write('"');
|
|
emit(name);
|
|
write('"');
|
|
}
|
|
else {
|
|
emit(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 emitAttributeName(name) {
|
|
if (/[A-Za-z_]+[\w*]/.test(name.text)) {
|
|
write('"');
|
|
emit(name);
|
|
write('"');
|
|
}
|
|
else {
|
|
emit(name);
|
|
}
|
|
}
|
|
/// Emit an name/value pair for an attribute (e.g. "x: 3")
|
|
function emitJsxAttribute(node) {
|
|
emitAttributeName(node.name);
|
|
write(": ");
|
|
if (node.initializer) {
|
|
emit(node.initializer);
|
|
}
|
|
else {
|
|
write("true");
|
|
}
|
|
}
|
|
function emitJsxElement(openingNode, children) {
|
|
// Call React.createElement(tag, ...
|
|
emitLeadingComments(openingNode);
|
|
write("React.createElement(");
|
|
emitTagName(openingNode.tagName);
|
|
write(", ");
|
|
// Attribute list
|
|
if (openingNode.attributes.length === 0) {
|
|
// When there are no attributes, React wants "null"
|
|
write("null");
|
|
}
|
|
else {
|
|
// Either emit one big object literal (no spread attribs), or
|
|
// a call to React.__spread
|
|
var attrs = openingNode.attributes;
|
|
if (ts.forEach(attrs, function (attr) { return attr.kind === 236 /* JsxSpreadAttribute */; })) {
|
|
write("React.__spread(");
|
|
var haveOpenedObjectLiteral = false;
|
|
for (var i_2 = 0; i_2 < attrs.length; i_2++) {
|
|
if (attrs[i_2].kind === 236 /* JsxSpreadAttribute */) {
|
|
// If this is the first argument, we need to emit a {} as the first argument
|
|
if (i_2 === 0) {
|
|
write("{}, ");
|
|
}
|
|
if (haveOpenedObjectLiteral) {
|
|
write("}");
|
|
haveOpenedObjectLiteral = false;
|
|
}
|
|
if (i_2 > 0) {
|
|
write(", ");
|
|
}
|
|
emit(attrs[i_2].expression);
|
|
}
|
|
else {
|
|
ts.Debug.assert(attrs[i_2].kind === 235 /* JsxAttribute */);
|
|
if (haveOpenedObjectLiteral) {
|
|
write(", ");
|
|
}
|
|
else {
|
|
haveOpenedObjectLiteral = true;
|
|
if (i_2 > 0) {
|
|
write(", ");
|
|
}
|
|
write("{");
|
|
}
|
|
emitJsxAttribute(attrs[i_2]);
|
|
}
|
|
}
|
|
if (haveOpenedObjectLiteral)
|
|
write("}");
|
|
write(")"); // closing paren to React.__spread(
|
|
}
|
|
else {
|
|
// One object literal with all the attributes in them
|
|
write("{");
|
|
for (var i = 0; i < attrs.length; i++) {
|
|
if (i > 0) {
|
|
write(", ");
|
|
}
|
|
emitJsxAttribute(attrs[i]);
|
|
}
|
|
write("}");
|
|
}
|
|
}
|
|
// Children
|
|
if (children) {
|
|
for (var i = 0; i < children.length; i++) {
|
|
// Don't emit empty expressions
|
|
if (children[i].kind === 237 /* JsxExpression */ && !(children[i].expression)) {
|
|
continue;
|
|
}
|
|
// Don't emit empty strings
|
|
if (children[i].kind === 233 /* JsxText */) {
|
|
var text = getTextToEmit(children[i]);
|
|
if (text !== undefined) {
|
|
write(', "');
|
|
write(text);
|
|
write('"');
|
|
}
|
|
}
|
|
else {
|
|
write(", ");
|
|
emit(children[i]);
|
|
}
|
|
}
|
|
}
|
|
// Closing paren
|
|
write(")"); // closes "React.createElement("
|
|
emitTrailingComments(openingNode);
|
|
}
|
|
if (node.kind === 230 /* JsxElement */) {
|
|
emitJsxElement(node.openingElement, node.children);
|
|
}
|
|
else {
|
|
ts.Debug.assert(node.kind === 231 /* JsxSelfClosingElement */);
|
|
emitJsxElement(node);
|
|
}
|
|
}
|
|
function jsxEmitPreserve(node) {
|
|
function emitJsxAttribute(node) {
|
|
emit(node.name);
|
|
write("=");
|
|
emit(node.initializer);
|
|
}
|
|
function emitJsxSpreadAttribute(node) {
|
|
write("{...");
|
|
emit(node.expression);
|
|
write("}");
|
|
}
|
|
function emitAttributes(attribs) {
|
|
for (var i = 0, n = attribs.length; i < n; i++) {
|
|
if (i > 0) {
|
|
write(" ");
|
|
}
|
|
if (attribs[i].kind === 236 /* JsxSpreadAttribute */) {
|
|
emitJsxSpreadAttribute(attribs[i]);
|
|
}
|
|
else {
|
|
ts.Debug.assert(attribs[i].kind === 235 /* JsxAttribute */);
|
|
emitJsxAttribute(attribs[i]);
|
|
}
|
|
}
|
|
}
|
|
function emitJsxOpeningOrSelfClosingElement(node) {
|
|
write("<");
|
|
emit(node.tagName);
|
|
if (node.attributes.length > 0 || (node.kind === 231 /* JsxSelfClosingElement */)) {
|
|
write(" ");
|
|
}
|
|
emitAttributes(node.attributes);
|
|
if (node.kind === 231 /* JsxSelfClosingElement */) {
|
|
write("/>");
|
|
}
|
|
else {
|
|
write(">");
|
|
}
|
|
}
|
|
function emitJsxClosingElement(node) {
|
|
write("</");
|
|
emit(node.tagName);
|
|
write(">");
|
|
}
|
|
function emitJsxElement(node) {
|
|
emitJsxOpeningOrSelfClosingElement(node.openingElement);
|
|
for (var i = 0, n = node.children.length; i < n; i++) {
|
|
emit(node.children[i]);
|
|
}
|
|
emitJsxClosingElement(node.closingElement);
|
|
}
|
|
if (node.kind === 230 /* JsxElement */) {
|
|
emitJsxElement(node);
|
|
}
|
|
else {
|
|
ts.Debug.assert(node.kind === 231 /* JsxSelfClosingElement */);
|
|
emitJsxOpeningOrSelfClosingElement(node);
|
|
}
|
|
}
|
|
// This function specifically handles numeric/string literals for enum and accessor 'identifiers'.
|
|
// In a sense, it does not actually emit identifiers as much as it declares a name for a specific property.
|
|
// For example, this is utilized when feeding in a result to Object.defineProperty.
|
|
function emitExpressionForPropertyName(node) {
|
|
ts.Debug.assert(node.kind !== 160 /* BindingElement */);
|
|
if (node.kind === 8 /* StringLiteral */) {
|
|
emitLiteral(node);
|
|
}
|
|
else if (node.kind === 133 /* ComputedPropertyName */) {
|
|
// if this is a decorated computed property, we will need to capture the result
|
|
// of the property expression so that we can apply decorators later. This is to ensure
|
|
// we don't introduce unintended side effects:
|
|
//
|
|
// class C {
|
|
// [_a = x]() { }
|
|
// }
|
|
//
|
|
// The emit for the decorated computed property decorator is:
|
|
//
|
|
// Object.defineProperty(C.prototype, _a, __decorate([dec], C.prototype, _a, Object.getOwnPropertyDescriptor(C.prototype, _a)));
|
|
//
|
|
if (ts.nodeIsDecorated(node.parent)) {
|
|
if (!computedPropertyNamesToGeneratedNames) {
|
|
computedPropertyNamesToGeneratedNames = [];
|
|
}
|
|
var generatedName = computedPropertyNamesToGeneratedNames[ts.getNodeId(node)];
|
|
if (generatedName) {
|
|
// we have already generated a variable for this node, write that value instead.
|
|
write(generatedName);
|
|
return;
|
|
}
|
|
generatedName = createAndRecordTempVariable(0 /* Auto */).text;
|
|
computedPropertyNamesToGeneratedNames[ts.getNodeId(node)] = generatedName;
|
|
write(generatedName);
|
|
write(" = ");
|
|
}
|
|
emit(node.expression);
|
|
}
|
|
else {
|
|
write("\"");
|
|
if (node.kind === 7 /* NumericLiteral */) {
|
|
write(node.text);
|
|
}
|
|
else {
|
|
writeTextOfNode(currentSourceFile, node);
|
|
}
|
|
write("\"");
|
|
}
|
|
}
|
|
function isExpressionIdentifier(node) {
|
|
var parent = node.parent;
|
|
switch (parent.kind) {
|
|
case 161 /* ArrayLiteralExpression */:
|
|
case 178 /* BinaryExpression */:
|
|
case 165 /* CallExpression */:
|
|
case 238 /* CaseClause */:
|
|
case 133 /* ComputedPropertyName */:
|
|
case 179 /* ConditionalExpression */:
|
|
case 136 /* Decorator */:
|
|
case 172 /* DeleteExpression */:
|
|
case 194 /* DoStatement */:
|
|
case 164 /* ElementAccessExpression */:
|
|
case 224 /* ExportAssignment */:
|
|
case 192 /* ExpressionStatement */:
|
|
case 185 /* ExpressionWithTypeArguments */:
|
|
case 196 /* ForStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
case 193 /* IfStatement */:
|
|
case 231 /* JsxSelfClosingElement */:
|
|
case 232 /* JsxOpeningElement */:
|
|
case 166 /* NewExpression */:
|
|
case 169 /* ParenthesizedExpression */:
|
|
case 177 /* PostfixUnaryExpression */:
|
|
case 176 /* PrefixUnaryExpression */:
|
|
case 201 /* ReturnStatement */:
|
|
case 243 /* ShorthandPropertyAssignment */:
|
|
case 182 /* SpreadElementExpression */:
|
|
case 203 /* SwitchStatement */:
|
|
case 167 /* TaggedTemplateExpression */:
|
|
case 187 /* TemplateSpan */:
|
|
case 205 /* ThrowStatement */:
|
|
case 168 /* TypeAssertionExpression */:
|
|
case 173 /* TypeOfExpression */:
|
|
case 174 /* VoidExpression */:
|
|
case 195 /* WhileStatement */:
|
|
case 202 /* WithStatement */:
|
|
case 181 /* YieldExpression */:
|
|
return true;
|
|
case 160 /* BindingElement */:
|
|
case 244 /* EnumMember */:
|
|
case 135 /* Parameter */:
|
|
case 242 /* PropertyAssignment */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 208 /* VariableDeclaration */:
|
|
return parent.initializer === node;
|
|
case 163 /* PropertyAccessExpression */:
|
|
return parent.expression === node;
|
|
case 171 /* ArrowFunction */:
|
|
case 170 /* FunctionExpression */:
|
|
return parent.body === node;
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
return parent.moduleReference === node;
|
|
case 132 /* QualifiedName */:
|
|
return parent.left === node;
|
|
}
|
|
return false;
|
|
}
|
|
function emitExpressionIdentifier(node) {
|
|
if (resolver.getNodeCheckFlags(node) & 2048 /* LexicalArguments */) {
|
|
write("_arguments");
|
|
return;
|
|
}
|
|
var container = resolver.getReferencedExportContainer(node);
|
|
if (container) {
|
|
if (container.kind === 245 /* SourceFile */) {
|
|
// Identifier references module export
|
|
if (languageVersion < 2 /* ES6 */ && compilerOptions.module !== 4 /* System */) {
|
|
write("exports.");
|
|
}
|
|
}
|
|
else {
|
|
// Identifier references namespace export
|
|
write(getGeneratedNameForNode(container));
|
|
write(".");
|
|
}
|
|
}
|
|
else if (languageVersion < 2 /* ES6 */) {
|
|
var declaration = resolver.getReferencedImportDeclaration(node);
|
|
if (declaration) {
|
|
if (declaration.kind === 220 /* ImportClause */) {
|
|
// Identifier references default import
|
|
write(getGeneratedNameForNode(declaration.parent));
|
|
write(languageVersion === 0 /* ES3 */ ? '["default"]' : ".default");
|
|
return;
|
|
}
|
|
else if (declaration.kind === 223 /* ImportSpecifier */) {
|
|
// Identifier references named import
|
|
write(getGeneratedNameForNode(declaration.parent.parent.parent));
|
|
write(".");
|
|
writeTextOfNode(currentSourceFile, declaration.propertyName || declaration.name);
|
|
return;
|
|
}
|
|
}
|
|
declaration = resolver.getReferencedNestedRedeclaration(node);
|
|
if (declaration) {
|
|
write(getGeneratedNameForNode(declaration.name));
|
|
return;
|
|
}
|
|
}
|
|
writeTextOfNode(currentSourceFile, node);
|
|
}
|
|
function isNameOfNestedRedeclaration(node) {
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
var parent_7 = node.parent;
|
|
switch (parent_7.kind) {
|
|
case 160 /* BindingElement */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 208 /* VariableDeclaration */:
|
|
return parent_7.name === node && resolver.isNestedRedeclaration(parent_7);
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function emitIdentifier(node) {
|
|
if (!node.parent) {
|
|
write(node.text);
|
|
}
|
|
else if (isExpressionIdentifier(node)) {
|
|
emitExpressionIdentifier(node);
|
|
}
|
|
else if (isNameOfNestedRedeclaration(node)) {
|
|
write(getGeneratedNameForNode(node));
|
|
}
|
|
else {
|
|
writeTextOfNode(currentSourceFile, node);
|
|
}
|
|
}
|
|
function emitThis(node) {
|
|
if (resolver.getNodeCheckFlags(node) & 2 /* LexicalThis */) {
|
|
write("_this");
|
|
}
|
|
else {
|
|
write("this");
|
|
}
|
|
}
|
|
function emitSuper(node) {
|
|
if (languageVersion >= 2 /* ES6 */) {
|
|
write("super");
|
|
}
|
|
else {
|
|
var flags = resolver.getNodeCheckFlags(node);
|
|
if (flags & 256 /* SuperInstance */) {
|
|
write("_super.prototype");
|
|
}
|
|
else {
|
|
write("_super");
|
|
}
|
|
}
|
|
}
|
|
function emitObjectBindingPattern(node) {
|
|
write("{ ");
|
|
var elements = node.elements;
|
|
emitList(elements, 0, elements.length, false, elements.hasTrailingComma);
|
|
write(" }");
|
|
}
|
|
function emitArrayBindingPattern(node) {
|
|
write("[");
|
|
var elements = node.elements;
|
|
emitList(elements, 0, elements.length, false, elements.hasTrailingComma);
|
|
write("]");
|
|
}
|
|
function emitBindingElement(node) {
|
|
if (node.propertyName) {
|
|
emit(node.propertyName);
|
|
write(": ");
|
|
}
|
|
if (node.dotDotDotToken) {
|
|
write("...");
|
|
}
|
|
if (ts.isBindingPattern(node.name)) {
|
|
emit(node.name);
|
|
}
|
|
else {
|
|
emitModuleMemberName(node);
|
|
}
|
|
emitOptional(" = ", node.initializer);
|
|
}
|
|
function emitSpreadElementExpression(node) {
|
|
write("...");
|
|
emit(node.expression);
|
|
}
|
|
function emitYieldExpression(node) {
|
|
write(ts.tokenToString(111 /* YieldKeyword */));
|
|
if (node.asteriskToken) {
|
|
write("*");
|
|
}
|
|
if (node.expression) {
|
|
write(" ");
|
|
emit(node.expression);
|
|
}
|
|
}
|
|
function emitAwaitExpression(node) {
|
|
var needsParenthesis = needsParenthesisForAwaitExpressionAsYield(node);
|
|
if (needsParenthesis) {
|
|
write("(");
|
|
}
|
|
write(ts.tokenToString(111 /* YieldKeyword */));
|
|
write(" ");
|
|
emit(node.expression);
|
|
if (needsParenthesis) {
|
|
write(")");
|
|
}
|
|
}
|
|
function needsParenthesisForAwaitExpressionAsYield(node) {
|
|
if (node.parent.kind === 178 /* BinaryExpression */ && !ts.isAssignmentOperator(node.parent.operatorToken.kind)) {
|
|
return true;
|
|
}
|
|
else if (node.parent.kind === 179 /* ConditionalExpression */ && node.parent.condition === node) {
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function needsParenthesisForPropertyAccessOrInvocation(node) {
|
|
switch (node.kind) {
|
|
case 66 /* Identifier */:
|
|
case 161 /* ArrayLiteralExpression */:
|
|
case 163 /* PropertyAccessExpression */:
|
|
case 164 /* ElementAccessExpression */:
|
|
case 165 /* CallExpression */:
|
|
case 169 /* ParenthesizedExpression */:
|
|
// This list is not exhaustive and only includes those cases that are relevant
|
|
// to the check in emitArrayLiteral. More cases can be added as needed.
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
function emitListWithSpread(elements, needsUniqueCopy, multiLine, trailingComma, useConcat) {
|
|
var pos = 0;
|
|
var group = 0;
|
|
var length = elements.length;
|
|
while (pos < length) {
|
|
// Emit using the pattern <group0>.concat(<group1>, <group2>, ...)
|
|
if (group === 1 && useConcat) {
|
|
write(".concat(");
|
|
}
|
|
else if (group > 0) {
|
|
write(", ");
|
|
}
|
|
var e = elements[pos];
|
|
if (e.kind === 182 /* SpreadElementExpression */) {
|
|
e = e.expression;
|
|
emitParenthesizedIf(e, group === 0 && needsParenthesisForPropertyAccessOrInvocation(e));
|
|
pos++;
|
|
if (pos === length && group === 0 && needsUniqueCopy && e.kind !== 161 /* ArrayLiteralExpression */) {
|
|
write(".slice()");
|
|
}
|
|
}
|
|
else {
|
|
var i = pos;
|
|
while (i < length && elements[i].kind !== 182 /* SpreadElementExpression */) {
|
|
i++;
|
|
}
|
|
write("[");
|
|
if (multiLine) {
|
|
increaseIndent();
|
|
}
|
|
emitList(elements, pos, i - pos, multiLine, trailingComma && i === length);
|
|
if (multiLine) {
|
|
decreaseIndent();
|
|
}
|
|
write("]");
|
|
pos = i;
|
|
}
|
|
group++;
|
|
}
|
|
if (group > 1) {
|
|
if (useConcat) {
|
|
write(")");
|
|
}
|
|
}
|
|
}
|
|
function isSpreadElementExpression(node) {
|
|
return node.kind === 182 /* SpreadElementExpression */;
|
|
}
|
|
function emitArrayLiteral(node) {
|
|
var elements = node.elements;
|
|
if (elements.length === 0) {
|
|
write("[]");
|
|
}
|
|
else if (languageVersion >= 2 /* ES6 */ || !ts.forEach(elements, isSpreadElementExpression)) {
|
|
write("[");
|
|
emitLinePreservingList(node, node.elements, elements.hasTrailingComma, false);
|
|
write("]");
|
|
}
|
|
else {
|
|
emitListWithSpread(elements, true, (node.flags & 2048 /* MultiLine */) !== 0,
|
|
/*trailingComma*/ elements.hasTrailingComma, true);
|
|
}
|
|
}
|
|
function emitObjectLiteralBody(node, numElements) {
|
|
if (numElements === 0) {
|
|
write("{}");
|
|
return;
|
|
}
|
|
write("{");
|
|
if (numElements > 0) {
|
|
var properties = node.properties;
|
|
// If we are not doing a downlevel transformation for object literals,
|
|
// then try to preserve the original shape of the object literal.
|
|
// Otherwise just try to preserve the formatting.
|
|
if (numElements === properties.length) {
|
|
emitLinePreservingList(node, properties, languageVersion >= 1 /* ES5 */, true);
|
|
}
|
|
else {
|
|
var multiLine = (node.flags & 2048 /* MultiLine */) !== 0;
|
|
if (!multiLine) {
|
|
write(" ");
|
|
}
|
|
else {
|
|
increaseIndent();
|
|
}
|
|
emitList(properties, 0, numElements, multiLine, false);
|
|
if (!multiLine) {
|
|
write(" ");
|
|
}
|
|
else {
|
|
decreaseIndent();
|
|
}
|
|
}
|
|
}
|
|
write("}");
|
|
}
|
|
function emitDownlevelObjectLiteralWithComputedProperties(node, firstComputedPropertyIndex) {
|
|
var multiLine = (node.flags & 2048 /* MultiLine */) !== 0;
|
|
var properties = node.properties;
|
|
write("(");
|
|
if (multiLine) {
|
|
increaseIndent();
|
|
}
|
|
// 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 tempVar = createAndRecordTempVariable(0 /* Auto */);
|
|
// Write out the first non-computed properties
|
|
// (or all properties if none of them are computed),
|
|
// then emit the rest through indexing on the temp variable.
|
|
emit(tempVar);
|
|
write(" = ");
|
|
emitObjectLiteralBody(node, firstComputedPropertyIndex);
|
|
for (var i = firstComputedPropertyIndex, n = properties.length; i < n; i++) {
|
|
writeComma();
|
|
var property = properties[i];
|
|
emitStart(property);
|
|
if (property.kind === 142 /* GetAccessor */ || property.kind === 143 /* SetAccessor */) {
|
|
// TODO (drosen): Reconcile with 'emitMemberFunctions'.
|
|
var accessors = ts.getAllAccessorDeclarations(node.properties, property);
|
|
if (property !== accessors.firstAccessor) {
|
|
continue;
|
|
}
|
|
write("Object.defineProperty(");
|
|
emit(tempVar);
|
|
write(", ");
|
|
emitStart(node.name);
|
|
emitExpressionForPropertyName(property.name);
|
|
emitEnd(property.name);
|
|
write(", {");
|
|
increaseIndent();
|
|
if (accessors.getAccessor) {
|
|
writeLine();
|
|
emitLeadingComments(accessors.getAccessor);
|
|
write("get: ");
|
|
emitStart(accessors.getAccessor);
|
|
write("function ");
|
|
emitSignatureAndBody(accessors.getAccessor);
|
|
emitEnd(accessors.getAccessor);
|
|
emitTrailingComments(accessors.getAccessor);
|
|
write(",");
|
|
}
|
|
if (accessors.setAccessor) {
|
|
writeLine();
|
|
emitLeadingComments(accessors.setAccessor);
|
|
write("set: ");
|
|
emitStart(accessors.setAccessor);
|
|
write("function ");
|
|
emitSignatureAndBody(accessors.setAccessor);
|
|
emitEnd(accessors.setAccessor);
|
|
emitTrailingComments(accessors.setAccessor);
|
|
write(",");
|
|
}
|
|
writeLine();
|
|
write("enumerable: true,");
|
|
writeLine();
|
|
write("configurable: true");
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("})");
|
|
emitEnd(property);
|
|
}
|
|
else {
|
|
emitLeadingComments(property);
|
|
emitStart(property.name);
|
|
emit(tempVar);
|
|
emitMemberAccessForPropertyName(property.name);
|
|
emitEnd(property.name);
|
|
write(" = ");
|
|
if (property.kind === 242 /* PropertyAssignment */) {
|
|
emit(property.initializer);
|
|
}
|
|
else if (property.kind === 243 /* ShorthandPropertyAssignment */) {
|
|
emitExpressionIdentifier(property.name);
|
|
}
|
|
else if (property.kind === 140 /* MethodDeclaration */) {
|
|
emitFunctionDeclaration(property);
|
|
}
|
|
else {
|
|
ts.Debug.fail("ObjectLiteralElement type not accounted for: " + property.kind);
|
|
}
|
|
}
|
|
emitEnd(property);
|
|
}
|
|
writeComma();
|
|
emit(tempVar);
|
|
if (multiLine) {
|
|
decreaseIndent();
|
|
writeLine();
|
|
}
|
|
write(")");
|
|
function writeComma() {
|
|
if (multiLine) {
|
|
write(",");
|
|
writeLine();
|
|
}
|
|
else {
|
|
write(", ");
|
|
}
|
|
}
|
|
}
|
|
function emitObjectLiteral(node) {
|
|
var properties = node.properties;
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
var numProperties = properties.length;
|
|
// Find the first computed property.
|
|
// Everything until that point can be emitted as part of the initial object literal.
|
|
var numInitialNonComputedProperties = numProperties;
|
|
for (var i = 0, n = properties.length; i < n; i++) {
|
|
if (properties[i].name.kind === 133 /* ComputedPropertyName */) {
|
|
numInitialNonComputedProperties = i;
|
|
break;
|
|
}
|
|
}
|
|
var hasComputedProperty = numInitialNonComputedProperties !== properties.length;
|
|
if (hasComputedProperty) {
|
|
emitDownlevelObjectLiteralWithComputedProperties(node, numInitialNonComputedProperties);
|
|
return;
|
|
}
|
|
}
|
|
// Ordinary case: either the object has no computed properties
|
|
// or we're compiling with an ES6+ target.
|
|
emitObjectLiteralBody(node, properties.length);
|
|
}
|
|
function createBinaryExpression(left, operator, right, startsOnNewLine) {
|
|
var result = ts.createSynthesizedNode(178 /* BinaryExpression */, startsOnNewLine);
|
|
result.operatorToken = ts.createSynthesizedNode(operator);
|
|
result.left = left;
|
|
result.right = right;
|
|
return result;
|
|
}
|
|
function createPropertyAccessExpression(expression, name) {
|
|
var result = ts.createSynthesizedNode(163 /* PropertyAccessExpression */);
|
|
result.expression = parenthesizeForAccess(expression);
|
|
result.dotToken = ts.createSynthesizedNode(20 /* DotToken */);
|
|
result.name = name;
|
|
return result;
|
|
}
|
|
function createElementAccessExpression(expression, argumentExpression) {
|
|
var result = ts.createSynthesizedNode(164 /* ElementAccessExpression */);
|
|
result.expression = parenthesizeForAccess(expression);
|
|
result.argumentExpression = argumentExpression;
|
|
return result;
|
|
}
|
|
function parenthesizeForAccess(expr) {
|
|
// When diagnosing whether the expression needs parentheses, the decision should be based
|
|
// on the innermost expression in a chain of nested type assertions.
|
|
while (expr.kind === 168 /* TypeAssertionExpression */ || expr.kind === 186 /* AsExpression */) {
|
|
expr = expr.expression;
|
|
}
|
|
// isLeftHandSideExpression is almost the correct criterion for when it is not necessary
|
|
// to parenthesize the expression before a dot. The known exceptions are:
|
|
//
|
|
// NewExpression:
|
|
// new C.x -> not the same as (new C).x
|
|
// NumberLiteral
|
|
// 1.x -> not the same as (1).x
|
|
//
|
|
if (ts.isLeftHandSideExpression(expr) &&
|
|
expr.kind !== 166 /* NewExpression */ &&
|
|
expr.kind !== 7 /* NumericLiteral */) {
|
|
return expr;
|
|
}
|
|
var node = ts.createSynthesizedNode(169 /* ParenthesizedExpression */);
|
|
node.expression = expr;
|
|
return node;
|
|
}
|
|
function emitComputedPropertyName(node) {
|
|
write("[");
|
|
emitExpressionForPropertyName(node);
|
|
write("]");
|
|
}
|
|
function emitMethod(node) {
|
|
if (languageVersion >= 2 /* ES6 */ && node.asteriskToken) {
|
|
write("*");
|
|
}
|
|
emit(node.name);
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
write(": function ");
|
|
}
|
|
emitSignatureAndBody(node);
|
|
}
|
|
function emitPropertyAssignment(node) {
|
|
emit(node.name);
|
|
write(": ");
|
|
emit(node.initializer);
|
|
}
|
|
// Return true if identifier resolves to an exported member of a namespace
|
|
function isNamespaceExportReference(node) {
|
|
var container = resolver.getReferencedExportContainer(node);
|
|
return container && container.kind !== 245 /* SourceFile */;
|
|
}
|
|
function emitShorthandPropertyAssignment(node) {
|
|
// The name property of a short-hand property assignment is considered an expression position, so here
|
|
// we manually emit the identifier to avoid rewriting.
|
|
writeTextOfNode(currentSourceFile, node.name);
|
|
// If emitting pre-ES6 code, or if the name requires rewriting when resolved as an expression identifier,
|
|
// we emit a normal property assignment. For example:
|
|
// module m {
|
|
// export let y;
|
|
// }
|
|
// module m {
|
|
// let obj = { y };
|
|
// }
|
|
// Here we need to emit obj = { y : m.y } regardless of the output target.
|
|
if (languageVersion < 2 /* ES6 */ || isNamespaceExportReference(node.name)) {
|
|
// Emit identifier as an identifier
|
|
write(": ");
|
|
emit(node.name);
|
|
}
|
|
}
|
|
function tryEmitConstantValue(node) {
|
|
if (compilerOptions.isolatedModules) {
|
|
// do not inline enum values in separate compilation mode
|
|
return false;
|
|
}
|
|
var constantValue = resolver.getConstantValue(node);
|
|
if (constantValue !== undefined) {
|
|
write(constantValue.toString());
|
|
if (!compilerOptions.removeComments) {
|
|
var propertyName = node.kind === 163 /* PropertyAccessExpression */ ? ts.declarationNameToString(node.name) : ts.getTextOfNode(node.argumentExpression);
|
|
write(" /* " + propertyName + " */");
|
|
}
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
// Returns 'true' if the code was actually indented, false otherwise.
|
|
// If the code is not indented, an optional valueToWriteWhenNotIndenting will be
|
|
// emitted instead.
|
|
function indentIfOnDifferentLines(parent, node1, node2, valueToWriteWhenNotIndenting) {
|
|
var realNodesAreOnDifferentLines = !ts.nodeIsSynthesized(parent) && !nodeEndIsOnSameLineAsNodeStart(node1, node2);
|
|
// Always use a newline for synthesized code if the synthesizer desires it.
|
|
var synthesizedNodeIsOnDifferentLine = synthesizedNodeStartsOnNewLine(node2);
|
|
if (realNodesAreOnDifferentLines || synthesizedNodeIsOnDifferentLine) {
|
|
increaseIndent();
|
|
writeLine();
|
|
return true;
|
|
}
|
|
else {
|
|
if (valueToWriteWhenNotIndenting) {
|
|
write(valueToWriteWhenNotIndenting);
|
|
}
|
|
return false;
|
|
}
|
|
}
|
|
function emitPropertyAccess(node) {
|
|
if (tryEmitConstantValue(node)) {
|
|
return;
|
|
}
|
|
emit(node.expression);
|
|
var indentedBeforeDot = indentIfOnDifferentLines(node, node.expression, node.dotToken);
|
|
// 1 .toString is a valid property access, emit a space after the literal
|
|
var shouldEmitSpace;
|
|
if (!indentedBeforeDot && node.expression.kind === 7 /* NumericLiteral */) {
|
|
var text = ts.getSourceTextOfNodeFromSourceFile(currentSourceFile, node.expression);
|
|
shouldEmitSpace = text.indexOf(ts.tokenToString(20 /* DotToken */)) < 0;
|
|
}
|
|
if (shouldEmitSpace) {
|
|
write(" .");
|
|
}
|
|
else {
|
|
write(".");
|
|
}
|
|
var indentedAfterDot = indentIfOnDifferentLines(node, node.dotToken, node.name);
|
|
emit(node.name);
|
|
decreaseIndentIf(indentedBeforeDot, indentedAfterDot);
|
|
}
|
|
function emitQualifiedName(node) {
|
|
emit(node.left);
|
|
write(".");
|
|
emit(node.right);
|
|
}
|
|
function emitQualifiedNameAsExpression(node, useFallback) {
|
|
if (node.left.kind === 66 /* Identifier */) {
|
|
emitEntityNameAsExpression(node.left, useFallback);
|
|
}
|
|
else if (useFallback) {
|
|
var temp = createAndRecordTempVariable(0 /* Auto */);
|
|
write("(");
|
|
emitNodeWithoutSourceMap(temp);
|
|
write(" = ");
|
|
emitEntityNameAsExpression(node.left, true);
|
|
write(") && ");
|
|
emitNodeWithoutSourceMap(temp);
|
|
}
|
|
else {
|
|
emitEntityNameAsExpression(node.left, false);
|
|
}
|
|
write(".");
|
|
emitNodeWithoutSourceMap(node.right);
|
|
}
|
|
function emitEntityNameAsExpression(node, useFallback) {
|
|
switch (node.kind) {
|
|
case 66 /* Identifier */:
|
|
if (useFallback) {
|
|
write("typeof ");
|
|
emitExpressionIdentifier(node);
|
|
write(" !== 'undefined' && ");
|
|
}
|
|
emitExpressionIdentifier(node);
|
|
break;
|
|
case 132 /* QualifiedName */:
|
|
emitQualifiedNameAsExpression(node, useFallback);
|
|
break;
|
|
}
|
|
}
|
|
function emitIndexedAccess(node) {
|
|
if (tryEmitConstantValue(node)) {
|
|
return;
|
|
}
|
|
emit(node.expression);
|
|
write("[");
|
|
emit(node.argumentExpression);
|
|
write("]");
|
|
}
|
|
function hasSpreadElement(elements) {
|
|
return ts.forEach(elements, function (e) { return e.kind === 182 /* SpreadElementExpression */; });
|
|
}
|
|
function skipParentheses(node) {
|
|
while (node.kind === 169 /* ParenthesizedExpression */ || node.kind === 168 /* TypeAssertionExpression */ || node.kind === 186 /* AsExpression */) {
|
|
node = node.expression;
|
|
}
|
|
return node;
|
|
}
|
|
function emitCallTarget(node) {
|
|
if (node.kind === 66 /* Identifier */ || node.kind === 94 /* ThisKeyword */ || node.kind === 92 /* SuperKeyword */) {
|
|
emit(node);
|
|
return node;
|
|
}
|
|
var temp = createAndRecordTempVariable(0 /* Auto */);
|
|
write("(");
|
|
emit(temp);
|
|
write(" = ");
|
|
emit(node);
|
|
write(")");
|
|
return temp;
|
|
}
|
|
function emitCallWithSpread(node) {
|
|
var target;
|
|
var expr = skipParentheses(node.expression);
|
|
if (expr.kind === 163 /* PropertyAccessExpression */) {
|
|
// Target will be emitted as "this" argument
|
|
target = emitCallTarget(expr.expression);
|
|
write(".");
|
|
emit(expr.name);
|
|
}
|
|
else if (expr.kind === 164 /* ElementAccessExpression */) {
|
|
// Target will be emitted as "this" argument
|
|
target = emitCallTarget(expr.expression);
|
|
write("[");
|
|
emit(expr.argumentExpression);
|
|
write("]");
|
|
}
|
|
else if (expr.kind === 92 /* SuperKeyword */) {
|
|
target = expr;
|
|
write("_super");
|
|
}
|
|
else {
|
|
emit(node.expression);
|
|
}
|
|
write(".apply(");
|
|
if (target) {
|
|
if (target.kind === 92 /* SuperKeyword */) {
|
|
// Calls of form super(...) and super.foo(...)
|
|
emitThis(target);
|
|
}
|
|
else {
|
|
// Calls of form obj.foo(...)
|
|
emit(target);
|
|
}
|
|
}
|
|
else {
|
|
// Calls of form foo(...)
|
|
write("void 0");
|
|
}
|
|
write(", ");
|
|
emitListWithSpread(node.arguments, false, false, false, true);
|
|
write(")");
|
|
}
|
|
function emitCallExpression(node) {
|
|
if (languageVersion < 2 /* ES6 */ && hasSpreadElement(node.arguments)) {
|
|
emitCallWithSpread(node);
|
|
return;
|
|
}
|
|
var superCall = false;
|
|
if (node.expression.kind === 92 /* SuperKeyword */) {
|
|
emitSuper(node.expression);
|
|
superCall = true;
|
|
}
|
|
else {
|
|
emit(node.expression);
|
|
superCall = node.expression.kind === 163 /* PropertyAccessExpression */ && node.expression.expression.kind === 92 /* SuperKeyword */;
|
|
}
|
|
if (superCall && languageVersion < 2 /* ES6 */) {
|
|
write(".call(");
|
|
emitThis(node.expression);
|
|
if (node.arguments.length) {
|
|
write(", ");
|
|
emitCommaList(node.arguments);
|
|
}
|
|
write(")");
|
|
}
|
|
else {
|
|
write("(");
|
|
emitCommaList(node.arguments);
|
|
write(")");
|
|
}
|
|
}
|
|
function emitNewExpression(node) {
|
|
write("new ");
|
|
// Spread operator logic is supported in new expressions in ES5 using a combination
|
|
// of Function.prototype.bind() and Function.prototype.apply().
|
|
//
|
|
// Example:
|
|
//
|
|
// var args = [1, 2, 3, 4, 5];
|
|
// new Array(...args);
|
|
//
|
|
// is compiled into the following ES5:
|
|
//
|
|
// var args = [1, 2, 3, 4, 5];
|
|
// new (Array.bind.apply(Array, [void 0].concat(args)));
|
|
//
|
|
// The 'thisArg' to 'bind' is ignored when invoking the result of 'bind' with 'new',
|
|
// Thus, we set it to undefined ('void 0').
|
|
if (languageVersion === 1 /* ES5 */ &&
|
|
node.arguments &&
|
|
hasSpreadElement(node.arguments)) {
|
|
write("(");
|
|
var target = emitCallTarget(node.expression);
|
|
write(".bind.apply(");
|
|
emit(target);
|
|
write(", [void 0].concat(");
|
|
emitListWithSpread(node.arguments, false, false, false, false);
|
|
write(")))");
|
|
write("()");
|
|
}
|
|
else {
|
|
emit(node.expression);
|
|
if (node.arguments) {
|
|
write("(");
|
|
emitCommaList(node.arguments);
|
|
write(")");
|
|
}
|
|
}
|
|
}
|
|
function emitTaggedTemplateExpression(node) {
|
|
if (languageVersion >= 2 /* ES6 */) {
|
|
emit(node.tag);
|
|
write(" ");
|
|
emit(node.template);
|
|
}
|
|
else {
|
|
emitDownlevelTaggedTemplate(node);
|
|
}
|
|
}
|
|
function emitParenExpression(node) {
|
|
// If the node is synthesized, it means the emitter put the parentheses there,
|
|
// not the user. If we didn't want them, the emitter would not have put them
|
|
// there.
|
|
if (!ts.nodeIsSynthesized(node) && node.parent.kind !== 171 /* ArrowFunction */) {
|
|
if (node.expression.kind === 168 /* TypeAssertionExpression */ || node.expression.kind === 186 /* AsExpression */) {
|
|
var operand = node.expression.expression;
|
|
// Make sure we consider all nested cast expressions, e.g.:
|
|
// (<any><number><any>-A).x;
|
|
while (operand.kind === 168 /* TypeAssertionExpression */ || operand.kind === 186 /* AsExpression */) {
|
|
operand = operand.expression;
|
|
}
|
|
// We have an expression of the form: (<Type>SubExpr)
|
|
// Emitting this as (SubExpr) is really not desirable. We would like to emit the subexpr 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, e.g.:
|
|
// (<any>new A).foo should be emitted as (new A).foo and not new A.foo
|
|
// (<any>typeof A).toString() should be emitted as (typeof A).toString() and not typeof A.toString()
|
|
// new (<any>A()) should be emitted as new (A()) and not new A()
|
|
// (<any>function foo() { })() should be emitted as an IIF (function foo(){})() and not declaration function foo(){} ()
|
|
if (operand.kind !== 176 /* PrefixUnaryExpression */ &&
|
|
operand.kind !== 174 /* VoidExpression */ &&
|
|
operand.kind !== 173 /* TypeOfExpression */ &&
|
|
operand.kind !== 172 /* DeleteExpression */ &&
|
|
operand.kind !== 177 /* PostfixUnaryExpression */ &&
|
|
operand.kind !== 166 /* NewExpression */ &&
|
|
!(operand.kind === 165 /* CallExpression */ && node.parent.kind === 166 /* NewExpression */) &&
|
|
!(operand.kind === 170 /* FunctionExpression */ && node.parent.kind === 165 /* CallExpression */)) {
|
|
emit(operand);
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
write("(");
|
|
emit(node.expression);
|
|
write(")");
|
|
}
|
|
function emitDeleteExpression(node) {
|
|
write(ts.tokenToString(75 /* DeleteKeyword */));
|
|
write(" ");
|
|
emit(node.expression);
|
|
}
|
|
function emitVoidExpression(node) {
|
|
write(ts.tokenToString(100 /* VoidKeyword */));
|
|
write(" ");
|
|
emit(node.expression);
|
|
}
|
|
function emitTypeOfExpression(node) {
|
|
write(ts.tokenToString(98 /* TypeOfKeyword */));
|
|
write(" ");
|
|
emit(node.expression);
|
|
}
|
|
function isNameOfExportedSourceLevelDeclarationInSystemExternalModule(node) {
|
|
if (!isCurrentFileSystemExternalModule() || node.kind !== 66 /* Identifier */ || ts.nodeIsSynthesized(node)) {
|
|
return false;
|
|
}
|
|
var isVariableDeclarationOrBindingElement = node.parent && (node.parent.kind === 208 /* VariableDeclaration */ || node.parent.kind === 160 /* BindingElement */);
|
|
var targetDeclaration = isVariableDeclarationOrBindingElement
|
|
? node.parent
|
|
: resolver.getReferencedValueDeclaration(node);
|
|
return isSourceFileLevelDeclarationInSystemJsModule(targetDeclaration, true);
|
|
}
|
|
function emitPrefixUnaryExpression(node) {
|
|
var exportChanged = isNameOfExportedSourceLevelDeclarationInSystemExternalModule(node.operand);
|
|
if (exportChanged) {
|
|
// emit
|
|
// ++x
|
|
// as
|
|
// exports('x', ++x)
|
|
write(exportFunctionForFile + "(\"");
|
|
emitNodeWithoutSourceMap(node.operand);
|
|
write("\", ");
|
|
}
|
|
write(ts.tokenToString(node.operator));
|
|
// 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.
|
|
if (node.operand.kind === 176 /* PrefixUnaryExpression */) {
|
|
var operand = node.operand;
|
|
if (node.operator === 34 /* PlusToken */ && (operand.operator === 34 /* PlusToken */ || operand.operator === 39 /* PlusPlusToken */)) {
|
|
write(" ");
|
|
}
|
|
else if (node.operator === 35 /* MinusToken */ && (operand.operator === 35 /* MinusToken */ || operand.operator === 40 /* MinusMinusToken */)) {
|
|
write(" ");
|
|
}
|
|
}
|
|
emit(node.operand);
|
|
if (exportChanged) {
|
|
write(")");
|
|
}
|
|
}
|
|
function emitPostfixUnaryExpression(node) {
|
|
var exportChanged = isNameOfExportedSourceLevelDeclarationInSystemExternalModule(node.operand);
|
|
if (exportChanged) {
|
|
// export function returns the value that was passes as the second argument
|
|
// however for postfix unary expressions result value should be the value before modification.
|
|
// emit 'x++' as '(export('x', ++x) - 1)' and 'x--' as '(export('x', --x) + 1)'
|
|
write("(" + exportFunctionForFile + "(\"");
|
|
emitNodeWithoutSourceMap(node.operand);
|
|
write("\", ");
|
|
write(ts.tokenToString(node.operator));
|
|
emit(node.operand);
|
|
if (node.operator === 39 /* PlusPlusToken */) {
|
|
write(") - 1)");
|
|
}
|
|
else {
|
|
write(") + 1)");
|
|
}
|
|
}
|
|
else {
|
|
emit(node.operand);
|
|
write(ts.tokenToString(node.operator));
|
|
}
|
|
}
|
|
function shouldHoistDeclarationInSystemJsModule(node) {
|
|
return isSourceFileLevelDeclarationInSystemJsModule(node, false);
|
|
}
|
|
/*
|
|
* Checks if given node is a source file level declaration (not nested in module/function).
|
|
* If 'isExported' is true - then declaration must also be exported.
|
|
* This function is used in two cases:
|
|
* - check if node is a exported source file level value to determine
|
|
* if we should also export the value after its it changed
|
|
* - check if node is a source level declaration to emit it differently,
|
|
* i.e non-exported variable statement 'var x = 1' is hoisted so
|
|
* we we emit variable statement 'var' should be dropped.
|
|
*/
|
|
function isSourceFileLevelDeclarationInSystemJsModule(node, isExported) {
|
|
if (!node || languageVersion >= 2 /* ES6 */ || !isCurrentFileSystemExternalModule()) {
|
|
return false;
|
|
}
|
|
var current = node;
|
|
while (current) {
|
|
if (current.kind === 245 /* SourceFile */) {
|
|
return !isExported || ((ts.getCombinedNodeFlags(node) & 1 /* Export */) !== 0);
|
|
}
|
|
else if (ts.isFunctionLike(current) || current.kind === 216 /* ModuleBlock */) {
|
|
return false;
|
|
}
|
|
else {
|
|
current = current.parent;
|
|
}
|
|
}
|
|
}
|
|
function emitBinaryExpression(node) {
|
|
if (languageVersion < 2 /* ES6 */ && node.operatorToken.kind === 54 /* EqualsToken */ &&
|
|
(node.left.kind === 162 /* ObjectLiteralExpression */ || node.left.kind === 161 /* ArrayLiteralExpression */)) {
|
|
emitDestructuring(node, node.parent.kind === 192 /* ExpressionStatement */);
|
|
}
|
|
else {
|
|
var exportChanged = node.operatorToken.kind >= 54 /* FirstAssignment */ &&
|
|
node.operatorToken.kind <= 65 /* LastAssignment */ &&
|
|
isNameOfExportedSourceLevelDeclarationInSystemExternalModule(node.left);
|
|
if (exportChanged) {
|
|
// emit assignment 'x <op> y' as 'exports("x", x <op> y)'
|
|
write(exportFunctionForFile + "(\"");
|
|
emitNodeWithoutSourceMap(node.left);
|
|
write("\", ");
|
|
}
|
|
emit(node.left);
|
|
var indentedBeforeOperator = indentIfOnDifferentLines(node, node.left, node.operatorToken, node.operatorToken.kind !== 23 /* CommaToken */ ? " " : undefined);
|
|
write(ts.tokenToString(node.operatorToken.kind));
|
|
var indentedAfterOperator = indentIfOnDifferentLines(node, node.operatorToken, node.right, " ");
|
|
emit(node.right);
|
|
decreaseIndentIf(indentedBeforeOperator, indentedAfterOperator);
|
|
if (exportChanged) {
|
|
write(")");
|
|
}
|
|
}
|
|
}
|
|
function synthesizedNodeStartsOnNewLine(node) {
|
|
return ts.nodeIsSynthesized(node) && node.startsOnNewLine;
|
|
}
|
|
function emitConditionalExpression(node) {
|
|
emit(node.condition);
|
|
var indentedBeforeQuestion = indentIfOnDifferentLines(node, node.condition, node.questionToken, " ");
|
|
write("?");
|
|
var indentedAfterQuestion = indentIfOnDifferentLines(node, node.questionToken, node.whenTrue, " ");
|
|
emit(node.whenTrue);
|
|
decreaseIndentIf(indentedBeforeQuestion, indentedAfterQuestion);
|
|
var indentedBeforeColon = indentIfOnDifferentLines(node, node.whenTrue, node.colonToken, " ");
|
|
write(":");
|
|
var indentedAfterColon = indentIfOnDifferentLines(node, node.colonToken, node.whenFalse, " ");
|
|
emit(node.whenFalse);
|
|
decreaseIndentIf(indentedBeforeColon, indentedAfterColon);
|
|
}
|
|
// 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 isSingleLineEmptyBlock(node) {
|
|
if (node && node.kind === 189 /* Block */) {
|
|
var block = node;
|
|
return block.statements.length === 0 && nodeEndIsOnSameLineAsNodeStart(block, block);
|
|
}
|
|
}
|
|
function emitBlock(node) {
|
|
if (isSingleLineEmptyBlock(node)) {
|
|
emitToken(14 /* OpenBraceToken */, node.pos);
|
|
write(" ");
|
|
emitToken(15 /* CloseBraceToken */, node.statements.end);
|
|
return;
|
|
}
|
|
emitToken(14 /* OpenBraceToken */, node.pos);
|
|
increaseIndent();
|
|
scopeEmitStart(node.parent);
|
|
if (node.kind === 216 /* ModuleBlock */) {
|
|
ts.Debug.assert(node.parent.kind === 215 /* ModuleDeclaration */);
|
|
emitCaptureThisForNodeIfNecessary(node.parent);
|
|
}
|
|
emitLines(node.statements);
|
|
if (node.kind === 216 /* ModuleBlock */) {
|
|
emitTempDeclarations(true);
|
|
}
|
|
decreaseIndent();
|
|
writeLine();
|
|
emitToken(15 /* CloseBraceToken */, node.statements.end);
|
|
scopeEmitEnd();
|
|
}
|
|
function emitEmbeddedStatement(node) {
|
|
if (node.kind === 189 /* Block */) {
|
|
write(" ");
|
|
emit(node);
|
|
}
|
|
else {
|
|
increaseIndent();
|
|
writeLine();
|
|
emit(node);
|
|
decreaseIndent();
|
|
}
|
|
}
|
|
function emitExpressionStatement(node) {
|
|
emitParenthesizedIf(node.expression, node.expression.kind === 171 /* ArrowFunction */);
|
|
write(";");
|
|
}
|
|
function emitIfStatement(node) {
|
|
var endPos = emitToken(85 /* IfKeyword */, node.pos);
|
|
write(" ");
|
|
endPos = emitToken(16 /* OpenParenToken */, endPos);
|
|
emit(node.expression);
|
|
emitToken(17 /* CloseParenToken */, node.expression.end);
|
|
emitEmbeddedStatement(node.thenStatement);
|
|
if (node.elseStatement) {
|
|
writeLine();
|
|
emitToken(77 /* ElseKeyword */, node.thenStatement.end);
|
|
if (node.elseStatement.kind === 193 /* IfStatement */) {
|
|
write(" ");
|
|
emit(node.elseStatement);
|
|
}
|
|
else {
|
|
emitEmbeddedStatement(node.elseStatement);
|
|
}
|
|
}
|
|
}
|
|
function emitDoStatement(node) {
|
|
write("do");
|
|
emitEmbeddedStatement(node.statement);
|
|
if (node.statement.kind === 189 /* Block */) {
|
|
write(" ");
|
|
}
|
|
else {
|
|
writeLine();
|
|
}
|
|
write("while (");
|
|
emit(node.expression);
|
|
write(");");
|
|
}
|
|
function emitWhileStatement(node) {
|
|
write("while (");
|
|
emit(node.expression);
|
|
write(")");
|
|
emitEmbeddedStatement(node.statement);
|
|
}
|
|
/**
|
|
* Returns true if start of variable declaration list was emitted.
|
|
* Returns false if nothing was written - this can happen for source file level variable declarations
|
|
* in system modules where such variable declarations are hoisted.
|
|
*/
|
|
function tryEmitStartOfVariableDeclarationList(decl, startPos) {
|
|
if (shouldHoistVariable(decl, true)) {
|
|
// variables in variable declaration list were already hoisted
|
|
return false;
|
|
}
|
|
var tokenKind = 99 /* VarKeyword */;
|
|
if (decl && languageVersion >= 2 /* ES6 */) {
|
|
if (ts.isLet(decl)) {
|
|
tokenKind = 105 /* LetKeyword */;
|
|
}
|
|
else if (ts.isConst(decl)) {
|
|
tokenKind = 71 /* ConstKeyword */;
|
|
}
|
|
}
|
|
if (startPos !== undefined) {
|
|
emitToken(tokenKind, startPos);
|
|
write(" ");
|
|
}
|
|
else {
|
|
switch (tokenKind) {
|
|
case 99 /* VarKeyword */:
|
|
write("var ");
|
|
break;
|
|
case 105 /* LetKeyword */:
|
|
write("let ");
|
|
break;
|
|
case 71 /* ConstKeyword */:
|
|
write("const ");
|
|
break;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
function emitVariableDeclarationListSkippingUninitializedEntries(list) {
|
|
var started = false;
|
|
for (var _a = 0, _b = list.declarations; _a < _b.length; _a++) {
|
|
var decl = _b[_a];
|
|
if (!decl.initializer) {
|
|
continue;
|
|
}
|
|
if (!started) {
|
|
started = true;
|
|
}
|
|
else {
|
|
write(", ");
|
|
}
|
|
emit(decl);
|
|
}
|
|
return started;
|
|
}
|
|
function emitForStatement(node) {
|
|
var endPos = emitToken(83 /* ForKeyword */, node.pos);
|
|
write(" ");
|
|
endPos = emitToken(16 /* OpenParenToken */, endPos);
|
|
if (node.initializer && node.initializer.kind === 209 /* VariableDeclarationList */) {
|
|
var variableDeclarationList = node.initializer;
|
|
var startIsEmitted = tryEmitStartOfVariableDeclarationList(variableDeclarationList, endPos);
|
|
if (startIsEmitted) {
|
|
emitCommaList(variableDeclarationList.declarations);
|
|
}
|
|
else {
|
|
emitVariableDeclarationListSkippingUninitializedEntries(variableDeclarationList);
|
|
}
|
|
}
|
|
else if (node.initializer) {
|
|
emit(node.initializer);
|
|
}
|
|
write(";");
|
|
emitOptional(" ", node.condition);
|
|
write(";");
|
|
emitOptional(" ", node.incrementor);
|
|
write(")");
|
|
emitEmbeddedStatement(node.statement);
|
|
}
|
|
function emitForInOrForOfStatement(node) {
|
|
if (languageVersion < 2 /* ES6 */ && node.kind === 198 /* ForOfStatement */) {
|
|
return emitDownLevelForOfStatement(node);
|
|
}
|
|
var endPos = emitToken(83 /* ForKeyword */, node.pos);
|
|
write(" ");
|
|
endPos = emitToken(16 /* OpenParenToken */, endPos);
|
|
if (node.initializer.kind === 209 /* VariableDeclarationList */) {
|
|
var variableDeclarationList = node.initializer;
|
|
if (variableDeclarationList.declarations.length >= 1) {
|
|
tryEmitStartOfVariableDeclarationList(variableDeclarationList, endPos);
|
|
emit(variableDeclarationList.declarations[0]);
|
|
}
|
|
}
|
|
else {
|
|
emit(node.initializer);
|
|
}
|
|
if (node.kind === 197 /* ForInStatement */) {
|
|
write(" in ");
|
|
}
|
|
else {
|
|
write(" of ");
|
|
}
|
|
emit(node.expression);
|
|
emitToken(17 /* CloseParenToken */, node.expression.end);
|
|
emitEmbeddedStatement(node.statement);
|
|
}
|
|
function emitDownLevelForOfStatement(node) {
|
|
// The following ES6 code:
|
|
//
|
|
// for (let v of expr) { }
|
|
//
|
|
// should be emitted as
|
|
//
|
|
// for (let _i = 0, _a = expr; _i < _a.length; _i++) {
|
|
// let 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 endPos = emitToken(83 /* ForKeyword */, node.pos);
|
|
write(" ");
|
|
endPos = emitToken(16 /* OpenParenToken */, endPos);
|
|
// Do not emit the LHS let declaration yet, because it might contain destructuring.
|
|
// Do not call recordTempDeclaration because we are declaring the temps
|
|
// right here. Recording means they will be declared later.
|
|
// 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 rhsIsIdentifier = node.expression.kind === 66 /* Identifier */;
|
|
var counter = createTempVariable(268435456 /* _i */);
|
|
var rhsReference = rhsIsIdentifier ? node.expression : createTempVariable(0 /* Auto */);
|
|
// This is the let keyword for the counter and rhsReference. The let keyword for
|
|
// the LHS will be emitted inside the body.
|
|
emitStart(node.expression);
|
|
write("var ");
|
|
// _i = 0
|
|
emitNodeWithoutSourceMap(counter);
|
|
write(" = 0");
|
|
emitEnd(node.expression);
|
|
if (!rhsIsIdentifier) {
|
|
// , _a = expr
|
|
write(", ");
|
|
emitStart(node.expression);
|
|
emitNodeWithoutSourceMap(rhsReference);
|
|
write(" = ");
|
|
emitNodeWithoutSourceMap(node.expression);
|
|
emitEnd(node.expression);
|
|
}
|
|
write("; ");
|
|
// _i < _a.length;
|
|
emitStart(node.initializer);
|
|
emitNodeWithoutSourceMap(counter);
|
|
write(" < ");
|
|
emitNodeWithoutSourceMap(rhsReference);
|
|
write(".length");
|
|
emitEnd(node.initializer);
|
|
write("; ");
|
|
// _i++)
|
|
emitStart(node.initializer);
|
|
emitNodeWithoutSourceMap(counter);
|
|
write("++");
|
|
emitEnd(node.initializer);
|
|
emitToken(17 /* CloseParenToken */, node.expression.end);
|
|
// Body
|
|
write(" {");
|
|
writeLine();
|
|
increaseIndent();
|
|
// Initialize LHS
|
|
// let v = _a[_i];
|
|
var rhsIterationValue = createElementAccessExpression(rhsReference, counter);
|
|
emitStart(node.initializer);
|
|
if (node.initializer.kind === 209 /* VariableDeclarationList */) {
|
|
write("var ");
|
|
var variableDeclarationList = node.initializer;
|
|
if (variableDeclarationList.declarations.length > 0) {
|
|
var declaration = variableDeclarationList.declarations[0];
|
|
if (ts.isBindingPattern(declaration.name)) {
|
|
// This works whether the declaration is a var, let, or const.
|
|
// It will use rhsIterationValue _a[_i] as the initializer.
|
|
emitDestructuring(declaration, false, rhsIterationValue);
|
|
}
|
|
else {
|
|
// The following call does not include the initializer, so we have
|
|
// to emit it separately.
|
|
emitNodeWithoutSourceMap(declaration);
|
|
write(" = ");
|
|
emitNodeWithoutSourceMap(rhsIterationValue);
|
|
}
|
|
}
|
|
else {
|
|
// It's an empty declaration list. This can only happen in an error case, if the user wrote
|
|
// for (let of []) {}
|
|
emitNodeWithoutSourceMap(createTempVariable(0 /* Auto */));
|
|
write(" = ");
|
|
emitNodeWithoutSourceMap(rhsIterationValue);
|
|
}
|
|
}
|
|
else {
|
|
// Initializer is an expression. Emit the expression in the body, so that it's
|
|
// evaluated on every iteration.
|
|
var assignmentExpression = createBinaryExpression(node.initializer, 54 /* EqualsToken */, rhsIterationValue, false);
|
|
if (node.initializer.kind === 161 /* ArrayLiteralExpression */ || node.initializer.kind === 162 /* ObjectLiteralExpression */) {
|
|
// This is a destructuring pattern, so call emitDestructuring instead of emit. Calling emit will not work, because it will cause
|
|
// the BinaryExpression to be passed in instead of the expression statement, which will cause emitDestructuring to crash.
|
|
emitDestructuring(assignmentExpression, true, undefined);
|
|
}
|
|
else {
|
|
emitNodeWithoutSourceMap(assignmentExpression);
|
|
}
|
|
}
|
|
emitEnd(node.initializer);
|
|
write(";");
|
|
if (node.statement.kind === 189 /* Block */) {
|
|
emitLines(node.statement.statements);
|
|
}
|
|
else {
|
|
writeLine();
|
|
emit(node.statement);
|
|
}
|
|
writeLine();
|
|
decreaseIndent();
|
|
write("}");
|
|
}
|
|
function emitBreakOrContinueStatement(node) {
|
|
emitToken(node.kind === 200 /* BreakStatement */ ? 67 /* BreakKeyword */ : 72 /* ContinueKeyword */, node.pos);
|
|
emitOptional(" ", node.label);
|
|
write(";");
|
|
}
|
|
function emitReturnStatement(node) {
|
|
emitToken(91 /* ReturnKeyword */, node.pos);
|
|
emitOptional(" ", node.expression);
|
|
write(";");
|
|
}
|
|
function emitWithStatement(node) {
|
|
write("with (");
|
|
emit(node.expression);
|
|
write(")");
|
|
emitEmbeddedStatement(node.statement);
|
|
}
|
|
function emitSwitchStatement(node) {
|
|
var endPos = emitToken(93 /* SwitchKeyword */, node.pos);
|
|
write(" ");
|
|
emitToken(16 /* OpenParenToken */, endPos);
|
|
emit(node.expression);
|
|
endPos = emitToken(17 /* CloseParenToken */, node.expression.end);
|
|
write(" ");
|
|
emitCaseBlock(node.caseBlock, endPos);
|
|
}
|
|
function emitCaseBlock(node, startPos) {
|
|
emitToken(14 /* OpenBraceToken */, startPos);
|
|
increaseIndent();
|
|
emitLines(node.clauses);
|
|
decreaseIndent();
|
|
writeLine();
|
|
emitToken(15 /* CloseBraceToken */, node.clauses.end);
|
|
}
|
|
function nodeStartPositionsAreOnSameLine(node1, node2) {
|
|
return ts.getLineOfLocalPosition(currentSourceFile, ts.skipTrivia(currentSourceFile.text, node1.pos)) ===
|
|
ts.getLineOfLocalPosition(currentSourceFile, ts.skipTrivia(currentSourceFile.text, node2.pos));
|
|
}
|
|
function nodeEndPositionsAreOnSameLine(node1, node2) {
|
|
return ts.getLineOfLocalPosition(currentSourceFile, node1.end) ===
|
|
ts.getLineOfLocalPosition(currentSourceFile, node2.end);
|
|
}
|
|
function nodeEndIsOnSameLineAsNodeStart(node1, node2) {
|
|
return ts.getLineOfLocalPosition(currentSourceFile, node1.end) ===
|
|
ts.getLineOfLocalPosition(currentSourceFile, ts.skipTrivia(currentSourceFile.text, node2.pos));
|
|
}
|
|
function emitCaseOrDefaultClause(node) {
|
|
if (node.kind === 238 /* CaseClause */) {
|
|
write("case ");
|
|
emit(node.expression);
|
|
write(":");
|
|
}
|
|
else {
|
|
write("default:");
|
|
}
|
|
if (node.statements.length === 1 && nodeStartPositionsAreOnSameLine(node, node.statements[0])) {
|
|
write(" ");
|
|
emit(node.statements[0]);
|
|
}
|
|
else {
|
|
increaseIndent();
|
|
emitLines(node.statements);
|
|
decreaseIndent();
|
|
}
|
|
}
|
|
function emitThrowStatement(node) {
|
|
write("throw ");
|
|
emit(node.expression);
|
|
write(";");
|
|
}
|
|
function emitTryStatement(node) {
|
|
write("try ");
|
|
emit(node.tryBlock);
|
|
emit(node.catchClause);
|
|
if (node.finallyBlock) {
|
|
writeLine();
|
|
write("finally ");
|
|
emit(node.finallyBlock);
|
|
}
|
|
}
|
|
function emitCatchClause(node) {
|
|
writeLine();
|
|
var endPos = emitToken(69 /* CatchKeyword */, node.pos);
|
|
write(" ");
|
|
emitToken(16 /* OpenParenToken */, endPos);
|
|
emit(node.variableDeclaration);
|
|
emitToken(17 /* CloseParenToken */, node.variableDeclaration ? node.variableDeclaration.end : endPos);
|
|
write(" ");
|
|
emitBlock(node.block);
|
|
}
|
|
function emitDebuggerStatement(node) {
|
|
emitToken(73 /* DebuggerKeyword */, node.pos);
|
|
write(";");
|
|
}
|
|
function emitLabelledStatement(node) {
|
|
emit(node.label);
|
|
write(": ");
|
|
emit(node.statement);
|
|
}
|
|
function getContainingModule(node) {
|
|
do {
|
|
node = node.parent;
|
|
} while (node && node.kind !== 215 /* ModuleDeclaration */);
|
|
return node;
|
|
}
|
|
function emitContainingModuleName(node) {
|
|
var container = getContainingModule(node);
|
|
write(container ? getGeneratedNameForNode(container) : "exports");
|
|
}
|
|
function emitModuleMemberName(node) {
|
|
emitStart(node.name);
|
|
if (ts.getCombinedNodeFlags(node) & 1 /* Export */) {
|
|
var container = getContainingModule(node);
|
|
if (container) {
|
|
write(getGeneratedNameForNode(container));
|
|
write(".");
|
|
}
|
|
else if (languageVersion < 2 /* ES6 */ && compilerOptions.module !== 4 /* System */) {
|
|
write("exports.");
|
|
}
|
|
}
|
|
emitNodeWithoutSourceMap(node.name);
|
|
emitEnd(node.name);
|
|
}
|
|
function createVoidZero() {
|
|
var zero = ts.createSynthesizedNode(7 /* NumericLiteral */);
|
|
zero.text = "0";
|
|
var result = ts.createSynthesizedNode(174 /* VoidExpression */);
|
|
result.expression = zero;
|
|
return result;
|
|
}
|
|
function emitExportMemberAssignment(node) {
|
|
if (node.flags & 1 /* Export */) {
|
|
writeLine();
|
|
emitStart(node);
|
|
// emit call to exporter only for top level nodes
|
|
if (compilerOptions.module === 4 /* System */ && node.parent === currentSourceFile) {
|
|
// emit export default <smth> as
|
|
// export("default", <smth>)
|
|
write(exportFunctionForFile + "(\"");
|
|
if (node.flags & 1024 /* Default */) {
|
|
write("default");
|
|
}
|
|
else {
|
|
emitNodeWithoutSourceMap(node.name);
|
|
}
|
|
write("\", ");
|
|
emitDeclarationName(node);
|
|
write(")");
|
|
}
|
|
else {
|
|
if (node.flags & 1024 /* Default */) {
|
|
if (languageVersion === 0 /* ES3 */) {
|
|
write("exports[\"default\"]");
|
|
}
|
|
else {
|
|
write("exports.default");
|
|
}
|
|
}
|
|
else {
|
|
emitModuleMemberName(node);
|
|
}
|
|
write(" = ");
|
|
emitDeclarationName(node);
|
|
}
|
|
emitEnd(node);
|
|
write(";");
|
|
}
|
|
}
|
|
function emitExportMemberAssignments(name) {
|
|
if (!exportEquals && exportSpecifiers && ts.hasProperty(exportSpecifiers, name.text)) {
|
|
for (var _a = 0, _b = exportSpecifiers[name.text]; _a < _b.length; _a++) {
|
|
var specifier = _b[_a];
|
|
writeLine();
|
|
if (compilerOptions.module === 4 /* System */) {
|
|
emitStart(specifier.name);
|
|
write(exportFunctionForFile + "(\"");
|
|
emitNodeWithoutSourceMap(specifier.name);
|
|
write("\", ");
|
|
emitExpressionIdentifier(name);
|
|
write(")");
|
|
emitEnd(specifier.name);
|
|
}
|
|
else {
|
|
emitStart(specifier.name);
|
|
emitContainingModuleName(specifier);
|
|
write(".");
|
|
emitNodeWithoutSourceMap(specifier.name);
|
|
emitEnd(specifier.name);
|
|
write(" = ");
|
|
emitExpressionIdentifier(name);
|
|
}
|
|
write(";");
|
|
}
|
|
}
|
|
}
|
|
function emitDestructuring(root, isAssignmentExpressionStatement, value) {
|
|
var emitCount = 0;
|
|
// An exported declaration is actually emitted as an assignment (to a property on the module object), so
|
|
// temporary variables in an exported declaration need to have real declarations elsewhere
|
|
// Also temporary variables should be explicitly allocated for source level declarations when module target is system
|
|
// because actual variable declarations are hoisted
|
|
var canDefineTempVariablesInPlace = false;
|
|
if (root.kind === 208 /* VariableDeclaration */) {
|
|
var isExported = ts.getCombinedNodeFlags(root) & 1 /* Export */;
|
|
var isSourceLevelForSystemModuleKind = shouldHoistDeclarationInSystemJsModule(root);
|
|
canDefineTempVariablesInPlace = !isExported && !isSourceLevelForSystemModuleKind;
|
|
}
|
|
else if (root.kind === 135 /* Parameter */) {
|
|
canDefineTempVariablesInPlace = true;
|
|
}
|
|
if (root.kind === 178 /* BinaryExpression */) {
|
|
emitAssignmentExpression(root);
|
|
}
|
|
else {
|
|
ts.Debug.assert(!isAssignmentExpressionStatement);
|
|
emitBindingElement(root, value);
|
|
}
|
|
function emitAssignment(name, value) {
|
|
if (emitCount++) {
|
|
write(", ");
|
|
}
|
|
var isVariableDeclarationOrBindingElement = name.parent && (name.parent.kind === 208 /* VariableDeclaration */ || name.parent.kind === 160 /* BindingElement */);
|
|
var exportChanged = isNameOfExportedSourceLevelDeclarationInSystemExternalModule(name);
|
|
if (exportChanged) {
|
|
write(exportFunctionForFile + "(\"");
|
|
emitNodeWithoutSourceMap(name);
|
|
write("\", ");
|
|
}
|
|
if (isVariableDeclarationOrBindingElement) {
|
|
emitModuleMemberName(name.parent);
|
|
}
|
|
else {
|
|
emit(name);
|
|
}
|
|
write(" = ");
|
|
emit(value);
|
|
if (exportChanged) {
|
|
write(")");
|
|
}
|
|
}
|
|
function ensureIdentifier(expr) {
|
|
if (expr.kind !== 66 /* Identifier */) {
|
|
var identifier = createTempVariable(0 /* Auto */);
|
|
if (!canDefineTempVariablesInPlace) {
|
|
recordTempDeclaration(identifier);
|
|
}
|
|
emitAssignment(identifier, expr);
|
|
expr = identifier;
|
|
}
|
|
return expr;
|
|
}
|
|
function createDefaultValueCheck(value, defaultValue) {
|
|
// The value expression will be evaluated twice, so for anything but a simple identifier
|
|
// we need to generate a temporary variable
|
|
value = ensureIdentifier(value);
|
|
// Return the expression 'value === void 0 ? defaultValue : value'
|
|
var equals = ts.createSynthesizedNode(178 /* BinaryExpression */);
|
|
equals.left = value;
|
|
equals.operatorToken = ts.createSynthesizedNode(31 /* EqualsEqualsEqualsToken */);
|
|
equals.right = createVoidZero();
|
|
return createConditionalExpression(equals, defaultValue, value);
|
|
}
|
|
function createConditionalExpression(condition, whenTrue, whenFalse) {
|
|
var cond = ts.createSynthesizedNode(179 /* ConditionalExpression */);
|
|
cond.condition = condition;
|
|
cond.questionToken = ts.createSynthesizedNode(51 /* QuestionToken */);
|
|
cond.whenTrue = whenTrue;
|
|
cond.colonToken = ts.createSynthesizedNode(52 /* ColonToken */);
|
|
cond.whenFalse = whenFalse;
|
|
return cond;
|
|
}
|
|
function createNumericLiteral(value) {
|
|
var node = ts.createSynthesizedNode(7 /* NumericLiteral */);
|
|
node.text = "" + value;
|
|
return node;
|
|
}
|
|
function createPropertyAccessForDestructuringProperty(object, propName) {
|
|
// We create a synthetic copy of the identifier in order to avoid the rewriting that might
|
|
// otherwise occur when the identifier is emitted.
|
|
var syntheticName = ts.createSynthesizedNode(propName.kind);
|
|
syntheticName.text = propName.text;
|
|
if (syntheticName.kind !== 66 /* Identifier */) {
|
|
return createElementAccessExpression(object, syntheticName);
|
|
}
|
|
return createPropertyAccessExpression(object, syntheticName);
|
|
}
|
|
function createSliceCall(value, sliceIndex) {
|
|
var call = ts.createSynthesizedNode(165 /* CallExpression */);
|
|
var sliceIdentifier = ts.createSynthesizedNode(66 /* Identifier */);
|
|
sliceIdentifier.text = "slice";
|
|
call.expression = createPropertyAccessExpression(value, sliceIdentifier);
|
|
call.arguments = ts.createSynthesizedNodeArray();
|
|
call.arguments[0] = createNumericLiteral(sliceIndex);
|
|
return call;
|
|
}
|
|
function emitObjectLiteralAssignment(target, value) {
|
|
var properties = target.properties;
|
|
if (properties.length !== 1) {
|
|
// For anything but a single element destructuring we need to generate a temporary
|
|
// to ensure value is evaluated exactly once.
|
|
value = ensureIdentifier(value);
|
|
}
|
|
for (var _a = 0; _a < properties.length; _a++) {
|
|
var p = properties[_a];
|
|
if (p.kind === 242 /* PropertyAssignment */ || p.kind === 243 /* ShorthandPropertyAssignment */) {
|
|
var propName = p.name;
|
|
emitDestructuringAssignment(p.initializer || propName, createPropertyAccessForDestructuringProperty(value, propName));
|
|
}
|
|
}
|
|
}
|
|
function emitArrayLiteralAssignment(target, value) {
|
|
var elements = target.elements;
|
|
if (elements.length !== 1) {
|
|
// For anything but a single element destructuring we need to generate a temporary
|
|
// to ensure value is evaluated exactly once.
|
|
value = ensureIdentifier(value);
|
|
}
|
|
for (var i = 0; i < elements.length; i++) {
|
|
var e = elements[i];
|
|
if (e.kind !== 184 /* OmittedExpression */) {
|
|
if (e.kind !== 182 /* SpreadElementExpression */) {
|
|
emitDestructuringAssignment(e, createElementAccessExpression(value, createNumericLiteral(i)));
|
|
}
|
|
else if (i === elements.length - 1) {
|
|
emitDestructuringAssignment(e.expression, createSliceCall(value, i));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function emitDestructuringAssignment(target, value) {
|
|
if (target.kind === 178 /* BinaryExpression */ && target.operatorToken.kind === 54 /* EqualsToken */) {
|
|
value = createDefaultValueCheck(value, target.right);
|
|
target = target.left;
|
|
}
|
|
if (target.kind === 162 /* ObjectLiteralExpression */) {
|
|
emitObjectLiteralAssignment(target, value);
|
|
}
|
|
else if (target.kind === 161 /* ArrayLiteralExpression */) {
|
|
emitArrayLiteralAssignment(target, value);
|
|
}
|
|
else {
|
|
emitAssignment(target, value);
|
|
}
|
|
}
|
|
function emitAssignmentExpression(root) {
|
|
var target = root.left;
|
|
var value = root.right;
|
|
if (isAssignmentExpressionStatement) {
|
|
emitDestructuringAssignment(target, value);
|
|
}
|
|
else {
|
|
if (root.parent.kind !== 169 /* ParenthesizedExpression */) {
|
|
write("(");
|
|
}
|
|
value = ensureIdentifier(value);
|
|
emitDestructuringAssignment(target, value);
|
|
write(", ");
|
|
emit(value);
|
|
if (root.parent.kind !== 169 /* ParenthesizedExpression */) {
|
|
write(")");
|
|
}
|
|
}
|
|
}
|
|
function emitBindingElement(target, value) {
|
|
if (target.initializer) {
|
|
// Combine value and initializer
|
|
value = value ? createDefaultValueCheck(value, target.initializer) : target.initializer;
|
|
}
|
|
else if (!value) {
|
|
// Use 'void 0' in absence of value and initializer
|
|
value = createVoidZero();
|
|
}
|
|
if (ts.isBindingPattern(target.name)) {
|
|
var pattern = target.name;
|
|
var elements = pattern.elements;
|
|
if (elements.length !== 1) {
|
|
// For anything but a single element destructuring we need to generate a temporary
|
|
// to ensure value is evaluated exactly once.
|
|
value = ensureIdentifier(value);
|
|
}
|
|
for (var i = 0; i < elements.length; i++) {
|
|
var element = elements[i];
|
|
if (pattern.kind === 158 /* ObjectBindingPattern */) {
|
|
// Rewrite element to a declaration with an initializer that fetches property
|
|
var propName = element.propertyName || element.name;
|
|
emitBindingElement(element, createPropertyAccessForDestructuringProperty(value, propName));
|
|
}
|
|
else if (element.kind !== 184 /* OmittedExpression */) {
|
|
if (!element.dotDotDotToken) {
|
|
// Rewrite element to a declaration that accesses array element at index i
|
|
emitBindingElement(element, createElementAccessExpression(value, createNumericLiteral(i)));
|
|
}
|
|
else if (i === elements.length - 1) {
|
|
emitBindingElement(element, createSliceCall(value, i));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
emitAssignment(target.name, value);
|
|
}
|
|
}
|
|
}
|
|
function emitVariableDeclaration(node) {
|
|
if (ts.isBindingPattern(node.name)) {
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
emitDestructuring(node, false);
|
|
}
|
|
else {
|
|
emit(node.name);
|
|
emitOptional(" = ", node.initializer);
|
|
}
|
|
}
|
|
else {
|
|
var initializer = node.initializer;
|
|
if (!initializer && languageVersion < 2 /* ES6 */) {
|
|
// downlevel emit for non-initialized let bindings defined in loops
|
|
// for (...) { let x; }
|
|
// should be
|
|
// for (...) { var <some-uniqie-name> = void 0; }
|
|
// this is necessary to preserve ES6 semantic in scenarios like
|
|
// for (...) { let x; console.log(x); x = 1 } // assignment on one iteration should not affect other iterations
|
|
var isUninitializedLet = (resolver.getNodeCheckFlags(node) & 16384 /* BlockScopedBindingInLoop */) &&
|
|
(getCombinedFlagsForIdentifier(node.name) & 16384 /* Let */);
|
|
// NOTE: default initialization should not be added to let bindings in for-in\for-of statements
|
|
if (isUninitializedLet &&
|
|
node.parent.parent.kind !== 197 /* ForInStatement */ &&
|
|
node.parent.parent.kind !== 198 /* ForOfStatement */) {
|
|
initializer = createVoidZero();
|
|
}
|
|
}
|
|
var exportChanged = isNameOfExportedSourceLevelDeclarationInSystemExternalModule(node.name);
|
|
if (exportChanged) {
|
|
write(exportFunctionForFile + "(\"");
|
|
emitNodeWithoutSourceMap(node.name);
|
|
write("\", ");
|
|
}
|
|
emitModuleMemberName(node);
|
|
emitOptional(" = ", initializer);
|
|
if (exportChanged) {
|
|
write(")");
|
|
}
|
|
}
|
|
}
|
|
function emitExportVariableAssignments(node) {
|
|
if (node.kind === 184 /* OmittedExpression */) {
|
|
return;
|
|
}
|
|
var name = node.name;
|
|
if (name.kind === 66 /* Identifier */) {
|
|
emitExportMemberAssignments(name);
|
|
}
|
|
else if (ts.isBindingPattern(name)) {
|
|
ts.forEach(name.elements, emitExportVariableAssignments);
|
|
}
|
|
}
|
|
function getCombinedFlagsForIdentifier(node) {
|
|
if (!node.parent || (node.parent.kind !== 208 /* VariableDeclaration */ && node.parent.kind !== 160 /* BindingElement */)) {
|
|
return 0;
|
|
}
|
|
return ts.getCombinedNodeFlags(node.parent);
|
|
}
|
|
function isES6ExportedDeclaration(node) {
|
|
return !!(node.flags & 1 /* Export */) &&
|
|
languageVersion >= 2 /* ES6 */ &&
|
|
node.parent.kind === 245 /* SourceFile */;
|
|
}
|
|
function emitVariableStatement(node) {
|
|
var startIsEmitted = false;
|
|
if (node.flags & 1 /* Export */) {
|
|
if (isES6ExportedDeclaration(node)) {
|
|
// Exported ES6 module member
|
|
write("export ");
|
|
startIsEmitted = tryEmitStartOfVariableDeclarationList(node.declarationList);
|
|
}
|
|
}
|
|
else {
|
|
startIsEmitted = tryEmitStartOfVariableDeclarationList(node.declarationList);
|
|
}
|
|
if (startIsEmitted) {
|
|
emitCommaList(node.declarationList.declarations);
|
|
write(";");
|
|
}
|
|
else {
|
|
var atLeastOneItem = emitVariableDeclarationListSkippingUninitializedEntries(node.declarationList);
|
|
if (atLeastOneItem) {
|
|
write(";");
|
|
}
|
|
}
|
|
if (languageVersion < 2 /* ES6 */ && node.parent === currentSourceFile) {
|
|
ts.forEach(node.declarationList.declarations, emitExportVariableAssignments);
|
|
}
|
|
}
|
|
function shouldEmitLeadingAndTrailingCommentsForVariableStatement(node) {
|
|
// If we're not exporting the variables, there's nothing special here.
|
|
// Always emit comments for these nodes.
|
|
if (!(node.flags & 1 /* Export */)) {
|
|
return true;
|
|
}
|
|
// If we are exporting, but it's a top-level ES6 module exports,
|
|
// we'll emit the declaration list verbatim, so emit comments too.
|
|
if (isES6ExportedDeclaration(node)) {
|
|
return true;
|
|
}
|
|
// Otherwise, only emit if we have at least one initializer present.
|
|
for (var _a = 0, _b = node.declarationList.declarations; _a < _b.length; _a++) {
|
|
var declaration = _b[_a];
|
|
if (declaration.initializer) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function emitParameter(node) {
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
if (ts.isBindingPattern(node.name)) {
|
|
var name_23 = createTempVariable(0 /* Auto */);
|
|
if (!tempParameters) {
|
|
tempParameters = [];
|
|
}
|
|
tempParameters.push(name_23);
|
|
emit(name_23);
|
|
}
|
|
else {
|
|
emit(node.name);
|
|
}
|
|
}
|
|
else {
|
|
if (node.dotDotDotToken) {
|
|
write("...");
|
|
}
|
|
emit(node.name);
|
|
emitOptional(" = ", node.initializer);
|
|
}
|
|
}
|
|
function emitDefaultValueAssignments(node) {
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
var tempIndex = 0;
|
|
ts.forEach(node.parameters, function (parameter) {
|
|
// A rest parameter cannot have a binding pattern or an initializer,
|
|
// so let's just ignore it.
|
|
if (parameter.dotDotDotToken) {
|
|
return;
|
|
}
|
|
var paramName = parameter.name, initializer = parameter.initializer;
|
|
if (ts.isBindingPattern(paramName)) {
|
|
// 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.
|
|
var hasBindingElements = paramName.elements.length > 0;
|
|
if (hasBindingElements || initializer) {
|
|
writeLine();
|
|
write("var ");
|
|
if (hasBindingElements) {
|
|
emitDestructuring(parameter, false, tempParameters[tempIndex]);
|
|
}
|
|
else {
|
|
emit(tempParameters[tempIndex]);
|
|
write(" = ");
|
|
emit(initializer);
|
|
}
|
|
write(";");
|
|
tempIndex++;
|
|
}
|
|
}
|
|
else if (initializer) {
|
|
writeLine();
|
|
emitStart(parameter);
|
|
write("if (");
|
|
emitNodeWithoutSourceMap(paramName);
|
|
write(" === void 0)");
|
|
emitEnd(parameter);
|
|
write(" { ");
|
|
emitStart(parameter);
|
|
emitNodeWithoutSourceMap(paramName);
|
|
write(" = ");
|
|
emitNodeWithoutSourceMap(initializer);
|
|
emitEnd(parameter);
|
|
write("; }");
|
|
}
|
|
});
|
|
}
|
|
}
|
|
function emitRestParameter(node) {
|
|
if (languageVersion < 2 /* ES6 */ && ts.hasRestParameter(node)) {
|
|
var restIndex = node.parameters.length - 1;
|
|
var restParam = node.parameters[restIndex];
|
|
// A rest parameter cannot have a binding pattern, so let's just ignore it if it does.
|
|
if (ts.isBindingPattern(restParam.name)) {
|
|
return;
|
|
}
|
|
var tempName = createTempVariable(268435456 /* _i */).text;
|
|
writeLine();
|
|
emitLeadingComments(restParam);
|
|
emitStart(restParam);
|
|
write("var ");
|
|
emitNodeWithoutSourceMap(restParam.name);
|
|
write(" = [];");
|
|
emitEnd(restParam);
|
|
emitTrailingComments(restParam);
|
|
writeLine();
|
|
write("for (");
|
|
emitStart(restParam);
|
|
write("var " + tempName + " = " + restIndex + ";");
|
|
emitEnd(restParam);
|
|
write(" ");
|
|
emitStart(restParam);
|
|
write(tempName + " < arguments.length;");
|
|
emitEnd(restParam);
|
|
write(" ");
|
|
emitStart(restParam);
|
|
write(tempName + "++");
|
|
emitEnd(restParam);
|
|
write(") {");
|
|
increaseIndent();
|
|
writeLine();
|
|
emitStart(restParam);
|
|
emitNodeWithoutSourceMap(restParam.name);
|
|
write("[" + tempName + " - " + restIndex + "] = arguments[" + tempName + "];");
|
|
emitEnd(restParam);
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("}");
|
|
}
|
|
}
|
|
function emitAccessor(node) {
|
|
write(node.kind === 142 /* GetAccessor */ ? "get " : "set ");
|
|
emit(node.name);
|
|
emitSignatureAndBody(node);
|
|
}
|
|
function shouldEmitAsArrowFunction(node) {
|
|
return node.kind === 171 /* ArrowFunction */ && languageVersion >= 2 /* ES6 */;
|
|
}
|
|
function emitDeclarationName(node) {
|
|
if (node.name) {
|
|
emitNodeWithoutSourceMap(node.name);
|
|
}
|
|
else {
|
|
write(getGeneratedNameForNode(node));
|
|
}
|
|
}
|
|
function shouldEmitFunctionName(node) {
|
|
if (node.kind === 170 /* FunctionExpression */) {
|
|
// Emit name if one is present
|
|
return !!node.name;
|
|
}
|
|
if (node.kind === 210 /* FunctionDeclaration */) {
|
|
// Emit name if one is present, or emit generated name in down-level case (for export default case)
|
|
return !!node.name || languageVersion < 2 /* ES6 */;
|
|
}
|
|
}
|
|
function emitFunctionDeclaration(node) {
|
|
if (ts.nodeIsMissing(node.body)) {
|
|
return emitOnlyPinnedOrTripleSlashComments(node);
|
|
}
|
|
if (node.kind !== 140 /* MethodDeclaration */ && node.kind !== 139 /* MethodSignature */) {
|
|
// Methods will emit the comments as part of emitting method declaration
|
|
emitLeadingComments(node);
|
|
}
|
|
// For targeting below es6, emit functions-like declaration including arrow function using function keyword.
|
|
// When targeting ES6, emit arrow function natively in ES6 by omitting function keyword and using fat arrow instead
|
|
if (!shouldEmitAsArrowFunction(node)) {
|
|
if (isES6ExportedDeclaration(node)) {
|
|
write("export ");
|
|
if (node.flags & 1024 /* Default */) {
|
|
write("default ");
|
|
}
|
|
}
|
|
write("function");
|
|
if (languageVersion >= 2 /* ES6 */ && node.asteriskToken) {
|
|
write("*");
|
|
}
|
|
write(" ");
|
|
}
|
|
if (shouldEmitFunctionName(node)) {
|
|
emitDeclarationName(node);
|
|
}
|
|
emitSignatureAndBody(node);
|
|
if (languageVersion < 2 /* ES6 */ && node.kind === 210 /* FunctionDeclaration */ && node.parent === currentSourceFile && node.name) {
|
|
emitExportMemberAssignments(node.name);
|
|
}
|
|
if (node.kind !== 140 /* MethodDeclaration */ && node.kind !== 139 /* MethodSignature */) {
|
|
emitTrailingComments(node);
|
|
}
|
|
}
|
|
function emitCaptureThisForNodeIfNecessary(node) {
|
|
if (resolver.getNodeCheckFlags(node) & 4 /* CaptureThis */) {
|
|
writeLine();
|
|
emitStart(node);
|
|
write("var _this = this;");
|
|
emitEnd(node);
|
|
}
|
|
}
|
|
function emitSignatureParameters(node) {
|
|
increaseIndent();
|
|
write("(");
|
|
if (node) {
|
|
var parameters = node.parameters;
|
|
var omitCount = languageVersion < 2 /* ES6 */ && ts.hasRestParameter(node) ? 1 : 0;
|
|
emitList(parameters, 0, parameters.length - omitCount, false, false);
|
|
}
|
|
write(")");
|
|
decreaseIndent();
|
|
}
|
|
function emitSignatureParametersForArrow(node) {
|
|
// Check whether the parameter list needs parentheses and preserve no-parenthesis
|
|
if (node.parameters.length === 1 && node.pos === node.parameters[0].pos) {
|
|
emit(node.parameters[0]);
|
|
return;
|
|
}
|
|
emitSignatureParameters(node);
|
|
}
|
|
function emitAsyncFunctionBodyForES6(node) {
|
|
var promiseConstructor = ts.getEntityNameFromTypeNode(node.type);
|
|
var isArrowFunction = node.kind === 171 /* ArrowFunction */;
|
|
var hasLexicalArguments = (resolver.getNodeCheckFlags(node) & 4096 /* CaptureArguments */) !== 0;
|
|
var args;
|
|
// 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.
|
|
//
|
|
// The emit for an async arrow without a lexical `arguments` binding might be:
|
|
//
|
|
// // input
|
|
// let a = async (b) => { await b; }
|
|
//
|
|
// // output
|
|
// let a = (b) => __awaiter(this, void 0, void 0, function* () {
|
|
// yield b;
|
|
// });
|
|
//
|
|
// The emit for an async arrow with a lexical `arguments` binding might be:
|
|
//
|
|
// // input
|
|
// let a = async (b) => { await arguments[0]; }
|
|
//
|
|
// // output
|
|
// let a = (b) => __awaiter(this, arguments, void 0, function* (arguments) {
|
|
// yield arguments[0];
|
|
// });
|
|
//
|
|
// The emit for an async function expression without a lexical `arguments` binding
|
|
// might be:
|
|
//
|
|
// // input
|
|
// let a = async function (b) {
|
|
// await b;
|
|
// }
|
|
//
|
|
// // output
|
|
// let a = function (b) {
|
|
// return __awaiter(this, void 0, void 0, function* () {
|
|
// yield b;
|
|
// });
|
|
// }
|
|
//
|
|
// The emit for an async function expression with a lexical `arguments` binding
|
|
// might be:
|
|
//
|
|
// // input
|
|
// let a = async function (b) {
|
|
// await arguments[0];
|
|
// }
|
|
//
|
|
// // output
|
|
// let a = function (b) {
|
|
// return __awaiter(this, arguments, void 0, function* (_arguments) {
|
|
// yield _arguments[0];
|
|
// });
|
|
// }
|
|
//
|
|
// The emit for an async function expression with a lexical `arguments` binding
|
|
// and a return type annotation might be:
|
|
//
|
|
// // input
|
|
// let a = async function (b): MyPromise<any> {
|
|
// await arguments[0];
|
|
// }
|
|
//
|
|
// // output
|
|
// let a = function (b) {
|
|
// return __awaiter(this, arguments, MyPromise, function* (_arguments) {
|
|
// yield _arguments[0];
|
|
// });
|
|
// }
|
|
//
|
|
// If this is not an async arrow, emit the opening brace of the function body
|
|
// and the start of the return statement.
|
|
if (!isArrowFunction) {
|
|
write(" {");
|
|
increaseIndent();
|
|
writeLine();
|
|
write("return");
|
|
}
|
|
write(" __awaiter(this");
|
|
if (hasLexicalArguments) {
|
|
write(", arguments");
|
|
}
|
|
else {
|
|
write(", void 0");
|
|
}
|
|
if (promiseConstructor) {
|
|
write(", ");
|
|
emitNodeWithoutSourceMap(promiseConstructor);
|
|
}
|
|
else {
|
|
write(", Promise");
|
|
}
|
|
// Emit the call to __awaiter.
|
|
if (hasLexicalArguments) {
|
|
write(", function* (_arguments)");
|
|
}
|
|
else {
|
|
write(", function* ()");
|
|
}
|
|
// Emit the signature and body for the inner generator function.
|
|
emitFunctionBody(node);
|
|
write(")");
|
|
// If this is not an async arrow, emit the closing brace of the outer function body.
|
|
if (!isArrowFunction) {
|
|
write(";");
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("}");
|
|
}
|
|
}
|
|
function emitFunctionBody(node) {
|
|
if (!node.body) {
|
|
// There can be no body when there are parse errors. Just emit an empty block
|
|
// in that case.
|
|
write(" { }");
|
|
}
|
|
else {
|
|
if (node.body.kind === 189 /* Block */) {
|
|
emitBlockFunctionBody(node, node.body);
|
|
}
|
|
else {
|
|
emitExpressionFunctionBody(node, node.body);
|
|
}
|
|
}
|
|
}
|
|
function emitSignatureAndBody(node) {
|
|
var saveTempFlags = tempFlags;
|
|
var saveTempVariables = tempVariables;
|
|
var saveTempParameters = tempParameters;
|
|
tempFlags = 0;
|
|
tempVariables = undefined;
|
|
tempParameters = undefined;
|
|
// When targeting ES6, emit arrow function natively in ES6
|
|
if (shouldEmitAsArrowFunction(node)) {
|
|
emitSignatureParametersForArrow(node);
|
|
write(" =>");
|
|
}
|
|
else {
|
|
emitSignatureParameters(node);
|
|
}
|
|
var isAsync = ts.isAsyncFunctionLike(node);
|
|
if (isAsync && languageVersion === 2 /* ES6 */) {
|
|
emitAsyncFunctionBodyForES6(node);
|
|
}
|
|
else {
|
|
emitFunctionBody(node);
|
|
}
|
|
if (!isES6ExportedDeclaration(node)) {
|
|
emitExportMemberAssignment(node);
|
|
}
|
|
tempFlags = saveTempFlags;
|
|
tempVariables = saveTempVariables;
|
|
tempParameters = saveTempParameters;
|
|
}
|
|
// Returns true if any preamble code was emitted.
|
|
function emitFunctionBodyPreamble(node) {
|
|
emitCaptureThisForNodeIfNecessary(node);
|
|
emitDefaultValueAssignments(node);
|
|
emitRestParameter(node);
|
|
}
|
|
function emitExpressionFunctionBody(node, body) {
|
|
if (languageVersion < 2 /* ES6 */ || node.flags & 512 /* Async */) {
|
|
emitDownLevelExpressionFunctionBody(node, body);
|
|
return;
|
|
}
|
|
// For es6 and higher we can emit the expression as is. However, in the case
|
|
// where the expression might end up looking like a block when emitted, we'll
|
|
// also wrap it in parentheses first. For example if you have: a => <foo>{}
|
|
// then we need to generate: a => ({})
|
|
write(" ");
|
|
// Unwrap all type assertions.
|
|
var current = body;
|
|
while (current.kind === 168 /* TypeAssertionExpression */) {
|
|
current = current.expression;
|
|
}
|
|
emitParenthesizedIf(body, current.kind === 162 /* ObjectLiteralExpression */);
|
|
}
|
|
function emitDownLevelExpressionFunctionBody(node, body) {
|
|
write(" {");
|
|
scopeEmitStart(node);
|
|
increaseIndent();
|
|
var outPos = writer.getTextPos();
|
|
emitDetachedComments(node.body);
|
|
emitFunctionBodyPreamble(node);
|
|
var preambleEmitted = writer.getTextPos() !== outPos;
|
|
decreaseIndent();
|
|
// If we didn't have to emit any preamble code, then attempt to keep the arrow
|
|
// function on one line.
|
|
if (!preambleEmitted && nodeStartPositionsAreOnSameLine(node, body)) {
|
|
write(" ");
|
|
emitStart(body);
|
|
write("return ");
|
|
emit(body);
|
|
emitEnd(body);
|
|
write(";");
|
|
emitTempDeclarations(false);
|
|
write(" ");
|
|
}
|
|
else {
|
|
increaseIndent();
|
|
writeLine();
|
|
emitLeadingComments(node.body);
|
|
write("return ");
|
|
emit(body);
|
|
write(";");
|
|
emitTrailingComments(node.body);
|
|
emitTempDeclarations(true);
|
|
decreaseIndent();
|
|
writeLine();
|
|
}
|
|
emitStart(node.body);
|
|
write("}");
|
|
emitEnd(node.body);
|
|
scopeEmitEnd();
|
|
}
|
|
function emitBlockFunctionBody(node, body) {
|
|
write(" {");
|
|
scopeEmitStart(node);
|
|
var initialTextPos = writer.getTextPos();
|
|
increaseIndent();
|
|
emitDetachedComments(body.statements);
|
|
// Emit all the directive prologues (like "use strict"). These have to come before
|
|
// any other preamble code we write (like parameter initializers).
|
|
var startIndex = emitDirectivePrologues(body.statements, true);
|
|
emitFunctionBodyPreamble(node);
|
|
decreaseIndent();
|
|
var preambleEmitted = writer.getTextPos() !== initialTextPos;
|
|
if (!preambleEmitted && nodeEndIsOnSameLineAsNodeStart(body, body)) {
|
|
for (var _a = 0, _b = body.statements; _a < _b.length; _a++) {
|
|
var statement = _b[_a];
|
|
write(" ");
|
|
emit(statement);
|
|
}
|
|
emitTempDeclarations(false);
|
|
write(" ");
|
|
emitLeadingCommentsOfPosition(body.statements.end);
|
|
}
|
|
else {
|
|
increaseIndent();
|
|
emitLinesStartingAt(body.statements, startIndex);
|
|
emitTempDeclarations(true);
|
|
writeLine();
|
|
emitLeadingCommentsOfPosition(body.statements.end);
|
|
decreaseIndent();
|
|
}
|
|
emitToken(15 /* CloseBraceToken */, body.statements.end);
|
|
scopeEmitEnd();
|
|
}
|
|
function findInitialSuperCall(ctor) {
|
|
if (ctor.body) {
|
|
var statement = ctor.body.statements[0];
|
|
if (statement && statement.kind === 192 /* ExpressionStatement */) {
|
|
var expr = statement.expression;
|
|
if (expr && expr.kind === 165 /* CallExpression */) {
|
|
var func = expr.expression;
|
|
if (func && func.kind === 92 /* SuperKeyword */) {
|
|
return statement;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function emitParameterPropertyAssignments(node) {
|
|
ts.forEach(node.parameters, function (param) {
|
|
if (param.flags & 112 /* AccessibilityModifier */) {
|
|
writeLine();
|
|
emitStart(param);
|
|
emitStart(param.name);
|
|
write("this.");
|
|
emitNodeWithoutSourceMap(param.name);
|
|
emitEnd(param.name);
|
|
write(" = ");
|
|
emit(param.name);
|
|
write(";");
|
|
emitEnd(param);
|
|
}
|
|
});
|
|
}
|
|
function emitMemberAccessForPropertyName(memberName) {
|
|
// TODO: (jfreeman,drosen): comment on why this is emitNodeWithoutSourceMap instead of emit here.
|
|
if (memberName.kind === 8 /* StringLiteral */ || memberName.kind === 7 /* NumericLiteral */) {
|
|
write("[");
|
|
emitNodeWithoutSourceMap(memberName);
|
|
write("]");
|
|
}
|
|
else if (memberName.kind === 133 /* ComputedPropertyName */) {
|
|
emitComputedPropertyName(memberName);
|
|
}
|
|
else {
|
|
write(".");
|
|
emitNodeWithoutSourceMap(memberName);
|
|
}
|
|
}
|
|
function getInitializedProperties(node, isStatic) {
|
|
var properties = [];
|
|
for (var _a = 0, _b = node.members; _a < _b.length; _a++) {
|
|
var member = _b[_a];
|
|
if (member.kind === 138 /* PropertyDeclaration */ && isStatic === ((member.flags & 128 /* Static */) !== 0) && member.initializer) {
|
|
properties.push(member);
|
|
}
|
|
}
|
|
return properties;
|
|
}
|
|
function emitPropertyDeclarations(node, properties) {
|
|
for (var _a = 0; _a < properties.length; _a++) {
|
|
var property = properties[_a];
|
|
emitPropertyDeclaration(node, property);
|
|
}
|
|
}
|
|
function emitPropertyDeclaration(node, property, receiver, isExpression) {
|
|
writeLine();
|
|
emitLeadingComments(property);
|
|
emitStart(property);
|
|
emitStart(property.name);
|
|
if (receiver) {
|
|
emit(receiver);
|
|
}
|
|
else {
|
|
if (property.flags & 128 /* Static */) {
|
|
emitDeclarationName(node);
|
|
}
|
|
else {
|
|
write("this");
|
|
}
|
|
}
|
|
emitMemberAccessForPropertyName(property.name);
|
|
emitEnd(property.name);
|
|
write(" = ");
|
|
emit(property.initializer);
|
|
if (!isExpression) {
|
|
write(";");
|
|
}
|
|
emitEnd(property);
|
|
emitTrailingComments(property);
|
|
}
|
|
function emitMemberFunctionsForES5AndLower(node) {
|
|
ts.forEach(node.members, function (member) {
|
|
if (member.kind === 188 /* SemicolonClassElement */) {
|
|
writeLine();
|
|
write(";");
|
|
}
|
|
else if (member.kind === 140 /* MethodDeclaration */ || node.kind === 139 /* MethodSignature */) {
|
|
if (!member.body) {
|
|
return emitOnlyPinnedOrTripleSlashComments(member);
|
|
}
|
|
writeLine();
|
|
emitLeadingComments(member);
|
|
emitStart(member);
|
|
emitStart(member.name);
|
|
emitClassMemberPrefix(node, member);
|
|
emitMemberAccessForPropertyName(member.name);
|
|
emitEnd(member.name);
|
|
write(" = ");
|
|
emitStart(member);
|
|
emitFunctionDeclaration(member);
|
|
emitEnd(member);
|
|
emitEnd(member);
|
|
write(";");
|
|
emitTrailingComments(member);
|
|
}
|
|
else if (member.kind === 142 /* GetAccessor */ || member.kind === 143 /* SetAccessor */) {
|
|
var accessors = ts.getAllAccessorDeclarations(node.members, member);
|
|
if (member === accessors.firstAccessor) {
|
|
writeLine();
|
|
emitStart(member);
|
|
write("Object.defineProperty(");
|
|
emitStart(member.name);
|
|
emitClassMemberPrefix(node, member);
|
|
write(", ");
|
|
emitExpressionForPropertyName(member.name);
|
|
emitEnd(member.name);
|
|
write(", {");
|
|
increaseIndent();
|
|
if (accessors.getAccessor) {
|
|
writeLine();
|
|
emitLeadingComments(accessors.getAccessor);
|
|
write("get: ");
|
|
emitStart(accessors.getAccessor);
|
|
write("function ");
|
|
emitSignatureAndBody(accessors.getAccessor);
|
|
emitEnd(accessors.getAccessor);
|
|
emitTrailingComments(accessors.getAccessor);
|
|
write(",");
|
|
}
|
|
if (accessors.setAccessor) {
|
|
writeLine();
|
|
emitLeadingComments(accessors.setAccessor);
|
|
write("set: ");
|
|
emitStart(accessors.setAccessor);
|
|
write("function ");
|
|
emitSignatureAndBody(accessors.setAccessor);
|
|
emitEnd(accessors.setAccessor);
|
|
emitTrailingComments(accessors.setAccessor);
|
|
write(",");
|
|
}
|
|
writeLine();
|
|
write("enumerable: true,");
|
|
writeLine();
|
|
write("configurable: true");
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("});");
|
|
emitEnd(member);
|
|
}
|
|
}
|
|
});
|
|
}
|
|
function emitMemberFunctionsForES6AndHigher(node) {
|
|
for (var _a = 0, _b = node.members; _a < _b.length; _a++) {
|
|
var member = _b[_a];
|
|
if ((member.kind === 140 /* MethodDeclaration */ || node.kind === 139 /* MethodSignature */) && !member.body) {
|
|
emitOnlyPinnedOrTripleSlashComments(member);
|
|
}
|
|
else if (member.kind === 140 /* MethodDeclaration */ ||
|
|
member.kind === 142 /* GetAccessor */ ||
|
|
member.kind === 143 /* SetAccessor */) {
|
|
writeLine();
|
|
emitLeadingComments(member);
|
|
emitStart(member);
|
|
if (member.flags & 128 /* Static */) {
|
|
write("static ");
|
|
}
|
|
if (member.kind === 142 /* GetAccessor */) {
|
|
write("get ");
|
|
}
|
|
else if (member.kind === 143 /* SetAccessor */) {
|
|
write("set ");
|
|
}
|
|
if (member.asteriskToken) {
|
|
write("*");
|
|
}
|
|
emit(member.name);
|
|
emitSignatureAndBody(member);
|
|
emitEnd(member);
|
|
emitTrailingComments(member);
|
|
}
|
|
else if (member.kind === 188 /* SemicolonClassElement */) {
|
|
writeLine();
|
|
write(";");
|
|
}
|
|
}
|
|
}
|
|
function emitConstructor(node, baseTypeElement) {
|
|
var saveTempFlags = tempFlags;
|
|
var saveTempVariables = tempVariables;
|
|
var saveTempParameters = tempParameters;
|
|
tempFlags = 0;
|
|
tempVariables = undefined;
|
|
tempParameters = undefined;
|
|
emitConstructorWorker(node, baseTypeElement);
|
|
tempFlags = saveTempFlags;
|
|
tempVariables = saveTempVariables;
|
|
tempParameters = saveTempParameters;
|
|
}
|
|
function emitConstructorWorker(node, baseTypeElement) {
|
|
// Check if we have property assignment inside class declaration.
|
|
// If there is property assignment, we need to emit constructor whether users define it or not
|
|
// If there is no property assignment, we can omit constructor if users do not define it
|
|
var hasInstancePropertyWithInitializer = false;
|
|
// Emit the constructor overload pinned comments
|
|
ts.forEach(node.members, function (member) {
|
|
if (member.kind === 141 /* Constructor */ && !member.body) {
|
|
emitOnlyPinnedOrTripleSlashComments(member);
|
|
}
|
|
// Check if there is any non-static property assignment
|
|
if (member.kind === 138 /* PropertyDeclaration */ && member.initializer && (member.flags & 128 /* Static */) === 0) {
|
|
hasInstancePropertyWithInitializer = true;
|
|
}
|
|
});
|
|
var ctor = ts.getFirstConstructorWithBody(node);
|
|
// For target ES6 and above, if there is no user-defined constructor and there is no property assignment
|
|
// do not emit constructor in class declaration.
|
|
if (languageVersion >= 2 /* ES6 */ && !ctor && !hasInstancePropertyWithInitializer) {
|
|
return;
|
|
}
|
|
if (ctor) {
|
|
emitLeadingComments(ctor);
|
|
}
|
|
emitStart(ctor || node);
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
write("function ");
|
|
emitDeclarationName(node);
|
|
emitSignatureParameters(ctor);
|
|
}
|
|
else {
|
|
write("constructor");
|
|
if (ctor) {
|
|
emitSignatureParameters(ctor);
|
|
}
|
|
else {
|
|
// Based on EcmaScript6 section 14.5.14: Runtime Semantics: ClassDefinitionEvaluation.
|
|
// If constructor is empty, then,
|
|
// If ClassHeritageopt is present, then
|
|
// Let constructor be the result of parsing the String "constructor(... args){ super (...args);}" using the syntactic grammar with the goal symbol MethodDefinition.
|
|
// Else,
|
|
// Let constructor be the result of parsing the String "constructor( ){ }" using the syntactic grammar with the goal symbol MethodDefinition
|
|
if (baseTypeElement) {
|
|
write("(...args)");
|
|
}
|
|
else {
|
|
write("()");
|
|
}
|
|
}
|
|
}
|
|
write(" {");
|
|
scopeEmitStart(node, "constructor");
|
|
increaseIndent();
|
|
if (ctor) {
|
|
emitDetachedComments(ctor.body.statements);
|
|
}
|
|
emitCaptureThisForNodeIfNecessary(node);
|
|
if (ctor) {
|
|
emitDefaultValueAssignments(ctor);
|
|
emitRestParameter(ctor);
|
|
if (baseTypeElement) {
|
|
var superCall = findInitialSuperCall(ctor);
|
|
if (superCall) {
|
|
writeLine();
|
|
emit(superCall);
|
|
}
|
|
}
|
|
emitParameterPropertyAssignments(ctor);
|
|
}
|
|
else {
|
|
if (baseTypeElement) {
|
|
writeLine();
|
|
emitStart(baseTypeElement);
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
write("_super.apply(this, arguments);");
|
|
}
|
|
else {
|
|
write("super(...args);");
|
|
}
|
|
emitEnd(baseTypeElement);
|
|
}
|
|
}
|
|
emitPropertyDeclarations(node, getInitializedProperties(node, false));
|
|
if (ctor) {
|
|
var statements = ctor.body.statements;
|
|
if (superCall) {
|
|
statements = statements.slice(1);
|
|
}
|
|
emitLines(statements);
|
|
}
|
|
emitTempDeclarations(true);
|
|
writeLine();
|
|
if (ctor) {
|
|
emitLeadingCommentsOfPosition(ctor.body.statements.end);
|
|
}
|
|
decreaseIndent();
|
|
emitToken(15 /* CloseBraceToken */, ctor ? ctor.body.statements.end : node.members.end);
|
|
scopeEmitEnd();
|
|
emitEnd(ctor || node);
|
|
if (ctor) {
|
|
emitTrailingComments(ctor);
|
|
}
|
|
}
|
|
function emitClassExpression(node) {
|
|
return emitClassLikeDeclaration(node);
|
|
}
|
|
function emitClassDeclaration(node) {
|
|
return emitClassLikeDeclaration(node);
|
|
}
|
|
function emitClassLikeDeclaration(node) {
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
emitClassLikeDeclarationBelowES6(node);
|
|
}
|
|
else {
|
|
emitClassLikeDeclarationForES6AndHigher(node);
|
|
}
|
|
}
|
|
function emitClassLikeDeclarationForES6AndHigher(node) {
|
|
var thisNodeIsDecorated = ts.nodeIsDecorated(node);
|
|
if (node.kind === 211 /* ClassDeclaration */) {
|
|
if (thisNodeIsDecorated) {
|
|
// To preserve the correct runtime semantics when decorators are applied to the class,
|
|
// the emit needs to follow one of the following rules:
|
|
//
|
|
// * For a local class declaration:
|
|
//
|
|
// @dec class C {
|
|
// }
|
|
//
|
|
// The emit should be:
|
|
//
|
|
// let C = class {
|
|
// };
|
|
// Object.defineProperty(C, "name", { value: "C", configurable: true });
|
|
// C = __decorate([dec], C);
|
|
//
|
|
// * For an exported class declaration:
|
|
//
|
|
// @dec export class C {
|
|
// }
|
|
//
|
|
// The emit should be:
|
|
//
|
|
// export let C = class {
|
|
// };
|
|
// Object.defineProperty(C, "name", { value: "C", configurable: true });
|
|
// C = __decorate([dec], C);
|
|
//
|
|
// * For a default export of a class declaration with a name:
|
|
//
|
|
// @dec default export class C {
|
|
// }
|
|
//
|
|
// The emit should be:
|
|
//
|
|
// let C = class {
|
|
// }
|
|
// Object.defineProperty(C, "name", { value: "C", configurable: true });
|
|
// C = __decorate([dec], C);
|
|
// export default C;
|
|
//
|
|
// * For a default export of a class declaration without a name:
|
|
//
|
|
// @dec default export class {
|
|
// }
|
|
//
|
|
// The emit should be:
|
|
//
|
|
// let _default = class {
|
|
// }
|
|
// _default = __decorate([dec], _default);
|
|
// export default _default;
|
|
//
|
|
if (isES6ExportedDeclaration(node) && !(node.flags & 1024 /* Default */)) {
|
|
write("export ");
|
|
}
|
|
write("let ");
|
|
emitDeclarationName(node);
|
|
write(" = ");
|
|
}
|
|
else if (isES6ExportedDeclaration(node)) {
|
|
write("export ");
|
|
if (node.flags & 1024 /* Default */) {
|
|
write("default ");
|
|
}
|
|
}
|
|
}
|
|
// If the class has static properties, and it's a class expression, then we'll need
|
|
// to specialize the emit a bit. for a class expression of the form:
|
|
//
|
|
// class C { static a = 1; static b = 2; ... }
|
|
//
|
|
// We'll emit:
|
|
//
|
|
// (_temp = class C { ... }, _temp.a = 1, _temp.b = 2, _temp)
|
|
//
|
|
// This keeps the expression as an expression, while ensuring that the static parts
|
|
// of it have been initialized by the time it is used.
|
|
var staticProperties = getInitializedProperties(node, true);
|
|
var isClassExpressionWithStaticProperties = staticProperties.length > 0 && node.kind === 183 /* ClassExpression */;
|
|
var tempVariable;
|
|
if (isClassExpressionWithStaticProperties) {
|
|
tempVariable = createAndRecordTempVariable(0 /* Auto */);
|
|
write("(");
|
|
increaseIndent();
|
|
emit(tempVariable);
|
|
write(" = ");
|
|
}
|
|
write("class");
|
|
// check if this is an "export default class" as it may not have a name. Do not emit the name if the class is decorated.
|
|
if ((node.name || !(node.flags & 1024 /* Default */)) && !thisNodeIsDecorated) {
|
|
write(" ");
|
|
emitDeclarationName(node);
|
|
}
|
|
var baseTypeNode = ts.getClassExtendsHeritageClauseElement(node);
|
|
if (baseTypeNode) {
|
|
write(" extends ");
|
|
emit(baseTypeNode.expression);
|
|
}
|
|
write(" {");
|
|
increaseIndent();
|
|
scopeEmitStart(node);
|
|
writeLine();
|
|
emitConstructor(node, baseTypeNode);
|
|
emitMemberFunctionsForES6AndHigher(node);
|
|
decreaseIndent();
|
|
writeLine();
|
|
emitToken(15 /* CloseBraceToken */, node.members.end);
|
|
scopeEmitEnd();
|
|
// TODO(rbuckton): Need to go back to `let _a = class C {}` approach, removing the defineProperty call for now.
|
|
// For a decorated class, we need to assign its name (if it has one). This is because we emit
|
|
// the class as a class expression to avoid the double-binding of the identifier:
|
|
//
|
|
// let C = class {
|
|
// }
|
|
// Object.defineProperty(C, "name", { value: "C", configurable: true });
|
|
//
|
|
if (thisNodeIsDecorated) {
|
|
write(";");
|
|
}
|
|
// 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 (isClassExpressionWithStaticProperties) {
|
|
for (var _a = 0; _a < staticProperties.length; _a++) {
|
|
var property = staticProperties[_a];
|
|
write(",");
|
|
writeLine();
|
|
emitPropertyDeclaration(node, property, tempVariable, true);
|
|
}
|
|
write(",");
|
|
writeLine();
|
|
emit(tempVariable);
|
|
decreaseIndent();
|
|
write(")");
|
|
}
|
|
else {
|
|
writeLine();
|
|
emitPropertyDeclarations(node, staticProperties);
|
|
emitDecoratorsOfClass(node);
|
|
}
|
|
// If this is an exported class, but not on the top level (i.e. on an internal
|
|
// module), export it
|
|
if (!isES6ExportedDeclaration(node) && (node.flags & 1 /* Export */)) {
|
|
writeLine();
|
|
emitStart(node);
|
|
emitModuleMemberName(node);
|
|
write(" = ");
|
|
emitDeclarationName(node);
|
|
emitEnd(node);
|
|
write(";");
|
|
}
|
|
else if (isES6ExportedDeclaration(node) && (node.flags & 1024 /* Default */) && thisNodeIsDecorated) {
|
|
// if this is a top level default export of decorated class, write the export after the declaration.
|
|
writeLine();
|
|
write("export default ");
|
|
emitDeclarationName(node);
|
|
write(";");
|
|
}
|
|
}
|
|
function emitClassLikeDeclarationBelowES6(node) {
|
|
if (node.kind === 211 /* ClassDeclaration */) {
|
|
// source file level classes in system modules are hoisted so 'var's for them are already defined
|
|
if (!shouldHoistDeclarationInSystemJsModule(node)) {
|
|
write("var ");
|
|
}
|
|
emitDeclarationName(node);
|
|
write(" = ");
|
|
}
|
|
write("(function (");
|
|
var baseTypeNode = ts.getClassExtendsHeritageClauseElement(node);
|
|
if (baseTypeNode) {
|
|
write("_super");
|
|
}
|
|
write(") {");
|
|
var saveTempFlags = tempFlags;
|
|
var saveTempVariables = tempVariables;
|
|
var saveTempParameters = tempParameters;
|
|
var saveComputedPropertyNamesToGeneratedNames = computedPropertyNamesToGeneratedNames;
|
|
tempFlags = 0;
|
|
tempVariables = undefined;
|
|
tempParameters = undefined;
|
|
computedPropertyNamesToGeneratedNames = undefined;
|
|
increaseIndent();
|
|
scopeEmitStart(node);
|
|
if (baseTypeNode) {
|
|
writeLine();
|
|
emitStart(baseTypeNode);
|
|
write("__extends(");
|
|
emitDeclarationName(node);
|
|
write(", _super);");
|
|
emitEnd(baseTypeNode);
|
|
}
|
|
writeLine();
|
|
emitConstructor(node, baseTypeNode);
|
|
emitMemberFunctionsForES5AndLower(node);
|
|
emitPropertyDeclarations(node, getInitializedProperties(node, true));
|
|
writeLine();
|
|
emitDecoratorsOfClass(node);
|
|
writeLine();
|
|
emitToken(15 /* CloseBraceToken */, node.members.end, function () {
|
|
write("return ");
|
|
emitDeclarationName(node);
|
|
});
|
|
write(";");
|
|
emitTempDeclarations(true);
|
|
tempFlags = saveTempFlags;
|
|
tempVariables = saveTempVariables;
|
|
tempParameters = saveTempParameters;
|
|
computedPropertyNamesToGeneratedNames = saveComputedPropertyNamesToGeneratedNames;
|
|
decreaseIndent();
|
|
writeLine();
|
|
emitToken(15 /* CloseBraceToken */, node.members.end);
|
|
scopeEmitEnd();
|
|
emitStart(node);
|
|
write(")(");
|
|
if (baseTypeNode) {
|
|
emit(baseTypeNode.expression);
|
|
}
|
|
write(")");
|
|
if (node.kind === 211 /* ClassDeclaration */) {
|
|
write(";");
|
|
}
|
|
emitEnd(node);
|
|
if (node.kind === 211 /* ClassDeclaration */) {
|
|
emitExportMemberAssignment(node);
|
|
}
|
|
if (languageVersion < 2 /* ES6 */ && node.parent === currentSourceFile && node.name) {
|
|
emitExportMemberAssignments(node.name);
|
|
}
|
|
}
|
|
function emitClassMemberPrefix(node, member) {
|
|
emitDeclarationName(node);
|
|
if (!(member.flags & 128 /* Static */)) {
|
|
write(".prototype");
|
|
}
|
|
}
|
|
function emitDecoratorsOfClass(node) {
|
|
emitDecoratorsOfMembers(node, 0);
|
|
emitDecoratorsOfMembers(node, 128 /* Static */);
|
|
emitDecoratorsOfConstructor(node);
|
|
}
|
|
function emitDecoratorsOfConstructor(node) {
|
|
var decorators = node.decorators;
|
|
var constructor = ts.getFirstConstructorWithBody(node);
|
|
var hasDecoratedParameters = constructor && ts.forEach(constructor.parameters, ts.nodeIsDecorated);
|
|
// skip decoration of the constructor if neither it nor its parameters are decorated
|
|
if (!decorators && !hasDecoratedParameters) {
|
|
return;
|
|
}
|
|
// Emit the call to __decorate. Given the class:
|
|
//
|
|
// @dec
|
|
// class C {
|
|
// }
|
|
//
|
|
// The emit for the class is:
|
|
//
|
|
// C = __decorate([dec], C);
|
|
//
|
|
writeLine();
|
|
emitStart(node);
|
|
emitDeclarationName(node);
|
|
write(" = __decorate([");
|
|
increaseIndent();
|
|
writeLine();
|
|
var decoratorCount = decorators ? decorators.length : 0;
|
|
var argumentsWritten = emitList(decorators, 0, decoratorCount, true, false, false, true, function (decorator) {
|
|
emitStart(decorator);
|
|
emit(decorator.expression);
|
|
emitEnd(decorator);
|
|
});
|
|
argumentsWritten += emitDecoratorsOfParameters(constructor, argumentsWritten > 0);
|
|
emitSerializedTypeMetadata(node, argumentsWritten >= 0);
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("], ");
|
|
emitDeclarationName(node);
|
|
write(");");
|
|
emitEnd(node);
|
|
writeLine();
|
|
}
|
|
function emitDecoratorsOfMembers(node, staticFlag) {
|
|
for (var _a = 0, _b = node.members; _a < _b.length; _a++) {
|
|
var member = _b[_a];
|
|
// only emit members in the correct group
|
|
if ((member.flags & 128 /* Static */) !== staticFlag) {
|
|
continue;
|
|
}
|
|
// skip members that cannot be decorated (such as the constructor)
|
|
if (!ts.nodeCanBeDecorated(member)) {
|
|
continue;
|
|
}
|
|
// skip a member if it or any of its parameters are not decorated
|
|
if (!ts.nodeOrChildIsDecorated(member)) {
|
|
continue;
|
|
}
|
|
// skip an accessor declaration if it is not the first accessor
|
|
var decorators = void 0;
|
|
var functionLikeMember = void 0;
|
|
if (ts.isAccessor(member)) {
|
|
var accessors = ts.getAllAccessorDeclarations(node.members, member);
|
|
if (member !== accessors.firstAccessor) {
|
|
continue;
|
|
}
|
|
// get the decorators from the first accessor with decorators
|
|
decorators = accessors.firstAccessor.decorators;
|
|
if (!decorators && accessors.secondAccessor) {
|
|
decorators = accessors.secondAccessor.decorators;
|
|
}
|
|
// we only decorate parameters of the set accessor
|
|
functionLikeMember = accessors.setAccessor;
|
|
}
|
|
else {
|
|
decorators = member.decorators;
|
|
// we only decorate the parameters here if this is a method
|
|
if (member.kind === 140 /* MethodDeclaration */) {
|
|
functionLikeMember = member;
|
|
}
|
|
}
|
|
// 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:
|
|
//
|
|
// Object.defineProperty(C.prototype, "method",
|
|
// __decorate([
|
|
// dec,
|
|
// __param(0, dec2),
|
|
// __metadata("design:type", Function),
|
|
// __metadata("design:paramtypes", [Object]),
|
|
// __metadata("design:returntype", void 0)
|
|
// ], C.prototype, "method", Object.getOwnPropertyDescriptor(C.prototype, "method")));
|
|
//
|
|
// The emit for an accessor is:
|
|
//
|
|
// Object.defineProperty(C.prototype, "accessor",
|
|
// __decorate([
|
|
// dec
|
|
// ], C.prototype, "accessor", Object.getOwnPropertyDescriptor(C.prototype, "accessor")));
|
|
//
|
|
// The emit for a property is:
|
|
//
|
|
// __decorate([
|
|
// dec
|
|
// ], C.prototype, "prop");
|
|
//
|
|
writeLine();
|
|
emitStart(member);
|
|
if (member.kind !== 138 /* PropertyDeclaration */) {
|
|
write("Object.defineProperty(");
|
|
emitStart(member.name);
|
|
emitClassMemberPrefix(node, member);
|
|
write(", ");
|
|
emitExpressionForPropertyName(member.name);
|
|
emitEnd(member.name);
|
|
write(",");
|
|
increaseIndent();
|
|
writeLine();
|
|
}
|
|
write("__decorate([");
|
|
increaseIndent();
|
|
writeLine();
|
|
var decoratorCount = decorators ? decorators.length : 0;
|
|
var argumentsWritten = emitList(decorators, 0, decoratorCount, true, false, false, true, function (decorator) {
|
|
emitStart(decorator);
|
|
emit(decorator.expression);
|
|
emitEnd(decorator);
|
|
});
|
|
argumentsWritten += emitDecoratorsOfParameters(functionLikeMember, argumentsWritten > 0);
|
|
emitSerializedTypeMetadata(member, argumentsWritten > 0);
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("], ");
|
|
emitStart(member.name);
|
|
emitClassMemberPrefix(node, member);
|
|
write(", ");
|
|
emitExpressionForPropertyName(member.name);
|
|
emitEnd(member.name);
|
|
if (member.kind !== 138 /* PropertyDeclaration */) {
|
|
write(", Object.getOwnPropertyDescriptor(");
|
|
emitStart(member.name);
|
|
emitClassMemberPrefix(node, member);
|
|
write(", ");
|
|
emitExpressionForPropertyName(member.name);
|
|
emitEnd(member.name);
|
|
write("))");
|
|
decreaseIndent();
|
|
}
|
|
write(");");
|
|
emitEnd(member);
|
|
writeLine();
|
|
}
|
|
}
|
|
function emitDecoratorsOfParameters(node, leadingComma) {
|
|
var argumentsWritten = 0;
|
|
if (node) {
|
|
var parameterIndex = 0;
|
|
for (var _a = 0, _b = node.parameters; _a < _b.length; _a++) {
|
|
var parameter = _b[_a];
|
|
if (ts.nodeIsDecorated(parameter)) {
|
|
var decorators = parameter.decorators;
|
|
argumentsWritten += emitList(decorators, 0, decorators.length, true, false, leadingComma, true, function (decorator) {
|
|
emitStart(decorator);
|
|
write("__param(" + parameterIndex + ", ");
|
|
emit(decorator.expression);
|
|
write(")");
|
|
emitEnd(decorator);
|
|
});
|
|
leadingComma = true;
|
|
}
|
|
++parameterIndex;
|
|
}
|
|
}
|
|
return argumentsWritten;
|
|
}
|
|
function shouldEmitTypeMetadata(node) {
|
|
// This method 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.
|
|
switch (node.kind) {
|
|
case 140 /* MethodDeclaration */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 138 /* PropertyDeclaration */:
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function shouldEmitReturnTypeMetadata(node) {
|
|
// This method 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.
|
|
switch (node.kind) {
|
|
case 140 /* MethodDeclaration */:
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function shouldEmitParamTypesMetadata(node) {
|
|
// This method 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.
|
|
switch (node.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 143 /* SetAccessor */:
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
/** Serializes the type of a declaration to an appropriate JS constructor value. Used by the __metadata decorator for a class member. */
|
|
function emitSerializedTypeOfNode(node) {
|
|
// serialization of the type of a declaration uses the following rules:
|
|
//
|
|
// * The serialized type of a ClassDeclaration is "Function"
|
|
// * The serialized type of a ParameterDeclaration is the serialized type of its type annotation.
|
|
// * The serialized type of a PropertyDeclaration is the serialized type of its type annotation.
|
|
// * The serialized type of an AccessorDeclaration is the serialized type of the return type annotation of its getter or parameter type annotation of its setter.
|
|
// * The serialized type of any other FunctionLikeDeclaration is "Function".
|
|
// * The serialized type of any other node is "void 0".
|
|
//
|
|
// For rules on serializing type annotations, see `serializeTypeNode`.
|
|
switch (node.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
write("Function");
|
|
return;
|
|
case 138 /* PropertyDeclaration */:
|
|
emitSerializedTypeNode(node.type);
|
|
return;
|
|
case 135 /* Parameter */:
|
|
emitSerializedTypeNode(node.type);
|
|
return;
|
|
case 142 /* GetAccessor */:
|
|
emitSerializedTypeNode(node.type);
|
|
return;
|
|
case 143 /* SetAccessor */:
|
|
emitSerializedTypeNode(ts.getSetAccessorTypeAnnotationNode(node));
|
|
return;
|
|
}
|
|
if (ts.isFunctionLike(node)) {
|
|
write("Function");
|
|
return;
|
|
}
|
|
write("void 0");
|
|
}
|
|
function emitSerializedTypeNode(node) {
|
|
switch (node.kind) {
|
|
case 100 /* VoidKeyword */:
|
|
write("void 0");
|
|
return;
|
|
case 157 /* ParenthesizedType */:
|
|
emitSerializedTypeNode(node.type);
|
|
return;
|
|
case 149 /* FunctionType */:
|
|
case 150 /* ConstructorType */:
|
|
write("Function");
|
|
return;
|
|
case 153 /* ArrayType */:
|
|
case 154 /* TupleType */:
|
|
write("Array");
|
|
return;
|
|
case 147 /* TypePredicate */:
|
|
case 117 /* BooleanKeyword */:
|
|
write("Boolean");
|
|
return;
|
|
case 127 /* StringKeyword */:
|
|
case 8 /* StringLiteral */:
|
|
write("String");
|
|
return;
|
|
case 125 /* NumberKeyword */:
|
|
write("Number");
|
|
return;
|
|
case 128 /* SymbolKeyword */:
|
|
write("Symbol");
|
|
return;
|
|
case 148 /* TypeReference */:
|
|
emitSerializedTypeReferenceNode(node);
|
|
return;
|
|
case 151 /* TypeQuery */:
|
|
case 152 /* TypeLiteral */:
|
|
case 155 /* UnionType */:
|
|
case 156 /* IntersectionType */:
|
|
case 114 /* AnyKeyword */:
|
|
break;
|
|
default:
|
|
ts.Debug.fail("Cannot serialize unexpected type node.");
|
|
break;
|
|
}
|
|
write("Object");
|
|
}
|
|
/** Serializes a TypeReferenceNode to an appropriate JS constructor value. Used by the __metadata decorator. */
|
|
function emitSerializedTypeReferenceNode(node) {
|
|
var typeName = node.typeName;
|
|
var result = resolver.getTypeReferenceSerializationKind(node);
|
|
switch (result) {
|
|
case ts.TypeReferenceSerializationKind.Unknown:
|
|
var temp = createAndRecordTempVariable(0 /* Auto */);
|
|
write("(typeof (");
|
|
emitNodeWithoutSourceMap(temp);
|
|
write(" = ");
|
|
emitEntityNameAsExpression(typeName, true);
|
|
write(") === 'function' && ");
|
|
emitNodeWithoutSourceMap(temp);
|
|
write(") || Object");
|
|
break;
|
|
case ts.TypeReferenceSerializationKind.TypeWithConstructSignatureAndValue:
|
|
emitEntityNameAsExpression(typeName, false);
|
|
break;
|
|
case ts.TypeReferenceSerializationKind.VoidType:
|
|
write("void 0");
|
|
break;
|
|
case ts.TypeReferenceSerializationKind.BooleanType:
|
|
write("Boolean");
|
|
break;
|
|
case ts.TypeReferenceSerializationKind.NumberLikeType:
|
|
write("Number");
|
|
break;
|
|
case ts.TypeReferenceSerializationKind.StringLikeType:
|
|
write("String");
|
|
break;
|
|
case ts.TypeReferenceSerializationKind.ArrayLikeType:
|
|
write("Array");
|
|
break;
|
|
case ts.TypeReferenceSerializationKind.ESSymbolType:
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
write("typeof Symbol === 'function' ? Symbol : Object");
|
|
}
|
|
else {
|
|
write("Symbol");
|
|
}
|
|
break;
|
|
case ts.TypeReferenceSerializationKind.TypeWithCallSignature:
|
|
write("Function");
|
|
break;
|
|
case ts.TypeReferenceSerializationKind.ObjectType:
|
|
write("Object");
|
|
break;
|
|
}
|
|
}
|
|
/** Serializes the parameter types of a function or the constructor of a class. Used by the __metadata decorator for a method or set accessor. */
|
|
function emitSerializedParameterTypesOfNode(node) {
|
|
// serialization of parameter types uses the following rules:
|
|
//
|
|
// * If the declaration is a class, the parameters of the first constructor with a body are used.
|
|
// * If the declaration is function-like and has a body, the parameters of the function are used.
|
|
//
|
|
// For the rules on serializing the type of each parameter declaration, see `serializeTypeOfDeclaration`.
|
|
if (node) {
|
|
var valueDeclaration;
|
|
if (node.kind === 211 /* ClassDeclaration */) {
|
|
valueDeclaration = ts.getFirstConstructorWithBody(node);
|
|
}
|
|
else if (ts.isFunctionLike(node) && ts.nodeIsPresent(node.body)) {
|
|
valueDeclaration = node;
|
|
}
|
|
if (valueDeclaration) {
|
|
var parameters = valueDeclaration.parameters;
|
|
var parameterCount = parameters.length;
|
|
if (parameterCount > 0) {
|
|
for (var i = 0; i < parameterCount; i++) {
|
|
if (i > 0) {
|
|
write(", ");
|
|
}
|
|
if (parameters[i].dotDotDotToken) {
|
|
var parameterType = parameters[i].type;
|
|
if (parameterType.kind === 153 /* ArrayType */) {
|
|
parameterType = parameterType.elementType;
|
|
}
|
|
else if (parameterType.kind === 148 /* TypeReference */ && parameterType.typeArguments && parameterType.typeArguments.length === 1) {
|
|
parameterType = parameterType.typeArguments[0];
|
|
}
|
|
else {
|
|
parameterType = undefined;
|
|
}
|
|
emitSerializedTypeNode(parameterType);
|
|
}
|
|
else {
|
|
emitSerializedTypeOfNode(parameters[i]);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
/** Serializes the return type of function. Used by the __metadata decorator for a method. */
|
|
function emitSerializedReturnTypeOfNode(node) {
|
|
if (node && ts.isFunctionLike(node)) {
|
|
emitSerializedTypeNode(node.type);
|
|
return;
|
|
}
|
|
write("void 0");
|
|
}
|
|
function emitSerializedTypeMetadata(node, writeComma) {
|
|
// This method emits the serialized type metadata for a decorator target.
|
|
// The caller should have already tested whether the node has decorators.
|
|
var argumentsWritten = 0;
|
|
if (compilerOptions.emitDecoratorMetadata) {
|
|
if (shouldEmitTypeMetadata(node)) {
|
|
if (writeComma) {
|
|
write(", ");
|
|
}
|
|
writeLine();
|
|
write("__metadata('design:type', ");
|
|
emitSerializedTypeOfNode(node);
|
|
write(")");
|
|
argumentsWritten++;
|
|
}
|
|
if (shouldEmitParamTypesMetadata(node)) {
|
|
if (writeComma || argumentsWritten) {
|
|
write(", ");
|
|
}
|
|
writeLine();
|
|
write("__metadata('design:paramtypes', [");
|
|
emitSerializedParameterTypesOfNode(node);
|
|
write("])");
|
|
argumentsWritten++;
|
|
}
|
|
if (shouldEmitReturnTypeMetadata(node)) {
|
|
if (writeComma || argumentsWritten) {
|
|
write(", ");
|
|
}
|
|
writeLine();
|
|
write("__metadata('design:returntype', ");
|
|
emitSerializedReturnTypeOfNode(node);
|
|
write(")");
|
|
argumentsWritten++;
|
|
}
|
|
}
|
|
return argumentsWritten;
|
|
}
|
|
function emitInterfaceDeclaration(node) {
|
|
emitOnlyPinnedOrTripleSlashComments(node);
|
|
}
|
|
function shouldEmitEnumDeclaration(node) {
|
|
var isConstEnum = ts.isConst(node);
|
|
return !isConstEnum || compilerOptions.preserveConstEnums || compilerOptions.isolatedModules;
|
|
}
|
|
function emitEnumDeclaration(node) {
|
|
// const enums are completely erased during compilation.
|
|
if (!shouldEmitEnumDeclaration(node)) {
|
|
return;
|
|
}
|
|
if (!shouldHoistDeclarationInSystemJsModule(node)) {
|
|
// do not emit var if variable was already hoisted
|
|
if (!(node.flags & 1 /* Export */) || isES6ExportedDeclaration(node)) {
|
|
emitStart(node);
|
|
if (isES6ExportedDeclaration(node)) {
|
|
write("export ");
|
|
}
|
|
write("var ");
|
|
emit(node.name);
|
|
emitEnd(node);
|
|
write(";");
|
|
}
|
|
}
|
|
writeLine();
|
|
emitStart(node);
|
|
write("(function (");
|
|
emitStart(node.name);
|
|
write(getGeneratedNameForNode(node));
|
|
emitEnd(node.name);
|
|
write(") {");
|
|
increaseIndent();
|
|
scopeEmitStart(node);
|
|
emitLines(node.members);
|
|
decreaseIndent();
|
|
writeLine();
|
|
emitToken(15 /* CloseBraceToken */, node.members.end);
|
|
scopeEmitEnd();
|
|
write(")(");
|
|
emitModuleMemberName(node);
|
|
write(" || (");
|
|
emitModuleMemberName(node);
|
|
write(" = {}));");
|
|
emitEnd(node);
|
|
if (!isES6ExportedDeclaration(node) && node.flags & 1 /* Export */ && !shouldHoistDeclarationInSystemJsModule(node)) {
|
|
// do not emit var if variable was already hoisted
|
|
writeLine();
|
|
emitStart(node);
|
|
write("var ");
|
|
emit(node.name);
|
|
write(" = ");
|
|
emitModuleMemberName(node);
|
|
emitEnd(node);
|
|
write(";");
|
|
}
|
|
if (languageVersion < 2 /* ES6 */ && node.parent === currentSourceFile) {
|
|
if (compilerOptions.module === 4 /* System */ && (node.flags & 1 /* Export */)) {
|
|
// write the call to exporter for enum
|
|
writeLine();
|
|
write(exportFunctionForFile + "(\"");
|
|
emitDeclarationName(node);
|
|
write("\", ");
|
|
emitDeclarationName(node);
|
|
write(");");
|
|
}
|
|
emitExportMemberAssignments(node.name);
|
|
}
|
|
}
|
|
function emitEnumMember(node) {
|
|
var enumParent = node.parent;
|
|
emitStart(node);
|
|
write(getGeneratedNameForNode(enumParent));
|
|
write("[");
|
|
write(getGeneratedNameForNode(enumParent));
|
|
write("[");
|
|
emitExpressionForPropertyName(node.name);
|
|
write("] = ");
|
|
writeEnumMemberDeclarationValue(node);
|
|
write("] = ");
|
|
emitExpressionForPropertyName(node.name);
|
|
emitEnd(node);
|
|
write(";");
|
|
}
|
|
function writeEnumMemberDeclarationValue(member) {
|
|
var value = resolver.getConstantValue(member);
|
|
if (value !== undefined) {
|
|
write(value.toString());
|
|
return;
|
|
}
|
|
else if (member.initializer) {
|
|
emit(member.initializer);
|
|
}
|
|
else {
|
|
write("undefined");
|
|
}
|
|
}
|
|
function getInnerMostModuleDeclarationFromDottedModule(moduleDeclaration) {
|
|
if (moduleDeclaration.body.kind === 215 /* ModuleDeclaration */) {
|
|
var recursiveInnerModule = getInnerMostModuleDeclarationFromDottedModule(moduleDeclaration.body);
|
|
return recursiveInnerModule || moduleDeclaration.body;
|
|
}
|
|
}
|
|
function shouldEmitModuleDeclaration(node) {
|
|
return ts.isInstantiatedModule(node, compilerOptions.preserveConstEnums || compilerOptions.isolatedModules);
|
|
}
|
|
function isModuleMergedWithES6Class(node) {
|
|
return languageVersion === 2 /* ES6 */ && !!(resolver.getNodeCheckFlags(node) & 32768 /* LexicalModuleMergesWithClass */);
|
|
}
|
|
function emitModuleDeclaration(node) {
|
|
// Emit only if this module is non-ambient.
|
|
var shouldEmit = shouldEmitModuleDeclaration(node);
|
|
if (!shouldEmit) {
|
|
return emitOnlyPinnedOrTripleSlashComments(node);
|
|
}
|
|
var hoistedInDeclarationScope = shouldHoistDeclarationInSystemJsModule(node);
|
|
var emitVarForModule = !hoistedInDeclarationScope && !isModuleMergedWithES6Class(node);
|
|
if (emitVarForModule) {
|
|
emitStart(node);
|
|
if (isES6ExportedDeclaration(node)) {
|
|
write("export ");
|
|
}
|
|
write("var ");
|
|
emit(node.name);
|
|
write(";");
|
|
emitEnd(node);
|
|
writeLine();
|
|
}
|
|
emitStart(node);
|
|
write("(function (");
|
|
emitStart(node.name);
|
|
write(getGeneratedNameForNode(node));
|
|
emitEnd(node.name);
|
|
write(") ");
|
|
if (node.body.kind === 216 /* ModuleBlock */) {
|
|
var saveTempFlags = tempFlags;
|
|
var saveTempVariables = tempVariables;
|
|
tempFlags = 0;
|
|
tempVariables = undefined;
|
|
emit(node.body);
|
|
tempFlags = saveTempFlags;
|
|
tempVariables = saveTempVariables;
|
|
}
|
|
else {
|
|
write("{");
|
|
increaseIndent();
|
|
scopeEmitStart(node);
|
|
emitCaptureThisForNodeIfNecessary(node);
|
|
writeLine();
|
|
emit(node.body);
|
|
decreaseIndent();
|
|
writeLine();
|
|
var moduleBlock = getInnerMostModuleDeclarationFromDottedModule(node).body;
|
|
emitToken(15 /* CloseBraceToken */, moduleBlock.statements.end);
|
|
scopeEmitEnd();
|
|
}
|
|
write(")(");
|
|
// write moduleDecl = containingModule.m only if it is not exported es6 module member
|
|
if ((node.flags & 1 /* Export */) && !isES6ExportedDeclaration(node)) {
|
|
emit(node.name);
|
|
write(" = ");
|
|
}
|
|
emitModuleMemberName(node);
|
|
write(" || (");
|
|
emitModuleMemberName(node);
|
|
write(" = {}));");
|
|
emitEnd(node);
|
|
if (!isES6ExportedDeclaration(node) && node.name.kind === 66 /* Identifier */ && node.parent === currentSourceFile) {
|
|
if (compilerOptions.module === 4 /* System */ && (node.flags & 1 /* Export */)) {
|
|
writeLine();
|
|
write(exportFunctionForFile + "(\"");
|
|
emitDeclarationName(node);
|
|
write("\", ");
|
|
emitDeclarationName(node);
|
|
write(");");
|
|
}
|
|
emitExportMemberAssignments(node.name);
|
|
}
|
|
}
|
|
function emitRequire(moduleName) {
|
|
if (moduleName.kind === 8 /* StringLiteral */) {
|
|
write("require(");
|
|
emitStart(moduleName);
|
|
emitLiteral(moduleName);
|
|
emitEnd(moduleName);
|
|
emitToken(17 /* CloseParenToken */, moduleName.end);
|
|
}
|
|
else {
|
|
write("require()");
|
|
}
|
|
}
|
|
function getNamespaceDeclarationNode(node) {
|
|
if (node.kind === 218 /* ImportEqualsDeclaration */) {
|
|
return node;
|
|
}
|
|
var importClause = node.importClause;
|
|
if (importClause && importClause.namedBindings && importClause.namedBindings.kind === 221 /* NamespaceImport */) {
|
|
return importClause.namedBindings;
|
|
}
|
|
}
|
|
function isDefaultImport(node) {
|
|
return node.kind === 219 /* ImportDeclaration */ && node.importClause && !!node.importClause.name;
|
|
}
|
|
function emitExportImportAssignments(node) {
|
|
if (ts.isAliasSymbolDeclaration(node) && resolver.isValueAliasDeclaration(node)) {
|
|
emitExportMemberAssignments(node.name);
|
|
}
|
|
ts.forEachChild(node, emitExportImportAssignments);
|
|
}
|
|
function emitImportDeclaration(node) {
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
return emitExternalImportDeclaration(node);
|
|
}
|
|
// ES6 import
|
|
if (node.importClause) {
|
|
var shouldEmitDefaultBindings = resolver.isReferencedAliasDeclaration(node.importClause);
|
|
var shouldEmitNamedBindings = node.importClause.namedBindings && resolver.isReferencedAliasDeclaration(node.importClause.namedBindings, true);
|
|
if (shouldEmitDefaultBindings || shouldEmitNamedBindings) {
|
|
write("import ");
|
|
emitStart(node.importClause);
|
|
if (shouldEmitDefaultBindings) {
|
|
emit(node.importClause.name);
|
|
if (shouldEmitNamedBindings) {
|
|
write(", ");
|
|
}
|
|
}
|
|
if (shouldEmitNamedBindings) {
|
|
emitLeadingComments(node.importClause.namedBindings);
|
|
emitStart(node.importClause.namedBindings);
|
|
if (node.importClause.namedBindings.kind === 221 /* NamespaceImport */) {
|
|
write("* as ");
|
|
emit(node.importClause.namedBindings.name);
|
|
}
|
|
else {
|
|
write("{ ");
|
|
emitExportOrImportSpecifierList(node.importClause.namedBindings.elements, resolver.isReferencedAliasDeclaration);
|
|
write(" }");
|
|
}
|
|
emitEnd(node.importClause.namedBindings);
|
|
emitTrailingComments(node.importClause.namedBindings);
|
|
}
|
|
emitEnd(node.importClause);
|
|
write(" from ");
|
|
emit(node.moduleSpecifier);
|
|
write(";");
|
|
}
|
|
}
|
|
else {
|
|
write("import ");
|
|
emit(node.moduleSpecifier);
|
|
write(";");
|
|
}
|
|
}
|
|
function emitExternalImportDeclaration(node) {
|
|
if (ts.contains(externalImports, node)) {
|
|
var isExportedImport = node.kind === 218 /* ImportEqualsDeclaration */ && (node.flags & 1 /* Export */) !== 0;
|
|
var namespaceDeclaration = getNamespaceDeclarationNode(node);
|
|
if (compilerOptions.module !== 2 /* AMD */) {
|
|
emitLeadingComments(node);
|
|
emitStart(node);
|
|
if (namespaceDeclaration && !isDefaultImport(node)) {
|
|
// import x = require("foo")
|
|
// import * as x from "foo"
|
|
if (!isExportedImport)
|
|
write("var ");
|
|
emitModuleMemberName(namespaceDeclaration);
|
|
write(" = ");
|
|
}
|
|
else {
|
|
// import "foo"
|
|
// import x from "foo"
|
|
// import { x, y } from "foo"
|
|
// import d, * as x from "foo"
|
|
// import d, { x, y } from "foo"
|
|
var isNakedImport = 219 /* ImportDeclaration */ && !node.importClause;
|
|
if (!isNakedImport) {
|
|
write("var ");
|
|
write(getGeneratedNameForNode(node));
|
|
write(" = ");
|
|
}
|
|
}
|
|
emitRequire(ts.getExternalModuleName(node));
|
|
if (namespaceDeclaration && isDefaultImport(node)) {
|
|
// import d, * as x from "foo"
|
|
write(", ");
|
|
emitModuleMemberName(namespaceDeclaration);
|
|
write(" = ");
|
|
write(getGeneratedNameForNode(node));
|
|
}
|
|
write(";");
|
|
emitEnd(node);
|
|
emitExportImportAssignments(node);
|
|
emitTrailingComments(node);
|
|
}
|
|
else {
|
|
if (isExportedImport) {
|
|
emitModuleMemberName(namespaceDeclaration);
|
|
write(" = ");
|
|
emit(namespaceDeclaration.name);
|
|
write(";");
|
|
}
|
|
else if (namespaceDeclaration && isDefaultImport(node)) {
|
|
// import d, * as x from "foo"
|
|
write("var ");
|
|
emitModuleMemberName(namespaceDeclaration);
|
|
write(" = ");
|
|
write(getGeneratedNameForNode(node));
|
|
write(";");
|
|
}
|
|
emitExportImportAssignments(node);
|
|
}
|
|
}
|
|
}
|
|
function emitImportEqualsDeclaration(node) {
|
|
if (ts.isExternalModuleImportEqualsDeclaration(node)) {
|
|
emitExternalImportDeclaration(node);
|
|
return;
|
|
}
|
|
// 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
|
|
if (resolver.isReferencedAliasDeclaration(node) ||
|
|
(!ts.isExternalModule(currentSourceFile) && resolver.isTopLevelValueImportEqualsWithEntityName(node))) {
|
|
emitLeadingComments(node);
|
|
emitStart(node);
|
|
if (isES6ExportedDeclaration(node)) {
|
|
write("export ");
|
|
write("var ");
|
|
}
|
|
else if (!(node.flags & 1 /* Export */)) {
|
|
write("var ");
|
|
}
|
|
emitModuleMemberName(node);
|
|
write(" = ");
|
|
emit(node.moduleReference);
|
|
write(";");
|
|
emitEnd(node);
|
|
emitExportImportAssignments(node);
|
|
emitTrailingComments(node);
|
|
}
|
|
}
|
|
function emitExportDeclaration(node) {
|
|
ts.Debug.assert(compilerOptions.module !== 4 /* System */);
|
|
if (languageVersion < 2 /* ES6 */) {
|
|
if (node.moduleSpecifier && (!node.exportClause || resolver.isValueAliasDeclaration(node))) {
|
|
emitStart(node);
|
|
var generatedName = getGeneratedNameForNode(node);
|
|
if (node.exportClause) {
|
|
// export { x, y, ... } from "foo"
|
|
if (compilerOptions.module !== 2 /* AMD */) {
|
|
write("var ");
|
|
write(generatedName);
|
|
write(" = ");
|
|
emitRequire(ts.getExternalModuleName(node));
|
|
write(";");
|
|
}
|
|
for (var _a = 0, _b = node.exportClause.elements; _a < _b.length; _a++) {
|
|
var specifier = _b[_a];
|
|
if (resolver.isValueAliasDeclaration(specifier)) {
|
|
writeLine();
|
|
emitStart(specifier);
|
|
emitContainingModuleName(specifier);
|
|
write(".");
|
|
emitNodeWithoutSourceMap(specifier.name);
|
|
write(" = ");
|
|
write(generatedName);
|
|
write(".");
|
|
emitNodeWithoutSourceMap(specifier.propertyName || specifier.name);
|
|
write(";");
|
|
emitEnd(specifier);
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
// export * from "foo"
|
|
writeLine();
|
|
write("__export(");
|
|
if (compilerOptions.module !== 2 /* AMD */) {
|
|
emitRequire(ts.getExternalModuleName(node));
|
|
}
|
|
else {
|
|
write(generatedName);
|
|
}
|
|
write(");");
|
|
}
|
|
emitEnd(node);
|
|
}
|
|
}
|
|
else {
|
|
if (!node.exportClause || resolver.isValueAliasDeclaration(node)) {
|
|
emitStart(node);
|
|
write("export ");
|
|
if (node.exportClause) {
|
|
// export { x, y, ... }
|
|
write("{ ");
|
|
emitExportOrImportSpecifierList(node.exportClause.elements, resolver.isValueAliasDeclaration);
|
|
write(" }");
|
|
}
|
|
else {
|
|
write("*");
|
|
}
|
|
if (node.moduleSpecifier) {
|
|
write(" from ");
|
|
emitNodeWithoutSourceMap(node.moduleSpecifier);
|
|
}
|
|
write(";");
|
|
emitEnd(node);
|
|
}
|
|
}
|
|
}
|
|
function emitExportOrImportSpecifierList(specifiers, shouldEmit) {
|
|
ts.Debug.assert(languageVersion >= 2 /* ES6 */);
|
|
var needsComma = false;
|
|
for (var _a = 0; _a < specifiers.length; _a++) {
|
|
var specifier = specifiers[_a];
|
|
if (shouldEmit(specifier)) {
|
|
if (needsComma) {
|
|
write(", ");
|
|
}
|
|
emitStart(specifier);
|
|
if (specifier.propertyName) {
|
|
emitNodeWithoutSourceMap(specifier.propertyName);
|
|
write(" as ");
|
|
}
|
|
emitNodeWithoutSourceMap(specifier.name);
|
|
emitEnd(specifier);
|
|
needsComma = true;
|
|
}
|
|
}
|
|
}
|
|
function emitExportAssignment(node) {
|
|
if (!node.isExportEquals && resolver.isValueAliasDeclaration(node)) {
|
|
if (languageVersion >= 2 /* ES6 */) {
|
|
writeLine();
|
|
emitStart(node);
|
|
write("export default ");
|
|
var expression = node.expression;
|
|
emit(expression);
|
|
if (expression.kind !== 210 /* FunctionDeclaration */ &&
|
|
expression.kind !== 211 /* ClassDeclaration */) {
|
|
write(";");
|
|
}
|
|
emitEnd(node);
|
|
}
|
|
else {
|
|
writeLine();
|
|
emitStart(node);
|
|
if (compilerOptions.module === 4 /* System */) {
|
|
write(exportFunctionForFile + "(\"default\",");
|
|
emit(node.expression);
|
|
write(")");
|
|
}
|
|
else {
|
|
emitContainingModuleName(node);
|
|
if (languageVersion === 0 /* ES3 */) {
|
|
write("[\"default\"] = ");
|
|
}
|
|
else {
|
|
write(".default = ");
|
|
}
|
|
emit(node.expression);
|
|
}
|
|
write(";");
|
|
emitEnd(node);
|
|
}
|
|
}
|
|
}
|
|
function collectExternalModuleInfo(sourceFile) {
|
|
externalImports = [];
|
|
exportSpecifiers = {};
|
|
exportEquals = undefined;
|
|
hasExportStars = false;
|
|
for (var _a = 0, _b = sourceFile.statements; _a < _b.length; _a++) {
|
|
var node = _b[_a];
|
|
switch (node.kind) {
|
|
case 219 /* ImportDeclaration */:
|
|
if (!node.importClause ||
|
|
resolver.isReferencedAliasDeclaration(node.importClause, true)) {
|
|
// import "mod"
|
|
// import x from "mod" where x is referenced
|
|
// import * as x from "mod" where x is referenced
|
|
// import { x, y } from "mod" where at least one import is referenced
|
|
externalImports.push(node);
|
|
}
|
|
break;
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
if (node.moduleReference.kind === 229 /* ExternalModuleReference */ && resolver.isReferencedAliasDeclaration(node)) {
|
|
// import x = require("mod") where x is referenced
|
|
externalImports.push(node);
|
|
}
|
|
break;
|
|
case 225 /* ExportDeclaration */:
|
|
if (node.moduleSpecifier) {
|
|
if (!node.exportClause) {
|
|
// export * from "mod"
|
|
externalImports.push(node);
|
|
hasExportStars = true;
|
|
}
|
|
else if (resolver.isValueAliasDeclaration(node)) {
|
|
// export { x, y } from "mod" where at least one export is a value symbol
|
|
externalImports.push(node);
|
|
}
|
|
}
|
|
else {
|
|
// export { x, y }
|
|
for (var _c = 0, _d = node.exportClause.elements; _c < _d.length; _c++) {
|
|
var specifier = _d[_c];
|
|
var name_24 = (specifier.propertyName || specifier.name).text;
|
|
(exportSpecifiers[name_24] || (exportSpecifiers[name_24] = [])).push(specifier);
|
|
}
|
|
}
|
|
break;
|
|
case 224 /* ExportAssignment */:
|
|
if (node.isExportEquals && !exportEquals) {
|
|
// export = x
|
|
exportEquals = node;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
function emitExportStarHelper() {
|
|
if (hasExportStars) {
|
|
writeLine();
|
|
write("function __export(m) {");
|
|
increaseIndent();
|
|
writeLine();
|
|
write("for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];");
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("}");
|
|
}
|
|
}
|
|
function getLocalNameForExternalImport(node) {
|
|
var namespaceDeclaration = getNamespaceDeclarationNode(node);
|
|
if (namespaceDeclaration && !isDefaultImport(node)) {
|
|
return ts.getSourceTextOfNodeFromSourceFile(currentSourceFile, namespaceDeclaration.name);
|
|
}
|
|
if (node.kind === 219 /* ImportDeclaration */ && node.importClause) {
|
|
return getGeneratedNameForNode(node);
|
|
}
|
|
if (node.kind === 225 /* ExportDeclaration */ && node.moduleSpecifier) {
|
|
return getGeneratedNameForNode(node);
|
|
}
|
|
}
|
|
function getExternalModuleNameText(importNode) {
|
|
var moduleName = ts.getExternalModuleName(importNode);
|
|
if (moduleName.kind === 8 /* StringLiteral */) {
|
|
return getLiteralText(moduleName);
|
|
}
|
|
return undefined;
|
|
}
|
|
function emitVariableDeclarationsForImports() {
|
|
if (externalImports.length === 0) {
|
|
return;
|
|
}
|
|
writeLine();
|
|
var started = false;
|
|
for (var _a = 0; _a < externalImports.length; _a++) {
|
|
var importNode = externalImports[_a];
|
|
// do not create variable declaration for exports and imports that lack import clause
|
|
var skipNode = importNode.kind === 225 /* ExportDeclaration */ ||
|
|
(importNode.kind === 219 /* ImportDeclaration */ && !importNode.importClause);
|
|
if (skipNode) {
|
|
continue;
|
|
}
|
|
if (!started) {
|
|
write("var ");
|
|
started = true;
|
|
}
|
|
else {
|
|
write(", ");
|
|
}
|
|
write(getLocalNameForExternalImport(importNode));
|
|
}
|
|
if (started) {
|
|
write(";");
|
|
}
|
|
}
|
|
function emitLocalStorageForExportedNamesIfNecessary(exportedDeclarations) {
|
|
// 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.
|
|
if (!hasExportStars) {
|
|
// local names set is needed only in presence of star exports
|
|
return undefined;
|
|
}
|
|
// local names set should only be added if we have anything exported
|
|
if (!exportedDeclarations && ts.isEmpty(exportSpecifiers)) {
|
|
// no exported declarations (export var ...) or export specifiers (export {x})
|
|
// check if we have any non star export declarations.
|
|
var hasExportDeclarationWithExportClause = false;
|
|
for (var _a = 0; _a < externalImports.length; _a++) {
|
|
var externalImport = externalImports[_a];
|
|
if (externalImport.kind === 225 /* ExportDeclaration */ && externalImport.exportClause) {
|
|
hasExportDeclarationWithExportClause = true;
|
|
break;
|
|
}
|
|
}
|
|
if (!hasExportDeclarationWithExportClause) {
|
|
// we still need to emit exportStar helper
|
|
return emitExportStarFunction(undefined);
|
|
}
|
|
}
|
|
var exportedNamesStorageRef = makeUniqueName("exportedNames");
|
|
writeLine();
|
|
write("var " + exportedNamesStorageRef + " = {");
|
|
increaseIndent();
|
|
var started = false;
|
|
if (exportedDeclarations) {
|
|
for (var i = 0; i < exportedDeclarations.length; ++i) {
|
|
// write name of exported declaration, i.e 'export var x...'
|
|
writeExportedName(exportedDeclarations[i]);
|
|
}
|
|
}
|
|
if (exportSpecifiers) {
|
|
for (var n in exportSpecifiers) {
|
|
for (var _b = 0, _c = exportSpecifiers[n]; _b < _c.length; _b++) {
|
|
var specifier = _c[_b];
|
|
// write name of export specified, i.e. 'export {x}'
|
|
writeExportedName(specifier.name);
|
|
}
|
|
}
|
|
}
|
|
for (var _d = 0; _d < externalImports.length; _d++) {
|
|
var externalImport = externalImports[_d];
|
|
if (externalImport.kind !== 225 /* ExportDeclaration */) {
|
|
continue;
|
|
}
|
|
var exportDecl = externalImport;
|
|
if (!exportDecl.exportClause) {
|
|
// export * from ...
|
|
continue;
|
|
}
|
|
for (var _e = 0, _f = exportDecl.exportClause.elements; _e < _f.length; _e++) {
|
|
var element = _f[_e];
|
|
// write name of indirectly exported entry, i.e. 'export {x} from ...'
|
|
writeExportedName(element.name || element.propertyName);
|
|
}
|
|
}
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("};");
|
|
return emitExportStarFunction(exportedNamesStorageRef);
|
|
function emitExportStarFunction(localNames) {
|
|
var exportStarFunction = makeUniqueName("exportStar");
|
|
writeLine();
|
|
// define an export star helper function
|
|
write("function " + exportStarFunction + "(m) {");
|
|
increaseIndent();
|
|
writeLine();
|
|
write("for(var n in m) {");
|
|
increaseIndent();
|
|
writeLine();
|
|
write("if (n !== \"default\"");
|
|
if (localNames) {
|
|
write("&& !" + localNames + ".hasOwnProperty(n)");
|
|
}
|
|
write(") " + exportFunctionForFile + "(n, m[n]);");
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("}");
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("}");
|
|
return exportStarFunction;
|
|
}
|
|
function writeExportedName(node) {
|
|
// do not record default exports
|
|
// they are local to module and never overwritten (explicitly skipped) by star export
|
|
if (node.kind !== 66 /* Identifier */ && node.flags & 1024 /* Default */) {
|
|
return;
|
|
}
|
|
if (started) {
|
|
write(",");
|
|
}
|
|
else {
|
|
started = true;
|
|
}
|
|
writeLine();
|
|
write("'");
|
|
if (node.kind === 66 /* Identifier */) {
|
|
emitNodeWithoutSourceMap(node);
|
|
}
|
|
else {
|
|
emitDeclarationName(node);
|
|
}
|
|
write("': true");
|
|
}
|
|
}
|
|
function processTopLevelVariableAndFunctionDeclarations(node) {
|
|
// per ES6 spec:
|
|
// 15.2.1.16.4 ModuleDeclarationInstantiation() Concrete Method
|
|
// - var declarations are initialized to undefined - 14.a.ii
|
|
// - function/generator declarations are instantiated - 16.a.iv
|
|
// this means that after module is instantiated but before its evaluation
|
|
// exported functions are already accessible at import sites
|
|
// in theory we should hoist only exported functions and its dependencies
|
|
// in practice to simplify things we'll hoist all source level functions and variable declaration
|
|
// including variables declarations for module and class declarations
|
|
var hoistedVars;
|
|
var hoistedFunctionDeclarations;
|
|
var exportedDeclarations;
|
|
visit(node);
|
|
if (hoistedVars) {
|
|
writeLine();
|
|
write("var ");
|
|
var seen = {};
|
|
for (var i = 0; i < hoistedVars.length; ++i) {
|
|
var local = hoistedVars[i];
|
|
var name_25 = local.kind === 66 /* Identifier */
|
|
? local
|
|
: local.name;
|
|
if (name_25) {
|
|
// do not emit duplicate entries (in case of declaration merging) in the list of hoisted variables
|
|
var text = ts.unescapeIdentifier(name_25.text);
|
|
if (ts.hasProperty(seen, text)) {
|
|
continue;
|
|
}
|
|
else {
|
|
seen[text] = text;
|
|
}
|
|
}
|
|
if (i !== 0) {
|
|
write(", ");
|
|
}
|
|
if (local.kind === 211 /* ClassDeclaration */ || local.kind === 215 /* ModuleDeclaration */ || local.kind === 214 /* EnumDeclaration */) {
|
|
emitDeclarationName(local);
|
|
}
|
|
else {
|
|
emit(local);
|
|
}
|
|
var flags = ts.getCombinedNodeFlags(local.kind === 66 /* Identifier */ ? local.parent : local);
|
|
if (flags & 1 /* Export */) {
|
|
if (!exportedDeclarations) {
|
|
exportedDeclarations = [];
|
|
}
|
|
exportedDeclarations.push(local);
|
|
}
|
|
}
|
|
write(";");
|
|
}
|
|
if (hoistedFunctionDeclarations) {
|
|
for (var _a = 0; _a < hoistedFunctionDeclarations.length; _a++) {
|
|
var f = hoistedFunctionDeclarations[_a];
|
|
writeLine();
|
|
emit(f);
|
|
if (f.flags & 1 /* Export */) {
|
|
if (!exportedDeclarations) {
|
|
exportedDeclarations = [];
|
|
}
|
|
exportedDeclarations.push(f);
|
|
}
|
|
}
|
|
}
|
|
return exportedDeclarations;
|
|
function visit(node) {
|
|
if (node.flags & 2 /* Ambient */) {
|
|
return;
|
|
}
|
|
if (node.kind === 210 /* FunctionDeclaration */) {
|
|
if (!hoistedFunctionDeclarations) {
|
|
hoistedFunctionDeclarations = [];
|
|
}
|
|
hoistedFunctionDeclarations.push(node);
|
|
return;
|
|
}
|
|
if (node.kind === 211 /* ClassDeclaration */) {
|
|
if (!hoistedVars) {
|
|
hoistedVars = [];
|
|
}
|
|
hoistedVars.push(node);
|
|
return;
|
|
}
|
|
if (node.kind === 214 /* EnumDeclaration */) {
|
|
if (shouldEmitEnumDeclaration(node)) {
|
|
if (!hoistedVars) {
|
|
hoistedVars = [];
|
|
}
|
|
hoistedVars.push(node);
|
|
}
|
|
return;
|
|
}
|
|
if (node.kind === 215 /* ModuleDeclaration */) {
|
|
if (shouldEmitModuleDeclaration(node)) {
|
|
if (!hoistedVars) {
|
|
hoistedVars = [];
|
|
}
|
|
hoistedVars.push(node);
|
|
}
|
|
return;
|
|
}
|
|
if (node.kind === 208 /* VariableDeclaration */ || node.kind === 160 /* BindingElement */) {
|
|
if (shouldHoistVariable(node, false)) {
|
|
var name_26 = node.name;
|
|
if (name_26.kind === 66 /* Identifier */) {
|
|
if (!hoistedVars) {
|
|
hoistedVars = [];
|
|
}
|
|
hoistedVars.push(name_26);
|
|
}
|
|
else {
|
|
ts.forEachChild(name_26, visit);
|
|
}
|
|
}
|
|
return;
|
|
}
|
|
if (ts.isBindingPattern(node)) {
|
|
ts.forEach(node.elements, visit);
|
|
return;
|
|
}
|
|
if (!ts.isDeclaration(node)) {
|
|
ts.forEachChild(node, visit);
|
|
}
|
|
}
|
|
}
|
|
function shouldHoistVariable(node, checkIfSourceFileLevelDecl) {
|
|
if (checkIfSourceFileLevelDecl && !shouldHoistDeclarationInSystemJsModule(node)) {
|
|
return false;
|
|
}
|
|
// hoist variable if
|
|
// - it is not block scoped
|
|
// - it is top level block scoped
|
|
// if block scoped variables are nested in some another block then
|
|
// no other functions can use them except ones that are defined at least in the same block
|
|
return (ts.getCombinedNodeFlags(node) & 49152 /* BlockScoped */) === 0 ||
|
|
ts.getEnclosingBlockScopeContainer(node).kind === 245 /* SourceFile */;
|
|
}
|
|
function isCurrentFileSystemExternalModule() {
|
|
return compilerOptions.module === 4 /* System */ && ts.isExternalModule(currentSourceFile);
|
|
}
|
|
function emitSystemModuleBody(node, startIndex) {
|
|
// shape of the body in system modules:
|
|
// function (exports) {
|
|
// <list of local aliases for imports>
|
|
// <hoisted function declarations>
|
|
// <hoisted variable 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) {
|
|
// var file1; // local alias
|
|
// var y;
|
|
// function foo() { return y + file1.x(); }
|
|
// exports("foo", foo);
|
|
// return {
|
|
// setters: [
|
|
// function(v) { file1 = v }
|
|
// ],
|
|
// execute(): function() {
|
|
// y = 1;
|
|
// console.log(y);
|
|
// }
|
|
// };
|
|
// }
|
|
emitVariableDeclarationsForImports();
|
|
writeLine();
|
|
var exportedDeclarations = processTopLevelVariableAndFunctionDeclarations(node);
|
|
var exportStarFunction = emitLocalStorageForExportedNamesIfNecessary(exportedDeclarations);
|
|
writeLine();
|
|
write("return {");
|
|
increaseIndent();
|
|
writeLine();
|
|
emitSetters(exportStarFunction);
|
|
writeLine();
|
|
emitExecute(node, startIndex);
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("}"); // return
|
|
emitTempDeclarations(true);
|
|
}
|
|
function emitSetters(exportStarFunction) {
|
|
write("setters:[");
|
|
for (var i = 0; i < externalImports.length; ++i) {
|
|
if (i !== 0) {
|
|
write(",");
|
|
}
|
|
writeLine();
|
|
increaseIndent();
|
|
var importNode = externalImports[i];
|
|
var importVariableName = getLocalNameForExternalImport(importNode) || "";
|
|
var parameterName = "_" + importVariableName;
|
|
write("function (" + parameterName + ") {");
|
|
switch (importNode.kind) {
|
|
case 219 /* ImportDeclaration */:
|
|
if (!importNode.importClause) {
|
|
// 'import "..."' case
|
|
// module is imported only for side-effects, setter body will be empty
|
|
break;
|
|
}
|
|
// fall-through
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
ts.Debug.assert(importVariableName !== "");
|
|
increaseIndent();
|
|
writeLine();
|
|
// save import into the local
|
|
write(importVariableName + " = " + parameterName + ";");
|
|
writeLine();
|
|
var defaultName = importNode.kind === 219 /* ImportDeclaration */
|
|
? importNode.importClause.name
|
|
: importNode.name;
|
|
if (defaultName) {
|
|
// emit re-export for imported default name
|
|
// import n1 from 'foo1'
|
|
// import n2 = require('foo2')
|
|
// export {n1}
|
|
// export {n2}
|
|
emitExportMemberAssignments(defaultName);
|
|
writeLine();
|
|
}
|
|
if (importNode.kind === 219 /* ImportDeclaration */ &&
|
|
importNode.importClause.namedBindings) {
|
|
var namedBindings = importNode.importClause.namedBindings;
|
|
if (namedBindings.kind === 221 /* NamespaceImport */) {
|
|
// emit re-export for namespace
|
|
// import * as n from 'foo'
|
|
// export {n}
|
|
emitExportMemberAssignments(namedBindings.name);
|
|
writeLine();
|
|
}
|
|
else {
|
|
// emit re-exports for named imports
|
|
// import {a, b} from 'foo'
|
|
// export {a, b as c}
|
|
for (var _a = 0, _b = namedBindings.elements; _a < _b.length; _a++) {
|
|
var element = _b[_a];
|
|
emitExportMemberAssignments(element.name || element.propertyName);
|
|
writeLine();
|
|
}
|
|
}
|
|
}
|
|
decreaseIndent();
|
|
break;
|
|
case 225 /* ExportDeclaration */:
|
|
ts.Debug.assert(importVariableName !== "");
|
|
increaseIndent();
|
|
if (importNode.exportClause) {
|
|
// export {a, b as c} from 'foo'
|
|
// emit as:
|
|
// exports('a', _foo["a"])
|
|
// exports('c', _foo["b"])
|
|
for (var _c = 0, _d = importNode.exportClause.elements; _c < _d.length; _c++) {
|
|
var e = _d[_c];
|
|
writeLine();
|
|
write(exportFunctionForFile + "(\"");
|
|
emitNodeWithoutSourceMap(e.name);
|
|
write("\", " + parameterName + "[\"");
|
|
emitNodeWithoutSourceMap(e.propertyName || e.name);
|
|
write("\"]);");
|
|
}
|
|
}
|
|
else {
|
|
writeLine();
|
|
// export * from 'foo'
|
|
// emit as:
|
|
// exportStar(_foo);
|
|
write(exportStarFunction + "(" + parameterName + ");");
|
|
}
|
|
writeLine();
|
|
decreaseIndent();
|
|
break;
|
|
}
|
|
write("}");
|
|
decreaseIndent();
|
|
}
|
|
write("],");
|
|
}
|
|
function emitExecute(node, startIndex) {
|
|
write("execute: function() {");
|
|
increaseIndent();
|
|
writeLine();
|
|
for (var i = startIndex; i < node.statements.length; ++i) {
|
|
var statement = node.statements[i];
|
|
// - imports/exports are not emitted for system modules
|
|
// - function declarations are not emitted because they were already hoisted
|
|
switch (statement.kind) {
|
|
case 225 /* ExportDeclaration */:
|
|
case 219 /* ImportDeclaration */:
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 210 /* FunctionDeclaration */:
|
|
continue;
|
|
}
|
|
writeLine();
|
|
emit(statement);
|
|
}
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("}"); // execute
|
|
}
|
|
function emitSystemModule(node, startIndex) {
|
|
collectExternalModuleInfo(node);
|
|
// System modules has the following shape
|
|
// System.register(['dep-1', ... 'dep-n'], function(exports) {/* module body function */})
|
|
// 'exports' here is a function 'exports<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 'emitPostfixUnaryExpression' for more details
|
|
ts.Debug.assert(!exportFunctionForFile);
|
|
// make sure that name of 'exports' function does not conflict with existing identifiers
|
|
exportFunctionForFile = makeUniqueName("exports");
|
|
writeLine();
|
|
write("System.register(");
|
|
if (node.moduleName) {
|
|
write("\"" + node.moduleName + "\", ");
|
|
}
|
|
write("[");
|
|
for (var i = 0; i < externalImports.length; ++i) {
|
|
var text = getExternalModuleNameText(externalImports[i]);
|
|
if (i !== 0) {
|
|
write(", ");
|
|
}
|
|
write(text);
|
|
}
|
|
write("], function(" + exportFunctionForFile + ") {");
|
|
writeLine();
|
|
increaseIndent();
|
|
emitCaptureThisForNodeIfNecessary(node);
|
|
emitSystemModuleBody(node, startIndex);
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("});");
|
|
}
|
|
function emitAMDDependencies(node, includeNonAmdDependencies) {
|
|
// An AMD define function has the following shape:
|
|
// define(id?, dependencies?, factory);
|
|
//
|
|
// This has the shape of
|
|
// 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
|
|
// names of modules with corresponding parameter in the factory function
|
|
var aliasedModuleNames = [];
|
|
// names of modules with no corresponding parameters in factory function
|
|
var unaliasedModuleNames = [];
|
|
var importAliasNames = []; // names of the parameters in the factory function; these
|
|
// parameters need to match the indexes of the corresponding
|
|
// module names in aliasedModuleNames.
|
|
// Fill in amd-dependency tags
|
|
for (var _a = 0, _b = node.amdDependencies; _a < _b.length; _a++) {
|
|
var amdDependency = _b[_a];
|
|
if (amdDependency.name) {
|
|
aliasedModuleNames.push("\"" + amdDependency.path + "\"");
|
|
importAliasNames.push(amdDependency.name);
|
|
}
|
|
else {
|
|
unaliasedModuleNames.push("\"" + amdDependency.path + "\"");
|
|
}
|
|
}
|
|
for (var _c = 0; _c < externalImports.length; _c++) {
|
|
var importNode = externalImports[_c];
|
|
// Find the name of the external module
|
|
var externalModuleName = getExternalModuleNameText(importNode);
|
|
// Find the name of the module alias, if there is one
|
|
var importAliasName = getLocalNameForExternalImport(importNode);
|
|
if (includeNonAmdDependencies && importAliasName) {
|
|
aliasedModuleNames.push(externalModuleName);
|
|
importAliasNames.push(importAliasName);
|
|
}
|
|
else {
|
|
unaliasedModuleNames.push(externalModuleName);
|
|
}
|
|
}
|
|
write("[\"require\", \"exports\"");
|
|
if (aliasedModuleNames.length) {
|
|
write(", ");
|
|
write(aliasedModuleNames.join(", "));
|
|
}
|
|
if (unaliasedModuleNames.length) {
|
|
write(", ");
|
|
write(unaliasedModuleNames.join(", "));
|
|
}
|
|
write("], function (require, exports");
|
|
if (importAliasNames.length) {
|
|
write(", ");
|
|
write(importAliasNames.join(", "));
|
|
}
|
|
}
|
|
function emitAMDModule(node, startIndex) {
|
|
collectExternalModuleInfo(node);
|
|
writeLine();
|
|
write("define(");
|
|
if (node.moduleName) {
|
|
write("\"" + node.moduleName + "\", ");
|
|
}
|
|
emitAMDDependencies(node, true);
|
|
write(") {");
|
|
increaseIndent();
|
|
emitExportStarHelper();
|
|
emitCaptureThisForNodeIfNecessary(node);
|
|
emitLinesStartingAt(node.statements, startIndex);
|
|
emitTempDeclarations(true);
|
|
emitExportEquals(true);
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("});");
|
|
}
|
|
function emitCommonJSModule(node, startIndex) {
|
|
collectExternalModuleInfo(node);
|
|
emitExportStarHelper();
|
|
emitCaptureThisForNodeIfNecessary(node);
|
|
emitLinesStartingAt(node.statements, startIndex);
|
|
emitTempDeclarations(true);
|
|
emitExportEquals(false);
|
|
}
|
|
function emitUMDModule(node, startIndex) {
|
|
collectExternalModuleInfo(node);
|
|
// Module is detected first to support Browserify users that load into a browser with an AMD loader
|
|
writeLines("(function (deps, factory) {\n if (typeof module === 'object' && typeof module.exports === 'object') {\n var v = factory(require, exports); if (v !== undefined) module.exports = v;\n }\n else if (typeof define === 'function' && define.amd) {\n define(deps, factory);\n }\n})(");
|
|
emitAMDDependencies(node, false);
|
|
write(") {");
|
|
increaseIndent();
|
|
emitExportStarHelper();
|
|
emitCaptureThisForNodeIfNecessary(node);
|
|
emitLinesStartingAt(node.statements, startIndex);
|
|
emitTempDeclarations(true);
|
|
emitExportEquals(true);
|
|
decreaseIndent();
|
|
writeLine();
|
|
write("});");
|
|
}
|
|
function emitES6Module(node, startIndex) {
|
|
externalImports = undefined;
|
|
exportSpecifiers = undefined;
|
|
exportEquals = undefined;
|
|
hasExportStars = false;
|
|
emitCaptureThisForNodeIfNecessary(node);
|
|
emitLinesStartingAt(node.statements, startIndex);
|
|
emitTempDeclarations(true);
|
|
// Emit exportDefault if it exists will happen as part
|
|
// or normal statement emit.
|
|
}
|
|
function emitExportEquals(emitAsReturn) {
|
|
if (exportEquals && resolver.isValueAliasDeclaration(exportEquals)) {
|
|
writeLine();
|
|
emitStart(exportEquals);
|
|
write(emitAsReturn ? "return " : "module.exports = ");
|
|
emit(exportEquals.expression);
|
|
write(";");
|
|
emitEnd(exportEquals);
|
|
}
|
|
}
|
|
function emitJsxElement(node) {
|
|
switch (compilerOptions.jsx) {
|
|
case 2 /* React */:
|
|
jsxEmitReact(node);
|
|
break;
|
|
case 1 /* Preserve */:
|
|
// Fall back to preserve if None was specified (we'll error earlier)
|
|
default:
|
|
jsxEmitPreserve(node);
|
|
break;
|
|
}
|
|
}
|
|
function trimReactWhitespace(node) {
|
|
var result = undefined;
|
|
var text = ts.getTextOfNode(node);
|
|
var firstNonWhitespace = 0;
|
|
var lastNonWhitespace = -1;
|
|
// 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
|
|
for (var i = 0; i < text.length; i++) {
|
|
var c = text.charCodeAt(i);
|
|
if (ts.isLineBreak(c)) {
|
|
if (firstNonWhitespace !== -1 && (lastNonWhitespace - firstNonWhitespace + 1 > 0)) {
|
|
var part = text.substr(firstNonWhitespace, lastNonWhitespace - firstNonWhitespace + 1);
|
|
result = (result ? result + '" + \' \' + "' : '') + part;
|
|
}
|
|
firstNonWhitespace = -1;
|
|
}
|
|
else if (!ts.isWhiteSpace(c)) {
|
|
lastNonWhitespace = i;
|
|
if (firstNonWhitespace === -1) {
|
|
firstNonWhitespace = i;
|
|
}
|
|
}
|
|
}
|
|
if (firstNonWhitespace !== -1) {
|
|
var part = text.substr(firstNonWhitespace);
|
|
result = (result ? result + '" + \' \' + "' : '') + part;
|
|
}
|
|
return result;
|
|
}
|
|
function getTextToEmit(node) {
|
|
switch (compilerOptions.jsx) {
|
|
case 2 /* React */:
|
|
var text = trimReactWhitespace(node);
|
|
if (text.length === 0) {
|
|
return undefined;
|
|
}
|
|
else {
|
|
return text;
|
|
}
|
|
case 1 /* Preserve */:
|
|
default:
|
|
return ts.getTextOfNode(node, true);
|
|
}
|
|
}
|
|
function emitJsxText(node) {
|
|
switch (compilerOptions.jsx) {
|
|
case 2 /* React */:
|
|
write('"');
|
|
write(trimReactWhitespace(node));
|
|
write('"');
|
|
break;
|
|
case 1 /* Preserve */:
|
|
default:
|
|
write(ts.getTextOfNode(node, true));
|
|
break;
|
|
}
|
|
}
|
|
function emitJsxExpression(node) {
|
|
if (node.expression) {
|
|
switch (compilerOptions.jsx) {
|
|
case 1 /* Preserve */:
|
|
default:
|
|
write('{');
|
|
emit(node.expression);
|
|
write('}');
|
|
break;
|
|
case 2 /* React */:
|
|
emit(node.expression);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
function emitDirectivePrologues(statements, startWithNewLine) {
|
|
for (var i = 0; i < statements.length; ++i) {
|
|
if (ts.isPrologueDirective(statements[i])) {
|
|
if (startWithNewLine || i > 0) {
|
|
writeLine();
|
|
}
|
|
emit(statements[i]);
|
|
}
|
|
else {
|
|
// return index of the first non prologue directive
|
|
return i;
|
|
}
|
|
}
|
|
return statements.length;
|
|
}
|
|
function writeLines(text) {
|
|
var lines = text.split(/\r\n|\r|\n/g);
|
|
for (var i = 0; i < lines.length; ++i) {
|
|
var line = lines[i];
|
|
if (line.length) {
|
|
writeLine();
|
|
write(line);
|
|
}
|
|
}
|
|
}
|
|
function emitSourceFileNode(node) {
|
|
// Start new file on new line
|
|
writeLine();
|
|
emitDetachedComments(node);
|
|
// emit prologue directives prior to __extends
|
|
var startIndex = emitDirectivePrologues(node.statements, false);
|
|
// Only emit helpers if the user did not say otherwise.
|
|
if (!compilerOptions.noEmitHelpers) {
|
|
// Only Emit __extends function when target ES5.
|
|
// For target ES6 and above, we can emit classDeclaration as is.
|
|
if ((languageVersion < 2 /* ES6 */) && (!extendsEmitted && resolver.getNodeCheckFlags(node) & 8 /* EmitExtends */)) {
|
|
writeLines(extendsHelper);
|
|
extendsEmitted = true;
|
|
}
|
|
if (!decorateEmitted && resolver.getNodeCheckFlags(node) & 16 /* EmitDecorate */) {
|
|
writeLines(decorateHelper);
|
|
if (compilerOptions.emitDecoratorMetadata) {
|
|
writeLines(metadataHelper);
|
|
}
|
|
decorateEmitted = true;
|
|
}
|
|
if (!paramEmitted && resolver.getNodeCheckFlags(node) & 32 /* EmitParam */) {
|
|
writeLines(paramHelper);
|
|
paramEmitted = true;
|
|
}
|
|
if (!awaiterEmitted && resolver.getNodeCheckFlags(node) & 64 /* EmitAwaiter */) {
|
|
writeLines(awaiterHelper);
|
|
awaiterEmitted = true;
|
|
}
|
|
}
|
|
if (ts.isExternalModule(node) || compilerOptions.isolatedModules) {
|
|
if (languageVersion >= 2 /* ES6 */) {
|
|
emitES6Module(node, startIndex);
|
|
}
|
|
else if (compilerOptions.module === 2 /* AMD */) {
|
|
emitAMDModule(node, startIndex);
|
|
}
|
|
else if (compilerOptions.module === 4 /* System */) {
|
|
emitSystemModule(node, startIndex);
|
|
}
|
|
else if (compilerOptions.module === 3 /* UMD */) {
|
|
emitUMDModule(node, startIndex);
|
|
}
|
|
else {
|
|
emitCommonJSModule(node, startIndex);
|
|
}
|
|
}
|
|
else {
|
|
externalImports = undefined;
|
|
exportSpecifiers = undefined;
|
|
exportEquals = undefined;
|
|
hasExportStars = false;
|
|
emitCaptureThisForNodeIfNecessary(node);
|
|
emitLinesStartingAt(node.statements, startIndex);
|
|
emitTempDeclarations(true);
|
|
}
|
|
emitLeadingComments(node.endOfFileToken);
|
|
}
|
|
function emitNodeWithoutSourceMap(node) {
|
|
if (!node) {
|
|
return;
|
|
}
|
|
if (node.flags & 2 /* Ambient */) {
|
|
return emitOnlyPinnedOrTripleSlashComments(node);
|
|
}
|
|
var emitComments = shouldEmitLeadingAndTrailingComments(node);
|
|
if (emitComments) {
|
|
emitLeadingComments(node);
|
|
}
|
|
emitJavaScriptWorker(node);
|
|
if (emitComments) {
|
|
emitTrailingComments(node);
|
|
}
|
|
}
|
|
function shouldEmitLeadingAndTrailingComments(node) {
|
|
switch (node.kind) {
|
|
// All of these entities are emitted in a specialized fashion. As such, we allow
|
|
// the specialized methods for each to handle the comments on the nodes.
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 219 /* ImportDeclaration */:
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 213 /* TypeAliasDeclaration */:
|
|
case 224 /* ExportAssignment */:
|
|
return false;
|
|
case 190 /* VariableStatement */:
|
|
return shouldEmitLeadingAndTrailingCommentsForVariableStatement(node);
|
|
case 215 /* ModuleDeclaration */:
|
|
// Only emit the leading/trailing comments for a module if we're actually
|
|
// emitting the module as well.
|
|
return shouldEmitModuleDeclaration(node);
|
|
case 214 /* EnumDeclaration */:
|
|
// Only emit the leading/trailing comments for an enum if we're actually
|
|
// emitting the module as well.
|
|
return shouldEmitEnumDeclaration(node);
|
|
}
|
|
// If this is the expression body of an arrow function that we're down-leveling,
|
|
// then we don't want to emit comments when we emit the body. It will have already
|
|
// been taken care of when we emitted the 'return' statement for the function
|
|
// expression body.
|
|
if (node.kind !== 189 /* Block */ &&
|
|
node.parent &&
|
|
node.parent.kind === 171 /* ArrowFunction */ &&
|
|
node.parent.body === node &&
|
|
compilerOptions.target <= 1 /* ES5 */) {
|
|
return false;
|
|
}
|
|
// Emit comments for everything else.
|
|
return true;
|
|
}
|
|
function emitJavaScriptWorker(node) {
|
|
// Check if the node can be emitted regardless of the ScriptTarget
|
|
switch (node.kind) {
|
|
case 66 /* Identifier */:
|
|
return emitIdentifier(node);
|
|
case 135 /* Parameter */:
|
|
return emitParameter(node);
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
return emitMethod(node);
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
return emitAccessor(node);
|
|
case 94 /* ThisKeyword */:
|
|
return emitThis(node);
|
|
case 92 /* SuperKeyword */:
|
|
return emitSuper(node);
|
|
case 90 /* NullKeyword */:
|
|
return write("null");
|
|
case 96 /* TrueKeyword */:
|
|
return write("true");
|
|
case 81 /* FalseKeyword */:
|
|
return write("false");
|
|
case 7 /* NumericLiteral */:
|
|
case 8 /* StringLiteral */:
|
|
case 9 /* RegularExpressionLiteral */:
|
|
case 10 /* NoSubstitutionTemplateLiteral */:
|
|
case 11 /* TemplateHead */:
|
|
case 12 /* TemplateMiddle */:
|
|
case 13 /* TemplateTail */:
|
|
return emitLiteral(node);
|
|
case 180 /* TemplateExpression */:
|
|
return emitTemplateExpression(node);
|
|
case 187 /* TemplateSpan */:
|
|
return emitTemplateSpan(node);
|
|
case 230 /* JsxElement */:
|
|
case 231 /* JsxSelfClosingElement */:
|
|
return emitJsxElement(node);
|
|
case 233 /* JsxText */:
|
|
return emitJsxText(node);
|
|
case 237 /* JsxExpression */:
|
|
return emitJsxExpression(node);
|
|
case 132 /* QualifiedName */:
|
|
return emitQualifiedName(node);
|
|
case 158 /* ObjectBindingPattern */:
|
|
return emitObjectBindingPattern(node);
|
|
case 159 /* ArrayBindingPattern */:
|
|
return emitArrayBindingPattern(node);
|
|
case 160 /* BindingElement */:
|
|
return emitBindingElement(node);
|
|
case 161 /* ArrayLiteralExpression */:
|
|
return emitArrayLiteral(node);
|
|
case 162 /* ObjectLiteralExpression */:
|
|
return emitObjectLiteral(node);
|
|
case 242 /* PropertyAssignment */:
|
|
return emitPropertyAssignment(node);
|
|
case 243 /* ShorthandPropertyAssignment */:
|
|
return emitShorthandPropertyAssignment(node);
|
|
case 133 /* ComputedPropertyName */:
|
|
return emitComputedPropertyName(node);
|
|
case 163 /* PropertyAccessExpression */:
|
|
return emitPropertyAccess(node);
|
|
case 164 /* ElementAccessExpression */:
|
|
return emitIndexedAccess(node);
|
|
case 165 /* CallExpression */:
|
|
return emitCallExpression(node);
|
|
case 166 /* NewExpression */:
|
|
return emitNewExpression(node);
|
|
case 167 /* TaggedTemplateExpression */:
|
|
return emitTaggedTemplateExpression(node);
|
|
case 168 /* TypeAssertionExpression */:
|
|
return emit(node.expression);
|
|
case 186 /* AsExpression */:
|
|
return emit(node.expression);
|
|
case 169 /* ParenthesizedExpression */:
|
|
return emitParenExpression(node);
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
return emitFunctionDeclaration(node);
|
|
case 172 /* DeleteExpression */:
|
|
return emitDeleteExpression(node);
|
|
case 173 /* TypeOfExpression */:
|
|
return emitTypeOfExpression(node);
|
|
case 174 /* VoidExpression */:
|
|
return emitVoidExpression(node);
|
|
case 175 /* AwaitExpression */:
|
|
return emitAwaitExpression(node);
|
|
case 176 /* PrefixUnaryExpression */:
|
|
return emitPrefixUnaryExpression(node);
|
|
case 177 /* PostfixUnaryExpression */:
|
|
return emitPostfixUnaryExpression(node);
|
|
case 178 /* BinaryExpression */:
|
|
return emitBinaryExpression(node);
|
|
case 179 /* ConditionalExpression */:
|
|
return emitConditionalExpression(node);
|
|
case 182 /* SpreadElementExpression */:
|
|
return emitSpreadElementExpression(node);
|
|
case 181 /* YieldExpression */:
|
|
return emitYieldExpression(node);
|
|
case 184 /* OmittedExpression */:
|
|
return;
|
|
case 189 /* Block */:
|
|
case 216 /* ModuleBlock */:
|
|
return emitBlock(node);
|
|
case 190 /* VariableStatement */:
|
|
return emitVariableStatement(node);
|
|
case 191 /* EmptyStatement */:
|
|
return write(";");
|
|
case 192 /* ExpressionStatement */:
|
|
return emitExpressionStatement(node);
|
|
case 193 /* IfStatement */:
|
|
return emitIfStatement(node);
|
|
case 194 /* DoStatement */:
|
|
return emitDoStatement(node);
|
|
case 195 /* WhileStatement */:
|
|
return emitWhileStatement(node);
|
|
case 196 /* ForStatement */:
|
|
return emitForStatement(node);
|
|
case 198 /* ForOfStatement */:
|
|
case 197 /* ForInStatement */:
|
|
return emitForInOrForOfStatement(node);
|
|
case 199 /* ContinueStatement */:
|
|
case 200 /* BreakStatement */:
|
|
return emitBreakOrContinueStatement(node);
|
|
case 201 /* ReturnStatement */:
|
|
return emitReturnStatement(node);
|
|
case 202 /* WithStatement */:
|
|
return emitWithStatement(node);
|
|
case 203 /* SwitchStatement */:
|
|
return emitSwitchStatement(node);
|
|
case 238 /* CaseClause */:
|
|
case 239 /* DefaultClause */:
|
|
return emitCaseOrDefaultClause(node);
|
|
case 204 /* LabeledStatement */:
|
|
return emitLabelledStatement(node);
|
|
case 205 /* ThrowStatement */:
|
|
return emitThrowStatement(node);
|
|
case 206 /* TryStatement */:
|
|
return emitTryStatement(node);
|
|
case 241 /* CatchClause */:
|
|
return emitCatchClause(node);
|
|
case 207 /* DebuggerStatement */:
|
|
return emitDebuggerStatement(node);
|
|
case 208 /* VariableDeclaration */:
|
|
return emitVariableDeclaration(node);
|
|
case 183 /* ClassExpression */:
|
|
return emitClassExpression(node);
|
|
case 211 /* ClassDeclaration */:
|
|
return emitClassDeclaration(node);
|
|
case 212 /* InterfaceDeclaration */:
|
|
return emitInterfaceDeclaration(node);
|
|
case 214 /* EnumDeclaration */:
|
|
return emitEnumDeclaration(node);
|
|
case 244 /* EnumMember */:
|
|
return emitEnumMember(node);
|
|
case 215 /* ModuleDeclaration */:
|
|
return emitModuleDeclaration(node);
|
|
case 219 /* ImportDeclaration */:
|
|
return emitImportDeclaration(node);
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
return emitImportEqualsDeclaration(node);
|
|
case 225 /* ExportDeclaration */:
|
|
return emitExportDeclaration(node);
|
|
case 224 /* ExportAssignment */:
|
|
return emitExportAssignment(node);
|
|
case 245 /* SourceFile */:
|
|
return emitSourceFileNode(node);
|
|
}
|
|
}
|
|
function hasDetachedComments(pos) {
|
|
return detachedCommentsInfo !== undefined && ts.lastOrUndefined(detachedCommentsInfo).nodePos === pos;
|
|
}
|
|
function getLeadingCommentsWithoutDetachedComments() {
|
|
// get the leading comments from detachedPos
|
|
var leadingComments = ts.getLeadingCommentRanges(currentSourceFile.text, ts.lastOrUndefined(detachedCommentsInfo).detachedCommentEndPos);
|
|
if (detachedCommentsInfo.length - 1) {
|
|
detachedCommentsInfo.pop();
|
|
}
|
|
else {
|
|
detachedCommentsInfo = undefined;
|
|
}
|
|
return leadingComments;
|
|
}
|
|
function filterComments(ranges, onlyPinnedOrTripleSlashComments) {
|
|
// If we're removing comments, then we want to strip out all but the pinned or
|
|
// triple slash comments.
|
|
if (ranges && onlyPinnedOrTripleSlashComments) {
|
|
ranges = ts.filter(ranges, isPinnedOrTripleSlashComment);
|
|
if (ranges.length === 0) {
|
|
return undefined;
|
|
}
|
|
}
|
|
return ranges;
|
|
}
|
|
function getLeadingCommentsToEmit(node) {
|
|
// Emit the leading comments only if the parent's pos doesn't match because parent should take care of emitting these comments
|
|
if (node.parent) {
|
|
if (node.parent.kind === 245 /* SourceFile */ || node.pos !== node.parent.pos) {
|
|
if (hasDetachedComments(node.pos)) {
|
|
// get comments without detached comments
|
|
return getLeadingCommentsWithoutDetachedComments();
|
|
}
|
|
else {
|
|
// get the leading comments from the node
|
|
return ts.getLeadingCommentRangesOfNode(node, currentSourceFile);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function getTrailingCommentsToEmit(node) {
|
|
// Emit the trailing comments only if the parent's pos doesn't match because parent should take care of emitting these comments
|
|
if (node.parent) {
|
|
if (node.parent.kind === 245 /* SourceFile */ || node.end !== node.parent.end) {
|
|
return ts.getTrailingCommentRanges(currentSourceFile.text, node.end);
|
|
}
|
|
}
|
|
}
|
|
function emitOnlyPinnedOrTripleSlashComments(node) {
|
|
emitLeadingCommentsWorker(node, true);
|
|
}
|
|
function emitLeadingComments(node) {
|
|
return emitLeadingCommentsWorker(node, compilerOptions.removeComments);
|
|
}
|
|
function emitLeadingCommentsWorker(node, onlyPinnedOrTripleSlashComments) {
|
|
// If the caller only wants pinned or triple slash comments, then always filter
|
|
// down to that set. Otherwise, filter based on the current compiler options.
|
|
var leadingComments = filterComments(getLeadingCommentsToEmit(node), onlyPinnedOrTripleSlashComments);
|
|
ts.emitNewLineBeforeLeadingComments(currentSourceFile, writer, node, leadingComments);
|
|
// Leading comments are emitted at /*leading comment1 */space/*leading comment*/space
|
|
ts.emitComments(currentSourceFile, writer, leadingComments, true, newLine, writeComment);
|
|
}
|
|
function emitTrailingComments(node) {
|
|
// Emit the trailing comments only if the parent's end doesn't match
|
|
var trailingComments = filterComments(getTrailingCommentsToEmit(node), compilerOptions.removeComments);
|
|
// trailing comments are emitted at space/*trailing comment1 */space/*trailing comment*/
|
|
ts.emitComments(currentSourceFile, writer, trailingComments, false, newLine, writeComment);
|
|
}
|
|
function emitLeadingCommentsOfPosition(pos) {
|
|
var leadingComments;
|
|
if (hasDetachedComments(pos)) {
|
|
// get comments without detached comments
|
|
leadingComments = getLeadingCommentsWithoutDetachedComments();
|
|
}
|
|
else {
|
|
// get the leading comments from the node
|
|
leadingComments = ts.getLeadingCommentRanges(currentSourceFile.text, pos);
|
|
}
|
|
leadingComments = filterComments(leadingComments, compilerOptions.removeComments);
|
|
ts.emitNewLineBeforeLeadingComments(currentSourceFile, writer, { pos: pos, end: pos }, leadingComments);
|
|
// Leading comments are emitted at /*leading comment1 */space/*leading comment*/space
|
|
ts.emitComments(currentSourceFile, writer, leadingComments, true, newLine, writeComment);
|
|
}
|
|
function emitDetachedComments(node) {
|
|
var leadingComments = ts.getLeadingCommentRanges(currentSourceFile.text, node.pos);
|
|
if (leadingComments) {
|
|
var detachedComments = [];
|
|
var lastComment;
|
|
ts.forEach(leadingComments, function (comment) {
|
|
if (lastComment) {
|
|
var lastCommentLine = ts.getLineOfLocalPosition(currentSourceFile, lastComment.end);
|
|
var commentLine = ts.getLineOfLocalPosition(currentSourceFile, 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.
|
|
return detachedComments;
|
|
}
|
|
}
|
|
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 = ts.getLineOfLocalPosition(currentSourceFile, ts.lastOrUndefined(detachedComments).end);
|
|
var nodeLine = ts.getLineOfLocalPosition(currentSourceFile, ts.skipTrivia(currentSourceFile.text, node.pos));
|
|
if (nodeLine >= lastCommentLine + 2) {
|
|
// Valid detachedComments
|
|
ts.emitNewLineBeforeLeadingComments(currentSourceFile, writer, node, leadingComments);
|
|
ts.emitComments(currentSourceFile, writer, detachedComments, true, newLine, writeComment);
|
|
var currentDetachedCommentInfo = { nodePos: node.pos, detachedCommentEndPos: ts.lastOrUndefined(detachedComments).end };
|
|
if (detachedCommentsInfo) {
|
|
detachedCommentsInfo.push(currentDetachedCommentInfo);
|
|
}
|
|
else {
|
|
detachedCommentsInfo = [currentDetachedCommentInfo];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function isPinnedOrTripleSlashComment(comment) {
|
|
if (currentSourceFile.text.charCodeAt(comment.pos + 1) === 42 /* asterisk */) {
|
|
return currentSourceFile.text.charCodeAt(comment.pos + 2) === 33 /* exclamation */;
|
|
}
|
|
else if (currentSourceFile.text.charCodeAt(comment.pos + 1) === 47 /* slash */ &&
|
|
comment.pos + 2 < comment.end &&
|
|
currentSourceFile.text.charCodeAt(comment.pos + 2) === 47 /* slash */ &&
|
|
currentSourceFile.text.substring(comment.pos, comment.end).match(ts.fullTripleSlashReferencePathRegEx)) {
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
function emitFile(jsFilePath, sourceFile) {
|
|
emitJavaScript(jsFilePath, sourceFile);
|
|
if (compilerOptions.declaration) {
|
|
ts.writeDeclarationFile(jsFilePath, sourceFile, host, resolver, diagnostics);
|
|
}
|
|
}
|
|
}
|
|
ts.emitFiles = emitFiles;
|
|
})(ts || (ts = {}));
|
|
/// <reference path="sys.ts" />
|
|
/// <reference path="emitter.ts" />
|
|
var ts;
|
|
(function (ts) {
|
|
/* @internal */ ts.programTime = 0;
|
|
/* @internal */ ts.emitTime = 0;
|
|
/* @internal */ ts.ioReadTime = 0;
|
|
/* @internal */ ts.ioWriteTime = 0;
|
|
/** The version of the TypeScript compiler release */
|
|
ts.version = "1.5.3";
|
|
function findConfigFile(searchPath) {
|
|
var fileName = "tsconfig.json";
|
|
while (true) {
|
|
if (ts.sys.fileExists(fileName)) {
|
|
return fileName;
|
|
}
|
|
var parentPath = ts.getDirectoryPath(searchPath);
|
|
if (parentPath === searchPath) {
|
|
break;
|
|
}
|
|
searchPath = parentPath;
|
|
fileName = "../" + fileName;
|
|
}
|
|
return undefined;
|
|
}
|
|
ts.findConfigFile = findConfigFile;
|
|
function createCompilerHost(options, setParentNodes) {
|
|
var currentDirectory;
|
|
var existingDirectories = {};
|
|
function getCanonicalFileName(fileName) {
|
|
// if underlying system can distinguish between two files whose names differs only in cases then file name already in canonical form.
|
|
// otherwise use toLowerCase as a canonical form.
|
|
return ts.sys.useCaseSensitiveFileNames ? fileName : fileName.toLowerCase();
|
|
}
|
|
// returned by CScript sys environment
|
|
var unsupportedFileEncodingErrorCode = -2147024809;
|
|
function getSourceFile(fileName, languageVersion, onError) {
|
|
var text;
|
|
try {
|
|
var start = new Date().getTime();
|
|
text = ts.sys.readFile(fileName, options.charset);
|
|
ts.ioReadTime += new Date().getTime() - start;
|
|
}
|
|
catch (e) {
|
|
if (onError) {
|
|
onError(e.number === unsupportedFileEncodingErrorCode
|
|
? ts.createCompilerDiagnostic(ts.Diagnostics.Unsupported_file_encoding).messageText
|
|
: e.message);
|
|
}
|
|
text = "";
|
|
}
|
|
return text !== undefined ? ts.createSourceFile(fileName, text, languageVersion, setParentNodes) : undefined;
|
|
}
|
|
function directoryExists(directoryPath) {
|
|
if (ts.hasProperty(existingDirectories, directoryPath)) {
|
|
return true;
|
|
}
|
|
if (ts.sys.directoryExists(directoryPath)) {
|
|
existingDirectories[directoryPath] = true;
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function ensureDirectoriesExist(directoryPath) {
|
|
if (directoryPath.length > ts.getRootLength(directoryPath) && !directoryExists(directoryPath)) {
|
|
var parentDirectory = ts.getDirectoryPath(directoryPath);
|
|
ensureDirectoriesExist(parentDirectory);
|
|
ts.sys.createDirectory(directoryPath);
|
|
}
|
|
}
|
|
function writeFile(fileName, data, writeByteOrderMark, onError) {
|
|
try {
|
|
var start = new Date().getTime();
|
|
ensureDirectoriesExist(ts.getDirectoryPath(ts.normalizePath(fileName)));
|
|
ts.sys.writeFile(fileName, data, writeByteOrderMark);
|
|
ts.ioWriteTime += new Date().getTime() - start;
|
|
}
|
|
catch (e) {
|
|
if (onError) {
|
|
onError(e.message);
|
|
}
|
|
}
|
|
}
|
|
var newLine = ts.getNewLineCharacter(options);
|
|
return {
|
|
getSourceFile: getSourceFile,
|
|
getDefaultLibFileName: function (options) { return ts.combinePaths(ts.getDirectoryPath(ts.normalizePath(ts.sys.getExecutingFilePath())), ts.getDefaultLibFileName(options)); },
|
|
writeFile: writeFile,
|
|
getCurrentDirectory: function () { return currentDirectory || (currentDirectory = ts.sys.getCurrentDirectory()); },
|
|
useCaseSensitiveFileNames: function () { return ts.sys.useCaseSensitiveFileNames; },
|
|
getCanonicalFileName: getCanonicalFileName,
|
|
getNewLine: function () { return newLine; }
|
|
};
|
|
}
|
|
ts.createCompilerHost = createCompilerHost;
|
|
function getPreEmitDiagnostics(program, sourceFile, cancellationToken) {
|
|
var diagnostics = program.getOptionsDiagnostics(cancellationToken).concat(program.getSyntacticDiagnostics(sourceFile, cancellationToken), program.getGlobalDiagnostics(cancellationToken), program.getSemanticDiagnostics(sourceFile, cancellationToken));
|
|
if (program.getCompilerOptions().declaration) {
|
|
diagnostics.concat(program.getDeclarationDiagnostics(sourceFile, cancellationToken));
|
|
}
|
|
return ts.sortAndDeduplicateDiagnostics(diagnostics);
|
|
}
|
|
ts.getPreEmitDiagnostics = getPreEmitDiagnostics;
|
|
function flattenDiagnosticMessageText(messageText, newLine) {
|
|
if (typeof messageText === "string") {
|
|
return messageText;
|
|
}
|
|
else {
|
|
var diagnosticChain = messageText;
|
|
var result = "";
|
|
var indent = 0;
|
|
while (diagnosticChain) {
|
|
if (indent) {
|
|
result += newLine;
|
|
for (var i = 0; i < indent; i++) {
|
|
result += " ";
|
|
}
|
|
}
|
|
result += diagnosticChain.messageText;
|
|
indent++;
|
|
diagnosticChain = diagnosticChain.next;
|
|
}
|
|
return result;
|
|
}
|
|
}
|
|
ts.flattenDiagnosticMessageText = flattenDiagnosticMessageText;
|
|
function createProgram(rootNames, options, host) {
|
|
var program;
|
|
var files = [];
|
|
var diagnostics = ts.createDiagnosticCollection();
|
|
var commonSourceDirectory;
|
|
var diagnosticsProducingTypeChecker;
|
|
var noDiagnosticsTypeChecker;
|
|
var classifiableNames;
|
|
var skipDefaultLib = options.noLib;
|
|
var start = new Date().getTime();
|
|
host = host || createCompilerHost(options);
|
|
var filesByName = ts.createFileMap(function (fileName) { return host.getCanonicalFileName(fileName); });
|
|
ts.forEach(rootNames, function (name) { return processRootFile(name, false); });
|
|
// 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 (!skipDefaultLib) {
|
|
processRootFile(host.getDefaultLibFileName(options), true);
|
|
}
|
|
verifyCompilerOptions();
|
|
ts.programTime += new Date().getTime() - start;
|
|
program = {
|
|
getSourceFile: getSourceFile,
|
|
getSourceFiles: function () { return files; },
|
|
getCompilerOptions: function () { return options; },
|
|
getSyntacticDiagnostics: getSyntacticDiagnostics,
|
|
getOptionsDiagnostics: getOptionsDiagnostics,
|
|
getGlobalDiagnostics: getGlobalDiagnostics,
|
|
getSemanticDiagnostics: getSemanticDiagnostics,
|
|
getDeclarationDiagnostics: getDeclarationDiagnostics,
|
|
getTypeChecker: getTypeChecker,
|
|
getClassifiableNames: getClassifiableNames,
|
|
getDiagnosticsProducingTypeChecker: getDiagnosticsProducingTypeChecker,
|
|
getCommonSourceDirectory: function () { return commonSourceDirectory; },
|
|
emit: emit,
|
|
getCurrentDirectory: function () { return host.getCurrentDirectory(); },
|
|
getNodeCount: function () { return getDiagnosticsProducingTypeChecker().getNodeCount(); },
|
|
getIdentifierCount: function () { return getDiagnosticsProducingTypeChecker().getIdentifierCount(); },
|
|
getSymbolCount: function () { return getDiagnosticsProducingTypeChecker().getSymbolCount(); },
|
|
getTypeCount: function () { return getDiagnosticsProducingTypeChecker().getTypeCount(); }
|
|
};
|
|
return program;
|
|
function getClassifiableNames() {
|
|
if (!classifiableNames) {
|
|
// Initialize a checker so that all our files are bound.
|
|
getTypeChecker();
|
|
classifiableNames = {};
|
|
for (var _i = 0; _i < files.length; _i++) {
|
|
var sourceFile = files[_i];
|
|
ts.copyMap(sourceFile.classifiableNames, classifiableNames);
|
|
}
|
|
}
|
|
return classifiableNames;
|
|
}
|
|
function getEmitHost(writeFileCallback) {
|
|
return {
|
|
getCanonicalFileName: function (fileName) { return host.getCanonicalFileName(fileName); },
|
|
getCommonSourceDirectory: program.getCommonSourceDirectory,
|
|
getCompilerOptions: program.getCompilerOptions,
|
|
getCurrentDirectory: function () { return host.getCurrentDirectory(); },
|
|
getNewLine: function () { return host.getNewLine(); },
|
|
getSourceFile: program.getSourceFile,
|
|
getSourceFiles: program.getSourceFiles,
|
|
writeFile: writeFileCallback || (function (fileName, data, writeByteOrderMark, onError) { return host.writeFile(fileName, data, writeByteOrderMark, onError); })
|
|
};
|
|
}
|
|
function getDiagnosticsProducingTypeChecker() {
|
|
return diagnosticsProducingTypeChecker || (diagnosticsProducingTypeChecker = ts.createTypeChecker(program, true));
|
|
}
|
|
function getTypeChecker() {
|
|
return noDiagnosticsTypeChecker || (noDiagnosticsTypeChecker = ts.createTypeChecker(program, false));
|
|
}
|
|
function emit(sourceFile, writeFileCallback, cancellationToken) {
|
|
var _this = this;
|
|
return runWithCancellationToken(function () { return emitWorker(_this, sourceFile, writeFileCallback, cancellationToken); });
|
|
}
|
|
function emitWorker(program, sourceFile, writeFileCallback, 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 && getPreEmitDiagnostics(program, undefined, cancellationToken).length > 0) {
|
|
return { diagnostics: [], sourceMaps: undefined, emitSkipped: true };
|
|
}
|
|
// 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(options.out ? undefined : sourceFile);
|
|
var start = new Date().getTime();
|
|
var emitResult = ts.emitFiles(emitResolver, getEmitHost(writeFileCallback), sourceFile);
|
|
ts.emitTime += new Date().getTime() - start;
|
|
return emitResult;
|
|
}
|
|
function getSourceFile(fileName) {
|
|
return filesByName.get(fileName);
|
|
}
|
|
function getDiagnosticsHelper(sourceFile, getDiagnostics, cancellationToken) {
|
|
if (sourceFile) {
|
|
return getDiagnostics(sourceFile, cancellationToken);
|
|
}
|
|
var allDiagnostics = [];
|
|
ts.forEach(program.getSourceFiles(), function (sourceFile) {
|
|
if (cancellationToken) {
|
|
cancellationToken.throwIfCancellationRequested();
|
|
}
|
|
ts.addRange(allDiagnostics, getDiagnostics(sourceFile, cancellationToken));
|
|
});
|
|
return ts.sortAndDeduplicateDiagnostics(allDiagnostics);
|
|
}
|
|
function getSyntacticDiagnostics(sourceFile, cancellationToken) {
|
|
return getDiagnosticsHelper(sourceFile, getSyntacticDiagnosticsForFile, cancellationToken);
|
|
}
|
|
function getSemanticDiagnostics(sourceFile, cancellationToken) {
|
|
return getDiagnosticsHelper(sourceFile, getSemanticDiagnosticsForFile, cancellationToken);
|
|
}
|
|
function getDeclarationDiagnostics(sourceFile, cancellationToken) {
|
|
return getDiagnosticsHelper(sourceFile, getDeclarationDiagnosticsForFile, cancellationToken);
|
|
}
|
|
function getSyntacticDiagnosticsForFile(sourceFile, cancellationToken) {
|
|
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 agressive 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 runWithCancellationToken(function () {
|
|
var typeChecker = getDiagnosticsProducingTypeChecker();
|
|
ts.Debug.assert(!!sourceFile.bindDiagnostics);
|
|
var bindDiagnostics = sourceFile.bindDiagnostics;
|
|
var checkDiagnostics = typeChecker.getDiagnostics(sourceFile, cancellationToken);
|
|
var programDiagnostics = diagnostics.getDiagnostics(sourceFile.fileName);
|
|
return bindDiagnostics.concat(checkDiagnostics).concat(programDiagnostics);
|
|
});
|
|
}
|
|
function getDeclarationDiagnosticsForFile(sourceFile, cancellationToken) {
|
|
return runWithCancellationToken(function () {
|
|
if (!ts.isDeclarationFile(sourceFile)) {
|
|
var resolver = getDiagnosticsProducingTypeChecker().getEmitResolver(sourceFile, cancellationToken);
|
|
// Don't actually write any files since we're just getting diagnostics.
|
|
var writeFile_1 = function () { };
|
|
return ts.getDeclarationDiagnostics(getEmitHost(writeFile_1), resolver, sourceFile);
|
|
}
|
|
});
|
|
}
|
|
function getOptionsDiagnostics() {
|
|
var allDiagnostics = [];
|
|
ts.addRange(allDiagnostics, diagnostics.getGlobalDiagnostics());
|
|
return ts.sortAndDeduplicateDiagnostics(allDiagnostics);
|
|
}
|
|
function getGlobalDiagnostics() {
|
|
var allDiagnostics = [];
|
|
ts.addRange(allDiagnostics, getDiagnosticsProducingTypeChecker().getGlobalDiagnostics());
|
|
return ts.sortAndDeduplicateDiagnostics(allDiagnostics);
|
|
}
|
|
function hasExtension(fileName) {
|
|
return ts.getBaseFileName(fileName).indexOf(".") >= 0;
|
|
}
|
|
function processRootFile(fileName, isDefaultLib) {
|
|
processSourceFile(ts.normalizePath(fileName), isDefaultLib);
|
|
}
|
|
function processSourceFile(fileName, isDefaultLib, refFile, refPos, refEnd) {
|
|
var start;
|
|
var length;
|
|
var diagnosticArgument;
|
|
if (refEnd !== undefined && refPos !== undefined) {
|
|
start = refPos;
|
|
length = refEnd - refPos;
|
|
}
|
|
var diagnostic;
|
|
if (hasExtension(fileName)) {
|
|
if (!options.allowNonTsExtensions && !ts.forEach(ts.supportedExtensions, function (extension) { return ts.fileExtensionIs(host.getCanonicalFileName(fileName), extension); })) {
|
|
diagnostic = ts.Diagnostics.File_0_has_unsupported_extension_The_only_supported_extensions_are_1;
|
|
diagnosticArgument = [fileName, "'" + ts.supportedExtensions.join("', '") + "'"];
|
|
}
|
|
else if (!findSourceFile(fileName, isDefaultLib, refFile, refPos, refEnd)) {
|
|
diagnostic = ts.Diagnostics.File_0_not_found;
|
|
diagnosticArgument = [fileName];
|
|
}
|
|
else if (refFile && host.getCanonicalFileName(fileName) === host.getCanonicalFileName(refFile.fileName)) {
|
|
diagnostic = ts.Diagnostics.A_file_cannot_have_a_reference_to_itself;
|
|
diagnosticArgument = [fileName];
|
|
}
|
|
}
|
|
else {
|
|
var nonTsFile = options.allowNonTsExtensions && findSourceFile(fileName, isDefaultLib, refFile, refPos, refEnd);
|
|
if (!nonTsFile) {
|
|
if (options.allowNonTsExtensions) {
|
|
diagnostic = ts.Diagnostics.File_0_not_found;
|
|
diagnosticArgument = [fileName];
|
|
}
|
|
else if (!ts.forEach(ts.supportedExtensions, function (extension) { return findSourceFile(fileName + extension, isDefaultLib, refFile, refPos, refEnd); })) {
|
|
diagnostic = ts.Diagnostics.File_0_not_found;
|
|
fileName += ".ts";
|
|
diagnosticArgument = [fileName];
|
|
}
|
|
}
|
|
}
|
|
if (diagnostic) {
|
|
if (refFile) {
|
|
diagnostics.add(ts.createFileDiagnostic.apply(void 0, [refFile, start, length, diagnostic].concat(diagnosticArgument)));
|
|
}
|
|
else {
|
|
diagnostics.add(ts.createCompilerDiagnostic.apply(void 0, [diagnostic].concat(diagnosticArgument)));
|
|
}
|
|
}
|
|
}
|
|
// Get source file from normalized fileName
|
|
function findSourceFile(fileName, isDefaultLib, refFile, refStart, refLength) {
|
|
var canonicalName = host.getCanonicalFileName(ts.normalizeSlashes(fileName));
|
|
if (filesByName.contains(canonicalName)) {
|
|
// We've already looked for this file, use cached result
|
|
return getSourceFileFromCache(fileName, canonicalName, false);
|
|
}
|
|
else {
|
|
var normalizedAbsolutePath = ts.getNormalizedAbsolutePath(fileName, host.getCurrentDirectory());
|
|
var canonicalAbsolutePath = host.getCanonicalFileName(normalizedAbsolutePath);
|
|
if (filesByName.contains(canonicalAbsolutePath)) {
|
|
return getSourceFileFromCache(normalizedAbsolutePath, canonicalAbsolutePath, true);
|
|
}
|
|
// We haven't looked for this file, do so now and cache result
|
|
var file = host.getSourceFile(fileName, options.target, function (hostErrorMessage) {
|
|
if (refFile) {
|
|
diagnostics.add(ts.createFileDiagnostic(refFile, refStart, refLength, ts.Diagnostics.Cannot_read_file_0_Colon_1, fileName, hostErrorMessage));
|
|
}
|
|
else {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Cannot_read_file_0_Colon_1, fileName, hostErrorMessage));
|
|
}
|
|
});
|
|
filesByName.set(canonicalName, file);
|
|
if (file) {
|
|
skipDefaultLib = skipDefaultLib || file.hasNoDefaultLib;
|
|
// Set the source file for normalized absolute path
|
|
filesByName.set(canonicalAbsolutePath, file);
|
|
if (!options.noResolve) {
|
|
var basePath = ts.getDirectoryPath(fileName);
|
|
processReferencedFiles(file, basePath);
|
|
processImportedModules(file, basePath);
|
|
}
|
|
if (isDefaultLib) {
|
|
file.isDefaultLib = true;
|
|
files.unshift(file);
|
|
}
|
|
else {
|
|
files.push(file);
|
|
}
|
|
}
|
|
return file;
|
|
}
|
|
function getSourceFileFromCache(fileName, canonicalName, useAbsolutePath) {
|
|
var file = filesByName.get(canonicalName);
|
|
if (file && host.useCaseSensitiveFileNames()) {
|
|
var sourceFileName = useAbsolutePath ? ts.getNormalizedAbsolutePath(file.fileName, host.getCurrentDirectory()) : file.fileName;
|
|
if (canonicalName !== sourceFileName) {
|
|
diagnostics.add(ts.createFileDiagnostic(refFile, refStart, refLength, ts.Diagnostics.File_name_0_differs_from_already_included_file_name_1_only_in_casing, fileName, sourceFileName));
|
|
}
|
|
}
|
|
return file;
|
|
}
|
|
}
|
|
function processReferencedFiles(file, basePath) {
|
|
ts.forEach(file.referencedFiles, function (ref) {
|
|
var referencedFileName = ts.isRootedDiskPath(ref.fileName) ? ref.fileName : ts.combinePaths(basePath, ref.fileName);
|
|
processSourceFile(ts.normalizePath(referencedFileName), false, file, ref.pos, ref.end);
|
|
});
|
|
}
|
|
function processImportedModules(file, basePath) {
|
|
ts.forEach(file.statements, function (node) {
|
|
if (node.kind === 219 /* ImportDeclaration */ || node.kind === 218 /* ImportEqualsDeclaration */ || node.kind === 225 /* ExportDeclaration */) {
|
|
var moduleNameExpr = ts.getExternalModuleName(node);
|
|
if (moduleNameExpr && moduleNameExpr.kind === 8 /* StringLiteral */) {
|
|
var moduleNameText = moduleNameExpr.text;
|
|
if (moduleNameText) {
|
|
var searchPath = basePath;
|
|
var searchName;
|
|
while (true) {
|
|
searchName = ts.normalizePath(ts.combinePaths(searchPath, moduleNameText));
|
|
if (ts.forEach(ts.supportedExtensions, function (extension) { return findModuleSourceFile(searchName + extension, moduleNameExpr); })) {
|
|
break;
|
|
}
|
|
var parentPath = ts.getDirectoryPath(searchPath);
|
|
if (parentPath === searchPath) {
|
|
break;
|
|
}
|
|
searchPath = parentPath;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (node.kind === 215 /* ModuleDeclaration */ && node.name.kind === 8 /* StringLiteral */ && (node.flags & 2 /* Ambient */ || ts.isDeclarationFile(file))) {
|
|
// TypeScript 1.0 spec (April 2014): 12.1.6
|
|
// 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
|
|
ts.forEachChild(node.body, function (node) {
|
|
if (ts.isExternalModuleImportEqualsDeclaration(node) &&
|
|
ts.getExternalModuleImportEqualsDeclarationExpression(node).kind === 8 /* StringLiteral */) {
|
|
var nameLiteral = ts.getExternalModuleImportEqualsDeclarationExpression(node);
|
|
var moduleName = nameLiteral.text;
|
|
if (moduleName) {
|
|
// TypeScript 1.0 spec (April 2014): 12.1.6
|
|
// An ExternalImportDeclaration in anAmbientExternalModuleDeclaration may reference other external modules
|
|
// only through top - level external module names. Relative external module names are not permitted.
|
|
var searchName = ts.normalizePath(ts.combinePaths(basePath, moduleName));
|
|
ts.forEach(ts.supportedExtensions, function (extension) { return findModuleSourceFile(searchName + extension, nameLiteral); });
|
|
}
|
|
}
|
|
});
|
|
}
|
|
});
|
|
function findModuleSourceFile(fileName, nameLiteral) {
|
|
return findSourceFile(fileName, false, file, nameLiteral.pos, nameLiteral.end - nameLiteral.pos);
|
|
}
|
|
}
|
|
function computeCommonSourceDirectory(sourceFiles) {
|
|
var commonPathComponents;
|
|
var currentDirectory = host.getCurrentDirectory();
|
|
ts.forEach(files, function (sourceFile) {
|
|
// Each file contributes into common source file path
|
|
if (ts.isDeclarationFile(sourceFile)) {
|
|
return;
|
|
}
|
|
var sourcePathComponents = ts.getNormalizedPathComponents(sourceFile.fileName, currentDirectory);
|
|
sourcePathComponents.pop(); // The base file name is not part of the common directory path
|
|
if (!commonPathComponents) {
|
|
// first file
|
|
commonPathComponents = sourcePathComponents;
|
|
return;
|
|
}
|
|
for (var i = 0, n = Math.min(commonPathComponents.length, sourcePathComponents.length); i < n; i++) {
|
|
if (commonPathComponents[i] !== sourcePathComponents[i]) {
|
|
if (i === 0) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Cannot_find_the_common_subdirectory_path_for_the_input_files));
|
|
return;
|
|
}
|
|
// 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;
|
|
}
|
|
});
|
|
return ts.getNormalizedPathFromPathComponents(commonPathComponents);
|
|
}
|
|
function checkSourceFilesBelongToPath(sourceFiles, rootDirectory) {
|
|
var allFilesBelongToPath = true;
|
|
if (sourceFiles) {
|
|
var currentDirectory = host.getCurrentDirectory();
|
|
var absoluteRootDirectoryPath = host.getCanonicalFileName(ts.getNormalizedAbsolutePath(rootDirectory, currentDirectory));
|
|
for (var _i = 0; _i < sourceFiles.length; _i++) {
|
|
var sourceFile = sourceFiles[_i];
|
|
if (!ts.isDeclarationFile(sourceFile)) {
|
|
var absoluteSourceFilePath = host.getCanonicalFileName(ts.getNormalizedAbsolutePath(sourceFile.fileName, currentDirectory));
|
|
if (absoluteSourceFilePath.indexOf(absoluteRootDirectoryPath) !== 0) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.File_0_is_not_under_rootDir_1_rootDir_is_expected_to_contain_all_source_files, sourceFile.fileName, options.rootDir));
|
|
allFilesBelongToPath = false;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return allFilesBelongToPath;
|
|
}
|
|
function verifyCompilerOptions() {
|
|
if (options.isolatedModules) {
|
|
if (options.sourceMap) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_sourceMap_cannot_be_specified_with_option_isolatedModules));
|
|
}
|
|
if (options.declaration) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_declaration_cannot_be_specified_with_option_isolatedModules));
|
|
}
|
|
if (options.noEmitOnError) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_noEmitOnError_cannot_be_specified_with_option_isolatedModules));
|
|
}
|
|
if (options.out) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_out_cannot_be_specified_with_option_isolatedModules));
|
|
}
|
|
}
|
|
if (options.inlineSourceMap) {
|
|
if (options.sourceMap) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_sourceMap_cannot_be_specified_with_option_inlineSourceMap));
|
|
}
|
|
if (options.mapRoot) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_mapRoot_cannot_be_specified_with_option_inlineSourceMap));
|
|
}
|
|
if (options.sourceRoot) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_sourceRoot_cannot_be_specified_with_option_inlineSourceMap));
|
|
}
|
|
}
|
|
if (options.inlineSources) {
|
|
if (!options.sourceMap && !options.inlineSourceMap) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_inlineSources_can_only_be_used_when_either_option_inlineSourceMap_or_option_sourceMap_is_provided));
|
|
}
|
|
}
|
|
if (!options.sourceMap && (options.mapRoot || options.sourceRoot)) {
|
|
// Error to specify --mapRoot or --sourceRoot without mapSourceFiles
|
|
if (options.mapRoot) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_mapRoot_cannot_be_specified_without_specifying_sourceMap_option));
|
|
}
|
|
if (options.sourceRoot) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_sourceRoot_cannot_be_specified_without_specifying_sourceMap_option));
|
|
}
|
|
return;
|
|
}
|
|
var languageVersion = options.target || 0 /* ES3 */;
|
|
var firstExternalModuleSourceFile = ts.forEach(files, function (f) { return ts.isExternalModule(f) ? f : undefined; });
|
|
if (options.isolatedModules) {
|
|
if (!options.module && languageVersion < 2 /* ES6 */) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_isolatedModules_can_only_be_used_when_either_option_module_is_provided_or_option_target_is_ES6_or_higher));
|
|
}
|
|
var firstNonExternalModuleSourceFile = ts.forEach(files, function (f) { return !ts.isExternalModule(f) && !ts.isDeclarationFile(f) ? f : undefined; });
|
|
if (firstNonExternalModuleSourceFile) {
|
|
var span = ts.getErrorSpanForNode(firstNonExternalModuleSourceFile, firstNonExternalModuleSourceFile);
|
|
diagnostics.add(ts.createFileDiagnostic(firstNonExternalModuleSourceFile, span.start, span.length, ts.Diagnostics.Cannot_compile_namespaces_when_the_isolatedModules_flag_is_provided));
|
|
}
|
|
}
|
|
else if (firstExternalModuleSourceFile && languageVersion < 2 /* ES6 */ && !options.module) {
|
|
// We cannot use createDiagnosticFromNode because nodes do not have parents yet
|
|
var span = ts.getErrorSpanForNode(firstExternalModuleSourceFile, firstExternalModuleSourceFile.externalModuleIndicator);
|
|
diagnostics.add(ts.createFileDiagnostic(firstExternalModuleSourceFile, span.start, span.length, ts.Diagnostics.Cannot_compile_modules_unless_the_module_flag_is_provided));
|
|
}
|
|
// Cannot specify module gen target when in es6 or above
|
|
if (options.module && languageVersion >= 2 /* ES6 */) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Cannot_compile_modules_into_commonjs_amd_system_or_umd_when_targeting_ES6_or_higher));
|
|
}
|
|
// there has to be common source directory if user specified --outdir || --sourceRoot
|
|
// if user specified --mapRoot, there needs to be common source directory if there would be multiple files being emitted
|
|
if (options.outDir ||
|
|
options.sourceRoot ||
|
|
(options.mapRoot &&
|
|
(!options.out || firstExternalModuleSourceFile !== undefined))) {
|
|
if (options.rootDir && checkSourceFilesBelongToPath(files, options.rootDir)) {
|
|
// If a rootDir is specified and is valid use it as the commonSourceDirectory
|
|
commonSourceDirectory = ts.getNormalizedAbsolutePath(options.rootDir, host.getCurrentDirectory());
|
|
}
|
|
else {
|
|
// Compute the commonSourceDirectory from the input files
|
|
commonSourceDirectory = computeCommonSourceDirectory(files);
|
|
}
|
|
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;
|
|
}
|
|
}
|
|
if (options.noEmit) {
|
|
if (options.out || options.outDir) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_noEmit_cannot_be_specified_with_option_out_or_outDir));
|
|
}
|
|
if (options.declaration) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_noEmit_cannot_be_specified_with_option_declaration));
|
|
}
|
|
}
|
|
if (options.emitDecoratorMetadata &&
|
|
!options.experimentalDecorators) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_experimentalDecorators_must_also_be_specified_when_option_emitDecoratorMetadata_is_specified));
|
|
}
|
|
if (options.experimentalAsyncFunctions &&
|
|
options.target !== 2 /* ES6 */) {
|
|
diagnostics.add(ts.createCompilerDiagnostic(ts.Diagnostics.Option_experimentalAsyncFunctions_cannot_be_specified_when_targeting_ES5_or_lower));
|
|
}
|
|
}
|
|
}
|
|
ts.createProgram = createProgram;
|
|
})(ts || (ts = {}));
|
|
/// <reference path="sys.ts"/>
|
|
/// <reference path="types.ts"/>
|
|
/// <reference path="core.ts"/>
|
|
/// <reference path="scanner.ts"/>
|
|
var ts;
|
|
(function (ts) {
|
|
/* @internal */
|
|
ts.optionDeclarations = [
|
|
{
|
|
name: "charset",
|
|
type: "string"
|
|
},
|
|
{
|
|
name: "declaration",
|
|
shortName: "d",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Generates_corresponding_d_ts_file
|
|
},
|
|
{
|
|
name: "diagnostics",
|
|
type: "boolean"
|
|
},
|
|
{
|
|
name: "emitBOM",
|
|
type: "boolean"
|
|
},
|
|
{
|
|
name: "help",
|
|
shortName: "h",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Print_this_message
|
|
},
|
|
{
|
|
name: "inlineSourceMap",
|
|
type: "boolean"
|
|
},
|
|
{
|
|
name: "inlineSources",
|
|
type: "boolean"
|
|
},
|
|
{
|
|
name: "jsx",
|
|
type: {
|
|
"preserve": 1 /* Preserve */,
|
|
"react": 2 /* React */
|
|
},
|
|
paramType: ts.Diagnostics.KIND,
|
|
description: ts.Diagnostics.Specify_JSX_code_generation_Colon_preserve_or_react,
|
|
error: ts.Diagnostics.Argument_for_jsx_must_be_preserve_or_react
|
|
},
|
|
{
|
|
name: "listFiles",
|
|
type: "boolean"
|
|
},
|
|
{
|
|
name: "locale",
|
|
type: "string"
|
|
},
|
|
{
|
|
name: "mapRoot",
|
|
type: "string",
|
|
isFilePath: true,
|
|
description: ts.Diagnostics.Specifies_the_location_where_debugger_should_locate_map_files_instead_of_generated_locations,
|
|
paramType: ts.Diagnostics.LOCATION
|
|
},
|
|
{
|
|
name: "module",
|
|
shortName: "m",
|
|
type: {
|
|
"commonjs": 1 /* CommonJS */,
|
|
"amd": 2 /* AMD */,
|
|
"system": 4 /* System */,
|
|
"umd": 3 /* UMD */
|
|
},
|
|
description: ts.Diagnostics.Specify_module_code_generation_Colon_commonjs_amd_system_or_umd,
|
|
paramType: ts.Diagnostics.KIND,
|
|
error: ts.Diagnostics.Argument_for_module_option_must_be_commonjs_amd_system_or_umd
|
|
},
|
|
{
|
|
name: "newLine",
|
|
type: {
|
|
"crlf": 0 /* CarriageReturnLineFeed */,
|
|
"lf": 1 /* LineFeed */
|
|
},
|
|
description: ts.Diagnostics.Specifies_the_end_of_line_sequence_to_be_used_when_emitting_files_Colon_CRLF_dos_or_LF_unix,
|
|
paramType: ts.Diagnostics.NEWLINE,
|
|
error: ts.Diagnostics.Argument_for_newLine_option_must_be_CRLF_or_LF
|
|
},
|
|
{
|
|
name: "noEmit",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Do_not_emit_outputs
|
|
},
|
|
{
|
|
name: "noEmitHelpers",
|
|
type: "boolean"
|
|
},
|
|
{
|
|
name: "noEmitOnError",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Do_not_emit_outputs_if_any_errors_were_reported
|
|
},
|
|
{
|
|
name: "noImplicitAny",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Raise_error_on_expressions_and_declarations_with_an_implied_any_type
|
|
},
|
|
{
|
|
name: "noLib",
|
|
type: "boolean"
|
|
},
|
|
{
|
|
name: "noResolve",
|
|
type: "boolean"
|
|
},
|
|
{
|
|
name: "skipDefaultLibCheck",
|
|
type: "boolean"
|
|
},
|
|
{
|
|
name: "out",
|
|
type: "string",
|
|
isFilePath: true,
|
|
description: ts.Diagnostics.Concatenate_and_emit_output_to_single_file,
|
|
paramType: ts.Diagnostics.FILE
|
|
},
|
|
{
|
|
name: "outDir",
|
|
type: "string",
|
|
isFilePath: true,
|
|
description: ts.Diagnostics.Redirect_output_structure_to_the_directory,
|
|
paramType: ts.Diagnostics.DIRECTORY
|
|
},
|
|
{
|
|
name: "preserveConstEnums",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Do_not_erase_const_enum_declarations_in_generated_code
|
|
},
|
|
{
|
|
name: "project",
|
|
shortName: "p",
|
|
type: "string",
|
|
isFilePath: true,
|
|
description: ts.Diagnostics.Compile_the_project_in_the_given_directory,
|
|
paramType: ts.Diagnostics.DIRECTORY
|
|
},
|
|
{
|
|
name: "removeComments",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Do_not_emit_comments_to_output
|
|
},
|
|
{
|
|
name: "rootDir",
|
|
type: "string",
|
|
isFilePath: true,
|
|
description: ts.Diagnostics.Specifies_the_root_directory_of_input_files_Use_to_control_the_output_directory_structure_with_outDir,
|
|
paramType: ts.Diagnostics.LOCATION
|
|
},
|
|
{
|
|
name: "isolatedModules",
|
|
type: "boolean"
|
|
},
|
|
{
|
|
name: "sourceMap",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Generates_corresponding_map_file
|
|
},
|
|
{
|
|
name: "sourceRoot",
|
|
type: "string",
|
|
isFilePath: true,
|
|
description: ts.Diagnostics.Specifies_the_location_where_debugger_should_locate_TypeScript_files_instead_of_source_locations,
|
|
paramType: ts.Diagnostics.LOCATION
|
|
},
|
|
{
|
|
name: "suppressImplicitAnyIndexErrors",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Suppress_noImplicitAny_errors_for_indexing_objects_lacking_index_signatures
|
|
},
|
|
{
|
|
name: "stripInternal",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Do_not_emit_declarations_for_code_that_has_an_internal_annotation,
|
|
experimental: true
|
|
},
|
|
{
|
|
name: "target",
|
|
shortName: "t",
|
|
type: { "es3": 0 /* ES3 */, "es5": 1 /* ES5 */, "es6": 2 /* ES6 */ },
|
|
description: ts.Diagnostics.Specify_ECMAScript_target_version_Colon_ES3_default_ES5_or_ES6_experimental,
|
|
paramType: ts.Diagnostics.VERSION,
|
|
error: ts.Diagnostics.Argument_for_target_option_must_be_ES3_ES5_or_ES6
|
|
},
|
|
{
|
|
name: "version",
|
|
shortName: "v",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Print_the_compiler_s_version
|
|
},
|
|
{
|
|
name: "watch",
|
|
shortName: "w",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Watch_input_files
|
|
},
|
|
{
|
|
name: "experimentalAsyncFunctions",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Enables_experimental_support_for_ES7_async_functions
|
|
},
|
|
{
|
|
name: "experimentalDecorators",
|
|
type: "boolean",
|
|
description: ts.Diagnostics.Enables_experimental_support_for_ES7_decorators
|
|
},
|
|
{
|
|
name: "emitDecoratorMetadata",
|
|
type: "boolean",
|
|
experimental: true,
|
|
description: ts.Diagnostics.Enables_experimental_support_for_emitting_type_metadata_for_decorators
|
|
}
|
|
];
|
|
function parseCommandLine(commandLine) {
|
|
var options = {};
|
|
var fileNames = [];
|
|
var errors = [];
|
|
var shortOptionNames = {};
|
|
var optionNameMap = {};
|
|
ts.forEach(ts.optionDeclarations, function (option) {
|
|
optionNameMap[option.name.toLowerCase()] = option;
|
|
if (option.shortName) {
|
|
shortOptionNames[option.shortName] = option.name;
|
|
}
|
|
});
|
|
parseStrings(commandLine);
|
|
return {
|
|
options: options,
|
|
fileNames: fileNames,
|
|
errors: errors
|
|
};
|
|
function parseStrings(args) {
|
|
var i = 0;
|
|
while (i < args.length) {
|
|
var s = args[i++];
|
|
if (s.charCodeAt(0) === 64 /* at */) {
|
|
parseResponseFile(s.slice(1));
|
|
}
|
|
else if (s.charCodeAt(0) === 45 /* minus */) {
|
|
s = s.slice(s.charCodeAt(1) === 45 /* minus */ ? 2 : 1).toLowerCase();
|
|
// Try to translate short option names to their full equivalents.
|
|
if (ts.hasProperty(shortOptionNames, s)) {
|
|
s = shortOptionNames[s];
|
|
}
|
|
if (ts.hasProperty(optionNameMap, s)) {
|
|
var opt = optionNameMap[s];
|
|
// 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(ts.Diagnostics.Compiler_option_0_expects_an_argument, opt.name));
|
|
}
|
|
switch (opt.type) {
|
|
case "number":
|
|
options[opt.name] = parseInt(args[i++]);
|
|
break;
|
|
case "boolean":
|
|
options[opt.name] = true;
|
|
break;
|
|
case "string":
|
|
options[opt.name] = args[i++] || "";
|
|
break;
|
|
// If not a primitive, the possible types are specified in what is effectively a map of options.
|
|
default:
|
|
var map_2 = opt.type;
|
|
var key = (args[i++] || "").toLowerCase();
|
|
if (ts.hasProperty(map_2, key)) {
|
|
options[opt.name] = map_2[key];
|
|
}
|
|
else {
|
|
errors.push(ts.createCompilerDiagnostic(opt.error));
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Unknown_compiler_option_0, s));
|
|
}
|
|
}
|
|
else {
|
|
fileNames.push(s);
|
|
}
|
|
}
|
|
}
|
|
function parseResponseFile(fileName) {
|
|
var text = ts.sys.readFile(fileName);
|
|
if (!text) {
|
|
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.File_0_not_found, fileName));
|
|
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.parseCommandLine = parseCommandLine;
|
|
/**
|
|
* Read tsconfig.json file
|
|
* @param fileName The path to the config file
|
|
*/
|
|
function readConfigFile(fileName) {
|
|
var text = '';
|
|
try {
|
|
text = ts.sys.readFile(fileName);
|
|
}
|
|
catch (e) {
|
|
return { error: ts.createCompilerDiagnostic(ts.Diagnostics.Cannot_read_file_0_Colon_1, fileName, e.message) };
|
|
}
|
|
return parseConfigFileText(fileName, text);
|
|
}
|
|
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 parseConfigFileText(fileName, jsonText) {
|
|
try {
|
|
return { config: /\S/.test(jsonText) ? JSON.parse(jsonText) : {} };
|
|
}
|
|
catch (e) {
|
|
return { error: ts.createCompilerDiagnostic(ts.Diagnostics.Failed_to_parse_file_0_Colon_1, fileName, e.message) };
|
|
}
|
|
}
|
|
ts.parseConfigFileText = parseConfigFileText;
|
|
/**
|
|
* Parse the contents of a config file (tsconfig.json).
|
|
* @param json The contents of the config file to parse
|
|
* @param basePath A root directory to resolve relative path entries in the config
|
|
* file to. e.g. outDir
|
|
*/
|
|
function parseConfigFile(json, host, basePath) {
|
|
var errors = [];
|
|
return {
|
|
options: getCompilerOptions(),
|
|
fileNames: getFileNames(),
|
|
errors: errors
|
|
};
|
|
function getCompilerOptions() {
|
|
var options = {};
|
|
var optionNameMap = {};
|
|
ts.forEach(ts.optionDeclarations, function (option) {
|
|
optionNameMap[option.name] = option;
|
|
});
|
|
var jsonOptions = json["compilerOptions"];
|
|
if (jsonOptions) {
|
|
for (var id in jsonOptions) {
|
|
if (ts.hasProperty(optionNameMap, id)) {
|
|
var opt = optionNameMap[id];
|
|
var optType = opt.type;
|
|
var value = jsonOptions[id];
|
|
var expectedType = typeof optType === "string" ? optType : "string";
|
|
if (typeof value === expectedType) {
|
|
if (typeof optType !== "string") {
|
|
var key = value.toLowerCase();
|
|
if (ts.hasProperty(optType, key)) {
|
|
value = optType[key];
|
|
}
|
|
else {
|
|
errors.push(ts.createCompilerDiagnostic(opt.error));
|
|
value = 0;
|
|
}
|
|
}
|
|
if (opt.isFilePath) {
|
|
value = ts.normalizePath(ts.combinePaths(basePath, value));
|
|
}
|
|
options[opt.name] = value;
|
|
}
|
|
else {
|
|
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Compiler_option_0_requires_a_value_of_type_1, id, expectedType));
|
|
}
|
|
}
|
|
else {
|
|
errors.push(ts.createCompilerDiagnostic(ts.Diagnostics.Unknown_compiler_option_0, id));
|
|
}
|
|
}
|
|
}
|
|
return options;
|
|
}
|
|
function getFileNames() {
|
|
var fileNames = [];
|
|
if (ts.hasProperty(json, "files")) {
|
|
if (json["files"] instanceof Array) {
|
|
fileNames = ts.map(json["files"], function (s) { return ts.combinePaths(basePath, s); });
|
|
}
|
|
}
|
|
else {
|
|
var exclude = json["exclude"] instanceof Array ? ts.map(json["exclude"], ts.normalizeSlashes) : undefined;
|
|
var sysFiles = host.readDirectory(basePath, ".ts", exclude).concat(host.readDirectory(basePath, ".tsx", exclude));
|
|
for (var i = 0; i < sysFiles.length; i++) {
|
|
var name_27 = sysFiles[i];
|
|
if (ts.fileExtensionIs(name_27, ".d.ts")) {
|
|
var baseName = name_27.substr(0, name_27.length - ".d.ts".length);
|
|
if (!ts.contains(sysFiles, baseName + ".tsx") && !ts.contains(sysFiles, baseName + ".ts")) {
|
|
fileNames.push(name_27);
|
|
}
|
|
}
|
|
else if (ts.fileExtensionIs(name_27, ".ts")) {
|
|
if (!ts.contains(sysFiles, name_27 + "x")) {
|
|
fileNames.push(name_27);
|
|
}
|
|
}
|
|
else {
|
|
fileNames.push(name_27);
|
|
}
|
|
}
|
|
}
|
|
return fileNames;
|
|
}
|
|
}
|
|
ts.parseConfigFile = parseConfigFile;
|
|
})(ts || (ts = {}));
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var OutliningElementsCollector;
|
|
(function (OutliningElementsCollector) {
|
|
function collectElements(sourceFile) {
|
|
var elements = [];
|
|
var collapseText = "...";
|
|
function addOutliningSpan(hintSpanNode, startElement, endElement, autoCollapse) {
|
|
if (hintSpanNode && startElement && endElement) {
|
|
var span = {
|
|
textSpan: ts.createTextSpanFromBounds(startElement.pos, endElement.end),
|
|
hintSpan: ts.createTextSpanFromBounds(hintSpanNode.getStart(), hintSpanNode.end),
|
|
bannerText: collapseText,
|
|
autoCollapse: autoCollapse
|
|
};
|
|
elements.push(span);
|
|
}
|
|
}
|
|
function addOutliningSpanComments(commentSpan, autoCollapse) {
|
|
if (commentSpan) {
|
|
var span = {
|
|
textSpan: ts.createTextSpanFromBounds(commentSpan.pos, commentSpan.end),
|
|
hintSpan: ts.createTextSpanFromBounds(commentSpan.pos, commentSpan.end),
|
|
bannerText: collapseText,
|
|
autoCollapse: autoCollapse
|
|
};
|
|
elements.push(span);
|
|
}
|
|
}
|
|
function addOutliningForLeadingCommentsForNode(n) {
|
|
var comments = ts.getLeadingCommentRangesOfNode(n, sourceFile);
|
|
if (comments) {
|
|
var firstSingleLineCommentStart = -1;
|
|
var lastSingleLineCommentEnd = -1;
|
|
var isFirstSingleLineComment = true;
|
|
var singleLineCommentCount = 0;
|
|
for (var _i = 0; _i < comments.length; _i++) {
|
|
var currentComment = comments[_i];
|
|
// For single line comments, combine consecutive ones (2 or more) into
|
|
// a single span from the start of the first till the end of the last
|
|
if (currentComment.kind === 2 /* SingleLineCommentTrivia */) {
|
|
if (isFirstSingleLineComment) {
|
|
firstSingleLineCommentStart = currentComment.pos;
|
|
}
|
|
isFirstSingleLineComment = false;
|
|
lastSingleLineCommentEnd = currentComment.end;
|
|
singleLineCommentCount++;
|
|
}
|
|
else if (currentComment.kind === 3 /* MultiLineCommentTrivia */) {
|
|
combineAndAddMultipleSingleLineComments(singleLineCommentCount, firstSingleLineCommentStart, lastSingleLineCommentEnd);
|
|
addOutliningSpanComments(currentComment, false);
|
|
singleLineCommentCount = 0;
|
|
lastSingleLineCommentEnd = -1;
|
|
isFirstSingleLineComment = true;
|
|
}
|
|
}
|
|
combineAndAddMultipleSingleLineComments(singleLineCommentCount, firstSingleLineCommentStart, lastSingleLineCommentEnd);
|
|
}
|
|
}
|
|
function combineAndAddMultipleSingleLineComments(count, start, end) {
|
|
// Only outline spans of two or more consecutive single line comments
|
|
if (count > 1) {
|
|
var multipleSingleLineComments = {
|
|
pos: start,
|
|
end: end,
|
|
kind: 2 /* SingleLineCommentTrivia */
|
|
};
|
|
addOutliningSpanComments(multipleSingleLineComments, false);
|
|
}
|
|
}
|
|
function autoCollapse(node) {
|
|
return ts.isFunctionBlock(node) && node.parent.kind !== 171 /* ArrowFunction */;
|
|
}
|
|
var depth = 0;
|
|
var maxDepth = 20;
|
|
function walk(n) {
|
|
if (depth > maxDepth) {
|
|
return;
|
|
}
|
|
if (ts.isDeclaration(n)) {
|
|
addOutliningForLeadingCommentsForNode(n);
|
|
}
|
|
switch (n.kind) {
|
|
case 189 /* Block */:
|
|
if (!ts.isFunctionBlock(n)) {
|
|
var parent_8 = n.parent;
|
|
var openBrace = ts.findChildOfKind(n, 14 /* OpenBraceToken */, sourceFile);
|
|
var closeBrace = ts.findChildOfKind(n, 15 /* CloseBraceToken */, sourceFile);
|
|
// Check if the block is standalone, or 'attached' to some parent statement.
|
|
// If the latter, we want to collaps the block, but consider its hint span
|
|
// to be the entire span of the parent.
|
|
if (parent_8.kind === 194 /* DoStatement */ ||
|
|
parent_8.kind === 197 /* ForInStatement */ ||
|
|
parent_8.kind === 198 /* ForOfStatement */ ||
|
|
parent_8.kind === 196 /* ForStatement */ ||
|
|
parent_8.kind === 193 /* IfStatement */ ||
|
|
parent_8.kind === 195 /* WhileStatement */ ||
|
|
parent_8.kind === 202 /* WithStatement */ ||
|
|
parent_8.kind === 241 /* CatchClause */) {
|
|
addOutliningSpan(parent_8, openBrace, closeBrace, autoCollapse(n));
|
|
break;
|
|
}
|
|
if (parent_8.kind === 206 /* TryStatement */) {
|
|
// Could be the try-block, or the finally-block.
|
|
var tryStatement = parent_8;
|
|
if (tryStatement.tryBlock === n) {
|
|
addOutliningSpan(parent_8, openBrace, closeBrace, autoCollapse(n));
|
|
break;
|
|
}
|
|
else if (tryStatement.finallyBlock === n) {
|
|
var finallyKeyword = ts.findChildOfKind(tryStatement, 82 /* FinallyKeyword */, sourceFile);
|
|
if (finallyKeyword) {
|
|
addOutliningSpan(finallyKeyword, openBrace, closeBrace, autoCollapse(n));
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
// Block was a standalone block. In this case we want to only collapse
|
|
// the span of the block, independent of any parent span.
|
|
var span = ts.createTextSpanFromBounds(n.getStart(), n.end);
|
|
elements.push({
|
|
textSpan: span,
|
|
hintSpan: span,
|
|
bannerText: collapseText,
|
|
autoCollapse: autoCollapse(n)
|
|
});
|
|
break;
|
|
}
|
|
// Fallthrough.
|
|
case 216 /* ModuleBlock */: {
|
|
var openBrace = ts.findChildOfKind(n, 14 /* OpenBraceToken */, sourceFile);
|
|
var closeBrace = ts.findChildOfKind(n, 15 /* CloseBraceToken */, sourceFile);
|
|
addOutliningSpan(n.parent, openBrace, closeBrace, autoCollapse(n));
|
|
break;
|
|
}
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 162 /* ObjectLiteralExpression */:
|
|
case 217 /* CaseBlock */: {
|
|
var openBrace = ts.findChildOfKind(n, 14 /* OpenBraceToken */, sourceFile);
|
|
var closeBrace = ts.findChildOfKind(n, 15 /* CloseBraceToken */, sourceFile);
|
|
addOutliningSpan(n, openBrace, closeBrace, autoCollapse(n));
|
|
break;
|
|
}
|
|
case 161 /* ArrayLiteralExpression */:
|
|
var openBracket = ts.findChildOfKind(n, 18 /* OpenBracketToken */, sourceFile);
|
|
var closeBracket = ts.findChildOfKind(n, 19 /* CloseBracketToken */, sourceFile);
|
|
addOutliningSpan(n, openBracket, closeBracket, autoCollapse(n));
|
|
break;
|
|
}
|
|
depth++;
|
|
ts.forEachChild(n, walk);
|
|
depth--;
|
|
}
|
|
walk(sourceFile);
|
|
return elements;
|
|
}
|
|
OutliningElementsCollector.collectElements = collectElements;
|
|
})(OutliningElementsCollector = ts.OutliningElementsCollector || (ts.OutliningElementsCollector = {}));
|
|
})(ts || (ts = {}));
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var NavigateTo;
|
|
(function (NavigateTo) {
|
|
function getNavigateToItems(program, cancellationToken, searchValue, maxResultCount) {
|
|
var patternMatcher = ts.createPatternMatcher(searchValue);
|
|
var rawItems = [];
|
|
// Search the declarations in all files and output matched NavigateToItem into array of NavigateToItem[]
|
|
ts.forEach(program.getSourceFiles(), function (sourceFile) {
|
|
cancellationToken.throwIfCancellationRequested();
|
|
var nameToDeclarations = sourceFile.getNamedDeclarations();
|
|
for (var name_28 in nameToDeclarations) {
|
|
var declarations = ts.getProperty(nameToDeclarations, name_28);
|
|
if (declarations) {
|
|
// First do a quick check to see if the name of the declaration matches the
|
|
// last portion of the (possibly) dotted name they're searching for.
|
|
var matches = patternMatcher.getMatchesForLastSegmentOfPattern(name_28);
|
|
if (!matches) {
|
|
continue;
|
|
}
|
|
for (var _i = 0; _i < declarations.length; _i++) {
|
|
var declaration = declarations[_i];
|
|
// It was a match! If the pattern has dots in it, then also see if the
|
|
// declaration container matches as well.
|
|
if (patternMatcher.patternContainsDots) {
|
|
var containers = getContainers(declaration);
|
|
if (!containers) {
|
|
return undefined;
|
|
}
|
|
matches = patternMatcher.getMatches(containers, name_28);
|
|
if (!matches) {
|
|
continue;
|
|
}
|
|
}
|
|
var fileName = sourceFile.fileName;
|
|
var matchKind = bestMatchKind(matches);
|
|
rawItems.push({ name: name_28, fileName: fileName, matchKind: matchKind, isCaseSensitive: allMatchesAreCaseSensitive(matches), declaration: declaration });
|
|
}
|
|
}
|
|
}
|
|
});
|
|
rawItems.sort(compareNavigateToItems);
|
|
if (maxResultCount !== undefined) {
|
|
rawItems = rawItems.slice(0, maxResultCount);
|
|
}
|
|
var items = ts.map(rawItems, createNavigateToItem);
|
|
return items;
|
|
function allMatchesAreCaseSensitive(matches) {
|
|
ts.Debug.assert(matches.length > 0);
|
|
// This is a case sensitive match, only if all the submatches were case sensitive.
|
|
for (var _i = 0; _i < matches.length; _i++) {
|
|
var match = matches[_i];
|
|
if (!match.isCaseSensitive) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
function getTextOfIdentifierOrLiteral(node) {
|
|
if (node) {
|
|
if (node.kind === 66 /* Identifier */ ||
|
|
node.kind === 8 /* StringLiteral */ ||
|
|
node.kind === 7 /* NumericLiteral */) {
|
|
return node.text;
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function tryAddSingleDeclarationName(declaration, containers) {
|
|
if (declaration && declaration.name) {
|
|
var text = getTextOfIdentifierOrLiteral(declaration.name);
|
|
if (text !== undefined) {
|
|
containers.unshift(text);
|
|
}
|
|
else if (declaration.name.kind === 133 /* ComputedPropertyName */) {
|
|
return tryAddComputedPropertyName(declaration.name.expression, containers, true);
|
|
}
|
|
else {
|
|
// Don't know how to add this.
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
// Only added the names of computed properties if they're simple dotted expressions, like:
|
|
//
|
|
// [X.Y.Z]() { }
|
|
function tryAddComputedPropertyName(expression, containers, includeLastPortion) {
|
|
var text = getTextOfIdentifierOrLiteral(expression);
|
|
if (text !== undefined) {
|
|
if (includeLastPortion) {
|
|
containers.unshift(text);
|
|
}
|
|
return true;
|
|
}
|
|
if (expression.kind === 163 /* PropertyAccessExpression */) {
|
|
var propertyAccess = expression;
|
|
if (includeLastPortion) {
|
|
containers.unshift(propertyAccess.name.text);
|
|
}
|
|
return tryAddComputedPropertyName(propertyAccess.expression, containers, true);
|
|
}
|
|
return false;
|
|
}
|
|
function getContainers(declaration) {
|
|
var containers = [];
|
|
// First, if we started with a computed property name, then add all but the last
|
|
// portion into the container array.
|
|
if (declaration.name.kind === 133 /* ComputedPropertyName */) {
|
|
if (!tryAddComputedPropertyName(declaration.name.expression, containers, false)) {
|
|
return undefined;
|
|
}
|
|
}
|
|
// Now, walk up our containers, adding all their names to the container array.
|
|
declaration = ts.getContainerNode(declaration);
|
|
while (declaration) {
|
|
if (!tryAddSingleDeclarationName(declaration, containers)) {
|
|
return undefined;
|
|
}
|
|
declaration = ts.getContainerNode(declaration);
|
|
}
|
|
return containers;
|
|
}
|
|
function bestMatchKind(matches) {
|
|
ts.Debug.assert(matches.length > 0);
|
|
var bestMatchKind = ts.PatternMatchKind.camelCase;
|
|
for (var _i = 0; _i < matches.length; _i++) {
|
|
var match = matches[_i];
|
|
var kind = match.kind;
|
|
if (kind < bestMatchKind) {
|
|
bestMatchKind = kind;
|
|
}
|
|
}
|
|
return bestMatchKind;
|
|
}
|
|
// This means "compare in a case insensitive manner."
|
|
var baseSensitivity = { sensitivity: "base" };
|
|
function compareNavigateToItems(i1, i2) {
|
|
// TODO(cyrusn): get the gamut of comparisons that VS already uses here.
|
|
// Right now we just sort by kind first, and then by name of the item.
|
|
// We first sort case insensitively. So "Aaa" will come before "bar".
|
|
// Then we sort case sensitively, so "aaa" will come before "Aaa".
|
|
return i1.matchKind - i2.matchKind ||
|
|
i1.name.localeCompare(i2.name, undefined, baseSensitivity) ||
|
|
i1.name.localeCompare(i2.name);
|
|
}
|
|
function createNavigateToItem(rawItem) {
|
|
var declaration = rawItem.declaration;
|
|
var container = ts.getContainerNode(declaration);
|
|
return {
|
|
name: rawItem.name,
|
|
kind: ts.getNodeKind(declaration),
|
|
kindModifiers: ts.getNodeModifiers(declaration),
|
|
matchKind: ts.PatternMatchKind[rawItem.matchKind],
|
|
isCaseSensitive: rawItem.isCaseSensitive,
|
|
fileName: rawItem.fileName,
|
|
textSpan: ts.createTextSpanFromBounds(declaration.getStart(), declaration.getEnd()),
|
|
// TODO(jfreeman): What should be the containerName when the container has a computed name?
|
|
containerName: container && container.name ? container.name.text : "",
|
|
containerKind: container && container.name ? ts.getNodeKind(container) : ""
|
|
};
|
|
}
|
|
}
|
|
NavigateTo.getNavigateToItems = getNavigateToItems;
|
|
})(NavigateTo = ts.NavigateTo || (ts.NavigateTo = {}));
|
|
})(ts || (ts = {}));
|
|
/// <reference path='services.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var NavigationBar;
|
|
(function (NavigationBar) {
|
|
function getNavigationBarItems(sourceFile) {
|
|
// If the source file has any child items, then it included in the tree
|
|
// and takes lexical ownership of all other top-level items.
|
|
var hasGlobalNode = false;
|
|
return getItemsWorker(getTopLevelNodes(sourceFile), createTopLevelItem);
|
|
function getIndent(node) {
|
|
// If we have a global node in the tree,
|
|
// then it adds an extra layer of depth to all subnodes.
|
|
var indent = hasGlobalNode ? 1 : 0;
|
|
var current = node.parent;
|
|
while (current) {
|
|
switch (current.kind) {
|
|
case 215 /* ModuleDeclaration */:
|
|
// If we have a module declared as A.B.C, it is more "intuitive"
|
|
// to say it only has a single layer of depth
|
|
do {
|
|
current = current.parent;
|
|
} while (current.kind === 215 /* ModuleDeclaration */);
|
|
// fall through
|
|
case 211 /* ClassDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 210 /* FunctionDeclaration */:
|
|
indent++;
|
|
}
|
|
current = current.parent;
|
|
}
|
|
return indent;
|
|
}
|
|
function getChildNodes(nodes) {
|
|
var childNodes = [];
|
|
function visit(node) {
|
|
switch (node.kind) {
|
|
case 190 /* VariableStatement */:
|
|
ts.forEach(node.declarationList.declarations, visit);
|
|
break;
|
|
case 158 /* ObjectBindingPattern */:
|
|
case 159 /* ArrayBindingPattern */:
|
|
ts.forEach(node.elements, visit);
|
|
break;
|
|
case 225 /* ExportDeclaration */:
|
|
// Handle named exports case e.g.:
|
|
// export {a, b as B} from "mod";
|
|
if (node.exportClause) {
|
|
ts.forEach(node.exportClause.elements, visit);
|
|
}
|
|
break;
|
|
case 219 /* ImportDeclaration */:
|
|
var importClause = node.importClause;
|
|
if (importClause) {
|
|
// Handle default import case e.g.:
|
|
// import d from "mod";
|
|
if (importClause.name) {
|
|
childNodes.push(importClause);
|
|
}
|
|
// Handle named bindings in imports e.g.:
|
|
// import * as NS from "mod";
|
|
// import {a, b as B} from "mod";
|
|
if (importClause.namedBindings) {
|
|
if (importClause.namedBindings.kind === 221 /* NamespaceImport */) {
|
|
childNodes.push(importClause.namedBindings);
|
|
}
|
|
else {
|
|
ts.forEach(importClause.namedBindings.elements, visit);
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
case 160 /* BindingElement */:
|
|
case 208 /* VariableDeclaration */:
|
|
if (ts.isBindingPattern(node.name)) {
|
|
visit(node.name);
|
|
break;
|
|
}
|
|
// Fall through
|
|
case 211 /* ClassDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 215 /* ModuleDeclaration */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 223 /* ImportSpecifier */:
|
|
case 227 /* ExportSpecifier */:
|
|
childNodes.push(node);
|
|
break;
|
|
}
|
|
}
|
|
//for (let i = 0, n = nodes.length; i < n; i++) {
|
|
// let node = nodes[i];
|
|
// if (node.kind === SyntaxKind.ClassDeclaration ||
|
|
// node.kind === SyntaxKind.EnumDeclaration ||
|
|
// node.kind === SyntaxKind.InterfaceDeclaration ||
|
|
// node.kind === SyntaxKind.ModuleDeclaration ||
|
|
// node.kind === SyntaxKind.FunctionDeclaration) {
|
|
// childNodes.push(node);
|
|
// }
|
|
// else if (node.kind === SyntaxKind.VariableStatement) {
|
|
// childNodes.push.apply(childNodes, (<VariableStatement>node).declarations);
|
|
// }
|
|
//}
|
|
ts.forEach(nodes, visit);
|
|
return sortNodes(childNodes);
|
|
}
|
|
function getTopLevelNodes(node) {
|
|
var topLevelNodes = [];
|
|
topLevelNodes.push(node);
|
|
addTopLevelNodes(node.statements, topLevelNodes);
|
|
return topLevelNodes;
|
|
}
|
|
function sortNodes(nodes) {
|
|
return nodes.slice(0).sort(function (n1, n2) {
|
|
if (n1.name && n2.name) {
|
|
return ts.getPropertyNameForPropertyNameNode(n1.name).localeCompare(ts.getPropertyNameForPropertyNameNode(n2.name));
|
|
}
|
|
else if (n1.name) {
|
|
return 1;
|
|
}
|
|
else if (n2.name) {
|
|
return -1;
|
|
}
|
|
else {
|
|
return n1.kind - n2.kind;
|
|
}
|
|
});
|
|
}
|
|
function addTopLevelNodes(nodes, topLevelNodes) {
|
|
nodes = sortNodes(nodes);
|
|
for (var _i = 0; _i < nodes.length; _i++) {
|
|
var node = nodes[_i];
|
|
switch (node.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
topLevelNodes.push(node);
|
|
break;
|
|
case 215 /* ModuleDeclaration */:
|
|
var moduleDeclaration = node;
|
|
topLevelNodes.push(node);
|
|
addTopLevelNodes(getInnermostModule(moduleDeclaration).body.statements, topLevelNodes);
|
|
break;
|
|
case 210 /* FunctionDeclaration */:
|
|
var functionDeclaration = node;
|
|
if (isTopLevelFunctionDeclaration(functionDeclaration)) {
|
|
topLevelNodes.push(node);
|
|
addTopLevelNodes(functionDeclaration.body.statements, topLevelNodes);
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
function isTopLevelFunctionDeclaration(functionDeclaration) {
|
|
if (functionDeclaration.kind === 210 /* FunctionDeclaration */) {
|
|
// A function declaration is 'top level' if it contains any function declarations
|
|
// within it.
|
|
if (functionDeclaration.body && functionDeclaration.body.kind === 189 /* Block */) {
|
|
// Proper function declarations can only have identifier names
|
|
if (ts.forEach(functionDeclaration.body.statements, function (s) { return s.kind === 210 /* FunctionDeclaration */ && !isEmpty(s.name.text); })) {
|
|
return true;
|
|
}
|
|
// Or if it is not parented by another function. i.e all functions
|
|
// at module scope are 'top level'.
|
|
if (!ts.isFunctionBlock(functionDeclaration.parent)) {
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function getItemsWorker(nodes, createItem) {
|
|
var items = [];
|
|
var keyToItem = {};
|
|
for (var _i = 0; _i < nodes.length; _i++) {
|
|
var child = nodes[_i];
|
|
var item = createItem(child);
|
|
if (item !== undefined) {
|
|
if (item.text.length > 0) {
|
|
var key = item.text + "-" + item.kind + "-" + item.indent;
|
|
var itemWithSameName = keyToItem[key];
|
|
if (itemWithSameName) {
|
|
// We had an item with the same name. Merge these items together.
|
|
merge(itemWithSameName, item);
|
|
}
|
|
else {
|
|
keyToItem[key] = item;
|
|
items.push(item);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return items;
|
|
}
|
|
function merge(target, source) {
|
|
// First, add any spans in the source to the target.
|
|
ts.addRange(target.spans, source.spans);
|
|
if (source.childItems) {
|
|
if (!target.childItems) {
|
|
target.childItems = [];
|
|
}
|
|
// Next, recursively merge or add any children in the source as appropriate.
|
|
outer: for (var _i = 0, _a = source.childItems; _i < _a.length; _i++) {
|
|
var sourceChild = _a[_i];
|
|
for (var _b = 0, _c = target.childItems; _b < _c.length; _b++) {
|
|
var targetChild = _c[_b];
|
|
if (targetChild.text === sourceChild.text && targetChild.kind === sourceChild.kind) {
|
|
// Found a match. merge them.
|
|
merge(targetChild, sourceChild);
|
|
continue outer;
|
|
}
|
|
}
|
|
// Didn't find a match, just add this child to the list.
|
|
target.childItems.push(sourceChild);
|
|
}
|
|
}
|
|
}
|
|
function createChildItem(node) {
|
|
switch (node.kind) {
|
|
case 135 /* Parameter */:
|
|
if (ts.isBindingPattern(node.name)) {
|
|
break;
|
|
}
|
|
if ((node.flags & 2035 /* Modifier */) === 0) {
|
|
return undefined;
|
|
}
|
|
return createItem(node, getTextOfNode(node.name), ts.ScriptElementKind.memberVariableElement);
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
return createItem(node, getTextOfNode(node.name), ts.ScriptElementKind.memberFunctionElement);
|
|
case 142 /* GetAccessor */:
|
|
return createItem(node, getTextOfNode(node.name), ts.ScriptElementKind.memberGetAccessorElement);
|
|
case 143 /* SetAccessor */:
|
|
return createItem(node, getTextOfNode(node.name), ts.ScriptElementKind.memberSetAccessorElement);
|
|
case 146 /* IndexSignature */:
|
|
return createItem(node, "[]", ts.ScriptElementKind.indexSignatureElement);
|
|
case 244 /* EnumMember */:
|
|
return createItem(node, getTextOfNode(node.name), ts.ScriptElementKind.memberVariableElement);
|
|
case 144 /* CallSignature */:
|
|
return createItem(node, "()", ts.ScriptElementKind.callSignatureElement);
|
|
case 145 /* ConstructSignature */:
|
|
return createItem(node, "new()", ts.ScriptElementKind.constructSignatureElement);
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
return createItem(node, getTextOfNode(node.name), ts.ScriptElementKind.memberVariableElement);
|
|
case 210 /* FunctionDeclaration */:
|
|
return createItem(node, getTextOfNode(node.name), ts.ScriptElementKind.functionElement);
|
|
case 208 /* VariableDeclaration */:
|
|
case 160 /* BindingElement */:
|
|
var variableDeclarationNode;
|
|
var name_29;
|
|
if (node.kind === 160 /* BindingElement */) {
|
|
name_29 = node.name;
|
|
variableDeclarationNode = node;
|
|
// binding elements are added only for variable declarations
|
|
// bubble up to the containing variable declaration
|
|
while (variableDeclarationNode && variableDeclarationNode.kind !== 208 /* VariableDeclaration */) {
|
|
variableDeclarationNode = variableDeclarationNode.parent;
|
|
}
|
|
ts.Debug.assert(variableDeclarationNode !== undefined);
|
|
}
|
|
else {
|
|
ts.Debug.assert(!ts.isBindingPattern(node.name));
|
|
variableDeclarationNode = node;
|
|
name_29 = node.name;
|
|
}
|
|
if (ts.isConst(variableDeclarationNode)) {
|
|
return createItem(node, getTextOfNode(name_29), ts.ScriptElementKind.constElement);
|
|
}
|
|
else if (ts.isLet(variableDeclarationNode)) {
|
|
return createItem(node, getTextOfNode(name_29), ts.ScriptElementKind.letElement);
|
|
}
|
|
else {
|
|
return createItem(node, getTextOfNode(name_29), ts.ScriptElementKind.variableElement);
|
|
}
|
|
case 141 /* Constructor */:
|
|
return createItem(node, "constructor", ts.ScriptElementKind.constructorImplementationElement);
|
|
case 227 /* ExportSpecifier */:
|
|
case 223 /* ImportSpecifier */:
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 220 /* ImportClause */:
|
|
case 221 /* NamespaceImport */:
|
|
return createItem(node, getTextOfNode(node.name), ts.ScriptElementKind.alias);
|
|
}
|
|
return undefined;
|
|
function createItem(node, name, scriptElementKind) {
|
|
return getNavigationBarItem(name, scriptElementKind, ts.getNodeModifiers(node), [getNodeSpan(node)]);
|
|
}
|
|
}
|
|
function isEmpty(text) {
|
|
return !text || text.trim() === "";
|
|
}
|
|
function getNavigationBarItem(text, kind, kindModifiers, spans, childItems, indent) {
|
|
if (childItems === void 0) { childItems = []; }
|
|
if (indent === void 0) { indent = 0; }
|
|
if (isEmpty(text)) {
|
|
return undefined;
|
|
}
|
|
return {
|
|
text: text,
|
|
kind: kind,
|
|
kindModifiers: kindModifiers,
|
|
spans: spans,
|
|
childItems: childItems,
|
|
indent: indent,
|
|
bolded: false,
|
|
grayed: false
|
|
};
|
|
}
|
|
function createTopLevelItem(node) {
|
|
switch (node.kind) {
|
|
case 245 /* SourceFile */:
|
|
return createSourceFileItem(node);
|
|
case 211 /* ClassDeclaration */:
|
|
return createClassItem(node);
|
|
case 214 /* EnumDeclaration */:
|
|
return createEnumItem(node);
|
|
case 212 /* InterfaceDeclaration */:
|
|
return createIterfaceItem(node);
|
|
case 215 /* ModuleDeclaration */:
|
|
return createModuleItem(node);
|
|
case 210 /* FunctionDeclaration */:
|
|
return createFunctionItem(node);
|
|
}
|
|
return undefined;
|
|
function getModuleName(moduleDeclaration) {
|
|
// We want to maintain quotation marks.
|
|
if (moduleDeclaration.name.kind === 8 /* StringLiteral */) {
|
|
return getTextOfNode(moduleDeclaration.name);
|
|
}
|
|
// Otherwise, we need to aggregate each identifier to build up the qualified name.
|
|
var result = [];
|
|
result.push(moduleDeclaration.name.text);
|
|
while (moduleDeclaration.body && moduleDeclaration.body.kind === 215 /* ModuleDeclaration */) {
|
|
moduleDeclaration = moduleDeclaration.body;
|
|
result.push(moduleDeclaration.name.text);
|
|
}
|
|
return result.join(".");
|
|
}
|
|
function createModuleItem(node) {
|
|
var moduleName = getModuleName(node);
|
|
var childItems = getItemsWorker(getChildNodes(getInnermostModule(node).body.statements), createChildItem);
|
|
return getNavigationBarItem(moduleName, ts.ScriptElementKind.moduleElement, ts.getNodeModifiers(node), [getNodeSpan(node)], childItems, getIndent(node));
|
|
}
|
|
function createFunctionItem(node) {
|
|
if (node.body && node.body.kind === 189 /* Block */) {
|
|
var childItems = getItemsWorker(sortNodes(node.body.statements), createChildItem);
|
|
return getNavigationBarItem(!node.name ? "default" : node.name.text, ts.ScriptElementKind.functionElement, ts.getNodeModifiers(node), [getNodeSpan(node)], childItems, getIndent(node));
|
|
}
|
|
return undefined;
|
|
}
|
|
function createSourceFileItem(node) {
|
|
var childItems = getItemsWorker(getChildNodes(node.statements), createChildItem);
|
|
if (childItems === undefined || childItems.length === 0) {
|
|
return undefined;
|
|
}
|
|
hasGlobalNode = true;
|
|
var rootName = ts.isExternalModule(node)
|
|
? "\"" + ts.escapeString(ts.getBaseFileName(ts.removeFileExtension(ts.normalizePath(node.fileName)))) + "\""
|
|
: "<global>";
|
|
return getNavigationBarItem(rootName, ts.ScriptElementKind.moduleElement, ts.ScriptElementKindModifier.none, [getNodeSpan(node)], childItems);
|
|
}
|
|
function createClassItem(node) {
|
|
var childItems;
|
|
if (node.members) {
|
|
var constructor = ts.forEach(node.members, function (member) {
|
|
return member.kind === 141 /* Constructor */ && member;
|
|
});
|
|
// Add the constructor parameters in as children of the class (for property parameters).
|
|
// Note that *all non-binding pattern named* parameters will be added to the nodes array, but parameters that
|
|
// are not properties will be filtered out later by createChildItem.
|
|
var nodes = removeDynamicallyNamedProperties(node);
|
|
if (constructor) {
|
|
ts.addRange(nodes, ts.filter(constructor.parameters, function (p) { return !ts.isBindingPattern(p.name); }));
|
|
}
|
|
childItems = getItemsWorker(sortNodes(nodes), createChildItem);
|
|
}
|
|
var nodeName = !node.name ? "default" : node.name.text;
|
|
return getNavigationBarItem(nodeName, ts.ScriptElementKind.classElement, ts.getNodeModifiers(node), [getNodeSpan(node)], childItems, getIndent(node));
|
|
}
|
|
function createEnumItem(node) {
|
|
var childItems = getItemsWorker(sortNodes(removeComputedProperties(node)), createChildItem);
|
|
return getNavigationBarItem(node.name.text, ts.ScriptElementKind.enumElement, ts.getNodeModifiers(node), [getNodeSpan(node)], childItems, getIndent(node));
|
|
}
|
|
function createIterfaceItem(node) {
|
|
var childItems = getItemsWorker(sortNodes(removeDynamicallyNamedProperties(node)), createChildItem);
|
|
return getNavigationBarItem(node.name.text, ts.ScriptElementKind.interfaceElement, ts.getNodeModifiers(node), [getNodeSpan(node)], childItems, getIndent(node));
|
|
}
|
|
}
|
|
function removeComputedProperties(node) {
|
|
return ts.filter(node.members, function (member) { return member.name === undefined || member.name.kind !== 133 /* ComputedPropertyName */; });
|
|
}
|
|
/**
|
|
* Like removeComputedProperties, but retains the properties with well known symbol names
|
|
*/
|
|
function removeDynamicallyNamedProperties(node) {
|
|
return ts.filter(node.members, function (member) { return !ts.hasDynamicName(member); });
|
|
}
|
|
function getInnermostModule(node) {
|
|
while (node.body.kind === 215 /* ModuleDeclaration */) {
|
|
node = node.body;
|
|
}
|
|
return node;
|
|
}
|
|
function getNodeSpan(node) {
|
|
return node.kind === 245 /* SourceFile */
|
|
? ts.createTextSpanFromBounds(node.getFullStart(), node.getEnd())
|
|
: ts.createTextSpanFromBounds(node.getStart(), node.getEnd());
|
|
}
|
|
function getTextOfNode(node) {
|
|
return ts.getTextOfNodeFromSourceText(sourceFile.text, node);
|
|
}
|
|
}
|
|
NavigationBar.getNavigationBarItems = getNavigationBarItems;
|
|
})(NavigationBar = ts.NavigationBar || (ts.NavigationBar = {}));
|
|
})(ts || (ts = {}));
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
// Note(cyrusn): this enum is ordered from strongest match type to weakest match type.
|
|
(function (PatternMatchKind) {
|
|
PatternMatchKind[PatternMatchKind["exact"] = 0] = "exact";
|
|
PatternMatchKind[PatternMatchKind["prefix"] = 1] = "prefix";
|
|
PatternMatchKind[PatternMatchKind["substring"] = 2] = "substring";
|
|
PatternMatchKind[PatternMatchKind["camelCase"] = 3] = "camelCase";
|
|
})(ts.PatternMatchKind || (ts.PatternMatchKind = {}));
|
|
var PatternMatchKind = ts.PatternMatchKind;
|
|
function createPatternMatch(kind, punctuationStripped, isCaseSensitive, camelCaseWeight) {
|
|
return {
|
|
kind: kind,
|
|
punctuationStripped: punctuationStripped,
|
|
isCaseSensitive: isCaseSensitive,
|
|
camelCaseWeight: camelCaseWeight
|
|
};
|
|
}
|
|
function createPatternMatcher(pattern) {
|
|
// We'll often see the same candidate string many times when searching (For example, when
|
|
// we see the name of a module that is used everywhere, or the name of an overload). As
|
|
// such, we cache the information we compute about the candidate for the life of this
|
|
// pattern matcher so we don't have to compute it multiple times.
|
|
var stringToWordSpans = {};
|
|
pattern = pattern.trim();
|
|
var fullPatternSegment = createSegment(pattern);
|
|
var dotSeparatedSegments = pattern.split(".").map(function (p) { return createSegment(p.trim()); });
|
|
var invalidPattern = dotSeparatedSegments.length === 0 || ts.forEach(dotSeparatedSegments, segmentIsInvalid);
|
|
return {
|
|
getMatches: getMatches,
|
|
getMatchesForLastSegmentOfPattern: getMatchesForLastSegmentOfPattern,
|
|
patternContainsDots: dotSeparatedSegments.length > 1
|
|
};
|
|
// Quick checks so we can bail out when asked to match a candidate.
|
|
function skipMatch(candidate) {
|
|
return invalidPattern || !candidate;
|
|
}
|
|
function getMatchesForLastSegmentOfPattern(candidate) {
|
|
if (skipMatch(candidate)) {
|
|
return undefined;
|
|
}
|
|
return matchSegment(candidate, ts.lastOrUndefined(dotSeparatedSegments));
|
|
}
|
|
function getMatches(candidateContainers, candidate) {
|
|
if (skipMatch(candidate)) {
|
|
return undefined;
|
|
}
|
|
// First, check that the last part of the dot separated pattern matches the name of the
|
|
// candidate. If not, then there's no point in proceeding and doing the more
|
|
// expensive work.
|
|
var candidateMatch = matchSegment(candidate, ts.lastOrUndefined(dotSeparatedSegments));
|
|
if (!candidateMatch) {
|
|
return undefined;
|
|
}
|
|
candidateContainers = candidateContainers || [];
|
|
// -1 because the last part was checked against the name, and only the rest
|
|
// of the parts are checked against the container.
|
|
if (dotSeparatedSegments.length - 1 > candidateContainers.length) {
|
|
// There weren't enough container parts to match against the pattern parts.
|
|
// So this definitely doesn't match.
|
|
return undefined;
|
|
}
|
|
// So far so good. Now break up the container for the candidate and check if all
|
|
// the dotted parts match up correctly.
|
|
var totalMatch = candidateMatch;
|
|
for (var i = dotSeparatedSegments.length - 2, j = candidateContainers.length - 1; i >= 0; i--, j--) {
|
|
var segment = dotSeparatedSegments[i];
|
|
var containerName = candidateContainers[j];
|
|
var containerMatch = matchSegment(containerName, segment);
|
|
if (!containerMatch) {
|
|
// This container didn't match the pattern piece. So there's no match at all.
|
|
return undefined;
|
|
}
|
|
ts.addRange(totalMatch, containerMatch);
|
|
}
|
|
// Success, this symbol's full name matched against the dotted name the user was asking
|
|
// about.
|
|
return totalMatch;
|
|
}
|
|
function getWordSpans(word) {
|
|
if (!ts.hasProperty(stringToWordSpans, word)) {
|
|
stringToWordSpans[word] = breakIntoWordSpans(word);
|
|
}
|
|
return stringToWordSpans[word];
|
|
}
|
|
function matchTextChunk(candidate, chunk, punctuationStripped) {
|
|
var index = indexOfIgnoringCase(candidate, chunk.textLowerCase);
|
|
if (index === 0) {
|
|
if (chunk.text.length === candidate.length) {
|
|
// a) Check if the part matches the candidate entirely, in an case insensitive or
|
|
// sensitive manner. If it does, return that there was an exact match.
|
|
return createPatternMatch(PatternMatchKind.exact, punctuationStripped, candidate === chunk.text);
|
|
}
|
|
else {
|
|
// b) Check if the part is a prefix of the candidate, in a case insensitive or sensitive
|
|
// manner. If it does, return that there was a prefix match.
|
|
return createPatternMatch(PatternMatchKind.prefix, punctuationStripped, startsWith(candidate, chunk.text));
|
|
}
|
|
}
|
|
var isLowercase = chunk.isLowerCase;
|
|
if (isLowercase) {
|
|
if (index > 0) {
|
|
// c) If the part is entirely lowercase, then check if it is contained anywhere in the
|
|
// candidate in a case insensitive manner. If so, return that there was a substring
|
|
// match.
|
|
//
|
|
// Note: We only have a substring match if the lowercase part is prefix match of some
|
|
// word part. That way we don't match something like 'Class' when the user types 'a'.
|
|
// But we would match 'FooAttribute' (since 'Attribute' starts with 'a').
|
|
var wordSpans = getWordSpans(candidate);
|
|
for (var _i = 0; _i < wordSpans.length; _i++) {
|
|
var span = wordSpans[_i];
|
|
if (partStartsWith(candidate, span, chunk.text, true)) {
|
|
return createPatternMatch(PatternMatchKind.substring, punctuationStripped,
|
|
/*isCaseSensitive:*/ partStartsWith(candidate, span, chunk.text, false));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
// d) If the part was not entirely lowercase, then check if it is contained in the
|
|
// candidate in a case *sensitive* manner. If so, return that there was a substring
|
|
// match.
|
|
if (candidate.indexOf(chunk.text) > 0) {
|
|
return createPatternMatch(PatternMatchKind.substring, punctuationStripped, true);
|
|
}
|
|
}
|
|
if (!isLowercase) {
|
|
// e) If the part was not entirely lowercase, then attempt a camel cased match as well.
|
|
if (chunk.characterSpans.length > 0) {
|
|
var candidateParts = getWordSpans(candidate);
|
|
var camelCaseWeight = tryCamelCaseMatch(candidate, candidateParts, chunk, false);
|
|
if (camelCaseWeight !== undefined) {
|
|
return createPatternMatch(PatternMatchKind.camelCase, punctuationStripped, true, camelCaseWeight);
|
|
}
|
|
camelCaseWeight = tryCamelCaseMatch(candidate, candidateParts, chunk, true);
|
|
if (camelCaseWeight !== undefined) {
|
|
return createPatternMatch(PatternMatchKind.camelCase, punctuationStripped, false, camelCaseWeight);
|
|
}
|
|
}
|
|
}
|
|
if (isLowercase) {
|
|
// f) Is the pattern a substring of the candidate starting on one of the candidate's word boundaries?
|
|
// We could check every character boundary start of the candidate for the pattern. However, that's
|
|
// an m * n operation in the wost case. Instead, find the first instance of the pattern
|
|
// substring, and see if it starts on a capital letter. It seems unlikely that the user will try to
|
|
// filter the list based on a substring that starts on a capital letter and also with a lowercase one.
|
|
// (Pattern: fogbar, Candidate: quuxfogbarFogBar).
|
|
if (chunk.text.length < candidate.length) {
|
|
if (index > 0 && isUpperCaseLetter(candidate.charCodeAt(index))) {
|
|
return createPatternMatch(PatternMatchKind.substring, punctuationStripped, false);
|
|
}
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function containsSpaceOrAsterisk(text) {
|
|
for (var i = 0; i < text.length; i++) {
|
|
var ch = text.charCodeAt(i);
|
|
if (ch === 32 /* space */ || ch === 42 /* asterisk */) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function matchSegment(candidate, segment) {
|
|
// First check if the segment matches as is. This is also useful if the segment contains
|
|
// characters we would normally strip when splitting into parts that we also may want to
|
|
// match in the candidate. For example if the segment is "@int" and the candidate is
|
|
// "@int", then that will show up as an exact match here.
|
|
//
|
|
// Note: if the segment contains a space or an asterisk then we must assume that it's a
|
|
// multi-word segment.
|
|
if (!containsSpaceOrAsterisk(segment.totalTextChunk.text)) {
|
|
var match = matchTextChunk(candidate, segment.totalTextChunk, false);
|
|
if (match) {
|
|
return [match];
|
|
}
|
|
}
|
|
// The logic for pattern matching is now as follows:
|
|
//
|
|
// 1) Break the segment passed in into words. Breaking is rather simple and a
|
|
// good way to think about it that if gives you all the individual alphanumeric words
|
|
// of the pattern.
|
|
//
|
|
// 2) For each word try to match the word against the candidate value.
|
|
//
|
|
// 3) Matching is as follows:
|
|
//
|
|
// a) Check if the word matches the candidate entirely, in an case insensitive or
|
|
// sensitive manner. If it does, return that there was an exact match.
|
|
//
|
|
// b) Check if the word is a prefix of the candidate, in a case insensitive or
|
|
// sensitive manner. If it does, return that there was a prefix match.
|
|
//
|
|
// c) If the word is entirely lowercase, then check if it is contained anywhere in the
|
|
// candidate in a case insensitive manner. If so, return that there was a substring
|
|
// match.
|
|
//
|
|
// Note: We only have a substring match if the lowercase part is prefix match of
|
|
// some word part. That way we don't match something like 'Class' when the user
|
|
// types 'a'. But we would match 'FooAttribute' (since 'Attribute' starts with
|
|
// 'a').
|
|
//
|
|
// d) If the word was not entirely lowercase, then check if it is contained in the
|
|
// candidate in a case *sensitive* manner. If so, return that there was a substring
|
|
// match.
|
|
//
|
|
// e) If the word was not entirely lowercase, then attempt a camel cased match as
|
|
// well.
|
|
//
|
|
// f) The word is all lower case. Is it a case insensitive substring of the candidate starting
|
|
// on a part boundary of the candidate?
|
|
//
|
|
// Only if all words have some sort of match is the pattern considered matched.
|
|
var subWordTextChunks = segment.subWordTextChunks;
|
|
var matches = undefined;
|
|
for (var _i = 0; _i < subWordTextChunks.length; _i++) {
|
|
var subWordTextChunk = subWordTextChunks[_i];
|
|
// Try to match the candidate with this word
|
|
var result = matchTextChunk(candidate, subWordTextChunk, true);
|
|
if (!result) {
|
|
return undefined;
|
|
}
|
|
matches = matches || [];
|
|
matches.push(result);
|
|
}
|
|
return matches;
|
|
}
|
|
function partStartsWith(candidate, candidateSpan, pattern, ignoreCase, patternSpan) {
|
|
var patternPartStart = patternSpan ? patternSpan.start : 0;
|
|
var patternPartLength = patternSpan ? patternSpan.length : pattern.length;
|
|
if (patternPartLength > candidateSpan.length) {
|
|
// Pattern part is longer than the candidate part. There can never be a match.
|
|
return false;
|
|
}
|
|
if (ignoreCase) {
|
|
for (var i = 0; i < patternPartLength; i++) {
|
|
var ch1 = pattern.charCodeAt(patternPartStart + i);
|
|
var ch2 = candidate.charCodeAt(candidateSpan.start + i);
|
|
if (toLowerCase(ch1) !== toLowerCase(ch2)) {
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
for (var i = 0; i < patternPartLength; i++) {
|
|
var ch1 = pattern.charCodeAt(patternPartStart + i);
|
|
var ch2 = candidate.charCodeAt(candidateSpan.start + i);
|
|
if (ch1 !== ch2) {
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
function tryCamelCaseMatch(candidate, candidateParts, chunk, ignoreCase) {
|
|
var chunkCharacterSpans = chunk.characterSpans;
|
|
// Note: we may have more pattern parts than candidate parts. This is because multiple
|
|
// pattern parts may match a candidate part. For example "SiUI" against "SimpleUI".
|
|
// We'll have 3 pattern parts Si/U/I against two candidate parts Simple/UI. However, U
|
|
// and I will both match in UI.
|
|
var currentCandidate = 0;
|
|
var currentChunkSpan = 0;
|
|
var firstMatch = undefined;
|
|
var contiguous = undefined;
|
|
while (true) {
|
|
// Let's consider our termination cases
|
|
if (currentChunkSpan === chunkCharacterSpans.length) {
|
|
// We did match! We shall assign a weight to this
|
|
var weight = 0;
|
|
// Was this contiguous?
|
|
if (contiguous) {
|
|
weight += 1;
|
|
}
|
|
// Did we start at the beginning of the candidate?
|
|
if (firstMatch === 0) {
|
|
weight += 2;
|
|
}
|
|
return weight;
|
|
}
|
|
else if (currentCandidate === candidateParts.length) {
|
|
// No match, since we still have more of the pattern to hit
|
|
return undefined;
|
|
}
|
|
var candidatePart = candidateParts[currentCandidate];
|
|
var gotOneMatchThisCandidate = false;
|
|
// Consider the case of matching SiUI against SimpleUIElement. The candidate parts
|
|
// will be Simple/UI/Element, and the pattern parts will be Si/U/I. We'll match 'Si'
|
|
// against 'Simple' first. Then we'll match 'U' against 'UI'. However, we want to
|
|
// still keep matching pattern parts against that candidate part.
|
|
for (; currentChunkSpan < chunkCharacterSpans.length; currentChunkSpan++) {
|
|
var chunkCharacterSpan = chunkCharacterSpans[currentChunkSpan];
|
|
if (gotOneMatchThisCandidate) {
|
|
// We've already gotten one pattern part match in this candidate. We will
|
|
// only continue trying to consumer pattern parts if the last part and this
|
|
// part are both upper case.
|
|
if (!isUpperCaseLetter(chunk.text.charCodeAt(chunkCharacterSpans[currentChunkSpan - 1].start)) ||
|
|
!isUpperCaseLetter(chunk.text.charCodeAt(chunkCharacterSpans[currentChunkSpan].start))) {
|
|
break;
|
|
}
|
|
}
|
|
if (!partStartsWith(candidate, candidatePart, chunk.text, ignoreCase, chunkCharacterSpan)) {
|
|
break;
|
|
}
|
|
gotOneMatchThisCandidate = true;
|
|
firstMatch = firstMatch === undefined ? currentCandidate : firstMatch;
|
|
// If we were contiguous, then keep that value. If we weren't, then keep that
|
|
// value. If we don't know, then set the value to 'true' as an initial match is
|
|
// obviously contiguous.
|
|
contiguous = contiguous === undefined ? true : contiguous;
|
|
candidatePart = ts.createTextSpan(candidatePart.start + chunkCharacterSpan.length, candidatePart.length - chunkCharacterSpan.length);
|
|
}
|
|
// Check if we matched anything at all. If we didn't, then we need to unset the
|
|
// contiguous bit if we currently had it set.
|
|
// If we haven't set the bit yet, then that means we haven't matched anything so
|
|
// far, and we don't want to change that.
|
|
if (!gotOneMatchThisCandidate && contiguous !== undefined) {
|
|
contiguous = false;
|
|
}
|
|
// Move onto the next candidate.
|
|
currentCandidate++;
|
|
}
|
|
}
|
|
}
|
|
ts.createPatternMatcher = createPatternMatcher;
|
|
// Helper function to compare two matches to determine which is better. Matches are first
|
|
// ordered by kind (so all prefix matches always beat all substring matches). Then, if the
|
|
// match is a camel case match, the relative weights of the match are used to determine
|
|
// which is better (with a greater weight being better). Then if the match is of the same
|
|
// type, then a case sensitive match is considered better than an insensitive one.
|
|
function patternMatchCompareTo(match1, match2) {
|
|
return compareType(match1, match2) ||
|
|
compareCamelCase(match1, match2) ||
|
|
compareCase(match1, match2) ||
|
|
comparePunctuation(match1, match2);
|
|
}
|
|
function comparePunctuation(result1, result2) {
|
|
// Consider a match to be better if it was successful without stripping punctuation
|
|
// versus a match that had to strip punctuation to succeed.
|
|
if (result1.punctuationStripped !== result2.punctuationStripped) {
|
|
return result1.punctuationStripped ? 1 : -1;
|
|
}
|
|
return 0;
|
|
}
|
|
function compareCase(result1, result2) {
|
|
if (result1.isCaseSensitive !== result2.isCaseSensitive) {
|
|
return result1.isCaseSensitive ? -1 : 1;
|
|
}
|
|
return 0;
|
|
}
|
|
function compareType(result1, result2) {
|
|
return result1.kind - result2.kind;
|
|
}
|
|
function compareCamelCase(result1, result2) {
|
|
if (result1.kind === PatternMatchKind.camelCase && result2.kind === PatternMatchKind.camelCase) {
|
|
// Swap the values here. If result1 has a higher weight, then we want it to come
|
|
// first.
|
|
return result2.camelCaseWeight - result1.camelCaseWeight;
|
|
}
|
|
return 0;
|
|
}
|
|
function createSegment(text) {
|
|
return {
|
|
totalTextChunk: createTextChunk(text),
|
|
subWordTextChunks: breakPatternIntoTextChunks(text)
|
|
};
|
|
}
|
|
// A segment is considered invalid if we couldn't find any words in it.
|
|
function segmentIsInvalid(segment) {
|
|
return segment.subWordTextChunks.length === 0;
|
|
}
|
|
function isUpperCaseLetter(ch) {
|
|
// Fast check for the ascii range.
|
|
if (ch >= 65 /* A */ && ch <= 90 /* Z */) {
|
|
return true;
|
|
}
|
|
if (ch < 127 /* maxAsciiCharacter */ || !ts.isUnicodeIdentifierStart(ch, 2 /* Latest */)) {
|
|
return false;
|
|
}
|
|
// TODO: find a way to determine this for any unicode characters in a
|
|
// non-allocating manner.
|
|
var str = String.fromCharCode(ch);
|
|
return str === str.toUpperCase();
|
|
}
|
|
function isLowerCaseLetter(ch) {
|
|
// Fast check for the ascii range.
|
|
if (ch >= 97 /* a */ && ch <= 122 /* z */) {
|
|
return true;
|
|
}
|
|
if (ch < 127 /* maxAsciiCharacter */ || !ts.isUnicodeIdentifierStart(ch, 2 /* Latest */)) {
|
|
return false;
|
|
}
|
|
// TODO: find a way to determine this for any unicode characters in a
|
|
// non-allocating manner.
|
|
var str = String.fromCharCode(ch);
|
|
return str === str.toLowerCase();
|
|
}
|
|
function containsUpperCaseLetter(string) {
|
|
for (var i = 0, n = string.length; i < n; i++) {
|
|
if (isUpperCaseLetter(string.charCodeAt(i))) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function startsWith(string, search) {
|
|
for (var i = 0, n = search.length; i < n; i++) {
|
|
if (string.charCodeAt(i) !== search.charCodeAt(i)) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
// Assumes 'value' is already lowercase.
|
|
function indexOfIgnoringCase(string, value) {
|
|
for (var i = 0, n = string.length - value.length; i <= n; i++) {
|
|
if (startsWithIgnoringCase(string, value, i)) {
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
// Assumes 'value' is already lowercase.
|
|
function startsWithIgnoringCase(string, value, start) {
|
|
for (var i = 0, n = value.length; i < n; i++) {
|
|
var ch1 = toLowerCase(string.charCodeAt(i + start));
|
|
var ch2 = value.charCodeAt(i);
|
|
if (ch1 !== ch2) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
function toLowerCase(ch) {
|
|
// Fast convert for the ascii range.
|
|
if (ch >= 65 /* A */ && ch <= 90 /* Z */) {
|
|
return 97 /* a */ + (ch - 65 /* A */);
|
|
}
|
|
if (ch < 127 /* maxAsciiCharacter */) {
|
|
return ch;
|
|
}
|
|
// TODO: find a way to compute this for any unicode characters in a
|
|
// non-allocating manner.
|
|
return String.fromCharCode(ch).toLowerCase().charCodeAt(0);
|
|
}
|
|
function isDigit(ch) {
|
|
// TODO(cyrusn): Find a way to support this for unicode digits.
|
|
return ch >= 48 /* _0 */ && ch <= 57 /* _9 */;
|
|
}
|
|
function isWordChar(ch) {
|
|
return isUpperCaseLetter(ch) || isLowerCaseLetter(ch) || isDigit(ch) || ch === 95 /* _ */ || ch === 36 /* $ */;
|
|
}
|
|
function breakPatternIntoTextChunks(pattern) {
|
|
var result = [];
|
|
var wordStart = 0;
|
|
var wordLength = 0;
|
|
for (var i = 0; i < pattern.length; i++) {
|
|
var ch = pattern.charCodeAt(i);
|
|
if (isWordChar(ch)) {
|
|
if (wordLength++ === 0) {
|
|
wordStart = i;
|
|
}
|
|
}
|
|
else {
|
|
if (wordLength > 0) {
|
|
result.push(createTextChunk(pattern.substr(wordStart, wordLength)));
|
|
wordLength = 0;
|
|
}
|
|
}
|
|
}
|
|
if (wordLength > 0) {
|
|
result.push(createTextChunk(pattern.substr(wordStart, wordLength)));
|
|
}
|
|
return result;
|
|
}
|
|
function createTextChunk(text) {
|
|
var textLowerCase = text.toLowerCase();
|
|
return {
|
|
text: text,
|
|
textLowerCase: textLowerCase,
|
|
isLowerCase: text === textLowerCase,
|
|
characterSpans: breakIntoCharacterSpans(text)
|
|
};
|
|
}
|
|
/* @internal */ function breakIntoCharacterSpans(identifier) {
|
|
return breakIntoSpans(identifier, false);
|
|
}
|
|
ts.breakIntoCharacterSpans = breakIntoCharacterSpans;
|
|
/* @internal */ function breakIntoWordSpans(identifier) {
|
|
return breakIntoSpans(identifier, true);
|
|
}
|
|
ts.breakIntoWordSpans = breakIntoWordSpans;
|
|
function breakIntoSpans(identifier, word) {
|
|
var result = [];
|
|
var wordStart = 0;
|
|
for (var i = 1, n = identifier.length; i < n; i++) {
|
|
var lastIsDigit = isDigit(identifier.charCodeAt(i - 1));
|
|
var currentIsDigit = isDigit(identifier.charCodeAt(i));
|
|
var hasTransitionFromLowerToUpper = transitionFromLowerToUpper(identifier, word, i);
|
|
var hasTransitionFromUpperToLower = transitionFromUpperToLower(identifier, word, i, wordStart);
|
|
if (charIsPunctuation(identifier.charCodeAt(i - 1)) ||
|
|
charIsPunctuation(identifier.charCodeAt(i)) ||
|
|
lastIsDigit !== currentIsDigit ||
|
|
hasTransitionFromLowerToUpper ||
|
|
hasTransitionFromUpperToLower) {
|
|
if (!isAllPunctuation(identifier, wordStart, i)) {
|
|
result.push(ts.createTextSpan(wordStart, i - wordStart));
|
|
}
|
|
wordStart = i;
|
|
}
|
|
}
|
|
if (!isAllPunctuation(identifier, wordStart, identifier.length)) {
|
|
result.push(ts.createTextSpan(wordStart, identifier.length - wordStart));
|
|
}
|
|
return result;
|
|
}
|
|
function charIsPunctuation(ch) {
|
|
switch (ch) {
|
|
case 33 /* exclamation */:
|
|
case 34 /* doubleQuote */:
|
|
case 35 /* hash */:
|
|
case 37 /* percent */:
|
|
case 38 /* ampersand */:
|
|
case 39 /* singleQuote */:
|
|
case 40 /* openParen */:
|
|
case 41 /* closeParen */:
|
|
case 42 /* asterisk */:
|
|
case 44 /* comma */:
|
|
case 45 /* minus */:
|
|
case 46 /* dot */:
|
|
case 47 /* slash */:
|
|
case 58 /* colon */:
|
|
case 59 /* semicolon */:
|
|
case 63 /* question */:
|
|
case 64 /* at */:
|
|
case 91 /* openBracket */:
|
|
case 92 /* backslash */:
|
|
case 93 /* closeBracket */:
|
|
case 95 /* _ */:
|
|
case 123 /* openBrace */:
|
|
case 125 /* closeBrace */:
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function isAllPunctuation(identifier, start, end) {
|
|
for (var i = start; i < end; i++) {
|
|
var ch = identifier.charCodeAt(i);
|
|
// We don't consider _ or $ as punctuation as there may be things with that name.
|
|
if (!charIsPunctuation(ch) || ch === 95 /* _ */ || ch === 36 /* $ */) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
function transitionFromUpperToLower(identifier, word, index, wordStart) {
|
|
if (word) {
|
|
// Cases this supports:
|
|
// 1) IDisposable -> I, Disposable
|
|
// 2) UIElement -> UI, Element
|
|
// 3) HTMLDocument -> HTML, Document
|
|
//
|
|
// etc.
|
|
if (index !== wordStart &&
|
|
index + 1 < identifier.length) {
|
|
var currentIsUpper = isUpperCaseLetter(identifier.charCodeAt(index));
|
|
var nextIsLower = isLowerCaseLetter(identifier.charCodeAt(index + 1));
|
|
if (currentIsUpper && nextIsLower) {
|
|
// We have a transition from an upper to a lower letter here. But we only
|
|
// want to break if all the letters that preceded are uppercase. i.e. if we
|
|
// have "Foo" we don't want to break that into "F, oo". But if we have
|
|
// "IFoo" or "UIFoo", then we want to break that into "I, Foo" and "UI,
|
|
// Foo". i.e. the last uppercase letter belongs to the lowercase letters
|
|
// that follows. Note: this will make the following not split properly:
|
|
// "HELLOthere". However, these sorts of names do not show up in .Net
|
|
// programs.
|
|
for (var i = wordStart; i < index; i++) {
|
|
if (!isUpperCaseLetter(identifier.charCodeAt(i))) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function transitionFromLowerToUpper(identifier, word, index) {
|
|
var lastIsUpper = isUpperCaseLetter(identifier.charCodeAt(index - 1));
|
|
var currentIsUpper = isUpperCaseLetter(identifier.charCodeAt(index));
|
|
// See if the casing indicates we're starting a new word. Note: if we're breaking on
|
|
// words, then just seeing an upper case character isn't enough. Instead, it has to
|
|
// be uppercase and the previous character can't be uppercase.
|
|
//
|
|
// For example, breaking "AddMetadata" on words would make: Add Metadata
|
|
//
|
|
// on characters would be: A dd M etadata
|
|
//
|
|
// Break "AM" on words would be: AM
|
|
//
|
|
// on characters would be: A M
|
|
//
|
|
// We break the search string on characters. But we break the symbol name on words.
|
|
var transition = word
|
|
? (currentIsUpper && !lastIsUpper)
|
|
: currentIsUpper;
|
|
return transition;
|
|
}
|
|
})(ts || (ts = {}));
|
|
///<reference path='services.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var SignatureHelp;
|
|
(function (SignatureHelp) {
|
|
// A partially written generic type expression is not guaranteed to have the correct syntax tree. the expression could be parsed as less than/greater than expression or a comma expression
|
|
// or some other combination depending on what the user has typed so far. For the purposes of signature help we need to consider any location after "<" as a possible generic type reference.
|
|
// To do this, the method will back parse the expression starting at the position required. it will try to parse the current expression as a generic type expression, if it did succeed it
|
|
// will return the generic identifier that started the expression (e.g. "foo" in "foo<any, |"). It is then up to the caller to ensure that this is a valid generic expression through
|
|
// looking up the type. The method will also keep track of the parameter index inside the expression.
|
|
//public static isInPartiallyWrittenTypeArgumentList(syntaxTree: TypeScript.SyntaxTree, position: number): any {
|
|
// let token = Syntax.findTokenOnLeft(syntaxTree.sourceUnit(), position, /*includeSkippedTokens*/ true);
|
|
// if (token && TypeScript.Syntax.hasAncestorOfKind(token, TypeScript.SyntaxKind.TypeParameterList)) {
|
|
// // We are in the wrong generic list. bail out
|
|
// return null;
|
|
// }
|
|
// let stack = 0;
|
|
// let argumentIndex = 0;
|
|
// whileLoop:
|
|
// while (token) {
|
|
// switch (token.kind()) {
|
|
// case TypeScript.SyntaxKind.LessThanToken:
|
|
// if (stack === 0) {
|
|
// // Found the beginning of the generic argument expression
|
|
// let lessThanToken = token;
|
|
// token = previousToken(token, /*includeSkippedTokens*/ true);
|
|
// if (!token || token.kind() !== TypeScript.SyntaxKind.IdentifierName) {
|
|
// break whileLoop;
|
|
// }
|
|
// // Found the name, return the data
|
|
// return {
|
|
// genericIdentifer: token,
|
|
// lessThanToken: lessThanToken,
|
|
// argumentIndex: argumentIndex
|
|
// };
|
|
// }
|
|
// else if (stack < 0) {
|
|
// // Seen one too many less than tokens, bail out
|
|
// break whileLoop;
|
|
// }
|
|
// else {
|
|
// stack--;
|
|
// }
|
|
// break;
|
|
// case TypeScript.SyntaxKind.GreaterThanGreaterThanGreaterThanToken:
|
|
// stack++;
|
|
// // Intentaion fall through
|
|
// case TypeScript.SyntaxKind.GreaterThanToken:
|
|
// stack++;
|
|
// break;
|
|
// case TypeScript.SyntaxKind.CommaToken:
|
|
// if (stack == 0) {
|
|
// argumentIndex++;
|
|
// }
|
|
// break;
|
|
// case TypeScript.SyntaxKind.CloseBraceToken:
|
|
// // This can be object type, skip untill we find the matching open brace token
|
|
// let unmatchedOpenBraceTokens = 0;
|
|
// // Skip untill the matching open brace token
|
|
// token = SignatureInfoHelpers.moveBackUpTillMatchingTokenKind(token, TypeScript.SyntaxKind.CloseBraceToken, TypeScript.SyntaxKind.OpenBraceToken);
|
|
// if (!token) {
|
|
// // No matching token was found. bail out
|
|
// break whileLoop;
|
|
// }
|
|
// break;
|
|
// case TypeScript.SyntaxKind.EqualsGreaterThanToken:
|
|
// // This can be a function type or a constructor type. In either case, we want to skip the function defintion
|
|
// token = previousToken(token, /*includeSkippedTokens*/ true);
|
|
// if (token && token.kind() === TypeScript.SyntaxKind.CloseParenToken) {
|
|
// // Skip untill the matching open paren token
|
|
// token = SignatureInfoHelpers.moveBackUpTillMatchingTokenKind(token, TypeScript.SyntaxKind.CloseParenToken, TypeScript.SyntaxKind.OpenParenToken);
|
|
// if (token && token.kind() === TypeScript.SyntaxKind.GreaterThanToken) {
|
|
// // Another generic type argument list, skip it\
|
|
// token = SignatureInfoHelpers.moveBackUpTillMatchingTokenKind(token, TypeScript.SyntaxKind.GreaterThanToken, TypeScript.SyntaxKind.LessThanToken);
|
|
// }
|
|
// if (token && token.kind() === TypeScript.SyntaxKind.NewKeyword) {
|
|
// // In case this was a constructor type, skip the new keyword
|
|
// token = previousToken(token, /*includeSkippedTokens*/ true);
|
|
// }
|
|
// if (!token) {
|
|
// // No matching token was found. bail out
|
|
// break whileLoop;
|
|
// }
|
|
// }
|
|
// else {
|
|
// // This is not a funtion type. exit the main loop
|
|
// break whileLoop;
|
|
// }
|
|
// break;
|
|
// case TypeScript.SyntaxKind.IdentifierName:
|
|
// case TypeScript.SyntaxKind.AnyKeyword:
|
|
// case TypeScript.SyntaxKind.NumberKeyword:
|
|
// case TypeScript.SyntaxKind.StringKeyword:
|
|
// case TypeScript.SyntaxKind.VoidKeyword:
|
|
// case TypeScript.SyntaxKind.BooleanKeyword:
|
|
// case TypeScript.SyntaxKind.DotToken:
|
|
// case TypeScript.SyntaxKind.OpenBracketToken:
|
|
// case TypeScript.SyntaxKind.CloseBracketToken:
|
|
// // Valid tokens in a type name. Skip.
|
|
// break;
|
|
// default:
|
|
// break whileLoop;
|
|
// }
|
|
// token = previousToken(token, /*includeSkippedTokens*/ true);
|
|
// }
|
|
// return null;
|
|
//}
|
|
//private static moveBackUpTillMatchingTokenKind(token: TypeScript.ISyntaxToken, tokenKind: TypeScript.SyntaxKind, matchingTokenKind: TypeScript.SyntaxKind): TypeScript.ISyntaxToken {
|
|
// if (!token || token.kind() !== tokenKind) {
|
|
// throw TypeScript.Errors.invalidOperation();
|
|
// }
|
|
// // Skip the current token
|
|
// token = previousToken(token, /*includeSkippedTokens*/ true);
|
|
// let stack = 0;
|
|
// while (token) {
|
|
// if (token.kind() === matchingTokenKind) {
|
|
// if (stack === 0) {
|
|
// // Found the matching token, return
|
|
// return token;
|
|
// }
|
|
// else if (stack < 0) {
|
|
// // tokens overlapped.. bail out.
|
|
// break;
|
|
// }
|
|
// else {
|
|
// stack--;
|
|
// }
|
|
// }
|
|
// else if (token.kind() === tokenKind) {
|
|
// stack++;
|
|
// }
|
|
// // Move back
|
|
// token = previousToken(token, /*includeSkippedTokens*/ true);
|
|
// }
|
|
// // Did not find matching token
|
|
// return null;
|
|
//}
|
|
var emptyArray = [];
|
|
var ArgumentListKind;
|
|
(function (ArgumentListKind) {
|
|
ArgumentListKind[ArgumentListKind["TypeArguments"] = 0] = "TypeArguments";
|
|
ArgumentListKind[ArgumentListKind["CallArguments"] = 1] = "CallArguments";
|
|
ArgumentListKind[ArgumentListKind["TaggedTemplateArguments"] = 2] = "TaggedTemplateArguments";
|
|
})(ArgumentListKind || (ArgumentListKind = {}));
|
|
function getSignatureHelpItems(program, sourceFile, position, cancellationToken) {
|
|
var typeChecker = program.getTypeChecker();
|
|
// Decide whether to show signature help
|
|
var startingToken = ts.findTokenOnLeftOfPosition(sourceFile, position);
|
|
if (!startingToken) {
|
|
// We are at the beginning of the file
|
|
return undefined;
|
|
}
|
|
var argumentInfo = getContainingArgumentInfo(startingToken);
|
|
cancellationToken.throwIfCancellationRequested();
|
|
// Semantic filtering of signature help
|
|
if (!argumentInfo) {
|
|
return undefined;
|
|
}
|
|
var call = argumentInfo.invocation;
|
|
var candidates = [];
|
|
var resolvedSignature = typeChecker.getResolvedSignature(call, candidates);
|
|
cancellationToken.throwIfCancellationRequested();
|
|
if (!candidates.length) {
|
|
// We didn't have any sig help items produced by the TS compiler. If this is a JS
|
|
// file, then see if we can figure out anything better.
|
|
if (ts.isJavaScript(sourceFile.fileName)) {
|
|
return createJavaScriptSignatureHelpItems(argumentInfo);
|
|
}
|
|
return undefined;
|
|
}
|
|
return createSignatureHelpItems(candidates, resolvedSignature, argumentInfo);
|
|
function createJavaScriptSignatureHelpItems(argumentInfo) {
|
|
if (argumentInfo.invocation.kind !== 165 /* CallExpression */) {
|
|
return undefined;
|
|
}
|
|
// See if we can find some symbol with the call expression name that has call signatures.
|
|
var callExpression = argumentInfo.invocation;
|
|
var expression = callExpression.expression;
|
|
var name = expression.kind === 66 /* Identifier */
|
|
? expression
|
|
: expression.kind === 163 /* PropertyAccessExpression */
|
|
? expression.name
|
|
: undefined;
|
|
if (!name || !name.text) {
|
|
return undefined;
|
|
}
|
|
var typeChecker = program.getTypeChecker();
|
|
for (var _i = 0, _a = program.getSourceFiles(); _i < _a.length; _i++) {
|
|
var sourceFile_1 = _a[_i];
|
|
var nameToDeclarations = sourceFile_1.getNamedDeclarations();
|
|
var declarations = ts.getProperty(nameToDeclarations, name.text);
|
|
if (declarations) {
|
|
for (var _b = 0; _b < declarations.length; _b++) {
|
|
var declaration = declarations[_b];
|
|
var symbol = declaration.symbol;
|
|
if (symbol) {
|
|
var type = typeChecker.getTypeOfSymbolAtLocation(symbol, declaration);
|
|
if (type) {
|
|
var callSignatures = type.getCallSignatures();
|
|
if (callSignatures && callSignatures.length) {
|
|
return createSignatureHelpItems(callSignatures, callSignatures[0], argumentInfo);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
/**
|
|
* Returns relevant information for the argument list and the current argument if we are
|
|
* in the argument of an invocation; returns undefined otherwise.
|
|
*/
|
|
function getImmediatelyContainingArgumentInfo(node) {
|
|
if (node.parent.kind === 165 /* CallExpression */ || node.parent.kind === 166 /* NewExpression */) {
|
|
var callExpression = node.parent;
|
|
// There are 3 cases to handle:
|
|
// 1. The token introduces a list, and should begin a sig help session
|
|
// 2. The token is either not associated with a list, or ends a list, so the session should end
|
|
// 3. The token is buried inside a list, and should give sig help
|
|
//
|
|
// The following are examples of each:
|
|
//
|
|
// Case 1:
|
|
// foo<#T, U>(#a, b) -> The token introduces a list, and should begin a sig help session
|
|
// Case 2:
|
|
// fo#o<T, U>#(a, b)# -> The token is either not associated with a list, or ends a list, so the session should end
|
|
// Case 3:
|
|
// foo<T#, U#>(a#, #b#) -> The token is buried inside a list, and should give sig help
|
|
// Find out if 'node' is an argument, a type argument, or neither
|
|
if (node.kind === 24 /* LessThanToken */ ||
|
|
node.kind === 16 /* OpenParenToken */) {
|
|
// Find the list that starts right *after* the < or ( token.
|
|
// If the user has just opened a list, consider this item 0.
|
|
var list = getChildListThatStartsWithOpenerToken(callExpression, node, sourceFile);
|
|
var isTypeArgList = callExpression.typeArguments && callExpression.typeArguments.pos === list.pos;
|
|
ts.Debug.assert(list !== undefined);
|
|
return {
|
|
kind: isTypeArgList ? 0 /* TypeArguments */ : 1 /* CallArguments */,
|
|
invocation: callExpression,
|
|
argumentsSpan: getApplicableSpanForArguments(list),
|
|
argumentIndex: 0,
|
|
argumentCount: getArgumentCount(list)
|
|
};
|
|
}
|
|
// findListItemInfo can return undefined if we are not in parent's argument list
|
|
// or type argument list. This includes cases where the cursor is:
|
|
// - To the right of the closing paren, non-substitution template, or template tail.
|
|
// - Between the type arguments and the arguments (greater than token)
|
|
// - On the target of the call (parent.func)
|
|
// - On the 'new' keyword in a 'new' expression
|
|
var listItemInfo = ts.findListItemInfo(node);
|
|
if (listItemInfo) {
|
|
var list = listItemInfo.list;
|
|
var isTypeArgList = callExpression.typeArguments && callExpression.typeArguments.pos === list.pos;
|
|
var argumentIndex = getArgumentIndex(list, node);
|
|
var argumentCount = getArgumentCount(list);
|
|
ts.Debug.assert(argumentIndex === 0 || argumentIndex < argumentCount, "argumentCount < argumentIndex, " + argumentCount + " < " + argumentIndex);
|
|
return {
|
|
kind: isTypeArgList ? 0 /* TypeArguments */ : 1 /* CallArguments */,
|
|
invocation: callExpression,
|
|
argumentsSpan: getApplicableSpanForArguments(list),
|
|
argumentIndex: argumentIndex,
|
|
argumentCount: argumentCount
|
|
};
|
|
}
|
|
}
|
|
else if (node.kind === 10 /* NoSubstitutionTemplateLiteral */ && node.parent.kind === 167 /* TaggedTemplateExpression */) {
|
|
// Check if we're actually inside the template;
|
|
// otherwise we'll fall out and return undefined.
|
|
if (ts.isInsideTemplateLiteral(node, position)) {
|
|
return getArgumentListInfoForTemplate(node.parent, 0);
|
|
}
|
|
}
|
|
else if (node.kind === 11 /* TemplateHead */ && node.parent.parent.kind === 167 /* TaggedTemplateExpression */) {
|
|
var templateExpression = node.parent;
|
|
var tagExpression = templateExpression.parent;
|
|
ts.Debug.assert(templateExpression.kind === 180 /* TemplateExpression */);
|
|
var argumentIndex = ts.isInsideTemplateLiteral(node, position) ? 0 : 1;
|
|
return getArgumentListInfoForTemplate(tagExpression, argumentIndex);
|
|
}
|
|
else if (node.parent.kind === 187 /* TemplateSpan */ && node.parent.parent.parent.kind === 167 /* TaggedTemplateExpression */) {
|
|
var templateSpan = node.parent;
|
|
var templateExpression = templateSpan.parent;
|
|
var tagExpression = templateExpression.parent;
|
|
ts.Debug.assert(templateExpression.kind === 180 /* TemplateExpression */);
|
|
// If we're just after a template tail, don't show signature help.
|
|
if (node.kind === 13 /* TemplateTail */ && !ts.isInsideTemplateLiteral(node, position)) {
|
|
return undefined;
|
|
}
|
|
var spanIndex = templateExpression.templateSpans.indexOf(templateSpan);
|
|
var argumentIndex = getArgumentIndexForTemplatePiece(spanIndex, node);
|
|
return getArgumentListInfoForTemplate(tagExpression, argumentIndex);
|
|
}
|
|
return undefined;
|
|
}
|
|
function getArgumentIndex(argumentsList, node) {
|
|
// The list we got back can include commas. In the presence of errors it may
|
|
// also just have nodes without commas. For example "Foo(a b c)" will have 3
|
|
// args without commas. We want to find what index we're at. So we count
|
|
// forward until we hit ourselves, only incrementing the index if it isn't a
|
|
// comma.
|
|
//
|
|
// Note: the subtlety around trailing commas (in getArgumentCount) does not apply
|
|
// here. That's because we're only walking forward until we hit the node we're
|
|
// on. In that case, even if we're after the trailing comma, we'll still see
|
|
// that trailing comma in the list, and we'll have generated the appropriate
|
|
// arg index.
|
|
var argumentIndex = 0;
|
|
var listChildren = argumentsList.getChildren();
|
|
for (var _i = 0; _i < listChildren.length; _i++) {
|
|
var child = listChildren[_i];
|
|
if (child === node) {
|
|
break;
|
|
}
|
|
if (child.kind !== 23 /* CommaToken */) {
|
|
argumentIndex++;
|
|
}
|
|
}
|
|
return argumentIndex;
|
|
}
|
|
function getArgumentCount(argumentsList) {
|
|
// The argument count for a list is normally the number of non-comma children it has.
|
|
// For example, if you have "Foo(a,b)" then there will be three children of the arg
|
|
// list 'a' '<comma>' 'b'. So, in this case the arg count will be 2. However, there
|
|
// is a small subtlety. If you have "Foo(a,)", then the child list will just have
|
|
// 'a' '<comma>'. So, in the case where the last child is a comma, we increase the
|
|
// arg count by one to compensate.
|
|
//
|
|
// Note: this subtlety only applies to the last comma. If you had "Foo(a,," then
|
|
// we'll have: 'a' '<comma>' '<missing>'
|
|
// That will give us 2 non-commas. We then add one for the last comma, givin us an
|
|
// arg count of 3.
|
|
var listChildren = argumentsList.getChildren();
|
|
var argumentCount = ts.countWhere(listChildren, function (arg) { return arg.kind !== 23 /* CommaToken */; });
|
|
if (listChildren.length > 0 && ts.lastOrUndefined(listChildren).kind === 23 /* CommaToken */) {
|
|
argumentCount++;
|
|
}
|
|
return argumentCount;
|
|
}
|
|
// spanIndex is either the index for a given template span.
|
|
// This does not give appropriate results for a NoSubstitutionTemplateLiteral
|
|
function getArgumentIndexForTemplatePiece(spanIndex, node) {
|
|
// Because the TemplateStringsArray is the first argument, we have to offset each substitution expression by 1.
|
|
// There are three cases we can encounter:
|
|
// 1. We are precisely in the template literal (argIndex = 0).
|
|
// 2. We are in or to the right of the substitution expression (argIndex = spanIndex + 1).
|
|
// 3. We are directly to the right of the template literal, but because we look for the token on the left,
|
|
// not enough to put us in the substitution expression; we should consider ourselves part of
|
|
// the *next* span's expression by offsetting the index (argIndex = (spanIndex + 1) + 1).
|
|
//
|
|
// Example: f `# abcd $#{# 1 + 1# }# efghi ${ #"#hello"# } # `
|
|
// ^ ^ ^ ^ ^ ^ ^ ^ ^
|
|
// Case: 1 1 3 2 1 3 2 2 1
|
|
ts.Debug.assert(position >= node.getStart(), "Assumed 'position' could not occur before node.");
|
|
if (ts.isTemplateLiteralKind(node.kind)) {
|
|
if (ts.isInsideTemplateLiteral(node, position)) {
|
|
return 0;
|
|
}
|
|
return spanIndex + 2;
|
|
}
|
|
return spanIndex + 1;
|
|
}
|
|
function getArgumentListInfoForTemplate(tagExpression, argumentIndex) {
|
|
// argumentCount is either 1 or (numSpans + 1) to account for the template strings array argument.
|
|
var argumentCount = tagExpression.template.kind === 10 /* NoSubstitutionTemplateLiteral */
|
|
? 1
|
|
: tagExpression.template.templateSpans.length + 1;
|
|
ts.Debug.assert(argumentIndex === 0 || argumentIndex < argumentCount, "argumentCount < argumentIndex, " + argumentCount + " < " + argumentIndex);
|
|
return {
|
|
kind: 2 /* TaggedTemplateArguments */,
|
|
invocation: tagExpression,
|
|
argumentsSpan: getApplicableSpanForTaggedTemplate(tagExpression),
|
|
argumentIndex: argumentIndex,
|
|
argumentCount: argumentCount
|
|
};
|
|
}
|
|
function getApplicableSpanForArguments(argumentsList) {
|
|
// We use full start and skip trivia on the end because we want to include trivia on
|
|
// both sides. For example,
|
|
//
|
|
// foo( /*comment */ a, b, c /*comment*/ )
|
|
// | |
|
|
//
|
|
// The applicable span is from the first bar to the second bar (inclusive,
|
|
// but not including parentheses)
|
|
var applicableSpanStart = argumentsList.getFullStart();
|
|
var applicableSpanEnd = ts.skipTrivia(sourceFile.text, argumentsList.getEnd(), false);
|
|
return ts.createTextSpan(applicableSpanStart, applicableSpanEnd - applicableSpanStart);
|
|
}
|
|
function getApplicableSpanForTaggedTemplate(taggedTemplate) {
|
|
var template = taggedTemplate.template;
|
|
var applicableSpanStart = template.getStart();
|
|
var applicableSpanEnd = template.getEnd();
|
|
// We need to adjust the end position for the case where the template does not have a tail.
|
|
// Otherwise, we will not show signature help past the expression.
|
|
// For example,
|
|
//
|
|
// ` ${ 1 + 1 foo(10)
|
|
// | |
|
|
//
|
|
// This is because a Missing node has no width. However, what we actually want is to include trivia
|
|
// leading up to the next token in case the user is about to type in a TemplateMiddle or TemplateTail.
|
|
if (template.kind === 180 /* TemplateExpression */) {
|
|
var lastSpan = ts.lastOrUndefined(template.templateSpans);
|
|
if (lastSpan.literal.getFullWidth() === 0) {
|
|
applicableSpanEnd = ts.skipTrivia(sourceFile.text, applicableSpanEnd, false);
|
|
}
|
|
}
|
|
return ts.createTextSpan(applicableSpanStart, applicableSpanEnd - applicableSpanStart);
|
|
}
|
|
function getContainingArgumentInfo(node) {
|
|
for (var n = node; n.kind !== 245 /* SourceFile */; n = n.parent) {
|
|
if (ts.isFunctionBlock(n)) {
|
|
return undefined;
|
|
}
|
|
// If the node is not a subspan of its parent, this is a big problem.
|
|
// There have been crashes that might be caused by this violation.
|
|
if (n.pos < n.parent.pos || n.end > n.parent.end) {
|
|
ts.Debug.fail("Node of kind " + n.kind + " is not a subspan of its parent of kind " + n.parent.kind);
|
|
}
|
|
var argumentInfo_1 = getImmediatelyContainingArgumentInfo(n);
|
|
if (argumentInfo_1) {
|
|
return argumentInfo_1;
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function getChildListThatStartsWithOpenerToken(parent, openerToken, sourceFile) {
|
|
var children = parent.getChildren(sourceFile);
|
|
var indexOfOpenerToken = children.indexOf(openerToken);
|
|
ts.Debug.assert(indexOfOpenerToken >= 0 && children.length > indexOfOpenerToken + 1);
|
|
return children[indexOfOpenerToken + 1];
|
|
}
|
|
/**
|
|
* The selectedItemIndex could be negative for several reasons.
|
|
* 1. There are too many arguments for all of the overloads
|
|
* 2. None of the overloads were type compatible
|
|
* The solution here is to try to pick the best overload by picking
|
|
* either the first one that has an appropriate number of parameters,
|
|
* or the one with the most parameters.
|
|
*/
|
|
function selectBestInvalidOverloadIndex(candidates, argumentCount) {
|
|
var maxParamsSignatureIndex = -1;
|
|
var maxParams = -1;
|
|
for (var i = 0; i < candidates.length; i++) {
|
|
var candidate = candidates[i];
|
|
if (candidate.hasRestParameter || candidate.parameters.length >= argumentCount) {
|
|
return i;
|
|
}
|
|
if (candidate.parameters.length > maxParams) {
|
|
maxParams = candidate.parameters.length;
|
|
maxParamsSignatureIndex = i;
|
|
}
|
|
}
|
|
return maxParamsSignatureIndex;
|
|
}
|
|
function createSignatureHelpItems(candidates, bestSignature, argumentListInfo) {
|
|
var applicableSpan = argumentListInfo.argumentsSpan;
|
|
var isTypeParameterList = argumentListInfo.kind === 0 /* TypeArguments */;
|
|
var invocation = argumentListInfo.invocation;
|
|
var callTarget = ts.getInvokedExpression(invocation);
|
|
var callTargetSymbol = typeChecker.getSymbolAtLocation(callTarget);
|
|
var callTargetDisplayParts = callTargetSymbol && ts.symbolToDisplayParts(typeChecker, callTargetSymbol, undefined, undefined);
|
|
var items = ts.map(candidates, function (candidateSignature) {
|
|
var signatureHelpParameters;
|
|
var prefixDisplayParts = [];
|
|
var suffixDisplayParts = [];
|
|
if (callTargetDisplayParts) {
|
|
ts.addRange(prefixDisplayParts, callTargetDisplayParts);
|
|
}
|
|
if (isTypeParameterList) {
|
|
prefixDisplayParts.push(ts.punctuationPart(24 /* LessThanToken */));
|
|
var typeParameters = candidateSignature.typeParameters;
|
|
signatureHelpParameters = typeParameters && typeParameters.length > 0 ? ts.map(typeParameters, createSignatureHelpParameterForTypeParameter) : emptyArray;
|
|
suffixDisplayParts.push(ts.punctuationPart(26 /* GreaterThanToken */));
|
|
var parameterParts = ts.mapToDisplayParts(function (writer) {
|
|
return typeChecker.getSymbolDisplayBuilder().buildDisplayForParametersAndDelimiters(candidateSignature.parameters, writer, invocation);
|
|
});
|
|
ts.addRange(suffixDisplayParts, parameterParts);
|
|
}
|
|
else {
|
|
var typeParameterParts = ts.mapToDisplayParts(function (writer) {
|
|
return typeChecker.getSymbolDisplayBuilder().buildDisplayForTypeParametersAndDelimiters(candidateSignature.typeParameters, writer, invocation);
|
|
});
|
|
ts.addRange(prefixDisplayParts, typeParameterParts);
|
|
prefixDisplayParts.push(ts.punctuationPart(16 /* OpenParenToken */));
|
|
var parameters = candidateSignature.parameters;
|
|
signatureHelpParameters = parameters.length > 0 ? ts.map(parameters, createSignatureHelpParameterForParameter) : emptyArray;
|
|
suffixDisplayParts.push(ts.punctuationPart(17 /* CloseParenToken */));
|
|
}
|
|
var returnTypeParts = ts.mapToDisplayParts(function (writer) {
|
|
return typeChecker.getSymbolDisplayBuilder().buildReturnTypeDisplay(candidateSignature, writer, invocation);
|
|
});
|
|
ts.addRange(suffixDisplayParts, returnTypeParts);
|
|
return {
|
|
isVariadic: candidateSignature.hasRestParameter,
|
|
prefixDisplayParts: prefixDisplayParts,
|
|
suffixDisplayParts: suffixDisplayParts,
|
|
separatorDisplayParts: [ts.punctuationPart(23 /* CommaToken */), ts.spacePart()],
|
|
parameters: signatureHelpParameters,
|
|
documentation: candidateSignature.getDocumentationComment()
|
|
};
|
|
});
|
|
var argumentIndex = argumentListInfo.argumentIndex;
|
|
// argumentCount is the *apparent* number of arguments.
|
|
var argumentCount = argumentListInfo.argumentCount;
|
|
var selectedItemIndex = candidates.indexOf(bestSignature);
|
|
if (selectedItemIndex < 0) {
|
|
selectedItemIndex = selectBestInvalidOverloadIndex(candidates, argumentCount);
|
|
}
|
|
ts.Debug.assert(argumentIndex === 0 || argumentIndex < argumentCount, "argumentCount < argumentIndex, " + argumentCount + " < " + argumentIndex);
|
|
return {
|
|
items: items,
|
|
applicableSpan: applicableSpan,
|
|
selectedItemIndex: selectedItemIndex,
|
|
argumentIndex: argumentIndex,
|
|
argumentCount: argumentCount
|
|
};
|
|
function createSignatureHelpParameterForParameter(parameter) {
|
|
var displayParts = ts.mapToDisplayParts(function (writer) {
|
|
return typeChecker.getSymbolDisplayBuilder().buildParameterDisplay(parameter, writer, invocation);
|
|
});
|
|
var isOptional = ts.hasQuestionToken(parameter.valueDeclaration);
|
|
return {
|
|
name: parameter.name,
|
|
documentation: parameter.getDocumentationComment(),
|
|
displayParts: displayParts,
|
|
isOptional: isOptional
|
|
};
|
|
}
|
|
function createSignatureHelpParameterForTypeParameter(typeParameter) {
|
|
var displayParts = ts.mapToDisplayParts(function (writer) {
|
|
return typeChecker.getSymbolDisplayBuilder().buildTypeParameterDisplay(typeParameter, writer, invocation);
|
|
});
|
|
return {
|
|
name: typeParameter.symbol.name,
|
|
documentation: emptyArray,
|
|
displayParts: displayParts,
|
|
isOptional: false
|
|
};
|
|
}
|
|
}
|
|
}
|
|
SignatureHelp.getSignatureHelpItems = getSignatureHelpItems;
|
|
})(SignatureHelp = ts.SignatureHelp || (ts.SignatureHelp = {}));
|
|
})(ts || (ts = {}));
|
|
// These utilities are common to multiple language service features.
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
function getEndLinePosition(line, sourceFile) {
|
|
ts.Debug.assert(line >= 0);
|
|
var lineStarts = sourceFile.getLineStarts();
|
|
var lineIndex = line;
|
|
if (lineIndex + 1 === lineStarts.length) {
|
|
// last line - return EOF
|
|
return sourceFile.text.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(sourceFile.text.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(sourceFile.text.charCodeAt(pos))) {
|
|
pos--;
|
|
}
|
|
return pos;
|
|
}
|
|
}
|
|
ts.getEndLinePosition = getEndLinePosition;
|
|
function getLineStartPositionForPosition(position, sourceFile) {
|
|
var lineStarts = sourceFile.getLineStarts();
|
|
var line = sourceFile.getLineAndCharacterOfPosition(position).line;
|
|
return lineStarts[line];
|
|
}
|
|
ts.getLineStartPositionForPosition = getLineStartPositionForPosition;
|
|
function rangeContainsRange(r1, r2) {
|
|
return startEndContainsRange(r1.pos, r1.end, r2);
|
|
}
|
|
ts.rangeContainsRange = rangeContainsRange;
|
|
function startEndContainsRange(start, end, range) {
|
|
return start <= range.pos && end >= range.end;
|
|
}
|
|
ts.startEndContainsRange = startEndContainsRange;
|
|
function rangeContainsStartEnd(range, start, end) {
|
|
return range.pos <= start && range.end >= end;
|
|
}
|
|
ts.rangeContainsStartEnd = rangeContainsStartEnd;
|
|
function rangeOverlapsWithStartEnd(r1, start, end) {
|
|
return startEndOverlapsWithStartEnd(r1.pos, r1.end, start, end);
|
|
}
|
|
ts.rangeOverlapsWithStartEnd = rangeOverlapsWithStartEnd;
|
|
function startEndOverlapsWithStartEnd(start1, end1, start2, end2) {
|
|
var start = Math.max(start1, start2);
|
|
var end = Math.min(end1, end2);
|
|
return start < end;
|
|
}
|
|
ts.startEndOverlapsWithStartEnd = startEndOverlapsWithStartEnd;
|
|
function positionBelongsToNode(candidate, position, sourceFile) {
|
|
return candidate.end > position || !isCompletedNode(candidate, sourceFile);
|
|
}
|
|
ts.positionBelongsToNode = positionBelongsToNode;
|
|
function isCompletedNode(n, sourceFile) {
|
|
if (ts.nodeIsMissing(n)) {
|
|
return false;
|
|
}
|
|
switch (n.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 162 /* ObjectLiteralExpression */:
|
|
case 158 /* ObjectBindingPattern */:
|
|
case 152 /* TypeLiteral */:
|
|
case 189 /* Block */:
|
|
case 216 /* ModuleBlock */:
|
|
case 217 /* CaseBlock */:
|
|
return nodeEndsWith(n, 15 /* CloseBraceToken */, sourceFile);
|
|
case 241 /* CatchClause */:
|
|
return isCompletedNode(n.block, sourceFile);
|
|
case 166 /* NewExpression */:
|
|
if (!n.arguments) {
|
|
return true;
|
|
}
|
|
// fall through
|
|
case 165 /* CallExpression */:
|
|
case 169 /* ParenthesizedExpression */:
|
|
case 157 /* ParenthesizedType */:
|
|
return nodeEndsWith(n, 17 /* CloseParenToken */, sourceFile);
|
|
case 149 /* FunctionType */:
|
|
case 150 /* ConstructorType */:
|
|
return isCompletedNode(n.type, sourceFile);
|
|
case 141 /* Constructor */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 145 /* ConstructSignature */:
|
|
case 144 /* CallSignature */:
|
|
case 171 /* ArrowFunction */:
|
|
if (n.body) {
|
|
return isCompletedNode(n.body, sourceFile);
|
|
}
|
|
if (n.type) {
|
|
return isCompletedNode(n.type, sourceFile);
|
|
}
|
|
// Even though type parameters can be unclosed, we can get away with
|
|
// having at least a closing paren.
|
|
return hasChildOfKind(n, 17 /* CloseParenToken */, sourceFile);
|
|
case 215 /* ModuleDeclaration */:
|
|
return n.body && isCompletedNode(n.body, sourceFile);
|
|
case 193 /* IfStatement */:
|
|
if (n.elseStatement) {
|
|
return isCompletedNode(n.elseStatement, sourceFile);
|
|
}
|
|
return isCompletedNode(n.thenStatement, sourceFile);
|
|
case 192 /* ExpressionStatement */:
|
|
return isCompletedNode(n.expression, sourceFile);
|
|
case 161 /* ArrayLiteralExpression */:
|
|
case 159 /* ArrayBindingPattern */:
|
|
case 164 /* ElementAccessExpression */:
|
|
case 133 /* ComputedPropertyName */:
|
|
case 154 /* TupleType */:
|
|
return nodeEndsWith(n, 19 /* CloseBracketToken */, sourceFile);
|
|
case 146 /* IndexSignature */:
|
|
if (n.type) {
|
|
return isCompletedNode(n.type, sourceFile);
|
|
}
|
|
return hasChildOfKind(n, 19 /* CloseBracketToken */, sourceFile);
|
|
case 238 /* CaseClause */:
|
|
case 239 /* DefaultClause */:
|
|
// there is no such thing as terminator token for CaseClause/DefaultClause so for simplicitly always consider them non-completed
|
|
return false;
|
|
case 196 /* ForStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
case 195 /* WhileStatement */:
|
|
return isCompletedNode(n.statement, sourceFile);
|
|
case 194 /* DoStatement */:
|
|
// rough approximation: if DoStatement has While keyword - then if node is completed is checking the presence of ')';
|
|
var hasWhileKeyword = findChildOfKind(n, 101 /* WhileKeyword */, sourceFile);
|
|
if (hasWhileKeyword) {
|
|
return nodeEndsWith(n, 17 /* CloseParenToken */, sourceFile);
|
|
}
|
|
return isCompletedNode(n.statement, sourceFile);
|
|
case 151 /* TypeQuery */:
|
|
return isCompletedNode(n.exprName, sourceFile);
|
|
case 173 /* TypeOfExpression */:
|
|
case 172 /* DeleteExpression */:
|
|
case 174 /* VoidExpression */:
|
|
case 181 /* YieldExpression */:
|
|
case 182 /* SpreadElementExpression */:
|
|
var unaryWordExpression = n;
|
|
return isCompletedNode(unaryWordExpression.expression, sourceFile);
|
|
case 167 /* TaggedTemplateExpression */:
|
|
return isCompletedNode(n.template, sourceFile);
|
|
case 180 /* TemplateExpression */:
|
|
var lastSpan = ts.lastOrUndefined(n.templateSpans);
|
|
return isCompletedNode(lastSpan, sourceFile);
|
|
case 187 /* TemplateSpan */:
|
|
return ts.nodeIsPresent(n.literal);
|
|
case 176 /* PrefixUnaryExpression */:
|
|
return isCompletedNode(n.operand, sourceFile);
|
|
case 178 /* BinaryExpression */:
|
|
return isCompletedNode(n.right, sourceFile);
|
|
case 179 /* ConditionalExpression */:
|
|
return isCompletedNode(n.whenFalse, sourceFile);
|
|
default:
|
|
return true;
|
|
}
|
|
}
|
|
ts.isCompletedNode = isCompletedNode;
|
|
/*
|
|
* Checks if node ends with 'expectedLastToken'.
|
|
* If child at position 'length - 1' is 'SemicolonToken' it is skipped and 'expectedLastToken' is compared with child at position 'length - 2'.
|
|
*/
|
|
function nodeEndsWith(n, expectedLastToken, sourceFile) {
|
|
var children = n.getChildren(sourceFile);
|
|
if (children.length) {
|
|
var last = ts.lastOrUndefined(children);
|
|
if (last.kind === expectedLastToken) {
|
|
return true;
|
|
}
|
|
else if (last.kind === 22 /* SemicolonToken */ && children.length !== 1) {
|
|
return children[children.length - 2].kind === expectedLastToken;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function findListItemInfo(node) {
|
|
var list = findContainingList(node);
|
|
// It is possible at this point for syntaxList to be undefined, either if
|
|
// node.parent had no list child, or if none of its list children contained
|
|
// the span of node. If this happens, return undefined. The caller should
|
|
// handle this case.
|
|
if (!list) {
|
|
return undefined;
|
|
}
|
|
var children = list.getChildren();
|
|
var listItemIndex = ts.indexOf(children, node);
|
|
return {
|
|
listItemIndex: listItemIndex,
|
|
list: list
|
|
};
|
|
}
|
|
ts.findListItemInfo = findListItemInfo;
|
|
function hasChildOfKind(n, kind, sourceFile) {
|
|
return !!findChildOfKind(n, kind, sourceFile);
|
|
}
|
|
ts.hasChildOfKind = hasChildOfKind;
|
|
function findChildOfKind(n, kind, sourceFile) {
|
|
return ts.forEach(n.getChildren(sourceFile), function (c) { return c.kind === kind && c; });
|
|
}
|
|
ts.findChildOfKind = findChildOfKind;
|
|
function findContainingList(node) {
|
|
// The node might be a list element (nonsynthetic) or a comma (synthetic). Either way, it will
|
|
// be parented by the container of the SyntaxList, not the SyntaxList itself.
|
|
// In order to find the list item index, we first need to locate SyntaxList itself and then search
|
|
// for the position of the relevant node (or comma).
|
|
var syntaxList = ts.forEach(node.parent.getChildren(), function (c) {
|
|
// find syntax list that covers the span of the node
|
|
if (c.kind === 268 /* SyntaxList */ && c.pos <= node.pos && c.end >= node.end) {
|
|
return c;
|
|
}
|
|
});
|
|
// Either we didn't find an appropriate list, or the list must contain us.
|
|
ts.Debug.assert(!syntaxList || ts.contains(syntaxList.getChildren(), node));
|
|
return syntaxList;
|
|
}
|
|
ts.findContainingList = findContainingList;
|
|
/* Gets the token whose text has range [start, end) and
|
|
* position >= start and (position < end or (position === end && token is keyword or identifier))
|
|
*/
|
|
function getTouchingWord(sourceFile, position) {
|
|
return getTouchingToken(sourceFile, position, function (n) { return isWord(n.kind); });
|
|
}
|
|
ts.getTouchingWord = getTouchingWord;
|
|
/* Gets the token whose text has range [start, end) and position >= start
|
|
* and (position < end or (position === end && token is keyword or identifier or numeric\string litera))
|
|
*/
|
|
function getTouchingPropertyName(sourceFile, position) {
|
|
return getTouchingToken(sourceFile, position, function (n) { return isPropertyName(n.kind); });
|
|
}
|
|
ts.getTouchingPropertyName = getTouchingPropertyName;
|
|
/** Returns the token if position is in [start, end) or if position === end and includeItemAtEndPosition(token) === true */
|
|
function getTouchingToken(sourceFile, position, includeItemAtEndPosition) {
|
|
return getTokenAtPositionWorker(sourceFile, position, false, includeItemAtEndPosition);
|
|
}
|
|
ts.getTouchingToken = getTouchingToken;
|
|
/** Returns a token if position is in [start-of-leading-trivia, end) */
|
|
function getTokenAtPosition(sourceFile, position) {
|
|
return getTokenAtPositionWorker(sourceFile, position, true, undefined);
|
|
}
|
|
ts.getTokenAtPosition = getTokenAtPosition;
|
|
/** Get the token whose text contains the position */
|
|
function getTokenAtPositionWorker(sourceFile, position, allowPositionInLeadingTrivia, includeItemAtEndPosition) {
|
|
var current = sourceFile;
|
|
outer: while (true) {
|
|
if (isToken(current)) {
|
|
// exit early
|
|
return current;
|
|
}
|
|
// find the child that contains 'position'
|
|
for (var i = 0, n = current.getChildCount(sourceFile); i < n; i++) {
|
|
var child = current.getChildAt(i);
|
|
var start = allowPositionInLeadingTrivia ? child.getFullStart() : child.getStart(sourceFile);
|
|
if (start <= position) {
|
|
var end = child.getEnd();
|
|
if (position < end || (position === end && child.kind === 1 /* EndOfFileToken */)) {
|
|
current = child;
|
|
continue outer;
|
|
}
|
|
else if (includeItemAtEndPosition && end === position) {
|
|
var previousToken = findPrecedingToken(position, sourceFile, child);
|
|
if (previousToken && includeItemAtEndPosition(previousToken)) {
|
|
return previousToken;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return current;
|
|
}
|
|
}
|
|
/**
|
|
* The token on the left of the position is the token that strictly includes the position
|
|
* or sits to the left of the cursor if it is on a boundary. For example
|
|
*
|
|
* fo|o -> will return foo
|
|
* foo <comment> |bar -> will return foo
|
|
*
|
|
*/
|
|
function findTokenOnLeftOfPosition(file, position) {
|
|
// Ideally, getTokenAtPosition should return a token. However, it is currently
|
|
// broken, so we do a check to make sure the result was indeed a token.
|
|
var tokenAtPosition = getTokenAtPosition(file, position);
|
|
if (isToken(tokenAtPosition) && position > tokenAtPosition.getStart(file) && position < tokenAtPosition.getEnd()) {
|
|
return tokenAtPosition;
|
|
}
|
|
return findPrecedingToken(position, file);
|
|
}
|
|
ts.findTokenOnLeftOfPosition = findTokenOnLeftOfPosition;
|
|
function findNextToken(previousToken, parent) {
|
|
return find(parent);
|
|
function find(n) {
|
|
if (isToken(n) && n.pos === previousToken.end) {
|
|
// this is token that starts at the end of previous token - return it
|
|
return n;
|
|
}
|
|
var children = n.getChildren();
|
|
for (var _i = 0; _i < children.length; _i++) {
|
|
var child = children[_i];
|
|
var shouldDiveInChildNode =
|
|
// previous token is enclosed somewhere in the child
|
|
(child.pos <= previousToken.pos && child.end > previousToken.end) ||
|
|
// previous token ends exactly at the beginning of child
|
|
(child.pos === previousToken.end);
|
|
if (shouldDiveInChildNode && nodeHasTokens(child)) {
|
|
return find(child);
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
}
|
|
ts.findNextToken = findNextToken;
|
|
function findPrecedingToken(position, sourceFile, startNode) {
|
|
return find(startNode || sourceFile);
|
|
function findRightmostToken(n) {
|
|
if (isToken(n)) {
|
|
return n;
|
|
}
|
|
var children = n.getChildren();
|
|
var candidate = findRightmostChildNodeWithTokens(children, children.length);
|
|
return candidate && findRightmostToken(candidate);
|
|
}
|
|
function find(n) {
|
|
if (isToken(n)) {
|
|
return n;
|
|
}
|
|
var children = n.getChildren();
|
|
for (var i = 0, len = children.length; i < len; i++) {
|
|
var child = children[i];
|
|
if (nodeHasTokens(child)) {
|
|
if (position <= child.end) {
|
|
if (child.getStart(sourceFile) >= position) {
|
|
// actual start of the node is past the position - previous token should be at the end of previous child
|
|
var candidate = findRightmostChildNodeWithTokens(children, i);
|
|
return candidate && findRightmostToken(candidate);
|
|
}
|
|
else {
|
|
// candidate should be in this node
|
|
return find(child);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
ts.Debug.assert(startNode !== undefined || n.kind === 245 /* SourceFile */);
|
|
// Here we know that none of child token nodes embrace the position,
|
|
// the only known case is when position is at the end of the file.
|
|
// Try to find the rightmost token in the file without filtering.
|
|
// Namely we are skipping the check: 'position < node.end'
|
|
if (children.length) {
|
|
var candidate = findRightmostChildNodeWithTokens(children, children.length);
|
|
return candidate && findRightmostToken(candidate);
|
|
}
|
|
}
|
|
/// finds last node that is considered as candidate for search (isCandidate(node) === true) starting from 'exclusiveStartPosition'
|
|
function findRightmostChildNodeWithTokens(children, exclusiveStartPosition) {
|
|
for (var i = exclusiveStartPosition - 1; i >= 0; --i) {
|
|
if (nodeHasTokens(children[i])) {
|
|
return children[i];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
ts.findPrecedingToken = findPrecedingToken;
|
|
function nodeHasTokens(n) {
|
|
// If we have a token or node that has a non-zero width, it must have tokens.
|
|
// Note, that getWidth() does not take trivia into account.
|
|
return n.getWidth() !== 0;
|
|
}
|
|
function getNodeModifiers(node) {
|
|
var flags = ts.getCombinedNodeFlags(node);
|
|
var result = [];
|
|
if (flags & 32 /* Private */)
|
|
result.push(ts.ScriptElementKindModifier.privateMemberModifier);
|
|
if (flags & 64 /* Protected */)
|
|
result.push(ts.ScriptElementKindModifier.protectedMemberModifier);
|
|
if (flags & 16 /* Public */)
|
|
result.push(ts.ScriptElementKindModifier.publicMemberModifier);
|
|
if (flags & 128 /* Static */)
|
|
result.push(ts.ScriptElementKindModifier.staticModifier);
|
|
if (flags & 256 /* Abstract */)
|
|
result.push(ts.ScriptElementKindModifier.abstractModifier);
|
|
if (flags & 1 /* Export */)
|
|
result.push(ts.ScriptElementKindModifier.exportedModifier);
|
|
if (ts.isInAmbientContext(node))
|
|
result.push(ts.ScriptElementKindModifier.ambientModifier);
|
|
return result.length > 0 ? result.join(',') : ts.ScriptElementKindModifier.none;
|
|
}
|
|
ts.getNodeModifiers = getNodeModifiers;
|
|
function getTypeArgumentOrTypeParameterList(node) {
|
|
if (node.kind === 148 /* TypeReference */ || node.kind === 165 /* CallExpression */) {
|
|
return node.typeArguments;
|
|
}
|
|
if (ts.isFunctionLike(node) || node.kind === 211 /* ClassDeclaration */ || node.kind === 212 /* InterfaceDeclaration */) {
|
|
return node.typeParameters;
|
|
}
|
|
return undefined;
|
|
}
|
|
ts.getTypeArgumentOrTypeParameterList = getTypeArgumentOrTypeParameterList;
|
|
function isToken(n) {
|
|
return n.kind >= 0 /* FirstToken */ && n.kind <= 131 /* LastToken */;
|
|
}
|
|
ts.isToken = isToken;
|
|
function isWord(kind) {
|
|
return kind === 66 /* Identifier */ || ts.isKeyword(kind);
|
|
}
|
|
ts.isWord = isWord;
|
|
function isPropertyName(kind) {
|
|
return kind === 8 /* StringLiteral */ || kind === 7 /* NumericLiteral */ || isWord(kind);
|
|
}
|
|
function isComment(kind) {
|
|
return kind === 2 /* SingleLineCommentTrivia */ || kind === 3 /* MultiLineCommentTrivia */;
|
|
}
|
|
ts.isComment = isComment;
|
|
function isPunctuation(kind) {
|
|
return 14 /* FirstPunctuation */ <= kind && kind <= 65 /* LastPunctuation */;
|
|
}
|
|
ts.isPunctuation = isPunctuation;
|
|
function isInsideTemplateLiteral(node, position) {
|
|
return ts.isTemplateLiteralKind(node.kind)
|
|
&& (node.getStart() < position && position < node.getEnd()) || (!!node.isUnterminated && position === node.getEnd());
|
|
}
|
|
ts.isInsideTemplateLiteral = isInsideTemplateLiteral;
|
|
function isAccessibilityModifier(kind) {
|
|
switch (kind) {
|
|
case 109 /* PublicKeyword */:
|
|
case 107 /* PrivateKeyword */:
|
|
case 108 /* ProtectedKeyword */:
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
ts.isAccessibilityModifier = isAccessibilityModifier;
|
|
function compareDataObjects(dst, src) {
|
|
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;
|
|
})(ts || (ts = {}));
|
|
// Display-part writer helpers
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
function isFirstDeclarationOfSymbolParameter(symbol) {
|
|
return symbol.declarations && symbol.declarations.length > 0 && symbol.declarations[0].kind === 135 /* Parameter */;
|
|
}
|
|
ts.isFirstDeclarationOfSymbolParameter = isFirstDeclarationOfSymbolParameter;
|
|
var displayPartWriter = getDisplayPartWriter();
|
|
function getDisplayPartWriter() {
|
|
var displayParts;
|
|
var lineStart;
|
|
var indent;
|
|
resetWriter();
|
|
return {
|
|
displayParts: function () { return displayParts; },
|
|
writeKeyword: function (text) { return writeKind(text, ts.SymbolDisplayPartKind.keyword); },
|
|
writeOperator: function (text) { return writeKind(text, ts.SymbolDisplayPartKind.operator); },
|
|
writePunctuation: function (text) { return writeKind(text, ts.SymbolDisplayPartKind.punctuation); },
|
|
writeSpace: function (text) { return writeKind(text, ts.SymbolDisplayPartKind.space); },
|
|
writeStringLiteral: function (text) { return writeKind(text, ts.SymbolDisplayPartKind.stringLiteral); },
|
|
writeParameter: function (text) { return writeKind(text, ts.SymbolDisplayPartKind.parameterName); },
|
|
writeSymbol: writeSymbol,
|
|
writeLine: writeLine,
|
|
increaseIndent: function () { indent++; },
|
|
decreaseIndent: function () { indent--; },
|
|
clear: resetWriter,
|
|
trackSymbol: function () { }
|
|
};
|
|
function writeIndent() {
|
|
if (lineStart) {
|
|
var indentString = ts.getIndentString(indent);
|
|
if (indentString) {
|
|
displayParts.push(displayPart(indentString, ts.SymbolDisplayPartKind.space));
|
|
}
|
|
lineStart = false;
|
|
}
|
|
}
|
|
function writeKind(text, kind) {
|
|
writeIndent();
|
|
displayParts.push(displayPart(text, kind));
|
|
}
|
|
function writeSymbol(text, symbol) {
|
|
writeIndent();
|
|
displayParts.push(symbolPart(text, symbol));
|
|
}
|
|
function writeLine() {
|
|
displayParts.push(lineBreakPart());
|
|
lineStart = true;
|
|
}
|
|
function resetWriter() {
|
|
displayParts = [];
|
|
lineStart = true;
|
|
indent = 0;
|
|
}
|
|
}
|
|
function symbolPart(text, symbol) {
|
|
return displayPart(text, displayPartKind(symbol), symbol);
|
|
function displayPartKind(symbol) {
|
|
var flags = symbol.flags;
|
|
if (flags & 3 /* Variable */) {
|
|
return isFirstDeclarationOfSymbolParameter(symbol) ? ts.SymbolDisplayPartKind.parameterName : ts.SymbolDisplayPartKind.localName;
|
|
}
|
|
else if (flags & 4 /* Property */) {
|
|
return ts.SymbolDisplayPartKind.propertyName;
|
|
}
|
|
else if (flags & 32768 /* GetAccessor */) {
|
|
return ts.SymbolDisplayPartKind.propertyName;
|
|
}
|
|
else if (flags & 65536 /* SetAccessor */) {
|
|
return ts.SymbolDisplayPartKind.propertyName;
|
|
}
|
|
else if (flags & 8 /* EnumMember */) {
|
|
return ts.SymbolDisplayPartKind.enumMemberName;
|
|
}
|
|
else if (flags & 16 /* Function */) {
|
|
return ts.SymbolDisplayPartKind.functionName;
|
|
}
|
|
else if (flags & 32 /* Class */) {
|
|
return ts.SymbolDisplayPartKind.className;
|
|
}
|
|
else if (flags & 64 /* Interface */) {
|
|
return ts.SymbolDisplayPartKind.interfaceName;
|
|
}
|
|
else if (flags & 384 /* Enum */) {
|
|
return ts.SymbolDisplayPartKind.enumName;
|
|
}
|
|
else if (flags & 1536 /* Module */) {
|
|
return ts.SymbolDisplayPartKind.moduleName;
|
|
}
|
|
else if (flags & 8192 /* Method */) {
|
|
return ts.SymbolDisplayPartKind.methodName;
|
|
}
|
|
else if (flags & 262144 /* TypeParameter */) {
|
|
return ts.SymbolDisplayPartKind.typeParameterName;
|
|
}
|
|
else if (flags & 524288 /* TypeAlias */) {
|
|
return ts.SymbolDisplayPartKind.aliasName;
|
|
}
|
|
else if (flags & 8388608 /* Alias */) {
|
|
return ts.SymbolDisplayPartKind.aliasName;
|
|
}
|
|
return ts.SymbolDisplayPartKind.text;
|
|
}
|
|
}
|
|
ts.symbolPart = symbolPart;
|
|
function displayPart(text, kind, symbol) {
|
|
return {
|
|
text: text,
|
|
kind: ts.SymbolDisplayPartKind[kind]
|
|
};
|
|
}
|
|
ts.displayPart = displayPart;
|
|
function spacePart() {
|
|
return displayPart(" ", ts.SymbolDisplayPartKind.space);
|
|
}
|
|
ts.spacePart = spacePart;
|
|
function keywordPart(kind) {
|
|
return displayPart(ts.tokenToString(kind), ts.SymbolDisplayPartKind.keyword);
|
|
}
|
|
ts.keywordPart = keywordPart;
|
|
function punctuationPart(kind) {
|
|
return displayPart(ts.tokenToString(kind), ts.SymbolDisplayPartKind.punctuation);
|
|
}
|
|
ts.punctuationPart = punctuationPart;
|
|
function operatorPart(kind) {
|
|
return displayPart(ts.tokenToString(kind), ts.SymbolDisplayPartKind.operator);
|
|
}
|
|
ts.operatorPart = operatorPart;
|
|
function textOrKeywordPart(text) {
|
|
var kind = ts.stringToToken(text);
|
|
return kind === undefined
|
|
? textPart(text)
|
|
: keywordPart(kind);
|
|
}
|
|
ts.textOrKeywordPart = textOrKeywordPart;
|
|
function textPart(text) {
|
|
return displayPart(text, ts.SymbolDisplayPartKind.text);
|
|
}
|
|
ts.textPart = textPart;
|
|
function lineBreakPart() {
|
|
return displayPart("\n", ts.SymbolDisplayPartKind.lineBreak);
|
|
}
|
|
ts.lineBreakPart = lineBreakPart;
|
|
function mapToDisplayParts(writeDisplayParts) {
|
|
writeDisplayParts(displayPartWriter);
|
|
var result = displayPartWriter.displayParts();
|
|
displayPartWriter.clear();
|
|
return result;
|
|
}
|
|
ts.mapToDisplayParts = mapToDisplayParts;
|
|
function typeToDisplayParts(typechecker, type, enclosingDeclaration, flags) {
|
|
return mapToDisplayParts(function (writer) {
|
|
typechecker.getSymbolDisplayBuilder().buildTypeDisplay(type, writer, enclosingDeclaration, flags);
|
|
});
|
|
}
|
|
ts.typeToDisplayParts = typeToDisplayParts;
|
|
function symbolToDisplayParts(typeChecker, symbol, enclosingDeclaration, meaning, flags) {
|
|
return mapToDisplayParts(function (writer) {
|
|
typeChecker.getSymbolDisplayBuilder().buildSymbolDisplay(symbol, writer, enclosingDeclaration, meaning, flags);
|
|
});
|
|
}
|
|
ts.symbolToDisplayParts = symbolToDisplayParts;
|
|
function signatureToDisplayParts(typechecker, signature, enclosingDeclaration, flags) {
|
|
return mapToDisplayParts(function (writer) {
|
|
typechecker.getSymbolDisplayBuilder().buildSignatureDisplay(signature, writer, enclosingDeclaration, flags);
|
|
});
|
|
}
|
|
ts.signatureToDisplayParts = signatureToDisplayParts;
|
|
function getDeclaredName(typeChecker, symbol, location) {
|
|
// If this is an export or import specifier it could have been renamed using the 'as' syntax.
|
|
// If so we want to search for whatever is under the cursor.
|
|
if (isImportOrExportSpecifierName(location)) {
|
|
return location.getText();
|
|
}
|
|
// Try to get the local symbol if we're dealing with an 'export default'
|
|
// since that symbol has the "true" name.
|
|
var localExportDefaultSymbol = ts.getLocalSymbolForExportDefault(symbol);
|
|
var name = typeChecker.symbolToString(localExportDefaultSymbol || symbol);
|
|
return name;
|
|
}
|
|
ts.getDeclaredName = getDeclaredName;
|
|
function isImportOrExportSpecifierName(location) {
|
|
return location.parent &&
|
|
(location.parent.kind === 223 /* ImportSpecifier */ || location.parent.kind === 227 /* ExportSpecifier */) &&
|
|
location.parent.propertyName === location;
|
|
}
|
|
ts.isImportOrExportSpecifierName = isImportOrExportSpecifierName;
|
|
/**
|
|
* Strip off existed single quotes or double quotes 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) &&
|
|
(name.charCodeAt(0) === 34 /* doubleQuote */ || name.charCodeAt(0) === 39 /* singleQuote */)) {
|
|
return name.substring(1, length - 1);
|
|
}
|
|
;
|
|
return name;
|
|
}
|
|
ts.stripQuotes = stripQuotes;
|
|
})(ts || (ts = {}));
|
|
/// <reference path="formatting.ts"/>
|
|
/// <reference path="..\..\compiler\scanner.ts"/>
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
var scanner = ts.createScanner(2 /* Latest */, false);
|
|
var ScanAction;
|
|
(function (ScanAction) {
|
|
ScanAction[ScanAction["Scan"] = 0] = "Scan";
|
|
ScanAction[ScanAction["RescanGreaterThanToken"] = 1] = "RescanGreaterThanToken";
|
|
ScanAction[ScanAction["RescanSlashToken"] = 2] = "RescanSlashToken";
|
|
ScanAction[ScanAction["RescanTemplateToken"] = 3] = "RescanTemplateToken";
|
|
})(ScanAction || (ScanAction = {}));
|
|
function getFormattingScanner(sourceFile, startPos, endPos) {
|
|
scanner.setText(sourceFile.text);
|
|
scanner.setTextPos(startPos);
|
|
var wasNewLine = true;
|
|
var leadingTrivia;
|
|
var trailingTrivia;
|
|
var savedPos;
|
|
var lastScanAction;
|
|
var lastTokenInfo;
|
|
return {
|
|
advance: advance,
|
|
readTokenInfo: readTokenInfo,
|
|
isOnToken: isOnToken,
|
|
lastTrailingTriviaWasNewLine: function () { return wasNewLine; },
|
|
close: function () {
|
|
lastTokenInfo = undefined;
|
|
scanner.setText(undefined);
|
|
}
|
|
};
|
|
function advance() {
|
|
lastTokenInfo = undefined;
|
|
var isStarted = scanner.getStartPos() !== startPos;
|
|
if (isStarted) {
|
|
if (trailingTrivia) {
|
|
ts.Debug.assert(trailingTrivia.length !== 0);
|
|
wasNewLine = ts.lastOrUndefined(trailingTrivia).kind === 4 /* NewLineTrivia */;
|
|
}
|
|
else {
|
|
wasNewLine = false;
|
|
}
|
|
}
|
|
leadingTrivia = undefined;
|
|
trailingTrivia = undefined;
|
|
if (!isStarted) {
|
|
scanner.scan();
|
|
}
|
|
var t;
|
|
var pos = scanner.getStartPos();
|
|
// Read leading trivia and token
|
|
while (pos < endPos) {
|
|
var t_1 = scanner.getToken();
|
|
if (!ts.isTrivia(t_1)) {
|
|
break;
|
|
}
|
|
// consume leading trivia
|
|
scanner.scan();
|
|
var item = {
|
|
pos: pos,
|
|
end: scanner.getStartPos(),
|
|
kind: t_1
|
|
};
|
|
pos = scanner.getStartPos();
|
|
if (!leadingTrivia) {
|
|
leadingTrivia = [];
|
|
}
|
|
leadingTrivia.push(item);
|
|
}
|
|
savedPos = scanner.getStartPos();
|
|
}
|
|
function shouldRescanGreaterThanToken(node) {
|
|
if (node) {
|
|
switch (node.kind) {
|
|
case 28 /* GreaterThanEqualsToken */:
|
|
case 61 /* GreaterThanGreaterThanEqualsToken */:
|
|
case 62 /* GreaterThanGreaterThanGreaterThanEqualsToken */:
|
|
case 43 /* GreaterThanGreaterThanGreaterThanToken */:
|
|
case 42 /* GreaterThanGreaterThanToken */:
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function shouldRescanSlashToken(container) {
|
|
return container.kind === 9 /* RegularExpressionLiteral */;
|
|
}
|
|
function shouldRescanTemplateToken(container) {
|
|
return container.kind === 12 /* TemplateMiddle */ ||
|
|
container.kind === 13 /* TemplateTail */;
|
|
}
|
|
function startsWithSlashToken(t) {
|
|
return t === 37 /* SlashToken */ || t === 58 /* SlashEqualsToken */;
|
|
}
|
|
function readTokenInfo(n) {
|
|
if (!isOnToken()) {
|
|
// scanner is not on the token (either advance was not called yet or scanner is already past the end position)
|
|
return {
|
|
leadingTrivia: leadingTrivia,
|
|
trailingTrivia: undefined,
|
|
token: undefined
|
|
};
|
|
}
|
|
// normally scanner returns the smallest available token
|
|
// check the kind of context node to determine if scanner should have more greedy behavior and consume more text.
|
|
var expectedScanAction = shouldRescanGreaterThanToken(n)
|
|
? 1 /* RescanGreaterThanToken */
|
|
: shouldRescanSlashToken(n)
|
|
? 2 /* RescanSlashToken */
|
|
: shouldRescanTemplateToken(n)
|
|
? 3 /* RescanTemplateToken */
|
|
: 0 /* Scan */;
|
|
if (lastTokenInfo && expectedScanAction === lastScanAction) {
|
|
// readTokenInfo was called before with the same expected scan action.
|
|
// No need to re-scan text, return existing 'lastTokenInfo'
|
|
// it is ok to call fixTokenKind here since it does not affect
|
|
// what portion of text is consumed. In opposize rescanning can change it,
|
|
// i.e. for '>=' when originally scanner eats just one character
|
|
// and rescanning forces it to consume more.
|
|
return fixTokenKind(lastTokenInfo, n);
|
|
}
|
|
if (scanner.getStartPos() !== savedPos) {
|
|
ts.Debug.assert(lastTokenInfo !== undefined);
|
|
// readTokenInfo was called before but scan action differs - rescan text
|
|
scanner.setTextPos(savedPos);
|
|
scanner.scan();
|
|
}
|
|
var currentToken = scanner.getToken();
|
|
if (expectedScanAction === 1 /* RescanGreaterThanToken */ && currentToken === 26 /* GreaterThanToken */) {
|
|
currentToken = scanner.reScanGreaterToken();
|
|
ts.Debug.assert(n.kind === currentToken);
|
|
lastScanAction = 1 /* RescanGreaterThanToken */;
|
|
}
|
|
else if (expectedScanAction === 2 /* RescanSlashToken */ && startsWithSlashToken(currentToken)) {
|
|
currentToken = scanner.reScanSlashToken();
|
|
ts.Debug.assert(n.kind === currentToken);
|
|
lastScanAction = 2 /* RescanSlashToken */;
|
|
}
|
|
else if (expectedScanAction === 3 /* RescanTemplateToken */ && currentToken === 15 /* CloseBraceToken */) {
|
|
currentToken = scanner.reScanTemplateToken();
|
|
lastScanAction = 3 /* RescanTemplateToken */;
|
|
}
|
|
else {
|
|
lastScanAction = 0 /* Scan */;
|
|
}
|
|
var token = {
|
|
pos: scanner.getStartPos(),
|
|
end: scanner.getTextPos(),
|
|
kind: currentToken
|
|
};
|
|
// consume trailing trivia
|
|
if (trailingTrivia) {
|
|
trailingTrivia = undefined;
|
|
}
|
|
while (scanner.getStartPos() < endPos) {
|
|
currentToken = scanner.scan();
|
|
if (!ts.isTrivia(currentToken)) {
|
|
break;
|
|
}
|
|
var trivia = {
|
|
pos: scanner.getStartPos(),
|
|
end: scanner.getTextPos(),
|
|
kind: currentToken
|
|
};
|
|
if (!trailingTrivia) {
|
|
trailingTrivia = [];
|
|
}
|
|
trailingTrivia.push(trivia);
|
|
if (currentToken === 4 /* NewLineTrivia */) {
|
|
// move past new line
|
|
scanner.scan();
|
|
break;
|
|
}
|
|
}
|
|
lastTokenInfo = {
|
|
leadingTrivia: leadingTrivia,
|
|
trailingTrivia: trailingTrivia,
|
|
token: token
|
|
};
|
|
return fixTokenKind(lastTokenInfo, n);
|
|
}
|
|
function isOnToken() {
|
|
var current = (lastTokenInfo && lastTokenInfo.token.kind) || scanner.getToken();
|
|
var startPos = (lastTokenInfo && lastTokenInfo.token.pos) || scanner.getStartPos();
|
|
return startPos < endPos && current !== 1 /* EndOfFileToken */ && !ts.isTrivia(current);
|
|
}
|
|
// when containing node in the tree is token
|
|
// but its kind differs from the kind that was returned by the scanner,
|
|
// then kind needs to be fixed. This might happen in cases
|
|
// when parser interprets token differently, i.e keyword treated as identifier
|
|
function fixTokenKind(tokenInfo, container) {
|
|
if (ts.isToken(container) && tokenInfo.token.kind !== container.kind) {
|
|
tokenInfo.token.kind = container.kind;
|
|
}
|
|
return tokenInfo;
|
|
}
|
|
}
|
|
formatting.getFormattingScanner = getFormattingScanner;
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
/// <reference path="references.ts"/>
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
var FormattingContext = (function () {
|
|
function FormattingContext(sourceFile, formattingRequestKind) {
|
|
this.sourceFile = sourceFile;
|
|
this.formattingRequestKind = formattingRequestKind;
|
|
}
|
|
FormattingContext.prototype.updateContext = function (currentRange, currentTokenParent, nextRange, nextTokenParent, commonParent) {
|
|
ts.Debug.assert(currentRange !== undefined, "currentTokenSpan is null");
|
|
ts.Debug.assert(currentTokenParent !== undefined, "currentTokenParent is null");
|
|
ts.Debug.assert(nextRange !== undefined, "nextTokenSpan is null");
|
|
ts.Debug.assert(nextTokenParent !== undefined, "nextTokenParent is null");
|
|
ts.Debug.assert(commonParent !== undefined, "commonParent is null");
|
|
this.currentTokenSpan = currentRange;
|
|
this.currentTokenParent = currentTokenParent;
|
|
this.nextTokenSpan = nextRange;
|
|
this.nextTokenParent = nextTokenParent;
|
|
this.contextNode = commonParent;
|
|
// drop cached results
|
|
this.contextNodeAllOnSameLine = undefined;
|
|
this.nextNodeAllOnSameLine = undefined;
|
|
this.tokensAreOnSameLine = undefined;
|
|
this.contextNodeBlockIsOnOneLine = undefined;
|
|
this.nextNodeBlockIsOnOneLine = undefined;
|
|
};
|
|
FormattingContext.prototype.ContextNodeAllOnSameLine = function () {
|
|
if (this.contextNodeAllOnSameLine === undefined) {
|
|
this.contextNodeAllOnSameLine = this.NodeIsOnOneLine(this.contextNode);
|
|
}
|
|
return this.contextNodeAllOnSameLine;
|
|
};
|
|
FormattingContext.prototype.NextNodeAllOnSameLine = function () {
|
|
if (this.nextNodeAllOnSameLine === undefined) {
|
|
this.nextNodeAllOnSameLine = this.NodeIsOnOneLine(this.nextTokenParent);
|
|
}
|
|
return this.nextNodeAllOnSameLine;
|
|
};
|
|
FormattingContext.prototype.TokensAreOnSameLine = function () {
|
|
if (this.tokensAreOnSameLine === undefined) {
|
|
var startLine = this.sourceFile.getLineAndCharacterOfPosition(this.currentTokenSpan.pos).line;
|
|
var endLine = this.sourceFile.getLineAndCharacterOfPosition(this.nextTokenSpan.pos).line;
|
|
this.tokensAreOnSameLine = (startLine === endLine);
|
|
}
|
|
return this.tokensAreOnSameLine;
|
|
};
|
|
FormattingContext.prototype.ContextNodeBlockIsOnOneLine = function () {
|
|
if (this.contextNodeBlockIsOnOneLine === undefined) {
|
|
this.contextNodeBlockIsOnOneLine = this.BlockIsOnOneLine(this.contextNode);
|
|
}
|
|
return this.contextNodeBlockIsOnOneLine;
|
|
};
|
|
FormattingContext.prototype.NextNodeBlockIsOnOneLine = function () {
|
|
if (this.nextNodeBlockIsOnOneLine === undefined) {
|
|
this.nextNodeBlockIsOnOneLine = this.BlockIsOnOneLine(this.nextTokenParent);
|
|
}
|
|
return this.nextNodeBlockIsOnOneLine;
|
|
};
|
|
FormattingContext.prototype.NodeIsOnOneLine = function (node) {
|
|
var startLine = this.sourceFile.getLineAndCharacterOfPosition(node.getStart(this.sourceFile)).line;
|
|
var endLine = this.sourceFile.getLineAndCharacterOfPosition(node.getEnd()).line;
|
|
return startLine === endLine;
|
|
};
|
|
FormattingContext.prototype.BlockIsOnOneLine = function (node) {
|
|
var openBrace = ts.findChildOfKind(node, 14 /* OpenBraceToken */, this.sourceFile);
|
|
var closeBrace = ts.findChildOfKind(node, 15 /* CloseBraceToken */, this.sourceFile);
|
|
if (openBrace && closeBrace) {
|
|
var startLine = this.sourceFile.getLineAndCharacterOfPosition(openBrace.getEnd()).line;
|
|
var endLine = this.sourceFile.getLineAndCharacterOfPosition(closeBrace.getStart(this.sourceFile)).line;
|
|
return startLine === endLine;
|
|
}
|
|
return false;
|
|
};
|
|
return FormattingContext;
|
|
})();
|
|
formatting.FormattingContext = FormattingContext;
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
/// <reference path="references.ts"/>
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
(function (FormattingRequestKind) {
|
|
FormattingRequestKind[FormattingRequestKind["FormatDocument"] = 0] = "FormatDocument";
|
|
FormattingRequestKind[FormattingRequestKind["FormatSelection"] = 1] = "FormatSelection";
|
|
FormattingRequestKind[FormattingRequestKind["FormatOnEnter"] = 2] = "FormatOnEnter";
|
|
FormattingRequestKind[FormattingRequestKind["FormatOnSemicolon"] = 3] = "FormatOnSemicolon";
|
|
FormattingRequestKind[FormattingRequestKind["FormatOnClosingCurlyBrace"] = 4] = "FormatOnClosingCurlyBrace";
|
|
})(formatting.FormattingRequestKind || (formatting.FormattingRequestKind = {}));
|
|
var FormattingRequestKind = formatting.FormattingRequestKind;
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
///<reference path='references.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
var Rule = (function () {
|
|
function Rule(Descriptor, Operation, Flag) {
|
|
if (Flag === void 0) { Flag = 0 /* None */; }
|
|
this.Descriptor = Descriptor;
|
|
this.Operation = Operation;
|
|
this.Flag = Flag;
|
|
}
|
|
Rule.prototype.toString = function () {
|
|
return "[desc=" + this.Descriptor + "," +
|
|
"operation=" + this.Operation + "," +
|
|
"flag=" + this.Flag + "]";
|
|
};
|
|
return Rule;
|
|
})();
|
|
formatting.Rule = Rule;
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
///<reference path='references.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
(function (RuleAction) {
|
|
RuleAction[RuleAction["Ignore"] = 1] = "Ignore";
|
|
RuleAction[RuleAction["Space"] = 2] = "Space";
|
|
RuleAction[RuleAction["NewLine"] = 4] = "NewLine";
|
|
RuleAction[RuleAction["Delete"] = 8] = "Delete";
|
|
})(formatting.RuleAction || (formatting.RuleAction = {}));
|
|
var RuleAction = formatting.RuleAction;
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
///<reference path='references.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
var RuleDescriptor = (function () {
|
|
function RuleDescriptor(LeftTokenRange, RightTokenRange) {
|
|
this.LeftTokenRange = LeftTokenRange;
|
|
this.RightTokenRange = RightTokenRange;
|
|
}
|
|
RuleDescriptor.prototype.toString = function () {
|
|
return "[leftRange=" + this.LeftTokenRange + "," +
|
|
"rightRange=" + this.RightTokenRange + "]";
|
|
};
|
|
RuleDescriptor.create1 = function (left, right) {
|
|
return RuleDescriptor.create4(formatting.Shared.TokenRange.FromToken(left), formatting.Shared.TokenRange.FromToken(right));
|
|
};
|
|
RuleDescriptor.create2 = function (left, right) {
|
|
return RuleDescriptor.create4(left, formatting.Shared.TokenRange.FromToken(right));
|
|
};
|
|
RuleDescriptor.create3 = function (left, right) {
|
|
return RuleDescriptor.create4(formatting.Shared.TokenRange.FromToken(left), right);
|
|
};
|
|
RuleDescriptor.create4 = function (left, right) {
|
|
return new RuleDescriptor(left, right);
|
|
};
|
|
return RuleDescriptor;
|
|
})();
|
|
formatting.RuleDescriptor = RuleDescriptor;
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
///<reference path='references.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
(function (RuleFlags) {
|
|
RuleFlags[RuleFlags["None"] = 0] = "None";
|
|
RuleFlags[RuleFlags["CanDeleteNewLines"] = 1] = "CanDeleteNewLines";
|
|
})(formatting.RuleFlags || (formatting.RuleFlags = {}));
|
|
var RuleFlags = formatting.RuleFlags;
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
///<reference path='references.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
var RuleOperation = (function () {
|
|
function RuleOperation() {
|
|
this.Context = null;
|
|
this.Action = null;
|
|
}
|
|
RuleOperation.prototype.toString = function () {
|
|
return "[context=" + this.Context + "," +
|
|
"action=" + this.Action + "]";
|
|
};
|
|
RuleOperation.create1 = function (action) {
|
|
return RuleOperation.create2(formatting.RuleOperationContext.Any, action);
|
|
};
|
|
RuleOperation.create2 = function (context, action) {
|
|
var result = new RuleOperation();
|
|
result.Context = context;
|
|
result.Action = action;
|
|
return result;
|
|
};
|
|
return RuleOperation;
|
|
})();
|
|
formatting.RuleOperation = RuleOperation;
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
///<reference path='references.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
var RuleOperationContext = (function () {
|
|
function RuleOperationContext() {
|
|
var funcs = [];
|
|
for (var _i = 0; _i < arguments.length; _i++) {
|
|
funcs[_i - 0] = arguments[_i];
|
|
}
|
|
this.customContextChecks = funcs;
|
|
}
|
|
RuleOperationContext.prototype.IsAny = function () {
|
|
return this === RuleOperationContext.Any;
|
|
};
|
|
RuleOperationContext.prototype.InContext = function (context) {
|
|
if (this.IsAny()) {
|
|
return true;
|
|
}
|
|
for (var _i = 0, _a = this.customContextChecks; _i < _a.length; _i++) {
|
|
var check = _a[_i];
|
|
if (!check(context)) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
};
|
|
RuleOperationContext.Any = new RuleOperationContext();
|
|
return RuleOperationContext;
|
|
})();
|
|
formatting.RuleOperationContext = RuleOperationContext;
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
///<reference path='references.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
var Rules = (function () {
|
|
function Rules() {
|
|
///
|
|
/// Common Rules
|
|
///
|
|
// Leave comments alone
|
|
this.IgnoreBeforeComment = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.Any, formatting.Shared.TokenRange.Comments), formatting.RuleOperation.create1(1 /* Ignore */));
|
|
this.IgnoreAfterLineComment = new formatting.Rule(formatting.RuleDescriptor.create3(2 /* SingleLineCommentTrivia */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create1(1 /* Ignore */));
|
|
// Space after keyword but not before ; or : or ?
|
|
this.NoSpaceBeforeSemicolon = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 22 /* SemicolonToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.NoSpaceBeforeColon = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 52 /* ColonToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsNotBinaryOpContext), 8 /* Delete */));
|
|
this.NoSpaceBeforeQuestionMark = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 51 /* QuestionToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsNotBinaryOpContext), 8 /* Delete */));
|
|
this.SpaceAfterColon = new formatting.Rule(formatting.RuleDescriptor.create3(52 /* ColonToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsNotBinaryOpContext), 2 /* Space */));
|
|
this.SpaceAfterQuestionMarkInConditionalOperator = new formatting.Rule(formatting.RuleDescriptor.create3(51 /* QuestionToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsConditionalOperatorContext), 2 /* Space */));
|
|
this.NoSpaceAfterQuestionMark = new formatting.Rule(formatting.RuleDescriptor.create3(51 /* QuestionToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.SpaceAfterSemicolon = new formatting.Rule(formatting.RuleDescriptor.create3(22 /* SemicolonToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 2 /* Space */));
|
|
// Space after }.
|
|
this.SpaceAfterCloseBrace = new formatting.Rule(formatting.RuleDescriptor.create3(15 /* CloseBraceToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsAfterCodeBlockContext), 2 /* Space */));
|
|
// Special case for (}, else) and (}, while) since else & while tokens are not part of the tree which makes SpaceAfterCloseBrace rule not applied
|
|
this.SpaceBetweenCloseBraceAndElse = new formatting.Rule(formatting.RuleDescriptor.create1(15 /* CloseBraceToken */, 77 /* ElseKeyword */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 2 /* Space */));
|
|
this.SpaceBetweenCloseBraceAndWhile = new formatting.Rule(formatting.RuleDescriptor.create1(15 /* CloseBraceToken */, 101 /* WhileKeyword */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 2 /* Space */));
|
|
this.NoSpaceAfterCloseBrace = new formatting.Rule(formatting.RuleDescriptor.create3(15 /* CloseBraceToken */, formatting.Shared.TokenRange.FromTokens([17 /* CloseParenToken */, 19 /* CloseBracketToken */, 23 /* CommaToken */, 22 /* SemicolonToken */])), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
// No space for indexer and dot
|
|
this.NoSpaceBeforeDot = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 20 /* DotToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.NoSpaceAfterDot = new formatting.Rule(formatting.RuleDescriptor.create3(20 /* DotToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.NoSpaceBeforeOpenBracket = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 18 /* OpenBracketToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.NoSpaceAfterOpenBracket = new formatting.Rule(formatting.RuleDescriptor.create3(18 /* OpenBracketToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.NoSpaceBeforeCloseBracket = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 19 /* CloseBracketToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.NoSpaceAfterCloseBracket = new formatting.Rule(formatting.RuleDescriptor.create3(19 /* CloseBracketToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsNotBeforeBlockInFunctionDeclarationContext), 8 /* Delete */));
|
|
// Place a space before open brace in a function declaration
|
|
this.FunctionOpenBraceLeftTokenRange = formatting.Shared.TokenRange.AnyIncludingMultilineComments;
|
|
this.SpaceBeforeOpenBraceInFunction = new formatting.Rule(formatting.RuleDescriptor.create2(this.FunctionOpenBraceLeftTokenRange, 14 /* OpenBraceToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsFunctionDeclContext, Rules.IsBeforeBlockContext, Rules.IsNotFormatOnEnter, Rules.IsSameLineTokenOrBeforeMultilineBlockContext), 2 /* Space */), 1 /* CanDeleteNewLines */);
|
|
// Place a space before open brace in a TypeScript declaration that has braces as children (class, module, enum, etc)
|
|
this.TypeScriptOpenBraceLeftTokenRange = formatting.Shared.TokenRange.FromTokens([66 /* Identifier */, 3 /* MultiLineCommentTrivia */]);
|
|
this.SpaceBeforeOpenBraceInTypeScriptDeclWithBlock = new formatting.Rule(formatting.RuleDescriptor.create2(this.TypeScriptOpenBraceLeftTokenRange, 14 /* OpenBraceToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsTypeScriptDeclWithBlockContext, Rules.IsNotFormatOnEnter, Rules.IsSameLineTokenOrBeforeMultilineBlockContext), 2 /* Space */), 1 /* CanDeleteNewLines */);
|
|
// Place a space before open brace in a control flow construct
|
|
this.ControlOpenBraceLeftTokenRange = formatting.Shared.TokenRange.FromTokens([17 /* CloseParenToken */, 3 /* MultiLineCommentTrivia */, 76 /* DoKeyword */, 97 /* TryKeyword */, 82 /* FinallyKeyword */, 77 /* ElseKeyword */]);
|
|
this.SpaceBeforeOpenBraceInControl = new formatting.Rule(formatting.RuleDescriptor.create2(this.ControlOpenBraceLeftTokenRange, 14 /* OpenBraceToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsControlDeclContext, Rules.IsNotFormatOnEnter, Rules.IsSameLineTokenOrBeforeMultilineBlockContext), 2 /* Space */), 1 /* CanDeleteNewLines */);
|
|
// Insert a space after { and before } in single-line contexts, but remove space from empty object literals {}.
|
|
this.SpaceAfterOpenBrace = new formatting.Rule(formatting.RuleDescriptor.create3(14 /* OpenBraceToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSingleLineBlockContext), 2 /* Space */));
|
|
this.SpaceBeforeCloseBrace = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 15 /* CloseBraceToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSingleLineBlockContext), 2 /* Space */));
|
|
this.NoSpaceBetweenEmptyBraceBrackets = new formatting.Rule(formatting.RuleDescriptor.create1(14 /* OpenBraceToken */, 15 /* CloseBraceToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsObjectContext), 8 /* Delete */));
|
|
// Insert new line after { and before } in multi-line contexts.
|
|
this.NewLineAfterOpenBraceInBlockContext = new formatting.Rule(formatting.RuleDescriptor.create3(14 /* OpenBraceToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsMultilineBlockContext), 4 /* NewLine */));
|
|
// For functions and control block place } on a new line [multi-line rule]
|
|
this.NewLineBeforeCloseBraceInBlockContext = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.AnyIncludingMultilineComments, 15 /* CloseBraceToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsMultilineBlockContext), 4 /* NewLine */));
|
|
// Special handling of unary operators.
|
|
// Prefix operators generally shouldn't have a space between
|
|
// them and their target unary expression.
|
|
this.NoSpaceAfterUnaryPrefixOperator = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.UnaryPrefixOperators, formatting.Shared.TokenRange.UnaryPrefixExpressions), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsNotBinaryOpContext), 8 /* Delete */));
|
|
this.NoSpaceAfterUnaryPreincrementOperator = new formatting.Rule(formatting.RuleDescriptor.create3(39 /* PlusPlusToken */, formatting.Shared.TokenRange.UnaryPreincrementExpressions), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.NoSpaceAfterUnaryPredecrementOperator = new formatting.Rule(formatting.RuleDescriptor.create3(40 /* MinusMinusToken */, formatting.Shared.TokenRange.UnaryPredecrementExpressions), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.NoSpaceBeforeUnaryPostincrementOperator = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.UnaryPostincrementExpressions, 39 /* PlusPlusToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.NoSpaceBeforeUnaryPostdecrementOperator = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.UnaryPostdecrementExpressions, 40 /* MinusMinusToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
// More unary operator special-casing.
|
|
// DevDiv 181814: Be careful when removing leading whitespace
|
|
// around unary operators. Examples:
|
|
// 1 - -2 --X--> 1--2
|
|
// a + ++b --X--> a+++b
|
|
this.SpaceAfterPostincrementWhenFollowedByAdd = new formatting.Rule(formatting.RuleDescriptor.create1(39 /* PlusPlusToken */, 34 /* PlusToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsBinaryOpContext), 2 /* Space */));
|
|
this.SpaceAfterAddWhenFollowedByUnaryPlus = new formatting.Rule(formatting.RuleDescriptor.create1(34 /* PlusToken */, 34 /* PlusToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsBinaryOpContext), 2 /* Space */));
|
|
this.SpaceAfterAddWhenFollowedByPreincrement = new formatting.Rule(formatting.RuleDescriptor.create1(34 /* PlusToken */, 39 /* PlusPlusToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsBinaryOpContext), 2 /* Space */));
|
|
this.SpaceAfterPostdecrementWhenFollowedBySubtract = new formatting.Rule(formatting.RuleDescriptor.create1(40 /* MinusMinusToken */, 35 /* MinusToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsBinaryOpContext), 2 /* Space */));
|
|
this.SpaceAfterSubtractWhenFollowedByUnaryMinus = new formatting.Rule(formatting.RuleDescriptor.create1(35 /* MinusToken */, 35 /* MinusToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsBinaryOpContext), 2 /* Space */));
|
|
this.SpaceAfterSubtractWhenFollowedByPredecrement = new formatting.Rule(formatting.RuleDescriptor.create1(35 /* MinusToken */, 40 /* MinusMinusToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsBinaryOpContext), 2 /* Space */));
|
|
this.NoSpaceBeforeComma = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 23 /* CommaToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.SpaceAfterCertainKeywords = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.FromTokens([99 /* VarKeyword */, 95 /* ThrowKeyword */, 89 /* NewKeyword */, 75 /* DeleteKeyword */, 91 /* ReturnKeyword */, 98 /* TypeOfKeyword */]), formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 2 /* Space */));
|
|
this.SpaceAfterLetConstInVariableDeclaration = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.FromTokens([105 /* LetKeyword */, 71 /* ConstKeyword */]), formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsStartOfVariableDeclarationList), 2 /* Space */));
|
|
this.NoSpaceBeforeOpenParenInFuncCall = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 16 /* OpenParenToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsFunctionCallOrNewContext, Rules.IsPreviousTokenNotComma), 8 /* Delete */));
|
|
this.SpaceAfterFunctionInFuncDecl = new formatting.Rule(formatting.RuleDescriptor.create3(84 /* FunctionKeyword */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsFunctionDeclContext), 2 /* Space */));
|
|
this.NoSpaceBeforeOpenParenInFuncDecl = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 16 /* OpenParenToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsFunctionDeclContext), 8 /* Delete */));
|
|
this.SpaceAfterVoidOperator = new formatting.Rule(formatting.RuleDescriptor.create3(100 /* VoidKeyword */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsVoidOpContext), 2 /* Space */));
|
|
this.NoSpaceBetweenReturnAndSemicolon = new formatting.Rule(formatting.RuleDescriptor.create1(91 /* ReturnKeyword */, 22 /* SemicolonToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
// Add a space between statements. All keywords except (do,else,case) has open/close parens after them.
|
|
// So, we have a rule to add a space for [),Any], [do,Any], [else,Any], and [case,Any]
|
|
this.SpaceBetweenStatements = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.FromTokens([17 /* CloseParenToken */, 76 /* DoKeyword */, 77 /* ElseKeyword */, 68 /* CaseKeyword */]), formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsNotForContext), 2 /* Space */));
|
|
// This low-pri rule takes care of "try {" and "finally {" in case the rule SpaceBeforeOpenBraceInControl didn't execute on FormatOnEnter.
|
|
this.SpaceAfterTryFinally = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.FromTokens([97 /* TryKeyword */, 82 /* FinallyKeyword */]), 14 /* OpenBraceToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 2 /* Space */));
|
|
// get x() {}
|
|
// set x(val) {}
|
|
this.SpaceAfterGetSetInMember = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.FromTokens([120 /* GetKeyword */, 126 /* SetKeyword */]), 66 /* Identifier */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsFunctionDeclContext), 2 /* Space */));
|
|
// Special case for binary operators (that are keywords). For these we have to add a space and shouldn't follow any user options.
|
|
this.SpaceBeforeBinaryKeywordOperator = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.Any, formatting.Shared.TokenRange.BinaryKeywordOperators), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsBinaryOpContext), 2 /* Space */));
|
|
this.SpaceAfterBinaryKeywordOperator = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.BinaryKeywordOperators, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsBinaryOpContext), 2 /* Space */));
|
|
// TypeScript-specific higher priority rules
|
|
// Treat constructor as an identifier in a function declaration, and remove spaces between constructor and following left parentheses
|
|
this.NoSpaceAfterConstructor = new formatting.Rule(formatting.RuleDescriptor.create1(118 /* ConstructorKeyword */, 16 /* OpenParenToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
// Use of module as a function call. e.g.: import m2 = module("m2");
|
|
this.NoSpaceAfterModuleImport = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.FromTokens([122 /* ModuleKeyword */, 124 /* RequireKeyword */]), 16 /* OpenParenToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
// Add a space around certain TypeScript keywords
|
|
this.SpaceAfterCertainTypeScriptKeywords = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.FromTokens([112 /* AbstractKeyword */, 70 /* ClassKeyword */, 119 /* DeclareKeyword */, 74 /* DefaultKeyword */, 78 /* EnumKeyword */, 79 /* ExportKeyword */, 80 /* ExtendsKeyword */, 120 /* GetKeyword */, 103 /* ImplementsKeyword */, 86 /* ImportKeyword */, 104 /* InterfaceKeyword */, 122 /* ModuleKeyword */, 123 /* NamespaceKeyword */, 107 /* PrivateKeyword */, 109 /* PublicKeyword */, 108 /* ProtectedKeyword */, 126 /* SetKeyword */, 110 /* StaticKeyword */]), formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 2 /* Space */));
|
|
this.SpaceBeforeCertainTypeScriptKeywords = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.Any, formatting.Shared.TokenRange.FromTokens([80 /* ExtendsKeyword */, 103 /* ImplementsKeyword */])), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 2 /* Space */));
|
|
// Treat string literals in module names as identifiers, and add a space between the literal and the opening Brace braces, e.g.: module "m2" {
|
|
this.SpaceAfterModuleName = new formatting.Rule(formatting.RuleDescriptor.create1(8 /* StringLiteral */, 14 /* OpenBraceToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsModuleDeclContext), 2 /* Space */));
|
|
// Lambda expressions
|
|
this.SpaceAfterArrow = new formatting.Rule(formatting.RuleDescriptor.create3(33 /* EqualsGreaterThanToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 2 /* Space */));
|
|
// Optional parameters and let args
|
|
this.NoSpaceAfterEllipsis = new formatting.Rule(formatting.RuleDescriptor.create1(21 /* DotDotDotToken */, 66 /* Identifier */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.NoSpaceAfterOptionalParameters = new formatting.Rule(formatting.RuleDescriptor.create3(51 /* QuestionToken */, formatting.Shared.TokenRange.FromTokens([17 /* CloseParenToken */, 23 /* CommaToken */])), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsNotBinaryOpContext), 8 /* Delete */));
|
|
// generics
|
|
this.NoSpaceBeforeOpenAngularBracket = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.TypeNames, 24 /* LessThanToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsTypeArgumentOrParameterContext), 8 /* Delete */));
|
|
this.NoSpaceBetweenCloseParenAndAngularBracket = new formatting.Rule(formatting.RuleDescriptor.create1(17 /* CloseParenToken */, 24 /* LessThanToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsTypeArgumentOrParameterContext), 8 /* Delete */));
|
|
this.NoSpaceAfterOpenAngularBracket = new formatting.Rule(formatting.RuleDescriptor.create3(24 /* LessThanToken */, formatting.Shared.TokenRange.TypeNames), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsTypeArgumentOrParameterContext), 8 /* Delete */));
|
|
this.NoSpaceBeforeCloseAngularBracket = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 26 /* GreaterThanToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsTypeArgumentOrParameterContext), 8 /* Delete */));
|
|
this.NoSpaceAfterCloseAngularBracket = new formatting.Rule(formatting.RuleDescriptor.create3(26 /* GreaterThanToken */, formatting.Shared.TokenRange.FromTokens([16 /* OpenParenToken */, 18 /* OpenBracketToken */, 26 /* GreaterThanToken */, 23 /* CommaToken */])), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsTypeArgumentOrParameterContext), 8 /* Delete */));
|
|
// Remove spaces in empty interface literals. e.g.: x: {}
|
|
this.NoSpaceBetweenEmptyInterfaceBraceBrackets = new formatting.Rule(formatting.RuleDescriptor.create1(14 /* OpenBraceToken */, 15 /* CloseBraceToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsObjectTypeContext), 8 /* Delete */));
|
|
// decorators
|
|
this.SpaceBeforeAt = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 53 /* AtToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 2 /* Space */));
|
|
this.NoSpaceAfterAt = new formatting.Rule(formatting.RuleDescriptor.create3(53 /* AtToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.SpaceAfterDecorator = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.Any, formatting.Shared.TokenRange.FromTokens([112 /* AbstractKeyword */, 66 /* Identifier */, 79 /* ExportKeyword */, 74 /* DefaultKeyword */, 70 /* ClassKeyword */, 110 /* StaticKeyword */, 109 /* PublicKeyword */, 107 /* PrivateKeyword */, 108 /* ProtectedKeyword */, 120 /* GetKeyword */, 126 /* SetKeyword */, 18 /* OpenBracketToken */, 36 /* AsteriskToken */])), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsEndOfDecoratorContextOnSameLine), 2 /* Space */));
|
|
this.NoSpaceBetweenFunctionKeywordAndStar = new formatting.Rule(formatting.RuleDescriptor.create1(84 /* FunctionKeyword */, 36 /* AsteriskToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsFunctionDeclarationOrFunctionExpressionContext), 8 /* Delete */));
|
|
this.SpaceAfterStarInGeneratorDeclaration = new formatting.Rule(formatting.RuleDescriptor.create3(36 /* AsteriskToken */, formatting.Shared.TokenRange.FromTokens([66 /* Identifier */, 16 /* OpenParenToken */])), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsFunctionDeclarationOrFunctionExpressionContext), 2 /* Space */));
|
|
this.NoSpaceBetweenYieldKeywordAndStar = new formatting.Rule(formatting.RuleDescriptor.create1(111 /* YieldKeyword */, 36 /* AsteriskToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsYieldOrYieldStarWithOperand), 8 /* Delete */));
|
|
this.SpaceBetweenYieldOrYieldStarAndOperand = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.FromTokens([111 /* YieldKeyword */, 36 /* AsteriskToken */]), formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsYieldOrYieldStarWithOperand), 2 /* Space */));
|
|
// These rules are higher in priority than user-configurable rules.
|
|
this.HighPriorityCommonRules =
|
|
[
|
|
this.IgnoreBeforeComment, this.IgnoreAfterLineComment,
|
|
this.NoSpaceBeforeColon, this.SpaceAfterColon, this.NoSpaceBeforeQuestionMark, this.SpaceAfterQuestionMarkInConditionalOperator,
|
|
this.NoSpaceAfterQuestionMark,
|
|
this.NoSpaceBeforeDot, this.NoSpaceAfterDot,
|
|
this.NoSpaceAfterUnaryPrefixOperator,
|
|
this.NoSpaceAfterUnaryPreincrementOperator, this.NoSpaceAfterUnaryPredecrementOperator,
|
|
this.NoSpaceBeforeUnaryPostincrementOperator, this.NoSpaceBeforeUnaryPostdecrementOperator,
|
|
this.SpaceAfterPostincrementWhenFollowedByAdd,
|
|
this.SpaceAfterAddWhenFollowedByUnaryPlus, this.SpaceAfterAddWhenFollowedByPreincrement,
|
|
this.SpaceAfterPostdecrementWhenFollowedBySubtract,
|
|
this.SpaceAfterSubtractWhenFollowedByUnaryMinus, this.SpaceAfterSubtractWhenFollowedByPredecrement,
|
|
this.NoSpaceAfterCloseBrace,
|
|
this.SpaceAfterOpenBrace, this.SpaceBeforeCloseBrace, this.NewLineBeforeCloseBraceInBlockContext,
|
|
this.SpaceAfterCloseBrace, this.SpaceBetweenCloseBraceAndElse, this.SpaceBetweenCloseBraceAndWhile, this.NoSpaceBetweenEmptyBraceBrackets,
|
|
this.NoSpaceBetweenFunctionKeywordAndStar, this.SpaceAfterStarInGeneratorDeclaration,
|
|
this.SpaceAfterFunctionInFuncDecl, this.NewLineAfterOpenBraceInBlockContext, this.SpaceAfterGetSetInMember,
|
|
this.NoSpaceBetweenYieldKeywordAndStar, this.SpaceBetweenYieldOrYieldStarAndOperand,
|
|
this.NoSpaceBetweenReturnAndSemicolon,
|
|
this.SpaceAfterCertainKeywords,
|
|
this.SpaceAfterLetConstInVariableDeclaration,
|
|
this.NoSpaceBeforeOpenParenInFuncCall,
|
|
this.SpaceBeforeBinaryKeywordOperator, this.SpaceAfterBinaryKeywordOperator,
|
|
this.SpaceAfterVoidOperator,
|
|
// TypeScript-specific rules
|
|
this.NoSpaceAfterConstructor, this.NoSpaceAfterModuleImport,
|
|
this.SpaceAfterCertainTypeScriptKeywords, this.SpaceBeforeCertainTypeScriptKeywords,
|
|
this.SpaceAfterModuleName,
|
|
this.SpaceAfterArrow,
|
|
this.NoSpaceAfterEllipsis,
|
|
this.NoSpaceAfterOptionalParameters,
|
|
this.NoSpaceBetweenEmptyInterfaceBraceBrackets,
|
|
this.NoSpaceBeforeOpenAngularBracket,
|
|
this.NoSpaceBetweenCloseParenAndAngularBracket,
|
|
this.NoSpaceAfterOpenAngularBracket,
|
|
this.NoSpaceBeforeCloseAngularBracket,
|
|
this.NoSpaceAfterCloseAngularBracket,
|
|
this.SpaceBeforeAt,
|
|
this.NoSpaceAfterAt,
|
|
this.SpaceAfterDecorator,
|
|
];
|
|
// These rules are lower in priority than user-configurable rules.
|
|
this.LowPriorityCommonRules =
|
|
[
|
|
this.NoSpaceBeforeSemicolon,
|
|
this.SpaceBeforeOpenBraceInControl, this.SpaceBeforeOpenBraceInFunction, this.SpaceBeforeOpenBraceInTypeScriptDeclWithBlock,
|
|
this.NoSpaceBeforeComma,
|
|
this.NoSpaceBeforeOpenBracket, this.NoSpaceAfterOpenBracket,
|
|
this.NoSpaceBeforeCloseBracket, this.NoSpaceAfterCloseBracket,
|
|
this.SpaceAfterSemicolon,
|
|
this.NoSpaceBeforeOpenParenInFuncDecl,
|
|
this.SpaceBetweenStatements, this.SpaceAfterTryFinally
|
|
];
|
|
///
|
|
/// Rules controlled by user options
|
|
///
|
|
// Insert space after comma delimiter
|
|
this.SpaceAfterComma = new formatting.Rule(formatting.RuleDescriptor.create3(23 /* CommaToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 2 /* Space */));
|
|
this.NoSpaceAfterComma = new formatting.Rule(formatting.RuleDescriptor.create3(23 /* CommaToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
// Insert space before and after binary operators
|
|
this.SpaceBeforeBinaryOperator = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.Any, formatting.Shared.TokenRange.BinaryOperators), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsBinaryOpContext), 2 /* Space */));
|
|
this.SpaceAfterBinaryOperator = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.BinaryOperators, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsBinaryOpContext), 2 /* Space */));
|
|
this.NoSpaceBeforeBinaryOperator = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.Any, formatting.Shared.TokenRange.BinaryOperators), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsBinaryOpContext), 8 /* Delete */));
|
|
this.NoSpaceAfterBinaryOperator = new formatting.Rule(formatting.RuleDescriptor.create4(formatting.Shared.TokenRange.BinaryOperators, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsBinaryOpContext), 8 /* Delete */));
|
|
// Insert space after keywords in control flow statements
|
|
this.SpaceAfterKeywordInControl = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Keywords, 16 /* OpenParenToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsControlDeclContext), 2 /* Space */));
|
|
this.NoSpaceAfterKeywordInControl = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Keywords, 16 /* OpenParenToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsControlDeclContext), 8 /* Delete */));
|
|
// Open Brace braces after function
|
|
//TypeScript: Function can have return types, which can be made of tons of different token kinds
|
|
this.NewLineBeforeOpenBraceInFunction = new formatting.Rule(formatting.RuleDescriptor.create2(this.FunctionOpenBraceLeftTokenRange, 14 /* OpenBraceToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsFunctionDeclContext, Rules.IsBeforeMultilineBlockContext), 4 /* NewLine */), 1 /* CanDeleteNewLines */);
|
|
// Open Brace braces after TypeScript module/class/interface
|
|
this.NewLineBeforeOpenBraceInTypeScriptDeclWithBlock = new formatting.Rule(formatting.RuleDescriptor.create2(this.TypeScriptOpenBraceLeftTokenRange, 14 /* OpenBraceToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsTypeScriptDeclWithBlockContext, Rules.IsBeforeMultilineBlockContext), 4 /* NewLine */), 1 /* CanDeleteNewLines */);
|
|
// Open Brace braces after control block
|
|
this.NewLineBeforeOpenBraceInControl = new formatting.Rule(formatting.RuleDescriptor.create2(this.ControlOpenBraceLeftTokenRange, 14 /* OpenBraceToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsControlDeclContext, Rules.IsBeforeMultilineBlockContext), 4 /* NewLine */), 1 /* CanDeleteNewLines */);
|
|
// Insert space after semicolon in for statement
|
|
this.SpaceAfterSemicolonInFor = new formatting.Rule(formatting.RuleDescriptor.create3(22 /* SemicolonToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsForContext), 2 /* Space */));
|
|
this.NoSpaceAfterSemicolonInFor = new formatting.Rule(formatting.RuleDescriptor.create3(22 /* SemicolonToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext, Rules.IsForContext), 8 /* Delete */));
|
|
// Insert space after opening and before closing nonempty parenthesis
|
|
this.SpaceAfterOpenParen = new formatting.Rule(formatting.RuleDescriptor.create3(16 /* OpenParenToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 2 /* Space */));
|
|
this.SpaceBeforeCloseParen = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 17 /* CloseParenToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 2 /* Space */));
|
|
this.NoSpaceBetweenParens = new formatting.Rule(formatting.RuleDescriptor.create1(16 /* OpenParenToken */, 17 /* CloseParenToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.NoSpaceAfterOpenParen = new formatting.Rule(formatting.RuleDescriptor.create3(16 /* OpenParenToken */, formatting.Shared.TokenRange.Any), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
this.NoSpaceBeforeCloseParen = new formatting.Rule(formatting.RuleDescriptor.create2(formatting.Shared.TokenRange.Any, 17 /* CloseParenToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsSameLineTokenContext), 8 /* Delete */));
|
|
// Insert space after function keyword for anonymous functions
|
|
this.SpaceAfterAnonymousFunctionKeyword = new formatting.Rule(formatting.RuleDescriptor.create1(84 /* FunctionKeyword */, 16 /* OpenParenToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsFunctionDeclContext), 2 /* Space */));
|
|
this.NoSpaceAfterAnonymousFunctionKeyword = new formatting.Rule(formatting.RuleDescriptor.create1(84 /* FunctionKeyword */, 16 /* OpenParenToken */), formatting.RuleOperation.create2(new formatting.RuleOperationContext(Rules.IsFunctionDeclContext), 8 /* Delete */));
|
|
}
|
|
Rules.prototype.getRuleName = function (rule) {
|
|
var o = this;
|
|
for (var name_30 in o) {
|
|
if (o[name_30] === rule) {
|
|
return name_30;
|
|
}
|
|
}
|
|
throw new Error("Unknown rule");
|
|
};
|
|
///
|
|
/// Contexts
|
|
///
|
|
Rules.IsForContext = function (context) {
|
|
return context.contextNode.kind === 196 /* ForStatement */;
|
|
};
|
|
Rules.IsNotForContext = function (context) {
|
|
return !Rules.IsForContext(context);
|
|
};
|
|
Rules.IsBinaryOpContext = function (context) {
|
|
switch (context.contextNode.kind) {
|
|
case 178 /* BinaryExpression */:
|
|
case 179 /* ConditionalExpression */:
|
|
case 186 /* AsExpression */:
|
|
case 147 /* TypePredicate */:
|
|
return true;
|
|
// equals in binding elements: function foo([[x, y] = [1, 2]])
|
|
case 160 /* BindingElement */:
|
|
// equals in type X = ...
|
|
case 213 /* TypeAliasDeclaration */:
|
|
// equal in import a = module('a');
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
// equal in let a = 0;
|
|
case 208 /* VariableDeclaration */:
|
|
// equal in p = 0;
|
|
case 135 /* Parameter */:
|
|
case 244 /* EnumMember */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
return context.currentTokenSpan.kind === 54 /* EqualsToken */ || context.nextTokenSpan.kind === 54 /* EqualsToken */;
|
|
// "in" keyword in for (let x in []) { }
|
|
case 197 /* ForInStatement */:
|
|
return context.currentTokenSpan.kind === 87 /* InKeyword */ || context.nextTokenSpan.kind === 87 /* InKeyword */;
|
|
// Technically, "of" is not a binary operator, but format it the same way as "in"
|
|
case 198 /* ForOfStatement */:
|
|
return context.currentTokenSpan.kind === 131 /* OfKeyword */ || context.nextTokenSpan.kind === 131 /* OfKeyword */;
|
|
}
|
|
return false;
|
|
};
|
|
Rules.IsNotBinaryOpContext = function (context) {
|
|
return !Rules.IsBinaryOpContext(context);
|
|
};
|
|
Rules.IsConditionalOperatorContext = function (context) {
|
|
return context.contextNode.kind === 179 /* ConditionalExpression */;
|
|
};
|
|
Rules.IsSameLineTokenOrBeforeMultilineBlockContext = function (context) {
|
|
//// This check is mainly used inside SpaceBeforeOpenBraceInControl and SpaceBeforeOpenBraceInFunction.
|
|
////
|
|
//// Ex:
|
|
//// if (1) { ....
|
|
//// * ) and { are on the same line so apply the rule. Here we don't care whether it's same or multi block context
|
|
////
|
|
//// Ex:
|
|
//// if (1)
|
|
//// { ... }
|
|
//// * ) and { are on differnet lines. We only need to format if the block is multiline context. So in this case we don't format.
|
|
////
|
|
//// Ex:
|
|
//// if (1)
|
|
//// { ...
|
|
//// }
|
|
//// * ) and { are on differnet lines. We only need to format if the block is multiline context. So in this case we format.
|
|
return context.TokensAreOnSameLine() || Rules.IsBeforeMultilineBlockContext(context);
|
|
};
|
|
// This check is done before an open brace in a control construct, a function, or a typescript block declaration
|
|
Rules.IsBeforeMultilineBlockContext = function (context) {
|
|
return Rules.IsBeforeBlockContext(context) && !(context.NextNodeAllOnSameLine() || context.NextNodeBlockIsOnOneLine());
|
|
};
|
|
Rules.IsMultilineBlockContext = function (context) {
|
|
return Rules.IsBlockContext(context) && !(context.ContextNodeAllOnSameLine() || context.ContextNodeBlockIsOnOneLine());
|
|
};
|
|
Rules.IsSingleLineBlockContext = function (context) {
|
|
return Rules.IsBlockContext(context) && (context.ContextNodeAllOnSameLine() || context.ContextNodeBlockIsOnOneLine());
|
|
};
|
|
Rules.IsBlockContext = function (context) {
|
|
return Rules.NodeIsBlockContext(context.contextNode);
|
|
};
|
|
Rules.IsBeforeBlockContext = function (context) {
|
|
return Rules.NodeIsBlockContext(context.nextTokenParent);
|
|
};
|
|
// IMPORTANT!!! This method must return true ONLY for nodes with open and close braces as immediate children
|
|
Rules.NodeIsBlockContext = function (node) {
|
|
if (Rules.NodeIsTypeScriptDeclWithBlockContext(node)) {
|
|
// This means we are in a context that looks like a block to the user, but in the grammar is actually not a node (it's a class, module, enum, object type literal, etc).
|
|
return true;
|
|
}
|
|
switch (node.kind) {
|
|
case 189 /* Block */:
|
|
case 217 /* CaseBlock */:
|
|
case 162 /* ObjectLiteralExpression */:
|
|
case 216 /* ModuleBlock */:
|
|
return true;
|
|
}
|
|
return false;
|
|
};
|
|
Rules.IsFunctionDeclContext = function (context) {
|
|
switch (context.contextNode.kind) {
|
|
case 210 /* FunctionDeclaration */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
//case SyntaxKind.MemberFunctionDeclaration:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
///case SyntaxKind.MethodSignature:
|
|
case 144 /* CallSignature */:
|
|
case 170 /* FunctionExpression */:
|
|
case 141 /* Constructor */:
|
|
case 171 /* ArrowFunction */:
|
|
//case SyntaxKind.ConstructorDeclaration:
|
|
//case SyntaxKind.SimpleArrowFunctionExpression:
|
|
//case SyntaxKind.ParenthesizedArrowFunctionExpression:
|
|
case 212 /* InterfaceDeclaration */:
|
|
return true;
|
|
}
|
|
return false;
|
|
};
|
|
Rules.IsFunctionDeclarationOrFunctionExpressionContext = function (context) {
|
|
return context.contextNode.kind === 210 /* FunctionDeclaration */ || context.contextNode.kind === 170 /* FunctionExpression */;
|
|
};
|
|
Rules.IsTypeScriptDeclWithBlockContext = function (context) {
|
|
return Rules.NodeIsTypeScriptDeclWithBlockContext(context.contextNode);
|
|
};
|
|
Rules.NodeIsTypeScriptDeclWithBlockContext = function (node) {
|
|
switch (node.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 152 /* TypeLiteral */:
|
|
case 215 /* ModuleDeclaration */:
|
|
return true;
|
|
}
|
|
return false;
|
|
};
|
|
Rules.IsAfterCodeBlockContext = function (context) {
|
|
switch (context.currentTokenParent.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
case 215 /* ModuleDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 189 /* Block */:
|
|
case 241 /* CatchClause */:
|
|
case 216 /* ModuleBlock */:
|
|
case 203 /* SwitchStatement */:
|
|
return true;
|
|
}
|
|
return false;
|
|
};
|
|
Rules.IsControlDeclContext = function (context) {
|
|
switch (context.contextNode.kind) {
|
|
case 193 /* IfStatement */:
|
|
case 203 /* SwitchStatement */:
|
|
case 196 /* ForStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
case 195 /* WhileStatement */:
|
|
case 206 /* TryStatement */:
|
|
case 194 /* DoStatement */:
|
|
case 202 /* WithStatement */:
|
|
// TODO
|
|
// case SyntaxKind.ElseClause:
|
|
case 241 /* CatchClause */:
|
|
return true;
|
|
default:
|
|
return false;
|
|
}
|
|
};
|
|
Rules.IsObjectContext = function (context) {
|
|
return context.contextNode.kind === 162 /* ObjectLiteralExpression */;
|
|
};
|
|
Rules.IsFunctionCallContext = function (context) {
|
|
return context.contextNode.kind === 165 /* CallExpression */;
|
|
};
|
|
Rules.IsNewContext = function (context) {
|
|
return context.contextNode.kind === 166 /* NewExpression */;
|
|
};
|
|
Rules.IsFunctionCallOrNewContext = function (context) {
|
|
return Rules.IsFunctionCallContext(context) || Rules.IsNewContext(context);
|
|
};
|
|
Rules.IsPreviousTokenNotComma = function (context) {
|
|
return context.currentTokenSpan.kind !== 23 /* CommaToken */;
|
|
};
|
|
Rules.IsSameLineTokenContext = function (context) {
|
|
return context.TokensAreOnSameLine();
|
|
};
|
|
Rules.IsNotBeforeBlockInFunctionDeclarationContext = function (context) {
|
|
return !Rules.IsFunctionDeclContext(context) && !Rules.IsBeforeBlockContext(context);
|
|
};
|
|
Rules.IsEndOfDecoratorContextOnSameLine = function (context) {
|
|
return context.TokensAreOnSameLine() &&
|
|
context.contextNode.decorators &&
|
|
Rules.NodeIsInDecoratorContext(context.currentTokenParent) &&
|
|
!Rules.NodeIsInDecoratorContext(context.nextTokenParent);
|
|
};
|
|
Rules.NodeIsInDecoratorContext = function (node) {
|
|
while (ts.isExpression(node)) {
|
|
node = node.parent;
|
|
}
|
|
return node.kind === 136 /* Decorator */;
|
|
};
|
|
Rules.IsStartOfVariableDeclarationList = function (context) {
|
|
return context.currentTokenParent.kind === 209 /* VariableDeclarationList */ &&
|
|
context.currentTokenParent.getStart(context.sourceFile) === context.currentTokenSpan.pos;
|
|
};
|
|
Rules.IsNotFormatOnEnter = function (context) {
|
|
return context.formattingRequestKind !== 2 /* FormatOnEnter */;
|
|
};
|
|
Rules.IsModuleDeclContext = function (context) {
|
|
return context.contextNode.kind === 215 /* ModuleDeclaration */;
|
|
};
|
|
Rules.IsObjectTypeContext = function (context) {
|
|
return context.contextNode.kind === 152 /* TypeLiteral */; // && context.contextNode.parent.kind !== SyntaxKind.InterfaceDeclaration;
|
|
};
|
|
Rules.IsTypeArgumentOrParameter = function (token, parent) {
|
|
if (token.kind !== 24 /* LessThanToken */ && token.kind !== 26 /* GreaterThanToken */) {
|
|
return false;
|
|
}
|
|
switch (parent.kind) {
|
|
case 148 /* TypeReference */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 144 /* CallSignature */:
|
|
case 145 /* ConstructSignature */:
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
return true;
|
|
default:
|
|
return false;
|
|
}
|
|
};
|
|
Rules.IsTypeArgumentOrParameterContext = function (context) {
|
|
return Rules.IsTypeArgumentOrParameter(context.currentTokenSpan, context.currentTokenParent) ||
|
|
Rules.IsTypeArgumentOrParameter(context.nextTokenSpan, context.nextTokenParent);
|
|
};
|
|
Rules.IsVoidOpContext = function (context) {
|
|
return context.currentTokenSpan.kind === 100 /* VoidKeyword */ && context.currentTokenParent.kind === 174 /* VoidExpression */;
|
|
};
|
|
Rules.IsYieldOrYieldStarWithOperand = function (context) {
|
|
return context.contextNode.kind === 181 /* YieldExpression */ && context.contextNode.expression !== undefined;
|
|
};
|
|
return Rules;
|
|
})();
|
|
formatting.Rules = Rules;
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
///<reference path='references.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
var RulesMap = (function () {
|
|
function RulesMap() {
|
|
this.map = [];
|
|
this.mapRowLength = 0;
|
|
}
|
|
RulesMap.create = function (rules) {
|
|
var result = new RulesMap();
|
|
result.Initialize(rules);
|
|
return result;
|
|
};
|
|
RulesMap.prototype.Initialize = function (rules) {
|
|
this.mapRowLength = 131 /* LastToken */ + 1;
|
|
this.map = new Array(this.mapRowLength * this.mapRowLength); //new Array<RulesBucket>(this.mapRowLength * this.mapRowLength);
|
|
// This array is used only during construction of the rulesbucket in the map
|
|
var rulesBucketConstructionStateList = new Array(this.map.length); //new Array<RulesBucketConstructionState>(this.map.length);
|
|
this.FillRules(rules, rulesBucketConstructionStateList);
|
|
return this.map;
|
|
};
|
|
RulesMap.prototype.FillRules = function (rules, rulesBucketConstructionStateList) {
|
|
var _this = this;
|
|
rules.forEach(function (rule) {
|
|
_this.FillRule(rule, rulesBucketConstructionStateList);
|
|
});
|
|
};
|
|
RulesMap.prototype.GetRuleBucketIndex = function (row, column) {
|
|
var rulesBucketIndex = (row * this.mapRowLength) + column;
|
|
//Debug.Assert(rulesBucketIndex < this.map.Length, "Trying to access an index outside the array.");
|
|
return rulesBucketIndex;
|
|
};
|
|
RulesMap.prototype.FillRule = function (rule, rulesBucketConstructionStateList) {
|
|
var _this = this;
|
|
var specificRule = rule.Descriptor.LeftTokenRange !== formatting.Shared.TokenRange.Any &&
|
|
rule.Descriptor.RightTokenRange !== formatting.Shared.TokenRange.Any;
|
|
rule.Descriptor.LeftTokenRange.GetTokens().forEach(function (left) {
|
|
rule.Descriptor.RightTokenRange.GetTokens().forEach(function (right) {
|
|
var rulesBucketIndex = _this.GetRuleBucketIndex(left, right);
|
|
var rulesBucket = _this.map[rulesBucketIndex];
|
|
if (rulesBucket === undefined) {
|
|
rulesBucket = _this.map[rulesBucketIndex] = new RulesBucket();
|
|
}
|
|
rulesBucket.AddRule(rule, specificRule, rulesBucketConstructionStateList, rulesBucketIndex);
|
|
});
|
|
});
|
|
};
|
|
RulesMap.prototype.GetRule = function (context) {
|
|
var bucketIndex = this.GetRuleBucketIndex(context.currentTokenSpan.kind, context.nextTokenSpan.kind);
|
|
var bucket = this.map[bucketIndex];
|
|
if (bucket != null) {
|
|
for (var _i = 0, _a = bucket.Rules(); _i < _a.length; _i++) {
|
|
var rule = _a[_i];
|
|
if (rule.Operation.Context.InContext(context)) {
|
|
return rule;
|
|
}
|
|
}
|
|
}
|
|
return null;
|
|
};
|
|
return RulesMap;
|
|
})();
|
|
formatting.RulesMap = RulesMap;
|
|
var MaskBitSize = 5;
|
|
var Mask = 0x1f;
|
|
(function (RulesPosition) {
|
|
RulesPosition[RulesPosition["IgnoreRulesSpecific"] = 0] = "IgnoreRulesSpecific";
|
|
RulesPosition[RulesPosition["IgnoreRulesAny"] = MaskBitSize * 1] = "IgnoreRulesAny";
|
|
RulesPosition[RulesPosition["ContextRulesSpecific"] = MaskBitSize * 2] = "ContextRulesSpecific";
|
|
RulesPosition[RulesPosition["ContextRulesAny"] = MaskBitSize * 3] = "ContextRulesAny";
|
|
RulesPosition[RulesPosition["NoContextRulesSpecific"] = MaskBitSize * 4] = "NoContextRulesSpecific";
|
|
RulesPosition[RulesPosition["NoContextRulesAny"] = MaskBitSize * 5] = "NoContextRulesAny";
|
|
})(formatting.RulesPosition || (formatting.RulesPosition = {}));
|
|
var RulesPosition = formatting.RulesPosition;
|
|
var RulesBucketConstructionState = (function () {
|
|
function RulesBucketConstructionState() {
|
|
//// The Rules list contains all the inserted rules into a rulebucket in the following order:
|
|
//// 1- Ignore rules with specific token combination
|
|
//// 2- Ignore rules with any token combination
|
|
//// 3- Context rules with specific token combination
|
|
//// 4- Context rules with any token combination
|
|
//// 5- Non-context rules with specific token combination
|
|
//// 6- Non-context rules with any token combination
|
|
////
|
|
//// The member rulesInsertionIndexBitmap is used to describe the number of rules
|
|
//// in each sub-bucket (above) hence can be used to know the index of where to insert
|
|
//// the next rule. It's a bitmap which contains 6 different sections each is given 5 bits.
|
|
////
|
|
//// Example:
|
|
//// In order to insert a rule to the end of sub-bucket (3), we get the index by adding
|
|
//// the values in the bitmap segments 3rd, 2nd, and 1st.
|
|
this.rulesInsertionIndexBitmap = 0;
|
|
}
|
|
RulesBucketConstructionState.prototype.GetInsertionIndex = function (maskPosition) {
|
|
var index = 0;
|
|
var pos = 0;
|
|
var indexBitmap = this.rulesInsertionIndexBitmap;
|
|
while (pos <= maskPosition) {
|
|
index += (indexBitmap & Mask);
|
|
indexBitmap >>= MaskBitSize;
|
|
pos += MaskBitSize;
|
|
}
|
|
return index;
|
|
};
|
|
RulesBucketConstructionState.prototype.IncreaseInsertionIndex = function (maskPosition) {
|
|
var value = (this.rulesInsertionIndexBitmap >> maskPosition) & Mask;
|
|
value++;
|
|
ts.Debug.assert((value & Mask) === value, "Adding more rules into the sub-bucket than allowed. Maximum allowed is 32 rules.");
|
|
var temp = this.rulesInsertionIndexBitmap & ~(Mask << maskPosition);
|
|
temp |= value << maskPosition;
|
|
this.rulesInsertionIndexBitmap = temp;
|
|
};
|
|
return RulesBucketConstructionState;
|
|
})();
|
|
formatting.RulesBucketConstructionState = RulesBucketConstructionState;
|
|
var RulesBucket = (function () {
|
|
function RulesBucket() {
|
|
this.rules = [];
|
|
}
|
|
RulesBucket.prototype.Rules = function () {
|
|
return this.rules;
|
|
};
|
|
RulesBucket.prototype.AddRule = function (rule, specificTokens, constructionState, rulesBucketIndex) {
|
|
var position;
|
|
if (rule.Operation.Action === 1 /* Ignore */) {
|
|
position = specificTokens ?
|
|
RulesPosition.IgnoreRulesSpecific :
|
|
RulesPosition.IgnoreRulesAny;
|
|
}
|
|
else if (!rule.Operation.Context.IsAny()) {
|
|
position = specificTokens ?
|
|
RulesPosition.ContextRulesSpecific :
|
|
RulesPosition.ContextRulesAny;
|
|
}
|
|
else {
|
|
position = specificTokens ?
|
|
RulesPosition.NoContextRulesSpecific :
|
|
RulesPosition.NoContextRulesAny;
|
|
}
|
|
var state = constructionState[rulesBucketIndex];
|
|
if (state === undefined) {
|
|
state = constructionState[rulesBucketIndex] = new RulesBucketConstructionState();
|
|
}
|
|
var index = state.GetInsertionIndex(position);
|
|
this.rules.splice(index, 0, rule);
|
|
state.IncreaseInsertionIndex(position);
|
|
};
|
|
return RulesBucket;
|
|
})();
|
|
formatting.RulesBucket = RulesBucket;
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
///<reference path='references.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
var Shared;
|
|
(function (Shared) {
|
|
var TokenRangeAccess = (function () {
|
|
function TokenRangeAccess(from, to, except) {
|
|
this.tokens = [];
|
|
for (var token = from; token <= to; token++) {
|
|
if (except.indexOf(token) < 0) {
|
|
this.tokens.push(token);
|
|
}
|
|
}
|
|
}
|
|
TokenRangeAccess.prototype.GetTokens = function () {
|
|
return this.tokens;
|
|
};
|
|
TokenRangeAccess.prototype.Contains = function (token) {
|
|
return this.tokens.indexOf(token) >= 0;
|
|
};
|
|
return TokenRangeAccess;
|
|
})();
|
|
Shared.TokenRangeAccess = TokenRangeAccess;
|
|
var TokenValuesAccess = (function () {
|
|
function TokenValuesAccess(tks) {
|
|
this.tokens = tks && tks.length ? tks : [];
|
|
}
|
|
TokenValuesAccess.prototype.GetTokens = function () {
|
|
return this.tokens;
|
|
};
|
|
TokenValuesAccess.prototype.Contains = function (token) {
|
|
return this.tokens.indexOf(token) >= 0;
|
|
};
|
|
return TokenValuesAccess;
|
|
})();
|
|
Shared.TokenValuesAccess = TokenValuesAccess;
|
|
var TokenSingleValueAccess = (function () {
|
|
function TokenSingleValueAccess(token) {
|
|
this.token = token;
|
|
}
|
|
TokenSingleValueAccess.prototype.GetTokens = function () {
|
|
return [this.token];
|
|
};
|
|
TokenSingleValueAccess.prototype.Contains = function (tokenValue) {
|
|
return tokenValue === this.token;
|
|
};
|
|
return TokenSingleValueAccess;
|
|
})();
|
|
Shared.TokenSingleValueAccess = TokenSingleValueAccess;
|
|
var TokenAllAccess = (function () {
|
|
function TokenAllAccess() {
|
|
}
|
|
TokenAllAccess.prototype.GetTokens = function () {
|
|
var result = [];
|
|
for (var token = 0 /* FirstToken */; token <= 131 /* LastToken */; token++) {
|
|
result.push(token);
|
|
}
|
|
return result;
|
|
};
|
|
TokenAllAccess.prototype.Contains = function (tokenValue) {
|
|
return true;
|
|
};
|
|
TokenAllAccess.prototype.toString = function () {
|
|
return "[allTokens]";
|
|
};
|
|
return TokenAllAccess;
|
|
})();
|
|
Shared.TokenAllAccess = TokenAllAccess;
|
|
var TokenRange = (function () {
|
|
function TokenRange(tokenAccess) {
|
|
this.tokenAccess = tokenAccess;
|
|
}
|
|
TokenRange.FromToken = function (token) {
|
|
return new TokenRange(new TokenSingleValueAccess(token));
|
|
};
|
|
TokenRange.FromTokens = function (tokens) {
|
|
return new TokenRange(new TokenValuesAccess(tokens));
|
|
};
|
|
TokenRange.FromRange = function (f, to, except) {
|
|
if (except === void 0) { except = []; }
|
|
return new TokenRange(new TokenRangeAccess(f, to, except));
|
|
};
|
|
TokenRange.AllTokens = function () {
|
|
return new TokenRange(new TokenAllAccess());
|
|
};
|
|
TokenRange.prototype.GetTokens = function () {
|
|
return this.tokenAccess.GetTokens();
|
|
};
|
|
TokenRange.prototype.Contains = function (token) {
|
|
return this.tokenAccess.Contains(token);
|
|
};
|
|
TokenRange.prototype.toString = function () {
|
|
return this.tokenAccess.toString();
|
|
};
|
|
TokenRange.Any = TokenRange.AllTokens();
|
|
TokenRange.AnyIncludingMultilineComments = TokenRange.FromTokens(TokenRange.Any.GetTokens().concat([3 /* MultiLineCommentTrivia */]));
|
|
TokenRange.Keywords = TokenRange.FromRange(67 /* FirstKeyword */, 131 /* LastKeyword */);
|
|
TokenRange.BinaryOperators = TokenRange.FromRange(24 /* FirstBinaryOperator */, 65 /* LastBinaryOperator */);
|
|
TokenRange.BinaryKeywordOperators = TokenRange.FromTokens([87 /* InKeyword */, 88 /* InstanceOfKeyword */, 131 /* OfKeyword */, 113 /* AsKeyword */, 121 /* IsKeyword */]);
|
|
TokenRange.UnaryPrefixOperators = TokenRange.FromTokens([39 /* PlusPlusToken */, 40 /* MinusMinusToken */, 48 /* TildeToken */, 47 /* ExclamationToken */]);
|
|
TokenRange.UnaryPrefixExpressions = TokenRange.FromTokens([7 /* NumericLiteral */, 66 /* Identifier */, 16 /* OpenParenToken */, 18 /* OpenBracketToken */, 14 /* OpenBraceToken */, 94 /* ThisKeyword */, 89 /* NewKeyword */]);
|
|
TokenRange.UnaryPreincrementExpressions = TokenRange.FromTokens([66 /* Identifier */, 16 /* OpenParenToken */, 94 /* ThisKeyword */, 89 /* NewKeyword */]);
|
|
TokenRange.UnaryPostincrementExpressions = TokenRange.FromTokens([66 /* Identifier */, 17 /* CloseParenToken */, 19 /* CloseBracketToken */, 89 /* NewKeyword */]);
|
|
TokenRange.UnaryPredecrementExpressions = TokenRange.FromTokens([66 /* Identifier */, 16 /* OpenParenToken */, 94 /* ThisKeyword */, 89 /* NewKeyword */]);
|
|
TokenRange.UnaryPostdecrementExpressions = TokenRange.FromTokens([66 /* Identifier */, 17 /* CloseParenToken */, 19 /* CloseBracketToken */, 89 /* NewKeyword */]);
|
|
TokenRange.Comments = TokenRange.FromTokens([2 /* SingleLineCommentTrivia */, 3 /* MultiLineCommentTrivia */]);
|
|
TokenRange.TypeNames = TokenRange.FromTokens([66 /* Identifier */, 125 /* NumberKeyword */, 127 /* StringKeyword */, 117 /* BooleanKeyword */, 128 /* SymbolKeyword */, 100 /* VoidKeyword */, 114 /* AnyKeyword */]);
|
|
return TokenRange;
|
|
})();
|
|
Shared.TokenRange = TokenRange;
|
|
})(Shared = formatting.Shared || (formatting.Shared = {}));
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
///<reference path='..\services.ts' />
|
|
///<reference path='formattingContext.ts' />
|
|
///<reference path='formattingRequestKind.ts' />
|
|
///<reference path='rule.ts' />
|
|
///<reference path='ruleAction.ts' />
|
|
///<reference path='ruleDescriptor.ts' />
|
|
///<reference path='ruleFlag.ts' />
|
|
///<reference path='ruleOperation.ts' />
|
|
///<reference path='ruleOperationContext.ts' />
|
|
///<reference path='rules.ts' />
|
|
///<reference path='rulesMap.ts' />
|
|
///<reference path='tokenRange.ts' />
|
|
/// <reference path="references.ts"/>
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
var RulesProvider = (function () {
|
|
function RulesProvider() {
|
|
this.globalRules = new formatting.Rules();
|
|
}
|
|
RulesProvider.prototype.getRuleName = function (rule) {
|
|
return this.globalRules.getRuleName(rule);
|
|
};
|
|
RulesProvider.prototype.getRuleByName = function (name) {
|
|
return this.globalRules[name];
|
|
};
|
|
RulesProvider.prototype.getRulesMap = function () {
|
|
return this.rulesMap;
|
|
};
|
|
RulesProvider.prototype.ensureUpToDate = function (options) {
|
|
// TODO: Should this be '==='?
|
|
if (this.options == null || !ts.compareDataObjects(this.options, options)) {
|
|
var activeRules = this.createActiveRules(options);
|
|
var rulesMap = formatting.RulesMap.create(activeRules);
|
|
this.activeRules = activeRules;
|
|
this.rulesMap = rulesMap;
|
|
this.options = ts.clone(options);
|
|
}
|
|
};
|
|
RulesProvider.prototype.createActiveRules = function (options) {
|
|
var rules = this.globalRules.HighPriorityCommonRules.slice(0);
|
|
if (options.InsertSpaceAfterCommaDelimiter) {
|
|
rules.push(this.globalRules.SpaceAfterComma);
|
|
}
|
|
else {
|
|
rules.push(this.globalRules.NoSpaceAfterComma);
|
|
}
|
|
if (options.InsertSpaceAfterFunctionKeywordForAnonymousFunctions) {
|
|
rules.push(this.globalRules.SpaceAfterAnonymousFunctionKeyword);
|
|
}
|
|
else {
|
|
rules.push(this.globalRules.NoSpaceAfterAnonymousFunctionKeyword);
|
|
}
|
|
if (options.InsertSpaceAfterKeywordsInControlFlowStatements) {
|
|
rules.push(this.globalRules.SpaceAfterKeywordInControl);
|
|
}
|
|
else {
|
|
rules.push(this.globalRules.NoSpaceAfterKeywordInControl);
|
|
}
|
|
if (options.InsertSpaceAfterOpeningAndBeforeClosingNonemptyParenthesis) {
|
|
rules.push(this.globalRules.SpaceAfterOpenParen);
|
|
rules.push(this.globalRules.SpaceBeforeCloseParen);
|
|
rules.push(this.globalRules.NoSpaceBetweenParens);
|
|
}
|
|
else {
|
|
rules.push(this.globalRules.NoSpaceAfterOpenParen);
|
|
rules.push(this.globalRules.NoSpaceBeforeCloseParen);
|
|
rules.push(this.globalRules.NoSpaceBetweenParens);
|
|
}
|
|
if (options.InsertSpaceAfterSemicolonInForStatements) {
|
|
rules.push(this.globalRules.SpaceAfterSemicolonInFor);
|
|
}
|
|
else {
|
|
rules.push(this.globalRules.NoSpaceAfterSemicolonInFor);
|
|
}
|
|
if (options.InsertSpaceBeforeAndAfterBinaryOperators) {
|
|
rules.push(this.globalRules.SpaceBeforeBinaryOperator);
|
|
rules.push(this.globalRules.SpaceAfterBinaryOperator);
|
|
}
|
|
else {
|
|
rules.push(this.globalRules.NoSpaceBeforeBinaryOperator);
|
|
rules.push(this.globalRules.NoSpaceAfterBinaryOperator);
|
|
}
|
|
if (options.PlaceOpenBraceOnNewLineForControlBlocks) {
|
|
rules.push(this.globalRules.NewLineBeforeOpenBraceInControl);
|
|
}
|
|
if (options.PlaceOpenBraceOnNewLineForFunctions) {
|
|
rules.push(this.globalRules.NewLineBeforeOpenBraceInFunction);
|
|
rules.push(this.globalRules.NewLineBeforeOpenBraceInTypeScriptDeclWithBlock);
|
|
}
|
|
rules = rules.concat(this.globalRules.LowPriorityCommonRules);
|
|
return rules;
|
|
};
|
|
return RulesProvider;
|
|
})();
|
|
formatting.RulesProvider = RulesProvider;
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
///<reference path='..\services.ts' />
|
|
///<reference path='formattingScanner.ts' />
|
|
///<reference path='rulesProvider.ts' />
|
|
///<reference path='references.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
var Constants;
|
|
(function (Constants) {
|
|
Constants[Constants["Unknown"] = -1] = "Unknown";
|
|
})(Constants || (Constants = {}));
|
|
function formatOnEnter(position, sourceFile, rulesProvider, options) {
|
|
var line = sourceFile.getLineAndCharacterOfPosition(position).line;
|
|
if (line === 0) {
|
|
return [];
|
|
}
|
|
// get the span for the previous\current line
|
|
var span = {
|
|
// get start position for the previous line
|
|
pos: ts.getStartPositionOfLine(line - 1, sourceFile),
|
|
// get end position for the current line (end value is exclusive so add 1 to the result)
|
|
end: ts.getEndLinePosition(line, sourceFile) + 1
|
|
};
|
|
return formatSpan(span, sourceFile, options, rulesProvider, 2 /* FormatOnEnter */);
|
|
}
|
|
formatting.formatOnEnter = formatOnEnter;
|
|
function formatOnSemicolon(position, sourceFile, rulesProvider, options) {
|
|
return formatOutermostParent(position, 22 /* SemicolonToken */, sourceFile, options, rulesProvider, 3 /* FormatOnSemicolon */);
|
|
}
|
|
formatting.formatOnSemicolon = formatOnSemicolon;
|
|
function formatOnClosingCurly(position, sourceFile, rulesProvider, options) {
|
|
return formatOutermostParent(position, 15 /* CloseBraceToken */, sourceFile, options, rulesProvider, 4 /* FormatOnClosingCurlyBrace */);
|
|
}
|
|
formatting.formatOnClosingCurly = formatOnClosingCurly;
|
|
function formatDocument(sourceFile, rulesProvider, options) {
|
|
var span = {
|
|
pos: 0,
|
|
end: sourceFile.text.length
|
|
};
|
|
return formatSpan(span, sourceFile, options, rulesProvider, 0 /* FormatDocument */);
|
|
}
|
|
formatting.formatDocument = formatDocument;
|
|
function formatSelection(start, end, sourceFile, rulesProvider, options) {
|
|
// format from the beginning of the line
|
|
var span = {
|
|
pos: ts.getLineStartPositionForPosition(start, sourceFile),
|
|
end: end
|
|
};
|
|
return formatSpan(span, sourceFile, options, rulesProvider, 1 /* FormatSelection */);
|
|
}
|
|
formatting.formatSelection = formatSelection;
|
|
function formatOutermostParent(position, expectedLastToken, sourceFile, options, rulesProvider, requestKind) {
|
|
var parent = findOutermostParent(position, expectedLastToken, sourceFile);
|
|
if (!parent) {
|
|
return [];
|
|
}
|
|
var span = {
|
|
pos: ts.getLineStartPositionForPosition(parent.getStart(sourceFile), sourceFile),
|
|
end: parent.end
|
|
};
|
|
return formatSpan(span, sourceFile, options, rulesProvider, requestKind);
|
|
}
|
|
function findOutermostParent(position, expectedTokenKind, sourceFile) {
|
|
var precedingToken = ts.findPrecedingToken(position, sourceFile);
|
|
// when it is claimed that trigger character was typed at given position
|
|
// we verify that there is a token with a matching kind whose end is equal to position (because the character was just typed).
|
|
// If this condition is not hold - then trigger character was typed in some other context,
|
|
// i.e.in comment and thus should not trigger autoformatting
|
|
if (!precedingToken ||
|
|
precedingToken.kind !== expectedTokenKind ||
|
|
position !== precedingToken.getEnd()) {
|
|
return undefined;
|
|
}
|
|
// walk up and search for the parent node that ends at the same position with precedingToken.
|
|
// for cases like this
|
|
//
|
|
// let x = 1;
|
|
// while (true) {
|
|
// }
|
|
// after typing close curly in while statement we want to reformat just the while statement.
|
|
// However if we just walk upwards searching for the parent that has the same end value -
|
|
// we'll end up with the whole source file. isListElement allows to stop on the list element level
|
|
var current = precedingToken;
|
|
while (current &&
|
|
current.parent &&
|
|
current.parent.end === precedingToken.end &&
|
|
!isListElement(current.parent, current)) {
|
|
current = current.parent;
|
|
}
|
|
return current;
|
|
}
|
|
// Returns true if node is a element in some list in parent
|
|
// i.e. parent is class declaration with the list of members and node is one of members.
|
|
function isListElement(parent, node) {
|
|
switch (parent.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
return ts.rangeContainsRange(parent.members, node);
|
|
case 215 /* ModuleDeclaration */:
|
|
var body = parent.body;
|
|
return body && body.kind === 189 /* Block */ && ts.rangeContainsRange(body.statements, node);
|
|
case 245 /* SourceFile */:
|
|
case 189 /* Block */:
|
|
case 216 /* ModuleBlock */:
|
|
return ts.rangeContainsRange(parent.statements, node);
|
|
case 241 /* CatchClause */:
|
|
return ts.rangeContainsRange(parent.block.statements, node);
|
|
}
|
|
return false;
|
|
}
|
|
/** find node that fully contains given text range */
|
|
function findEnclosingNode(range, sourceFile) {
|
|
return find(sourceFile);
|
|
function find(n) {
|
|
var candidate = ts.forEachChild(n, function (c) { return ts.startEndContainsRange(c.getStart(sourceFile), c.end, range) && c; });
|
|
if (candidate) {
|
|
var result = find(candidate);
|
|
if (result) {
|
|
return result;
|
|
}
|
|
}
|
|
return n;
|
|
}
|
|
}
|
|
/** formatting is not applied to ranges that contain parse errors.
|
|
* This function will return a predicate that for a given text range will tell
|
|
* if there are any parse errors that overlap with the range.
|
|
*/
|
|
function prepareRangeContainsErrorFunction(errors, originalRange) {
|
|
if (!errors.length) {
|
|
return rangeHasNoErrors;
|
|
}
|
|
// pick only errors that fall in range
|
|
var sorted = errors
|
|
.filter(function (d) { return ts.rangeOverlapsWithStartEnd(originalRange, d.start, d.start + d.length); })
|
|
.sort(function (e1, e2) { return e1.start - e2.start; });
|
|
if (!sorted.length) {
|
|
return rangeHasNoErrors;
|
|
}
|
|
var index = 0;
|
|
return function (r) {
|
|
// in current implementation sequence of arguments [r1, r2...] is monotonically increasing.
|
|
// 'index' tracks the index of the most recent error that was checked.
|
|
while (true) {
|
|
if (index >= sorted.length) {
|
|
// all errors in the range were already checked -> no error in specified range
|
|
return false;
|
|
}
|
|
var error = sorted[index];
|
|
if (r.end <= error.start) {
|
|
// specified range ends before the error refered by 'index' - no error in range
|
|
return false;
|
|
}
|
|
if (ts.startEndOverlapsWithStartEnd(r.pos, r.end, error.start, error.start + error.length)) {
|
|
// specified range overlaps with error range
|
|
return true;
|
|
}
|
|
index++;
|
|
}
|
|
};
|
|
function rangeHasNoErrors(r) {
|
|
return false;
|
|
}
|
|
}
|
|
/**
|
|
* Start of the original range might fall inside the comment - scanner will not yield appropriate results
|
|
* This function will look for token that is located before the start of target range
|
|
* and return its end as start position for the scanner.
|
|
*/
|
|
function getScanStartPosition(enclosingNode, originalRange, sourceFile) {
|
|
var start = enclosingNode.getStart(sourceFile);
|
|
if (start === originalRange.pos && enclosingNode.end === originalRange.end) {
|
|
return start;
|
|
}
|
|
var precedingToken = ts.findPrecedingToken(originalRange.pos, sourceFile);
|
|
if (!precedingToken) {
|
|
// no preceding token found - start from the beginning of enclosing node
|
|
return enclosingNode.pos;
|
|
}
|
|
// preceding token ends after the start of original range (i.e when originaRange.pos falls in the middle of literal)
|
|
// start from the beginning of enclosingNode to handle the entire 'originalRange'
|
|
if (precedingToken.end >= originalRange.pos) {
|
|
return enclosingNode.pos;
|
|
}
|
|
return precedingToken.end;
|
|
}
|
|
/*
|
|
* For cases like
|
|
* if (a ||
|
|
* b ||$
|
|
* c) {...}
|
|
* If we hit Enter at $ we want line ' b ||' to be indented.
|
|
* Formatting will be applied to the last two lines.
|
|
* Node that fully encloses these lines is binary expression 'a ||...'.
|
|
* Initial indentation for this node will be 0.
|
|
* Binary expressions don't introduce new indentation scopes, however it is possible
|
|
* that some parent node on the same line does - like if statement in this case.
|
|
* Note that we are considering parents only from the same line with initial node -
|
|
* if parent is on the different line - its delta was already contributed
|
|
* to the initial indentation.
|
|
*/
|
|
function getOwnOrInheritedDelta(n, options, sourceFile) {
|
|
var previousLine = -1 /* Unknown */;
|
|
var childKind = 0 /* Unknown */;
|
|
while (n) {
|
|
var line = sourceFile.getLineAndCharacterOfPosition(n.getStart(sourceFile)).line;
|
|
if (previousLine !== -1 /* Unknown */ && line !== previousLine) {
|
|
break;
|
|
}
|
|
if (formatting.SmartIndenter.shouldIndentChildNode(n.kind, childKind)) {
|
|
return options.IndentSize;
|
|
}
|
|
previousLine = line;
|
|
childKind = n.kind;
|
|
n = n.parent;
|
|
}
|
|
return 0;
|
|
}
|
|
function formatSpan(originalRange, sourceFile, options, rulesProvider, requestKind) {
|
|
var rangeContainsError = prepareRangeContainsErrorFunction(sourceFile.parseDiagnostics, originalRange);
|
|
// formatting context is used by rules provider
|
|
var formattingContext = new formatting.FormattingContext(sourceFile, requestKind);
|
|
// find the smallest node that fully wraps the range and compute the initial indentation for the node
|
|
var enclosingNode = findEnclosingNode(originalRange, sourceFile);
|
|
var formattingScanner = formatting.getFormattingScanner(sourceFile, getScanStartPosition(enclosingNode, originalRange, sourceFile), originalRange.end);
|
|
var initialIndentation = formatting.SmartIndenter.getIndentationForNode(enclosingNode, originalRange, sourceFile, options);
|
|
var previousRangeHasError;
|
|
var previousRange;
|
|
var previousParent;
|
|
var previousRangeStartLine;
|
|
var lastIndentedLine;
|
|
var indentationOnLastIndentedLine;
|
|
var edits = [];
|
|
formattingScanner.advance();
|
|
if (formattingScanner.isOnToken()) {
|
|
var startLine = sourceFile.getLineAndCharacterOfPosition(enclosingNode.getStart(sourceFile)).line;
|
|
var undecoratedStartLine = startLine;
|
|
if (enclosingNode.decorators) {
|
|
undecoratedStartLine = sourceFile.getLineAndCharacterOfPosition(ts.getNonDecoratorTokenPosOfNode(enclosingNode, sourceFile)).line;
|
|
}
|
|
var delta = getOwnOrInheritedDelta(enclosingNode, options, sourceFile);
|
|
processNode(enclosingNode, enclosingNode, startLine, undecoratedStartLine, initialIndentation, delta);
|
|
}
|
|
formattingScanner.close();
|
|
return edits;
|
|
// local functions
|
|
/** Tries to compute the indentation for a list element.
|
|
* If list element is not in range then
|
|
* function will pick its actual indentation
|
|
* so it can be pushed downstream as inherited indentation.
|
|
* If list element is in the range - its indentation will be equal
|
|
* to inherited indentation from its predecessors.
|
|
*/
|
|
function tryComputeIndentationForListItem(startPos, endPos, parentStartLine, range, inheritedIndentation) {
|
|
if (ts.rangeOverlapsWithStartEnd(range, startPos, endPos)) {
|
|
if (inheritedIndentation !== -1 /* Unknown */) {
|
|
return inheritedIndentation;
|
|
}
|
|
}
|
|
else {
|
|
var startLine = sourceFile.getLineAndCharacterOfPosition(startPos).line;
|
|
var startLinePosition = ts.getLineStartPositionForPosition(startPos, sourceFile);
|
|
var column = formatting.SmartIndenter.findFirstNonWhitespaceColumn(startLinePosition, startPos, sourceFile, options);
|
|
if (startLine !== parentStartLine || startPos === column) {
|
|
return column;
|
|
}
|
|
}
|
|
return -1 /* Unknown */;
|
|
}
|
|
function computeIndentation(node, startLine, inheritedIndentation, parent, parentDynamicIndentation, effectiveParentStartLine) {
|
|
var indentation = inheritedIndentation;
|
|
if (indentation === -1 /* Unknown */) {
|
|
if (isSomeBlock(node.kind)) {
|
|
// blocks should be indented in
|
|
// - other blocks
|
|
// - source file
|
|
// - switch\default clauses
|
|
if (isSomeBlock(parent.kind) ||
|
|
parent.kind === 245 /* SourceFile */ ||
|
|
parent.kind === 238 /* CaseClause */ ||
|
|
parent.kind === 239 /* DefaultClause */) {
|
|
indentation = parentDynamicIndentation.getIndentation() + parentDynamicIndentation.getDelta();
|
|
}
|
|
else {
|
|
indentation = parentDynamicIndentation.getIndentation();
|
|
}
|
|
}
|
|
else {
|
|
if (formatting.SmartIndenter.childStartsOnTheSameLineWithElseInIfStatement(parent, node, startLine, sourceFile)) {
|
|
indentation = parentDynamicIndentation.getIndentation();
|
|
}
|
|
else {
|
|
indentation = parentDynamicIndentation.getIndentation() + parentDynamicIndentation.getDelta();
|
|
}
|
|
}
|
|
}
|
|
var delta = formatting.SmartIndenter.shouldIndentChildNode(node.kind, 0 /* Unknown */) ? options.IndentSize : 0;
|
|
if (effectiveParentStartLine === startLine) {
|
|
// if node is located on the same line with the parent
|
|
// - inherit indentation from the parent
|
|
// - push children if either parent of node itself has non-zero delta
|
|
indentation = startLine === lastIndentedLine
|
|
? indentationOnLastIndentedLine
|
|
: parentDynamicIndentation.getIndentation();
|
|
delta = Math.min(options.IndentSize, parentDynamicIndentation.getDelta() + delta);
|
|
}
|
|
return {
|
|
indentation: indentation,
|
|
delta: delta
|
|
};
|
|
}
|
|
function getFirstNonDecoratorTokenOfNode(node) {
|
|
if (node.modifiers && node.modifiers.length) {
|
|
return node.modifiers[0].kind;
|
|
}
|
|
switch (node.kind) {
|
|
case 211 /* ClassDeclaration */: return 70 /* ClassKeyword */;
|
|
case 212 /* InterfaceDeclaration */: return 104 /* InterfaceKeyword */;
|
|
case 210 /* FunctionDeclaration */: return 84 /* FunctionKeyword */;
|
|
case 214 /* EnumDeclaration */: return 214 /* EnumDeclaration */;
|
|
case 142 /* GetAccessor */: return 120 /* GetKeyword */;
|
|
case 143 /* SetAccessor */: return 126 /* SetKeyword */;
|
|
case 140 /* MethodDeclaration */:
|
|
if (node.asteriskToken) {
|
|
return 36 /* AsteriskToken */;
|
|
}
|
|
// fall-through
|
|
case 138 /* PropertyDeclaration */:
|
|
case 135 /* Parameter */:
|
|
return node.name.kind;
|
|
}
|
|
}
|
|
function getDynamicIndentation(node, nodeStartLine, indentation, delta) {
|
|
return {
|
|
getIndentationForComment: function (kind) {
|
|
switch (kind) {
|
|
// preceding comment to the token that closes the indentation scope inherits the indentation from the scope
|
|
// .. {
|
|
// // comment
|
|
// }
|
|
case 15 /* CloseBraceToken */:
|
|
case 19 /* CloseBracketToken */:
|
|
return indentation + delta;
|
|
}
|
|
return indentation;
|
|
},
|
|
getIndentationForToken: function (line, kind) {
|
|
if (nodeStartLine !== line && node.decorators) {
|
|
if (kind === getFirstNonDecoratorTokenOfNode(node)) {
|
|
// if this token is the first token following the list of decorators, we do not need to indent
|
|
return indentation;
|
|
}
|
|
}
|
|
switch (kind) {
|
|
// open and close brace, 'else' and 'while' (in do statement) tokens has indentation of the parent
|
|
case 14 /* OpenBraceToken */:
|
|
case 15 /* CloseBraceToken */:
|
|
case 18 /* OpenBracketToken */:
|
|
case 19 /* CloseBracketToken */:
|
|
case 16 /* OpenParenToken */:
|
|
case 17 /* CloseParenToken */:
|
|
case 77 /* ElseKeyword */:
|
|
case 101 /* WhileKeyword */:
|
|
case 53 /* AtToken */:
|
|
return indentation;
|
|
default:
|
|
// if token line equals to the line of containing node (this is a first token in the node) - use node indentation
|
|
return nodeStartLine !== line ? indentation + delta : indentation;
|
|
}
|
|
},
|
|
getIndentation: function () { return indentation; },
|
|
getDelta: function () { return delta; },
|
|
recomputeIndentation: function (lineAdded) {
|
|
if (node.parent && formatting.SmartIndenter.shouldIndentChildNode(node.parent.kind, node.kind)) {
|
|
if (lineAdded) {
|
|
indentation += options.IndentSize;
|
|
}
|
|
else {
|
|
indentation -= options.IndentSize;
|
|
}
|
|
if (formatting.SmartIndenter.shouldIndentChildNode(node.kind, 0 /* Unknown */)) {
|
|
delta = options.IndentSize;
|
|
}
|
|
else {
|
|
delta = 0;
|
|
}
|
|
}
|
|
}
|
|
};
|
|
}
|
|
function processNode(node, contextNode, nodeStartLine, undecoratedNodeStartLine, indentation, delta) {
|
|
if (!ts.rangeOverlapsWithStartEnd(originalRange, node.getStart(sourceFile), node.getEnd())) {
|
|
return;
|
|
}
|
|
var nodeDynamicIndentation = getDynamicIndentation(node, nodeStartLine, indentation, delta);
|
|
// a useful observations when tracking context node
|
|
// /
|
|
// [a]
|
|
// / | \
|
|
// [b] [c] [d]
|
|
// node 'a' is a context node for nodes 'b', 'c', 'd'
|
|
// except for the leftmost leaf token in [b] - in this case context node ('e') is located somewhere above 'a'
|
|
// this rule can be applied recursively to child nodes of 'a'.
|
|
//
|
|
// context node is set to parent node value after processing every child node
|
|
// context node is set to parent of the token after processing every token
|
|
var childContextNode = contextNode;
|
|
// if there are any tokens that logically belong to node and interleave child nodes
|
|
// such tokens will be consumed in processChildNode for for the child that follows them
|
|
ts.forEachChild(node, function (child) {
|
|
processChildNode(child, -1 /* Unknown */, node, nodeDynamicIndentation, nodeStartLine, undecoratedNodeStartLine, false);
|
|
}, function (nodes) {
|
|
processChildNodes(nodes, node, nodeStartLine, nodeDynamicIndentation);
|
|
});
|
|
// proceed any tokens in the node that are located after child nodes
|
|
while (formattingScanner.isOnToken()) {
|
|
var tokenInfo = formattingScanner.readTokenInfo(node);
|
|
if (tokenInfo.token.end > node.end) {
|
|
break;
|
|
}
|
|
consumeTokenAndAdvanceScanner(tokenInfo, node, nodeDynamicIndentation);
|
|
}
|
|
function processChildNode(child, inheritedIndentation, parent, parentDynamicIndentation, parentStartLine, undecoratedParentStartLine, isListItem) {
|
|
var childStartPos = child.getStart(sourceFile);
|
|
var childStartLine = sourceFile.getLineAndCharacterOfPosition(childStartPos).line;
|
|
var undecoratedChildStartLine = childStartLine;
|
|
if (child.decorators) {
|
|
undecoratedChildStartLine = sourceFile.getLineAndCharacterOfPosition(ts.getNonDecoratorTokenPosOfNode(child, sourceFile)).line;
|
|
}
|
|
// if child is a list item - try to get its indentation
|
|
var childIndentationAmount = -1 /* Unknown */;
|
|
if (isListItem) {
|
|
childIndentationAmount = tryComputeIndentationForListItem(childStartPos, child.end, parentStartLine, originalRange, inheritedIndentation);
|
|
if (childIndentationAmount !== -1 /* Unknown */) {
|
|
inheritedIndentation = childIndentationAmount;
|
|
}
|
|
}
|
|
// child node is outside the target range - do not dive inside
|
|
if (!ts.rangeOverlapsWithStartEnd(originalRange, child.pos, child.end)) {
|
|
return inheritedIndentation;
|
|
}
|
|
if (child.getFullWidth() === 0) {
|
|
return inheritedIndentation;
|
|
}
|
|
while (formattingScanner.isOnToken()) {
|
|
// proceed any parent tokens that are located prior to child.getStart()
|
|
var tokenInfo = formattingScanner.readTokenInfo(node);
|
|
if (tokenInfo.token.end > childStartPos) {
|
|
// stop when formatting scanner advances past the beginning of the child
|
|
break;
|
|
}
|
|
consumeTokenAndAdvanceScanner(tokenInfo, node, parentDynamicIndentation);
|
|
}
|
|
if (!formattingScanner.isOnToken()) {
|
|
return inheritedIndentation;
|
|
}
|
|
if (ts.isToken(child)) {
|
|
// if child node is a token, it does not impact indentation, proceed it using parent indentation scope rules
|
|
var tokenInfo = formattingScanner.readTokenInfo(child);
|
|
ts.Debug.assert(tokenInfo.token.end === child.end);
|
|
consumeTokenAndAdvanceScanner(tokenInfo, node, parentDynamicIndentation);
|
|
return inheritedIndentation;
|
|
}
|
|
var effectiveParentStartLine = child.kind === 136 /* Decorator */ ? childStartLine : undecoratedParentStartLine;
|
|
var childIndentation = computeIndentation(child, childStartLine, childIndentationAmount, node, parentDynamicIndentation, effectiveParentStartLine);
|
|
processNode(child, childContextNode, childStartLine, undecoratedChildStartLine, childIndentation.indentation, childIndentation.delta);
|
|
childContextNode = node;
|
|
return inheritedIndentation;
|
|
}
|
|
function processChildNodes(nodes, parent, parentStartLine, parentDynamicIndentation) {
|
|
var listStartToken = getOpenTokenForList(parent, nodes);
|
|
var listEndToken = getCloseTokenForOpenToken(listStartToken);
|
|
var listDynamicIndentation = parentDynamicIndentation;
|
|
var startLine = parentStartLine;
|
|
if (listStartToken !== 0 /* Unknown */) {
|
|
// introduce a new indentation scope for lists (including list start and end tokens)
|
|
while (formattingScanner.isOnToken()) {
|
|
var tokenInfo = formattingScanner.readTokenInfo(parent);
|
|
if (tokenInfo.token.end > nodes.pos) {
|
|
// stop when formatting scanner moves past the beginning of node list
|
|
break;
|
|
}
|
|
else if (tokenInfo.token.kind === listStartToken) {
|
|
// consume list start token
|
|
startLine = sourceFile.getLineAndCharacterOfPosition(tokenInfo.token.pos).line;
|
|
var indentation_1 = computeIndentation(tokenInfo.token, startLine, -1 /* Unknown */, parent, parentDynamicIndentation, parentStartLine);
|
|
listDynamicIndentation = getDynamicIndentation(parent, parentStartLine, indentation_1.indentation, indentation_1.delta);
|
|
consumeTokenAndAdvanceScanner(tokenInfo, parent, listDynamicIndentation);
|
|
}
|
|
else {
|
|
// consume any tokens that precede the list as child elements of 'node' using its indentation scope
|
|
consumeTokenAndAdvanceScanner(tokenInfo, parent, parentDynamicIndentation);
|
|
}
|
|
}
|
|
}
|
|
var inheritedIndentation = -1 /* Unknown */;
|
|
for (var _i = 0; _i < nodes.length; _i++) {
|
|
var child = nodes[_i];
|
|
inheritedIndentation = processChildNode(child, inheritedIndentation, node, listDynamicIndentation, startLine, startLine, true);
|
|
}
|
|
if (listEndToken !== 0 /* Unknown */) {
|
|
if (formattingScanner.isOnToken()) {
|
|
var tokenInfo = formattingScanner.readTokenInfo(parent);
|
|
// consume the list end token only if it is still belong to the parent
|
|
// there might be the case when current token matches end token but does not considered as one
|
|
// function (x: function) <--
|
|
// without this check close paren will be interpreted as list end token for function expression which is wrong
|
|
if (tokenInfo.token.kind === listEndToken && ts.rangeContainsRange(parent, tokenInfo.token)) {
|
|
// consume list end token
|
|
consumeTokenAndAdvanceScanner(tokenInfo, parent, listDynamicIndentation);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function consumeTokenAndAdvanceScanner(currentTokenInfo, parent, dynamicIndentation) {
|
|
ts.Debug.assert(ts.rangeContainsRange(parent, currentTokenInfo.token));
|
|
var lastTriviaWasNewLine = formattingScanner.lastTrailingTriviaWasNewLine();
|
|
var indentToken = false;
|
|
if (currentTokenInfo.leadingTrivia) {
|
|
processTrivia(currentTokenInfo.leadingTrivia, parent, childContextNode, dynamicIndentation);
|
|
}
|
|
var lineAdded;
|
|
var isTokenInRange = ts.rangeContainsRange(originalRange, currentTokenInfo.token);
|
|
var tokenStart = sourceFile.getLineAndCharacterOfPosition(currentTokenInfo.token.pos);
|
|
if (isTokenInRange) {
|
|
var rangeHasError = rangeContainsError(currentTokenInfo.token);
|
|
// save prevStartLine since processRange will overwrite this value with current ones
|
|
var prevStartLine = previousRangeStartLine;
|
|
lineAdded = processRange(currentTokenInfo.token, tokenStart, parent, childContextNode, dynamicIndentation);
|
|
if (rangeHasError) {
|
|
// do not indent comments\token if token range overlaps with some error
|
|
indentToken = false;
|
|
}
|
|
else {
|
|
if (lineAdded !== undefined) {
|
|
indentToken = lineAdded;
|
|
}
|
|
else {
|
|
indentToken = lastTriviaWasNewLine && tokenStart.line !== prevStartLine;
|
|
}
|
|
}
|
|
}
|
|
if (currentTokenInfo.trailingTrivia) {
|
|
processTrivia(currentTokenInfo.trailingTrivia, parent, childContextNode, dynamicIndentation);
|
|
}
|
|
if (indentToken) {
|
|
var indentNextTokenOrTrivia = true;
|
|
if (currentTokenInfo.leadingTrivia) {
|
|
for (var _i = 0, _a = currentTokenInfo.leadingTrivia; _i < _a.length; _i++) {
|
|
var triviaItem = _a[_i];
|
|
if (!ts.rangeContainsRange(originalRange, triviaItem)) {
|
|
continue;
|
|
}
|
|
switch (triviaItem.kind) {
|
|
case 3 /* MultiLineCommentTrivia */:
|
|
var commentIndentation = dynamicIndentation.getIndentationForComment(currentTokenInfo.token.kind);
|
|
indentMultilineComment(triviaItem, commentIndentation, !indentNextTokenOrTrivia);
|
|
indentNextTokenOrTrivia = false;
|
|
break;
|
|
case 2 /* SingleLineCommentTrivia */:
|
|
if (indentNextTokenOrTrivia) {
|
|
var commentIndentation_1 = dynamicIndentation.getIndentationForComment(currentTokenInfo.token.kind);
|
|
insertIndentation(triviaItem.pos, commentIndentation_1, false);
|
|
indentNextTokenOrTrivia = false;
|
|
}
|
|
break;
|
|
case 4 /* NewLineTrivia */:
|
|
indentNextTokenOrTrivia = true;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
// indent token only if is it is in target range and does not overlap with any error ranges
|
|
if (isTokenInRange && !rangeContainsError(currentTokenInfo.token)) {
|
|
var tokenIndentation = dynamicIndentation.getIndentationForToken(tokenStart.line, currentTokenInfo.token.kind);
|
|
insertIndentation(currentTokenInfo.token.pos, tokenIndentation, lineAdded);
|
|
lastIndentedLine = tokenStart.line;
|
|
indentationOnLastIndentedLine = tokenIndentation;
|
|
}
|
|
}
|
|
formattingScanner.advance();
|
|
childContextNode = parent;
|
|
}
|
|
}
|
|
function processTrivia(trivia, parent, contextNode, dynamicIndentation) {
|
|
for (var _i = 0; _i < trivia.length; _i++) {
|
|
var triviaItem = trivia[_i];
|
|
if (ts.isComment(triviaItem.kind) && ts.rangeContainsRange(originalRange, triviaItem)) {
|
|
var triviaItemStart = sourceFile.getLineAndCharacterOfPosition(triviaItem.pos);
|
|
processRange(triviaItem, triviaItemStart, parent, contextNode, dynamicIndentation);
|
|
}
|
|
}
|
|
}
|
|
function processRange(range, rangeStart, parent, contextNode, dynamicIndentation) {
|
|
var rangeHasError = rangeContainsError(range);
|
|
var lineAdded;
|
|
if (!rangeHasError && !previousRangeHasError) {
|
|
if (!previousRange) {
|
|
// trim whitespaces starting from the beginning of the span up to the current line
|
|
var originalStart = sourceFile.getLineAndCharacterOfPosition(originalRange.pos);
|
|
trimTrailingWhitespacesForLines(originalStart.line, rangeStart.line);
|
|
}
|
|
else {
|
|
lineAdded =
|
|
processPair(range, rangeStart.line, parent, previousRange, previousRangeStartLine, previousParent, contextNode, dynamicIndentation);
|
|
}
|
|
}
|
|
previousRange = range;
|
|
previousParent = parent;
|
|
previousRangeStartLine = rangeStart.line;
|
|
previousRangeHasError = rangeHasError;
|
|
return lineAdded;
|
|
}
|
|
function processPair(currentItem, currentStartLine, currentParent, previousItem, previousStartLine, previousParent, contextNode, dynamicIndentation) {
|
|
formattingContext.updateContext(previousItem, previousParent, currentItem, currentParent, contextNode);
|
|
var rule = rulesProvider.getRulesMap().GetRule(formattingContext);
|
|
var trimTrailingWhitespaces;
|
|
var lineAdded;
|
|
if (rule) {
|
|
applyRuleEdits(rule, previousItem, previousStartLine, currentItem, currentStartLine);
|
|
if (rule.Operation.Action & (2 /* Space */ | 8 /* Delete */) && currentStartLine !== previousStartLine) {
|
|
lineAdded = false;
|
|
// Handle the case where the next line is moved to be the end of this line.
|
|
// In this case we don't indent the next line in the next pass.
|
|
if (currentParent.getStart(sourceFile) === currentItem.pos) {
|
|
dynamicIndentation.recomputeIndentation(false);
|
|
}
|
|
}
|
|
else if (rule.Operation.Action & 4 /* NewLine */ && currentStartLine === previousStartLine) {
|
|
lineAdded = true;
|
|
// Handle the case where token2 is moved to the new line.
|
|
// In this case we indent token2 in the next pass but we set
|
|
// sameLineIndent flag to notify the indenter that the indentation is within the line.
|
|
if (currentParent.getStart(sourceFile) === currentItem.pos) {
|
|
dynamicIndentation.recomputeIndentation(true);
|
|
}
|
|
}
|
|
// We need to trim trailing whitespace between the tokens if they were on different lines, and no rule was applied to put them on the same line
|
|
trimTrailingWhitespaces =
|
|
(rule.Operation.Action & (4 /* NewLine */ | 2 /* Space */)) &&
|
|
rule.Flag !== 1 /* CanDeleteNewLines */;
|
|
}
|
|
else {
|
|
trimTrailingWhitespaces = true;
|
|
}
|
|
if (currentStartLine !== previousStartLine && trimTrailingWhitespaces) {
|
|
// We need to trim trailing whitespace between the tokens if they were on different lines, and no rule was applied to put them on the same line
|
|
trimTrailingWhitespacesForLines(previousStartLine, currentStartLine, previousItem);
|
|
}
|
|
return lineAdded;
|
|
}
|
|
function insertIndentation(pos, indentation, lineAdded) {
|
|
var indentationString = getIndentationString(indentation, options);
|
|
if (lineAdded) {
|
|
// new line is added before the token by the formatting rules
|
|
// insert indentation string at the very beginning of the token
|
|
recordReplace(pos, 0, indentationString);
|
|
}
|
|
else {
|
|
var tokenStart = sourceFile.getLineAndCharacterOfPosition(pos);
|
|
if (indentation !== tokenStart.character) {
|
|
var startLinePosition = ts.getStartPositionOfLine(tokenStart.line, sourceFile);
|
|
recordReplace(startLinePosition, tokenStart.character, indentationString);
|
|
}
|
|
}
|
|
}
|
|
function indentMultilineComment(commentRange, indentation, firstLineIsIndented) {
|
|
// split comment in lines
|
|
var startLine = sourceFile.getLineAndCharacterOfPosition(commentRange.pos).line;
|
|
var endLine = sourceFile.getLineAndCharacterOfPosition(commentRange.end).line;
|
|
var parts;
|
|
if (startLine === endLine) {
|
|
if (!firstLineIsIndented) {
|
|
// treat as single line comment
|
|
insertIndentation(commentRange.pos, indentation, false);
|
|
}
|
|
return;
|
|
}
|
|
else {
|
|
parts = [];
|
|
var startPos = commentRange.pos;
|
|
for (var line = startLine; line < endLine; ++line) {
|
|
var endOfLine = ts.getEndLinePosition(line, sourceFile);
|
|
parts.push({ pos: startPos, end: endOfLine });
|
|
startPos = ts.getStartPositionOfLine(line + 1, sourceFile);
|
|
}
|
|
parts.push({ pos: startPos, end: commentRange.end });
|
|
}
|
|
var startLinePos = ts.getStartPositionOfLine(startLine, sourceFile);
|
|
var nonWhitespaceColumnInFirstPart = formatting.SmartIndenter.findFirstNonWhitespaceCharacterAndColumn(startLinePos, parts[0].pos, sourceFile, options);
|
|
if (indentation === nonWhitespaceColumnInFirstPart.column) {
|
|
return;
|
|
}
|
|
var startIndex = 0;
|
|
if (firstLineIsIndented) {
|
|
startIndex = 1;
|
|
startLine++;
|
|
}
|
|
// shift all parts on the delta size
|
|
var delta = indentation - nonWhitespaceColumnInFirstPart.column;
|
|
for (var i = startIndex, len = parts.length; i < len; ++i, ++startLine) {
|
|
var startLinePos_1 = ts.getStartPositionOfLine(startLine, sourceFile);
|
|
var nonWhitespaceCharacterAndColumn = i === 0
|
|
? nonWhitespaceColumnInFirstPart
|
|
: formatting.SmartIndenter.findFirstNonWhitespaceCharacterAndColumn(parts[i].pos, parts[i].end, sourceFile, options);
|
|
var newIndentation = nonWhitespaceCharacterAndColumn.column + delta;
|
|
if (newIndentation > 0) {
|
|
var indentationString = getIndentationString(newIndentation, options);
|
|
recordReplace(startLinePos_1, nonWhitespaceCharacterAndColumn.character, indentationString);
|
|
}
|
|
else {
|
|
recordDelete(startLinePos_1, nonWhitespaceCharacterAndColumn.character);
|
|
}
|
|
}
|
|
}
|
|
function trimTrailingWhitespacesForLines(line1, line2, range) {
|
|
for (var line = line1; line < line2; ++line) {
|
|
var lineStartPosition = ts.getStartPositionOfLine(line, sourceFile);
|
|
var lineEndPosition = ts.getEndLinePosition(line, sourceFile);
|
|
// do not trim whitespaces in comments
|
|
if (range && ts.isComment(range.kind) && range.pos <= lineEndPosition && range.end > lineEndPosition) {
|
|
continue;
|
|
}
|
|
var pos = lineEndPosition;
|
|
while (pos >= lineStartPosition && ts.isWhiteSpace(sourceFile.text.charCodeAt(pos))) {
|
|
pos--;
|
|
}
|
|
if (pos !== lineEndPosition) {
|
|
ts.Debug.assert(pos === lineStartPosition || !ts.isWhiteSpace(sourceFile.text.charCodeAt(pos)));
|
|
recordDelete(pos + 1, lineEndPosition - pos);
|
|
}
|
|
}
|
|
}
|
|
function newTextChange(start, len, newText) {
|
|
return { span: ts.createTextSpan(start, len), newText: newText };
|
|
}
|
|
function recordDelete(start, len) {
|
|
if (len) {
|
|
edits.push(newTextChange(start, len, ""));
|
|
}
|
|
}
|
|
function recordReplace(start, len, newText) {
|
|
if (len || newText) {
|
|
edits.push(newTextChange(start, len, newText));
|
|
}
|
|
}
|
|
function applyRuleEdits(rule, previousRange, previousStartLine, currentRange, currentStartLine) {
|
|
var between;
|
|
switch (rule.Operation.Action) {
|
|
case 1 /* Ignore */:
|
|
// no action required
|
|
return;
|
|
case 8 /* Delete */:
|
|
if (previousRange.end !== currentRange.pos) {
|
|
// delete characters starting from t1.end up to t2.pos exclusive
|
|
recordDelete(previousRange.end, currentRange.pos - previousRange.end);
|
|
}
|
|
break;
|
|
case 4 /* NewLine */:
|
|
// exit early if we on different lines and rule cannot change number of newlines
|
|
// if line1 and line2 are on subsequent lines then no edits are required - ok to exit
|
|
// if line1 and line2 are separated with more than one newline - ok to exit since we cannot delete extra new lines
|
|
if (rule.Flag !== 1 /* CanDeleteNewLines */ && previousStartLine !== currentStartLine) {
|
|
return;
|
|
}
|
|
// edit should not be applied only if we have one line feed between elements
|
|
var lineDelta = currentStartLine - previousStartLine;
|
|
if (lineDelta !== 1) {
|
|
recordReplace(previousRange.end, currentRange.pos - previousRange.end, options.NewLineCharacter);
|
|
}
|
|
break;
|
|
case 2 /* Space */:
|
|
// exit early if we on different lines and rule cannot change number of newlines
|
|
if (rule.Flag !== 1 /* CanDeleteNewLines */ && previousStartLine !== currentStartLine) {
|
|
return;
|
|
}
|
|
var posDelta = currentRange.pos - previousRange.end;
|
|
if (posDelta !== 1 || sourceFile.text.charCodeAt(previousRange.end) !== 32 /* space */) {
|
|
recordReplace(previousRange.end, currentRange.pos - previousRange.end, " ");
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
function isSomeBlock(kind) {
|
|
switch (kind) {
|
|
case 189 /* Block */:
|
|
case 216 /* ModuleBlock */:
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function getOpenTokenForList(node, list) {
|
|
switch (node.kind) {
|
|
case 141 /* Constructor */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 171 /* ArrowFunction */:
|
|
if (node.typeParameters === list) {
|
|
return 24 /* LessThanToken */;
|
|
}
|
|
else if (node.parameters === list) {
|
|
return 16 /* OpenParenToken */;
|
|
}
|
|
break;
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
if (node.typeArguments === list) {
|
|
return 24 /* LessThanToken */;
|
|
}
|
|
else if (node.arguments === list) {
|
|
return 16 /* OpenParenToken */;
|
|
}
|
|
break;
|
|
case 148 /* TypeReference */:
|
|
if (node.typeArguments === list) {
|
|
return 24 /* LessThanToken */;
|
|
}
|
|
}
|
|
return 0 /* Unknown */;
|
|
}
|
|
function getCloseTokenForOpenToken(kind) {
|
|
switch (kind) {
|
|
case 16 /* OpenParenToken */:
|
|
return 17 /* CloseParenToken */;
|
|
case 24 /* LessThanToken */:
|
|
return 26 /* GreaterThanToken */;
|
|
}
|
|
return 0 /* Unknown */;
|
|
}
|
|
var internedSizes;
|
|
var internedTabsIndentation;
|
|
var internedSpacesIndentation;
|
|
function getIndentationString(indentation, options) {
|
|
// reset interned strings if FormatCodeOptions were changed
|
|
var resetInternedStrings = !internedSizes || (internedSizes.tabSize !== options.TabSize || internedSizes.indentSize !== options.IndentSize);
|
|
if (resetInternedStrings) {
|
|
internedSizes = { tabSize: options.TabSize, indentSize: options.IndentSize };
|
|
internedTabsIndentation = internedSpacesIndentation = undefined;
|
|
}
|
|
if (!options.ConvertTabsToSpaces) {
|
|
var tabs = Math.floor(indentation / options.TabSize);
|
|
var spaces = indentation - tabs * options.TabSize;
|
|
var tabString;
|
|
if (!internedTabsIndentation) {
|
|
internedTabsIndentation = [];
|
|
}
|
|
if (internedTabsIndentation[tabs] === undefined) {
|
|
internedTabsIndentation[tabs] = tabString = repeat('\t', tabs);
|
|
}
|
|
else {
|
|
tabString = internedTabsIndentation[tabs];
|
|
}
|
|
return spaces ? tabString + repeat(" ", spaces) : tabString;
|
|
}
|
|
else {
|
|
var spacesString;
|
|
var quotient = Math.floor(indentation / options.IndentSize);
|
|
var remainder = indentation % options.IndentSize;
|
|
if (!internedSpacesIndentation) {
|
|
internedSpacesIndentation = [];
|
|
}
|
|
if (internedSpacesIndentation[quotient] === undefined) {
|
|
spacesString = repeat(" ", options.IndentSize * quotient);
|
|
internedSpacesIndentation[quotient] = spacesString;
|
|
}
|
|
else {
|
|
spacesString = internedSpacesIndentation[quotient];
|
|
}
|
|
return remainder ? spacesString + repeat(" ", remainder) : spacesString;
|
|
}
|
|
function repeat(value, count) {
|
|
var s = "";
|
|
for (var i = 0; i < count; ++i) {
|
|
s += value;
|
|
}
|
|
return s;
|
|
}
|
|
}
|
|
formatting.getIndentationString = getIndentationString;
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
///<reference path='..\services.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var formatting;
|
|
(function (formatting) {
|
|
var SmartIndenter;
|
|
(function (SmartIndenter) {
|
|
var Value;
|
|
(function (Value) {
|
|
Value[Value["Unknown"] = -1] = "Unknown";
|
|
})(Value || (Value = {}));
|
|
function getIndentation(position, sourceFile, options) {
|
|
if (position > sourceFile.text.length) {
|
|
return 0; // past EOF
|
|
}
|
|
var precedingToken = ts.findPrecedingToken(position, sourceFile);
|
|
if (!precedingToken) {
|
|
return 0;
|
|
}
|
|
// no indentation in string \regex\template literals
|
|
var precedingTokenIsLiteral = precedingToken.kind === 8 /* StringLiteral */ ||
|
|
precedingToken.kind === 9 /* RegularExpressionLiteral */ ||
|
|
precedingToken.kind === 10 /* NoSubstitutionTemplateLiteral */ ||
|
|
precedingToken.kind === 11 /* TemplateHead */ ||
|
|
precedingToken.kind === 12 /* TemplateMiddle */ ||
|
|
precedingToken.kind === 13 /* TemplateTail */;
|
|
if (precedingTokenIsLiteral && precedingToken.getStart(sourceFile) <= position && precedingToken.end > position) {
|
|
return 0;
|
|
}
|
|
var lineAtPosition = sourceFile.getLineAndCharacterOfPosition(position).line;
|
|
if (precedingToken.kind === 23 /* CommaToken */ && precedingToken.parent.kind !== 178 /* BinaryExpression */) {
|
|
// previous token is comma that separates items in list - find the previous item and try to derive indentation from it
|
|
var actualIndentation = getActualIndentationForListItemBeforeComma(precedingToken, sourceFile, options);
|
|
if (actualIndentation !== -1 /* Unknown */) {
|
|
return actualIndentation;
|
|
}
|
|
}
|
|
// try to find node that can contribute to indentation and includes 'position' starting from 'precedingToken'
|
|
// if such node is found - compute initial indentation for 'position' inside this node
|
|
var previous;
|
|
var current = precedingToken;
|
|
var currentStart;
|
|
var indentationDelta;
|
|
while (current) {
|
|
if (ts.positionBelongsToNode(current, position, sourceFile) && shouldIndentChildNode(current.kind, previous ? previous.kind : 0 /* Unknown */)) {
|
|
currentStart = getStartLineAndCharacterForNode(current, sourceFile);
|
|
if (nextTokenIsCurlyBraceOnSameLineAsCursor(precedingToken, current, lineAtPosition, sourceFile)) {
|
|
indentationDelta = 0;
|
|
}
|
|
else {
|
|
indentationDelta = lineAtPosition !== currentStart.line ? options.IndentSize : 0;
|
|
}
|
|
break;
|
|
}
|
|
// check if current node is a list item - if yes, take indentation from it
|
|
var actualIndentation = getActualIndentationForListItem(current, sourceFile, options);
|
|
if (actualIndentation !== -1 /* Unknown */) {
|
|
return actualIndentation;
|
|
}
|
|
actualIndentation = getLineIndentationWhenExpressionIsInMultiLine(current, sourceFile, options);
|
|
if (actualIndentation !== -1 /* Unknown */) {
|
|
return actualIndentation + options.IndentSize;
|
|
}
|
|
previous = current;
|
|
current = current.parent;
|
|
}
|
|
if (!current) {
|
|
// no parent was found - return 0 to be indented on the level of SourceFile
|
|
return 0;
|
|
}
|
|
return getIndentationForNodeWorker(current, currentStart, undefined, indentationDelta, sourceFile, options);
|
|
}
|
|
SmartIndenter.getIndentation = getIndentation;
|
|
function getIndentationForNode(n, ignoreActualIndentationRange, sourceFile, options) {
|
|
var start = sourceFile.getLineAndCharacterOfPosition(n.getStart(sourceFile));
|
|
return getIndentationForNodeWorker(n, start, ignoreActualIndentationRange, 0, sourceFile, options);
|
|
}
|
|
SmartIndenter.getIndentationForNode = getIndentationForNode;
|
|
function getIndentationForNodeWorker(current, currentStart, ignoreActualIndentationRange, indentationDelta, sourceFile, options) {
|
|
var parent = current.parent;
|
|
var parentStart;
|
|
// walk upwards and collect indentations for pairs of parent-child nodes
|
|
// indentation is not added if parent and child nodes start on the same line or if parent is IfStatement and child starts on the same line with 'else clause'
|
|
while (parent) {
|
|
var useActualIndentation = true;
|
|
if (ignoreActualIndentationRange) {
|
|
var start = current.getStart(sourceFile);
|
|
useActualIndentation = start < ignoreActualIndentationRange.pos || start > ignoreActualIndentationRange.end;
|
|
}
|
|
if (useActualIndentation) {
|
|
// check if current node is a list item - if yes, take indentation from it
|
|
var actualIndentation = getActualIndentationForListItem(current, sourceFile, options);
|
|
if (actualIndentation !== -1 /* Unknown */) {
|
|
return actualIndentation + indentationDelta;
|
|
}
|
|
}
|
|
parentStart = getParentStart(parent, current, sourceFile);
|
|
var parentAndChildShareLine = parentStart.line === currentStart.line ||
|
|
childStartsOnTheSameLineWithElseInIfStatement(parent, current, currentStart.line, sourceFile);
|
|
if (useActualIndentation) {
|
|
// try to fetch actual indentation for current node from source text
|
|
var actualIndentation = getActualIndentationForNode(current, parent, currentStart, parentAndChildShareLine, sourceFile, options);
|
|
if (actualIndentation !== -1 /* Unknown */) {
|
|
return actualIndentation + indentationDelta;
|
|
}
|
|
actualIndentation = getLineIndentationWhenExpressionIsInMultiLine(current, sourceFile, options);
|
|
if (actualIndentation !== -1 /* Unknown */) {
|
|
return actualIndentation + indentationDelta;
|
|
}
|
|
}
|
|
// increase indentation if parent node wants its content to be indented and parent and child nodes don't start on the same line
|
|
if (shouldIndentChildNode(parent.kind, current.kind) && !parentAndChildShareLine) {
|
|
indentationDelta += options.IndentSize;
|
|
}
|
|
current = parent;
|
|
currentStart = parentStart;
|
|
parent = current.parent;
|
|
}
|
|
return indentationDelta;
|
|
}
|
|
function getParentStart(parent, child, sourceFile) {
|
|
var containingList = getContainingList(child, sourceFile);
|
|
if (containingList) {
|
|
return sourceFile.getLineAndCharacterOfPosition(containingList.pos);
|
|
}
|
|
return sourceFile.getLineAndCharacterOfPosition(parent.getStart(sourceFile));
|
|
}
|
|
/*
|
|
* Function returns Value.Unknown if indentation cannot be determined
|
|
*/
|
|
function getActualIndentationForListItemBeforeComma(commaToken, sourceFile, options) {
|
|
// previous token is comma that separates items in list - find the previous item and try to derive indentation from it
|
|
var commaItemInfo = ts.findListItemInfo(commaToken);
|
|
if (commaItemInfo && commaItemInfo.listItemIndex > 0) {
|
|
return deriveActualIndentationFromList(commaItemInfo.list.getChildren(), commaItemInfo.listItemIndex - 1, sourceFile, options);
|
|
}
|
|
else {
|
|
// handle broken code gracefully
|
|
return -1 /* Unknown */;
|
|
}
|
|
}
|
|
/*
|
|
* Function returns Value.Unknown if actual indentation for node should not be used (i.e because node is nested expression)
|
|
*/
|
|
function getActualIndentationForNode(current, parent, currentLineAndChar, parentAndChildShareLine, sourceFile, options) {
|
|
// actual indentation is used for statements\declarations if one of cases below is true:
|
|
// - parent is SourceFile - by default immediate children of SourceFile are not indented except when user indents them manually
|
|
// - parent and child are not on the same line
|
|
var useActualIndentation = (ts.isDeclaration(current) || ts.isStatement(current)) &&
|
|
(parent.kind === 245 /* SourceFile */ || !parentAndChildShareLine);
|
|
if (!useActualIndentation) {
|
|
return -1 /* Unknown */;
|
|
}
|
|
return findColumnForFirstNonWhitespaceCharacterInLine(currentLineAndChar, sourceFile, options);
|
|
}
|
|
function nextTokenIsCurlyBraceOnSameLineAsCursor(precedingToken, current, lineAtPosition, sourceFile) {
|
|
var nextToken = ts.findNextToken(precedingToken, current);
|
|
if (!nextToken) {
|
|
return false;
|
|
}
|
|
if (nextToken.kind === 14 /* OpenBraceToken */) {
|
|
// open braces are always indented at the parent level
|
|
return true;
|
|
}
|
|
else if (nextToken.kind === 15 /* CloseBraceToken */) {
|
|
// close braces are indented at the parent level if they are located on the same line with cursor
|
|
// this means that if new line will be added at $ position, this case will be indented
|
|
// class A {
|
|
// $
|
|
// }
|
|
/// and this one - not
|
|
// class A {
|
|
// $}
|
|
var nextTokenStartLine = getStartLineAndCharacterForNode(nextToken, sourceFile).line;
|
|
return lineAtPosition === nextTokenStartLine;
|
|
}
|
|
return false;
|
|
}
|
|
function getStartLineAndCharacterForNode(n, sourceFile) {
|
|
return sourceFile.getLineAndCharacterOfPosition(n.getStart(sourceFile));
|
|
}
|
|
function childStartsOnTheSameLineWithElseInIfStatement(parent, child, childStartLine, sourceFile) {
|
|
if (parent.kind === 193 /* IfStatement */ && parent.elseStatement === child) {
|
|
var elseKeyword = ts.findChildOfKind(parent, 77 /* ElseKeyword */, sourceFile);
|
|
ts.Debug.assert(elseKeyword !== undefined);
|
|
var elseKeywordStartLine = getStartLineAndCharacterForNode(elseKeyword, sourceFile).line;
|
|
return elseKeywordStartLine === childStartLine;
|
|
}
|
|
return false;
|
|
}
|
|
SmartIndenter.childStartsOnTheSameLineWithElseInIfStatement = childStartsOnTheSameLineWithElseInIfStatement;
|
|
function getContainingList(node, sourceFile) {
|
|
if (node.parent) {
|
|
switch (node.parent.kind) {
|
|
case 148 /* TypeReference */:
|
|
if (node.parent.typeArguments &&
|
|
ts.rangeContainsStartEnd(node.parent.typeArguments, node.getStart(sourceFile), node.getEnd())) {
|
|
return node.parent.typeArguments;
|
|
}
|
|
break;
|
|
case 162 /* ObjectLiteralExpression */:
|
|
return node.parent.properties;
|
|
case 161 /* ArrayLiteralExpression */:
|
|
return node.parent.elements;
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 144 /* CallSignature */:
|
|
case 145 /* ConstructSignature */: {
|
|
var start = node.getStart(sourceFile);
|
|
if (node.parent.typeParameters &&
|
|
ts.rangeContainsStartEnd(node.parent.typeParameters, start, node.getEnd())) {
|
|
return node.parent.typeParameters;
|
|
}
|
|
if (ts.rangeContainsStartEnd(node.parent.parameters, start, node.getEnd())) {
|
|
return node.parent.parameters;
|
|
}
|
|
break;
|
|
}
|
|
case 166 /* NewExpression */:
|
|
case 165 /* CallExpression */: {
|
|
var start = node.getStart(sourceFile);
|
|
if (node.parent.typeArguments &&
|
|
ts.rangeContainsStartEnd(node.parent.typeArguments, start, node.getEnd())) {
|
|
return node.parent.typeArguments;
|
|
}
|
|
if (node.parent.arguments &&
|
|
ts.rangeContainsStartEnd(node.parent.arguments, start, node.getEnd())) {
|
|
return node.parent.arguments;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function getActualIndentationForListItem(node, sourceFile, options) {
|
|
var containingList = getContainingList(node, sourceFile);
|
|
return containingList ? getActualIndentationFromList(containingList) : -1 /* Unknown */;
|
|
function getActualIndentationFromList(list) {
|
|
var index = ts.indexOf(list, node);
|
|
return index !== -1 ? deriveActualIndentationFromList(list, index, sourceFile, options) : -1 /* Unknown */;
|
|
}
|
|
}
|
|
function getLineIndentationWhenExpressionIsInMultiLine(node, sourceFile, options) {
|
|
// actual indentation should not be used when:
|
|
// - node is close parenthesis - this is the end of the expression
|
|
if (node.kind === 17 /* CloseParenToken */) {
|
|
return -1 /* Unknown */;
|
|
}
|
|
if (node.parent && (node.parent.kind === 165 /* CallExpression */ ||
|
|
node.parent.kind === 166 /* NewExpression */) &&
|
|
node.parent.expression !== node) {
|
|
var fullCallOrNewExpression = node.parent.expression;
|
|
var startingExpression = getStartingExpression(fullCallOrNewExpression);
|
|
if (fullCallOrNewExpression === startingExpression) {
|
|
return -1 /* Unknown */;
|
|
}
|
|
var fullCallOrNewExpressionEnd = sourceFile.getLineAndCharacterOfPosition(fullCallOrNewExpression.end);
|
|
var startingExpressionEnd = sourceFile.getLineAndCharacterOfPosition(startingExpression.end);
|
|
if (fullCallOrNewExpressionEnd.line === startingExpressionEnd.line) {
|
|
return -1 /* Unknown */;
|
|
}
|
|
return findColumnForFirstNonWhitespaceCharacterInLine(fullCallOrNewExpressionEnd, sourceFile, options);
|
|
}
|
|
return -1 /* Unknown */;
|
|
function getStartingExpression(node) {
|
|
while (true) {
|
|
switch (node.kind) {
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
case 163 /* PropertyAccessExpression */:
|
|
case 164 /* ElementAccessExpression */:
|
|
node = node.expression;
|
|
break;
|
|
default:
|
|
return node;
|
|
}
|
|
}
|
|
return node;
|
|
}
|
|
}
|
|
function deriveActualIndentationFromList(list, index, sourceFile, options) {
|
|
ts.Debug.assert(index >= 0 && index < list.length);
|
|
var node = list[index];
|
|
// walk toward the start of the list starting from current node and check if the line is the same for all items.
|
|
// if end line for item [i - 1] differs from the start line for item [i] - find column of the first non-whitespace character on the line of item [i]
|
|
var lineAndCharacter = getStartLineAndCharacterForNode(node, sourceFile);
|
|
for (var i = index - 1; i >= 0; --i) {
|
|
if (list[i].kind === 23 /* CommaToken */) {
|
|
continue;
|
|
}
|
|
// skip list items that ends on the same line with the current list element
|
|
var prevEndLine = sourceFile.getLineAndCharacterOfPosition(list[i].end).line;
|
|
if (prevEndLine !== lineAndCharacter.line) {
|
|
return findColumnForFirstNonWhitespaceCharacterInLine(lineAndCharacter, sourceFile, options);
|
|
}
|
|
lineAndCharacter = getStartLineAndCharacterForNode(list[i], sourceFile);
|
|
}
|
|
return -1 /* Unknown */;
|
|
}
|
|
function findColumnForFirstNonWhitespaceCharacterInLine(lineAndCharacter, sourceFile, options) {
|
|
var lineStart = sourceFile.getPositionOfLineAndCharacter(lineAndCharacter.line, 0);
|
|
return findFirstNonWhitespaceColumn(lineStart, lineStart + lineAndCharacter.character, sourceFile, options);
|
|
}
|
|
/*
|
|
Character is the actual index of the character since the beginning of the line.
|
|
Column - position of the character after expanding tabs to spaces
|
|
"0\t2$"
|
|
value of 'character' for '$' is 3
|
|
value of 'column' for '$' is 6 (assuming that tab size is 4)
|
|
*/
|
|
function findFirstNonWhitespaceCharacterAndColumn(startPos, endPos, sourceFile, options) {
|
|
var character = 0;
|
|
var column = 0;
|
|
for (var pos = startPos; pos < endPos; ++pos) {
|
|
var ch = sourceFile.text.charCodeAt(pos);
|
|
if (!ts.isWhiteSpace(ch)) {
|
|
break;
|
|
}
|
|
if (ch === 9 /* tab */) {
|
|
column += options.TabSize + (column % options.TabSize);
|
|
}
|
|
else {
|
|
column++;
|
|
}
|
|
character++;
|
|
}
|
|
return { column: column, character: character };
|
|
}
|
|
SmartIndenter.findFirstNonWhitespaceCharacterAndColumn = findFirstNonWhitespaceCharacterAndColumn;
|
|
function findFirstNonWhitespaceColumn(startPos, endPos, sourceFile, options) {
|
|
return findFirstNonWhitespaceCharacterAndColumn(startPos, endPos, sourceFile, options).column;
|
|
}
|
|
SmartIndenter.findFirstNonWhitespaceColumn = findFirstNonWhitespaceColumn;
|
|
function nodeContentIsAlwaysIndented(kind) {
|
|
switch (kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 161 /* ArrayLiteralExpression */:
|
|
case 189 /* Block */:
|
|
case 216 /* ModuleBlock */:
|
|
case 162 /* ObjectLiteralExpression */:
|
|
case 152 /* TypeLiteral */:
|
|
case 154 /* TupleType */:
|
|
case 217 /* CaseBlock */:
|
|
case 239 /* DefaultClause */:
|
|
case 238 /* CaseClause */:
|
|
case 169 /* ParenthesizedExpression */:
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
case 190 /* VariableStatement */:
|
|
case 208 /* VariableDeclaration */:
|
|
case 224 /* ExportAssignment */:
|
|
case 201 /* ReturnStatement */:
|
|
case 179 /* ConditionalExpression */:
|
|
case 159 /* ArrayBindingPattern */:
|
|
case 158 /* ObjectBindingPattern */:
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function shouldIndentChildNode(parent, child) {
|
|
if (nodeContentIsAlwaysIndented(parent)) {
|
|
return true;
|
|
}
|
|
switch (parent) {
|
|
case 194 /* DoStatement */:
|
|
case 195 /* WhileStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
case 196 /* ForStatement */:
|
|
case 193 /* IfStatement */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 144 /* CallSignature */:
|
|
case 171 /* ArrowFunction */:
|
|
case 141 /* Constructor */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
return child !== 189 /* Block */;
|
|
default:
|
|
return false;
|
|
}
|
|
}
|
|
SmartIndenter.shouldIndentChildNode = shouldIndentChildNode;
|
|
})(SmartIndenter = formatting.SmartIndenter || (formatting.SmartIndenter = {}));
|
|
})(formatting = ts.formatting || (ts.formatting = {}));
|
|
})(ts || (ts = {}));
|
|
/// <reference path="..\compiler\program.ts"/>
|
|
var __extends = (this && this.__extends) || function (d, b) {
|
|
for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p];
|
|
function __() { this.constructor = d; }
|
|
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
|
};
|
|
/// <reference path='breakpoints.ts' />
|
|
/// <reference path='outliningElementsCollector.ts' />
|
|
/// <reference path='navigateTo.ts' />
|
|
/// <reference path='navigationBar.ts' />
|
|
/// <reference path='patternMatcher.ts' />
|
|
/// <reference path='signatureHelp.ts' />
|
|
/// <reference path='utilities.ts' />
|
|
/// <reference path='formatting\formatting.ts' />
|
|
/// <reference path='formatting\smartIndenter.ts' />
|
|
var ts;
|
|
(function (ts) {
|
|
/** The version of the language service API */
|
|
ts.servicesVersion = "0.4";
|
|
var ScriptSnapshot;
|
|
(function (ScriptSnapshot) {
|
|
var StringScriptSnapshot = (function () {
|
|
function StringScriptSnapshot(text) {
|
|
this.text = text;
|
|
}
|
|
StringScriptSnapshot.prototype.getText = function (start, end) {
|
|
return this.text.substring(start, end);
|
|
};
|
|
StringScriptSnapshot.prototype.getLength = function () {
|
|
return this.text.length;
|
|
};
|
|
StringScriptSnapshot.prototype.getChangeRange = function (oldSnapshot) {
|
|
// Text-based snapshots do not support incremental parsing. Return undefined
|
|
// to signal that to the caller.
|
|
return undefined;
|
|
};
|
|
return StringScriptSnapshot;
|
|
})();
|
|
function fromString(text) {
|
|
return new StringScriptSnapshot(text);
|
|
}
|
|
ScriptSnapshot.fromString = fromString;
|
|
})(ScriptSnapshot = ts.ScriptSnapshot || (ts.ScriptSnapshot = {}));
|
|
var scanner = ts.createScanner(2 /* Latest */, true);
|
|
var emptyArray = [];
|
|
function createNode(kind, pos, end, flags, parent) {
|
|
var node = new (ts.getNodeConstructor(kind))();
|
|
node.pos = pos;
|
|
node.end = end;
|
|
node.flags = flags;
|
|
node.parent = parent;
|
|
return node;
|
|
}
|
|
var NodeObject = (function () {
|
|
function NodeObject() {
|
|
}
|
|
NodeObject.prototype.getSourceFile = function () {
|
|
return ts.getSourceFileOfNode(this);
|
|
};
|
|
NodeObject.prototype.getStart = function (sourceFile) {
|
|
return ts.getTokenPosOfNode(this, sourceFile);
|
|
};
|
|
NodeObject.prototype.getFullStart = function () {
|
|
return this.pos;
|
|
};
|
|
NodeObject.prototype.getEnd = function () {
|
|
return this.end;
|
|
};
|
|
NodeObject.prototype.getWidth = function (sourceFile) {
|
|
return this.getEnd() - this.getStart(sourceFile);
|
|
};
|
|
NodeObject.prototype.getFullWidth = function () {
|
|
return this.end - this.pos;
|
|
};
|
|
NodeObject.prototype.getLeadingTriviaWidth = function (sourceFile) {
|
|
return this.getStart(sourceFile) - this.pos;
|
|
};
|
|
NodeObject.prototype.getFullText = function (sourceFile) {
|
|
return (sourceFile || this.getSourceFile()).text.substring(this.pos, this.end);
|
|
};
|
|
NodeObject.prototype.getText = function (sourceFile) {
|
|
return (sourceFile || this.getSourceFile()).text.substring(this.getStart(), this.getEnd());
|
|
};
|
|
NodeObject.prototype.addSyntheticNodes = function (nodes, pos, end) {
|
|
scanner.setTextPos(pos);
|
|
while (pos < end) {
|
|
var token = scanner.scan();
|
|
var textPos = scanner.getTextPos();
|
|
nodes.push(createNode(token, pos, textPos, 4096 /* Synthetic */, this));
|
|
pos = textPos;
|
|
}
|
|
return pos;
|
|
};
|
|
NodeObject.prototype.createSyntaxList = function (nodes) {
|
|
var list = createNode(268 /* SyntaxList */, nodes.pos, nodes.end, 4096 /* Synthetic */, this);
|
|
list._children = [];
|
|
var pos = nodes.pos;
|
|
for (var _i = 0; _i < nodes.length; _i++) {
|
|
var node = nodes[_i];
|
|
if (pos < node.pos) {
|
|
pos = this.addSyntheticNodes(list._children, pos, node.pos);
|
|
}
|
|
list._children.push(node);
|
|
pos = node.end;
|
|
}
|
|
if (pos < nodes.end) {
|
|
this.addSyntheticNodes(list._children, pos, nodes.end);
|
|
}
|
|
return list;
|
|
};
|
|
NodeObject.prototype.createChildren = function (sourceFile) {
|
|
var _this = this;
|
|
var children;
|
|
if (this.kind >= 132 /* FirstNode */) {
|
|
scanner.setText((sourceFile || this.getSourceFile()).text);
|
|
children = [];
|
|
var pos = this.pos;
|
|
var processNode = function (node) {
|
|
if (pos < node.pos) {
|
|
pos = _this.addSyntheticNodes(children, pos, node.pos);
|
|
}
|
|
children.push(node);
|
|
pos = node.end;
|
|
};
|
|
var processNodes = function (nodes) {
|
|
if (pos < nodes.pos) {
|
|
pos = _this.addSyntheticNodes(children, pos, nodes.pos);
|
|
}
|
|
children.push(_this.createSyntaxList(nodes));
|
|
pos = nodes.end;
|
|
};
|
|
ts.forEachChild(this, processNode, processNodes);
|
|
if (pos < this.end) {
|
|
this.addSyntheticNodes(children, pos, this.end);
|
|
}
|
|
scanner.setText(undefined);
|
|
}
|
|
this._children = children || emptyArray;
|
|
};
|
|
NodeObject.prototype.getChildCount = function (sourceFile) {
|
|
if (!this._children)
|
|
this.createChildren(sourceFile);
|
|
return this._children.length;
|
|
};
|
|
NodeObject.prototype.getChildAt = function (index, sourceFile) {
|
|
if (!this._children)
|
|
this.createChildren(sourceFile);
|
|
return this._children[index];
|
|
};
|
|
NodeObject.prototype.getChildren = function (sourceFile) {
|
|
if (!this._children)
|
|
this.createChildren(sourceFile);
|
|
return this._children;
|
|
};
|
|
NodeObject.prototype.getFirstToken = function (sourceFile) {
|
|
var children = this.getChildren();
|
|
for (var _i = 0; _i < children.length; _i++) {
|
|
var child = children[_i];
|
|
if (child.kind < 132 /* FirstNode */) {
|
|
return child;
|
|
}
|
|
return child.getFirstToken(sourceFile);
|
|
}
|
|
};
|
|
NodeObject.prototype.getLastToken = function (sourceFile) {
|
|
var children = this.getChildren(sourceFile);
|
|
for (var i = children.length - 1; i >= 0; i--) {
|
|
var child = children[i];
|
|
if (child.kind < 132 /* FirstNode */) {
|
|
return child;
|
|
}
|
|
return child.getLastToken(sourceFile);
|
|
}
|
|
};
|
|
return NodeObject;
|
|
})();
|
|
var SymbolObject = (function () {
|
|
function SymbolObject(flags, name) {
|
|
this.flags = flags;
|
|
this.name = name;
|
|
}
|
|
SymbolObject.prototype.getFlags = function () {
|
|
return this.flags;
|
|
};
|
|
SymbolObject.prototype.getName = function () {
|
|
return this.name;
|
|
};
|
|
SymbolObject.prototype.getDeclarations = function () {
|
|
return this.declarations;
|
|
};
|
|
SymbolObject.prototype.getDocumentationComment = function () {
|
|
if (this.documentationComment === undefined) {
|
|
this.documentationComment = getJsDocCommentsFromDeclarations(this.declarations, this.name, !(this.flags & 4 /* Property */));
|
|
}
|
|
return this.documentationComment;
|
|
};
|
|
return SymbolObject;
|
|
})();
|
|
function getJsDocCommentsFromDeclarations(declarations, name, canUseParsedParamTagComments) {
|
|
var documentationComment = [];
|
|
var docComments = getJsDocCommentsSeparatedByNewLines();
|
|
ts.forEach(docComments, function (docComment) {
|
|
if (documentationComment.length) {
|
|
documentationComment.push(ts.lineBreakPart());
|
|
}
|
|
documentationComment.push(docComment);
|
|
});
|
|
return documentationComment;
|
|
function getJsDocCommentsSeparatedByNewLines() {
|
|
var paramTag = "@param";
|
|
var jsDocCommentParts = [];
|
|
ts.forEach(declarations, function (declaration, indexOfDeclaration) {
|
|
// Make sure we are collecting doc comment from declaration once,
|
|
// In case of union property there might be same declaration multiple times
|
|
// which only varies in type parameter
|
|
// Eg. let a: Array<string> | Array<number>; a.length
|
|
// The property length will have two declarations of property length coming
|
|
// from Array<T> - Array<string> and Array<number>
|
|
if (ts.indexOf(declarations, declaration) === indexOfDeclaration) {
|
|
var sourceFileOfDeclaration = ts.getSourceFileOfNode(declaration);
|
|
// If it is parameter - try and get the jsDoc comment with @param tag from function declaration's jsDoc comments
|
|
if (canUseParsedParamTagComments && declaration.kind === 135 /* Parameter */) {
|
|
ts.forEach(getJsDocCommentTextRange(declaration.parent, sourceFileOfDeclaration), function (jsDocCommentTextRange) {
|
|
var cleanedParamJsDocComment = getCleanedParamJsDocComment(jsDocCommentTextRange.pos, jsDocCommentTextRange.end, sourceFileOfDeclaration);
|
|
if (cleanedParamJsDocComment) {
|
|
ts.addRange(jsDocCommentParts, cleanedParamJsDocComment);
|
|
}
|
|
});
|
|
}
|
|
// If this is left side of dotted module declaration, there is no doc comments associated with this node
|
|
if (declaration.kind === 215 /* ModuleDeclaration */ && declaration.body.kind === 215 /* ModuleDeclaration */) {
|
|
return;
|
|
}
|
|
// If this is dotted module name, get the doc comments from the parent
|
|
while (declaration.kind === 215 /* ModuleDeclaration */ && declaration.parent.kind === 215 /* ModuleDeclaration */) {
|
|
declaration = declaration.parent;
|
|
}
|
|
// Get the cleaned js doc comment text from the declaration
|
|
ts.forEach(getJsDocCommentTextRange(declaration.kind === 208 /* VariableDeclaration */ ? declaration.parent.parent : declaration, sourceFileOfDeclaration), function (jsDocCommentTextRange) {
|
|
var cleanedJsDocComment = getCleanedJsDocComment(jsDocCommentTextRange.pos, jsDocCommentTextRange.end, sourceFileOfDeclaration);
|
|
if (cleanedJsDocComment) {
|
|
ts.addRange(jsDocCommentParts, cleanedJsDocComment);
|
|
}
|
|
});
|
|
}
|
|
});
|
|
return jsDocCommentParts;
|
|
function getJsDocCommentTextRange(node, sourceFile) {
|
|
return ts.map(ts.getJsDocComments(node, sourceFile), function (jsDocComment) {
|
|
return {
|
|
pos: jsDocComment.pos + "/*".length,
|
|
end: jsDocComment.end - "*/".length // Trim off comment end indicator
|
|
};
|
|
});
|
|
}
|
|
function consumeWhiteSpacesOnTheLine(pos, end, sourceFile, maxSpacesToRemove) {
|
|
if (maxSpacesToRemove !== undefined) {
|
|
end = Math.min(end, pos + maxSpacesToRemove);
|
|
}
|
|
for (; pos < end; pos++) {
|
|
var ch = sourceFile.text.charCodeAt(pos);
|
|
if (!ts.isWhiteSpace(ch) || ts.isLineBreak(ch)) {
|
|
// Either found lineBreak or non whiteSpace
|
|
return pos;
|
|
}
|
|
}
|
|
return end;
|
|
}
|
|
function consumeLineBreaks(pos, end, sourceFile) {
|
|
while (pos < end && ts.isLineBreak(sourceFile.text.charCodeAt(pos))) {
|
|
pos++;
|
|
}
|
|
return pos;
|
|
}
|
|
function isName(pos, end, sourceFile, name) {
|
|
return pos + name.length < end &&
|
|
sourceFile.text.substr(pos, name.length) === name &&
|
|
(ts.isWhiteSpace(sourceFile.text.charCodeAt(pos + name.length)) ||
|
|
ts.isLineBreak(sourceFile.text.charCodeAt(pos + name.length)));
|
|
}
|
|
function isParamTag(pos, end, sourceFile) {
|
|
// If it is @param tag
|
|
return isName(pos, end, sourceFile, paramTag);
|
|
}
|
|
function pushDocCommentLineText(docComments, text, blankLineCount) {
|
|
// Add the empty lines in between texts
|
|
while (blankLineCount--) {
|
|
docComments.push(ts.textPart(""));
|
|
}
|
|
docComments.push(ts.textPart(text));
|
|
}
|
|
function getCleanedJsDocComment(pos, end, sourceFile) {
|
|
var spacesToRemoveAfterAsterisk;
|
|
var docComments = [];
|
|
var blankLineCount = 0;
|
|
var isInParamTag = false;
|
|
while (pos < end) {
|
|
var docCommentTextOfLine = "";
|
|
// First consume leading white space
|
|
pos = consumeWhiteSpacesOnTheLine(pos, end, sourceFile);
|
|
// If the comment starts with '*' consume the spaces on this line
|
|
if (pos < end && sourceFile.text.charCodeAt(pos) === 42 /* asterisk */) {
|
|
var lineStartPos = pos + 1;
|
|
pos = consumeWhiteSpacesOnTheLine(pos + 1, end, sourceFile, spacesToRemoveAfterAsterisk);
|
|
// Set the spaces to remove after asterisk as margin if not already set
|
|
if (spacesToRemoveAfterAsterisk === undefined && pos < end && !ts.isLineBreak(sourceFile.text.charCodeAt(pos))) {
|
|
spacesToRemoveAfterAsterisk = pos - lineStartPos;
|
|
}
|
|
}
|
|
else if (spacesToRemoveAfterAsterisk === undefined) {
|
|
spacesToRemoveAfterAsterisk = 0;
|
|
}
|
|
// Analyse text on this line
|
|
while (pos < end && !ts.isLineBreak(sourceFile.text.charCodeAt(pos))) {
|
|
var ch = sourceFile.text.charAt(pos);
|
|
if (ch === "@") {
|
|
// If it is @param tag
|
|
if (isParamTag(pos, end, sourceFile)) {
|
|
isInParamTag = true;
|
|
pos += paramTag.length;
|
|
continue;
|
|
}
|
|
else {
|
|
isInParamTag = false;
|
|
}
|
|
}
|
|
// Add the ch to doc text if we arent in param tag
|
|
if (!isInParamTag) {
|
|
docCommentTextOfLine += ch;
|
|
}
|
|
// Scan next character
|
|
pos++;
|
|
}
|
|
// Continue with next line
|
|
pos = consumeLineBreaks(pos, end, sourceFile);
|
|
if (docCommentTextOfLine) {
|
|
pushDocCommentLineText(docComments, docCommentTextOfLine, blankLineCount);
|
|
blankLineCount = 0;
|
|
}
|
|
else if (!isInParamTag && docComments.length) {
|
|
// This is blank line when there is text already parsed
|
|
blankLineCount++;
|
|
}
|
|
}
|
|
return docComments;
|
|
}
|
|
function getCleanedParamJsDocComment(pos, end, sourceFile) {
|
|
var paramHelpStringMargin;
|
|
var paramDocComments = [];
|
|
while (pos < end) {
|
|
if (isParamTag(pos, end, sourceFile)) {
|
|
var blankLineCount = 0;
|
|
var recordedParamTag = false;
|
|
// Consume leading spaces
|
|
pos = consumeWhiteSpaces(pos + paramTag.length);
|
|
if (pos >= end) {
|
|
break;
|
|
}
|
|
// Ignore type expression
|
|
if (sourceFile.text.charCodeAt(pos) === 123 /* openBrace */) {
|
|
pos++;
|
|
for (var curlies = 1; pos < end; pos++) {
|
|
var charCode = sourceFile.text.charCodeAt(pos);
|
|
// { character means we need to find another } to match the found one
|
|
if (charCode === 123 /* openBrace */) {
|
|
curlies++;
|
|
continue;
|
|
}
|
|
// } char
|
|
if (charCode === 125 /* closeBrace */) {
|
|
curlies--;
|
|
if (curlies === 0) {
|
|
// We do not have any more } to match the type expression is ignored completely
|
|
pos++;
|
|
break;
|
|
}
|
|
else {
|
|
// there are more { to be matched with }
|
|
continue;
|
|
}
|
|
}
|
|
// Found start of another tag
|
|
if (charCode === 64 /* at */) {
|
|
break;
|
|
}
|
|
}
|
|
// Consume white spaces
|
|
pos = consumeWhiteSpaces(pos);
|
|
if (pos >= end) {
|
|
break;
|
|
}
|
|
}
|
|
// Parameter name
|
|
if (isName(pos, end, sourceFile, name)) {
|
|
// Found the parameter we are looking for consume white spaces
|
|
pos = consumeWhiteSpaces(pos + name.length);
|
|
if (pos >= end) {
|
|
break;
|
|
}
|
|
var paramHelpString = "";
|
|
var firstLineParamHelpStringPos = pos;
|
|
while (pos < end) {
|
|
var ch = sourceFile.text.charCodeAt(pos);
|
|
// at line break, set this comment line text and go to next line
|
|
if (ts.isLineBreak(ch)) {
|
|
if (paramHelpString) {
|
|
pushDocCommentLineText(paramDocComments, paramHelpString, blankLineCount);
|
|
paramHelpString = "";
|
|
blankLineCount = 0;
|
|
recordedParamTag = true;
|
|
}
|
|
else if (recordedParamTag) {
|
|
blankLineCount++;
|
|
}
|
|
// Get the pos after cleaning start of the line
|
|
setPosForParamHelpStringOnNextLine(firstLineParamHelpStringPos);
|
|
continue;
|
|
}
|
|
// Done scanning param help string - next tag found
|
|
if (ch === 64 /* at */) {
|
|
break;
|
|
}
|
|
paramHelpString += sourceFile.text.charAt(pos);
|
|
// Go to next character
|
|
pos++;
|
|
}
|
|
// If there is param help text, add it top the doc comments
|
|
if (paramHelpString) {
|
|
pushDocCommentLineText(paramDocComments, paramHelpString, blankLineCount);
|
|
}
|
|
paramHelpStringMargin = undefined;
|
|
}
|
|
// If this is the start of another tag, continue with the loop in seach of param tag with symbol name
|
|
if (sourceFile.text.charCodeAt(pos) === 64 /* at */) {
|
|
continue;
|
|
}
|
|
}
|
|
// Next character
|
|
pos++;
|
|
}
|
|
return paramDocComments;
|
|
function consumeWhiteSpaces(pos) {
|
|
while (pos < end && ts.isWhiteSpace(sourceFile.text.charCodeAt(pos))) {
|
|
pos++;
|
|
}
|
|
return pos;
|
|
}
|
|
function setPosForParamHelpStringOnNextLine(firstLineParamHelpStringPos) {
|
|
// Get the pos after consuming line breaks
|
|
pos = consumeLineBreaks(pos, end, sourceFile);
|
|
if (pos >= end) {
|
|
return;
|
|
}
|
|
if (paramHelpStringMargin === undefined) {
|
|
paramHelpStringMargin = sourceFile.getLineAndCharacterOfPosition(firstLineParamHelpStringPos).character;
|
|
}
|
|
// Now consume white spaces max
|
|
var startOfLinePos = pos;
|
|
pos = consumeWhiteSpacesOnTheLine(pos, end, sourceFile, paramHelpStringMargin);
|
|
if (pos >= end) {
|
|
return;
|
|
}
|
|
var consumedSpaces = pos - startOfLinePos;
|
|
if (consumedSpaces < paramHelpStringMargin) {
|
|
var ch = sourceFile.text.charCodeAt(pos);
|
|
if (ch === 42 /* asterisk */) {
|
|
// Consume more spaces after asterisk
|
|
pos = consumeWhiteSpacesOnTheLine(pos + 1, end, sourceFile, paramHelpStringMargin - consumedSpaces - 1);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
var TypeObject = (function () {
|
|
function TypeObject(checker, flags) {
|
|
this.checker = checker;
|
|
this.flags = flags;
|
|
}
|
|
TypeObject.prototype.getFlags = function () {
|
|
return this.flags;
|
|
};
|
|
TypeObject.prototype.getSymbol = function () {
|
|
return this.symbol;
|
|
};
|
|
TypeObject.prototype.getProperties = function () {
|
|
return this.checker.getPropertiesOfType(this);
|
|
};
|
|
TypeObject.prototype.getProperty = function (propertyName) {
|
|
return this.checker.getPropertyOfType(this, propertyName);
|
|
};
|
|
TypeObject.prototype.getApparentProperties = function () {
|
|
return this.checker.getAugmentedPropertiesOfType(this);
|
|
};
|
|
TypeObject.prototype.getCallSignatures = function () {
|
|
return this.checker.getSignaturesOfType(this, 0 /* Call */);
|
|
};
|
|
TypeObject.prototype.getConstructSignatures = function () {
|
|
return this.checker.getSignaturesOfType(this, 1 /* Construct */);
|
|
};
|
|
TypeObject.prototype.getStringIndexType = function () {
|
|
return this.checker.getIndexTypeOfType(this, 0 /* String */);
|
|
};
|
|
TypeObject.prototype.getNumberIndexType = function () {
|
|
return this.checker.getIndexTypeOfType(this, 1 /* Number */);
|
|
};
|
|
return TypeObject;
|
|
})();
|
|
var SignatureObject = (function () {
|
|
function SignatureObject(checker) {
|
|
this.checker = checker;
|
|
}
|
|
SignatureObject.prototype.getDeclaration = function () {
|
|
return this.declaration;
|
|
};
|
|
SignatureObject.prototype.getTypeParameters = function () {
|
|
return this.typeParameters;
|
|
};
|
|
SignatureObject.prototype.getParameters = function () {
|
|
return this.parameters;
|
|
};
|
|
SignatureObject.prototype.getReturnType = function () {
|
|
return this.checker.getReturnTypeOfSignature(this);
|
|
};
|
|
SignatureObject.prototype.getDocumentationComment = function () {
|
|
if (this.documentationComment === undefined) {
|
|
this.documentationComment = this.declaration ? getJsDocCommentsFromDeclarations([this.declaration],
|
|
/*name*/ undefined,
|
|
/*canUseParsedParamTagComments*/ false) : [];
|
|
}
|
|
return this.documentationComment;
|
|
};
|
|
return SignatureObject;
|
|
})();
|
|
var SourceFileObject = (function (_super) {
|
|
__extends(SourceFileObject, _super);
|
|
function SourceFileObject() {
|
|
_super.apply(this, arguments);
|
|
}
|
|
SourceFileObject.prototype.update = function (newText, textChangeRange) {
|
|
return ts.updateSourceFile(this, newText, textChangeRange);
|
|
};
|
|
SourceFileObject.prototype.getLineAndCharacterOfPosition = function (position) {
|
|
return ts.getLineAndCharacterOfPosition(this, position);
|
|
};
|
|
SourceFileObject.prototype.getLineStarts = function () {
|
|
return ts.getLineStarts(this);
|
|
};
|
|
SourceFileObject.prototype.getPositionOfLineAndCharacter = function (line, character) {
|
|
return ts.getPositionOfLineAndCharacter(this, line, character);
|
|
};
|
|
SourceFileObject.prototype.getNamedDeclarations = function () {
|
|
if (!this.namedDeclarations) {
|
|
this.namedDeclarations = this.computeNamedDeclarations();
|
|
}
|
|
return this.namedDeclarations;
|
|
};
|
|
SourceFileObject.prototype.computeNamedDeclarations = function () {
|
|
var result = {};
|
|
ts.forEachChild(this, visit);
|
|
return result;
|
|
function addDeclaration(declaration) {
|
|
var name = getDeclarationName(declaration);
|
|
if (name) {
|
|
var declarations = getDeclarations(name);
|
|
declarations.push(declaration);
|
|
}
|
|
}
|
|
function getDeclarations(name) {
|
|
return ts.getProperty(result, name) || (result[name] = []);
|
|
}
|
|
function getDeclarationName(declaration) {
|
|
if (declaration.name) {
|
|
var result_2 = getTextOfIdentifierOrLiteral(declaration.name);
|
|
if (result_2 !== undefined) {
|
|
return result_2;
|
|
}
|
|
if (declaration.name.kind === 133 /* ComputedPropertyName */) {
|
|
var expr = declaration.name.expression;
|
|
if (expr.kind === 163 /* PropertyAccessExpression */) {
|
|
return expr.name.text;
|
|
}
|
|
return getTextOfIdentifierOrLiteral(expr);
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function getTextOfIdentifierOrLiteral(node) {
|
|
if (node) {
|
|
if (node.kind === 66 /* Identifier */ ||
|
|
node.kind === 8 /* StringLiteral */ ||
|
|
node.kind === 7 /* NumericLiteral */) {
|
|
return node.text;
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function visit(node) {
|
|
switch (node.kind) {
|
|
case 210 /* FunctionDeclaration */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
var functionDeclaration = node;
|
|
var declarationName = getDeclarationName(functionDeclaration);
|
|
if (declarationName) {
|
|
var declarations = getDeclarations(declarationName);
|
|
var lastDeclaration = ts.lastOrUndefined(declarations);
|
|
// Check whether this declaration belongs to an "overload group".
|
|
if (lastDeclaration && functionDeclaration.parent === lastDeclaration.parent && functionDeclaration.symbol === lastDeclaration.symbol) {
|
|
// Overwrite the last declaration if it was an overload
|
|
// and this one is an implementation.
|
|
if (functionDeclaration.body && !lastDeclaration.body) {
|
|
declarations[declarations.length - 1] = functionDeclaration;
|
|
}
|
|
}
|
|
else {
|
|
declarations.push(functionDeclaration);
|
|
}
|
|
ts.forEachChild(node, visit);
|
|
}
|
|
break;
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 213 /* TypeAliasDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 215 /* ModuleDeclaration */:
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 227 /* ExportSpecifier */:
|
|
case 223 /* ImportSpecifier */:
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 220 /* ImportClause */:
|
|
case 221 /* NamespaceImport */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 152 /* TypeLiteral */:
|
|
addDeclaration(node);
|
|
// fall through
|
|
case 141 /* Constructor */:
|
|
case 190 /* VariableStatement */:
|
|
case 209 /* VariableDeclarationList */:
|
|
case 158 /* ObjectBindingPattern */:
|
|
case 159 /* ArrayBindingPattern */:
|
|
case 216 /* ModuleBlock */:
|
|
ts.forEachChild(node, visit);
|
|
break;
|
|
case 189 /* Block */:
|
|
if (ts.isFunctionBlock(node)) {
|
|
ts.forEachChild(node, visit);
|
|
}
|
|
break;
|
|
case 135 /* Parameter */:
|
|
// Only consider properties defined as constructor parameters
|
|
if (!(node.flags & 112 /* AccessibilityModifier */)) {
|
|
break;
|
|
}
|
|
// fall through
|
|
case 208 /* VariableDeclaration */:
|
|
case 160 /* BindingElement */:
|
|
if (ts.isBindingPattern(node.name)) {
|
|
ts.forEachChild(node.name, visit);
|
|
break;
|
|
}
|
|
case 244 /* EnumMember */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
addDeclaration(node);
|
|
break;
|
|
case 225 /* ExportDeclaration */:
|
|
// Handle named exports case e.g.:
|
|
// export {a, b as B} from "mod";
|
|
if (node.exportClause) {
|
|
ts.forEach(node.exportClause.elements, visit);
|
|
}
|
|
break;
|
|
case 219 /* ImportDeclaration */:
|
|
var importClause = node.importClause;
|
|
if (importClause) {
|
|
// Handle default import case e.g.:
|
|
// import d from "mod";
|
|
if (importClause.name) {
|
|
addDeclaration(importClause);
|
|
}
|
|
// Handle named bindings in imports e.g.:
|
|
// import * as NS from "mod";
|
|
// import {a, b as B} from "mod";
|
|
if (importClause.namedBindings) {
|
|
if (importClause.namedBindings.kind === 221 /* NamespaceImport */) {
|
|
addDeclaration(importClause.namedBindings);
|
|
}
|
|
else {
|
|
ts.forEach(importClause.namedBindings.elements, visit);
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
};
|
|
return SourceFileObject;
|
|
})(NodeObject);
|
|
var TextChange = (function () {
|
|
function TextChange() {
|
|
}
|
|
return TextChange;
|
|
})();
|
|
ts.TextChange = TextChange;
|
|
var HighlightSpanKind;
|
|
(function (HighlightSpanKind) {
|
|
HighlightSpanKind.none = "none";
|
|
HighlightSpanKind.definition = "definition";
|
|
HighlightSpanKind.reference = "reference";
|
|
HighlightSpanKind.writtenReference = "writtenReference";
|
|
})(HighlightSpanKind = ts.HighlightSpanKind || (ts.HighlightSpanKind = {}));
|
|
(function (SymbolDisplayPartKind) {
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["aliasName"] = 0] = "aliasName";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["className"] = 1] = "className";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["enumName"] = 2] = "enumName";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["fieldName"] = 3] = "fieldName";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["interfaceName"] = 4] = "interfaceName";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["keyword"] = 5] = "keyword";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["lineBreak"] = 6] = "lineBreak";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["numericLiteral"] = 7] = "numericLiteral";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["stringLiteral"] = 8] = "stringLiteral";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["localName"] = 9] = "localName";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["methodName"] = 10] = "methodName";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["moduleName"] = 11] = "moduleName";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["operator"] = 12] = "operator";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["parameterName"] = 13] = "parameterName";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["propertyName"] = 14] = "propertyName";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["punctuation"] = 15] = "punctuation";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["space"] = 16] = "space";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["text"] = 17] = "text";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["typeParameterName"] = 18] = "typeParameterName";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["enumMemberName"] = 19] = "enumMemberName";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["functionName"] = 20] = "functionName";
|
|
SymbolDisplayPartKind[SymbolDisplayPartKind["regularExpressionLiteral"] = 21] = "regularExpressionLiteral";
|
|
})(ts.SymbolDisplayPartKind || (ts.SymbolDisplayPartKind = {}));
|
|
var SymbolDisplayPartKind = ts.SymbolDisplayPartKind;
|
|
(function (OutputFileType) {
|
|
OutputFileType[OutputFileType["JavaScript"] = 0] = "JavaScript";
|
|
OutputFileType[OutputFileType["SourceMap"] = 1] = "SourceMap";
|
|
OutputFileType[OutputFileType["Declaration"] = 2] = "Declaration";
|
|
})(ts.OutputFileType || (ts.OutputFileType = {}));
|
|
var OutputFileType = ts.OutputFileType;
|
|
(function (EndOfLineState) {
|
|
EndOfLineState[EndOfLineState["None"] = 0] = "None";
|
|
EndOfLineState[EndOfLineState["InMultiLineCommentTrivia"] = 1] = "InMultiLineCommentTrivia";
|
|
EndOfLineState[EndOfLineState["InSingleQuoteStringLiteral"] = 2] = "InSingleQuoteStringLiteral";
|
|
EndOfLineState[EndOfLineState["InDoubleQuoteStringLiteral"] = 3] = "InDoubleQuoteStringLiteral";
|
|
EndOfLineState[EndOfLineState["InTemplateHeadOrNoSubstitutionTemplate"] = 4] = "InTemplateHeadOrNoSubstitutionTemplate";
|
|
EndOfLineState[EndOfLineState["InTemplateMiddleOrTail"] = 5] = "InTemplateMiddleOrTail";
|
|
EndOfLineState[EndOfLineState["InTemplateSubstitutionPosition"] = 6] = "InTemplateSubstitutionPosition";
|
|
})(ts.EndOfLineState || (ts.EndOfLineState = {}));
|
|
var EndOfLineState = ts.EndOfLineState;
|
|
(function (TokenClass) {
|
|
TokenClass[TokenClass["Punctuation"] = 0] = "Punctuation";
|
|
TokenClass[TokenClass["Keyword"] = 1] = "Keyword";
|
|
TokenClass[TokenClass["Operator"] = 2] = "Operator";
|
|
TokenClass[TokenClass["Comment"] = 3] = "Comment";
|
|
TokenClass[TokenClass["Whitespace"] = 4] = "Whitespace";
|
|
TokenClass[TokenClass["Identifier"] = 5] = "Identifier";
|
|
TokenClass[TokenClass["NumberLiteral"] = 6] = "NumberLiteral";
|
|
TokenClass[TokenClass["StringLiteral"] = 7] = "StringLiteral";
|
|
TokenClass[TokenClass["RegExpLiteral"] = 8] = "RegExpLiteral";
|
|
})(ts.TokenClass || (ts.TokenClass = {}));
|
|
var TokenClass = ts.TokenClass;
|
|
// TODO: move these to enums
|
|
var ScriptElementKind;
|
|
(function (ScriptElementKind) {
|
|
ScriptElementKind.unknown = "";
|
|
ScriptElementKind.warning = "warning";
|
|
// predefined type (void) or keyword (class)
|
|
ScriptElementKind.keyword = "keyword";
|
|
// top level script node
|
|
ScriptElementKind.scriptElement = "script";
|
|
// module foo {}
|
|
ScriptElementKind.moduleElement = "module";
|
|
// class X {}
|
|
ScriptElementKind.classElement = "class";
|
|
// var x = class X {}
|
|
ScriptElementKind.localClassElement = "local class";
|
|
// interface Y {}
|
|
ScriptElementKind.interfaceElement = "interface";
|
|
// type T = ...
|
|
ScriptElementKind.typeElement = "type";
|
|
// enum E
|
|
ScriptElementKind.enumElement = "enum";
|
|
// Inside module and script only
|
|
// let v = ..
|
|
ScriptElementKind.variableElement = "var";
|
|
// Inside function
|
|
ScriptElementKind.localVariableElement = "local var";
|
|
// Inside module and script only
|
|
// function f() { }
|
|
ScriptElementKind.functionElement = "function";
|
|
// Inside function
|
|
ScriptElementKind.localFunctionElement = "local function";
|
|
// class X { [public|private]* foo() {} }
|
|
ScriptElementKind.memberFunctionElement = "method";
|
|
// class X { [public|private]* [get|set] foo:number; }
|
|
ScriptElementKind.memberGetAccessorElement = "getter";
|
|
ScriptElementKind.memberSetAccessorElement = "setter";
|
|
// class X { [public|private]* foo:number; }
|
|
// interface Y { foo:number; }
|
|
ScriptElementKind.memberVariableElement = "property";
|
|
// class X { constructor() { } }
|
|
ScriptElementKind.constructorImplementationElement = "constructor";
|
|
// interface Y { ():number; }
|
|
ScriptElementKind.callSignatureElement = "call";
|
|
// interface Y { []:number; }
|
|
ScriptElementKind.indexSignatureElement = "index";
|
|
// interface Y { new():Y; }
|
|
ScriptElementKind.constructSignatureElement = "construct";
|
|
// function foo(*Y*: string)
|
|
ScriptElementKind.parameterElement = "parameter";
|
|
ScriptElementKind.typeParameterElement = "type parameter";
|
|
ScriptElementKind.primitiveType = "primitive type";
|
|
ScriptElementKind.label = "label";
|
|
ScriptElementKind.alias = "alias";
|
|
ScriptElementKind.constElement = "const";
|
|
ScriptElementKind.letElement = "let";
|
|
})(ScriptElementKind = ts.ScriptElementKind || (ts.ScriptElementKind = {}));
|
|
var ScriptElementKindModifier;
|
|
(function (ScriptElementKindModifier) {
|
|
ScriptElementKindModifier.none = "";
|
|
ScriptElementKindModifier.publicMemberModifier = "public";
|
|
ScriptElementKindModifier.privateMemberModifier = "private";
|
|
ScriptElementKindModifier.protectedMemberModifier = "protected";
|
|
ScriptElementKindModifier.exportedModifier = "export";
|
|
ScriptElementKindModifier.ambientModifier = "declare";
|
|
ScriptElementKindModifier.staticModifier = "static";
|
|
ScriptElementKindModifier.abstractModifier = "abstract";
|
|
})(ScriptElementKindModifier = ts.ScriptElementKindModifier || (ts.ScriptElementKindModifier = {}));
|
|
var ClassificationTypeNames = (function () {
|
|
function ClassificationTypeNames() {
|
|
}
|
|
ClassificationTypeNames.comment = "comment";
|
|
ClassificationTypeNames.identifier = "identifier";
|
|
ClassificationTypeNames.keyword = "keyword";
|
|
ClassificationTypeNames.numericLiteral = "number";
|
|
ClassificationTypeNames.operator = "operator";
|
|
ClassificationTypeNames.stringLiteral = "string";
|
|
ClassificationTypeNames.whiteSpace = "whitespace";
|
|
ClassificationTypeNames.text = "text";
|
|
ClassificationTypeNames.punctuation = "punctuation";
|
|
ClassificationTypeNames.className = "class name";
|
|
ClassificationTypeNames.enumName = "enum name";
|
|
ClassificationTypeNames.interfaceName = "interface name";
|
|
ClassificationTypeNames.moduleName = "module name";
|
|
ClassificationTypeNames.typeParameterName = "type parameter name";
|
|
ClassificationTypeNames.typeAliasName = "type alias name";
|
|
ClassificationTypeNames.parameterName = "parameter name";
|
|
ClassificationTypeNames.docCommentTagName = "doc comment tag name";
|
|
return ClassificationTypeNames;
|
|
})();
|
|
ts.ClassificationTypeNames = ClassificationTypeNames;
|
|
(function (ClassificationType) {
|
|
ClassificationType[ClassificationType["comment"] = 1] = "comment";
|
|
ClassificationType[ClassificationType["identifier"] = 2] = "identifier";
|
|
ClassificationType[ClassificationType["keyword"] = 3] = "keyword";
|
|
ClassificationType[ClassificationType["numericLiteral"] = 4] = "numericLiteral";
|
|
ClassificationType[ClassificationType["operator"] = 5] = "operator";
|
|
ClassificationType[ClassificationType["stringLiteral"] = 6] = "stringLiteral";
|
|
ClassificationType[ClassificationType["regularExpressionLiteral"] = 7] = "regularExpressionLiteral";
|
|
ClassificationType[ClassificationType["whiteSpace"] = 8] = "whiteSpace";
|
|
ClassificationType[ClassificationType["text"] = 9] = "text";
|
|
ClassificationType[ClassificationType["punctuation"] = 10] = "punctuation";
|
|
ClassificationType[ClassificationType["className"] = 11] = "className";
|
|
ClassificationType[ClassificationType["enumName"] = 12] = "enumName";
|
|
ClassificationType[ClassificationType["interfaceName"] = 13] = "interfaceName";
|
|
ClassificationType[ClassificationType["moduleName"] = 14] = "moduleName";
|
|
ClassificationType[ClassificationType["typeParameterName"] = 15] = "typeParameterName";
|
|
ClassificationType[ClassificationType["typeAliasName"] = 16] = "typeAliasName";
|
|
ClassificationType[ClassificationType["parameterName"] = 17] = "parameterName";
|
|
ClassificationType[ClassificationType["docCommentTagName"] = 18] = "docCommentTagName";
|
|
})(ts.ClassificationType || (ts.ClassificationType = {}));
|
|
var ClassificationType = ts.ClassificationType;
|
|
function displayPartsToString(displayParts) {
|
|
if (displayParts) {
|
|
return ts.map(displayParts, function (displayPart) { return displayPart.text; }).join("");
|
|
}
|
|
return "";
|
|
}
|
|
ts.displayPartsToString = displayPartsToString;
|
|
function isLocalVariableOrFunction(symbol) {
|
|
if (symbol.parent) {
|
|
return false; // This is exported symbol
|
|
}
|
|
return ts.forEach(symbol.declarations, function (declaration) {
|
|
// Function expressions are local
|
|
if (declaration.kind === 170 /* FunctionExpression */) {
|
|
return true;
|
|
}
|
|
if (declaration.kind !== 208 /* VariableDeclaration */ && declaration.kind !== 210 /* FunctionDeclaration */) {
|
|
return false;
|
|
}
|
|
// If the parent is not sourceFile or module block it is local variable
|
|
for (var parent_9 = declaration.parent; !ts.isFunctionBlock(parent_9); parent_9 = parent_9.parent) {
|
|
// Reached source file or module block
|
|
if (parent_9.kind === 245 /* SourceFile */ || parent_9.kind === 216 /* ModuleBlock */) {
|
|
return false;
|
|
}
|
|
}
|
|
// parent is in function block
|
|
return true;
|
|
});
|
|
}
|
|
function getDefaultCompilerOptions() {
|
|
// Always default to "ScriptTarget.ES5" for the language service
|
|
return {
|
|
target: 1 /* ES5 */,
|
|
module: 0 /* None */,
|
|
jsx: 1 /* Preserve */
|
|
};
|
|
}
|
|
ts.getDefaultCompilerOptions = getDefaultCompilerOptions;
|
|
// Cache host information about scrip Should be refreshed
|
|
// at each language service public entry point, since we don't know when
|
|
// set of scripts handled by the host changes.
|
|
var HostCache = (function () {
|
|
function HostCache(host, getCanonicalFileName) {
|
|
this.host = host;
|
|
// script id => script index
|
|
this.fileNameToEntry = ts.createFileMap(getCanonicalFileName);
|
|
// Initialize the list with the root file names
|
|
var rootFileNames = host.getScriptFileNames();
|
|
for (var _i = 0; _i < rootFileNames.length; _i++) {
|
|
var fileName = rootFileNames[_i];
|
|
this.createEntry(fileName);
|
|
}
|
|
// store the compilation settings
|
|
this._compilationSettings = host.getCompilationSettings() || getDefaultCompilerOptions();
|
|
}
|
|
HostCache.prototype.compilationSettings = function () {
|
|
return this._compilationSettings;
|
|
};
|
|
HostCache.prototype.createEntry = function (fileName) {
|
|
var entry;
|
|
var scriptSnapshot = this.host.getScriptSnapshot(fileName);
|
|
if (scriptSnapshot) {
|
|
entry = {
|
|
hostFileName: fileName,
|
|
version: this.host.getScriptVersion(fileName),
|
|
scriptSnapshot: scriptSnapshot
|
|
};
|
|
}
|
|
this.fileNameToEntry.set(fileName, entry);
|
|
return entry;
|
|
};
|
|
HostCache.prototype.getEntry = function (fileName) {
|
|
return this.fileNameToEntry.get(fileName);
|
|
};
|
|
HostCache.prototype.contains = function (fileName) {
|
|
return this.fileNameToEntry.contains(fileName);
|
|
};
|
|
HostCache.prototype.getOrCreateEntry = function (fileName) {
|
|
if (this.contains(fileName)) {
|
|
return this.getEntry(fileName);
|
|
}
|
|
return this.createEntry(fileName);
|
|
};
|
|
HostCache.prototype.getRootFileNames = function () {
|
|
var fileNames = [];
|
|
this.fileNameToEntry.forEachValue(function (value) {
|
|
if (value) {
|
|
fileNames.push(value.hostFileName);
|
|
}
|
|
});
|
|
return fileNames;
|
|
};
|
|
HostCache.prototype.getVersion = function (fileName) {
|
|
var file = this.getEntry(fileName);
|
|
return file && file.version;
|
|
};
|
|
HostCache.prototype.getScriptSnapshot = function (fileName) {
|
|
var file = this.getEntry(fileName);
|
|
return file && file.scriptSnapshot;
|
|
};
|
|
return HostCache;
|
|
})();
|
|
var SyntaxTreeCache = (function () {
|
|
function SyntaxTreeCache(host) {
|
|
this.host = host;
|
|
}
|
|
SyntaxTreeCache.prototype.getCurrentSourceFile = function (fileName) {
|
|
var scriptSnapshot = this.host.getScriptSnapshot(fileName);
|
|
if (!scriptSnapshot) {
|
|
// The host does not know about this file.
|
|
throw new Error("Could not find file: '" + fileName + "'.");
|
|
}
|
|
var version = this.host.getScriptVersion(fileName);
|
|
var sourceFile;
|
|
if (this.currentFileName !== fileName) {
|
|
// This is a new file, just parse it
|
|
sourceFile = createLanguageServiceSourceFile(fileName, scriptSnapshot, 2 /* Latest */, version, true);
|
|
}
|
|
else if (this.currentFileVersion !== version) {
|
|
// This is the same file, just a newer version. Incrementally parse the file.
|
|
var editRange = scriptSnapshot.getChangeRange(this.currentFileScriptSnapshot);
|
|
sourceFile = updateLanguageServiceSourceFile(this.currentSourceFile, scriptSnapshot, version, editRange);
|
|
}
|
|
if (sourceFile) {
|
|
// All done, ensure state is up to date
|
|
this.currentFileVersion = version;
|
|
this.currentFileName = fileName;
|
|
this.currentFileScriptSnapshot = scriptSnapshot;
|
|
this.currentSourceFile = sourceFile;
|
|
}
|
|
return this.currentSourceFile;
|
|
};
|
|
return SyntaxTreeCache;
|
|
})();
|
|
function setSourceFileFields(sourceFile, scriptSnapshot, version) {
|
|
sourceFile.version = version;
|
|
sourceFile.scriptSnapshot = scriptSnapshot;
|
|
}
|
|
/*
|
|
* This function will compile source text from 'input' argument using specified compiler options.
|
|
* If not options are provided - it will use a set of default compiler options.
|
|
* Extra compiler options that will unconditionally be used bu this function are:
|
|
* - isolatedModules = true
|
|
* - allowNonTsExtensions = true
|
|
* - noLib = true
|
|
* - noResolve = true
|
|
*/
|
|
function transpile(input, compilerOptions, fileName, diagnostics, moduleName) {
|
|
var options = compilerOptions ? ts.clone(compilerOptions) : getDefaultCompilerOptions();
|
|
options.isolatedModules = true;
|
|
// Filename can be non-ts file.
|
|
options.allowNonTsExtensions = true;
|
|
// 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.
|
|
options.noLib = true;
|
|
// We are not doing a full typecheck, we are not resolving the whole context,
|
|
// so pass --noResolve to avoid reporting missing file errors.
|
|
options.noResolve = true;
|
|
// Parse
|
|
var inputFileName = fileName || "module.ts";
|
|
var sourceFile = ts.createSourceFile(inputFileName, input, options.target);
|
|
if (moduleName) {
|
|
sourceFile.moduleName = moduleName;
|
|
}
|
|
var newLine = ts.getNewLineCharacter(options);
|
|
// Output
|
|
var outputText;
|
|
// Create a compilerHost object to allow the compiler to read and write files
|
|
var compilerHost = {
|
|
getSourceFile: function (fileName, target) { return fileName === inputFileName ? sourceFile : undefined; },
|
|
writeFile: function (name, text, writeByteOrderMark) {
|
|
ts.Debug.assert(outputText === undefined, "Unexpected multiple outputs for the file: " + name);
|
|
outputText = text;
|
|
},
|
|
getDefaultLibFileName: function () { return "lib.d.ts"; },
|
|
useCaseSensitiveFileNames: function () { return false; },
|
|
getCanonicalFileName: function (fileName) { return fileName; },
|
|
getCurrentDirectory: function () { return ""; },
|
|
getNewLine: function () { return newLine; }
|
|
};
|
|
var program = ts.createProgram([inputFileName], options, compilerHost);
|
|
ts.addRange(diagnostics, program.getSyntacticDiagnostics(sourceFile));
|
|
ts.addRange(diagnostics, program.getOptionsDiagnostics());
|
|
// Emit
|
|
program.emit();
|
|
ts.Debug.assert(outputText !== undefined, "Output generation failed");
|
|
return outputText;
|
|
}
|
|
ts.transpile = transpile;
|
|
function createLanguageServiceSourceFile(fileName, scriptSnapshot, scriptTarget, version, setNodeParents) {
|
|
var text = scriptSnapshot.getText(0, scriptSnapshot.getLength());
|
|
var sourceFile = ts.createSourceFile(fileName, text, scriptTarget, setNodeParents);
|
|
setSourceFileFields(sourceFile, scriptSnapshot, version);
|
|
// after full parsing we can use table with interned strings as name table
|
|
sourceFile.nameTable = sourceFile.identifiers;
|
|
return sourceFile;
|
|
}
|
|
ts.createLanguageServiceSourceFile = createLanguageServiceSourceFile;
|
|
ts.disableIncrementalParsing = false;
|
|
function updateLanguageServiceSourceFile(sourceFile, scriptSnapshot, version, textChangeRange, aggressiveChecks) {
|
|
// If we were given a text change range, and our version or open-ness changed, then
|
|
// incrementally parse this file.
|
|
if (textChangeRange) {
|
|
if (version !== sourceFile.version) {
|
|
// Once incremental parsing is ready, then just call into this function.
|
|
if (!ts.disableIncrementalParsing) {
|
|
var newText;
|
|
// grab the fragment from the beginning of the original text to the beginning of the span
|
|
var prefix = textChangeRange.span.start !== 0
|
|
? sourceFile.text.substr(0, textChangeRange.span.start)
|
|
: "";
|
|
// grab the fragment from the end of the span till the end of the original text
|
|
var suffix = ts.textSpanEnd(textChangeRange.span) !== sourceFile.text.length
|
|
? sourceFile.text.substr(ts.textSpanEnd(textChangeRange.span))
|
|
: "";
|
|
if (textChangeRange.newLength === 0) {
|
|
// edit was a deletion - just combine prefix and suffix
|
|
newText = prefix && suffix ? prefix + suffix : prefix || suffix;
|
|
}
|
|
else {
|
|
// it was actual edit, fetch the fragment of new text that correspond to new span
|
|
var changedText = scriptSnapshot.getText(textChangeRange.span.start, textChangeRange.span.start + textChangeRange.newLength);
|
|
// combine prefix, changed text and suffix
|
|
newText = prefix && suffix
|
|
? prefix + changedText + suffix
|
|
: prefix
|
|
? (prefix + changedText)
|
|
: (changedText + suffix);
|
|
}
|
|
var newSourceFile = ts.updateSourceFile(sourceFile, newText, textChangeRange, aggressiveChecks);
|
|
setSourceFileFields(newSourceFile, scriptSnapshot, version);
|
|
// after incremental parsing nameTable might not be up-to-date
|
|
// drop it so it can be lazily recreated later
|
|
newSourceFile.nameTable = undefined;
|
|
// dispose all resources held by old script snapshot
|
|
if (sourceFile !== newSourceFile && sourceFile.scriptSnapshot) {
|
|
if (sourceFile.scriptSnapshot.dispose) {
|
|
sourceFile.scriptSnapshot.dispose();
|
|
}
|
|
sourceFile.scriptSnapshot = undefined;
|
|
}
|
|
return newSourceFile;
|
|
}
|
|
}
|
|
}
|
|
// Otherwise, just create a new source file.
|
|
return createLanguageServiceSourceFile(sourceFile.fileName, scriptSnapshot, sourceFile.languageVersion, version, true);
|
|
}
|
|
ts.updateLanguageServiceSourceFile = updateLanguageServiceSourceFile;
|
|
function createGetCanonicalFileName(useCaseSensitivefileNames) {
|
|
return useCaseSensitivefileNames
|
|
? (function (fileName) { return fileName; })
|
|
: (function (fileName) { return fileName.toLowerCase(); });
|
|
}
|
|
function createDocumentRegistry(useCaseSensitiveFileNames) {
|
|
// Maps from compiler setting target (ES3, ES5, etc.) to all the cached documents we have
|
|
// for those settings.
|
|
var buckets = {};
|
|
var getCanonicalFileName = createGetCanonicalFileName(!!useCaseSensitiveFileNames);
|
|
function getKeyFromCompilationSettings(settings) {
|
|
return "_" + settings.target; // + "|" + settings.propagateEnumConstantoString()
|
|
}
|
|
function getBucketForCompilationSettings(settings, createIfMissing) {
|
|
var key = getKeyFromCompilationSettings(settings);
|
|
var bucket = ts.lookUp(buckets, key);
|
|
if (!bucket && createIfMissing) {
|
|
buckets[key] = bucket = ts.createFileMap(getCanonicalFileName);
|
|
}
|
|
return bucket;
|
|
}
|
|
function reportStats() {
|
|
var bucketInfoArray = Object.keys(buckets).filter(function (name) { return name && name.charAt(0) === '_'; }).map(function (name) {
|
|
var entries = ts.lookUp(buckets, name);
|
|
var sourceFiles = [];
|
|
for (var i in entries) {
|
|
var entry = entries.get(i);
|
|
sourceFiles.push({
|
|
name: i,
|
|
refCount: entry.languageServiceRefCount,
|
|
references: entry.owners.slice(0)
|
|
});
|
|
}
|
|
sourceFiles.sort(function (x, y) { return y.refCount - x.refCount; });
|
|
return {
|
|
bucket: name,
|
|
sourceFiles: sourceFiles
|
|
};
|
|
});
|
|
return JSON.stringify(bucketInfoArray, null, 2);
|
|
}
|
|
function acquireDocument(fileName, compilationSettings, scriptSnapshot, version) {
|
|
return acquireOrUpdateDocument(fileName, compilationSettings, scriptSnapshot, version, true);
|
|
}
|
|
function updateDocument(fileName, compilationSettings, scriptSnapshot, version) {
|
|
return acquireOrUpdateDocument(fileName, compilationSettings, scriptSnapshot, version, false);
|
|
}
|
|
function acquireOrUpdateDocument(fileName, compilationSettings, scriptSnapshot, version, acquiring) {
|
|
var bucket = getBucketForCompilationSettings(compilationSettings, true);
|
|
var entry = bucket.get(fileName);
|
|
if (!entry) {
|
|
ts.Debug.assert(acquiring, "How could we be trying to update a document that the registry doesn't have?");
|
|
// Have never seen this file with these settings. Create a new source file for it.
|
|
var sourceFile = createLanguageServiceSourceFile(fileName, scriptSnapshot, compilationSettings.target, version, false);
|
|
entry = {
|
|
sourceFile: sourceFile,
|
|
languageServiceRefCount: 0,
|
|
owners: []
|
|
};
|
|
bucket.set(fileName, entry);
|
|
}
|
|
else {
|
|
// We have an entry for this file. However, it may be for a different version of
|
|
// the script snapshot. If so, update it appropriately. Otherwise, we can just
|
|
// return it as is.
|
|
if (entry.sourceFile.version !== version) {
|
|
entry.sourceFile = updateLanguageServiceSourceFile(entry.sourceFile, scriptSnapshot, version, scriptSnapshot.getChangeRange(entry.sourceFile.scriptSnapshot));
|
|
}
|
|
}
|
|
// If we're acquiring, then this is the first time this LS is asking for this document.
|
|
// Increase our ref count so we know there's another LS using the document. If we're
|
|
// not acquiring, then that means the LS is 'updating' the file instead, and that means
|
|
// it has already acquired the document previously. As such, we do not need to increase
|
|
// the ref count.
|
|
if (acquiring) {
|
|
entry.languageServiceRefCount++;
|
|
}
|
|
return entry.sourceFile;
|
|
}
|
|
function releaseDocument(fileName, compilationSettings) {
|
|
var bucket = getBucketForCompilationSettings(compilationSettings, false);
|
|
ts.Debug.assert(bucket !== undefined);
|
|
var entry = bucket.get(fileName);
|
|
entry.languageServiceRefCount--;
|
|
ts.Debug.assert(entry.languageServiceRefCount >= 0);
|
|
if (entry.languageServiceRefCount === 0) {
|
|
bucket.remove(fileName);
|
|
}
|
|
}
|
|
return {
|
|
acquireDocument: acquireDocument,
|
|
updateDocument: updateDocument,
|
|
releaseDocument: releaseDocument,
|
|
reportStats: reportStats
|
|
};
|
|
}
|
|
ts.createDocumentRegistry = createDocumentRegistry;
|
|
function preProcessFile(sourceText, readImportFiles) {
|
|
if (readImportFiles === void 0) { readImportFiles = true; }
|
|
var referencedFiles = [];
|
|
var importedFiles = [];
|
|
var isNoDefaultLib = false;
|
|
function processTripleSlashDirectives() {
|
|
var commentRanges = ts.getLeadingCommentRanges(sourceText, 0);
|
|
ts.forEach(commentRanges, function (commentRange) {
|
|
var comment = sourceText.substring(commentRange.pos, commentRange.end);
|
|
var referencePathMatchResult = ts.getFileReferenceFromReferencePath(comment, commentRange);
|
|
if (referencePathMatchResult) {
|
|
isNoDefaultLib = referencePathMatchResult.isNoDefaultLib;
|
|
var fileReference = referencePathMatchResult.fileReference;
|
|
if (fileReference) {
|
|
referencedFiles.push(fileReference);
|
|
}
|
|
}
|
|
});
|
|
}
|
|
function recordModuleName() {
|
|
var importPath = scanner.getTokenValue();
|
|
var pos = scanner.getTokenPos();
|
|
importedFiles.push({
|
|
fileName: importPath,
|
|
pos: pos,
|
|
end: pos + importPath.length
|
|
});
|
|
}
|
|
function processImport() {
|
|
scanner.setText(sourceText);
|
|
var token = scanner.scan();
|
|
// Look for:
|
|
// import "mod";
|
|
// import d from "mod"
|
|
// import {a as A } from "mod";
|
|
// import * as NS from "mod"
|
|
// import d, {a, b as B} from "mod"
|
|
// import i = require("mod");
|
|
//
|
|
// export * from "mod"
|
|
// export {a as b} from "mod"
|
|
while (token !== 1 /* EndOfFileToken */) {
|
|
if (token === 86 /* ImportKeyword */) {
|
|
token = scanner.scan();
|
|
if (token === 8 /* StringLiteral */) {
|
|
// import "mod";
|
|
recordModuleName();
|
|
continue;
|
|
}
|
|
else {
|
|
if (token === 66 /* Identifier */) {
|
|
token = scanner.scan();
|
|
if (token === 130 /* FromKeyword */) {
|
|
token = scanner.scan();
|
|
if (token === 8 /* StringLiteral */) {
|
|
// import d from "mod";
|
|
recordModuleName();
|
|
continue;
|
|
}
|
|
}
|
|
else if (token === 54 /* EqualsToken */) {
|
|
token = scanner.scan();
|
|
if (token === 124 /* RequireKeyword */) {
|
|
token = scanner.scan();
|
|
if (token === 16 /* OpenParenToken */) {
|
|
token = scanner.scan();
|
|
if (token === 8 /* StringLiteral */) {
|
|
// import i = require("mod");
|
|
recordModuleName();
|
|
continue;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (token === 23 /* CommaToken */) {
|
|
// consume comma and keep going
|
|
token = scanner.scan();
|
|
}
|
|
else {
|
|
// unknown syntax
|
|
continue;
|
|
}
|
|
}
|
|
if (token === 14 /* OpenBraceToken */) {
|
|
token = scanner.scan();
|
|
// consume "{ a as B, c, d as D}" clauses
|
|
while (token !== 15 /* CloseBraceToken */) {
|
|
token = scanner.scan();
|
|
}
|
|
if (token === 15 /* CloseBraceToken */) {
|
|
token = scanner.scan();
|
|
if (token === 130 /* FromKeyword */) {
|
|
token = scanner.scan();
|
|
if (token === 8 /* StringLiteral */) {
|
|
// import {a as A} from "mod";
|
|
// import d, {a, b as B} from "mod"
|
|
recordModuleName();
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (token === 36 /* AsteriskToken */) {
|
|
token = scanner.scan();
|
|
if (token === 113 /* AsKeyword */) {
|
|
token = scanner.scan();
|
|
if (token === 66 /* Identifier */) {
|
|
token = scanner.scan();
|
|
if (token === 130 /* FromKeyword */) {
|
|
token = scanner.scan();
|
|
if (token === 8 /* StringLiteral */) {
|
|
// import * as NS from "mod"
|
|
// import d, * as NS from "mod"
|
|
recordModuleName();
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (token === 79 /* ExportKeyword */) {
|
|
token = scanner.scan();
|
|
if (token === 14 /* OpenBraceToken */) {
|
|
token = scanner.scan();
|
|
// consume "{ a as B, c, d as D}" clauses
|
|
while (token !== 15 /* CloseBraceToken */) {
|
|
token = scanner.scan();
|
|
}
|
|
if (token === 15 /* CloseBraceToken */) {
|
|
token = scanner.scan();
|
|
if (token === 130 /* FromKeyword */) {
|
|
token = scanner.scan();
|
|
if (token === 8 /* StringLiteral */) {
|
|
// export {a as A} from "mod";
|
|
// export {a, b as B} from "mod"
|
|
recordModuleName();
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (token === 36 /* AsteriskToken */) {
|
|
token = scanner.scan();
|
|
if (token === 130 /* FromKeyword */) {
|
|
token = scanner.scan();
|
|
if (token === 8 /* StringLiteral */) {
|
|
// export * from "mod"
|
|
recordModuleName();
|
|
}
|
|
}
|
|
}
|
|
}
|
|
token = scanner.scan();
|
|
}
|
|
scanner.setText(undefined);
|
|
}
|
|
if (readImportFiles) {
|
|
processImport();
|
|
}
|
|
processTripleSlashDirectives();
|
|
return { referencedFiles: referencedFiles, importedFiles: importedFiles, isLibFile: isNoDefaultLib };
|
|
}
|
|
ts.preProcessFile = preProcessFile;
|
|
/// Helpers
|
|
function getTargetLabel(referenceNode, labelName) {
|
|
while (referenceNode) {
|
|
if (referenceNode.kind === 204 /* LabeledStatement */ && referenceNode.label.text === labelName) {
|
|
return referenceNode.label;
|
|
}
|
|
referenceNode = referenceNode.parent;
|
|
}
|
|
return undefined;
|
|
}
|
|
function isJumpStatementTarget(node) {
|
|
return node.kind === 66 /* Identifier */ &&
|
|
(node.parent.kind === 200 /* BreakStatement */ || node.parent.kind === 199 /* ContinueStatement */) &&
|
|
node.parent.label === node;
|
|
}
|
|
function isLabelOfLabeledStatement(node) {
|
|
return node.kind === 66 /* Identifier */ &&
|
|
node.parent.kind === 204 /* LabeledStatement */ &&
|
|
node.parent.label === node;
|
|
}
|
|
/**
|
|
* Whether or not a 'node' is preceded by a label of the given string.
|
|
* Note: 'node' cannot be a SourceFile.
|
|
*/
|
|
function isLabeledBy(node, labelName) {
|
|
for (var owner = node.parent; owner.kind === 204 /* LabeledStatement */; owner = owner.parent) {
|
|
if (owner.label.text === labelName) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function isLabelName(node) {
|
|
return isLabelOfLabeledStatement(node) || isJumpStatementTarget(node);
|
|
}
|
|
function isRightSideOfQualifiedName(node) {
|
|
return node.parent.kind === 132 /* QualifiedName */ && node.parent.right === node;
|
|
}
|
|
function isRightSideOfPropertyAccess(node) {
|
|
return node && node.parent && node.parent.kind === 163 /* PropertyAccessExpression */ && node.parent.name === node;
|
|
}
|
|
function isCallExpressionTarget(node) {
|
|
if (isRightSideOfPropertyAccess(node)) {
|
|
node = node.parent;
|
|
}
|
|
return node && node.parent && node.parent.kind === 165 /* CallExpression */ && node.parent.expression === node;
|
|
}
|
|
function isNewExpressionTarget(node) {
|
|
if (isRightSideOfPropertyAccess(node)) {
|
|
node = node.parent;
|
|
}
|
|
return node && node.parent && node.parent.kind === 166 /* NewExpression */ && node.parent.expression === node;
|
|
}
|
|
function isNameOfModuleDeclaration(node) {
|
|
return node.parent.kind === 215 /* ModuleDeclaration */ && node.parent.name === node;
|
|
}
|
|
function isNameOfFunctionDeclaration(node) {
|
|
return node.kind === 66 /* Identifier */ &&
|
|
ts.isFunctionLike(node.parent) && node.parent.name === node;
|
|
}
|
|
/** Returns true if node is a name of an object literal property, e.g. "a" in x = { "a": 1 } */
|
|
function isNameOfPropertyAssignment(node) {
|
|
return (node.kind === 66 /* Identifier */ || node.kind === 8 /* StringLiteral */ || node.kind === 7 /* NumericLiteral */) &&
|
|
(node.parent.kind === 242 /* PropertyAssignment */ || node.parent.kind === 243 /* ShorthandPropertyAssignment */) && node.parent.name === node;
|
|
}
|
|
function isLiteralNameOfPropertyDeclarationOrIndexAccess(node) {
|
|
if (node.kind === 8 /* StringLiteral */ || node.kind === 7 /* NumericLiteral */) {
|
|
switch (node.parent.kind) {
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 242 /* PropertyAssignment */:
|
|
case 244 /* EnumMember */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 215 /* ModuleDeclaration */:
|
|
return node.parent.name === node;
|
|
case 164 /* ElementAccessExpression */:
|
|
return node.parent.argumentExpression === node;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function isNameOfExternalModuleImportOrDeclaration(node) {
|
|
if (node.kind === 8 /* StringLiteral */) {
|
|
return isNameOfModuleDeclaration(node) ||
|
|
(ts.isExternalModuleImportEqualsDeclaration(node.parent.parent) && ts.getExternalModuleImportEqualsDeclarationExpression(node.parent.parent) === node);
|
|
}
|
|
return false;
|
|
}
|
|
/** Returns true if the position is within a comment */
|
|
function isInsideComment(sourceFile, token, position) {
|
|
// The position has to be: 1. in the leading trivia (before token.getStart()), and 2. within a comment
|
|
return position <= token.getStart(sourceFile) &&
|
|
(isInsideCommentRange(ts.getTrailingCommentRanges(sourceFile.text, token.getFullStart())) ||
|
|
isInsideCommentRange(ts.getLeadingCommentRanges(sourceFile.text, token.getFullStart())));
|
|
function isInsideCommentRange(comments) {
|
|
return ts.forEach(comments, function (comment) {
|
|
// either we are 1. completely inside the comment, or 2. at the end of the comment
|
|
if (comment.pos < position && position < comment.end) {
|
|
return true;
|
|
}
|
|
else if (position === comment.end) {
|
|
var text = sourceFile.text;
|
|
var width = comment.end - comment.pos;
|
|
// is single line comment or just /*
|
|
if (width <= 2 || text.charCodeAt(comment.pos + 1) === 47 /* slash */) {
|
|
return true;
|
|
}
|
|
else {
|
|
// is unterminated multi-line comment
|
|
return !(text.charCodeAt(comment.end - 1) === 47 /* slash */ &&
|
|
text.charCodeAt(comment.end - 2) === 42 /* asterisk */);
|
|
}
|
|
}
|
|
return false;
|
|
});
|
|
}
|
|
}
|
|
var SemanticMeaning;
|
|
(function (SemanticMeaning) {
|
|
SemanticMeaning[SemanticMeaning["None"] = 0] = "None";
|
|
SemanticMeaning[SemanticMeaning["Value"] = 1] = "Value";
|
|
SemanticMeaning[SemanticMeaning["Type"] = 2] = "Type";
|
|
SemanticMeaning[SemanticMeaning["Namespace"] = 4] = "Namespace";
|
|
SemanticMeaning[SemanticMeaning["All"] = 7] = "All";
|
|
})(SemanticMeaning || (SemanticMeaning = {}));
|
|
var BreakContinueSearchType;
|
|
(function (BreakContinueSearchType) {
|
|
BreakContinueSearchType[BreakContinueSearchType["None"] = 0] = "None";
|
|
BreakContinueSearchType[BreakContinueSearchType["Unlabeled"] = 1] = "Unlabeled";
|
|
BreakContinueSearchType[BreakContinueSearchType["Labeled"] = 2] = "Labeled";
|
|
BreakContinueSearchType[BreakContinueSearchType["All"] = 3] = "All";
|
|
})(BreakContinueSearchType || (BreakContinueSearchType = {}));
|
|
// A cache of completion entries for keywords, these do not change between sessions
|
|
var keywordCompletions = [];
|
|
for (var i = 67 /* FirstKeyword */; i <= 131 /* LastKeyword */; i++) {
|
|
keywordCompletions.push({
|
|
name: ts.tokenToString(i),
|
|
kind: ScriptElementKind.keyword,
|
|
kindModifiers: ScriptElementKindModifier.none,
|
|
sortText: "0"
|
|
});
|
|
}
|
|
/* @internal */ function getContainerNode(node) {
|
|
while (true) {
|
|
node = node.parent;
|
|
if (!node) {
|
|
return undefined;
|
|
}
|
|
switch (node.kind) {
|
|
case 245 /* SourceFile */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 215 /* ModuleDeclaration */:
|
|
return node;
|
|
}
|
|
}
|
|
}
|
|
ts.getContainerNode = getContainerNode;
|
|
/* @internal */ function getNodeKind(node) {
|
|
switch (node.kind) {
|
|
case 215 /* ModuleDeclaration */: return ScriptElementKind.moduleElement;
|
|
case 211 /* ClassDeclaration */: return ScriptElementKind.classElement;
|
|
case 212 /* InterfaceDeclaration */: return ScriptElementKind.interfaceElement;
|
|
case 213 /* TypeAliasDeclaration */: return ScriptElementKind.typeElement;
|
|
case 214 /* EnumDeclaration */: return ScriptElementKind.enumElement;
|
|
case 208 /* VariableDeclaration */:
|
|
return ts.isConst(node)
|
|
? ScriptElementKind.constElement
|
|
: ts.isLet(node)
|
|
? ScriptElementKind.letElement
|
|
: ScriptElementKind.variableElement;
|
|
case 210 /* FunctionDeclaration */: return ScriptElementKind.functionElement;
|
|
case 142 /* GetAccessor */: return ScriptElementKind.memberGetAccessorElement;
|
|
case 143 /* SetAccessor */: return ScriptElementKind.memberSetAccessorElement;
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
return ScriptElementKind.memberFunctionElement;
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
return ScriptElementKind.memberVariableElement;
|
|
case 146 /* IndexSignature */: return ScriptElementKind.indexSignatureElement;
|
|
case 145 /* ConstructSignature */: return ScriptElementKind.constructSignatureElement;
|
|
case 144 /* CallSignature */: return ScriptElementKind.callSignatureElement;
|
|
case 141 /* Constructor */: return ScriptElementKind.constructorImplementationElement;
|
|
case 134 /* TypeParameter */: return ScriptElementKind.typeParameterElement;
|
|
case 244 /* EnumMember */: return ScriptElementKind.variableElement;
|
|
case 135 /* Parameter */: return (node.flags & 112 /* AccessibilityModifier */) ? ScriptElementKind.memberVariableElement : ScriptElementKind.parameterElement;
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 223 /* ImportSpecifier */:
|
|
case 220 /* ImportClause */:
|
|
case 227 /* ExportSpecifier */:
|
|
case 221 /* NamespaceImport */:
|
|
return ScriptElementKind.alias;
|
|
}
|
|
return ScriptElementKind.unknown;
|
|
}
|
|
ts.getNodeKind = getNodeKind;
|
|
var CancellationTokenObject = (function () {
|
|
function CancellationTokenObject(cancellationToken) {
|
|
this.cancellationToken = cancellationToken;
|
|
}
|
|
CancellationTokenObject.prototype.isCancellationRequested = function () {
|
|
return this.cancellationToken && this.cancellationToken.isCancellationRequested();
|
|
};
|
|
CancellationTokenObject.prototype.throwIfCancellationRequested = function () {
|
|
if (this.isCancellationRequested()) {
|
|
throw new ts.OperationCanceledException();
|
|
}
|
|
};
|
|
return CancellationTokenObject;
|
|
})();
|
|
function createLanguageService(host, documentRegistry) {
|
|
if (documentRegistry === void 0) { documentRegistry = createDocumentRegistry(); }
|
|
var syntaxTreeCache = new SyntaxTreeCache(host);
|
|
var ruleProvider;
|
|
var program;
|
|
var lastProjectVersion;
|
|
var useCaseSensitivefileNames = false;
|
|
var cancellationToken = new CancellationTokenObject(host.getCancellationToken && host.getCancellationToken());
|
|
// Check if the localized messages json is set, otherwise query the host for it
|
|
if (!ts.localizedDiagnosticMessages && host.getLocalizedDiagnosticMessages) {
|
|
ts.localizedDiagnosticMessages = host.getLocalizedDiagnosticMessages();
|
|
}
|
|
function log(message) {
|
|
if (host.log) {
|
|
host.log(message);
|
|
}
|
|
}
|
|
var getCanonicalFileName = createGetCanonicalFileName(useCaseSensitivefileNames);
|
|
function getValidSourceFile(fileName) {
|
|
fileName = ts.normalizeSlashes(fileName);
|
|
var sourceFile = program.getSourceFile(getCanonicalFileName(fileName));
|
|
if (!sourceFile) {
|
|
throw new Error("Could not find file: '" + fileName + "'.");
|
|
}
|
|
return sourceFile;
|
|
}
|
|
function getRuleProvider(options) {
|
|
// Ensure rules are initialized and up to date wrt to formatting options
|
|
if (!ruleProvider) {
|
|
ruleProvider = new ts.formatting.RulesProvider();
|
|
}
|
|
ruleProvider.ensureUpToDate(options);
|
|
return ruleProvider;
|
|
}
|
|
function synchronizeHostData() {
|
|
// perform fast check if host supports it
|
|
if (host.getProjectVersion) {
|
|
var hostProjectVersion = host.getProjectVersion();
|
|
if (hostProjectVersion) {
|
|
if (lastProjectVersion === hostProjectVersion) {
|
|
return;
|
|
}
|
|
lastProjectVersion = hostProjectVersion;
|
|
}
|
|
}
|
|
// Get a fresh cache of the host information
|
|
var hostCache = new HostCache(host, getCanonicalFileName);
|
|
// If the program is already up-to-date, we can reuse it
|
|
if (programUpToDate()) {
|
|
return;
|
|
}
|
|
// IMPORTANT - It is critical from this moment onward that we do not check
|
|
// cancellation tokens. We are about to mutate source files from a previous program
|
|
// instance. If we cancel midway through, we may end up in an inconsistent state where
|
|
// the program points to old source files that have been invalidated because of
|
|
// incremental parsing.
|
|
var oldSettings = program && program.getCompilerOptions();
|
|
var newSettings = hostCache.compilationSettings();
|
|
var changesInCompilationSettingsAffectSyntax = oldSettings && oldSettings.target !== newSettings.target;
|
|
// Now create a new compiler
|
|
var newProgram = ts.createProgram(hostCache.getRootFileNames(), newSettings, {
|
|
getSourceFile: getOrCreateSourceFile,
|
|
getCancellationToken: function () { return cancellationToken; },
|
|
getCanonicalFileName: getCanonicalFileName,
|
|
useCaseSensitiveFileNames: function () { return useCaseSensitivefileNames; },
|
|
getNewLine: function () { return host.getNewLine ? host.getNewLine() : "\r\n"; },
|
|
getDefaultLibFileName: function (options) { return host.getDefaultLibFileName(options); },
|
|
writeFile: function (fileName, data, writeByteOrderMark) { },
|
|
getCurrentDirectory: function () { return host.getCurrentDirectory(); }
|
|
});
|
|
// Release any files we have acquired in the old program but are
|
|
// not part of the new program.
|
|
if (program) {
|
|
var oldSourceFiles = program.getSourceFiles();
|
|
for (var _i = 0; _i < oldSourceFiles.length; _i++) {
|
|
var oldSourceFile = oldSourceFiles[_i];
|
|
var fileName = oldSourceFile.fileName;
|
|
if (!newProgram.getSourceFile(fileName) || changesInCompilationSettingsAffectSyntax) {
|
|
documentRegistry.releaseDocument(fileName, oldSettings);
|
|
}
|
|
}
|
|
}
|
|
// hostCache is captured in the closure for 'getOrCreateSourceFile' but it should not be used past this point.
|
|
// It needs to be cleared to allow all collected snapshots to be released
|
|
hostCache = undefined;
|
|
program = newProgram;
|
|
// Make sure all the nodes in the program are both bound, and have their parent
|
|
// pointers set property.
|
|
program.getTypeChecker();
|
|
return;
|
|
function getOrCreateSourceFile(fileName) {
|
|
ts.Debug.assert(hostCache !== undefined);
|
|
// The program is asking for this file, check first if the host can locate it.
|
|
// If the host can not locate the file, then it does not exist. return undefined
|
|
// to the program to allow reporting of errors for missing files.
|
|
var hostFileInformation = hostCache.getOrCreateEntry(fileName);
|
|
if (!hostFileInformation) {
|
|
return undefined;
|
|
}
|
|
// Check if the language version has changed since we last created a program; if they are the same,
|
|
// it is safe to reuse the souceFiles; if not, then the shape of the AST can change, and the oldSourceFile
|
|
// can not be reused. we have to dump all syntax trees and create new ones.
|
|
if (!changesInCompilationSettingsAffectSyntax) {
|
|
// Check if the old program had this file already
|
|
var oldSourceFile = program && program.getSourceFile(fileName);
|
|
if (oldSourceFile) {
|
|
// We already had a source file for this file name. Go to the registry to
|
|
// ensure that we get the right up to date version of it. We need this to
|
|
// address the following 'race'. Specifically, say we have the following:
|
|
//
|
|
// LS1
|
|
// \
|
|
// DocumentRegistry
|
|
// /
|
|
// LS2
|
|
//
|
|
// Each LS has a reference to file 'foo.ts' at version 1. LS2 then updates
|
|
// it's version of 'foo.ts' to version 2. This will cause LS2 and the
|
|
// DocumentRegistry to have version 2 of the document. HOwever, LS1 will
|
|
// have version 1. And *importantly* this source file will be *corrupt*.
|
|
// The act of creating version 2 of the file irrevocably damages the version
|
|
// 1 file.
|
|
//
|
|
// So, later when we call into LS1, we need to make sure that it doesn't use
|
|
// it's source file any more, and instead defers to DocumentRegistry to get
|
|
// either version 1, version 2 (or some other version) depending on what the
|
|
// host says should be used.
|
|
return documentRegistry.updateDocument(fileName, newSettings, hostFileInformation.scriptSnapshot, hostFileInformation.version);
|
|
}
|
|
}
|
|
// Could not find this file in the old program, create a new SourceFile for it.
|
|
return documentRegistry.acquireDocument(fileName, newSettings, hostFileInformation.scriptSnapshot, hostFileInformation.version);
|
|
}
|
|
function sourceFileUpToDate(sourceFile) {
|
|
return sourceFile && sourceFile.version === hostCache.getVersion(sourceFile.fileName);
|
|
}
|
|
function programUpToDate() {
|
|
// If we haven't create a program yet, then it is not up-to-date
|
|
if (!program) {
|
|
return false;
|
|
}
|
|
// If number of files in the program do not match, it is not up-to-date
|
|
var rootFileNames = hostCache.getRootFileNames();
|
|
if (program.getSourceFiles().length !== rootFileNames.length) {
|
|
return false;
|
|
}
|
|
// If any file is not up-to-date, then the whole program is not up-to-date
|
|
for (var _i = 0; _i < rootFileNames.length; _i++) {
|
|
var fileName = rootFileNames[_i];
|
|
if (!sourceFileUpToDate(program.getSourceFile(fileName))) {
|
|
return false;
|
|
}
|
|
}
|
|
// If the compilation settings do no match, then the program is not up-to-date
|
|
return ts.compareDataObjects(program.getCompilerOptions(), hostCache.compilationSettings());
|
|
}
|
|
}
|
|
function getProgram() {
|
|
synchronizeHostData();
|
|
return program;
|
|
}
|
|
function cleanupSemanticCache() {
|
|
// TODO: Should we jettison the program (or it's type checker) here?
|
|
}
|
|
function dispose() {
|
|
if (program) {
|
|
ts.forEach(program.getSourceFiles(), function (f) {
|
|
return documentRegistry.releaseDocument(f.fileName, program.getCompilerOptions());
|
|
});
|
|
}
|
|
}
|
|
/// Diagnostics
|
|
function getSyntacticDiagnostics(fileName) {
|
|
synchronizeHostData();
|
|
return program.getSyntacticDiagnostics(getValidSourceFile(fileName), cancellationToken);
|
|
}
|
|
/**
|
|
* getSemanticDiagnostiscs return array of Diagnostics. If '-d' is not enabled, only report semantic errors
|
|
* If '-d' enabled, report both semantic and emitter errors
|
|
*/
|
|
function getSemanticDiagnostics(fileName) {
|
|
synchronizeHostData();
|
|
var targetSourceFile = getValidSourceFile(fileName);
|
|
// For JavaScript files, we don't want to report the normal typescript semantic errors.
|
|
// Instead, we just report errors for using TypeScript-only constructs from within a
|
|
// JavaScript file.
|
|
if (ts.isJavaScript(fileName)) {
|
|
return getJavaScriptSemanticDiagnostics(targetSourceFile);
|
|
}
|
|
// Only perform the action per file regardless of '-out' flag as LanguageServiceHost is expected to call this function per file.
|
|
// Therefore only get diagnostics for given file.
|
|
var semanticDiagnostics = program.getSemanticDiagnostics(targetSourceFile, cancellationToken);
|
|
if (!program.getCompilerOptions().declaration) {
|
|
return semanticDiagnostics;
|
|
}
|
|
// If '-d' is enabled, check for emitter error. One example of emitter error is export class implements non-export interface
|
|
var declarationDiagnostics = program.getDeclarationDiagnostics(targetSourceFile, cancellationToken);
|
|
return ts.concatenate(semanticDiagnostics, declarationDiagnostics);
|
|
}
|
|
function getJavaScriptSemanticDiagnostics(sourceFile) {
|
|
var diagnostics = [];
|
|
walk(sourceFile);
|
|
return diagnostics;
|
|
function walk(node) {
|
|
if (!node) {
|
|
return false;
|
|
}
|
|
switch (node.kind) {
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
diagnostics.push(ts.createDiagnosticForNode(node, ts.Diagnostics.import_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
case 224 /* ExportAssignment */:
|
|
diagnostics.push(ts.createDiagnosticForNode(node, ts.Diagnostics.export_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
case 211 /* ClassDeclaration */:
|
|
var classDeclaration = node;
|
|
if (checkModifiers(classDeclaration.modifiers) ||
|
|
checkTypeParameters(classDeclaration.typeParameters)) {
|
|
return true;
|
|
}
|
|
break;
|
|
case 240 /* HeritageClause */:
|
|
var heritageClause = node;
|
|
if (heritageClause.token === 103 /* ImplementsKeyword */) {
|
|
diagnostics.push(ts.createDiagnosticForNode(node, ts.Diagnostics.implements_clauses_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
}
|
|
break;
|
|
case 212 /* InterfaceDeclaration */:
|
|
diagnostics.push(ts.createDiagnosticForNode(node, ts.Diagnostics.interface_declarations_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
case 215 /* ModuleDeclaration */:
|
|
diagnostics.push(ts.createDiagnosticForNode(node, ts.Diagnostics.module_declarations_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
case 213 /* TypeAliasDeclaration */:
|
|
diagnostics.push(ts.createDiagnosticForNode(node, ts.Diagnostics.type_aliases_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 141 /* Constructor */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 170 /* FunctionExpression */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 171 /* ArrowFunction */:
|
|
case 210 /* FunctionDeclaration */:
|
|
var functionDeclaration = node;
|
|
if (checkModifiers(functionDeclaration.modifiers) ||
|
|
checkTypeParameters(functionDeclaration.typeParameters) ||
|
|
checkTypeAnnotation(functionDeclaration.type)) {
|
|
return true;
|
|
}
|
|
break;
|
|
case 190 /* VariableStatement */:
|
|
var variableStatement = node;
|
|
if (checkModifiers(variableStatement.modifiers)) {
|
|
return true;
|
|
}
|
|
break;
|
|
case 208 /* VariableDeclaration */:
|
|
var variableDeclaration = node;
|
|
if (checkTypeAnnotation(variableDeclaration.type)) {
|
|
return true;
|
|
}
|
|
break;
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
var expression = node;
|
|
if (expression.typeArguments && expression.typeArguments.length > 0) {
|
|
var start = expression.typeArguments.pos;
|
|
diagnostics.push(ts.createFileDiagnostic(sourceFile, start, expression.typeArguments.end - start, ts.Diagnostics.type_arguments_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
}
|
|
break;
|
|
case 135 /* Parameter */:
|
|
var parameter = node;
|
|
if (parameter.modifiers) {
|
|
var start = parameter.modifiers.pos;
|
|
diagnostics.push(ts.createFileDiagnostic(sourceFile, start, parameter.modifiers.end - start, ts.Diagnostics.parameter_modifiers_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
}
|
|
if (parameter.questionToken) {
|
|
diagnostics.push(ts.createDiagnosticForNode(parameter.questionToken, ts.Diagnostics._0_can_only_be_used_in_a_ts_file, '?'));
|
|
return true;
|
|
}
|
|
if (parameter.type) {
|
|
diagnostics.push(ts.createDiagnosticForNode(parameter.type, ts.Diagnostics.types_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
}
|
|
break;
|
|
case 138 /* PropertyDeclaration */:
|
|
diagnostics.push(ts.createDiagnosticForNode(node, ts.Diagnostics.property_declarations_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
case 214 /* EnumDeclaration */:
|
|
diagnostics.push(ts.createDiagnosticForNode(node, ts.Diagnostics.enum_declarations_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
case 168 /* TypeAssertionExpression */:
|
|
var typeAssertionExpression = node;
|
|
diagnostics.push(ts.createDiagnosticForNode(typeAssertionExpression.type, ts.Diagnostics.type_assertion_expressions_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
case 136 /* Decorator */:
|
|
diagnostics.push(ts.createDiagnosticForNode(node, ts.Diagnostics.decorators_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
}
|
|
return ts.forEachChild(node, walk);
|
|
}
|
|
function checkTypeParameters(typeParameters) {
|
|
if (typeParameters) {
|
|
var start = typeParameters.pos;
|
|
diagnostics.push(ts.createFileDiagnostic(sourceFile, start, typeParameters.end - start, ts.Diagnostics.type_parameter_declarations_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function checkTypeAnnotation(type) {
|
|
if (type) {
|
|
diagnostics.push(ts.createDiagnosticForNode(type, ts.Diagnostics.types_can_only_be_used_in_a_ts_file));
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function checkModifiers(modifiers) {
|
|
if (modifiers) {
|
|
for (var _i = 0; _i < modifiers.length; _i++) {
|
|
var modifier = modifiers[_i];
|
|
switch (modifier.kind) {
|
|
case 109 /* PublicKeyword */:
|
|
case 107 /* PrivateKeyword */:
|
|
case 108 /* ProtectedKeyword */:
|
|
case 119 /* DeclareKeyword */:
|
|
diagnostics.push(ts.createDiagnosticForNode(modifier, ts.Diagnostics._0_can_only_be_used_in_a_ts_file, ts.tokenToString(modifier.kind)));
|
|
return true;
|
|
// These are all legal modifiers.
|
|
case 110 /* StaticKeyword */:
|
|
case 79 /* ExportKeyword */:
|
|
case 71 /* ConstKeyword */:
|
|
case 74 /* DefaultKeyword */:
|
|
case 112 /* AbstractKeyword */:
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
}
|
|
function getCompilerOptionsDiagnostics() {
|
|
synchronizeHostData();
|
|
return program.getOptionsDiagnostics(cancellationToken).concat(program.getGlobalDiagnostics(cancellationToken));
|
|
}
|
|
/**
|
|
* Get the name to be display in completion from a given symbol.
|
|
*
|
|
* @return undefined if the name is of external module otherwise a name with striped of any quote
|
|
*/
|
|
function getCompletionEntryDisplayNameForSymbol(symbol, target, performCharacterChecks, location) {
|
|
var displayName = ts.getDeclaredName(program.getTypeChecker(), symbol, location);
|
|
if (displayName) {
|
|
var firstCharCode = displayName.charCodeAt(0);
|
|
// First check of the displayName is not external module; if it is an external module, it is not valid entry
|
|
if ((symbol.flags & 1536 /* Namespace */) && (firstCharCode === 39 /* singleQuote */ || firstCharCode === 34 /* doubleQuote */)) {
|
|
// If the symbol is external module, don't show it in the completion list
|
|
// (i.e declare module "http" { let x; } | // <= request completion here, "http" should not be there)
|
|
return undefined;
|
|
}
|
|
}
|
|
return getCompletionEntryDisplayName(displayName, target, performCharacterChecks);
|
|
}
|
|
/**
|
|
* Get a displayName from a given for completion list, performing any necessary quotes stripping
|
|
* and checking whether the name is valid identifier name.
|
|
*/
|
|
function getCompletionEntryDisplayName(name, target, performCharacterChecks) {
|
|
if (!name) {
|
|
return undefined;
|
|
}
|
|
name = ts.stripQuotes(name);
|
|
if (!name) {
|
|
return undefined;
|
|
}
|
|
// If the user entered name for the symbol was quoted, removing the quotes is not enough, as the name could be an
|
|
// invalid identifier name. We need to check if whatever was inside the quotes is actually a valid identifier name.
|
|
// e.g "b a" is valid quoted name but when we strip off the quotes, it is invalid.
|
|
// We, thus, need to check if whatever was inside the quotes is actually a valid identifier name.
|
|
if (performCharacterChecks) {
|
|
if (!ts.isIdentifierStart(name.charCodeAt(0), target)) {
|
|
return undefined;
|
|
}
|
|
for (var i = 1, n = name.length; i < n; i++) {
|
|
if (!ts.isIdentifierPart(name.charCodeAt(i), target)) {
|
|
return undefined;
|
|
}
|
|
}
|
|
}
|
|
return name;
|
|
}
|
|
function getCompletionData(fileName, position) {
|
|
var typeChecker = program.getTypeChecker();
|
|
var syntacticStart = new Date().getTime();
|
|
var sourceFile = getValidSourceFile(fileName);
|
|
var isJavaScriptFile = ts.isJavaScript(fileName);
|
|
var start = new Date().getTime();
|
|
var currentToken = ts.getTokenAtPosition(sourceFile, position);
|
|
log("getCompletionData: Get current token: " + (new Date().getTime() - start));
|
|
start = new Date().getTime();
|
|
// Completion not allowed inside comments, bail out if this is the case
|
|
var insideComment = isInsideComment(sourceFile, currentToken, position);
|
|
log("getCompletionData: Is inside comment: " + (new Date().getTime() - start));
|
|
if (insideComment) {
|
|
log("Returning an empty list because completion was inside a comment.");
|
|
return undefined;
|
|
}
|
|
start = new Date().getTime();
|
|
var previousToken = ts.findPrecedingToken(position, sourceFile);
|
|
log("getCompletionData: Get previous token 1: " + (new Date().getTime() - start));
|
|
// The decision to provide completion depends on the contextToken, which is determined through the previousToken.
|
|
// Note: 'previousToken' (and thus 'contextToken') can be undefined if we are the beginning of the file
|
|
var contextToken = previousToken;
|
|
// Check if the caret is at the end of an identifier; this is a partial identifier that we want to complete: e.g. a.toS|
|
|
// Skip this partial identifier and adjust the contextToken to the token that precedes it.
|
|
if (contextToken && position <= contextToken.end && ts.isWord(contextToken.kind)) {
|
|
var start_2 = new Date().getTime();
|
|
contextToken = ts.findPrecedingToken(contextToken.getFullStart(), sourceFile);
|
|
log("getCompletionData: Get previous token 2: " + (new Date().getTime() - start_2));
|
|
}
|
|
// Find the node where completion is requested on.
|
|
// Also determine whether we are trying to complete with members of that node
|
|
// or attributes of a JSX tag.
|
|
var node = currentToken;
|
|
var isRightOfDot = false;
|
|
var isRightOfOpenTag = false;
|
|
var location = ts.getTouchingPropertyName(sourceFile, position);
|
|
if (contextToken) {
|
|
// Bail out if this is a known invalid completion location
|
|
if (isCompletionListBlocker(contextToken)) {
|
|
log("Returning an empty list because completion was requested in an invalid position.");
|
|
return undefined;
|
|
}
|
|
var parent_10 = contextToken.parent, kind = contextToken.kind;
|
|
if (kind === 20 /* DotToken */) {
|
|
if (parent_10.kind === 163 /* PropertyAccessExpression */) {
|
|
node = contextToken.parent.expression;
|
|
isRightOfDot = true;
|
|
}
|
|
else if (parent_10.kind === 132 /* QualifiedName */) {
|
|
node = contextToken.parent.left;
|
|
isRightOfDot = true;
|
|
}
|
|
else {
|
|
// There is nothing that precedes the dot, so this likely just a stray character
|
|
// or leading into a '...' token. Just bail out instead.
|
|
return undefined;
|
|
}
|
|
}
|
|
else if (kind === 24 /* LessThanToken */ && sourceFile.languageVariant === 1 /* JSX */) {
|
|
isRightOfOpenTag = true;
|
|
location = contextToken;
|
|
}
|
|
}
|
|
var semanticStart = new Date().getTime();
|
|
var isMemberCompletion;
|
|
var isNewIdentifierLocation;
|
|
var symbols = [];
|
|
if (isRightOfDot) {
|
|
getTypeScriptMemberSymbols();
|
|
}
|
|
else if (isRightOfOpenTag) {
|
|
var tagSymbols = typeChecker.getJsxIntrinsicTagNames();
|
|
if (tryGetGlobalSymbols()) {
|
|
symbols = tagSymbols.concat(symbols.filter(function (s) { return !!(s.flags & 107455 /* Value */); }));
|
|
}
|
|
else {
|
|
symbols = tagSymbols;
|
|
}
|
|
isMemberCompletion = true;
|
|
isNewIdentifierLocation = false;
|
|
}
|
|
else {
|
|
// For JavaScript or TypeScript, if we're not after a dot, then just try to get the
|
|
// global symbols in scope. These results should be valid for either language as
|
|
// the set of symbols that can be referenced from this location.
|
|
if (!tryGetGlobalSymbols()) {
|
|
return undefined;
|
|
}
|
|
}
|
|
log("getCompletionData: Semantic work: " + (new Date().getTime() - semanticStart));
|
|
return { symbols: symbols, isMemberCompletion: isMemberCompletion, isNewIdentifierLocation: isNewIdentifierLocation, location: location, isRightOfDot: (isRightOfDot || isRightOfOpenTag) };
|
|
function getTypeScriptMemberSymbols() {
|
|
// Right of dot member completion list
|
|
isMemberCompletion = true;
|
|
isNewIdentifierLocation = false;
|
|
if (node.kind === 66 /* Identifier */ || node.kind === 132 /* QualifiedName */ || node.kind === 163 /* PropertyAccessExpression */) {
|
|
var symbol = typeChecker.getSymbolAtLocation(node);
|
|
// This is an alias, follow what it aliases
|
|
if (symbol && symbol.flags & 8388608 /* Alias */) {
|
|
symbol = typeChecker.getAliasedSymbol(symbol);
|
|
}
|
|
if (symbol && symbol.flags & 1952 /* HasExports */) {
|
|
// Extract module or enum members
|
|
var exportedSymbols = typeChecker.getExportsOfModule(symbol);
|
|
ts.forEach(exportedSymbols, function (symbol) {
|
|
if (typeChecker.isValidPropertyAccess((node.parent), symbol.name)) {
|
|
symbols.push(symbol);
|
|
}
|
|
});
|
|
}
|
|
}
|
|
var type = typeChecker.getTypeAtLocation(node);
|
|
addTypeProperties(type);
|
|
}
|
|
function addTypeProperties(type) {
|
|
if (type) {
|
|
// Filter private properties
|
|
for (var _i = 0, _a = type.getApparentProperties(); _i < _a.length; _i++) {
|
|
var symbol = _a[_i];
|
|
if (typeChecker.isValidPropertyAccess((node.parent), symbol.name)) {
|
|
symbols.push(symbol);
|
|
}
|
|
}
|
|
if (isJavaScriptFile && type.flags & 16384 /* Union */) {
|
|
// In javascript files, for union types, we don't just get the members that
|
|
// the individual types have in common, we also include all the members that
|
|
// each individual type has. This is because we're going to add all identifiers
|
|
// anyways. So we might as well elevate the members that were at least part
|
|
// of the individual types to a higher status since we know what they are.
|
|
var unionType = type;
|
|
for (var _b = 0, _c = unionType.types; _b < _c.length; _b++) {
|
|
var elementType = _c[_b];
|
|
addTypeProperties(elementType);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function tryGetGlobalSymbols() {
|
|
var objectLikeContainer;
|
|
var namedImportsOrExports;
|
|
var jsxContainer;
|
|
if (objectLikeContainer = tryGetObjectLikeCompletionContainer(contextToken)) {
|
|
return tryGetObjectLikeCompletionSymbols(objectLikeContainer);
|
|
}
|
|
if (namedImportsOrExports = tryGetNamedImportsOrExportsForCompletion(contextToken)) {
|
|
// cursor is in an import clause
|
|
// try to show exported member for imported module
|
|
return tryGetImportOrExportClauseCompletionSymbols(namedImportsOrExports);
|
|
}
|
|
if (jsxContainer = tryGetContainingJsxElement(contextToken)) {
|
|
var attrsType;
|
|
if ((jsxContainer.kind === 231 /* JsxSelfClosingElement */) || (jsxContainer.kind === 232 /* JsxOpeningElement */)) {
|
|
// Cursor is inside a JSX self-closing element or opening element
|
|
attrsType = typeChecker.getJsxElementAttributesType(jsxContainer);
|
|
if (attrsType) {
|
|
symbols = filterJsxAttributes(typeChecker.getPropertiesOfType(attrsType), jsxContainer.attributes);
|
|
isMemberCompletion = true;
|
|
isNewIdentifierLocation = false;
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
// Get all entities in the current scope.
|
|
isMemberCompletion = false;
|
|
isNewIdentifierLocation = isNewIdentifierDefinitionLocation(contextToken);
|
|
if (previousToken !== contextToken) {
|
|
ts.Debug.assert(!!previousToken, "Expected 'contextToken' to be defined when different from 'previousToken'.");
|
|
}
|
|
// We need to find the node that will give us an appropriate scope to begin
|
|
// aggregating completion candidates. This is achieved in 'getScopeNode'
|
|
// by finding the first node that encompasses a position, accounting for whether a node
|
|
// is "complete" to decide whether a position belongs to the node.
|
|
//
|
|
// However, at the end of an identifier, we are interested in the scope of the identifier
|
|
// itself, but fall outside of the identifier. For instance:
|
|
//
|
|
// xyz => x$
|
|
//
|
|
// the cursor is outside of both the 'x' and the arrow function 'xyz => x',
|
|
// so 'xyz' is not returned in our results.
|
|
//
|
|
// We define 'adjustedPosition' so that we may appropriately account for
|
|
// being at the end of an identifier. The intention is that if requesting completion
|
|
// at the end of an identifier, it should be effectively equivalent to requesting completion
|
|
// anywhere inside/at the beginning of the identifier. So in the previous case, the
|
|
// 'adjustedPosition' will work as if requesting completion in the following:
|
|
//
|
|
// xyz => $x
|
|
//
|
|
// If previousToken !== contextToken, then
|
|
// - 'contextToken' was adjusted to the token prior to 'previousToken'
|
|
// because we were at the end of an identifier.
|
|
// - 'previousToken' is defined.
|
|
var adjustedPosition = previousToken !== contextToken ?
|
|
previousToken.getStart() :
|
|
position;
|
|
var scopeNode = getScopeNode(contextToken, adjustedPosition, sourceFile) || sourceFile;
|
|
/// TODO filter meaning based on the current context
|
|
var symbolMeanings = 793056 /* Type */ | 107455 /* Value */ | 1536 /* Namespace */ | 8388608 /* Alias */;
|
|
symbols = typeChecker.getSymbolsInScope(scopeNode, symbolMeanings);
|
|
return true;
|
|
}
|
|
/**
|
|
* Finds the first node that "embraces" the position, so that one may
|
|
* accurately aggregate locals from the closest containing scope.
|
|
*/
|
|
function getScopeNode(initialToken, position, sourceFile) {
|
|
var scope = initialToken;
|
|
while (scope && !ts.positionBelongsToNode(scope, position, sourceFile)) {
|
|
scope = scope.parent;
|
|
}
|
|
return scope;
|
|
}
|
|
function isCompletionListBlocker(contextToken) {
|
|
var start = new Date().getTime();
|
|
var result = isInStringOrRegularExpressionOrTemplateLiteral(contextToken) ||
|
|
isSolelyIdentifierDefinitionLocation(contextToken) ||
|
|
isDotOfNumericLiteral(contextToken);
|
|
log("getCompletionsAtPosition: isCompletionListBlocker: " + (new Date().getTime() - start));
|
|
return result;
|
|
}
|
|
function isNewIdentifierDefinitionLocation(previousToken) {
|
|
if (previousToken) {
|
|
var containingNodeKind = previousToken.parent.kind;
|
|
switch (previousToken.kind) {
|
|
case 23 /* CommaToken */:
|
|
return containingNodeKind === 165 /* CallExpression */ // func( a, |
|
|
|| containingNodeKind === 141 /* Constructor */ // constructor( a, | /* public, protected, private keywords are allowed here, so show completion */
|
|
|| containingNodeKind === 166 /* NewExpression */ // new C(a, |
|
|
|| containingNodeKind === 161 /* ArrayLiteralExpression */ // [a, |
|
|
|| containingNodeKind === 178 /* BinaryExpression */ // let x = (a, |
|
|
|| containingNodeKind === 149 /* FunctionType */; // var x: (s: string, list|
|
|
case 16 /* OpenParenToken */:
|
|
return containingNodeKind === 165 /* CallExpression */ // func( |
|
|
|| containingNodeKind === 141 /* Constructor */ // constructor( |
|
|
|| containingNodeKind === 166 /* NewExpression */ // new C(a|
|
|
|| containingNodeKind === 169 /* ParenthesizedExpression */ // let x = (a|
|
|
|| containingNodeKind === 157 /* ParenthesizedType */; // function F(pred: (a| /* this can become an arrow function, where 'a' is the argument */
|
|
case 18 /* OpenBracketToken */:
|
|
return containingNodeKind === 161 /* ArrayLiteralExpression */ // [ |
|
|
|| containingNodeKind === 146 /* IndexSignature */ // [ | : string ]
|
|
|| containingNodeKind === 133 /* ComputedPropertyName */; // [ | /* this can become an index signature */
|
|
case 122 /* ModuleKeyword */: // module |
|
|
case 123 /* NamespaceKeyword */:
|
|
return true;
|
|
case 20 /* DotToken */:
|
|
return containingNodeKind === 215 /* ModuleDeclaration */; // module A.|
|
|
case 14 /* OpenBraceToken */:
|
|
return containingNodeKind === 211 /* ClassDeclaration */; // class A{ |
|
|
case 54 /* EqualsToken */:
|
|
return containingNodeKind === 208 /* VariableDeclaration */ // let x = a|
|
|
|| containingNodeKind === 178 /* BinaryExpression */; // x = a|
|
|
case 11 /* TemplateHead */:
|
|
return containingNodeKind === 180 /* TemplateExpression */; // `aa ${|
|
|
case 12 /* TemplateMiddle */:
|
|
return containingNodeKind === 187 /* TemplateSpan */; // `aa ${10} dd ${|
|
|
case 109 /* PublicKeyword */:
|
|
case 107 /* PrivateKeyword */:
|
|
case 108 /* ProtectedKeyword */:
|
|
return containingNodeKind === 138 /* PropertyDeclaration */; // class A{ public |
|
|
}
|
|
// Previous token may have been a keyword that was converted to an identifier.
|
|
switch (previousToken.getText()) {
|
|
case "public":
|
|
case "protected":
|
|
case "private":
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function isInStringOrRegularExpressionOrTemplateLiteral(contextToken) {
|
|
if (contextToken.kind === 8 /* StringLiteral */
|
|
|| contextToken.kind === 9 /* RegularExpressionLiteral */
|
|
|| ts.isTemplateLiteralKind(contextToken.kind)) {
|
|
var start_3 = contextToken.getStart();
|
|
var end = contextToken.getEnd();
|
|
// To be "in" one of these literals, the position has to be:
|
|
// 1. entirely within the token text.
|
|
// 2. at the end position of an unterminated token.
|
|
// 3. at the end of a regular expression (due to trailing flags like '/foo/g').
|
|
if (start_3 < position && position < end) {
|
|
return true;
|
|
}
|
|
if (position === end) {
|
|
return !!contextToken.isUnterminated
|
|
|| contextToken.kind === 9 /* RegularExpressionLiteral */;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
/**
|
|
* Aggregates relevant symbols for completion in object literals and object binding patterns.
|
|
* Relevant symbols are stored in the captured 'symbols' variable.
|
|
*
|
|
* @returns true if 'symbols' was successfully populated; false otherwise.
|
|
*/
|
|
function tryGetObjectLikeCompletionSymbols(objectLikeContainer) {
|
|
// We're looking up possible property names from contextual/inferred/declared type.
|
|
isMemberCompletion = true;
|
|
var typeForObject;
|
|
var existingMembers;
|
|
if (objectLikeContainer.kind === 162 /* ObjectLiteralExpression */) {
|
|
// We are completing on contextual types, but may also include properties
|
|
// other than those within the declared type.
|
|
isNewIdentifierLocation = true;
|
|
typeForObject = typeChecker.getContextualType(objectLikeContainer);
|
|
existingMembers = objectLikeContainer.properties;
|
|
}
|
|
else if (objectLikeContainer.kind === 158 /* ObjectBindingPattern */) {
|
|
// We are *only* completing on properties from the type being destructured.
|
|
isNewIdentifierLocation = false;
|
|
typeForObject = typeChecker.getTypeAtLocation(objectLikeContainer);
|
|
existingMembers = objectLikeContainer.elements;
|
|
}
|
|
else {
|
|
ts.Debug.fail("Expected object literal or binding pattern, got " + objectLikeContainer.kind);
|
|
}
|
|
if (!typeForObject) {
|
|
return false;
|
|
}
|
|
var typeMembers = typeChecker.getPropertiesOfType(typeForObject);
|
|
if (typeMembers && typeMembers.length > 0) {
|
|
// Add filtered items to the completion list
|
|
symbols = filterObjectMembersList(typeMembers, existingMembers);
|
|
}
|
|
return true;
|
|
}
|
|
/**
|
|
* Aggregates relevant symbols for completion in import clauses and export clauses
|
|
* whose declarations have a module specifier; for instance, symbols will be aggregated for
|
|
*
|
|
* import { | } from "moduleName";
|
|
* export { a as foo, | } from "moduleName";
|
|
*
|
|
* but not for
|
|
*
|
|
* export { | };
|
|
*
|
|
* Relevant symbols are stored in the captured 'symbols' variable.
|
|
*
|
|
* @returns true if 'symbols' was successfully populated; false otherwise.
|
|
*/
|
|
function tryGetImportOrExportClauseCompletionSymbols(namedImportsOrExports) {
|
|
var declarationKind = namedImportsOrExports.kind === 222 /* NamedImports */ ?
|
|
219 /* ImportDeclaration */ :
|
|
225 /* ExportDeclaration */;
|
|
var importOrExportDeclaration = ts.getAncestor(namedImportsOrExports, declarationKind);
|
|
var moduleSpecifier = importOrExportDeclaration.moduleSpecifier;
|
|
if (!moduleSpecifier) {
|
|
return false;
|
|
}
|
|
isMemberCompletion = true;
|
|
isNewIdentifierLocation = false;
|
|
var exports;
|
|
var moduleSpecifierSymbol = typeChecker.getSymbolAtLocation(importOrExportDeclaration.moduleSpecifier);
|
|
if (moduleSpecifierSymbol) {
|
|
exports = typeChecker.getExportsOfModule(moduleSpecifierSymbol);
|
|
}
|
|
symbols = exports ? filterNamedImportOrExportCompletionItems(exports, namedImportsOrExports.elements) : emptyArray;
|
|
return true;
|
|
}
|
|
/**
|
|
* Returns the immediate owning object literal or binding pattern of a context token,
|
|
* on the condition that one exists and that the context implies completion should be given.
|
|
*/
|
|
function tryGetObjectLikeCompletionContainer(contextToken) {
|
|
if (contextToken) {
|
|
switch (contextToken.kind) {
|
|
case 14 /* OpenBraceToken */: // let x = { |
|
|
case 23 /* CommaToken */:
|
|
var parent_11 = contextToken.parent;
|
|
if (parent_11 && (parent_11.kind === 162 /* ObjectLiteralExpression */ || parent_11.kind === 158 /* ObjectBindingPattern */)) {
|
|
return parent_11;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
/**
|
|
* Returns the containing list of named imports or exports of a context token,
|
|
* on the condition that one exists and that the context implies completion should be given.
|
|
*/
|
|
function tryGetNamedImportsOrExportsForCompletion(contextToken) {
|
|
if (contextToken) {
|
|
switch (contextToken.kind) {
|
|
case 14 /* OpenBraceToken */: // import { |
|
|
case 23 /* CommaToken */:
|
|
switch (contextToken.parent.kind) {
|
|
case 222 /* NamedImports */:
|
|
case 226 /* NamedExports */:
|
|
return contextToken.parent;
|
|
}
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function tryGetContainingJsxElement(contextToken) {
|
|
if (contextToken) {
|
|
var parent_12 = contextToken.parent;
|
|
switch (contextToken.kind) {
|
|
case 25 /* LessThanSlashToken */:
|
|
case 37 /* SlashToken */:
|
|
case 66 /* Identifier */:
|
|
if (parent_12 && (parent_12.kind === 231 /* JsxSelfClosingElement */ || parent_12.kind === 232 /* JsxOpeningElement */)) {
|
|
return parent_12;
|
|
}
|
|
break;
|
|
case 15 /* CloseBraceToken */:
|
|
// The context token is the closing } of an attribute, which means
|
|
// its parent is a JsxExpression, whose parent is a JsxAttribute,
|
|
// whose parent is a JsxOpeningLikeElement
|
|
if (parent_12 &&
|
|
parent_12.kind === 237 /* JsxExpression */ &&
|
|
parent_12.parent &&
|
|
parent_12.parent.kind === 235 /* JsxAttribute */) {
|
|
return parent_12.parent.parent;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function isFunction(kind) {
|
|
switch (kind) {
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 144 /* CallSignature */:
|
|
case 145 /* ConstructSignature */:
|
|
case 146 /* IndexSignature */:
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
/**
|
|
* @returns true if we are certain that the currently edited location must define a new location; false otherwise.
|
|
*/
|
|
function isSolelyIdentifierDefinitionLocation(contextToken) {
|
|
var containingNodeKind = contextToken.parent.kind;
|
|
switch (contextToken.kind) {
|
|
case 23 /* CommaToken */:
|
|
return containingNodeKind === 208 /* VariableDeclaration */ ||
|
|
containingNodeKind === 209 /* VariableDeclarationList */ ||
|
|
containingNodeKind === 190 /* VariableStatement */ ||
|
|
containingNodeKind === 214 /* EnumDeclaration */ ||
|
|
isFunction(containingNodeKind) ||
|
|
containingNodeKind === 211 /* ClassDeclaration */ ||
|
|
containingNodeKind === 210 /* FunctionDeclaration */ ||
|
|
containingNodeKind === 212 /* InterfaceDeclaration */ ||
|
|
containingNodeKind === 159 /* ArrayBindingPattern */; // var [x, y|
|
|
case 20 /* DotToken */:
|
|
return containingNodeKind === 159 /* ArrayBindingPattern */; // var [.|
|
|
case 52 /* ColonToken */:
|
|
return containingNodeKind === 160 /* BindingElement */; // var {x :html|
|
|
case 18 /* OpenBracketToken */:
|
|
return containingNodeKind === 159 /* ArrayBindingPattern */; // var [x|
|
|
case 16 /* OpenParenToken */:
|
|
return containingNodeKind === 241 /* CatchClause */ ||
|
|
isFunction(containingNodeKind);
|
|
case 14 /* OpenBraceToken */:
|
|
return containingNodeKind === 214 /* EnumDeclaration */ ||
|
|
containingNodeKind === 212 /* InterfaceDeclaration */ ||
|
|
containingNodeKind === 152 /* TypeLiteral */; // let x : { |
|
|
case 22 /* SemicolonToken */:
|
|
return containingNodeKind === 137 /* PropertySignature */ &&
|
|
contextToken.parent && contextToken.parent.parent &&
|
|
(contextToken.parent.parent.kind === 212 /* InterfaceDeclaration */ ||
|
|
contextToken.parent.parent.kind === 152 /* TypeLiteral */); // let x : { a; |
|
|
case 24 /* LessThanToken */:
|
|
return containingNodeKind === 211 /* ClassDeclaration */ ||
|
|
containingNodeKind === 210 /* FunctionDeclaration */ ||
|
|
containingNodeKind === 212 /* InterfaceDeclaration */ ||
|
|
isFunction(containingNodeKind);
|
|
case 110 /* StaticKeyword */:
|
|
return containingNodeKind === 138 /* PropertyDeclaration */;
|
|
case 21 /* DotDotDotToken */:
|
|
return containingNodeKind === 135 /* Parameter */ ||
|
|
(contextToken.parent && contextToken.parent.parent &&
|
|
contextToken.parent.parent.kind === 159 /* ArrayBindingPattern */); // var [...z|
|
|
case 109 /* PublicKeyword */:
|
|
case 107 /* PrivateKeyword */:
|
|
case 108 /* ProtectedKeyword */:
|
|
return containingNodeKind === 135 /* Parameter */;
|
|
case 113 /* AsKeyword */:
|
|
containingNodeKind === 223 /* ImportSpecifier */ ||
|
|
containingNodeKind === 227 /* ExportSpecifier */ ||
|
|
containingNodeKind === 221 /* NamespaceImport */;
|
|
case 70 /* ClassKeyword */:
|
|
case 78 /* EnumKeyword */:
|
|
case 104 /* InterfaceKeyword */:
|
|
case 84 /* FunctionKeyword */:
|
|
case 99 /* VarKeyword */:
|
|
case 120 /* GetKeyword */:
|
|
case 126 /* SetKeyword */:
|
|
case 86 /* ImportKeyword */:
|
|
case 105 /* LetKeyword */:
|
|
case 71 /* ConstKeyword */:
|
|
case 111 /* YieldKeyword */:
|
|
case 129 /* TypeKeyword */:
|
|
return true;
|
|
}
|
|
// Previous token may have been a keyword that was converted to an identifier.
|
|
switch (contextToken.getText()) {
|
|
case "class":
|
|
case "interface":
|
|
case "enum":
|
|
case "function":
|
|
case "var":
|
|
case "static":
|
|
case "let":
|
|
case "const":
|
|
case "yield":
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function isDotOfNumericLiteral(contextToken) {
|
|
if (contextToken.kind === 7 /* NumericLiteral */) {
|
|
var text = contextToken.getFullText();
|
|
return text.charAt(text.length - 1) === ".";
|
|
}
|
|
return false;
|
|
}
|
|
/**
|
|
* Filters out completion suggestions for named imports or exports.
|
|
*
|
|
* @param exportsOfModule The list of symbols which a module exposes.
|
|
* @param namedImportsOrExports The list of existing import/export specifiers in the import/export clause.
|
|
*
|
|
* @returns Symbols to be suggested at an import/export clause, barring those whose named imports/exports
|
|
* do not occur at the current position and have not otherwise been typed.
|
|
*/
|
|
function filterNamedImportOrExportCompletionItems(exportsOfModule, namedImportsOrExports) {
|
|
var exisingImportsOrExports = {};
|
|
for (var _i = 0; _i < namedImportsOrExports.length; _i++) {
|
|
var element = namedImportsOrExports[_i];
|
|
// If this is the current item we are editing right now, do not filter it out
|
|
if (element.getStart() <= position && position <= element.getEnd()) {
|
|
continue;
|
|
}
|
|
var name_31 = element.propertyName || element.name;
|
|
exisingImportsOrExports[name_31.text] = true;
|
|
}
|
|
if (ts.isEmpty(exisingImportsOrExports)) {
|
|
return exportsOfModule;
|
|
}
|
|
return ts.filter(exportsOfModule, function (e) { return !ts.lookUp(exisingImportsOrExports, e.name); });
|
|
}
|
|
/**
|
|
* Filters out completion suggestions for named imports or exports.
|
|
*
|
|
* @returns Symbols to be suggested in an object binding pattern or object literal expression, barring those whose declarations
|
|
* do not occur at the current position and have not otherwise been typed.
|
|
*/
|
|
function filterObjectMembersList(contextualMemberSymbols, existingMembers) {
|
|
if (!existingMembers || existingMembers.length === 0) {
|
|
return contextualMemberSymbols;
|
|
}
|
|
var existingMemberNames = {};
|
|
for (var _i = 0; _i < existingMembers.length; _i++) {
|
|
var m = existingMembers[_i];
|
|
// Ignore omitted expressions for missing members
|
|
if (m.kind !== 242 /* PropertyAssignment */ &&
|
|
m.kind !== 243 /* ShorthandPropertyAssignment */ &&
|
|
m.kind !== 160 /* BindingElement */) {
|
|
continue;
|
|
}
|
|
// If this is the current item we are editing right now, do not filter it out
|
|
if (m.getStart() <= position && position <= m.getEnd()) {
|
|
continue;
|
|
}
|
|
var existingName = void 0;
|
|
if (m.kind === 160 /* BindingElement */ && m.propertyName) {
|
|
existingName = m.propertyName.text;
|
|
}
|
|
else {
|
|
// TODO(jfreeman): Account for computed property name
|
|
// NOTE: if one only performs this step when m.name is an identifier,
|
|
// things like '__proto__' are not filtered out.
|
|
existingName = m.name.text;
|
|
}
|
|
existingMemberNames[existingName] = true;
|
|
}
|
|
return ts.filter(contextualMemberSymbols, function (m) { return !ts.lookUp(existingMemberNames, m.name); });
|
|
}
|
|
/**
|
|
* Filters out completion suggestions from 'symbols' according to existing JSX attributes.
|
|
*
|
|
* @returns Symbols to be suggested in a JSX element, barring those whose attributes
|
|
* do not occur at the current position and have not otherwise been typed.
|
|
*/
|
|
function filterJsxAttributes(symbols, attributes) {
|
|
var seenNames = {};
|
|
for (var _i = 0; _i < attributes.length; _i++) {
|
|
var attr = attributes[_i];
|
|
// If this is the current item we are editing right now, do not filter it out
|
|
if (attr.getStart() <= position && position <= attr.getEnd()) {
|
|
continue;
|
|
}
|
|
if (attr.kind === 235 /* JsxAttribute */) {
|
|
seenNames[attr.name.text] = true;
|
|
}
|
|
}
|
|
return ts.filter(symbols, function (a) { return !ts.lookUp(seenNames, a.name); });
|
|
}
|
|
}
|
|
function getCompletionsAtPosition(fileName, position) {
|
|
synchronizeHostData();
|
|
var completionData = getCompletionData(fileName, position);
|
|
if (!completionData) {
|
|
return undefined;
|
|
}
|
|
var symbols = completionData.symbols, isMemberCompletion = completionData.isMemberCompletion, isNewIdentifierLocation = completionData.isNewIdentifierLocation, location = completionData.location, isRightOfDot = completionData.isRightOfDot;
|
|
var entries;
|
|
if (isRightOfDot && ts.isJavaScript(fileName)) {
|
|
entries = getCompletionEntriesFromSymbols(symbols);
|
|
ts.addRange(entries, getJavaScriptCompletionEntries());
|
|
}
|
|
else {
|
|
if (!symbols || symbols.length === 0) {
|
|
return undefined;
|
|
}
|
|
entries = getCompletionEntriesFromSymbols(symbols);
|
|
}
|
|
// Add keywords if this is not a member completion list
|
|
if (!isMemberCompletion) {
|
|
ts.addRange(entries, keywordCompletions);
|
|
}
|
|
return { isMemberCompletion: isMemberCompletion, isNewIdentifierLocation: isNewIdentifierLocation, entries: entries };
|
|
function getJavaScriptCompletionEntries() {
|
|
var entries = [];
|
|
var allNames = {};
|
|
var target = program.getCompilerOptions().target;
|
|
for (var _i = 0, _a = program.getSourceFiles(); _i < _a.length; _i++) {
|
|
var sourceFile = _a[_i];
|
|
var nameTable = getNameTable(sourceFile);
|
|
for (var name_32 in nameTable) {
|
|
if (!allNames[name_32]) {
|
|
allNames[name_32] = name_32;
|
|
var displayName = getCompletionEntryDisplayName(name_32, target, true);
|
|
if (displayName) {
|
|
var entry = {
|
|
name: displayName,
|
|
kind: ScriptElementKind.warning,
|
|
kindModifiers: "",
|
|
sortText: "1"
|
|
};
|
|
entries.push(entry);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return entries;
|
|
}
|
|
function createCompletionEntry(symbol, location) {
|
|
// Try to get a valid display name for this symbol, if we could not find one, then ignore it.
|
|
// We would like to only show things that can be added after a dot, so for instance numeric properties can
|
|
// not be accessed with a dot (a.1 <- invalid)
|
|
var displayName = getCompletionEntryDisplayNameForSymbol(symbol, program.getCompilerOptions().target, true, location);
|
|
if (!displayName) {
|
|
return undefined;
|
|
}
|
|
// TODO(drosen): Right now we just permit *all* semantic meanings when calling
|
|
// 'getSymbolKind' which is permissible given that it is backwards compatible; but
|
|
// really we should consider passing the meaning for the node so that we don't report
|
|
// that a suggestion for a value is an interface. We COULD also just do what
|
|
// 'getSymbolModifiers' does, which is to use the first declaration.
|
|
// Use a 'sortText' of 0' so that all symbol completion entries come before any other
|
|
// entries (like JavaScript identifier entries).
|
|
return {
|
|
name: displayName,
|
|
kind: getSymbolKind(symbol, location),
|
|
kindModifiers: getSymbolModifiers(symbol),
|
|
sortText: "0"
|
|
};
|
|
}
|
|
function getCompletionEntriesFromSymbols(symbols) {
|
|
var start = new Date().getTime();
|
|
var entries = [];
|
|
if (symbols) {
|
|
var nameToSymbol = {};
|
|
for (var _i = 0; _i < symbols.length; _i++) {
|
|
var symbol = symbols[_i];
|
|
var entry = createCompletionEntry(symbol, location);
|
|
if (entry) {
|
|
var id = ts.escapeIdentifier(entry.name);
|
|
if (!ts.lookUp(nameToSymbol, id)) {
|
|
entries.push(entry);
|
|
nameToSymbol[id] = symbol;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
log("getCompletionsAtPosition: getCompletionEntriesFromSymbols: " + (new Date().getTime() - start));
|
|
return entries;
|
|
}
|
|
}
|
|
function getCompletionEntryDetails(fileName, position, entryName) {
|
|
synchronizeHostData();
|
|
// Compute all the completion symbols again.
|
|
var completionData = getCompletionData(fileName, position);
|
|
if (completionData) {
|
|
var symbols = completionData.symbols, location_2 = completionData.location;
|
|
// Find the symbol with the matching entry name.
|
|
var target = program.getCompilerOptions().target;
|
|
// We don't need to perform character checks here because we're only comparing the
|
|
// name against 'entryName' (which is known to be good), not building a new
|
|
// completion entry.
|
|
var symbol = ts.forEach(symbols, function (s) { return getCompletionEntryDisplayNameForSymbol(s, target, false, location_2) === entryName ? s : undefined; });
|
|
if (symbol) {
|
|
var _a = getSymbolDisplayPartsDocumentationAndSymbolKind(symbol, getValidSourceFile(fileName), location_2, location_2, 7 /* All */), displayParts = _a.displayParts, documentation = _a.documentation, symbolKind = _a.symbolKind;
|
|
return {
|
|
name: entryName,
|
|
kindModifiers: getSymbolModifiers(symbol),
|
|
kind: symbolKind,
|
|
displayParts: displayParts,
|
|
documentation: documentation
|
|
};
|
|
}
|
|
}
|
|
// Didn't find a symbol with this name. See if we can find a keyword instead.
|
|
var keywordCompletion = ts.forEach(keywordCompletions, function (c) { return c.name === entryName; });
|
|
if (keywordCompletion) {
|
|
return {
|
|
name: entryName,
|
|
kind: ScriptElementKind.keyword,
|
|
kindModifiers: ScriptElementKindModifier.none,
|
|
displayParts: [ts.displayPart(entryName, SymbolDisplayPartKind.keyword)],
|
|
documentation: undefined
|
|
};
|
|
}
|
|
return undefined;
|
|
}
|
|
// TODO(drosen): use contextual SemanticMeaning.
|
|
function getSymbolKind(symbol, location) {
|
|
var flags = symbol.getFlags();
|
|
if (flags & 32 /* Class */)
|
|
return ts.getDeclarationOfKind(symbol, 183 /* ClassExpression */) ?
|
|
ScriptElementKind.localClassElement : ScriptElementKind.classElement;
|
|
if (flags & 384 /* Enum */)
|
|
return ScriptElementKind.enumElement;
|
|
if (flags & 524288 /* TypeAlias */)
|
|
return ScriptElementKind.typeElement;
|
|
if (flags & 64 /* Interface */)
|
|
return ScriptElementKind.interfaceElement;
|
|
if (flags & 262144 /* TypeParameter */)
|
|
return ScriptElementKind.typeParameterElement;
|
|
var result = getSymbolKindOfConstructorPropertyMethodAccessorFunctionOrVar(symbol, flags, location);
|
|
if (result === ScriptElementKind.unknown) {
|
|
if (flags & 262144 /* TypeParameter */)
|
|
return ScriptElementKind.typeParameterElement;
|
|
if (flags & 8 /* EnumMember */)
|
|
return ScriptElementKind.variableElement;
|
|
if (flags & 8388608 /* Alias */)
|
|
return ScriptElementKind.alias;
|
|
if (flags & 1536 /* Module */)
|
|
return ScriptElementKind.moduleElement;
|
|
}
|
|
return result;
|
|
}
|
|
function getSymbolKindOfConstructorPropertyMethodAccessorFunctionOrVar(symbol, flags, location) {
|
|
var typeChecker = program.getTypeChecker();
|
|
if (typeChecker.isUndefinedSymbol(symbol)) {
|
|
return ScriptElementKind.variableElement;
|
|
}
|
|
if (typeChecker.isArgumentsSymbol(symbol)) {
|
|
return ScriptElementKind.localVariableElement;
|
|
}
|
|
if (flags & 3 /* Variable */) {
|
|
if (ts.isFirstDeclarationOfSymbolParameter(symbol)) {
|
|
return ScriptElementKind.parameterElement;
|
|
}
|
|
else if (symbol.valueDeclaration && ts.isConst(symbol.valueDeclaration)) {
|
|
return ScriptElementKind.constElement;
|
|
}
|
|
else if (ts.forEach(symbol.declarations, ts.isLet)) {
|
|
return ScriptElementKind.letElement;
|
|
}
|
|
return isLocalVariableOrFunction(symbol) ? ScriptElementKind.localVariableElement : ScriptElementKind.variableElement;
|
|
}
|
|
if (flags & 16 /* Function */)
|
|
return isLocalVariableOrFunction(symbol) ? ScriptElementKind.localFunctionElement : ScriptElementKind.functionElement;
|
|
if (flags & 32768 /* GetAccessor */)
|
|
return ScriptElementKind.memberGetAccessorElement;
|
|
if (flags & 65536 /* SetAccessor */)
|
|
return ScriptElementKind.memberSetAccessorElement;
|
|
if (flags & 8192 /* Method */)
|
|
return ScriptElementKind.memberFunctionElement;
|
|
if (flags & 16384 /* Constructor */)
|
|
return ScriptElementKind.constructorImplementationElement;
|
|
if (flags & 4 /* Property */) {
|
|
if (flags & 268435456 /* SyntheticProperty */) {
|
|
// If union property is result of union of non method (property/accessors/variables), it is labeled as property
|
|
var unionPropertyKind = ts.forEach(typeChecker.getRootSymbols(symbol), function (rootSymbol) {
|
|
var rootSymbolFlags = rootSymbol.getFlags();
|
|
if (rootSymbolFlags & (98308 /* PropertyOrAccessor */ | 3 /* Variable */)) {
|
|
return ScriptElementKind.memberVariableElement;
|
|
}
|
|
ts.Debug.assert(!!(rootSymbolFlags & 8192 /* Method */));
|
|
});
|
|
if (!unionPropertyKind) {
|
|
// If this was union of all methods,
|
|
//make sure it has call signatures before we can label it as method
|
|
var typeOfUnionProperty = typeChecker.getTypeOfSymbolAtLocation(symbol, location);
|
|
if (typeOfUnionProperty.getCallSignatures().length) {
|
|
return ScriptElementKind.memberFunctionElement;
|
|
}
|
|
return ScriptElementKind.memberVariableElement;
|
|
}
|
|
return unionPropertyKind;
|
|
}
|
|
return ScriptElementKind.memberVariableElement;
|
|
}
|
|
return ScriptElementKind.unknown;
|
|
}
|
|
function getSymbolModifiers(symbol) {
|
|
return symbol && symbol.declarations && symbol.declarations.length > 0
|
|
? ts.getNodeModifiers(symbol.declarations[0])
|
|
: ScriptElementKindModifier.none;
|
|
}
|
|
// TODO(drosen): Currently completion entry details passes the SemanticMeaning.All instead of using semanticMeaning of location
|
|
function getSymbolDisplayPartsDocumentationAndSymbolKind(symbol, sourceFile, enclosingDeclaration, location, semanticMeaning) {
|
|
if (semanticMeaning === void 0) { semanticMeaning = getMeaningFromLocation(location); }
|
|
var typeChecker = program.getTypeChecker();
|
|
var displayParts = [];
|
|
var documentation;
|
|
var symbolFlags = symbol.flags;
|
|
var symbolKind = getSymbolKindOfConstructorPropertyMethodAccessorFunctionOrVar(symbol, symbolFlags, location);
|
|
var hasAddedSymbolInfo;
|
|
var type;
|
|
// Class at constructor site need to be shown as constructor apart from property,method, vars
|
|
if (symbolKind !== ScriptElementKind.unknown || symbolFlags & 32 /* Class */ || symbolFlags & 8388608 /* Alias */) {
|
|
// If it is accessor they are allowed only if location is at name of the accessor
|
|
if (symbolKind === ScriptElementKind.memberGetAccessorElement || symbolKind === ScriptElementKind.memberSetAccessorElement) {
|
|
symbolKind = ScriptElementKind.memberVariableElement;
|
|
}
|
|
var signature;
|
|
type = typeChecker.getTypeOfSymbolAtLocation(symbol, location);
|
|
if (type) {
|
|
if (location.parent && location.parent.kind === 163 /* PropertyAccessExpression */) {
|
|
var right = location.parent.name;
|
|
// Either the location is on the right of a property access, or on the left and the right is missing
|
|
if (right === location || (right && right.getFullWidth() === 0)) {
|
|
location = location.parent;
|
|
}
|
|
}
|
|
// try get the call/construct signature from the type if it matches
|
|
var callExpression;
|
|
if (location.kind === 165 /* CallExpression */ || location.kind === 166 /* NewExpression */) {
|
|
callExpression = location;
|
|
}
|
|
else if (isCallExpressionTarget(location) || isNewExpressionTarget(location)) {
|
|
callExpression = location.parent;
|
|
}
|
|
if (callExpression) {
|
|
var candidateSignatures = [];
|
|
signature = typeChecker.getResolvedSignature(callExpression, candidateSignatures);
|
|
if (!signature && candidateSignatures.length) {
|
|
// Use the first candidate:
|
|
signature = candidateSignatures[0];
|
|
}
|
|
var useConstructSignatures = callExpression.kind === 166 /* NewExpression */ || callExpression.expression.kind === 92 /* SuperKeyword */;
|
|
var allSignatures = useConstructSignatures ? type.getConstructSignatures() : type.getCallSignatures();
|
|
if (!ts.contains(allSignatures, signature.target || signature)) {
|
|
// Get the first signature if there
|
|
signature = allSignatures.length ? allSignatures[0] : undefined;
|
|
}
|
|
if (signature) {
|
|
if (useConstructSignatures && (symbolFlags & 32 /* Class */)) {
|
|
// Constructor
|
|
symbolKind = ScriptElementKind.constructorImplementationElement;
|
|
addPrefixForAnyFunctionOrVar(type.symbol, symbolKind);
|
|
}
|
|
else if (symbolFlags & 8388608 /* Alias */) {
|
|
symbolKind = ScriptElementKind.alias;
|
|
pushTypePart(symbolKind);
|
|
displayParts.push(ts.spacePart());
|
|
if (useConstructSignatures) {
|
|
displayParts.push(ts.keywordPart(89 /* NewKeyword */));
|
|
displayParts.push(ts.spacePart());
|
|
}
|
|
addFullSymbolName(symbol);
|
|
}
|
|
else {
|
|
addPrefixForAnyFunctionOrVar(symbol, symbolKind);
|
|
}
|
|
switch (symbolKind) {
|
|
case ScriptElementKind.memberVariableElement:
|
|
case ScriptElementKind.variableElement:
|
|
case ScriptElementKind.constElement:
|
|
case ScriptElementKind.letElement:
|
|
case ScriptElementKind.parameterElement:
|
|
case ScriptElementKind.localVariableElement:
|
|
// If it is call or construct signature of lambda's write type name
|
|
displayParts.push(ts.punctuationPart(52 /* ColonToken */));
|
|
displayParts.push(ts.spacePart());
|
|
if (useConstructSignatures) {
|
|
displayParts.push(ts.keywordPart(89 /* NewKeyword */));
|
|
displayParts.push(ts.spacePart());
|
|
}
|
|
if (!(type.flags & 65536 /* Anonymous */)) {
|
|
ts.addRange(displayParts, ts.symbolToDisplayParts(typeChecker, type.symbol, enclosingDeclaration, undefined, 1 /* WriteTypeParametersOrArguments */));
|
|
}
|
|
addSignatureDisplayParts(signature, allSignatures, 8 /* WriteArrowStyleSignature */);
|
|
break;
|
|
default:
|
|
// Just signature
|
|
addSignatureDisplayParts(signature, allSignatures);
|
|
}
|
|
hasAddedSymbolInfo = true;
|
|
}
|
|
}
|
|
else if ((isNameOfFunctionDeclaration(location) && !(symbol.flags & 98304 /* Accessor */)) ||
|
|
(location.kind === 118 /* ConstructorKeyword */ && location.parent.kind === 141 /* Constructor */)) {
|
|
// get the signature from the declaration and write it
|
|
var functionDeclaration = location.parent;
|
|
var allSignatures = functionDeclaration.kind === 141 /* Constructor */ ? type.getConstructSignatures() : type.getCallSignatures();
|
|
if (!typeChecker.isImplementationOfOverload(functionDeclaration)) {
|
|
signature = typeChecker.getSignatureFromDeclaration(functionDeclaration);
|
|
}
|
|
else {
|
|
signature = allSignatures[0];
|
|
}
|
|
if (functionDeclaration.kind === 141 /* Constructor */) {
|
|
// show (constructor) Type(...) signature
|
|
symbolKind = ScriptElementKind.constructorImplementationElement;
|
|
addPrefixForAnyFunctionOrVar(type.symbol, symbolKind);
|
|
}
|
|
else {
|
|
// (function/method) symbol(..signature)
|
|
addPrefixForAnyFunctionOrVar(functionDeclaration.kind === 144 /* CallSignature */ &&
|
|
!(type.symbol.flags & 2048 /* TypeLiteral */ || type.symbol.flags & 4096 /* ObjectLiteral */) ? type.symbol : symbol, symbolKind);
|
|
}
|
|
addSignatureDisplayParts(signature, allSignatures);
|
|
hasAddedSymbolInfo = true;
|
|
}
|
|
}
|
|
}
|
|
if (symbolFlags & 32 /* Class */ && !hasAddedSymbolInfo) {
|
|
if (ts.getDeclarationOfKind(symbol, 183 /* ClassExpression */)) {
|
|
// Special case for class expressions because we would like to indicate that
|
|
// the class name is local to the class body (similar to function expression)
|
|
// (local class) class <className>
|
|
pushTypePart(ScriptElementKind.localClassElement);
|
|
}
|
|
else {
|
|
// Class declaration has name which is not local.
|
|
displayParts.push(ts.keywordPart(70 /* ClassKeyword */));
|
|
}
|
|
displayParts.push(ts.spacePart());
|
|
addFullSymbolName(symbol);
|
|
writeTypeParametersOfSymbol(symbol, sourceFile);
|
|
}
|
|
if ((symbolFlags & 64 /* Interface */) && (semanticMeaning & 2 /* Type */)) {
|
|
addNewLineIfDisplayPartsExist();
|
|
displayParts.push(ts.keywordPart(104 /* InterfaceKeyword */));
|
|
displayParts.push(ts.spacePart());
|
|
addFullSymbolName(symbol);
|
|
writeTypeParametersOfSymbol(symbol, sourceFile);
|
|
}
|
|
if (symbolFlags & 524288 /* TypeAlias */) {
|
|
addNewLineIfDisplayPartsExist();
|
|
displayParts.push(ts.keywordPart(129 /* TypeKeyword */));
|
|
displayParts.push(ts.spacePart());
|
|
addFullSymbolName(symbol);
|
|
displayParts.push(ts.spacePart());
|
|
displayParts.push(ts.operatorPart(54 /* EqualsToken */));
|
|
displayParts.push(ts.spacePart());
|
|
ts.addRange(displayParts, ts.typeToDisplayParts(typeChecker, typeChecker.getDeclaredTypeOfSymbol(symbol), enclosingDeclaration));
|
|
}
|
|
if (symbolFlags & 384 /* Enum */) {
|
|
addNewLineIfDisplayPartsExist();
|
|
if (ts.forEach(symbol.declarations, ts.isConstEnumDeclaration)) {
|
|
displayParts.push(ts.keywordPart(71 /* ConstKeyword */));
|
|
displayParts.push(ts.spacePart());
|
|
}
|
|
displayParts.push(ts.keywordPart(78 /* EnumKeyword */));
|
|
displayParts.push(ts.spacePart());
|
|
addFullSymbolName(symbol);
|
|
}
|
|
if (symbolFlags & 1536 /* Module */) {
|
|
addNewLineIfDisplayPartsExist();
|
|
var declaration = ts.getDeclarationOfKind(symbol, 215 /* ModuleDeclaration */);
|
|
var isNamespace = declaration && declaration.name && declaration.name.kind === 66 /* Identifier */;
|
|
displayParts.push(ts.keywordPart(isNamespace ? 123 /* NamespaceKeyword */ : 122 /* ModuleKeyword */));
|
|
displayParts.push(ts.spacePart());
|
|
addFullSymbolName(symbol);
|
|
}
|
|
if ((symbolFlags & 262144 /* TypeParameter */) && (semanticMeaning & 2 /* Type */)) {
|
|
addNewLineIfDisplayPartsExist();
|
|
displayParts.push(ts.punctuationPart(16 /* OpenParenToken */));
|
|
displayParts.push(ts.textPart("type parameter"));
|
|
displayParts.push(ts.punctuationPart(17 /* CloseParenToken */));
|
|
displayParts.push(ts.spacePart());
|
|
addFullSymbolName(symbol);
|
|
displayParts.push(ts.spacePart());
|
|
displayParts.push(ts.keywordPart(87 /* InKeyword */));
|
|
displayParts.push(ts.spacePart());
|
|
if (symbol.parent) {
|
|
// Class/Interface type parameter
|
|
addFullSymbolName(symbol.parent, enclosingDeclaration);
|
|
writeTypeParametersOfSymbol(symbol.parent, enclosingDeclaration);
|
|
}
|
|
else {
|
|
// Method/function type parameter
|
|
var signatureDeclaration = ts.getDeclarationOfKind(symbol, 134 /* TypeParameter */).parent;
|
|
var signature = typeChecker.getSignatureFromDeclaration(signatureDeclaration);
|
|
if (signatureDeclaration.kind === 145 /* ConstructSignature */) {
|
|
displayParts.push(ts.keywordPart(89 /* NewKeyword */));
|
|
displayParts.push(ts.spacePart());
|
|
}
|
|
else if (signatureDeclaration.kind !== 144 /* CallSignature */ && signatureDeclaration.name) {
|
|
addFullSymbolName(signatureDeclaration.symbol);
|
|
}
|
|
ts.addRange(displayParts, ts.signatureToDisplayParts(typeChecker, signature, sourceFile, 32 /* WriteTypeArgumentsOfSignature */));
|
|
}
|
|
}
|
|
if (symbolFlags & 8 /* EnumMember */) {
|
|
addPrefixForAnyFunctionOrVar(symbol, "enum member");
|
|
var declaration = symbol.declarations[0];
|
|
if (declaration.kind === 244 /* EnumMember */) {
|
|
var constantValue = typeChecker.getConstantValue(declaration);
|
|
if (constantValue !== undefined) {
|
|
displayParts.push(ts.spacePart());
|
|
displayParts.push(ts.operatorPart(54 /* EqualsToken */));
|
|
displayParts.push(ts.spacePart());
|
|
displayParts.push(ts.displayPart(constantValue.toString(), SymbolDisplayPartKind.numericLiteral));
|
|
}
|
|
}
|
|
}
|
|
if (symbolFlags & 8388608 /* Alias */) {
|
|
addNewLineIfDisplayPartsExist();
|
|
displayParts.push(ts.keywordPart(86 /* ImportKeyword */));
|
|
displayParts.push(ts.spacePart());
|
|
addFullSymbolName(symbol);
|
|
ts.forEach(symbol.declarations, function (declaration) {
|
|
if (declaration.kind === 218 /* ImportEqualsDeclaration */) {
|
|
var importEqualsDeclaration = declaration;
|
|
if (ts.isExternalModuleImportEqualsDeclaration(importEqualsDeclaration)) {
|
|
displayParts.push(ts.spacePart());
|
|
displayParts.push(ts.operatorPart(54 /* EqualsToken */));
|
|
displayParts.push(ts.spacePart());
|
|
displayParts.push(ts.keywordPart(124 /* RequireKeyword */));
|
|
displayParts.push(ts.punctuationPart(16 /* OpenParenToken */));
|
|
displayParts.push(ts.displayPart(ts.getTextOfNode(ts.getExternalModuleImportEqualsDeclarationExpression(importEqualsDeclaration)), SymbolDisplayPartKind.stringLiteral));
|
|
displayParts.push(ts.punctuationPart(17 /* CloseParenToken */));
|
|
}
|
|
else {
|
|
var internalAliasSymbol = typeChecker.getSymbolAtLocation(importEqualsDeclaration.moduleReference);
|
|
if (internalAliasSymbol) {
|
|
displayParts.push(ts.spacePart());
|
|
displayParts.push(ts.operatorPart(54 /* EqualsToken */));
|
|
displayParts.push(ts.spacePart());
|
|
addFullSymbolName(internalAliasSymbol, enclosingDeclaration);
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
});
|
|
}
|
|
if (!hasAddedSymbolInfo) {
|
|
if (symbolKind !== ScriptElementKind.unknown) {
|
|
if (type) {
|
|
addPrefixForAnyFunctionOrVar(symbol, symbolKind);
|
|
// For properties, variables and local vars: show the type
|
|
if (symbolKind === ScriptElementKind.memberVariableElement ||
|
|
symbolFlags & 3 /* Variable */ ||
|
|
symbolKind === ScriptElementKind.localVariableElement) {
|
|
displayParts.push(ts.punctuationPart(52 /* ColonToken */));
|
|
displayParts.push(ts.spacePart());
|
|
// If the type is type parameter, format it specially
|
|
if (type.symbol && type.symbol.flags & 262144 /* TypeParameter */) {
|
|
var typeParameterParts = ts.mapToDisplayParts(function (writer) {
|
|
typeChecker.getSymbolDisplayBuilder().buildTypeParameterDisplay(type, writer, enclosingDeclaration);
|
|
});
|
|
ts.addRange(displayParts, typeParameterParts);
|
|
}
|
|
else {
|
|
ts.addRange(displayParts, ts.typeToDisplayParts(typeChecker, type, enclosingDeclaration));
|
|
}
|
|
}
|
|
else if (symbolFlags & 16 /* Function */ ||
|
|
symbolFlags & 8192 /* Method */ ||
|
|
symbolFlags & 16384 /* Constructor */ ||
|
|
symbolFlags & 131072 /* Signature */ ||
|
|
symbolFlags & 98304 /* Accessor */ ||
|
|
symbolKind === ScriptElementKind.memberFunctionElement) {
|
|
var allSignatures = type.getCallSignatures();
|
|
addSignatureDisplayParts(allSignatures[0], allSignatures);
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
symbolKind = getSymbolKind(symbol, location);
|
|
}
|
|
}
|
|
if (!documentation) {
|
|
documentation = symbol.getDocumentationComment();
|
|
}
|
|
return { displayParts: displayParts, documentation: documentation, symbolKind: symbolKind };
|
|
function addNewLineIfDisplayPartsExist() {
|
|
if (displayParts.length) {
|
|
displayParts.push(ts.lineBreakPart());
|
|
}
|
|
}
|
|
function addFullSymbolName(symbol, enclosingDeclaration) {
|
|
var fullSymbolDisplayParts = ts.symbolToDisplayParts(typeChecker, symbol, enclosingDeclaration || sourceFile, undefined, 1 /* WriteTypeParametersOrArguments */ | 2 /* UseOnlyExternalAliasing */);
|
|
ts.addRange(displayParts, fullSymbolDisplayParts);
|
|
}
|
|
function addPrefixForAnyFunctionOrVar(symbol, symbolKind) {
|
|
addNewLineIfDisplayPartsExist();
|
|
if (symbolKind) {
|
|
pushTypePart(symbolKind);
|
|
displayParts.push(ts.spacePart());
|
|
addFullSymbolName(symbol);
|
|
}
|
|
}
|
|
function pushTypePart(symbolKind) {
|
|
switch (symbolKind) {
|
|
case ScriptElementKind.variableElement:
|
|
case ScriptElementKind.functionElement:
|
|
case ScriptElementKind.letElement:
|
|
case ScriptElementKind.constElement:
|
|
case ScriptElementKind.constructorImplementationElement:
|
|
displayParts.push(ts.textOrKeywordPart(symbolKind));
|
|
return;
|
|
default:
|
|
displayParts.push(ts.punctuationPart(16 /* OpenParenToken */));
|
|
displayParts.push(ts.textOrKeywordPart(symbolKind));
|
|
displayParts.push(ts.punctuationPart(17 /* CloseParenToken */));
|
|
return;
|
|
}
|
|
}
|
|
function addSignatureDisplayParts(signature, allSignatures, flags) {
|
|
ts.addRange(displayParts, ts.signatureToDisplayParts(typeChecker, signature, enclosingDeclaration, flags | 32 /* WriteTypeArgumentsOfSignature */));
|
|
if (allSignatures.length > 1) {
|
|
displayParts.push(ts.spacePart());
|
|
displayParts.push(ts.punctuationPart(16 /* OpenParenToken */));
|
|
displayParts.push(ts.operatorPart(34 /* PlusToken */));
|
|
displayParts.push(ts.displayPart((allSignatures.length - 1).toString(), SymbolDisplayPartKind.numericLiteral));
|
|
displayParts.push(ts.spacePart());
|
|
displayParts.push(ts.textPart(allSignatures.length === 2 ? "overload" : "overloads"));
|
|
displayParts.push(ts.punctuationPart(17 /* CloseParenToken */));
|
|
}
|
|
documentation = signature.getDocumentationComment();
|
|
}
|
|
function writeTypeParametersOfSymbol(symbol, enclosingDeclaration) {
|
|
var typeParameterParts = ts.mapToDisplayParts(function (writer) {
|
|
typeChecker.getSymbolDisplayBuilder().buildTypeParameterDisplayFromSymbol(symbol, writer, enclosingDeclaration);
|
|
});
|
|
ts.addRange(displayParts, typeParameterParts);
|
|
}
|
|
}
|
|
function getQuickInfoAtPosition(fileName, position) {
|
|
synchronizeHostData();
|
|
var sourceFile = getValidSourceFile(fileName);
|
|
var node = ts.getTouchingPropertyName(sourceFile, position);
|
|
if (!node) {
|
|
return undefined;
|
|
}
|
|
if (isLabelName(node)) {
|
|
return undefined;
|
|
}
|
|
var typeChecker = program.getTypeChecker();
|
|
var symbol = typeChecker.getSymbolAtLocation(node);
|
|
if (!symbol) {
|
|
// Try getting just type at this position and show
|
|
switch (node.kind) {
|
|
case 66 /* Identifier */:
|
|
case 163 /* PropertyAccessExpression */:
|
|
case 132 /* QualifiedName */:
|
|
case 94 /* ThisKeyword */:
|
|
case 92 /* SuperKeyword */:
|
|
// For the identifiers/this/super etc get the type at position
|
|
var type = typeChecker.getTypeAtLocation(node);
|
|
if (type) {
|
|
return {
|
|
kind: ScriptElementKind.unknown,
|
|
kindModifiers: ScriptElementKindModifier.none,
|
|
textSpan: ts.createTextSpan(node.getStart(), node.getWidth()),
|
|
displayParts: ts.typeToDisplayParts(typeChecker, type, getContainerNode(node)),
|
|
documentation: type.symbol ? type.symbol.getDocumentationComment() : undefined
|
|
};
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
var displayPartsDocumentationsAndKind = getSymbolDisplayPartsDocumentationAndSymbolKind(symbol, sourceFile, getContainerNode(node), node);
|
|
return {
|
|
kind: displayPartsDocumentationsAndKind.symbolKind,
|
|
kindModifiers: getSymbolModifiers(symbol),
|
|
textSpan: ts.createTextSpan(node.getStart(), node.getWidth()),
|
|
displayParts: displayPartsDocumentationsAndKind.displayParts,
|
|
documentation: displayPartsDocumentationsAndKind.documentation
|
|
};
|
|
}
|
|
function createDefinitionInfo(node, symbolKind, symbolName, containerName) {
|
|
return {
|
|
fileName: node.getSourceFile().fileName,
|
|
textSpan: ts.createTextSpanFromBounds(node.getStart(), node.getEnd()),
|
|
kind: symbolKind,
|
|
name: symbolName,
|
|
containerKind: undefined,
|
|
containerName: containerName
|
|
};
|
|
}
|
|
function getDefinitionFromSymbol(symbol, node) {
|
|
var typeChecker = program.getTypeChecker();
|
|
var result = [];
|
|
var declarations = symbol.getDeclarations();
|
|
var symbolName = typeChecker.symbolToString(symbol); // Do not get scoped name, just the name of the symbol
|
|
var symbolKind = getSymbolKind(symbol, node);
|
|
var containerSymbol = symbol.parent;
|
|
var containerName = containerSymbol ? typeChecker.symbolToString(containerSymbol, node) : "";
|
|
if (!tryAddConstructSignature(symbol, node, symbolKind, symbolName, containerName, result) &&
|
|
!tryAddCallSignature(symbol, node, symbolKind, symbolName, containerName, result)) {
|
|
// Just add all the declarations.
|
|
ts.forEach(declarations, function (declaration) {
|
|
result.push(createDefinitionInfo(declaration, symbolKind, symbolName, containerName));
|
|
});
|
|
}
|
|
return result;
|
|
function tryAddConstructSignature(symbol, location, symbolKind, symbolName, containerName, result) {
|
|
// Applicable only if we are in a new expression, or we are on a constructor declaration
|
|
// and in either case the symbol has a construct signature definition, i.e. class
|
|
if (isNewExpressionTarget(location) || location.kind === 118 /* ConstructorKeyword */) {
|
|
if (symbol.flags & 32 /* Class */) {
|
|
var classDeclaration = symbol.getDeclarations()[0];
|
|
ts.Debug.assert(classDeclaration && classDeclaration.kind === 211 /* ClassDeclaration */);
|
|
return tryAddSignature(classDeclaration.members, true, symbolKind, symbolName, containerName, result);
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
function tryAddCallSignature(symbol, location, symbolKind, symbolName, containerName, result) {
|
|
if (isCallExpressionTarget(location) || isNewExpressionTarget(location) || isNameOfFunctionDeclaration(location)) {
|
|
return tryAddSignature(symbol.declarations, false, symbolKind, symbolName, containerName, result);
|
|
}
|
|
return false;
|
|
}
|
|
function tryAddSignature(signatureDeclarations, selectConstructors, symbolKind, symbolName, containerName, result) {
|
|
var declarations = [];
|
|
var definition;
|
|
ts.forEach(signatureDeclarations, function (d) {
|
|
if ((selectConstructors && d.kind === 141 /* Constructor */) ||
|
|
(!selectConstructors && (d.kind === 210 /* FunctionDeclaration */ || d.kind === 140 /* MethodDeclaration */ || d.kind === 139 /* MethodSignature */))) {
|
|
declarations.push(d);
|
|
if (d.body)
|
|
definition = d;
|
|
}
|
|
});
|
|
if (definition) {
|
|
result.push(createDefinitionInfo(definition, symbolKind, symbolName, containerName));
|
|
return true;
|
|
}
|
|
else if (declarations.length) {
|
|
result.push(createDefinitionInfo(ts.lastOrUndefined(declarations), symbolKind, symbolName, containerName));
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
}
|
|
/// Goto definition
|
|
function getDefinitionAtPosition(fileName, position) {
|
|
synchronizeHostData();
|
|
var sourceFile = getValidSourceFile(fileName);
|
|
var node = ts.getTouchingPropertyName(sourceFile, position);
|
|
if (!node) {
|
|
return undefined;
|
|
}
|
|
// Labels
|
|
if (isJumpStatementTarget(node)) {
|
|
var labelName = node.text;
|
|
var label = getTargetLabel(node.parent, node.text);
|
|
return label ? [createDefinitionInfo(label, ScriptElementKind.label, labelName, undefined)] : undefined;
|
|
}
|
|
/// Triple slash reference comments
|
|
var comment = ts.forEach(sourceFile.referencedFiles, function (r) { return (r.pos <= position && position < r.end) ? r : undefined; });
|
|
if (comment) {
|
|
var referenceFile = ts.tryResolveScriptReference(program, sourceFile, comment);
|
|
if (referenceFile) {
|
|
return [{
|
|
fileName: referenceFile.fileName,
|
|
textSpan: ts.createTextSpanFromBounds(0, 0),
|
|
kind: ScriptElementKind.scriptElement,
|
|
name: comment.fileName,
|
|
containerName: undefined,
|
|
containerKind: undefined
|
|
}];
|
|
}
|
|
return undefined;
|
|
}
|
|
var typeChecker = program.getTypeChecker();
|
|
var symbol = typeChecker.getSymbolAtLocation(node);
|
|
// Could not find a symbol e.g. node is string or number keyword,
|
|
// or the symbol was an internal symbol and does not have a declaration e.g. undefined symbol
|
|
if (!symbol) {
|
|
return undefined;
|
|
}
|
|
// If this is an alias, and the request came at the declaration location
|
|
// get the aliased symbol instead. This allows for goto def on an import e.g.
|
|
// import {A, B} from "mod";
|
|
// to jump to the implementation directly.
|
|
if (symbol.flags & 8388608 /* Alias */) {
|
|
var declaration = symbol.declarations[0];
|
|
if (node.kind === 66 /* Identifier */ && node.parent === declaration) {
|
|
symbol = typeChecker.getAliasedSymbol(symbol);
|
|
}
|
|
}
|
|
// Because name in short-hand property assignment has two different meanings: property name and property value,
|
|
// using go-to-definition at such position should go to the variable declaration of the property value rather than
|
|
// go to the declaration of the property name (in this case stay at the same position). However, if go-to-definition
|
|
// is performed at the location of property access, we would like to go to definition of the property in the short-hand
|
|
// assignment. This case and others are handled by the following code.
|
|
if (node.parent.kind === 243 /* ShorthandPropertyAssignment */) {
|
|
var shorthandSymbol = typeChecker.getShorthandAssignmentValueSymbol(symbol.valueDeclaration);
|
|
if (!shorthandSymbol) {
|
|
return [];
|
|
}
|
|
var shorthandDeclarations = shorthandSymbol.getDeclarations();
|
|
var shorthandSymbolKind = getSymbolKind(shorthandSymbol, node);
|
|
var shorthandSymbolName = typeChecker.symbolToString(shorthandSymbol);
|
|
var shorthandContainerName = typeChecker.symbolToString(symbol.parent, node);
|
|
return ts.map(shorthandDeclarations, function (declaration) { return createDefinitionInfo(declaration, shorthandSymbolKind, shorthandSymbolName, shorthandContainerName); });
|
|
}
|
|
return getDefinitionFromSymbol(symbol, node);
|
|
}
|
|
/// Goto type
|
|
function getTypeDefinitionAtPosition(fileName, position) {
|
|
synchronizeHostData();
|
|
var sourceFile = getValidSourceFile(fileName);
|
|
var node = ts.getTouchingPropertyName(sourceFile, position);
|
|
if (!node) {
|
|
return undefined;
|
|
}
|
|
var typeChecker = program.getTypeChecker();
|
|
var symbol = typeChecker.getSymbolAtLocation(node);
|
|
if (!symbol) {
|
|
return undefined;
|
|
}
|
|
var type = typeChecker.getTypeOfSymbolAtLocation(symbol, node);
|
|
if (!type) {
|
|
return undefined;
|
|
}
|
|
if (type.flags & 16384 /* Union */) {
|
|
var result = [];
|
|
ts.forEach(type.types, function (t) {
|
|
if (t.symbol) {
|
|
ts.addRange(result, getDefinitionFromSymbol(t.symbol, node));
|
|
}
|
|
});
|
|
return result;
|
|
}
|
|
if (!type.symbol) {
|
|
return undefined;
|
|
}
|
|
return getDefinitionFromSymbol(type.symbol, node);
|
|
}
|
|
function getOccurrencesAtPosition(fileName, position) {
|
|
var results = getOccurrencesAtPositionCore(fileName, position);
|
|
if (results) {
|
|
var sourceFile = getCanonicalFileName(ts.normalizeSlashes(fileName));
|
|
// Get occurrences only supports reporting occurrences for the file queried. So
|
|
// filter down to that list.
|
|
results = ts.filter(results, function (r) { return getCanonicalFileName(ts.normalizeSlashes(r.fileName)) === sourceFile; });
|
|
}
|
|
return results;
|
|
}
|
|
function getDocumentHighlights(fileName, position, filesToSearch) {
|
|
synchronizeHostData();
|
|
filesToSearch = ts.map(filesToSearch, ts.normalizeSlashes);
|
|
var sourceFilesToSearch = ts.filter(program.getSourceFiles(), function (f) { return ts.contains(filesToSearch, f.fileName); });
|
|
var sourceFile = getValidSourceFile(fileName);
|
|
var node = ts.getTouchingWord(sourceFile, position);
|
|
if (!node) {
|
|
return undefined;
|
|
}
|
|
return getSemanticDocumentHighlights(node) || getSyntacticDocumentHighlights(node);
|
|
function getHighlightSpanForNode(node) {
|
|
var start = node.getStart();
|
|
var end = node.getEnd();
|
|
return {
|
|
fileName: sourceFile.fileName,
|
|
textSpan: ts.createTextSpanFromBounds(start, end),
|
|
kind: HighlightSpanKind.none
|
|
};
|
|
}
|
|
function getSemanticDocumentHighlights(node) {
|
|
if (node.kind === 66 /* Identifier */ ||
|
|
node.kind === 94 /* ThisKeyword */ ||
|
|
node.kind === 92 /* SuperKeyword */ ||
|
|
isLiteralNameOfPropertyDeclarationOrIndexAccess(node) ||
|
|
isNameOfExternalModuleImportOrDeclaration(node)) {
|
|
var referencedSymbols = getReferencedSymbolsForNode(node, sourceFilesToSearch, false, false);
|
|
return convertReferencedSymbols(referencedSymbols);
|
|
}
|
|
return undefined;
|
|
function convertReferencedSymbols(referencedSymbols) {
|
|
if (!referencedSymbols) {
|
|
return undefined;
|
|
}
|
|
var fileNameToDocumentHighlights = {};
|
|
var result = [];
|
|
for (var _i = 0; _i < referencedSymbols.length; _i++) {
|
|
var referencedSymbol = referencedSymbols[_i];
|
|
for (var _a = 0, _b = referencedSymbol.references; _a < _b.length; _a++) {
|
|
var referenceEntry = _b[_a];
|
|
var fileName_1 = referenceEntry.fileName;
|
|
var documentHighlights = ts.getProperty(fileNameToDocumentHighlights, fileName_1);
|
|
if (!documentHighlights) {
|
|
documentHighlights = { fileName: fileName_1, highlightSpans: [] };
|
|
fileNameToDocumentHighlights[fileName_1] = documentHighlights;
|
|
result.push(documentHighlights);
|
|
}
|
|
documentHighlights.highlightSpans.push({
|
|
textSpan: referenceEntry.textSpan,
|
|
kind: referenceEntry.isWriteAccess ? HighlightSpanKind.writtenReference : HighlightSpanKind.reference
|
|
});
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
}
|
|
function getSyntacticDocumentHighlights(node) {
|
|
var fileName = sourceFile.fileName;
|
|
var highlightSpans = getHighlightSpans(node);
|
|
if (!highlightSpans || highlightSpans.length === 0) {
|
|
return undefined;
|
|
}
|
|
return [{ fileName: fileName, highlightSpans: highlightSpans }];
|
|
// returns true if 'node' is defined and has a matching 'kind'.
|
|
function hasKind(node, kind) {
|
|
return node !== undefined && node.kind === kind;
|
|
}
|
|
// Null-propagating 'parent' function.
|
|
function parent(node) {
|
|
return node && node.parent;
|
|
}
|
|
function getHighlightSpans(node) {
|
|
if (node) {
|
|
switch (node.kind) {
|
|
case 85 /* IfKeyword */:
|
|
case 77 /* ElseKeyword */:
|
|
if (hasKind(node.parent, 193 /* IfStatement */)) {
|
|
return getIfElseOccurrences(node.parent);
|
|
}
|
|
break;
|
|
case 91 /* ReturnKeyword */:
|
|
if (hasKind(node.parent, 201 /* ReturnStatement */)) {
|
|
return getReturnOccurrences(node.parent);
|
|
}
|
|
break;
|
|
case 95 /* ThrowKeyword */:
|
|
if (hasKind(node.parent, 205 /* ThrowStatement */)) {
|
|
return getThrowOccurrences(node.parent);
|
|
}
|
|
break;
|
|
case 69 /* CatchKeyword */:
|
|
if (hasKind(parent(parent(node)), 206 /* TryStatement */)) {
|
|
return getTryCatchFinallyOccurrences(node.parent.parent);
|
|
}
|
|
break;
|
|
case 97 /* TryKeyword */:
|
|
case 82 /* FinallyKeyword */:
|
|
if (hasKind(parent(node), 206 /* TryStatement */)) {
|
|
return getTryCatchFinallyOccurrences(node.parent);
|
|
}
|
|
break;
|
|
case 93 /* SwitchKeyword */:
|
|
if (hasKind(node.parent, 203 /* SwitchStatement */)) {
|
|
return getSwitchCaseDefaultOccurrences(node.parent);
|
|
}
|
|
break;
|
|
case 68 /* CaseKeyword */:
|
|
case 74 /* DefaultKeyword */:
|
|
if (hasKind(parent(parent(parent(node))), 203 /* SwitchStatement */)) {
|
|
return getSwitchCaseDefaultOccurrences(node.parent.parent.parent);
|
|
}
|
|
break;
|
|
case 67 /* BreakKeyword */:
|
|
case 72 /* ContinueKeyword */:
|
|
if (hasKind(node.parent, 200 /* BreakStatement */) || hasKind(node.parent, 199 /* ContinueStatement */)) {
|
|
return getBreakOrContinueStatementOccurences(node.parent);
|
|
}
|
|
break;
|
|
case 83 /* ForKeyword */:
|
|
if (hasKind(node.parent, 196 /* ForStatement */) ||
|
|
hasKind(node.parent, 197 /* ForInStatement */) ||
|
|
hasKind(node.parent, 198 /* ForOfStatement */)) {
|
|
return getLoopBreakContinueOccurrences(node.parent);
|
|
}
|
|
break;
|
|
case 101 /* WhileKeyword */:
|
|
case 76 /* DoKeyword */:
|
|
if (hasKind(node.parent, 195 /* WhileStatement */) || hasKind(node.parent, 194 /* DoStatement */)) {
|
|
return getLoopBreakContinueOccurrences(node.parent);
|
|
}
|
|
break;
|
|
case 118 /* ConstructorKeyword */:
|
|
if (hasKind(node.parent, 141 /* Constructor */)) {
|
|
return getConstructorOccurrences(node.parent);
|
|
}
|
|
break;
|
|
case 120 /* GetKeyword */:
|
|
case 126 /* SetKeyword */:
|
|
if (hasKind(node.parent, 142 /* GetAccessor */) || hasKind(node.parent, 143 /* SetAccessor */)) {
|
|
return getGetAndSetOccurrences(node.parent);
|
|
}
|
|
break;
|
|
default:
|
|
if (ts.isModifier(node.kind) && node.parent &&
|
|
(ts.isDeclaration(node.parent) || node.parent.kind === 190 /* VariableStatement */)) {
|
|
return getModifierOccurrences(node.kind, node.parent);
|
|
}
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
/**
|
|
* Aggregates all throw-statements within this node *without* crossing
|
|
* into function boundaries and try-blocks with catch-clauses.
|
|
*/
|
|
function aggregateOwnedThrowStatements(node) {
|
|
var statementAccumulator = [];
|
|
aggregate(node);
|
|
return statementAccumulator;
|
|
function aggregate(node) {
|
|
if (node.kind === 205 /* ThrowStatement */) {
|
|
statementAccumulator.push(node);
|
|
}
|
|
else if (node.kind === 206 /* TryStatement */) {
|
|
var tryStatement = node;
|
|
if (tryStatement.catchClause) {
|
|
aggregate(tryStatement.catchClause);
|
|
}
|
|
else {
|
|
// Exceptions thrown within a try block lacking a catch clause
|
|
// are "owned" in the current context.
|
|
aggregate(tryStatement.tryBlock);
|
|
}
|
|
if (tryStatement.finallyBlock) {
|
|
aggregate(tryStatement.finallyBlock);
|
|
}
|
|
}
|
|
else if (!ts.isFunctionLike(node)) {
|
|
ts.forEachChild(node, aggregate);
|
|
}
|
|
}
|
|
;
|
|
}
|
|
/**
|
|
* For lack of a better name, this function takes a throw statement and returns the
|
|
* nearest ancestor that is a try-block (whose try statement has a catch clause),
|
|
* function-block, or source file.
|
|
*/
|
|
function getThrowStatementOwner(throwStatement) {
|
|
var child = throwStatement;
|
|
while (child.parent) {
|
|
var parent_13 = child.parent;
|
|
if (ts.isFunctionBlock(parent_13) || parent_13.kind === 245 /* SourceFile */) {
|
|
return parent_13;
|
|
}
|
|
// A throw-statement is only owned by a try-statement if the try-statement has
|
|
// a catch clause, and if the throw-statement occurs within the try block.
|
|
if (parent_13.kind === 206 /* TryStatement */) {
|
|
var tryStatement = parent_13;
|
|
if (tryStatement.tryBlock === child && tryStatement.catchClause) {
|
|
return child;
|
|
}
|
|
}
|
|
child = parent_13;
|
|
}
|
|
return undefined;
|
|
}
|
|
function aggregateAllBreakAndContinueStatements(node) {
|
|
var statementAccumulator = [];
|
|
aggregate(node);
|
|
return statementAccumulator;
|
|
function aggregate(node) {
|
|
if (node.kind === 200 /* BreakStatement */ || node.kind === 199 /* ContinueStatement */) {
|
|
statementAccumulator.push(node);
|
|
}
|
|
else if (!ts.isFunctionLike(node)) {
|
|
ts.forEachChild(node, aggregate);
|
|
}
|
|
}
|
|
;
|
|
}
|
|
function ownsBreakOrContinueStatement(owner, statement) {
|
|
var actualOwner = getBreakOrContinueOwner(statement);
|
|
return actualOwner && actualOwner === owner;
|
|
}
|
|
function getBreakOrContinueOwner(statement) {
|
|
for (var node_2 = statement.parent; node_2; node_2 = node_2.parent) {
|
|
switch (node_2.kind) {
|
|
case 203 /* SwitchStatement */:
|
|
if (statement.kind === 199 /* ContinueStatement */) {
|
|
continue;
|
|
}
|
|
// Fall through.
|
|
case 196 /* ForStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
case 195 /* WhileStatement */:
|
|
case 194 /* DoStatement */:
|
|
if (!statement.label || isLabeledBy(node_2, statement.label.text)) {
|
|
return node_2;
|
|
}
|
|
break;
|
|
default:
|
|
// Don't cross function boundaries.
|
|
if (ts.isFunctionLike(node_2)) {
|
|
return undefined;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function getModifierOccurrences(modifier, declaration) {
|
|
var container = declaration.parent;
|
|
// Make sure we only highlight the keyword when it makes sense to do so.
|
|
if (ts.isAccessibilityModifier(modifier)) {
|
|
if (!(container.kind === 211 /* ClassDeclaration */ ||
|
|
container.kind === 183 /* ClassExpression */ ||
|
|
(declaration.kind === 135 /* Parameter */ && hasKind(container, 141 /* Constructor */)))) {
|
|
return undefined;
|
|
}
|
|
}
|
|
else if (modifier === 110 /* StaticKeyword */) {
|
|
if (!(container.kind === 211 /* ClassDeclaration */ || container.kind === 183 /* ClassExpression */)) {
|
|
return undefined;
|
|
}
|
|
}
|
|
else if (modifier === 79 /* ExportKeyword */ || modifier === 119 /* DeclareKeyword */) {
|
|
if (!(container.kind === 216 /* ModuleBlock */ || container.kind === 245 /* SourceFile */)) {
|
|
return undefined;
|
|
}
|
|
}
|
|
else if (modifier === 112 /* AbstractKeyword */) {
|
|
if (!(container.kind === 211 /* ClassDeclaration */ || declaration.kind === 211 /* ClassDeclaration */)) {
|
|
return undefined;
|
|
}
|
|
}
|
|
else {
|
|
// unsupported modifier
|
|
return undefined;
|
|
}
|
|
var keywords = [];
|
|
var modifierFlag = getFlagFromModifier(modifier);
|
|
var nodes;
|
|
switch (container.kind) {
|
|
case 216 /* ModuleBlock */:
|
|
case 245 /* SourceFile */:
|
|
// Container is either a class declaration or the declaration is a classDeclaration
|
|
if (modifierFlag & 256 /* Abstract */) {
|
|
nodes = declaration.members.concat(declaration);
|
|
}
|
|
else {
|
|
nodes = container.statements;
|
|
}
|
|
break;
|
|
case 141 /* Constructor */:
|
|
nodes = container.parameters.concat(container.parent.members);
|
|
break;
|
|
case 211 /* ClassDeclaration */:
|
|
case 183 /* ClassExpression */:
|
|
nodes = container.members;
|
|
// If we're an accessibility modifier, we're in an instance member and should search
|
|
// the constructor's parameter list for instance members as well.
|
|
if (modifierFlag & 112 /* AccessibilityModifier */) {
|
|
var constructor = ts.forEach(container.members, function (member) {
|
|
return member.kind === 141 /* Constructor */ && member;
|
|
});
|
|
if (constructor) {
|
|
nodes = nodes.concat(constructor.parameters);
|
|
}
|
|
}
|
|
else if (modifierFlag & 256 /* Abstract */) {
|
|
nodes = nodes.concat(container);
|
|
}
|
|
break;
|
|
default:
|
|
ts.Debug.fail("Invalid container kind.");
|
|
}
|
|
ts.forEach(nodes, function (node) {
|
|
if (node.modifiers && node.flags & modifierFlag) {
|
|
ts.forEach(node.modifiers, function (child) { return pushKeywordIf(keywords, child, modifier); });
|
|
}
|
|
});
|
|
return ts.map(keywords, getHighlightSpanForNode);
|
|
function getFlagFromModifier(modifier) {
|
|
switch (modifier) {
|
|
case 109 /* PublicKeyword */:
|
|
return 16 /* Public */;
|
|
case 107 /* PrivateKeyword */:
|
|
return 32 /* Private */;
|
|
case 108 /* ProtectedKeyword */:
|
|
return 64 /* Protected */;
|
|
case 110 /* StaticKeyword */:
|
|
return 128 /* Static */;
|
|
case 79 /* ExportKeyword */:
|
|
return 1 /* Export */;
|
|
case 119 /* DeclareKeyword */:
|
|
return 2 /* Ambient */;
|
|
case 112 /* AbstractKeyword */:
|
|
return 256 /* Abstract */;
|
|
default:
|
|
ts.Debug.fail();
|
|
}
|
|
}
|
|
}
|
|
function pushKeywordIf(keywordList, token) {
|
|
var expected = [];
|
|
for (var _i = 2; _i < arguments.length; _i++) {
|
|
expected[_i - 2] = arguments[_i];
|
|
}
|
|
if (token && ts.contains(expected, token.kind)) {
|
|
keywordList.push(token);
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
function getGetAndSetOccurrences(accessorDeclaration) {
|
|
var keywords = [];
|
|
tryPushAccessorKeyword(accessorDeclaration.symbol, 142 /* GetAccessor */);
|
|
tryPushAccessorKeyword(accessorDeclaration.symbol, 143 /* SetAccessor */);
|
|
return ts.map(keywords, getHighlightSpanForNode);
|
|
function tryPushAccessorKeyword(accessorSymbol, accessorKind) {
|
|
var accessor = ts.getDeclarationOfKind(accessorSymbol, accessorKind);
|
|
if (accessor) {
|
|
ts.forEach(accessor.getChildren(), function (child) { return pushKeywordIf(keywords, child, 120 /* GetKeyword */, 126 /* SetKeyword */); });
|
|
}
|
|
}
|
|
}
|
|
function getConstructorOccurrences(constructorDeclaration) {
|
|
var declarations = constructorDeclaration.symbol.getDeclarations();
|
|
var keywords = [];
|
|
ts.forEach(declarations, function (declaration) {
|
|
ts.forEach(declaration.getChildren(), function (token) {
|
|
return pushKeywordIf(keywords, token, 118 /* ConstructorKeyword */);
|
|
});
|
|
});
|
|
return ts.map(keywords, getHighlightSpanForNode);
|
|
}
|
|
function getLoopBreakContinueOccurrences(loopNode) {
|
|
var keywords = [];
|
|
if (pushKeywordIf(keywords, loopNode.getFirstToken(), 83 /* ForKeyword */, 101 /* WhileKeyword */, 76 /* DoKeyword */)) {
|
|
// If we succeeded and got a do-while loop, then start looking for a 'while' keyword.
|
|
if (loopNode.kind === 194 /* DoStatement */) {
|
|
var loopTokens = loopNode.getChildren();
|
|
for (var i = loopTokens.length - 1; i >= 0; i--) {
|
|
if (pushKeywordIf(keywords, loopTokens[i], 101 /* WhileKeyword */)) {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
var breaksAndContinues = aggregateAllBreakAndContinueStatements(loopNode.statement);
|
|
ts.forEach(breaksAndContinues, function (statement) {
|
|
if (ownsBreakOrContinueStatement(loopNode, statement)) {
|
|
pushKeywordIf(keywords, statement.getFirstToken(), 67 /* BreakKeyword */, 72 /* ContinueKeyword */);
|
|
}
|
|
});
|
|
return ts.map(keywords, getHighlightSpanForNode);
|
|
}
|
|
function getBreakOrContinueStatementOccurences(breakOrContinueStatement) {
|
|
var owner = getBreakOrContinueOwner(breakOrContinueStatement);
|
|
if (owner) {
|
|
switch (owner.kind) {
|
|
case 196 /* ForStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
case 194 /* DoStatement */:
|
|
case 195 /* WhileStatement */:
|
|
return getLoopBreakContinueOccurrences(owner);
|
|
case 203 /* SwitchStatement */:
|
|
return getSwitchCaseDefaultOccurrences(owner);
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
function getSwitchCaseDefaultOccurrences(switchStatement) {
|
|
var keywords = [];
|
|
pushKeywordIf(keywords, switchStatement.getFirstToken(), 93 /* SwitchKeyword */);
|
|
// Go through each clause in the switch statement, collecting the 'case'/'default' keywords.
|
|
ts.forEach(switchStatement.caseBlock.clauses, function (clause) {
|
|
pushKeywordIf(keywords, clause.getFirstToken(), 68 /* CaseKeyword */, 74 /* DefaultKeyword */);
|
|
var breaksAndContinues = aggregateAllBreakAndContinueStatements(clause);
|
|
ts.forEach(breaksAndContinues, function (statement) {
|
|
if (ownsBreakOrContinueStatement(switchStatement, statement)) {
|
|
pushKeywordIf(keywords, statement.getFirstToken(), 67 /* BreakKeyword */);
|
|
}
|
|
});
|
|
});
|
|
return ts.map(keywords, getHighlightSpanForNode);
|
|
}
|
|
function getTryCatchFinallyOccurrences(tryStatement) {
|
|
var keywords = [];
|
|
pushKeywordIf(keywords, tryStatement.getFirstToken(), 97 /* TryKeyword */);
|
|
if (tryStatement.catchClause) {
|
|
pushKeywordIf(keywords, tryStatement.catchClause.getFirstToken(), 69 /* CatchKeyword */);
|
|
}
|
|
if (tryStatement.finallyBlock) {
|
|
var finallyKeyword = ts.findChildOfKind(tryStatement, 82 /* FinallyKeyword */, sourceFile);
|
|
pushKeywordIf(keywords, finallyKeyword, 82 /* FinallyKeyword */);
|
|
}
|
|
return ts.map(keywords, getHighlightSpanForNode);
|
|
}
|
|
function getThrowOccurrences(throwStatement) {
|
|
var owner = getThrowStatementOwner(throwStatement);
|
|
if (!owner) {
|
|
return undefined;
|
|
}
|
|
var keywords = [];
|
|
ts.forEach(aggregateOwnedThrowStatements(owner), function (throwStatement) {
|
|
pushKeywordIf(keywords, throwStatement.getFirstToken(), 95 /* ThrowKeyword */);
|
|
});
|
|
// If the "owner" is a function, then we equate 'return' and 'throw' statements in their
|
|
// ability to "jump out" of the function, and include occurrences for both.
|
|
if (ts.isFunctionBlock(owner)) {
|
|
ts.forEachReturnStatement(owner, function (returnStatement) {
|
|
pushKeywordIf(keywords, returnStatement.getFirstToken(), 91 /* ReturnKeyword */);
|
|
});
|
|
}
|
|
return ts.map(keywords, getHighlightSpanForNode);
|
|
}
|
|
function getReturnOccurrences(returnStatement) {
|
|
var func = ts.getContainingFunction(returnStatement);
|
|
// If we didn't find a containing function with a block body, bail out.
|
|
if (!(func && hasKind(func.body, 189 /* Block */))) {
|
|
return undefined;
|
|
}
|
|
var keywords = [];
|
|
ts.forEachReturnStatement(func.body, function (returnStatement) {
|
|
pushKeywordIf(keywords, returnStatement.getFirstToken(), 91 /* ReturnKeyword */);
|
|
});
|
|
// Include 'throw' statements that do not occur within a try block.
|
|
ts.forEach(aggregateOwnedThrowStatements(func.body), function (throwStatement) {
|
|
pushKeywordIf(keywords, throwStatement.getFirstToken(), 95 /* ThrowKeyword */);
|
|
});
|
|
return ts.map(keywords, getHighlightSpanForNode);
|
|
}
|
|
function getIfElseOccurrences(ifStatement) {
|
|
var keywords = [];
|
|
// Traverse upwards through all parent if-statements linked by their else-branches.
|
|
while (hasKind(ifStatement.parent, 193 /* IfStatement */) && ifStatement.parent.elseStatement === ifStatement) {
|
|
ifStatement = ifStatement.parent;
|
|
}
|
|
// Now traverse back down through the else branches, aggregating if/else keywords of if-statements.
|
|
while (ifStatement) {
|
|
var children = ifStatement.getChildren();
|
|
pushKeywordIf(keywords, children[0], 85 /* IfKeyword */);
|
|
// Generally the 'else' keyword is second-to-last, so we traverse backwards.
|
|
for (var i = children.length - 1; i >= 0; i--) {
|
|
if (pushKeywordIf(keywords, children[i], 77 /* ElseKeyword */)) {
|
|
break;
|
|
}
|
|
}
|
|
if (!hasKind(ifStatement.elseStatement, 193 /* IfStatement */)) {
|
|
break;
|
|
}
|
|
ifStatement = ifStatement.elseStatement;
|
|
}
|
|
var result = [];
|
|
// We'd like to highlight else/ifs together if they are only separated by whitespace
|
|
// (i.e. the keywords are separated by no comments, no newlines).
|
|
for (var i = 0; i < keywords.length; i++) {
|
|
if (keywords[i].kind === 77 /* ElseKeyword */ && i < keywords.length - 1) {
|
|
var elseKeyword = keywords[i];
|
|
var ifKeyword = keywords[i + 1]; // this *should* always be an 'if' keyword.
|
|
var shouldCombindElseAndIf = true;
|
|
// Avoid recalculating getStart() by iterating backwards.
|
|
for (var j = ifKeyword.getStart() - 1; j >= elseKeyword.end; j--) {
|
|
if (!ts.isWhiteSpace(sourceFile.text.charCodeAt(j))) {
|
|
shouldCombindElseAndIf = false;
|
|
break;
|
|
}
|
|
}
|
|
if (shouldCombindElseAndIf) {
|
|
result.push({
|
|
fileName: fileName,
|
|
textSpan: ts.createTextSpanFromBounds(elseKeyword.getStart(), ifKeyword.end),
|
|
kind: HighlightSpanKind.reference
|
|
});
|
|
i++; // skip the next keyword
|
|
continue;
|
|
}
|
|
}
|
|
// Ordinary case: just highlight the keyword.
|
|
result.push(getHighlightSpanForNode(keywords[i]));
|
|
}
|
|
return result;
|
|
}
|
|
}
|
|
}
|
|
/// References and Occurrences
|
|
function getOccurrencesAtPositionCore(fileName, position) {
|
|
synchronizeHostData();
|
|
return convertDocumentHighlights(getDocumentHighlights(fileName, position, [fileName]));
|
|
function convertDocumentHighlights(documentHighlights) {
|
|
if (!documentHighlights) {
|
|
return undefined;
|
|
}
|
|
var result = [];
|
|
for (var _i = 0; _i < documentHighlights.length; _i++) {
|
|
var entry = documentHighlights[_i];
|
|
for (var _a = 0, _b = entry.highlightSpans; _a < _b.length; _a++) {
|
|
var highlightSpan = _b[_a];
|
|
result.push({
|
|
fileName: entry.fileName,
|
|
textSpan: highlightSpan.textSpan,
|
|
isWriteAccess: highlightSpan.kind === HighlightSpanKind.writtenReference
|
|
});
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
}
|
|
function convertReferences(referenceSymbols) {
|
|
if (!referenceSymbols) {
|
|
return undefined;
|
|
}
|
|
var referenceEntries = [];
|
|
for (var _i = 0; _i < referenceSymbols.length; _i++) {
|
|
var referenceSymbol = referenceSymbols[_i];
|
|
ts.addRange(referenceEntries, referenceSymbol.references);
|
|
}
|
|
return referenceEntries;
|
|
}
|
|
function findRenameLocations(fileName, position, findInStrings, findInComments) {
|
|
var referencedSymbols = findReferencedSymbols(fileName, position, findInStrings, findInComments);
|
|
return convertReferences(referencedSymbols);
|
|
}
|
|
function getReferencesAtPosition(fileName, position) {
|
|
var referencedSymbols = findReferencedSymbols(fileName, position, false, false);
|
|
return convertReferences(referencedSymbols);
|
|
}
|
|
function findReferences(fileName, position) {
|
|
var referencedSymbols = findReferencedSymbols(fileName, position, false, false);
|
|
// Only include referenced symbols that have a valid definition.
|
|
return ts.filter(referencedSymbols, function (rs) { return !!rs.definition; });
|
|
}
|
|
function findReferencedSymbols(fileName, position, findInStrings, findInComments) {
|
|
synchronizeHostData();
|
|
var sourceFile = getValidSourceFile(fileName);
|
|
var node = ts.getTouchingPropertyName(sourceFile, position);
|
|
if (!node) {
|
|
return undefined;
|
|
}
|
|
if (node.kind !== 66 /* Identifier */ &&
|
|
// TODO (drosen): This should be enabled in a later release - currently breaks rename.
|
|
//node.kind !== SyntaxKind.ThisKeyword &&
|
|
//node.kind !== SyntaxKind.SuperKeyword &&
|
|
!isLiteralNameOfPropertyDeclarationOrIndexAccess(node) &&
|
|
!isNameOfExternalModuleImportOrDeclaration(node)) {
|
|
return undefined;
|
|
}
|
|
ts.Debug.assert(node.kind === 66 /* Identifier */ || node.kind === 7 /* NumericLiteral */ || node.kind === 8 /* StringLiteral */);
|
|
return getReferencedSymbolsForNode(node, program.getSourceFiles(), findInStrings, findInComments);
|
|
}
|
|
function getReferencedSymbolsForNode(node, sourceFiles, findInStrings, findInComments) {
|
|
var typeChecker = program.getTypeChecker();
|
|
// Labels
|
|
if (isLabelName(node)) {
|
|
if (isJumpStatementTarget(node)) {
|
|
var labelDefinition = getTargetLabel(node.parent, node.text);
|
|
// if we have a label definition, look within its statement for references, if not, then
|
|
// the label is undefined and we have no results..
|
|
return labelDefinition ? getLabelReferencesInNode(labelDefinition.parent, labelDefinition) : undefined;
|
|
}
|
|
else {
|
|
// it is a label definition and not a target, search within the parent labeledStatement
|
|
return getLabelReferencesInNode(node.parent, node);
|
|
}
|
|
}
|
|
if (node.kind === 94 /* ThisKeyword */) {
|
|
return getReferencesForThisKeyword(node, sourceFiles);
|
|
}
|
|
if (node.kind === 92 /* SuperKeyword */) {
|
|
return getReferencesForSuperKeyword(node);
|
|
}
|
|
var symbol = typeChecker.getSymbolAtLocation(node);
|
|
// Could not find a symbol e.g. unknown identifier
|
|
if (!symbol) {
|
|
// Can't have references to something that we have no symbol for.
|
|
return undefined;
|
|
}
|
|
var declarations = symbol.declarations;
|
|
// The symbol was an internal symbol and does not have a declaration e.g. undefined symbol
|
|
if (!declarations || !declarations.length) {
|
|
return undefined;
|
|
}
|
|
var result;
|
|
// Compute the meaning from the location and the symbol it references
|
|
var searchMeaning = getIntersectingMeaningFromDeclarations(getMeaningFromLocation(node), declarations);
|
|
// Get the text to search for.
|
|
// Note: if this is an external module symbol, the name doesn't include quotes.
|
|
var declaredName = ts.stripQuotes(ts.getDeclaredName(typeChecker, symbol, node));
|
|
// Try to get the smallest valid scope that we can limit our search to;
|
|
// otherwise we'll need to search globally (i.e. include each file).
|
|
var scope = getSymbolScope(symbol);
|
|
// Maps from a symbol ID to the ReferencedSymbol entry in 'result'.
|
|
var symbolToIndex = [];
|
|
if (scope) {
|
|
result = [];
|
|
getReferencesInNode(scope, symbol, declaredName, node, searchMeaning, findInStrings, findInComments, result, symbolToIndex);
|
|
}
|
|
else {
|
|
var internedName = getInternedName(symbol, node, declarations);
|
|
for (var _i = 0; _i < sourceFiles.length; _i++) {
|
|
var sourceFile = sourceFiles[_i];
|
|
cancellationToken.throwIfCancellationRequested();
|
|
var nameTable = getNameTable(sourceFile);
|
|
if (ts.lookUp(nameTable, internedName)) {
|
|
result = result || [];
|
|
getReferencesInNode(sourceFile, symbol, declaredName, node, searchMeaning, findInStrings, findInComments, result, symbolToIndex);
|
|
}
|
|
}
|
|
}
|
|
return result;
|
|
function getDefinition(symbol) {
|
|
var info = getSymbolDisplayPartsDocumentationAndSymbolKind(symbol, node.getSourceFile(), getContainerNode(node), node);
|
|
var name = ts.map(info.displayParts, function (p) { return p.text; }).join("");
|
|
var declarations = symbol.declarations;
|
|
if (!declarations || declarations.length === 0) {
|
|
return undefined;
|
|
}
|
|
return {
|
|
containerKind: "",
|
|
containerName: "",
|
|
name: name,
|
|
kind: info.symbolKind,
|
|
fileName: declarations[0].getSourceFile().fileName,
|
|
textSpan: ts.createTextSpan(declarations[0].getStart(), 0)
|
|
};
|
|
}
|
|
function isImportOrExportSpecifierImportSymbol(symbol) {
|
|
return (symbol.flags & 8388608 /* Alias */) && ts.forEach(symbol.declarations, function (declaration) {
|
|
return declaration.kind === 223 /* ImportSpecifier */ || declaration.kind === 227 /* ExportSpecifier */;
|
|
});
|
|
}
|
|
function getInternedName(symbol, location, declarations) {
|
|
// If this is an export or import specifier it could have been renamed using the 'as' syntax.
|
|
// If so we want to search for whatever under the cursor.
|
|
if (ts.isImportOrExportSpecifierName(location)) {
|
|
return location.getText();
|
|
}
|
|
// Try to get the local symbol if we're dealing with an 'export default'
|
|
// since that symbol has the "true" name.
|
|
var localExportDefaultSymbol = ts.getLocalSymbolForExportDefault(symbol);
|
|
symbol = localExportDefaultSymbol || symbol;
|
|
return ts.stripQuotes(symbol.name);
|
|
}
|
|
/**
|
|
* Determines the smallest scope in which a symbol may have named references.
|
|
* Note that not every construct has been accounted for. This function can
|
|
* probably be improved.
|
|
*
|
|
* @returns undefined if the scope cannot be determined, implying that
|
|
* a reference to a symbol can occur anywhere.
|
|
*/
|
|
function getSymbolScope(symbol) {
|
|
// If this is the symbol of a named function expression or named class expression,
|
|
// then named references are limited to its own scope.
|
|
var valueDeclaration = symbol.valueDeclaration;
|
|
if (valueDeclaration && (valueDeclaration.kind === 170 /* FunctionExpression */ || valueDeclaration.kind === 183 /* ClassExpression */)) {
|
|
return valueDeclaration;
|
|
}
|
|
// If this is private property or method, the scope is the containing class
|
|
if (symbol.flags & (4 /* Property */ | 8192 /* Method */)) {
|
|
var privateDeclaration = ts.forEach(symbol.getDeclarations(), function (d) { return (d.flags & 32 /* Private */) ? d : undefined; });
|
|
if (privateDeclaration) {
|
|
return ts.getAncestor(privateDeclaration, 211 /* ClassDeclaration */);
|
|
}
|
|
}
|
|
// If the symbol is an import we would like to find it if we are looking for what it imports.
|
|
// So consider it visibile outside its declaration scope.
|
|
if (symbol.flags & 8388608 /* Alias */) {
|
|
return undefined;
|
|
}
|
|
// if this symbol is visible from its parent container, e.g. exported, then bail out
|
|
// if symbol correspond to the union property - bail out
|
|
if (symbol.parent || (symbol.flags & 268435456 /* SyntheticProperty */)) {
|
|
return undefined;
|
|
}
|
|
var scope = undefined;
|
|
var declarations = symbol.getDeclarations();
|
|
if (declarations) {
|
|
for (var _i = 0; _i < declarations.length; _i++) {
|
|
var declaration = declarations[_i];
|
|
var container = getContainerNode(declaration);
|
|
if (!container) {
|
|
return undefined;
|
|
}
|
|
if (scope && scope !== container) {
|
|
// Different declarations have different containers, bail out
|
|
return undefined;
|
|
}
|
|
if (container.kind === 245 /* SourceFile */ && !ts.isExternalModule(container)) {
|
|
// This is a global variable and not an external module, any declaration defined
|
|
// within this scope is visible outside the file
|
|
return undefined;
|
|
}
|
|
// The search scope is the container node
|
|
scope = container;
|
|
}
|
|
}
|
|
return scope;
|
|
}
|
|
function getPossibleSymbolReferencePositions(sourceFile, symbolName, start, end) {
|
|
var positions = [];
|
|
/// TODO: Cache symbol existence for files to save text search
|
|
// Also, need to make this work for unicode escapes.
|
|
// Be resilient in the face of a symbol with no name or zero length name
|
|
if (!symbolName || !symbolName.length) {
|
|
return positions;
|
|
}
|
|
var text = sourceFile.text;
|
|
var sourceLength = text.length;
|
|
var symbolNameLength = symbolName.length;
|
|
var position = text.indexOf(symbolName, start);
|
|
while (position >= 0) {
|
|
cancellationToken.throwIfCancellationRequested();
|
|
// If we are past the end, stop looking
|
|
if (position > end)
|
|
break;
|
|
// We found a match. Make sure it's not part of a larger word (i.e. the char
|
|
// before and after it have to be a non-identifier char).
|
|
var endPosition = position + symbolNameLength;
|
|
if ((position === 0 || !ts.isIdentifierPart(text.charCodeAt(position - 1), 2 /* Latest */)) &&
|
|
(endPosition === sourceLength || !ts.isIdentifierPart(text.charCodeAt(endPosition), 2 /* Latest */))) {
|
|
// Found a real match. Keep searching.
|
|
positions.push(position);
|
|
}
|
|
position = text.indexOf(symbolName, position + symbolNameLength + 1);
|
|
}
|
|
return positions;
|
|
}
|
|
function getLabelReferencesInNode(container, targetLabel) {
|
|
var references = [];
|
|
var sourceFile = container.getSourceFile();
|
|
var labelName = targetLabel.text;
|
|
var possiblePositions = getPossibleSymbolReferencePositions(sourceFile, labelName, container.getStart(), container.getEnd());
|
|
ts.forEach(possiblePositions, function (position) {
|
|
cancellationToken.throwIfCancellationRequested();
|
|
var node = ts.getTouchingWord(sourceFile, position);
|
|
if (!node || node.getWidth() !== labelName.length) {
|
|
return;
|
|
}
|
|
// Only pick labels that are either the target label, or have a target that is the target label
|
|
if (node === targetLabel ||
|
|
(isJumpStatementTarget(node) && getTargetLabel(node, labelName) === targetLabel)) {
|
|
references.push(getReferenceEntryFromNode(node));
|
|
}
|
|
});
|
|
var definition = {
|
|
containerKind: "",
|
|
containerName: "",
|
|
fileName: targetLabel.getSourceFile().fileName,
|
|
kind: ScriptElementKind.label,
|
|
name: labelName,
|
|
textSpan: ts.createTextSpanFromBounds(targetLabel.getStart(), targetLabel.getEnd())
|
|
};
|
|
return [{ definition: definition, references: references }];
|
|
}
|
|
function isValidReferencePosition(node, searchSymbolName) {
|
|
if (node) {
|
|
// Compare the length so we filter out strict superstrings of the symbol we are looking for
|
|
switch (node.kind) {
|
|
case 66 /* Identifier */:
|
|
return node.getWidth() === searchSymbolName.length;
|
|
case 8 /* StringLiteral */:
|
|
if (isLiteralNameOfPropertyDeclarationOrIndexAccess(node) ||
|
|
isNameOfExternalModuleImportOrDeclaration(node)) {
|
|
// For string literals we have two additional chars for the quotes
|
|
return node.getWidth() === searchSymbolName.length + 2;
|
|
}
|
|
break;
|
|
case 7 /* NumericLiteral */:
|
|
if (isLiteralNameOfPropertyDeclarationOrIndexAccess(node)) {
|
|
return node.getWidth() === searchSymbolName.length;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
/** Search within node "container" for references for a search value, where the search value is defined as a
|
|
* tuple of(searchSymbol, searchText, searchLocation, and searchMeaning).
|
|
* searchLocation: a node where the search value
|
|
*/
|
|
function getReferencesInNode(container, searchSymbol, searchText, searchLocation, searchMeaning, findInStrings, findInComments, result, symbolToIndex) {
|
|
var sourceFile = container.getSourceFile();
|
|
var tripleSlashDirectivePrefixRegex = /^\/\/\/\s*</;
|
|
var possiblePositions = getPossibleSymbolReferencePositions(sourceFile, searchText, container.getStart(), container.getEnd());
|
|
if (possiblePositions.length) {
|
|
// Build the set of symbols to search for, initially it has only the current symbol
|
|
var searchSymbols = populateSearchSymbolSet(searchSymbol, searchLocation);
|
|
ts.forEach(possiblePositions, function (position) {
|
|
cancellationToken.throwIfCancellationRequested();
|
|
var referenceLocation = ts.getTouchingPropertyName(sourceFile, position);
|
|
if (!isValidReferencePosition(referenceLocation, searchText)) {
|
|
// This wasn't the start of a token. Check to see if it might be a
|
|
// match in a comment or string if that's what the caller is asking
|
|
// for.
|
|
if ((findInStrings && isInString(position)) ||
|
|
(findInComments && isInComment(position))) {
|
|
// In the case where we're looking inside comments/strings, we don't have
|
|
// an actual definition. So just use 'undefined' here. Features like
|
|
// 'Rename' won't care (as they ignore the definitions), and features like
|
|
// 'FindReferences' will just filter out these results.
|
|
result.push({
|
|
definition: undefined,
|
|
references: [{
|
|
fileName: sourceFile.fileName,
|
|
textSpan: ts.createTextSpan(position, searchText.length),
|
|
isWriteAccess: false
|
|
}]
|
|
});
|
|
}
|
|
return;
|
|
}
|
|
if (!(getMeaningFromLocation(referenceLocation) & searchMeaning)) {
|
|
return;
|
|
}
|
|
var referenceSymbol = typeChecker.getSymbolAtLocation(referenceLocation);
|
|
if (referenceSymbol) {
|
|
var referenceSymbolDeclaration = referenceSymbol.valueDeclaration;
|
|
var shorthandValueSymbol = typeChecker.getShorthandAssignmentValueSymbol(referenceSymbolDeclaration);
|
|
var relatedSymbol = getRelatedSymbol(searchSymbols, referenceSymbol, referenceLocation);
|
|
if (relatedSymbol) {
|
|
var referencedSymbol = getReferencedSymbol(relatedSymbol);
|
|
referencedSymbol.references.push(getReferenceEntryFromNode(referenceLocation));
|
|
}
|
|
else if (!(referenceSymbol.flags & 67108864 /* Transient */) && searchSymbols.indexOf(shorthandValueSymbol) >= 0) {
|
|
var referencedSymbol = getReferencedSymbol(shorthandValueSymbol);
|
|
referencedSymbol.references.push(getReferenceEntryFromNode(referenceSymbolDeclaration.name));
|
|
}
|
|
}
|
|
});
|
|
}
|
|
return;
|
|
function getReferencedSymbol(symbol) {
|
|
var symbolId = ts.getSymbolId(symbol);
|
|
var index = symbolToIndex[symbolId];
|
|
if (index === undefined) {
|
|
index = result.length;
|
|
symbolToIndex[symbolId] = index;
|
|
result.push({
|
|
definition: getDefinition(symbol),
|
|
references: []
|
|
});
|
|
}
|
|
return result[index];
|
|
}
|
|
function isInString(position) {
|
|
var token = ts.getTokenAtPosition(sourceFile, position);
|
|
return token && token.kind === 8 /* StringLiteral */ && position > token.getStart();
|
|
}
|
|
function isInComment(position) {
|
|
var token = ts.getTokenAtPosition(sourceFile, position);
|
|
if (token && position < token.getStart()) {
|
|
// First, we have to see if this position actually landed in a comment.
|
|
var commentRanges = ts.getLeadingCommentRanges(sourceFile.text, token.pos);
|
|
// Then we want to make sure that it wasn't in a "///<" directive comment
|
|
// We don't want to unintentionally update a file name.
|
|
return ts.forEach(commentRanges, function (c) {
|
|
if (c.pos < position && position < c.end) {
|
|
var commentText = sourceFile.text.substring(c.pos, c.end);
|
|
if (!tripleSlashDirectivePrefixRegex.test(commentText)) {
|
|
return true;
|
|
}
|
|
}
|
|
});
|
|
}
|
|
return false;
|
|
}
|
|
}
|
|
function getReferencesForSuperKeyword(superKeyword) {
|
|
var searchSpaceNode = ts.getSuperContainer(superKeyword, false);
|
|
if (!searchSpaceNode) {
|
|
return undefined;
|
|
}
|
|
// Whether 'super' occurs in a static context within a class.
|
|
var staticFlag = 128 /* Static */;
|
|
switch (searchSpaceNode.kind) {
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 141 /* Constructor */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
staticFlag &= searchSpaceNode.flags;
|
|
searchSpaceNode = searchSpaceNode.parent; // re-assign to be the owning class
|
|
break;
|
|
default:
|
|
return undefined;
|
|
}
|
|
var references = [];
|
|
var sourceFile = searchSpaceNode.getSourceFile();
|
|
var possiblePositions = getPossibleSymbolReferencePositions(sourceFile, "super", searchSpaceNode.getStart(), searchSpaceNode.getEnd());
|
|
ts.forEach(possiblePositions, function (position) {
|
|
cancellationToken.throwIfCancellationRequested();
|
|
var node = ts.getTouchingWord(sourceFile, position);
|
|
if (!node || node.kind !== 92 /* SuperKeyword */) {
|
|
return;
|
|
}
|
|
var container = ts.getSuperContainer(node, false);
|
|
// If we have a 'super' container, we must have an enclosing class.
|
|
// Now make sure the owning class is the same as the search-space
|
|
// and has the same static qualifier as the original 'super's owner.
|
|
if (container && (128 /* Static */ & container.flags) === staticFlag && container.parent.symbol === searchSpaceNode.symbol) {
|
|
references.push(getReferenceEntryFromNode(node));
|
|
}
|
|
});
|
|
var definition = getDefinition(searchSpaceNode.symbol);
|
|
return [{ definition: definition, references: references }];
|
|
}
|
|
function getReferencesForThisKeyword(thisOrSuperKeyword, sourceFiles) {
|
|
var searchSpaceNode = ts.getThisContainer(thisOrSuperKeyword, false);
|
|
// Whether 'this' occurs in a static context within a class.
|
|
var staticFlag = 128 /* Static */;
|
|
switch (searchSpaceNode.kind) {
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
if (ts.isObjectLiteralMethod(searchSpaceNode)) {
|
|
break;
|
|
}
|
|
// fall through
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 141 /* Constructor */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
staticFlag &= searchSpaceNode.flags;
|
|
searchSpaceNode = searchSpaceNode.parent; // re-assign to be the owning class
|
|
break;
|
|
case 245 /* SourceFile */:
|
|
if (ts.isExternalModule(searchSpaceNode)) {
|
|
return undefined;
|
|
}
|
|
// Fall through
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
break;
|
|
// Computed properties in classes are not handled here because references to this are illegal,
|
|
// so there is no point finding references to them.
|
|
default:
|
|
return undefined;
|
|
}
|
|
var references = [];
|
|
var possiblePositions;
|
|
if (searchSpaceNode.kind === 245 /* SourceFile */) {
|
|
ts.forEach(sourceFiles, function (sourceFile) {
|
|
possiblePositions = getPossibleSymbolReferencePositions(sourceFile, "this", sourceFile.getStart(), sourceFile.getEnd());
|
|
getThisReferencesInFile(sourceFile, sourceFile, possiblePositions, references);
|
|
});
|
|
}
|
|
else {
|
|
var sourceFile = searchSpaceNode.getSourceFile();
|
|
possiblePositions = getPossibleSymbolReferencePositions(sourceFile, "this", searchSpaceNode.getStart(), searchSpaceNode.getEnd());
|
|
getThisReferencesInFile(sourceFile, searchSpaceNode, possiblePositions, references);
|
|
}
|
|
return [{
|
|
definition: {
|
|
containerKind: "",
|
|
containerName: "",
|
|
fileName: node.getSourceFile().fileName,
|
|
kind: ScriptElementKind.variableElement,
|
|
name: "this",
|
|
textSpan: ts.createTextSpanFromBounds(node.getStart(), node.getEnd())
|
|
},
|
|
references: references
|
|
}];
|
|
function getThisReferencesInFile(sourceFile, searchSpaceNode, possiblePositions, result) {
|
|
ts.forEach(possiblePositions, function (position) {
|
|
cancellationToken.throwIfCancellationRequested();
|
|
var node = ts.getTouchingWord(sourceFile, position);
|
|
if (!node || node.kind !== 94 /* ThisKeyword */) {
|
|
return;
|
|
}
|
|
var container = ts.getThisContainer(node, false);
|
|
switch (searchSpaceNode.kind) {
|
|
case 170 /* FunctionExpression */:
|
|
case 210 /* FunctionDeclaration */:
|
|
if (searchSpaceNode.symbol === container.symbol) {
|
|
result.push(getReferenceEntryFromNode(node));
|
|
}
|
|
break;
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
if (ts.isObjectLiteralMethod(searchSpaceNode) && searchSpaceNode.symbol === container.symbol) {
|
|
result.push(getReferenceEntryFromNode(node));
|
|
}
|
|
break;
|
|
case 211 /* ClassDeclaration */:
|
|
// Make sure the container belongs to the same class
|
|
// and has the appropriate static modifier from the original container.
|
|
if (container.parent && searchSpaceNode.symbol === container.parent.symbol && (container.flags & 128 /* Static */) === staticFlag) {
|
|
result.push(getReferenceEntryFromNode(node));
|
|
}
|
|
break;
|
|
case 245 /* SourceFile */:
|
|
if (container.kind === 245 /* SourceFile */ && !ts.isExternalModule(container)) {
|
|
result.push(getReferenceEntryFromNode(node));
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
}
|
|
}
|
|
function populateSearchSymbolSet(symbol, location) {
|
|
// The search set contains at least the current symbol
|
|
var result = [symbol];
|
|
// If the symbol is an alias, add what it alaises to the list
|
|
if (isImportOrExportSpecifierImportSymbol(symbol)) {
|
|
result.push(typeChecker.getAliasedSymbol(symbol));
|
|
}
|
|
// If the location is in a context sensitive location (i.e. in an object literal) try
|
|
// to get a contextual type for it, and add the property symbol from the contextual
|
|
// type to the search set
|
|
if (isNameOfPropertyAssignment(location)) {
|
|
ts.forEach(getPropertySymbolsFromContextualType(location), function (contextualSymbol) {
|
|
ts.addRange(result, typeChecker.getRootSymbols(contextualSymbol));
|
|
});
|
|
/* Because in short-hand property assignment, location has two meaning : property name and as value of the property
|
|
* When we do findAllReference at the position of the short-hand property assignment, we would want to have references to position of
|
|
* property name and variable declaration of the identifier.
|
|
* Like in below example, when querying for all references for an identifier 'name', of the property assignment, the language service
|
|
* should show both 'name' in 'obj' and 'name' in variable declaration
|
|
* let name = "Foo";
|
|
* let obj = { name };
|
|
* In order to do that, we will populate the search set with the value symbol of the identifier as a value of the property assignment
|
|
* so that when matching with potential reference symbol, both symbols from property declaration and variable declaration
|
|
* will be included correctly.
|
|
*/
|
|
var shorthandValueSymbol = typeChecker.getShorthandAssignmentValueSymbol(location.parent);
|
|
if (shorthandValueSymbol) {
|
|
result.push(shorthandValueSymbol);
|
|
}
|
|
}
|
|
// If this is a union property, add all the symbols from all its source symbols in all unioned types.
|
|
// If the symbol is an instantiation from a another symbol (e.g. widened symbol) , add the root the list
|
|
ts.forEach(typeChecker.getRootSymbols(symbol), function (rootSymbol) {
|
|
if (rootSymbol !== symbol) {
|
|
result.push(rootSymbol);
|
|
}
|
|
// Add symbol of properties/methods of the same name in base classes and implemented interfaces definitions
|
|
if (rootSymbol.parent && rootSymbol.parent.flags & (32 /* Class */ | 64 /* Interface */)) {
|
|
getPropertySymbolsFromBaseTypes(rootSymbol.parent, rootSymbol.getName(), result);
|
|
}
|
|
});
|
|
return result;
|
|
}
|
|
function getPropertySymbolsFromBaseTypes(symbol, propertyName, result) {
|
|
if (symbol && symbol.flags & (32 /* Class */ | 64 /* Interface */)) {
|
|
ts.forEach(symbol.getDeclarations(), function (declaration) {
|
|
if (declaration.kind === 211 /* ClassDeclaration */) {
|
|
getPropertySymbolFromTypeReference(ts.getClassExtendsHeritageClauseElement(declaration));
|
|
ts.forEach(ts.getClassImplementsHeritageClauseElements(declaration), getPropertySymbolFromTypeReference);
|
|
}
|
|
else if (declaration.kind === 212 /* InterfaceDeclaration */) {
|
|
ts.forEach(ts.getInterfaceBaseTypeNodes(declaration), getPropertySymbolFromTypeReference);
|
|
}
|
|
});
|
|
}
|
|
return;
|
|
function getPropertySymbolFromTypeReference(typeReference) {
|
|
if (typeReference) {
|
|
var type = typeChecker.getTypeAtLocation(typeReference);
|
|
if (type) {
|
|
var propertySymbol = typeChecker.getPropertyOfType(type, propertyName);
|
|
if (propertySymbol) {
|
|
result.push(propertySymbol);
|
|
}
|
|
// Visit the typeReference as well to see if it directly or indirectly use that property
|
|
getPropertySymbolsFromBaseTypes(type.symbol, propertyName, result);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function getRelatedSymbol(searchSymbols, referenceSymbol, referenceLocation) {
|
|
if (searchSymbols.indexOf(referenceSymbol) >= 0) {
|
|
return referenceSymbol;
|
|
}
|
|
// If the reference symbol is an alias, check if what it is aliasing is one of the search
|
|
// symbols.
|
|
if (isImportOrExportSpecifierImportSymbol(referenceSymbol)) {
|
|
var aliasedSymbol = typeChecker.getAliasedSymbol(referenceSymbol);
|
|
if (searchSymbols.indexOf(aliasedSymbol) >= 0) {
|
|
return aliasedSymbol;
|
|
}
|
|
}
|
|
// If the reference location is in an object literal, try to get the contextual type for the
|
|
// object literal, lookup the property symbol in the contextual type, and use this symbol to
|
|
// compare to our searchSymbol
|
|
if (isNameOfPropertyAssignment(referenceLocation)) {
|
|
return ts.forEach(getPropertySymbolsFromContextualType(referenceLocation), function (contextualSymbol) {
|
|
return ts.forEach(typeChecker.getRootSymbols(contextualSymbol), function (s) { return searchSymbols.indexOf(s) >= 0 ? s : undefined; });
|
|
});
|
|
}
|
|
// Unwrap symbols to get to the root (e.g. transient symbols as a result of widening)
|
|
// Or a union property, use its underlying unioned symbols
|
|
return ts.forEach(typeChecker.getRootSymbols(referenceSymbol), function (rootSymbol) {
|
|
// if it is in the list, then we are done
|
|
if (searchSymbols.indexOf(rootSymbol) >= 0) {
|
|
return rootSymbol;
|
|
}
|
|
// Finally, try all properties with the same name in any type the containing type extended or implemented, and
|
|
// see if any is in the list
|
|
if (rootSymbol.parent && rootSymbol.parent.flags & (32 /* Class */ | 64 /* Interface */)) {
|
|
var result_3 = [];
|
|
getPropertySymbolsFromBaseTypes(rootSymbol.parent, rootSymbol.getName(), result_3);
|
|
return ts.forEach(result_3, function (s) { return searchSymbols.indexOf(s) >= 0 ? s : undefined; });
|
|
}
|
|
return undefined;
|
|
});
|
|
}
|
|
function getPropertySymbolsFromContextualType(node) {
|
|
if (isNameOfPropertyAssignment(node)) {
|
|
var objectLiteral = node.parent.parent;
|
|
var contextualType = typeChecker.getContextualType(objectLiteral);
|
|
var name_33 = node.text;
|
|
if (contextualType) {
|
|
if (contextualType.flags & 16384 /* Union */) {
|
|
// This is a union type, first see if the property we are looking for is a union property (i.e. exists in all types)
|
|
// if not, search the constituent types for the property
|
|
var unionProperty = contextualType.getProperty(name_33);
|
|
if (unionProperty) {
|
|
return [unionProperty];
|
|
}
|
|
else {
|
|
var result_4 = [];
|
|
ts.forEach(contextualType.types, function (t) {
|
|
var symbol = t.getProperty(name_33);
|
|
if (symbol) {
|
|
result_4.push(symbol);
|
|
}
|
|
});
|
|
return result_4;
|
|
}
|
|
}
|
|
else {
|
|
var symbol_1 = contextualType.getProperty(name_33);
|
|
if (symbol_1) {
|
|
return [symbol_1];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return undefined;
|
|
}
|
|
/** Given an initial searchMeaning, extracted from a location, widen the search scope based on the declarations
|
|
* of the corresponding symbol. e.g. if we are searching for "Foo" in value position, but "Foo" references a class
|
|
* then we need to widen the search to include type positions as well.
|
|
* On the contrary, if we are searching for "Bar" in type position and we trace bar to an interface, and an uninstantiated
|
|
* module, we want to keep the search limited to only types, as the two declarations (interface and uninstantiated module)
|
|
* do not intersect in any of the three spaces.
|
|
*/
|
|
function getIntersectingMeaningFromDeclarations(meaning, declarations) {
|
|
if (declarations) {
|
|
var lastIterationMeaning;
|
|
do {
|
|
// The result is order-sensitive, for instance if initialMeaning === Namespace, and declarations = [class, instantiated module]
|
|
// we need to consider both as they initialMeaning intersects with the module in the namespace space, and the module
|
|
// intersects with the class in the value space.
|
|
// To achieve that we will keep iterating until the result stabilizes.
|
|
// Remember the last meaning
|
|
lastIterationMeaning = meaning;
|
|
for (var _i = 0; _i < declarations.length; _i++) {
|
|
var declaration = declarations[_i];
|
|
var declarationMeaning = getMeaningFromDeclaration(declaration);
|
|
if (declarationMeaning & meaning) {
|
|
meaning |= declarationMeaning;
|
|
}
|
|
}
|
|
} while (meaning !== lastIterationMeaning);
|
|
}
|
|
return meaning;
|
|
}
|
|
}
|
|
function getReferenceEntryFromNode(node) {
|
|
var start = node.getStart();
|
|
var end = node.getEnd();
|
|
if (node.kind === 8 /* StringLiteral */) {
|
|
start += 1;
|
|
end -= 1;
|
|
}
|
|
return {
|
|
fileName: node.getSourceFile().fileName,
|
|
textSpan: ts.createTextSpanFromBounds(start, end),
|
|
isWriteAccess: isWriteAccess(node)
|
|
};
|
|
}
|
|
/** A node is considered a writeAccess iff it is a name of a declaration or a target of an assignment */
|
|
function isWriteAccess(node) {
|
|
if (node.kind === 66 /* Identifier */ && ts.isDeclarationName(node)) {
|
|
return true;
|
|
}
|
|
var parent = node.parent;
|
|
if (parent) {
|
|
if (parent.kind === 177 /* PostfixUnaryExpression */ || parent.kind === 176 /* PrefixUnaryExpression */) {
|
|
return true;
|
|
}
|
|
else if (parent.kind === 178 /* BinaryExpression */ && parent.left === node) {
|
|
var operator = parent.operatorToken.kind;
|
|
return 54 /* FirstAssignment */ <= operator && operator <= 65 /* LastAssignment */;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
/// NavigateTo
|
|
function getNavigateToItems(searchValue, maxResultCount) {
|
|
synchronizeHostData();
|
|
return ts.NavigateTo.getNavigateToItems(program, cancellationToken, searchValue, maxResultCount);
|
|
}
|
|
function containErrors(diagnostics) {
|
|
return ts.forEach(diagnostics, function (diagnostic) { return diagnostic.category === ts.DiagnosticCategory.Error; });
|
|
}
|
|
function getEmitOutput(fileName) {
|
|
synchronizeHostData();
|
|
var sourceFile = getValidSourceFile(fileName);
|
|
var outputFiles = [];
|
|
function writeFile(fileName, data, writeByteOrderMark) {
|
|
outputFiles.push({
|
|
name: fileName,
|
|
writeByteOrderMark: writeByteOrderMark,
|
|
text: data
|
|
});
|
|
}
|
|
var emitOutput = program.emit(sourceFile, writeFile, cancellationToken);
|
|
return {
|
|
outputFiles: outputFiles,
|
|
emitSkipped: emitOutput.emitSkipped
|
|
};
|
|
}
|
|
function getMeaningFromDeclaration(node) {
|
|
switch (node.kind) {
|
|
case 135 /* Parameter */:
|
|
case 208 /* VariableDeclaration */:
|
|
case 160 /* BindingElement */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
case 242 /* PropertyAssignment */:
|
|
case 243 /* ShorthandPropertyAssignment */:
|
|
case 244 /* EnumMember */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 141 /* Constructor */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
case 241 /* CatchClause */:
|
|
return 1 /* Value */;
|
|
case 134 /* TypeParameter */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 213 /* TypeAliasDeclaration */:
|
|
case 152 /* TypeLiteral */:
|
|
return 2 /* Type */;
|
|
case 211 /* ClassDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
return 1 /* Value */ | 2 /* Type */;
|
|
case 215 /* ModuleDeclaration */:
|
|
if (node.name.kind === 8 /* StringLiteral */) {
|
|
return 4 /* Namespace */ | 1 /* Value */;
|
|
}
|
|
else if (ts.getModuleInstanceState(node) === 1 /* Instantiated */) {
|
|
return 4 /* Namespace */ | 1 /* Value */;
|
|
}
|
|
else {
|
|
return 4 /* Namespace */;
|
|
}
|
|
case 222 /* NamedImports */:
|
|
case 223 /* ImportSpecifier */:
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
case 219 /* ImportDeclaration */:
|
|
case 224 /* ExportAssignment */:
|
|
case 225 /* ExportDeclaration */:
|
|
return 1 /* Value */ | 2 /* Type */ | 4 /* Namespace */;
|
|
// An external module can be a Value
|
|
case 245 /* SourceFile */:
|
|
return 4 /* Namespace */ | 1 /* Value */;
|
|
}
|
|
return 1 /* Value */ | 2 /* Type */ | 4 /* Namespace */;
|
|
ts.Debug.fail("Unknown declaration type");
|
|
}
|
|
function isTypeReference(node) {
|
|
if (ts.isRightSideOfQualifiedNameOrPropertyAccess(node)) {
|
|
node = node.parent;
|
|
}
|
|
return node.parent.kind === 148 /* TypeReference */ ||
|
|
(node.parent.kind === 185 /* ExpressionWithTypeArguments */ && !ts.isExpressionWithTypeArgumentsInClassExtendsClause(node.parent));
|
|
}
|
|
function isNamespaceReference(node) {
|
|
return isQualifiedNameNamespaceReference(node) || isPropertyAccessNamespaceReference(node);
|
|
}
|
|
function isPropertyAccessNamespaceReference(node) {
|
|
var root = node;
|
|
var isLastClause = true;
|
|
if (root.parent.kind === 163 /* PropertyAccessExpression */) {
|
|
while (root.parent && root.parent.kind === 163 /* PropertyAccessExpression */) {
|
|
root = root.parent;
|
|
}
|
|
isLastClause = root.name === node;
|
|
}
|
|
if (!isLastClause && root.parent.kind === 185 /* ExpressionWithTypeArguments */ && root.parent.parent.kind === 240 /* HeritageClause */) {
|
|
var decl = root.parent.parent.parent;
|
|
return (decl.kind === 211 /* ClassDeclaration */ && root.parent.parent.token === 103 /* ImplementsKeyword */) ||
|
|
(decl.kind === 212 /* InterfaceDeclaration */ && root.parent.parent.token === 80 /* ExtendsKeyword */);
|
|
}
|
|
return false;
|
|
}
|
|
function isQualifiedNameNamespaceReference(node) {
|
|
var root = node;
|
|
var isLastClause = true;
|
|
if (root.parent.kind === 132 /* QualifiedName */) {
|
|
while (root.parent && root.parent.kind === 132 /* QualifiedName */) {
|
|
root = root.parent;
|
|
}
|
|
isLastClause = root.right === node;
|
|
}
|
|
return root.parent.kind === 148 /* TypeReference */ && !isLastClause;
|
|
}
|
|
function isInRightSideOfImport(node) {
|
|
while (node.parent.kind === 132 /* QualifiedName */) {
|
|
node = node.parent;
|
|
}
|
|
return ts.isInternalModuleImportEqualsDeclaration(node.parent) && node.parent.moduleReference === node;
|
|
}
|
|
function getMeaningFromRightHandSideOfImportEquals(node) {
|
|
ts.Debug.assert(node.kind === 66 /* Identifier */);
|
|
// import a = |b|; // Namespace
|
|
// import a = |b.c|; // Value, type, namespace
|
|
// import a = |b.c|.d; // Namespace
|
|
if (node.parent.kind === 132 /* QualifiedName */ &&
|
|
node.parent.right === node &&
|
|
node.parent.parent.kind === 218 /* ImportEqualsDeclaration */) {
|
|
return 1 /* Value */ | 2 /* Type */ | 4 /* Namespace */;
|
|
}
|
|
return 4 /* Namespace */;
|
|
}
|
|
function getMeaningFromLocation(node) {
|
|
if (node.parent.kind === 224 /* ExportAssignment */) {
|
|
return 1 /* Value */ | 2 /* Type */ | 4 /* Namespace */;
|
|
}
|
|
else if (isInRightSideOfImport(node)) {
|
|
return getMeaningFromRightHandSideOfImportEquals(node);
|
|
}
|
|
else if (ts.isDeclarationName(node)) {
|
|
return getMeaningFromDeclaration(node.parent);
|
|
}
|
|
else if (isTypeReference(node)) {
|
|
return 2 /* Type */;
|
|
}
|
|
else if (isNamespaceReference(node)) {
|
|
return 4 /* Namespace */;
|
|
}
|
|
else {
|
|
return 1 /* Value */;
|
|
}
|
|
}
|
|
// Signature help
|
|
/**
|
|
* This is a semantic operation.
|
|
*/
|
|
function getSignatureHelpItems(fileName, position) {
|
|
synchronizeHostData();
|
|
var sourceFile = getValidSourceFile(fileName);
|
|
return ts.SignatureHelp.getSignatureHelpItems(program, sourceFile, position, cancellationToken);
|
|
}
|
|
/// Syntactic features
|
|
function getSourceFile(fileName) {
|
|
return syntaxTreeCache.getCurrentSourceFile(fileName);
|
|
}
|
|
function getNameOrDottedNameSpan(fileName, startPos, endPos) {
|
|
var sourceFile = syntaxTreeCache.getCurrentSourceFile(fileName);
|
|
// Get node at the location
|
|
var node = ts.getTouchingPropertyName(sourceFile, startPos);
|
|
if (!node) {
|
|
return;
|
|
}
|
|
switch (node.kind) {
|
|
case 163 /* PropertyAccessExpression */:
|
|
case 132 /* QualifiedName */:
|
|
case 8 /* StringLiteral */:
|
|
case 81 /* FalseKeyword */:
|
|
case 96 /* TrueKeyword */:
|
|
case 90 /* NullKeyword */:
|
|
case 92 /* SuperKeyword */:
|
|
case 94 /* ThisKeyword */:
|
|
case 66 /* Identifier */:
|
|
break;
|
|
// Cant create the text span
|
|
default:
|
|
return;
|
|
}
|
|
var nodeForStartPos = node;
|
|
while (true) {
|
|
if (isRightSideOfPropertyAccess(nodeForStartPos) || isRightSideOfQualifiedName(nodeForStartPos)) {
|
|
// If on the span is in right side of the the property or qualified name, return the span from the qualified name pos to end of this node
|
|
nodeForStartPos = nodeForStartPos.parent;
|
|
}
|
|
else if (isNameOfModuleDeclaration(nodeForStartPos)) {
|
|
// If this is name of a module declarations, check if this is right side of dotted module name
|
|
// If parent of the module declaration which is parent of this node is module declaration and its body is the module declaration that this node is name of
|
|
// Then this name is name from dotted module
|
|
if (nodeForStartPos.parent.parent.kind === 215 /* ModuleDeclaration */ &&
|
|
nodeForStartPos.parent.parent.body === nodeForStartPos.parent) {
|
|
// Use parent module declarations name for start pos
|
|
nodeForStartPos = nodeForStartPos.parent.parent.name;
|
|
}
|
|
else {
|
|
// We have to use this name for start pos
|
|
break;
|
|
}
|
|
}
|
|
else {
|
|
// Is not a member expression so we have found the node for start pos
|
|
break;
|
|
}
|
|
}
|
|
return ts.createTextSpanFromBounds(nodeForStartPos.getStart(), node.getEnd());
|
|
}
|
|
function getBreakpointStatementAtPosition(fileName, position) {
|
|
// doesn't use compiler - no need to synchronize with host
|
|
var sourceFile = syntaxTreeCache.getCurrentSourceFile(fileName);
|
|
return ts.BreakpointResolver.spanInSourceFileAtLocation(sourceFile, position);
|
|
}
|
|
function getNavigationBarItems(fileName) {
|
|
var sourceFile = syntaxTreeCache.getCurrentSourceFile(fileName);
|
|
return ts.NavigationBar.getNavigationBarItems(sourceFile);
|
|
}
|
|
function getSemanticClassifications(fileName, span) {
|
|
return convertClassifications(getEncodedSemanticClassifications(fileName, span));
|
|
}
|
|
function checkForClassificationCancellation(kind) {
|
|
// We don't want to actually call back into our host on every node to find out if we've
|
|
// been canceled. That would be an enormous amount of chattyness, along with the all
|
|
// the overhead of marshalling the data to/from the host. So instead we pick a few
|
|
// reasonable node kinds to bother checking on. These node kinds represent high level
|
|
// constructs that we would expect to see commonly, but just at a far less frequent
|
|
// interval.
|
|
//
|
|
// For example, in checker.ts (around 750k) we only have around 600 of these constructs.
|
|
// That means we're calling back into the host around every 1.2k of the file we process.
|
|
// Lib.d.ts has similar numbers.
|
|
switch (kind) {
|
|
case 215 /* ModuleDeclaration */:
|
|
case 211 /* ClassDeclaration */:
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 210 /* FunctionDeclaration */:
|
|
cancellationToken.throwIfCancellationRequested();
|
|
}
|
|
}
|
|
function getEncodedSemanticClassifications(fileName, span) {
|
|
synchronizeHostData();
|
|
var sourceFile = getValidSourceFile(fileName);
|
|
var typeChecker = program.getTypeChecker();
|
|
var result = [];
|
|
var classifiableNames = program.getClassifiableNames();
|
|
processNode(sourceFile);
|
|
return { spans: result, endOfLineState: 0 /* None */ };
|
|
function pushClassification(start, length, type) {
|
|
result.push(start);
|
|
result.push(length);
|
|
result.push(type);
|
|
}
|
|
function classifySymbol(symbol, meaningAtPosition) {
|
|
var flags = symbol.getFlags();
|
|
if ((flags & 788448 /* Classifiable */) === 0 /* None */) {
|
|
return;
|
|
}
|
|
if (flags & 32 /* Class */) {
|
|
return 11 /* className */;
|
|
}
|
|
else if (flags & 384 /* Enum */) {
|
|
return 12 /* enumName */;
|
|
}
|
|
else if (flags & 524288 /* TypeAlias */) {
|
|
return 16 /* typeAliasName */;
|
|
}
|
|
else if (meaningAtPosition & 2 /* Type */) {
|
|
if (flags & 64 /* Interface */) {
|
|
return 13 /* interfaceName */;
|
|
}
|
|
else if (flags & 262144 /* TypeParameter */) {
|
|
return 15 /* typeParameterName */;
|
|
}
|
|
}
|
|
else if (flags & 1536 /* Module */) {
|
|
// Only classify a module as such if
|
|
// - It appears in a namespace context.
|
|
// - There exists a module declaration which actually impacts the value side.
|
|
if (meaningAtPosition & 4 /* Namespace */ ||
|
|
(meaningAtPosition & 1 /* Value */ && hasValueSideModule(symbol))) {
|
|
return 14 /* moduleName */;
|
|
}
|
|
}
|
|
return undefined;
|
|
/**
|
|
* Returns true if there exists a module that introduces entities on the value side.
|
|
*/
|
|
function hasValueSideModule(symbol) {
|
|
return ts.forEach(symbol.declarations, function (declaration) {
|
|
return declaration.kind === 215 /* ModuleDeclaration */ &&
|
|
ts.getModuleInstanceState(declaration) === 1 /* Instantiated */;
|
|
});
|
|
}
|
|
}
|
|
function processNode(node) {
|
|
// Only walk into nodes that intersect the requested span.
|
|
if (node && ts.textSpanIntersectsWith(span, node.getFullStart(), node.getFullWidth())) {
|
|
var kind = node.kind;
|
|
checkForClassificationCancellation(kind);
|
|
if (kind === 66 /* Identifier */ && !ts.nodeIsMissing(node)) {
|
|
var identifier = node;
|
|
// Only bother calling into the typechecker if this is an identifier that
|
|
// could possibly resolve to a type name. This makes classification run
|
|
// in a third of the time it would normally take.
|
|
if (classifiableNames[identifier.text]) {
|
|
var symbol = typeChecker.getSymbolAtLocation(node);
|
|
if (symbol) {
|
|
var type = classifySymbol(symbol, getMeaningFromLocation(node));
|
|
if (type) {
|
|
pushClassification(node.getStart(), node.getWidth(), type);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
ts.forEachChild(node, processNode);
|
|
}
|
|
}
|
|
}
|
|
function getClassificationTypeName(type) {
|
|
switch (type) {
|
|
case 1 /* comment */: return ClassificationTypeNames.comment;
|
|
case 2 /* identifier */: return ClassificationTypeNames.identifier;
|
|
case 3 /* keyword */: return ClassificationTypeNames.keyword;
|
|
case 4 /* numericLiteral */: return ClassificationTypeNames.numericLiteral;
|
|
case 5 /* operator */: return ClassificationTypeNames.operator;
|
|
case 6 /* stringLiteral */: return ClassificationTypeNames.stringLiteral;
|
|
case 8 /* whiteSpace */: return ClassificationTypeNames.whiteSpace;
|
|
case 9 /* text */: return ClassificationTypeNames.text;
|
|
case 10 /* punctuation */: return ClassificationTypeNames.punctuation;
|
|
case 11 /* className */: return ClassificationTypeNames.className;
|
|
case 12 /* enumName */: return ClassificationTypeNames.enumName;
|
|
case 13 /* interfaceName */: return ClassificationTypeNames.interfaceName;
|
|
case 14 /* moduleName */: return ClassificationTypeNames.moduleName;
|
|
case 15 /* typeParameterName */: return ClassificationTypeNames.typeParameterName;
|
|
case 16 /* typeAliasName */: return ClassificationTypeNames.typeAliasName;
|
|
case 17 /* parameterName */: return ClassificationTypeNames.parameterName;
|
|
case 18 /* docCommentTagName */: return ClassificationTypeNames.docCommentTagName;
|
|
}
|
|
}
|
|
function convertClassifications(classifications) {
|
|
ts.Debug.assert(classifications.spans.length % 3 === 0);
|
|
var dense = classifications.spans;
|
|
var result = [];
|
|
for (var i = 0, n = dense.length; i < n; i += 3) {
|
|
result.push({
|
|
textSpan: ts.createTextSpan(dense[i], dense[i + 1]),
|
|
classificationType: getClassificationTypeName(dense[i + 2])
|
|
});
|
|
}
|
|
return result;
|
|
}
|
|
function getSyntacticClassifications(fileName, span) {
|
|
return convertClassifications(getEncodedSyntacticClassifications(fileName, span));
|
|
}
|
|
function getEncodedSyntacticClassifications(fileName, span) {
|
|
// doesn't use compiler - no need to synchronize with host
|
|
var sourceFile = syntaxTreeCache.getCurrentSourceFile(fileName);
|
|
var spanStart = span.start;
|
|
var spanLength = span.length;
|
|
// Make a scanner we can get trivia from.
|
|
var triviaScanner = ts.createScanner(2 /* Latest */, false, sourceFile.languageVariant, sourceFile.text);
|
|
var mergeConflictScanner = ts.createScanner(2 /* Latest */, false, sourceFile.languageVariant, sourceFile.text);
|
|
var result = [];
|
|
processElement(sourceFile);
|
|
return { spans: result, endOfLineState: 0 /* None */ };
|
|
function pushClassification(start, length, type) {
|
|
result.push(start);
|
|
result.push(length);
|
|
result.push(type);
|
|
}
|
|
function classifyLeadingTriviaAndGetTokenStart(token) {
|
|
triviaScanner.setTextPos(token.pos);
|
|
while (true) {
|
|
var start = triviaScanner.getTextPos();
|
|
// only bother scanning if we have something that could be trivia.
|
|
if (!ts.couldStartTrivia(sourceFile.text, start)) {
|
|
return start;
|
|
}
|
|
var kind = triviaScanner.scan();
|
|
var end = triviaScanner.getTextPos();
|
|
var width = end - start;
|
|
// The moment we get something that isn't trivia, then stop processing.
|
|
if (!ts.isTrivia(kind)) {
|
|
return start;
|
|
}
|
|
// Don't bother with newlines/whitespace.
|
|
if (kind === 4 /* NewLineTrivia */ || kind === 5 /* WhitespaceTrivia */) {
|
|
continue;
|
|
}
|
|
// Only bother with the trivia if it at least intersects the span of interest.
|
|
if (ts.isComment(kind)) {
|
|
classifyComment(token, kind, start, width);
|
|
// Classifying a comment might cause us to reuse the trivia scanner
|
|
// (because of jsdoc comments). So after we classify the comment make
|
|
// sure we set the scanner position back to where it needs to be.
|
|
triviaScanner.setTextPos(end);
|
|
continue;
|
|
}
|
|
if (kind === 6 /* ConflictMarkerTrivia */) {
|
|
var text = sourceFile.text;
|
|
var ch = text.charCodeAt(start);
|
|
// for the <<<<<<< and >>>>>>> markers, we just add them in as comments
|
|
// in the classification stream.
|
|
if (ch === 60 /* lessThan */ || ch === 62 /* greaterThan */) {
|
|
pushClassification(start, width, 1 /* comment */);
|
|
continue;
|
|
}
|
|
// for the ======== add a comment for the first line, and then lex all
|
|
// subsequent lines up until the end of the conflict marker.
|
|
ts.Debug.assert(ch === 61 /* equals */);
|
|
classifyDisabledMergeCode(text, start, end);
|
|
}
|
|
}
|
|
}
|
|
function classifyComment(token, kind, start, width) {
|
|
if (kind === 3 /* MultiLineCommentTrivia */) {
|
|
// See if this is a doc comment. If so, we'll classify certain portions of it
|
|
// specially.
|
|
var docCommentAndDiagnostics = ts.parseIsolatedJSDocComment(sourceFile.text, start, width);
|
|
if (docCommentAndDiagnostics && docCommentAndDiagnostics.jsDocComment) {
|
|
docCommentAndDiagnostics.jsDocComment.parent = token;
|
|
classifyJSDocComment(docCommentAndDiagnostics.jsDocComment);
|
|
return;
|
|
}
|
|
}
|
|
// Simple comment. Just add as is.
|
|
pushCommentRange(start, width);
|
|
}
|
|
function pushCommentRange(start, width) {
|
|
pushClassification(start, width, 1 /* comment */);
|
|
}
|
|
function classifyJSDocComment(docComment) {
|
|
var pos = docComment.pos;
|
|
for (var _i = 0, _a = docComment.tags; _i < _a.length; _i++) {
|
|
var tag = _a[_i];
|
|
// As we walk through each tag, classify the portion of text from the end of
|
|
// the last tag (or the start of the entire doc comment) as 'comment'.
|
|
if (tag.pos !== pos) {
|
|
pushCommentRange(pos, tag.pos - pos);
|
|
}
|
|
pushClassification(tag.atToken.pos, tag.atToken.end - tag.atToken.pos, 10 /* punctuation */);
|
|
pushClassification(tag.tagName.pos, tag.tagName.end - tag.tagName.pos, 18 /* docCommentTagName */);
|
|
pos = tag.tagName.end;
|
|
switch (tag.kind) {
|
|
case 264 /* JSDocParameterTag */:
|
|
processJSDocParameterTag(tag);
|
|
break;
|
|
case 267 /* JSDocTemplateTag */:
|
|
processJSDocTemplateTag(tag);
|
|
break;
|
|
case 266 /* JSDocTypeTag */:
|
|
processElement(tag.typeExpression);
|
|
break;
|
|
case 265 /* JSDocReturnTag */:
|
|
processElement(tag.typeExpression);
|
|
break;
|
|
}
|
|
pos = tag.end;
|
|
}
|
|
if (pos !== docComment.end) {
|
|
pushCommentRange(pos, docComment.end - pos);
|
|
}
|
|
return;
|
|
function processJSDocParameterTag(tag) {
|
|
if (tag.preParameterName) {
|
|
pushCommentRange(pos, tag.preParameterName.pos - pos);
|
|
pushClassification(tag.preParameterName.pos, tag.preParameterName.end - tag.preParameterName.pos, 17 /* parameterName */);
|
|
pos = tag.preParameterName.end;
|
|
}
|
|
if (tag.typeExpression) {
|
|
pushCommentRange(pos, tag.typeExpression.pos - pos);
|
|
processElement(tag.typeExpression);
|
|
pos = tag.typeExpression.end;
|
|
}
|
|
if (tag.postParameterName) {
|
|
pushCommentRange(pos, tag.postParameterName.pos - pos);
|
|
pushClassification(tag.postParameterName.pos, tag.postParameterName.end - tag.postParameterName.pos, 17 /* parameterName */);
|
|
pos = tag.postParameterName.end;
|
|
}
|
|
}
|
|
}
|
|
function processJSDocTemplateTag(tag) {
|
|
for (var _i = 0, _a = tag.getChildren(); _i < _a.length; _i++) {
|
|
var child = _a[_i];
|
|
processElement(child);
|
|
}
|
|
}
|
|
function classifyDisabledMergeCode(text, start, end) {
|
|
// Classify the line that the ======= marker is on as a comment. Then just lex
|
|
// all further tokens and add them to the result.
|
|
for (var i = start; i < end; i++) {
|
|
if (ts.isLineBreak(text.charCodeAt(i))) {
|
|
break;
|
|
}
|
|
}
|
|
pushClassification(start, i - start, 1 /* comment */);
|
|
mergeConflictScanner.setTextPos(i);
|
|
while (mergeConflictScanner.getTextPos() < end) {
|
|
classifyDisabledCodeToken();
|
|
}
|
|
}
|
|
function classifyDisabledCodeToken() {
|
|
var start = mergeConflictScanner.getTextPos();
|
|
var tokenKind = mergeConflictScanner.scan();
|
|
var end = mergeConflictScanner.getTextPos();
|
|
var type = classifyTokenType(tokenKind);
|
|
if (type) {
|
|
pushClassification(start, end - start, type);
|
|
}
|
|
}
|
|
function classifyToken(token) {
|
|
if (ts.nodeIsMissing(token)) {
|
|
return;
|
|
}
|
|
var tokenStart = classifyLeadingTriviaAndGetTokenStart(token);
|
|
var tokenWidth = token.end - tokenStart;
|
|
ts.Debug.assert(tokenWidth >= 0);
|
|
if (tokenWidth > 0) {
|
|
var type = classifyTokenType(token.kind, token);
|
|
if (type) {
|
|
pushClassification(tokenStart, tokenWidth, type);
|
|
}
|
|
}
|
|
}
|
|
// for accurate classification, the actual token should be passed in. however, for
|
|
// cases like 'disabled merge code' classification, we just get the token kind and
|
|
// classify based on that instead.
|
|
function classifyTokenType(tokenKind, token) {
|
|
if (ts.isKeyword(tokenKind)) {
|
|
return 3 /* keyword */;
|
|
}
|
|
// Special case < and > If they appear in a generic context they are punctuation,
|
|
// not operators.
|
|
if (tokenKind === 24 /* LessThanToken */ || tokenKind === 26 /* GreaterThanToken */) {
|
|
// If the node owning the token has a type argument list or type parameter list, then
|
|
// we can effectively assume that a '<' and '>' belong to those lists.
|
|
if (token && ts.getTypeArgumentOrTypeParameterList(token.parent)) {
|
|
return 10 /* punctuation */;
|
|
}
|
|
}
|
|
if (ts.isPunctuation(tokenKind)) {
|
|
if (token) {
|
|
if (tokenKind === 54 /* EqualsToken */) {
|
|
// the '=' in a variable declaration is special cased here.
|
|
if (token.parent.kind === 208 /* VariableDeclaration */ ||
|
|
token.parent.kind === 138 /* PropertyDeclaration */ ||
|
|
token.parent.kind === 135 /* Parameter */) {
|
|
return 5 /* operator */;
|
|
}
|
|
}
|
|
if (token.parent.kind === 178 /* BinaryExpression */ ||
|
|
token.parent.kind === 176 /* PrefixUnaryExpression */ ||
|
|
token.parent.kind === 177 /* PostfixUnaryExpression */ ||
|
|
token.parent.kind === 179 /* ConditionalExpression */) {
|
|
return 5 /* operator */;
|
|
}
|
|
}
|
|
return 10 /* punctuation */;
|
|
}
|
|
else if (tokenKind === 7 /* NumericLiteral */) {
|
|
return 4 /* numericLiteral */;
|
|
}
|
|
else if (tokenKind === 8 /* StringLiteral */) {
|
|
return 6 /* stringLiteral */;
|
|
}
|
|
else if (tokenKind === 9 /* RegularExpressionLiteral */) {
|
|
// TODO: we should get another classification type for these literals.
|
|
return 6 /* stringLiteral */;
|
|
}
|
|
else if (ts.isTemplateLiteralKind(tokenKind)) {
|
|
// TODO (drosen): we should *also* get another classification type for these literals.
|
|
return 6 /* stringLiteral */;
|
|
}
|
|
else if (tokenKind === 66 /* Identifier */) {
|
|
if (token) {
|
|
switch (token.parent.kind) {
|
|
case 211 /* ClassDeclaration */:
|
|
if (token.parent.name === token) {
|
|
return 11 /* className */;
|
|
}
|
|
return;
|
|
case 134 /* TypeParameter */:
|
|
if (token.parent.name === token) {
|
|
return 15 /* typeParameterName */;
|
|
}
|
|
return;
|
|
case 212 /* InterfaceDeclaration */:
|
|
if (token.parent.name === token) {
|
|
return 13 /* interfaceName */;
|
|
}
|
|
return;
|
|
case 214 /* EnumDeclaration */:
|
|
if (token.parent.name === token) {
|
|
return 12 /* enumName */;
|
|
}
|
|
return;
|
|
case 215 /* ModuleDeclaration */:
|
|
if (token.parent.name === token) {
|
|
return 14 /* moduleName */;
|
|
}
|
|
return;
|
|
case 135 /* Parameter */:
|
|
if (token.parent.name === token) {
|
|
return 17 /* parameterName */;
|
|
}
|
|
return;
|
|
}
|
|
}
|
|
return 2 /* identifier */;
|
|
}
|
|
}
|
|
function processElement(element) {
|
|
if (!element) {
|
|
return;
|
|
}
|
|
// Ignore nodes that don't intersect the original span to classify.
|
|
if (ts.decodedTextSpanIntersectsWith(spanStart, spanLength, element.pos, element.getFullWidth())) {
|
|
checkForClassificationCancellation(element.kind);
|
|
var children = element.getChildren(sourceFile);
|
|
for (var i = 0, n = children.length; i < n; i++) {
|
|
var child = children[i];
|
|
if (ts.isToken(child)) {
|
|
classifyToken(child);
|
|
}
|
|
else {
|
|
// Recurse into our child nodes.
|
|
processElement(child);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
function getOutliningSpans(fileName) {
|
|
// doesn't use compiler - no need to synchronize with host
|
|
var sourceFile = syntaxTreeCache.getCurrentSourceFile(fileName);
|
|
return ts.OutliningElementsCollector.collectElements(sourceFile);
|
|
}
|
|
function getBraceMatchingAtPosition(fileName, position) {
|
|
var sourceFile = syntaxTreeCache.getCurrentSourceFile(fileName);
|
|
var result = [];
|
|
var token = ts.getTouchingToken(sourceFile, position);
|
|
if (token.getStart(sourceFile) === position) {
|
|
var matchKind = getMatchingTokenKind(token);
|
|
// Ensure that there is a corresponding token to match ours.
|
|
if (matchKind) {
|
|
var parentElement = token.parent;
|
|
var childNodes = parentElement.getChildren(sourceFile);
|
|
for (var _i = 0; _i < childNodes.length; _i++) {
|
|
var current = childNodes[_i];
|
|
if (current.kind === matchKind) {
|
|
var range1 = ts.createTextSpan(token.getStart(sourceFile), token.getWidth(sourceFile));
|
|
var range2 = ts.createTextSpan(current.getStart(sourceFile), current.getWidth(sourceFile));
|
|
// We want to order the braces when we return the result.
|
|
if (range1.start < range2.start) {
|
|
result.push(range1, range2);
|
|
}
|
|
else {
|
|
result.push(range2, range1);
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return result;
|
|
function getMatchingTokenKind(token) {
|
|
switch (token.kind) {
|
|
case 14 /* OpenBraceToken */: return 15 /* CloseBraceToken */;
|
|
case 16 /* OpenParenToken */: return 17 /* CloseParenToken */;
|
|
case 18 /* OpenBracketToken */: return 19 /* CloseBracketToken */;
|
|
case 24 /* LessThanToken */: return 26 /* GreaterThanToken */;
|
|
case 15 /* CloseBraceToken */: return 14 /* OpenBraceToken */;
|
|
case 17 /* CloseParenToken */: return 16 /* OpenParenToken */;
|
|
case 19 /* CloseBracketToken */: return 18 /* OpenBracketToken */;
|
|
case 26 /* GreaterThanToken */: return 24 /* LessThanToken */;
|
|
}
|
|
return undefined;
|
|
}
|
|
}
|
|
function getIndentationAtPosition(fileName, position, editorOptions) {
|
|
var start = new Date().getTime();
|
|
var sourceFile = syntaxTreeCache.getCurrentSourceFile(fileName);
|
|
log("getIndentationAtPosition: getCurrentSourceFile: " + (new Date().getTime() - start));
|
|
start = new Date().getTime();
|
|
var result = ts.formatting.SmartIndenter.getIndentation(position, sourceFile, editorOptions);
|
|
log("getIndentationAtPosition: computeIndentation : " + (new Date().getTime() - start));
|
|
return result;
|
|
}
|
|
function getFormattingEditsForRange(fileName, start, end, options) {
|
|
var sourceFile = syntaxTreeCache.getCurrentSourceFile(fileName);
|
|
return ts.formatting.formatSelection(start, end, sourceFile, getRuleProvider(options), options);
|
|
}
|
|
function getFormattingEditsForDocument(fileName, options) {
|
|
var sourceFile = syntaxTreeCache.getCurrentSourceFile(fileName);
|
|
return ts.formatting.formatDocument(sourceFile, getRuleProvider(options), options);
|
|
}
|
|
function getFormattingEditsAfterKeystroke(fileName, position, key, options) {
|
|
var sourceFile = syntaxTreeCache.getCurrentSourceFile(fileName);
|
|
if (key === "}") {
|
|
return ts.formatting.formatOnClosingCurly(position, sourceFile, getRuleProvider(options), options);
|
|
}
|
|
else if (key === ";") {
|
|
return ts.formatting.formatOnSemicolon(position, sourceFile, getRuleProvider(options), options);
|
|
}
|
|
else if (key === "\n") {
|
|
return ts.formatting.formatOnEnter(position, sourceFile, getRuleProvider(options), options);
|
|
}
|
|
return [];
|
|
}
|
|
function getTodoComments(fileName, descriptors) {
|
|
// Note: while getting todo comments seems like a syntactic operation, we actually
|
|
// treat it as a semantic operation here. This is because we expect our host to call
|
|
// this on every single file. If we treat this syntactically, then that will cause
|
|
// us to populate and throw away the tree in our syntax tree cache for each file. By
|
|
// treating this as a semantic operation, we can access any tree without throwing
|
|
// anything away.
|
|
synchronizeHostData();
|
|
var sourceFile = getValidSourceFile(fileName);
|
|
cancellationToken.throwIfCancellationRequested();
|
|
var fileContents = sourceFile.text;
|
|
var result = [];
|
|
if (descriptors.length > 0) {
|
|
var regExp = getTodoCommentsRegExp();
|
|
var matchArray;
|
|
while (matchArray = regExp.exec(fileContents)) {
|
|
cancellationToken.throwIfCancellationRequested();
|
|
// If we got a match, here is what the match array will look like. Say the source text is:
|
|
//
|
|
// " // hack 1"
|
|
//
|
|
// The result array with the regexp: will be:
|
|
//
|
|
// ["// hack 1", "// ", "hack 1", undefined, "hack"]
|
|
//
|
|
// Here are the relevant capture groups:
|
|
// 0) The full match for the entire regexp.
|
|
// 1) The preamble to the message portion.
|
|
// 2) The message portion.
|
|
// 3...N) The descriptor that was matched - by index. 'undefined' for each
|
|
// descriptor that didn't match. an actual value if it did match.
|
|
//
|
|
// i.e. 'undefined' in position 3 above means TODO(jason) didn't match.
|
|
// "hack" in position 4 means HACK did match.
|
|
var firstDescriptorCaptureIndex = 3;
|
|
ts.Debug.assert(matchArray.length === descriptors.length + firstDescriptorCaptureIndex);
|
|
var preamble = matchArray[1];
|
|
var matchPosition = matchArray.index + preamble.length;
|
|
// OK, we have found a match in the file. This is only an acceptable match if
|
|
// it is contained within a comment.
|
|
var token = ts.getTokenAtPosition(sourceFile, matchPosition);
|
|
if (!isInsideComment(sourceFile, token, matchPosition)) {
|
|
continue;
|
|
}
|
|
var descriptor = undefined;
|
|
for (var i = 0, n = descriptors.length; i < n; i++) {
|
|
if (matchArray[i + firstDescriptorCaptureIndex]) {
|
|
descriptor = descriptors[i];
|
|
}
|
|
}
|
|
ts.Debug.assert(descriptor !== undefined);
|
|
// We don't want to match something like 'TODOBY', so we make sure a non
|
|
// letter/digit follows the match.
|
|
if (isLetterOrDigit(fileContents.charCodeAt(matchPosition + descriptor.text.length))) {
|
|
continue;
|
|
}
|
|
var message = matchArray[2];
|
|
result.push({
|
|
descriptor: descriptor,
|
|
message: message,
|
|
position: matchPosition
|
|
});
|
|
}
|
|
}
|
|
return result;
|
|
function escapeRegExp(str) {
|
|
return str.replace(/[\-\[\]\/\{\}\(\)\*\+\?\.\\\^\$\|]/g, "\\$&");
|
|
}
|
|
function getTodoCommentsRegExp() {
|
|
// NOTE: ?: means 'non-capture group'. It allows us to have groups without having to
|
|
// filter them out later in the final result array.
|
|
// TODO comments can appear in one of the following forms:
|
|
//
|
|
// 1) // TODO or /////////// TODO
|
|
//
|
|
// 2) /* TODO or /********** TODO
|
|
//
|
|
// 3) /*
|
|
// * TODO
|
|
// */
|
|
//
|
|
// The following three regexps are used to match the start of the text up to the TODO
|
|
// comment portion.
|
|
var singleLineCommentStart = /(?:\/\/+\s*)/.source;
|
|
var multiLineCommentStart = /(?:\/\*+\s*)/.source;
|
|
var anyNumberOfSpacesAndAsterixesAtStartOfLine = /(?:^(?:\s|\*)*)/.source;
|
|
// Match any of the above three TODO comment start regexps.
|
|
// Note that the outermost group *is* a capture group. We want to capture the preamble
|
|
// so that we can determine the starting position of the TODO comment match.
|
|
var preamble = "(" + anyNumberOfSpacesAndAsterixesAtStartOfLine + "|" + singleLineCommentStart + "|" + multiLineCommentStart + ")";
|
|
// Takes the descriptors and forms a regexp that matches them as if they were literals.
|
|
// For example, if the descriptors are "TODO(jason)" and "HACK", then this will be:
|
|
//
|
|
// (?:(TODO\(jason\))|(HACK))
|
|
//
|
|
// Note that the outermost group is *not* a capture group, but the innermost groups
|
|
// *are* capture groups. By capturing the inner literals we can determine after
|
|
// matching which descriptor we are dealing with.
|
|
var literals = "(?:" + ts.map(descriptors, function (d) { return "(" + escapeRegExp(d.text) + ")"; }).join("|") + ")";
|
|
// After matching a descriptor literal, the following regexp matches the rest of the
|
|
// text up to the end of the line (or */).
|
|
var endOfLineOrEndOfComment = /(?:$|\*\/)/.source;
|
|
var messageRemainder = /(?:.*?)/.source;
|
|
// This is the portion of the match we'll return as part of the TODO comment result. We
|
|
// match the literal portion up to the end of the line or end of comment.
|
|
var messagePortion = "(" + literals + messageRemainder + ")";
|
|
var regExpString = preamble + messagePortion + endOfLineOrEndOfComment;
|
|
// The final regexp will look like this:
|
|
// /((?:\/\/+\s*)|(?:\/\*+\s*)|(?:^(?:\s|\*)*))((?:(TODO\(jason\))|(HACK))(?:.*?))(?:$|\*\/)/gim
|
|
// The flags of the regexp are important here.
|
|
// 'g' is so that we are doing a global search and can find matches several times
|
|
// in the input.
|
|
//
|
|
// 'i' is for case insensitivity (We do this to match C# TODO comment code).
|
|
//
|
|
// 'm' is so we can find matches in a multi-line input.
|
|
return new RegExp(regExpString, "gim");
|
|
}
|
|
function isLetterOrDigit(char) {
|
|
return (char >= 97 /* a */ && char <= 122 /* z */) ||
|
|
(char >= 65 /* A */ && char <= 90 /* Z */) ||
|
|
(char >= 48 /* _0 */ && char <= 57 /* _9 */);
|
|
}
|
|
}
|
|
function getRenameInfo(fileName, position) {
|
|
synchronizeHostData();
|
|
var sourceFile = getValidSourceFile(fileName);
|
|
var typeChecker = program.getTypeChecker();
|
|
var node = ts.getTouchingWord(sourceFile, position);
|
|
// Can only rename an identifier.
|
|
if (node && node.kind === 66 /* Identifier */) {
|
|
var symbol = typeChecker.getSymbolAtLocation(node);
|
|
// Only allow a symbol to be renamed if it actually has at least one declaration.
|
|
if (symbol) {
|
|
var declarations = symbol.getDeclarations();
|
|
if (declarations && declarations.length > 0) {
|
|
// Disallow rename for elements that are defined in the standard TypeScript library.
|
|
var defaultLibFileName = host.getDefaultLibFileName(host.getCompilationSettings());
|
|
if (defaultLibFileName) {
|
|
for (var _i = 0; _i < declarations.length; _i++) {
|
|
var current = declarations[_i];
|
|
var sourceFile_2 = current.getSourceFile();
|
|
var canonicalName = getCanonicalFileName(ts.normalizePath(sourceFile_2.fileName));
|
|
if (sourceFile_2 && getCanonicalFileName(ts.normalizePath(sourceFile_2.fileName)) === getCanonicalFileName(ts.normalizePath(defaultLibFileName))) {
|
|
return getRenameInfoError(ts.getLocaleSpecificMessage(ts.Diagnostics.You_cannot_rename_elements_that_are_defined_in_the_standard_TypeScript_library.key));
|
|
}
|
|
}
|
|
}
|
|
var displayName = ts.stripQuotes(ts.getDeclaredName(typeChecker, symbol, node));
|
|
var kind = getSymbolKind(symbol, node);
|
|
if (kind) {
|
|
return {
|
|
canRename: true,
|
|
localizedErrorMessage: undefined,
|
|
displayName: displayName,
|
|
fullDisplayName: typeChecker.getFullyQualifiedName(symbol),
|
|
kind: kind,
|
|
kindModifiers: getSymbolModifiers(symbol),
|
|
triggerSpan: ts.createTextSpan(node.getStart(), node.getWidth())
|
|
};
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return getRenameInfoError(ts.getLocaleSpecificMessage(ts.Diagnostics.You_cannot_rename_this_element.key));
|
|
function getRenameInfoError(localizedErrorMessage) {
|
|
return {
|
|
canRename: false,
|
|
localizedErrorMessage: localizedErrorMessage,
|
|
displayName: undefined,
|
|
fullDisplayName: undefined,
|
|
kind: undefined,
|
|
kindModifiers: undefined,
|
|
triggerSpan: undefined
|
|
};
|
|
}
|
|
}
|
|
return {
|
|
dispose: dispose,
|
|
cleanupSemanticCache: cleanupSemanticCache,
|
|
getSyntacticDiagnostics: getSyntacticDiagnostics,
|
|
getSemanticDiagnostics: getSemanticDiagnostics,
|
|
getCompilerOptionsDiagnostics: getCompilerOptionsDiagnostics,
|
|
getSyntacticClassifications: getSyntacticClassifications,
|
|
getSemanticClassifications: getSemanticClassifications,
|
|
getEncodedSyntacticClassifications: getEncodedSyntacticClassifications,
|
|
getEncodedSemanticClassifications: getEncodedSemanticClassifications,
|
|
getCompletionsAtPosition: getCompletionsAtPosition,
|
|
getCompletionEntryDetails: getCompletionEntryDetails,
|
|
getSignatureHelpItems: getSignatureHelpItems,
|
|
getQuickInfoAtPosition: getQuickInfoAtPosition,
|
|
getDefinitionAtPosition: getDefinitionAtPosition,
|
|
getTypeDefinitionAtPosition: getTypeDefinitionAtPosition,
|
|
getReferencesAtPosition: getReferencesAtPosition,
|
|
findReferences: findReferences,
|
|
getOccurrencesAtPosition: getOccurrencesAtPosition,
|
|
getDocumentHighlights: getDocumentHighlights,
|
|
getNameOrDottedNameSpan: getNameOrDottedNameSpan,
|
|
getBreakpointStatementAtPosition: getBreakpointStatementAtPosition,
|
|
getNavigateToItems: getNavigateToItems,
|
|
getRenameInfo: getRenameInfo,
|
|
findRenameLocations: findRenameLocations,
|
|
getNavigationBarItems: getNavigationBarItems,
|
|
getOutliningSpans: getOutliningSpans,
|
|
getTodoComments: getTodoComments,
|
|
getBraceMatchingAtPosition: getBraceMatchingAtPosition,
|
|
getIndentationAtPosition: getIndentationAtPosition,
|
|
getFormattingEditsForRange: getFormattingEditsForRange,
|
|
getFormattingEditsForDocument: getFormattingEditsForDocument,
|
|
getFormattingEditsAfterKeystroke: getFormattingEditsAfterKeystroke,
|
|
getEmitOutput: getEmitOutput,
|
|
getSourceFile: getSourceFile,
|
|
getProgram: getProgram
|
|
};
|
|
}
|
|
ts.createLanguageService = createLanguageService;
|
|
/* @internal */
|
|
function getNameTable(sourceFile) {
|
|
if (!sourceFile.nameTable) {
|
|
initializeNameTable(sourceFile);
|
|
}
|
|
return sourceFile.nameTable;
|
|
}
|
|
ts.getNameTable = getNameTable;
|
|
function initializeNameTable(sourceFile) {
|
|
var nameTable = {};
|
|
walk(sourceFile);
|
|
sourceFile.nameTable = nameTable;
|
|
function walk(node) {
|
|
switch (node.kind) {
|
|
case 66 /* Identifier */:
|
|
nameTable[node.text] = node.text;
|
|
break;
|
|
case 8 /* StringLiteral */:
|
|
case 7 /* NumericLiteral */:
|
|
// We want to store any numbers/strings if they were a name that could be
|
|
// related to a declaration. So, if we have 'import x = require("something")'
|
|
// then we want 'something' to be in the name table. Similarly, if we have
|
|
// "a['propname']" then we want to store "propname" in the name table.
|
|
if (ts.isDeclarationName(node) ||
|
|
node.parent.kind === 229 /* ExternalModuleReference */ ||
|
|
isArgumentOfElementAccessExpression(node)) {
|
|
nameTable[node.text] = node.text;
|
|
}
|
|
break;
|
|
default:
|
|
ts.forEachChild(node, walk);
|
|
}
|
|
}
|
|
}
|
|
function isArgumentOfElementAccessExpression(node) {
|
|
return node &&
|
|
node.parent &&
|
|
node.parent.kind === 164 /* ElementAccessExpression */ &&
|
|
node.parent.argumentExpression === node;
|
|
}
|
|
/// Classifier
|
|
function createClassifier() {
|
|
var scanner = ts.createScanner(2 /* Latest */, false);
|
|
/// We do not have a full parser support to know when we should parse a regex or not
|
|
/// If we consider every slash token to be a regex, we could be missing cases like "1/2/3", where
|
|
/// we have a series of divide operator. this list allows us to be more accurate by ruling out
|
|
/// locations where a regexp cannot exist.
|
|
var noRegexTable = [];
|
|
noRegexTable[66 /* Identifier */] = true;
|
|
noRegexTable[8 /* StringLiteral */] = true;
|
|
noRegexTable[7 /* NumericLiteral */] = true;
|
|
noRegexTable[9 /* RegularExpressionLiteral */] = true;
|
|
noRegexTable[94 /* ThisKeyword */] = true;
|
|
noRegexTable[39 /* PlusPlusToken */] = true;
|
|
noRegexTable[40 /* MinusMinusToken */] = true;
|
|
noRegexTable[17 /* CloseParenToken */] = true;
|
|
noRegexTable[19 /* CloseBracketToken */] = true;
|
|
noRegexTable[15 /* CloseBraceToken */] = true;
|
|
noRegexTable[96 /* TrueKeyword */] = true;
|
|
noRegexTable[81 /* FalseKeyword */] = true;
|
|
// Just a stack of TemplateHeads and OpenCurlyBraces, used to perform rudimentary (inexact)
|
|
// classification on template strings. Because of the context free nature of templates,
|
|
// the only precise way to classify a template portion would be by propagating the stack across
|
|
// lines, just as we do with the end-of-line state. However, this is a burden for implementers,
|
|
// and the behavior is entirely subsumed by the syntactic classifier anyway, so we instead
|
|
// flatten any nesting when the template stack is non-empty and encode it in the end-of-line state.
|
|
// Situations in which this fails are
|
|
// 1) When template strings are nested across different lines:
|
|
// `hello ${ `world
|
|
// ` }`
|
|
//
|
|
// Where on the second line, you will get the closing of a template,
|
|
// a closing curly, and a new template.
|
|
//
|
|
// 2) When substitution expressions have curly braces and the curly brace falls on the next line:
|
|
// `hello ${ () => {
|
|
// return "world" } } `
|
|
//
|
|
// Where on the second line, you will get the 'return' keyword,
|
|
// a string literal, and a template end consisting of '} } `'.
|
|
var templateStack = [];
|
|
/** Returns true if 'keyword2' can legally follow 'keyword1' in any language construct. */
|
|
function canFollow(keyword1, keyword2) {
|
|
if (ts.isAccessibilityModifier(keyword1)) {
|
|
if (keyword2 === 120 /* GetKeyword */ ||
|
|
keyword2 === 126 /* SetKeyword */ ||
|
|
keyword2 === 118 /* ConstructorKeyword */ ||
|
|
keyword2 === 110 /* StaticKeyword */) {
|
|
// Allow things like "public get", "public constructor" and "public static".
|
|
// These are all legal.
|
|
return true;
|
|
}
|
|
// Any other keyword following "public" is actually an identifier an not a real
|
|
// keyword.
|
|
return false;
|
|
}
|
|
// Assume any other keyword combination is legal. This can be refined in the future
|
|
// if there are more cases we want the classifier to be better at.
|
|
return true;
|
|
}
|
|
function convertClassifications(classifications, text) {
|
|
var entries = [];
|
|
var dense = classifications.spans;
|
|
var lastEnd = 0;
|
|
for (var i = 0, n = dense.length; i < n; i += 3) {
|
|
var start = dense[i];
|
|
var length_2 = dense[i + 1];
|
|
var type = dense[i + 2];
|
|
// Make a whitespace entry between the last item and this one.
|
|
if (lastEnd >= 0) {
|
|
var whitespaceLength_1 = start - lastEnd;
|
|
if (whitespaceLength_1 > 0) {
|
|
entries.push({ length: whitespaceLength_1, classification: TokenClass.Whitespace });
|
|
}
|
|
}
|
|
entries.push({ length: length_2, classification: convertClassification(type) });
|
|
lastEnd = start + length_2;
|
|
}
|
|
var whitespaceLength = text.length - lastEnd;
|
|
if (whitespaceLength > 0) {
|
|
entries.push({ length: whitespaceLength, classification: TokenClass.Whitespace });
|
|
}
|
|
return { entries: entries, finalLexState: classifications.endOfLineState };
|
|
}
|
|
function convertClassification(type) {
|
|
switch (type) {
|
|
case 1 /* comment */: return TokenClass.Comment;
|
|
case 3 /* keyword */: return TokenClass.Keyword;
|
|
case 4 /* numericLiteral */: return TokenClass.NumberLiteral;
|
|
case 5 /* operator */: return TokenClass.Operator;
|
|
case 6 /* stringLiteral */: return TokenClass.StringLiteral;
|
|
case 8 /* whiteSpace */: return TokenClass.Whitespace;
|
|
case 10 /* punctuation */: return TokenClass.Punctuation;
|
|
case 2 /* identifier */:
|
|
case 11 /* className */:
|
|
case 12 /* enumName */:
|
|
case 13 /* interfaceName */:
|
|
case 14 /* moduleName */:
|
|
case 15 /* typeParameterName */:
|
|
case 16 /* typeAliasName */:
|
|
case 9 /* text */:
|
|
case 17 /* parameterName */:
|
|
default:
|
|
return TokenClass.Identifier;
|
|
}
|
|
}
|
|
function getClassificationsForLine(text, lexState, syntacticClassifierAbsent) {
|
|
return convertClassifications(getEncodedLexicalClassifications(text, lexState, syntacticClassifierAbsent), text);
|
|
}
|
|
// If there is a syntactic classifier ('syntacticClassifierAbsent' is false),
|
|
// we will be more conservative in order to avoid conflicting with the syntactic classifier.
|
|
function getEncodedLexicalClassifications(text, lexState, syntacticClassifierAbsent) {
|
|
var offset = 0;
|
|
var token = 0 /* Unknown */;
|
|
var lastNonTriviaToken = 0 /* Unknown */;
|
|
// Empty out the template stack for reuse.
|
|
while (templateStack.length > 0) {
|
|
templateStack.pop();
|
|
}
|
|
// If we're in a string literal, then prepend: "\
|
|
// (and a newline). That way when we lex we'll think we're still in a string literal.
|
|
//
|
|
// If we're in a multiline comment, then prepend: /*
|
|
// (and a newline). That way when we lex we'll think we're still in a multiline comment.
|
|
switch (lexState) {
|
|
case 3 /* InDoubleQuoteStringLiteral */:
|
|
text = '"\\\n' + text;
|
|
offset = 3;
|
|
break;
|
|
case 2 /* InSingleQuoteStringLiteral */:
|
|
text = "'\\\n" + text;
|
|
offset = 3;
|
|
break;
|
|
case 1 /* InMultiLineCommentTrivia */:
|
|
text = "/*\n" + text;
|
|
offset = 3;
|
|
break;
|
|
case 4 /* InTemplateHeadOrNoSubstitutionTemplate */:
|
|
text = "`\n" + text;
|
|
offset = 2;
|
|
break;
|
|
case 5 /* InTemplateMiddleOrTail */:
|
|
text = "}\n" + text;
|
|
offset = 2;
|
|
// fallthrough
|
|
case 6 /* InTemplateSubstitutionPosition */:
|
|
templateStack.push(11 /* TemplateHead */);
|
|
break;
|
|
}
|
|
scanner.setText(text);
|
|
var result = {
|
|
endOfLineState: 0 /* None */,
|
|
spans: []
|
|
};
|
|
// We can run into an unfortunate interaction between the lexical and syntactic classifier
|
|
// when the user is typing something generic. Consider the case where the user types:
|
|
//
|
|
// Foo<number
|
|
//
|
|
// From the lexical classifier's perspective, 'number' is a keyword, and so the word will
|
|
// be classified as such. However, from the syntactic classifier's tree-based perspective
|
|
// this is simply an expression with the identifier 'number' on the RHS of the less than
|
|
// token. So the classification will go back to being an identifier. The moment the user
|
|
// types again, number will become a keyword, then an identifier, etc. etc.
|
|
//
|
|
// To try to avoid this problem, we avoid classifying contextual keywords as keywords
|
|
// when the user is potentially typing something generic. We just can't do a good enough
|
|
// job at the lexical level, and so well leave it up to the syntactic classifier to make
|
|
// the determination.
|
|
//
|
|
// In order to determine if the user is potentially typing something generic, we use a
|
|
// weak heuristic where we track < and > tokens. It's a weak heuristic, but should
|
|
// work well enough in practice.
|
|
var angleBracketStack = 0;
|
|
do {
|
|
token = scanner.scan();
|
|
if (!ts.isTrivia(token)) {
|
|
if ((token === 37 /* SlashToken */ || token === 58 /* SlashEqualsToken */) && !noRegexTable[lastNonTriviaToken]) {
|
|
if (scanner.reScanSlashToken() === 9 /* RegularExpressionLiteral */) {
|
|
token = 9 /* RegularExpressionLiteral */;
|
|
}
|
|
}
|
|
else if (lastNonTriviaToken === 20 /* DotToken */ && isKeyword(token)) {
|
|
token = 66 /* Identifier */;
|
|
}
|
|
else if (isKeyword(lastNonTriviaToken) && isKeyword(token) && !canFollow(lastNonTriviaToken, token)) {
|
|
// We have two keywords in a row. Only treat the second as a keyword if
|
|
// it's a sequence that could legally occur in the language. Otherwise
|
|
// treat it as an identifier. This way, if someone writes "private var"
|
|
// we recognize that 'var' is actually an identifier here.
|
|
token = 66 /* Identifier */;
|
|
}
|
|
else if (lastNonTriviaToken === 66 /* Identifier */ &&
|
|
token === 24 /* LessThanToken */) {
|
|
// Could be the start of something generic. Keep track of that by bumping
|
|
// up the current count of generic contexts we may be in.
|
|
angleBracketStack++;
|
|
}
|
|
else if (token === 26 /* GreaterThanToken */ && angleBracketStack > 0) {
|
|
// If we think we're currently in something generic, then mark that that
|
|
// generic entity is complete.
|
|
angleBracketStack--;
|
|
}
|
|
else if (token === 114 /* AnyKeyword */ ||
|
|
token === 127 /* StringKeyword */ ||
|
|
token === 125 /* NumberKeyword */ ||
|
|
token === 117 /* BooleanKeyword */ ||
|
|
token === 128 /* SymbolKeyword */) {
|
|
if (angleBracketStack > 0 && !syntacticClassifierAbsent) {
|
|
// If it looks like we're could be in something generic, don't classify this
|
|
// as a keyword. We may just get overwritten by the syntactic classifier,
|
|
// causing a noisy experience for the user.
|
|
token = 66 /* Identifier */;
|
|
}
|
|
}
|
|
else if (token === 11 /* TemplateHead */) {
|
|
templateStack.push(token);
|
|
}
|
|
else if (token === 14 /* OpenBraceToken */) {
|
|
// If we don't have anything on the template stack,
|
|
// then we aren't trying to keep track of a previously scanned template head.
|
|
if (templateStack.length > 0) {
|
|
templateStack.push(token);
|
|
}
|
|
}
|
|
else if (token === 15 /* CloseBraceToken */) {
|
|
// If we don't have anything on the template stack,
|
|
// then we aren't trying to keep track of a previously scanned template head.
|
|
if (templateStack.length > 0) {
|
|
var lastTemplateStackToken = ts.lastOrUndefined(templateStack);
|
|
if (lastTemplateStackToken === 11 /* TemplateHead */) {
|
|
token = scanner.reScanTemplateToken();
|
|
// Only pop on a TemplateTail; a TemplateMiddle indicates there is more for us.
|
|
if (token === 13 /* TemplateTail */) {
|
|
templateStack.pop();
|
|
}
|
|
else {
|
|
ts.Debug.assert(token === 12 /* TemplateMiddle */, "Should have been a template middle. Was " + token);
|
|
}
|
|
}
|
|
else {
|
|
ts.Debug.assert(lastTemplateStackToken === 14 /* OpenBraceToken */, "Should have been an open brace. Was: " + token);
|
|
templateStack.pop();
|
|
}
|
|
}
|
|
}
|
|
lastNonTriviaToken = token;
|
|
}
|
|
processToken();
|
|
} while (token !== 1 /* EndOfFileToken */);
|
|
return result;
|
|
function processToken() {
|
|
var start = scanner.getTokenPos();
|
|
var end = scanner.getTextPos();
|
|
addResult(start, end, classFromKind(token));
|
|
if (end >= text.length) {
|
|
if (token === 8 /* StringLiteral */) {
|
|
// Check to see if we finished up on a multiline string literal.
|
|
var tokenText = scanner.getTokenText();
|
|
if (scanner.isUnterminated()) {
|
|
var lastCharIndex = tokenText.length - 1;
|
|
var numBackslashes = 0;
|
|
while (tokenText.charCodeAt(lastCharIndex - numBackslashes) === 92 /* backslash */) {
|
|
numBackslashes++;
|
|
}
|
|
// If we have an odd number of backslashes, then the multiline string is unclosed
|
|
if (numBackslashes & 1) {
|
|
var quoteChar = tokenText.charCodeAt(0);
|
|
result.endOfLineState = quoteChar === 34 /* doubleQuote */
|
|
? 3 /* InDoubleQuoteStringLiteral */
|
|
: 2 /* InSingleQuoteStringLiteral */;
|
|
}
|
|
}
|
|
}
|
|
else if (token === 3 /* MultiLineCommentTrivia */) {
|
|
// Check to see if the multiline comment was unclosed.
|
|
if (scanner.isUnterminated()) {
|
|
result.endOfLineState = 1 /* InMultiLineCommentTrivia */;
|
|
}
|
|
}
|
|
else if (ts.isTemplateLiteralKind(token)) {
|
|
if (scanner.isUnterminated()) {
|
|
if (token === 13 /* TemplateTail */) {
|
|
result.endOfLineState = 5 /* InTemplateMiddleOrTail */;
|
|
}
|
|
else if (token === 10 /* NoSubstitutionTemplateLiteral */) {
|
|
result.endOfLineState = 4 /* InTemplateHeadOrNoSubstitutionTemplate */;
|
|
}
|
|
else {
|
|
ts.Debug.fail("Only 'NoSubstitutionTemplateLiteral's and 'TemplateTail's can be unterminated; got SyntaxKind #" + token);
|
|
}
|
|
}
|
|
}
|
|
else if (templateStack.length > 0 && ts.lastOrUndefined(templateStack) === 11 /* TemplateHead */) {
|
|
result.endOfLineState = 6 /* InTemplateSubstitutionPosition */;
|
|
}
|
|
}
|
|
}
|
|
function addResult(start, end, classification) {
|
|
if (classification === 8 /* whiteSpace */) {
|
|
// Don't bother with whitespace classifications. They're not needed.
|
|
return;
|
|
}
|
|
if (start === 0 && offset > 0) {
|
|
// We're classifying the first token, and this was a case where we prepended
|
|
// text. We should consider the start of this token to be at the start of
|
|
// the original text.
|
|
start += offset;
|
|
}
|
|
// All our tokens are in relation to the augmented text. Move them back to be
|
|
// relative to the original text.
|
|
start -= offset;
|
|
end -= offset;
|
|
var length = end - start;
|
|
if (length > 0) {
|
|
result.spans.push(start);
|
|
result.spans.push(length);
|
|
result.spans.push(classification);
|
|
}
|
|
}
|
|
}
|
|
function isBinaryExpressionOperatorToken(token) {
|
|
switch (token) {
|
|
case 36 /* AsteriskToken */:
|
|
case 37 /* SlashToken */:
|
|
case 38 /* PercentToken */:
|
|
case 34 /* PlusToken */:
|
|
case 35 /* MinusToken */:
|
|
case 41 /* LessThanLessThanToken */:
|
|
case 42 /* GreaterThanGreaterThanToken */:
|
|
case 43 /* GreaterThanGreaterThanGreaterThanToken */:
|
|
case 24 /* LessThanToken */:
|
|
case 26 /* GreaterThanToken */:
|
|
case 27 /* LessThanEqualsToken */:
|
|
case 28 /* GreaterThanEqualsToken */:
|
|
case 88 /* InstanceOfKeyword */:
|
|
case 87 /* InKeyword */:
|
|
case 29 /* EqualsEqualsToken */:
|
|
case 30 /* ExclamationEqualsToken */:
|
|
case 31 /* EqualsEqualsEqualsToken */:
|
|
case 32 /* ExclamationEqualsEqualsToken */:
|
|
case 44 /* AmpersandToken */:
|
|
case 46 /* CaretToken */:
|
|
case 45 /* BarToken */:
|
|
case 49 /* AmpersandAmpersandToken */:
|
|
case 50 /* BarBarToken */:
|
|
case 64 /* BarEqualsToken */:
|
|
case 63 /* AmpersandEqualsToken */:
|
|
case 65 /* CaretEqualsToken */:
|
|
case 60 /* LessThanLessThanEqualsToken */:
|
|
case 61 /* GreaterThanGreaterThanEqualsToken */:
|
|
case 62 /* GreaterThanGreaterThanGreaterThanEqualsToken */:
|
|
case 55 /* PlusEqualsToken */:
|
|
case 56 /* MinusEqualsToken */:
|
|
case 57 /* AsteriskEqualsToken */:
|
|
case 58 /* SlashEqualsToken */:
|
|
case 59 /* PercentEqualsToken */:
|
|
case 54 /* EqualsToken */:
|
|
case 23 /* CommaToken */:
|
|
return true;
|
|
default:
|
|
return false;
|
|
}
|
|
}
|
|
function isPrefixUnaryExpressionOperatorToken(token) {
|
|
switch (token) {
|
|
case 34 /* PlusToken */:
|
|
case 35 /* MinusToken */:
|
|
case 48 /* TildeToken */:
|
|
case 47 /* ExclamationToken */:
|
|
case 39 /* PlusPlusToken */:
|
|
case 40 /* MinusMinusToken */:
|
|
return true;
|
|
default:
|
|
return false;
|
|
}
|
|
}
|
|
function isKeyword(token) {
|
|
return token >= 67 /* FirstKeyword */ && token <= 131 /* LastKeyword */;
|
|
}
|
|
function classFromKind(token) {
|
|
if (isKeyword(token)) {
|
|
return 3 /* keyword */;
|
|
}
|
|
else if (isBinaryExpressionOperatorToken(token) || isPrefixUnaryExpressionOperatorToken(token)) {
|
|
return 5 /* operator */;
|
|
}
|
|
else if (token >= 14 /* FirstPunctuation */ && token <= 65 /* LastPunctuation */) {
|
|
return 10 /* punctuation */;
|
|
}
|
|
switch (token) {
|
|
case 7 /* NumericLiteral */:
|
|
return 4 /* numericLiteral */;
|
|
case 8 /* StringLiteral */:
|
|
return 6 /* stringLiteral */;
|
|
case 9 /* RegularExpressionLiteral */:
|
|
return 7 /* regularExpressionLiteral */;
|
|
case 6 /* ConflictMarkerTrivia */:
|
|
case 3 /* MultiLineCommentTrivia */:
|
|
case 2 /* SingleLineCommentTrivia */:
|
|
return 1 /* comment */;
|
|
case 5 /* WhitespaceTrivia */:
|
|
case 4 /* NewLineTrivia */:
|
|
return 8 /* whiteSpace */;
|
|
case 66 /* Identifier */:
|
|
default:
|
|
if (ts.isTemplateLiteralKind(token)) {
|
|
return 6 /* stringLiteral */;
|
|
}
|
|
return 2 /* identifier */;
|
|
}
|
|
}
|
|
return {
|
|
getClassificationsForLine: getClassificationsForLine,
|
|
getEncodedLexicalClassifications: getEncodedLexicalClassifications
|
|
};
|
|
}
|
|
ts.createClassifier = createClassifier;
|
|
/**
|
|
* Get the path of the default library files (lib.d.ts) as distributed with the typescript
|
|
* node package.
|
|
* The functionality is not supported if the ts module is consumed outside of a node module.
|
|
*/
|
|
function getDefaultLibFilePath(options) {
|
|
// Check __dirname is defined and that we are on a node.js system.
|
|
if (typeof __dirname !== "undefined") {
|
|
return __dirname + ts.directorySeparator + ts.getDefaultLibFileName(options);
|
|
}
|
|
throw new Error("getDefaultLibFilePath is only supported when consumed as a node module. ");
|
|
}
|
|
ts.getDefaultLibFilePath = getDefaultLibFilePath;
|
|
function initializeServices() {
|
|
ts.objectAllocator = {
|
|
getNodeConstructor: function (kind) {
|
|
function Node() {
|
|
}
|
|
var proto = kind === 245 /* SourceFile */ ? new SourceFileObject() : new NodeObject();
|
|
proto.kind = kind;
|
|
proto.pos = -1;
|
|
proto.end = -1;
|
|
proto.flags = 0;
|
|
proto.parent = undefined;
|
|
Node.prototype = proto;
|
|
return Node;
|
|
},
|
|
getSymbolConstructor: function () { return SymbolObject; },
|
|
getTypeConstructor: function () { return TypeObject; },
|
|
getSignatureConstructor: function () { return SignatureObject; }
|
|
};
|
|
}
|
|
initializeServices();
|
|
})(ts || (ts = {}));
|
|
// Copyright (c) Microsoft. All rights reserved. Licensed under the Apache License, Version 2.0.
|
|
// See LICENSE.txt in the project root for complete license information.
|
|
/// <reference path='services.ts' />
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
var BreakpointResolver;
|
|
(function (BreakpointResolver) {
|
|
/**
|
|
* Get the breakpoint span in given sourceFile
|
|
*/
|
|
function spanInSourceFileAtLocation(sourceFile, position) {
|
|
// Cannot set breakpoint in dts file
|
|
if (sourceFile.flags & 8192 /* DeclarationFile */) {
|
|
return undefined;
|
|
}
|
|
var tokenAtLocation = ts.getTokenAtPosition(sourceFile, position);
|
|
var lineOfPosition = sourceFile.getLineAndCharacterOfPosition(position).line;
|
|
if (sourceFile.getLineAndCharacterOfPosition(tokenAtLocation.getStart()).line > lineOfPosition) {
|
|
// Get previous token if the token is returned starts on new line
|
|
// eg: let x =10; |--- cursor is here
|
|
// let y = 10;
|
|
// token at position will return let keyword on second line as the token but we would like to use
|
|
// token on same line if trailing trivia (comments or white spaces on same line) part of the last token on that line
|
|
tokenAtLocation = ts.findPrecedingToken(tokenAtLocation.pos, sourceFile);
|
|
// Its a blank line
|
|
if (!tokenAtLocation || sourceFile.getLineAndCharacterOfPosition(tokenAtLocation.getEnd()).line !== lineOfPosition) {
|
|
return undefined;
|
|
}
|
|
}
|
|
// Cannot set breakpoint in ambient declarations
|
|
if (ts.isInAmbientContext(tokenAtLocation)) {
|
|
return undefined;
|
|
}
|
|
// Get the span in the node based on its syntax
|
|
return spanInNode(tokenAtLocation);
|
|
function textSpan(startNode, endNode) {
|
|
return ts.createTextSpanFromBounds(startNode.getStart(), (endNode || startNode).getEnd());
|
|
}
|
|
function spanInNodeIfStartsOnSameLine(node, otherwiseOnNode) {
|
|
if (node && lineOfPosition === sourceFile.getLineAndCharacterOfPosition(node.getStart()).line) {
|
|
return spanInNode(node);
|
|
}
|
|
return spanInNode(otherwiseOnNode);
|
|
}
|
|
function spanInPreviousNode(node) {
|
|
return spanInNode(ts.findPrecedingToken(node.pos, sourceFile));
|
|
}
|
|
function spanInNextNode(node) {
|
|
return spanInNode(ts.findNextToken(node, node.parent));
|
|
}
|
|
function spanInNode(node) {
|
|
if (node) {
|
|
if (ts.isExpression(node)) {
|
|
if (node.parent.kind === 194 /* DoStatement */) {
|
|
// Set span as if on while keyword
|
|
return spanInPreviousNode(node);
|
|
}
|
|
if (node.parent.kind === 196 /* ForStatement */) {
|
|
// For now lets set the span on this expression, fix it later
|
|
return textSpan(node);
|
|
}
|
|
if (node.parent.kind === 178 /* BinaryExpression */ && node.parent.operatorToken.kind === 23 /* CommaToken */) {
|
|
// if this is comma expression, the breakpoint is possible in this expression
|
|
return textSpan(node);
|
|
}
|
|
if (node.parent.kind === 171 /* ArrowFunction */ && node.parent.body === node) {
|
|
// If this is body of arrow function, it is allowed to have the breakpoint
|
|
return textSpan(node);
|
|
}
|
|
}
|
|
switch (node.kind) {
|
|
case 190 /* VariableStatement */:
|
|
// Span on first variable declaration
|
|
return spanInVariableDeclaration(node.declarationList.declarations[0]);
|
|
case 208 /* VariableDeclaration */:
|
|
case 138 /* PropertyDeclaration */:
|
|
case 137 /* PropertySignature */:
|
|
return spanInVariableDeclaration(node);
|
|
case 135 /* Parameter */:
|
|
return spanInParameterDeclaration(node);
|
|
case 210 /* FunctionDeclaration */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 141 /* Constructor */:
|
|
case 170 /* FunctionExpression */:
|
|
case 171 /* ArrowFunction */:
|
|
return spanInFunctionDeclaration(node);
|
|
case 189 /* Block */:
|
|
if (ts.isFunctionBlock(node)) {
|
|
return spanInFunctionBlock(node);
|
|
}
|
|
// Fall through
|
|
case 216 /* ModuleBlock */:
|
|
return spanInBlock(node);
|
|
case 241 /* CatchClause */:
|
|
return spanInBlock(node.block);
|
|
case 192 /* ExpressionStatement */:
|
|
// span on the expression
|
|
return textSpan(node.expression);
|
|
case 201 /* ReturnStatement */:
|
|
// span on return keyword and expression if present
|
|
return textSpan(node.getChildAt(0), node.expression);
|
|
case 195 /* WhileStatement */:
|
|
// Span on while(...)
|
|
return textSpan(node, ts.findNextToken(node.expression, node));
|
|
case 194 /* DoStatement */:
|
|
// span in statement of the do statement
|
|
return spanInNode(node.statement);
|
|
case 207 /* DebuggerStatement */:
|
|
// span on debugger keyword
|
|
return textSpan(node.getChildAt(0));
|
|
case 193 /* IfStatement */:
|
|
// set on if(..) span
|
|
return textSpan(node, ts.findNextToken(node.expression, node));
|
|
case 204 /* LabeledStatement */:
|
|
// span in statement
|
|
return spanInNode(node.statement);
|
|
case 200 /* BreakStatement */:
|
|
case 199 /* ContinueStatement */:
|
|
// On break or continue keyword and label if present
|
|
return textSpan(node.getChildAt(0), node.label);
|
|
case 196 /* ForStatement */:
|
|
return spanInForStatement(node);
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
// span on for (a in ...)
|
|
return textSpan(node, ts.findNextToken(node.expression, node));
|
|
case 203 /* SwitchStatement */:
|
|
// span on switch(...)
|
|
return textSpan(node, ts.findNextToken(node.expression, node));
|
|
case 238 /* CaseClause */:
|
|
case 239 /* DefaultClause */:
|
|
// span in first statement of the clause
|
|
return spanInNode(node.statements[0]);
|
|
case 206 /* TryStatement */:
|
|
// span in try block
|
|
return spanInBlock(node.tryBlock);
|
|
case 205 /* ThrowStatement */:
|
|
// span in throw ...
|
|
return textSpan(node, node.expression);
|
|
case 224 /* ExportAssignment */:
|
|
// span on export = id
|
|
return textSpan(node, node.expression);
|
|
case 218 /* ImportEqualsDeclaration */:
|
|
// import statement without including semicolon
|
|
return textSpan(node, node.moduleReference);
|
|
case 219 /* ImportDeclaration */:
|
|
// import statement without including semicolon
|
|
return textSpan(node, node.moduleSpecifier);
|
|
case 225 /* ExportDeclaration */:
|
|
// import statement without including semicolon
|
|
return textSpan(node, node.moduleSpecifier);
|
|
case 215 /* ModuleDeclaration */:
|
|
// span on complete module if it is instantiated
|
|
if (ts.getModuleInstanceState(node) !== 1 /* Instantiated */) {
|
|
return undefined;
|
|
}
|
|
case 211 /* ClassDeclaration */:
|
|
case 214 /* EnumDeclaration */:
|
|
case 244 /* EnumMember */:
|
|
case 165 /* CallExpression */:
|
|
case 166 /* NewExpression */:
|
|
// span on complete node
|
|
return textSpan(node);
|
|
case 202 /* WithStatement */:
|
|
// span in statement
|
|
return spanInNode(node.statement);
|
|
// No breakpoint in interface, type alias
|
|
case 212 /* InterfaceDeclaration */:
|
|
case 213 /* TypeAliasDeclaration */:
|
|
return undefined;
|
|
// Tokens:
|
|
case 22 /* SemicolonToken */:
|
|
case 1 /* EndOfFileToken */:
|
|
return spanInNodeIfStartsOnSameLine(ts.findPrecedingToken(node.pos, sourceFile));
|
|
case 23 /* CommaToken */:
|
|
return spanInPreviousNode(node);
|
|
case 14 /* OpenBraceToken */:
|
|
return spanInOpenBraceToken(node);
|
|
case 15 /* CloseBraceToken */:
|
|
return spanInCloseBraceToken(node);
|
|
case 16 /* OpenParenToken */:
|
|
return spanInOpenParenToken(node);
|
|
case 17 /* CloseParenToken */:
|
|
return spanInCloseParenToken(node);
|
|
case 52 /* ColonToken */:
|
|
return spanInColonToken(node);
|
|
case 26 /* GreaterThanToken */:
|
|
case 24 /* LessThanToken */:
|
|
return spanInGreaterThanOrLessThanToken(node);
|
|
// Keywords:
|
|
case 101 /* WhileKeyword */:
|
|
return spanInWhileKeyword(node);
|
|
case 77 /* ElseKeyword */:
|
|
case 69 /* CatchKeyword */:
|
|
case 82 /* FinallyKeyword */:
|
|
return spanInNextNode(node);
|
|
default:
|
|
// If this is name of property assignment, set breakpoint in the initializer
|
|
if (node.parent.kind === 242 /* PropertyAssignment */ && node.parent.name === node) {
|
|
return spanInNode(node.parent.initializer);
|
|
}
|
|
// Breakpoint in type assertion goes to its operand
|
|
if (node.parent.kind === 168 /* TypeAssertionExpression */ && node.parent.type === node) {
|
|
return spanInNode(node.parent.expression);
|
|
}
|
|
// return type of function go to previous token
|
|
if (ts.isFunctionLike(node.parent) && node.parent.type === node) {
|
|
return spanInPreviousNode(node);
|
|
}
|
|
// Default go to parent to set the breakpoint
|
|
return spanInNode(node.parent);
|
|
}
|
|
}
|
|
function spanInVariableDeclaration(variableDeclaration) {
|
|
// If declaration of for in statement, just set the span in parent
|
|
if (variableDeclaration.parent.parent.kind === 197 /* ForInStatement */ ||
|
|
variableDeclaration.parent.parent.kind === 198 /* ForOfStatement */) {
|
|
return spanInNode(variableDeclaration.parent.parent);
|
|
}
|
|
var isParentVariableStatement = variableDeclaration.parent.parent.kind === 190 /* VariableStatement */;
|
|
var isDeclarationOfForStatement = variableDeclaration.parent.parent.kind === 196 /* ForStatement */ && ts.contains(variableDeclaration.parent.parent.initializer.declarations, variableDeclaration);
|
|
var declarations = isParentVariableStatement
|
|
? variableDeclaration.parent.parent.declarationList.declarations
|
|
: isDeclarationOfForStatement
|
|
? variableDeclaration.parent.parent.initializer.declarations
|
|
: undefined;
|
|
// Breakpoint is possible in variableDeclaration only if there is initialization
|
|
if (variableDeclaration.initializer || (variableDeclaration.flags & 1 /* Export */)) {
|
|
if (declarations && declarations[0] === variableDeclaration) {
|
|
if (isParentVariableStatement) {
|
|
// First declaration - include let keyword
|
|
return textSpan(variableDeclaration.parent, variableDeclaration);
|
|
}
|
|
else {
|
|
ts.Debug.assert(isDeclarationOfForStatement);
|
|
// Include let keyword from for statement declarations in the span
|
|
return textSpan(ts.findPrecedingToken(variableDeclaration.pos, sourceFile, variableDeclaration.parent), variableDeclaration);
|
|
}
|
|
}
|
|
else {
|
|
// Span only on this declaration
|
|
return textSpan(variableDeclaration);
|
|
}
|
|
}
|
|
else if (declarations && declarations[0] !== variableDeclaration) {
|
|
// If we cant set breakpoint on this declaration, set it on previous one
|
|
var indexOfCurrentDeclaration = ts.indexOf(declarations, variableDeclaration);
|
|
return spanInVariableDeclaration(declarations[indexOfCurrentDeclaration - 1]);
|
|
}
|
|
}
|
|
function canHaveSpanInParameterDeclaration(parameter) {
|
|
// Breakpoint is possible on parameter only if it has initializer, is a rest parameter, or has public or private modifier
|
|
return !!parameter.initializer || parameter.dotDotDotToken !== undefined ||
|
|
!!(parameter.flags & 16 /* Public */) || !!(parameter.flags & 32 /* Private */);
|
|
}
|
|
function spanInParameterDeclaration(parameter) {
|
|
if (canHaveSpanInParameterDeclaration(parameter)) {
|
|
return textSpan(parameter);
|
|
}
|
|
else {
|
|
var functionDeclaration = parameter.parent;
|
|
var indexOfParameter = ts.indexOf(functionDeclaration.parameters, parameter);
|
|
if (indexOfParameter) {
|
|
// Not a first parameter, go to previous parameter
|
|
return spanInParameterDeclaration(functionDeclaration.parameters[indexOfParameter - 1]);
|
|
}
|
|
else {
|
|
// Set breakpoint in the function declaration body
|
|
return spanInNode(functionDeclaration.body);
|
|
}
|
|
}
|
|
}
|
|
function canFunctionHaveSpanInWholeDeclaration(functionDeclaration) {
|
|
return !!(functionDeclaration.flags & 1 /* Export */) ||
|
|
(functionDeclaration.parent.kind === 211 /* ClassDeclaration */ && functionDeclaration.kind !== 141 /* Constructor */);
|
|
}
|
|
function spanInFunctionDeclaration(functionDeclaration) {
|
|
// No breakpoints in the function signature
|
|
if (!functionDeclaration.body) {
|
|
return undefined;
|
|
}
|
|
if (canFunctionHaveSpanInWholeDeclaration(functionDeclaration)) {
|
|
// Set the span on whole function declaration
|
|
return textSpan(functionDeclaration);
|
|
}
|
|
// Set span in function body
|
|
return spanInNode(functionDeclaration.body);
|
|
}
|
|
function spanInFunctionBlock(block) {
|
|
var nodeForSpanInBlock = block.statements.length ? block.statements[0] : block.getLastToken();
|
|
if (canFunctionHaveSpanInWholeDeclaration(block.parent)) {
|
|
return spanInNodeIfStartsOnSameLine(block.parent, nodeForSpanInBlock);
|
|
}
|
|
return spanInNode(nodeForSpanInBlock);
|
|
}
|
|
function spanInBlock(block) {
|
|
switch (block.parent.kind) {
|
|
case 215 /* ModuleDeclaration */:
|
|
if (ts.getModuleInstanceState(block.parent) !== 1 /* Instantiated */) {
|
|
return undefined;
|
|
}
|
|
// Set on parent if on same line otherwise on first statement
|
|
case 195 /* WhileStatement */:
|
|
case 193 /* IfStatement */:
|
|
case 197 /* ForInStatement */:
|
|
case 198 /* ForOfStatement */:
|
|
return spanInNodeIfStartsOnSameLine(block.parent, block.statements[0]);
|
|
// Set span on previous token if it starts on same line otherwise on the first statement of the block
|
|
case 196 /* ForStatement */:
|
|
return spanInNodeIfStartsOnSameLine(ts.findPrecedingToken(block.pos, sourceFile, block.parent), block.statements[0]);
|
|
}
|
|
// Default action is to set on first statement
|
|
return spanInNode(block.statements[0]);
|
|
}
|
|
function spanInForStatement(forStatement) {
|
|
if (forStatement.initializer) {
|
|
if (forStatement.initializer.kind === 209 /* VariableDeclarationList */) {
|
|
var variableDeclarationList = forStatement.initializer;
|
|
if (variableDeclarationList.declarations.length > 0) {
|
|
return spanInNode(variableDeclarationList.declarations[0]);
|
|
}
|
|
}
|
|
else {
|
|
return spanInNode(forStatement.initializer);
|
|
}
|
|
}
|
|
if (forStatement.condition) {
|
|
return textSpan(forStatement.condition);
|
|
}
|
|
if (forStatement.incrementor) {
|
|
return textSpan(forStatement.incrementor);
|
|
}
|
|
}
|
|
// Tokens:
|
|
function spanInOpenBraceToken(node) {
|
|
switch (node.parent.kind) {
|
|
case 214 /* EnumDeclaration */:
|
|
var enumDeclaration = node.parent;
|
|
return spanInNodeIfStartsOnSameLine(ts.findPrecedingToken(node.pos, sourceFile, node.parent), enumDeclaration.members.length ? enumDeclaration.members[0] : enumDeclaration.getLastToken(sourceFile));
|
|
case 211 /* ClassDeclaration */:
|
|
var classDeclaration = node.parent;
|
|
return spanInNodeIfStartsOnSameLine(ts.findPrecedingToken(node.pos, sourceFile, node.parent), classDeclaration.members.length ? classDeclaration.members[0] : classDeclaration.getLastToken(sourceFile));
|
|
case 217 /* CaseBlock */:
|
|
return spanInNodeIfStartsOnSameLine(node.parent.parent, node.parent.clauses[0]);
|
|
}
|
|
// Default to parent node
|
|
return spanInNode(node.parent);
|
|
}
|
|
function spanInCloseBraceToken(node) {
|
|
switch (node.parent.kind) {
|
|
case 216 /* ModuleBlock */:
|
|
// If this is not instantiated module block no bp span
|
|
if (ts.getModuleInstanceState(node.parent.parent) !== 1 /* Instantiated */) {
|
|
return undefined;
|
|
}
|
|
case 214 /* EnumDeclaration */:
|
|
case 211 /* ClassDeclaration */:
|
|
// Span on close brace token
|
|
return textSpan(node);
|
|
case 189 /* Block */:
|
|
if (ts.isFunctionBlock(node.parent)) {
|
|
// Span on close brace token
|
|
return textSpan(node);
|
|
}
|
|
// fall through.
|
|
case 241 /* CatchClause */:
|
|
return spanInNode(ts.lastOrUndefined(node.parent.statements));
|
|
;
|
|
case 217 /* CaseBlock */:
|
|
// breakpoint in last statement of the last clause
|
|
var caseBlock = node.parent;
|
|
var lastClause = ts.lastOrUndefined(caseBlock.clauses);
|
|
if (lastClause) {
|
|
return spanInNode(ts.lastOrUndefined(lastClause.statements));
|
|
}
|
|
return undefined;
|
|
// Default to parent node
|
|
default:
|
|
return spanInNode(node.parent);
|
|
}
|
|
}
|
|
function spanInOpenParenToken(node) {
|
|
if (node.parent.kind === 194 /* DoStatement */) {
|
|
// Go to while keyword and do action instead
|
|
return spanInPreviousNode(node);
|
|
}
|
|
// Default to parent node
|
|
return spanInNode(node.parent);
|
|
}
|
|
function spanInCloseParenToken(node) {
|
|
// Is this close paren token of parameter list, set span in previous token
|
|
switch (node.parent.kind) {
|
|
case 170 /* FunctionExpression */:
|
|
case 210 /* FunctionDeclaration */:
|
|
case 171 /* ArrowFunction */:
|
|
case 140 /* MethodDeclaration */:
|
|
case 139 /* MethodSignature */:
|
|
case 142 /* GetAccessor */:
|
|
case 143 /* SetAccessor */:
|
|
case 141 /* Constructor */:
|
|
case 195 /* WhileStatement */:
|
|
case 194 /* DoStatement */:
|
|
case 196 /* ForStatement */:
|
|
return spanInPreviousNode(node);
|
|
// Default to parent node
|
|
default:
|
|
return spanInNode(node.parent);
|
|
}
|
|
// Default to parent node
|
|
return spanInNode(node.parent);
|
|
}
|
|
function spanInColonToken(node) {
|
|
// Is this : specifying return annotation of the function declaration
|
|
if (ts.isFunctionLike(node.parent) || node.parent.kind === 242 /* PropertyAssignment */) {
|
|
return spanInPreviousNode(node);
|
|
}
|
|
return spanInNode(node.parent);
|
|
}
|
|
function spanInGreaterThanOrLessThanToken(node) {
|
|
if (node.parent.kind === 168 /* TypeAssertionExpression */) {
|
|
return spanInNode(node.parent.expression);
|
|
}
|
|
return spanInNode(node.parent);
|
|
}
|
|
function spanInWhileKeyword(node) {
|
|
if (node.parent.kind === 194 /* DoStatement */) {
|
|
// Set span on while expression
|
|
return textSpan(node, ts.findNextToken(node.parent.expression, node.parent));
|
|
}
|
|
// Default to parent node
|
|
return spanInNode(node.parent);
|
|
}
|
|
}
|
|
}
|
|
BreakpointResolver.spanInSourceFileAtLocation = spanInSourceFileAtLocation;
|
|
})(BreakpointResolver = ts.BreakpointResolver || (ts.BreakpointResolver = {}));
|
|
})(ts || (ts = {}));
|
|
//
|
|
// 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
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
//
|
|
/// <reference path='services.ts' />
|
|
/* @internal */
|
|
var debugObjectHost = this;
|
|
/* @internal */
|
|
var ts;
|
|
(function (ts) {
|
|
function logInternalError(logger, err) {
|
|
if (logger) {
|
|
logger.log("*INTERNAL ERROR* - Exception in typescript services: " + err.message);
|
|
}
|
|
}
|
|
var ScriptSnapshotShimAdapter = (function () {
|
|
function ScriptSnapshotShimAdapter(scriptSnapshotShim) {
|
|
this.scriptSnapshotShim = scriptSnapshotShim;
|
|
this.lineStartPositions = null;
|
|
}
|
|
ScriptSnapshotShimAdapter.prototype.getText = function (start, end) {
|
|
return this.scriptSnapshotShim.getText(start, end);
|
|
};
|
|
ScriptSnapshotShimAdapter.prototype.getLength = function () {
|
|
return this.scriptSnapshotShim.getLength();
|
|
};
|
|
ScriptSnapshotShimAdapter.prototype.getChangeRange = function (oldSnapshot) {
|
|
var oldSnapshotShim = oldSnapshot;
|
|
var encoded = this.scriptSnapshotShim.getChangeRange(oldSnapshotShim.scriptSnapshotShim);
|
|
// TODO: should this be '==='?
|
|
if (encoded == null) {
|
|
return null;
|
|
}
|
|
var decoded = JSON.parse(encoded);
|
|
return ts.createTextChangeRange(ts.createTextSpan(decoded.span.start, decoded.span.length), decoded.newLength);
|
|
};
|
|
ScriptSnapshotShimAdapter.prototype.dispose = function () {
|
|
// if scriptSnapshotShim is a COM object then property check becomes method call with no arguments
|
|
// 'in' does not have this effect
|
|
if ("dispose" in this.scriptSnapshotShim) {
|
|
this.scriptSnapshotShim.dispose();
|
|
}
|
|
};
|
|
return ScriptSnapshotShimAdapter;
|
|
})();
|
|
var LanguageServiceShimHostAdapter = (function () {
|
|
function LanguageServiceShimHostAdapter(shimHost) {
|
|
this.shimHost = shimHost;
|
|
this.loggingEnabled = false;
|
|
this.tracingEnabled = false;
|
|
}
|
|
LanguageServiceShimHostAdapter.prototype.log = function (s) {
|
|
if (this.loggingEnabled) {
|
|
this.shimHost.log(s);
|
|
}
|
|
};
|
|
LanguageServiceShimHostAdapter.prototype.trace = function (s) {
|
|
if (this.tracingEnabled) {
|
|
this.shimHost.trace(s);
|
|
}
|
|
};
|
|
LanguageServiceShimHostAdapter.prototype.error = function (s) {
|
|
this.shimHost.error(s);
|
|
};
|
|
LanguageServiceShimHostAdapter.prototype.getProjectVersion = function () {
|
|
if (!this.shimHost.getProjectVersion) {
|
|
// shimmed host does not support getProjectVersion
|
|
return undefined;
|
|
}
|
|
return this.shimHost.getProjectVersion();
|
|
};
|
|
LanguageServiceShimHostAdapter.prototype.useCaseSensitiveFileNames = function () {
|
|
return this.shimHost.useCaseSensitiveFileNames ? this.shimHost.useCaseSensitiveFileNames() : false;
|
|
};
|
|
LanguageServiceShimHostAdapter.prototype.getCompilationSettings = function () {
|
|
var settingsJson = this.shimHost.getCompilationSettings();
|
|
// TODO: should this be '==='?
|
|
if (settingsJson == null || settingsJson == "") {
|
|
throw Error("LanguageServiceShimHostAdapter.getCompilationSettings: empty compilationSettings");
|
|
return null;
|
|
}
|
|
return JSON.parse(settingsJson);
|
|
};
|
|
LanguageServiceShimHostAdapter.prototype.getScriptFileNames = function () {
|
|
var encoded = this.shimHost.getScriptFileNames();
|
|
return this.files = JSON.parse(encoded);
|
|
};
|
|
LanguageServiceShimHostAdapter.prototype.getScriptSnapshot = function (fileName) {
|
|
// Shim the API changes for 1.5 release. This should be removed once
|
|
// TypeScript 1.5 has shipped.
|
|
if (this.files && this.files.indexOf(fileName) < 0) {
|
|
return undefined;
|
|
}
|
|
var scriptSnapshot = this.shimHost.getScriptSnapshot(fileName);
|
|
return scriptSnapshot && new ScriptSnapshotShimAdapter(scriptSnapshot);
|
|
};
|
|
LanguageServiceShimHostAdapter.prototype.getScriptVersion = function (fileName) {
|
|
return this.shimHost.getScriptVersion(fileName);
|
|
};
|
|
LanguageServiceShimHostAdapter.prototype.getLocalizedDiagnosticMessages = function () {
|
|
var diagnosticMessagesJson = this.shimHost.getLocalizedDiagnosticMessages();
|
|
if (diagnosticMessagesJson == null || diagnosticMessagesJson == "") {
|
|
return null;
|
|
}
|
|
try {
|
|
return JSON.parse(diagnosticMessagesJson);
|
|
}
|
|
catch (e) {
|
|
this.log(e.description || "diagnosticMessages.generated.json has invalid JSON format");
|
|
return null;
|
|
}
|
|
};
|
|
LanguageServiceShimHostAdapter.prototype.getCancellationToken = function () {
|
|
var hostCancellationToken = this.shimHost.getCancellationToken();
|
|
return new ThrottledCancellationToken(hostCancellationToken);
|
|
};
|
|
LanguageServiceShimHostAdapter.prototype.getCurrentDirectory = function () {
|
|
return this.shimHost.getCurrentDirectory();
|
|
};
|
|
LanguageServiceShimHostAdapter.prototype.getDefaultLibFileName = function (options) {
|
|
// Wrap the API changes for 1.5 release. This try/catch
|
|
// should be removed once TypeScript 1.5 has shipped.
|
|
try {
|
|
return this.shimHost.getDefaultLibFileName(JSON.stringify(options));
|
|
}
|
|
catch (e) {
|
|
return "";
|
|
}
|
|
};
|
|
return LanguageServiceShimHostAdapter;
|
|
})();
|
|
ts.LanguageServiceShimHostAdapter = LanguageServiceShimHostAdapter;
|
|
/** A cancellation that throttles calls to the host */
|
|
var ThrottledCancellationToken = (function () {
|
|
function ThrottledCancellationToken(hostCancellationToken) {
|
|
this.hostCancellationToken = hostCancellationToken;
|
|
// Store when we last tried to cancel. Checking cancellation can be expensive (as we have
|
|
// to marshall over to the host layer). So we only bother actually checking once enough
|
|
// time has passed.
|
|
this.lastCancellationCheckTime = 0;
|
|
}
|
|
ThrottledCancellationToken.prototype.isCancellationRequested = function () {
|
|
var time = Date.now();
|
|
var duration = Math.abs(time - this.lastCancellationCheckTime);
|
|
if (duration > 10) {
|
|
// Check no more than once every 10 ms.
|
|
this.lastCancellationCheckTime = time;
|
|
return this.hostCancellationToken.isCancellationRequested();
|
|
}
|
|
return false;
|
|
};
|
|
return ThrottledCancellationToken;
|
|
})();
|
|
var CoreServicesShimHostAdapter = (function () {
|
|
function CoreServicesShimHostAdapter(shimHost) {
|
|
this.shimHost = shimHost;
|
|
}
|
|
CoreServicesShimHostAdapter.prototype.readDirectory = function (rootDir, extension) {
|
|
var encoded = this.shimHost.readDirectory(rootDir, extension);
|
|
return JSON.parse(encoded);
|
|
};
|
|
return CoreServicesShimHostAdapter;
|
|
})();
|
|
ts.CoreServicesShimHostAdapter = CoreServicesShimHostAdapter;
|
|
function simpleForwardCall(logger, actionDescription, action, logPerformance) {
|
|
if (logPerformance) {
|
|
logger.log(actionDescription);
|
|
var start = Date.now();
|
|
}
|
|
var result = action();
|
|
if (logPerformance) {
|
|
var end = Date.now();
|
|
logger.log(actionDescription + " completed in " + (end - start) + " msec");
|
|
if (typeof (result) === "string") {
|
|
var str = result;
|
|
if (str.length > 128) {
|
|
str = str.substring(0, 128) + "...";
|
|
}
|
|
logger.log(" result.length=" + str.length + ", result='" + JSON.stringify(str) + "'");
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
function forwardJSONCall(logger, actionDescription, action, logPerformance) {
|
|
try {
|
|
var result = simpleForwardCall(logger, actionDescription, action, logPerformance);
|
|
return JSON.stringify({ result: result });
|
|
}
|
|
catch (err) {
|
|
if (err instanceof ts.OperationCanceledException) {
|
|
return JSON.stringify({ canceled: true });
|
|
}
|
|
logInternalError(logger, err);
|
|
err.description = actionDescription;
|
|
return JSON.stringify({ error: err });
|
|
}
|
|
}
|
|
var ShimBase = (function () {
|
|
function ShimBase(factory) {
|
|
this.factory = factory;
|
|
factory.registerShim(this);
|
|
}
|
|
ShimBase.prototype.dispose = function (dummy) {
|
|
this.factory.unregisterShim(this);
|
|
};
|
|
return ShimBase;
|
|
})();
|
|
function realizeDiagnostics(diagnostics, newLine) {
|
|
return diagnostics.map(function (d) { return realizeDiagnostic(d, newLine); });
|
|
}
|
|
ts.realizeDiagnostics = realizeDiagnostics;
|
|
function realizeDiagnostic(diagnostic, newLine) {
|
|
return {
|
|
message: ts.flattenDiagnosticMessageText(diagnostic.messageText, newLine),
|
|
start: diagnostic.start,
|
|
length: diagnostic.length,
|
|
/// TODO: no need for the tolowerCase call
|
|
category: ts.DiagnosticCategory[diagnostic.category].toLowerCase(),
|
|
code: diagnostic.code
|
|
};
|
|
}
|
|
var LanguageServiceShimObject = (function (_super) {
|
|
__extends(LanguageServiceShimObject, _super);
|
|
function LanguageServiceShimObject(factory, host, languageService) {
|
|
_super.call(this, factory);
|
|
this.host = host;
|
|
this.languageService = languageService;
|
|
this.logPerformance = false;
|
|
this.logger = this.host;
|
|
}
|
|
LanguageServiceShimObject.prototype.forwardJSONCall = function (actionDescription, action) {
|
|
return forwardJSONCall(this.logger, actionDescription, action, this.logPerformance);
|
|
};
|
|
/// DISPOSE
|
|
/**
|
|
* Ensure (almost) deterministic release of internal Javascript resources when
|
|
* some external native objects holds onto us (e.g. Com/Interop).
|
|
*/
|
|
LanguageServiceShimObject.prototype.dispose = function (dummy) {
|
|
this.logger.log("dispose()");
|
|
this.languageService.dispose();
|
|
this.languageService = null;
|
|
// force a GC
|
|
if (debugObjectHost && debugObjectHost.CollectGarbage) {
|
|
debugObjectHost.CollectGarbage();
|
|
this.logger.log("CollectGarbage()");
|
|
}
|
|
this.logger = null;
|
|
_super.prototype.dispose.call(this, dummy);
|
|
};
|
|
/// REFRESH
|
|
/**
|
|
* Update the list of scripts known to the compiler
|
|
*/
|
|
LanguageServiceShimObject.prototype.refresh = function (throwOnError) {
|
|
this.forwardJSONCall("refresh(" + throwOnError + ")", function () {
|
|
return null;
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.cleanupSemanticCache = function () {
|
|
var _this = this;
|
|
this.forwardJSONCall("cleanupSemanticCache()", function () {
|
|
_this.languageService.cleanupSemanticCache();
|
|
return null;
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.realizeDiagnostics = function (diagnostics) {
|
|
var newLine = this.getNewLine();
|
|
return ts.realizeDiagnostics(diagnostics, newLine);
|
|
};
|
|
LanguageServiceShimObject.prototype.getSyntacticClassifications = function (fileName, start, length) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getSyntacticClassifications('" + fileName + "', " + start + ", " + length + ")", function () {
|
|
var classifications = _this.languageService.getSyntacticClassifications(fileName, ts.createTextSpan(start, length));
|
|
return classifications;
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getSemanticClassifications = function (fileName, start, length) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getSemanticClassifications('" + fileName + "', " + start + ", " + length + ")", function () {
|
|
var classifications = _this.languageService.getSemanticClassifications(fileName, ts.createTextSpan(start, length));
|
|
return classifications;
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getEncodedSyntacticClassifications = function (fileName, start, length) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getEncodedSyntacticClassifications('" + fileName + "', " + start + ", " + length + ")", function () {
|
|
// directly serialize the spans out to a string. This is much faster to decode
|
|
// on the managed side versus a full JSON array.
|
|
return convertClassifications(_this.languageService.getEncodedSyntacticClassifications(fileName, ts.createTextSpan(start, length)));
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getEncodedSemanticClassifications = function (fileName, start, length) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getEncodedSemanticClassifications('" + fileName + "', " + start + ", " + length + ")", function () {
|
|
// directly serialize the spans out to a string. This is much faster to decode
|
|
// on the managed side versus a full JSON array.
|
|
return convertClassifications(_this.languageService.getEncodedSemanticClassifications(fileName, ts.createTextSpan(start, length)));
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getNewLine = function () {
|
|
return this.host.getNewLine ? this.host.getNewLine() : "\r\n";
|
|
};
|
|
LanguageServiceShimObject.prototype.getSyntacticDiagnostics = function (fileName) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getSyntacticDiagnostics('" + fileName + "')", function () {
|
|
var diagnostics = _this.languageService.getSyntacticDiagnostics(fileName);
|
|
return _this.realizeDiagnostics(diagnostics);
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getSemanticDiagnostics = function (fileName) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getSemanticDiagnostics('" + fileName + "')", function () {
|
|
var diagnostics = _this.languageService.getSemanticDiagnostics(fileName);
|
|
return _this.realizeDiagnostics(diagnostics);
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getCompilerOptionsDiagnostics = function () {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getCompilerOptionsDiagnostics()", function () {
|
|
var diagnostics = _this.languageService.getCompilerOptionsDiagnostics();
|
|
return _this.realizeDiagnostics(diagnostics);
|
|
});
|
|
};
|
|
/// QUICKINFO
|
|
/**
|
|
* Computes a string representation of the type at the requested position
|
|
* in the active file.
|
|
*/
|
|
LanguageServiceShimObject.prototype.getQuickInfoAtPosition = function (fileName, position) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getQuickInfoAtPosition('" + fileName + "', " + position + ")", function () {
|
|
var quickInfo = _this.languageService.getQuickInfoAtPosition(fileName, position);
|
|
return quickInfo;
|
|
});
|
|
};
|
|
/// NAMEORDOTTEDNAMESPAN
|
|
/**
|
|
* Computes span information of the name or dotted name at the requested position
|
|
* in the active file.
|
|
*/
|
|
LanguageServiceShimObject.prototype.getNameOrDottedNameSpan = function (fileName, startPos, endPos) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getNameOrDottedNameSpan('" + fileName + "', " + startPos + ", " + endPos + ")", function () {
|
|
var spanInfo = _this.languageService.getNameOrDottedNameSpan(fileName, startPos, endPos);
|
|
return spanInfo;
|
|
});
|
|
};
|
|
/**
|
|
* STATEMENTSPAN
|
|
* Computes span information of statement at the requested position in the active file.
|
|
*/
|
|
LanguageServiceShimObject.prototype.getBreakpointStatementAtPosition = function (fileName, position) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getBreakpointStatementAtPosition('" + fileName + "', " + position + ")", function () {
|
|
var spanInfo = _this.languageService.getBreakpointStatementAtPosition(fileName, position);
|
|
return spanInfo;
|
|
});
|
|
};
|
|
/// SIGNATUREHELP
|
|
LanguageServiceShimObject.prototype.getSignatureHelpItems = function (fileName, position) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getSignatureHelpItems('" + fileName + "', " + position + ")", function () {
|
|
var signatureInfo = _this.languageService.getSignatureHelpItems(fileName, position);
|
|
return signatureInfo;
|
|
});
|
|
};
|
|
/// GOTO DEFINITION
|
|
/**
|
|
* Computes the definition location and file for the symbol
|
|
* at the requested position.
|
|
*/
|
|
LanguageServiceShimObject.prototype.getDefinitionAtPosition = function (fileName, position) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getDefinitionAtPosition('" + fileName + "', " + position + ")", function () {
|
|
return _this.languageService.getDefinitionAtPosition(fileName, position);
|
|
});
|
|
};
|
|
/// GOTO Type
|
|
/**
|
|
* Computes the definition location of the type of the symbol
|
|
* at the requested position.
|
|
*/
|
|
LanguageServiceShimObject.prototype.getTypeDefinitionAtPosition = function (fileName, position) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getTypeDefinitionAtPosition('" + fileName + "', " + position + ")", function () {
|
|
return _this.languageService.getTypeDefinitionAtPosition(fileName, position);
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getRenameInfo = function (fileName, position) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getRenameInfo('" + fileName + "', " + position + ")", function () {
|
|
return _this.languageService.getRenameInfo(fileName, position);
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.findRenameLocations = function (fileName, position, findInStrings, findInComments) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("findRenameLocations('" + fileName + "', " + position + ", " + findInStrings + ", " + findInComments + ")", function () {
|
|
return _this.languageService.findRenameLocations(fileName, position, findInStrings, findInComments);
|
|
});
|
|
};
|
|
/// GET BRACE MATCHING
|
|
LanguageServiceShimObject.prototype.getBraceMatchingAtPosition = function (fileName, position) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getBraceMatchingAtPosition('" + fileName + "', " + position + ")", function () {
|
|
var textRanges = _this.languageService.getBraceMatchingAtPosition(fileName, position);
|
|
return textRanges;
|
|
});
|
|
};
|
|
/// GET SMART INDENT
|
|
LanguageServiceShimObject.prototype.getIndentationAtPosition = function (fileName, position, options /*Services.EditorOptions*/) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getIndentationAtPosition('" + fileName + "', " + position + ")", function () {
|
|
var localOptions = JSON.parse(options);
|
|
return _this.languageService.getIndentationAtPosition(fileName, position, localOptions);
|
|
});
|
|
};
|
|
/// GET REFERENCES
|
|
LanguageServiceShimObject.prototype.getReferencesAtPosition = function (fileName, position) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getReferencesAtPosition('" + fileName + "', " + position + ")", function () {
|
|
return _this.languageService.getReferencesAtPosition(fileName, position);
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.findReferences = function (fileName, position) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("findReferences('" + fileName + "', " + position + ")", function () {
|
|
return _this.languageService.findReferences(fileName, position);
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getOccurrencesAtPosition = function (fileName, position) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getOccurrencesAtPosition('" + fileName + "', " + position + ")", function () {
|
|
return _this.languageService.getOccurrencesAtPosition(fileName, position);
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getDocumentHighlights = function (fileName, position, filesToSearch) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getDocumentHighlights('" + fileName + "', " + position + ")", function () {
|
|
return _this.languageService.getDocumentHighlights(fileName, position, JSON.parse(filesToSearch));
|
|
});
|
|
};
|
|
/// COMPLETION LISTS
|
|
/**
|
|
* Get a string based representation of the completions
|
|
* to provide at the given source position and providing a member completion
|
|
* list if requested.
|
|
*/
|
|
LanguageServiceShimObject.prototype.getCompletionsAtPosition = function (fileName, position) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getCompletionsAtPosition('" + fileName + "', " + position + ")", function () {
|
|
var completion = _this.languageService.getCompletionsAtPosition(fileName, position);
|
|
return completion;
|
|
});
|
|
};
|
|
/** Get a string based representation of a completion list entry details */
|
|
LanguageServiceShimObject.prototype.getCompletionEntryDetails = function (fileName, position, entryName) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getCompletionEntryDetails('" + fileName + "', " + position + ", " + entryName + ")", function () {
|
|
var details = _this.languageService.getCompletionEntryDetails(fileName, position, entryName);
|
|
return details;
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getFormattingEditsForRange = function (fileName, start, end, options /*Services.FormatCodeOptions*/) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getFormattingEditsForRange('" + fileName + "', " + start + ", " + end + ")", function () {
|
|
var localOptions = JSON.parse(options);
|
|
var edits = _this.languageService.getFormattingEditsForRange(fileName, start, end, localOptions);
|
|
return edits;
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getFormattingEditsForDocument = function (fileName, options /*Services.FormatCodeOptions*/) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getFormattingEditsForDocument('" + fileName + "')", function () {
|
|
var localOptions = JSON.parse(options);
|
|
var edits = _this.languageService.getFormattingEditsForDocument(fileName, localOptions);
|
|
return edits;
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getFormattingEditsAfterKeystroke = function (fileName, position, key, options /*Services.FormatCodeOptions*/) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getFormattingEditsAfterKeystroke('" + fileName + "', " + position + ", '" + key + "')", function () {
|
|
var localOptions = JSON.parse(options);
|
|
var edits = _this.languageService.getFormattingEditsAfterKeystroke(fileName, position, key, localOptions);
|
|
return edits;
|
|
});
|
|
};
|
|
/// NAVIGATE TO
|
|
/** Return a list of symbols that are interesting to navigate to */
|
|
LanguageServiceShimObject.prototype.getNavigateToItems = function (searchValue, maxResultCount) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getNavigateToItems('" + searchValue + "', " + maxResultCount + ")", function () {
|
|
var items = _this.languageService.getNavigateToItems(searchValue, maxResultCount);
|
|
return items;
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getNavigationBarItems = function (fileName) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getNavigationBarItems('" + fileName + "')", function () {
|
|
var items = _this.languageService.getNavigationBarItems(fileName);
|
|
return items;
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getOutliningSpans = function (fileName) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getOutliningSpans('" + fileName + "')", function () {
|
|
var items = _this.languageService.getOutliningSpans(fileName);
|
|
return items;
|
|
});
|
|
};
|
|
LanguageServiceShimObject.prototype.getTodoComments = function (fileName, descriptors) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getTodoComments('" + fileName + "')", function () {
|
|
var items = _this.languageService.getTodoComments(fileName, JSON.parse(descriptors));
|
|
return items;
|
|
});
|
|
};
|
|
/// Emit
|
|
LanguageServiceShimObject.prototype.getEmitOutput = function (fileName) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getEmitOutput('" + fileName + "')", function () {
|
|
var output = _this.languageService.getEmitOutput(fileName);
|
|
// Shim the API changes for 1.5 release. This should be removed once
|
|
// TypeScript 1.5 has shipped.
|
|
output.emitOutputStatus = output.emitSkipped ? 1 : 0;
|
|
return output;
|
|
});
|
|
};
|
|
return LanguageServiceShimObject;
|
|
})(ShimBase);
|
|
function convertClassifications(classifications) {
|
|
return { spans: classifications.spans.join(","), endOfLineState: classifications.endOfLineState };
|
|
}
|
|
var ClassifierShimObject = (function (_super) {
|
|
__extends(ClassifierShimObject, _super);
|
|
function ClassifierShimObject(factory, logger) {
|
|
_super.call(this, factory);
|
|
this.logger = logger;
|
|
this.logPerformance = false;
|
|
this.classifier = ts.createClassifier();
|
|
}
|
|
ClassifierShimObject.prototype.getEncodedLexicalClassifications = function (text, lexState, syntacticClassifierAbsent) {
|
|
var _this = this;
|
|
return forwardJSONCall(this.logger, "getEncodedLexicalClassifications", function () { return convertClassifications(_this.classifier.getEncodedLexicalClassifications(text, lexState, syntacticClassifierAbsent)); }, this.logPerformance);
|
|
};
|
|
/// COLORIZATION
|
|
ClassifierShimObject.prototype.getClassificationsForLine = function (text, lexState, classifyKeywordsInGenerics) {
|
|
var classification = this.classifier.getClassificationsForLine(text, lexState, classifyKeywordsInGenerics);
|
|
var items = classification.entries;
|
|
var result = "";
|
|
for (var i = 0; i < items.length; i++) {
|
|
result += items[i].length + "\n";
|
|
result += items[i].classification + "\n";
|
|
}
|
|
result += classification.finalLexState;
|
|
return result;
|
|
};
|
|
return ClassifierShimObject;
|
|
})(ShimBase);
|
|
var CoreServicesShimObject = (function (_super) {
|
|
__extends(CoreServicesShimObject, _super);
|
|
function CoreServicesShimObject(factory, logger, host) {
|
|
_super.call(this, factory);
|
|
this.logger = logger;
|
|
this.host = host;
|
|
this.logPerformance = false;
|
|
}
|
|
CoreServicesShimObject.prototype.forwardJSONCall = function (actionDescription, action) {
|
|
return forwardJSONCall(this.logger, actionDescription, action, this.logPerformance);
|
|
};
|
|
CoreServicesShimObject.prototype.getPreProcessedFileInfo = function (fileName, sourceTextSnapshot) {
|
|
return this.forwardJSONCall("getPreProcessedFileInfo('" + fileName + "')", function () {
|
|
var result = ts.preProcessFile(sourceTextSnapshot.getText(0, sourceTextSnapshot.getLength()));
|
|
var convertResult = {
|
|
referencedFiles: [],
|
|
importedFiles: [],
|
|
isLibFile: result.isLibFile
|
|
};
|
|
ts.forEach(result.referencedFiles, function (refFile) {
|
|
convertResult.referencedFiles.push({
|
|
path: ts.normalizePath(refFile.fileName),
|
|
position: refFile.pos,
|
|
length: refFile.end - refFile.pos
|
|
});
|
|
});
|
|
ts.forEach(result.importedFiles, function (importedFile) {
|
|
convertResult.importedFiles.push({
|
|
path: ts.normalizeSlashes(importedFile.fileName),
|
|
position: importedFile.pos,
|
|
length: importedFile.end - importedFile.pos
|
|
});
|
|
});
|
|
return convertResult;
|
|
});
|
|
};
|
|
CoreServicesShimObject.prototype.getTSConfigFileInfo = function (fileName, sourceTextSnapshot) {
|
|
var _this = this;
|
|
return this.forwardJSONCall("getTSConfigFileInfo('" + fileName + "')", function () {
|
|
var text = sourceTextSnapshot.getText(0, sourceTextSnapshot.getLength());
|
|
var result = ts.parseConfigFileText(fileName, text);
|
|
if (result.error) {
|
|
return {
|
|
options: {},
|
|
files: [],
|
|
errors: [realizeDiagnostic(result.error, '\r\n')]
|
|
};
|
|
}
|
|
var configFile = ts.parseConfigFile(result.config, _this.host, ts.getDirectoryPath(ts.normalizeSlashes(fileName)));
|
|
return {
|
|
options: configFile.options,
|
|
files: configFile.fileNames,
|
|
errors: realizeDiagnostics(configFile.errors, '\r\n')
|
|
};
|
|
});
|
|
};
|
|
CoreServicesShimObject.prototype.getDefaultCompilationSettings = function () {
|
|
return this.forwardJSONCall("getDefaultCompilationSettings()", function () {
|
|
return ts.getDefaultCompilerOptions();
|
|
});
|
|
};
|
|
return CoreServicesShimObject;
|
|
})(ShimBase);
|
|
var TypeScriptServicesFactory = (function () {
|
|
function TypeScriptServicesFactory() {
|
|
this._shims = [];
|
|
}
|
|
/*
|
|
* Returns script API version.
|
|
*/
|
|
TypeScriptServicesFactory.prototype.getServicesVersion = function () {
|
|
return ts.servicesVersion;
|
|
};
|
|
TypeScriptServicesFactory.prototype.createLanguageServiceShim = function (host) {
|
|
try {
|
|
if (this.documentRegistry === undefined) {
|
|
this.documentRegistry = ts.createDocumentRegistry(host.useCaseSensitiveFileNames && host.useCaseSensitiveFileNames());
|
|
}
|
|
var hostAdapter = new LanguageServiceShimHostAdapter(host);
|
|
var languageService = ts.createLanguageService(hostAdapter, this.documentRegistry);
|
|
return new LanguageServiceShimObject(this, host, languageService);
|
|
}
|
|
catch (err) {
|
|
logInternalError(host, err);
|
|
throw err;
|
|
}
|
|
};
|
|
TypeScriptServicesFactory.prototype.createClassifierShim = function (logger) {
|
|
try {
|
|
return new ClassifierShimObject(this, logger);
|
|
}
|
|
catch (err) {
|
|
logInternalError(logger, err);
|
|
throw err;
|
|
}
|
|
};
|
|
TypeScriptServicesFactory.prototype.createCoreServicesShim = function (host) {
|
|
try {
|
|
var adapter = new CoreServicesShimHostAdapter(host);
|
|
return new CoreServicesShimObject(this, host, adapter);
|
|
}
|
|
catch (err) {
|
|
logInternalError(host, err);
|
|
throw err;
|
|
}
|
|
};
|
|
TypeScriptServicesFactory.prototype.close = function () {
|
|
// Forget all the registered shims
|
|
this._shims = [];
|
|
this.documentRegistry = ts.createDocumentRegistry();
|
|
};
|
|
TypeScriptServicesFactory.prototype.registerShim = function (shim) {
|
|
this._shims.push(shim);
|
|
};
|
|
TypeScriptServicesFactory.prototype.unregisterShim = function (shim) {
|
|
for (var i = 0, n = this._shims.length; i < n; i++) {
|
|
if (this._shims[i] === shim) {
|
|
delete this._shims[i];
|
|
return;
|
|
}
|
|
}
|
|
throw new Error("Invalid operation");
|
|
};
|
|
return TypeScriptServicesFactory;
|
|
})();
|
|
ts.TypeScriptServicesFactory = TypeScriptServicesFactory;
|
|
if (typeof module !== "undefined" && module.exports) {
|
|
module.exports = ts;
|
|
}
|
|
})(ts || (ts = {}));
|
|
/// TODO: this is used by VS, clean this up on both sides of the interface
|
|
/* @internal */
|
|
var TypeScript;
|
|
(function (TypeScript) {
|
|
var Services;
|
|
(function (Services) {
|
|
Services.TypeScriptServicesFactory = ts.TypeScriptServicesFactory;
|
|
})(Services = TypeScript.Services || (TypeScript.Services = {}));
|
|
})(TypeScript || (TypeScript = {}));
|
|
/* @internal */
|
|
var toolsVersion = "1.5";
|