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)
+ }
})
})
}
}
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) {
+ if (min != null && min !== 0) {
min = Math.ceil(min)
return Math.floor(Math.random() * (max - min + 1)) + min
}
/**
* Intentionally inefficient implementation.
- *
* @param {number} n - The number of fibonacci numbers to generate.
* @returns {number} - The nth fibonacci number.
*/
/**
* 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) {