fix: fix fair share algorithm implementation

[poolifier.git] / tests / test-utils.js

diff --git a/tests/test-utils.js b/tests/test-utils.js
index 84bec7e560f7eae6a7bd9a420338b63ff866bec5..a23d8948b146408e85b30b8d5e4c9ded9248d7c1 100644 (file)
--- a/tests/test-utils.js
+++ b/tests/test-utils.js
@@ -4,9 +4,9 @@ class TestUtils {
   static async waitExits (pool, numberOfExitEventsToWait) {
     return new Promise(resolve => {
       let exitEvents = 0
-      for (const worker of pool.workers) {
-        worker.on('exit', () => {
-          exitEvents++
+      for (const workerNode of pool.workerNodes) {
+        workerNode.worker.on('exit', () => {
+          ++exitEvents
           if (exitEvents === numberOfExitEventsToWait) {
             resolve(exitEvents)
           }
@@ -59,7 +59,6 @@ class TestUtils {
 
   /**
    * Intentionally inefficient implementation.
-   *
    * @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.
-   *
    * @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) {