docs: update benchmarks vs. external pools

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

diff --git a/tests/test-utils.js b/tests/test-utils.js
index 116b1942b96829273eedb2d08ff83691ff61aa6f..ceaff7be4c605140c546d1773493b56dcfb1e309 100644 (file)
--- a/tests/test-utils.js
+++ b/tests/test-utils.js
@@ -1,16 +1,34 @@
 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)
+        }
       })
     })
   }
@@ -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) {