@bemoje/array 0.3.3 → 1.0.0

package/cjs/lib/arrAverage.js

@@ -1,22 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrAverage = void 0;
-const arrSum_1 = require("./arrSum");
-/**
- * Calculates the average of an array of numbers.
- * @returns The average of all numbers in the array.
- * @throws an error if the input array is empty.
- * @param array The array of numbers.
- * @example ```ts
- * const numbers = [1, 2, 3, 4, 5];
- * arrAverage(numbers);
- * //=> 3
- * ```
- */
-function arrAverage(array) {
-    if (!array.length)
-        throw new Error('Cannot take an average of zero values.');
-    return (0, arrSum_1.arrSum)(array) / array.length;
-}
-exports.arrAverage = arrAverage;
-//# sourceMappingURL=arrAverage.js.map

package/cjs/lib/arrAverage.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrAverage.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrAverage.ts"],"names":[],"mappings":";;;AAAA,qCAAiC;AAEjC;;;;;;;;;;GAUG;AACH,SAAgB,UAAU,CAAC,KAAe;IACxC,IAAI,CAAC,KAAK,CAAC,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAA;IAC5E,OAAO,IAAA,eAAM,EAAC,KAAK,CAAC,GAAG,KAAK,CAAC,MAAM,CAAA;AACrC,CAAC;AAHD,gCAGC"}

package/cjs/lib/arrEachToString.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrEachToString.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrEachToString.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,MAAM,EAAE,CAEvD"}

package/cjs/lib/arrEachToString.js

@@ -1,19 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrEachToString = void 0;
-/**
- * Coerce each element of an array to string.
- * @template T - The type of elements in the input array.
- * @returns A new array where each element is the string representation of the corresponding element in the input array.
- * @param array The array to iterate over.
- * @example ```ts
- * const numbers = [1, 2, 3];
- * arrEachToString(numbers);
- * //=> ['1', '2', '3']
- * ```
- */
-function arrEachToString(array) {
-    return array.map((element) => '' + element);
-}
-exports.arrEachToString = arrEachToString;
-//# sourceMappingURL=arrEachToString.js.map

package/cjs/lib/arrEachToString.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrEachToString.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrEachToString.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;GAUG;AACH,SAAgB,eAAe,CAAI,KAAU;IAC3C,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,GAAG,OAAO,CAAC,CAAA;AAC7C,CAAC;AAFD,0CAEC"}

package/cjs/lib/arrEvery.d.ts

@@ -1,18 +0,0 @@
-import { ArrayPredicate } from './types/ArrayPredicate';
-/**
- * Returns true if the predicate is satisfied for every element of the passed array; otherwise false.
- * @param input The array
- * @template T - The type of elements in the array.
- * @returns Returns `true` if all elements pass the predicate check, else `false`.
- * @param predicate A predicate callback function
- * @example ```ts
- * const numbers = [1, 2, 3, 4, 5];
- * const isEven = (num) => num % 2 === 0;
- * arrEvery(numbers, isEven);
- * //=> false
- * arrEvery(numbers, (num) => num > 0);
- * //=> true
- * ```
- */
-export declare function arrEvery<T>(input: Array<T>, predicate: ArrayPredicate<T>): boolean;
-//# sourceMappingURL=arrEvery.d.ts.map

package/cjs/lib/arrEvery.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrEvery.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrEvery.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAA;AAEvD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,OAAO,CAOlF"}

package/cjs/lib/arrEvery.js

@@ -1,28 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrEvery = void 0;
-/**
- * Returns true if the predicate is satisfied for every element of the passed array; otherwise false.
- * @param input The array
- * @template T - The type of elements in the array.
- * @returns Returns `true` if all elements pass the predicate check, else `false`.
- * @param predicate A predicate callback function
- * @example ```ts
- * const numbers = [1, 2, 3, 4, 5];
- * const isEven = (num) => num % 2 === 0;
- * arrEvery(numbers, isEven);
- * //=> false
- * arrEvery(numbers, (num) => num > 0);
- * //=> true
- * ```
- */
-function arrEvery(input, predicate) {
-    for (let i = 0, len = input.length; i < len; i++) {
-        if (predicate(input[i], i, input) === false) {
-            return false;
-        }
-    }
-    return true;
-}
-exports.arrEvery = arrEvery;
-//# sourceMappingURL=arrEvery.js.map

