Constructs a new poolifier dynamic cluster pool.
Minimum number of workers which are always active.
Maximum number of workers that can be created by this pool.
Path to an implementation of a ClusterWorker file, which can be relative or absolute.
Id of the next message.
The promise map.
key: This is the message Id of each submitted task.value: An object that contains the worker, the resolve function and the reject function.When we receive a message from the worker we get a map entry and resolve/reject the promise based on the message.
Worker choice strategy instance implementing the worker choice algorithm.
Default to a strategy implementing a round robin algorithm.
Choose a worker for the next task.
The default implementation uses a round robin algorithm to distribute the load.
Worker.
Creates a new worker for this pool and sets it up completely.
New, completely set up worker.
Decrease the number of tasks that the given worker has applied.
Worker whose tasks are decreased.
Increase the number of tasks that the given worker has applied.
Worker whose tasks are increased.
Removes the given worker from the pool.
Worker that will be removed.
This function is the listener registered for each worker.
The listener function to execute when a message is sent from a worker.
This function is the listener registered for each worker.
The listener function to execute when a message is sent from a worker.
Generated using TypeDoc
A cluster pool with a dynamic number of workers, but a guaranteed minimum number of workers.
This cluster pool creates new workers when the others are busy, up to the maximum number of workers. When the maximum number of workers is reached, an event is emitted. If you want to listen to this event, use the pool's
emitter.of data sent to the worker. This can only be serializable data.
of response of execution. This can only be serializable data.
Christopher Quadflieg
2.0.0