-
Notifications
You must be signed in to change notification settings - Fork 189
Expand file tree
/
Copy pathNonFixed.cpp
More file actions
217 lines (181 loc) · 7.21 KB
/
Copy pathNonFixed.cpp
File metadata and controls
217 lines (181 loc) · 7.21 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
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
#include <catch2/catch.hpp>
#include <rapidcheck/catch.h>
#include "util/Predictable.h"
#include "Common.h"
using namespace rc;
using namespace rc::test;
namespace {
struct SetProperties {
template <typename T>
static void exec() {
templatedProp<T>(
"finds minimum where some elements need to be larger than some value",
[](const Random &random) {
int size = *gen::inRange<int>(0, 50);
const auto gen = gen::container<T>(gen::arbitrary<int>());
const int target = *gen::inRange<int>(0, 10);
const auto result = searchGen(random,
size,
gen,
[=](const T &x) {
int count = 0;
for (const auto &e : x) {
if (e >= target) {
count++;
if (count >= 2) {
return true;
}
}
}
return false;
});
const T expected{target, target + 1};
RC_ASSERT(result == expected);
});
}
};
struct MultiSetProperties {
template <typename T>
static void exec() {
templatedProp<T>(
"finds minimum where some elements need to be larger than some value",
[](const Random &random) {
int size = *gen::inRange<int>(0, 50);
const auto gen = gen::container<T>(gen::arbitrary<int>());
const int target = *gen::inRange<int>(0, 10);
const auto result = searchGen(random,
size,
gen,
[=](const T &x) {
int count = 0;
for (const auto &e : x) {
if (e >= target) {
count++;
if (count >= 2) {
return true;
}
}
}
return false;
});
const T expected{target, target};
RC_ASSERT(result == expected);
});
}
};
struct MapProperties {
template <typename T>
static void exec() {
templatedProp<T>(
"finds minimum where at least two key-value pairs must have values"
" greater than a certain value",
[](const Random &random) {
int size = *gen::inRange<int>(0, 50);
const auto gen =
gen::container<T>(gen::arbitrary<int>(), gen::arbitrary<int>());
const int target = *gen::inRange<int>(0, 10);
const auto result =
searchGen(random,
size,
gen,
[=](const T &x) {
int count = 0;
for (const auto &p : x) {
if ((p.first >= target) && (p.second >= target)) {
count++;
if (count >= 2) {
return true;
}
}
}
return false;
});
const T expected{{target, target}, {target + 1, target}};
RC_ASSERT(result == expected);
});
}
};
struct MultiMapProperties {
template <typename T>
static void exec() {
templatedProp<T>(
"finds minimum where at least two key-value pairs must have values"
" greater than a certain value",
[](const Random &random) {
int size = *gen::inRange<int>(0, 50);
const auto gen =
gen::container<T>(gen::arbitrary<int>(), gen::arbitrary<int>());
const int target = *gen::inRange<int>(0, 10);
const auto result =
searchGen(random,
size,
gen,
[=](const T &x) {
int count = 0;
for (const auto &p : x) {
if ((p.first >= target) && (p.second >= target)) {
count++;
if (count >= 2) {
return true;
}
}
}
return false;
});
const T expected{{target, target}, {target, target}};
RC_ASSERT(result == expected);
});
}
};
struct ArbitraryProperties {
template <typename T>
static void exec() {
using Element = typename T::value_type;
templatedProp<T>("uses the correct Arbitrary instance",
[] {
const auto value =
gen::arbitrary<T>()(Random(), 0).value();
RC_ASSERT(std::all_of(begin(value),
end(value),
[](const Element &x) {
return isArbitraryPredictable(x);
}));
});
}
};
} // namespace
TEST_CASE("gen::container") {
forEachType<GenericProperties<ContainerFactory>,
RC_SEQUENCE_CONTAINERS(int),
RC_SET_CONTAINERS(int),
std::basic_string<int>>();
forEachType<GenericProperties<MapFactory>, RC_MAP_CONTAINERS(int)>();
forEachType<ParamsProperties<ContainerFactory>,
RC_SEQUENCE_CONTAINERS(GenParams),
RC_SET_CONTAINERS(GenParams)>();
forEachType<ParamsProperties<MapFactory>, RC_MAP_CONTAINERS(GenParams)>();
forEachType<SequenceProperties,
RC_SEQUENCE_CONTAINERS(int),
std::basic_string<int>>();
forEachType<SetProperties, std::set<int>, std::unordered_set<int>>();
forEachType<MultiSetProperties,
std::multiset<int>,
std::unordered_multiset<int>>();
forEachType<MapProperties,
std::map<int, int>,
std::unordered_map<int, int>>();
forEachType<MultiMapProperties,
std::multimap<int, int>,
std::unordered_multimap<int, int>>();
forEachType<ArbitraryProperties,
RC_GENERIC_CONTAINERS(Predictable),
RC_GENERIC_CONTAINERS(NonCopyable),
std::array<Predictable, 5>,
std::array<NonCopyable, 5>>();
forEachType<RetrialProperties<MapFactory>,
std::map<int, int>,
std::unordered_map<int, int>>();
forEachType<RetrialProperties<ContainerFactory>,
std::set<int>,
std::unordered_set<int>>();
}