mirror of
https://github.com/sp-tarkov/server.git
synced 2025-02-13 09:50:43 -05:00
This is the result of running `npm run format` which applies the Biome formatting rules. Rejoice!
54 lines
1.6 KiB
TypeScript
54 lines
1.6 KiB
TypeScript
import { injectable } from "tsyringe";
|
|
|
|
@injectable()
|
|
export class CompareUtil {
|
|
private static typesToCheckAgainst = new Set<string>([
|
|
"string",
|
|
"number",
|
|
"boolean",
|
|
"bigint",
|
|
"symbol",
|
|
"undefined",
|
|
"null",
|
|
]);
|
|
|
|
/**
|
|
* This function does an object comparison, equivalent to applying reflections
|
|
* and scanning for all possible properties including arrays.
|
|
* @param v1 value 1 to compare
|
|
* @param v2 value 2 to compare
|
|
* @returns true if equal, false if not
|
|
*/
|
|
public recursiveCompare(v1: any, v2: any): boolean {
|
|
const typeOfv1 = typeof v1;
|
|
const typeOfv2 = typeof v2;
|
|
if (CompareUtil.typesToCheckAgainst.has(typeOfv1)) {
|
|
return v1 === v2;
|
|
}
|
|
if (typeOfv1 === "object" && typeOfv2 === "object") {
|
|
if (Array.isArray(v1)) {
|
|
if (!Array.isArray(v2)) {
|
|
return false;
|
|
}
|
|
const arr1 = v1 as Array<any>;
|
|
const arr2 = v2 as Array<any>;
|
|
if (arr1.length !== arr2.length) {
|
|
return false;
|
|
}
|
|
return arr1.every((vOf1) => arr2.find((vOf2) => this.recursiveCompare(vOf1, vOf2)));
|
|
}
|
|
for (const propOf1 in v1) {
|
|
if (v2[propOf1] === undefined) {
|
|
return false;
|
|
}
|
|
return this.recursiveCompare(v1[propOf1], v2[propOf1]);
|
|
}
|
|
}
|
|
if (typeOfv1 === typeOfv2) {
|
|
return v1 === v2;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
}
|