atomic-bomb-engine 0.41.1

A high performance torture testing engine
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

use std::collections::VecDeque;

#[derive(Clone)]
pub(crate) struct FixedSizeQueue<T> {
    queue: VecDeque<T>,
    capacity: usize,
}

impl<T> FixedSizeQueue<T>
where
    T: Copy + Into<f64> + std::iter::Sum<T>,
{
    pub(crate) fn new(capacity: usize) -> Self {
        FixedSizeQueue {
            queue: VecDeque::with_capacity(capacity),
            capacity,
        }
    }

    pub(crate) async fn push(&mut self, item: T) {
        if self.queue.len() == self.capacity {
            self.queue.pop_front();
        }
        self.queue.push_back(item);
    }

    // async fn len(&self) -> usize {
    //     self.queue.len()
    // }
    //
    // async fn is_empty(&self) -> bool {
    //     self.queue.is_empty()
    // }
    //
    // async fn pop(&mut self) -> Option<T> {
    //     self.queue.pop_front()
    // }

    pub(crate) async fn average(&self) -> Option<f64> {
        if self.queue.is_empty() {
            None
        } else {
            let sum: f64 = self.queue.iter().copied().map(Into::into).sum();
            Some(sum / self.queue.len() as f64)
        }
    }
}