5353475fce
* Always generate type & symbol baselines * Accept changed shadowed baselines * Accept brand new type and symbol baselines * Allow `getTypeAtLocation` to return undefined in the type writer * Accept baselines which had missing type information * Bind container for dynamically names enum members so they may be printed * Accept type/symbol baselines for enums with computed members * First pass at reducing typeWriter memory overhead * Use generators to allow for type and symbol baselines with no cache * Accept new baselines for tests whose output was fixed by better newline splitting * Hard cap on number of declarations printed, cache declaration print text * handle differing newlines better still to handle RWC newlines * Lower abridging count, accept abridged baselines * Limit max RWC error output size, limit RWC type and symbol baseline input size * Move skip logic into type and symbol baseliner to streamline error handling * Accept removal of empty baselines * Canonicalize path earlier to handle odd paths in input files * Do canonicalization earlier still, also ensure parallel perf profiles for different targets do not trample one another * No need to pathify again
170 lines
2.1 KiB
Plaintext
170 lines
2.1 KiB
Plaintext
=== tests/cases/compiler/cf.ts ===
|
|
function f() {
|
|
>f : () => void
|
|
|
|
var z;
|
|
>z : any
|
|
|
|
var x=10;
|
|
>x : number
|
|
>10 : 10
|
|
|
|
var y=3;
|
|
>y : number
|
|
>3 : 3
|
|
|
|
L1: for (var i=0;i<19;i++) {
|
|
>L1 : any
|
|
>i : number
|
|
>0 : 0
|
|
>i<19 : boolean
|
|
>i : number
|
|
>19 : 19
|
|
>i++ : number
|
|
>i : number
|
|
|
|
if (y==7) {
|
|
>y==7 : boolean
|
|
>y : number
|
|
>7 : 7
|
|
|
|
continue L1;
|
|
>L1 : any
|
|
|
|
x=11;
|
|
>x=11 : 11
|
|
>x : number
|
|
>11 : 11
|
|
}
|
|
if (y==3) {
|
|
>y==3 : boolean
|
|
>y : number
|
|
>3 : 3
|
|
|
|
y++;
|
|
>y++ : number
|
|
>y : number
|
|
}
|
|
else {
|
|
y--;
|
|
>y-- : number
|
|
>y : number
|
|
}
|
|
do {
|
|
y+=2;
|
|
>y+=2 : number
|
|
>y : number
|
|
>2 : 2
|
|
|
|
if (y==20) {
|
|
>y==20 : boolean
|
|
>y : number
|
|
>20 : 20
|
|
|
|
break;
|
|
x=12;
|
|
>x=12 : 12
|
|
>x : number
|
|
>12 : 12
|
|
}
|
|
} while (y<41);
|
|
>y<41 : boolean
|
|
>y : number
|
|
>41 : 41
|
|
|
|
y++;
|
|
>y++ : number
|
|
>y : number
|
|
}
|
|
while (y>2) {
|
|
>y>2 : boolean
|
|
>y : number
|
|
>2 : 2
|
|
|
|
y=y>>1;
|
|
>y=y>>1 : number
|
|
>y : number
|
|
>y>>1 : number
|
|
>y : number
|
|
>1 : 1
|
|
}
|
|
L2: try {
|
|
>L2 : any
|
|
|
|
L3: if (x<y) {
|
|
>L3 : any
|
|
>x<y : boolean
|
|
>x : number
|
|
>y : number
|
|
|
|
break L2;
|
|
>L2 : any
|
|
|
|
x=13;
|
|
>x=13 : 13
|
|
>x : number
|
|
>13 : 13
|
|
}
|
|
else {
|
|
break L3;
|
|
>L3 : any
|
|
|
|
x=14;
|
|
>x=14 : 14
|
|
>x : number
|
|
>14 : 14
|
|
}
|
|
}
|
|
catch (e) {
|
|
>e : any
|
|
|
|
x++;
|
|
>x++ : number
|
|
>x : number
|
|
}
|
|
finally {
|
|
x+=3;
|
|
>x+=3 : number
|
|
>x : number
|
|
>3 : 3
|
|
}
|
|
y++;
|
|
>y++ : number
|
|
>y : number
|
|
|
|
for (var k=0;k<10;k++) {
|
|
>k : number
|
|
>0 : 0
|
|
>k<10 : boolean
|
|
>k : number
|
|
>10 : 10
|
|
>k++ : number
|
|
>k : number
|
|
|
|
z;
|
|
>z : any
|
|
|
|
break;
|
|
}
|
|
for (k=0;k<10;k++) {
|
|
>k=0 : 0
|
|
>k : number
|
|
>0 : 0
|
|
>k<10 : boolean
|
|
>k : number
|
|
>10 : 10
|
|
>k++ : number
|
|
>k : number
|
|
|
|
if (k==6) {
|
|
>k==6 : boolean
|
|
>k : number
|
|
>6 : 6
|
|
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
|