-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnon_traversable_extent.cpp
More file actions
187 lines (154 loc) · 6.19 KB
/
Copy pathnon_traversable_extent.cpp
File metadata and controls
187 lines (154 loc) · 6.19 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
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
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
// Logicwise
// Copyright (c) 2026 Frog Singing (@frog-singing)
// SPDX-License-Identifier: MIT
#include <logicwise.h>
#include <array> // std::array
#include <cstddef> // std::size_t
#include <iostream> // std::cout, std::endl
// If this file compiles successfully, then all logical assertions have passed.
int main()
{
using namespace logicwise;
using namespace logicwise::quantifier;
using namespace logicwise::arrangement;
using namespace logicwise::wrapper;
//--------------------------------------------------------------------------------
static constexpr std::size_t N{ 42 };
using quantifier_list = type_list<
always_true, always_false,
all_of, any_of, none_of, not_every,
exactly<N>, at_least<N>, at_most<N>,
more_than<N>, less_than<N>
>;
using unreachable_predicate_list = value_list<
[] <typename SomeTeapot> { return SomeTeapot::Im_a_teapot; },
[] <auto SomeValue> { return SomeValue.some_function(); },
[] (auto&& some_instance) { return some_function(some_instance); },
[] <typename T1, typename T2> { return T1::template some_trait<T2>::value; },
[] <auto V1, auto V2> { return V1.template operator() < V2 > () && V2.template operator() < V1 > (); },
[] (auto&& i1, auto&& i2) { return i1.will_never_use(i2); },
[] <typename Type, auto Value> { return Type{}(Value) && Value(Type{}); },
[] <auto CanYouBrewCoffee, typename MaybeATeapot>
{ return CanYouBrewCoffee.template operator() < MaybeATeapot > (); },
[] <auto WhoAreYou>(auto&& some_instance) { return WhoAreYou(some_instance); },
[] <typename ActuallyIDontCare>(auto&& some_instance) { return ActuallyIDontCare{ some_instance }; },
[] { return true; },
[] { struct A { int x{}; }; return A{ 42 }; },
[] {}, 42, nullptr
>;
static_assert(
rangewise<all_of, cartesian_pair>
::between<quantifier_list, unreachable_predicate_list>()
.satisfies([] <typename Quantifier, auto UnreachablePredicate> {
using arrangement_list = type_list<element>;
using non_traversable_range_list = type_list<
type_list< >, value_list< >
>;
return rangewise<all_of, cartesian_pair>
::between<arrangement_list, non_traversable_range_list>()
.satisfies([] <typename Arrangement, typename NonTraversableRange> { return
rangewise<Quantifier, Arrangement>
::template in<NonTraversableRange>()
.satisfies(UnreachablePredicate)
==
typename Quantifier::solver{}.result();
});
}),
"elementwise non-traversable extent: element"
);
static_assert(
rangewise<all_of, cartesian_pair>
::between<quantifier_list, unreachable_predicate_list>()
.satisfies([] <typename Quantifier, auto UnreachablePredicate> {
using arrangement_list = type_list<
permutation_pair, combination_pair, linear_adjacent_pair
>;
using non_traversable_range_list = type_list<
type_list< >, value_list< >, type_list<void>, value_list<nullptr>
>;
return rangewise<all_of, cartesian_pair>
::between<arrangement_list, non_traversable_range_list>()
.satisfies([] <typename Arrangement, typename NonTraversableRange> { return
rangewise<Quantifier, Arrangement>
::template in<NonTraversableRange>()
.satisfies(UnreachablePredicate)
==
typename Quantifier::solver{}.result();
});
}),
"pairwise non-traversable extent: permutation_pair, combination_pair, linear_adjacent_pair"
);
static_assert(
rangewise<all_of, cartesian_pair>
::between<quantifier_list, unreachable_predicate_list>()
.satisfies([] <typename Quantifier, auto UnreachablePredicate> {
using arrangement_list = type_list<circular_adjacent_pair>;
using non_traversable_range_list = type_list<
type_list< >, value_list< >
>;
return rangewise<all_of, cartesian_pair>
::between<arrangement_list, non_traversable_range_list>()
.satisfies([] <typename Arrangement, typename NonTraversableRange> { return
rangewise<Quantifier, Arrangement>
::template in<NonTraversableRange>()
.satisfies(UnreachablePredicate)
==
typename Quantifier::solver{}.result();
});
}),
"pairwise non-traversable extent: circular_adjacent_pair"
);
static_assert(
rangewise<all_of, cartesian_pair>
::between<quantifier_list, unreachable_predicate_list>()
.satisfies([] <typename Quantifier, auto UnreachablePredicate> {
using arrangement_list = type_list<
cartesian_pair, zip_pair_truncation
>;
using non_traversable_range_list = type_list<
type_list< >, value_list< >
>;
using traversable_range_list = type_list<
type_list<void>, value_list<nullptr>
>;
std::array<int, 0> non_traversable_range{};
std::array traversable_range{ nullptr };
constexpr bool default_verification_result{ typename Quantifier::solver{}.result() };
return rangewise<all_of, element>
::in<arrangement_list>()
.satisfies([&] <typename Arrangement> { return
rangewise<all_of, cartesian_pair>
::between<non_traversable_range_list, traversable_range_list>()
.satisfies([&] <typename NonTraversableRange, typename TraversableRange> { return
rangewise<Quantifier, Arrangement>
::template between<NonTraversableRange, TraversableRange>()
.satisfies(UnreachablePredicate)
==
default_verification_result &&
rangewise<Quantifier, Arrangement>
::template between<TraversableRange, NonTraversableRange>()
.satisfies(UnreachablePredicate)
==
default_verification_result &&
rangewise<Quantifier, Arrangement>
::template between<NonTraversableRange>(traversable_range)
.satisfies(UnreachablePredicate)
==
default_verification_result &&
rangewise<Quantifier, Arrangement>
::template between<TraversableRange>(non_traversable_range)
.satisfies(UnreachablePredicate)
==
default_verification_result;
});
});
}),
"bipartite non-traversable extent: cartesian_pair, zip_pair_truncation"
);
// No predicate form constraint degeneracy for bipartite arrangement zip_pair_padding.
// Since padding elements are provided explicitly,
// the predicate is always constrained in terms of form,
// regardless of the traversability of the extent.
// Thus, predicates for zip_pair_padding should always be well-formed.
std::cout << std::endl << "Hello Logic!" << std::endl;
}