dsalgo 0.3.10

A package for Datastructures and Algorithms.
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

use std::collections::VecDeque;

pub struct BFS01Queue<T>(VecDeque<T>);

impl<T: Ord> BFS01Queue<T> {
    pub fn new() -> Self {
        Self(VecDeque::new())
    }

    pub fn size(&self) -> usize {
        self.0.len()
    }

    pub fn push(
        &mut self,
        x: T,
    ) {
        if self.size() == 0 || &x <= self.0.front().unwrap() {
            self.0.push_front(x);
        } else if &x >= self.0.back().unwrap() {
            self.0.push_back(x);
        } else {
            panic!();
        }
    }

    pub fn pop(&mut self) -> Option<T> {
        self.0.pop_front()
    }
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        let mut que = BFS01Queue::new();

        que.push(1);

        que.push(0);

        que.push(2);

        assert_eq!(que.pop(), Some(0));

        que.push(1);

        assert_eq!(que.pop(), Some(1));

        assert_eq!(que.pop(), Some(1));

        assert_eq!(que.pop(), Some(2));

        assert_eq!(que.pop(), None);
    }
}