X-Git-Url: https://git.piment-noir.org/?a=blobdiff_plain;f=benchmarks%2Finternal%2Fbenchmark-utils.js;h=60cecbe5c8b565314c59549244e72db6c7178220;hb=301c53e7ae6cf1120298ea10868a9091904c01a2;hp=cbf69307cdad7e5b07f5b8998099700ffafba2f7;hpb=74750c7f0a8b83b3a579f4d7fc96070ca540b234;p=poolifier.git

diff --git a/benchmarks/internal/benchmark-utils.js b/benchmarks/internal/benchmark-utils.js
index cbf69307..60cecbe5 100644
--- a/benchmarks/internal/benchmark-utils.js
+++ b/benchmarks/internal/benchmark-utils.js
@@ -1,7 +1,13 @@
+const WorkerFunctions = {
+  jsonIntegerSerialization: 'jsonIntegerSerialization',
+  fibonacci: 'fibonacci',
+  factorial: 'factorial'
+}
+
 async function runPoolifierTest (pool, { tasks, workerData }) {
   return new Promise((resolve, reject) => {
     let executions = 0
-    for (let i = 0; i <= tasks; i++) {
+    for (let i = 1; i <= tasks; i++) {
       pool
         .execute(workerData)
         .then(res => {
@@ -11,16 +17,79 @@ async function runPoolifierTest (pool, { tasks, workerData }) {
           }
           return null
         })
-        .catch(err => console.error(err))
+        .catch(err => {
+          console.error(err)
+          return reject(err)
+        })
     }
   })
 }
 
-function generateRandomInteger (max, min = 0) {
+function jsonIntegerSerialization (n) {
+  for (let i = 0; i < n; i++) {
+    const o = {
+      a: i
+    }
+    JSON.stringify(o)
+  }
+}
+
+function generateRandomInteger (max = Number.MAX_SAFE_INTEGER, min = 0) {
+  max = Math.floor(max)
   if (min) {
-    return Math.floor(Math.random() * (max - min + 1) + min)
+    min = Math.ceil(min)
+    return Math.floor(Math.random() * (max - min + 1)) + min
   }
-  return Math.floor(Math.random() * max + 1)
+  return Math.floor(Math.random() * (max + 1))
+}
+
+/**
+ * Intentionally inefficient implementation.
+ *
+ * @param {number} n - The number of fibonacci numbers to generate.
+ * @returns {number} - The nth fibonacci number.
+ */
+function fibonacci (n) {
+  if (n <= 1) return 1
+  return fibonacci(n - 1) + fibonacci(n - 2)
 }
 
-module.exports = { runPoolifierTest, generateRandomInteger }
+/**
+ * Intentionally inefficient implementation.
+ *
+ * @param {number} n - The number to calculate the factorial of.
+ * @returns {number} - The factorial of n.
+ */
+function factorial (n) {
+  if (n === 0) {
+    return 1
+  } else {
+    return factorial(n - 1) * n
+  }
+}
+
+function executeWorkerFunction (data) {
+  switch (data.function) {
+    case WorkerFunctions.jsonIntegerSerialization:
+      return jsonIntegerSerialization(data.n || 1000)
+    case WorkerFunctions.fibonacci:
+      return fibonacci(data.n || 50)
+    case WorkerFunctions.factorial:
+      return factorial(data.n || 1000)
+    default:
+      throw new Error('Unknown worker function')
+  }
+}
+
+const LIST_FORMATTER = new Intl.ListFormat('en-US', {
+  style: 'long',
+  type: 'conjunction'
+})
+
+module.exports = {
+  LIST_FORMATTER,
+  WorkerFunctions,
+  executeWorkerFunction,
+  generateRandomInteger,
+  runPoolifierTest
+}