generator-combinator 0.4.0

Composes combinators to generate patterns of increasing complexity
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

use crate::Generator;

/// Provides iterable access to the range of values represented by the [`Generator`]
#[derive(Clone, Debug)]
pub struct VisitIter<'a> {
    c: &'a Generator,
    n: u128,
    i: u128,
}

impl<'a> VisitIter<'a> {
    pub fn visit<F>(&self, cb: F)
    where
        F: FnMut(&str),
    {
        self.c.visit_one(self.i, cb);
    }
}

impl<'a> Iterator for VisitIter<'a> {
    type Item = Self;

    fn next(&mut self) -> Option<Self::Item> {
        if self.i == self.n {
            None
        } else {
            let result = self.clone();
            self.i += 1;
            Some(result)
        }
    }
}

#[cfg(feature = "with_rand")]
impl<'a> VisitIter<'a> {
    /// Generates a random value in the [`Generator`]'s domain
    pub fn random(&self) -> String {
        let num = rand::random::<u128>() % self.n;
        self.c.generate_one(num)
    }
}

impl<'a> From<&'a Generator> for VisitIter<'a> {
    fn from(c: &'a Generator) -> Self {
        Self {
            c,
            n: c.len(),
            i: 0,
        }
    }
}