@bemoje/array 0.3.3 → 1.0.1

package/package.json

@@ -1,14 +1,24 @@
 {
   "name": "@bemoje/array",
-  "version": "0.3.3",
-  "type": "commonjs",
-  "main": "cjs/index.js",
-  "types": "cjs/index.d.ts",
-  "dependencies": {
-    "tslib": "latest"
+  "version": "1.0.1",
+  "description": "Array utils",
+  "type": "module",
+  "sideEffects": false,
+  "keywords": [
+    "array"
+  ],
+  "exports": {
+    ".": {
+      "types": "./index.d.ts",
+      "import": "./index.mjs",
+      "default": "./index.mjs"
+    }
+  },
+  "dependencies": {},
+  "publishConfig": {
+    "access": "public"
   },
   "license": "MIT",
-  "keywords": [],
   "author": {
     "name": "Benjamin Møller Jensen",
     "email": "bemoje@bemoje.net",
@@ -16,14 +26,7 @@
   },
   "repository": {
     "type": "git",
-    "url": "git+https://github.com/bemoje/tsmono.git"
-  },
-  "funding": {
-    "type": "patreon",
-    "url": "https://www.patreon.com/user?u=40752770"
-  },
-  "bugs": {
-    "url": "https://github.com/bemoje/tsmono/issues"
-  },
-  "homepage": "https://github.com/bemoje/tsmono"
+    "url": "git+https://github.com/bemoje/mono.git",
+    "directory": "libs/array"
+  }
 }

package/LICENSE

@@ -1,21 +0,0 @@
-MIT License
-
-Copyright (c) 2023 Benjamin Møller Jensen
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.

package/README.md