package/cjs/lib/arrEvery.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrEvery.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrEvery.ts"],"names":[],"mappings":";;;AAEA;;;;;;;;;;;;;;GAcG;AACH,SAAgB,QAAQ,CAAI,KAAe,EAAE,SAA4B;IACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QAChD,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,KAAK,KAAK,EAAE;YAC3C,OAAO,KAAK,CAAA;SACb;KACF;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAPD,4BAOC"}

package/cjs/lib/arrFindIndicesOf.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrFindIndicesOf.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFindIndicesOf.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,EAAE,CAQ/F"}

package/cjs/lib/arrFindIndicesOf.js

@@ -1,20 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrFindIndicesOf = void 0;
-/**
- * Returns an array of indices where the predicate function returns true for the corresponding element in the input array.
- * @param input - The array to search.
- * @param predicate - The function to test each element of the array.
- * @returns An array of indices where the predicate function returns true.
- */
-function arrFindIndicesOf(input, predicate) {
-    const result = [];
-    for (let i = 0; i < input.length; i++) {
-        if (predicate(input[i])) {
-            result.push(i);
-        }
-    }
-    return result;
-}
-exports.arrFindIndicesOf = arrFindIndicesOf;
-//# sourceMappingURL=arrFindIndicesOf.js.map

package/cjs/lib/arrFindIndicesOf.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrFindIndicesOf.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFindIndicesOf.ts"],"names":[],"mappings":";;;AAAA;;;;;GAKG;AACH,SAAgB,gBAAgB,CAAI,KAAe,EAAE,SAAgC;IACnF,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACrC,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;YACvB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;SACf;KACF;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AARD,4CAQC"}

package/cjs/lib/arrFindLast.d.ts

@@ -1,12 +0,0 @@
-/**
- * Searches for the last element in an array that satisfies a provided testing function.
- * @typeParam T - The type of elements in the input array.
- * @param input - The array to search within.
- * @param predicate - The function to test each element for a condition.
- * @returns The last element in the array that satisfies the provided testing function. Otherwise, undefined if no elements satisfy the testing function.
- * @example const numbers = [1, 2, 3, 4, 5, 6];
- * arrFindLast(numbers, num => num % 2 === 0);
- * //=> 6
- */
-export declare function arrFindLast<T>(input: Array<T>, predicate: (value: T) => boolean): T | undefined;
-//# sourceMappingURL=arrFindLast.d.ts.map

package/cjs/lib/arrFindLast.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrFindLast.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFindLast.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,GAAG,SAAS,CAO/F"}

package/cjs/lib/arrFindLast.js

@@ -1,23 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrFindLast = void 0;
-/**
- * Searches for the last element in an array that satisfies a provided testing function.
- * @typeParam T - The type of elements in the input array.
- * @param input - The array to search within.
- * @param predicate - The function to test each element for a condition.
- * @returns The last element in the array that satisfies the provided testing function. Otherwise, undefined if no elements satisfy the testing function.
- * @example const numbers = [1, 2, 3, 4, 5, 6];
- * arrFindLast(numbers, num => num % 2 === 0);
- * //=> 6
- */
-function arrFindLast(input, predicate) {
-    for (let i = input.length - 1; i >= 0; i--) {
-        if (predicate(input[i]) === true) {
-            return input[i];
-        }
-    }
-    return;
-}
-exports.arrFindLast = arrFindLast;
-//# sourceMappingURL=arrFindLast.js.map

