@pawells/typescript-common 1.0.0

package/build/array/array-group-by.js

@@ -0,0 +1,24 @@
+/**
+ * Groups array elements by a key generated by a provided function.
+ * @param array The array to group.
+ * @param keyFn TTransform function that returns the grouping key for each element.
+ * @returns An object with keys as group names and values as arrays of grouped elements.
+ * @example
+ * const items = [{ category: 'fruit', name: 'apple' }, { category: 'vegetable', name: 'carrot' }];
+ * const grouped = ArrayGroupBy(items, item => item.category);
+ * // grouped.fruit is [{ category: 'fruit', name: 'apple' }]
+ */
+export function ArrayGroupBy(array, keyFn) {
+    if (!array) {
+        return {};
+    }
+    return array.reduce((acc, item) => {
+        const key = keyFn(item);
+        if (!acc[key]) {
+            acc[key] = [];
+        }
+        acc[key].push(item);
+        return acc;
+    }, {});
+}
+//# sourceMappingURL=array-group-by.js.map

package/build/array/array-group-by.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-group-by.js","sourceRoot":"","sources":["../../src/array/array-group-by.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,MAAM,UAAU,YAAY,CAAwC,KAAU,EAAE,KAAuB;IACtG,IAAI,CAAC,KAAK,EAAE,CAAC;QACZ,OAAO,EAAoB,CAAC;IAC7B,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;QACjC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACf,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QACf,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,OAAO,GAAG,CAAC;IACZ,CAAC,EAAE,EAAoB,CAAC,CAAC;AAC1B,CAAC"}

package/build/array/array-intersection.d.ts

@@ -0,0 +1,25 @@
+import type { TEqualityComparator } from './types';
+/**
+ * Returns the intersection of two arrays (elements present in both)
+ * Optimized O(n+m) complexity using Set-based approach
+ *
+ * @template T - The type of array elements
+ * @param array1 - First array
+ * @param array2 - Second array
+ * @param comparator - Optional custom equality comparator
+ * @returns Array containing elements present in both arrays
+ *
+ * @example
+ * ```typescript
+ * ArrayIntersection([1, 2, 3], [2, 3, 4]); // [2, 3]
+ * ArrayIntersection(
+ *   [{id: 1}, {id: 2}],
+ *   [{id: 2}, {id: 3}],
+ *   (a, b) => a.id === b.id
+ * ); // [{id: 2}]
+ * ```
+ *
+ * @complexity O(n+m) where n and m are array lengths
+ */
+export declare function ArrayIntersection<T>(array1: T[], array2: T[], comparator?: TEqualityComparator<T>): T[];
+//# sourceMappingURL=array-intersection.d.ts.map

package/build/array/array-intersection.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-intersection.d.ts","sourceRoot":"","sources":["../../src/array/array-intersection.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,SAAS,CAAC;AAEnD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAClC,MAAM,EAAE,CAAC,EAAE,EACX,MAAM,EAAE,CAAC,EAAE,EACX,UAAU,CAAC,EAAE,mBAAmB,CAAC,CAAC,CAAC,GACjC,CAAC,EAAE,CAoBL"}

package/build/array/array-intersection.js

@@ -0,0 +1,39 @@
+/**
+ * Returns the intersection of two arrays (elements present in both)
+ * Optimized O(n+m) complexity using Set-based approach
+ *
+ * @template T - The type of array elements
+ * @param array1 - First array
+ * @param array2 - Second array
+ * @param comparator - Optional custom equality comparator
+ * @returns Array containing elements present in both arrays
+ *
+ * @example
+ * ```typescript
+ * ArrayIntersection([1, 2, 3], [2, 3, 4]); // [2, 3]
+ * ArrayIntersection(
+ *   [{id: 1}, {id: 2}],
+ *   [{id: 2}, {id: 3}],
+ *   (a, b) => a.id === b.id
+ * ); // [{id: 2}]
+ * ```
+ *
+ * @complexity O(n+m) where n and m are array lengths
+ */
+export function ArrayIntersection(array1, array2, comparator) {
+    if (!array1 || !array2) {
+        return [];
+    }
+    // If no custom comparator, use Set for O(n+m) performance
+    if (!comparator) {
+        const set2 = new Set(array2);
+        return array1.filter(item => set2.has(item));
+    }
+    // With custom comparator, still optimize by checking smaller array
+    // This reduces comparisons from n*m to min(n,m)*max(n,m)
+    const [smaller, larger] = array1.length <= array2.length
+        ? [array1, array2]
+        : [array2, array1];
+    return smaller.filter(item => larger.some(otherItem => comparator(item, otherItem)));
+}
+//# sourceMappingURL=array-intersection.js.map

