ヤミRoot VoidGate
User / IP
:
216.73.216.81
Host / Server
:
146.88.233.70 / dev.loger.cm
System
:
Linux hybrid1120.fr.ns.planethoster.net 3.10.0-957.21.2.el7.x86_64 #1 SMP Wed Jun 5 14:26:44 UTC 2019 x86_64
Command
|
Upload
|
Create
Mass Deface
|
Jumping
|
Symlink
|
Reverse Shell
Ping
|
Port Scan
|
DNS Lookup
|
Whois
|
Header
|
cURL
:
/
home
/
logercm
/
dev.loger.cm
/
node_modules
/
webpack
/
lib
/
util
/
Viewing: processAsyncTree.js
/* MIT License http://www.opensource.org/licenses/mit-license.php Author Tobias Koppers @sokra */ "use strict"; /** * @template T * @template {Error} E * @param {Iterable<T>} items initial items * @param {number} concurrency number of items running in parallel * @param {function(T, function(T): void, function(E=): void): void} processor worker which pushes more items * @param {function(E=): void} callback all items processed * @returns {void} */ const processAsyncTree = (items, concurrency, processor, callback) => { const queue = Array.from(items); if (queue.length === 0) return callback(); let processing = 0; let finished = false; let processScheduled = true; /** * @param {T} item item */ const push = item => { queue.push(item); if (!processScheduled && processing < concurrency) { processScheduled = true; process.nextTick(processQueue); } }; /** * @param {E | null | undefined} err error */ const processorCallback = err => { processing--; if (err && !finished) { finished = true; callback(err); return; } if (!processScheduled) { processScheduled = true; process.nextTick(processQueue); } }; const processQueue = () => { if (finished) return; while (processing < concurrency && queue.length > 0) { processing++; const item = /** @type {T} */ (queue.pop()); processor(item, push, processorCallback); } processScheduled = false; if (queue.length === 0 && processing === 0 && !finished) { finished = true; callback(); } }; processQueue(); }; module.exports = processAsyncTree;
Coded With 💗 by
0x6ick