-
Notifications
You must be signed in to change notification settings - Fork 8
/
test-parallel-array.js
301 lines (251 loc) · 7.7 KB
/
test-parallel-array.js
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
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
/* eslint no-sparse-arrays: "off" */
var test = require('tape').test
, parallel = require('../').parallel
, defer = require('../lib/defer.js')
;
test('parallel: iterates over array', function(t)
{
var source = [ 1, 2, 3, 4, 3, 2, 1 ]
, expected = [ 'A', 'B', 'C', 'D', 'C', 'B', 'A' ]
, start = +new Date()
;
t.plan(expected.length + 3);
parallel(source, function(item, cb)
{
t.ok(source.indexOf(item) != -1, 'expect item (' + item + ') to exist in the subject array');
setTimeout(cb.bind(null, null, String.fromCharCode(64 + item)), 10 * item);
},
function(err, result)
{
var diff = +new Date() - start;
t.ok(diff < 160, 'expect response time (' + diff + 'ms) to be less than sum of delays');
t.error(err, 'expect no errors');
t.deepEqual(result, expected, 'expect result to be an ordered letters array');
});
});
test('parallel: handles sync array iterator asynchronously', function(t)
{
var source = [ 1, 2, 3, 4, 3, 2, 1 ]
, expected = [ 'A', 'B', 'C', 'D', 'C', 'B', 'A' ]
, isAsync = false
;
t.plan(expected.length + 3);
defer(function(){ isAsync = true; });
parallel(source, function(item, cb)
{
t.ok(source.indexOf(item) != -1, 'expect item (' + item + ') to exist in the subject array');
cb(null, String.fromCharCode(64 + item));
},
function(err, result)
{
t.ok(isAsync, 'expect async response');
t.error(err, 'expect no errors');
t.deepEqual(result, expected, 'expect result to be an ordered letters array');
});
});
test('parallel: array: longest finishes last', function(t)
{
var source = [ 1, 1, 4, 16, 64, 32, 8, 2 ]
, expected = [ 1, 1, 2, 4, 8, 16, 32, 64 ]
, target = []
;
t.plan(expected.length + 3);
// supports full value, key, callback (shortcut) interface
parallel(source, function(item, key, cb)
{
setTimeout(function()
{
// just "hardcode" first element
var sum = target.reduce(function(acc, num){ return acc + num; }, 0) || 1;
t.equal(sum, item, 'expect sum (' + sum + ') to be equal current number (' + item + ')');
target.push(item);
cb(null, item);
}, 25 * item);
},
function(err, result)
{
t.error(err, 'expect no errors');
t.deepEqual(result, source, 'expect result to be same as source array');
t.deepEqual(target, expected, 'expect target to contain ordered numbers');
});
});
test('parallel: array: terminates early', function(t)
{
var source = [ 1, 1, 4, 16, 66, 34, 8, 2 ]
, salvaged = [ 1, 1, 4, , , , 8, 2 ]
, expected = [ 1, 1, 2, 4, 8 ]
, target = []
;
t.plan(expected.length + 3 + 1);
parallel(source, function(item, cb)
{
var id = setTimeout(function()
{
// just "hardcode" first element
var sum = target.reduce(function(acc, num){ return acc + num; }, 0) || 1;
t.equal(sum, item, 'expect sum (' + sum + ') to be equal current number (' + item + ')');
if (item < 10)
{
target.push(item);
cb(null, item);
}
// return error on big numbers
else
{
cb({item: item});
}
}, 25 * item);
return clearTimeout.bind(null, id);
},
function(err, result)
{
t.equal(err.item, 16, 'expect to error out on 16');
t.deepEqual(result, salvaged, 'expect result to contain salvaged parts of the source array');
t.deepEqual(target, expected, 'expect target to contain passed numbers');
});
});
test('parallel: array: terminated early from outside', function(t)
{
var source = [ 1, 1, 4, 16, 66, 34, 8, 2 ]
, salvaged = [ 1, 1, 4, , , , 8, 2 ]
, expected = [ 1, 1, 2, 4, 8 ]
, target = []
, limitNum = 15
, terminator
;
t.plan(expected.length * 2 + 3);
setTimeout(function()
{
terminator();
}, 25 * limitNum);
terminator = parallel(source, function(item, cb)
{
var id = setTimeout(function()
{
// just "hardcode" first element
var sum = target.reduce(function(acc, num){ return acc + num; }, 0) || 1;
t.ok(item < limitNum, 'expect to only process numbers (' + item + ') less than ' + limitNum);
t.equal(sum, item, 'expect sum (' + sum + ') to be equal current number (' + item + ')');
target.push(item);
cb(null, item);
}, 25 * item);
return clearTimeout.bind(null, id);
},
function(err, result)
{
t.error(err, 'expect no error response');
t.deepEqual(result, salvaged, 'expect result to contain salvaged parts of the source array');
t.deepEqual(target, expected, 'expect target to contain passed numbers');
});
});
test('parallel: array: terminated prematurely from outside', function(t)
{
var source = [ 1, 1, 4, 16, 66, 34, 8, 2 ]
, salvaged = [ ]
, terminator
;
t.plan(2);
terminator = parallel(source, function(item, cb)
{
var id = setTimeout(function()
{
t.fail('do not expect it to come that far');
cb(null, item);
}, 25 * item);
return clearTimeout.bind(null, id);
},
function(err, result)
{
t.error(err, 'expect no error response');
t.deepEqual(result, salvaged, 'expect result to contain salvaged parts of the source array');
});
terminator();
});
test('parallel: array: terminated too late from outside', function(t)
{
var source = [ 1, 1, 4, 16, 64, 32, 8, 2 ]
, salvaged = [ 1, 1, 4, 16, 64, 32, 8, 2 ]
, expected = [ 1, 1, 2, 4, 8, 16, 32, 64 ]
, target = []
, terminator
;
t.plan(expected.length + 4);
terminator = parallel(source, function(item, cb)
{
var id = setTimeout(function()
{
// just "hardcode" first element
var sum = target.reduce(function(acc, num){ return acc + num; }, 0) || 1;
t.equal(sum, item, 'expect sum (' + sum + ') to be equal current number (' + item + ')');
target.push(item);
cb(null, item);
}, 25 * item);
return clearTimeout.bind(null, id);
},
function(err, result)
{
t.error(err, 'expect no error response');
t.deepEqual(result, salvaged, 'expect result to contain salvaged parts of the source array');
t.deepEqual(target, expected, 'expect target to contain passed numbers');
});
setTimeout(function()
{
terminator();
t.ok(true, 'expect terminator function to be invoked');
}, 25 * 64);
});
test('parallel: array: handles non terminable iterations', function(t)
{
var source = [ 1, 1, 4, 16, 65, 33, 8, 2 ]
, expected = [ 1, 1, 2, 4, 8 ]
, target = []
, previous = 0
;
t.plan(expected.length + 2);
parallel(source, function(item, cb)
{
var id = setTimeout(function()
{
if (item < 10)
{
// expect it to be invoked in order
t.ok(item >= previous, 'expect item (' + item + ') to be equal or greater than previous item (' + previous + ')');
previous = item;
target.push(item);
cb(null, item);
}
// return error on big numbers
else
{
cb({item: item});
}
}, 25 * item);
return (item % 2) ? null : clearTimeout.bind(null, id);
},
function(err)
{
t.equal(err.item, 16, 'expect to error out on 16');
t.deepEqual(target, expected, 'expect target to contain passed numbers');
});
});
test('parallel: array: handles unclean callbacks', function(t)
{
var source = [ 1, 2, 3, 4, 3, 2, 1 ]
, expected = [ 2, 4, 6, 8, 6, 4, 2 ]
;
t.plan(expected.length + 2);
parallel(source, function(item, cb)
{
setTimeout(function()
{
t.ok(source.indexOf(item) != -1, 'expect item (' + item + ') to exist in the source array');
cb(null, item * 2);
cb(null, item * -2);
}, 50 * item);
},
function(err, result)
{
t.error(err, 'expect no errors');
t.deepEqual(result, expected, 'expect result to be an multiplied by two array');
});
});