bunqueue 2.3.1 → 2.4.1

package/dist/shared/lruMap.js

@@ -0,0 +1,142 @@
+/**
+ * LRU Map - Map with automatic least-recently-used eviction
+ */
+/**
+ * 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 class LRUMap {
+    cache = new Map();
+    maxSize;
+    onEvict;
+    // Doubly-linked list head (most recent) and tail (least recent)
+    head = null;
+    tail = null;
+    constructor(maxSize, onEvict) {
+        this.maxSize = maxSize;
+        this.onEvict = onEvict;
+    }
+    /** Move node to front (most recently used) - O(1) */
+    moveToFront(node) {
+        if (node === this.head)
+            return; // Already at front
+        // Detach from current position
+        if (node.prev)
+            node.prev.next = node.next;
+        if (node.next)
+            node.next.prev = node.prev;
+        if (node === this.tail)
+            this.tail = node.prev;
+        // Move to front
+        node.prev = null;
+        node.next = this.head;
+        if (this.head)
+            this.head.prev = node;
+        this.head = node;
+        this.tail ??= node;
+    }
+    /** Remove node from list - O(1) */
+    removeNode(node) {
+        if (node.prev)
+            node.prev.next = node.next;
+        if (node.next)
+            node.next.prev = node.prev;
+        if (node === this.head)
+            this.head = node.next;
+        if (node === this.tail)
+            this.tail = node.prev;
+    }
+    /** Add node to front - O(1) */
+    addToFront(node) {
+        node.prev = null;
+        node.next = this.head;
+        if (this.head)
+            this.head.prev = node;
+        this.head = node;
+        this.tail ??= node;
+    }
+    get(key) {
+        const node = this.cache.get(key);
+        if (!node)
+            return undefined;
+        // Move to front - O(1) without delete+re-insert
+        this.moveToFront(node);
+        return node.value;
+    }
+    set(key, value) {
+        const existing = this.cache.get(key);
+        if (existing) {
+            // Update value and move to front
+            existing.value = value;
+            this.moveToFront(existing);
+        }
+        else {
+            // Evict if at capacity
+            if (this.cache.size >= this.maxSize && this.tail) {
+                const evicted = this.tail;
+                this.cache.delete(evicted.key);
+                this.removeNode(evicted);
+                this.onEvict?.(evicted.key, evicted.value);
+            }
+            // Add new node
+            const node = { key, value, prev: null, next: null };
+            this.cache.set(key, node);
+            this.addToFront(node);
+        }
+    }
+    has(key) {
+        return this.cache.has(key);
+    }
+    delete(key) {
+        const node = this.cache.get(key);
+        if (!node)
+            return false;
+        this.removeNode(node);
+        return this.cache.delete(key);
+    }
+    clear() {
+        this.cache.clear();
+        this.head = null;
+        this.tail = null;
+    }
+    get size() {
+        return this.cache.size;
+    }
+    *keys() {
+        // Iterate from tail (oldest) to head (newest) to match original Map behavior
+        let current = this.tail;
+        while (current) {
+            yield current.key;
+            current = current.prev;
+        }
+    }
+    *values() {
+        // Iterate from tail (oldest) to head (newest) to match original Map behavior
+        let current = this.tail;
+        while (current) {
+            yield current.value;
+            current = current.prev;
+        }
+    }
+    *entries() {
+        // Iterate from tail (oldest) to head (newest) to match original Map behavior
+        let current = this.tail;
+        while (current) {
+            yield [current.key, current.value];
+            current = current.prev;
+        }
+    }
+    forEach(callback) {
+        // Iterate from tail (oldest) to head (newest) to match original Map behavior
+        let current = this.tail;
+        while (current) {
+            callback(current.value, current.key);
+            current = current.prev;
+        }
+    }
+    [Symbol.iterator]() {
+        return this.entries();
+    }
+}
+//# sourceMappingURL=lruMap.js.map

