@bemoje/array 0.3.3 → 1.0.1

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

package/cjs/lib/arrShallowEquals.js

@@ -1,25 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrShallowEquals = void 0;
-const arrEvery_1 = require("./arrEvery");
-/**
- * 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
- * ```
- */
-function arrShallowEquals(input1, input2) {
-    if (input1.length !== input2.length)
-        return false;
-    return (0, arrEvery_1.arrEvery)(input1, (value, i) => value === input2[i]);
-}
-exports.arrShallowEquals = arrShallowEquals;
-//# sourceMappingURL=arrShallowEquals.js.map

package/cjs/lib/arrShallowEquals.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrShallowEquals.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrShallowEquals.ts"],"names":[],"mappings":";;;AAAA,yCAAqC;AAErC;;;;;;;;;;;;;GAaG;AACH,SAAgB,gBAAgB,CAAI,MAAW,EAAE,MAAW;IAC1D,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IACjD,OAAO,IAAA,mBAAQ,EAAC,MAAM,EAAE,CAAC,KAAQ,EAAE,CAAS,EAAE,EAAE,CAAC,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;AACvE,CAAC;AAHD,4CAGC"}

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

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

package/cjs/lib/arrShuffle.js

@@ -1,33 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrShuffle = void 0;
-const arrShallowEquals_1 = require("./arrShallowEquals");
-const arrSwap_1 = require("./arrSwap");
-/**
- * Shuffle items in an array in-place. Guarantees changes.
- * @remarks This function does not guarantee that the order of the elements will be different after shuffling.
- * @typeparam T - The type of the elements in the input array.
- * @returns The same array, but shuffled.
- * @param input The array to shuffle.
- * @example ```ts
- * const input = [1, 2, 3, 4, 5];
- * arrShuffle(input);
- * //=> [3, 1, 5, 2, 4]
- * ```
- */
-function arrShuffle(input) {
-    if (input.length <= 1)
-        return input;
-    const original = input.slice();
-    let equal = true;
-    while (equal) {
-        for (let i = 0; i < input.length; i++) {
-            const newIndex = Math.floor(Math.random() * input.length);
-            (0, arrSwap_1.arrSwap)(input, i, newIndex);
-        }
-        equal = (0, arrShallowEquals_1.arrShallowEquals)(input, original);
-    }
-    return input;
-}
-exports.arrShuffle = arrShuffle;
-//# sourceMappingURL=arrShuffle.js.map

package/cjs/lib/arrShuffle.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrShuffle.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrShuffle.ts"],"names":[],"mappings":";;;AAAA,yDAAqD;AACrD,uCAAmC;AAEnC;;;;;;;;;;;GAWG;AACH,SAAgB,UAAU,CAAI,KAAe;IAC3C,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,KAAK,CAAA;IACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,EAAE,CAAA;IAC9B,IAAI,KAAK,GAAG,IAAI,CAAA;IAChB,OAAO,KAAK,EAAE;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAA;YACzD,IAAA,iBAAO,EAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAA;SAC5B;QACD,KAAK,GAAG,IAAA,mCAAgB,EAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;KAC1C;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAZD,gCAYC"}

package/cjs/lib/arrSome.d.ts

@@ -1,16 +0,0 @@
-import { ArrayPredicate } from './types/ArrayPredicate';
-/**
- * Checks if at least one element in the array satisfies the provided predicate.
- * @param predicate The predicate function to apply to each element.
- * @template T The type of elements in the input array.
- * @returns Returns `true` if at least one element in the array passes the test implemented by the provided function, otherwise `false`.
- * @param input The array to check.
- * @example ```ts
- * const numbers = [1, 2, 3, 4, 5];
- * const isEven = (num) => num % 2 === 0;
- * arrSome(numbers, isEven);
- * //=> true
- * ```
- */
-export declare function arrSome<T>(input: Array<T>, predicate: ArrayPredicate<T>): boolean;
-//# sourceMappingURL=arrSome.d.ts.map

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

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

package/cjs/lib/arrSome.js

@@ -1,26 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrSome = void 0;
-/**
- * Checks if at least one element in the array satisfies the provided predicate.
- * @param predicate The predicate function to apply to each element.
- * @template T The type of elements in the input array.
- * @returns Returns `true` if at least one element in the array passes the test implemented by the provided function, otherwise `false`.
- * @param input The array to check.
- * @example ```ts
- * const numbers = [1, 2, 3, 4, 5];
- * const isEven = (num) => num % 2 === 0;
- * arrSome(numbers, isEven);
- * //=> true
- * ```
- */
-function arrSome(input, predicate) {
-    for (let i = 0, len = input.length; i < len; i++) {
-        if (predicate(input[i], i, input) === true) {
-            return true;
-        }
-    }
-    return false;
-}
-exports.arrSome = arrSome;
-//# sourceMappingURL=arrSome.js.map

