mirror of
https://github.com/the-djmaze/snappymail.git
synced 2026-08-30 20:49:20 +03:00
108 lines
4 KiB
JavaScript
108 lines
4 KiB
JavaScript
ko.tasks = (function () {
|
|
var scheduler,
|
|
taskQueue = [],
|
|
taskQueueLength = 0,
|
|
nextHandle = 1,
|
|
nextIndexToProcess = 0;
|
|
|
|
if (window['MutationObserver']) {
|
|
// Chrome 27+, Firefox 14+, IE 11+, Opera 15+, Safari 6.1+
|
|
// From https://github.com/petkaantonov/bluebird * Copyright (c) 2014 Petka Antonov * License: MIT
|
|
scheduler = (function (callback) {
|
|
var div = document.createElement("div");
|
|
new MutationObserver(callback).observe(div, {attributes: true});
|
|
return function () { div.classList.toggle("foo"); };
|
|
})(scheduledProcess);
|
|
} else if (document && "onreadystatechange" in document.createElement("script")) {
|
|
// IE 6-10
|
|
// From https://github.com/YuzuJS/setImmediate * Copyright (c) 2012 Barnesandnoble.com, llc, Donavon West, and Domenic Denicola * License: MIT
|
|
scheduler = function (callback) {
|
|
var script = document.createElement("script");
|
|
script.onreadystatechange = function () {
|
|
script.onreadystatechange = null;
|
|
document.documentElement.removeChild(script);
|
|
script = null;
|
|
callback();
|
|
};
|
|
document.documentElement.append(script);
|
|
};
|
|
} else {
|
|
scheduler = function (callback) {
|
|
setTimeout(callback, 0);
|
|
};
|
|
}
|
|
|
|
function processTasks() {
|
|
if (taskQueueLength) {
|
|
// Each mark represents the end of a logical group of tasks and the number of these groups is
|
|
// limited to prevent unchecked recursion.
|
|
var mark = taskQueueLength, countMarks = 0;
|
|
|
|
// nextIndexToProcess keeps track of where we are in the queue; processTasks can be called recursively without issue
|
|
for (var task; nextIndexToProcess < taskQueueLength; ) {
|
|
if (task = taskQueue[nextIndexToProcess++]) {
|
|
if (nextIndexToProcess > mark) {
|
|
if (++countMarks >= 5000) {
|
|
nextIndexToProcess = taskQueueLength; // skip all tasks remaining in the queue since any of them could be causing the recursion
|
|
ko.utils.deferError(Error("'Too much recursion' after processing " + countMarks + " task groups."));
|
|
break;
|
|
}
|
|
mark = taskQueueLength;
|
|
}
|
|
try {
|
|
task();
|
|
} catch (ex) {
|
|
ko.utils.deferError(ex);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
function scheduledProcess() {
|
|
processTasks();
|
|
|
|
// Reset the queue
|
|
nextIndexToProcess = taskQueueLength = taskQueue.length = 0;
|
|
}
|
|
|
|
function scheduleTaskProcessing() {
|
|
ko.tasks['scheduler'](scheduledProcess);
|
|
}
|
|
|
|
var tasks = {
|
|
'scheduler': scheduler, // Allow overriding the scheduler
|
|
|
|
schedule: function (func) {
|
|
if (!taskQueueLength) {
|
|
scheduleTaskProcessing();
|
|
}
|
|
|
|
taskQueue[taskQueueLength++] = func;
|
|
return nextHandle++;
|
|
},
|
|
|
|
cancel: function (handle) {
|
|
var index = handle - (nextHandle - taskQueueLength);
|
|
if (index >= nextIndexToProcess && index < taskQueueLength) {
|
|
taskQueue[index] = null;
|
|
}
|
|
},
|
|
|
|
// For testing only: reset the queue and return the previous queue length
|
|
'resetForTesting': function () {
|
|
var length = taskQueueLength - nextIndexToProcess;
|
|
nextIndexToProcess = taskQueueLength = taskQueue.length = 0;
|
|
return length;
|
|
},
|
|
|
|
runEarly: processTasks
|
|
};
|
|
|
|
return tasks;
|
|
})();
|
|
|
|
ko.exportSymbol('tasks', ko.tasks);
|
|
ko.exportSymbol('tasks.schedule', ko.tasks.schedule);
|
|
//ko.exportSymbol('tasks.cancel', ko.tasks.cancel); "cancel" isn't minified
|
|
ko.exportSymbol('tasks.runEarly', ko.tasks.runEarly);
|