* 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
32 lines
382 B
Plaintext
32 lines
382 B
Plaintext
=== tests/cases/compiler/inOperator.ts ===
|
|
var a=[];
|
|
>a : any[]
|
|
>[] : undefined[]
|
|
|
|
for (var x in a) {}
|
|
>x : string
|
|
>a : any[]
|
|
|
|
if (3 in a) {}
|
|
>3 in a : boolean
|
|
>3 : 3
|
|
>a : any[]
|
|
|
|
var b = '' in 0;
|
|
>b : boolean
|
|
>'' in 0 : boolean
|
|
>'' : ""
|
|
>0 : 0
|
|
|
|
var c: any;
|
|
>c : any
|
|
|
|
var y: number;
|
|
>y : number
|
|
|
|
if (y in c) { }
|
|
>y in c : boolean
|
|
>y : number
|
|
>c : any
|
|
|