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
88 lines
1.3 KiB
Plaintext
88 lines
1.3 KiB
Plaintext
=== tests/cases/compiler/typeMatch1.ts ===
|
|
interface I { z; }
|
|
>I : I
|
|
>z : any
|
|
|
|
interface I2 { z; }
|
|
>I2 : I2
|
|
>z : any
|
|
|
|
var x1: { z: number; f(n: number): string; f(s: string): number; }
|
|
>x1 : { z: number; f(n: number): string; f(s: string): number; }
|
|
>z : number
|
|
>f : { (n: number): string; (s: string): number; }
|
|
>n : number
|
|
>f : { (n: number): string; (s: string): number; }
|
|
>s : string
|
|
|
|
var x2: { z:number;f:{(n:number):string;(s:string):number;}; } = x1;
|
|
>x2 : { z: number; f: { (n: number): string; (s: string): number; }; }
|
|
>z : number
|
|
>f : { (n: number): string; (s: string): number; }
|
|
>n : number
|
|
>s : string
|
|
>x1 : { z: number; f(n: number): string; f(s: string): number; }
|
|
|
|
var i:I;
|
|
>i : I
|
|
>I : I
|
|
|
|
var i2:I2;
|
|
>i2 : I2
|
|
>I2 : I2
|
|
|
|
var x3:{ z; }= i;
|
|
>x3 : { z: any; }
|
|
>z : any
|
|
>i : I
|
|
|
|
var x4:{ z; }= i2;
|
|
>x4 : { z: any; }
|
|
>z : any
|
|
>i2 : I2
|
|
|
|
var x5:I=i2;
|
|
>x5 : I
|
|
>I : I
|
|
>i2 : I2
|
|
|
|
class C { private x; }
|
|
>C : C
|
|
>x : any
|
|
|
|
class D { private x; }
|
|
>D : D
|
|
>x : any
|
|
|
|
var x6=new C();
|
|
>x6 : C
|
|
>new C() : C
|
|
>C : typeof C
|
|
|
|
var x7=new D();
|
|
>x7 : D
|
|
>new D() : D
|
|
>D : typeof D
|
|
|
|
x6 = x7;
|
|
>x6 = x7 : D
|
|
>x6 : C
|
|
>x7 : D
|
|
|
|
x6=C;
|
|
>x6=C : typeof C
|
|
>x6 : C
|
|
>C : typeof C
|
|
|
|
C==D;
|
|
>C==D : boolean
|
|
>C : typeof C
|
|
>D : typeof D
|
|
|
|
C==C;
|
|
>C==C : boolean
|
|
>C : typeof C
|
|
>C : typeof C
|
|
|
|
|