forked from ryanhaining/cppitertools
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_slice.cpp
More file actions
115 lines (90 loc) · 2.75 KB
/
Copy pathtest_slice.cpp
File metadata and controls
115 lines (90 loc) · 2.75 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
#include <slice.hpp>
#include <vector>
#include <string>
#include <utility>
#include "helpers.hpp"
#include "catch.hpp"
using iter::slice;
using Vec = const std::vector<int>;
TEST_CASE("slice: take from beginning", "[slice]") {
Vec ns = {10, 11, 12, 13, 14, 15, 16, 17, 18, 19};
auto sl = slice(ns, 5);
Vec v(std::begin(sl), std::end(sl));
Vec vc = {10, 11, 12, 13, 14};
REQUIRE(v == vc);
}
TEST_CASE("slice: start and stop", "[slice]") {
Vec ns = {10, 11, 12, 13, 14, 15, 16, 17, 18, 19};
auto sl = slice(ns, 2, 6);
Vec v(std::begin(sl), std::end(sl));
Vec vc = {12, 13, 14, 15};
REQUIRE(v == vc);
}
TEST_CASE("slice: start, stop, step", "[slice]") {
Vec ns = {10, 11, 12, 13, 14, 15, 16, 17, 18, 19};
auto sl = slice(ns, 2, 8, 2);
Vec v(std::begin(sl), std::end(sl));
Vec vc = {12, 14, 16};
REQUIRE(v == vc);
}
TEST_CASE("slice: empty iterable", "[slice]") {
Vec ns{};
auto sl = slice(ns, 3);
REQUIRE(std::begin(sl) == std::end(sl));
}
TEST_CASE("slice: stop is beyond end of iterable", "[slice]") {
Vec ns = {1, 2, 3};
auto sl = slice(ns, 10);
Vec v(std::begin(sl), std::end(sl));
REQUIRE(v == ns);
}
TEST_CASE("slice: start is beyond end of iterable", "[slice]") {
Vec ns = {1, 2, 3};
auto sl = slice(ns, 5, 10);
REQUIRE(std::begin(sl) == std::end(sl));
}
TEST_CASE("slice: (stop - start) % step != 0", "[slice]") {
Vec ns = {1, 2, 3, 4};
auto sl = slice(ns, 0, 2, 3);
Vec v(std::begin(sl), std::end(sl));
Vec vc = {1};
REQUIRE(v == vc);
}
TEST_CASE("slice: invalid ranges give 0 size slices", "[slice]") {
Vec ns = {1, 2, 3};
SECTION("negative step") {
auto sl = slice(ns, 1, 10, -1);
REQUIRE(std::begin(sl) == std::end(sl));
}
SECTION("stop < start") {
auto sl = slice(ns, 2, 0, 3);
REQUIRE(std::begin(sl) == std::end(sl));
}
}
TEST_CASE("slice: moves rvalues and binds to lvalues", "[slice]") {
itertest::BasicIterable<int> bi{1, 2, 3, 4};
slice(bi, 1, 3);
REQUIRE_FALSE(bi.was_moved_from());
auto sl = slice(std::move(bi), 1, 3);
REQUIRE(bi.was_moved_from());
Vec v(std::begin(sl), std::end(sl));
Vec vc = {2, 3};
REQUIRE(v == vc);
}
TEST_CASE("slice: with iterable doesn't move or copy elems", "[slice]") {
constexpr itertest::SolidInt arr[] = {{6}, {7}, {8}};
for (auto&& i : slice(arr, 2)) {
(void)i;
}
}
TEST_CASE("slice: iterator meets requirements", "[slice]") {
std::string s{"abcdef"};
auto c = slice(s, 1, 3);
REQUIRE(itertest::IsIterator<decltype(std::begin(c))>::value);
}
template <typename T>
using ImpT = decltype(slice(std::declval<T>(), 1));
TEST_CASE("slice: has correct ctor and assign ops", "[slice]") {
REQUIRE(itertest::IsMoveConstructibleOnly<ImpT<std::string&>>::value);
REQUIRE(itertest::IsMoveConstructibleOnly<ImpT<std::string>>::value);
}