/** @inheritDoc */
public choose (): number {
+ return this.leastEluNextWorkerNodeKey()
+ }
+
+ /** @inheritDoc */
+ public remove (): boolean {
+ return true
+ }
+
+ private leastEluNextWorkerNodeKey (): number {
let minWorkerElu = Infinity
for (const [workerNodeKey, workerNode] of this.pool.workerNodes.entries()) {
const workerUsage = workerNode.usage
const workerElu = workerUsage.elu?.active?.aggregate ?? 0
- if (this.workerNodeReady(workerNodeKey) && workerElu === 0) {
- this.nextWorkerNodeId = workerNodeKey
+ if (this.isWorkerNodeReady(workerNodeKey) && workerElu === 0) {
+ this.nextWorkerNodeKey = workerNodeKey
break
} else if (
- this.workerNodeReady(workerNodeKey) &&
+ this.isWorkerNodeReady(workerNodeKey) &&
workerElu < minWorkerElu
) {
minWorkerElu = workerElu
- this.nextWorkerNodeId = workerNodeKey
+ this.nextWorkerNodeKey = workerNodeKey
}
}
- return this.nextWorkerNodeId
- }
-
- /** @inheritDoc */
- public remove (): boolean {
- return true
+ return this.nextWorkerNodeKey
}
}