forked from brianmhunt/knockout
-
Notifications
You must be signed in to change notification settings - Fork 0
/
taskBehaviors.js
365 lines (300 loc) · 11.1 KB
/
taskBehaviors.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
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
describe('Tasks', function() {
beforeEach(function() {
jasmine.Clock.useMockForTasks();
});
afterEach(function() {
// Check that task schedule is clear after each test
expect(ko.tasks.resetForTesting()).toEqual(0);
jasmine.Clock.reset();
});
it('Should run in next execution cycle', function() {
var runCount = 0;
ko.tasks.schedule(function() {
runCount++;
});
expect(runCount).toEqual(0);
jasmine.Clock.tick(1);
expect(runCount).toEqual(1);
});
it('Should run multiple times if added more than once', function() {
var runCount = 0;
var func = function() {
runCount++;
};
ko.tasks.schedule(func);
ko.tasks.schedule(func);
expect(runCount).toEqual(0);
jasmine.Clock.tick(1);
expect(runCount).toEqual(2);
});
it('Should run scheduled tasks in the order they were scheduled', function() {
var runValues = [];
var func = function(value) {
runValues.push(value);
};
ko.tasks.schedule(func.bind(null, 1));
ko.tasks.schedule(func.bind(null, 2));
jasmine.Clock.tick(1);
expect(runValues).toEqual([1,2]);
});
it('Should run tasks again if scheduled after a previous run', function() {
var runCount = 0;
var func = function() {
runCount++;
};
ko.tasks.schedule(func);
expect(runCount).toEqual(0);
jasmine.Clock.tick(1);
expect(runCount).toEqual(1);
ko.tasks.schedule(func);
expect(runCount).toEqual(1);
jasmine.Clock.tick(1);
expect(runCount).toEqual(2);
});
it('Should process newly scheduled tasks during task processing', function() {
var runValues = [];
var func = function(value) {
runValues.push(value);
ko.tasks.schedule(function() {
runValues.push('x');
});
};
ko.tasks.schedule(func.bind(null, 'i'));
expect(runValues).toEqual([]);
jasmine.Clock.tick(1);
expect(runValues).toEqual(['i','x']);
});
it('Should keep correct state if a task throws an exception', function() {
var runValues = [];
var func = function(value) {
runValues.push(value);
};
ko.tasks.schedule(func.bind(null, 1));
ko.tasks.schedule(function() {
throw Error("test");
});
ko.tasks.schedule(func.bind(null, 2));
expect(runValues).toEqual([]);
// When running tasks, it will throw an exception after completing all tasks
expect(function() {
jasmine.Clock.tick(1);
}).toThrow();
expect(runValues).toEqual([1,2]);
});
it('Should stop recursive task processing after a fixed number of iterations', function() {
var runValues = [];
var func = function() {
runValues.push('x');
ko.tasks.schedule(function() {});
ko.tasks.schedule(func);
};
ko.tasks.schedule(func);
expect(runValues).toEqual([]);
expect(function() {
jasmine.Clock.tick(1);
}).toThrowContaining('Too much recursion');
// 5000 is the current limit in the code, but it could change if needed.
expect(runValues.length).toEqual(5000);
});
it('Should not stop non-recursive task processing', function() {
var runValues = [];
var func = function() {
runValues.push('x');
};
for (var i = 0; i < 10000; ++i) {
ko.tasks.schedule(func);
}
expect(runValues).toEqual([]);
jasmine.Clock.tick(1);
expect(runValues.length).toEqual(10000);
});
describe('Cancel', function() {
it('Should prevent task from running', function() {
var runCount = 0;
var handle = ko.tasks.schedule(function() {
runCount++;
});
ko.tasks.cancel(handle);
jasmine.Clock.tick(1);
expect(runCount).toEqual(0);
});
it('Should prevent only the canceled task', function() {
var runCount = 0;
var func = function() {
runCount++;
};
var handle1 = ko.tasks.schedule(func);
var handle2 = ko.tasks.schedule(func);
ko.tasks.cancel(handle2);
jasmine.Clock.tick(1);
expect(runCount).toEqual(1);
});
it('Should do nothing if task has already run', function() {
var runValues = [];
var func = function(value) {
runValues.push(value);
};
var handle1 = ko.tasks.schedule(func.bind(null, 1));
expect(runValues).toEqual([]);
jasmine.Clock.tick(1);
expect(runValues).toEqual([1]);
var handle2 = ko.tasks.schedule(func.bind(null, 2));
// Try to cancel the first task
ko.tasks.cancel(handle1);
// But nothing should happen; the second task will run in the next iteration
jasmine.Clock.tick(1);
expect(runValues).toEqual([1,2]);
});
it('Should work correctly after a task throws an exception', function() {
var runValues = [], handle;
var func = function(value) {
runValues.push(value);
};
ko.tasks.schedule(func.bind(null, 1));
ko.tasks.schedule(function() {
throw Error("test");
});
ko.tasks.schedule(function() {
ko.tasks.cancel(handle);
});
handle = ko.tasks.schedule(func.bind(null, 2));
ko.tasks.schedule(func.bind(null, 3));
expect(runValues).toEqual([]);
// When running tasks, it will throw an exception after completing the tasks
expect(function() {
jasmine.Clock.tick(1);
}).toThrow();
expect(runValues).toEqual([1, 3]); // The canceled task will be skipped
});
});
describe('runEarly', function() {
it('Should run tasks early', function() {
var runValues = [];
var func = function(value) {
runValues.push(value);
};
ko.tasks.schedule(func.bind(null, 1));
expect(runValues).toEqual([]);
// Immediately runs any scheduled tasks
ko.tasks.runEarly();
expect(runValues).toEqual([1]);
// Skip calling jasmine.Clock.tick to show that the queue is clear
});
it('Should run tasks early during task processing', function() {
var runValues = [];
var func = function(value) {
runValues.push(value);
};
// Schedule two tasks; the first one schedules other tasks and calls runEarly
ko.tasks.schedule(function() {
ko.tasks.schedule(func.bind(null, 2));
expect(runValues).toEqual([]);
ko.tasks.runEarly();
expect(runValues).toEqual([1,2]);
// Schedule another task; it will be run after this one completes
ko.tasks.schedule(func.bind(null, 3));
});
ko.tasks.schedule(func.bind(null, 1));
jasmine.Clock.tick(1);
expect(runValues).toEqual([1,2,3]);
});
it('Should stop recursive task processing after a fixed number of iterations', function() {
var runValues = [];
var func = function() {
runValues.push('x');
ko.tasks.schedule(function() {});
ko.tasks.schedule(func);
};
ko.tasks.schedule(func);
expect(runValues).toEqual([]);
ko.tasks.runEarly(); // No exception thrown yet, but the recursion was ended
// 5000 is the current limit in the code, but it could change if needed.
expect(runValues.length).toEqual(5000);
expect(function() {
jasmine.Clock.tick(1);
}).toThrowContaining('Too much recursion');
// No additional iterations should happen
expect(runValues.length).toEqual(5000);
});
it('Should keep correct state if a task throws an exception', function() {
var runValues = [];
var func = function(value) {
runValues.push(value);
};
ko.tasks.schedule(func.bind(null, 1));
ko.tasks.schedule(function() {
expect(runValues).toEqual([1]);
ko.tasks.runEarly(); // The error will be thrown asynchronously after all tasks are complete
expect(runValues).toEqual([1, 2]);
ko.tasks.schedule(func.bind(null, 3));
});
ko.tasks.schedule(function() {
throw Error("test");
});
ko.tasks.schedule(func.bind(null, 2));
expect(runValues).toEqual([]);
// It will throw an exception after completing all tasks
expect(function() {
jasmine.Clock.tick(1);
}).toThrow();
expect(runValues).toEqual([1, 2, 3]);
});
});
});
describe('Tasks scheduler', function() {
beforeEach(function() { waits(1); }); // Workaround for timing-related issues in IE8
it('Should process tasks asynchronously', function() {
var runCount = 0;
function func() {
runCount++;
}
ko.tasks.schedule(func);
expect(runCount).toEqual(0);
waits(1);
runs(function() {
expect(runCount).toEqual(1);
// Run a second time
ko.tasks.schedule(func);
expect(runCount).toEqual(1);
});
waits(1);
runs(function() {
expect(runCount).toEqual(2);
});
});
it('Should run only once for a set of tasks', function() {
var counts = [0, 0]; // scheduler, tasks
jasmine.Clock.useMock();
this.restoreAfter(ko.tasks, 'scheduler');
ko.tasks.scheduler = function (callback) {
++counts[0];
setTimeout(callback, 0);
};
function func() {
++counts[1];
};
// First batch = one scheduler call
ko.tasks.schedule(func);
expect(counts).toEqual([1, 0]);
ko.tasks.schedule(func);
expect(counts).toEqual([1, 0]);
jasmine.Clock.tick(1);
expect(counts).toEqual([1, 2]);
// Second batch = one scheduler call
counts = [0, 0];
ko.tasks.schedule(func);
ko.tasks.schedule(func);
jasmine.Clock.tick(1);
expect(counts).toEqual([1, 2]);
// runEarly doesn't cause any extra scheduler call
counts = [0, 0];
ko.tasks.schedule(func);
expect(counts).toEqual([1, 0]);
ko.tasks.runEarly();
expect(counts).toEqual([1, 1]);
ko.tasks.schedule(func);
expect(counts).toEqual([1, 1]);
jasmine.Clock.tick(1);
expect(counts).toEqual([1, 2]);
});
});