1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
=== tests/cases/compiler/simpleRecursionWithBaseCase.ts ===
function fn1(n: number) {
>fn1 : Symbol(fn1, Decl(simpleRecursionWithBaseCase.ts, 0, 0))
>n : Symbol(n, Decl(simpleRecursionWithBaseCase.ts, 0, 13))
if (n === 0) {
>n : Symbol(n, Decl(simpleRecursionWithBaseCase.ts, 0, 13))
return 3;
} else {
return fn1(n - 1);
>fn1 : Symbol(fn1, Decl(simpleRecursionWithBaseCase.ts, 0, 0))
>n : Symbol(n, Decl(simpleRecursionWithBaseCase.ts, 0, 13))
}
}
const num: number = fn1();
>num : Symbol(num, Decl(simpleRecursionWithBaseCase.ts, 7, 5))
>fn1 : Symbol(fn1, Decl(simpleRecursionWithBaseCase.ts, 0, 0))
function fn2(n: number) {
>fn2 : Symbol(fn2, Decl(simpleRecursionWithBaseCase.ts, 7, 26))
>n : Symbol(n, Decl(simpleRecursionWithBaseCase.ts, 9, 13))
return fn2(n);
>fn2 : Symbol(fn2, Decl(simpleRecursionWithBaseCase.ts, 7, 26))
>n : Symbol(n, Decl(simpleRecursionWithBaseCase.ts, 9, 13))
}
const nev: never = fn2();
>nev : Symbol(nev, Decl(simpleRecursionWithBaseCase.ts, 12, 5))
>fn2 : Symbol(fn2, Decl(simpleRecursionWithBaseCase.ts, 7, 26))
function fn3(n: number) {
>fn3 : Symbol(fn3, Decl(simpleRecursionWithBaseCase.ts, 12, 25))
>n : Symbol(n, Decl(simpleRecursionWithBaseCase.ts, 14, 13))
if (n === 0) {
>n : Symbol(n, Decl(simpleRecursionWithBaseCase.ts, 14, 13))
return 3;
} else {
return fn1("hello world");
>fn1 : Symbol(fn1, Decl(simpleRecursionWithBaseCase.ts, 0, 0))
}
}
function fn4(n: number) {
>fn4 : Symbol(fn4, Decl(simpleRecursionWithBaseCase.ts, 20, 1))
>n : Symbol(n, Decl(simpleRecursionWithBaseCase.ts, 22, 13))
if (n === 0) {
>n : Symbol(n, Decl(simpleRecursionWithBaseCase.ts, 22, 13))
return 3;
} else {
return notfoundsymbol("hello world");
}
}
function fn5() {
>fn5 : Symbol(fn5, Decl(simpleRecursionWithBaseCase.ts, 28, 1))
return [fn5][0]();
>fn5 : Symbol(fn5, Decl(simpleRecursionWithBaseCase.ts, 28, 1))
}
|
