queue-queue
| Crates.io | queue-queue |
| lib.rs | queue-queue |
| version | 0.2.2 |
| source | src |
| created_at | 2024-05-06 02:27:23.380623 |
| updated_at | 2024-06-08 22:30:15.656245 |
| description | A priority queue implementation based on Rust's BinaryHeap |
| homepage | https://github.com/naomijub/queue-queue |
| repository | https://github.com/naomijub/queue-queue |
| max_upload_size | |
| id | 1230713 |
| size | 71,326 |
Julia Naomi (naomijub)
documentation
README
queue-queue
Name inspired by the sound birds make "cuckoo"
A simple priority queue crate that supports defining the priority of an element with zero default dependencies. All queues depend on 2 types P the priority, that implements PartialOrd + PartialEq + Eq and T the value, that implements PartialEq + Eq.
All priority queues implement the trait PriorityQueue from prelude, and the available queues are:
RustyPriorityQueuewhich is based on top of Rust'sBinaryHeap. Highest priority has the highest PartialOrd value.InversePriorityQueuewhich is based on top of Rust'sBinaryHeap. Highest priority has the lowest PartialOrd value.