moogle 0.4.4

data structures for relational code
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

use super::common_fixture::*;
pub use super::common_fixture::{items_only, items_or_work};

#[derive(Clone, Debug)]
pub(crate) enum Phase {
    Insert { opts: Vec<IterWorkOr<u16>> },
    Remove { opts: Vec<IterWorkOr<u16>> },
}

#[derive(Clone, Debug)]
pub(crate) struct Routine(pub Vec<Phase>);

impl quickcheck::Arbitrary for Routine {
    fn arbitrary(g: &mut quickcheck::Gen) -> Routine { 
        let length: i16 = *g.choose(&[0, 1, 1, 2, 2, 2, 3, 3, 4, 5]).unwrap();
        let mut xs = vec![];
        for _ in 0..length {
            xs.push(Phase::arbitrary(g));
        }
        Routine(xs)
    }
}

impl quickcheck::Arbitrary for Phase {
    fn arbitrary(g: &mut quickcheck::Gen) -> Phase { 
        let options: [fn(&mut quickcheck::Gen) -> Phase; 2] = [
            |g_| Phase::Insert { opts: Vec::arbitrary(g_) },
            |g_| Phase::Remove { opts: Vec::arbitrary(g_) },
        ];
        g.choose(&options).unwrap()(g)
    }
}