* 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
17 lines
577 B
Plaintext
17 lines
577 B
Plaintext
=== tests/cases/compiler/widenToAny2.ts ===
|
|
function foo3<T>(x: T[]): T {
|
|
>foo3 : Symbol(foo3, Decl(widenToAny2.ts, 0, 0))
|
|
>T : Symbol(T, Decl(widenToAny2.ts, 0, 14))
|
|
>x : Symbol(x, Decl(widenToAny2.ts, 0, 17))
|
|
>T : Symbol(T, Decl(widenToAny2.ts, 0, 14))
|
|
>T : Symbol(T, Decl(widenToAny2.ts, 0, 14))
|
|
|
|
return undefined;
|
|
>undefined : Symbol(undefined)
|
|
}
|
|
var z3:number = foo3([undefined, "def"]); // Type is any, but should be string
|
|
>z3 : Symbol(z3, Decl(widenToAny2.ts, 3, 3))
|
|
>foo3 : Symbol(foo3, Decl(widenToAny2.ts, 0, 0))
|
|
>undefined : Symbol(undefined)
|
|
|