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

pub struct SWAGQueue {
    st_r: Vec<i64>,
    vr: i64,
    st_l: Vec<i64>,
}

impl SWAGQueue {
    pub fn new() -> Self {
        Self { st_r: vec![], vr: std::i64::MIN, st_l: vec![std::i64::MIN] }
    }

    pub fn size(&self) -> usize {
        self.st_r.len() + self.st_l.len() - 1
    }

    pub fn push(
        &mut self,
        x: i64,
    ) {
        self.vr = self.vr.max(x);

        self.st_r.push(x);
    }

    pub fn pop(&mut self) {
        if self.st_l.len() > 1 {
            self.st_l.pop();

            return;
        }

        assert!(!self.st_r.is_empty());

        while let Some(x) = self.st_r.pop() {
            self.st_l.push(x.max(*self.st_l.last().unwrap()));
        }

        self.vr = std::i64::MIN;

        self.st_l.pop();
    }

    pub fn fold(&self) -> i64 {
        self.vr.max(*self.st_l.last().unwrap())
    }
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

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

        assert_eq!(swag.fold(), std::i64::MIN);

        swag.push(1);

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

        swag.push(2);

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

        swag.pop();

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

        swag.pop();

        assert_eq!(swag.fold(), std::i64::MIN);
    }
}