flize 4.2.3

non global, configurable and fast concurrent resource reclamation
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

/// A very simple priority queue.
/// This is only ever accessed on thread setup and exit
/// and thus performance is mostly irrelevant.
pub struct PriorityQueue<T> {
    items: Vec<T>,
}

impl<T: Ord> PriorityQueue<T> {
    pub fn new() -> Self {
        Self {
            items: Vec::with_capacity(8),
        }
    }

    pub fn push(&mut self, item: T) {
        self.items.push(item);
    }

    /// Find the index of the least item and remove it from the list.
    pub fn pop(&mut self) -> Option<T> {
        (0..self.items.len())
            .min_by_key(|index| unsafe { self.items.get_unchecked(*index) })
            .map(|index| self.items.remove(index))
    }
}

#[cfg(test)]
mod tests {
    use super::PriorityQueue;

    #[test]
    fn pop_order() {
        let mut queue = PriorityQueue::new();
        queue.push(7);
        queue.push(9);
        queue.push(4);
        assert_eq!(queue.pop(), Some(4));
        assert_eq!(queue.pop(), Some(7));
        assert_eq!(queue.pop(), Some(9));
    }
}