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
82 lines
2.5 KiB
Plaintext
82 lines
2.5 KiB
Plaintext
=== tests/cases/compiler/typeMatch1.ts ===
|
|
interface I { z; }
|
|
>I : Symbol(I, Decl(typeMatch1.ts, 0, 0))
|
|
>z : Symbol(I.z, Decl(typeMatch1.ts, 0, 13))
|
|
|
|
interface I2 { z; }
|
|
>I2 : Symbol(I2, Decl(typeMatch1.ts, 0, 18))
|
|
>z : Symbol(I2.z, Decl(typeMatch1.ts, 1, 14))
|
|
|
|
var x1: { z: number; f(n: number): string; f(s: string): number; }
|
|
>x1 : Symbol(x1, Decl(typeMatch1.ts, 3, 3))
|
|
>z : Symbol(z, Decl(typeMatch1.ts, 3, 9))
|
|
>f : Symbol(f, Decl(typeMatch1.ts, 3, 20), Decl(typeMatch1.ts, 3, 42))
|
|
>n : Symbol(n, Decl(typeMatch1.ts, 3, 23))
|
|
>f : Symbol(f, Decl(typeMatch1.ts, 3, 20), Decl(typeMatch1.ts, 3, 42))
|
|
>s : Symbol(s, Decl(typeMatch1.ts, 3, 45))
|
|
|
|
var x2: { z:number;f:{(n:number):string;(s:string):number;}; } = x1;
|
|
>x2 : Symbol(x2, Decl(typeMatch1.ts, 4, 3))
|
|
>z : Symbol(z, Decl(typeMatch1.ts, 4, 9))
|
|
>f : Symbol(f, Decl(typeMatch1.ts, 4, 19))
|
|
>n : Symbol(n, Decl(typeMatch1.ts, 4, 23))
|
|
>s : Symbol(s, Decl(typeMatch1.ts, 4, 41))
|
|
>x1 : Symbol(x1, Decl(typeMatch1.ts, 3, 3))
|
|
|
|
var i:I;
|
|
>i : Symbol(i, Decl(typeMatch1.ts, 5, 3))
|
|
>I : Symbol(I, Decl(typeMatch1.ts, 0, 0))
|
|
|
|
var i2:I2;
|
|
>i2 : Symbol(i2, Decl(typeMatch1.ts, 6, 3))
|
|
>I2 : Symbol(I2, Decl(typeMatch1.ts, 0, 18))
|
|
|
|
var x3:{ z; }= i;
|
|
>x3 : Symbol(x3, Decl(typeMatch1.ts, 7, 3))
|
|
>z : Symbol(z, Decl(typeMatch1.ts, 7, 8))
|
|
>i : Symbol(i, Decl(typeMatch1.ts, 5, 3))
|
|
|
|
var x4:{ z; }= i2;
|
|
>x4 : Symbol(x4, Decl(typeMatch1.ts, 8, 3))
|
|
>z : Symbol(z, Decl(typeMatch1.ts, 8, 8))
|
|
>i2 : Symbol(i2, Decl(typeMatch1.ts, 6, 3))
|
|
|
|
var x5:I=i2;
|
|
>x5 : Symbol(x5, Decl(typeMatch1.ts, 9, 3))
|
|
>I : Symbol(I, Decl(typeMatch1.ts, 0, 0))
|
|
>i2 : Symbol(i2, Decl(typeMatch1.ts, 6, 3))
|
|
|
|
class C { private x; }
|
|
>C : Symbol(C, Decl(typeMatch1.ts, 9, 12))
|
|
>x : Symbol(C.x, Decl(typeMatch1.ts, 11, 9))
|
|
|
|
class D { private x; }
|
|
>D : Symbol(D, Decl(typeMatch1.ts, 11, 22))
|
|
>x : Symbol(D.x, Decl(typeMatch1.ts, 12, 9))
|
|
|
|
var x6=new C();
|
|
>x6 : Symbol(x6, Decl(typeMatch1.ts, 14, 3))
|
|
>C : Symbol(C, Decl(typeMatch1.ts, 9, 12))
|
|
|
|
var x7=new D();
|
|
>x7 : Symbol(x7, Decl(typeMatch1.ts, 15, 3))
|
|
>D : Symbol(D, Decl(typeMatch1.ts, 11, 22))
|
|
|
|
x6 = x7;
|
|
>x6 : Symbol(x6, Decl(typeMatch1.ts, 14, 3))
|
|
>x7 : Symbol(x7, Decl(typeMatch1.ts, 15, 3))
|
|
|
|
x6=C;
|
|
>x6 : Symbol(x6, Decl(typeMatch1.ts, 14, 3))
|
|
>C : Symbol(C, Decl(typeMatch1.ts, 9, 12))
|
|
|
|
C==D;
|
|
>C : Symbol(C, Decl(typeMatch1.ts, 9, 12))
|
|
>D : Symbol(D, Decl(typeMatch1.ts, 11, 22))
|
|
|
|
C==C;
|
|
>C : Symbol(C, Decl(typeMatch1.ts, 9, 12))
|
|
>C : Symbol(C, Decl(typeMatch1.ts, 9, 12))
|
|
|
|
|