build(deps-dev): apply update
[poolifier.git] / tests / test-utils.js
CommitLineData
2d2e32c2 1const { WorkerFunctions } = require('./test-types')
6db75ad9 2
85a3f8a7
APA
3class TestUtils {
4 static async waitExits (pool, numberOfExitEventsToWait) {
d94bee6f 5 return new Promise(resolve => {
f821a841 6 let exitEvents = 0
99683499
JB
7 for (const worker of pool.workers) {
8 worker.on('exit', () => {
85a3f8a7
APA
9 exitEvents++
10 if (exitEvents === numberOfExitEventsToWait) {
11 resolve(exitEvents)
12 }
13 })
99683499 14 }
85a3f8a7
APA
15 })
16 }
17
18 static async sleep (ms) {
19 return new Promise(resolve => setTimeout(resolve, ms))
20 }
bdacc2d2 21
6db75ad9 22 static async sleepWorkerFunction (
15d56315
JB
23 data,
24 ms,
25 rejection = false,
26 rejectionMessage = ''
27 ) {
28 return new Promise((resolve, reject) => {
29 setTimeout(
30 () =>
31 rejection === true
32 ? reject(new Error(rejectionMessage))
33 : resolve(data),
34 ms
35 )
bdacc2d2
JB
36 })
37 }
38
9bc18a6d 39 static generateRandomInteger (max = Number.MAX_SAFE_INTEGER, min = 0) {
548140e6 40 if (max < min || max < 0 || min < 0) {
4af5c11a
JB
41 throw new RangeError('Invalid interval')
42 }
f931db5c 43 max = Math.floor(max)
4af5c11a 44 if (min != null && min !== 0) {
f931db5c
JB
45 min = Math.ceil(min)
46 return Math.floor(Math.random() * (max - min + 1)) + min
47 }
48 return Math.floor(Math.random() * (max + 1))
49 }
50
bdacc2d2
JB
51 static jsonIntegerSerialization (n) {
52 for (let i = 0; i < n; i++) {
53 const o = {
54 a: i
55 }
56 JSON.stringify(o)
57 }
58 }
59
60 /**
61 * Intentionally inefficient implementation.
62 *
7d82d90e
JB
63 * @param {number} n - The number of fibonacci numbers to generate.
64 * @returns {number} - The nth fibonacci number.
bdacc2d2
JB
65 */
66 static fibonacci (n) {
67 if (n <= 1) return 1
68 return TestUtils.fibonacci(n - 1) + TestUtils.fibonacci(n - 2)
69 }
70
71 /**
72 * Intentionally inefficient implementation.
73 *
7d82d90e
JB
74 * @param {number} n - The number to calculate the factorial of.
75 * @returns {number} - The factorial of n.
bdacc2d2
JB
76 */
77 static factorial (n) {
78 if (n === 0) {
79 return 1
80 } else {
81 return TestUtils.factorial(n - 1) * n
82 }
83 }
6db75ad9
JB
84
85 static executeWorkerFunction (data) {
86 switch (data.function) {
87 case WorkerFunctions.jsonIntegerSerialization:
88 return TestUtils.jsonIntegerSerialization(data.n || 100)
89 case WorkerFunctions.fibonacci:
90 return TestUtils.fibonacci(data.n || 25)
91 case WorkerFunctions.factorial:
92 return TestUtils.factorial(data.n || 100)
93 default:
94 throw new Error('Unknown worker function')
95 }
96 }
85a3f8a7
APA
97}
98
99module.exports = TestUtils