algorithmz 1.1.5

This is the corresponding implemenation of the python module of the same name.
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

/// The struct representing the moving average
pub struct MovingAverage {
    /// queue for the struct
    queue: std::collections::VecDeque<i32>,
    /// capacity of the struct
    capacity: usize,
    /// sub of the struct
    sum: i32,
}
/// Computes the moving average over a sliding window.
///
/// # Examples
///
/// Basic example:
/// ```
/// let mut ma = algorithmz::queue::MovingAverage::new(3);
/// assert_eq!(ma.next(1),1.0);
/// assert_eq!(ma.next(10), 5.5);
/// ```
///
/// Another example
/// ``` 
/// use algorithmz::queue::MovingAverage;
/// let mut ma = MovingAverage::new(5);
/// ma.next(1);
/// ma.next(3);
/// ma.next(4);
/// assert_eq!(ma.queue(), vec![1,3,4]);
/// ```
impl MovingAverage {
    /// Instantiate the struct
    pub fn new(size: usize) -> Self {
        MovingAverage  {
            queue: std::collections::VecDeque::with_capacity(size),
            capacity: size,
            sum: 0,
        }
    }
    /// Grab next element of the struct
    pub fn next(&mut self, val: i32) -> f64 {
        if self.queue.len() == self.capacity {
            if let Some(old) = self.queue.pop_front() {
                self.sum -= old;
            }
        }
        self.queue.push_back(val);
        self.sum += val;
        self.sum as f64 / self.queue.len() as f64
    }
    /// Show the queue
    pub fn queue(self) -> std::collections::VecDeque<i32> {
        self.queue
    }
}