* 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
17 lines
261 B
Text
17 lines
261 B
Text
=== tests/cases/conformance/parser/ecmascript5/EnumDeclarations/parserEnum5.ts ===
|
|
enum E2 { a, }
|
|
>E2 : E2
|
|
>a : E2
|
|
|
|
enum E3 { a: 1, }
|
|
>E3 : E3
|
|
>a : E3.a
|
|
|
|
enum E1 { a, b: 1, c, d: 2 = 3 }
|
|
>E1 : E1
|
|
>a : E1.a
|
|
>b : E1.b
|
|
>c : E1.c
|
|
>d : E1.d
|
|
>3 : 3
|
|
|