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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
|
=== tests/cases/compiler/simpleRecursionWithBaseCase.ts ===
function fn1(n: number) {
>fn1 : (n: number) => number
>n : number
if (n === 0) {
>n === 0 : boolean
>n : number
>0 : 0
return 3;
>3 : 3
} else {
return fn1(n - 1);
>fn1(n - 1) : number
>fn1 : (n: number) => number
>n - 1 : number
>n : number
>1 : 1
}
}
const num: number = fn1();
>num : number
>fn1() : number
>fn1 : (n: number) => number
function fn2(n: number) {
>fn2 : (n: number) => never
>n : number
return fn2(n);
>fn2(n) : never
>fn2 : (n: number) => never
>n : number
}
const nev: never = fn2();
>nev : never
>fn2() : never
>fn2 : (n: number) => never
function fn3(n: number) {
>fn3 : (n: number) => number
>n : number
if (n === 0) {
>n === 0 : boolean
>n : number
>0 : 0
return 3;
>3 : 3
} else {
return fn1("hello world");
>fn1("hello world") : number
>fn1 : (n: number) => number
>"hello world" : "hello world"
}
}
function fn4(n: number) {
>fn4 : (n: number) => any
>n : number
if (n === 0) {
>n === 0 : boolean
>n : number
>0 : 0
return 3;
>3 : 3
} else {
return notfoundsymbol("hello world");
>notfoundsymbol("hello world") : any
>notfoundsymbol : any
>"hello world" : "hello world"
}
}
function fn5() {
>fn5 : () => any
return [fn5][0]();
>[fn5][0]() : any
>[fn5][0] : () => any
>[fn5] : (() => any)[]
>fn5 : () => any
>0 : 0
}
|
