-
Notifications
You must be signed in to change notification settings - Fork 12.8k
Fix self tail call return type inference in assigned anonymous functions #58124
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
Changes from all commits
Commits
Show all changes
3 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
17 changes: 17 additions & 0 deletions
17
tests/baselines/reference/simpleRecursionWithBaseCase3.symbols
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,17 @@ | ||
| //// [tests/cases/compiler/simpleRecursionWithBaseCase3.ts] //// | ||
|
|
||
| === simpleRecursionWithBaseCase3.ts === | ||
| const fn1 = () => { | ||
| >fn1 : Symbol(fn1, Decl(simpleRecursionWithBaseCase3.ts, 0, 5)) | ||
|
|
||
| if (Math.random() > 0.5) { | ||
| >Math.random : Symbol(Math.random, Decl(lib.es5.d.ts, --, --)) | ||
| >Math : Symbol(Math, Decl(lib.es5.d.ts, --, --), Decl(lib.es5.d.ts, --, --), Decl(lib.es2015.core.d.ts, --, --), Decl(lib.es2015.symbol.wellknown.d.ts, --, --)) | ||
| >random : Symbol(Math.random, Decl(lib.es5.d.ts, --, --)) | ||
|
|
||
| return fn1() | ||
| >fn1 : Symbol(fn1, Decl(simpleRecursionWithBaseCase3.ts, 0, 5)) | ||
| } | ||
| return 0 | ||
| } | ||
|
|
34 changes: 34 additions & 0 deletions
34
tests/baselines/reference/simpleRecursionWithBaseCase3.types
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,34 @@ | ||
| //// [tests/cases/compiler/simpleRecursionWithBaseCase3.ts] //// | ||
|
|
||
| === simpleRecursionWithBaseCase3.ts === | ||
| const fn1 = () => { | ||
| >fn1 : () => number | ||
| > : ^^^^^^^^^^^^ | ||
| >() => { if (Math.random() > 0.5) { return fn1() } return 0} : () => number | ||
| > : | ||
|
|
||
| if (Math.random() > 0.5) { | ||
| >Math.random() > 0.5 : boolean | ||
| > : ^^^^^^^ | ||
| >Math.random() : number | ||
| > : ^^^^^^ | ||
| >Math.random : () => number | ||
| > : ^^^^^^^^^^^^ | ||
| >Math : Math | ||
| > : ^^^^ | ||
| >random : () => number | ||
| > : ^^^^^^^^^^^^ | ||
| >0.5 : 0.5 | ||
| > : ^^^ | ||
|
|
||
| return fn1() | ||
| >fn1() : number | ||
| > : ^^^^^^ | ||
| >fn1 : () => number | ||
| > : ^^^^^^^^^^^^ | ||
| } | ||
| return 0 | ||
| >0 : 0 | ||
| > : ^ | ||
| } | ||
|
|
43 changes: 43 additions & 0 deletions
43
tests/baselines/reference/simpleRecursionWithBaseCase4.symbols
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,43 @@ | ||
| //// [tests/cases/compiler/simpleRecursionWithBaseCase4.ts] //// | ||
|
|
||
| === simpleRecursionWithBaseCase4.ts === | ||
| var fn2 = function(name) { | ||
| >fn2 : Symbol(fn2, Decl(simpleRecursionWithBaseCase4.ts, 0, 3)) | ||
| >name : Symbol(name, Decl(simpleRecursionWithBaseCase4.ts, 0, 19)) | ||
|
|
||
| fn2 = compose(this, 0, 1) | ||
| >fn2 : Symbol(fn2, Decl(simpleRecursionWithBaseCase4.ts, 0, 3)) | ||
| >compose : Symbol(compose, Decl(simpleRecursionWithBaseCase4.ts, 2, 18)) | ||
|
|
||
| return fn2(name) | ||
| >fn2 : Symbol(fn2, Decl(simpleRecursionWithBaseCase4.ts, 0, 3)) | ||
| >name : Symbol(name, Decl(simpleRecursionWithBaseCase4.ts, 0, 19)) | ||
|
|
||
| function compose(child, level, find) { | ||
| >compose : Symbol(compose, Decl(simpleRecursionWithBaseCase4.ts, 2, 18)) | ||
| >child : Symbol(child, Decl(simpleRecursionWithBaseCase4.ts, 4, 19)) | ||
| >level : Symbol(level, Decl(simpleRecursionWithBaseCase4.ts, 4, 25)) | ||
| >find : Symbol(find, Decl(simpleRecursionWithBaseCase4.ts, 4, 32)) | ||
|
|
||
| if (child === find) { | ||
| >child : Symbol(child, Decl(simpleRecursionWithBaseCase4.ts, 4, 19)) | ||
| >find : Symbol(find, Decl(simpleRecursionWithBaseCase4.ts, 4, 32)) | ||
|
|
||
| return level | ||
| >level : Symbol(level, Decl(simpleRecursionWithBaseCase4.ts, 4, 25)) | ||
| } | ||
| return compose(child, level + 1, find) | ||
| >compose : Symbol(compose, Decl(simpleRecursionWithBaseCase4.ts, 2, 18)) | ||
| >child : Symbol(child, Decl(simpleRecursionWithBaseCase4.ts, 4, 19)) | ||
| >level : Symbol(level, Decl(simpleRecursionWithBaseCase4.ts, 4, 25)) | ||
| >find : Symbol(find, Decl(simpleRecursionWithBaseCase4.ts, 4, 32)) | ||
| } | ||
| } | ||
|
|
||
| var d = fn2(1); // d: any | ||
| >d : Symbol(d, Decl(simpleRecursionWithBaseCase4.ts, 12, 3)) | ||
| >fn2 : Symbol(fn2, Decl(simpleRecursionWithBaseCase4.ts, 0, 3)) | ||
|
|
||
| d.redefined(); | ||
| >d : Symbol(d, Decl(simpleRecursionWithBaseCase4.ts, 12, 3)) | ||
|
|
74 changes: 74 additions & 0 deletions
74
tests/baselines/reference/simpleRecursionWithBaseCase4.types
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,74 @@ | ||
| //// [tests/cases/compiler/simpleRecursionWithBaseCase4.ts] //// | ||
|
|
||
| === simpleRecursionWithBaseCase4.ts === | ||
| var fn2 = function(name) { | ||
| >fn2 : (name: any) => any | ||
| > : ^ ^^^^^^^^^^^^^ | ||
| >function(name) { fn2 = compose(this, 0, 1) return fn2(name) function compose(child, level, find) { if (child === find) { return level } return compose(child, level + 1, find) }} : (name: any) => any | ||
| > : | ||
| >name : any | ||
|
|
||
| fn2 = compose(this, 0, 1) | ||
| >fn2 = compose(this, 0, 1) : any | ||
| >fn2 : (name: any) => any | ||
| > : ^ ^^^^^^^^^^^^^ | ||
| >compose(this, 0, 1) : any | ||
| >compose : (child: any, level: any, find: any) => any | ||
| > : ^ ^^^^^^^ ^^^^^^^ ^^^^^^^^^^^^^ | ||
| >this : any | ||
| >0 : 0 | ||
| > : ^ | ||
| >1 : 1 | ||
| > : ^ | ||
|
|
||
| return fn2(name) | ||
| >fn2(name) : any | ||
| >fn2 : (name: any) => any | ||
| > : ^ ^^^^^^^^^^^^^ | ||
| >name : any | ||
|
|
||
| function compose(child, level, find) { | ||
| >compose : (child: any, level: any, find: any) => any | ||
| > : ^ ^^^^^^^ ^^^^^^^ ^^^^^^^^^^^^^ | ||
| >child : any | ||
| >level : any | ||
| >find : any | ||
|
|
||
| if (child === find) { | ||
| >child === find : boolean | ||
| > : ^^^^^^^ | ||
| >child : any | ||
| >find : any | ||
|
|
||
| return level | ||
| >level : any | ||
| } | ||
| return compose(child, level + 1, find) | ||
| >compose(child, level + 1, find) : any | ||
| >compose : (child: any, level: any, find: any) => any | ||
| > : ^ ^^^^^^^ ^^^^^^^ ^^^^^^^^^^^^^ | ||
| >child : any | ||
| >level + 1 : any | ||
| >level : any | ||
| >1 : 1 | ||
| > : ^ | ||
| >find : any | ||
| } | ||
| } | ||
|
|
||
| var d = fn2(1); // d: any | ||
| >d : any | ||
| >fn2(1) : any | ||
| >fn2 : (name: any) => any | ||
| > : ^ ^^^^^^^^^^^^^ | ||
| >1 : 1 | ||
| > : ^ | ||
|
|
||
| d.redefined(); | ||
| >d.redefined() : any | ||
| >d.redefined : any | ||
| >d : any | ||
| > : ^^^ | ||
| >redefined : any | ||
| > : ^^^ | ||
|
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,11 @@ | ||
| // @strict: true | ||
| // @noImplicitAny: true | ||
| // @lib: esnext | ||
| // @noEmit: true | ||
|
|
||
| const fn1 = () => { | ||
| if (Math.random() > 0.5) { | ||
| return fn1() | ||
| } | ||
| return 0 | ||
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,18 @@ | ||
| // @checkJs: true | ||
| // @noEmit: true | ||
| // @strict: false | ||
|
|
||
| var fn2 = function(name) { | ||
| fn2 = compose(this, 0, 1) | ||
| return fn2(name) | ||
|
|
||
| function compose(child, level, find) { | ||
| if (child === find) { | ||
| return level | ||
| } | ||
| return compose(child, level + 1, find) | ||
| } | ||
| } | ||
|
|
||
| var d = fn2(1); // d: any | ||
| d.redefined(); |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
If an identifier resolved to a function expression symbol, that function had a name, and that name cannot be reassigned, so it’s effectively constant.
https://www.typescriptlang.org/play?#code/G4QwTgBCELwQZgVwHYGMAuBLA9shAKASggG8AoCSiAemogAF0BnAWgFMAPABzY3bDDYwFKvFgQUAEzbxMyNpIDcIyqlxNsAGzYA6TdgDm+eDuQgAtm0LKAvmRBFFQA