queue-queue 0.2.2

A priority queue implementation based on Rust's BinaryHeap
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

use queue_queue::prelude::*;

fn main() {
    let mut prio = RustyPriorityQueue::<usize, String>::default();
    prio.enqueue(2, "hello".to_string());
    prio.enqueue(3, "julia".to_string());
    prio.enqueue(1, "world".to_string());
    prio.enqueue(3, "naomi".to_string());

    let mut new_prio: RustyPriorityQueue<usize, String> = prio
        .into_iter()
        .map(|(priority, data)| (priority, data.to_owned() + " wow"))
        .collect();

    println!(
        "{:?} == Some((1, \"world wow\".to_string()))",
        new_prio.min_node()
    );

    println!(
        "{:?} == Some((3, \"julia wow\".to_string()))",
        new_prio.dequeue()
    );
    println!(
        "{:?} == Some((3, \"naomi wow\".to_string()))",
        new_prio.dequeue()
    );
    println!(
        "{:?} == Some((2, \"hello wow\".to_string()))",
        new_prio.dequeue()
    );
    println!(
        "{:?} == Some((1, \"world wow\".to_string()))",
        new_prio.dequeue()
    );
}