package/cjs/lib/arrSome.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrSome.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSome.ts"],"names":[],"mappings":";;;AAEA;;;;;;;;;;;;GAYG;AACH,SAAgB,OAAO,CAAI,KAAe,EAAE,SAA4B;IACtE,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,IAAI,EAAE;YAC1C,OAAO,IAAI,CAAA;SACZ;KACF;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAPD,0BAOC"}

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

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

package/cjs/lib/arrSortNumeric.js

@@ -1,27 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrSortNumeric = void 0;
-/**
- * Sorts an array of numbers, bigints, or booleans in ascending order.
- * @returns The sorted array.
- * @remarks This function uses the JavaScript `Array.prototype.sort()` method, which sorts elements in place.
- * Therefore, the original array will be modified.
- * @throws If any element in the input array is not a number, bigint, or boolean.
- * @param input The array to be sorted.
- * @example ```ts
- * const input = [5, 2n, true, 10, false];
- * arrSortNumeric(input);
- * //=> [false, true, 2n, 5, 10]
- * ```
- */
-function arrSortNumeric(input) {
-    return input.sort((a, b) => {
-        if (a < b)
-            return -1;
-        if (a > b)
-            return 1;
-        return 0;
-    });
-}
-exports.arrSortNumeric = arrSortNumeric;
-//# sourceMappingURL=arrSortNumeric.js.map

package/cjs/lib/arrSortNumeric.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrSortNumeric.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSortNumeric.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;GAYG;AACH,SAAgB,cAAc,CAAC,KAAuC;IACpE,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAA4B,EAAE,CAA4B,EAAE,EAAE;QAC/E,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,CAAC,CAAC,CAAA;QACpB,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,CAAC,CAAA;QACnB,OAAO,CAAC,CAAA;IACV,CAAC,CAAC,CAAA;AACJ,CAAC;AAND,wCAMC"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"arrSortedInsertionIndex.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSortedInsertionIndex.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM,CAcpH"}

package/cjs/lib/arrSortedInsertionIndex.js

@@ -1,36 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrSortedInsertionIndex = void 0;
-/**
- * Returns an index in the sorted array where the specified value could be inserted while maintaining the sorted order of the array.
- * If the element is already in the array, returns the index after the last instance of the element.
- * @param array - The sorted array to search.
- * @param value - The value to locate in the array.
- * @param comparator - A function that defines the sort order. If omitted, the array elements are converted to strings, then sorted according to each character's Unicode code point value.
- * @returns The index at which the value could be inserted into array to maintain the array's sorted order.
- * @example ```ts
- * const array = [1, 2, 3, 5, 6];
- * const value = 4;
- * const comparator = (a, b) => a - b;
- * const index = arrSortedLowerBound(array, value, comparator);
- * console.log(index); // Output: 3
- * ```
- */
-function arrSortedInsertionIndex(array, value, comparator) {
-    let first = 0;
-    let count = array.length;
-    while (count > 0) {
-        const step = Math.trunc(count / 2);
-        let it = first + step;
-        if (comparator(array[it], value) <= 0) {
-            first = ++it;
-            count -= step + 1;
-        }
-        else {
-            count = step;
-        }
-    }
-    return first;
-}
-exports.arrSortedInsertionIndex = arrSortedInsertionIndex;
-//# sourceMappingURL=arrSortedInsertionIndex.js.map

package/cjs/lib/arrSortedInsertionIndex.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrSortedInsertionIndex.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSortedInsertionIndex.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;;;GAcG;AACH,SAAgB,uBAAuB,CAAI,KAAmB,EAAE,KAAQ,EAAE,UAAkC;IAC1G,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAA;IACxB,OAAO,KAAK,GAAG,CAAC,EAAE;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QAClC,IAAI,EAAE,GAAG,KAAK,GAAG,IAAI,CAAA;QACrB,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE,CAAE,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE;YACtC,KAAK,GAAG,EAAE,EAAE,CAAA;YACZ,KAAK,IAAI,IAAI,GAAG,CAAC,CAAA;SAClB;aAAM;YACL,KAAK,GAAG,IAAI,CAAA;SACb;KACF;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAdD,0DAcC"}

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

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

package/cjs/lib/arrSum.js

