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
29 lines
554 B
Plaintext
29 lines
554 B
Plaintext
=== tests/cases/conformance/es6/for-ofStatements/for-of49.ts ===
|
|
var k: string, v: boolean;
|
|
>k : string
|
|
>v : boolean
|
|
|
|
var map = new Map([["", true]]);
|
|
>map : Map<string, boolean>
|
|
>new Map([["", true]]) : Map<string, boolean>
|
|
>Map : MapConstructor
|
|
>[["", true]] : [string, true][]
|
|
>["", true] : [string, true]
|
|
>"" : ""
|
|
>true : true
|
|
|
|
for ([k, ...[v]] of map) {
|
|
>[k, ...[v]] : (string | boolean)[]
|
|
>k : string
|
|
>...[v] : boolean
|
|
>[v] : [boolean]
|
|
>v : boolean
|
|
>map : Map<string, boolean>
|
|
|
|
k;
|
|
>k : string
|
|
|
|
v;
|
|
>v : boolean
|
|
}
|