/** @inheritDoc */
public choose (): number | undefined {
const chosenWorkerNodeKey = this.nextWorkerNodeKey
+ this.setPreviousWorkerNodeKey(chosenWorkerNodeKey)
this.roundRobinNextWorkerNodeKey()
- this.checkNextWorkerNodeEligibility(chosenWorkerNodeKey)
return chosenWorkerNodeKey
}
/** @inheritDoc */
public remove (workerNodeKey: number): boolean {
- if (this.nextWorkerNodeKey === workerNodeKey) {
- if (this.pool.workerNodes.length === 0) {
- this.nextWorkerNodeKey = 0
- } else if (this.nextWorkerNodeKey > this.pool.workerNodes.length - 1) {
- this.nextWorkerNodeKey = this.pool.workerNodes.length - 1
- }
+ if (this.pool.workerNodes.length === 0) {
+ this.reset()
+ }
+ if (
+ this.nextWorkerNodeKey === workerNodeKey &&
+ this.nextWorkerNodeKey > this.pool.workerNodes.length - 1
+ ) {
+ this.nextWorkerNodeKey = this.pool.workerNodes.length - 1
+ }
+ if (
+ this.previousWorkerNodeKey === workerNodeKey &&
+ this.previousWorkerNodeKey > this.pool.workerNodes.length - 1
+ ) {
+ this.previousWorkerNodeKey = this.pool.workerNodes.length - 1
}
return true
}
private roundRobinNextWorkerNodeKey (): number | undefined {
- this.nextWorkerNodeKey =
- this.nextWorkerNodeKey === this.pool.workerNodes.length - 1
- ? 0
- : (this.nextWorkerNodeKey ?? this.previousWorkerNodeKey) + 1
+ do {
+ this.nextWorkerNodeKey =
+ this.nextWorkerNodeKey === this.pool.workerNodes.length - 1
+ ? 0
+ : (this.nextWorkerNodeKey ?? this.previousWorkerNodeKey) + 1
+ } while (!this.isWorkerNodeReady(this.nextWorkerNodeKey))
return this.nextWorkerNodeKey
}
}