new PriorityQueue()
Members
-
_heap :Array.<{node: *, priority: number}>
-
-
values
-
Backward-compatible accessor — existing code checks .values.length
PriorityQueue()
Binary max-heap priority queue.
Higher priority items are dequeued first.
O(log n) enqueue/dequeue, O(n) clearLowPrioEvents.
Maintains a backward-compatible .values getter for queue length checks.