prioq 0.1.2

Priority Queue implemented using std::collections::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
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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166

use std::collections::BinaryHeap;

pub struct PriorityQueue<T, U> where T: Ord + PartialOrd + Eq{
    heap : BinaryHeap<PriorityQueueItem<T,U>>
}

impl<T,U> PriorityQueue<T, U> where T: Ord + PartialOrd + Eq{
    pub fn new() -> Self{
        PriorityQueue{
            heap: BinaryHeap::new(),
        }
    }

    pub fn push(&mut self, priority: T, item: U) {
        self.heap.push(PriorityQueueItem::new(priority,item));
    }

    pub fn pop_priority(&mut self) -> Option<T> {
        self.heap.pop().and_then(|x|{Some(x.priority)})
    }

    pub fn pop_item(&mut self) -> Option<U> {
        self.heap.pop().and_then(|x|{Some(x.item)})
    }

    pub fn pop(&mut self) -> Option<(T,U)> {
        self.heap.pop().and_then(|x|{Some((x.priority,x.item))})
    }

    pub fn peek_priority(&mut self) -> Option<&T> {
        self.heap.peek().and_then(|x|{Some(&x.priority)})
    }

    pub fn peek_item(&mut self) -> Option<&U> {
        self.heap.peek().and_then(|x|{Some(&x.item)})
    }

    pub fn peek(&mut self) -> Option<(&T,&U)> {
        self.heap.peek().and_then(|x|{Some((&x.priority,&x.item))})
    }
}

pub struct ReversePriorityQueue<T, U> where T: Ord + PartialOrd + Eq{
    heap : BinaryHeap<ReversePriorityQueueItem<T,U>>
}

impl<T,U> ReversePriorityQueue<T, U> where T: Ord + PartialOrd + Eq{
    pub fn new() -> Self{
        ReversePriorityQueue{
            heap: BinaryHeap::new(),
        }
    }

    pub fn push(&mut self, priority: T, item: U) {
        self.heap.push(ReversePriorityQueueItem::new(priority,item));
    }

    pub fn pop_priority(&mut self) -> Option<T> {
        self.heap.pop().and_then(|x|{Some(x.priority)})
    }

    pub fn pop_item(&mut self) -> Option<U> {
        self.heap.pop().and_then(|x|{Some(x.item)})
    }

    pub fn pop(&mut self) -> Option<(T,U)> {
        self.heap.pop().and_then(|x|{Some((x.priority,x.item))})
    }

    pub fn peek_priority(&mut self) -> Option<&T> {
        self.heap.peek().and_then(|x|{Some(&x.priority)})
    }

    pub fn peek_item(&mut self) -> Option<&U> {
        self.heap.peek().and_then(|x|{Some(&x.item)})
    }

    pub fn peek(&mut self) -> Option<(&T,&U)> {
        self.heap.peek().and_then(|x|{Some((&x.priority,&x.item))})
    }
}


use std::cmp::Ordering;
use std::fmt;

struct PriorityQueueItem<T, U> where T: Ord + PartialOrd + Eq {
    priority: T,
    item: U
}

impl<T, U> PriorityQueueItem<T, U> where T: Ord + PartialOrd + Eq {
    fn new(priority: T, item: U) -> Self where T: Ord + PartialOrd + Eq {
        PriorityQueueItem {
            priority,
            item
        }
    }
}

impl<T, U> Ord for PriorityQueueItem<T, U> where T: Ord + PartialOrd + Eq {
    fn cmp(&self, other: &Self) -> Ordering {
        self.priority.cmp(&other.priority)
    }
}

impl<T, U> PartialOrd for PriorityQueueItem<T, U> where T: Ord + PartialOrd + Eq {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        self.priority.partial_cmp(&other.priority)
    }
}

impl<T, U> PartialEq for PriorityQueueItem<T, U> where T: Ord + PartialOrd + Eq {
    fn eq(&self, other: &Self) -> bool {
        self.priority.eq(&other.priority)
    }
}

impl<T, U> Eq for PriorityQueueItem<T, U> where T: Ord + PartialOrd + Eq {}

impl<T: fmt::Debug, U> fmt::Debug for PriorityQueueItem<T, U> where T: Ord + PartialOrd + Eq {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        write!(f, "PriorityQueueItem {{ priority: {:?} }}", self.priority)
    }
}

struct ReversePriorityQueueItem<T,U> where T : Ord + PartialOrd + Eq{
    priority : T,
    item : U
}

impl<T,U> ReversePriorityQueueItem<T,U> where T : Ord + PartialOrd + Eq{
    fn new(priority : T, item : U) -> Self where T : Ord + PartialOrd + Eq{
        ReversePriorityQueueItem {
            priority,
            item
        }
    }
}

impl<T,U> Ord for ReversePriorityQueueItem<T,U> where T : Ord + PartialOrd + Eq{
    fn cmp(&self, other: &Self) -> Ordering {
        self.priority.cmp(&other.priority).reverse()
    }
}

impl<T,U> PartialOrd for ReversePriorityQueueItem<T,U> where T : Ord + PartialOrd + Eq{
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        self.priority.partial_cmp(&other.priority).and_then(|x|Some(x.reverse()))
    }
}

impl<T,U> PartialEq for ReversePriorityQueueItem<T,U> where T : Ord + PartialOrd + Eq{
    fn eq(&self, other: &Self) -> bool {
        self.priority.eq(&other.priority)
    }
}

impl<T,U> Eq for ReversePriorityQueueItem<T,U> where T  : Ord + PartialOrd + Eq{
}

impl<T: fmt::Debug, U> fmt::Debug for ReversePriorityQueueItem<T, U> where T  : Ord + PartialOrd + Eq {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        write!(f, "ReversePriorityQueueItem {{ priority: {:?} }}", self.priority)
    }
}