repositories
/
poolifier.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
test: add queue tests
[poolifier.git]
/
tests
/
test-utils.js
diff --git
a/tests/test-utils.js
b/tests/test-utils.js
index a3affb61c91899d187dd91e97f2693cfa7340d0d..a23d8948b146408e85b30b8d5e4c9ded9248d7c1 100644
(file)
--- a/
tests/test-utils.js
+++ b/
tests/test-utils.js
@@
-2,16
+2,16
@@
const { WorkerFunctions } = require('./test-types')
class TestUtils {
static async waitExits (pool, numberOfExitEventsToWait) {
class TestUtils {
static async waitExits (pool, numberOfExitEventsToWait) {
- let exitEvents = 0
return new Promise(resolve => {
return new Promise(resolve => {
- pool.workers.forEach(w => {
- w.on('exit', () => {
- exitEvents++
+ let exitEvents = 0
+ for (const workerNode of pool.workerNodes) {
+ workerNode.worker.on('exit', () => {
+ ++exitEvents
if (exitEvents === numberOfExitEventsToWait) {
resolve(exitEvents)
}
})
if (exitEvents === numberOfExitEventsToWait) {
resolve(exitEvents)
}
})
- }
)
+ }
})
}
})
}
@@
-36,9
+36,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)
max = Math.floor(max)
- if (min) {
+ if (min
!= null && min !== 0
) {
min = Math.ceil(min)
return Math.floor(Math.random() * (max - min + 1)) + min
}
min = Math.ceil(min)
return Math.floor(Math.random() * (max - min + 1)) + min
}
@@
-56,7
+59,6
@@
class TestUtils {
/**
* Intentionally inefficient implementation.
/**
* Intentionally inefficient implementation.
- *
* @param {number} n - The number of fibonacci numbers to generate.
* @returns {number} - The nth fibonacci number.
*/
* @param {number} n - The number of fibonacci numbers to generate.
* @returns {number} - The nth fibonacci number.
*/
@@
-67,16
+69,14
@@
class TestUtils {
/**
* Intentionally inefficient implementation.
/**
* 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
* @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) {
}
static executeWorkerFunction (data) {