* 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
37 lines
487 B
Text
37 lines
487 B
Text
=== tests/cases/compiler/genericGetter3.ts ===
|
|
class A<T> { }
|
|
>A : A<T>
|
|
>T : T
|
|
|
|
class C<T> {
|
|
>C : C<T>
|
|
>T : T
|
|
|
|
data: A<T>;
|
|
>data : A<T>
|
|
>A : A<T>
|
|
>T : T
|
|
|
|
get x(): A<T> {
|
|
>x : A<T>
|
|
>A : A<T>
|
|
>T : T
|
|
|
|
return this.data;
|
|
>this.data : A<T>
|
|
>this : this
|
|
>data : A<T>
|
|
}
|
|
}
|
|
|
|
var c = new C<number>();
|
|
>c : C<number>
|
|
>new C<number>() : C<number>
|
|
>C : typeof C
|
|
|
|
var r: string = c.x;
|
|
>r : string
|
|
>c.x : A<number>
|
|
>c : C<number>
|
|
>x : A<number>
|
|
|