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
66 lines
1.7 KiB
Plaintext
66 lines
1.7 KiB
Plaintext
=== tests/cases/compiler/unknownSymbols1.ts ===
|
|
var x = asdf;
|
|
>x : Symbol(x, Decl(unknownSymbols1.ts, 0, 3))
|
|
|
|
var y: asdf;
|
|
>y : Symbol(y, Decl(unknownSymbols1.ts, 1, 3))
|
|
|
|
function foo(x: asdf, y: number): asdf { }
|
|
>foo : Symbol(foo, Decl(unknownSymbols1.ts, 1, 12))
|
|
>x : Symbol(x, Decl(unknownSymbols1.ts, 3, 13))
|
|
>y : Symbol(y, Decl(unknownSymbols1.ts, 3, 21))
|
|
|
|
function foo2() {
|
|
>foo2 : Symbol(foo2, Decl(unknownSymbols1.ts, 3, 42))
|
|
|
|
return asdf;
|
|
}
|
|
|
|
var z = <asdf>x; // should be an error
|
|
>z : Symbol(z, Decl(unknownSymbols1.ts, 8, 3))
|
|
>x : Symbol(x, Decl(unknownSymbols1.ts, 0, 3))
|
|
|
|
class C<T> {
|
|
>C : Symbol(C, Decl(unknownSymbols1.ts, 8, 16))
|
|
>T : Symbol(T, Decl(unknownSymbols1.ts, 10, 8))
|
|
|
|
foo: asdf;
|
|
>foo : Symbol(C.foo, Decl(unknownSymbols1.ts, 10, 12))
|
|
|
|
bar: C<asdf>;
|
|
>bar : Symbol(C.bar, Decl(unknownSymbols1.ts, 11, 14))
|
|
>C : Symbol(C, Decl(unknownSymbols1.ts, 8, 16))
|
|
}
|
|
|
|
class C2 implements asdf { }
|
|
>C2 : Symbol(C2, Decl(unknownSymbols1.ts, 13, 1))
|
|
|
|
interface I extends adsf { }
|
|
>I : Symbol(I, Decl(unknownSymbols1.ts, 15, 28))
|
|
|
|
class C3 { constructor(x: any) { } }
|
|
>C3 : Symbol(C3, Decl(unknownSymbols1.ts, 16, 28))
|
|
>x : Symbol(x, Decl(unknownSymbols1.ts, 18, 23))
|
|
|
|
class C4 extends C3 {
|
|
>C4 : Symbol(C4, Decl(unknownSymbols1.ts, 18, 36))
|
|
>C3 : Symbol(C3, Decl(unknownSymbols1.ts, 16, 28))
|
|
|
|
constructor() {
|
|
super(asdf);
|
|
>super : Symbol(C3, Decl(unknownSymbols1.ts, 16, 28))
|
|
}
|
|
}
|
|
|
|
var x2 = this.asdf; // no error, this is any
|
|
>x2 : Symbol(x2, Decl(unknownSymbols1.ts, 25, 3))
|
|
|
|
class C5 {
|
|
>C5 : Symbol(C5, Decl(unknownSymbols1.ts, 25, 19))
|
|
|
|
constructor() {
|
|
this.asdf = asdf;
|
|
>this : Symbol(C5, Decl(unknownSymbols1.ts, 25, 19))
|
|
}
|
|
}
|