1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
;(function(IteratorHelper, InternalError, TypeError, call,
hasOwnEnumProperty, getOwnPropertyKeys, Symbolยทiterator) {
function check(v, s) {
if (typeof v === "object" && v !== null) return
throw new TypeError(s)
}
function close(iter) {
try {
if (!iter) return
let method = iter.return
if (method) call(iter, method)
} catch (e) {
return e
}
}
function closeall(iters, count) {
let ex = undefined
for (let i = count; i-- > 0;) {
let iter = iters[i]
iters[i] = undefined
let e = close(iter)
if (!ex) ex = e
}
return ex
}
return function zipKeyed(iterables, options = undefined) {
check(iterables, "bad iterables")
if (options === undefined) options = {__proto__: null}
else check(options, "bad options")
let mode = options.mode
if (mode === undefined) mode = "shortest"
if (!(mode === "strict" || mode === "longest" || mode === "shortest"))
throw new TypeError("bad mode")
let padding = undefined
if (mode === "longest") {
padding = options.padding
if (padding !== undefined) check(padding, "bad padding")
}
let keys = []
let count = 0
let iters = []
let nexts = []
let pads = []
for (let key of getOwnPropertyKeys(iterables)) keys[count++] = key
try {
for (let i = 0; i < count; i++) {
let del = true
let key = keys[i]
// test262 goes out of its way to destroy performance here:
// we must only add enumerable properties but because evil
// getters can flip the visibility of subsequent properties,
// we have to first collect *all* properties, enumerable and
// non-enumerable, then check each one when we add it to the
// final list
// TODO(bnoordhuis) optimize by introducing some kind of
// mutation observer; mutation is the uncommon case
if (hasOwnEnumProperty(iterables, key)) {
let iter = iterables[key]
if (iter !== undefined) {
check(iter, "bad iterator")
let method = iter[Symbolยทiterator]
if (method) iter = call(iter, method) // iterable -> iterator
iters[i] = iter
nexts[i] = iter.next
del = false
}
}
if (del) {
// splice out property; the assumption here is that the
// vast majority of objects don't have non-enumerable
// properties, or properties whose value is undefined
for (let j = i+1; j < count; j++) keys[j-1] = keys[j]
count--
i--
}
}
if (mode === "longest") {
if (padding) {
for (let i = 0; i < count; i++) pads[i] = padding[keys[i]]
} else {
for (let i = 0; i < count; i++) pads[i] = undefined
}
}
} catch (e) {
closeall(iters, count)
throw e
}
// note: uses plain numbers for |state|, using
// constants grows the bytecode by about 200 bytes
let state = 0 // new, suspend, execute, complete
let alive = count
return {
__proto__: IteratorHelper,
// TODO(bnoordhuis) shows up as "at next (<null>:0:1)" in stack
// traces when iterator throws, should be "at next (native)"
next() {
switch (state) {
case 0: // new
case 1: // suspend
state = 2 // execute
break
case 2: // execute
throw new TypeError("running zipper")
case 3: // complete
return {value:undefined, done:true}
default:
throw new InternalError("bug")
}
let dones = 0
let values = 0
let results = {__proto__: null}
for (let i = 0; i < count; i++) {
let key = keys[i]
let iter = iters[i]
if (!iter) {
if (mode !== "longest") throw new InternalError("bug")
results[key] = pads[i]
continue
}
let result
try {
result = call(iter, nexts[i])
} catch (e) {
alive = 0
iters[i] = undefined
closeall(iters, count)
throw e
}
// order of .done and .value property
// access is observable and matters
if (!result.done) {
if (mode === "strict" && dones > 0) {
closeall(iters, count)
throw new TypeError("mismatched inputs")
}
results[key] = result.value
values++
continue
}
alive--
dones++
iters[i] = undefined
switch (mode) {
case "shortest":
let ex = closeall(iters, count)
if (ex) throw ex
state = 3 // complete
return {value:undefined, done:true}
case "longest":
if (alive < 1) {
state = 3 // complete
return {value:undefined, done:true}
}
results[key] = pads[i]
break
case "strict":
if (values > 0) {
closeall(iters, count)
throw new TypeError("mismatched inputs")
}
break
}
}
if (values === 0) {
state = 3 // complete
return {value:undefined, done:true}
}
state = 1 // suspend
return {value:results, done:false}
},
return() {
switch (state) {
case 0: // new
state = 3 // complete
break
case 1: // suspend
state = 2 // execute
break
case 2: // execute
throw new TypeError("running zipper")
case 3: // complete
return {value:undefined, done:true}
default:
throw new InternalError(`bug: state=${state}`)
}
// TODO skip when already closed because of earlier exception
let ex = closeall(iters, count)
if (ex) throw ex
state = 3 // complete
return {value:undefined, done:true}
},
}
}
})