perf: improve node eligibility branching on worker choice strategies

[poolifier.git] / src / pools / selection-strategies / least-used-worker-choice-strategy.ts

import { DEFAULT_WORKER_CHOICE_STRATEGY_OPTIONS } from '../../utils'
import type { IPool } from '../pool'
import type { IWorker } from '../worker'
import { AbstractWorkerChoiceStrategy } from './abstract-worker-choice-strategy'
import type {
  IWorkerChoiceStrategy,
  WorkerChoiceStrategyOptions
} from './selection-strategies-types'

/**
 * Selects the least used worker.
 *
 * @typeParam Worker - Type of worker which manages the strategy.
 * @typeParam Data - Type of data sent to the worker. This can only be structured-cloneable data.
 * @typeParam Response - Type of execution response. This can only be structured-cloneable data.
 */
export class LeastUsedWorkerChoiceStrategy<
    Worker extends IWorker,
    Data = unknown,
    Response = unknown
  >
  extends AbstractWorkerChoiceStrategy<Worker, Data, Response>
  implements IWorkerChoiceStrategy {
  /** @inheritDoc */
  public constructor (
    pool: IPool<Worker, Data, Response>,
    opts: WorkerChoiceStrategyOptions = DEFAULT_WORKER_CHOICE_STRATEGY_OPTIONS
  ) {
    super(pool, opts)
    this.setTaskStatisticsRequirements(this.opts)
  }

  /** @inheritDoc */
  public reset (): boolean {
    return true
  }

  /** @inheritDoc */
  public update (): boolean {
    return true
  }

  /** @inheritDoc */
  public choose (): number | undefined {
    this.nextWorkerNodeKey = this.leastUsedNextWorkerNodeKey()
    return this.nextWorkerNodeKey
  }

  /** @inheritDoc */
  public remove (): boolean {
    return true
  }

  private leastUsedNextWorkerNodeKey (): number | undefined {
    let minNumberOfTasks = Infinity
    let chosenWorkerNodeKey: number | undefined
    for (const [workerNodeKey, workerNode] of this.pool.workerNodes.entries()) {
      if (!this.isWorkerNodeEligible(workerNodeKey)) {
        continue
      }
      const workerTaskStatistics = workerNode.usage.tasks
      const workerTasks =
        workerTaskStatistics.executed +
        workerTaskStatistics.executing +
        workerTaskStatistics.queued
      if (workerTasks === 0) {
        chosenWorkerNodeKey = workerNodeKey
        break
      } else if (workerTasks < minNumberOfTasks) {
        minNumberOfTasks = workerTasks
        chosenWorkerNodeKey = workerNodeKey
      }
    }
    return chosenWorkerNodeKey
  }
}