package/cjs/lib/arrFindLast.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrFindLast.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFindLast.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;GASG;AACH,SAAgB,WAAW,CAAI,KAAe,EAAE,SAAgC;IAC9E,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1C,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;YAChC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAA;SAChB;KACF;IACD,OAAM;AACR,CAAC;AAPD,kCAOC"}

package/cjs/lib/arrFindLastIndexOf.d.ts

@@ -1,14 +0,0 @@
-/**
- * Searches for an element in an array in reverse order and returns the index of the last occurrence of the element for which the provided testing function returns true.
- * If no such element is found, it returns -1.
- * @param input - The array to search in.
- * @param predicate - The testing function. Takes a value and returns a boolean.
- * @returns The index of the last occurrence of the element in the array that passes the test. If no such element is found, it returns -1.
- * @example ```ts
- * const arr = [1, 2, 3, 4, 5, 4, 3];
- * arrFindLastIndexOf(arr, (value) => value === 4);
- * //=> 5
- * ```
- */
-export declare function arrFindLastIndexOf<T>(input: Array<T>, predicate: (value: T) => boolean): number;
-//# sourceMappingURL=arrFindLastIndexOf.d.ts.map

package/cjs/lib/arrFindLastIndexOf.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrFindLastIndexOf.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFindLastIndexOf.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAO/F"}

package/cjs/lib/arrFindLastIndexOf.js

@@ -1,25 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrFindLastIndexOf = void 0;
-/**
- * Searches for an element in an array in reverse order and returns the index of the last occurrence of the element for which the provided testing function returns true.
- * If no such element is found, it returns -1.
- * @param input - The array to search in.
- * @param predicate - The testing function. Takes a value and returns a boolean.
- * @returns The index of the last occurrence of the element in the array that passes the test. If no such element is found, it returns -1.
- * @example ```ts
- * const arr = [1, 2, 3, 4, 5, 4, 3];
- * arrFindLastIndexOf(arr, (value) => value === 4);
- * //=> 5
- * ```
- */
-function arrFindLastIndexOf(input, predicate) {
-    for (let i = input.length - 1; i >= 0; i--) {
-        if (predicate(input[i])) {
-            return i;
-        }
-    }
-    return -1;
-}
-exports.arrFindLastIndexOf = arrFindLastIndexOf;
-//# sourceMappingURL=arrFindLastIndexOf.js.map

package/cjs/lib/arrFindLastIndexOf.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrFindLastIndexOf.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFindLastIndexOf.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;GAWG;AACH,SAAgB,kBAAkB,CAAI,KAAe,EAAE,SAAgC;IACrF,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1C,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;YACvB,OAAO,CAAC,CAAA;SACT;KACF;IACD,OAAO,CAAC,CAAC,CAAA;AACX,CAAC;AAPD,gDAOC"}

package/cjs/lib/arrFlatten.d.ts

@@ -1,17 +0,0 @@
-import { NestedArray } from './types/NestedArray';
-/**
- * Flattens the passed array recursively to a specified depth. Immutable.
- * @param input the array to flatten
- * @template T - The type of the elements in the input array.
- * @param - The maximum depth to flatten. Defaults to the maximum safe integer.
- * @returns The flattened array.
- * @throws If the input is not an array.
- * @param maxDepth the maximum recursive flattening depth.
- * @example ```ts
- * const nestedArray = [[1, 2], [3, [4, 5]], [6]];
- * arrFlatten(nestedArray, 1);
- * //=> [1, 2, 3, [4, 5], 6]
- * ```
- */
-export declare function arrFlatten<T>(input: NestedArray<T>, maxDepth?: number): Array<T>;
-//# sourceMappingURL=arrFlatten.d.ts.map

package/cjs/lib/arrFlatten.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrFlatten.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFlatten.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAA;AAEjD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,QAAQ,SAA0B,GAAG,KAAK,CAAC,CAAC,CAAC,CAajG"}

package/cjs/lib/arrFlatten.js

