@dcrosstech/dct-ts-utils 1.1.0 → 1.2.0

package/dist/lib/stablepriorityqueue.js

@@ -1,40 +0,0 @@
-import { BinaryHeap } from "./heap";
-export class StablePriorityQueue {
-    constructor() {
-        this.seq = 0;
-        this.heap = new BinaryHeap((a, b) => {
-            if (a.priority !== b.priority)
-                return a.priority - b.priority;
-            return a.seq - b.seq; // FIFO on ties
-        });
-    }
-    size() {
-        return this.heap.size();
-    }
-    isEmpty() {
-        return this.heap.isEmpty();
-    }
-    peek() {
-        return this.heap.peek()?.value;
-    }
-    enqueue(value, priority = 0) {
-        if (!Number.isFinite(priority)) {
-            throw new TypeError(`priority must be finite; got ${priority}`);
-        }
-        this.heap.push({
-            value,
-            priority: Math.trunc(priority),
-            seq: this.seq++,
-        });
-    }
-    dequeue() {
-        return this.heap.pop()?.value;
-    }
-    clear() {
-        this.heap.clear();
-        this.seq = 0;
-    }
-    toArray() {
-        return this.heap.toArray().map(n => n.value);
-    }
-}