X-Git-Url: https://git.piment-noir.org/?a=blobdiff_plain;f=tests%2Ftest-utils.js;h=0e71c718a8eee83c85011e10f417725811ae34f8;hb=71002f09cd4b8ac7b8c6d5704222eb045acd1d7a;hp=ab57685eb58fc000099fe4beec1287c01fcff14a;hpb=15d563152134452a245e4842b20fbf4030457e16;p=poolifier.git diff --git a/tests/test-utils.js b/tests/test-utils.js index ab57685e..0e71c718 100644 --- a/tests/test-utils.js +++ b/tests/test-utils.js @@ -1,15 +1,20 @@ +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) } }) - }) + } }) } @@ -17,7 +22,7 @@ class TestUtils { return new Promise(resolve => setTimeout(resolve, ms)) } - static async workerSleepFunction ( + static async sleepWorkerFunction ( data, ms, rejection = false, @@ -34,6 +39,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 = { @@ -45,9 +62,8 @@ class TestUtils { /** * Intentionally inefficient implementation. - * - * @param {number} n - * @returns {number} + * @param {number} n - The number of fibonacci numbers to generate. + * @returns {number} - The nth fibonacci number. */ static fibonacci (n) { if (n <= 1) return 1 @@ -56,15 +72,26 @@ class TestUtils { /** * Intentionally inefficient implementation. - * - * @param {number} n - * @returns {number} + * @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) { + 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') } } }