CounterpointCollective.UniquePriorityQueue

A high-performance priority queue for .NET 10 that guarantees key uniqueness.

• Like a dictionary, you can quickly look up items by key.
• Like a priority queue, you can efficiently retrieve the item with the lowest priority value (min-priority queue).

API documentation

Features

• Unique keys: Each key can exist only once. Subsequent Enqueue calls update the existing entry.
• Fast operations: Efficient enqueue, dequeue, priority updates, and lookups.
• Min-priority queue: Lower priority values are returned first.

Getting Started

Prerequisites

• .NET 10 SDK

Installation

Add the NuGet package to your project:

dotnet add package CounterpointCollective.UniquePriorityQueue

Usage Example:

var queue = new UniquePriorityQueue<string, string, int>(); // Add items (lower priority numbers dequeue first) queue.Enqueue("a", "First task", 5); queue.Enqueue("b", "Urgent task", 1); // Update an existing key queue.Enqueue("a", "Updated task", 0); // Peek lowest-priority item var (key, value, p) = queue.Peek(); // key = "a", p = 0 // Dequeue in ascending priority order while (queue.TryDequeue(out key, out value, out p)) { Console.WriteLine($"{key}: {value} (priority {p})"); }

API Highlights

• UniquePriorityQueue<TKey, TValue, TPriority>: Main queue type.

Project Structure

• UniquePriorityQueue.cs: Core implementation.

License

MIT

Repository

GitLab - PrestoPrimitives

---

Maintained by CounterpointCollective.