* 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
27 lines
724 B
Plaintext
27 lines
724 B
Plaintext
=== tests/cases/compiler/restUnion3.ts ===
|
|
declare const nullAndUndefinedUnion: null | undefined;
|
|
>nullAndUndefinedUnion : null | undefined
|
|
>null : null
|
|
|
|
var rest4: { };
|
|
>rest4 : {}
|
|
|
|
var {...rest4 } = nullAndUndefinedUnion;
|
|
>rest4 : {}
|
|
>nullAndUndefinedUnion : null | undefined
|
|
|
|
declare const unionWithIntersection: ({ n: number } & { s: string }) & undefined;
|
|
>unionWithIntersection : { n: number; } & { s: string; } & undefined
|
|
>n : number
|
|
>s : string
|
|
|
|
var rest5: { n: number, s: string };
|
|
>rest5 : { n: number; s: string; }
|
|
>n : number
|
|
>s : string
|
|
|
|
var {...rest5 } = unionWithIntersection;
|
|
>rest5 : { n: number; s: string; }
|
|
>unionWithIntersection : { n: number; } & { s: string; } & undefined
|
|
|