Crate priority_queue[][src]

Expand description

This crate provides 2 main data structures:

Both data structures are backed by an hashmap, allowing to change the priority of an element with some efficient methods in O(log(N)) time (worst case).

The elements (called Items, of type I) must implement Hash and Eq traits.

This can frequently be achieved by using #[derive(PartialEq, Eq, Hash)]. If you implement these yourself, it is important that the following property holds:

k1 == k2 -> hash(k1) == hash(k2)

In other words, if two keys are equal, their hashes must be equal.

The priority P may be any type that implements Ord. For reverse order remember the standard wrapper Reverse<T>


use priority_queue::PriorityQueue;

let mut pq = PriorityQueue::new();

pq.push("Apples", 5);
pq.push("Bananas", 8);
pq.push("Strawberries", 23);

assert_eq!(pq.peek(), Some((&"Strawberries", &23)));

pq.change_priority("Bananas", 25);
assert_eq!(pq.peek(), Some((&"Bananas", &25)));

for (item, _) in pq.into_sorted_iter() {
    println!("{}", item);


pub use crate::double_priority_queue::DoublePriorityQueue;
pub use crate::priority_queue::PriorityQueue;


This module defines iterator types that are used with both the PriorityQueue and the DoublePriorityQueue

This module contains the DoublePriorityQueue type and the related iterators.

This module contains the PriorityQueue type and the related iterators.