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

use crate::Generator;

/// Provides iterable access to the range of values represented by the [`Generator`]
pub struct StringIter<'a> {
    /// The generator to be used
    c: &'a Generator,

    /// The total number of values for `c`, equal to `c.len()`
    n: u128,

    /// The current value of the iterator. The first value is 0, the last is `n-1`.
    i: u128,
}

impl<'a> Iterator for StringIter<'a> {
    type Item = String;

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

#[cfg(feature = "with_rand")]
impl<'a> StringIter<'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 StringIter<'a> {
    fn from(c: &'a Generator) -> Self {
        Self {
            c,
            n: c.len(),
            i: 0,
        }
    }
}