4
4
#include < flow/detail/walk.hpp>
5
5
#include < flow/impl.hpp>
6
6
7
- #include < stdx/ct_format.hpp>
8
7
#include < stdx/ct_string.hpp>
9
8
#include < stdx/cx_multimap.hpp>
10
9
#include < stdx/cx_set.hpp>
11
10
#include < stdx/cx_vector.hpp>
12
11
#include < stdx/span.hpp>
12
+ #include < stdx/static_assert.hpp>
13
13
#include < stdx/tuple_algorithms.hpp>
14
14
#include < stdx/type_traits.hpp>
15
15
#include < stdx/utility.hpp>
@@ -52,31 +52,10 @@ template <typename T> using name_for = typename T::name_t;
52
52
});
53
53
}
54
54
55
- template <typename Cond> struct sequence_conditions ;
56
-
57
- template <auto ...> struct INFO_flow_name_ ;
58
-
59
- template <auto ...> struct INFO_step_a_name_ ;
60
-
61
- template <auto ...> struct INFO_step_a_condition_ ;
62
-
63
- template <auto ...> struct INFO_step_b_name_ ;
64
-
65
- template <auto ...> struct INFO_step_b_condition_ ;
66
-
67
- template <auto ...> struct INFO_sequence_condition_ ;
68
-
69
- template <typename ...> struct INFO_sequence_missing_predicate_ ;
70
-
71
- template <typename ...> constexpr bool ERROR_DETAILS_ = false ;
72
-
73
- template <auto ...> struct INFO_missing_steps_ ;
74
-
75
- template <auto ...> struct INFO_duplicated_steps_ ;
76
-
77
55
template <stdx::ct_string Name,
78
56
template <stdx::ct_string, std::size_t > typename Impl>
79
57
struct graph_builder {
58
+ // NOLINTBEGIN(readability-function-cognitive-complexity)
80
59
template <typename Node, std::size_t N, std::size_t E>
81
60
[[nodiscard]] constexpr static auto make_graph (auto const &nodes,
82
61
auto const &edges) {
@@ -100,31 +79,17 @@ struct graph_builder {
100
79
101
80
stdx::for_each (
102
81
[&]<typename P>(P const &) {
103
- if constexpr (not stdx::contains_type<edge_ps_t , P>) {
104
- static_assert (
105
- ERROR_DETAILS_<
106
- INFO_flow_name_<Name>,
107
- INFO_step_a_name_<lhs_t ::ct_name>,
108
- INFO_step_a_condition_<
109
- lhs_t ::condition.ct_name >,
110
- INFO_step_b_name_<rhs_t ::ct_name>,
111
- INFO_step_b_condition_<
112
- rhs_t ::condition.ct_name >,
113
- INFO_sequence_condition_<Cond::ct_name>,
114
- INFO_sequence_missing_predicate_<P>>,
115
-
116
- " The conditions on this sequence "
117
- " (step_a >> step_b) are weaker than those on "
118
- " step_a and/or step_b. The sequence could be "
119
- " enabled while step_a and/or step_b is not. "
120
- " Specifically, the sequence is missing the "
121
- " predicate identified in "
122
- " `INFO_sequence_missing_predicate_`. TIP: "
123
- " Look for 'ERROR_DETAILS_` and `INFO_` in "
124
- " the compiler error message for details on "
125
- " the sequence, the step names, and the "
126
- " conditions." );
127
- }
82
+ STATIC_ASSERT (
83
+ (stdx::contains_type<edge_ps_t , P>),
84
+ " The conditions on the sequence ({} >> {})[{}] are "
85
+ " weaker than those on {}[{}] or {}[{}]. "
86
+ " Specifically, the sequence is missing the "
87
+ " predicate: {}" ,
88
+ CX_VALUE (lhs_t ::ct_name), CX_VALUE (rhs_t ::ct_name),
89
+ CX_VALUE (Cond::ct_name), CX_VALUE (lhs_t ::ct_name),
90
+ CX_VALUE (lhs_t ::condition.ct_name ),
91
+ CX_VALUE (rhs_t ::ct_name),
92
+ CX_VALUE (rhs_t ::condition.ct_name ), CX_VALUE (P));
128
93
},
129
94
node_ps);
130
95
@@ -133,6 +98,7 @@ struct graph_builder {
133
98
edges);
134
99
return g;
135
100
}
101
+ // NOLINTEND(readability-function-cognitive-complexity)
136
102
137
103
template <typename Node, typename Graph>
138
104
[[nodiscard]] constexpr static auto is_source_of (Node const &node,
@@ -191,6 +157,15 @@ struct graph_builder {
191
157
return std::optional<Output>{std::in_place, span_t {ordered_list}};
192
158
}
193
159
160
+ template <typename T>
161
+ constexpr static auto error_steps =
162
+ stdx::transform ([](auto N) { return stdx::ct_string_from_type (N); },
163
+ T{})
164
+ .join(stdx::ct_string{" " }, [](auto x, auto y) {
165
+ using namespace stdx ::literals;
166
+ return x + " , " _cts + y;
167
+ });
168
+
194
169
constexpr static void check_for_missing_nodes (auto nodes,
195
170
auto mentioned_nodes) {
196
171
constexpr auto get_name = []<typename N>(N) ->
@@ -201,52 +176,24 @@ struct graph_builder {
201
176
using node_names_t = decltype (stdx::to_sorted_set (node_names));
202
177
using mentioned_node_names_t =
203
178
decltype (stdx::to_sorted_set (mentioned_node_names));
204
-
205
- if constexpr (not std::is_same_v<node_names_t ,
206
- mentioned_node_names_t >) {
207
- using missing_nodes_t =
208
- boost::mp11::mp_set_difference<mentioned_node_names_t ,
209
- node_names_t >;
210
-
211
- constexpr auto missing_nodes = missing_nodes_t {};
212
- constexpr auto missing_nodes_ct_strings = stdx::transform (
213
- []<typename N>(N) { return stdx::ct_string_from_type (N{}); },
214
- missing_nodes);
215
-
216
- [&]<std::size_t ... Is>(std::index_sequence<Is...>) {
217
- using error_details_t = INFO_missing_steps_<stdx::get<Is>(
218
- missing_nodes_ct_strings)...>;
219
-
220
- static_assert (
221
- ERROR_DETAILS_<INFO_flow_name_<Name>, error_details_t >,
222
- " One or more steps are referenced in the flow but not "
223
- " explicitly added with the * operator. The "
224
- " beginning of this error shows you which steps are "
225
- " missing." );
226
- }(std::make_index_sequence<
227
- stdx::tuple_size_v<decltype (missing_nodes)>>{});
228
- }
229
-
230
- if constexpr (stdx::tuple_size_v<node_names_t > !=
231
- stdx::tuple_size_v<decltype (node_names)>) {
232
- constexpr auto duplicates = stdx::transform (
233
- [](auto e) {
234
- return stdx::ct_string_from_type (stdx::get<0 >(e));
235
- },
236
- stdx::filter<detail::is_duplicated>(stdx::gather (node_names)));
237
-
238
- [&]<std::size_t ... Is>(std::index_sequence<Is...>) {
239
- using error_details_t =
240
- INFO_duplicated_steps_<stdx::get<Is>(duplicates)...>;
241
-
242
- static_assert (
243
- ERROR_DETAILS_<INFO_flow_name_<Name>, error_details_t >,
244
- " One or more steps are explicitly added more than once "
245
- " using the * operator. The beginning of this "
246
- " error shows you which steps are duplicated." );
247
- }(std::make_index_sequence<
248
- stdx::tuple_size_v<decltype (duplicates)>>{});
249
- }
179
+ using missing_nodes_t =
180
+ boost::mp11::mp_set_difference<mentioned_node_names_t ,
181
+ node_names_t >;
182
+ STATIC_ASSERT (
183
+ (std::is_same_v<node_names_t , mentioned_node_names_t >),
184
+ " One or more steps are referenced in the flow ({}) but not "
185
+ " explicitly added with the * operator. The missing steps are: {}." ,
186
+ CX_VALUE (Name), CX_VALUE (error_steps<missing_nodes_t >));
187
+
188
+ constexpr auto duplicates = stdx::transform (
189
+ [](auto e) { return stdx::get<0 >(e); },
190
+ stdx::filter<detail::is_duplicated>(stdx::gather (node_names)));
191
+ using duplicate_nodes_t = decltype (duplicates);
192
+ STATIC_ASSERT (
193
+ stdx::tuple_size_v<duplicate_nodes_t > == 0 ,
194
+ " One or more steps in the flow ({}) are explicitly added more than "
195
+ " once using the * operator. The duplicate steps are: {}." ,
196
+ CX_VALUE (Name), CX_VALUE (error_steps<duplicate_nodes_t >));
250
197
}
251
198
252
199
template <typename Graph>
0 commit comments