@aztec/foundation 0.0.1-commit.c31f2472 → 0.0.1-commit.c52d6e7

package/dest/buffer/buffer32.js

@@ -5,54 +5,28 @@ 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]() {
@@ -61,23 +35,24 @@ _computedKey = inspect.custom;
     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.
-   */ 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) {
@@ -85,33 +60,24 @@ _computedKey = inspect.custom;
             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.
-   */ static fromString(str) {
+    /** Converts a string into a Buffer32 object. */ static fromString(str) {
         if (str.startsWith('0x')) {
             str = str.slice(2);
         }
-        if (str.length !== this.SIZE * 2) {
-            throw new Error(`Expected string to be ${this.SIZE * 2} 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,3 +1,4 @@
 export * from './buffer32.js';
 export * from './buffer16.js';
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9idWZmZXIvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsY0FBYyxlQUFlLENBQUM7QUFDOUIsY0FBYyxlQUFlLENBQUMifQ==
+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;AAC9B,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,2 +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

@@ -76,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.
@@ -122,4 +130,6 @@ export declare function chunkWrapAround<T>(items: T[], chunkSize: number): T[][]
 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[]];
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYXJyYXkuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9jb2xsZWN0aW9uL2FycmF5LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sS0FBSyxFQUFFLEtBQUssRUFBRSxNQUFNLHVCQUF1QixDQUFDO0FBRW5EOzs7Ozs7O0dBT0c7QUFDSCx3QkFBZ0IsV0FBVyxDQUFDLENBQUMsRUFBRSxDQUFDLFNBQVMsTUFBTSxFQUM3QyxHQUFHLEVBQUUsQ0FBQyxFQUFFLEVBQ1IsSUFBSSxFQUFFLENBQUMsRUFDUCxNQUFNLEVBQUUsQ0FBQyxFQUNULFFBQVEsU0FBcUMsR0FDNUMsS0FBSyxDQUFDLENBQUMsRUFBRSxDQUFDLENBQUMsQ0FNYjtBQUVELDhFQUE4RTtBQUM5RSx3QkFBZ0IscUJBQXFCLENBQUMsQ0FBQyxFQUFFLEdBQUcsRUFBRSxDQUFDLEVBQUUsRUFBRSxPQUFPLEVBQUUsQ0FBQyxJQUFJLEVBQUUsQ0FBQyxLQUFLLE9BQU8sR0FBRyxDQUFDLEVBQUUsQ0FHckY7QUFFRDs7Ozs7O0dBTUc7QUFDSCx3QkFBZ0IsYUFBYSxDQUFDLENBQUMsRUFBRSxDQUFDLFNBQVMsTUFBTSxFQUFFLEdBQUcsRUFBRSxDQUFDLEVBQUUsRUFBRSxJQUFJLEVBQUUsQ0FBQyxFQUFFLE1BQU0sRUFBRSxDQUFDLEdBQUcsS0FBSyxDQUFDLENBQUMsRUFBRSxDQUFDLENBQUMsQ0FNNUY7QUFFRDs7OztHQUlHO0FBQ0gsd0JBQWdCLFlBQVksQ0FBQyxDQUFDLEVBQUUsR0FBRyxFQUFFLENBQUMsRUFBRSxFQUFFLE9BQU8sRUFBRSxDQUFDLElBQUksRUFBRSxDQUFDLEtBQUssT0FBTyxHQUFHLE9BQU8sQ0FPaEY7QUFFRDs7OztHQUlHO0FBQ0gsd0JBQWdCLG1CQUFtQixDQUFDLENBQUMsRUFBRSxHQUFHLEVBQUUsQ0FBQyxFQUFFLEVBQUUsT0FBTyxFQUFFLENBQUMsSUFBSSxFQUFFLENBQUMsS0FBSyxPQUFPLEdBQUcsTUFBTSxDQUV0RjtBQUVEOzs7OztHQUtHO0FBQ0gsd0JBQWdCLEtBQUssQ0FBQyxDQUFDLEVBQUUsQ0FBQyxFQUFFLE1BQU0sRUFBRSxFQUFFLEVBQUUsQ0FBQyxDQUFDLEVBQUUsTUFBTSxLQUFLLENBQUMsR0FBRyxDQUFDLEVBQUUsQ0FFN0Q7QUFFRDs7Ozs7R0FLRztBQUNILHdCQUFzQixVQUFVLENBQUMsQ0FBQyxFQUFFLENBQUMsRUFBRSxNQUFNLEVBQUUsRUFBRSxFQUFFLENBQUMsQ0FBQyxFQUFFLE1BQU0sS0FBSyxPQUFPLENBQUMsQ0FBQyxDQUFDLEdBQUcsT0FBTyxDQUFDLENBQUMsRUFBRSxDQUFDLENBTTFGO0FBRUQ7Ozs7O0dBS0c7QUFDSCx3QkFBc0IsV0FBVyxDQUFDLENBQUMsRUFBRSxHQUFHLEVBQUUsQ0FBQyxFQUFFLEVBQUUsRUFBRSxFQUFFLENBQUMsSUFBSSxFQUFFLENBQUMsS0FBSyxPQUFPLENBQUMsT0FBTyxDQUFDLEdBQUcsT0FBTyxDQUFDLENBQUMsRUFBRSxDQUFDLENBRzlGO0FBRUQ7Ozs7O0dBS0c7QUFDSCx3QkFBc0IsYUFBYSxDQUFDLENBQUMsRUFBRSxDQUFDLEVBQUUsTUFBTSxFQUFFLEVBQUUsRUFBRSxDQUFDLENBQUMsRUFBRSxNQUFNLEtBQUssT0FBTyxDQUFDLENBQUMsQ0FBQyxHQUFHLE9BQU8sQ0FBQyxDQUFDLEVBQUUsQ0FBQyxDQU83RjtBQUVEOzs7O0dBSUc7QUFDSCx3QkFBZ0IsNkJBQTZCLENBQzNDLEdBQUcsRUFBRSxDQUFDLENBQUM7SUFBRSxNQUFNLEVBQUUsTUFBTSxPQUFPLENBQUE7Q0FBRSxHQUFHO0lBQUUsT0FBTyxFQUFFLE1BQU0sT0FBTyxDQUFBO0NBQUUsQ0FBQyxHQUFHO0lBQUUsUUFBUSxFQUFFLE1BQU0sTUFBTSxDQUFBO0NBQUUsQ0FBQyxFQUFFLFVBTS9GO0FBRUQ7Ozs7R0FJRztBQUNILHdCQUFnQixNQUFNLENBQUMsQ0FBQyxFQUFFLEdBQUcsRUFBRSxDQUFDLEVBQUUsR0FBRyxDQUFDLEVBQUUsQ0FFdkM7QUFFRDs7OztHQUlHO0FBQ0gsd0JBQWdCLFlBQVksQ0FBQyxDQUFDLEVBQUUsR0FBRyxFQUFFLENBQUMsQ0FBQyxHQUFHLFNBQVMsQ0FBQyxFQUFFLEdBQUcsQ0FBQyxFQUFFLENBRTNEO0FBRUQ7O0dBRUc7QUFDSCx3QkFBZ0IsY0FBYyxDQUFDLENBQUMsRUFBRSxDQUFDLEVBQUUsQ0FBQyxFQUFFLEVBQUUsQ0FBQyxFQUFFLENBQUMsRUFBRSxFQUFFLEVBQUUsR0FBRSxDQUFDLENBQUMsRUFBRSxDQUFDLEVBQUUsQ0FBQyxFQUFFLENBQUMsS0FBSyxPQUFpQyxHQUFHLE9BQU8sQ0FVaEg7QUFFRDs7Ozs7R0FLRztBQUNILHdCQUFnQixLQUFLLENBQUMsQ0FBQyxFQUFFLEdBQUcsRUFBRSxDQUFDLEVBQUUsRUFBRSxFQUFFLEVBQUUsQ0FBQyxDQUFDLEVBQUUsQ0FBQyxLQUFLLE1BQU0sR0FBRyxNQUFNLEdBQUcsQ0FBQyxHQUFHLFNBQVMsQ0FFL0U7QUFFRCwyQ0FBMkM7QUFDM0Msd0JBQWdCLEdBQUcsQ0FBQyxHQUFHLEVBQUUsTUFBTSxFQUFFLEdBQUcsTUFBTSxDQUV6QztBQUVELG1GQUFtRjtBQUNuRix3QkFBZ0IsTUFBTSxDQUFDLEdBQUcsRUFBRSxNQUFNLEVBQUUsR0FBRyxNQUFNLEdBQUcsU0FBUyxDQUFDO0FBQzFELGtGQUFrRjtBQUNsRix3QkFBZ0IsTUFBTSxDQUFDLEdBQUcsRUFBRSxNQUFNLEVBQUUsR0FBRyxNQUFNLEdBQUcsU0FBUyxDQUFDO0FBbUIxRCxxRkFBcUY7QUFDckYsd0JBQWdCLElBQUksQ0FBQyxNQUFNLEVBQUUsTUFBTSxFQUFFLHNCQUtwQztBQUVELG1HQUFtRztBQUNuRyx3QkFBZ0IsUUFBUSxDQUFDLE1BQU0sRUFBRSxNQUFNLEVBQUUsc0JBT3hDO0FBRUQsNkdBQTZHO0FBQzdHLHdCQUFnQixNQUFNLENBQUMsTUFBTSxFQUFFLE1BQU0sRUFBRSxzQkFLdEM7QUFFRCx1RkFBdUY7QUFDdkYsd0JBQWdCLFVBQVUsQ0FBQyxDQUFDLEVBQUUsVUFBVSxFQUFFLENBQUMsRUFBRSxFQUFFLFNBQVMsRUFBRSxDQUFDLENBQUMsRUFBRSxDQUFDLEtBQUssT0FBTyxHQUFHLE1BQU0sQ0FVbkY7QUFFRCxxSEFBcUg7QUFDckgsd0JBQWdCLEtBQUssQ0FBQyxDQUFDLEVBQUUsS0FBSyxFQUFFLENBQUMsRUFBRSxFQUFFLFNBQVMsRUFBRSxNQUFNLEdBQUcsQ0FBQyxFQUFFLEVBQUUsQ0FTN0Q7QUFFRDs7OztHQUlHO0FBQ0gsd0JBQWdCLGVBQWUsQ0FBQyxDQUFDLEVBQUUsS0FBSyxFQUFFLENBQUMsRUFBRSxFQUFFLFNBQVMsRUFBRSxNQUFNLEdBQUcsQ0FBQyxFQUFFLEVBQUUsQ0FjdkU7QUFJRDs7O0dBR0c7QUFDSCx3QkFBZ0IsT0FBTyxDQUFDLENBQUMsRUFBRSxDQUFDLEVBQUUsS0FBSyxFQUFFLENBQUMsRUFBRSxFQUFFLEVBQUUsRUFBRSxDQUFDLElBQUksRUFBRSxDQUFDLEtBQUssQ0FBQyxHQUFHLENBQUMsRUFBRSxFQUFFLENBdUJuRTtBQUVELDRFQUE0RTtBQUM1RSx3QkFBZ0IsU0FBUyxDQUFDLENBQUMsRUFBRSxLQUFLLEVBQUUsQ0FBQyxFQUFFLEVBQUUsU0FBUyxFQUFFLENBQUMsSUFBSSxFQUFFLENBQUMsS0FBSyxPQUFPLEdBQUcsQ0FBQyxDQUFDLEVBQUUsRUFBRSxDQUFDLEVBQUUsQ0FBQyxDQVdwRiJ9
+/** 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,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;;;;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"}
+{"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

@@ -110,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.
@@ -267,3 +285,18 @@ const UNINITIALIZED = Symbol('uninitialized');
         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=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9jb2xsZWN0aW9uL2luZGV4LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLGNBQWMsWUFBWSxDQUFDO0FBQzNCLGNBQWMsYUFBYSxDQUFDIn0=
+//# 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';

package/dest/collection/lru_map.d.ts

@@ -0,0 +1,41 @@
+/**
+ * A bounded key-value map with Least Recently Used (LRU) eviction.
+ * Both {@link get} and {@link set} count as an access and refresh the entry's
+ * recency, so entries that are actively used stay in the map longest.
+ *
+ * Uses a doubly-linked list for O(1) ordering and a Map for O(1) lookup.
+ * Head = least recent, tail = most recent.
+ */
+export declare class LruMap<K, V> {
+    private readonly maxSize;
+    /** Map from key to its linked-list node for O(1) lookup. */
+    private readonly map;
+    private head;
+    private tail;
+    constructor(maxSize: number);
+    /** Number of entries in the map. */
+    get size(): number;
+    /** Returns true if the key is present, without refreshing its recency. */
+    has(key: K): boolean;
+    /**
+     * Returns the value for the key, or undefined if absent.
+     * Refreshes the entry's recency so it becomes the most recently used.
+     */
+    get(key: K): V | undefined;
+    /**
+     * Stores a value for the key, refreshing its recency. If the key already exists, overwrites the value.
+     * If the map is at capacity, evicts the least recently used entry.
+     */
+    set(key: K, value: V): void;
+    /** Removes the entry for the key, returning true if it was present. */
+    delete(key: K): boolean;
+    /** Removes all entries from the map. */
+    clear(): void;
+    /** Unlinks a node from its current position and relinks it at the tail. */
+    private moveToTail;
+    /** Detaches a node from the linked list, fixing up its neighbours and the head/tail pointers. */
+    private unlink;
+    /** Evicts the head (least recently used) node. */
+    private evictHead;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibHJ1X21hcC5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL2NvbGxlY3Rpb24vbHJ1X21hcC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFRQTs7Ozs7OztHQU9HO0FBQ0gscUJBQWEsTUFBTSxDQUFDLENBQUMsRUFBRSxDQUFDO0lBTVYsT0FBTyxDQUFDLFFBQVEsQ0FBQyxPQUFPO0lBTHBDLDREQUE0RDtJQUM1RCxPQUFPLENBQUMsUUFBUSxDQUFDLEdBQUcsQ0FBK0I7SUFDbkQsT0FBTyxDQUFDLElBQUksQ0FBNEI7SUFDeEMsT0FBTyxDQUFDLElBQUksQ0FBNEI7SUFFeEMsWUFBNkIsT0FBTyxFQUFFLE1BQU0sRUFJM0M7SUFFRCxvQ0FBb0M7SUFDcEMsSUFBSSxJQUFJLElBQUksTUFBTSxDQUVqQjtJQUVELDBFQUEwRTtJQUMxRSxHQUFHLENBQUMsR0FBRyxFQUFFLENBQUMsR0FBRyxPQUFPLENBRW5CO0lBRUQ7OztPQUdHO0lBQ0gsR0FBRyxDQUFDLEdBQUcsRUFBRSxDQUFDLEdBQUcsQ0FBQyxHQUFHLFNBQVMsQ0FPekI7SUFFRDs7O09BR0c7SUFDSCxHQUFHLENBQUMsR0FBRyxFQUFFLENBQUMsRUFBRSxLQUFLLEVBQUUsQ0FBQyxHQUFHLElBQUksQ0FvQjFCO0lBRUQsdUVBQXVFO0lBQ3ZFLE1BQU0sQ0FBQyxHQUFHLEVBQUUsQ0FBQyxHQUFHLE9BQU8sQ0FRdEI7SUFFRCx3Q0FBd0M7SUFDeEMsS0FBSyxJQUFJLElBQUksQ0FJWjtJQUVELDJFQUEyRTtJQUMzRSxPQUFPLENBQUMsVUFBVTtJQWdCbEIsaUdBQWlHO0lBQ2pHLE9BQU8sQ0FBQyxNQUFNO0lBZWQsa0RBQWtEO0lBQ2xELE9BQU8sQ0FBQyxTQUFTO0NBYWxCIn0=

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

@@ -0,0 +1 @@
+{"version":3,"file":"lru_map.d.ts","sourceRoot":"","sources":["../../src/collection/lru_map.ts"],"names":[],"mappings":"AAQA;;;;;;;GAOG;AACH,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC;IAMV,OAAO,CAAC,QAAQ,CAAC,OAAO;IALpC,4DAA4D;IAC5D,OAAO,CAAC,QAAQ,CAAC,GAAG,CAA+B;IACnD,OAAO,CAAC,IAAI,CAA4B;IACxC,OAAO,CAAC,IAAI,CAA4B;IAExC,YAA6B,OAAO,EAAE,MAAM,EAI3C;IAED,oCAAoC;IACpC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,0EAA0E;IAC1E,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAEnB;IAED;;;OAGG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAOzB;IAED;;;OAGG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAoB1B;IAED,uEAAuE;IACvE,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAQtB;IAED,wCAAwC;IACxC,KAAK,IAAI,IAAI,CAIZ;IAED,2EAA2E;IAC3E,OAAO,CAAC,UAAU;IAgBlB,iGAAiG;IACjG,OAAO,CAAC,MAAM;IAed,kDAAkD;IAClD,OAAO,CAAC,SAAS;CAalB"}

package/dest/collection/lru_map.js

@@ -0,0 +1,119 @@
+/** Node in a doubly-linked list used by {@link LruMap}. */ /**
+ * A bounded key-value map with Least Recently Used (LRU) eviction.
+ * Both {@link get} and {@link set} count as an access and refresh the entry's
+ * recency, so entries that are actively used stay in the map longest.
+ *
+ * Uses a doubly-linked list for O(1) ordering and a Map for O(1) lookup.
+ * Head = least recent, tail = most recent.
+ */ export class LruMap {
+    maxSize;
+    /** Map from key to its linked-list node for O(1) lookup. */ map;
+    head;
+    tail;
+    constructor(maxSize){
+        this.maxSize = maxSize;
+        this.map = new Map();
+        if (maxSize < 1) {
+            throw new Error('LruMap maxSize must be at least 1');
+        }
+    }
+    /** Number of entries in the map. */ get size() {
+        return this.map.size;
+    }
+    /** Returns true if the key is present, without refreshing its recency. */ has(key) {
+        return this.map.has(key);
+    }
+    /**
+   * Returns the value for the key, or undefined if absent.
+   * Refreshes the entry's recency so it becomes the most recently used.
+   */ get(key) {
+        const node = this.map.get(key);
+        if (!node) {
+            return undefined;
+        }
+        this.moveToTail(node);
+        return node.value;
+    }
+    /**
+   * Stores a value for the key, refreshing its recency. If the key already exists, overwrites the value.
+   * If the map is at capacity, evicts the least recently used entry.
+   */ set(key, value) {
+        const existing = this.map.get(key);
+        if (existing) {
+            existing.value = value;
+            this.moveToTail(existing);
+            return;
+        }
+        if (this.map.size >= this.maxSize) {
+            this.evictHead();
+        }
+        const node = {
+            key,
+            value,
+            prev: this.tail,
+            next: undefined
+        };
+        if (this.tail) {
+            this.tail.next = node;
+        } else {
+            this.head = node;
+        }
+        this.tail = node;
+        this.map.set(key, node);
+    }
+    /** Removes the entry for the key, returning true if it was present. */ delete(key) {
+        const node = this.map.get(key);
+        if (!node) {
+            return false;
+        }
+        this.unlink(node);
+        this.map.delete(key);
+        return true;
+    }
+    /** Removes all entries from the map. */ clear() {
+        this.map.clear();
+        this.head = undefined;
+        this.tail = undefined;
+    }
+    /** Unlinks a node from its current position and relinks it at the tail. */ moveToTail(node) {
+        if (node === this.tail) {
+            return;
+        }
+        this.unlink(node);
+        node.prev = this.tail;
+        node.next = undefined;
+        if (this.tail) {
+            this.tail.next = node;
+        } else {
+            this.head = node;
+        }
+        this.tail = node;
+    }
+    /** Detaches a node from the linked list, fixing up its neighbours and the head/tail pointers. */ unlink(node) {
+        if (node.prev) {
+            node.prev.next = node.next;
+        } else {
+            this.head = node.next;
+        }
+        if (node.next) {
+            node.next.prev = node.prev;
+        } else {
+            this.tail = node.prev;
+        }
+        node.prev = undefined;
+        node.next = undefined;
+    }
+    /** Evicts the head (least recently used) node. */ evictHead() {
+        const oldHead = this.head;
+        if (!oldHead) {
+            return;
+        }
+        this.head = oldHead.next;
+        if (this.head) {
+            this.head.prev = undefined;
+        } else {
+            this.tail = undefined;
+        }
+        this.map.delete(oldHead.key);
+    }
+}

package/dest/collection/lru_set.d.ts

@@ -0,0 +1,35 @@
+/**
+ * A bounded set with Least Recently Used (LRU) eviction.
+ * Both {@link has} and {@link add} count as an access and refresh the entry's
+ * recency, so items that are actively checked stay in the set longest.
+ *
+ * Uses a doubly-linked list for O(1) ordering and a Map for O(1) lookup.
+ * Head = least recent, tail = most recent.
+ */
+export declare class LruSet<T> {
+    private readonly maxSize;
+    /** Map from value to its linked-list node for O(1) lookup. */
+    private readonly map;
+    private head;
+    private tail;
+    constructor(maxSize: number);
+    /** Number of entries in the set. */
+    get size(): number;
+    /**
+     * Returns true if the item is in the set.
+     * Refreshes the item's recency so it becomes the most recently used.
+     */
+    has(item: T): boolean;
+    /**
+     * Adds an item to the set. If the item already exists, refreshes its recency.
+     * If the set is at capacity, evicts the least recently used item.
+     */
+    add(item: T): void;
+    /** Removes all entries from the set. */
+    clear(): void;
+    /** Unlinks a node from its current position and relinks it at the tail. */
+    private moveToTail;
+    /** Evicts the head (least recently used) node. */
+    private evictHead;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibHJ1X3NldC5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL2NvbGxlY3Rpb24vbHJ1X3NldC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFPQTs7Ozs7OztHQU9HO0FBQ0gscUJBQWEsTUFBTSxDQUFDLENBQUM7SUFNUCxPQUFPLENBQUMsUUFBUSxDQUFDLE9BQU87SUFMcEMsOERBQThEO0lBQzlELE9BQU8sQ0FBQyxRQUFRLENBQUMsR0FBRyxDQUE0QjtJQUNoRCxPQUFPLENBQUMsSUFBSSxDQUF5QjtJQUNyQyxPQUFPLENBQUMsSUFBSSxDQUF5QjtJQUVyQyxZQUE2QixPQUFPLEVBQUUsTUFBTSxFQUkzQztJQUVELG9DQUFvQztJQUNwQyxJQUFJLElBQUksSUFBSSxNQUFNLENBRWpCO0lBRUQ7OztPQUdHO0lBQ0gsR0FBRyxDQUFDLElBQUksRUFBRSxDQUFDLEdBQUcsT0FBTyxDQU9wQjtJQUVEOzs7T0FHRztJQUNILEdBQUcsQ0FBQyxJQUFJLEVBQUUsQ0FBQyxHQUFHLElBQUksQ0FtQmpCO0lBRUQsd0NBQXdDO0lBQ3hDLEtBQUssSUFBSSxJQUFJLENBSVo7SUFFRCwyRUFBMkU7SUFDM0UsT0FBTyxDQUFDLFVBQVU7SUF3QmxCLGtEQUFrRDtJQUNsRCxPQUFPLENBQUMsU0FBUztDQVdsQiJ9

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

@@ -0,0 +1 @@
+{"version":3,"file":"lru_set.d.ts","sourceRoot":"","sources":["../../src/collection/lru_set.ts"],"names":[],"mappings":"AAOA;;;;;;;GAOG;AACH,qBAAa,MAAM,CAAC,CAAC;IAMP,OAAO,CAAC,QAAQ,CAAC,OAAO;IALpC,8DAA8D;IAC9D,OAAO,CAAC,QAAQ,CAAC,GAAG,CAA4B;IAChD,OAAO,CAAC,IAAI,CAAyB;IACrC,OAAO,CAAC,IAAI,CAAyB;IAErC,YAA6B,OAAO,EAAE,MAAM,EAI3C;IAED,oCAAoC;IACpC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;;OAGG;IACH,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,OAAO,CAOpB;IAED;;;OAGG;IACH,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAmBjB;IAED,wCAAwC;IACxC,KAAK,IAAI,IAAI,CAIZ;IAED,2EAA2E;IAC3E,OAAO,CAAC,UAAU;IAwBlB,kDAAkD;IAClD,OAAO,CAAC,SAAS;CAWlB"}

package/dest/collection/lru_set.js

@@ -0,0 +1,95 @@
+/** Node in a doubly-linked list used by {@link LruSet}. */ /**
+ * A bounded set with Least Recently Used (LRU) eviction.
+ * Both {@link has} and {@link add} count as an access and refresh the entry's
+ * recency, so items that are actively checked stay in the set longest.
+ *
+ * Uses a doubly-linked list for O(1) ordering and a Map for O(1) lookup.
+ * Head = least recent, tail = most recent.
+ */ export class LruSet {
+    maxSize;
+    /** Map from value to its linked-list node for O(1) lookup. */ map;
+    head;
+    tail;
+    constructor(maxSize){
+        this.maxSize = maxSize;
+        this.map = new Map();
+        if (maxSize < 1) {
+            throw new Error('LruSet maxSize must be at least 1');
+        }
+    }
+    /** Number of entries in the set. */ get size() {
+        return this.map.size;
+    }
+    /**
+   * Returns true if the item is in the set.
+   * Refreshes the item's recency so it becomes the most recently used.
+   */ has(item) {
+        const node = this.map.get(item);
+        if (!node) {
+            return false;
+        }
+        this.moveToTail(node);
+        return true;
+    }
+    /**
+   * Adds an item to the set. If the item already exists, refreshes its recency.
+   * If the set is at capacity, evicts the least recently used item.
+   */ add(item) {
+        const existing = this.map.get(item);
+        if (existing) {
+            this.moveToTail(existing);
+            return;
+        }
+        if (this.map.size >= this.maxSize) {
+            this.evictHead();
+        }
+        const node = {
+            value: item,
+            prev: this.tail,
+            next: undefined
+        };
+        if (this.tail) {
+            this.tail.next = node;
+        } else {
+            this.head = node;
+        }
+        this.tail = node;
+        this.map.set(item, node);
+    }
+    /** Removes all entries from the set. */ clear() {
+        this.map.clear();
+        this.head = undefined;
+        this.tail = undefined;
+    }
+    /** Unlinks a node from its current position and relinks it at the tail. */ moveToTail(node) {
+        if (node === this.tail) {
+            return;
+        }
+        // Unlink
+        if (node.prev) {
+            node.prev.next = node.next;
+        } else {
+            this.head = node.next;
+        }
+        if (node.next) {
+            node.next.prev = node.prev;
+        }
+        // Relink at tail
+        node.prev = this.tail;
+        node.next = undefined;
+        if (this.tail) {
+            this.tail.next = node;
+        }
+        this.tail = node;
+    }
+    /** Evicts the head (least recently used) node. */ evictHead() {
+        const oldHead = this.head;
+        this.map.delete(oldHead.value);
+        this.head = oldHead.next;
+        if (this.head) {
+            this.head.prev = undefined;
+        } else {
+            this.tail = undefined;
+        }
+    }
+}

package/dest/committable/committable.js

@@ -18,7 +18,7 @@
     /**
    * Rolls back the uncommitted value.
    */ rollback() {
-        this.nextValue === undefined;
+        this.nextValue = undefined;
     }
     /**
    * Gets the current value.