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
80 lines
2.5 KiB
Plaintext
80 lines
2.5 KiB
Plaintext
=== tests/cases/compiler/generics2.ts ===
|
|
interface A { a: string; }
|
|
>A : Symbol(A, Decl(generics2.ts, 0, 0))
|
|
>a : Symbol(A.a, Decl(generics2.ts, 0, 13))
|
|
|
|
interface B extends A { b: string; }
|
|
>B : Symbol(B, Decl(generics2.ts, 0, 26))
|
|
>A : Symbol(A, Decl(generics2.ts, 0, 0))
|
|
>b : Symbol(B.b, Decl(generics2.ts, 1, 23))
|
|
|
|
interface C extends B { c: string; }
|
|
>C : Symbol(C, Decl(generics2.ts, 1, 36))
|
|
>B : Symbol(B, Decl(generics2.ts, 0, 26))
|
|
>c : Symbol(C.c, Decl(generics2.ts, 2, 23))
|
|
|
|
interface G<T, U extends B> {
|
|
>G : Symbol(G, Decl(generics2.ts, 2, 36))
|
|
>T : Symbol(T, Decl(generics2.ts, 3, 12))
|
|
>U : Symbol(U, Decl(generics2.ts, 3, 14))
|
|
>B : Symbol(B, Decl(generics2.ts, 0, 26))
|
|
|
|
x: T;
|
|
>x : Symbol(G.x, Decl(generics2.ts, 3, 29))
|
|
>T : Symbol(T, Decl(generics2.ts, 3, 12))
|
|
|
|
y: U;
|
|
>y : Symbol(G.y, Decl(generics2.ts, 4, 9))
|
|
>U : Symbol(U, Decl(generics2.ts, 3, 14))
|
|
}
|
|
|
|
|
|
var v1: {
|
|
>v1 : Symbol(v1, Decl(generics2.ts, 9, 3))
|
|
|
|
x: { a: string; }
|
|
>x : Symbol(x, Decl(generics2.ts, 9, 9))
|
|
>a : Symbol(a, Decl(generics2.ts, 10, 8))
|
|
|
|
y: { a: string; b: string; c: string };
|
|
>y : Symbol(y, Decl(generics2.ts, 10, 21))
|
|
>a : Symbol(a, Decl(generics2.ts, 11, 8))
|
|
>b : Symbol(b, Decl(generics2.ts, 11, 19))
|
|
>c : Symbol(c, Decl(generics2.ts, 11, 30))
|
|
|
|
}; // Ok
|
|
|
|
|
|
var v2: G<{ a: string }, C>; // Ok, equivalent to G<A, C>
|
|
>v2 : Symbol(v2, Decl(generics2.ts, 15, 3))
|
|
>G : Symbol(G, Decl(generics2.ts, 2, 36))
|
|
>a : Symbol(a, Decl(generics2.ts, 15, 11))
|
|
>C : Symbol(C, Decl(generics2.ts, 1, 36))
|
|
|
|
var v3: G<A, A>; // Error, A not valid argument for U
|
|
>v3 : Symbol(v3, Decl(generics2.ts, 16, 3))
|
|
>G : Symbol(G, Decl(generics2.ts, 2, 36))
|
|
>A : Symbol(A, Decl(generics2.ts, 0, 0))
|
|
>A : Symbol(A, Decl(generics2.ts, 0, 0))
|
|
|
|
var v4: G<G<A, B>, C>; // Ok
|
|
>v4 : Symbol(v4, Decl(generics2.ts, 17, 3))
|
|
>G : Symbol(G, Decl(generics2.ts, 2, 36))
|
|
>G : Symbol(G, Decl(generics2.ts, 2, 36))
|
|
>A : Symbol(A, Decl(generics2.ts, 0, 0))
|
|
>B : Symbol(B, Decl(generics2.ts, 0, 26))
|
|
>C : Symbol(C, Decl(generics2.ts, 1, 36))
|
|
|
|
var v5: G<any, any>; // Error, any does not satisfy constraint B
|
|
>v5 : Symbol(v5, Decl(generics2.ts, 18, 3))
|
|
>G : Symbol(G, Decl(generics2.ts, 2, 36))
|
|
|
|
var v6: G<any>; // Error, wrong number of arguments
|
|
>v6 : Symbol(v6, Decl(generics2.ts, 19, 3))
|
|
>G : Symbol(G, Decl(generics2.ts, 2, 36))
|
|
|
|
var v7: G; // Error, no type arguments
|
|
>v7 : Symbol(v7, Decl(generics2.ts, 20, 3))
|
|
>G : Symbol(G, Decl(generics2.ts, 2, 36))
|
|
|