-
Notifications
You must be signed in to change notification settings - Fork 0
/
JL_ActionTree_Decision.h
169 lines (146 loc) · 3.58 KB
/
JL_ActionTree_Decision.h
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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
// Copyright (C) 2021 Kobe Vrijsen <kobevrijsen@posteo.be>
//
// ActionTree - Tree based decision/action stucture helper. An alternative to branches.
//
// This file is free software and distributed under the terms of the European Union
// Public Lincense as published by the European Commision; either version 1.2 of the
// License, or, at your option, any later version.
#pragma once
#include "JL_ActionTree_Base.h"
#include "JL_ActionTree_Action.h"
#include "JL_ActionTree_Branch.h"
namespace JL::action_tree
{
template <typename F>
struct Decision : impl::Functor<F>
{
auto /*Decision*/ operator ! ();
TEMPLATE /*Decision*/ operator | (Decision<T>);
TEMPLATE /*Decision*/ operator || (Decision<T>);
TEMPLATE /*Decision*/ operator & (Decision<T>);
TEMPLATE /*Decision*/ operator && (Decision<T>);
TEMPLATE /* Action */ operator + (Action<T>);
TEMPLATE /* Action */ operator - (Action<T>);
TEMPLATE /* Action */ operator & (Action<T>);
TEMPLATE /* Branch */ operator && (Action<T>);
};
template <typename T>
Decision(T)->Decision<T>;
}
// Implementation
namespace JL::action_tree
{
template <typename _T>
auto Decision<_T>::operator!()
{
auto f{
[d = *this]
(auto&& ... p) mutable
{
return !d(p...);
}
};
return Decision<decltype(f)>{ std::move(f) };
}
template <typename _T>
template <typename T>
auto Decision<_T>::operator|(Decision<T> other)
{
auto f{
[a = *this, b = std::move(other)]
(auto&& ... p) mutable
{
return a(p...) || b(p...);
}
};
return Decision<decltype(f)>{ std::move(f) };
}
template <typename _T>
template <typename T>
auto Decision<_T>::operator||(Decision<T> other)
{
return *this | std::move(other);
}
template <typename _T>
template <typename T>
auto Decision<_T>::operator&(Decision<T> other)
{
auto f{
[a = *this, b = std::move(other)]
(auto&& ... p) mutable
{
return a(p...) && b(p...);
}
};
return Decision<decltype(f)>{ std::move(f) };
}
template <typename _T>
template <typename T>
auto Decision<_T>::
operator&&(Decision<T> other)
{
return *this & std::move(other);
}
template <typename _T>
template <typename T>
auto Decision<_T>::operator+(Action<T> other)
{
auto f{
[d = *this, a = std::move(other), on = false]
(auto&& ... p) mutable
{
bool const test = d(p...);
if (!on && test)
(void)a(p...);
return on = test;
}
};
return Decision<decltype(f)>{ std::move(f) };
}
template <typename _T>
template <typename T>
auto Decision<_T>::operator-(Action<T> other)
{
auto f{
[d = *this, a = std::move(other), on = true]
(auto&& ... p) mutable
{
bool const test = d(p...);
if (on && !test)
(void)a(p...);
return on = test;
}
};
return Decision<decltype(f)>{ std::move(f) };
}
template <typename _T>
template <typename T>
auto Decision<_T>::operator&(Action<T> action)
{
auto f{
[d = *this, a = std::move(action)]
(auto&& ... p) mutable
{
using R = decltype(a(p...));
if constexpr (std::is_void_v<R>)
{
if (d(p...))
a(p...);
return;
}
else
{
using Maybe = impl::Maybe<R>;
return d(p...) ? Maybe{ a(p...) } : Maybe{};
}
}
};
return Action<decltype(f)>{ std::move(f) };
}
template <typename _T>
template <typename T>
auto Decision<_T>::operator&&(Action<T> action)
{
return impl::Branch<Decision<_T>, Action<T>>{ *this, std::move(action) };
}
}