@aztec-labs/foundation 6.0.0-nightly.20260829

package/dest/collection/array.js

@@ -0,0 +1,302 @@
+/**
+ * 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.
+ * @param arr - Array with elements to pad.
+ * @param elem - Element to use for padding.
+ * @param length - Target length.
+ * @param errorMsg - Error message to throw if target length exceeds the input array length.
+ * @returns A new padded array.
+ */ export function padArrayEnd(arr, elem, length, errorMsg = 'Array size exceeds target length') {
+    if (arr.length > length) {
+        throw new Error(errorMsg);
+    }
+    // Since typescript cannot always deduce that something is a tuple, we cast
+    return [
+        ...arr,
+        ...Array(length - arr.length).fill(elem)
+    ];
+}
+/** Removes the right-padding for an array. Does not modify original array. */ export function removeArrayPaddingEnd(arr, isEmpty) {
+    const lastNonEmptyIndex = arr.reduce((last, item, i)=>isEmpty(item) ? last : i, -1);
+    return lastNonEmptyIndex === -1 ? [] : arr.slice(0, lastNonEmptyIndex + 1);
+}
+/**
+ * Pads an array to the target length by prepending elements at the beginning. Throws if target length exceeds the input array length. Does not modify the input array.
+ * @param arr - Array with elements to pad.
+ * @param elem - Element to use for padding.
+ * @param length - Target length.
+ * @returns A new padded array.
+ */ export function padArrayStart(arr, elem, length) {
+    if (arr.length > length) {
+        throw new Error(`Array size exceeds target length`);
+    }
+    // Since typescript cannot always deduce that something is a tuple, we cast
+    return [
+        ...Array(length - arr.length).fill(elem),
+        ...arr
+    ];
+}
+/**
+ * Returns if an array is composed of empty items.
+ * @param arr - Array to check.
+ * @returns True if every item in the array isEmpty.
+ */ export function isArrayEmpty(arr, isEmpty) {
+    for (const item of arr){
+        if (!isEmpty(item)) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * Returns the number of non-empty items in an array.
+ * @param arr - Array to check.
+ * @returns Number of non-empty items in an array.
+ */ export function arrayNonEmptyLength(arr, isEmpty) {
+    return arr.reduce((sum, item)=>isEmpty(item) ? sum : sum + 1, 0);
+}
+/**
+ * Executes the given function n times and returns the results in an array.
+ * @param n - How many times to repeat.
+ * @param fn - Mapper from index to value.
+ * @returns The array with the result from all executions.
+ */ export function times(n, fn) {
+    return [
+        ...Array(n).keys()
+    ].map((i)=>fn(i));
+}
+/**
+ * Executes the given async function n times and returns the results in an array. Awaits each execution before starting the next one.
+ * @param n - How many times to repeat.
+ * @param fn - Mapper from index to value.
+ * @returns The array with the result from all executions.
+ */ export async function timesAsync(n, fn) {
+    const results = [];
+    for(let i = 0; i < n; i++){
+        results.push(await fn(i));
+    }
+    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.
+ * @param fn - Mapper from index to value.
+ * @returns The array with the result from all executions.
+ */ export async function timesParallel(n, fn) {
+    const results = await Promise.all(Array(n).fill(0).map((_, i)=>fn(i)));
+    return results;
+}
+/**
+ * Returns the serialized size of all non-empty items in an array.
+ * @param arr - Array
+ * @returns The serialized size in bytes.
+ */ export function arraySerializedSizeOfNonEmpty(arr) {
+    return arr.filter((x)=>x && ('isZero' in x ? !x.isZero() : !x.isEmpty())).map((x)=>x.toBuffer().length).reduce((a, b)=>a + b, 0);
+}
+/**
+ * Removes duplicates from the given array.
+ * @param arr - The array.
+ * @returns A new array.
+ */ export function unique(arr) {
+    return [
+        ...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.
+ * @returns A new array.
+ */ export function compactArray(arr) {
+    return arr.filter((x)=>x !== undefined);
+}
+/**
+ * Returns whether two arrays are equal. The arrays are equal if they have the same length and all elements are equal.
+ */ export function areArraysEqual(a, b, eq = (a, b)=>a === b) {
+    if (a.length !== b.length) {
+        return false;
+    }
+    for(let i = 0; i < a.length; i++){
+        if (!eq(a[i], b[i])) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * Returns the element of the array that has the maximum value of the given function.
+ * In case of a tie, returns the first element with the maximum value.
+ * @param arr - The array.
+ * @param fn - The function to get the value to compare.
+ */ export function maxBy(arr, fn) {
+    return arr.reduce((max, x)=>fn(x) > fn(max) ? x : max, arr[0]);
+}
+/** Computes the sum of a numeric array. */ export function sum(arr) {
+    return arr.reduce((a, b)=>a + b, 0);
+}
+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 ? -1 : a > b ? 1 : 0);
+    const mid = Math.floor(sorted.length / 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) {
+        return undefined;
+    }
+    return values.reduce((a, b)=>a + b, 0) / values.length;
+}
+/** Computes the variance of a numeric array. Returns undefined if there are less than 2 points. */ export function variance(values) {
+    if (values.length < 2) {
+        return undefined;
+    }
+    const avg = mean(values);
+    const points = values.map((value)=>value * value + avg * avg - 2 * value * avg);
+    return sum(points) / (values.length - 1);
+}
+/** Computes the standard deviation of a numeric array. Returns undefined if there are less than 2 points. */ export function stdDev(values) {
+    if (values.length < 2) {
+        return undefined;
+    }
+    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

@@ -0,0 +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,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9jb2xsZWN0aW9uL2luZGV4LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLGNBQWMsWUFBWSxDQUFDO0FBQzNCLGNBQWMsY0FBYyxDQUFDO0FBQzdCLGNBQWMsY0FBYyxDQUFDO0FBQzdCLGNBQWMsYUFBYSxDQUFDIn0=

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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +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/collection/object.d.ts

@@ -0,0 +1,30 @@
+/** Returns a new object with the same keys and where each value has been passed through the mapping function. */
+export declare function mapValues<K extends string | number | symbol, T, U>(obj: Record<K, T>, fn: (value: T, key: K) => U): Record<K, U>;
+export declare function mapValues<K extends string | number | symbol, T, U>(obj: Partial<Record<K, T>>, fn: (value: T, key: K) => U): Partial<Record<K, U>>;
+/** Returns a new object where all keys with undefined values have been removed. */
+export declare function compact<T extends object>(obj: T): {
+    [P in keyof T]+?: Exclude<T[P], undefined>;
+};
+/** Returns a new object by picking the given keys. */
+export declare function pick<T extends object, U extends keyof T>(object: T, ...props: U[]): Pick<T, U>;
+export declare function pick<T extends object>(object: T, ...props: string[]): Partial<T>;
+/** Returns a new object by omitting the given keys. */
+export declare function omit<T extends object, K extends keyof T>(object: T, ...props: K[]): Omit<T, K>;
+export declare function omit<T extends object>(object: T, ...props: string[]): Partial<T>;
+/** Equivalent to Object.keys but preserves types. */
+export declare function getKeys<T extends object>(obj: T): (keyof T)[];
+/** Equivalent to Object.entries but preserves types. */
+export declare function getEntries<T extends Record<PropertyKey, unknown>>(obj: T): {
+    [K in keyof T]: [K, T[K]];
+}[keyof T][];
+/** Equivalent to Object.fromEntries but preserves types. */
+export declare function fromEntries<const T extends ReadonlyArray<readonly [PropertyKey, unknown]>>(entries: T): {
+    [K in T[number] as K[0]]: K[1];
+};
+/** Asserts all values in object are not undefined. */
+export declare function assertRequired<T extends object>(obj: T): Required<T>;
+/** Returns the result of merging two objects ignoring properties with undefined values. */
+export declare function merge<T extends object, U extends object>(obj1: T, obj2: U | undefined): T & {
+    [P in keyof U]+?: Exclude<U[P], undefined>;
+};
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoib2JqZWN0LmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvY29sbGVjdGlvbi9vYmplY3QudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsaUhBQWlIO0FBQ2pILHdCQUFnQixTQUFTLENBQUMsQ0FBQyxTQUFTLE1BQU0sR0FBRyxNQUFNLEdBQUcsTUFBTSxFQUFFLENBQUMsRUFBRSxDQUFDLEVBQ2hFLEdBQUcsRUFBRSxNQUFNLENBQUMsQ0FBQyxFQUFFLENBQUMsQ0FBQyxFQUNqQixFQUFFLEVBQUUsQ0FBQyxLQUFLLEVBQUUsQ0FBQyxFQUFFLEdBQUcsRUFBRSxDQUFDLEtBQUssQ0FBQyxHQUMxQixNQUFNLENBQUMsQ0FBQyxFQUFFLENBQUMsQ0FBQyxDQUFDO0FBQ2hCLHdCQUFnQixTQUFTLENBQUMsQ0FBQyxTQUFTLE1BQU0sR0FBRyxNQUFNLEdBQUcsTUFBTSxFQUFFLENBQUMsRUFBRSxDQUFDLEVBQ2hFLEdBQUcsRUFBRSxPQUFPLENBQUMsTUFBTSxDQUFDLENBQUMsRUFBRSxDQUFDLENBQUMsQ0FBQyxFQUMxQixFQUFFLEVBQUUsQ0FBQyxLQUFLLEVBQUUsQ0FBQyxFQUFFLEdBQUcsRUFBRSxDQUFDLEtBQUssQ0FBQyxHQUMxQixPQUFPLENBQUMsTUFBTSxDQUFDLENBQUMsRUFBRSxDQUFDLENBQUMsQ0FBQyxDQUFDO0FBWXpCLG1GQUFtRjtBQUNuRix3QkFBZ0IsT0FBTyxDQUFDLENBQUMsU0FBUyxNQUFNLEVBQUUsR0FBRyxFQUFFLENBQUMsR0FBRztLQUFHLENBQUMsSUFBSSxNQUFNLENBQUMsQ0FBQyxDQUFDLEdBQUcsT0FBTyxDQUFDLENBQUMsQ0FBQyxDQUFDLENBQUMsRUFBRSxTQUFTLENBQUM7Q0FBRSxDQVFoRztBQUVELHNEQUFzRDtBQUN0RCx3QkFBZ0IsSUFBSSxDQUFDLENBQUMsU0FBUyxNQUFNLEVBQUUsQ0FBQyxTQUFTLE1BQU0sQ0FBQyxFQUFFLE1BQU0sRUFBRSxDQUFDLEVBQUUsR0FBRyxLQUFLLEVBQUUsQ0FBQyxFQUFFLEdBQUcsSUFBSSxDQUFDLENBQUMsRUFBRSxDQUFDLENBQUMsQ0FBQztBQUNoRyx3QkFBZ0IsSUFBSSxDQUFDLENBQUMsU0FBUyxNQUFNLEVBQUUsTUFBTSxFQUFFLENBQUMsRUFBRSxHQUFHLEtBQUssRUFBRSxNQUFNLEVBQUUsR0FBRyxPQUFPLENBQUMsQ0FBQyxDQUFDLENBQUM7QUFTbEYsdURBQXVEO0FBQ3ZELHdCQUFnQixJQUFJLENBQUMsQ0FBQyxTQUFTLE1BQU0sRUFBRSxDQUFDLFNBQVMsTUFBTSxDQUFDLEVBQUUsTUFBTSxFQUFFLENBQUMsRUFBRSxHQUFHLEtBQUssRUFBRSxDQUFDLEVBQUUsR0FBRyxJQUFJLENBQUMsQ0FBQyxFQUFFLENBQUMsQ0FBQyxDQUFDO0FBQ2hHLHdCQUFnQixJQUFJLENBQUMsQ0FBQyxTQUFTLE1BQU0sRUFBRSxNQUFNLEVBQUUsQ0FBQyxFQUFFLEdBQUcsS0FBSyxFQUFFLE1BQU0sRUFBRSxHQUFHLE9BQU8sQ0FBQyxDQUFDLENBQUMsQ0FBQztBQVNsRixxREFBcUQ7QUFDckQsd0JBQWdCLE9BQU8sQ0FBQyxDQUFDLFNBQVMsTUFBTSxFQUFFLEdBQUcsRUFBRSxDQUFDLEdBQUcsQ0FBQyxNQUFNLENBQUMsQ0FBQyxFQUFFLENBRTdEO0FBRUQsd0RBQXdEO0FBQ3hELHdCQUFnQixVQUFVLENBQUMsQ0FBQyxTQUFTLE1BQU0sQ0FBQyxXQUFXLEVBQUUsT0FBTyxDQUFDLEVBQUUsR0FBRyxFQUFFLENBQUMsR0FBRztLQUFHLENBQUMsSUFBSSxNQUFNLENBQUMsR0FBRyxDQUFDLENBQUMsRUFBRSxDQUFDLENBQUMsQ0FBQyxDQUFDLENBQUM7Q0FBRSxDQUFDLE1BQU0sQ0FBQyxDQUFDLEVBQUUsQ0FHbkg7QUFFRCw0REFBNEQ7QUFDNUQsd0JBQWdCLFdBQVcsQ0FBQyxLQUFLLENBQUMsQ0FBQyxTQUFTLGFBQWEsQ0FBQyxTQUFTLENBQUMsV0FBVyxFQUFFLE9BQU8sQ0FBQyxDQUFDLEVBQ3hGLE9BQU8sRUFBRSxDQUFDLEdBQ1Q7S0FBRyxDQUFDLElBQUksQ0FBQyxDQUFDLE1BQU0sQ0FBQyxJQUFJLENBQUMsQ0FBQyxDQUFDLENBQUMsR0FBRyxDQUFDLENBQUMsQ0FBQyxDQUFDO0NBQUUsQ0FHcEM7QUFFRCxzREFBc0Q7QUFDdEQsd0JBQWdCLGNBQWMsQ0FBQyxDQUFDLFNBQVMsTUFBTSxFQUFFLEdBQUcsRUFBRSxDQUFDLEdBQUcsUUFBUSxDQUFDLENBQUMsQ0FBQyxDQU9wRTtBQUVELDJGQUEyRjtBQUMzRix3QkFBZ0IsS0FBSyxDQUFDLENBQUMsU0FBUyxNQUFNLEVBQUUsQ0FBQyxTQUFTLE1BQU0sRUFDdEQsSUFBSSxFQUFFLENBQUMsRUFDUCxJQUFJLEVBQUUsQ0FBQyxHQUFHLFNBQVMsR0FDbEIsQ0FBQyxHQUFHO0tBQUcsQ0FBQyxJQUFJLE1BQU0sQ0FBQyxDQUFDLENBQUMsR0FBRyxPQUFPLENBQUMsQ0FBQyxDQUFDLENBQUMsQ0FBQyxFQUFFLFNBQVMsQ0FBQztDQUFFLENBRXBEIn0=

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

@@ -0,0 +1 @@
+{"version":3,"file":"object.d.ts","sourceRoot":"","sources":["../../src/collection/object.ts"],"names":[],"mappings":"AAAA,iHAAiH;AACjH,wBAAgB,SAAS,CAAC,CAAC,SAAS,MAAM,GAAG,MAAM,GAAG,MAAM,EAAE,CAAC,EAAE,CAAC,EAChE,GAAG,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EACjB,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,GAC1B,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAChB,wBAAgB,SAAS,CAAC,CAAC,SAAS,MAAM,GAAG,MAAM,GAAG,MAAM,EAAE,CAAC,EAAE,CAAC,EAChE,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAC1B,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,GAC1B,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAYzB,mFAAmF;AACnF,wBAAgB,OAAO,CAAC,CAAC,SAAS,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG;KAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC;CAAE,CAQhG;AAED,sDAAsD;AACtD,wBAAgB,IAAI,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAChG,wBAAgB,IAAI,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AASlF,uDAAuD;AACvD,wBAAgB,IAAI,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAChG,wBAAgB,IAAI,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AASlF,qDAAqD;AACrD,wBAAgB,OAAO,CAAC,CAAC,SAAS,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAE7D;AAED,wDAAwD;AACxD,wBAAgB,UAAU,CAAC,CAAC,SAAS,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG;KAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;CAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAGnH;AAED,4DAA4D;AAC5D,wBAAgB,WAAW,CAAC,KAAK,CAAC,CAAC,SAAS,aAAa,CAAC,SAAS,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,EACxF,OAAO,EAAE,CAAC,GACT;KAAG,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CAAE,CAGpC;AAED,sDAAsD;AACtD,wBAAgB,cAAc,CAAC,CAAC,SAAS,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAOpE;AAED,2FAA2F;AAC3F,wBAAgB,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,MAAM,EACtD,IAAI,EAAE,CAAC,EACP,IAAI,EAAE,CAAC,GAAG,SAAS,GAClB,CAAC,GAAG;KAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC;CAAE,CAEpD"}