bunqueue 2.4.0 → 2.4.1

package/dist/shared/lru.d.ts

@@ -2,201 +2,9 @@
  * LRU (Least Recently Used) Cache implementations
  * Bounded collections with automatic eviction
  */
-/** Map-like interface for LRU compatibility */
-export interface MapLike<K, V> {
-    get(key: K): V | undefined;
-    set(key: K, value: V): void;
-    has(key: K): boolean;
-    delete(key: K): boolean;
-    clear(): void;
-    readonly size: number;
-}
-/** Set-like interface for LRU compatibility */
-export interface SetLike<T> {
-    add(value: T): void;
-    has(value: T): boolean;
-    delete(value: T): boolean;
-    clear(): void;
-    readonly size: number;
-}
-/**
- * LRU Map - automatically evicts least recently used entries
- * Optimized with doubly-linked list for O(1) move-to-front
- * without delete+re-insert overhead
- */
-export declare class LRUMap<K, V> implements MapLike<K, V> {
-    private readonly cache;
-    private readonly maxSize;
-    private readonly onEvict?;
-    private head;
-    private tail;
-    constructor(maxSize: number, onEvict?: (key: K, value: V) => void);
-    /** Move node to front (most recently used) - O(1) */
-    private moveToFront;
-    /** Remove node from list - O(1) */
-    private removeNode;
-    /** Add node to front - O(1) */
-    private addToFront;
-    get(key: K): V | undefined;
-    set(key: K, value: V): void;
-    has(key: K): boolean;
-    delete(key: K): boolean;
-    clear(): void;
-    get size(): number;
-    keys(): IterableIterator<K>;
-    values(): IterableIterator<V>;
-    entries(): IterableIterator<[K, V]>;
-    forEach(callback: (value: V, key: K) => void): void;
-    [Symbol.iterator](): IterableIterator<[K, V]>;
-}
-/**
- * LRU Set - automatically evicts least recently used entries
- * Optimized with doubly-linked list for O(1) move-to-front
- */
-export declare class LRUSet<T> implements SetLike<T> {
-    private readonly cache;
-    private readonly maxSize;
-    private readonly onEvict?;
-    private head;
-    private tail;
-    constructor(maxSize: number, onEvict?: (value: T) => void);
-    /** Move node to front - O(1) */
-    private moveToFront;
-    /** Remove node from list - O(1) */
-    private removeNode;
-    /** Add node to front - O(1) */
-    private addToFront;
-    add(value: T): void;
-    has(value: T): boolean;
-    delete(value: T): boolean;
-    clear(): void;
-    get size(): number;
-    values(): IterableIterator<T>;
-    [Symbol.iterator](): IterableIterator<T>;
-}
-/**
- * Bounded Set - fast FIFO eviction without LRU tracking
- * Optimized for high-throughput scenarios where recency doesn't matter
- * Uses batch eviction to avoid per-item iterator overhead
- */
-export declare class BoundedSet<T> implements SetLike<T> {
-    private readonly cache;
-    private readonly maxSize;
-    private readonly onEvict?;
-    /** Evict 10% of items at once to amortize iterator cost */
-    private readonly evictBatchSize;
-    constructor(maxSize: number, onEvict?: (value: T) => void);
-    add(value: T): void;
-    /** Evict multiple items at once - more efficient than one at a time */
-    private evictBatch;
-    has(value: T): boolean;
-    delete(value: T): boolean;
-    clear(): void;
-    get size(): number;
-    values(): IterableIterator<T>;
-    [Symbol.iterator](): IterableIterator<T>;
-}
-/**
- * Bounded Map - fast FIFO eviction without LRU tracking
- * Optimized for high-throughput scenarios where recency doesn't matter
- * Uses batch eviction to avoid per-item iterator overhead
- */
-export declare class BoundedMap<K, V> implements MapLike<K, V> {
-    private readonly cache;
-    private readonly maxSize;
-    private readonly onEvict?;
-    /** Evict 10% of items at once to amortize iterator cost */
-    private readonly evictBatchSize;
-    constructor(maxSize: number, onEvict?: (key: K, value: V) => void);
-    get(key: K): V | undefined;
-    set(key: K, value: V): void;
-    /** Evict multiple items at once - more efficient than one at a time */
-    private evictBatch;
-    has(key: K): boolean;
-    delete(key: K): boolean;
-    clear(): void;
-    get size(): number;
-    keys(): IterableIterator<K>;
-    values(): IterableIterator<V>;
-    entries(): IterableIterator<[K, V]>;
-    forEach(callback: (value: V, key: K) => void): void;
-    [Symbol.iterator](): IterableIterator<[K, V]>;
-}
-/**
- * TTL Map - entries expire after timeout
- * Optimized with MinHeap for O(log n) insert and O(k) cleanup
- *
- * IMPORTANT: You MUST call stop() when done with this instance to prevent memory leaks.
- * The cleanup interval will keep running until stop() is called, preventing the instance
- * from being garbage collected.
- *
- * @example
- * ```typescript
- * const map = new TTLMap<string, number>(60_000); // 60s TTL
- * try {
- *   map.set('key', 123);
- *   // use map...
- * } finally {
- *   map.stop(); // REQUIRED: stops cleanup interval
- * }
- * ```
- *
- * Memory leak prevention:
- * - Each heap entry stores (expiresAt, key)
- * - During cleanup, we verify the key still exists in cache AND has matching expiresAt
- * - Stale entries (deleted keys or updated TTLs) are skipped and removed from heap
- * - Periodic compaction rebuilds heap when stale ratio exceeds threshold
- */
-export declare class TTLMap<K, V> {
-    private readonly cache;
-    private readonly ttlMs;
-    private cleanupInterval;
-    /**
-     * Expiry heap: MinHeap of (expiresAt, key) for efficient cleanup
-     * O(log n) insert instead of O(n) with array splice
-     */
-    private readonly expiryHeap;
-    /** Count of stale entries in heap (deleted or updated keys) */
-    private staleCount;
-    /** Rebuild heap when stale entries exceed this ratio of heap size */
-    private static readonly COMPACTION_THRESHOLD;
-    /** Minimum heap size before considering compaction (avoid frequent rebuilds for small heaps) */
-    private static readonly MIN_COMPACTION_SIZE;
-    /**
-     * Create a new TTLMap instance.
-     *
-     * @param ttlMs - Default time-to-live for entries in milliseconds
-     * @param cleanupIntervalMs - Interval between cleanup runs (default: 60000ms / 1 minute).
-     *                           Lower values = more frequent cleanup but higher CPU usage.
-     *                           Set based on expected entry volume and TTL duration.
-     */
-    constructor(ttlMs: number, cleanupIntervalMs?: number);
-    private startCleanup;
-    /** O(k log n) cleanup where k = expired entries */
-    private cleanup;
-    /**
-     * Rebuild heap if stale entry ratio exceeds threshold
-     * This prevents unbounded heap growth from delete() and set() updates
-     */
-    private maybeCompact;
-    /** Rebuild heap with only valid entries - O(n log n) */
-    private rebuildHeap;
-    get(key: K): V | undefined;
-    /** O(log n) insert with MinHeap instead of O(n) with array splice */
-    set(key: K, value: V, ttlMs?: number): void;
-    has(key: K): boolean;
-    delete(key: K): boolean;
-    clear(): void;
-    /**
-     * Stop the cleanup interval. MUST be called when done with this instance
-     * to prevent memory leaks. The interval keeps a reference to the instance,
-     * preventing garbage collection until stop() is called.
-     */
-    stop(): void;
-    get size(): number;
-    /** Get heap size (for debugging/monitoring) */
-    get heapSize(): number;
-    /** Get count of stale heap entries (for debugging/monitoring) */
-    get staleEntryCount(): number;
-}
+export { type MapLike, LRUMap } from './lruMap';
+export { type SetLike, LRUSet } from './lruSet';
+export { BoundedSet } from './boundedSet';
+export { BoundedMap } from './boundedMap';
+export { TTLMap } from './ttlMap';
 //# sourceMappingURL=lru.d.ts.map

