dicetest 0.4.0

Framework for writing tests with randomly generated test data
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

//! The standard collection of [`Codie`] implementations.

use std::collections::hash_map::DefaultHasher;
use std::hash::{Hash, Hasher};

use crate::Seed;
use crate::prelude::*;

struct Fun<F>(F);

impl<T, F> Codie<T> for Fun<F>
where
    F: Fn(T) -> Seed,
{
    fn coroll(&self, value: T) -> Seed {
        self.0(value)
    }
}

/// Helper for implementing a [`Codie`] from a [`Fn`] that returns a seed.
pub fn from_fn<T, F>(f: F) -> impl Codie<T>
where
    F: Fn(T) -> Seed,
{
    Fun(f)
}

/// Uses libstd's [`DefaultHasher`] to create a seed from a hashable value.
pub fn from_default_hasher<T: Hash>() -> impl Codie<T> {
    from_fn(|value: T| {
        let mut hasher = DefaultHasher::new();
        value.hash(&mut hasher);
        hasher.finish().into()
    })
}

#[cfg(test)]
mod tests {
    use crate::codice;
    use crate::codice::Codie;

    #[test]
    fn from_default_hasher_is_deterministic() {
        let codie_0 = codice::from_default_hasher::<u8>();
        let codie_1 = codice::from_default_hasher::<u8>();

        assert_eq!(codie_0.coroll(42), codie_1.coroll(42));
    }
}