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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
extern crate ordermap;
mod pqueue;
pub use pqueue::PriorityQueue;
#[cfg(test)]
mod tests {
pub use PriorityQueue;
#[test]
fn init(){
let pq: PriorityQueue<String, i32> = PriorityQueue::new();
println!("{:?}", pq);
}
#[test]
fn push_len() {
let mut pq = PriorityQueue::new();
pq.push("a", 1);
pq.push("b", 2);
println!("{:?}", pq);
assert_eq!(pq.len(), 2);
}
#[test]
fn push_pop() {
let mut pq = PriorityQueue::new();
pq.push("a", 1);
pq.push("b", 2);
pq.push("f", 7);
pq.push("g", 4);
pq.push("h", 3);
println!("{:?}", pq);
assert_eq!(pq.pop(), Some(("f", 7)));
println!("{:?}", pq);
assert_eq!(pq.peek(), Some((&"g", &4)));
assert_eq!(pq.pop(), Some(("g", 4)));
assert_eq!(pq.len(), 3);
}
#[test]
fn push_update() {
let mut pq = PriorityQueue::new();
pq.push("a", 1);
pq.push("b", 3);
pq.push("a", 4);
assert_eq!(pq.peek(), Some((&"a", &4)));
}
#[test]
fn change_priority() {
let mut pq = PriorityQueue::new();
pq.push("a", 1);
pq.push("b", 2);
pq.change_priority("a", 3);
assert_eq!(pq.peek(), Some((&"a", &3)));
}
#[test]
fn from_vec() {
let v = vec!(("a", 1), ("b", 2), ("f", 7));
let mut pq = PriorityQueue::from(v);
assert_eq!(pq.pop(), Some(("f", 7)));
assert_eq!(pq.len(), 2);
}
#[test]
fn from_iter() {
use std::iter::FromIterator;
let v = vec!(("a", 1), ("b", 2), ("f", 7));
let mut pq = PriorityQueue::from_iter(v.into_iter());
assert_eq!(pq.pop(), Some(("f", 7)));
assert_eq!(pq.len(), 2);
}
#[test]
fn heap_sort() {
let v = vec!(("a", 2), ("b", 7), ("f", 1));
let sorted = (PriorityQueue::from(v)).into_sorted_vec();
assert_eq!(sorted.as_slice(), &["b", "a", "f"]);
}
}