package/dist/shared/lruMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lruMap.js","sourceRoot":"","sources":["../../src/shared/lruMap.ts"],"names":[],"mappings":"AAAA;;GAEG;AAoBH;;;;GAIG;AACH,MAAM,OAAO,MAAM;IACA,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IACpC,OAAO,CAAS;IAChB,OAAO,CAA8B;IAEtD,gEAAgE;IACxD,IAAI,GAAyB,IAAI,CAAC;IAClC,IAAI,GAAyB,IAAI,CAAC;IAE1C,YAAY,OAAe,EAAE,OAAoC;QAC/D,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,qDAAqD;IAC7C,WAAW,CAAC,IAAmB;QACrC,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI;YAAE,OAAO,CAAC,mBAAmB;QAEnD,+BAA+B;QAC/B,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC1C,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC1C,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAE9C,gBAAgB;QAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACrC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;IACrB,CAAC;IAED,mCAAmC;IAC3B,UAAU,CAAC,IAAmB;QACpC,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC1C,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC1C,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC9C,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAChD,CAAC;IAED,+BAA+B;IACvB,UAAU,CAAC,IAAmB;QACpC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACrC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;IACrB,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAE5B,gDAAgD;QAChD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAErC,IAAI,QAAQ,EAAE,CAAC;YACb,iCAAiC;YACjC,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC;YACvB,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC7B,CAAC;aAAM,CAAC;YACN,uBAAuB;YACvB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACjD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;gBAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBAC/B,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBACzB,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;YAC7C,CAAC;YAED,eAAe;YACf,MAAM,IAAI,GAAkB,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YACnE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAExB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,CAAC,IAAI;QACH,6EAA6E;QAC7E,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,EAAE,CAAC;YACf,MAAM,OAAO,CAAC,GAAG,CAAC;YAClB,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IAED,CAAC,MAAM;QACL,6EAA6E;QAC7E,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,EAAE,CAAC;YACf,MAAM,OAAO,CAAC,KAAK,CAAC;YACpB,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IAED,CAAC,OAAO;QACN,6EAA6E;QAC7E,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,EAAE,CAAC;YACf,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;YACnC,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,QAAoC;QAC1C,6EAA6E;QAC7E,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,EAAE,CAAC;YACf,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;YACrC,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;CACF"}

package/dist/shared/lruSet.d.ts

@@ -0,0 +1,37 @@
+/**
+ * LRU Set - Set with automatic least-recently-used eviction
+ */
+/** 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 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>;
+}
+//# sourceMappingURL=lruSet.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"lruSet.d.ts","sourceRoot":"","sources":["../../src/shared/lruSet.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,+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;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"}

package/dist/shared/lruSet.js

@@ -0,0 +1,106 @@
+/**
+ * LRU Set - Set with automatic least-recently-used eviction
+ */
+/**
+ * LRU Set - automatically evicts least recently used entries
+ * Optimized with doubly-linked list for O(1) move-to-front
+ */
+export class LRUSet {
+    cache = new Map();
+    maxSize;
+    onEvict;
+    // Doubly-linked list head (most recent) and tail (least recent)
+    head = null;
+    tail = null;
+    constructor(maxSize, onEvict) {
+        this.maxSize = maxSize;
+        this.onEvict = onEvict;
+    }
+    /** Move node to front - O(1) */
+    moveToFront(node) {
+        if (node === this.head)
+            return;
+        if (node.prev)
+            node.prev.next = node.next;
+        if (node.next)
+            node.next.prev = node.prev;
+        if (node === this.tail)
+            this.tail = node.prev;
+        node.prev = null;
+        node.next = this.head;
+        if (this.head)
+            this.head.prev = node;
+        this.head = node;
+        this.tail ??= node;
+    }
+    /** Remove node from list - O(1) */
+    removeNode(node) {
+        if (node.prev)
+            node.prev.next = node.next;
+        if (node.next)
+            node.next.prev = node.prev;
+        if (node === this.head)
+            this.head = node.next;
+        if (node === this.tail)
+            this.tail = node.prev;
+    }
+    /** Add node to front - O(1) */
+    addToFront(node) {
+        node.prev = null;
+        node.next = this.head;
+        if (this.head)
+            this.head.prev = node;
+        this.head = node;
+        this.tail ??= node;
+    }
+    add(value) {
+        const existing = this.cache.get(value);
+        if (existing) {
+            // Move to front
+            this.moveToFront(existing);
+        }
+        else {
+            // Evict if at capacity
+            if (this.cache.size >= this.maxSize && this.tail) {
+                const evicted = this.tail;
+                this.cache.delete(evicted.value);
+                this.removeNode(evicted);
+                this.onEvict?.(evicted.value);
+            }
+            // Add new node
+            const node = { value, prev: null, next: null };
+            this.cache.set(value, node);
+            this.addToFront(node);
+        }
+    }
+    has(value) {
+        return this.cache.has(value);
+    }
+    delete(value) {
+        const node = this.cache.get(value);
+        if (!node)
+            return false;
+        this.removeNode(node);
+        return this.cache.delete(value);
+    }
+    clear() {
+        this.cache.clear();
+        this.head = null;
+        this.tail = null;
+    }
+    get size() {
+        return this.cache.size;
+    }
+    *values() {
+        // Iterate from tail (oldest) to head (newest) to match original Set behavior
+        let current = this.tail;
+        while (current) {
+            yield current.value;
+            current = current.prev;
+        }
+    }
+    [Symbol.iterator]() {
+        return this.values();
+    }
+}
+//# sourceMappingURL=lruSet.js.map

