X-Git-Url: https://git.piment-noir.org/?a=blobdiff_plain;f=tests%2Ftest-utils.js;h=ceaff7be4c605140c546d1773493b56dcfb1e309;hb=25f5b5de1c522d29f7a16597245a2f7c9434b124;hp=a3affb61c91899d187dd91e97f2693cfa7340d0d;hpb=f931db5c2405593ceeef6e3ea86c784e6cf82165;p=poolifier.git diff --git a/tests/test-utils.js b/tests/test-utils.js index a3affb61..ceaff7be 100644 --- a/tests/test-utils.js +++ b/tests/test-utils.js @@ -1,16 +1,34 @@ 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,9 +54,12 @@ class TestUtils { }) } - static generateRandomInteger (max, min = 0) { + 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) { + if (min != null && min !== 0) { min = Math.ceil(min) return Math.floor(Math.random() * (max - min + 1)) + min } @@ -56,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) {