@@ -1,18 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrSum = void 0;
-/**
- * Calculates the sum of an array of numbers.
- * @returns The sum of all numbers in the array.
- * @param array The array of numbers to sum.
- * @example ```ts
- * const numbers = [1, 2, 3, 4, 5];
- * arrSum(numbers);
- * //=> 15
- * ```
- */
-function arrSum(array) {
-    return array.reduce((acc, cur) => acc + cur, 0);
-}
-exports.arrSum = arrSum;
-//# sourceMappingURL=arrSum.js.map

package/cjs/lib/arrSum.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrSum.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSum.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;GASG;AACH,SAAgB,MAAM,CAAC,KAAe;IACpC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAA;AACjD,CAAC;AAFD,wBAEC"}

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

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

package/cjs/lib/arrSwap.js

@@ -1,24 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrSwap = void 0;
-/**
- * Swaps two elements in an array. This function takes an input array and swaps the elements at the specified indices.
- * @param to The index of the element to swap to.
- * @param from The index of the element to swap from.
- * @template T - The type of elements in the array.
- * @returns The modified array with swapped elements.
- * @throws Will throw an error if 'from' or 'to' is not a valid index in the array.
- * @param input The input array.
- * @example ```ts
- * const arr = [1, 2, 3, 4, 5]
- * arrSwap(arr, 1, 3) //=> [1, 4, 3, 2, 5]
- * ```
- */
-function arrSwap(input, from, to) {
-    if (from === to)
-        return input;
-    [input[from], input[to]] = [input[to], input[from]];
-    return input;
-}
-exports.arrSwap = arrSwap;
-//# sourceMappingURL=arrSwap.js.map

package/cjs/lib/arrSwap.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrSwap.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSwap.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;GAYG;AACH,SAAgB,OAAO,CAAI,KAAe,EAAE,IAAY,EAAE,EAAU;IAClE,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,KAAK,CAC5B;IAAA,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;IACpD,OAAO,KAAK,CAAA;AACd,CAAC;AAJD,0BAIC"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"arrTableAssertRowsSameLength.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableAssertRowsSameLength.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,4BAA4B,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAOrF"}

package/cjs/lib/arrTableAssertRowsSameLength.js

@@ -1,37 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrTableAssertRowsSameLength = void 0;
-/**
- * Asserts that all rows in a 2D array have the same length.
- * @param - Optional array of headers to compare the row length against.
- * @throws If any row in the array has a different length than the others.
- * @param headers Optional. An array of headers. If provided, each row must have the same length as this array.
- * @typeparam T - The type of elements in the rows.
- * @param rows The 2D array to check.
- * @example ```ts
- *  const rows = [
- *    [1, 2, 3],
- *    [4, 5, 6],
- *    [7, 8, 9],
- *  ];
- *  arrTableAssertRowsSameLength(rows);
- *  //=> undefined
- *  const rowsWithDifferentLength = [
- *    [1, 2, 3],
- *    [4, 5],
- *    [7, 8, 9],
- *  ];
- *  arrTableAssertRowsSameLength(rowsWithDifferentLength);
- *  //=> Error: Expected 3 columns, got 2
- *  ```
- */
-function arrTableAssertRowsSameLength(rows, headers) {
-    const numHeaders = (headers || rows[0]).length;
-    for (const row of rows) {
-        if (row.length !== numHeaders) {
-            throw new Error(`Expected ${numHeaders} columns, got ${row.length}`);
-        }
-    }
-}
-exports.arrTableAssertRowsSameLength = arrTableAssertRowsSameLength;
-//# sourceMappingURL=arrTableAssertRowsSameLength.js.map

package/cjs/lib/arrTableAssertRowsSameLength.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrTableAssertRowsSameLength.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableAssertRowsSameLength.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,SAAgB,4BAA4B,CAAI,IAAW,EAAE,OAAkB;IAC7E,MAAM,UAAU,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;IAC9C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE;QACtB,IAAI,GAAG,CAAC,MAAM,KAAK,UAAU,EAAE;YAC7B,MAAM,IAAI,KAAK,CAAC,YAAY,UAAU,iBAAiB,GAAG,CAAC,MAAM,EAAE,CAAC,CAAA;SACrE;KACF;AACH,CAAC;AAPD,oEAOC"}

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

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

package/cjs/lib/arrTableEachToString.js

