@bemoje/array 0.0.9 → 0.1.0

package/src/lib/arrShallowEquals.js

@@ -0,0 +1,25 @@
+"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/src/lib/arrShallowEquals.js.map

@@ -0,0 +1 @@
+{"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/{dist/types → src}/lib/arrShuffle.d.ts

@@ -11,4 +11,3 @@
  * ```
  */
 export declare function arrShuffle<T>(input: Array<T>): Array<T>;
-//# sourceMappingURL=arrShuffle.d.ts.map

package/src/lib/arrShuffle.js

@@ -0,0 +1,34 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.arrShuffle = void 0;
+const number_1 = require("@bemoje/number");
+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 = (0, number_1.randomIntBetween)(0, input.length - 1);
+            (0, arrSwap_1.arrSwap)(input, i, newIndex);
+        }
+        equal = (0, arrShallowEquals_1.arrShallowEquals)(input, original);
+    }
+    return input;
+}
+exports.arrShuffle = arrShuffle;
+//# sourceMappingURL=arrShuffle.js.map

package/src/lib/arrShuffle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrShuffle.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrShuffle.ts"],"names":[],"mappings":";;;AAAA,2CAAiD;AACjD,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,IAAA,yBAAgB,EAAC,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YACtD,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/{dist/types → src}/lib/arrSome.d.ts

@@ -13,4 +13,3 @@ import type { ArrayPredicate } from './types/ArrayPredicate';
  * ```
  */
 export declare function arrSome<T>(input: Array<T>, predicate: ArrayPredicate<T>): boolean;
-//# sourceMappingURL=arrSome.d.ts.map

package/src/lib/arrSome.js

@@ -0,0 +1,26 @@
+"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/src/lib/arrSome.js.map

@@ -0,0 +1 @@
+{"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/{dist/types → src}/lib/arrSortNumeric.d.ts

@@ -12,4 +12,3 @@
  * ```
  */
 export declare function arrSortNumeric(input: Array<number | bigint | boolean>): Array<number | bigint | boolean>;
-//# sourceMappingURL=arrSortNumeric.d.ts.map

package/src/lib/arrSortNumeric.js

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.arrSortNumeric = void 0;
+const sort_1 = require("@bemoje/sort");
+/**
+ * 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(sort_1.compareNumeric);
+}
+exports.arrSortNumeric = arrSortNumeric;
+//# sourceMappingURL=arrSortNumeric.js.map

package/src/lib/arrSortNumeric.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrSortNumeric.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSortNumeric.ts"],"names":[],"mappings":";;;AAAA,uCAA6C;AAE7C;;;;;;;;;;;;GAYG;AACH,SAAgB,cAAc,CAAC,KAAuC;IACpE,OAAO,KAAK,CAAC,IAAI,CAAC,qBAAc,CAAC,CAAA;AACnC,CAAC;AAFD,wCAEC"}

package/{dist/types → src}/lib/arrSortedInsertionIndex.d.ts

@@ -14,4 +14,3 @@
  * ```
  */
 export declare function arrSortedInsertionIndex<T>(array: readonly T[], value: T, comparator: (a: T, b: T) => number): number;
-//# sourceMappingURL=arrSortedInsertionIndex.d.ts.map

package/src/lib/arrSortedInsertionIndex.js

@@ -0,0 +1,36 @@
+"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/src/lib/arrSortedInsertionIndex.js.map

@@ -0,0 +1 @@
+{"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/{dist/types → src}/lib/arrSplit.d.ts

@@ -1,2 +1 @@
 export declare function arrSplit<T>(array: T[], n: number): T[][];
-//# sourceMappingURL=arrSplit.d.ts.map

package/src/lib/arrSplit.js

@@ -0,0 +1,19 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.arrSplit = void 0;
+const validation_1 = require("@bemoje/validation");
+function arrSplit(array, n) {
+    (0, validation_1.assertion)(n, validation_1.isPositiveInteger);
+    const result = [];
+    if (array.length === 0)
+        return result;
+    if (n === 1)
+        return [array];
+    const chunkSize = Math.ceil(array.length / n);
+    for (let i = 0; i < array.length; i += chunkSize) {
+        result.push(array.slice(i, i + chunkSize));
+    }
+    return result;
+}
+exports.arrSplit = arrSplit;
+//# sourceMappingURL=arrSplit.js.map

package/src/lib/arrSplit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrSplit.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrSplit.ts"],"names":[],"mappings":";;;AAAA,mDAAiE;AAEjE,SAAgB,QAAQ,CAAI,KAAU,EAAE,CAAS;IAC/C,IAAA,sBAAS,EAAC,CAAC,EAAE,8BAAiB,CAAC,CAAA;IAC/B,MAAM,MAAM,GAAU,EAAE,CAAA;IACxB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAA;IACrC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,KAAK,CAAC,CAAA;IAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE;QAChD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAA;KAC3C;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAVD,4BAUC"}

package/{dist/types → src}/lib/arrSum.d.ts

@@ -9,4 +9,3 @@
  * ```
  */
 export declare function arrSum(array: number[]): number;
-//# sourceMappingURL=arrSum.d.ts.map

package/src/lib/arrSum.js

@@ -0,0 +1,18 @@
+"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/src/lib/arrSum.js.map

@@ -0,0 +1 @@
+{"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/{dist/types → src}/lib/arrSwap.d.ts

@@ -12,4 +12,3 @@
  * ```
  */
 export declare function arrSwap<T>(input: Array<T>, from: number, to: number): Array<T>;
-//# sourceMappingURL=arrSwap.d.ts.map

package/src/lib/arrSwap.js

@@ -0,0 +1,24 @@
+"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/src/lib/arrSwap.js.map

@@ -0,0 +1 @@
+{"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/{dist/types → src}/lib/arrTableAssertRowsSameLength.d.ts

@@ -23,4 +23,3 @@
  *  ```
  */
 export declare function arrTableAssertRowsSameLength<T>(rows: T[][], headers?: string[]): void;
-//# sourceMappingURL=arrTableAssertRowsSameLength.d.ts.map

package/src/lib/arrTableAssertRowsSameLength.js

@@ -0,0 +1,37 @@
+"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/src/lib/arrTableAssertRowsSameLength.js.map

@@ -0,0 +1 @@
+{"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/{dist/types → src}/lib/arrTableEachToString.d.ts

@@ -10,4 +10,3 @@
  * ```
  */
 export declare function arrTableEachToString<T>(table: T[][]): string[][];
-//# sourceMappingURL=arrTableEachToString.d.ts.map

package/src/lib/arrTableEachToString.js

@@ -0,0 +1,20 @@
+"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/src/lib/arrTableEachToString.js.map

@@ -0,0 +1 @@
+{"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/{dist/types → src}/lib/arrTableToCsv.d.ts

@@ -18,4 +18,3 @@
  * ```
  */
 export declare function arrTableToCsv<T>(input: T[][], delimiter?: string, replaceLinebreakWith?: string): string;
-//# sourceMappingURL=arrTableToCsv.d.ts.map

package/src/lib/arrTableToCsv.js

@@ -0,0 +1,34 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.arrTableToCsv = void 0;
+const string_1 = require("@bemoje/string");
+/**
+ * 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) => (0, string_1.strReplaceAll)(item + '', delimiter, '').replace(/\r*\n/g, replaceLinebreakWith))
+            .join(delimiter);
+    })
+        .join('\n');
+}
+exports.arrTableToCsv = arrTableToCsv;
+//# sourceMappingURL=arrTableToCsv.js.map

package/src/lib/arrTableToCsv.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrTableToCsv.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableToCsv.ts"],"names":[],"mappings":";;;AAAA,2CAA8C;AAE9C;;;;;;;;;;;;;;;;;;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,IAAA,sBAAa,EAAC,IAAI,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,oBAAoB,CAAC,CAAC;aAC9F,IAAI,CAAC,SAAS,CAAC,CAAA;IACpB,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAA;AACf,CAAC;AARD,sCAQC"}

package/{dist/types → src}/lib/arrTableToObjects.d.ts

@@ -20,4 +20,3 @@
  * ```
  */
 export declare function arrTableToObjects<T>(rows: T[][], headers?: string[], ignoreKeys?: Set<string>): Record<string, T>[];
-//# sourceMappingURL=arrTableToObjects.d.ts.map

package/src/lib/arrTableToObjects.js

@@ -0,0 +1,51 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.arrTableToObjects = void 0;
+/**
+ * Converts a 2D array representing a table into an array of objects.
+ * @param rows The 2D array representing the table.
+ * @template T - The type of the elements in the rows.
+ * @param headers The headers to use as keys for the objects. If not provided, the first row of the table is used as headers.
+ * @returns An array of objects, where each object represents a row in the table.
+ * @throws Throws an error if the headers are not provided and the table is empty or only contains one row.
+ * @param headers Optional array of headers for the table.
+ * @example ```ts
+ * const table = [
+ *   ['Name', 'Age', 'Country'],
+ *   ['John', 25, 'USA'],
+ *   ['Jane', 30, 'Canada'],
+ * ];
+ * const headers = ['Name', 'Age', 'Country'];
+ * arrTableToObjects(table, headers) //=> [
+ * //   { Name: 'John', Age: 25, Country: 'USA' },
+ * //   { Name: 'Jane', Age: 30, Country: 'Canada' },
+ * // ]
+ * ```
+ */
+function arrTableToObjects(rows, headers, ignoreKeys) {
+    if (headers) {
+        if (!rows.length)
+            return [];
+    }
+    else {
+        if (rows.length <= 1)
+            return [];
+        headers = rows[0].map((header) => {
+            return header === null || header === undefined ? '' : String(header);
+        });
+        rows = rows.slice(1);
+    }
+    const _headers = headers;
+    return rows.map((row) => {
+        const o = {};
+        for (let i = 0; i < _headers.length; i++) {
+            const header = _headers[i];
+            if (ignoreKeys && ignoreKeys.has(header))
+                continue;
+            o[header] = row[i];
+        }
+        return o;
+    });
+}
+exports.arrTableToObjects = arrTableToObjects;
+//# sourceMappingURL=arrTableToObjects.js.map

package/src/lib/arrTableToObjects.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrTableToObjects.js","sourceRoot":"","sources":["../../../../../packages/array/src/lib/arrTableToObjects.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,SAAgB,iBAAiB,CAAI,IAAW,EAAE,OAAkB,EAAE,UAAwB;IAC5F,IAAI,OAAO,EAAE;QACX,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO,EAAE,CAAA;KAC5B;SAAM;QACL,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;YAAE,OAAO,EAAE,CAAA;QAC/B,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;YAC/B,OAAO,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;QACtE,CAAC,CAAC,CAAA;QACF,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;KACrB;IACD,MAAM,QAAQ,GAAG,OAAO,CAAA;IACxB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAQ,EAAE,EAAE;QAC3B,MAAM,CAAC,GAAsB,EAAE,CAAA;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACxC,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;YAC1B,IAAI,UAAU,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAQ;YAClD,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;SACnB;QACD,OAAO,CAAC,CAAA;IACV,CAAC,CAAC,CAAA;AACJ,CAAC;AApBD,8CAoBC"}

package/{dist/types → src}/lib/types/ArrayPredicate.d.ts

@@ -8,4 +8,3 @@
  * @returns A boolean indicating whether the current element passes the test.
  */
 export type ArrayPredicate<T> = (value: T, index: number, array: T[]) => boolean;
-//# sourceMappingURL=ArrayPredicate.d.ts.map

package/src/lib/types/ArrayPredicate.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ArrayPredicate.js.map

package/src/lib/types/ArrayPredicate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ArrayPredicate.js","sourceRoot":"","sources":["../../../../../../packages/array/src/lib/types/ArrayPredicate.ts"],"names":[],"mappings":""}

package/{dist/types → src}/lib/types/ArrayValueCallback.d.ts

@@ -1,2 +1 @@
 export type ArrayValueCallback<T> = (value: T, index: number, array: T[]) => T;
-//# sourceMappingURL=ArrayValueCallback.d.ts.map

package/src/lib/types/ArrayValueCallback.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ArrayValueCallback.js.map

package/src/lib/types/ArrayValueCallback.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ArrayValueCallback.js","sourceRoot":"","sources":["../../../../../../packages/array/src/lib/types/ArrayValueCallback.ts"],"names":[],"mappings":""}

package/{dist/types → src}/lib/types/ArrayVoidCallback.d.ts

@@ -1,2 +1 @@
 export type ArrayVoidCallback<T> = (value: T, index: number, array: T[]) => void;
-//# sourceMappingURL=ArrayVoidCallback.d.ts.map

package/src/lib/types/ArrayVoidCallback.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ArrayVoidCallback.js.map

package/src/lib/types/ArrayVoidCallback.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ArrayVoidCallback.js","sourceRoot":"","sources":["../../../../../../packages/array/src/lib/types/ArrayVoidCallback.ts"],"names":[],"mappings":""}

package/{dist/types → src}/lib/types/NestedArray.d.ts

@@ -1,2 +1 @@
 export type NestedArray<T> = Array<NestedArray<T> | T>;
-//# sourceMappingURL=NestedArray.d.ts.map

package/src/lib/types/NestedArray.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=NestedArray.js.map

package/src/lib/types/NestedArray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"NestedArray.js","sourceRoot":"","sources":["../../../../../../packages/array/src/lib/types/NestedArray.ts"],"names":[],"mappings":""}

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/dist/index.cjs.js

@@ -1,6 +0,0 @@
-/*!
- * @bemoje/array v0.0.8
- * (c) Benjamin Møller Jensen
- * Released under the MIT License.
- */"use strict";var number=require("@bemoje/number"),sort=require("@bemoje/sort"),validation=require("@bemoje/validation"),string=require("@bemoje/string");function arrSum(array){return array.reduce((acc,cur)=>acc+cur,0)}function arrAverage(array){if(!array.length)throw new Error("Cannot take an average of zero values.");return arrSum(array)/array.length}function arrEachToString(array){return array.map(element=>""+element)}function arrEvery(input,predicate){for(let i=0,len=input.length;i<len;i++)if(!1===predicate(input[i],i,input))return!1;return!0}function arrFindIndicesOf(input,predicate){const result=[];for(let i=0;i<input.length;i++)predicate(input[i])&&result.push(i);return result}function arrFindLast(input,predicate){for(let i=input.length-1;0<=i;i--)if(!0===predicate(input[i]))return input[i]}function arrFindLastIndexOf(input,predicate){for(let i=input.length-1;0<=i;i--)if(predicate(input[i]))return i;return-1}function arrFlatten(input,maxDepth=Number.MAX_SAFE_INTEGER){function recurse(arr,depth){for(let i=0;i<arr.length;i++)Array.isArray(arr[i])&&depth<maxDepth?recurse(arr[i],depth+1):accum.push(arr[i])}const accum=[];return recurse(input,0),accum}function arrIndicesOf(input,element){const result=[];for(let i=0;i<input.length;i++)element===input[i]&&result.push(i);return result}function arrLast(array){if(!array.length)throw new Error("Cannot get last element of empty array.");return array[array.length-1]}function arrMapMutable(input,f){for(let i=0;i<input.length;i++)input[i]=f(input[i],i,input);return input}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)}function arrObjectsToTable(objects,options={}){var _a;const headers=(null===(_a=null===options||void 0===options?void 0:options.headers)||void 0===_a?void 0:_a.slice())||arrObjectsUniqueKeys(objects),table=[headers];for(const o of objects){const row=headers.map(header=>{const value=o[header];return value===void 0?options.emptyCell:value});table.push(row)}return table}function arrRemoveDuplicates(array){return Array.from(new Set(array))}function arrShallowEquals(input1,input2){return!(input1.length!==input2.length)&&arrEvery(input1,(value,i)=>value===input2[i])}function arrSwap(input,from,to){return from===to?input:([input[from],input[to]]=[input[to],input[from]],input)}function arrShuffle(input){if(1>=input.length)return input;const original=input.slice();for(let equal=!0;equal;){for(let i=0;i<input.length;i++){const newIndex=number.randomIntBetween(0,input.length-1);arrSwap(input,i,newIndex)}equal=arrShallowEquals(input,original)}return input}function arrSome(input,predicate){for(let i=0,len=input.length;i<len;i++)if(!0===predicate(input[i],i,input))return!0;return!1}function arrSortedInsertionIndex(array,value,comparator){let first=0,count=array.length;for(;0<count;){const step=Math.trunc(count/2);let it=first+step;0>=comparator(array[it],value)?(first=++it,count-=step+1):count=step}return first}function arrSortNumeric(input){return input.sort(sort.compareNumeric)}function arrSplit(array,n){validation.assertion(n,validation.isPositiveInteger);const result=[];if(0===array.length)return result;if(1===n)return[array];const chunkSize=Math.ceil(array.length/n);for(let i=0;i<array.length;i+=chunkSize)result.push(array.slice(i,i+chunkSize));return result}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}`)}function arrTableEachToString(table){return table.map(arrEachToString)}function arrTableToCsv(input,delimiter=";",replaceLinebreakWith="|"){return input.map(row=>row.map(item=>string.strReplaceAll(item+"",delimiter,"").replace(/\r*\n/g,replaceLinebreakWith)).join(delimiter)).join("\n")}function arrTableToObjects(rows,headers,ignoreKeys){if(!headers){if(1>=rows.length)return[];headers=rows[0].map(header=>null===header||void 0===header?"":header+""),rows=rows.slice(1)}else if(!rows.length)return[];const _headers=headers;return rows.map(row=>{const o={};for(let i=0;i<_headers.length;i++){const header=_headers[i];ignoreKeys&&ignoreKeys.has(header)||(o[header]=row[i])}return o})}exports.arrAverage=arrAverage,exports.arrEachToString=arrEachToString,exports.arrEvery=arrEvery,exports.arrFindIndicesOf=arrFindIndicesOf,exports.arrFindLast=arrFindLast,exports.arrFindLastIndexOf=arrFindLastIndexOf,exports.arrFlatten=arrFlatten,exports.arrIndicesOf=arrIndicesOf,exports.arrLast=arrLast,exports.arrMapMutable=arrMapMutable,exports.arrObjectsToTable=arrObjectsToTable,exports.arrObjectsUniqueKeys=arrObjectsUniqueKeys,exports.arrRemoveDuplicates=arrRemoveDuplicates,exports.arrShallowEquals=arrShallowEquals,exports.arrShuffle=arrShuffle,exports.arrSome=arrSome,exports.arrSortNumeric=arrSortNumeric,exports.arrSortedInsertionIndex=arrSortedInsertionIndex,exports.arrSplit=arrSplit,exports.arrSum=arrSum,exports.arrSwap=arrSwap,exports.arrTableAssertRowsSameLength=arrTableAssertRowsSameLength,exports.arrTableEachToString=arrTableEachToString,exports.arrTableToCsv=arrTableToCsv,exports.arrTableToObjects=arrTableToObjects;
-//# sourceMappingURL=index.cjs.js.map