package/dist/shared/lru.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"lru.d.ts","sourceRoot":"","sources":["../../src/shared/lru.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,+CAA+C;AAC/C,MAAM,WAAW,OAAO,CAAC,CAAC,EAAE,CAAC;IAC3B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAC3B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAC5B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IACrB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IACxB,KAAK,IAAI,IAAI,CAAC;IACd,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,+CAA+C;AAC/C,MAAM,WAAW,OAAO,CAAC,CAAC;IACxB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IACpB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;IACvB,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;IAC1B,KAAK,IAAI,IAAI,CAAC;IACd,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAUD;;;;GAIG;AACH,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC,CAAE,YAAW,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IAChD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA+B;IACrD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAA6B;IAGtD,OAAO,CAAC,IAAI,CAA8B;IAC1C,OAAO,CAAC,IAAI,CAA8B;gBAE9B,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI;IAKjE,qDAAqD;IACrD,OAAO,CAAC,WAAW;IAgBnB,mCAAmC;IACnC,OAAO,CAAC,UAAU;IAOlB,+BAA+B;IAC/B,OAAO,CAAC,UAAU;IAQlB,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAS1B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAuB3B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAQvB,KAAK,IAAI,IAAI;IAMb,IAAI,IAAI,IAAI,MAAM,CAEjB;IAEA,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAS3B,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAS7B,OAAO,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IASpC,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IASnD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAG9C;AASD;;;GAGG;AACH,qBAAa,MAAM,CAAC,CAAC,CAAE,YAAW,OAAO,CAAC,CAAC,CAAC;IAC1C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA+B;IACrD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAqB;IAG9C,OAAO,CAAC,IAAI,CAA8B;IAC1C,OAAO,CAAC,IAAI,CAA8B;gBAE9B,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI;IAKzD,gCAAgC;IAChC,OAAO,CAAC,WAAW;IAcnB,mCAAmC;IACnC,OAAO,CAAC,UAAU;IAOlB,+BAA+B;IAC/B,OAAO,CAAC,UAAU;IAQlB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAsBnB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAItB,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAQzB,KAAK,IAAI,IAAI;IAMb,IAAI,IAAI,IAAI,MAAM,CAEjB;IAEA,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAS9B,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC;CAGzC;AAED;;;;GAIG;AACH,qBAAa,UAAU,CAAC,CAAC,CAAE,YAAW,OAAO,CAAC,CAAC,CAAC;IAC9C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAgB;IACtC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAqB;IAC9C,2DAA2D;IAC3D,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAS;gBAE5B,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI;IAMzD,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAWnB,uEAAuE;IACvE,OAAO,CAAC,UAAU;IAclB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAItB,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAIzB,KAAK,IAAI,IAAI;IAIb,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAI7B,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC;CAGzC;AAED;;;;GAIG;AACH,qBAAa,UAAU,CAAC,CAAC,EAAE,CAAC,CAAE,YAAW,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IACpD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAmB;IACzC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAA6B;IACtD,2DAA2D;IAC3D,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAS;gBAE5B,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI;IAMjE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAI1B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAc3B,uEAAuE;IACvE,OAAO,CAAC,UAAU;IAclB,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIvB,KAAK,IAAI,IAAI;IAIb,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAI3B,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAI7B,OAAO,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAInC,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IAInD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAG9C;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC;IACtB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAiD;IACvE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAC/B,OAAO,CAAC,eAAe,CAA+C;IAEtE;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,UAAU,CAEzB;IAEF,+DAA+D;IAC/D,OAAO,CAAC,UAAU,CAAK;IAEvB,qEAAqE;IACrE,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,oBAAoB,CAAO;IAEnD,gGAAgG;IAChG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,mBAAmB,CAAO;IAElD;;;;;;;OAOG;gBACS,KAAK,EAAE,MAAM,EAAE,iBAAiB,GAAE,MAAe;IAK7D,OAAO,CAAC,YAAY;IAMpB,mDAAmD;IACnD,OAAO,CAAC,OAAO;IA0Bf;;;OAGG;IACH,OAAO,CAAC,YAAY;IAUpB,wDAAwD;IACxD,OAAO,CAAC,WAAW;IAUnB,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAW1B,qEAAqE;IACrE,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI;IAc3C,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IASvB,KAAK,IAAI,IAAI;IAMb;;;;OAIG;IACH,IAAI,IAAI,IAAI;IAOZ,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,+CAA+C;IAC/C,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED,iEAAiE;IACjE,IAAI,eAAe,IAAI,MAAM,CAE5B;CACF"}
+{"version":3,"file":"lru.d.ts","sourceRoot":"","sources":["../../src/shared/lru.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,KAAK,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAChD,OAAO,EAAE,KAAK,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC"}