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

pub struct Queue<T> {
    st_front: Vec<T>,
    st_back: Vec<T>,
}

impl<T> Queue<T> {
    pub fn new() -> Self {
        Self { st_front: vec![], st_back: vec![] }
    }

    pub fn size(&self) -> usize {
        self.st_front.len() + self.st_back.len()
    }

    pub fn push(
        &mut self,
        x: T,
    ) {
        self.st_back.push(x);
    }

    pub fn pop(&mut self) -> Option<T> {
        if !self.st_front.is_empty() {
            return self.st_front.pop();
        }

        while let Some(x) = self.st_back.pop() {
            self.st_front.push(x);
        }

        self.st_front.pop()
    }
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

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

        que.push(2);

        que.push(1);

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

        que.push(3);

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

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

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