X-Git-Url: https://git.piment-noir.org/?a=blobdiff_plain;f=tests%2Ftest-utils.js;h=0e71c718a8eee83c85011e10f417725811ae34f8;hb=0e2c24b4aaed93a6768127f49d898ac427faa147;hp=4dace47e4f1412106c4f954659d2721c06875a1e;hpb=7d82d90ea31689b7235a9282ccd5a2439483bc9f;p=poolifier.git

diff --git a/tests/test-utils.js b/tests/test-utils.js
index 4dace47e..0e71c718 100644
--- a/tests/test-utils.js
+++ b/tests/test-utils.js
@@ -1,15 +1,20 @@
+const { WorkerFunctions } = require('./test-types')
+
 class TestUtils {
   static async waitExits (pool, numberOfExitEventsToWait) {
-    let exitEvents = 0
     return new Promise(resolve => {
-      pool.workers.forEach(w => {
-        w.on('exit', () => {
-          exitEvents++
+      let exitEvents = 0
+      if (numberOfExitEventsToWait === 0) {
+        resolve(exitEvents)
+      }
+      for (const workerNode of pool.workerNodes) {
+        workerNode.worker.on('exit', () => {
+          ++exitEvents
           if (exitEvents === numberOfExitEventsToWait) {
             resolve(exitEvents)
           }
         })
-      })
+      }
     })
   }
 
@@ -17,7 +22,7 @@ class TestUtils {
     return new Promise(resolve => setTimeout(resolve, ms))
   }
 
-  static async workerSleepFunction (
+  static async sleepWorkerFunction (
     data,
     ms,
     rejection = false,
@@ -34,6 +39,18 @@ class TestUtils {
     })
   }
 
+  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)
+    if (min != null && min !== 0) {
+      min = Math.ceil(min)
+      return Math.floor(Math.random() * (max - min + 1)) + min
+    }
+    return Math.floor(Math.random() * (max + 1))
+  }
+
   static jsonIntegerSerialization (n) {
     for (let i = 0; i < n; i++) {
       const o = {
@@ -45,7 +62,6 @@ class TestUtils {
 
   /**
    * Intentionally inefficient implementation.
-   *
    * @param {number} n - The number of fibonacci numbers to generate.
    * @returns {number} - The nth fibonacci number.
    */
@@ -56,15 +72,26 @@ 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) {
+    switch (data.function) {
+      case WorkerFunctions.jsonIntegerSerialization:
+        return TestUtils.jsonIntegerSerialization(data.n || 100)
+      case WorkerFunctions.fibonacci:
+        return TestUtils.fibonacci(data.n || 25)
+      case WorkerFunctions.factorial:
+        return TestUtils.factorial(data.n || 100)
+      default:
+        throw new Error('Unknown worker function')
     }
   }
 }