package/build/array/array-intersection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-intersection.js","sourceRoot":"","sources":["../../src/array/array-intersection.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,UAAU,iBAAiB,CAChC,MAAW,EACX,MAAW,EACX,UAAmC;IAEnC,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,OAAO,EAAE,CAAC;IACX,CAAC;IAED,0DAA0D;IAC1D,IAAI,CAAC,UAAU,EAAE,CAAC;QACjB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QAC7B,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,mEAAmE;IACnE,yDAAyD;IACzD,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM;QACvD,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC;QAClB,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAEpB,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAC5B,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CACrD,CAAC;AACH,CAAC"}

package/build/array/array-partition.d.ts

@@ -0,0 +1,19 @@
+import type { TPredicate } from './types';
+/**
+ * Splits an array into two groups: elements that satisfy the predicate and those that do not.
+ *
+ * @template T - The type of array elements
+ * @param array - The array to partition
+ * @param predicate - The condition to test each element against
+ * @returns A tuple `[matches, rest]` where `matches` passed the predicate
+ *
+ * @example
+ * ```typescript
+ * const [evens, odds] = ArrayPartition([1, 2, 3, 4, 5], (n) => n % 2 === 0);
+ * // evens → [2, 4], odds → [1, 3, 5]
+ *
+ * const [admins, users] = ArrayPartition(users, (u) => u.role === 'admin');
+ * ```
+ */
+export declare function ArrayPartition<T>(array: T[], predicate: TPredicate<T>): [T[], T[]];
+//# sourceMappingURL=array-partition.d.ts.map

package/build/array/array-partition.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-partition.d.ts","sourceRoot":"","sources":["../../src/array/array-partition.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAE1C;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAelF"}

package/build/array/array-partition.js

@@ -0,0 +1,32 @@
+/**
+ * Splits an array into two groups: elements that satisfy the predicate and those that do not.
+ *
+ * @template T - The type of array elements
+ * @param array - The array to partition
+ * @param predicate - The condition to test each element against
+ * @returns A tuple `[matches, rest]` where `matches` passed the predicate
+ *
+ * @example
+ * ```typescript
+ * const [evens, odds] = ArrayPartition([1, 2, 3, 4, 5], (n) => n % 2 === 0);
+ * // evens → [2, 4], odds → [1, 3, 5]
+ *
+ * const [admins, users] = ArrayPartition(users, (u) => u.role === 'admin');
+ * ```
+ */
+export function ArrayPartition(array, predicate) {
+    if (!array)
+        return [[], []];
+    const matches = [];
+    const rest = [];
+    for (const item of array) {
+        if (predicate(item)) {
+            matches.push(item);
+        }
+        else {
+            rest.push(item);
+        }
+    }
+    return [matches, rest];
+}
+//# sourceMappingURL=array-partition.js.map

package/build/array/array-partition.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-partition.js","sourceRoot":"","sources":["../../src/array/array-partition.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,cAAc,CAAI,KAAU,EAAE,SAAwB;IACrE,IAAI,CAAC,KAAK;QAAE,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAE5B,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,MAAM,IAAI,GAAQ,EAAE,CAAC;IAErB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;IACF,CAAC;IAED,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AACxB,CAAC"}

package/build/array/array-range.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Generates an array of numbers from `start` to `end` (exclusive) with an optional `step`.
+ *
+ * @param start - The first value in the range
+ * @param end - The value to stop before (exclusive)
+ * @param step - Increment between values (default: `1`; use negative for descending ranges)
+ * @returns Array of numbers
+ *
+ * @example
+ * ```typescript
+ * ArrayRange(0, 5);        // [0, 1, 2, 3, 4]
+ * ArrayRange(0, 10, 2);    // [0, 2, 4, 6, 8]
+ * ArrayRange(5, 0, -1);    // [5, 4, 3, 2, 1]
+ * ArrayRange(0, 1, 0.5);   // [0, 0.5]
+ * ```
+ */
+export declare function ArrayRange(start: number, end: number, step?: number): number[];
+//# sourceMappingURL=array-range.d.ts.map