@@ -1,34 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrFlatten = void 0;
-/**
- * Flattens the passed array recursively to a specified depth. Immutable.
- * @param input the array to flatten
- * @template T - The type of the elements in the input array.
- * @param - The maximum depth to flatten. Defaults to the maximum safe integer.
- * @returns The flattened array.
- * @throws If the input is not an array.
- * @param maxDepth the maximum recursive flattening depth.
- * @example ```ts
- * const nestedArray = [[1, 2], [3, [4, 5]], [6]];
- * arrFlatten(nestedArray, 1);
- * //=> [1, 2, 3, [4, 5], 6]
- * ```
- */
-function arrFlatten(input, maxDepth = Number.MAX_SAFE_INTEGER) {
-    const accum = [];
-    function recurse(arr, depth) {
-        for (let i = 0; i < arr.length; i++) {
-            if (Array.isArray(arr[i]) && depth < maxDepth) {
-                recurse(arr[i], depth + 1);
-            }
-            else {
-                accum.push(arr[i]);
-            }
-        }
-    }
-    recurse(input, 0);
-    return accum;
-}
-exports.arrFlatten = arrFlatten;
-//# sourceMappingURL=arrFlatten.js.map

package/cjs/lib/arrFlatten.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrFlatten.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrFlatten.ts"],"names":[],"mappings":";;;AAEA;;;;;;;;;;;;;GAaG;AACH,SAAgB,UAAU,CAAI,KAAqB,EAAE,QAAQ,GAAG,MAAM,CAAC,gBAAgB;IACrF,MAAM,KAAK,GAAQ,EAAE,CAAA;IACrB,SAAS,OAAO,CAAC,GAAmB,EAAE,KAAa;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACnC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,QAAQ,EAAE;gBAC7C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;aAClC;iBAAM;gBACL,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAM,CAAC,CAAA;aACxB;SACF;IACH,CAAC;IACD,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;IACjB,OAAO,KAAK,CAAA;AACd,CAAC;AAbD,gCAaC"}

package/cjs/lib/arrHasDuplicates.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrHasDuplicates.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrHasDuplicates.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,OAAO,CAOrD"}

package/cjs/lib/arrHasDuplicates.js

@@ -1,20 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrHasDuplicates = void 0;
-/**
- * Checks if an array has any duplicate elements.
- * @param arr - The array to check for duplicates.
- * @returns A boolean indicating whether the array has duplicates.
- * @typeParam T - The type of elements in the array.
- */
-function arrHasDuplicates(arr) {
-    const seen = new Set();
-    for (const e of arr) {
-        if (seen.has(e))
-            return true;
-        seen.add(e);
-    }
-    return false;
-}
-exports.arrHasDuplicates = arrHasDuplicates;
-//# sourceMappingURL=arrHasDuplicates.js.map

package/cjs/lib/arrHasDuplicates.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrHasDuplicates.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrHasDuplicates.ts"],"names":[],"mappings":";;;AAAA;;;;;GAKG;AACH,SAAgB,gBAAgB,CAAI,GAAQ;IAC1C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAA;IACzB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE;QACnB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAA;QAC5B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;KACZ;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAPD,4CAOC"}

package/cjs/lib/arrIndicesOf.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrIndicesOf.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrIndicesOf.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,MAAM,EAAE,CAQrE"}

package/cjs/lib/arrIndicesOf.js

@@ -1,27 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrIndicesOf = void 0;
-/**
- * Returns all indexes at which an element is found.
- * @param input The array to search
- * @template T - The type of elements in the input array.
- * @returns An array of indices where the specified element can be found.
- * @param element The element to find
- * @example ```ts
- *  const inputArray = [1, 2, 3, 2, 4, 2, 5];
- *  const elementToFind = 2;
- *  arrIndicesOf(inputArray, elementToFind);
- *  //=> [1, 3, 5]
- *  ```
- */
-function arrIndicesOf(input, element) {
-    const result = [];
-    for (let i = 0; i < input.length; i++) {
-        if (element === input[i]) {
-            result.push(i);
-        }
-    }
-    return result;
-}
-exports.arrIndicesOf = arrIndicesOf;
-//# sourceMappingURL=arrIndicesOf.js.map