package/dist/shared/lruSet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lruSet.js","sourceRoot":"","sources":["../../src/shared/lruSet.ts"],"names":[],"mappings":"AAAA;;GAEG;AAkBH;;;GAGG;AACH,MAAM,OAAO,MAAM;IACA,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IACpC,OAAO,CAAS;IAChB,OAAO,CAAsB;IAE9C,gEAAgE;IACxD,IAAI,GAAyB,IAAI,CAAC;IAClC,IAAI,GAAyB,IAAI,CAAC;IAE1C,YAAY,OAAe,EAAE,OAA4B;QACvD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,gCAAgC;IACxB,WAAW,CAAC,IAAmB;QACrC,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI;YAAE,OAAO;QAE/B,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC1C,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC1C,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAE9C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACrC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;IACrB,CAAC;IAED,mCAAmC;IAC3B,UAAU,CAAC,IAAmB;QACpC,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC1C,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC1C,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC9C,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAChD,CAAC;IAED,+BAA+B;IACvB,UAAU,CAAC,IAAmB;QACpC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACrC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;IACrB,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEvC,IAAI,QAAQ,EAAE,CAAC;YACb,gBAAgB;YAChB,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC7B,CAAC;aAAM,CAAC;YACN,uBAAuB;YACvB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACjD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;gBAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBACjC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBACzB,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAChC,CAAC;YAED,eAAe;YACf,MAAM,IAAI,GAAkB,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YAC9D,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAC5B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,CAAC,KAAQ;QACb,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAExB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,CAAC,MAAM;QACL,6EAA6E;QAC7E,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,EAAE,CAAC;YACf,MAAM,OAAO,CAAC,KAAK,CAAC;YACpB,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;IACvB,CAAC;CACF"}

package/dist/shared/ttlMap.d.ts

