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
|
// Range v3 library
//
// Copyright Eric Niebler 2017-present
//
// 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/all.hpp>
#include <range/v3/view/ref.hpp>
#include <range/v3/view/subrange.hpp>
#include "../simple_test.hpp"
#include "../test_utils.hpp"
#include "../test_iterators.hpp"
CPP_template(class Rng)(
requires ranges::range<Rng>)
ranges::borrowed_subrange_t<Rng> algorithm(Rng &&rng);
struct Base {};
struct Derived : Base {};
int main()
{
using namespace ranges;
std::vector<int> vi{1,2,3,4};
////////////////////////////////////////////////////////////////////////////
// borrowed_subrange_t tests:
// lvalues are ReferenceableRanges and do not dangle:
CPP_assert(same_as<subrange<int*>,
decltype(::algorithm(std::declval<int(&)[42]>()))>);
CPP_assert(same_as<subrange<std::vector<int>::iterator>,
decltype(::algorithm(vi))>);
// subrange and ref_view are ReferenceableRanges and do not dangle:
CPP_assert(same_as<subrange<int*>,
decltype(::algorithm(std::declval<subrange<int*>>()))>);
CPP_assert(same_as<subrange<int*>,
decltype(::algorithm(std::declval<ref_view<int[42]>>()))>);
// non-ReferenceableRange rvalue ranges dangle:
CPP_assert(same_as<dangling,
decltype(::algorithm(std::declval<std::vector<int>>()))>);
CPP_assert(same_as<dangling,
decltype(::algorithm(std::move(vi)))>);
// Test that slicing conversions are not allowed.
CPP_assert(constructible_from<subrange<Base*, Base*>, Base*, Base*>);
CPP_assert(!constructible_from<subrange<Base*, Base*>, Derived*, Derived*>);
CPP_assert(constructible_from<subrange<const Base*, const Base*>, Base*, Base*>);
CPP_assert(!constructible_from<subrange<const Base*, const Base*>, Derived*, Derived*>);
CPP_assert(!constructible_from<subrange<Base*, Base*>, subrange<Derived*, Derived*>>);
CPP_assert(constructible_from<subrange<Base*, unreachable_sentinel_t>, Base*, unreachable_sentinel_t>);
CPP_assert(!constructible_from<subrange<Base*, unreachable_sentinel_t>, Derived*, unreachable_sentinel_t>);
CPP_assert(constructible_from<subrange<const Base*, unreachable_sentinel_t>, Base*, unreachable_sentinel_t>);
CPP_assert(!constructible_from<subrange<const Base*, unreachable_sentinel_t>, Derived*, unreachable_sentinel_t>);
CPP_assert(!constructible_from<subrange<Base*, unreachable_sentinel_t>, subrange<Derived*, unreachable_sentinel_t>>);
CPP_assert(constructible_from<subrange<Base*, Base*, subrange_kind::sized>, Base*, Base*, std::size_t>);
CPP_assert(!constructible_from<subrange<Base*, Base*, subrange_kind::sized>, Derived*, Base*, std::size_t>);
CPP_assert(constructible_from<subrange<const Base*, const Base*, subrange_kind::sized>, Base*, const Base*, std::size_t>);
CPP_assert(!constructible_from<subrange<const Base*, const Base*, subrange_kind::sized>, Derived*, const Base*, std::size_t>);
CPP_assert(!constructible_from<subrange<Base*, Base*, subrange_kind::sized>, subrange<Derived*, Base*>, std::size_t>);
CPP_assert(convertible_to<subrange<Base*, Base*>, std::pair<const Base*, const Base*>>);
CPP_assert(!convertible_to<subrange<Derived*, Derived*>, std::pair<Base*, Base*>>);
subrange<std::vector<int>::iterator> r0 {vi.begin(), vi.end()};
static_assert(std::tuple_size<decltype(r0)>::value == 2, "");
CPP_assert(same_as<std::vector<int>::iterator,
std::tuple_element<0, decltype(r0)>::type>);
CPP_assert(same_as<std::vector<int>::iterator,
std::tuple_element<1, decltype(r0)>::type>);
CPP_assert(sized_range<decltype(r0)>);
CHECK(r0.size() == 4u);
CHECK(r0.begin() == vi.begin());
CHECK(get<0>(r0) == vi.begin());
CHECK(r0.end() == vi.end());
CHECK(get<1>(r0) == vi.end());
r0 = r0.next();
CHECK(r0.size() == 3u);
{
subrange<std::vector<int>::iterator> rng {vi.begin(), vi.end(), ranges::size(vi)};
CHECK(rng.size() == 4u);
CHECK(rng.begin() == vi.begin());
CHECK(rng.end() == vi.end());
}
std::pair<std::vector<int>::iterator, std::vector<int>::iterator> p0 = r0;
CHECK(p0.first == vi.begin()+1);
CHECK(p0.second == vi.end());
subrange<std::vector<int>::iterator, unreachable_sentinel_t> r1 { r0.begin(), {} };
static_assert(std::tuple_size<decltype(r1)>::value == 2, "");
CPP_assert(same_as<std::vector<int>::iterator,
std::tuple_element<0, decltype(r1)>::type>);
CPP_assert(same_as<unreachable_sentinel_t,
std::tuple_element<1, decltype(r1)>::type>);
CPP_assert(view_<decltype(r1)>);
CPP_assert(!sized_range<decltype(r1)>);
CHECK(r1.begin() == vi.begin()+1);
r1.end() = unreachable;
r0 = r0.next();
++r0.begin();
CHECK(r0.begin() == vi.begin()+2);
CHECK(r0.size() == 2u);
r0 = {r0.begin(), --r0.end()}; // --r0.end();
CHECK(r0.end() == vi.end()-1);
CHECK(r0.size() == 1u);
CHECK(r0.front() == 3);
CHECK(r0.back() == 3);
std::pair<std::vector<int>::iterator, unreachable_sentinel_t> p1 = r1;
CHECK(p1.first == vi.begin()+1);
std::list<int> li{1,2,3,4};
using LI = std::list<int>::iterator;
subrange<LI, LI, subrange_kind::sized> l0 {li.begin(), li.end(), li.size()};
CPP_assert(view_<decltype(l0)> && sized_range<decltype(l0)>);
CHECK(l0.begin() == li.begin());
CHECK(l0.end() == li.end());
CHECK(l0.size() == li.size());
l0 = l0.next();
CHECK(l0.begin() == next(li.begin()));
CHECK(l0.end() == li.end());
CHECK(l0.size() == li.size() - 1u);
l0 = views::all(li);
subrange<std::list<int>::iterator> l1 = l0;
CPP_assert(!sized_range<decltype(l1)>);
CHECK(l1.begin() == li.begin());
CHECK(l1.end() == li.end());
#if RANGES_CXX_DEDUCTION_GUIDES >= RANGES_CXX_DEDUCTION_GUIDES_17
#if defined(__clang__) && __clang_major__ < 6
// Workaround https://bugs.llvm.org/show_bug.cgi?id=33314
RANGES_DIAGNOSTIC_PUSH
RANGES_DIAGNOSTIC_IGNORE_UNDEFINED_FUNC_TEMPLATE
#endif
{
subrange s0{vi.begin(), vi.end()};
subrange s1{li.begin(), li.end()};
CPP_assert(same_as<decltype(r0), decltype(s0)>);
CPP_assert(same_as<decltype(l1), decltype(s1)>);
}
{
subrange s0{vi.begin(), vi.end(), ranges::size(vi)};
subrange s1{li.begin(), li.end(), ranges::size(li)};
CPP_assert(same_as<decltype(r0), decltype(s0)>);
CPP_assert(same_as<decltype(l0), decltype(s1)>);
}
{
subrange s0{vi};
subrange s1{li};
subrange s2{views::all(vi)};
subrange s3{views::all(li)};
CPP_assert(same_as<decltype(r0), decltype(s0)>);
CPP_assert(same_as<decltype(l0), decltype(s1)>);
CPP_assert(same_as<decltype(r0), decltype(s2)>);
CPP_assert(same_as<decltype(l0), decltype(s3)>);
}
{
subrange s0{r0};
subrange s1{l0};
subrange s2{l1};
CPP_assert(same_as<decltype(r0), decltype(s0)>);
CPP_assert(same_as<decltype(l0), decltype(s1)>);
CPP_assert(same_as<decltype(l1), decltype(s2)>);
}
{
subrange s0{vi, ranges::size(vi)};
subrange s1{li, ranges::size(li)};
subrange s2{views::all(vi), ranges::size(vi)};
subrange s3{views::all(li), ranges::size(li)};
CPP_assert(same_as<decltype(r0), decltype(s0)>);
CPP_assert(same_as<decltype(l0), decltype(s1)>);
CPP_assert(same_as<decltype(r0), decltype(s2)>);
CPP_assert(same_as<decltype(l0), decltype(s3)>);
}
{
subrange s0{r0, size(r0)};
subrange s1{l0, size(l0)};
subrange s2{l1, size(l0)};
CPP_assert(same_as<decltype(r0), decltype(s0)>);
CPP_assert(same_as<decltype(l0), decltype(s1)>);
CPP_assert(same_as<decltype(l0), decltype(s2)>);
}
#if defined(__clang__) && __clang_major__ < 6
RANGES_DIAGNOSTIC_POP
#endif // clang bug workaround
#endif // use deduction guides
return ::test_result();
}
|