package/cjs/lib/arrIndicesOf.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrIndicesOf.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrIndicesOf.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;GAYG;AACH,SAAgB,YAAY,CAAI,KAAe,EAAE,OAAU;IACzD,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACrC,IAAI,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE;YACxB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;SACf;KACF;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AARD,oCAQC"}

package/cjs/lib/arrLast.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrLast.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrLast.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAGxC"}

package/cjs/lib/arrLast.js

@@ -1,21 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrLast = void 0;
-/**
- * Returns the last element of an array.
- * Throws an error if the array is empty.
- * @template T The type of elements in the array.
- * @param array The array to get the last element from.
- * @returns The last element of the array.
- * @throws If the array is empty.
- * @example const numbers = [1, 2, 3, 4, 5];
- * const lastNumber = arrLast(numbers);
- * //=> 5
- */
-function arrLast(array) {
-    if (!array.length)
-        throw new Error('Cannot get last element of empty array.');
-    return array[array.length - 1];
-}
-exports.arrLast = arrLast;
-//# sourceMappingURL=arrLast.js.map

package/cjs/lib/arrLast.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrLast.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrLast.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;GAUG;AACH,SAAgB,OAAO,CAAI,KAAU;IACnC,IAAI,CAAC,KAAK,CAAC,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAA;IAC7E,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AAChC,CAAC;AAHD,0BAGC"}

package/cjs/lib/arrMapMutable.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrMapMutable.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrMapMutable.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAEhE;;;;;;;;;;GAUG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAKpF"}

package/cjs/lib/arrMapMutable.js

@@ -1,22 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrMapMutable = void 0;
-/**
- * This function takes an array and a callback function as arguments. It applies the callback function to each element of the array, mutating the original array in the process.
- * @template T The type of elements in the input array.
- * @param input The array to be mapped over.
- * @param f The callback function to be applied to each element of the array. This function takes three arguments: the current element, its index, and the original array.
- * @returns The original array, mutated by the callback function.
- * @example ```ts
- * arrMapMutable([1, 2, 3], (value: number) => value * 2);
- * //=> [2, 4, 6]
- * ```
- */
-function arrMapMutable(input, f) {
-    for (let i = 0; i < input.length; i++) {
-        input[i] = f(input[i], i, input);
-    }
-    return input;
-}
-exports.arrMapMutable = arrMapMutable;
-//# sourceMappingURL=arrMapMutable.js.map

package/cjs/lib/arrMapMutable.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrMapMutable.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrMapMutable.ts"],"names":[],"mappings":";;;AAEA;;;;;;;;;;GAUG;AACH,SAAgB,aAAa,CAAI,KAAe,EAAE,CAAwB;IACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACrC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;KACjC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AALD,sCAKC"}

package/cjs/lib/arrObjectsToTable.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrObjectsToTable.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrObjectsToTable.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,CAAC,EACpC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,EACxC,OAAO,GAAE;IACP,OAAO,CAAC,EAAE,MAAM,EAAE,CAAA;IAClB,SAAS,CAAC,EAAE,CAAC,CAAA;CACT,GACL,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAW9B"}

package/cjs/lib/arrObjectsToTable.js