package/build/array/array-range.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-range.d.ts","sourceRoot":"","sources":["../../src/array/array-range.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,SAAI,GAAG,MAAM,EAAE,CAYzE"}

package/build/array/array-range.js

@@ -0,0 +1,30 @@
+/**
+ * Generates an array of numbers from `start` to `end` (exclusive) with an optional `step`.
+ *
+ * @param start - The first value in the range
+ * @param end - The value to stop before (exclusive)
+ * @param step - Increment between values (default: `1`; use negative for descending ranges)
+ * @returns Array of numbers
+ *
+ * @example
+ * ```typescript
+ * ArrayRange(0, 5);        // [0, 1, 2, 3, 4]
+ * ArrayRange(0, 10, 2);    // [0, 2, 4, 6, 8]
+ * ArrayRange(5, 0, -1);    // [5, 4, 3, 2, 1]
+ * ArrayRange(0, 1, 0.5);   // [0, 0.5]
+ * ```
+ */
+export function ArrayRange(start, end, step = 1) {
+    if (step === 0)
+        return [];
+    if (step > 0 && start >= end)
+        return [];
+    if (step < 0 && start <= end)
+        return [];
+    const result = [];
+    for (let i = start; step > 0 ? i < end : i > end; i += step) {
+        result.push(i);
+    }
+    return result;
+}
+//# sourceMappingURL=array-range.js.map

package/build/array/array-range.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-range.js","sourceRoot":"","sources":["../../src/array/array-range.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,UAAU,CAAC,KAAa,EAAE,GAAW,EAAE,IAAI,GAAG,CAAC;IAC9D,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC1B,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG;QAAE,OAAO,EAAE,CAAC;IACxC,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG;QAAE,OAAO,EAAE,CAAC;IAExC,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QAC7D,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IAED,OAAO,MAAM,CAAC;AACf,CAAC"}

package/build/array/array-sample.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Returns a single random element from an array.
+ *
+ * @template T - The type of array elements
+ * @param array - The array to sample from
+ * @returns A random element, or `undefined` if the array is empty
+ *
+ * @example
+ * ```typescript
+ * ArraySample([1, 2, 3, 4, 5]); // e.g. 3
+ * ```
+ */
+export declare function ArraySample<T>(array: T[]): T | undefined;
+/**
+ * Returns `n` unique random elements from an array (without replacement).
+ * If `n` exceeds the array length, all elements are returned in random order.
+ *
+ * @template T - The type of array elements
+ * @param array - The array to sample from
+ * @param n - How many elements to sample
+ * @returns An array of `n` randomly selected elements
+ *
+ * @example
+ * ```typescript
+ * ArraySample([1, 2, 3, 4, 5], 3); // e.g. [4, 1, 3]
+ * ```
+ */
+export declare function ArraySample<T>(array: T[], n: number): T[];
+//# sourceMappingURL=array-sample.d.ts.map

package/build/array/array-sample.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-sample.d.ts","sourceRoot":"","sources":["../../src/array/array-sample.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,SAAS,CAAC;AAE1D;;;;;;;;;;;;;GAaG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,CAAC"}

package/build/array/array-sample.js

@@ -0,0 +1,19 @@
+export function ArraySample(array, n) {
+    if (!array || array.length === 0) {
+        return n !== undefined ? [] : undefined;
+    }
+    if (n === undefined) {
+        return array[Math.floor(Math.random() * array.length)];
+    }
+    // Fisher-Yates partial shuffle for O(n) sampling
+    const copy = [...array];
+    const count = Math.min(n, copy.length);
+    for (let i = 0; i < count; i++) {
+        const j = i + Math.floor(Math.random() * (copy.length - i));
+        const tmp = copy[j];
+        copy[j] = copy[i];
+        copy[i] = tmp;
+    }
+    return copy.slice(0, count);
+}
+//# sourceMappingURL=array-sample.js.map

