bunqueue 1.4.0 → 1.5.0

package/dist/shared/skipList.js

@@ -0,0 +1,277 @@
+/**
+ * Skip List Implementation
+ * Probabilistic data structure with O(log n) insert, delete, search
+ * Ideal for sorted collections with frequent modifications
+ */
+/** Sentinel node (head) */
+function createHead(maxLevel) {
+    const forward = [];
+    for (let i = 0; i <= maxLevel; i++) {
+        forward.push(null);
+    }
+    return {
+        value: null,
+        forward,
+    };
+}
+/**
+ * Skip List with O(log n) operations
+ * - insert: O(log n)
+ * - delete: O(log n)
+ * - search: O(log n)
+ * - range query: O(log n + k) where k = results
+ */
+export class SkipList {
+    maxLevel;
+    probability;
+    compare;
+    head;
+    level = 0;
+    _size = 0;
+    /**
+     * Create a skip list
+     * @param compare Comparator function (negative if a < b, positive if a > b, 0 if equal)
+     * @param maxLevel Maximum level (default 16, supports ~65k elements efficiently)
+     * @param probability Level promotion probability (default 0.5)
+     */
+    constructor(compare, maxLevel = 16, probability = 0.5) {
+        this.compare = compare;
+        this.maxLevel = maxLevel;
+        this.probability = probability;
+        this.head = createHead(maxLevel);
+    }
+    /** Current number of elements */
+    get size() {
+        return this._size;
+    }
+    /** Check if empty */
+    get isEmpty() {
+        return this._size === 0;
+    }
+    /** Generate random level for new node */
+    randomLevel() {
+        let lvl = 0;
+        while (Math.random() < this.probability && lvl < this.maxLevel) {
+            lvl++;
+        }
+        return lvl;
+    }
+    /**
+     * Insert value - O(log n)
+     */
+    insert(value) {
+        const update = [];
+        for (let i = 0; i <= this.maxLevel; i++) {
+            update.push(null);
+        }
+        let current = this.head;
+        // Find insert position at each level
+        for (let i = this.level; i >= 0; i--) {
+            let fwd = current.forward[i];
+            while (fwd !== null && this.compare(fwd.value, value) < 0) {
+                current = fwd;
+                fwd = current.forward[i];
+            }
+            update[i] = current;
+        }
+        // Generate level for new node
+        const newLevel = this.randomLevel();
+        // If new level is higher than current, update head
+        if (newLevel > this.level) {
+            for (let i = this.level + 1; i <= newLevel; i++) {
+                update[i] = this.head;
+            }
+            this.level = newLevel;
+        }
+        // Create new node
+        const newNodeForward = [];
+        for (let i = 0; i <= newLevel; i++) {
+            newNodeForward.push(null);
+        }
+        const newNode = {
+            value,
+            forward: newNodeForward,
+        };
+        // Insert at each level
+        for (let i = 0; i <= newLevel; i++) {
+            const updateNode = update[i];
+            if (updateNode) {
+                newNode.forward[i] = updateNode.forward[i];
+                updateNode.forward[i] = newNode;
+            }
+        }
+        this._size++;
+    }
+    /**
+     * Delete value - O(log n)
+     * @returns true if found and deleted
+     */
+    delete(value) {
+        const update = [];
+        for (let i = 0; i <= this.maxLevel; i++) {
+            update.push(null);
+        }
+        let current = this.head;
+        // Find node at each level
+        for (let i = this.level; i >= 0; i--) {
+            let fwd = current.forward[i];
+            while (fwd !== null && this.compare(fwd.value, value) < 0) {
+                current = fwd;
+                fwd = current.forward[i];
+            }
+            update[i] = current;
+        }
+        // Check if found
+        const target = current.forward[0];
+        if (target === null || this.compare(target.value, value) !== 0) {
+            return false;
+        }
+        // Remove from each level
+        for (let i = 0; i <= this.level; i++) {
+            const updateNode = update[i];
+            if (updateNode?.forward[i] === target) {
+                updateNode.forward[i] = target.forward[i];
+            }
+            else {
+                break;
+            }
+        }
+        // Reduce level if necessary
+        while (this.level > 0 && this.head.forward[this.level] === null) {
+            this.level--;
+        }
+        this._size--;
+        return true;
+    }
+    /**
+     * Delete by predicate - O(n) worst case, but typically O(log n + k)
+     * Useful when you need to match by a subset of fields
+     */
+    deleteWhere(predicate) {
+        let current = this.head.forward[0];
+        while (current !== null) {
+            if (predicate(current.value)) {
+                this.delete(current.value);
+                return current.value;
+            }
+            current = current.forward[0];
+        }
+        return null;
+    }
+    /**
+     * Find exact value - O(log n)
+     */
+    find(value) {
+        let current = this.head;
+        for (let i = this.level; i >= 0; i--) {
+            let fwd = current.forward[i];
+            while (fwd !== null && this.compare(fwd.value, value) < 0) {
+                current = fwd;
+                fwd = current.forward[i];
+            }
+        }
+        const target = current.forward[0];
+        if (target !== null && this.compare(target.value, value) === 0) {
+            return target.value;
+        }
+        return null;
+    }
+    /**
+     * Check if value exists - O(log n)
+     */
+    has(value) {
+        return this.find(value) !== null;
+    }
+    /**
+     * Get first (minimum) element - O(1)
+     */
+    first() {
+        return this.head.forward[0]?.value ?? null;
+    }
+    /**
+     * Remove and return first element - O(log n)
+     */
+    shift() {
+        const first = this.head.forward[0];
+        if (first === null)
+            return null;
+        this.delete(first.value);
+        return first.value;
+    }
+    /**
+     * Range query: get all values where comparator returns <= 0
+     * O(log n + k) where k = number of results
+     * @param maxValue Upper bound (inclusive)
+     * @param limit Maximum number of results
+     */
+    rangeUntil(maxValue, limit) {
+        const result = [];
+        let current = this.head.forward[0];
+        while (current !== null && this.compare(current.value, maxValue) <= 0) {
+            result.push(current.value);
+            if (limit !== undefined && result.length >= limit)
+                break;
+            current = current.forward[0];
+        }
+        return result;
+    }
+    /**
+     * Get all values where predicate is true, starting from first
+     * Stops at first false (assumes sorted order matches predicate)
+     * O(k) where k = matching results
+     */
+    takeWhile(predicate, limit) {
+        const result = [];
+        let current = this.head.forward[0];
+        while (current !== null && predicate(current.value)) {
+            result.push(current.value);
+            if (limit !== undefined && result.length >= limit)
+                break;
+            current = current.forward[0];
+        }
+        return result;
+    }
+    /**
+     * Iterate all values in order
+     */
+    *values() {
+        let current = this.head.forward[0];
+        while (current !== null) {
+            yield current.value;
+            current = current.forward[0];
+        }
+    }
+    /**
+     * Convert to array
+     */
+    toArray() {
+        return Array.from(this.values());
+    }
+    /**
+     * Clear all elements
+     */
+    clear() {
+        this.head = createHead(this.maxLevel);
+        this.level = 0;
+        this._size = 0;
+    }
+    /**
+     * Filter and remove elements matching predicate
+     * Returns removed elements
+     * O(n) but removes in-place
+     */
+    removeAll(predicate) {
+        const removed = [];
+        let current = this.head.forward[0];
+        while (current !== null) {
+            const next = current.forward[0];
+            if (predicate(current.value)) {
+                removed.push(current.value);
+                this.delete(current.value);
+            }
+            current = next;
+        }
+        return removed;
+    }
+}
+//# sourceMappingURL=skipList.js.map

