* 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
31 lines
415 B
Plaintext
31 lines
415 B
Plaintext
=== tests/cases/compiler/generics4.ts ===
|
|
class C<T> { private x: T; }
|
|
>C : C<T>
|
|
>T : T
|
|
>x : T
|
|
>T : T
|
|
|
|
interface X { f(): string; }
|
|
>X : X
|
|
>f : () => string
|
|
|
|
interface Y { f(): boolean; }
|
|
>Y : Y
|
|
>f : () => boolean
|
|
|
|
var a: C<X>;
|
|
>a : C<X>
|
|
>C : C<T>
|
|
>X : X
|
|
|
|
var b: C<Y>;
|
|
>b : C<Y>
|
|
>C : C<T>
|
|
>Y : Y
|
|
|
|
a = b; // Not ok - return types of "f" are different
|
|
>a = b : C<Y>
|
|
>a : C<X>
|
|
>b : C<Y>
|
|
|