5353475fce
* 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
535 B
Text
31 lines
535 B
Text
=== tests/cases/compiler/numberToString.ts ===
|
|
function f1(n:number):string {
|
|
>f1 : (n: number) => string
|
|
>n : number
|
|
|
|
return n; // error return type mismatch
|
|
>n : number
|
|
}
|
|
|
|
function f2(s:string):void {
|
|
>f2 : (s: string) => void
|
|
>s : string
|
|
}
|
|
|
|
f1(3);
|
|
>f1(3) : string
|
|
>f1 : (n: number) => string
|
|
>3 : 3
|
|
|
|
f2(3); // error no coercion to string
|
|
>f2(3) : void
|
|
>f2 : (s: string) => void
|
|
>3 : 3
|
|
|
|
f2(3+""); // ok + operator promotes
|
|
>f2(3+"") : void
|
|
>f2 : (s: string) => void
|
|
>3+"" : string
|
|
>3 : 3
|
|
>"" : ""
|
|
|