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

pub struct Stack<T>(Vec<T>);

impl<T> Stack<T> {
    pub fn size(&self) -> usize {
        self.0.len()
    }

    pub fn new() -> Self {
        Self(vec![])
    }

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

    pub fn pop(&mut self) -> T {
        self.0.pop().unwrap()
    }

    pub fn top(&mut self) -> &T {
        self.0.last().unwrap()
    }

    pub fn is_empty(&self) -> bool {
        self.size() == 0
    }
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        let mut st = Stack::new();

        st.push(3);

        st.push(2);

        assert_eq!(st.size(), 2);

        assert_eq!(st.top(), &2);

        assert_eq!(st.size(), 2);

        assert_eq!(st.pop(), 2);

        assert_eq!(st.size(), 1);
    }
}