X-Git-Url: https://git.piment-noir.org/?a=blobdiff_plain;f=tests%2Ftest-utils.js;h=0e71c718a8eee83c85011e10f417725811ae34f8;hb=71002f09cd4b8ac7b8c6d5704222eb045acd1d7a;hp=690f4b37487cf10d369b5cc1589727b358a5f0f7;hpb=85a3f8a7b3087e7240c1d307ba6dd78c05883f83;p=poolifier.git diff --git a/tests/test-utils.js b/tests/test-utils.js index 690f4b37..0e71c718 100644 --- a/tests/test-utils.js +++ b/tests/test-utils.js @@ -1,21 +1,99 @@ +const { WorkerFunctions } = require('./test-types') + class TestUtils { static async waitExits (pool, numberOfExitEventsToWait) { - let exitEvents = 0 - return new Promise(function (resolve, reject) { - pool.workers.forEach(w => { - w.on('exit', () => { - exitEvents++ + return new Promise(resolve => { + let exitEvents = 0 + if (numberOfExitEventsToWait === 0) { + resolve(exitEvents) + } + for (const workerNode of pool.workerNodes) { + workerNode.worker.on('exit', () => { + ++exitEvents if (exitEvents === numberOfExitEventsToWait) { resolve(exitEvents) } }) - }) + } }) } static async sleep (ms) { return new Promise(resolve => setTimeout(resolve, ms)) } + + static async sleepWorkerFunction ( + data, + ms, + rejection = false, + rejectionMessage = '' + ) { + return new Promise((resolve, reject) => { + setTimeout( + () => + rejection === true + ? reject(new Error(rejectionMessage)) + : resolve(data), + ms + ) + }) + } + + 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 = { + a: i + } + JSON.stringify(o) + } + } + + /** + * 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 + 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 + } + return TestUtils.factorial(n - 1) * n + } + + static executeWorkerFunction (data) { + switch (data.function) { + case WorkerFunctions.jsonIntegerSerialization: + return TestUtils.jsonIntegerSerialization(data.n || 100) + case WorkerFunctions.fibonacci: + return TestUtils.fibonacci(data.n || 25) + case WorkerFunctions.factorial: + return TestUtils.factorial(data.n || 100) + default: + throw new Error('Unknown worker function') + } + } } module.exports = TestUtils