-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfunctor_utils.hpp
More file actions
97 lines (79 loc) · 4.01 KB
/
Copy pathfunctor_utils.hpp
File metadata and controls
97 lines (79 loc) · 4.01 KB
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
#ifndef FUNCTOR_UTILS_HPP
#define FUNCTOR_UTILS_HPP
#include "curry.hpp"
#include "functor.hpp"
#include "bifunctor.hpp"
#include "contrafunctor.hpp"
#include "profunctor.hpp"
#include "applicative.hpp"
namespace FunctionalCpp
{
// fmap :: (a -> b) -> f a -> f b
template < template < class... > class F, class Ret, class Arg >
F< Ret > fmap(const Function1< Arg, Ret > a2b, const F< Arg >& fa)
{
return Functor< Function1< Arg, Ret >, F< Arg >, F< Ret > >::fmap(a2b, fa);
}
// contramap :: (b -> a) -> f a -> f b
template < template < class... > class F, class Ret, class Arg >
F< Ret > contramap(const Function1< Ret, Arg > a2b, const F< Arg >& fa)
{
return ContraFunctor< Function1< Ret, Arg >, F< Arg >, F< Ret > >::contramap(a2b, fa);
}
// bimap :: (a -> c) -> (b -> d) -> f a b -> f c d
template < template < class... > class F, class Ret1, class Arg1, class Ret2, class Arg2 >
F< Ret1, Ret2 > bimap(const Function1< Arg1, Ret1 > a2c, const Function1< Arg2, Ret2 > b2d, const F< Arg1, Arg2 >& fab)
{
return BiFunctor< Function1< Arg1, Ret1 >, Function1< Arg2, Ret2 >, F< Arg1, Arg2 >, F< Ret1, Ret2 > >::bimap(a2c, b2d, fab);
}
// first :: (a -> c) -> f a b -> f c b
template < template < class... > class F, class Ret1, class Arg1, class Arg2 >
F< Ret1, Arg2 > first(const Function1< Arg1, Ret1 > a2c, const F< Arg1, Arg2 >& fab)
{
const Function1<Arg2, Arg2> b2d = id<Arg2>;
return BiFunctor< Function1< Arg1, Ret1 >, Function1< Arg2, Arg2 >, F< Arg1, Arg2 >, F< Ret1, Arg2 > >::bimap(a2c, b2d, fab);
}
// second :: (b -> d) -> f a b -> f a d
template < template < class... > class F, class Ret2, class Arg1, class Arg2 >
F< Arg1, Ret2 > second(const Function1< Arg2, Ret2 > b2d, const F< Arg1, Arg2 >& fab)
{
const Function1<Arg1, Arg1> a2c = id<Arg1>;
return BiFunctor< Function1< Arg1, Arg1 >, Function1< Arg2, Ret2 >, F< Arg1, Arg2 >, F< Arg1, Ret2 > >::bimap(a2c, b2d, fab);
}
// promap :: (c -> a) -> (b -> d) -> f a b -> f c d
template < template < class... > class F, class Ret1, class Arg1, class Ret2, class Arg2 >
F< Ret1, Ret2 > promap(const Function1< Ret1, Arg1 > c2a, const Function1< Arg2, Ret2 > b2d, const F< Arg1, Arg2 >& fab)
{
return ProFunctor< Function1< Ret1, Arg1 >, Function1< Arg2, Ret2 >, F< Arg1, Arg2 >, F< Ret1, Ret2 > >::promap(c2a, b2d, fab);
}
// Alias to promap<>() = dimap :: (c -> a) -> (b -> d) -> f a b -> f c d
template < template < class... > class F, class Ret1, class Arg1, class Ret2, class Arg2 >
F< Ret1, Ret2 > dimap(const Function1< Ret1, Arg1 > c2a, const Function1< Arg2, Ret2 > b2d, const F< Arg1, Arg2 >& fab)
{
return ProFunctor< Function1< Ret1, Arg1 >, Function1< Arg2, Ret2 >, F< Arg1, Arg2 >, F< Ret1, Ret2 > >::promap(c2a, b2d, fab);
}
// TODO: missing lmap<>() and rmap<>()
// lmap :: (c -> a) -> f a b -> f c b
template < template < class... > class F, class Ret1, class Arg1, class Arg2 >
F< Ret1, Arg2 > lmap(const Function1< Ret1, Arg1 > c2a, const F< Arg1, Arg2 >& fab)
{
const Function1< Arg2, Arg2 > b2d = id<Arg2>;
return ProFunctor< Function1< Ret1, Arg1 >, Function1< Arg2, Arg2 >, F< Arg1, Arg2 >, F< Ret1, Arg2 > >::promap(c2a, b2d, fab);
}
// rmap :: (b -> d) -> f a b -> f a d
template < template < class... > class F, class Arg1, class Ret2, class Arg2 >
F< Arg1, Ret2 > rmap(const Function1< Arg2, Ret2 > b2d, const F< Arg1, Arg2 >& fab)
{
const Function1< Arg1, Arg1 > c2a = id<Arg1>;
return ProFunctor< Function1< Arg1, Arg1 >, Function1< Arg2, Ret2 >, F< Arg1, Arg2 >, F< Arg1, Ret2 > >::promap(c2a, b2d, fab);
}
// apply :: f (a -> b) -> f a -> f b
template < template < class... > class F, class Ret, class Arg >
F< Ret > apply(const F< Function1< Arg, Ret > >& fa2b, const F< Arg >& fa)
{
return Applicative< F< Function1< Arg, Ret > >, F< Arg >, F< Ret > >::apply(fa2b, fa);
}
// when :: Applicative f => Bool -> f () -> f ()
// unless :: Applicative f => Bool -> f () -> f ()
} // end namespace FunctionalCpp
#endif // FUNCTOR_UTILS_HPP