@aztec/foundation 0.0.0-test.1 → 0.0.1-commit.017a351

package/dest/buffer/buffer32.d.ts

@@ -1,91 +1,54 @@
-/// <reference types="node" resolution-mode="require"/>
-/// <reference types="node" resolution-mode="require"/>
-import type { Fr } from '@aztec/foundation/fields';
+import type { Fr } from '@aztec/foundation/curves/bn254';
 import { BufferReader } from '@aztec/foundation/serialize';
+import { inspect } from 'util';
 /**
- * A class representing a 32 byte Buffer.
+ * Abstract unbranded base class for 32-byte buffers.
+ * Extend this instead of Buffer32 when defining a branded subtype
+ * to avoid inheriting Buffer32's `_branding`.
  */
-export declare class Buffer32 {
-    /**
-     * The buffer containing the hash.
-     */
+export declare abstract class BaseBuffer32 {
+    /** The buffer containing the data. */
     buffer: Buffer;
-    /**
-     * The size of the hash in bytes.
-     */
+    /** The size of the buffer in bytes. */
     static SIZE: number;
-    /**
-     * Buffer32 with value zero.
-     */
-    static ZERO: Buffer32;
     constructor(
-    /**
-     * The buffer containing the hash.
-     */
+    /** The buffer containing the data. */
     buffer: Buffer);
-    /**
-     * Returns the raw buffer of the hash.
-     * @returns The buffer containing the hash.
-     */
-    toBuffer(): Buffer;
-    /**
-     * Creates a Buffer32 from a buffer.
-     * @param buffer - The buffer to create from.
-     * @returns A new Buffer32 object.
-     */
-    static fromBuffer(buffer: Buffer | BufferReader): Buffer32;
-    /**
-     * Checks if this hash and another hash are equal.
-     * @param hash - A hash to compare with.
-     * @returns True if the hashes are equal, false otherwise.
-     */
-    equals(hash: Buffer32): boolean;
-    /**
-     * Returns true if this hash is zero.
-     * @returns True if this hash is zero.
-     */
+    /** Returns the raw buffer. */
+    toBuffer(): Buffer<ArrayBufferLike>;
+    /** Checks if this and another buffer are equal. */
+    equals(hash: BaseBuffer32): boolean;
+    /** Returns true if all bytes are zero. */
     isZero(): boolean;
-    /**
-     * Convert this hash to a hex string.
-     * @returns The hex string.
-     */
+    /** Convert to a hex string. */
     toString(): `0x${string}`;
+    [inspect.custom](): string;
     toJSON(): `0x${string}`;
-    /**
-     * Convert this hash to a big int.
-     * @returns The big int.
-     */
+    /** Convert to a big int. */
     toBigInt(): bigint;
-    /**
-     * Creates a Buffer32 from a bigint.
-     * @param hash - The tx hash as a big int.
-     * @returns The Buffer32.
-     */
+}
+/** A branded 32-byte buffer. */
+export declare class Buffer32 extends BaseBuffer32 {
+    /** Branding for nominal typing. */
+    private readonly _branding;
+    /** Buffer32 with value zero. */
+    static ZERO: Buffer32;
+    /** Creates a Buffer32 from a buffer. */
+    static fromBuffer(buffer: Buffer | BufferReader): Buffer32;
+    /** Creates a Buffer32 from a bigint. */
     static fromBigInt(hash: bigint): Buffer32;
     static fromField(hash: Fr): Buffer32;
     /**
-     * Converts this hash from a buffer of 28 bytes.
-     * Verifies the input is 28 bytes.
+     * Converts from a buffer of 28 bytes.
      * @param buffer - The 28 byte buffer to construct from.
      * @returns A Buffer32 created from the input buffer with 4 bytes 0 padding at the front.
      */
     static fromBuffer28(buffer: Buffer): Buffer32;
-    /**
-     * Converts a string into a Buffer32 object.
-     * @param str - The TX hash in string format.
-     * @returns A new Buffer32 object.
-     */
+    /** Converts a string into a Buffer32 object. */
     static fromString(str: string): Buffer32;
-    /**
-     * Converts a number into a Buffer32 object.
-     * @param num - The number to convert.
-     * @returns A new Buffer32 object.
-     */
+    /** Converts a number into a Buffer32 object. */
     static fromNumber(num: number): Buffer32;
-    /**
-     * Generates a random Buffer32.
-     * @returns A new Buffer32 object.
-     */
+    /** Generates a random Buffer32. */
     static random(): Buffer32;
 }
-//# sourceMappingURL=buffer32.d.ts.map
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYnVmZmVyMzIuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9idWZmZXIvYnVmZmVyMzIudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQ0EsT0FBTyxLQUFLLEVBQUUsRUFBRSxFQUFFLE1BQU0sZ0NBQWdDLENBQUM7QUFDekQsT0FBTyxFQUFFLFlBQVksRUFBc0MsTUFBTSw2QkFBNkIsQ0FBQztBQUUvRixPQUFPLEVBQUUsT0FBTyxFQUFFLE1BQU0sTUFBTSxDQUFDO0FBSS9COzs7O0dBSUc7QUFDSCw4QkFBc0IsWUFBWTtJQUs5QixzQ0FBc0M7SUFDL0IsTUFBTSxFQUFFLE1BQU07SUFMdkIsdUNBQXVDO0lBQ3ZDLE9BQWMsSUFBSSxTQUFNO0lBRXhCO0lBQ0Usc0NBQXNDO0lBQy9CLE1BQU0sRUFBRSxNQUFNLEVBS3RCO0lBRUQsOEJBQThCO0lBQ3ZCLFFBQVEsNEJBRWQ7SUFFRCxtREFBbUQ7SUFDNUMsTUFBTSxDQUFDLElBQUksRUFBRSxZQUFZLEdBQUcsT0FBTyxDQUV6QztJQUVELDBDQUEwQztJQUNuQyxNQUFNLElBQUksT0FBTyxDQUV2QjtJQUVELCtCQUErQjtJQUN4QixRQUFRLGtCQUVkO0lBRUQsQ0FBQyxPQUFPLENBQUMsTUFBTSxDQUFDLFdBRWY7SUFFRCxNQUFNLGtCQUVMO0lBRUQsNEJBQTRCO0lBQ3JCLFFBQVEsV0FFZDtDQUNGO0FBRUQsZ0NBQWdDO0FBQ2hDLHFCQUFhLFFBQVMsU0FBUSxZQUFZO0lBQ3hDLG1DQUFtQztJQUNuQyxpQkFBeUIsU0FBUyxDQUFhO0lBRS9DLGdDQUFnQztJQUNoQyxPQUFjLElBQUksV0FBNkM7SUFFL0Qsd0NBQXdDO0lBQ3hDLE9BQWMsVUFBVSxDQUFDLE1BQU0sRUFBRSxNQUFNLEdBQUcsWUFBWSxZQUdyRDtJQUVELHdDQUF3QztJQUN4QyxPQUFjLFVBQVUsQ0FBQyxJQUFJLEVBQUUsTUFBTSxZQUVwQztJQUVELE9BQWMsU0FBUyxDQUFDLElBQUksRUFBRSxFQUFFLFlBRS9CO0lBRUQ7Ozs7T0FJRztJQUNILE9BQWMsWUFBWSxDQUFDLE1BQU0sRUFBRSxNQUFNLFlBTXhDO0lBRUQsZ0RBQWdEO0lBQ2hELE9BQWMsVUFBVSxDQUFDLEdBQUcsRUFBRSxNQUFNLEdBQUcsUUFBUSxDQVE5QztJQUVELGdEQUFnRDtJQUNoRCxPQUFjLFVBQVUsQ0FBQyxHQUFHLEVBQUUsTUFBTSxHQUFHLFFBQVEsQ0FFOUM7SUFFRCxtQ0FBbUM7SUFDbkMsT0FBYyxNQUFNLElBQUksUUFBUSxDQUUvQjtDQUNGIn0=

package/dest/buffer/buffer32.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"buffer32.d.ts","sourceRoot":"","sources":["../../src/buffer/buffer32.ts"],"names":[],"mappings":";;AACA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AACnD,OAAO,EAAE,YAAY,EAAsC,MAAM,6BAA6B,CAAC;AAI/F;;GAEG;AACH,qBAAa,QAAQ;IAYjB;;OAEG;IACI,MAAM,EAAE,MAAM;IAdvB;;OAEG;IACH,OAAc,IAAI,SAAM;IAExB;;OAEG;IACH,OAAc,IAAI,WAA6C;;IAG7D;;OAEG;IACI,MAAM,EAAE,MAAM;IAOvB;;;OAGG;IACI,QAAQ;IAIf;;;;OAIG;WACW,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY;IAKtD;;;;OAIG;IACI,MAAM,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO;IAItC;;;OAGG;IACI,MAAM,IAAI,OAAO;IAIxB;;;OAGG;IACI,QAAQ;IAIf,MAAM;IAIN;;;OAGG;IACI,QAAQ;IAGf;;;;OAIG;WACW,UAAU,CAAC,IAAI,EAAE,MAAM;WAIvB,SAAS,CAAC,IAAI,EAAE,EAAE;IAIhC;;;;;OAKG;WACW,YAAY,CAAC,MAAM,EAAE,MAAM;IAQzC;;;;OAIG;WACW,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,QAAQ;IAU/C;;;;OAIG;WACW,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,QAAQ;IAI/C;;;OAGG;WACW,MAAM,IAAI,QAAQ;CAGjC"}
+{"version":3,"file":"buffer32.d.ts","sourceRoot":"","sources":["../../src/buffer/buffer32.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AACzD,OAAO,EAAE,YAAY,EAAsC,MAAM,6BAA6B,CAAC;AAE/F,OAAO,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AAI/B;;;;GAIG;AACH,8BAAsB,YAAY;IAK9B,sCAAsC;IAC/B,MAAM,EAAE,MAAM;IALvB,uCAAuC;IACvC,OAAc,IAAI,SAAM;IAExB;IACE,sCAAsC;IAC/B,MAAM,EAAE,MAAM,EAKtB;IAED,8BAA8B;IACvB,QAAQ,4BAEd;IAED,mDAAmD;IAC5C,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO,CAEzC;IAED,0CAA0C;IACnC,MAAM,IAAI,OAAO,CAEvB;IAED,+BAA+B;IACxB,QAAQ,kBAEd;IAED,CAAC,OAAO,CAAC,MAAM,CAAC,WAEf;IAED,MAAM,kBAEL;IAED,4BAA4B;IACrB,QAAQ,WAEd;CACF;AAED,gCAAgC;AAChC,qBAAa,QAAS,SAAQ,YAAY;IACxC,mCAAmC;IACnC,iBAAyB,SAAS,CAAa;IAE/C,gCAAgC;IAChC,OAAc,IAAI,WAA6C;IAE/D,wCAAwC;IACxC,OAAc,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,YAGrD;IAED,wCAAwC;IACxC,OAAc,UAAU,CAAC,IAAI,EAAE,MAAM,YAEpC;IAED,OAAc,SAAS,CAAC,IAAI,EAAE,EAAE,YAE/B;IAED;;;;OAIG;IACH,OAAc,YAAY,CAAC,MAAM,EAAE,MAAM,YAMxC;IAED,gDAAgD;IAChD,OAAc,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,QAAQ,CAQ9C;IAED,gDAAgD;IAChD,OAAc,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,QAAQ,CAE9C;IAED,mCAAmC;IACnC,OAAc,MAAM,IAAI,QAAQ,CAE/B;CACF"}

package/dest/buffer/buffer32.js

@@ -1,79 +1,58 @@
-import { randomBytes } from '@aztec/foundation/crypto';
+var _computedKey;
+import { randomBytes } from '@aztec/foundation/crypto/random';
 import { BufferReader, deserializeBigInt, serializeBigInt } from '@aztec/foundation/serialize';
+import { inspect } from 'util';
 import { bufferToHex } from '../string/index.js';
+_computedKey = inspect.custom;
 /**
- * A class representing a 32 byte Buffer.
- */ export class Buffer32 {
+ * Abstract unbranded base class for 32-byte buffers.
+ * Extend this instead of Buffer32 when defining a branded subtype
+ * to avoid inheriting Buffer32's `_branding`.
+ */ export class BaseBuffer32 {
     buffer;
-    /**
-   * The size of the hash in bytes.
-   */ static SIZE = 32;
-    /**
-   * Buffer32 with value zero.
-   */ static ZERO = new Buffer32(Buffer.alloc(Buffer32.SIZE));
-    constructor(/**
-     * The buffer containing the hash.
-     */ buffer){
+    /** The size of the buffer in bytes. */ static SIZE = 32;
+    constructor(/** The buffer containing the data. */ buffer){
         this.buffer = buffer;
-        if (buffer.length !== Buffer32.SIZE) {
-            throw new Error(`Expected buffer to have length ${Buffer32.SIZE} but was ${buffer.length}`);
+        if (buffer.length !== BaseBuffer32.SIZE) {
+            throw new Error(`Expected buffer to have length ${BaseBuffer32.SIZE} but was ${buffer.length}`);
         }
     }
-    /**
-   * Returns the raw buffer of the hash.
-   * @returns The buffer containing the hash.
-   */ toBuffer() {
+    /** Returns the raw buffer. */ toBuffer() {
         return this.buffer;
     }
-    /**
-   * Creates a Buffer32 from a buffer.
-   * @param buffer - The buffer to create from.
-   * @returns A new Buffer32 object.
-   */ static fromBuffer(buffer) {
-        const reader = BufferReader.asReader(buffer);
-        return new Buffer32(reader.readBytes(Buffer32.SIZE));
-    }
-    /**
-   * Checks if this hash and another hash are equal.
-   * @param hash - A hash to compare with.
-   * @returns True if the hashes are equal, false otherwise.
-   */ equals(hash) {
+    /** Checks if this and another buffer are equal. */ equals(hash) {
         return this.buffer.equals(hash.buffer);
     }
-    /**
-   * Returns true if this hash is zero.
-   * @returns True if this hash is zero.
-   */ isZero() {
+    /** Returns true if all bytes are zero. */ isZero() {
         return this.buffer.equals(Buffer.alloc(32, 0));
     }
-    /**
-   * Convert this hash to a hex string.
-   * @returns The hex string.
-   */ toString() {
+    /** Convert to a hex string. */ toString() {
         return bufferToHex(this.buffer);
     }
+    [_computedKey]() {
+        return `Buffer32<${this.toString()}>`;
+    }
     toJSON() {
         return this.toString();
     }
-    /**
-   * Convert this hash to a big int.
-   * @returns The big int.
-   */ toBigInt() {
-        return deserializeBigInt(this.buffer, 0, Buffer32.SIZE).elem;
+    /** Convert to a big int. */ toBigInt() {
+        return deserializeBigInt(this.buffer, 0, BaseBuffer32.SIZE).elem;
     }
-    /**
-   * Creates a Buffer32 from a bigint.
-   * @param hash - The tx hash as a big int.
-   * @returns The Buffer32.
-   */ static fromBigInt(hash) {
+}
+/** A branded 32-byte buffer. */ export class Buffer32 extends BaseBuffer32 {
+    /** Buffer32 with value zero. */ static ZERO = new Buffer32(Buffer.alloc(Buffer32.SIZE));
+    /** Creates a Buffer32 from a buffer. */ static fromBuffer(buffer) {
+        const reader = BufferReader.asReader(buffer);
+        return new Buffer32(reader.readBytes(Buffer32.SIZE));
+    }
+    /** Creates a Buffer32 from a bigint. */ static fromBigInt(hash) {
         return new Buffer32(serializeBigInt(hash, Buffer32.SIZE));
     }
     static fromField(hash) {
         return new Buffer32(serializeBigInt(hash.toBigInt()));
     }
     /**
-   * Converts this hash from a buffer of 28 bytes.
-   * Verifies the input is 28 bytes.
+   * Converts from a buffer of 28 bytes.
    * @param buffer - The 28 byte buffer to construct from.
    * @returns A Buffer32 created from the input buffer with 4 bytes 0 padding at the front.
    */ static fromBuffer28(buffer) {
@@ -81,35 +60,24 @@ import { bufferToHex } from '../string/index.js';
             throw new Error(`Expected Buffer32 input buffer to be 28 bytes`);
         }
         const padded = Buffer.concat([
-            Buffer.alloc(this.SIZE - 28),
+            Buffer.alloc(Buffer32.SIZE - 28),
             buffer
         ]);
         return new Buffer32(padded);
     }
-    /**
-   * Converts a string into a Buffer32 object.
-   * @param str - The TX hash in string format.
-   * @returns A new Buffer32 object.
-   */ static fromString(str) {
+    /** Converts a string into a Buffer32 object. */ static fromString(str) {
         if (str.startsWith('0x')) {
             str = str.slice(2);
         }
-        if (str.length !== 64) {
-            throw new Error(`Expected string to be 64 characters long, but was ${str.length}`);
+        if (str.length !== Buffer32.SIZE * 2) {
+            throw new Error(`Expected string to be ${Buffer32.SIZE * 2} characters long, but was ${str.length}`);
         }
         return new Buffer32(Buffer.from(str, 'hex'));
     }
-    /**
-   * Converts a number into a Buffer32 object.
-   * @param num - The number to convert.
-   * @returns A new Buffer32 object.
-   */ static fromNumber(num) {
+    /** Converts a number into a Buffer32 object. */ static fromNumber(num) {
         return new Buffer32(serializeBigInt(BigInt(num), Buffer32.SIZE));
     }
-    /**
-   * Generates a random Buffer32.
-   * @returns A new Buffer32 object.
-   */ static random() {
+    /** Generates a random Buffer32. */ static random() {
         return new Buffer32(Buffer.from(randomBytes(Buffer32.SIZE)));
     }
 }

package/dest/buffer/index.d.ts

@@ -1,2 +1,4 @@
 export * from './buffer32.js';
-//# sourceMappingURL=index.d.ts.map
+export * from './buffer16.js';
+export * from './utils.js';
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9idWZmZXIvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsY0FBYyxlQUFlLENBQUM7QUFDOUIsY0FBYyxlQUFlLENBQUM7QUFDOUIsY0FBYyxZQUFZLENBQUMifQ==

package/dest/buffer/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/buffer/index.ts"],"names":[],"mappings":"AAAA,cAAc,eAAe,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/buffer/index.ts"],"names":[],"mappings":"AAAA,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,YAAY,CAAC"}

package/dest/buffer/index.js

@@ -1 +1,3 @@
 export * from './buffer32.js';
+export * from './buffer16.js';
+export * from './utils.js';

package/dest/buffer/utils.d.ts

@@ -0,0 +1,3 @@
+/** Returns the number of bytes in the buffer, excluding any trailing zero bytes. */
+export declare function trimmedBytesLength(buf: Uint8Array): number;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoidXRpbHMuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9idWZmZXIvdXRpbHMudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsb0ZBQW9GO0FBQ3BGLHdCQUFnQixrQkFBa0IsQ0FBQyxHQUFHLEVBQUUsVUFBVSxHQUFHLE1BQU0sQ0FNMUQifQ==

package/dest/buffer/utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../src/buffer/utils.ts"],"names":[],"mappings":"AAAA,oFAAoF;AACpF,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,UAAU,GAAG,MAAM,CAM1D"}

package/dest/buffer/utils.js

@@ -0,0 +1,7 @@
+/** Returns the number of bytes in the buffer, excluding any trailing zero bytes. */ export function trimmedBytesLength(buf) {
+    let end = buf.length;
+    while(end > 0 && buf[end - 1] === 0){
+        end--;
+    }
+    return end;
+}

package/dest/collection/array.d.ts

@@ -1,5 +1,3 @@
-/// <reference types="node" resolution-mode="require"/>
-/// <reference types="node" resolution-mode="require"/>
 import type { Tuple } from '../serialize/types.js';
 /**
  * Pads an array to the target length by appending an element to its end. Throws if target length exceeds the input array length. Does not modify the input array.
@@ -46,6 +44,13 @@ export declare function times<T>(n: number, fn: (i: number) => T): T[];
  * @returns The array with the result from all executions.
  */
 export declare function timesAsync<T>(n: number, fn: (i: number) => Promise<T>): Promise<T[]>;
+/**
+ * Filters an array with an async predicate. Fires all predicate promises in parallel.
+ * @param arr - The array to filter.
+ * @param fn - The async function to determine if an item should be included.
+ * @returns A promise that resolves to the filtered array.
+ */
+export declare function filterAsync<T>(arr: T[], fn: (item: T) => Promise<boolean>): Promise<T[]>;
 /**
  * Executes the given async function n times in parallel and returns the results in an array.
  * @param n - How many times to repeat.
@@ -71,6 +76,14 @@ export declare function arraySerializedSizeOfNonEmpty(arr: (({
  * @returns A new array.
  */
 export declare function unique<T>(arr: T[]): T[];
+/**
+ * Removes duplicates from the given array using a key function. The first occurrence of each key is kept.
+ * @param arr - The array.
+ * @param keyFn - A function that returns a primitive key for each element. Elements with the same key are
+ *               considered duplicates.
+ * @returns A new array.
+ */
+export declare function uniqueBy<T, K extends string | number | bigint>(arr: T[], keyFn: (item: T) => K): T[];
 /**
  * Removes all undefined elements from the array.
  * @param arr - The array.
@@ -87,15 +100,36 @@ export declare function areArraysEqual<T>(a: T[], b: T[], eq?: (a: T, b: T) => b
  * @param arr - The array.
  * @param fn - The function to get the value to compare.
  */
-export declare function maxBy<T>(arr: T[], fn: (x: T) => number): T | undefined;
+export declare function maxBy<T>(arr: T[], fn: (x: T) => number | bigint): T | undefined;
 /** Computes the sum of a numeric array. */
 export declare function sum(arr: number[]): number;
 /** Computes the median of a numeric array. Returns undefined if array is empty. */
 export declare function median(arr: number[]): number | undefined;
+/** Computes the median of a bigint array. Returns undefined if array is empty. */
+export declare function median(arr: bigint[]): bigint | undefined;
 /** Computes the mean of a numeric array. Returns undefined if the array is empty. */
 export declare function mean(values: number[]): number | undefined;
 /** Computes the variance of a numeric array. Returns undefined if there are less than 2 points. */
 export declare function variance(values: number[]): number | undefined;
 /** Computes the standard deviation of a numeric array. Returns undefined if there are less than 2 points. */
 export declare function stdDev(values: number[]): number | undefined;
-//# sourceMappingURL=array.d.ts.map
+/** Counts how many items from the beginning of the array match the given predicate. */
+export declare function countWhile<T>(collection: T[], predicate: (x: T) => boolean): number;
+/** Splits the given iterable into chunks of the given size. Last chunk may be of smaller than the requested size. */
+export declare function chunk<T>(items: T[], chunkSize: number): T[][];
+/**
+ * Splits the given array into chunks of the given size, wrapping around to the beginning
+ * if the last chunk would be smaller than the requested size.
+ * Returns empty array for empty input. Returns single chunk with all items if chunkSize <= 0.
+ */
+export declare function chunkWrapAround<T>(items: T[], chunkSize: number): T[][];
+/**
+ * Splits the given iterable into chunks based on the key returned by the given function.
+ * Items must be contiguous to be included in the same chunk.
+ */
+export declare function chunkBy<T, U>(items: T[], fn: (item: T) => U): T[][];
+/** Partitions the given iterable into two arrays based on the predicate. */
+export declare function partition<T>(items: T[], predicate: (item: T) => boolean): [T[], T[]];
+/** Partitions the given iterable into two arrays based on the predicate. */
+export declare function partitionAsync<T>(items: T[], predicate: (item: T) => Promise<boolean>): Promise<[T[], T[]]>;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYXJyYXkuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9jb2xsZWN0aW9uL2FycmF5LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sS0FBSyxFQUFFLEtBQUssRUFBRSxNQUFNLHVCQUF1QixDQUFDO0FBRW5EOzs7Ozs7O0dBT0c7QUFDSCx3QkFBZ0IsV0FBVyxDQUFDLENBQUMsRUFBRSxDQUFDLFNBQVMsTUFBTSxFQUM3QyxHQUFHLEVBQUUsQ0FBQyxFQUFFLEVBQ1IsSUFBSSxFQUFFLENBQUMsRUFDUCxNQUFNLEVBQUUsQ0FBQyxFQUNULFFBQVEsU0FBcUMsR0FDNUMsS0FBSyxDQUFDLENBQUMsRUFBRSxDQUFDLENBQUMsQ0FNYjtBQUVELDhFQUE4RTtBQUM5RSx3QkFBZ0IscUJBQXFCLENBQUMsQ0FBQyxFQUFFLEdBQUcsRUFBRSxDQUFDLEVBQUUsRUFBRSxPQUFPLEVBQUUsQ0FBQyxJQUFJLEVBQUUsQ0FBQyxLQUFLLE9BQU8sR0FBRyxDQUFDLEVBQUUsQ0FHckY7QUFFRDs7Ozs7O0dBTUc7QUFDSCx3QkFBZ0IsYUFBYSxDQUFDLENBQUMsRUFBRSxDQUFDLFNBQVMsTUFBTSxFQUFFLEdBQUcsRUFBRSxDQUFDLEVBQUUsRUFBRSxJQUFJLEVBQUUsQ0FBQyxFQUFFLE1BQU0sRUFBRSxDQUFDLEdBQUcsS0FBSyxDQUFDLENBQUMsRUFBRSxDQUFDLENBQUMsQ0FNNUY7QUFFRDs7OztHQUlHO0FBQ0gsd0JBQWdCLFlBQVksQ0FBQyxDQUFDLEVBQUUsR0FBRyxFQUFFLENBQUMsRUFBRSxFQUFFLE9BQU8sRUFBRSxDQUFDLElBQUksRUFBRSxDQUFDLEtBQUssT0FBTyxHQUFHLE9BQU8sQ0FPaEY7QUFFRDs7OztHQUlHO0FBQ0gsd0JBQWdCLG1CQUFtQixDQUFDLENBQUMsRUFBRSxHQUFHLEVBQUUsQ0FBQyxFQUFFLEVBQUUsT0FBTyxFQUFFLENBQUMsSUFBSSxFQUFFLENBQUMsS0FBSyxPQUFPLEdBQUcsTUFBTSxDQUV0RjtBQUVEOzs7OztHQUtHO0FBQ0gsd0JBQWdCLEtBQUssQ0FBQyxDQUFDLEVBQUUsQ0FBQyxFQUFFLE1BQU0sRUFBRSxFQUFFLEVBQUUsQ0FBQyxDQUFDLEVBQUUsTUFBTSxLQUFLLENBQUMsR0FBRyxDQUFDLEVBQUUsQ0FFN0Q7QUFFRDs7Ozs7R0FLRztBQUNILHdCQUFzQixVQUFVLENBQUMsQ0FBQyxFQUFFLENBQUMsRUFBRSxNQUFNLEVBQUUsRUFBRSxFQUFFLENBQUMsQ0FBQyxFQUFFLE1BQU0sS0FBSyxPQUFPLENBQUMsQ0FBQyxDQUFDLEdBQUcsT0FBTyxDQUFDLENBQUMsRUFBRSxDQUFDLENBTTFGO0FBRUQ7Ozs7O0dBS0c7QUFDSCx3QkFBc0IsV0FBVyxDQUFDLENBQUMsRUFBRSxHQUFHLEVBQUUsQ0FBQyxFQUFFLEVBQUUsRUFBRSxFQUFFLENBQUMsSUFBSSxFQUFFLENBQUMsS0FBSyxPQUFPLENBQUMsT0FBTyxDQUFDLEdBQUcsT0FBTyxDQUFDLENBQUMsRUFBRSxDQUFDLENBRzlGO0FBRUQ7Ozs7O0dBS0c7QUFDSCx3QkFBc0IsYUFBYSxDQUFDLENBQUMsRUFBRSxDQUFDLEVBQUUsTUFBTSxFQUFFLEVBQUUsRUFBRSxDQUFDLENBQUMsRUFBRSxNQUFNLEtBQUssT0FBTyxDQUFDLENBQUMsQ0FBQyxHQUFHLE9BQU8sQ0FBQyxDQUFDLEVBQUUsQ0FBQyxDQU83RjtBQUVEOzs7O0dBSUc7QUFDSCx3QkFBZ0IsNkJBQTZCLENBQzNDLEdBQUcsRUFBRSxDQUFDLENBQUM7SUFBRSxNQUFNLEVBQUUsTUFBTSxPQUFPLENBQUE7Q0FBRSxHQUFHO0lBQUUsT0FBTyxFQUFFLE1BQU0sT0FBTyxDQUFBO0NBQUUsQ0FBQyxHQUFHO0lBQUUsUUFBUSxFQUFFLE1BQU0sTUFBTSxDQUFBO0NBQUUsQ0FBQyxFQUFFLFVBTS9GO0FBRUQ7Ozs7R0FJRztBQUNILHdCQUFnQixNQUFNLENBQUMsQ0FBQyxFQUFFLEdBQUcsRUFBRSxDQUFDLEVBQUUsR0FBRyxDQUFDLEVBQUUsQ0FFdkM7QUFFRDs7Ozs7O0dBTUc7QUFDSCx3QkFBZ0IsUUFBUSxDQUFDLENBQUMsRUFBRSxDQUFDLFNBQVMsTUFBTSxHQUFHLE1BQU0sR0FBRyxNQUFNLEVBQUUsR0FBRyxFQUFFLENBQUMsRUFBRSxFQUFFLEtBQUssRUFBRSxDQUFDLElBQUksRUFBRSxDQUFDLEtBQUssQ0FBQyxHQUFHLENBQUMsRUFBRSxDQVdwRztBQUVEOzs7O0dBSUc7QUFDSCx3QkFBZ0IsWUFBWSxDQUFDLENBQUMsRUFBRSxHQUFHLEVBQUUsQ0FBQyxDQUFDLEdBQUcsU0FBUyxDQUFDLEVBQUUsR0FBRyxDQUFDLEVBQUUsQ0FFM0Q7QUFFRDs7R0FFRztBQUNILHdCQUFnQixjQUFjLENBQUMsQ0FBQyxFQUFFLENBQUMsRUFBRSxDQUFDLEVBQUUsRUFBRSxDQUFDLEVBQUUsQ0FBQyxFQUFFLEVBQUUsRUFBRSxHQUFFLENBQUMsQ0FBQyxFQUFFLENBQUMsRUFBRSxDQUFDLEVBQUUsQ0FBQyxLQUFLLE9BQWlDLEdBQUcsT0FBTyxDQVVoSDtBQUVEOzs7OztHQUtHO0FBQ0gsd0JBQWdCLEtBQUssQ0FBQyxDQUFDLEVBQUUsR0FBRyxFQUFFLENBQUMsRUFBRSxFQUFFLEVBQUUsRUFBRSxDQUFDLENBQUMsRUFBRSxDQUFDLEtBQUssTUFBTSxHQUFHLE1BQU0sR0FBRyxDQUFDLEdBQUcsU0FBUyxDQUUvRTtBQUVELDJDQUEyQztBQUMzQyx3QkFBZ0IsR0FBRyxDQUFDLEdBQUcsRUFBRSxNQUFNLEVBQUUsR0FBRyxNQUFNLENBRXpDO0FBRUQsbUZBQW1GO0FBQ25GLHdCQUFnQixNQUFNLENBQUMsR0FBRyxFQUFFLE1BQU0sRUFBRSxHQUFHLE1BQU0sR0FBRyxTQUFTLENBQUM7QUFDMUQsa0ZBQWtGO0FBQ2xGLHdCQUFnQixNQUFNLENBQUMsR0FBRyxFQUFFLE1BQU0sRUFBRSxHQUFHLE1BQU0sR0FBRyxTQUFTLENBQUM7QUFtQjFELHFGQUFxRjtBQUNyRix3QkFBZ0IsSUFBSSxDQUFDLE1BQU0sRUFBRSxNQUFNLEVBQUUsc0JBS3BDO0FBRUQsbUdBQW1HO0FBQ25HLHdCQUFnQixRQUFRLENBQUMsTUFBTSxFQUFFLE1BQU0sRUFBRSxzQkFPeEM7QUFFRCw2R0FBNkc7QUFDN0csd0JBQWdCLE1BQU0sQ0FBQyxNQUFNLEVBQUUsTUFBTSxFQUFFLHNCQUt0QztBQUVELHVGQUF1RjtBQUN2Rix3QkFBZ0IsVUFBVSxDQUFDLENBQUMsRUFBRSxVQUFVLEVBQUUsQ0FBQyxFQUFFLEVBQUUsU0FBUyxFQUFFLENBQUMsQ0FBQyxFQUFFLENBQUMsS0FBSyxPQUFPLEdBQUcsTUFBTSxDQVVuRjtBQUVELHFIQUFxSDtBQUNySCx3QkFBZ0IsS0FBSyxDQUFDLENBQUMsRUFBRSxLQUFLLEVBQUUsQ0FBQyxFQUFFLEVBQUUsU0FBUyxFQUFFLE1BQU0sR0FBRyxDQUFDLEVBQUUsRUFBRSxDQVM3RDtBQUVEOzs7O0dBSUc7QUFDSCx3QkFBZ0IsZUFBZSxDQUFDLENBQUMsRUFBRSxLQUFLLEVBQUUsQ0FBQyxFQUFFLEVBQUUsU0FBUyxFQUFFLE1BQU0sR0FBRyxDQUFDLEVBQUUsRUFBRSxDQWN2RTtBQUlEOzs7R0FHRztBQUNILHdCQUFnQixPQUFPLENBQUMsQ0FBQyxFQUFFLENBQUMsRUFBRSxLQUFLLEVBQUUsQ0FBQyxFQUFFLEVBQUUsRUFBRSxFQUFFLENBQUMsSUFBSSxFQUFFLENBQUMsS0FBSyxDQUFDLEdBQUcsQ0FBQyxFQUFFLEVBQUUsQ0F1Qm5FO0FBRUQsNEVBQTRFO0FBQzVFLHdCQUFnQixTQUFTLENBQUMsQ0FBQyxFQUFFLEtBQUssRUFBRSxDQUFDLEVBQUUsRUFBRSxTQUFTLEVBQUUsQ0FBQyxJQUFJLEVBQUUsQ0FBQyxLQUFLLE9BQU8sR0FBRyxDQUFDLENBQUMsRUFBRSxFQUFFLENBQUMsRUFBRSxDQUFDLENBV3BGO0FBRUQsNEVBQTRFO0FBQzVFLHdCQUFzQixjQUFjLENBQUMsQ0FBQyxFQUFFLEtBQUssRUFBRSxDQUFDLEVBQUUsRUFBRSxTQUFTLEVBQUUsQ0FBQyxJQUFJLEVBQUUsQ0FBQyxLQUFLLE9BQU8sQ0FBQyxPQUFPLENBQUMsR0FBRyxPQUFPLENBQUMsQ0FBQyxDQUFDLEVBQUUsRUFBRSxDQUFDLEVBQUUsQ0FBQyxDQUFDLENBV2pIIn0=

package/dest/collection/array.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/collection/array.ts"],"names":[],"mappings":";;AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,uBAAuB,CAAC;AAEnD;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,EAC7C,GAAG,EAAE,CAAC,EAAE,EACR,IAAI,EAAE,CAAC,EACP,MAAM,EAAE,CAAC,EACT,QAAQ,SAAqC,GAC5C,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAMb;AAED,8EAA8E;AAC9E,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE,CAGrF;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAM5F;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO,CAOhF;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAEtF;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE,CAE7D;AAED;;;;;GAKG;AACH,wBAAsB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAM1F;AAED;;;;;GAKG;AACH,wBAAsB,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAO7F;AAED;;;;GAIG;AACH,wBAAgB,6BAA6B,CAC3C,GAAG,EAAE,CAAC,CAAC;IAAE,MAAM,EAAE,MAAM,OAAO,CAAA;CAAE,GAAG;IAAE,OAAO,EAAE,MAAM,OAAO,CAAA;CAAE,CAAC,GAAG;IAAE,QAAQ,EAAE,MAAM,MAAM,CAAA;CAAE,CAAC,EAAE,UAM/F;AAED;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAEvC;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,EAAE,CAE3D;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAiC,GAAG,OAAO,CAUhH;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,GAAG,CAAC,GAAG,SAAS,CAEtE;AAED,2CAA2C;AAC3C,wBAAgB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,MAAM,CAEzC;AAED,mFAAmF;AACnF,wBAAgB,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,sBAOnC;AAED,qFAAqF;AACrF,wBAAgB,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,sBAKpC;AAED,mGAAmG;AACnG,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,sBAOxC;AAED,6GAA6G;AAC7G,wBAAgB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,sBAKtC"}
+{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/collection/array.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,uBAAuB,CAAC;AAEnD;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,EAC7C,GAAG,EAAE,CAAC,EAAE,EACR,IAAI,EAAE,CAAC,EACP,MAAM,EAAE,CAAC,EACT,QAAQ,SAAqC,GAC5C,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAMb;AAED,8EAA8E;AAC9E,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE,CAGrF;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAM5F;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO,CAOhF;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAEtF;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE,CAE7D;AAED;;;;;GAKG;AACH,wBAAsB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAM1F;AAED;;;;;GAKG;AACH,wBAAsB,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAG9F;AAED;;;;;GAKG;AACH,wBAAsB,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAO7F;AAED;;;;GAIG;AACH,wBAAgB,6BAA6B,CAC3C,GAAG,EAAE,CAAC,CAAC;IAAE,MAAM,EAAE,MAAM,OAAO,CAAA;CAAE,GAAG;IAAE,OAAO,EAAE,MAAM,OAAO,CAAA;CAAE,CAAC,GAAG;IAAE,QAAQ,EAAE,MAAM,MAAM,CAAA;CAAE,CAAC,EAAE,UAM/F;AAED;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAEvC;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,GAAG,MAAM,GAAG,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAWpG;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,EAAE,CAE3D;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAiC,GAAG,OAAO,CAUhH;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM,GAAG,CAAC,GAAG,SAAS,CAE/E;AAED,2CAA2C;AAC3C,wBAAgB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,MAAM,CAEzC;AAED,mFAAmF;AACnF,wBAAgB,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,SAAS,CAAC;AAC1D,kFAAkF;AAClF,wBAAgB,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,SAAS,CAAC;AAmB1D,qFAAqF;AACrF,wBAAgB,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,sBAKpC;AAED,mGAAmG;AACnG,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,sBAOxC;AAED,6GAA6G;AAC7G,wBAAgB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,sBAKtC;AAED,uFAAuF;AACvF,wBAAgB,UAAU,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAUnF;AAED,qHAAqH;AACrH,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,GAAG,CAAC,EAAE,EAAE,CAS7D;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,GAAG,CAAC,EAAE,EAAE,CAcvE;AAID;;;GAGG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAuBnE;AAED,4EAA4E;AAC5E,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAWpF;AAED,4EAA4E;AAC5E,wBAAsB,cAAc,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAWjH"}

package/dest/collection/array.js

@@ -76,6 +76,15 @@
     }
     return results;
 }
+/**
+ * Filters an array with an async predicate. Fires all predicate promises in parallel.
+ * @param arr - The array to filter.
+ * @param fn - The async function to determine if an item should be included.
+ * @returns A promise that resolves to the filtered array.
+ */ export async function filterAsync(arr, fn) {
+    const results = await Promise.all(arr.map(fn));
+    return arr.filter((_, i)=>results[i]);
+}
 /**
  * Executes the given async function n times in parallel and returns the results in an array.
  * @param n - How many times to repeat.
@@ -101,6 +110,24 @@
         ...new Set(arr)
     ];
 }
+/**
+ * Removes duplicates from the given array using a key function. The first occurrence of each key is kept.
+ * @param arr - The array.
+ * @param keyFn - A function that returns a primitive key for each element. Elements with the same key are
+ *               considered duplicates.
+ * @returns A new array.
+ */ export function uniqueBy(arr, keyFn) {
+    const seen = new Set();
+    const result = [];
+    for (const item of arr){
+        const key = keyFn(item);
+        if (!seen.has(key)) {
+            seen.add(key);
+            result.push(item);
+        }
+    }
+    return result;
+}
 /**
  * Removes all undefined elements from the array.
  * @param arr - The array.
@@ -132,15 +159,24 @@
 /** Computes the sum of a numeric array. */ export function sum(arr) {
     return arr.reduce((a, b)=>a + b, 0);
 }
-/** Computes the median of a numeric array. Returns undefined if array is empty. */ export function median(arr) {
+export function median(arr) {
     if (arr.length === 0) {
         return undefined;
     }
+    // Handle number array
+    if (typeof arr[0] === 'number') {
+        const sorted = [
+            ...arr
+        ].sort((a, b)=>a - b);
+        const mid = Math.floor(sorted.length / 2);
+        return sorted.length % 2 !== 0 ? sorted[mid] : (sorted[mid - 1] + sorted[mid]) / 2;
+    }
+    // Handle bigint array
     const sorted = [
         ...arr
-    ].sort((a, b)=>a - b);
+    ].sort((a, b)=>a < b ? -1 : a > b ? 1 : 0);
     const mid = Math.floor(sorted.length / 2);
-    return sorted.length % 2 !== 0 ? sorted[mid] : (sorted[mid - 1] + sorted[mid]) / 2;
+    return sorted.length % 2 !== 0 ? sorted[mid] : (sorted[mid - 1] + sorted[mid]) / 2n;
 }
 /** Computes the mean of a numeric array. Returns undefined if the array is empty. */ export function mean(values) {
     if (values.length === 0) {
@@ -162,3 +198,105 @@
     }
     return Math.sqrt(variance(values));
 }
+/** Counts how many items from the beginning of the array match the given predicate. */ export function countWhile(collection, predicate) {
+    let count = 0;
+    for (const item of collection){
+        if (predicate(item)) {
+            count++;
+        } else {
+            break;
+        }
+    }
+    return count;
+}
+/** Splits the given iterable into chunks of the given size. Last chunk may be of smaller than the requested size. */ export function chunk(items, chunkSize) {
+    if (chunkSize <= 0) {
+        throw new Error('Chunk size must be greater than 0');
+    }
+    const chunks = [];
+    for(let i = 0; i < items.length; i += chunkSize){
+        chunks.push(items.slice(i, i + chunkSize));
+    }
+    return chunks;
+}
+/**
+ * Splits the given array into chunks of the given size, wrapping around to the beginning
+ * if the last chunk would be smaller than the requested size.
+ * Returns empty array for empty input. Returns single chunk with all items if chunkSize <= 0.
+ */ export function chunkWrapAround(items, chunkSize) {
+    if (items.length === 0) {
+        return [];
+    }
+    if (chunkSize <= 0 || items.length <= chunkSize) {
+        return [
+            items
+        ];
+    }
+    const remainder = items.length % chunkSize;
+    if (remainder === 0) {
+        return chunk(items, chunkSize);
+    }
+    const wrapAroundCount = chunkSize - remainder;
+    const wrappedItems = [
+        ...items,
+        ...items.slice(0, wrapAroundCount)
+    ];
+    return chunk(wrappedItems, chunkSize);
+}
+const UNINITIALIZED = Symbol('uninitialized');
+/**
+ * Splits the given iterable into chunks based on the key returned by the given function.
+ * Items must be contiguous to be included in the same chunk.
+ */ export function chunkBy(items, fn) {
+    const chunks = [];
+    let currentChunk = [];
+    let currentKey = UNINITIALIZED;
+    for (const item of items){
+        const key = fn(item);
+        if (currentKey === UNINITIALIZED || key !== currentKey) {
+            if (currentChunk.length > 0) {
+                chunks.push(currentChunk);
+            }
+            currentChunk = [
+                item
+            ];
+            currentKey = key;
+        } else {
+            currentChunk.push(item);
+        }
+    }
+    if (currentChunk.length > 0) {
+        chunks.push(currentChunk);
+    }
+    return chunks;
+}
+/** Partitions the given iterable into two arrays based on the predicate. */ export function partition(items, predicate) {
+    const pass = [];
+    const fail = [];
+    for (const item of items){
+        if (predicate(item)) {
+            pass.push(item);
+        } else {
+            fail.push(item);
+        }
+    }
+    return [
+        pass,
+        fail
+    ];
+}
+/** Partitions the given iterable into two arrays based on the predicate. */ export async function partitionAsync(items, predicate) {
+    const pass = [];
+    const fail = [];
+    for (const item of items){
+        if (await predicate(item)) {
+            pass.push(item);
+        } else {
+            fail.push(item);
+        }
+    }
+    return [
+        pass,
+        fail
+    ];
+}

package/dest/collection/index.d.ts

@@ -1,3 +1,5 @@
 export * from './array.js';
+export * from './lru_map.js';
+export * from './lru_set.js';
 export * from './object.js';
-//# sourceMappingURL=index.d.ts.map
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9jb2xsZWN0aW9uL2luZGV4LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLGNBQWMsWUFBWSxDQUFDO0FBQzNCLGNBQWMsY0FBYyxDQUFDO0FBQzdCLGNBQWMsY0FBYyxDQUFDO0FBQzdCLGNBQWMsYUFBYSxDQUFDIn0=

package/dest/collection/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/collection/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/collection/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC"}

package/dest/collection/index.js

@@ -1,2 +1,4 @@
 export * from './array.js';
+export * from './lru_map.js';
+export * from './lru_set.js';
 export * from './object.js';