Namespace CounterpointCollective.Collections

Classes

UniquePriorityQueue<K, V, P>

A priority queue where each key is unique and associated with a value and a priority. When Enqueue(K, V, P) is called for a key already existing in the queue, its associated value and priority are updated. Dequeue operations always return the item with the highest priority.