TypeScript/tests/baselines/reference/lift.types
Wesley Wigham 5353475fce Always collect type and symbol baselines (#18621)
* 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
2017-09-22 15:52:04 -07:00

64 lines
960 B
Plaintext

=== tests/cases/compiler/lift.ts ===
class B {
>B : B
constructor(public y:number) {
>y : number
}
public ll:number; // to be shadowed
>ll : number
}
class C extends B {
>C : C
>B : B
constructor(y:number,z:number,w:number) {
>y : number
>z : number
>w : number
super(y)
>super(y) : void
>super : typeof B
>y : number
var x=10+w;
>x : number
>10+w : number
>10 : 10
>w : number
var ll=x*w;
>ll : number
>x*w : number
>x : number
>w : number
}
public liftxyz () { return x+z+this.y; }
>liftxyz : () => any
>x+z+this.y : any
>x+z : any
>x : any
>z : any
>this.y : number
>this : this
>y : number
public liftxylocllz () { return x+z+this.y+this.ll; }
>liftxylocllz : () => any
>x+z+this.y+this.ll : any
>x+z+this.y : any
>x+z : any
>x : any
>z : any
>this.y : number
>this : this
>y : number
>this.ll : number
>this : this
>ll : number
}