* 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
25 lines
558 B
Plaintext
25 lines
558 B
Plaintext
=== tests/cases/compiler/widenToAny1.ts ===
|
|
function foo1<T>(f1: { x: T; y: T }): T {
|
|
>foo1 : <T>(f1: { x: T; y: T; }) => T
|
|
>T : T
|
|
>f1 : { x: T; y: T; }
|
|
>x : T
|
|
>T : T
|
|
>y : T
|
|
>T : T
|
|
>T : T
|
|
|
|
return undefined;
|
|
>undefined : undefined
|
|
}
|
|
var z1: number = foo1({ x: undefined, y: "def" }); // Best common type is any
|
|
>z1 : number
|
|
>foo1({ x: undefined, y: "def" }) : string
|
|
>foo1 : <T>(f1: { x: T; y: T; }) => T
|
|
>{ x: undefined, y: "def" } : { x: undefined; y: string; }
|
|
>x : undefined
|
|
>undefined : undefined
|
|
>y : string
|
|
>"def" : "def"
|
|
|