package/build/array/array-sample.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-sample.js","sourceRoot":"","sources":["../../src/array/array-sample.ts"],"names":[],"mappings":"AA8BA,MAAM,UAAU,WAAW,CAAI,KAAU,EAAE,CAAU;IACpD,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IACzC,CAAC;IAED,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACrB,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,iDAAiD;IACjD,MAAM,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IACxB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAM,CAAC;QACzB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAM,CAAC;QACvB,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACf,CAAC;IAED,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAC7B,CAAC"}

package/build/array/array-shuffle.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Returns a shuffled copy of the array using the Fisher-Yates algorithm.
+ * @param array The array to shuffle.
+ * @returns A new shuffled array.
+ * @note Uses Math.random() — not cryptographically secure. Do not use for security-sensitive operations.
+ */
+export declare function ArrayShuffle<T>(array: T[]): T[];
+//# sourceMappingURL=array-shuffle.d.ts.map

package/build/array/array-shuffle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-shuffle.d.ts","sourceRoot":"","sources":["../../src/array/array-shuffle.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAa/C"}

package/build/array/array-shuffle.js

@@ -0,0 +1,19 @@
+/**
+ * Returns a shuffled copy of the array using the Fisher-Yates algorithm.
+ * @param array The array to shuffle.
+ * @returns A new shuffled array.
+ * @note Uses Math.random() — not cryptographically secure. Do not use for security-sensitive operations.
+ */
+export function ArrayShuffle(array) {
+    if (!array)
+        return [];
+    const result = [...array];
+    for (let i = result.length - 1; i > 0; i--) {
+        const j = Math.floor(Math.random() * (i + 1));
+        const temp = result[i];
+        result[i] = result[j];
+        result[j] = temp;
+    }
+    return result;
+}
+//# sourceMappingURL=array-shuffle.js.map

package/build/array/array-shuffle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-shuffle.js","sourceRoot":"","sources":["../../src/array/array-shuffle.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAI,KAAU;IACzC,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IAEtB,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAE1B,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAM,CAAC;QAC3B,MAAM,CAAC,CAAC,CAAC,GAAG,IAAS,CAAC;IACvB,CAAC;IAED,OAAO,MAAM,CAAC;AACf,CAAC"}

package/build/array/array-sort-by.d.ts

@@ -0,0 +1,20 @@
+import type { TTransform } from './types';
+/**
+ * Returns a new array sorted by the value produced by `keyFn`, without mutating the original.
+ *
+ * @template T - The type of array elements
+ * @param array - The array to sort
+ * @param keyFn - Function that extracts the sort key from each element
+ * @param direction - Sort direction: `'asc'` (default) or `'desc'`
+ * @returns A sorted copy of the array
+ *
+ * @example
+ * ```typescript
+ * ArraySortBy([{ name: 'Charlie' }, { name: 'Alice' }], (u) => u.name);
+ * // [{ name: 'Alice' }, { name: 'Charlie' }]
+ *
+ * ArraySortBy([3, 1, 2], (n) => n, 'desc'); // [3, 2, 1]
+ * ```
+ */
+export declare function ArraySortBy<T>(array: T[], keyFn: TTransform<T, string | number>, direction?: 'asc' | 'desc'): T[];
+//# sourceMappingURL=array-sort-by.d.ts.map

package/build/array/array-sort-by.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-sort-by.d.ts","sourceRoot":"","sources":["../../src/array/array-sort-by.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAE1C;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC5B,KAAK,EAAE,CAAC,EAAE,EACV,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC,EACrC,SAAS,GAAE,KAAK,GAAG,MAAc,GAC/B,CAAC,EAAE,CAWL"}

package/build/array/array-sort-by.js

