binary-type-tree
Version:
Binary Trees written in TypeScript
20 lines • 655 B
JavaScript
;
Object.defineProperty(exports, "__esModule", { value: true });
/**
* param a is compared against param b.
* @param {any[]} a
* @param {any[]} b
* @returns {boolean}
*/
exports.equalArray = (a, b) => {
let newA = a.sort();
let newB = b.sort();
newA = newA.map((v) => (Object.prototype.toString.call(v) === "[object Date]") ? v.getTime() : v);
newB = newB.map((v) => (Object.prototype.toString.call(v) === "[object Date]") ? v.getTime() : v);
let equal = true;
for (let i = 0; i < newA.length; i++) {
equal = equal && (newA[i] === newB[i]);
}
return equal;
};
//# sourceMappingURL=equalArray.js.map