forked from ryanhaining/cppitertools
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_reversed.cpp
More file actions
89 lines (71 loc) · 2.17 KB
/
Copy pathtest_reversed.cpp
File metadata and controls
89 lines (71 loc) · 2.17 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
#include <reversed.hpp>
#include <vector>
#include <array>
#include <string>
#include <utility>
#include "catch.hpp"
#define DECLARE_REVERSE_ITERATOR
#include "helpers.hpp"
#undef DECLARE_REVERSE_ITERATOR
using iter::reversed;
using Vec = const std::vector<int>;
TEST_CASE("reversed: can reverse a vector", "[reversed]") {
Vec ns = {10, 20, 30, 40};
std::vector<int> v;
SECTION("Normal call") {
auto r = reversed(ns);
v.assign(std::begin(r), std::end(r));
}
SECTION("Pipe") {
auto r = ns | reversed;
v.assign(std::begin(r), std::end(r));
}
Vec vc = {40, 30, 20, 10};
REQUIRE(v == vc);
}
TEST_CASE("reversed: can reverse an array", "[reversed]") {
int ns[] = {10, 20, 30, 40};
auto r = reversed(ns);
Vec v(std::begin(r), std::end(r));
Vec vc = {40, 30, 20, 10};
REQUIRE(v == vc);
}
TEST_CASE("reversed: empty when iterable is empty", "[reversed]") {
Vec emp{};
auto r = reversed(emp);
REQUIRE(std::begin(r) == std::end(r));
}
TEST_CASE("reversed: moves rvalues and binds to lvalues", "[reversed]") {
itertest::BasicIterable<int> bi{1, 2};
itertest::BasicIterable<int> bi2{1, 2};
reversed(bi);
REQUIRE_FALSE(bi.was_moved_from());
reversed(std::move(bi2));
REQUIRE(bi2.was_moved_from());
}
TEST_CASE("reversed: doesn't move or copy elements of array", "[reversed]") {
constexpr itertest::SolidInt arr[] = {{6}, {7}, {8}};
for (auto&& i : reversed(arr)) {
(void)i;
}
}
TEST_CASE("reversed: with iterable doesn't move or copy elems", "[reversed]") {
constexpr std::array<itertest::SolidInt, 3> arr{{{6}, {7}, {8}}};
for (auto&& i : reversed(arr)) {
(void)i;
}
}
TEST_CASE("reversed: iterator meets requirements", "[reversed]") {
Vec v;
auto r = reversed(v);
REQUIRE(itertest::IsIterator<decltype(std::begin(r))>::value);
int a[1];
auto ra = reversed(a);
REQUIRE(itertest::IsIterator<decltype(std::begin(ra))>::value);
}
template <typename T>
using ImpT = decltype(reversed(std::declval<T>()));
TEST_CASE("reversed: has correct ctor and assign ops", "[reversed]") {
REQUIRE(itertest::IsMoveConstructibleOnly<ImpT<std::string&>>::value);
REQUIRE(itertest::IsMoveConstructibleOnly<ImpT<std::string>>::value);
}