@@ -1,36 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrObjectsToTable = void 0;
-const arrObjectsUniqueKeys_1 = require("./arrObjectsUniqueKeys");
-/**
- * Convert an array of objects to a two-dimensional table.
- * @param objects The array of objects to convert to a table.
- * @template T - The type of the values in the objects.
- * @param options.headers An optional array of strings specifying the headers (property names) to use. If not provided, the function will use all unique keys found in the objects.
- * @param options.emptyCell An optional value to use for empty cells. If not provided, the function will use `undefined`.
- * @returns A 2D array (table) where each row represents an object and each column represents a property of the object.
- * @param options The options for converting the objects to a table.
- * @example ```ts
- * arrObjectsToTable(
- *   [
- *     { a: 1, b: 2 },
- *     { a: 3, b: 4, c: 5 },
- *   ],
- *   { emptyCell:1 },
- * ) //=> [ [ 'a', 'b', 'c' ], [ 1, 2,1 ], [ 3, 4, 5 ] ]
- * ```
- */
-function arrObjectsToTable(objects, options = {}) {
-    const headers = options?.headers?.slice() || (0, arrObjectsUniqueKeys_1.arrObjectsUniqueKeys)(objects);
-    const table = [headers];
-    for (const o of objects) {
-        const row = headers.map((header) => {
-            const value = o[header];
-            return value !== undefined ? value : options.emptyCell;
-        });
-        table.push(row);
-    }
-    return table;
-}
-exports.arrObjectsToTable = arrObjectsToTable;
-//# sourceMappingURL=arrObjectsToTable.js.map

package/cjs/lib/arrObjectsToTable.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrObjectsToTable.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrObjectsToTable.ts"],"names":[],"mappings":";;;AAAA,iEAA6D;AAE7D;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAgB,iBAAiB,CAC/B,OAAwC,EACxC,UAGI,EAAE;IAEN,MAAM,OAAO,GAAG,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,IAAA,2CAAoB,EAAC,OAAO,CAAC,CAAA;IAC1E,MAAM,KAAK,GAAiC,CAAC,OAAO,CAAC,CAAA;IACrD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE;QACvB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;YACjC,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,CAAA;YACvB,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,OAAO,CAAC,SAAe,CAAA;QAC/D,CAAC,CAAC,CAAA;QACF,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;KAChB;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAjBD,8CAiBC"}

package/cjs/lib/arrObjectsUniqueKeys.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrObjectsUniqueKeys.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrObjectsUniqueKeys.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,CAQ9E"}

package/cjs/lib/arrObjectsUniqueKeys.js

@@ -1,29 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrObjectsUniqueKeys = void 0;
-/**
- * Returns an array of all unique object keys found in an array of objects.
- * @template T - The type of values in the input objects.
- * @returns An array of unique keys present in the input objects.
- * @param objects The array of objects.
- * @example ```ts
- * const objects = [
- *   { name: 'John', age: 25 },
- *   { name: 'Jane', gender: 'female' },
- *   { name: 'Bob', age: 30, gender: 'male' },
- * ];
- * arrObjectsUniqueKeys(objects);
- * //=> ['name', 'age', 'gender']
- * ```
- */
-function arrObjectsUniqueKeys(objects) {
-    const keys = new Set();
-    for (const o of objects) {
-        for (const key of Object.keys(o)) {
-            keys.add(key);
-        }
-    }
-    return Array.from(keys);
-}
-exports.arrObjectsUniqueKeys = arrObjectsUniqueKeys;
-//# sourceMappingURL=arrObjectsUniqueKeys.js.map

package/cjs/lib/arrObjectsUniqueKeys.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrObjectsUniqueKeys.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrObjectsUniqueKeys.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;;;GAcG;AACH,SAAgB,oBAAoB,CAAI,OAA4B;IAClE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE;QACvB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;YAChC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;SACd;KACF;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACzB,CAAC;AARD,oDAQC"}

package/cjs/lib/arrRemove.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrRemove.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrRemove.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,eAAe,EAAE,CAAC,GAAG,CAAC,EAAE,CAE9D"}

package/cjs/lib/arrRemove.js

@@ -1,11 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrRemove = void 0;
-/**
- * Remove a given element from a copy of a given array and return the resulting array.
- */
-function arrRemove(arr, elementToRemove) {
-    return arr.filter((element) => element !== elementToRemove);
-}
-exports.arrRemove = arrRemove;
-//# sourceMappingURL=arrRemove.js.map

