* 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
97 lines
1.2 KiB
Plaintext
97 lines
1.2 KiB
Plaintext
=== tests/cases/conformance/types/primitives/void/invalidVoidAssignments.ts ===
|
|
var x: void;
|
|
>x : void
|
|
|
|
var a: boolean = x;
|
|
>a : boolean
|
|
>x : void
|
|
|
|
var b: string = x;
|
|
>b : string
|
|
>x : void
|
|
|
|
var c: number = x;
|
|
>c : number
|
|
>x : void
|
|
|
|
var d: typeof undefined = x;
|
|
>d : any
|
|
>undefined : undefined
|
|
>x : void
|
|
|
|
class C { foo: string; }
|
|
>C : C
|
|
>foo : string
|
|
|
|
var e: C = x;
|
|
>e : C
|
|
>C : C
|
|
>x : void
|
|
|
|
interface I { bar: string; }
|
|
>I : I
|
|
>bar : string
|
|
|
|
var f: I = x;
|
|
>f : I
|
|
>I : I
|
|
>x : void
|
|
|
|
var g: { baz: string } = 1;
|
|
>g : { baz: string; }
|
|
>baz : string
|
|
>1 : 1
|
|
|
|
var g2: { 0: number } = 1;
|
|
>g2 : { 0: number; }
|
|
>1 : 1
|
|
|
|
module M { export var x = 1; }
|
|
>M : typeof M
|
|
>x : number
|
|
>1 : 1
|
|
|
|
M = x;
|
|
>M = x : void
|
|
>M : any
|
|
>x : void
|
|
|
|
function i<T>(a: T) {
|
|
>i : <T>(a: T) => void
|
|
>T : T
|
|
>a : T
|
|
>T : T
|
|
|
|
a = x;
|
|
>a = x : void
|
|
>a : T
|
|
>x : void
|
|
}
|
|
i = x;
|
|
>i = x : void
|
|
>i : any
|
|
>x : void
|
|
|
|
enum E { A }
|
|
>E : E
|
|
>A : E
|
|
|
|
x = E;
|
|
>x = E : typeof E
|
|
>x : void
|
|
>E : typeof E
|
|
|
|
x = E.A;
|
|
>x = E.A : E
|
|
>x : void
|
|
>E.A : E
|
|
>E : typeof E
|
|
>A : E
|
|
|
|
x = { f() { } }
|
|
>x = { f() { } } : { f(): void; }
|
|
>x : void
|
|
>{ f() { } } : { f(): void; }
|
|
>f : () => void
|
|
|