* 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
15 lines
493 B
Plaintext
15 lines
493 B
Plaintext
=== tests/cases/conformance/decorators/invalid/decoratorOnEnum.ts ===
|
|
declare function dec<T>(target: T): T;
|
|
>dec : Symbol(dec, Decl(decoratorOnEnum.ts, 0, 0))
|
|
>T : Symbol(T, Decl(decoratorOnEnum.ts, 0, 21))
|
|
>target : Symbol(target, Decl(decoratorOnEnum.ts, 0, 24))
|
|
>T : Symbol(T, Decl(decoratorOnEnum.ts, 0, 21))
|
|
>T : Symbol(T, Decl(decoratorOnEnum.ts, 0, 21))
|
|
|
|
@dec
|
|
>dec : Symbol(dec, Decl(decoratorOnEnum.ts, 0, 0))
|
|
|
|
enum E {
|
|
>E : Symbol(E, Decl(decoratorOnEnum.ts, 0, 38))
|
|
}
|