pbt 0.4.24

Property-based testing with `derive` macros, aware of mutual induction & instantiability.
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

//! Implementation for `()`.

use {
    crate::{
        StronglyConnectedComponents,
        multiset::Multiset,
        pbt::{
            Algebraic, ArbitraryFn, CtorFn, Decomposition, ElimFn, IntroductionRule, Pbt,
            TypeFormer, visit_self,
        },
        reflection::{TermsOfVariousTypes, Type, type_of},
    },
    alloc::collections::BTreeSet,
    core::num::NonZero,
};

impl Pbt for () {
    #[inline]
    fn register_all_immediate_dependencies(
        visited: &mut BTreeSet<Type>,
        _sccs: &mut StronglyConnectedComponents,
    ) {
        let _dup: bool = visited.insert(type_of::<Self>());
    }

    #[inline]
    fn type_former() -> TypeFormer<Self> {
        TypeFormer::Algebraic(Algebraic {
            elimination_rule: ElimFn::new(|()| Decomposition {
                ctor_idx: const { NonZero::new(1).unwrap() },
                fields: TermsOfVariousTypes::new(),
            }),
            introduction_rules: Box::new([IntroductionRule {
                arbitrary: ArbitraryFn::new(|_, _, _| Ok(Some(()))),
                call: CtorFn::new(|_terms| Some(())),
                immediate_dependencies: Multiset::new(),
            }]),
        })
    }

    #[inline]
    fn visit_deep<V>(&self) -> impl Iterator<Item = V>
    where
        V: Pbt,
    {
        visit_self(self)
    }
}