echeneis 0.1.1

Testing framework for non-blocking code
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

use std::marker::PhantomData;

use crate::core::schedule::{TestSchedule, linear_pairwise::ExhaustivePairwise};

/// Configure a model
#[derive(Debug)]
#[non_exhaustive]
pub struct ModelBuilder {
    max_steps: usize,
}

impl ModelBuilder {
    /// Conbstructs a new `ModelBuilder`.
    pub fn new() -> Self {
        Self { max_steps: 100_000 }
    }

    /// Set the maximum number of steps.
    pub fn with_steps(mut self, max_steps: usize) -> Self {
        self.max_steps = max_steps;
        self
    }

    /// Check the provided model.
    pub fn check<I, F, D, C>(&mut self, init: I, preempted: F, checked: C)
    where
        I: Fn() -> D,
        F: Fn(&D) + Sync,
        C: Fn(&D),
        D: Sync,
    {
        let model = Model {
            init_fn: init,
            preempted_fn: preempted,
            checked_fn: checked,
            _phantom: PhantomData::<D>,
        };

        let mut scheduler = ExhaustivePairwise::new();
        scheduler.check_model(model);
    }
}

impl Default for ModelBuilder {
    fn default() -> Self {
        Self::new()
    }
}

pub(crate) struct Model<I, F, D, C> {
    pub init_fn: I,
    pub preempted_fn: F,
    pub checked_fn: C,
    _phantom: PhantomData<D>,
}

impl<I, F, D, C> Model<I, F, D, C>
where
    I: Fn() -> D,
    F: Fn(&D),
    C: Fn(&D),
{
    pub(crate) fn init_fn(&self) -> &I {
        &self.init_fn
    }

    pub(crate) fn preemptible_fn(&self) -> &F {
        &self.preempted_fn
    }

    pub(crate) fn checked_fn(&self) -> &C {
        &self.checked_fn
    }
}