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
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++03, c++11, c++14, c++17
// friend constexpr void iter_swap(const inner-iterator& x, const inner-iterator& y)
// noexcept(noexcept(ranges::iter_swap(x.i_.<current>, y.i_.<current>)))
// requires indirectly_swappable<iterator_t<Base>>;
#include <ranges>
#include <cassert>
#include <type_traits>
#include <utility>
#include "../types.h"
namespace adl {
template <bool IsNoexcept = false>
struct MaybeNoexceptIterator {
using value_type = int;
using difference_type = ptrdiff_t;
value_type* ptr_ = nullptr;
int* iter_swap_invocations_ = nullptr;
constexpr MaybeNoexceptIterator() = default;
constexpr explicit MaybeNoexceptIterator(int& iter_swaps) : iter_swap_invocations_(&iter_swaps) {}
value_type& operator*() const { return *ptr_; }
MaybeNoexceptIterator& operator++() { ++ptr_; return *this; }
MaybeNoexceptIterator operator++(int) {
MaybeNoexceptIterator prev = *this;
++ptr_;
return prev;
}
MaybeNoexceptIterator& operator--() { --ptr_; return *this; }
MaybeNoexceptIterator operator--(int) {
MaybeNoexceptIterator prev = *this;
--ptr_;
return prev;
}
constexpr friend void iter_swap(MaybeNoexceptIterator a, MaybeNoexceptIterator) noexcept(IsNoexcept) {
if (a.iter_swap_invocations_) {
++(*a.iter_swap_invocations_);
}
}
friend bool operator==(const MaybeNoexceptIterator& lhs, const MaybeNoexceptIterator& rhs) {
return lhs.ptr_ == rhs.ptr_;
}
};
template <bool IsNoexcept = false>
struct View : std::ranges::view_base {
int* iter_swaps = nullptr;
constexpr View() = default;
constexpr View(int& iter_swap_invocations) : iter_swaps(&iter_swap_invocations) {
}
constexpr adl::MaybeNoexceptIterator<IsNoexcept> begin() {
return adl::MaybeNoexceptIterator<IsNoexcept>(*iter_swaps);
}
constexpr adl::MaybeNoexceptIterator<IsNoexcept> end() {
return adl::MaybeNoexceptIterator<IsNoexcept>(*iter_swaps);
}
};
} // namespace adl
constexpr bool test() {
// Can use `iter_swap` with `inner-iterator`; `View` is a forward range.
{
// Non-const iterator.
{
SplitViewDiff v("abc def", " ");
auto segment = *v.begin();
auto i1 = segment.begin();
auto i2 = i1++;
static_assert(std::is_void_v<decltype(iter_swap(i1, i2))>);
assert(*i1 == 'b');
assert(*i2 == 'a');
iter_swap(i1, i2);
assert(*i1 == 'a');
assert(*i2 == 'b');
// Note that `iter_swap` swaps characters in the actual underlying range.
assert(*v.base().begin() == 'b');
}
// Const iterator.
{
SplitViewDiff v("abc def", " ");
auto segment = *v.begin();
auto i1 = segment.begin();
const auto i2 = i1++;
static_assert(std::is_void_v<decltype(iter_swap(i1, i2))>);
static_assert(std::is_void_v<decltype(iter_swap(i2, i2))>);
assert(*i1 == 'b');
assert(*i2 == 'a');
iter_swap(i1, i2);
assert(*i1 == 'a');
assert(*i2 == 'b');
assert(*v.base().begin() == 'b');
}
}
// Can use `iter_swap` with `inner-iterator`; `View` is an input range.
{
// Non-const iterator.
{
// Iterators belong to the same view.
{
SplitViewInput v("abc def", ' ');
auto segment = *v.begin();
auto i1 = segment.begin();
auto i2 = i1;
++i1;
static_assert(std::is_void_v<decltype(iter_swap(i1, i2))>);
assert(*i1 == 'b');
// For an input view, all inner iterators are essentially thin proxies to the same underlying iterator.
assert(*i2 == 'b');
iter_swap(i1, i2);
assert(*i1 == 'b');
assert(*i2 == 'b');
}
// Iterators belong to different views.
{
SplitViewInput v1("abc def", ' ');
auto val1 = *v1.begin();
SplitViewInput v2 = v1;
auto val2 = *v2.begin();
auto i1 = val1.begin();
auto i2 = val2.begin();
++i1;
assert(*i1 == 'b');
assert(*i2 == 'a');
iter_swap(i1, i2);
assert(*i1 == 'a');
assert(*i2 == 'b');
}
}
// Const iterator.
{
SplitViewInput v("abc def", ' ');
auto segment = *v.begin();
const auto i1 = segment.begin();
const auto i2 = i1;
static_assert(std::is_void_v<decltype(iter_swap(i1, i2))>);
assert(*i1 == 'a');
assert(*i2 == 'a');
iter_swap(i1, i2);
assert(*i1 == 'a');
assert(*i2 == 'a');
}
}
// Ensure the `iter_swap` customization point is being used.
{
int iter_swap_invocations = 0;
adl::View<> input(iter_swap_invocations);
std::ranges::lazy_split_view<adl::View<>, adl::View<>> v(input, adl::View<>());
auto segment = *v.begin();
auto i = segment.begin();
iter_swap(i, i);
assert(iter_swap_invocations == 1);
}
// Check the `noexcept` specification.
{
{
using ThrowingSplitView = std::ranges::lazy_split_view<adl::View<false>, adl::View<false>>;
using ThrowingValueType = std::ranges::iterator_t<ThrowingSplitView>::value_type;
using ThrowingIter = std::ranges::iterator_t<ThrowingValueType>;
ASSERT_NOT_NOEXCEPT(std::ranges::iter_swap(
std::declval<adl::MaybeNoexceptIterator<false>>(),
std::declval<adl::MaybeNoexceptIterator<false>>()));
ASSERT_NOT_NOEXCEPT(iter_swap(std::declval<ThrowingIter>(), std::declval<ThrowingIter>()));
}
{
using NoexceptSplitView = std::ranges::lazy_split_view<adl::View<true>, adl::View<true>>;
using NoexceptValueType = std::ranges::iterator_t<NoexceptSplitView>::value_type;
using NoexceptIter = std::ranges::iterator_t<NoexceptValueType>;
ASSERT_NOEXCEPT(std::ranges::iter_swap(
std::declval<adl::MaybeNoexceptIterator<true>>(),
std::declval<adl::MaybeNoexceptIterator<true>>()));
ASSERT_NOEXCEPT(iter_swap(std::declval<NoexceptIter>(), std::declval<NoexceptIter>()));
}
}
return true;
}
int main(int, char**) {
test();
static_assert(test());
return 0;
}
|
