X-Git-Url: https://git.piment-noir.org/?a=blobdiff_plain;f=src%2Futils.ts;h=a6f5fbcc5b729b98f5dec1da1de8178eff830d40;hb=a97f9c80aa49c6152547fb6fa8de4b0f089c2353;hp=fc328a6c688e2d85f04a04be0e4874584ad5c57c;hpb=bbeadd16bc03b9199221a7fb5732af46e7867ded;p=poolifier.git diff --git a/src/utils.ts b/src/utils.ts index fc328a6c..a6f5fbcc 100644 --- a/src/utils.ts +++ b/src/utils.ts @@ -1,4 +1,8 @@ -import type { WorkerChoiceStrategyOptions } from './pools/selection-strategies/selection-strategies-types' +import os from 'node:os' +import type { + MeasurementStatisticsRequirements, + WorkerChoiceStrategyOptions +} from './pools/selection-strategies/selection-strategies-types' /** * An intentional empty function. @@ -12,9 +16,37 @@ export const EMPTY_FUNCTION: () => void = Object.freeze(() => { */ export const DEFAULT_WORKER_CHOICE_STRATEGY_OPTIONS: WorkerChoiceStrategyOptions = { - medRunTime: false + runTime: { median: false }, + waitTime: { median: false }, + elu: { median: false } } +/** + * Default measurement statistics requirements. + */ +export const DEFAULT_MEASUREMENT_STATISTICS_REQUIREMENTS: MeasurementStatisticsRequirements = + { + aggregate: false, + average: false, + median: false + } + +/** + * Safe helper to get the host OS optimized maximum pool size. + */ +export const availableParallelism = (): number => { + let availableParallelism = 1 + try { + availableParallelism = os.availableParallelism() + } catch { + const cpus = os.cpus() + if (Array.isArray(cpus) && cpus.length > 0) { + availableParallelism = cpus.length + } + } + return availableParallelism +} + /** * Compute the median of the given data set. * @@ -22,13 +54,28 @@ export const DEFAULT_WORKER_CHOICE_STRATEGY_OPTIONS: WorkerChoiceStrategyOptions * @returns The median of the given data set. */ export const median = (dataSet: number[]): number => { + if (Array.isArray(dataSet) && dataSet.length === 0) { + return 0 + } if (Array.isArray(dataSet) && dataSet.length === 1) { return dataSet[0] } const sortedDataSet = dataSet.slice().sort((a, b) => a - b) - const middleIndex = Math.floor(sortedDataSet.length / 2) - if (sortedDataSet.length % 2 === 0) { - return sortedDataSet[middleIndex / 2] - } - return (sortedDataSet[middleIndex - 1] + sortedDataSet[middleIndex]) / 2 + return ( + (sortedDataSet[(sortedDataSet.length - 1) >> 1] + + sortedDataSet[sortedDataSet.length >> 1]) / + 2 + ) } + +/** + * Is the given object a plain object? + * + * @param obj - The object to check. + * @returns `true` if the given object is a plain object, `false` otherwise. + */ +export const isPlainObject = (obj: unknown): boolean => + typeof obj === 'object' && + obj !== null && + obj?.constructor === Object && + Object.prototype.toString.call(obj) === '[object Object]'