import clone from 'just-clone';
-import { Constants } from './internal';
+import { Constants } from './Constants';
import { WebSocketCloseEventStatusString } from '../types';
export class Utils {
return clone<T>(object);
}
- public static objectHasOwnProperty(object: unknown, property: string): boolean {
+ public static hasOwnProp(object: unknown, property: PropertyKey): boolean {
return Utils.isObject(object) && Object.hasOwn(object as object, property);
}
public static isCFEnvironment(): boolean {
- return process.env.VCAP_APPLICATION !== undefined;
+ return !Utils.isNullOrUndefined(process.env.VCAP_APPLICATION);
}
public static isIterable<T>(obj: T): boolean {
return value == null;
}
- public static isEmptyArray(object: unknown | unknown[]): boolean {
- if (Array.isArray(object) && object.length === 0) {
- return true;
- }
- return false;
+ public static isEmptyArray(object: unknown): boolean {
+ return Array.isArray(object) && object.length === 0;
}
- public static isNotEmptyArray(object: unknown | unknown[]): boolean {
- if (Array.isArray(object) && object.length > 0) {
- return true;
- }
- return false;
+ public static isNotEmptyArray(object: unknown): boolean {
+ return Array.isArray(object) && object.length > 0;
}
public static isEmptyObject(obj: object): boolean {
* @param retryNumber - the number of retries that have already been attempted
* @returns delay in milliseconds
*/
- public static exponentialDelay(retryNumber = 0): number {
+ public static exponentialDelay(retryNumber = 0, maxDelayRatio = 0.2): number {
const delay = Math.pow(2, retryNumber) * 100;
- const randomSum = delay * 0.2 * Utils.secureRandom(); // 0-20% of the delay
+ const randomSum = delay * maxDelayRatio * Utils.secureRandom(); // 0-20% of the delay
return delay + randomSum;
}
}
return '(Unknown)';
}
+
+ public static median(dataSet: number[]): number {
+ if (Utils.isEmptyArray(dataSet)) {
+ return 0;
+ }
+ if (Array.isArray(dataSet) === true && dataSet.length === 1) {
+ return dataSet[0];
+ }
+ const sortedDataSet = dataSet.slice().sort((a, b) => a - b);
+ return (
+ (sortedDataSet[(sortedDataSet.length - 1) >> 1] + sortedDataSet[sortedDataSet.length >> 1]) /
+ 2
+ );
+ }
+
+ // TODO: use order statistics tree https://en.wikipedia.org/wiki/Order_statistic_tree
+ public static percentile(dataSet: number[], percentile: number): number {
+ if (percentile < 0 && percentile > 100) {
+ throw new RangeError('Percentile is not between 0 and 100');
+ }
+ if (Utils.isEmptyArray(dataSet)) {
+ return 0;
+ }
+ const sortedDataSet = dataSet.slice().sort((a, b) => a - b);
+ if (percentile === 0 || sortedDataSet.length === 1) {
+ return sortedDataSet[0];
+ }
+ if (percentile === 100) {
+ return sortedDataSet[sortedDataSet.length - 1];
+ }
+ const percentileIndexBase = (percentile / 100) * (sortedDataSet.length - 1);
+ const percentileIndexInteger = Math.floor(percentileIndexBase);
+ if (!Utils.isNullOrUndefined(sortedDataSet[percentileIndexInteger + 1])) {
+ return (
+ sortedDataSet[percentileIndexInteger] +
+ (percentileIndexBase - percentileIndexInteger) *
+ (sortedDataSet[percentileIndexInteger + 1] - sortedDataSet[percentileIndexInteger])
+ );
+ }
+ return sortedDataSet[percentileIndexInteger];
+ }
+
+ public static stdDeviation(dataSet: number[]): number {
+ let totalDataSet = 0;
+ for (const data of dataSet) {
+ totalDataSet += data;
+ }
+ const dataSetMean = totalDataSet / dataSet.length;
+ let totalGeometricDeviation = 0;
+ for (const data of dataSet) {
+ const deviation = data - dataSetMean;
+ totalGeometricDeviation += deviation * deviation;
+ }
+ return Math.sqrt(totalGeometricDeviation / dataSet.length);
+ }
}