1 unstable release

0.1.0 May 5, 2022

#2035 in Algorithms

Download history 3180/week @ 2024-11-16 2061/week @ 2024-11-23 2828/week @ 2024-11-30 2976/week @ 2024-12-07 2027/week @ 2024-12-14 1596/week @ 2024-12-21 1497/week @ 2024-12-28 1711/week @ 2025-01-04 1733/week @ 2025-01-11 1647/week @ 2025-01-18 2384/week @ 2025-01-25 3224/week @ 2025-02-01 3180/week @ 2025-02-08 2054/week @ 2025-02-15 2284/week @ 2025-02-22 2360/week @ 2025-03-01

10,430 downloads per month
Used in 3 crates (via rtree_rs)

MIT license

5KB
87 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