X-Git-Url: https://git.piment-noir.org/?a=blobdiff_plain;f=tests%2Ftest-utils.js;h=ceaff7be4c605140c546d1773493b56dcfb1e309;hb=25f5b5de1c522d29f7a16597245a2f7c9434b124;hp=84bec7e560f7eae6a7bd9a420338b63ff866bec5;hpb=996834996130d87aeb1a029186808f68db9f7031;p=poolifier.git

diff --git a/tests/test-utils.js b/tests/test-utils.js
index 84bec7e5..ceaff7be 100644
--- a/tests/test-utils.js
+++ b/tests/test-utils.js
@@ -1,20 +1,38 @@
 const { WorkerFunctions } = require('./test-types')
 
 class TestUtils {
-  static async waitExits (pool, numberOfExitEventsToWait) {
+  static async waitWorkerEvents (pool, workerEvent, numberOfEventsToWait) {
     return new Promise(resolve => {
-      let exitEvents = 0
-      for (const worker of pool.workers) {
-        worker.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 async sleep (ms) {
     return new Promise(resolve => setTimeout(resolve, ms))
   }
@@ -59,27 +77,24 @@ class TestUtils {
 
   /**
    * Intentionally inefficient implementation.
-   *
    * @param {number} n - The number of fibonacci numbers to generate.
    * @returns {number} - The nth fibonacci number.
    */
   static fibonacci (n) {
-    if (n <= 1) return 1
+    if (n <= 1) return n
     return TestUtils.fibonacci(n - 1) + TestUtils.fibonacci(n - 2)
   }
 
   /**
    * 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) {