repositories
/
poolifier.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
fix: fix workey weights input validation
[poolifier.git]
/
src
/
pools
/
selection-strategies
/
less-used-worker-choice-strategy.ts
diff --git
a/src/pools/selection-strategies/less-used-worker-choice-strategy.ts
b/src/pools/selection-strategies/less-used-worker-choice-strategy.ts
index 166de7069f60f32d1f396576fd8416e9ba87907d..a8daa7b9f43d05e871cf38e0822cb986ba671239 100644
(file)
--- a/
src/pools/selection-strategies/less-used-worker-choice-strategy.ts
+++ b/
src/pools/selection-strategies/less-used-worker-choice-strategy.ts
@@
-1,6
+1,11
@@
+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 { IWorker } from '../worker'
import { AbstractWorkerChoiceStrategy } from './abstract-worker-choice-strategy'
-import type { IWorkerChoiceStrategy } from './selection-strategies-types'
+import type {
+ IWorkerChoiceStrategy,
+ WorkerChoiceStrategyOptions
+} from './selection-strategies-types'
/**
* Selects the less used worker.
/**
* Selects the less used worker.
@@
-16,34
+21,48
@@
export class LessUsedWorkerChoiceStrategy<
>
extends AbstractWorkerChoiceStrategy<Worker, Data, Response>
implements IWorkerChoiceStrategy {
>
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.setRequiredStatistics(this.opts)
+ }
+
/** @inheritDoc */
public reset (): boolean {
return true
}
/** @inheritDoc */
public reset (): boolean {
return true
}
+ /** @inheritDoc */
+ public update (): boolean {
+ return true
+ }
+
/** @inheritDoc */
public choose (): number {
/** @inheritDoc */
public choose (): number {
- const freeWorkerNodeKey = this.
pool.
findFreeWorkerNodeKey()
+ const freeWorkerNodeKey = this.findFreeWorkerNodeKey()
if (freeWorkerNodeKey !== -1) {
return freeWorkerNodeKey
}
let minNumberOfTasks = Infinity
let lessUsedWorkerNodeKey!: number
if (freeWorkerNodeKey !== -1) {
return freeWorkerNodeKey
}
let minNumberOfTasks = Infinity
let lessUsedWorkerNodeKey!: number
- for (const [
index
, workerNode] of this.pool.workerNodes.entries()) {
+ for (const [
workerNodeKey
, workerNode] of this.pool.workerNodes.entries()) {
const tasksUsage = workerNode.tasksUsage
const workerTasks = tasksUsage.run + tasksUsage.running
if (workerTasks === 0) {
const tasksUsage = workerNode.tasksUsage
const workerTasks = tasksUsage.run + tasksUsage.running
if (workerTasks === 0) {
- return
index
+ return
workerNodeKey
} else if (workerTasks < minNumberOfTasks) {
minNumberOfTasks = workerTasks
} else if (workerTasks < minNumberOfTasks) {
minNumberOfTasks = workerTasks
- lessUsedWorkerNodeKey =
index
+ lessUsedWorkerNodeKey =
workerNodeKey
}
}
return lessUsedWorkerNodeKey
}
/** @inheritDoc */
}
}
return lessUsedWorkerNodeKey
}
/** @inheritDoc */
- public remove (
workerNodeKey: number
): boolean {
+ public remove (): boolean {
return true
}
}
return true
}
}