rust2fun 0.2.1

A library for functional programming in Rust
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99

mod common;

if_std! {
    extern crate rust2fun_laws;

    use std::collections::LinkedList;
    use std::iter::repeat;

    use proptest::collection::linked_list;
    use proptest::prelude::*;

    use rust2fun::prelude::*;
    use rust2fun_laws::applicative_laws::*;
    use rust2fun_laws::apply_laws::*;
    use rust2fun_laws::flatmap_laws::*;
    use rust2fun_laws::functor_laws::*;
    use rust2fun_laws::invariant_laws::*;
    use rust2fun_laws::monad_laws::*;
    use rust2fun_laws::monoid_laws::*;
    use rust2fun_laws::semigroup_laws::*;
    use rust2fun_laws::semigroupal_laws::*;

    use crate::common::{parse, print};


    proptest! {
        #[test]
        fn test_invariant(fa: LinkedList<bool>) {
            prop_assert!(invariant_identity(fa.clone()).holds());
            prop_assert!(invariant_composition(fa, print, parse, parse::<bool>, print).holds());
        }

        #[test]
        fn test_functor(fa: LinkedList<bool>) {
            prop_assert!(covariant_identity(fa.clone()).holds());
            prop_assert!(covariant_composition(fa.clone(), print, parse::<bool>).holds());
            prop_assert!(lift_identity(fa.clone()).holds());
            prop_assert!(lift_composition(fa, print, parse::<bool>).holds());
        }

        #[test]
        fn test_semigroup(fa: LinkedList<String>, fb: LinkedList<String>, fc: LinkedList<String>) {
            prop_assert!(repeat_0(fa.clone()).holds());
            prop_assert!(repeat_1(fb.clone()).holds());
            prop_assert!(semigroup_associativity(fa, fb, fc).holds());
        }

        #[test]
        fn test_monoid(fa: LinkedList<String>) {
            prop_assert!(monoid_left_identity(fa.clone()).holds());
            prop_assert!(monoid_right_identity(fa.clone()).holds());
            prop_assert!(is_id(fa).holds());
        }

        #[test]
        fn test_semigroupal(fa: LinkedList<bool>, fb: LinkedList<i32>, fc: LinkedList<Result<String, u8>>) {
            prop_assert!(semigroupal_associativity(fa, fb, fc).holds());
        }

        #[test]
        fn test_apply(fa: LinkedList<String>, fb: LinkedList<usize>) {
            prop_assert!(map2_product_consistency(fa.clone(), fb.clone(), |a, b| a.len() == b).holds());
            prop_assert!(product_r_consistency(fa.clone(), fb.clone()).holds());
            prop_assert!(product_l_consistency(fa, fb).holds());
        }

        #[test]
        fn test_applicative(a: bool, fa in linked_list(any::<bool>(), 0..=1)) {
            let ff= repeat(print).take(fa.len()).collect::<LinkedList<_>>();

            prop_assert!(applicative_identity(fa.clone()).holds());
            prop_assert!(applicative_homomorphism::<Vec<_>, _, _>(a, print).holds());
            prop_assert!(applicative_map(fa.clone(), print).holds());
            prop_assert!(ap_product_consistent(fa, ff).holds());
            prop_assert!(applicative_unit::<Vec<_>>(a).holds());
        }

        #[test]
        fn test_flatmap(fa in linked_list(any::<bool>(), 0..=1)) {
            let ff= repeat(print).take(fa.len()).collect::<LinkedList<_>>();

            prop_assert!(flat_map_associativity(fa.clone(), |x| LinkedList::pure(print(x)), |s| LinkedList::pure(parse::<bool>(s))).holds());
            prop_assert!(flat_map_associativity(fa.clone(), |_| LinkedList::new(), |s| LinkedList::pure(parse::<bool>(s))).holds());
            prop_assert!(flat_map_associativity(fa.clone(), |x| LinkedList::pure(print(x)), |_| LinkedList::<bool>::new()).holds());
            prop_assert!(flat_map_associativity(fa.clone(), |_| LinkedList::new(), |_: String| LinkedList::<bool>::new()).holds());
            prop_assert!(flat_map_consistent_apply(fa.clone(), ff).holds());
            prop_assert!(m_product_consistency(fa.clone(), |x| LinkedList::pure(print(x))).holds());
            prop_assert!(m_product_consistency(fa, |_| LinkedList::<String>::new()).holds());
        }

        #[test]
        fn test_monad(a: bool, fa: LinkedList<bool>) {
            prop_assert!(monad_left_identity::<LinkedList<_>, _, _>(a, |x| LinkedList::pure(print(x))).holds());
            prop_assert!(monad_left_identity::<LinkedList<_>, _, _>(a, |_| LinkedList::<String>::new()).holds());
            prop_assert!(monad_right_identity(fa.clone()).holds());
            prop_assert!(map_flat_map_coherence(fa, print).holds());
        }
    }
}