mirror of
https://github.com/hanzoai/tsgo.git
synced 2026-10-30 19:37:15 +00:00
90 lines
3.0 KiB
Plaintext
90 lines
3.0 KiB
Plaintext
//// [tests/cases/conformance/types/primitives/void/invalidVoidAssignments.ts] ////
|
|
|
|
=== invalidVoidAssignments.ts ===
|
|
var x: void;
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 0, 3))
|
|
|
|
var a: boolean = x;
|
|
>a : Symbol(a, Decl(invalidVoidAssignments.ts, 2, 3))
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 0, 3))
|
|
|
|
var b: string = x;
|
|
>b : Symbol(b, Decl(invalidVoidAssignments.ts, 3, 3))
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 0, 3))
|
|
|
|
var c: number = x;
|
|
>c : Symbol(c, Decl(invalidVoidAssignments.ts, 4, 3))
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 0, 3))
|
|
|
|
var d: typeof undefined = x;
|
|
>d : Symbol(d, Decl(invalidVoidAssignments.ts, 5, 3))
|
|
>undefined : Symbol(undefined)
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 0, 3))
|
|
|
|
class C { foo: string; }
|
|
>C : Symbol(C, Decl(invalidVoidAssignments.ts, 5, 28))
|
|
>foo : Symbol(C.foo, Decl(invalidVoidAssignments.ts, 7, 9))
|
|
|
|
var e: C = x;
|
|
>e : Symbol(e, Decl(invalidVoidAssignments.ts, 8, 3))
|
|
>C : Symbol(C, Decl(invalidVoidAssignments.ts, 5, 28))
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 0, 3))
|
|
|
|
interface I { bar: string; }
|
|
>I : Symbol(I, Decl(invalidVoidAssignments.ts, 8, 13))
|
|
>bar : Symbol(I.bar, Decl(invalidVoidAssignments.ts, 10, 13))
|
|
|
|
var f: I = x;
|
|
>f : Symbol(f, Decl(invalidVoidAssignments.ts, 11, 3))
|
|
>I : Symbol(I, Decl(invalidVoidAssignments.ts, 8, 13))
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 0, 3))
|
|
|
|
var g: { baz: string } = 1;
|
|
>g : Symbol(g, Decl(invalidVoidAssignments.ts, 13, 3))
|
|
>baz : Symbol(baz, Decl(invalidVoidAssignments.ts, 13, 8))
|
|
|
|
var g2: { 0: number } = 1;
|
|
>g2 : Symbol(g2, Decl(invalidVoidAssignments.ts, 14, 3))
|
|
>0 : Symbol(0, Decl(invalidVoidAssignments.ts, 14, 9))
|
|
|
|
namespace M { export var x = 1; }
|
|
>M : Symbol(M, Decl(invalidVoidAssignments.ts, 14, 26))
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 16, 24))
|
|
|
|
M = x;
|
|
>M : Symbol(M, Decl(invalidVoidAssignments.ts, 14, 26))
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 0, 3))
|
|
|
|
function i<T>(a: T) {
|
|
>i : Symbol(i, Decl(invalidVoidAssignments.ts, 17, 6))
|
|
>T : Symbol(T, Decl(invalidVoidAssignments.ts, 19, 11))
|
|
>a : Symbol(a, Decl(invalidVoidAssignments.ts, 19, 14))
|
|
>T : Symbol(T, Decl(invalidVoidAssignments.ts, 19, 11))
|
|
|
|
a = x;
|
|
>a : Symbol(a, Decl(invalidVoidAssignments.ts, 19, 14))
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 0, 3))
|
|
}
|
|
i = x;
|
|
>i : Symbol(i, Decl(invalidVoidAssignments.ts, 17, 6))
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 0, 3))
|
|
|
|
enum E { A }
|
|
>E : Symbol(E, Decl(invalidVoidAssignments.ts, 22, 6))
|
|
>A : Symbol(E.A, Decl(invalidVoidAssignments.ts, 24, 8))
|
|
|
|
x = E;
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 0, 3))
|
|
>E : Symbol(E, Decl(invalidVoidAssignments.ts, 22, 6))
|
|
|
|
x = E.A;
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 0, 3))
|
|
>E.A : Symbol(E.A, Decl(invalidVoidAssignments.ts, 24, 8))
|
|
>E : Symbol(E, Decl(invalidVoidAssignments.ts, 22, 6))
|
|
>A : Symbol(E.A, Decl(invalidVoidAssignments.ts, 24, 8))
|
|
|
|
x = { f() { } }
|
|
>x : Symbol(x, Decl(invalidVoidAssignments.ts, 0, 3))
|
|
>f : Symbol(f, Decl(invalidVoidAssignments.ts, 28, 5))
|
|
|