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
|
// Range v3 library
//
// Copyright Hui Xie 2021
//
// Use, modification and distribution is subject to the
// Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// Project home: https://github.com/ericniebler/range-v3
#include <list>
#include <vector>
#include <range/v3/core.hpp>
#include <range/v3/view/chunk_by.hpp>
#include <range/v3/view/counted.hpp>
#include <range/v3/view/cycle.hpp>
#include <range/v3/view/remove_if.hpp>
#include <range/v3/view/take.hpp>
#include "../simple_test.hpp"
#include "../test_iterators.hpp"
#include "../test_utils.hpp"
RANGES_DIAGNOSTIC_IGNORE_SIGN_CONVERSION
int main()
{
using namespace ranges;
using P = std::pair<int, int>;
std::vector<std::pair<int, int>> v = {
{1, 1},
{1, 1},
{1, 2},
{1, 2},
{1, 2},
{1, 2},
{2, 2},
{2, 2},
{2, 3},
{2, 3},
{2, 3},
{2, 3},
};
{
auto rng0 =
v | views::chunk_by([](P p0, P p1) { return p0.second == p1.second; });
CPP_assert(forward_range<decltype(rng0)>);
CPP_assert(!bidirectional_range<decltype(rng0)>);
CHECK(distance(rng0) == 3);
check_equal(*rng0.begin(), {P{1, 1}, P{1, 1}});
check_equal(*next(rng0.begin()),
{P{1, 2}, P{1, 2}, P{1, 2}, P{1, 2}, P{2, 2}, P{2, 2}});
check_equal(*next(rng0.begin(), 2), {P{2, 3}, P{2, 3}, P{2, 3}, P{2, 3}});
auto rng1 = v | views::chunk_by([](P p0, P p1) { return p0.first == p1.first; });
CPP_assert(forward_range<decltype(rng1)>);
CPP_assert(!bidirectional_range<decltype(rng1)>);
CHECK(distance(rng1) == 2);
check_equal(*rng1.begin(),
{P{1, 1}, P{1, 1}, P{1, 2}, P{1, 2}, P{1, 2}, P{1, 2}});
check_equal(*next(rng1.begin()),
{P{2, 2}, P{2, 2}, P{2, 3}, P{2, 3}, P{2, 3}, P{2, 3}});
}
{
ForwardIterator<std::vector<P>::iterator> b{v.begin()};
auto rng0 = views::counted(b, v.size()) |
views::chunk_by([](P p0, P p1) { return p0.second == p1.second; });
CPP_assert(forward_range<decltype(rng0)>);
CPP_assert(!bidirectional_range<decltype(rng0)>);
CHECK(distance(rng0) == 3);
check_equal(*rng0.begin(), {P{1, 1}, P{1, 1}});
check_equal(*next(rng0.begin()),
{P{1, 2}, P{1, 2}, P{1, 2}, P{1, 2}, P{2, 2}, P{2, 2}});
check_equal(*next(rng0.begin(), 2), {P{2, 3}, P{2, 3}, P{2, 3}, P{2, 3}});
auto rng1 = views::counted(b, v.size()) |
views::chunk_by([](P p0, P p1) { return p0.first == p1.first; });
CPP_assert(forward_range<decltype(rng1)>);
CPP_assert(!bidirectional_range<decltype(rng1)>);
CHECK(distance(rng1) == 2);
check_equal(*rng1.begin(),
{P{1, 1}, P{1, 1}, P{1, 2}, P{1, 2}, P{1, 2}, P{1, 2}});
check_equal(*next(rng1.begin()),
{P{2, 2}, P{2, 2}, P{2, 3}, P{2, 3}, P{2, 3}, P{2, 3}});
}
{
int a[] = {0, 1, 2, 3, 4, 5};
auto rng = a | views::remove_if([](int n) { return n % 2 == 0; }) |
views::chunk_by([](int, int) { return true; });
check_equal(*rng.begin(), {1, 3, 5});
}
{
std::vector<int> v2{0, 1, 2, 6, 8, 10, 15, 17, 18, 29};
auto rng0 = ranges::views::chunk_by(v2, [](int i, int j) { return j - i < 3; });
check_equal(*rng0.begin(), {0, 1, 2});
check_equal(*next(rng0.begin()), {6, 8, 10});
check_equal(*next(rng0.begin(), 2), {15, 17, 18});
check_equal(*next(rng0.begin(), 3), {29});
CHECK(distance(rng0) == 4);
}
{
std::vector<int> v3{1, 2, 3, 4, 5};
int count_invoc = 0;
auto rng = views::chunk_by(v3, [&](int, int) {
++count_invoc;
return false;
});
CHECK(distance(rng) == 5);
CHECK(count_invoc == 4);
auto it = rng.begin();
check_equal(*it, {1});
check_equal(*++it, {2});
check_equal(*++it, {3});
check_equal(*++it, {4});
check_equal(*++it, {5});
// 7, not 8, because caching in begin()
CHECK(count_invoc == 7);
}
{
std::vector<int> v4 = {2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 6, 0, 1, 2, 3, 0};
auto rng = v4 | views::chunk_by(std::less<>{});
CHECK(distance(rng) == 4);
check_equal(*rng.begin(), {2, 3, 4, 5});
check_equal(*next(rng.begin()), {0, 1, 2, 3, 4, 5, 6});
check_equal(*next(rng.begin(), 2), {0, 1, 2, 3});
check_equal(*next(rng.begin(), 3), {0});
}
{
std::vector<int> v5 = {0, 1, 2};
auto rng = views::cycle(v5) | views::take(6) | views::chunk_by(std::less<>{});
CHECK(distance(rng) == 2);
check_equal(*rng.begin(), v5);
check_equal(*next(rng.begin()), v5);
}
{
std::vector<int> e;
auto rng = e | views::chunk_by(std::less<>{});
CHECK(distance(rng) == 0);
}
{
std::vector<int> single{2};
auto rng = single | views::chunk_by([](int, int) -> bool { throw 0; });
CHECK(distance(rng) == 1);
check_equal(*rng.begin(), {2});
}
{
std::vector<int> v6 = {3, 6, 9, 4, 5, 0, 3, 2};
auto rng = v6 | views::chunk_by(std::less<>{});
check_equal(*rng.begin(), {3, 6, 9});
check_equal(*next(rng.begin()), {4, 5});
check_equal(*next(rng.begin(), 2), {0, 3});
check_equal(*next(rng.begin(), 3), {2});
CHECK(distance(rng) == 4);
}
return test_result();
}
|
