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

use std::collections::VecDeque;

pub struct SWAGDeque {
    v: i64,
    que: VecDeque<i64>,
}

impl SWAGDeque {
    pub fn new() -> Self {
        Self { v: 0, que: VecDeque::new() }
    }

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

    pub fn push_right(
        &mut self,
        x: i64,
    ) {
        self.v += x;

        self.que.push_back(x);
    }

    pub fn push_left(
        &mut self,
        x: i64,
    ) {
        self.v += x;

        self.que.push_front(x);
    }

    pub fn pop_left(&mut self) {
        self.v -= self.que.pop_front().unwrap();
    }

    pub fn pop_right(&mut self) {
        self.v -= self.que.pop_back().unwrap();
    }

    pub fn fold(&self) -> i64 {
        self.v
    }
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        let mut swag = SWAGDeque::new();

        assert_eq!(swag.fold(), 0);

        swag.push_right(1);

        assert_eq!(swag.fold(), 1);

        swag.push_right(2);

        assert_eq!(swag.fold(), 3);

        swag.pop_left();

        assert_eq!(swag.fold(), 2);

        swag.pop_left();

        assert_eq!(swag.fold(), 0);
    }
}