package/dist/shared/skipList.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"skipList.js","sourceRoot":"","sources":["../../src/shared/skipList.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAQH,2BAA2B;AAC3B,SAAS,UAAU,CAAI,QAAgB;IACrC,MAAM,OAAO,GAA8B,EAAE,CAAC;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IACD,OAAO;QACL,KAAK,EAAE,IAAoB;QAC3B,OAAO;KACR,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,OAAO,QAAQ;IACF,QAAQ,CAAS;IACjB,WAAW,CAAS;IACpB,OAAO,CAAyB;IACzC,IAAI,CAAc;IAClB,KAAK,GAAW,CAAC,CAAC;IAClB,KAAK,GAAW,CAAC,CAAC;IAE1B;;;;;OAKG;IACH,YAAY,OAA+B,EAAE,WAAmB,EAAE,EAAE,cAAsB,GAAG;QAC3F,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,IAAI,GAAG,UAAU,CAAI,QAAQ,CAAC,CAAC;IACtC,CAAC;IAED,iCAAiC;IACjC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,qBAAqB;IACrB,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,yCAAyC;IACjC,WAAW;QACjB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,OAAO,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,IAAI,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC/D,GAAG,EAAE,CAAC;QACR,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAQ;QACb,MAAM,MAAM,GAA8B,EAAE,CAAC;QAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QAExB,qCAAqC;QACrC,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC7B,OAAO,GAAG,KAAK,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1D,OAAO,GAAG,GAAG,CAAC;gBACd,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3B,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QACtB,CAAC;QAED,8BAA8B;QAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAEpC,mDAAmD;QACnD,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC1B,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChD,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YACxB,CAAC;YACD,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;QACxB,CAAC;QAED,kBAAkB;QAClB,MAAM,cAAc,GAA8B,EAAE,CAAC;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;QACD,MAAM,OAAO,GAAgB;YAC3B,KAAK;YACL,OAAO,EAAE,cAAc;SACxB,CAAC;QAEF,uBAAuB;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,UAAU,EAAE,CAAC;gBACf,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC3C,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;YAClC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAQ;QACb,MAAM,MAAM,GAA8B,EAAE,CAAC;QAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QAExB,0BAA0B;QAC1B,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC7B,OAAO,GAAG,KAAK,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1D,OAAO,GAAG,GAAG,CAAC;gBACd,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3B,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QACtB,CAAC;QAED,iBAAiB;QACjB,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,MAAM,KAAK,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YAC/D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,yBAAyB;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC;gBACtC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5C,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;QAED,4BAA4B;QAC5B,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC;YAChE,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,CAAC;QAED,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,SAAgC;QAC1C,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACnC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC3B,OAAO,OAAO,CAAC,KAAK,CAAC;YACvB,CAAC;YACD,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,KAAQ;QACX,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QAExB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC7B,OAAO,GAAG,KAAK,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1D,OAAO,GAAG,GAAG,CAAC;gBACd,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,MAAM,KAAK,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YAC/D,OAAO,MAAM,CAAC,KAAK,CAAC;QACtB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,KAAQ;QACV,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,KAAK;QACH,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,KAAK,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACzB,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,QAAW,EAAE,KAAc;QACpC,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAEnC,OAAO,OAAO,KAAK,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACtE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC3B,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;YACzD,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,SAAgC,EAAE,KAAc;QACxD,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAEnC,OAAO,OAAO,KAAK,IAAI,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACpD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC3B,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;YACzD,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,CAAC,MAAM;QACL,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACnC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,MAAM,OAAO,CAAC,KAAK,CAAC;YACpB,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,UAAU,CAAI,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,SAAgC;QACxC,MAAM,OAAO,GAAQ,EAAE,CAAC;QACxB,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAEnC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC5B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;YACD,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}

package/package.json

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