@@ -1,34 +0,0 @@
-# @bemoje/array
-
-
-
-![npm (scoped)](https://img.shields.io/npm/v/%40bemoje/trie-map)
-![npm bundle size (scoped)](https://img.shields.io/bundlephobia/minzip/%40bemoje/array)
-![npm](https://img.shields.io/npm/dt/%40bemoje/array)
-![NPM](https://img.shields.io/npm/l/%40bemoje%2Farray)
-
-![GitHub last commit (by committer)](https://img.shields.io/github/last-commit/bemoje/tsmono)
-![GitHub closed pull requests](https://img.shields.io/github/issues-pr-closed/bemoje/tsmono)
-![GitHub top language](https://img.shields.io/github/languages/top/bemoje/tsmono)
-
-
-## Documentation
-[Documentation Website](https://bemoje.github.io/tsmono/modules/array.html)
-
-## Installation
-This library is published in the NPM registry and can be installed using any compatible package manager.
-
-#### NPM
-```sh
-npm install @bemoje/array
-```
-
-
-## Issues
-Please let me know of any bugs or [issues](https://github.com/bemoje/tsmono/issues).
-
-## Contribute
-Contributors are welcome to open a [pull request](https://github.com/bemoje/tsmono/pulls).
-
-## License
-Released under the [undefined License](./LICENSE).

package/cjs/index.d.ts

@@ -1,33 +0,0 @@
-export * from './lib/arrAverage';
-export * from './lib/arrEachToString';
-export * from './lib/arrEvery';
-export * from './lib/arrFindIndicesOf';
-export * from './lib/arrFindLast';
-export * from './lib/arrFindLastIndexOf';
-export * from './lib/arrFlatten';
-export * from './lib/arrHasDuplicates';
-export * from './lib/arrIndicesOf';
-export * from './lib/arrLast';
-export * from './lib/arrMapMutable';
-export * from './lib/arrObjectsToTable';
-export * from './lib/arrObjectsUniqueKeys';
-export * from './lib/arrRemove';
-export * from './lib/arrRemoveDuplicates';
-export * from './lib/arrRemoveMutable';
-export * from './lib/arrShallowEquals';
-export * from './lib/arrShuffle';
-export * from './lib/arrSome';
-export * from './lib/arrSortedInsertionIndex';
-export * from './lib/arrSortNumeric';
-export * from './lib/arrSum';
-export * from './lib/arrSwap';
-export * from './lib/arrTableAssertRowsSameLength';
-export * from './lib/arrTableEachToString';
-export * from './lib/arrTableRemoveColumns';
-export * from './lib/arrTableToCsv';
-export * from './lib/arrTableToObjects';
-export * from './lib/types/ArrayPredicate';
-export * from './lib/types/ArrayValueCallback';
-export * from './lib/types/ArrayVoidCallback';
-export * from './lib/types/NestedArray';
-//# sourceMappingURL=index.d.ts.map

package/cjs/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../packages/array/src/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAA;AAChC,cAAc,uBAAuB,CAAA;AACrC,cAAc,gBAAgB,CAAA;AAC9B,cAAc,wBAAwB,CAAA;AACtC,cAAc,mBAAmB,CAAA;AACjC,cAAc,0BAA0B,CAAA;AACxC,cAAc,kBAAkB,CAAA;AAChC,cAAc,wBAAwB,CAAA;AACtC,cAAc,oBAAoB,CAAA;AAClC,cAAc,eAAe,CAAA;AAC7B,cAAc,qBAAqB,CAAA;AACnC,cAAc,yBAAyB,CAAA;AACvC,cAAc,4BAA4B,CAAA;AAC1C,cAAc,iBAAiB,CAAA;AAC/B,cAAc,2BAA2B,CAAA;AACzC,cAAc,wBAAwB,CAAA;AACtC,cAAc,wBAAwB,CAAA;AACtC,cAAc,kBAAkB,CAAA;AAChC,cAAc,eAAe,CAAA;AAC7B,cAAc,+BAA+B,CAAA;AAC7C,cAAc,sBAAsB,CAAA;AACpC,cAAc,cAAc,CAAA;AAC5B,cAAc,eAAe,CAAA;AAC7B,cAAc,oCAAoC,CAAA;AAClD,cAAc,4BAA4B,CAAA;AAC1C,cAAc,6BAA6B,CAAA;AAC3C,cAAc,qBAAqB,CAAA;AACnC,cAAc,yBAAyB,CAAA;AACvC,cAAc,4BAA4B,CAAA;AAC1C,cAAc,gCAAgC,CAAA;AAC9C,cAAc,+BAA+B,CAAA;AAC7C,cAAc,yBAAyB,CAAA"}

package/cjs/index.js

@@ -1,36 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const tslib_1 = require("tslib");
-tslib_1.__exportStar(require("./lib/arrAverage"), exports);
-tslib_1.__exportStar(require("./lib/arrEachToString"), exports);
-tslib_1.__exportStar(require("./lib/arrEvery"), exports);
-tslib_1.__exportStar(require("./lib/arrFindIndicesOf"), exports);
-tslib_1.__exportStar(require("./lib/arrFindLast"), exports);
-tslib_1.__exportStar(require("./lib/arrFindLastIndexOf"), exports);
-tslib_1.__exportStar(require("./lib/arrFlatten"), exports);
-tslib_1.__exportStar(require("./lib/arrHasDuplicates"), exports);
-tslib_1.__exportStar(require("./lib/arrIndicesOf"), exports);
-tslib_1.__exportStar(require("./lib/arrLast"), exports);
-tslib_1.__exportStar(require("./lib/arrMapMutable"), exports);
-tslib_1.__exportStar(require("./lib/arrObjectsToTable"), exports);
-tslib_1.__exportStar(require("./lib/arrObjectsUniqueKeys"), exports);
-tslib_1.__exportStar(require("./lib/arrRemove"), exports);
-tslib_1.__exportStar(require("./lib/arrRemoveDuplicates"), exports);
-tslib_1.__exportStar(require("./lib/arrRemoveMutable"), exports);
-tslib_1.__exportStar(require("./lib/arrShallowEquals"), exports);
-tslib_1.__exportStar(require("./lib/arrShuffle"), exports);
-tslib_1.__exportStar(require("./lib/arrSome"), exports);
-tslib_1.__exportStar(require("./lib/arrSortedInsertionIndex"), exports);
-tslib_1.__exportStar(require("./lib/arrSortNumeric"), exports);
-tslib_1.__exportStar(require("./lib/arrSum"), exports);
-tslib_1.__exportStar(require("./lib/arrSwap"), exports);
-tslib_1.__exportStar(require("./lib/arrTableAssertRowsSameLength"), exports);
-tslib_1.__exportStar(require("./lib/arrTableEachToString"), exports);
-tslib_1.__exportStar(require("./lib/arrTableRemoveColumns"), exports);
-tslib_1.__exportStar(require("./lib/arrTableToCsv"), exports);
-tslib_1.__exportStar(require("./lib/arrTableToObjects"), exports);
-tslib_1.__exportStar(require("./lib/types/ArrayPredicate"), exports);
-tslib_1.__exportStar(require("./lib/types/ArrayValueCallback"), exports);
-tslib_1.__exportStar(require("./lib/types/ArrayVoidCallback"), exports);
-tslib_1.__exportStar(require("./lib/types/NestedArray"), exports);
-//# sourceMappingURL=index.js.map

package/cjs/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../packages/array/src/index.ts"],"names":[],"mappings":";;;AAAA,2DAAgC;AAChC,gEAAqC;AACrC,yDAA8B;AAC9B,iEAAsC;AACtC,4DAAiC;AACjC,mEAAwC;AACxC,2DAAgC;AAChC,iEAAsC;AACtC,6DAAkC;AAClC,wDAA6B;AAC7B,8DAAmC;AACnC,kEAAuC;AACvC,qEAA0C;AAC1C,0DAA+B;AAC/B,oEAAyC;AACzC,iEAAsC;AACtC,iEAAsC;AACtC,2DAAgC;AAChC,wDAA6B;AAC7B,wEAA6C;AAC7C,+DAAoC;AACpC,uDAA4B;AAC5B,wDAA6B;AAC7B,6EAAkD;AAClD,qEAA0C;AAC1C,sEAA2C;AAC3C,8DAAmC;AACnC,kEAAuC;AACvC,qEAA0C;AAC1C,yEAA8C;AAC9C,wEAA6C;AAC7C,kEAAuC"}

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

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

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"}