response-time-analysis 0.3.2

Definitions and algorithms for response-time analysis of real-time systems
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 itertools::Itertools;

use super::ArrivalBound;
use crate::time::Duration;

// repeated implementation for Vec<T> because otherwise Vec<Box<dyn ArrivalBound>>
// is not recognized as an ArrivalBound, despite the above blanket implementation for
impl<T: ArrivalBound> ArrivalBound for Vec<T> {
    fn number_arrivals(&self, delta: Duration) -> usize {
        self.iter().map(|ab| ab.number_arrivals(delta)).sum()
    }

    fn steps_iter<'a>(&'a self) -> Box<dyn Iterator<Item = Duration> + 'a> {
        Box::new(self.iter().map(|ab| ab.steps_iter()).kmerge().dedup())
    }

    fn clone_with_jitter(&self, jitter: Duration) -> Box<dyn ArrivalBound> {
        let cloned: Vec<Box<dyn ArrivalBound>> =
            self.iter().map(|ab| ab.clone_with_jitter(jitter)).collect();
        Box::new(cloned)
    }
}

#[derive(Clone, Debug)]
struct SumOf<AB1: ArrivalBound, AB2: ArrivalBound>(AB1, AB2);

/// The sum of two arrival bounds, representing the joint arrival bound.
pub fn sum_of<AB1: ArrivalBound, AB2: ArrivalBound>(ab1: AB1, ab2: AB2) -> impl ArrivalBound {
    SumOf(ab1, ab2)
}

impl<AB1: ArrivalBound, AB2: ArrivalBound> ArrivalBound for SumOf<AB1, AB2> {
    fn number_arrivals(&self, delta: Duration) -> usize {
        self.0.number_arrivals(delta) + self.1.number_arrivals(delta)
    }

    fn steps_iter<'a>(&'a self) -> Box<dyn Iterator<Item = Duration> + 'a> {
        Box::new(self.0.steps_iter().merge(self.1.steps_iter()).dedup())
    }

    fn clone_with_jitter(&self, jitter: Duration) -> Box<dyn ArrivalBound> {
        Box::new(SumOf(
            self.0.clone_with_jitter(jitter),
            self.1.clone_with_jitter(jitter),
        ))
    }
}