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 6d3592c1b5d2e2798c00b95fe213c1c630370c96..a23d8948b146408e85b30b8d5e4c9ded9248d7c1 100644
(file)
--- a/
tests/test-utils.js
+++ b/
tests/test-utils.js
@@
-4,8
+4,8
@@
class TestUtils {
static async waitExits (pool, numberOfExitEventsToWait) {
return new Promise(resolve => {
let exitEvents = 0
static async waitExits (pool, numberOfExitEventsToWait) {
return new Promise(resolve => {
let exitEvents = 0
- for (const worker
Item of pool.worker
s) {
- worker
Item
.worker.on('exit', () => {
+ for (const worker
Node of pool.workerNode
s) {
+ worker
Node
.worker.on('exit', () => {
++exitEvents
if (exitEvents === numberOfExitEventsToWait) {
resolve(exitEvents)
++exitEvents
if (exitEvents === numberOfExitEventsToWait) {
resolve(exitEvents)
@@
-59,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.
*/
@@
-70,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) {