package/cjs/lib/arrRemove.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrRemove.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrRemove.ts"],"names":[],"mappings":";;;AAAA;;GAEG;AACH,SAAgB,SAAS,CAAI,GAAQ,EAAE,eAAkB;IACvD,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,KAAK,eAAe,CAAC,CAAA;AAC7D,CAAC;AAFD,8BAEC"}

package/cjs/lib/arrRemoveDuplicates.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrRemoveDuplicates.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrRemoveDuplicates.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAEtD"}

package/cjs/lib/arrRemoveDuplicates.js

@@ -1,20 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrRemoveDuplicates = void 0;
-/**
- * Remove duplicates from an array
- * @remarks This function uses the JavaScript Set object to remove duplicate values from an array.
- * @typeparam T - The type of elements in the array.
- * @returns The new array with duplicates removed.
- * @param array The array from which to remove duplicates.
- * @example ```ts
- * const array = [1, 2, 2, 3, 4, 4, 5];
- * arrRemoveDuplicates(array);
- * //=> [1, 2, 3, 4, 5]
- * ```
- */
-function arrRemoveDuplicates(array) {
-    return Array.from(new Set(array));
-}
-exports.arrRemoveDuplicates = arrRemoveDuplicates;
-//# sourceMappingURL=arrRemoveDuplicates.js.map

package/cjs/lib/arrRemoveDuplicates.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrRemoveDuplicates.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrRemoveDuplicates.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;GAWG;AACH,SAAgB,mBAAmB,CAAI,KAAU;IAC/C,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;AACnC,CAAC;AAFD,kDAEC"}

package/cjs/lib/arrRemoveMutable.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrRemoveMutable.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrRemoveMutable.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,eAAe,EAAE,CAAC,GAAG,IAAI,CAMtE"}

package/cjs/lib/arrRemoveMutable.js

@@ -1,15 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrRemoveMutable = void 0;
-/**
- * Remove elements in-place from an array.
- */
-function arrRemoveMutable(arr, elementToRemove) {
-    let index = arr.indexOf(elementToRemove);
-    while (index !== -1) {
-        arr.splice(index, 1);
-        index = arr.indexOf(elementToRemove);
-    }
-}
-exports.arrRemoveMutable = arrRemoveMutable;
-//# sourceMappingURL=arrRemoveMutable.js.map

package/cjs/lib/arrRemoveMutable.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrRemoveMutable.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrRemoveMutable.ts"],"names":[],"mappings":";;;AAAA;;GAEG;AACH,SAAgB,gBAAgB,CAAI,GAAQ,EAAE,eAAkB;IAC9D,IAAI,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,eAAe,CAAC,CAAA;IACxC,OAAO,KAAK,KAAK,CAAC,CAAC,EAAE;QACnB,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;QACpB,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,eAAe,CAAC,CAAA;KACrC;AACH,CAAC;AAND,4CAMC"}

package/cjs/lib/arrShallowEquals.d.ts

@@ -1,16 +0,0 @@
-/**
- * This function compares the length of the two arrays and then checks if each element at the corresponding index is equal.
- * @param input1 The first array to compare.
- * @template T - The type of the elements in the arrays.
- * @returns A boolean indicating whether the two arrays are shallowly equal.
- * @param input2 The second array to compare.
- * Checks if two arrays are shallowly equal.
- * @example ```ts
- * arrShallowEquals([1, 2, 3], [1, 2, 3]);
- * //=> true
- * arrShallowEquals([1, 2, 3], [1, 2, 4]);
- * //=> false
- * ```
- */
-export declare function arrShallowEquals<T>(input1: T[], input2: T[]): boolean;
-//# sourceMappingURL=arrShallowEquals.d.ts.map

package/cjs/lib/arrShallowEquals.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrShallowEquals.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrShallowEquals.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;GAaG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,OAAO,CAGrE"}