X-Git-Url: https://git.piment-noir.org/?a=blobdiff_plain;f=tests%2Ftest-utils.js;h=ceaff7be4c605140c546d1773493b56dcfb1e309;hb=f65efa796405c785a1ab5e646e30fc27418a6151;hp=31a33c627eec12c671872e3e2acf8c89d6bfe34c;hpb=6db75ad932064c1415ff6f03645929530209a5fe;p=poolifier.git diff --git a/tests/test-utils.js b/tests/test-utils.js index 31a33c62..ceaff7be 100644 --- a/tests/test-utils.js +++ b/tests/test-utils.js @@ -1,16 +1,34 @@ -const WorkerFunctions = require('./test-types') +const { WorkerFunctions } = require('./test-types') class TestUtils { - static async waitExits (pool, numberOfExitEventsToWait) { - let exitEvents = 0 + static async waitWorkerEvents (pool, workerEvent, numberOfEventsToWait) { return new Promise(resolve => { - pool.workers.forEach(w => { - w.on('exit', () => { - exitEvents++ - if (exitEvents === numberOfExitEventsToWait) { - resolve(exitEvents) + let events = 0 + if (numberOfEventsToWait === 0) { + resolve(events) + } + for (const workerNode of pool.workerNodes) { + workerNode.worker.on(workerEvent, () => { + ++events + if (events === numberOfEventsToWait) { + resolve(events) } }) + } + }) + } + + static async waitPoolEvents (pool, poolEvent, numberOfEventsToWait) { + return new Promise(resolve => { + let events = 0 + if (numberOfEventsToWait === 0) { + resolve(events) + } + pool.emitter.on(poolEvent, () => { + ++events + if (events === numberOfEventsToWait) { + resolve(events) + } }) }) } @@ -36,6 +54,18 @@ class TestUtils { }) } + static generateRandomInteger (max = Number.MAX_SAFE_INTEGER, min = 0) { + if (max < min || max < 0 || min < 0) { + throw new RangeError('Invalid interval') + } + max = Math.floor(max) + if (min != null && min !== 0) { + min = Math.ceil(min) + return Math.floor(Math.random() * (max - min + 1)) + min + } + return Math.floor(Math.random() * (max + 1)) + } + static jsonIntegerSerialization (n) { for (let i = 0; i < n; i++) { const o = { @@ -47,27 +77,24 @@ class TestUtils { /** * Intentionally inefficient implementation. - * * @param {number} n - The number of fibonacci numbers to generate. * @returns {number} - The nth fibonacci number. */ static fibonacci (n) { - if (n <= 1) return 1 + if (n <= 1) return n return TestUtils.fibonacci(n - 1) + TestUtils.fibonacci(n - 2) } /** * Intentionally inefficient implementation. - * * @param {number} n - The number to calculate the factorial of. * @returns {number} - The factorial of n. */ static factorial (n) { if (n === 0) { return 1 - } else { - return TestUtils.factorial(n - 1) * n } + return TestUtils.factorial(n - 1) * n } static executeWorkerFunction (data) {