@@ -0,0 +1,82 @@
+/**
+ * TTL Map - entries expire after timeout
+ * Optimized with MinHeap for O(log n) insert and O(k) cleanup
+ */
+/**
+ * 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;
+}
+//# sourceMappingURL=ttlMap.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"ttlMap.d.ts","sourceRoot":"","sources":["../../src/shared/ttlMap.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;;;;;;;;;;;;;;;;;;;;;;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"}

package/dist/shared/ttlMap.js

@@ -0,0 +1,169 @@
+/**
+ * TTL Map - entries expire after timeout
+ * Optimized with MinHeap for O(log n) insert and O(k) cleanup
+ */
+import { MinHeap } from './minHeap';
+/**
+ * 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 class TTLMap {
+    cache = new Map();
+    ttlMs;
+    cleanupInterval = null;
+    /**
+     * Expiry heap: MinHeap of (expiresAt, key) for efficient cleanup
+     * O(log n) insert instead of O(n) with array splice
+     */
+    expiryHeap = new MinHeap((a, b) => a.expiresAt - b.expiresAt);
+    /** Count of stale entries in heap (deleted or updated keys) */
+    staleCount = 0;
+    /** Rebuild heap when stale entries exceed this ratio of heap size */
+    static COMPACTION_THRESHOLD = 0.5;
+    /** Minimum heap size before considering compaction (avoid frequent rebuilds for small heaps) */
+    static MIN_COMPACTION_SIZE = 100;
+    /**
+     * 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, cleanupIntervalMs = 60_000) {
+        this.ttlMs = ttlMs;
+        this.startCleanup(cleanupIntervalMs);
+    }
+    startCleanup(intervalMs) {
+        this.cleanupInterval = setInterval(() => {
+            this.cleanup();
+        }, intervalMs);
+    }
+    /** O(k log n) cleanup where k = expired entries */
+    cleanup() {
+        const now = Date.now();
+        // Remove expired entries from heap - O(k log n)
+        while (!this.expiryHeap.isEmpty) {
+            const top = this.expiryHeap.peek();
+            if (!top || top.expiresAt > now)
+                break;
+            this.expiryHeap.pop();
+            const { key, expiresAt } = top;
+            // Verify entry still exists and has same expiry (might have been updated or deleted)
+            const entry = this.cache.get(key);
+            if (entry?.expiresAt === expiresAt) {
+                // Valid expired entry - delete from cache
+                this.cache.delete(key);
+            }
+            else {
+                // Stale heap entry (key deleted or TTL updated) - already removed, decrement counter
+                if (this.staleCount > 0)
+                    this.staleCount--;
+            }
+        }
+        // Compact heap if too many stale entries accumulated
+        this.maybeCompact();
+    }
+    /**
+     * Rebuild heap if stale entry ratio exceeds threshold
+     * This prevents unbounded heap growth from delete() and set() updates
+     */
+    maybeCompact() {
+        const heapSize = this.expiryHeap.size;
+        if (heapSize >= TTLMap.MIN_COMPACTION_SIZE &&
+            this.staleCount / heapSize > TTLMap.COMPACTION_THRESHOLD) {
+            this.rebuildHeap();
+        }
+    }
+    /** Rebuild heap with only valid entries - O(n log n) */
+    rebuildHeap() {
+        this.expiryHeap.clear();
+        this.staleCount = 0;
+        // Re-add all valid cache entries to heap
+        for (const [key, entry] of this.cache) {
+            this.expiryHeap.push({ expiresAt: entry.expiresAt, key });
+        }
+    }
+    get(key) {
+        const entry = this.cache.get(key);
+        if (!entry)
+            return undefined;
+        if (entry.expiresAt <= Date.now()) {
+            this.cache.delete(key);
+            this.staleCount++; // Heap entry is now stale
+            return undefined;
+        }
+        return entry.value;
+    }
+    /** O(log n) insert with MinHeap instead of O(n) with array splice */
+    set(key, value, ttlMs) {
+        const expiresAt = Date.now() + (ttlMs ?? this.ttlMs);
+        // Check if key already exists - old heap entry becomes stale
+        if (this.cache.has(key)) {
+            this.staleCount++;
+        }
+        this.cache.set(key, { value, expiresAt });
+        // Add to expiry heap - O(log n) with MinHeap
+        this.expiryHeap.push({ expiresAt, key });
+    }
+    has(key) {
+        return this.get(key) !== undefined;
+    }
+    delete(key) {
+        const existed = this.cache.delete(key);
+        if (existed) {
+            // Heap entry is now stale - will be cleaned up lazily or during compaction
+            this.staleCount++;
+        }
+        return existed;
+    }
+    clear() {
+        this.cache.clear();
+        this.expiryHeap.clear();
+        this.staleCount = 0;
+    }
+    /**
+     * 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() {
+        if (this.cleanupInterval) {
+            clearInterval(this.cleanupInterval);
+            this.cleanupInterval = null;
+        }
+    }
+    get size() {
+        return this.cache.size;
+    }
+    /** Get heap size (for debugging/monitoring) */
+    get heapSize() {
+        return this.expiryHeap.size;
+    }
+    /** Get count of stale heap entries (for debugging/monitoring) */
+    get staleEntryCount() {
+        return this.staleCount;
+    }
+}
+//# sourceMappingURL=ttlMap.js.map

