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

use crate::doubly_linked_list_node::{
    Cell,
    Node,
};

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

impl<T: Clone> Deque<T> {
    pub fn new() -> Self {
        Self { left: None, right: None, size: 0 }
    }

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

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

    pub fn push_right(
        &mut self,
        x: T,
    ) {
        let x = Node::new(x);

        let right = Node::add_right(self.right.take(), x);

        if self.size == 0 {
            self.left = Some(right.clone());
        }

        self.right = Some(right);

        self.size += 1;
    }

    pub fn push_left(
        &mut self,
        x: T,
    ) {
        let x = Node::new(x);

        let left = Node::add_left(self.left.take(), x);

        if self.size == 0 {
            self.right = Some(left.clone());
        }

        self.left = Some(left);

        self.size += 1;
    }

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

        let (right, popped) = Node::split_left(self.right.take().unwrap());

        let v = popped.borrow().value.clone();

        self.size -= 1;

        if self.size == 0 {
            self.left = None;
        }

        self.right = right;

        Some(v)
    }

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

        let (popped, left) = Node::split_right(self.left.take().unwrap());

        let v = popped.borrow().value.clone();

        self.size -= 1;

        if self.size == 0 {
            self.right = None;
        }

        self.left = left;

        Some(v)
    }
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

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

        que.push_right(0);

        que.push_left(1);

        que.push_right(2);

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

        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);
    }
}