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
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

pub struct Deque<T> {
    data: Vec<Option<T>>,
    left: usize,
    right: usize,
    size: usize,
}

impl<T: Clone> Deque<T> {
    pub fn new(buf_size: usize) -> Self {
        Self { data: vec![None; buf_size], left: 0, right: 0, size: 0 }
    }

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

    pub fn buf_size(&self) -> usize {
        self.data.len()
    }

    pub fn is_full(&self) -> bool {
        self.size() == self.buf_size()
    }

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

    pub fn push_right(
        &mut self,
        x: T,
    ) {
        assert!(!self.is_full());

        debug_assert!(self.data[self.right].is_none());

        self.data[self.right] = Some(x);

        self.size += 1;

        self.right += 1;

        if self.right == self.buf_size() {
            self.right = 0;
        }
    }

    pub fn push_left(
        &mut self,
        x: T,
    ) {
        assert!(!self.is_full());

        if self.left == 0 {
            self.left = self.buf_size();
        }

        self.left -= 1;

        debug_assert!(self.data[self.left].is_none());

        self.data[self.left] = Some(x);

        self.size += 1;
    }

    pub fn pop_right(&mut self) -> Option<T> {
        if self.is_empty() {
            return None;
        }

        if self.right == 0 {
            self.right = self.buf_size();
        }

        self.right -= 1;

        let v = self.data[self.right].take();

        self.size -= 1;

        debug_assert!(v.is_some());

        v
    }

    pub fn pop_left(&mut self) -> Option<T> {
        if self.is_empty() {
            return None;
        }

        let v = self.data[self.left].take();

        self.left += 1;

        if self.left == self.buf_size() {
            self.left = 0;
        }

        self.size -= 1;

        debug_assert!(v.is_some());

        v
    }
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

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

        que.push_right(0);

        que.push_left(1);

        que.push_right(2);

        assert_eq!(que.size(), 3);

        assert_eq!(que.buf_size(), 10);

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

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

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

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