@@ -1,20 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrTableEachToString = void 0;
-const arrEachToString_1 = require("./arrEachToString");
-/**
- * Coerce each value of a 2D array table to string.
- * @template T - The type of the elements in the input array.
- * @returns The converted 2D array where each element is a string.
- * @param table The 2D array to convert.
- * @example ```ts
- * const input: number[][] = [[1, 2, 3], [4, 5, 6], [7, 8, 9]];
- * arrTableEachToString(input);
- * //=> [['1', '2', '3'], ['4', '5', '6'], ['7', '8', '9']]
- * ```
- */
-function arrTableEachToString(table) {
-    return table.map(arrEachToString_1.arrEachToString);
-}
-exports.arrTableEachToString = arrTableEachToString;
-//# sourceMappingURL=arrTableEachToString.js.map

package/cjs/lib/arrTableEachToString.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrTableEachToString.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableEachToString.ts"],"names":[],"mappings":";;;AAAA,uDAAmD;AAEnD;;;;;;;;;;GAUG;AACH,SAAgB,oBAAoB,CAAI,KAAY;IAClD,OAAO,KAAK,CAAC,GAAG,CAAC,iCAAe,CAAC,CAAA;AACnC,CAAC;AAFD,oDAEC"}

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

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

package/cjs/lib/arrTableRemoveColumns.js

@@ -1,18 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrTableRemoveColumns = void 0;
-const arrIndicesOf_1 = require("./arrIndicesOf");
-/**
- * Removes specified columns from a 2D array table.
- * @param table - The 2D array (table) from which columns will be removed. The first row of the table is assumed to contain column names.
- * @param removeColumnNames - The names of the columns to be removed. These should match the entries in the first row of the table.
- * @returns A new 2D array (table) with the specified columns removed.
- */
-function arrTableRemoveColumns(table, ...removeColumnNames) {
-    if (!removeColumnNames.length || !table.length)
-        return table;
-    const set = new Set(removeColumnNames.map((col) => (0, arrIndicesOf_1.arrIndicesOf)(table[0], col)).flat());
-    return table.map((row) => row.filter((_, i) => !set.has(i)));
-}
-exports.arrTableRemoveColumns = arrTableRemoveColumns;
-//# sourceMappingURL=arrTableRemoveColumns.js.map

package/cjs/lib/arrTableRemoveColumns.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrTableRemoveColumns.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableRemoveColumns.ts"],"names":[],"mappings":";;;AAAA,iDAA6C;AAE7C;;;;;GAKG;AACH,SAAgB,qBAAqB,CAAC,KAAiB,EAAE,GAAG,iBAA2B;IACrF,IAAI,CAAC,iBAAiB,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IAC5D,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAA,2BAAY,EAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;IACvF,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAC9D,CAAC;AAJD,sDAIC"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"arrTableToCsv.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableToCsv.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,SAAM,EAAE,oBAAoB,SAAM,GAAG,MAAM,CAQlG"}

package/cjs/lib/arrTableToCsv.js

@@ -1,33 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.arrTableToCsv = void 0;
-/**
- * Converts a 2D array to a CSV string.
- * @param input The input 2D array.
- * @remarks This function is useful for exporting data to CSV format.
- * @param replaceLinebreakWith The character used to replace line breaks in the CSV string. Defaults to '|'.
- * @typeparam T - The type of the elements in the input array.
- * @returns The CSV string representation of the input array.
- * @param delimiter The delimiter to use for separating values in the CSV string.
- * @example ```ts
- * const input = [
- *   ['Name', 'Age', 'Country'],
- *   ['John', '25', 'USA'],
- *   ['Alice', '30', 'Canada'],
- *   ['Bob', '35', 'UK'],
- * ];
- * arrTableToCsv(input);
- * //=> "Name;Age;Country\nJohn;25;USA\nAlice;30;Canada\nBob;35;UK"
- * ```
- */
-function arrTableToCsv(input, delimiter = ';', replaceLinebreakWith = '|') {
-    return input
-        .map((row) => {
-        return row
-            .map((item) => String(item).replace(new RegExp(';', 'g'), '').replace(/\r*\n/g, replaceLinebreakWith))
-            .join(delimiter);
-    })
-        .join('\n');
-}
-exports.arrTableToCsv = arrTableToCsv;
-//# sourceMappingURL=arrTableToCsv.js.map

package/cjs/lib/arrTableToCsv.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrTableToCsv.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableToCsv.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,SAAgB,aAAa,CAAI,KAAY,EAAE,SAAS,GAAG,GAAG,EAAE,oBAAoB,GAAG,GAAG;IACxF,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACX,OAAO,GAAG;aACP,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,oBAAoB,CAAC,CAAC;aACrG,IAAI,CAAC,SAAS,CAAC,CAAA;IACpB,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAA;AACf,CAAC;AARD,sCAQC"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"arrTableToObjects.d.ts","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableToObjects.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,EAAE,UAAU,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAoBnH"}