2 unstable releases

0.2.0 Jun 1, 2025
0.1.0 May 5, 2022

#2702 in Algorithms

Download history 5148/week @ 2025-09-11 4877/week @ 2025-09-18 4322/week @ 2025-09-25 4595/week @ 2025-10-02 4570/week @ 2025-10-09 4251/week @ 2025-10-16 4118/week @ 2025-10-23 1250/week @ 2025-10-30 1064/week @ 2025-11-06 1205/week @ 2025-11-13 1114/week @ 2025-11-20 863/week @ 2025-11-27 438/week @ 2025-12-04 657/week @ 2025-12-11 434/week @ 2025-12-18 174/week @ 2025-12-25

1,920 downloads per month
Used in 3 crates (via rtree_rs)

MIT license

5KB
90 lines

pqueue

license crates.io version documentation

A fast little priority queue for Rust.

Allows for items that have the PartialOrd trait.

Example

Here we create a queue of simple integers.

let items = [9, 5, 1, 3, 4, 2, 6, 8, 9, 2, 1];
let mut q = pqueue::Queue::new();

for item in items {
    q.push(item);
}

while let Some(item) = q.pop() {
    println!("{}", item);
}

// OUTPUT:
// 1
// 1
// 2
// 2
// 3
// 4
// 5
// 6
// 8
// 9
// 9

No runtime deps