quran/.next/server/chunks/5639.js

"use strict";
exports.id = 5639;
exports.ids = [5639];
exports.modules = {

/***/ 5639:
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

/* harmony export */ __webpack_require__.d(__webpack_exports__, {
/* harmony export */   "Hj": () => (/* binding */ areArraysEqual),
/* harmony export */   "sj": () => (/* binding */ removeItemFromArray),
/* harmony export */   "sp": () => (/* binding */ mergeTwoArraysUniquely)
/* harmony export */ });
/* unused harmony exports numbersToStringsArray, stringsToNumbersArray */
/**
 * Convert an array of numbers to an array of strings.
 *
 * @param {number[]} numbersArray
 * @returns {string[]}
 */ const numbersToStringsArray = (numbersArray)=>numbersArray.map((number)=>String(number));
/**
 * Convert an array of strings to an array of numbers.
 *
 * @param {string[]} stringsArray
 * @returns {number[]}
 */ const stringsToNumbersArray = (stringsArray)=>stringsArray.map((string)=>Number(string));
/**
 * Check whether 2 arrays are equal or not irrespective of
 * their order. We need to create a copy of both arrays first
 * since sort() overwrites the original array.
 *
 * @param {T[]} array1
 * @param {T[]} array2
 * @returns {boolean}
 */ const areArraysEqual = (array1, array2)=>{
    // If the arrays have different lengths, they are not equal
    if (array1?.length !== array2?.length) return false;
    // Create a map of the first array, with each element as a key and true as the value
    const array1Map = new Map();
    array1.map((item)=>array1Map.set(item, true));
    // Loop through the second array
    for(let i = 0; i < array2.length; i += 1){
        // If an element in the second array is not found in the map of the first array, they are not equal
        if (array1Map.get(array2[i]) == null) return false;
        // Delete the element from the map of the first array
        array1Map.delete(array2[i]);
    }
    // If the map of the first array has no elements left, the arrays are equal
    return array1Map.size === 0;
};
/**
 * Remove `itemToRemove` from `array`
 *
 * @example
 * removeItemFromArray(1, [1,2,3]) // returns [2,3]
 *
 * @param {T} itemToRemove
 * @param {T[]} array
 * @returns {boolean}j
 */ const removeItemFromArray = (itemToRemove, array)=>array.filter((item)=>item !== itemToRemove);
/**
 * Merge items of two arrays where each item is unique.
 *
 * @param {T[]} array1
 * @param {T[]} array2
 * @returns {T[]}
 */ const mergeTwoArraysUniquely = (array1, array2)=>{
    return Array.from(new Set(array1.concat(array2)));
};


/***/ })

};
;
//# sourceMappingURL=5639.js.map