@@ -0,0 +1,31 @@
+/**
+ * Returns a new array sorted by the value produced by `keyFn`, without mutating the original.
+ *
+ * @template T - The type of array elements
+ * @param array - The array to sort
+ * @param keyFn - Function that extracts the sort key from each element
+ * @param direction - Sort direction: `'asc'` (default) or `'desc'`
+ * @returns A sorted copy of the array
+ *
+ * @example
+ * ```typescript
+ * ArraySortBy([{ name: 'Charlie' }, { name: 'Alice' }], (u) => u.name);
+ * // [{ name: 'Alice' }, { name: 'Charlie' }]
+ *
+ * ArraySortBy([3, 1, 2], (n) => n, 'desc'); // [3, 2, 1]
+ * ```
+ */
+export function ArraySortBy(array, keyFn, direction = 'asc') {
+    if (!array)
+        return [];
+    return [...array].sort((a, b) => {
+        const keyA = keyFn(a);
+        const keyB = keyFn(b);
+        if (keyA < keyB)
+            return direction === 'asc' ? -1 : 1;
+        if (keyA > keyB)
+            return direction === 'asc' ? 1 : -1;
+        return 0;
+    });
+}
+//# sourceMappingURL=array-sort-by.js.map

package/build/array/array-sort-by.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-sort-by.js","sourceRoot":"","sources":["../../src/array/array-sort-by.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,WAAW,CAC1B,KAAU,EACV,KAAqC,EACrC,YAA4B,KAAK;IAEjC,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IAEtB,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAEtB,IAAI,IAAI,GAAG,IAAI;YAAE,OAAO,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,IAAI,IAAI,GAAG,IAAI;YAAE,OAAO,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,OAAO,CAAC,CAAC;IACV,CAAC,CAAC,CAAC;AACJ,CAAC"}

package/build/array/array-zip.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Zips multiple arrays together, pairing elements at the same index.
+ * The result length is capped at the shortest input array.
+ *
+ * @param arrays - Two or more arrays to zip
+ * @returns Array of tuples — one tuple per index position
+ *
+ * @example
+ * ```typescript
+ * ArrayZip([1, 2, 3], ['a', 'b', 'c']); // [[1, 'a'], [2, 'b'], [3, 'c']]
+ *
+ * // Stops at shortest:
+ * ArrayZip([1, 2, 3], ['a', 'b']); // [[1, 'a'], [2, 'b']]
+ *
+ * // Three arrays:
+ * ArrayZip([1, 2], ['a', 'b'], [true, false]); // [[1, 'a', true], [2, 'b', false]]
+ * ```
+ */
+export declare function ArrayZip<T extends readonly unknown[][]>(...arrays: T): {
+    [K in keyof T]: T[K] extends (infer V)[] ? V : never;
+}[];
+//# sourceMappingURL=array-zip.d.ts.map

package/build/array/array-zip.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-zip.d.ts","sourceRoot":"","sources":["../../src/array/array-zip.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAS,SAAS,OAAO,EAAE,EAAE,EACtD,GAAG,MAAM,EAAE,CAAC,GACV;KAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,KAAK;CAAE,EAAE,CAO5D"}

package/build/array/array-zip.js

@@ -0,0 +1,25 @@
+/**
+ * Zips multiple arrays together, pairing elements at the same index.
+ * The result length is capped at the shortest input array.
+ *
+ * @param arrays - Two or more arrays to zip
+ * @returns Array of tuples — one tuple per index position
+ *
+ * @example
+ * ```typescript
+ * ArrayZip([1, 2, 3], ['a', 'b', 'c']); // [[1, 'a'], [2, 'b'], [3, 'c']]
+ *
+ * // Stops at shortest:
+ * ArrayZip([1, 2, 3], ['a', 'b']); // [[1, 'a'], [2, 'b']]
+ *
+ * // Three arrays:
+ * ArrayZip([1, 2], ['a', 'b'], [true, false]); // [[1, 'a', true], [2, 'b', false]]
+ * ```
+ */
+export function ArrayZip(...arrays) {
+    if (!arrays.length)
+        return [];
+    const minLen = Math.min(...arrays.map((a) => a.length));
+    return Array.from({ length: minLen }, (_, i) => arrays.map((a) => a[i]));
+}
+//# sourceMappingURL=array-zip.js.map

package/build/array/array-zip.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-zip.js","sourceRoot":"","sources":["../../src/array/array-zip.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,QAAQ,CACvB,GAAG,MAAS;IAEZ,IAAI,CAAC,MAAM,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAE9B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACxD,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC9C,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACuC,CAAC;AACjE,CAAC"}

package/build/array/array.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=array.test.d.ts.map

package/build/array/array.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.test.d.ts","sourceRoot":"","sources":["../../src/array/array.test.ts"],"names":[],"mappings":""}