ReactiveUI.Primitives.Core.PriorityQueue<T>
Binary heap priority queue that preserves insertion order for equal-priority items.
Gets the number of queued items.
public PriorityQueue()
Initializes a new instance of the PriorityQueue<T> class.
Initializes a new instance of the PriorityQueue<T> class.
Removes and returns the highest-priority item.
Removes and returns all queued items in priority order.
Dequeues items into a caller-provided buffer.
Removes up to count queued items in priority order.
Adds an item to the queue.
Adds multiple items to the queue.
Returns the highest-priority item without removing it.
Removes a matching item from the queue.
Attempts to remove and return the highest-priority item.
Attempts to return the highest-priority item without removing it.
Verifies that the internal heap property is currently valid.