package/dist/shared/ttlMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ttlMap.js","sourceRoot":"","sources":["../../src/shared/ttlMap.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,OAAO,MAAM;IACA,KAAK,GAAG,IAAI,GAAG,EAAsC,CAAC;IACtD,KAAK,CAAS;IACvB,eAAe,GAA0C,IAAI,CAAC;IAEtE;;;OAGG;IACc,UAAU,GAAG,IAAI,OAAO,CACvC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CACpC,CAAC;IAEF,+DAA+D;IACvD,UAAU,GAAG,CAAC,CAAC;IAEvB,qEAAqE;IAC7D,MAAM,CAAU,oBAAoB,GAAG,GAAG,CAAC;IAEnD,gGAAgG;IACxF,MAAM,CAAU,mBAAmB,GAAG,GAAG,CAAC;IAElD;;;;;;;OAOG;IACH,YAAY,KAAa,EAAE,oBAA4B,MAAM;QAC3D,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,YAAY,CAAC,iBAAiB,CAAC,CAAC;IACvC,CAAC;IAEO,YAAY,CAAC,UAAkB;QACrC,IAAI,CAAC,eAAe,GAAG,WAAW,CAAC,GAAG,EAAE;YACtC,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,CAAC,EAAE,UAAU,CAAC,CAAC;IACjB,CAAC;IAED,mDAAmD;IAC3C,OAAO;QACb,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,gDAAgD;QAChD,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;YAChC,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;YACnC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,SAAS,GAAG,GAAG;gBAAE,MAAM;YAEvC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC;YACtB,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;YAE/B,qFAAqF;YACrF,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,KAAK,EAAE,SAAS,KAAK,SAAS,EAAE,CAAC;gBACnC,0CAA0C;gBAC1C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,qFAAqF;gBACrF,IAAI,IAAI,CAAC,UAAU,GAAG,CAAC;oBAAE,IAAI,CAAC,UAAU,EAAE,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED;;;OAGG;IACK,YAAY;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QACtC,IACE,QAAQ,IAAI,MAAM,CAAC,mBAAmB;YACtC,IAAI,CAAC,UAAU,GAAG,QAAQ,GAAG,MAAM,CAAC,oBAAoB,EACxD,CAAC;YACD,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,CAAC;IACH,CAAC;IAED,wDAAwD;IAChD,WAAW;QACjB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QAEpB,yCAAyC;QACzC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACtC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAC;QAC7B,IAAI,KAAK,CAAC,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,0BAA0B;YAC7C,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED,qEAAqE;IACrE,GAAG,CAAC,GAAM,EAAE,KAAQ,EAAE,KAAc;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;QAErD,6DAA6D;QAC7D,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,UAAU,EAAE,CAAC;QACpB,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;QAE1C,6CAA6C;QAC7C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;IACrC,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,OAAO,EAAE,CAAC;YACZ,2EAA2E;YAC3E,IAAI,CAAC,UAAU,EAAE,CAAC;QACpB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,CAAC;IAED;;;;OAIG;IACH,IAAI;QACF,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;YACzB,aAAa,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YACpC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,+CAA+C;IAC/C,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IAC9B,CAAC;IAED,iEAAiE;IACjE,IAAI,eAAe;QACjB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "bunqueue",
-  "version": "2.3.1",
+  "version": "2.4.1",
   "description": "High-performance job queue server written in TypeScript. SQLite persistence, cron scheduling, priorities, retries, DLQ, webhooks. Minimal dependencies.",
   "type": "module",
   "main": "dist/main.js",