mirror of
https://github.com/bpatrik/pigallery2.git
synced 2024-11-24 08:42:24 +02:00
198 lines
4.8 KiB
TypeScript
198 lines
4.8 KiB
TypeScript
export class Utils {
|
|
static chunkArrays<T>(arr: T[], chunkSize: number): T[][] {
|
|
const R = [];
|
|
for (let i = 0; i < arr.length; i += chunkSize) {
|
|
R.push(arr.slice(i, i + chunkSize));
|
|
}
|
|
return R;
|
|
}
|
|
|
|
static wait(time: number) {
|
|
return new Promise((resolve) => {
|
|
setTimeout(resolve, time);
|
|
});
|
|
}
|
|
|
|
|
|
static removeNullOrEmptyObj(obj: any) {
|
|
if (typeof obj !== 'object' || obj == null) {
|
|
return obj;
|
|
}
|
|
|
|
const keys = Object.keys(obj);
|
|
for (let i = 0; i < keys.length; i++) {
|
|
const key = keys[i];
|
|
if (obj[key] !== null && typeof obj[key] === 'object') {
|
|
if (Utils.removeNullOrEmptyObj(obj[key])) {
|
|
if (Object.keys(obj[key]).length === 0) {
|
|
delete obj[key];
|
|
}
|
|
}
|
|
} else if (obj[key] === null) {
|
|
delete obj[key];
|
|
}
|
|
}
|
|
return obj;
|
|
}
|
|
|
|
static clone<T>(object: T): T {
|
|
return JSON.parse(JSON.stringify(object));
|
|
}
|
|
|
|
static zeroPrefix(value: string | number, length: number) {
|
|
const ret = '00000' + value;
|
|
return ret.substr(ret.length - length);
|
|
}
|
|
|
|
static equalsFilter(object: any, filter: any): boolean {
|
|
if (typeof filter !== 'object' || filter == null) {
|
|
return object === filter;
|
|
}
|
|
if (!object) {
|
|
return false;
|
|
}
|
|
const keys = Object.keys(filter);
|
|
for (let i = 0; i < keys.length; i++) {
|
|
const key = keys[i];
|
|
if (typeof filter[key] === 'object') {
|
|
if (Utils.equalsFilter(object[key], filter[key]) === false) {
|
|
return false;
|
|
}
|
|
} else if (object[key] !== filter[key]) {
|
|
return false;
|
|
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
|
|
/**
|
|
*
|
|
* @param from
|
|
* @param to inclusive
|
|
* @returns {Array}
|
|
*/
|
|
static createRange(from: number, to: number): Array<number> {
|
|
const arr = new Array(to - from + 1);
|
|
let c = to - from + 1;
|
|
while (c--) {
|
|
arr[c] = to--;
|
|
}
|
|
return arr;
|
|
}
|
|
|
|
static concatUrls(...args: Array<string>) {
|
|
let url = '';
|
|
for (let i = 0; i < args.length; i++) {
|
|
if (args[i] === '' || typeof args[i] === 'undefined') {
|
|
continue;
|
|
}
|
|
|
|
const part = args[i].replace(new RegExp('\\\\', 'g'), '/');
|
|
if (part === '/' || part === './') {
|
|
continue;
|
|
}
|
|
|
|
url += part + '/';
|
|
}
|
|
url = url.replace(new RegExp('/+', 'g'), '/');
|
|
|
|
if (url.trim() === '') {
|
|
url = './';
|
|
}
|
|
|
|
return url.substring(0, url.length - 1);
|
|
}
|
|
|
|
public static updateKeys(targetObject: any, sourceObject: any) {
|
|
Object.keys(sourceObject).forEach((key) => {
|
|
if (typeof targetObject[key] === 'undefined') {
|
|
return;
|
|
}
|
|
if (typeof targetObject[key] === 'object') {
|
|
Utils.updateKeys(targetObject[key], sourceObject[key]);
|
|
} else {
|
|
targetObject[key] = sourceObject[key];
|
|
}
|
|
});
|
|
}
|
|
|
|
public static setKeys(targetObject: any, sourceObject: any) {
|
|
Object.keys(sourceObject).forEach((key) => {
|
|
if (typeof targetObject[key] === 'object') {
|
|
Utils.setKeys(targetObject[key], sourceObject[key]);
|
|
} else {
|
|
targetObject[key] = sourceObject[key];
|
|
}
|
|
});
|
|
}
|
|
|
|
public static setKeysForced(targetObject: any, sourceObject: any) {
|
|
Object.keys(sourceObject).forEach((key) => {
|
|
if (typeof sourceObject[key] === 'object') {
|
|
if (typeof targetObject[key] === 'undefined') {
|
|
targetObject[key] = {};
|
|
}
|
|
Utils.setKeysForced(targetObject[key], sourceObject[key]);
|
|
} else {
|
|
targetObject[key] = sourceObject[key];
|
|
}
|
|
});
|
|
}
|
|
|
|
public static enumToArray(EnumType: any): Array<{
|
|
key: number;
|
|
value: string;
|
|
}> {
|
|
const arr: Array<{ key: number; value: string; }> = [];
|
|
for (const enumMember in EnumType) {
|
|
if (!EnumType.hasOwnProperty(enumMember)) {
|
|
continue;
|
|
}
|
|
const key = parseInt(enumMember, 10);
|
|
if (key >= 0) {
|
|
arr.push({key: key, value: EnumType[enumMember]});
|
|
}
|
|
}
|
|
return arr;
|
|
}
|
|
|
|
|
|
public static findClosest(number: number, arr: Array<number>) {
|
|
|
|
let curr = arr[0];
|
|
let diff = Math.abs(number - curr);
|
|
|
|
arr.forEach((value) => {
|
|
|
|
const newDiff = Math.abs(number - value);
|
|
|
|
if (newDiff < diff) {
|
|
diff = newDiff;
|
|
curr = value;
|
|
}
|
|
|
|
});
|
|
|
|
return curr;
|
|
}
|
|
|
|
public static isUInt32(value: number, max: number = 4294967295) {
|
|
return !isNaN(value) && value >= 0 && value <= max;
|
|
}
|
|
|
|
public static isInt32(value: number) {
|
|
return !isNaN(value) && value >= -2147483648 && value <= 2147483647;
|
|
}
|
|
|
|
public static isFloat32(value: number) {
|
|
const E = Math.pow(10, 38);
|
|
const nE = Math.pow(10, -38);
|
|
return !isNaN(value) && ((value >= -3.402823466 * E && value <= -1.175494351 * nE) ||
|
|
(value <= 3.402823466 * E && value >= 1.175494351 * nE));
|
|
}
|
|
|
|
}
|