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

//! Bifunctor is a type constructor that takes two type arguments and is a functor in both
//! arguments.

use crate::higher::Higher2;

/// Bifunctor takes two type parameters instead of one, and is a functor in both of these
/// parameters. It defines a function bimap, which allows for mapping over both arguments at the
/// same time
pub trait Bifunctor<C, D>: Higher2 {
    /// Transform a `Self<A, B>` into a `Self<C, D>` by providing a transformation from `A` to `C`
    /// and from 'B' to 'D'
    fn bimap(
        self,
        f: impl FnMut(Self::Param1) -> C,
        g: impl FnMut(Self::Param2) -> D,
    ) -> Self::Target<C, D>;
}

impl<A, B, C, D> Bifunctor<C, D> for Result<A, B> {
    fn bimap(self, mut f: impl FnMut(A) -> C, mut g: impl FnMut(B) -> D) -> Result<C, D> {
        match self {
            Ok(x) => Ok(f(x)),
            Err(e) => Err(g(e)),
        }
    }
}

impl<A, B, C, D> Bifunctor<C, D> for (A, B) {
    fn bimap(self, mut f: impl FnMut(A) -> C, mut g: impl FnMut(B) -> D) -> (C, D) {
        (f(self.0), g(self.1))
    }
}

if_std! {
    use std::collections::HashMap;
    use std::hash::Hash;

    impl<A, B, C: Eq+Hash, D> Bifunctor<C, D> for HashMap<A, B> {
        fn bimap(
            self,
            mut f: impl FnMut(A) -> C,
            mut g: impl FnMut(B) -> D,
        ) -> HashMap<C, D> {
                self.into_iter().map(|(k, v)| (f(k), g(v))).collect()
        }
    }
}