This repository was archived by the owner on Nov 15, 2022. It is now read-only.
forked from ryanhaining/cppitertools
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_range.cpp
More file actions
238 lines (194 loc) · 6.07 KB
/
Copy pathtest_range.cpp
File metadata and controls
238 lines (194 loc) · 6.07 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
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
#include "range.hpp"
#include <vector>
#include <iterator>
#include <algorithm>
#include "helpers.hpp"
#include "catch.hpp"
using Vec = const std::vector<int>;
using iter::range;
TEST_CASE("range: works with only stop", "[range]") {
auto r = range(5);
Vec v(std::begin(r), std::end(r));
Vec vc{0, 1, 2, 3, 4};
REQUIRE( v == vc );
}
TEST_CASE("range: works with start and stop", "[range]") {
auto r = range(1, 5);
Vec v(std::begin(r), std::end(r));
Vec vc {1, 2, 3, 4};
REQUIRE( v == vc );
}
TEST_CASE("range: works with positive step > 1", "[range]") {
auto r = range(1, 10, 3);
Vec v(std::begin(r), std::end(r));
Vec vc{1, 4, 7};
REQUIRE( v == vc );
}
TEST_CASE("range(0) is empty", "[range]") {
auto r = iter::range(0);
REQUIRE( std::begin(r) == std::end(r) );
}
TEST_CASE("range: postfix++", "[range]") {
auto r = iter::range(3);
auto it = std::begin(r);
it++;
REQUIRE( *it == 1 );
}
TEST_CASE("start > stop produces empty range", "[range]") {
auto r = range(5, 0);
Vec v(std::begin(r), std::end(r));
REQUIRE( v.empty() );
}
TEST_CASE("start < stop and step < 0 produces empty range", "[range]") {
auto r = range(0, 5, -1);
Vec v(std::begin(r), std::end(r));
REQUIRE( v.empty() );
}
TEST_CASE("range: with only a negative stop is empty", "[range]") {
auto r = range(-3);
Vec v(std::begin(r), std::end(r));
REQUIRE( v.empty() );
}
TEST_CASE("range: works with negative step", "[range]") {
auto r = range(5, -5, -3);
Vec v(std::begin(r), std::end(r));
Vec vc{5, 2, -1, -4};
REQUIRE( v == vc );
}
TEST_CASE("range: stops short when step doesn't divide stop-start", "[range]") {
auto r = range(0, 5, 2);
Vec v(std::begin(r), std::end(r));
Vec vc{0, 2, 4};
REQUIRE( v == vc );
}
TEST_CASE("range: stops short when step > stop-start", "[range]") {
auto r = range(0, 10, 20);
Vec v(std::begin(r), std::end(r));
REQUIRE( v.size() == 1 );
}
TEST_CASE("No 0 step ranges allowed", "[range]") {
REQUIRE_THROWS(range(0, 1, 0));
}
TEST_CASE("range: works with a variable start, stop, and step", "[range]") {
constexpr int a = 10;
constexpr int b = 100;
constexpr int c = 50;
SECTION("Going up works") {
auto r = range(a, a+2);
Vec v(std::begin(r), std::end(r));
Vec vc{a, a+1};
REQUIRE( v == vc );
}
SECTION("Going down works") {
auto r = range(a+2, a, -1);
Vec v(std::begin(r), std::end(r));
Vec vc{a+2, a+1};
REQUIRE( v == vc );
}
SECTION("Going down with -2 stop works") {
auto r = range(a+4, a, -2);
Vec v(std::begin(r), std::end(r));
Vec vc{a+4, a+2};
REQUIRE( v == vc );
}
SECTION("Using three variable") {
auto r = range(a, b, c);
Vec v(std::begin(r), std::end(r));
REQUIRE( std::find(std::begin(v), std::end(v), a) != std::end(v) );
REQUIRE( std::find(std::begin(v), std::end(v), b) == std::end(v) );
REQUIRE( v.size() == 2 );
}
SECTION("Using three with a unary negate on step") {
auto r = range(b, a, -c);
Vec v(std::begin(r), std::end(r));
REQUIRE( std::find(std::begin(v), std::end(v), b) != std::end(v) );
REQUIRE( std::find(std::begin(v), std::end(v), a) == std::end(v) );
REQUIRE( v.size() == 2 );
}
SECTION("Using all three negated") {
auto r = range(-a, -b, -c);
Vec v(std::begin(r), std::end(r));
REQUIRE( std::find(std::begin(v), std::end(v), -a) != std::end(v) );
REQUIRE( std::find(std::begin(v), std::end(v), -b) == std::end(v) );
REQUIRE( v.size() == 2 );
}
}
TEST_CASE("range: forward iterator checks", "[range]") {
auto r = range(10);
REQUIRE( std::end(r) == std::end(r) );
auto it1 = std::begin(r);
auto it2 = std::begin(r);
REQUIRE_FALSE( it1 != it2 );
REQUIRE( it1 == it2 );
++it1;
REQUIRE( it1 != it2 );
++it2;
REQUIRE( it1 == it2 );
auto it3 = it1++;
REQUIRE( it3 == it2 );
auto it4 = ++it3;
REQUIRE( it4 == it3 );
auto it5 = std::begin(r);
const auto& v = *it5;
++it5;
REQUIRE( v != *it5 );
}
TEST_CASE("range: forward iterator with double, checks", "[range]") {
auto r = range(10.0);
REQUIRE( std::end(r) == std::end(r) );
auto it1 = std::begin(r);
auto it2 = std::begin(r);
REQUIRE_FALSE( it1 != it2 );
REQUIRE( it1 == it2 );
++it1;
REQUIRE( it1 != it2 );
++it2;
REQUIRE( it1 == it2 );
auto it3 = it1++;
REQUIRE( it3 == it2 );
auto it4 = ++it3;
REQUIRE( it4 == it3 );
}
using FVec = const std::vector<double>;
TEST_CASE("range: using doubles", "[range]") {
auto r = range(5.0);
FVec fv(std::begin(r), std::end(r));
FVec fvc = {0.0, 1.0, 2.0, 3.0, 4.0};
REQUIRE( fv == fvc );
}
TEST_CASE("range: using doubles with start and stop", "[range]") {
auto r = range(5.0, 10.0);
FVec fv(std::begin(r), std::end(r));
FVec fvc = {5.0, 6.0, 7.0, 8.0, 9.0};
REQUIRE( fv == fvc );
}
TEST_CASE("range: using doubles with start, stop and step", "[range]") {
auto r = range(1.0, 4.0, 0.5);
FVec fv(std::begin(r), std::end(r));
FVec fvc = {1.0, 1.5, 2.0, 2.5, 3.0, 3.5};
REQUIRE( fv == fvc );
}
TEST_CASE("range: using doubles with negative", "[range]") {
auto r = range(0.5, -2.0, -0.5);
FVec fv(std::begin(r), std::end(r));
FVec fvc = {0.5, 0.0, -0.5, -1.0, -1.5};
REQUIRE( fv == fvc );
}
TEST_CASE("range: using doubles with uneven step", "[range]") {
auto r = range(0.0, 1.75, 0.5);
FVec fv(std::begin(r), std::end(r));
FVec fvc = {0.0, 0.5, 1.0, 1.5};
REQUIRE( fv == fvc );
}
TEST_CASE("range: using doubles detects empty ranges", "[range]") {
auto r1 = range(0.0, -1.0);
REQUIRE(std::begin(r1) == std::end(r1));
auto r2 = range(0.0, 1.0, -1.0);
REQUIRE(std::begin(r2) == std::end(r2));
}
TEST_CASE("range: iterator meets forward iterator requirements", "[range]") {
auto r = range(5);
auto r2 = range(5.0);
REQUIRE( itertest::IsForwardIterator<decltype(std::begin(r))>::value );
REQUIRE( itertest::IsForwardIterator<decltype(std::begin(r2))>::value );
}