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
40 lines
1.6 KiB
Plaintext
40 lines
1.6 KiB
Plaintext
=== tests/cases/conformance/constEnums/constEnum2.ts ===
|
|
// An enum declaration that specifies a const modifier is a constant enum declaration.
|
|
// In a constant enum declaration, all members must have constant values and
|
|
// it is an error for a member declaration to specify an expression that isn't classified as a constant enum expression.
|
|
|
|
// Error : not a constant enum expression
|
|
|
|
const CONST = 9000 % 2;
|
|
>CONST : Symbol(CONST, Decl(constEnum2.ts, 6, 5))
|
|
|
|
const enum D {
|
|
>D : Symbol(D, Decl(constEnum2.ts, 6, 23))
|
|
|
|
d = 10,
|
|
>d : Symbol(D.d, Decl(constEnum2.ts, 7, 14))
|
|
|
|
e = 199 * Math.floor(Math.random() * 1000),
|
|
>e : Symbol(D.e, Decl(constEnum2.ts, 8, 11))
|
|
>Math.floor : Symbol(Math.floor, Decl(lib.d.ts, --, --))
|
|
>Math : Symbol(Math, Decl(lib.d.ts, --, --), Decl(lib.d.ts, --, --))
|
|
>floor : Symbol(Math.floor, Decl(lib.d.ts, --, --))
|
|
>Math.random : Symbol(Math.random, Decl(lib.d.ts, --, --))
|
|
>Math : Symbol(Math, Decl(lib.d.ts, --, --), Decl(lib.d.ts, --, --))
|
|
>random : Symbol(Math.random, Decl(lib.d.ts, --, --))
|
|
|
|
f = d - (100 * Math.floor(Math.random() % 8))
|
|
>f : Symbol(D.f, Decl(constEnum2.ts, 9, 47))
|
|
>d : Symbol(D.d, Decl(constEnum2.ts, 7, 14))
|
|
>Math.floor : Symbol(Math.floor, Decl(lib.d.ts, --, --))
|
|
>Math : Symbol(Math, Decl(lib.d.ts, --, --), Decl(lib.d.ts, --, --))
|
|
>floor : Symbol(Math.floor, Decl(lib.d.ts, --, --))
|
|
>Math.random : Symbol(Math.random, Decl(lib.d.ts, --, --))
|
|
>Math : Symbol(Math, Decl(lib.d.ts, --, --), Decl(lib.d.ts, --, --))
|
|
>random : Symbol(Math.random, Decl(lib.d.ts, --, --))
|
|
|
|
g = CONST,
|
|
>g : Symbol(D.g, Decl(constEnum2.ts, 10, 49))
|
|
>CONST : Symbol(CONST, Decl(constEnum2.ts, 6, 5))
|
|
}
|